RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2025-01-25 20:14:26 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Remove NodeDepth; Add NodeId which is a unique id per node per DAG. It can only be set by SelectionDAG.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@29336 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Evan Cheng 2006-07-27 06:38:21 +00:00
parent b2c121ac14
commit b9ee9e60a9
2 changed files with 21 additions and 41 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
include/llvm/CodeGen/SelectionDAG.h
View File

@ -421,7 +421,11 @@ public:
/// DeleteNode - Remove the specified node from the system. This node must
/// have no referrers.
void DeleteNode(SDNode *N);
/// AssignNodeIds - Assign a unique node id for each node in the DAG. It
/// returns the maximum id.
int AssignNodeIds();
void dump() const;
/// InsertISelMapEntry - A helper function to insert a key / element pair

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

@ -654,7 +654,6 @@ public:
// Forwarding methods - These forward to the corresponding methods in SDNode.
inline unsigned getOpcode() const;
inline unsigned getNodeDepth() const;
inline unsigned getNumOperands() const;
inline const SDOperand &getOperand(unsigned i) const;
inline bool isTargetOpcode() const;
@ -689,10 +688,8 @@ class SDNode {
///
unsigned short NodeType;
/// NodeDepth - Node depth is defined as MAX(Node depth of children)+1. This
/// means that leaves have a depth of 1, things that use only leaves have a
/// depth of 2, etc.
unsigned short NodeDepth;
/// NodeId - Unique id per SDNode in the DAG.
int NodeId;
/// OperandList - The values that are used by this operation.
///
@ -736,9 +733,9 @@ public:
bool use_empty() const { return Uses.empty(); }
bool hasOneUse() const { return Uses.size() == 1; }
/// getNodeDepth - Return the distance from this node to the leaves in the
/// graph. The leaves have a depth of 1.
unsigned getNodeDepth() const { return NodeDepth; }
/// getNodeId - Return the unique node id.
///
int getNodeId() const { return NodeId; }
typedef std::vector<SDNode*>::const_iterator use_iterator;
use_iterator use_begin() const { return Uses.begin(); }
@ -799,14 +796,14 @@ protected:
///
static MVT::ValueType *getValueTypeList(MVT::ValueType VT);
SDNode(unsigned NT, MVT::ValueType VT) : NodeType(NT), NodeDepth(1) {
SDNode(unsigned NT, MVT::ValueType VT) : NodeType(NT), NodeId(-1) {
OperandList = 0; NumOperands = 0;
ValueList = getValueTypeList(VT);
NumValues = 1;
Prev = 0; Next = 0;
}
SDNode(unsigned NT, SDOperand Op)
: NodeType(NT), NodeDepth(Op.Val->getNodeDepth()+1) {
: NodeType(NT), NodeId(-1) {
OperandList = new SDOperand[1];
OperandList[0] = Op;
NumOperands = 1;
@ -816,11 +813,7 @@ protected:
Prev = 0; Next = 0;
}
SDNode(unsigned NT, SDOperand N1, SDOperand N2)
: NodeType(NT) {
if (N1.Val->getNodeDepth() > N2.Val->getNodeDepth())
NodeDepth = N1.Val->getNodeDepth()+1;
else
NodeDepth = N2.Val->getNodeDepth()+1;
: NodeType(NT), NodeId(-1) {
OperandList = new SDOperand[2];
OperandList[0] = N1;
OperandList[1] = N2;
@ -831,14 +824,7 @@ protected:
Prev = 0; Next = 0;
}
SDNode(unsigned NT, SDOperand N1, SDOperand N2, SDOperand N3)
: NodeType(NT) {
unsigned ND = N1.Val->getNodeDepth();
if (ND < N2.Val->getNodeDepth())
ND = N2.Val->getNodeDepth();
if (ND < N3.Val->getNodeDepth())
ND = N3.Val->getNodeDepth();
NodeDepth = ND+1;
: NodeType(NT), NodeId(-1) {
OperandList = new SDOperand[3];
OperandList[0] = N1;
OperandList[1] = N2;
@ -852,16 +838,7 @@ protected:
Prev = 0; Next = 0;
}
SDNode(unsigned NT, SDOperand N1, SDOperand N2, SDOperand N3, SDOperand N4)
: NodeType(NT) {
unsigned ND = N1.Val->getNodeDepth();
if (ND < N2.Val->getNodeDepth())
ND = N2.Val->getNodeDepth();
if (ND < N3.Val->getNodeDepth())
ND = N3.Val->getNodeDepth();
if (ND < N4.Val->getNodeDepth())
ND = N4.Val->getNodeDepth();
NodeDepth = ND+1;
: NodeType(NT), NodeId(-1) {
OperandList = new SDOperand[4];
OperandList[0] = N1;
OperandList[1] = N2;
@ -875,18 +852,16 @@ protected:
NumValues = 0;
Prev = 0; Next = 0;
}
SDNode(unsigned Opc, const std::vector<SDOperand> &Nodes) : NodeType(Opc) {
SDNode(unsigned Opc, const std::vector<SDOperand> &Nodes)
: NodeType(Opc), NodeId(-1) {
NumOperands = Nodes.size();
OperandList = new SDOperand[NumOperands];
unsigned ND = 0;
for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
OperandList[i] = Nodes[i];
SDNode *N = OperandList[i].Val;
N->Uses.push_back(this);
if (ND < N->getNodeDepth()) ND = N->getNodeDepth();
}
NodeDepth = ND+1;
ValueList = 0;
NumValues = 0;
Prev = 0; Next = 0;
@ -1035,6 +1010,10 @@ protected:
}
}
}
void setNodeId(int Id) {
NodeId = Id;
}
};
@ -1043,9 +1022,6 @@ protected:
inline unsigned SDOperand::getOpcode() const {
return Val->getOpcode();
}
inline unsigned SDOperand::getNodeDepth() const {
return Val->getNodeDepth();
}
inline MVT::ValueType SDOperand::getValueType() const {
return Val->getValueType(ResNo);
}