Chris Lattner 9e4b15b1a1 New API for traversing graph ... git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@5430 91177308-0d34-0410-b5e6-96231b3b80d8		2003-01-29 21:09:59 +00:00
..
DataStructure	New API for traversing graph	2003-01-29 21:09:59 +00:00
AliasAnalysis.h	Make query operations non-const to allow demand-driven analyses.	2002-11-06 17:17:55 +00:00
AliasSetTracker.h
BasicAliasAnalysis.h	Make query operations non-const to allow demand-driven analyses.	2002-11-06 17:17:55 +00:00
CallGraph.h	Make sure to print indirect node again	2002-12-06 06:40:00 +00:00
ConstantsScanner.h	Don't #include <Support/*>, #include "Support/*"	2002-10-28 02:11:53 +00:00
DataStructure.h	No need to specify the class if the method is within the class declaration.	2002-12-12 05:28:39 +00:00
DependenceGraph.h	Make a release build compile. This field is not really an enum, it's really a bitfield	2002-12-12 05:31:26 +00:00
Dominators.h	Add interface to update domfrontier info, thanks to Casey Carter for impl	2002-10-31 02:39:48 +00:00
DSGraph.h	* Eliminate boolean arguments in favor of using enums	2003-01-23 22:06:33 +00:00
DSGraphTraits.h	Templatize graph traits and iterator to work with const and non-const clients	2002-11-18 21:42:19 +00:00
DSNode.h	New API for traversing graph	2003-01-29 21:09:59 +00:00
DSSupport.h	New API for traversing graph	2003-01-29 21:09:59 +00:00
Expressions.h
FindUnsafePointerTypes.h
FindUsedTypes.h
InductionVariable.h
InstForest.h
Interval.h
IntervalIterator.h
IntervalPartition.h	Fixed spelling of `propagation'.	2002-10-29 22:55:11 +00:00
IPModRef.h	Stronger assertion in getNodeId(): node id must exist in the map.	2002-12-06 21:19:07 +00:00
LoadValueNumbering.h
LoopInfo.h
MemoryDepAnalysis.h	An explicit representation of dependence graphs, and a pass that	2002-12-08 13:26:29 +00:00
PgmDependenceGraph.h	Iterator that enumerates the ProgramDependenceGraph (PDG) for a function,	2002-12-08 14:13:19 +00:00
PostDominators.h
SlotCalculator.h
ValueNumbering.h
Verifier.h