Chris Lattner 0eea61863b Reimplement the BU closure to collapse all SCC graphs into a single graph. ...

Look at all of the code that gets deleted!


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@7001 91177308-0d34-0410-b5e6-96231b3b80d8

2003-06-30 05:09:58 +00:00

..

BottomUpClosure.cpp

Reimplement the BU closure to collapse all SCC graphs into a single graph.

2003-06-30 05:09:58 +00:00

DataStructure.cpp

Handle the case where OldNodeMap == &ScalarMap correctly

2003-06-30 05:09:29 +00:00

DataStructureAA.cpp

Expose must alias information for global variables, implementing: DSGraph/mustalias.ll

2003-06-29 00:54:08 +00:00

DataStructureOpt.cpp

Drop references to globals who do exist in the globals graph, but are never

2003-06-28 22:10:58 +00:00

DataStructureStats.cpp

Implement optimization for direct function call case. This dramatically

2003-02-05 21:59:58 +00:00

GraphChecker.cpp

Add support for ensuring that nodes are not incomplete

2003-06-29 22:36:15 +00:00

IPModRef.cpp

Adjust for new DSGraph API

2003-06-30 03:14:54 +00:00

Local.cpp

Do not delete the same graph multiple times when freeing memory if graphs are sharing

2003-06-30 04:53:27 +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

Add new linkage types to support a real frontend

2003-04-16 20:28:45 +00:00

PgmDependenceGraph.cpp

Eliminate unnecessary ->get calls that are now automatically handled.

2003-05-29 15:12:27 +00:00

Printer.cpp

Revamp DSGraphs so that they can support multiple functions in the same

2003-06-30 03:15:25 +00:00

Steensgaard.cpp

Move usages of explicit hash_* datastructures to use typedefs

2003-06-30 03:36:09 +00:00

TopDownClosure.cpp

Remove dead method

2003-06-30 04:53:39 +00:00