1 #include "llvm/CodeGen/RegClass.h"
5 //----------------------------------------------------------------------------
6 // This constructor inits IG. The actual matrix is created by a call to
7 // createInterferenceGraph() above.
8 //----------------------------------------------------------------------------
9 RegClass::RegClass(const Method *const M,
10 const MachineRegClassInfo *const Mrc,
11 const ReservedColorListType *const RCL)
12 : Meth(M), MRC(Mrc), RegClassID( Mrc->getRegClassID() ),
13 IG(this), IGNodeStack(), ReservedColorList(RCL) {
15 cerr << "Created Reg Class: " << RegClassID << "\n";
17 IsColorUsedArr = new bool[ Mrc->getNumOfAllRegs() ];
22 //----------------------------------------------------------------------------
23 // Main entry point for coloring a register class.
24 //----------------------------------------------------------------------------
25 void RegClass::colorAllRegs()
27 if(DEBUG_RA) cerr << "Coloring IG of reg class " << RegClassID << " ...\n";
30 pushAllIGNodes(); // push all IG Nodes
32 unsigned int StackSize = IGNodeStack.size();
35 // for all LRs on stack
36 for( unsigned int IGN=0; IGN < StackSize; IGN++) {
38 CurIGNode = IGNodeStack.top(); // pop the IGNode on top of stack
40 colorIGNode (CurIGNode); // color it
47 //----------------------------------------------------------------------------
48 // The method for pushing all IGNodes on to the stack.
49 //----------------------------------------------------------------------------
50 void RegClass::pushAllIGNodes()
55 IG.setCurDegreeOfIGNodes(); // calculate degree of IGNodes
57 // push non-constrained IGNodes
58 bool PushedAll = pushUnconstrainedIGNodes();
61 cerr << " Puhsed all-unconstrained IGNodes. ";
62 if( PushedAll ) cerr << " No constrained nodes left.";
66 if( PushedAll ) // if NO constrained nodes left
70 // now, we have constrained nodes. So, push one of them (the one with min
71 // spill cost) and try to push the others as unConstrained nodes.
76 //get node with min spill cost
78 IGNode *IGNodeSpill = getIGNodeWithMinSpillCost();
80 // push that node on to stack
82 IGNodeStack.push( IGNodeSpill );
84 // set its OnStack flag and decrement degree of neighs
86 IGNodeSpill->pushOnStack();
88 // now push NON-constrined ones, if any
90 NeedMoreSpills = ! pushUnconstrainedIGNodes();
92 cerr << "\nConstrained IG Node found !@!" << IGNodeSpill->getIndex();
94 } while( NeedMoreSpills ); // repeat until we have pushed all
101 //--------------------------------------------------------------------------
102 // This method goes thru all IG nodes in the IGNodeList of an IG of a
103 // register class and push any unconstrained IG node left (that is not
105 //--------------------------------------------------------------------------
107 bool RegClass::pushUnconstrainedIGNodes()
109 // # of LRs for this reg class
110 unsigned int IGNodeListSize = IG.getIGNodeList().size();
111 bool pushedall = true;
113 // a pass over IGNodeList
114 for( unsigned i =0; i < IGNodeListSize; i++) {
116 // get IGNode i from IGNodeList
117 IGNode *IGNode = IG.getIGNodeList()[i];
119 if( !IGNode ) // can be null due to merging
122 // if already pushed on stack, continue. This can happen since this
123 // method can be called repeatedly until all constrained nodes are
125 if( IGNode->isOnStack() )
127 // if the degree of IGNode is lower
128 if( (unsigned) IGNode->getCurDegree() < MRC->getNumOfAvailRegs() ) {
129 IGNodeStack.push( IGNode ); // push IGNode on to the stack
130 IGNode->pushOnStack(); // set OnStack and dec deg of neighs
133 cerr << " pushed un-constrained IGNode " << IGNode->getIndex() ;
134 cerr << " on to stack\n";
137 else pushedall = false; // we didn't push all live ranges
141 // returns true if we pushed all live ranges - else false
147 //----------------------------------------------------------------------------
148 // Get the IGNode withe the minimum spill cost
149 //----------------------------------------------------------------------------
150 IGNode * RegClass::getIGNodeWithMinSpillCost()
153 unsigned int IGNodeListSize = IG.getIGNodeList().size();
155 IGNode *MinCostIGNode = NULL;
156 bool isFirstNode = true;
158 // pass over IGNodeList to find the IGNode with minimum spill cost
159 // among all IGNodes that are not yet pushed on to the stack
161 for( unsigned int i =0; i < IGNodeListSize; i++) {
162 IGNode *IGNode = IG.getIGNodeList()[i];
164 if( ! IGNode ) // can be null due to merging
167 if( ! IGNode->isOnStack() ) {
169 double SpillCost = (double) IGNode->getParentLR()->getSpillCost() /
170 (double) (IGNode->getCurDegree() + 1);
172 if( isFirstNode ) { // for the first IG node
173 MinSpillCost = SpillCost;
174 MinCostIGNode = IGNode;
178 else if( MinSpillCost > SpillCost) {
179 MinSpillCost = SpillCost;
180 MinCostIGNode = IGNode;
186 assert( MinCostIGNode && "No IGNode to spill");
187 return MinCostIGNode;
192 //----------------------------------------------------------------------------
193 // Color the IGNode using the machine specific code.
194 //----------------------------------------------------------------------------
195 void RegClass::colorIGNode(IGNode *const Node)
198 if( ! Node->hasColor() ) { // not colored as an arg etc.
201 // init all elements of to IsColorUsedAr false;
203 for( unsigned i=0; i < MRC->getNumOfAllRegs(); i++) {
204 IsColorUsedArr[ i ] = false;
207 // init all reserved_regs to true - we can't use them
209 for( unsigned i=0; i < ReservedColorList->size() ; i++) {
210 IsColorUsedArr[ (*ReservedColorList)[i] ] = true;
213 // call the target specific code for coloring
215 MRC->colorIGNode(Node, IsColorUsedArr);
219 cerr << " Node " << Node->getIndex();
220 cerr << " already colored with color " << Node->getColor() << "\n";
225 if( !Node->hasColor() ) {
227 cerr << " Node " << Node->getIndex();
228 cerr << " - could not find a color (needs spilling)\n";