6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-01-16 14:31:59 +00:00
Code Issues Projects Releases Wiki Activity

Fix comments.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@31414 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Evan Cheng 2006-11-03 07:31:32 +00:00
parent 1a854be352
commit e6e97e66a3
2 changed files with 16 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
include/llvm/CodeGen/SelectionDAGNodes.h
View File

@ -809,13 +809,18 @@ public:
/// operation. /// operation.
bool hasNUsesOfValue(unsigned NUses, unsigned Value) const; bool hasNUsesOfValue(unsigned NUses, unsigned Value) const;
// isOnlyUse - Return true if this node is the only use of N. /// isOnlyUse - Return true if this node is the only use of N.
///
bool isOnlyUse(SDNode *N) const; bool isOnlyUse(SDNode *N) const;
// isOperand - Return true if this node is an operand of N. /// isOperand - Return true if this node is an operand of N.
///
bool isOperand(SDNode *N) const; bool isOperand(SDNode *N) const;
// isPredecessor - Return true if this node is a predecessor of N. /// isPredecessor - 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 isPredecessor(SDNode *N) const; bool isPredecessor(SDNode *N) const;
/// getNumOperands - Return the number of values used by this operation. /// getNumOperands - Return the number of values used by this operation.

11
lib/CodeGen/SelectionDAG/SelectionDAG.cpp
View File

@ -2534,7 +2534,8 @@ bool SDNode::hasNUsesOfValue(unsigned NUses, unsigned Value) const {
} }
// isOnlyUse - Return true if this node is the only use of N. /// isOnlyUse - Return true if this node is the only use of N.
///
bool SDNode::isOnlyUse(SDNode *N) const { bool SDNode::isOnlyUse(SDNode *N) const {
bool Seen = false; bool Seen = false;
for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) { for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) {
@ -2548,7 +2549,8 @@ bool SDNode::isOnlyUse(SDNode *N) const {
return Seen; return Seen;
} }
// isOperand - Return true if this node is an operand of N. /// isOperand - Return true if this node is an operand of N.
///
bool SDOperand::isOperand(SDNode *N) const { bool SDOperand::isOperand(SDNode *N) const {
for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
if (*this == N->getOperand(i)) if (*this == N->getOperand(i))
@ -2578,7 +2580,10 @@ static void findPredecessor(SDNode *N, const SDNode *P, bool &found,
} }
} }
// isPredecessor - Return true if this node is a predecessor of N. /// isPredecessor - 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::isPredecessor(SDNode *N) const {
std::set<SDNode *> Visited; std::set<SDNode *> Visited;
bool found = false; bool found = false;