blob: 0c64846e5cbea968ca42c1957f02313a1ca78c39 [file] [log] [blame]
Chris Lattner179cdfb2002-08-09 20:08:03 +00001//===-- PhyRegAlloc.cpp ---------------------------------------------------===//
Vikram S. Adve12af1642001-11-08 04:48:50 +00002//
Chris Lattner179cdfb2002-08-09 20:08:03 +00003// Register allocation for LLVM.
4//
5//===----------------------------------------------------------------------===//
Ruchira Sasanka8e604792001-09-14 21:18:34 +00006
Chris Lattner70b2f562003-09-01 20:09:04 +00007#include "PhyRegAlloc.h"
Chris Lattner4309e732003-01-15 19:57:07 +00008#include "RegAllocCommon.h"
Chris Lattner9d4ed152003-01-15 21:14:01 +00009#include "RegClass.h"
Chris Lattnerc083dcc2003-09-01 20:05:47 +000010#include "IGNode.h"
Brian Gaeke874f4232003-09-21 02:50:21 +000011#include "llvm/CodeGen/MachineInstr.h"
Chris Lattnerf6ee49f2003-01-15 18:08:07 +000012#include "llvm/CodeGen/MachineInstrBuilder.h"
Vikram S. Advedabb41d2002-05-19 15:29:31 +000013#include "llvm/CodeGen/MachineInstrAnnot.h"
Misha Brukmanfce11432002-10-28 00:28:31 +000014#include "llvm/CodeGen/MachineFunction.h"
Chris Lattnere90fcb72002-12-28 20:35:34 +000015#include "llvm/CodeGen/MachineFunctionInfo.h"
Chris Lattner92ba2aa2003-01-14 23:05:08 +000016#include "llvm/CodeGen/FunctionLiveVarInfo.h"
Vikram S. Adve814030a2003-07-29 19:49:21 +000017#include "llvm/CodeGen/InstrSelection.h"
Chris Lattner14ab1ce2002-02-04 17:48:00 +000018#include "llvm/Analysis/LoopInfo.h"
Chris Lattner3501fea2003-01-14 22:00:31 +000019#include "llvm/Target/TargetInstrInfo.h"
Chris Lattner2fbfdcf2002-04-07 20:49:59 +000020#include "llvm/Function.h"
Chris Lattner37730942002-02-05 03:52:29 +000021#include "llvm/Type.h"
Vikram S. Advedabb41d2002-05-19 15:29:31 +000022#include "llvm/iOther.h"
Vikram S. Advef5af6362002-07-08 23:15:32 +000023#include "Support/STLExtras.h"
Vikram S. Advefeb32982003-08-12 22:22:24 +000024#include "Support/SetOperations.h"
Chris Lattner4bc23482002-09-15 07:07:55 +000025#include "Support/CommandLine.h"
Brian Gaekebd353fb2003-09-21 03:57:37 +000026#include <cmath>
Vikram S. Adve12af1642001-11-08 04:48:50 +000027
Chris Lattner70e60cb2002-05-22 17:08:27 +000028RegAllocDebugLevel_t DEBUG_RA;
Vikram S. Adve39c94e12002-09-14 23:05:33 +000029
Chris Lattner5ff62e92002-07-22 02:10:13 +000030static cl::opt<RegAllocDebugLevel_t, true>
31DRA_opt("dregalloc", cl::Hidden, cl::location(DEBUG_RA),
32 cl::desc("enable register allocation debugging information"),
33 cl::values(
Vikram S. Adve39c94e12002-09-14 23:05:33 +000034 clEnumValN(RA_DEBUG_None , "n", "disable debug output"),
35 clEnumValN(RA_DEBUG_Results, "y", "debug output for allocation results"),
36 clEnumValN(RA_DEBUG_Coloring, "c", "debug output for graph coloring step"),
37 clEnumValN(RA_DEBUG_Interference,"ig","debug output for interference graphs"),
38 clEnumValN(RA_DEBUG_LiveRanges , "lr","debug output for live ranges"),
39 clEnumValN(RA_DEBUG_Verbose, "v", "extra debug output"),
Chris Lattner5ff62e92002-07-22 02:10:13 +000040 0));
Ruchira Sasanka6b0a8b52001-09-15 21:11:11 +000041
Brian Gaekebf3c4cf2003-08-14 06:09:32 +000042FunctionPass *getRegisterAllocator(TargetMachine &T) {
Brian Gaeke4efe3422003-09-21 01:23:46 +000043 return new PhyRegAlloc (T);
Chris Lattner2f9b28e2002-02-04 15:54:09 +000044}
Chris Lattner6dd98a62002-02-04 00:33:08 +000045
Ruchira Sasanka4f3eb222002-01-07 19:19:18 +000046
Ruchira Sasanka6b0a8b52001-09-15 21:11:11 +000047//----------------------------------------------------------------------------
Misha Brukman37f92e22003-09-11 22:34:13 +000048// This method initially creates interference graphs (one in each reg class)
Ruchira Sasanka6b0a8b52001-09-15 21:11:11 +000049// and IGNodeList (one in each IG). The actual nodes will be pushed later.
50//----------------------------------------------------------------------------
Chris Lattnerdd1e40b2002-02-03 07:46:34 +000051void PhyRegAlloc::createIGNodeListsAndIGs() {
Chris Lattnerc083dcc2003-09-01 20:05:47 +000052 if (DEBUG_RA >= RA_DEBUG_LiveRanges) std::cerr << "Creating LR lists ...\n";
Ruchira Sasanka8e604792001-09-14 21:18:34 +000053
54 // hash map iterator
Brian Gaeke4efe3422003-09-21 01:23:46 +000055 LiveRangeMapType::const_iterator HMI = LRI->getLiveRangeMap()->begin();
Ruchira Sasanka8e604792001-09-14 21:18:34 +000056
57 // hash map end
Brian Gaeke4efe3422003-09-21 01:23:46 +000058 LiveRangeMapType::const_iterator HMIEnd = LRI->getLiveRangeMap()->end();
Ruchira Sasanka8e604792001-09-14 21:18:34 +000059
Chris Lattnerdd1e40b2002-02-03 07:46:34 +000060 for (; HMI != HMIEnd ; ++HMI ) {
61 if (HMI->first) {
62 LiveRange *L = HMI->second; // get the LiveRange
63 if (!L) {
Vikram S. Adve39c94e12002-09-14 23:05:33 +000064 if (DEBUG_RA)
Chris Lattnerc083dcc2003-09-01 20:05:47 +000065 std::cerr << "\n**** ?!?WARNING: NULL LIVE RANGE FOUND FOR: "
Vikram S. Adve39c94e12002-09-14 23:05:33 +000066 << RAV(HMI->first) << "****\n";
Chris Lattnerdd1e40b2002-02-03 07:46:34 +000067 continue;
68 }
Vikram S. Adve39c94e12002-09-14 23:05:33 +000069
70 // if the Value * is not null, and LR is not yet written to the IGNodeList
Chris Lattner7e708292002-06-25 16:13:24 +000071 if (!(L->getUserIGNode()) ) {
Chris Lattnerdd1e40b2002-02-03 07:46:34 +000072 RegClass *const RC = // RegClass of first value in the LR
73 RegClassList[ L->getRegClass()->getID() ];
Chris Lattnerdd1e40b2002-02-03 07:46:34 +000074 RC->addLRToIG(L); // add this LR to an IG
75 }
Ruchira Sasanka8e604792001-09-14 21:18:34 +000076 }
77 }
Chris Lattnerdd1e40b2002-02-03 07:46:34 +000078
79 // init RegClassList
Chris Lattner7e708292002-06-25 16:13:24 +000080 for ( unsigned rc=0; rc < NumOfRegClasses ; rc++)
Chris Lattnerdd1e40b2002-02-03 07:46:34 +000081 RegClassList[rc]->createInterferenceGraph();
Ruchira Sasanka8e604792001-09-14 21:18:34 +000082
Chris Lattnerc083dcc2003-09-01 20:05:47 +000083 if (DEBUG_RA >= RA_DEBUG_LiveRanges) std::cerr << "LRLists Created!\n";
Ruchira Sasanka8e604792001-09-14 21:18:34 +000084}
85
86
Ruchira Sasanka6b0a8b52001-09-15 21:11:11 +000087//----------------------------------------------------------------------------
88// This method will add all interferences at for a given instruction.
Misha Brukman37f92e22003-09-11 22:34:13 +000089// Interference occurs only if the LR of Def (Inst or Arg) is of the same reg
Ruchira Sasanka8e604792001-09-14 21:18:34 +000090// class as that of live var. The live var passed to this function is the
91// LVset AFTER the instruction
Ruchira Sasanka6b0a8b52001-09-15 21:11:11 +000092//----------------------------------------------------------------------------
Vikram S. Adve39c94e12002-09-14 23:05:33 +000093
Chris Lattner296b7732002-02-05 02:52:05 +000094void PhyRegAlloc::addInterference(const Value *Def,
95 const ValueSet *LVSet,
96 bool isCallInst) {
Chris Lattner296b7732002-02-05 02:52:05 +000097 ValueSet::const_iterator LIt = LVSet->begin();
Ruchira Sasanka8e604792001-09-14 21:18:34 +000098
99 // get the live range of instruction
Brian Gaeke4efe3422003-09-21 01:23:46 +0000100 const LiveRange *const LROfDef = LRI->getLiveRangeForValue( Def );
Ruchira Sasanka8e604792001-09-14 21:18:34 +0000101
102 IGNode *const IGNodeOfDef = LROfDef->getUserIGNode();
103 assert( IGNodeOfDef );
104
105 RegClass *const RCOfDef = LROfDef->getRegClass();
106
107 // for each live var in live variable set
Chris Lattner7e708292002-06-25 16:13:24 +0000108 for ( ; LIt != LVSet->end(); ++LIt) {
Ruchira Sasanka8e604792001-09-14 21:18:34 +0000109
Vikram S. Advef5af6362002-07-08 23:15:32 +0000110 if (DEBUG_RA >= RA_DEBUG_Verbose)
Chris Lattnerc083dcc2003-09-01 20:05:47 +0000111 std::cerr << "< Def=" << RAV(Def) << ", Lvar=" << RAV(*LIt) << "> ";
Ruchira Sasanka8e604792001-09-14 21:18:34 +0000112
113 // get the live range corresponding to live var
Brian Gaeke4efe3422003-09-21 01:23:46 +0000114 LiveRange *LROfVar = LRI->getLiveRangeForValue(*LIt);
Ruchira Sasanka8e604792001-09-14 21:18:34 +0000115
116 // LROfVar can be null if it is a const since a const
117 // doesn't have a dominating def - see Assumptions above
Vikram S. Adve39c94e12002-09-14 23:05:33 +0000118 if (LROfVar)
119 if (LROfDef != LROfVar) // do not set interf for same LR
120 if (RCOfDef == LROfVar->getRegClass()) // 2 reg classes are the same
121 RCOfDef->setInterference( LROfDef, LROfVar);
Ruchira Sasanka958faf32001-10-19 17:21:03 +0000122 }
Ruchira Sasanka8e604792001-09-14 21:18:34 +0000123}
124
Ruchira Sasanka958faf32001-10-19 17:21:03 +0000125
126//----------------------------------------------------------------------------
127// For a call instruction, this method sets the CallInterference flag in
128// the LR of each variable live int the Live Variable Set live after the
129// call instruction (except the return value of the call instruction - since
130// the return value does not interfere with that call itself).
131//----------------------------------------------------------------------------
132
133void PhyRegAlloc::setCallInterferences(const MachineInstr *MInst,
Chris Lattner296b7732002-02-05 02:52:05 +0000134 const ValueSet *LVSetAft) {
Vikram S. Adve39c94e12002-09-14 23:05:33 +0000135 if (DEBUG_RA >= RA_DEBUG_Interference)
Chris Lattnerc083dcc2003-09-01 20:05:47 +0000136 std::cerr << "\n For call inst: " << *MInst;
Ruchira Sasanka958faf32001-10-19 17:21:03 +0000137
Ruchira Sasanka958faf32001-10-19 17:21:03 +0000138 // for each live var in live variable set after machine inst
Vikram S. Adve65b2f402003-07-02 01:24:00 +0000139 for (ValueSet::const_iterator LIt = LVSetAft->begin(), LEnd = LVSetAft->end();
140 LIt != LEnd; ++LIt) {
Ruchira Sasanka958faf32001-10-19 17:21:03 +0000141
Ruchira Sasanka4f3eb222002-01-07 19:19:18 +0000142 // get the live range corresponding to live var
Brian Gaeke4efe3422003-09-21 01:23:46 +0000143 LiveRange *const LR = LRI->getLiveRangeForValue(*LIt );
Ruchira Sasanka958faf32001-10-19 17:21:03 +0000144
Ruchira Sasanka958faf32001-10-19 17:21:03 +0000145 // LR can be null if it is a const since a const
146 // doesn't have a dominating def - see Assumptions above
Vikram S. Adve39c94e12002-09-14 23:05:33 +0000147 if (LR ) {
148 if (DEBUG_RA >= RA_DEBUG_Interference) {
Chris Lattnerc083dcc2003-09-01 20:05:47 +0000149 std::cerr << "\n\tLR after Call: ";
Vikram S. Adve39c94e12002-09-14 23:05:33 +0000150 printSet(*LR);
151 }
Ruchira Sasanka958faf32001-10-19 17:21:03 +0000152 LR->setCallInterference();
Vikram S. Adve39c94e12002-09-14 23:05:33 +0000153 if (DEBUG_RA >= RA_DEBUG_Interference) {
Chris Lattnerc083dcc2003-09-01 20:05:47 +0000154 std::cerr << "\n ++After adding call interference for LR: " ;
Chris Lattner296b7732002-02-05 02:52:05 +0000155 printSet(*LR);
Ruchira Sasanka958faf32001-10-19 17:21:03 +0000156 }
157 }
158
159 }
160
Vikram S. Adve1a53f032002-03-31 18:54:37 +0000161 // Now find the LR of the return value of the call
162 // We do this because, we look at the LV set *after* the instruction
163 // to determine, which LRs must be saved across calls. The return value
164 // of the call is live in this set - but it does not interfere with call
165 // (i.e., we can allocate a volatile register to the return value)
Vikram S. Advedabb41d2002-05-19 15:29:31 +0000166 CallArgsDescriptor* argDesc = CallArgsDescriptor::get(MInst);
167
168 if (const Value *RetVal = argDesc->getReturnValue()) {
Brian Gaeke4efe3422003-09-21 01:23:46 +0000169 LiveRange *RetValLR = LRI->getLiveRangeForValue( RetVal );
Vikram S. Adve1a53f032002-03-31 18:54:37 +0000170 assert( RetValLR && "No LR for RetValue of call");
171 RetValLR->clearCallInterference();
172 }
173
174 // If the CALL is an indirect call, find the LR of the function pointer.
175 // That has a call interference because it conflicts with outgoing args.
Chris Lattner7e708292002-06-25 16:13:24 +0000176 if (const Value *AddrVal = argDesc->getIndirectFuncPtr()) {
Brian Gaeke4efe3422003-09-21 01:23:46 +0000177 LiveRange *AddrValLR = LRI->getLiveRangeForValue( AddrVal );
Vikram S. Adve1a53f032002-03-31 18:54:37 +0000178 assert( AddrValLR && "No LR for indirect addr val of call");
179 AddrValLR->setCallInterference();
180 }
Ruchira Sasanka958faf32001-10-19 17:21:03 +0000181}
182
183
Ruchira Sasanka6b0a8b52001-09-15 21:11:11 +0000184//----------------------------------------------------------------------------
185// This method will walk thru code and create interferences in the IG of
Ruchira Sasanka4f3eb222002-01-07 19:19:18 +0000186// each RegClass. Also, this method calculates the spill cost of each
187// Live Range (it is done in this method to save another pass over the code).
Ruchira Sasanka6b0a8b52001-09-15 21:11:11 +0000188//----------------------------------------------------------------------------
Brian Gaeke43ce8fe2003-09-21 02:24:09 +0000189
Ruchira Sasanka8e604792001-09-14 21:18:34 +0000190void PhyRegAlloc::buildInterferenceGraphs()
191{
Vikram S. Adve39c94e12002-09-14 23:05:33 +0000192 if (DEBUG_RA >= RA_DEBUG_Interference)
Chris Lattnerc083dcc2003-09-01 20:05:47 +0000193 std::cerr << "Creating interference graphs ...\n";
Ruchira Sasanka8e604792001-09-14 21:18:34 +0000194
Ruchira Sasanka4f3eb222002-01-07 19:19:18 +0000195 unsigned BBLoopDepthCost;
Brian Gaeke4efe3422003-09-21 01:23:46 +0000196 for (MachineFunction::iterator BBI = MF->begin(), BBE = MF->end();
Chris Lattner2fbfdcf2002-04-07 20:49:59 +0000197 BBI != BBE; ++BBI) {
Chris Lattnerf726e772002-10-28 19:22:04 +0000198 const MachineBasicBlock &MBB = *BBI;
199 const BasicBlock *BB = MBB.getBasicBlock();
Ruchira Sasanka8e604792001-09-14 21:18:34 +0000200
Ruchira Sasanka4f3eb222002-01-07 19:19:18 +0000201 // find the 10^(loop_depth) of this BB
Chris Lattnerf726e772002-10-28 19:22:04 +0000202 BBLoopDepthCost = (unsigned)pow(10.0, LoopDepthCalc->getLoopDepth(BB));
Ruchira Sasanka4f3eb222002-01-07 19:19:18 +0000203
Ruchira Sasanka8e604792001-09-14 21:18:34 +0000204 // get the iterator for machine instructions
Chris Lattnerf726e772002-10-28 19:22:04 +0000205 MachineBasicBlock::const_iterator MII = MBB.begin();
Ruchira Sasanka8e604792001-09-14 21:18:34 +0000206
207 // iterate over all the machine instructions in BB
Chris Lattnerf726e772002-10-28 19:22:04 +0000208 for ( ; MII != MBB.end(); ++MII) {
209 const MachineInstr *MInst = *MII;
Ruchira Sasanka8e604792001-09-14 21:18:34 +0000210
211 // get the LV set after the instruction
Chris Lattnerf726e772002-10-28 19:22:04 +0000212 const ValueSet &LVSetAI = LVI->getLiveVarSetAfterMInst(MInst, BB);
213 bool isCallInst = TM.getInstrInfo().isCall(MInst->getOpCode());
Ruchira Sasanka8e604792001-09-14 21:18:34 +0000214
Chris Lattner7e708292002-06-25 16:13:24 +0000215 if (isCallInst ) {
Misha Brukman37f92e22003-09-11 22:34:13 +0000216 // set the isCallInterference flag of each live range which extends
217 // across this call instruction. This information is used by graph
218 // coloring algorithm to avoid allocating volatile colors to live ranges
Ruchira Sasanka958faf32001-10-19 17:21:03 +0000219 // that span across calls (since they have to be saved/restored)
Chris Lattner748697d2002-02-05 04:20:12 +0000220 setCallInterferences(MInst, &LVSetAI);
Ruchira Sasanka958faf32001-10-19 17:21:03 +0000221 }
222
Ruchira Sasanka4f3eb222002-01-07 19:19:18 +0000223 // iterate over all MI operands to find defs
Chris Lattner2f898d22002-02-05 06:02:59 +0000224 for (MachineInstr::const_val_op_iterator OpI = MInst->begin(),
225 OpE = MInst->end(); OpI != OpE; ++OpI) {
Vikram S. Adve5f2180c2003-05-27 00:05:23 +0000226 if (OpI.isDefOnly() || OpI.isDefAndUse()) // create a new LR since def
Chris Lattner748697d2002-02-05 04:20:12 +0000227 addInterference(*OpI, &LVSetAI, isCallInst);
Ruchira Sasanka4f3eb222002-01-07 19:19:18 +0000228
229 // Calculate the spill cost of each live range
Brian Gaeke4efe3422003-09-21 01:23:46 +0000230 LiveRange *LR = LRI->getLiveRangeForValue(*OpI);
Chris Lattner2f898d22002-02-05 06:02:59 +0000231 if (LR) LR->addSpillCost(BBLoopDepthCost);
Ruchira Sasanka4f3eb222002-01-07 19:19:18 +0000232 }
Ruchira Sasanka8e604792001-09-14 21:18:34 +0000233
Ruchira Sasanka22ccb1b2001-11-14 15:33:58 +0000234 // if there are multiple defs in this instruction e.g. in SETX
Chris Lattnerdd1e40b2002-02-03 07:46:34 +0000235 if (TM.getInstrInfo().isPseudoInstr(MInst->getOpCode()))
Ruchira Sasanka22ccb1b2001-11-14 15:33:58 +0000236 addInterf4PseudoInstr(MInst);
237
Ruchira Sasankac4d4b762001-10-16 01:23:19 +0000238 // Also add interference for any implicit definitions in a machine
239 // instr (currently, only calls have this).
Ruchira Sasankac4d4b762001-10-16 01:23:19 +0000240 unsigned NumOfImpRefs = MInst->getNumImplicitRefs();
Vikram S. Adve5f2180c2003-05-27 00:05:23 +0000241 for (unsigned z=0; z < NumOfImpRefs; z++)
242 if (MInst->getImplicitOp(z).opIsDefOnly() ||
243 MInst->getImplicitOp(z).opIsDefAndUse())
244 addInterference( MInst->getImplicitRef(z), &LVSetAI, isCallInst );
Ruchira Sasankaef1b0cb2001-11-03 17:13:27 +0000245
Ruchira Sasanka8e604792001-09-14 21:18:34 +0000246 } // for all machine instructions in BB
Chris Lattner2fbfdcf2002-04-07 20:49:59 +0000247 } // for all BBs in function
Ruchira Sasanka8e604792001-09-14 21:18:34 +0000248
Misha Brukman37f92e22003-09-11 22:34:13 +0000249 // add interferences for function arguments. Since there are no explicit
Chris Lattner2fbfdcf2002-04-07 20:49:59 +0000250 // defs in the function for args, we have to add them manually
Ruchira Sasanka4f3eb222002-01-07 19:19:18 +0000251 addInterferencesForArgs();
Ruchira Sasanka8e604792001-09-14 21:18:34 +0000252
Vikram S. Adve39c94e12002-09-14 23:05:33 +0000253 if (DEBUG_RA >= RA_DEBUG_Interference)
Chris Lattnerc083dcc2003-09-01 20:05:47 +0000254 std::cerr << "Interference graphs calculated!\n";
Ruchira Sasanka8e604792001-09-14 21:18:34 +0000255}
256
Ruchira Sasanka4f3eb222002-01-07 19:19:18 +0000257
Ruchira Sasanka22ccb1b2001-11-14 15:33:58 +0000258//--------------------------------------------------------------------------
Brian Gaeke43ce8fe2003-09-21 02:24:09 +0000259// Pseudo-instructions may be expanded to multiple instructions by the
260// assembler. Consequently, all the operands must get distinct registers.
261// Therefore, we mark all operands of a pseudo-instruction as interfering
Ruchira Sasanka4f3eb222002-01-07 19:19:18 +0000262// with one another.
Ruchira Sasanka22ccb1b2001-11-14 15:33:58 +0000263//--------------------------------------------------------------------------
Ruchira Sasanka22ccb1b2001-11-14 15:33:58 +0000264
Brian Gaeke43ce8fe2003-09-21 02:24:09 +0000265void PhyRegAlloc::addInterf4PseudoInstr(const MachineInstr *MInst) {
Ruchira Sasankaf6dfca12001-11-15 15:00:53 +0000266 bool setInterf = false;
267
Brian Gaeke43ce8fe2003-09-21 02:24:09 +0000268 // iterate over MI operands to find defs
Chris Lattner2f898d22002-02-05 06:02:59 +0000269 for (MachineInstr::const_val_op_iterator It1 = MInst->begin(),
270 ItE = MInst->end(); It1 != ItE; ++It1) {
Brian Gaeke4efe3422003-09-21 01:23:46 +0000271 const LiveRange *LROfOp1 = LRI->getLiveRangeForValue(*It1);
Chris Lattnerc083dcc2003-09-01 20:05:47 +0000272 assert((LROfOp1 || !It1.isUseOnly())&&"No LR for Def in PSEUDO insruction");
Ruchira Sasanka22ccb1b2001-11-14 15:33:58 +0000273
Chris Lattner2f898d22002-02-05 06:02:59 +0000274 MachineInstr::const_val_op_iterator It2 = It1;
Chris Lattner7e708292002-06-25 16:13:24 +0000275 for (++It2; It2 != ItE; ++It2) {
Brian Gaeke4efe3422003-09-21 01:23:46 +0000276 const LiveRange *LROfOp2 = LRI->getLiveRangeForValue(*It2);
Ruchira Sasankaf6dfca12001-11-15 15:00:53 +0000277
Chris Lattner2f898d22002-02-05 06:02:59 +0000278 if (LROfOp2) {
279 RegClass *RCOfOp1 = LROfOp1->getRegClass();
280 RegClass *RCOfOp2 = LROfOp2->getRegClass();
Ruchira Sasanka22ccb1b2001-11-14 15:33:58 +0000281
Chris Lattner7e708292002-06-25 16:13:24 +0000282 if (RCOfOp1 == RCOfOp2 ){
Ruchira Sasanka22ccb1b2001-11-14 15:33:58 +0000283 RCOfOp1->setInterference( LROfOp1, LROfOp2 );
Ruchira Sasankaf6dfca12001-11-15 15:00:53 +0000284 setInterf = true;
Ruchira Sasanka22ccb1b2001-11-14 15:33:58 +0000285 }
Ruchira Sasanka22ccb1b2001-11-14 15:33:58 +0000286 } // if Op2 has a LR
Ruchira Sasanka22ccb1b2001-11-14 15:33:58 +0000287 } // for all other defs in machine instr
Ruchira Sasanka22ccb1b2001-11-14 15:33:58 +0000288 } // for all operands in an instruction
289
Chris Lattner2f898d22002-02-05 06:02:59 +0000290 if (!setInterf && MInst->getNumOperands() > 2) {
Chris Lattnerc083dcc2003-09-01 20:05:47 +0000291 std::cerr << "\nInterf not set for any operand in pseudo instr:\n";
292 std::cerr << *MInst;
Ruchira Sasankaf6dfca12001-11-15 15:00:53 +0000293 assert(0 && "Interf not set for pseudo instr with > 2 operands" );
Ruchira Sasankaf6dfca12001-11-15 15:00:53 +0000294 }
Ruchira Sasanka22ccb1b2001-11-14 15:33:58 +0000295}
296
297
Ruchira Sasanka6b0a8b52001-09-15 21:11:11 +0000298//----------------------------------------------------------------------------
Brian Gaeke43ce8fe2003-09-21 02:24:09 +0000299// This method adds interferences for incoming arguments to a function.
Ruchira Sasanka6b0a8b52001-09-15 21:11:11 +0000300//----------------------------------------------------------------------------
Vikram S. Adve39c94e12002-09-14 23:05:33 +0000301
Chris Lattner296b7732002-02-05 02:52:05 +0000302void PhyRegAlloc::addInterferencesForArgs() {
303 // get the InSet of root BB
Chris Lattnerf726e772002-10-28 19:22:04 +0000304 const ValueSet &InSet = LVI->getInSetOfBB(&Fn->front());
Ruchira Sasanka8e604792001-09-14 21:18:34 +0000305
Chris Lattnerf726e772002-10-28 19:22:04 +0000306 for (Function::const_aiterator AI = Fn->abegin(); AI != Fn->aend(); ++AI) {
Chris Lattner7e708292002-06-25 16:13:24 +0000307 // add interferences between args and LVars at start
308 addInterference(AI, &InSet, false);
309
Vikram S. Adve39c94e12002-09-14 23:05:33 +0000310 if (DEBUG_RA >= RA_DEBUG_Interference)
Chris Lattnerc083dcc2003-09-01 20:05:47 +0000311 std::cerr << " - %% adding interference for argument " << RAV(AI) << "\n";
Ruchira Sasanka8e604792001-09-14 21:18:34 +0000312 }
313}
314
315
Ruchira Sasanka6b0a8b52001-09-15 21:11:11 +0000316//----------------------------------------------------------------------------
317// This method is called after register allocation is complete to set the
Misha Brukman37f92e22003-09-11 22:34:13 +0000318// allocated registers in the machine code. This code will add register numbers
Ruchira Sasanka4f3eb222002-01-07 19:19:18 +0000319// to MachineOperands that contain a Value. Also it calls target specific
320// methods to produce caller saving instructions. At the end, it adds all
321// additional instructions produced by the register allocator to the
322// instruction stream.
Ruchira Sasanka6b0a8b52001-09-15 21:11:11 +0000323//----------------------------------------------------------------------------
Vikram S. Adve48762092002-04-25 04:34:15 +0000324
325//-----------------------------
326// Utility functions used below
327//-----------------------------
328inline void
Vikram S. Advecb202e32002-10-11 16:12:40 +0000329InsertBefore(MachineInstr* newMI,
Chris Lattnerf726e772002-10-28 19:22:04 +0000330 MachineBasicBlock& MBB,
Chris Lattner32be9f62002-10-28 01:41:27 +0000331 MachineBasicBlock::iterator& MII)
Vikram S. Advecb202e32002-10-11 16:12:40 +0000332{
Chris Lattnerf726e772002-10-28 19:22:04 +0000333 MII = MBB.insert(MII, newMI);
Vikram S. Advecb202e32002-10-11 16:12:40 +0000334 ++MII;
335}
336
337inline void
338InsertAfter(MachineInstr* newMI,
Chris Lattnerf726e772002-10-28 19:22:04 +0000339 MachineBasicBlock& MBB,
Chris Lattner32be9f62002-10-28 01:41:27 +0000340 MachineBasicBlock::iterator& MII)
Vikram S. Advecb202e32002-10-11 16:12:40 +0000341{
342 ++MII; // insert before the next instruction
Chris Lattnerf726e772002-10-28 19:22:04 +0000343 MII = MBB.insert(MII, newMI);
Vikram S. Advecb202e32002-10-11 16:12:40 +0000344}
345
346inline void
Vikram S. Adved0d06ad2003-05-31 07:32:01 +0000347DeleteInstruction(MachineBasicBlock& MBB,
348 MachineBasicBlock::iterator& MII)
349{
350 MII = MBB.erase(MII);
351}
352
353inline void
Vikram S. Advecb202e32002-10-11 16:12:40 +0000354SubstituteInPlace(MachineInstr* newMI,
Chris Lattnerf726e772002-10-28 19:22:04 +0000355 MachineBasicBlock& MBB,
Chris Lattner32be9f62002-10-28 01:41:27 +0000356 MachineBasicBlock::iterator MII)
Vikram S. Advecb202e32002-10-11 16:12:40 +0000357{
358 *MII = newMI;
359}
360
361inline void
Chris Lattnerc083dcc2003-09-01 20:05:47 +0000362PrependInstructions(std::vector<MachineInstr *> &IBef,
Chris Lattnerf726e772002-10-28 19:22:04 +0000363 MachineBasicBlock& MBB,
Chris Lattner32be9f62002-10-28 01:41:27 +0000364 MachineBasicBlock::iterator& MII,
Vikram S. Adve48762092002-04-25 04:34:15 +0000365 const std::string& msg)
366{
367 if (!IBef.empty())
368 {
369 MachineInstr* OrigMI = *MII;
Vikram S. Advedabb41d2002-05-19 15:29:31 +0000370 std::vector<MachineInstr *>::iterator AdIt;
Vikram S. Adve48762092002-04-25 04:34:15 +0000371 for (AdIt = IBef.begin(); AdIt != IBef.end() ; ++AdIt)
372 {
373 if (DEBUG_RA) {
Chris Lattnerc083dcc2003-09-01 20:05:47 +0000374 if (OrigMI) std::cerr << "For MInst:\n " << *OrigMI;
375 std::cerr << msg << "PREPENDed instr:\n " << **AdIt << "\n";
Vikram S. Adve48762092002-04-25 04:34:15 +0000376 }
Chris Lattnerf726e772002-10-28 19:22:04 +0000377 InsertBefore(*AdIt, MBB, MII);
Vikram S. Adve48762092002-04-25 04:34:15 +0000378 }
379 }
380}
381
382inline void
Vikram S. Advedabb41d2002-05-19 15:29:31 +0000383AppendInstructions(std::vector<MachineInstr *> &IAft,
Chris Lattnerf726e772002-10-28 19:22:04 +0000384 MachineBasicBlock& MBB,
Chris Lattner32be9f62002-10-28 01:41:27 +0000385 MachineBasicBlock::iterator& MII,
Vikram S. Adve48762092002-04-25 04:34:15 +0000386 const std::string& msg)
387{
388 if (!IAft.empty())
389 {
390 MachineInstr* OrigMI = *MII;
Vikram S. Advedabb41d2002-05-19 15:29:31 +0000391 std::vector<MachineInstr *>::iterator AdIt;
Chris Lattner7e708292002-06-25 16:13:24 +0000392 for ( AdIt = IAft.begin(); AdIt != IAft.end() ; ++AdIt )
Vikram S. Adve48762092002-04-25 04:34:15 +0000393 {
Chris Lattner7e708292002-06-25 16:13:24 +0000394 if (DEBUG_RA) {
Chris Lattnerc083dcc2003-09-01 20:05:47 +0000395 if (OrigMI) std::cerr << "For MInst:\n " << *OrigMI;
396 std::cerr << msg << "APPENDed instr:\n " << **AdIt << "\n";
Vikram S. Adve48762092002-04-25 04:34:15 +0000397 }
Chris Lattnerf726e772002-10-28 19:22:04 +0000398 InsertAfter(*AdIt, MBB, MII);
Vikram S. Adve48762092002-04-25 04:34:15 +0000399 }
400 }
401}
402
Brian Gaeke4efe3422003-09-21 01:23:46 +0000403bool PhyRegAlloc::markAllocatedRegs(MachineInstr* MInst)
Vikram S. Adved0d06ad2003-05-31 07:32:01 +0000404{
Vikram S. Adve814030a2003-07-29 19:49:21 +0000405 bool instrNeedsSpills = false;
406
Vikram S. Adved0d06ad2003-05-31 07:32:01 +0000407 // First, set the registers for operands in the machine instruction
408 // if a register was successfully allocated. Do this first because we
409 // will need to know which registers are already used by this instr'n.
Vikram S. Adved0d06ad2003-05-31 07:32:01 +0000410 for (unsigned OpNum=0; OpNum < MInst->getNumOperands(); ++OpNum)
411 {
412 MachineOperand& Op = MInst->getOperand(OpNum);
413 if (Op.getType() == MachineOperand::MO_VirtualRegister ||
414 Op.getType() == MachineOperand::MO_CCRegister)
415 {
416 const Value *const Val = Op.getVRegValue();
Brian Gaeke4efe3422003-09-21 01:23:46 +0000417 if (const LiveRange* LR = LRI->getLiveRangeForValue(Val)) {
Vikram S. Adve814030a2003-07-29 19:49:21 +0000418 // Remember if any operand needs spilling
419 instrNeedsSpills |= LR->isMarkedForSpill();
420
421 // An operand may have a color whether or not it needs spilling
Vikram S. Adved0d06ad2003-05-31 07:32:01 +0000422 if (LR->hasColor())
423 MInst->SetRegForOperand(OpNum,
424 MRI.getUnifiedRegNum(LR->getRegClass()->getID(),
425 LR->getColor()));
Vikram S. Adve814030a2003-07-29 19:49:21 +0000426 }
Vikram S. Adved0d06ad2003-05-31 07:32:01 +0000427 }
428 } // for each operand
Vikram S. Adve814030a2003-07-29 19:49:21 +0000429
430 return instrNeedsSpills;
431}
432
433void PhyRegAlloc::updateInstruction(MachineBasicBlock::iterator& MII,
434 MachineBasicBlock &MBB)
435{
436 MachineInstr* MInst = *MII;
437 unsigned Opcode = MInst->getOpCode();
438
439 // Reset tmp stack positions so they can be reused for each machine instr.
Brian Gaeke4efe3422003-09-21 01:23:46 +0000440 MF->getInfo()->popAllTempValues();
Vikram S. Adve814030a2003-07-29 19:49:21 +0000441
442 // Mark the operands for which regs have been allocated.
Brian Gaeke4efe3422003-09-21 01:23:46 +0000443 bool instrNeedsSpills = markAllocatedRegs(*MII);
Vikram S. Adve814030a2003-07-29 19:49:21 +0000444
445#ifndef NDEBUG
446 // Mark that the operands have been updated. Later,
447 // setRelRegsUsedByThisInst() is called to find registers used by each
448 // MachineInst, and it should not be used for an instruction until
449 // this is done. This flag just serves as a sanity check.
Vikram S. Adved0d06ad2003-05-31 07:32:01 +0000450 OperandsColoredMap[MInst] = true;
Vikram S. Adve814030a2003-07-29 19:49:21 +0000451#endif
Vikram S. Adved0d06ad2003-05-31 07:32:01 +0000452
Vikram S. Advebc001b22003-07-25 21:06:09 +0000453 // Now insert caller-saving code before/after the call.
454 // Do this before inserting spill code since some registers must be
455 // used by save/restore and spill code should not use those registers.
Vikram S. Advebc001b22003-07-25 21:06:09 +0000456 if (TM.getInstrInfo().isCall(Opcode)) {
Vikram S. Adved0d06ad2003-05-31 07:32:01 +0000457 AddedInstrns &AI = AddedInstrMap[MInst];
Vikram S. Adve814030a2003-07-29 19:49:21 +0000458 insertCallerSavingCode(AI.InstrnsBefore, AI.InstrnsAfter, MInst,
459 MBB.getBasicBlock());
Vikram S. Adved0d06ad2003-05-31 07:32:01 +0000460 }
Vikram S. Advebc001b22003-07-25 21:06:09 +0000461
Vikram S. Adved0d06ad2003-05-31 07:32:01 +0000462 // Now insert spill code for remaining operands not allocated to
463 // registers. This must be done even for call return instructions
464 // since those are not handled by the special code above.
Vikram S. Adve814030a2003-07-29 19:49:21 +0000465 if (instrNeedsSpills)
466 for (unsigned OpNum=0; OpNum < MInst->getNumOperands(); ++OpNum)
467 {
468 MachineOperand& Op = MInst->getOperand(OpNum);
469 if (Op.getType() == MachineOperand::MO_VirtualRegister ||
470 Op.getType() == MachineOperand::MO_CCRegister)
471 {
472 const Value* Val = Op.getVRegValue();
Brian Gaeke4efe3422003-09-21 01:23:46 +0000473 if (const LiveRange *LR = LRI->getLiveRangeForValue(Val))
Vikram S. Adve814030a2003-07-29 19:49:21 +0000474 if (LR->isMarkedForSpill())
475 insertCode4SpilledLR(LR, MII, MBB, OpNum);
476 }
477 } // for each operand
Vikram S. Adved0d06ad2003-05-31 07:32:01 +0000478}
479
480void PhyRegAlloc::updateMachineCode()
481{
Chris Lattner7e708292002-06-25 16:13:24 +0000482 // Insert any instructions needed at method entry
Brian Gaeke4efe3422003-09-21 01:23:46 +0000483 MachineBasicBlock::iterator MII = MF->front().begin();
484 PrependInstructions(AddedInstrAtEntry.InstrnsBefore, MF->front(), MII,
Chris Lattner7e708292002-06-25 16:13:24 +0000485 "At function entry: \n");
486 assert(AddedInstrAtEntry.InstrnsAfter.empty() &&
487 "InstrsAfter should be unnecessary since we are just inserting at "
488 "the function entry point here.");
Vikram S. Adve48762092002-04-25 04:34:15 +0000489
Brian Gaeke4efe3422003-09-21 01:23:46 +0000490 for (MachineFunction::iterator BBI = MF->begin(), BBE = MF->end();
Chris Lattner2fbfdcf2002-04-07 20:49:59 +0000491 BBI != BBE; ++BBI) {
Vikram S. Advecb202e32002-10-11 16:12:40 +0000492
Chris Lattnerf726e772002-10-28 19:22:04 +0000493 MachineBasicBlock &MBB = *BBI;
Vikram S. Adved0d06ad2003-05-31 07:32:01 +0000494
495 // Iterate over all machine instructions in BB and mark operands with
496 // their assigned registers or insert spill code, as appropriate.
497 // Also, fix operands of call/return instructions.
Vikram S. Adved0d06ad2003-05-31 07:32:01 +0000498 for (MachineBasicBlock::iterator MII = MBB.begin(); MII != MBB.end(); ++MII)
Vikram S. Adve814030a2003-07-29 19:49:21 +0000499 if (! TM.getInstrInfo().isDummyPhiInstr((*MII)->getOpCode()))
500 updateInstruction(MII, MBB);
Vikram S. Adved0d06ad2003-05-31 07:32:01 +0000501
502 // Now, move code out of delay slots of branches and returns if needed.
503 // (Also, move "after" code from calls to the last delay slot instruction.)
504 // Moving code out of delay slots is needed in 2 situations:
505 // (1) If this is a branch and it needs instructions inserted after it,
506 // move any existing instructions out of the delay slot so that the
507 // instructions can go into the delay slot. This only supports the
508 // case that #instrsAfter <= #delay slots.
509 //
510 // (2) If any instruction in the delay slot needs
511 // instructions inserted, move it out of the delay slot and before the
512 // branch because putting code before or after it would be VERY BAD!
513 //
514 // If the annul bit of the branch is set, neither of these is legal!
515 // If so, we need to handle spill differently but annulling is not yet used.
Vikram S. Adved0d06ad2003-05-31 07:32:01 +0000516 for (MachineBasicBlock::iterator MII = MBB.begin();
517 MII != MBB.end(); ++MII)
518 if (unsigned delaySlots =
519 TM.getInstrInfo().getNumDelaySlots((*MII)->getOpCode()))
520 {
Vikram S. Adve814030a2003-07-29 19:49:21 +0000521 MachineInstr *MInst = *MII, *DelaySlotMI = *(MII+1);
522
Vikram S. Adved0d06ad2003-05-31 07:32:01 +0000523 // Check the 2 conditions above:
524 // (1) Does a branch need instructions added after it?
525 // (2) O/w does delay slot instr. need instrns before or after?
Vikram S. Adve814030a2003-07-29 19:49:21 +0000526 bool isBranch = (TM.getInstrInfo().isBranch(MInst->getOpCode()) ||
527 TM.getInstrInfo().isReturn(MInst->getOpCode()));
528 bool cond1 = (isBranch &&
529 AddedInstrMap.count(MInst) &&
530 AddedInstrMap[MInst].InstrnsAfter.size() > 0);
531 bool cond2 = (AddedInstrMap.count(DelaySlotMI) &&
532 (AddedInstrMap[DelaySlotMI].InstrnsBefore.size() > 0 ||
533 AddedInstrMap[DelaySlotMI].InstrnsAfter.size() > 0));
Vikram S. Adved0d06ad2003-05-31 07:32:01 +0000534
535 if (cond1 || cond2)
536 {
Vikram S. Adve814030a2003-07-29 19:49:21 +0000537 assert((MInst->getOpCodeFlags() & AnnulFlag) == 0 &&
538 "FIXME: Moving an annulled delay slot instruction!");
539 assert(delaySlots==1 &&
540 "InsertBefore does not yet handle >1 delay slots!");
541 InsertBefore(DelaySlotMI, MBB, MII); // MII pts back to branch
Vikram S. Adved0d06ad2003-05-31 07:32:01 +0000542
543 // In case (1), delete it and don't replace with anything!
544 // Otherwise (i.e., case (2) only) replace it with a NOP.
545 if (cond1) {
Vikram S. Adve814030a2003-07-29 19:49:21 +0000546 DeleteInstruction(MBB, ++MII); // MII now points to next inst.
547 --MII; // reset MII for ++MII of loop
Vikram S. Adved0d06ad2003-05-31 07:32:01 +0000548 }
Vikram S. Adve814030a2003-07-29 19:49:21 +0000549 else
550 SubstituteInPlace(BuildMI(TM.getInstrInfo().getNOPOpCode(),1),
551 MBB, MII+1); // replace with NOP
552
553 if (DEBUG_RA) {
Chris Lattnerc083dcc2003-09-01 20:05:47 +0000554 std::cerr << "\nRegAlloc: Moved instr. with added code: "
Vikram S. Adve814030a2003-07-29 19:49:21 +0000555 << *DelaySlotMI
556 << " out of delay slots of instr: " << *MInst;
Vikram S. Adved0d06ad2003-05-31 07:32:01 +0000557 }
558 }
Vikram S. Adve814030a2003-07-29 19:49:21 +0000559 else
560 // For non-branch instr with delay slots (probably a call), move
561 // InstrAfter to the instr. in the last delay slot.
562 move2DelayedInstr(*MII, *(MII+delaySlots));
Vikram S. Adved0d06ad2003-05-31 07:32:01 +0000563 }
564
565 // Finally iterate over all instructions in BB and insert before/after
Vikram S. Advebc001b22003-07-25 21:06:09 +0000566 for (MachineBasicBlock::iterator MII=MBB.begin(); MII != MBB.end(); ++MII) {
Vikram S. Adve48762092002-04-25 04:34:15 +0000567 MachineInstr *MInst = *MII;
Vikram S. Advebc001b22003-07-25 21:06:09 +0000568
Ruchira Sasanka65480b72001-11-10 21:21:36 +0000569 // do not process Phis
Vikram S. Advebc001b22003-07-25 21:06:09 +0000570 if (TM.getInstrInfo().isDummyPhiInstr(MInst->getOpCode()))
Ruchira Sasanka65480b72001-11-10 21:21:36 +0000571 continue;
572
Vikram S. Advebc001b22003-07-25 21:06:09 +0000573 // if there are any added instructions...
Chris Lattner7e708292002-06-25 16:13:24 +0000574 if (AddedInstrMap.count(MInst)) {
Vikram S. Advebc001b22003-07-25 21:06:09 +0000575 AddedInstrns &CallAI = AddedInstrMap[MInst];
576
577#ifndef NDEBUG
Vikram S. Adve814030a2003-07-29 19:49:21 +0000578 bool isBranch = (TM.getInstrInfo().isBranch(MInst->getOpCode()) ||
579 TM.getInstrInfo().isReturn(MInst->getOpCode()));
580 assert((!isBranch ||
581 AddedInstrMap[MInst].InstrnsAfter.size() <=
582 TM.getInstrInfo().getNumDelaySlots(MInst->getOpCode())) &&
583 "Cannot put more than #delaySlots instrns after "
584 "branch or return! Need to handle temps differently.");
585#endif
586
587#ifndef NDEBUG
Vikram S. Advebc001b22003-07-25 21:06:09 +0000588 // Temporary sanity checking code to detect whether the same machine
589 // instruction is ever inserted twice before/after a call.
590 // I suspect this is happening but am not sure. --Vikram, 7/1/03.
Vikram S. Advebc001b22003-07-25 21:06:09 +0000591 std::set<const MachineInstr*> instrsSeen;
592 for (int i = 0, N = CallAI.InstrnsBefore.size(); i < N; ++i) {
593 assert(instrsSeen.count(CallAI.InstrnsBefore[i]) == 0 &&
594 "Duplicate machine instruction in InstrnsBefore!");
595 instrsSeen.insert(CallAI.InstrnsBefore[i]);
596 }
597 for (int i = 0, N = CallAI.InstrnsAfter.size(); i < N; ++i) {
598 assert(instrsSeen.count(CallAI.InstrnsAfter[i]) == 0 &&
599 "Duplicate machine instruction in InstrnsBefore/After!");
600 instrsSeen.insert(CallAI.InstrnsAfter[i]);
601 }
602#endif
603
604 // Now add the instructions before/after this MI.
605 // We do this here to ensure that spill for an instruction is inserted
606 // as close as possible to an instruction (see above insertCode4Spill)
Vikram S. Advebc001b22003-07-25 21:06:09 +0000607 if (! CallAI.InstrnsBefore.empty())
608 PrependInstructions(CallAI.InstrnsBefore, MBB, MII,"");
609
610 if (! CallAI.InstrnsAfter.empty())
611 AppendInstructions(CallAI.InstrnsAfter, MBB, MII,"");
612
613 } // if there are any added instructions
Ruchira Sasankac4d4b762001-10-16 01:23:19 +0000614 } // for each machine instruction
Ruchira Sasanka0931a012001-09-15 19:06:58 +0000615 }
616}
617
618
Ruchira Sasanka5a61d852001-11-08 16:43:25 +0000619//----------------------------------------------------------------------------
620// This method inserts spill code for AN operand whose LR was spilled.
621// This method may be called several times for a single machine instruction
622// if it contains many spilled operands. Each time it is called, it finds
623// a register which is not live at that instruction and also which is not
624// used by other spilled operands of the same instruction. Then it uses
Misha Brukman37f92e22003-09-11 22:34:13 +0000625// this register temporarily to accommodate the spilled value.
Ruchira Sasanka5a61d852001-11-08 16:43:25 +0000626//----------------------------------------------------------------------------
Vikram S. Advebc001b22003-07-25 21:06:09 +0000627
Ruchira Sasanka5a61d852001-11-08 16:43:25 +0000628void PhyRegAlloc::insertCode4SpilledLR(const LiveRange *LR,
Vikram S. Adve814030a2003-07-29 19:49:21 +0000629 MachineBasicBlock::iterator& MII,
630 MachineBasicBlock &MBB,
Ruchira Sasanka5a61d852001-11-08 16:43:25 +0000631 const unsigned OpNum) {
Vikram S. Adve814030a2003-07-29 19:49:21 +0000632 MachineInstr *MInst = *MII;
633 const BasicBlock *BB = MBB.getBasicBlock();
634
Vikram S. Advead9c9782002-09-28 17:02:40 +0000635 assert((! TM.getInstrInfo().isCall(MInst->getOpCode()) || OpNum == 0) &&
636 "Outgoing arg of a call must be handled elsewhere (func arg ok)");
637 assert(! TM.getInstrInfo().isReturn(MInst->getOpCode()) &&
638 "Return value of a ret must be handled elsewhere");
Ruchira Sasankaba9d5db2001-11-15 20:23:19 +0000639
Ruchira Sasanka5a61d852001-11-08 16:43:25 +0000640 MachineOperand& Op = MInst->getOperand(OpNum);
Vikram S. Adve5f2180c2003-05-27 00:05:23 +0000641 bool isDef = Op.opIsDefOnly();
642 bool isDefAndUse = Op.opIsDefAndUse();
Vikram S. Advebc001b22003-07-25 21:06:09 +0000643 unsigned RegType = MRI.getRegTypeForLR(LR);
Ruchira Sasanka5a61d852001-11-08 16:43:25 +0000644 int SpillOff = LR->getSpillOffFromFP();
645 RegClass *RC = LR->getRegClass();
Vikram S. Adve814030a2003-07-29 19:49:21 +0000646
647 // Get the live-variable set to find registers free before this instr.
Vikram S. Advefeb32982003-08-12 22:22:24 +0000648 const ValueSet &LVSetBef = LVI->getLiveVarSetBeforeMInst(MInst, BB);
649
650#ifndef NDEBUG
651 // If this instr. is in the delay slot of a branch or return, we need to
652 // include all live variables before that branch or return -- we don't want to
653 // trample those! Verify that the set is included in the LV set before MInst.
Vikram S. Adve814030a2003-07-29 19:49:21 +0000654 if (MII != MBB.begin()) {
655 MachineInstr *PredMI = *(MII-1);
Vikram S. Advefeb32982003-08-12 22:22:24 +0000656 if (unsigned DS = TM.getInstrInfo().getNumDelaySlots(PredMI->getOpCode()))
657 assert(set_difference(LVI->getLiveVarSetBeforeMInst(PredMI), LVSetBef)
658 .empty() && "Live-var set before branch should be included in "
659 "live-var set of each delay slot instruction!");
Vikram S. Adve814030a2003-07-29 19:49:21 +0000660 }
Vikram S. Advefeb32982003-08-12 22:22:24 +0000661#endif
Vikram S. Adve00521d72001-11-12 23:26:35 +0000662
Brian Gaeke4efe3422003-09-21 01:23:46 +0000663 MF->getInfo()->pushTempValue(MRI.getSpilledRegSize(RegType) );
Ruchira Sasanka5a61d852001-11-08 16:43:25 +0000664
Chris Lattnerc083dcc2003-09-01 20:05:47 +0000665 std::vector<MachineInstr*> MIBef, MIAft;
666 std::vector<MachineInstr*> AdIMid;
Ruchira Sasankaba9d5db2001-11-15 20:23:19 +0000667
Vikram S. Adve3bf08922003-07-10 19:42:55 +0000668 // Choose a register to hold the spilled value, if one was not preallocated.
669 // This may insert code before and after MInst to free up the value. If so,
670 // this code should be first/last in the spill sequence before/after MInst.
671 int TmpRegU=(LR->hasColor()
672 ? MRI.getUnifiedRegNum(LR->getRegClass()->getID(),LR->getColor())
673 : getUsableUniRegAtMI(RegType, &LVSetBef, MInst, MIBef,MIAft));
Ruchira Sasankaba9d5db2001-11-15 20:23:19 +0000674
Vikram S. Advef5af6362002-07-08 23:15:32 +0000675 // Set the operand first so that it this register does not get used
676 // as a scratch register for later calls to getUsableUniRegAtMI below
677 MInst->SetRegForOperand(OpNum, TmpRegU);
678
679 // get the added instructions for this instruction
Chris Lattner0b0ffa02002-04-09 05:13:04 +0000680 AddedInstrns &AI = AddedInstrMap[MInst];
Vikram S. Advef5af6362002-07-08 23:15:32 +0000681
682 // We may need a scratch register to copy the spilled value to/from memory.
683 // This may itself have to insert code to free up a scratch register.
684 // Any such code should go before (after) the spill code for a load (store).
Vikram S. Adved0d06ad2003-05-31 07:32:01 +0000685 // The scratch reg is not marked as used because it is only used
686 // for the copy and not used across MInst.
Vikram S. Advef5af6362002-07-08 23:15:32 +0000687 int scratchRegType = -1;
688 int scratchReg = -1;
689 if (MRI.regTypeNeedsScratchReg(RegType, scratchRegType))
690 {
Chris Lattner27a08932002-10-22 23:16:21 +0000691 scratchReg = getUsableUniRegAtMI(scratchRegType, &LVSetBef,
692 MInst, MIBef, MIAft);
Vikram S. Advef5af6362002-07-08 23:15:32 +0000693 assert(scratchReg != MRI.getInvalidRegNum());
Vikram S. Advef5af6362002-07-08 23:15:32 +0000694 }
695
696 if (!isDef || isDefAndUse) {
Ruchira Sasanka5a61d852001-11-08 16:43:25 +0000697 // for a USE, we have to load the value of LR from stack to a TmpReg
698 // and use the TmpReg as one operand of instruction
Vikram S. Advedabb41d2002-05-19 15:29:31 +0000699
Vikram S. Advef5af6362002-07-08 23:15:32 +0000700 // actual loading instruction(s)
Vikram S. Adve814030a2003-07-29 19:49:21 +0000701 MRI.cpMem2RegMI(AdIMid, MRI.getFramePointer(), SpillOff, TmpRegU,
702 RegType, scratchReg);
Ruchira Sasanka226f1f02001-11-08 19:11:30 +0000703
Vikram S. Advef5af6362002-07-08 23:15:32 +0000704 // the actual load should be after the instructions to free up TmpRegU
705 MIBef.insert(MIBef.end(), AdIMid.begin(), AdIMid.end());
706 AdIMid.clear();
707 }
708
Vikram S. Adve3bf08922003-07-10 19:42:55 +0000709 if (isDef || isDefAndUse) { // if this is a Def
Ruchira Sasanka5a61d852001-11-08 16:43:25 +0000710 // for a DEF, we have to store the value produced by this instruction
711 // on the stack position allocated for this LR
Vikram S. Advedabb41d2002-05-19 15:29:31 +0000712
Vikram S. Advef5af6362002-07-08 23:15:32 +0000713 // actual storing instruction(s)
Vikram S. Adve814030a2003-07-29 19:49:21 +0000714 MRI.cpReg2MemMI(AdIMid, TmpRegU, MRI.getFramePointer(), SpillOff,
715 RegType, scratchReg);
Vikram S. Advedabb41d2002-05-19 15:29:31 +0000716
Vikram S. Advef5af6362002-07-08 23:15:32 +0000717 MIAft.insert(MIAft.begin(), AdIMid.begin(), AdIMid.end());
Ruchira Sasanka5a61d852001-11-08 16:43:25 +0000718 } // if !DEF
Vikram S. Advedabb41d2002-05-19 15:29:31 +0000719
Vikram S. Advef5af6362002-07-08 23:15:32 +0000720 // Finally, insert the entire spill code sequences before/after MInst
721 AI.InstrnsBefore.insert(AI.InstrnsBefore.end(), MIBef.begin(), MIBef.end());
722 AI.InstrnsAfter.insert(AI.InstrnsAfter.begin(), MIAft.begin(), MIAft.end());
723
Chris Lattner7e708292002-06-25 16:13:24 +0000724 if (DEBUG_RA) {
Chris Lattnerc083dcc2003-09-01 20:05:47 +0000725 std::cerr << "\nFor Inst:\n " << *MInst;
726 std::cerr << "SPILLED LR# " << LR->getUserIGNode()->getIndex();
727 std::cerr << "; added Instructions:";
Anand Shuklad58290e2002-07-09 19:18:56 +0000728 for_each(MIBef.begin(), MIBef.end(), std::mem_fun(&MachineInstr::dump));
729 for_each(MIAft.begin(), MIAft.end(), std::mem_fun(&MachineInstr::dump));
Chris Lattner7e708292002-06-25 16:13:24 +0000730 }
Ruchira Sasanka5a61d852001-11-08 16:43:25 +0000731}
732
733
Vikram S. Adve814030a2003-07-29 19:49:21 +0000734//----------------------------------------------------------------------------
Misha Brukman37f92e22003-09-11 22:34:13 +0000735// This method inserts caller saving/restoring instructions before/after
Vikram S. Adve814030a2003-07-29 19:49:21 +0000736// a call machine instruction. The caller saving/restoring instructions are
737// inserted like:
738// ** caller saving instructions
739// other instructions inserted for the call by ColorCallArg
740// CALL instruction
741// other instructions inserted for the call ColorCallArg
742// ** caller restoring instructions
743//----------------------------------------------------------------------------
744
745void
746PhyRegAlloc::insertCallerSavingCode(std::vector<MachineInstr*> &instrnsBefore,
747 std::vector<MachineInstr*> &instrnsAfter,
748 MachineInstr *CallMI,
749 const BasicBlock *BB)
750{
751 assert(TM.getInstrInfo().isCall(CallMI->getOpCode()));
752
Brian Gaeke43ce8fe2003-09-21 02:24:09 +0000753 // hash set to record which registers were saved/restored
Vikram S. Adve814030a2003-07-29 19:49:21 +0000754 hash_set<unsigned> PushedRegSet;
755
756 CallArgsDescriptor* argDesc = CallArgsDescriptor::get(CallMI);
757
758 // if the call is to a instrumentation function, do not insert save and
759 // restore instructions the instrumentation function takes care of save
760 // restore for volatile regs.
761 //
762 // FIXME: this should be made general, not specific to the reoptimizer!
Vikram S. Adve814030a2003-07-29 19:49:21 +0000763 const Function *Callee = argDesc->getCallInst()->getCalledFunction();
764 bool isLLVMFirstTrigger = Callee && Callee->getName() == "llvm_first_trigger";
765
766 // Now check if the call has a return value (using argDesc) and if so,
767 // find the LR of the TmpInstruction representing the return value register.
768 // (using the last or second-last *implicit operand* of the call MI).
769 // Insert it to to the PushedRegSet since we must not save that register
770 // and restore it after the call.
771 // We do this because, we look at the LV set *after* the instruction
772 // to determine, which LRs must be saved across calls. The return value
773 // of the call is live in this set - but we must not save/restore it.
Vikram S. Adve814030a2003-07-29 19:49:21 +0000774 if (const Value *origRetVal = argDesc->getReturnValue()) {
775 unsigned retValRefNum = (CallMI->getNumImplicitRefs() -
776 (argDesc->getIndirectFuncPtr()? 1 : 2));
777 const TmpInstruction* tmpRetVal =
778 cast<TmpInstruction>(CallMI->getImplicitRef(retValRefNum));
779 assert(tmpRetVal->getOperand(0) == origRetVal &&
780 tmpRetVal->getType() == origRetVal->getType() &&
781 "Wrong implicit ref?");
Brian Gaeke4efe3422003-09-21 01:23:46 +0000782 LiveRange *RetValLR = LRI->getLiveRangeForValue(tmpRetVal);
Vikram S. Adve814030a2003-07-29 19:49:21 +0000783 assert(RetValLR && "No LR for RetValue of call");
784
785 if (! RetValLR->isMarkedForSpill())
786 PushedRegSet.insert(MRI.getUnifiedRegNum(RetValLR->getRegClassID(),
787 RetValLR->getColor()));
788 }
789
790 const ValueSet &LVSetAft = LVI->getLiveVarSetAfterMInst(CallMI, BB);
791 ValueSet::const_iterator LIt = LVSetAft.begin();
792
793 // for each live var in live variable set after machine inst
794 for( ; LIt != LVSetAft.end(); ++LIt) {
Brian Gaeke43ce8fe2003-09-21 02:24:09 +0000795 // get the live range corresponding to live var
Brian Gaeke4efe3422003-09-21 01:23:46 +0000796 LiveRange *const LR = LRI->getLiveRangeForValue(*LIt);
Vikram S. Adve814030a2003-07-29 19:49:21 +0000797
798 // LR can be null if it is a const since a const
799 // doesn't have a dominating def - see Assumptions above
800 if( LR ) {
Vikram S. Adve814030a2003-07-29 19:49:21 +0000801 if(! LR->isMarkedForSpill()) {
Vikram S. Adve814030a2003-07-29 19:49:21 +0000802 assert(LR->hasColor() && "LR is neither spilled nor colored?");
803 unsigned RCID = LR->getRegClassID();
804 unsigned Color = LR->getColor();
805
806 if (MRI.isRegVolatile(RCID, Color) ) {
Brian Gaeke43ce8fe2003-09-21 02:24:09 +0000807 // if this is a call to the first-level reoptimizer
808 // instrumentation entry point, and the register is not
809 // modified by call, don't save and restore it.
Vikram S. Adve814030a2003-07-29 19:49:21 +0000810 if (isLLVMFirstTrigger && !MRI.modifiedByCall(RCID, Color))
811 continue;
812
813 // if the value is in both LV sets (i.e., live before and after
814 // the call machine instruction)
Vikram S. Adve814030a2003-07-29 19:49:21 +0000815 unsigned Reg = MRI.getUnifiedRegNum(RCID, Color);
816
Brian Gaeke43ce8fe2003-09-21 02:24:09 +0000817 // if we haven't already pushed this register...
Vikram S. Adve814030a2003-07-29 19:49:21 +0000818 if( PushedRegSet.find(Reg) == PushedRegSet.end() ) {
Vikram S. Adve814030a2003-07-29 19:49:21 +0000819 unsigned RegType = MRI.getRegTypeForLR(LR);
820
821 // Now get two instructions - to push on stack and pop from stack
822 // and add them to InstrnsBefore and InstrnsAfter of the
823 // call instruction
Vikram S. Adve814030a2003-07-29 19:49:21 +0000824 int StackOff =
Brian Gaeke4efe3422003-09-21 01:23:46 +0000825 MF->getInfo()->pushTempValue(MRI.getSpilledRegSize(RegType));
Vikram S. Adve814030a2003-07-29 19:49:21 +0000826
827 //---- Insert code for pushing the reg on stack ----------
828
829 std::vector<MachineInstr*> AdIBef, AdIAft;
830
831 // We may need a scratch register to copy the saved value
832 // to/from memory. This may itself have to insert code to
833 // free up a scratch register. Any such code should go before
834 // the save code. The scratch register, if any, is by default
835 // temporary and not "used" by the instruction unless the
836 // copy code itself decides to keep the value in the scratch reg.
837 int scratchRegType = -1;
838 int scratchReg = -1;
839 if (MRI.regTypeNeedsScratchReg(RegType, scratchRegType))
840 { // Find a register not live in the LVSet before CallMI
841 const ValueSet &LVSetBef =
842 LVI->getLiveVarSetBeforeMInst(CallMI, BB);
843 scratchReg = getUsableUniRegAtMI(scratchRegType, &LVSetBef,
844 CallMI, AdIBef, AdIAft);
845 assert(scratchReg != MRI.getInvalidRegNum());
846 }
847
848 if (AdIBef.size() > 0)
849 instrnsBefore.insert(instrnsBefore.end(),
850 AdIBef.begin(), AdIBef.end());
851
852 MRI.cpReg2MemMI(instrnsBefore, Reg, MRI.getFramePointer(),
853 StackOff, RegType, scratchReg);
854
855 if (AdIAft.size() > 0)
856 instrnsBefore.insert(instrnsBefore.end(),
857 AdIAft.begin(), AdIAft.end());
858
859 //---- Insert code for popping the reg from the stack ----------
Vikram S. Adve814030a2003-07-29 19:49:21 +0000860 AdIBef.clear();
861 AdIAft.clear();
862
863 // We may need a scratch register to copy the saved value
864 // from memory. This may itself have to insert code to
865 // free up a scratch register. Any such code should go
866 // after the save code. As above, scratch is not marked "used".
Vikram S. Adve814030a2003-07-29 19:49:21 +0000867 scratchRegType = -1;
868 scratchReg = -1;
869 if (MRI.regTypeNeedsScratchReg(RegType, scratchRegType))
870 { // Find a register not live in the LVSet after CallMI
871 scratchReg = getUsableUniRegAtMI(scratchRegType, &LVSetAft,
872 CallMI, AdIBef, AdIAft);
873 assert(scratchReg != MRI.getInvalidRegNum());
874 }
875
876 if (AdIBef.size() > 0)
877 instrnsAfter.insert(instrnsAfter.end(),
878 AdIBef.begin(), AdIBef.end());
879
880 MRI.cpMem2RegMI(instrnsAfter, MRI.getFramePointer(), StackOff,
881 Reg, RegType, scratchReg);
882
883 if (AdIAft.size() > 0)
884 instrnsAfter.insert(instrnsAfter.end(),
885 AdIAft.begin(), AdIAft.end());
886
887 PushedRegSet.insert(Reg);
888
889 if(DEBUG_RA) {
890 std::cerr << "\nFor call inst:" << *CallMI;
891 std::cerr << " -inserted caller saving instrs: Before:\n\t ";
892 for_each(instrnsBefore.begin(), instrnsBefore.end(),
893 std::mem_fun(&MachineInstr::dump));
894 std::cerr << " -and After:\n\t ";
895 for_each(instrnsAfter.begin(), instrnsAfter.end(),
896 std::mem_fun(&MachineInstr::dump));
897 }
898 } // if not already pushed
Vikram S. Adve814030a2003-07-29 19:49:21 +0000899 } // if LR has a volatile color
Vikram S. Adve814030a2003-07-29 19:49:21 +0000900 } // if LR has color
Vikram S. Adve814030a2003-07-29 19:49:21 +0000901 } // if there is a LR for Var
Vikram S. Adve814030a2003-07-29 19:49:21 +0000902 } // for each value in the LV set after instruction
903}
904
905
Ruchira Sasanka174bded2001-10-28 18:12:02 +0000906//----------------------------------------------------------------------------
907// We can use the following method to get a temporary register to be used
908// BEFORE any given machine instruction. If there is a register available,
909// this method will simply return that register and set MIBef = MIAft = NULL.
910// Otherwise, it will return a register and MIAft and MIBef will contain
911// two instructions used to free up this returned register.
Ruchira Sasanka80b1a1a2001-11-03 20:41:22 +0000912// Returned register number is the UNIFIED register number
Ruchira Sasanka174bded2001-10-28 18:12:02 +0000913//----------------------------------------------------------------------------
914
Vikram S. Advef5af6362002-07-08 23:15:32 +0000915int PhyRegAlloc::getUsableUniRegAtMI(const int RegType,
916 const ValueSet *LVSetBef,
917 MachineInstr *MInst,
918 std::vector<MachineInstr*>& MIBef,
919 std::vector<MachineInstr*>& MIAft) {
Chris Lattner133f0792002-10-28 04:45:29 +0000920 RegClass* RC = getRegClassByID(MRI.getRegClassIDOfRegType(RegType));
Vikram S. Advef5af6362002-07-08 23:15:32 +0000921
Vikram S. Advebc001b22003-07-25 21:06:09 +0000922 int RegU = getUnusedUniRegAtMI(RC, RegType, MInst, LVSetBef);
Vikram S. Advef5af6362002-07-08 23:15:32 +0000923
924 if (RegU == -1) {
Ruchira Sasanka80b1a1a2001-11-03 20:41:22 +0000925 // we couldn't find an unused register. Generate code to free up a reg by
Ruchira Sasanka174bded2001-10-28 18:12:02 +0000926 // saving it on stack and restoring after the instruction
Vikram S. Advef5af6362002-07-08 23:15:32 +0000927
Brian Gaeke4efe3422003-09-21 01:23:46 +0000928 int TmpOff = MF->getInfo()->pushTempValue(MRI.getSpilledRegSize(RegType));
Vikram S. Adve12af1642001-11-08 04:48:50 +0000929
Vikram S. Advebc001b22003-07-25 21:06:09 +0000930 RegU = getUniRegNotUsedByThisInst(RC, RegType, MInst);
Vikram S. Advedabb41d2002-05-19 15:29:31 +0000931
Vikram S. Advef5af6362002-07-08 23:15:32 +0000932 // Check if we need a scratch register to copy this register to memory.
933 int scratchRegType = -1;
934 if (MRI.regTypeNeedsScratchReg(RegType, scratchRegType))
935 {
Chris Lattner133f0792002-10-28 04:45:29 +0000936 int scratchReg = getUsableUniRegAtMI(scratchRegType, LVSetBef,
937 MInst, MIBef, MIAft);
Vikram S. Advef5af6362002-07-08 23:15:32 +0000938 assert(scratchReg != MRI.getInvalidRegNum());
939
940 // We may as well hold the value in the scratch register instead
941 // of copying it to memory and back. But we have to mark the
942 // register as used by this instruction, so it does not get used
943 // as a scratch reg. by another operand or anyone else.
Chris Lattner3fd1f5b2003-08-05 22:11:13 +0000944 ScratchRegsUsed.insert(std::make_pair(MInst, scratchReg));
Vikram S. Advef5af6362002-07-08 23:15:32 +0000945 MRI.cpReg2RegMI(MIBef, RegU, scratchReg, RegType);
946 MRI.cpReg2RegMI(MIAft, scratchReg, RegU, RegType);
947 }
948 else
949 { // the register can be copied directly to/from memory so do it.
950 MRI.cpReg2MemMI(MIBef, RegU, MRI.getFramePointer(), TmpOff, RegType);
951 MRI.cpMem2RegMI(MIAft, MRI.getFramePointer(), TmpOff, RegU, RegType);
952 }
Ruchira Sasanka174bded2001-10-28 18:12:02 +0000953 }
Vikram S. Advef5af6362002-07-08 23:15:32 +0000954
Ruchira Sasankaba9d5db2001-11-15 20:23:19 +0000955 return RegU;
Ruchira Sasanka174bded2001-10-28 18:12:02 +0000956}
957
Vikram S. Adve814030a2003-07-29 19:49:21 +0000958
Ruchira Sasanka174bded2001-10-28 18:12:02 +0000959//----------------------------------------------------------------------------
Vikram S. Adve814030a2003-07-29 19:49:21 +0000960// This method is called to get a new unused register that can be used
Misha Brukman37f92e22003-09-11 22:34:13 +0000961// to accommodate a temporary value. This method may be called several times
Vikram S. Adve814030a2003-07-29 19:49:21 +0000962// for a single machine instruction. Each time it is called, it finds a
963// register which is not live at that instruction and also which is not used
964// by other spilled operands of the same instruction. Return register number
965// is relative to the register class, NOT the unified number.
Ruchira Sasanka174bded2001-10-28 18:12:02 +0000966//----------------------------------------------------------------------------
Vikram S. Adved0d06ad2003-05-31 07:32:01 +0000967
Ruchira Sasankaba9d5db2001-11-15 20:23:19 +0000968int PhyRegAlloc::getUnusedUniRegAtMI(RegClass *RC,
Vikram S. Advebc001b22003-07-25 21:06:09 +0000969 const int RegType,
Vikram S. Adve814030a2003-07-29 19:49:21 +0000970 const MachineInstr *MInst,
971 const ValueSet* LVSetBef) {
Vikram S. Advebc001b22003-07-25 21:06:09 +0000972 RC->clearColorsUsed(); // Reset array
Vikram S. Adve814030a2003-07-29 19:49:21 +0000973
974 if (LVSetBef == NULL) {
975 LVSetBef = &LVI->getLiveVarSetBeforeMInst(MInst);
976 assert(LVSetBef != NULL && "Unable to get live-var set before MInst?");
977 }
978
Chris Lattner296b7732002-02-05 02:52:05 +0000979 ValueSet::const_iterator LIt = LVSetBef->begin();
Ruchira Sasanka174bded2001-10-28 18:12:02 +0000980
981 // for each live var in live variable set after machine inst
Chris Lattner7e708292002-06-25 16:13:24 +0000982 for ( ; LIt != LVSetBef->end(); ++LIt) {
Brian Gaeke43ce8fe2003-09-21 02:24:09 +0000983 // Get the live range corresponding to live var, and its RegClass
Brian Gaeke4efe3422003-09-21 01:23:46 +0000984 LiveRange *const LRofLV = LRI->getLiveRangeForValue(*LIt );
Ruchira Sasanka174bded2001-10-28 18:12:02 +0000985
986 // LR can be null if it is a const since a const
987 // doesn't have a dominating def - see Assumptions above
Vikram S. Advebc001b22003-07-25 21:06:09 +0000988 if (LRofLV && LRofLV->getRegClass() == RC && LRofLV->hasColor())
989 RC->markColorsUsed(LRofLV->getColor(),
990 MRI.getRegTypeForLR(LRofLV), RegType);
Ruchira Sasanka174bded2001-10-28 18:12:02 +0000991 }
992
993 // It is possible that one operand of this MInst was already spilled
994 // and it received some register temporarily. If that's the case,
995 // it is recorded in machine operand. We must skip such registers.
Vikram S. Advebc001b22003-07-25 21:06:09 +0000996 setRelRegsUsedByThisInst(RC, RegType, MInst);
Ruchira Sasanka174bded2001-10-28 18:12:02 +0000997
Vikram S. Advebc001b22003-07-25 21:06:09 +0000998 int unusedReg = RC->getUnusedColor(RegType); // find first unused color
999 if (unusedReg >= 0)
1000 return MRI.getUnifiedRegNum(RC->getID(), unusedReg);
1001
Chris Lattner85c54652002-05-23 15:50:03 +00001002 return -1;
Ruchira Sasanka174bded2001-10-28 18:12:02 +00001003}
1004
1005
Ruchira Sasankaba9d5db2001-11-15 20:23:19 +00001006//----------------------------------------------------------------------------
1007// Get any other register in a register class, other than what is used
1008// by operands of a machine instruction. Returns the unified reg number.
1009//----------------------------------------------------------------------------
Brian Gaeke43ce8fe2003-09-21 02:24:09 +00001010
Ruchira Sasankaba9d5db2001-11-15 20:23:19 +00001011int PhyRegAlloc::getUniRegNotUsedByThisInst(RegClass *RC,
Vikram S. Advebc001b22003-07-25 21:06:09 +00001012 const int RegType,
Chris Lattner85c54652002-05-23 15:50:03 +00001013 const MachineInstr *MInst) {
Vikram S. Advebc001b22003-07-25 21:06:09 +00001014 RC->clearColorsUsed();
Ruchira Sasankaba9d5db2001-11-15 20:23:19 +00001015
Vikram S. Advebc001b22003-07-25 21:06:09 +00001016 setRelRegsUsedByThisInst(RC, RegType, MInst);
Ruchira Sasankaba9d5db2001-11-15 20:23:19 +00001017
Vikram S. Advebc001b22003-07-25 21:06:09 +00001018 // find the first unused color
1019 int unusedReg = RC->getUnusedColor(RegType);
1020 assert(unusedReg >= 0 &&
1021 "FATAL: No free register could be found in reg class!!");
Ruchira Sasankaba9d5db2001-11-15 20:23:19 +00001022
Vikram S. Advebc001b22003-07-25 21:06:09 +00001023 return MRI.getUnifiedRegNum(RC->getID(), unusedReg);
Ruchira Sasankaba9d5db2001-11-15 20:23:19 +00001024}
1025
1026
Ruchira Sasanka174bded2001-10-28 18:12:02 +00001027//----------------------------------------------------------------------------
1028// This method modifies the IsColorUsedArr of the register class passed to it.
1029// It sets the bits corresponding to the registers used by this machine
Ruchira Sasankaf6dfca12001-11-15 15:00:53 +00001030// instructions. Both explicit and implicit operands are set.
Ruchira Sasanka174bded2001-10-28 18:12:02 +00001031//----------------------------------------------------------------------------
Vikram S. Advebc001b22003-07-25 21:06:09 +00001032
Chris Lattner3bed95b2003-08-05 21:55:58 +00001033static void markRegisterUsed(int RegNo, RegClass *RC, int RegType,
1034 const TargetRegInfo &TRI) {
1035 unsigned classId = 0;
1036 int classRegNum = TRI.getClassRegNum(RegNo, classId);
1037 if (RC->getID() == classId)
1038 RC->markColorsUsed(classRegNum, RegType, RegType);
1039}
1040
1041void PhyRegAlloc::setRelRegsUsedByThisInst(RegClass *RC, int RegType,
1042 const MachineInstr *MI)
Vikram S. Adved0d06ad2003-05-31 07:32:01 +00001043{
Chris Lattner3bed95b2003-08-05 21:55:58 +00001044 assert(OperandsColoredMap[MI] == true &&
Vikram S. Adved0d06ad2003-05-31 07:32:01 +00001045 "Illegal to call setRelRegsUsedByThisInst() until colored operands "
1046 "are marked for an instruction.");
Ruchira Sasanka174bded2001-10-28 18:12:02 +00001047
Chris Lattner3bed95b2003-08-05 21:55:58 +00001048 // Add the registers already marked as used by the instruction.
1049 for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i)
1050 if (MI->getOperand(i).hasAllocatedReg())
1051 markRegisterUsed(MI->getOperand(i).getAllocatedRegNum(), RC, RegType,MRI);
1052
1053 for (unsigned i = 0, e = MI->getNumImplicitRefs(); i != e; ++i)
1054 if (MI->getImplicitOp(i).hasAllocatedReg())
1055 markRegisterUsed(MI->getImplicitOp(i).getAllocatedRegNum(), RC,
1056 RegType,MRI);
1057
Chris Lattner3fd1f5b2003-08-05 22:11:13 +00001058 // Add all of the scratch registers that are used to save values across the
1059 // instruction (e.g., for saving state register values).
1060 std::pair<ScratchRegsUsedTy::iterator, ScratchRegsUsedTy::iterator>
1061 IR = ScratchRegsUsed.equal_range(MI);
1062 for (ScratchRegsUsedTy::iterator I = IR.first; I != IR.second; ++I)
1063 markRegisterUsed(I->second, RC, RegType, MRI);
Vikram S. Adved0d06ad2003-05-31 07:32:01 +00001064
Vikram S. Advef5af6362002-07-08 23:15:32 +00001065 // If there are implicit references, mark their allocated regs as well
Chris Lattner3bed95b2003-08-05 21:55:58 +00001066 for (unsigned z=0; z < MI->getNumImplicitRefs(); z++)
Vikram S. Advef5af6362002-07-08 23:15:32 +00001067 if (const LiveRange*
Brian Gaeke4efe3422003-09-21 01:23:46 +00001068 LRofImpRef = LRI->getLiveRangeForValue(MI->getImplicitRef(z)))
Vikram S. Advef5af6362002-07-08 23:15:32 +00001069 if (LRofImpRef->hasColor())
1070 // this implicit reference is in a LR that received a color
Vikram S. Advebc001b22003-07-25 21:06:09 +00001071 RC->markColorsUsed(LRofImpRef->getColor(),
1072 MRI.getRegTypeForLR(LRofImpRef), RegType);
Ruchira Sasanka174bded2001-10-28 18:12:02 +00001073}
1074
1075
Ruchira Sasanka174bded2001-10-28 18:12:02 +00001076//----------------------------------------------------------------------------
Ruchira Sasanka251d8db2001-10-23 21:38:00 +00001077// If there are delay slots for an instruction, the instructions
1078// added after it must really go after the delayed instruction(s).
1079// So, we move the InstrAfter of that instruction to the
1080// corresponding delayed instruction using the following method.
Ruchira Sasanka251d8db2001-10-23 21:38:00 +00001081//----------------------------------------------------------------------------
Ruchira Sasanka251d8db2001-10-23 21:38:00 +00001082
Vikram S. Adved0d06ad2003-05-31 07:32:01 +00001083void PhyRegAlloc::move2DelayedInstr(const MachineInstr *OrigMI,
1084 const MachineInstr *DelayedMI)
1085{
Vikram S. Advefeb32982003-08-12 22:22:24 +00001086 // "added after" instructions of the original instr
1087 std::vector<MachineInstr *> &OrigAft = AddedInstrMap[OrigMI].InstrnsAfter;
1088
1089 if (DEBUG_RA && OrigAft.size() > 0) {
Chris Lattnerc083dcc2003-09-01 20:05:47 +00001090 std::cerr << "\nRegAlloc: Moved InstrnsAfter for: " << *OrigMI;
1091 std::cerr << " to last delay slot instrn: " << *DelayedMI;
Vikram S. Adve814030a2003-07-29 19:49:21 +00001092 }
1093
Ruchira Sasanka251d8db2001-10-23 21:38:00 +00001094 // "added after" instructions of the delayed instr
Vikram S. Adve814030a2003-07-29 19:49:21 +00001095 std::vector<MachineInstr *> &DelayedAft=AddedInstrMap[DelayedMI].InstrnsAfter;
Ruchira Sasanka251d8db2001-10-23 21:38:00 +00001096
1097 // go thru all the "added after instructions" of the original instruction
Vikram S. Adved0d06ad2003-05-31 07:32:01 +00001098 // and append them to the "added after instructions" of the delayed
Ruchira Sasanka251d8db2001-10-23 21:38:00 +00001099 // instructions
Chris Lattner697954c2002-01-20 22:54:45 +00001100 DelayedAft.insert(DelayedAft.end(), OrigAft.begin(), OrigAft.end());
Ruchira Sasanka251d8db2001-10-23 21:38:00 +00001101
1102 // empty the "added after instructions" of the original instruction
1103 OrigAft.clear();
Ruchira Sasanka251d8db2001-10-23 21:38:00 +00001104}
Ruchira Sasanka0931a012001-09-15 19:06:58 +00001105
Ruchira Sasanka6b0a8b52001-09-15 21:11:11 +00001106
Ruchira Sasankaa5ab9642001-09-30 23:11:59 +00001107void PhyRegAlloc::colorIncomingArgs()
1108{
Brian Gaeke4efe3422003-09-21 01:23:46 +00001109 MRI.colorMethodArgs(Fn, *LRI, AddedInstrAtEntry.InstrnsBefore,
Vikram S. Adve814030a2003-07-29 19:49:21 +00001110 AddedInstrAtEntry.InstrnsAfter);
Ruchira Sasankaa5ab9642001-09-30 23:11:59 +00001111}
1112
Ruchira Sasankae727f852001-09-18 22:43:57 +00001113
1114//----------------------------------------------------------------------------
Ruchira Sasanka0e62aa62001-10-19 21:39:31 +00001115// This method calls setSugColorUsable method of each live range. This
1116// will determine whether the suggested color of LR is really usable.
1117// A suggested color is not usable when the suggested color is volatile
1118// AND when there are call interferences
1119//----------------------------------------------------------------------------
1120
1121void PhyRegAlloc::markUnusableSugColors()
1122{
Brian Gaeke4efe3422003-09-21 01:23:46 +00001123 LiveRangeMapType::const_iterator HMI = (LRI->getLiveRangeMap())->begin();
1124 LiveRangeMapType::const_iterator HMIEnd = (LRI->getLiveRangeMap())->end();
Ruchira Sasanka0e62aa62001-10-19 21:39:31 +00001125
Brian Gaeke43ce8fe2003-09-21 02:24:09 +00001126 for (; HMI != HMIEnd ; ++HMI ) {
1127 if (HMI->first) {
1128 LiveRange *L = HMI->second; // get the LiveRange
1129 if (L) {
1130 if (L->hasSuggestedColor()) {
1131 int RCID = L->getRegClass()->getID();
1132 if (MRI.isRegVolatile( RCID, L->getSuggestedColor()) &&
1133 L->isCallInterference() )
1134 L->setSuggestedColorUsable( false );
1135 else
1136 L->setSuggestedColorUsable( true );
1137 }
1138 } // if L->hasSuggestedColor()
1139 }
1140 } // for all LR's in hash map
Ruchira Sasanka0e62aa62001-10-19 21:39:31 +00001141}
1142
1143
Ruchira Sasanka174bded2001-10-28 18:12:02 +00001144//----------------------------------------------------------------------------
1145// The following method will set the stack offsets of the live ranges that
Misha Brukman37f92e22003-09-11 22:34:13 +00001146// are decided to be spilled. This must be called just after coloring the
Ruchira Sasanka174bded2001-10-28 18:12:02 +00001147// LRs using the graph coloring algo. For each live range that is spilled,
1148// this method allocate a new spill position on the stack.
1149//----------------------------------------------------------------------------
Ruchira Sasanka0e62aa62001-10-19 21:39:31 +00001150
Chris Lattner37730942002-02-05 03:52:29 +00001151void PhyRegAlloc::allocateStackSpace4SpilledLRs() {
Chris Lattnerc083dcc2003-09-01 20:05:47 +00001152 if (DEBUG_RA) std::cerr << "\nSetting LR stack offsets for spills...\n";
Ruchira Sasanka0e62aa62001-10-19 21:39:31 +00001153
Brian Gaeke4efe3422003-09-21 01:23:46 +00001154 LiveRangeMapType::const_iterator HMI = LRI->getLiveRangeMap()->begin();
1155 LiveRangeMapType::const_iterator HMIEnd = LRI->getLiveRangeMap()->end();
Ruchira Sasanka174bded2001-10-28 18:12:02 +00001156
Chris Lattner7e708292002-06-25 16:13:24 +00001157 for ( ; HMI != HMIEnd ; ++HMI) {
Chris Lattner37730942002-02-05 03:52:29 +00001158 if (HMI->first && HMI->second) {
Vikram S. Adve3bf08922003-07-10 19:42:55 +00001159 LiveRange *L = HMI->second; // get the LiveRange
1160 if (L->isMarkedForSpill()) { // NOTE: allocating size of long Type **
Brian Gaeke4efe3422003-09-21 01:23:46 +00001161 int stackOffset = MF->getInfo()->allocateSpilledValue(Type::LongTy);
Vikram S. Adve39c94e12002-09-14 23:05:33 +00001162 L->setSpillOffFromFP(stackOffset);
1163 if (DEBUG_RA)
Chris Lattnerc083dcc2003-09-01 20:05:47 +00001164 std::cerr << " LR# " << L->getUserIGNode()->getIndex()
Vikram S. Adve39c94e12002-09-14 23:05:33 +00001165 << ": stack-offset = " << stackOffset << "\n";
1166 }
Chris Lattner37730942002-02-05 03:52:29 +00001167 }
1168 } // for all LR's in hash map
Ruchira Sasanka174bded2001-10-28 18:12:02 +00001169}
Ruchira Sasanka0e62aa62001-10-19 21:39:31 +00001170
Brian Gaeke874f4232003-09-21 02:50:21 +00001171
Ruchira Sasanka0e62aa62001-10-19 21:39:31 +00001172//----------------------------------------------------------------------------
Brian Gaeke305f02d2003-09-16 15:38:05 +00001173// The entry point to Register Allocation
Ruchira Sasankae727f852001-09-18 22:43:57 +00001174//----------------------------------------------------------------------------
Ruchira Sasanka6b0a8b52001-09-15 21:11:11 +00001175
Brian Gaeke4efe3422003-09-21 01:23:46 +00001176bool PhyRegAlloc::runOnFunction (Function &F) {
1177 if (DEBUG_RA)
1178 std::cerr << "\n********* Function "<< F.getName () << " ***********\n";
1179
1180 Fn = &F;
1181 MF = &MachineFunction::get (Fn);
1182 LVI = &getAnalysis<FunctionLiveVarInfo> ();
1183 LRI = new LiveRangeInfo (Fn, TM, RegClassList);
1184 LoopDepthCalc = &getAnalysis<LoopInfo> ();
1185
1186 // Create each RegClass for the target machine and add it to the
1187 // RegClassList. This must be done before calling constructLiveRanges().
1188 for (unsigned rc = 0; rc != NumOfRegClasses; ++rc)
1189 RegClassList.push_back (new RegClass (Fn, &TM.getRegInfo (),
1190 MRI.getMachineRegClass (rc)));
1191
1192 LRI->constructLiveRanges(); // create LR info
Vikram S. Adve39c94e12002-09-14 23:05:33 +00001193 if (DEBUG_RA >= RA_DEBUG_LiveRanges)
Brian Gaeke4efe3422003-09-21 01:23:46 +00001194 LRI->printLiveRanges();
Ruchira Sasankaa5ab9642001-09-30 23:11:59 +00001195
Ruchira Sasanka6b0a8b52001-09-15 21:11:11 +00001196 createIGNodeListsAndIGs(); // create IGNode list and IGs
1197
1198 buildInterferenceGraphs(); // build IGs in all reg classes
Ruchira Sasanka6b0a8b52001-09-15 21:11:11 +00001199
Vikram S. Adve39c94e12002-09-14 23:05:33 +00001200 if (DEBUG_RA >= RA_DEBUG_LiveRanges) {
Ruchira Sasanka6b0a8b52001-09-15 21:11:11 +00001201 // print all LRs in all reg classes
Chris Lattner7e708292002-06-25 16:13:24 +00001202 for ( unsigned rc=0; rc < NumOfRegClasses ; rc++)
1203 RegClassList[rc]->printIGNodeList();
Ruchira Sasankaa5ab9642001-09-30 23:11:59 +00001204
Ruchira Sasanka6b0a8b52001-09-15 21:11:11 +00001205 // print IGs in all register classes
Chris Lattner7e708292002-06-25 16:13:24 +00001206 for ( unsigned rc=0; rc < NumOfRegClasses ; rc++)
1207 RegClassList[rc]->printIG();
Ruchira Sasanka6b0a8b52001-09-15 21:11:11 +00001208 }
Ruchira Sasanka4f3eb222002-01-07 19:19:18 +00001209
Brian Gaeke4efe3422003-09-21 01:23:46 +00001210 LRI->coalesceLRs(); // coalesce all live ranges
Ruchira Sasankaef1b0cb2001-11-03 17:13:27 +00001211
Vikram S. Adve39c94e12002-09-14 23:05:33 +00001212 if (DEBUG_RA >= RA_DEBUG_LiveRanges) {
Ruchira Sasanka6b0a8b52001-09-15 21:11:11 +00001213 // print all LRs in all reg classes
Chris Lattnerf726e772002-10-28 19:22:04 +00001214 for (unsigned rc=0; rc < NumOfRegClasses; rc++)
1215 RegClassList[rc]->printIGNodeList();
Ruchira Sasankaa5ab9642001-09-30 23:11:59 +00001216
Ruchira Sasanka6b0a8b52001-09-15 21:11:11 +00001217 // print IGs in all register classes
Chris Lattnerf726e772002-10-28 19:22:04 +00001218 for (unsigned rc=0; rc < NumOfRegClasses; rc++)
1219 RegClassList[rc]->printIG();
Ruchira Sasanka6b0a8b52001-09-15 21:11:11 +00001220 }
1221
Ruchira Sasanka0e62aa62001-10-19 21:39:31 +00001222 // mark un-usable suggested color before graph coloring algorithm.
1223 // When this is done, the graph coloring algo will not reserve
1224 // suggested color unnecessarily - they can be used by another LR
1225 markUnusableSugColors();
1226
1227 // color all register classes using the graph coloring algo
Chris Lattner7e708292002-06-25 16:13:24 +00001228 for (unsigned rc=0; rc < NumOfRegClasses ; rc++)
Chris Lattnerf726e772002-10-28 19:22:04 +00001229 RegClassList[rc]->colorAllRegs();
Ruchira Sasanka6b0a8b52001-09-15 21:11:11 +00001230
Misha Brukman37f92e22003-09-11 22:34:13 +00001231 // After graph coloring, if some LRs did not receive a color (i.e, spilled)
1232 // a position for such spilled LRs
Ruchira Sasanka174bded2001-10-28 18:12:02 +00001233 allocateStackSpace4SpilledLRs();
Ruchira Sasankaa5ab9642001-09-30 23:11:59 +00001234
Vikram S. Adved0d06ad2003-05-31 07:32:01 +00001235 // Reset the temp. area on the stack before use by the first instruction.
1236 // This will also happen after updating each instruction.
Brian Gaeke4efe3422003-09-21 01:23:46 +00001237 MF->getInfo()->popAllTempValues();
Ruchira Sasankaf90870f2001-11-15 22:02:06 +00001238
Ruchira Sasanka4f3eb222002-01-07 19:19:18 +00001239 // color incoming args - if the correct color was not received
1240 // insert code to copy to the correct register
Ruchira Sasankaa5ab9642001-09-30 23:11:59 +00001241 colorIncomingArgs();
Ruchira Sasankaa5ab9642001-09-30 23:11:59 +00001242
Ruchira Sasanka4f3eb222002-01-07 19:19:18 +00001243 // Now update the machine code with register names and add any
1244 // additional code inserted by the register allocator to the instruction
1245 // stream
Ruchira Sasanka6b0a8b52001-09-15 21:11:11 +00001246 updateMachineCode();
Ruchira Sasanka4f3eb222002-01-07 19:19:18 +00001247
Chris Lattner045e7c82001-09-19 16:26:23 +00001248 if (DEBUG_RA) {
Chris Lattnerc083dcc2003-09-01 20:05:47 +00001249 std::cerr << "\n**** Machine Code After Register Allocation:\n\n";
Brian Gaeke4efe3422003-09-21 01:23:46 +00001250 MF->dump();
Chris Lattner045e7c82001-09-19 16:26:23 +00001251 }
Brian Gaeke4efe3422003-09-21 01:23:46 +00001252
1253 // Tear down temporary data structures
1254 for (unsigned rc = 0; rc < NumOfRegClasses; ++rc)
1255 delete RegClassList[rc];
1256 RegClassList.clear ();
1257 AddedInstrMap.clear ();
1258 OperandsColoredMap.clear ();
1259 ScratchRegsUsed.clear ();
1260 AddedInstrAtEntry.clear ();
1261 delete LRI;
Ruchira Sasanka6b0a8b52001-09-15 21:11:11 +00001262
Brian Gaeke4efe3422003-09-21 01:23:46 +00001263 if (DEBUG_RA) std::cerr << "\nRegister allocation complete!\n";
1264 return false; // Function was not modified
1265}