mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2025-02-08 21:32:39 +00:00
Added AssignTopologicalOrder() to assign each node an unique id based on their topological order.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@29431 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
db3cc3d7d6
commit
e6f35d8a5c
@ -422,10 +422,15 @@ public:
|
||||
/// have no referrers.
|
||||
void DeleteNode(SDNode *N);
|
||||
|
||||
/// AssignNodeIds - Assign a unique node id for each node in the DAG. It
|
||||
/// returns the maximum id.
|
||||
/// 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
|
||||
/// based on their topological order. It returns a vector of the SDNodes* in
|
||||
/// assigned order.
|
||||
std::vector<SDNode*> AssignTopologicalOrder();
|
||||
|
||||
void dump() const;
|
||||
|
||||
/// InsertISelMapEntry - A helper function to insert a key / element pair
|
||||
|
@ -28,6 +28,7 @@
|
||||
#include <set>
|
||||
#include <cmath>
|
||||
#include <algorithm>
|
||||
#include <deque>
|
||||
using namespace llvm;
|
||||
|
||||
static bool isCommutativeBinOp(unsigned Opcode) {
|
||||
@ -2698,8 +2699,8 @@ void SelectionDAG::ReplaceAllUsesOfValueWith(SDOperand From, SDOperand To,
|
||||
}
|
||||
|
||||
|
||||
/// AssignNodeIds - Assign a unique node id for each node in the DAG. It returns
|
||||
/// the maximum id.
|
||||
/// 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){
|
||||
@ -2709,6 +2710,41 @@ unsigned SelectionDAG::AssignNodeIds() {
|
||||
return Id;
|
||||
}
|
||||
|
||||
/// 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() {
|
||||
unsigned DAGSize = AllNodes.size();
|
||||
std::vector<SDNode*> TopOrder;
|
||||
std::map<SDNode*, unsigned> InDegree;
|
||||
std::deque<SDNode*> Sources;
|
||||
for (allnodes_iterator I = allnodes_begin(),E = allnodes_end(); I != E; ++I){
|
||||
SDNode *N = I;
|
||||
unsigned Degree = N->use_size();
|
||||
InDegree[N] = Degree;
|
||||
if (Degree == 0)
|
||||
Sources.push_back(I);
|
||||
}
|
||||
|
||||
int Id = 0;
|
||||
while (!Sources.empty()) {
|
||||
SDNode *N = Sources.front();
|
||||
Sources.pop_front();
|
||||
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;
|
||||
if (Degree == 0)
|
||||
Sources.push_back(P);
|
||||
InDegree[P] = Degree;
|
||||
}
|
||||
}
|
||||
|
||||
return TopOrder;
|
||||
}
|
||||
|
||||
|
||||
|
||||
//===----------------------------------------------------------------------===//
|
||||
// SDNode Class
|
||||
|
Loading…
x
Reference in New Issue
Block a user