forked from OSchip/llvm-project
parent
c7cd410657
commit
1e5aa12b7d
|
@ -565,10 +565,6 @@ public:
|
||||||
void ReplaceAllUsesOfValueWith(SDOperand From, SDOperand To,
|
void ReplaceAllUsesOfValueWith(SDOperand From, SDOperand To,
|
||||||
DAGUpdateListener *UpdateListener = 0);
|
DAGUpdateListener *UpdateListener = 0);
|
||||||
|
|
||||||
/// AssignNodeIds - Assign a unique node id for each node in the DAG based on
|
|
||||||
/// their allnodes order. It returns the maximum id.
|
|
||||||
unsigned AssignNodeIds();
|
|
||||||
|
|
||||||
/// AssignTopologicalOrder - Assign a unique node id for each node in the DAG
|
/// AssignTopologicalOrder - Assign a unique node id for each node in the DAG
|
||||||
/// based on their topological order. It returns the maximum id and a vector
|
/// based on their topological order. It returns the maximum id and a vector
|
||||||
/// of the SDNodes* in assigned order by reference.
|
/// of the SDNodes* in assigned order by reference.
|
||||||
|
|
|
@ -4228,17 +4228,6 @@ void SelectionDAG::ReplaceAllUsesOfValueWith(SDOperand From, SDOperand To,
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
/// AssignNodeIds - Assign a unique node id for each node in the DAG based on
|
|
||||||
/// their allnodes order. It returns the maximum id.
|
|
||||||
unsigned SelectionDAG::AssignNodeIds() {
|
|
||||||
unsigned Id = 0;
|
|
||||||
for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I){
|
|
||||||
SDNode *N = I;
|
|
||||||
N->setNodeId(Id++);
|
|
||||||
}
|
|
||||||
return Id;
|
|
||||||
}
|
|
||||||
|
|
||||||
/// AssignTopologicalOrder - Assign a unique node id for each node in the DAG
|
/// AssignTopologicalOrder - Assign a unique node id for each node in the DAG
|
||||||
/// based on their topological order. It returns the maximum id and a vector
|
/// based on their topological order. It returns the maximum id and a vector
|
||||||
/// of the SDNodes* in assigned order by reference.
|
/// of the SDNodes* in assigned order by reference.
|
||||||
|
|
Loading…
Reference in New Issue