Chris Lattner 50b5d71cb7 Make use of "external" depth-first iterators to avoid revisiting nodes ... multiple times. This reduces the time to construct post-dominance sets a LOT. For example, optimizing perlbmk goes from taking 12.9894s to 1.4074s. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@9091 91177308-0d34-0410-b5e6-96231b3b80d8		2003-10-13 16:36:06 +00:00
..
DataStructure	Fix spelling.	2003-10-10 17:57:28 +00:00
IPA	Regularize header file comments	2003-10-13 03:32:08 +00:00
LiveVar	Regularize header file comments	2003-10-13 03:32:08 +00:00
AliasAnalysis.cpp
AliasAnalysisCounter.cpp
AliasAnalysisEvaluator.cpp
AliasSetTracker.cpp
BasicAliasAnalysis.cpp	Fix bug: BasicAA/2003-09-19-LocalArgument.ll	2003-09-20 03:08:47 +00:00
ConstantRange.cpp	Simplify code by using ConstantInt::getRawValue instead of checking to see	2003-07-23 15:22:26 +00:00
Expressions.cpp	Regularize header file comments	2003-10-13 03:32:08 +00:00
InductionVariable.cpp	Fixed spelling and grammar.	2003-09-11 18:14:24 +00:00
InstCount.cpp	There is no reason for this to be a pass!	2003-08-29 14:43:17 +00:00
Interval.cpp	Regularize header file comments	2003-10-13 03:32:08 +00:00
IntervalPartition.cpp	Regularize header file comments	2003-10-13 03:32:08 +00:00
LoadValueNumbering.cpp	Fixed spelling and grammar.	2003-09-11 18:14:24 +00:00
LoopInfo.cpp	Regularize header file comments	2003-10-13 03:32:08 +00:00
Makefile
PostDominators.cpp	Make use of "external" depth-first iterators to avoid revisiting nodes	2003-10-13 16:36:06 +00:00
PrintSCC.cpp	Rename TarjanSCCIterator -> scc_iterator	2003-08-31 20:01:57 +00:00
ValueNumbering.cpp	Fixed spelling and grammar.	2003-09-11 18:14:24 +00:00