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	add some missing externals	2006-06-28 01:16:06 +00:00
IPA	Change the callgraph representation to store the callsite along with the	2006-07-12 18:29:36 +00:00
AliasAnalysis.cpp	For PR780:	2006-06-07 22:00:26 +00:00
AliasAnalysisCounter.cpp
AliasAnalysisEvaluator.cpp
AliasSetTracker.cpp	Handle alias sets that have been unified, and thus can have other references	2006-06-27 23:56:13 +00:00
BasicAliasAnalysis.cpp	Use hidden visibility to make symbols in an anonymous namespace get	2006-06-28 23:17:24 +00:00
CFGPrinter.cpp	For PR801:	2006-06-27 16:49:46 +00:00
ConstantFolding.cpp	Constant fold sqrtf	2006-06-17 18:17:52 +00:00
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	For PR780:	2006-06-07 22:00:26 +00:00
ProfileInfo.cpp
ProfileInfoLoader.cpp
ProfileInfoLoaderPass.cpp
ScalarEvolution.cpp	Use hidden visibility to make symbols in an anonymous namespace get	2006-06-28 23:17:24 +00:00
ScalarEvolutionExpander.cpp
Trace.cpp
ValueNumbering.cpp	For PR780:	2006-06-07 22:00:26 +00:00