Chris Lattner a9c9c0216e Complete rewrite of BU code to use Tarjan's SCC finding algorithm to drive ... the algorithm instead of hand coded depth first iteration git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@4694 91177308-0d34-0410-b5e6-96231b3b80d8		2002-11-11 21:35:13 +00:00
..
BottomUpClosure.cpp	Complete rewrite of BU code to use Tarjan's SCC finding algorithm to drive	2002-11-11 21:35:13 +00:00
DataStructure.cpp	Mark stuff reachable by _AUX_ calls as incomplete in the BU graph	2002-11-11 03:36:55 +00:00
IPModRef.cpp	Reduce amount of work needed to compute ip/modref	2002-11-08 22:17:01 +00:00
Local.cpp	Initialize PrintAuxCalls member	2002-11-10 06:53:38 +00:00
Makefile
Printer.cpp	Print the right call set size	2002-11-11 00:01:02 +00:00
Steensgaard.cpp	eliminate the ability to remove global nodes from deadNodeElminate... for now.	2002-11-09 22:07:02 +00:00
TopDownClosure.cpp	eliminate the ability to remove global nodes from deadNodeElminate... for now.	2002-11-09 22:07:02 +00:00