git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@116954
91177308-0d34-0410-b5e6-
96231b3b80d8
/// getNode - Get the MDNode for this TBAANode.
const MDNode *getNode() const { return Node; }
/// 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();
TBAANode getParent() const {
if (Node->getNumOperands() < 2)
return TBAANode();
// Keep track of the root node for A and B.
TBAANode RootA, RootB;
// 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.
for (TBAANode T(AM); ; ) {
if (T.getNode() == BM)
// B is an ancestor of A.
- // 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.
for (TBAANode T(BM); ; ) {
if (T.getNode() == AM)
// A is an ancestor of B.