Chris Lattner 5f07a8b312 - Eliminate provably non-pointer nodes from graphs. ... This helps a lot of testcases, for example: New Time New #Nodes Old Time Old #Nodes 254.gap: 91.1024 21605 91.1397 22657 povray31: 2.7807 8613 3.0152 10338 255.vortex: 1.2034 8153 1.2172 8822 moria: .6756 3150 .7054 3877 300.twolf: .1652 2010 .1851 3270 Typically, testcases which use long and ulong integers a lot get better, f.e. povray above. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@5566 91177308-0d34-0410-b5e6-96231b3b80d8		2003-02-14 06:28:00 +00:00
..
DataStructure	- Eliminate provably non-pointer nodes from graphs.	2003-02-14 06:28:00 +00:00
IPA	Implement optimization for direct function call case. This dramatically	2003-02-05 21:59:58 +00:00
LiveVar	Rename llvm/Analysis/LiveVar/FunctionLiveVarInfo.h -> llvm/CodeGen/FunctionLiveVarInfo.h	2003-01-14 23:05:08 +00:00
AliasAnalysis.cpp	Implement knowledge in BasicAA that &A->field != &A and (P+1) != P	2003-02-09 19:38:11 +00:00
AliasAnalysisCounter.cpp	Allow counting multiple passes, and print the pass name counted	2003-02-07 20:39:17 +00:00
AliasAnalysisEvaluator.cpp	Rename options	2003-02-11 23:12:09 +00:00
AliasSetTracker.cpp
ConstantRange.cpp
Expressions.cpp
InductionVariable.cpp	Fix warning	2002-11-09 00:49:43 +00:00
InstCount.cpp	Add total instruction, bb, & function counts	2002-12-07 23:24:24 +00:00
Interval.cpp
IntervalPartition.cpp	Fix spelling of `propagate'.	2002-10-29 23:06:16 +00:00
LoadValueNumbering.cpp
LoopInfo.cpp
Makefile
PostDominators.cpp
PrintSCC.cpp	Simple passes that print out SCCs in the CFGs or in the CallGraph of a module.	2002-11-04 14:20:22 +00:00
ValueNumbering.cpp	Use new isCommutative interface, which gives us SetEQ and SetNE for free.	2002-10-31 04:20:07 +00:00