Changes in directory llvm-poolalloc/include/dsa:
DSGraph.h updated: 1.110.2.4 -> 1.110.2.4.2.1 --- Log message: Add recursive unknown --- Diffs of the changes: (+2 -0) DSGraph.h | 2 ++ 1 files changed, 2 insertions(+) Index: llvm-poolalloc/include/dsa/DSGraph.h diff -u llvm-poolalloc/include/dsa/DSGraph.h:1.110.2.4 llvm-poolalloc/include/dsa/DSGraph.h:1.110.2.4.2.1 --- llvm-poolalloc/include/dsa/DSGraph.h:1.110.2.4 Wed Dec 13 15:58:18 2006 +++ llvm-poolalloc/include/dsa/DSGraph.h Wed Feb 28 11:35:41 2007 @@ -506,6 +506,8 @@ }; void markIncompleteNodes(unsigned Flags); + void markUnknownNodes(); + // removeDeadNodes - Use a reachability analysis to eliminate subgraphs that // are unreachable. This often occurs because the data structure doesn't // "escape" into it's caller, and thus should be eliminated from the caller's _______________________________________________ llvm-commits mailing list [email protected] http://lists.cs.uiuc.edu/mailman/listinfo/llvm-commits
