[llvm-commits] [llvm] r116954 - /llvm/trunk/lib/Analysis/TypeBasedAliasAnalysis.cpp

[Dan Gohman]

Author: djg
Date: Wed Oct 20 17:02:58 2010
New Revision: 116954

URL: http://llvm.org/viewvc/llvm-project?rev=116954&view=rev
Log:
Fix comments; the type graph is currently a tree, not a DAG.

Modified:
    llvm/trunk/lib/Analysis/TypeBasedAliasAnalysis.cpp

Modified: llvm/trunk/lib/Analysis/TypeBasedAliasAnalysis.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/Analysis/TypeBasedAliasAnalysis.cpp?rev=116954&r1=116953&r2=116954&view=diff
==============================================================================
--- llvm/trunk/lib/Analysis/TypeBasedAliasAnalysis.cpp (original)
+++ llvm/trunk/lib/Analysis/TypeBasedAliasAnalysis.cpp Wed Oct 20 17:02:58 2010
@@ -52,7 +52,7 @@
     /// 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 @@
   // 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 @@
       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.