Devang Patel 8d3ab25335 Use iterative algorith to assign DFS number. This reduces ... call stack depth. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@30575 91177308-0d34-0410-b5e6-96231b3b80d8		2006-09-22 01:05:33 +00:00
..
DataStructure
AliasAnalysis.h	For PR780:	2006-07-26 16:18:00 +00:00
AliasSetTracker.h
CallGraph.h	Change the callgraph representation to store the callsite along with the	2006-07-12 18:29:36 +00:00
CFGPrinter.h
ConstantFolding.h
ConstantsScanner.h
Dominators.h	Add ability to remove nodes from DominatorTree, for when a BasicBlock	2006-09-12 00:18:28 +00:00
ET-Forest.h	Use iterative algorith to assign DFS number. This reduces	2006-09-22 01:05:33 +00:00
FindUsedTypes.h
Interval.h
IntervalIterator.h
IntervalPartition.h
LoadValueNumbering.h
LoopInfo.h	Do not rely on std::sort and std::erase to get list of unique	2006-08-29 22:29:16 +00:00
Passes.h
PostDominators.h
ProfileInfo.h
ProfileInfoLoader.h
ProfileInfoTypes.h
ScalarEvolution.h
ScalarEvolutionExpander.h
ScalarEvolutionExpressions.h
Trace.h
ValueNumbering.h
Verifier.h	Change the verifier to never throw an exception. Instead verifyModule can	2006-07-06 18:00:01 +00:00