1 /* Title: IGNode.h -*- C++ -*-
2 Author: Ruchira Sasanka
4 Purpose: Represents a node in an interference graph.
7 For efficiency, the AdjList is updated only once - ie. we can add but not
8 remove nodes from AdjList.
10 The removal of nodes from IG is simulated by decrementing the CurDegree.
11 If this node is put on stack (that is removed from IG), the CurDegree of all
12 the neighbors are decremented and this node is marked OnSack. Hence
13 the effective neighbors in the AdjList are the ones that do not have the
14 OnStack flag set (therefore, they are in the IG).
16 The methods that modify/use the CurDegree Must be called only
17 after all modifications to the IG are over (i.e., all neighbors are fixed).
19 The vector representation is the most efficient one for adj list.
20 Though nodes are removed when coalsing is done, we access it in sequence
21 for far many times when coloring (colorNode()).
29 #include "llvm/CodeGen/RegAllocCommon.h"
30 #include "llvm/CodeGen/LiveRange.h"
34 //----------------------------------------------------------------------------
37 // Represents a node in an interference graph.
38 //----------------------------------------------------------------------------
41 const int Index; // index within IGNodeList
43 bool OnStack; // this has been pushed on to stack for coloring
45 std::vector<IGNode *> AdjList; // adjacency list for this live range
49 // set by InterferenceGraph::setCurDegreeOfIGNodes() after calculating
50 // all adjacency lists.
51 // Decremented when a neighbor is pushed on to the stack.
52 // After that, never incremented/set again nor used.
54 LiveRange *const ParentLR; // parent LR (cannot be a const)
59 IGNode(LiveRange *const LR, unsigned int index);
61 // an empty destructor
66 inline unsigned int getIndex() const
69 // adjLists must be updated only once. However, the CurDegree can be changed
71 inline void addAdjIGNode( IGNode *const AdjNode)
72 { AdjList.push_back(AdjNode); }
74 inline IGNode * getAdjIGNode(unsigned int ind) const
75 { assert ( ind < AdjList.size()); return AdjList[ ind ]; }
77 // delete a node in AdjList - node must be in the list
78 // should not be called often
80 void delAdjIGNode(const IGNode *const Node);
82 inline unsigned int getNumOfNeighbors() const
83 { return AdjList.size() ; }
86 inline bool isOnStack() const
89 // remove form IG and pushes on to stack (reduce the degree of neighbors)
93 // CurDegree is the effective number of neighbors when neighbors are
94 // pushed on to the stack during the coloring phase. Must be called
95 // after all modifications to the IG are over (i.e., all neighbors are
98 inline void setCurDegree()
99 { assert( CurDegree == -1); CurDegree = AdjList.size(); }
101 inline int getCurDegree() const
102 { return CurDegree; }
104 // called when a neigh is pushed on to stack
106 inline void decCurDegree()
107 { assert( CurDegree > 0 ); --CurDegree; }
110 // The following methods call the methods in ParentLR
111 // They are added to this class for convenience
112 // If many of these are called within a single scope,
113 // consider calling the methods directly on LR
116 inline void setRegClass(RegClass *const RC)
117 { ParentLR->setRegClass(RC); }
119 inline RegClass *const getRegClass() const {
120 return ParentLR->getRegClass();
123 inline bool hasColor() const
124 { return ParentLR->hasColor(); }
126 inline unsigned int getColor() const
127 { return ParentLR->getColor(); }
129 inline void setColor(unsigned int Col)
130 { ParentLR->setColor(Col); }
132 inline void markForSpill()
133 { ParentLR->markForSpill(); }
135 inline void markForSaveAcrossCalls()
136 { ParentLR->markForSaveAcrossCalls(); }
138 inline unsigned int isCallInterference() const
139 { return ParentLR->isCallInterference(); }
141 inline LiveRange *getParentLR() const
144 inline Type::PrimitiveID getTypeID() const
145 { return ParentLR->getTypeID(); }