llvm-6502/lib/Analysis
Chris Lattner 69b3992154 Make Loop::getExitBlocks significantly faster for large loops. Instead of
pounding on Loop::contains (which is O(n) in the size of the loop), use a
sorted vector, which is O(log(N)) for each query.  This speeds up Duraid's
horrible testcase from ~72s to ~31s in a debug build.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@29645 91177308-0d34-0410-b5e6-96231b3b80d8
2006-08-12 05:02:03 +00:00
..
DataStructure
IPA
AliasAnalysis.cpp
AliasAnalysisCounter.cpp
AliasAnalysisEvaluator.cpp
AliasSetTracker.cpp
BasicAliasAnalysis.cpp
CFGPrinter.cpp
ConstantFolding.cpp
ConstantRange.cpp
InstCount.cpp
Interval.cpp
IntervalPartition.cpp
LoadValueNumbering.cpp
LoopInfo.cpp Make Loop::getExitBlocks significantly faster for large loops. Instead of 2006-08-12 05:02:03 +00:00
Makefile
PostDominators.cpp
ProfileInfo.cpp
ProfileInfoLoader.cpp
ProfileInfoLoaderPass.cpp
ScalarEvolution.cpp
ScalarEvolutionExpander.cpp
Trace.cpp
ValueNumbering.cpp