diff options
author | Evan Cheng <evan.cheng@apple.com> | 2008-03-04 00:41:45 +0000 |
---|---|---|
committer | Evan Cheng <evan.cheng@apple.com> | 2008-03-04 00:41:45 +0000 |
commit | 567d2e5b5765efee00dc427479d0289a0c01515d (patch) | |
tree | 5b5b63699ab26f8768c28d80e6c9c9642a66085c /llvm/lib/CodeGen/SelectionDAG/SelectionDAG.cpp | |
parent | 33ff36321eefdbd28d7c6405bf77e1e80f11d0d5 (diff) | |
download | bcm5719-llvm-567d2e5b5765efee00dc427479d0289a0c01515d.tar.gz bcm5719-llvm-567d2e5b5765efee00dc427479d0289a0c01515d.zip |
Rename isOperand() to isOperandOf() (and other similar methods). It always confuses me.
llvm-svn: 47872
Diffstat (limited to 'llvm/lib/CodeGen/SelectionDAG/SelectionDAG.cpp')
-rw-r--r-- | llvm/lib/CodeGen/SelectionDAG/SelectionDAG.cpp | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/llvm/lib/CodeGen/SelectionDAG/SelectionDAG.cpp b/llvm/lib/CodeGen/SelectionDAG/SelectionDAG.cpp index 6f8f4818d2f..89376222268 100644 --- a/llvm/lib/CodeGen/SelectionDAG/SelectionDAG.cpp +++ b/llvm/lib/CodeGen/SelectionDAG/SelectionDAG.cpp @@ -3674,9 +3674,9 @@ bool SDNode::hasAnyUseOfValue(unsigned Value) const { } -/// isOnlyUse - Return true if this node is the only use of N. +/// isOnlyUseOf - Return true if this node is the only use of N. /// -bool SDNode::isOnlyUse(SDNode *N) const { +bool SDNode::isOnlyUseOf(SDNode *N) const { bool Seen = false; for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) { SDNode *User = *I; @@ -3691,14 +3691,14 @@ bool SDNode::isOnlyUse(SDNode *N) const { /// isOperand - Return true if this node is an operand of N. /// -bool SDOperand::isOperand(SDNode *N) const { +bool SDOperand::isOperandOf(SDNode *N) const { for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) if (*this == N->getOperand(i)) return true; return false; } -bool SDNode::isOperand(SDNode *N) const { +bool SDNode::isOperandOf(SDNode *N) const { for (unsigned i = 0, e = N->NumOperands; i != e; ++i) if (this == N->OperandList[i].Val) return true; @@ -3751,11 +3751,11 @@ static void findPredecessor(SDNode *N, const SDNode *P, bool &found, } } -/// isPredecessor - Return true if this node is a predecessor of N. This node +/// isPredecessorOf - Return true if this node is a predecessor of N. This node /// is either an operand of N or it can be reached by recursively traversing /// up the operands. /// NOTE: this is an expensive method. Use it carefully. -bool SDNode::isPredecessor(SDNode *N) const { +bool SDNode::isPredecessorOf(SDNode *N) const { SmallPtrSet<SDNode *, 32> Visited; bool found = false; findPredecessor(N, this, found, Visited); |