From 0b62f95ea81d8954c21a2ae54602be10e5e1bb7e Mon Sep 17 00:00:00 2001 From: Dan Gohman Date: Wed, 20 Oct 2010 22:02:58 +0000 Subject: [PATCH] Fix comments; the type graph is currently a tree, not a DAG. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@116954 91177308-0d34-0410-b5e6-96231b3b80d8 --- lib/Analysis/TypeBasedAliasAnalysis.cpp | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/lib/Analysis/TypeBasedAliasAnalysis.cpp b/lib/Analysis/TypeBasedAliasAnalysis.cpp index 4cdb5b02079..787db7351aa 100644 --- a/lib/Analysis/TypeBasedAliasAnalysis.cpp +++ b/lib/Analysis/TypeBasedAliasAnalysis.cpp @@ -52,7 +52,7 @@ namespace { /// getNode - Get the MDNode for this TBAANode. const MDNode *getNode() const { return Node; } - /// getParent - Get this TBAANode's Alias DAG parent. + /// getParent - Get this TBAANode's Alias tree parent. TBAANode getParent() const { if (Node->getNumOperands() < 2) return TBAANode(); @@ -141,7 +141,7 @@ TypeBasedAliasAnalysis::alias(const Location &LocA, // Keep track of the root node for A and B. TBAANode RootA, RootB; - // Climb the DAG from A to see if we reach B. + // Climb the tree from A to see if we reach B. for (TBAANode T(AM); ; ) { if (T.getNode() == BM) // B is an ancestor of A. @@ -153,7 +153,7 @@ TypeBasedAliasAnalysis::alias(const Location &LocA, break; } - // Climb the DAG from B to see if we reach A. + // Climb the tree from B to see if we reach A. for (TBAANode T(BM); ; ) { if (T.getNode() == AM) // A is an ancestor of B. -- 2.34.1