Chris Lattner 0e74412cee * First try at implementing TD pass this does not merge global nodes yet, ... among other things. * Significant rewrite of TD pass to avoid potentially N^2 algorithms if possible. It is still not complete, but at least it's checked in now. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@4215 91177308-0d34-0410-b5e6-96231b3b80d8		2002-10-17 04:26:54 +00:00
..
BottomUpClosure.cpp	* Add data structures and code to track the call sites for each function	2002-10-17 04:24:08 +00:00
DataStructure.cpp	Prune function nodes that are no longer referenced due to inlining	2002-10-03 21:55:28 +00:00
Local.cpp	DataStructure.h doesn't include DSGraph.h	2002-10-02 22:14:38 +00:00
Makefile	*** empty log message ***	2002-07-23 17:52:38 +00:00
Printer.cpp	Reenable printing of TD analysis	2002-10-17 04:24:30 +00:00
Steensgaard.cpp	DataStructure.h doesn't include DSGraph.h	2002-10-02 22:14:38 +00:00
TopDownClosure.cpp	* First try at implementing TD pass this does not merge global nodes yet,	2002-10-17 04:26:54 +00:00