Chris Lattner 0ad9170327 Use isNull instead of getNode() to test for existence of a node, this is cheaper. ...

FIX MAJOR BUG, whereby we didn't merge null edges correctly. Correcting this
fixes poolallocation on 175.vpr, and possibly others.


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

2004-02-22 00:53:54 +00:00

..

BottomUpClosure.cpp

Instead of cloning the globals for main into the globals graph at the end of

2004-02-21 00:30:28 +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

Use isNull instead of getNode() to test for existence of a node, this is cheaper.

2004-02-22 00:53:54 +00:00

DataStructureAA.cpp

Forward method request to chained aa implementation

2004-01-30 22:20:55 +00:00

DataStructureOpt.cpp

…

DataStructureStats.cpp

…

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 two missing returns, which caused us to be very pessimistic about the

2004-02-20 23:27:09 +00:00

Makefile

…

MemoryDepAnalysis.cpp

…

Parallelize.cpp

…

PgmDependenceGraph.cpp

…

Printer.cpp

Use handy method

2004-02-21 22:27:31 +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