Vikram S. Adve 96b21c1054 An explicit representation of dependence graphs, and a pass that ... computes a dependence graph for data dependences on memory locations using interprocedural Mod/Ref information. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@4957 91177308-0d34-0410-b5e6-96231b3b80d8		2002-12-08 13:26:29 +00:00
..
BottomUpClosure.cpp	Fix logical error in TD pass: we should clear Mod/Ref bits of each caller	2002-11-27 17:41:13 +00:00
DataStructure.cpp	Fix several related bugs in DSNode::mergeWith() caused by the	2002-12-06 21:15:21 +00:00
DataStructureStats.cpp	Add hack to only consider indirect calls indirect if they do more than cast	2002-11-17 22:17:12 +00:00
IPModRef.cpp	(1) Bug fix that was causing nodes with dangling references to be freed.	2002-11-27 17:37:46 +00:00
Local.cpp	Two bug fixes:	2002-12-06 21:17:10 +00:00
Makefile	*** empty log message ***	2002-07-23 17:52:38 +00:00
MemoryDepAnalysis.cpp	An explicit representation of dependence graphs, and a pass that	2002-12-08 13:26:29 +00:00
Printer.cpp	Add stats	2002-11-18 21:42:45 +00:00
Steensgaard.cpp	eliminate the ability to remove global nodes from deadNodeElminate... for now.	2002-11-09 22:07:02 +00:00
TopDownClosure.cpp	Fix logical error in TD pass: we should clear Mod/Ref bits of each caller	2002-11-27 17:41:13 +00:00