Chris Lattner 0321b68f6b Only clone global nodes between graphs if both graphs have the global. ... git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@11928 91177308-0d34-0410-b5e6-96231b3b80d8		2004-02-27 20:05:15 +00:00
..
BottomUpClosure.cpp	Only clone global nodes between graphs if both graphs have the global.	2004-02-27 20:05:15 +00:00
CompleteBottomUp.cpp	There is no need to merge the globals graph into the function graphs at the	2004-02-20 23:52:15 +00:00
DataStructure.cpp	Only clone global nodes between graphs if both graphs have the global.	2004-02-27 20:05:15 +00:00
DataStructureAA.cpp	Forward method request to chained aa implementation	2004-01-30 22:20:55 +00:00
DataStructureOpt.cpp	Fine-grainify namespaces for this library	2003-11-12 23:11:14 +00:00
DataStructureStats.cpp	Fine-grainify namespaces for this library	2003-11-12 23:11:14 +00:00
DSCallSiteIterator.h
GraphChecker.cpp	Add two missing returns, which caused us to be very pessimistic about the	2004-02-20 23:27:09 +00:00
IPModRef.cpp	getNodes() is gone	2004-02-07 23:57:26 +00:00
Local.cpp	ADD MORE FUNCTIONS!	2004-02-27 20:04:48 +00:00
Makefile
MemoryDepAnalysis.cpp
Parallelize.cpp	Finegrainify namespacification	2003-11-21 21:54:22 +00:00
PgmDependenceGraph.cpp
Printer.cpp	Try harder to get symbol info	2004-02-25 23:06:30 +00:00
Steensgaard.cpp	Forward method request to chained aa implementation	2004-01-30 22:20:55 +00:00
TopDownClosure.cpp	Instead of callign removeTriviallyDeadNodes on the global graph every time	2004-02-08 01:51:48 +00:00