llvm-6502/include/llvm/Analysis
Nate Begeman 442b32b5c5 Fix PR681 by using the standard Lengauer and Tarjan algorithm for dominator
set construction, rather than intersecting various std::sets.  This reduces
the memory usage for the testcase in PR681 from 496 to 26MB of ram on my
darwin system, and reduces the runtime from 32.8 to 0.8 seconds on a
2.5GHz G5.  This also enables future code sharing between Dom and PostDom
now that they share near-identical implementations.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@26707 91177308-0d34-0410-b5e6-96231b3b80d8
2006-03-11 02:20:46 +00:00
..
DataStructure Make the LLVM headers "-ansi -pedantic -Wno-long-long" clean. 2006-02-22 16:23:43 +00:00
AliasAnalysis.h Make the LLVM headers "-ansi -pedantic -Wno-long-long" clean. 2006-02-22 16:23:43 +00:00
AliasSetTracker.h
CallGraph.h Add CallGraph::getOrInsertFunction, to allow clients to update the callgraph 2006-01-14 20:01:50 +00:00
CFGPrinter.h
ConstantFolding.h
ConstantsScanner.h
Dominators.h Change ET-Forest to automatically recalculate its DFSnum's if too many slow 2006-01-14 20:55:09 +00:00
ET-Forest.h Initialize DFSnum's to -1, in case a node is not reachable. 2006-01-15 21:48:36 +00:00
FindUsedTypes.h
Interval.h
IntervalIterator.h
IntervalPartition.h
LinkAllAnalyses.h Make the LLVM headers "-ansi -pedantic -Wno-long-long" clean. 2006-02-22 16:23:43 +00:00
LoadValueNumbering.h
LoopInfo.h Change ET-Forest to automatically recalculate its DFSnum's if too many slow 2006-01-14 20:55:09 +00:00
Passes.h
PostDominators.h Fix PR681 by using the standard Lengauer and Tarjan algorithm for dominator 2006-03-11 02:20:46 +00:00
ProfileInfo.h
ProfileInfoLoader.h
ProfileInfoTypes.h
ScalarEvolution.h
ScalarEvolutionExpander.h Refactor a bunch of code into a non-inlined method 2006-02-04 09:51:33 +00:00
ScalarEvolutionExpressions.h
Trace.h
ValueNumbering.h
Verifier.h