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
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
ConstantRange.cpp
Expressions.cpp	Regularize header file comments	2003-10-13 03:32:08 +00:00
InductionVariable.cpp
InstCount.cpp
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
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
ValueNumbering.cpp