RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2025-01-14 05:42:45 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Fix comments; the type graph is currently a tree, not a DAG.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@116954 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Dan Gohman 2010-10-20 22:02:58 +00:00
parent 7ab2af03d8
commit 0b62f95ea8
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
lib/Analysis/TypeBasedAliasAnalysis.cpp
View File

@ -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.