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
..
BottomUpClosure.cpp	Implement optimization for direct function call case. This dramatically	2003-02-05 21:59:58 +00:00
DataStructure.cpp	- Eliminate provably non-pointer nodes from graphs.	2003-02-14 06:28:00 +00:00
DataStructureAA.cpp	Don't bother counting alias results, allow the AliasAnalysisCounter to do that.	2003-02-07 20:39:48 +00:00
DataStructureStats.cpp	Implement optimization for direct function call case. This dramatically	2003-02-05 21:59:58 +00:00
IPModRef.cpp	Implement optimization for direct function call case. This dramatically	2003-02-05 21:59:58 +00:00
Local.cpp	Don't put integer pointers (longs) into the scalar map.	2003-02-14 04:55:58 +00:00
Makefile	*** empty log message ***	2002-07-23 17:52:38 +00:00
MemoryDepAnalysis.cpp	An explicit representation of dependence graphs, and a pass that	2002-12-08 13:26:29 +00:00
Parallelize.cpp	This file implements a pass that automatically parallelizes a program,	2002-12-10 00:43:34 +00:00
PgmDependenceGraph.cpp	Iterator that enumerates the ProgramDependenceGraph (PDG) for a function,	2002-12-08 14:13:19 +00:00
Printer.cpp	Use the new tailclip property new added to graphviz CVS to make call nodes	2003-02-13 20:14:40 +00:00
Steensgaard.cpp	Hax0r around a deficiency in the Pass infrastructure	2003-02-13 21:44:18 +00:00
TopDownClosure.cpp	Implement a "union-findy" version of DS-Analysis, which eliminates the	2003-02-11 23:11:51 +00:00