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

- Change AssignTopologicalOrder to return vector of SDNode* by reference.

Browse Source 
- Tweak implementation to avoid using std::map.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@29479 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Evan Cheng 2006-08-02 22:00:34 +00:00
parent 09fd736058
commit c384d6c398
1 changed files with 22 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -28,7 +28,7 @@
#include <set>
#include <cmath>
#include <algorithm>
#include <deque>
#include <queue>
using namespace llvm;
static bool isCommutativeBinOp(unsigned Opcode) {
@ -2711,37 +2711,43 @@ unsigned SelectionDAG::AssignNodeIds() {
}
/// AssignTopologicalOrder - Assign a unique node id for each node in the DAG
/// based on their topological order. It returns a vector of the SDNodes* in
/// assigned order.
std::vector<SDNode*> SelectionDAG::AssignTopologicalOrder() {
/// based on their topological order. It returns the maximum id and a vector
/// of the SDNodes* in assigned order by reference.
unsigned SelectionDAG::AssignTopologicalOrder(std::vector<SDNode*> &TopOrder) {
unsigned DAGSize = AllNodes.size();
std::vector<SDNode*> TopOrder;
std::map<SDNode*, unsigned> InDegree;
std::deque<SDNode*> Sources;
std::vector<unsigned> InDegree(DAGSize);
std::vector<SDNode*> Sources;
// Use a two pass approach to avoid using a std::map which is slow.
unsigned Id = 0;
for (allnodes_iterator I = allnodes_begin(),E = allnodes_end(); I != E; ++I){
SDNode *N = I;
N->setNodeId(Id++);
unsigned Degree = N->use_size();
InDegree[N] = Degree;
InDegree[N->getNodeId()] = Degree;
if (Degree == 0)
Sources.push_back(I);
Sources.push_back(N);
}
int Id = 0;
while (!Sources.empty()) {
SDNode *N = Sources.front();
Sources.pop_front();
SDNode *N = Sources.back();
Sources.pop_back();
TopOrder.push_back(N);
N->setNodeId(Id++);
for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
SDNode *P = I->Val;
unsigned Degree = InDegree[P] - 1;
unsigned Degree = --InDegree[P->getNodeId()];
if (Degree == 0)
Sources.push_back(P);
InDegree[P] = Degree;
}
}
return TopOrder;
// Second pass, assign the actual topological order as node ids.
Id = 0;
for (std::vector<SDNode*>::iterator TI = TopOrder.begin(),TE = TopOrder.end();
TI != TE; ++TI)
(*TI)->setNodeId(Id++);
return Id;
}