Chris Lattner cc1376078c Instead of callign removeTriviallyDeadNodes on the global graph every time ...

removeDeadNodes is called, only call it at the end of the pass being run.
This saves 1.3 seconds running DSA on 177.mesa (5.3->4.0s), which is
pretty big.  This is only possible because of the automatic garbage
collection done on forwarding nodes.

llvm-svn: 11178

2004-02-08 01:51:48 +00:00

..

BottomUpClosure.cpp

Instead of callign removeTriviallyDeadNodes on the global graph every time

2004-02-08 01:51:48 +00:00

CompleteBottomUp.cpp

Get clone flags right, so we don't build InlinedGlobals only to clear them

2004-01-27 21:50:41 +00:00

DataStructure.cpp

Instead of callign removeTriviallyDeadNodes on the global graph every time

2004-02-08 01:51:48 +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

Put all LLVM code into the llvm namespace, as per bug 109.

2003-11-11 22:41:34 +00:00

GraphChecker.cpp

getNodes() is gone, use node_begin/end instead

2004-02-07 23:58:05 +00:00

Local.cpp

Instead of callign removeTriviallyDeadNodes on the global graph every time

2004-02-08 01:51:48 +00:00

Makefile

Added LLVM copyright notice to Makefiles.

2003-10-20 22:26:57 +00:00

Printer.cpp

getNodes() is gone, use node_begin/end instead

2004-02-07 23:58:05 +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