llvm-6502/lib/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
IPA updates for recent changes 2006-03-03 01:21:36 +00:00
AliasAnalysis.cpp
AliasAnalysisCounter.cpp
AliasAnalysisEvaluator.cpp
AliasSetTracker.cpp
BasicAliasAnalysis.cpp Use autogenerated mod/ref info for intrinsics. 2006-03-09 22:31:29 +00:00
CFGPrinter.cpp
ConstantFolding.cpp
ConstantRange.cpp
InstCount.cpp
Interval.cpp
IntervalPartition.cpp
LoadValueNumbering.cpp
LoopInfo.cpp
Makefile
PostDominators.cpp Fix PR681 by using the standard Lengauer and Tarjan algorithm for dominator 2006-03-11 02:20:46 +00:00
ProfileInfo.cpp
ProfileInfoLoader.cpp
ProfileInfoLoaderPass.cpp
ScalarEvolution.cpp
ScalarEvolutionExpander.cpp
Trace.cpp
ValueNumbering.cpp