1 //===-- RegAllocBasic.cpp - basic register allocator ----------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file defines the RABasic function pass, which provides a minimal
11 // implementation of the basic register allocator.
13 //===----------------------------------------------------------------------===//
15 #define DEBUG_TYPE "regalloc"
16 #include "LiveDebugVariables.h"
17 #include "LiveIntervalUnion.h"
18 #include "LiveRangeEdit.h"
19 #include "RegAllocBase.h"
20 #include "RenderMachineFunction.h"
22 #include "VirtRegMap.h"
23 #include "llvm/ADT/OwningPtr.h"
24 #include "llvm/ADT/Statistic.h"
25 #include "llvm/Analysis/AliasAnalysis.h"
26 #include "llvm/Function.h"
27 #include "llvm/PassAnalysisSupport.h"
28 #include "llvm/CodeGen/CalcSpillWeights.h"
29 #include "llvm/CodeGen/LiveIntervalAnalysis.h"
30 #include "llvm/CodeGen/LiveStackAnalysis.h"
31 #include "llvm/CodeGen/MachineFunctionPass.h"
32 #include "llvm/CodeGen/MachineInstr.h"
33 #include "llvm/CodeGen/MachineLoopInfo.h"
34 #include "llvm/CodeGen/MachineRegisterInfo.h"
35 #include "llvm/CodeGen/Passes.h"
36 #include "llvm/CodeGen/RegAllocRegistry.h"
37 #include "llvm/CodeGen/RegisterCoalescer.h"
38 #include "llvm/Target/TargetMachine.h"
39 #include "llvm/Target/TargetOptions.h"
40 #include "llvm/Target/TargetRegisterInfo.h"
42 #include "llvm/ADT/SparseBitVector.h"
44 #include "llvm/Support/Debug.h"
45 #include "llvm/Support/ErrorHandling.h"
46 #include "llvm/Support/raw_ostream.h"
47 #include "llvm/Support/Timer.h"
54 STATISTIC(NumAssigned , "Number of registers assigned");
55 STATISTIC(NumUnassigned , "Number of registers unassigned");
56 STATISTIC(NumNewQueued , "Number of new live ranges queued");
58 static RegisterRegAlloc basicRegAlloc("basic", "basic register allocator",
59 createBasicRegisterAllocator);
61 // Temporary verification option until we can put verification inside
63 static cl::opt<bool, true>
64 VerifyRegAlloc("verify-regalloc", cl::location(RegAllocBase::VerifyEnabled),
65 cl::desc("Verify during register allocation"));
67 const char *RegAllocBase::TimerGroupName = "Register Allocation";
68 bool RegAllocBase::VerifyEnabled = false;
71 struct CompSpillWeight {
72 bool operator()(LiveInterval *A, LiveInterval *B) const {
73 return A->weight < B->weight;
79 /// RABasic provides a minimal implementation of the basic register allocation
80 /// algorithm. It prioritizes live virtual registers by spill weight and spills
81 /// whenever a register is unavailable. This is not practical in production but
82 /// provides a useful baseline both for measuring other allocators and comparing
83 /// the speed of the basic algorithm against other styles of allocators.
84 class RABasic : public MachineFunctionPass, public RegAllocBase
88 BitVector ReservedRegs;
92 RenderMachineFunction *RMF;
95 std::auto_ptr<Spiller> SpillerInstance;
96 std::priority_queue<LiveInterval*, std::vector<LiveInterval*>,
97 CompSpillWeight> Queue;
101 /// Return the pass name.
102 virtual const char* getPassName() const {
103 return "Basic Register Allocator";
106 /// RABasic analysis usage.
107 virtual void getAnalysisUsage(AnalysisUsage &AU) const;
109 virtual void releaseMemory();
111 virtual Spiller &spiller() { return *SpillerInstance; }
113 virtual float getPriority(LiveInterval *LI) { return LI->weight; }
115 virtual void enqueue(LiveInterval *LI) {
119 virtual LiveInterval *dequeue() {
122 LiveInterval *LI = Queue.top();
127 virtual unsigned selectOrSplit(LiveInterval &VirtReg,
128 SmallVectorImpl<LiveInterval*> &SplitVRegs);
130 /// Perform register allocation.
131 virtual bool runOnMachineFunction(MachineFunction &mf);
136 char RABasic::ID = 0;
138 } // end anonymous namespace
140 RABasic::RABasic(): MachineFunctionPass(ID) {
141 initializeLiveDebugVariablesPass(*PassRegistry::getPassRegistry());
142 initializeLiveIntervalsPass(*PassRegistry::getPassRegistry());
143 initializeSlotIndexesPass(*PassRegistry::getPassRegistry());
144 initializeStrongPHIEliminationPass(*PassRegistry::getPassRegistry());
145 initializeRegisterCoalescerAnalysisGroup(*PassRegistry::getPassRegistry());
146 initializeCalculateSpillWeightsPass(*PassRegistry::getPassRegistry());
147 initializeLiveStacksPass(*PassRegistry::getPassRegistry());
148 initializeMachineDominatorTreePass(*PassRegistry::getPassRegistry());
149 initializeMachineLoopInfoPass(*PassRegistry::getPassRegistry());
150 initializeVirtRegMapPass(*PassRegistry::getPassRegistry());
151 initializeRenderMachineFunctionPass(*PassRegistry::getPassRegistry());
154 void RABasic::getAnalysisUsage(AnalysisUsage &AU) const {
155 AU.setPreservesCFG();
156 AU.addRequired<AliasAnalysis>();
157 AU.addPreserved<AliasAnalysis>();
158 AU.addRequired<LiveIntervals>();
159 AU.addPreserved<SlotIndexes>();
160 AU.addRequired<LiveDebugVariables>();
161 AU.addPreserved<LiveDebugVariables>();
163 AU.addRequiredID(StrongPHIEliminationID);
164 AU.addRequiredTransitive<RegisterCoalescer>();
165 AU.addRequired<CalculateSpillWeights>();
166 AU.addRequired<LiveStacks>();
167 AU.addPreserved<LiveStacks>();
168 AU.addRequiredID(MachineDominatorsID);
169 AU.addPreservedID(MachineDominatorsID);
170 AU.addRequired<MachineLoopInfo>();
171 AU.addPreserved<MachineLoopInfo>();
172 AU.addRequired<VirtRegMap>();
173 AU.addPreserved<VirtRegMap>();
174 DEBUG(AU.addRequired<RenderMachineFunction>());
175 MachineFunctionPass::getAnalysisUsage(AU);
178 void RABasic::releaseMemory() {
179 SpillerInstance.reset(0);
180 RegAllocBase::releaseMemory();
184 // Verify each LiveIntervalUnion.
185 void RegAllocBase::verify() {
186 LiveVirtRegBitSet VisitedVRegs;
187 OwningArrayPtr<LiveVirtRegBitSet>
188 unionVRegs(new LiveVirtRegBitSet[PhysReg2LiveUnion.numRegs()]);
190 // Verify disjoint unions.
191 for (unsigned PhysReg = 0; PhysReg < PhysReg2LiveUnion.numRegs(); ++PhysReg) {
192 DEBUG(PhysReg2LiveUnion[PhysReg].print(dbgs(), TRI));
193 LiveVirtRegBitSet &VRegs = unionVRegs[PhysReg];
194 PhysReg2LiveUnion[PhysReg].verify(VRegs);
195 // Union + intersection test could be done efficiently in one pass, but
196 // don't add a method to SparseBitVector unless we really need it.
197 assert(!VisitedVRegs.intersects(VRegs) && "vreg in multiple unions");
198 VisitedVRegs |= VRegs;
201 // Verify vreg coverage.
202 for (LiveIntervals::iterator liItr = LIS->begin(), liEnd = LIS->end();
203 liItr != liEnd; ++liItr) {
204 unsigned reg = liItr->first;
205 if (TargetRegisterInfo::isPhysicalRegister(reg)) continue;
206 if (!VRM->hasPhys(reg)) continue; // spilled?
207 unsigned PhysReg = VRM->getPhys(reg);
208 if (!unionVRegs[PhysReg].test(reg)) {
209 dbgs() << "LiveVirtReg " << reg << " not in union " <<
210 TRI->getName(PhysReg) << "\n";
211 llvm_unreachable("unallocated live vreg");
214 // FIXME: I'm not sure how to verify spilled intervals.
218 //===----------------------------------------------------------------------===//
219 // RegAllocBase Implementation
220 //===----------------------------------------------------------------------===//
222 // Instantiate a LiveIntervalUnion for each physical register.
223 void RegAllocBase::LiveUnionArray::init(LiveIntervalUnion::Allocator &allocator,
227 static_cast<LiveIntervalUnion*>(malloc(sizeof(LiveIntervalUnion)*NRegs));
228 for (unsigned r = 0; r != NRegs; ++r)
229 new(Array + r) LiveIntervalUnion(r, allocator);
232 void RegAllocBase::init(VirtRegMap &vrm, LiveIntervals &lis) {
233 NamedRegionTimer T("Initialize", TimerGroupName, TimePassesIsEnabled);
234 TRI = &vrm.getTargetRegInfo();
235 MRI = &vrm.getRegInfo();
238 const unsigned NumRegs = TRI->getNumRegs();
239 if (NumRegs != PhysReg2LiveUnion.numRegs()) {
240 PhysReg2LiveUnion.init(UnionAllocator, NumRegs);
241 // Cache an interferece query for each physical reg
242 Queries.reset(new LiveIntervalUnion::Query[PhysReg2LiveUnion.numRegs()]);
246 void RegAllocBase::LiveUnionArray::clear() {
249 for (unsigned r = 0; r != NumRegs; ++r)
250 Array[r].~LiveIntervalUnion();
256 void RegAllocBase::releaseMemory() {
257 for (unsigned r = 0, e = PhysReg2LiveUnion.numRegs(); r != e; ++r)
258 PhysReg2LiveUnion[r].clear();
261 // Visit all the live registers. If they are already assigned to a physical
262 // register, unify them with the corresponding LiveIntervalUnion, otherwise push
263 // them on the priority queue for later assignment.
264 void RegAllocBase::seedLiveRegs() {
265 NamedRegionTimer T("Seed Live Regs", TimerGroupName, TimePassesIsEnabled);
266 for (LiveIntervals::iterator I = LIS->begin(), E = LIS->end(); I != E; ++I) {
267 unsigned RegNum = I->first;
268 LiveInterval &VirtReg = *I->second;
269 if (TargetRegisterInfo::isPhysicalRegister(RegNum))
270 PhysReg2LiveUnion[RegNum].unify(VirtReg);
276 void RegAllocBase::assign(LiveInterval &VirtReg, unsigned PhysReg) {
277 DEBUG(dbgs() << "assigning " << PrintReg(VirtReg.reg, TRI)
278 << " to " << PrintReg(PhysReg, TRI) << '\n');
279 assert(!VRM->hasPhys(VirtReg.reg) && "Duplicate VirtReg assignment");
280 VRM->assignVirt2Phys(VirtReg.reg, PhysReg);
281 PhysReg2LiveUnion[PhysReg].unify(VirtReg);
285 void RegAllocBase::unassign(LiveInterval &VirtReg, unsigned PhysReg) {
286 DEBUG(dbgs() << "unassigning " << PrintReg(VirtReg.reg, TRI)
287 << " from " << PrintReg(PhysReg, TRI) << '\n');
288 assert(VRM->getPhys(VirtReg.reg) == PhysReg && "Inconsistent unassign");
289 PhysReg2LiveUnion[PhysReg].extract(VirtReg);
290 VRM->clearVirt(VirtReg.reg);
294 // Top-level driver to manage the queue of unassigned VirtRegs and call the
295 // selectOrSplit implementation.
296 void RegAllocBase::allocatePhysRegs() {
299 // Continue assigning vregs one at a time to available physical registers.
300 while (LiveInterval *VirtReg = dequeue()) {
301 assert(!VRM->hasPhys(VirtReg->reg) && "Register already assigned");
303 // Unused registers can appear when the spiller coalesces snippets.
304 if (MRI->reg_nodbg_empty(VirtReg->reg)) {
305 DEBUG(dbgs() << "Dropping unused " << *VirtReg << '\n');
306 LIS->removeInterval(VirtReg->reg);
310 // Invalidate all interference queries, live ranges could have changed.
313 // selectOrSplit requests the allocator to return an available physical
314 // register if possible and populate a list of new live intervals that
315 // result from splitting.
316 DEBUG(dbgs() << "\nselectOrSplit "
317 << MRI->getRegClass(VirtReg->reg)->getName()
318 << ':' << *VirtReg << '\n');
319 typedef SmallVector<LiveInterval*, 4> VirtRegVec;
320 VirtRegVec SplitVRegs;
321 unsigned AvailablePhysReg = selectOrSplit(*VirtReg, SplitVRegs);
323 if (AvailablePhysReg)
324 assign(*VirtReg, AvailablePhysReg);
326 for (VirtRegVec::iterator I = SplitVRegs.begin(), E = SplitVRegs.end();
328 LiveInterval *SplitVirtReg = *I;
329 assert(!VRM->hasPhys(SplitVirtReg->reg) && "Register already assigned");
330 if (MRI->reg_nodbg_empty(SplitVirtReg->reg)) {
331 DEBUG(dbgs() << "not queueing unused " << *SplitVirtReg << '\n');
332 LIS->removeInterval(SplitVirtReg->reg);
335 DEBUG(dbgs() << "queuing new interval: " << *SplitVirtReg << "\n");
336 assert(TargetRegisterInfo::isVirtualRegister(SplitVirtReg->reg) &&
337 "expect split value in virtual register");
338 enqueue(SplitVirtReg);
344 // Check if this live virtual register interferes with a physical register. If
345 // not, then check for interference on each register that aliases with the
346 // physical register. Return the interfering register.
347 unsigned RegAllocBase::checkPhysRegInterference(LiveInterval &VirtReg,
349 for (const unsigned *AliasI = TRI->getOverlaps(PhysReg); *AliasI; ++AliasI)
350 if (query(VirtReg, *AliasI).checkInterference())
355 // Helper for spillInteferences() that spills all interfering vregs currently
356 // assigned to this physical register.
357 void RegAllocBase::spillReg(LiveInterval& VirtReg, unsigned PhysReg,
358 SmallVectorImpl<LiveInterval*> &SplitVRegs) {
359 LiveIntervalUnion::Query &Q = query(VirtReg, PhysReg);
360 assert(Q.seenAllInterferences() && "need collectInterferences()");
361 const SmallVectorImpl<LiveInterval*> &PendingSpills = Q.interferingVRegs();
363 for (SmallVectorImpl<LiveInterval*>::const_iterator I = PendingSpills.begin(),
364 E = PendingSpills.end(); I != E; ++I) {
365 LiveInterval &SpilledVReg = **I;
366 DEBUG(dbgs() << "extracting from " <<
367 TRI->getName(PhysReg) << " " << SpilledVReg << '\n');
369 // Deallocate the interfering vreg by removing it from the union.
370 // A LiveInterval instance may not be in a union during modification!
371 unassign(SpilledVReg, PhysReg);
373 // Spill the extracted interval.
374 LiveRangeEdit LRE(SpilledVReg, SplitVRegs, 0, &PendingSpills);
375 spiller().spill(LRE);
377 // After extracting segments, the query's results are invalid. But keep the
378 // contents valid until we're done accessing pendingSpills.
382 // Spill or split all live virtual registers currently unified under PhysReg
383 // that interfere with VirtReg. The newly spilled or split live intervals are
384 // returned by appending them to SplitVRegs.
386 RegAllocBase::spillInterferences(LiveInterval &VirtReg, unsigned PhysReg,
387 SmallVectorImpl<LiveInterval*> &SplitVRegs) {
388 // Record each interference and determine if all are spillable before mutating
389 // either the union or live intervals.
390 unsigned NumInterferences = 0;
391 // Collect interferences assigned to any alias of the physical register.
392 for (const unsigned *asI = TRI->getOverlaps(PhysReg); *asI; ++asI) {
393 LiveIntervalUnion::Query &QAlias = query(VirtReg, *asI);
394 NumInterferences += QAlias.collectInterferingVRegs();
395 if (QAlias.seenUnspillableVReg()) {
399 DEBUG(dbgs() << "spilling " << TRI->getName(PhysReg) <<
400 " interferences with " << VirtReg << "\n");
401 assert(NumInterferences > 0 && "expect interference");
403 // Spill each interfering vreg allocated to PhysReg or an alias.
404 for (const unsigned *AliasI = TRI->getOverlaps(PhysReg); *AliasI; ++AliasI)
405 spillReg(VirtReg, *AliasI, SplitVRegs);
409 // Add newly allocated physical registers to the MBB live in sets.
410 void RegAllocBase::addMBBLiveIns(MachineFunction *MF) {
411 NamedRegionTimer T("MBB Live Ins", TimerGroupName, TimePassesIsEnabled);
412 SlotIndexes *Indexes = LIS->getSlotIndexes();
416 LiveIntervalUnion::SegmentIter SI;
417 for (unsigned PhysReg = 0; PhysReg < PhysReg2LiveUnion.numRegs(); ++PhysReg) {
418 LiveIntervalUnion &LiveUnion = PhysReg2LiveUnion[PhysReg];
419 if (LiveUnion.empty())
421 MachineFunction::iterator MBB = llvm::next(MF->begin());
422 MachineFunction::iterator MFE = MF->end();
423 SlotIndex Start, Stop;
424 tie(Start, Stop) = Indexes->getMBBRange(MBB);
425 SI.setMap(LiveUnion.getMap());
428 if (SI.start() <= Start) {
429 if (!MBB->isLiveIn(PhysReg))
430 MBB->addLiveIn(PhysReg);
431 } else if (SI.start() > Stop)
432 MBB = Indexes->getMBBFromIndex(SI.start().getPrevIndex());
435 tie(Start, Stop) = Indexes->getMBBRange(MBB);
442 //===----------------------------------------------------------------------===//
443 // RABasic Implementation
444 //===----------------------------------------------------------------------===//
446 // Driver for the register assignment and splitting heuristics.
447 // Manages iteration over the LiveIntervalUnions.
449 // This is a minimal implementation of register assignment and splitting that
450 // spills whenever we run out of registers.
452 // selectOrSplit can only be called once per live virtual register. We then do a
453 // single interference test for each register the correct class until we find an
454 // available register. So, the number of interference tests in the worst case is
455 // |vregs| * |machineregs|. And since the number of interference tests is
456 // minimal, there is no value in caching them outside the scope of
458 unsigned RABasic::selectOrSplit(LiveInterval &VirtReg,
459 SmallVectorImpl<LiveInterval*> &SplitVRegs) {
460 // Populate a list of physical register spill candidates.
461 SmallVector<unsigned, 8> PhysRegSpillCands;
463 // Check for an available register in this class.
464 const TargetRegisterClass *TRC = MRI->getRegClass(VirtReg.reg);
466 for (TargetRegisterClass::iterator I = TRC->allocation_order_begin(*MF),
467 E = TRC->allocation_order_end(*MF);
470 unsigned PhysReg = *I;
471 if (ReservedRegs.test(PhysReg)) continue;
473 // Check interference and as a side effect, intialize queries for this
474 // VirtReg and its aliases.
475 unsigned interfReg = checkPhysRegInterference(VirtReg, PhysReg);
476 if (interfReg == 0) {
477 // Found an available register.
480 LiveInterval *interferingVirtReg =
481 Queries[interfReg].firstInterference().liveUnionPos().value();
483 // The current VirtReg must either be spillable, or one of its interferences
484 // must have less spill weight.
485 if (interferingVirtReg->weight < VirtReg.weight ) {
486 PhysRegSpillCands.push_back(PhysReg);
489 // Try to spill another interfering reg with less spill weight.
490 for (SmallVectorImpl<unsigned>::iterator PhysRegI = PhysRegSpillCands.begin(),
491 PhysRegE = PhysRegSpillCands.end(); PhysRegI != PhysRegE; ++PhysRegI) {
493 if (!spillInterferences(VirtReg, *PhysRegI, SplitVRegs)) continue;
495 assert(checkPhysRegInterference(VirtReg, *PhysRegI) == 0 &&
496 "Interference after spill.");
497 // Tell the caller to allocate to this newly freed physical register.
500 // No other spill candidates were found, so spill the current VirtReg.
501 DEBUG(dbgs() << "spilling: " << VirtReg << '\n');
502 LiveRangeEdit LRE(VirtReg, SplitVRegs);
503 spiller().spill(LRE);
505 // The live virtual register requesting allocation was spilled, so tell
506 // the caller not to allocate anything during this round.
510 bool RABasic::runOnMachineFunction(MachineFunction &mf) {
511 DEBUG(dbgs() << "********** BASIC REGISTER ALLOCATION **********\n"
512 << "********** Function: "
513 << ((Value*)mf.getFunction())->getName() << '\n');
516 DEBUG(RMF = &getAnalysis<RenderMachineFunction>());
518 RegAllocBase::init(getAnalysis<VirtRegMap>(), getAnalysis<LiveIntervals>());
520 ReservedRegs = TRI->getReservedRegs(*MF);
522 SpillerInstance.reset(createInlineSpiller(*this, *MF, *VRM));
528 // Diagnostic output before rewriting
529 DEBUG(dbgs() << "Post alloc VirtRegMap:\n" << *VRM << "\n");
531 // optional HTML output
532 DEBUG(RMF->renderMachineFunction("After basic register allocation.", VRM));
534 // FIXME: Verification currently must run before VirtRegRewriter. We should
535 // make the rewriter a separate pass and override verifyAnalysis instead. When
536 // that happens, verification naturally falls under VerifyMachineCode.
539 // Verify accuracy of LiveIntervals. The standard machine code verifier
540 // ensures that each LiveIntervals covers all uses of the virtual reg.
542 // FIXME: MachineVerifier is badly broken when using the standard
543 // spiller. Always use -spiller=inline with -verify-regalloc. Even with the
544 // inline spiller, some tests fail to verify because the coalescer does not
545 // always generate verifiable code.
546 MF->verify(this, "In RABasic::verify");
548 // Verify that LiveIntervals are partitioned into unions and disjoint within
555 VRM->rewrite(LIS->getSlotIndexes());
557 // Write out new DBG_VALUE instructions.
558 getAnalysis<LiveDebugVariables>().emitDebugValues(VRM);
560 // The pass output is in VirtRegMap. Release all the transient data.
566 FunctionPass* llvm::createBasicRegisterAllocator()
568 return new RABasic();