RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-24 19:52:54 +01:00
Code Issues Projects Releases Wiki Activity

No need to use std::distance. We can just count the number of operands

Browse Source 
much more cheaply.

llvm-svn: 52990
This commit is contained in:
Owen Anderson 2008-07-01 22:34:11 +00:00
parent 0b662363f9
commit b258a71a37
1 changed files with 4 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -527,13 +527,16 @@ void SelectionDAG::RemoveDeadNode(SDNode *N, DAGUpdateListener *UpdateListener){
// Next, brutally remove the operand list. This is safe to do, as there are
// no cycles in the graph.
unsigned op_num = 0;
for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
SDNode *Operand = I->getVal();
Operand->removeUser(std::distance(N->op_begin(), I), N);
Operand->removeUser(op_num, N);
// Now that we removed this operand, see if there are no uses of it left.
if (Operand->use_empty())
DeadNodes.push_back(Operand);
op_num++;
}
if (N->OperandsNeedDelete) {
delete[] N->OperandList;