1 //===-- RegAllocLinearScan.cpp - Linear Scan 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 implements a linear scan register allocator.
12 //===----------------------------------------------------------------------===//
14 #define DEBUG_TYPE "regalloc"
15 #include "llvm/CodeGen/LiveIntervalAnalysis.h"
16 #include "PhysRegTracker.h"
17 #include "VirtRegMap.h"
18 #include "llvm/Function.h"
19 #include "llvm/CodeGen/MachineFunctionPass.h"
20 #include "llvm/CodeGen/MachineInstr.h"
21 #include "llvm/CodeGen/MachineLoopInfo.h"
22 #include "llvm/CodeGen/MachineRegisterInfo.h"
23 #include "llvm/CodeGen/Passes.h"
24 #include "llvm/CodeGen/RegAllocRegistry.h"
25 #include "llvm/CodeGen/RegisterCoalescer.h"
26 #include "llvm/Target/TargetRegisterInfo.h"
27 #include "llvm/Target/TargetMachine.h"
28 #include "llvm/Target/TargetInstrInfo.h"
29 #include "llvm/ADT/EquivalenceClasses.h"
30 #include "llvm/ADT/Statistic.h"
31 #include "llvm/ADT/STLExtras.h"
32 #include "llvm/Support/Debug.h"
33 #include "llvm/Support/Compiler.h"
41 STATISTIC(NumIters , "Number of iterations performed");
42 STATISTIC(NumBacktracks, "Number of times we had to backtrack");
43 STATISTIC(NumCoalesce, "Number of copies coalesced");
45 static RegisterRegAlloc
46 linearscanRegAlloc("linearscan", " linear scan register allocator",
47 createLinearScanRegisterAllocator);
50 struct VISIBILITY_HIDDEN RALinScan : public MachineFunctionPass {
52 RALinScan() : MachineFunctionPass((intptr_t)&ID) {}
54 typedef std::pair<LiveInterval*, LiveInterval::iterator> IntervalPtr;
55 typedef std::vector<IntervalPtr> IntervalPtrs;
57 /// RelatedRegClasses - This structure is built the first time a function is
58 /// compiled, and keeps track of which register classes have registers that
59 /// belong to multiple classes or have aliases that are in other classes.
60 EquivalenceClasses<const TargetRegisterClass*> RelatedRegClasses;
61 std::map<unsigned, const TargetRegisterClass*> OneClassForEachPhysReg;
64 const TargetMachine* tm_;
65 const TargetRegisterInfo* tri_;
66 const TargetInstrInfo* tii_;
67 MachineRegisterInfo *reginfo_;
68 BitVector allocatableRegs_;
70 const MachineLoopInfo *loopInfo;
72 /// handled_ - Intervals are added to the handled_ set in the order of their
73 /// start value. This is uses for backtracking.
74 std::vector<LiveInterval*> handled_;
76 /// fixed_ - Intervals that correspond to machine registers.
80 /// active_ - Intervals that are currently being processed, and which have a
81 /// live range active for the current point.
84 /// inactive_ - Intervals that are currently being processed, but which have
85 /// a hold at the current point.
86 IntervalPtrs inactive_;
88 typedef std::priority_queue<LiveInterval*,
89 std::vector<LiveInterval*>,
90 greater_ptr<LiveInterval> > IntervalHeap;
91 IntervalHeap unhandled_;
92 std::auto_ptr<PhysRegTracker> prt_;
93 std::auto_ptr<VirtRegMap> vrm_;
94 std::auto_ptr<Spiller> spiller_;
97 virtual const char* getPassName() const {
98 return "Linear Scan Register Allocator";
101 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
102 AU.addRequired<LiveIntervals>();
103 // Make sure PassManager knows which analyses to make available
104 // to coalescing and which analyses coalescing invalidates.
105 AU.addRequiredTransitive<RegisterCoalescer>();
106 AU.addRequired<MachineLoopInfo>();
107 AU.addPreserved<MachineLoopInfo>();
108 AU.addPreservedID(MachineDominatorsID);
109 MachineFunctionPass::getAnalysisUsage(AU);
112 /// runOnMachineFunction - register allocate the whole function
113 bool runOnMachineFunction(MachineFunction&);
116 /// linearScan - the linear scan algorithm
119 /// initIntervalSets - initialize the interval sets.
121 void initIntervalSets();
123 /// processActiveIntervals - expire old intervals and move non-overlapping
124 /// ones to the inactive list.
125 void processActiveIntervals(unsigned CurPoint);
127 /// processInactiveIntervals - expire old intervals and move overlapping
128 /// ones to the active list.
129 void processInactiveIntervals(unsigned CurPoint);
131 /// assignRegOrStackSlotAtInterval - assign a register if one
132 /// is available, or spill.
133 void assignRegOrStackSlotAtInterval(LiveInterval* cur);
135 /// attemptTrivialCoalescing - If a simple interval is defined by a copy,
136 /// try allocate the definition the same register as the source register
137 /// if the register is not defined during live time of the interval. This
138 /// eliminate a copy. This is used to coalesce copies which were not
139 /// coalesced away before allocation either due to dest and src being in
140 /// different register classes or because the coalescer was overly
142 unsigned attemptTrivialCoalescing(LiveInterval &cur, unsigned Reg);
145 /// register handling helpers
148 /// getFreePhysReg - return a free physical register for this virtual
149 /// register interval if we have one, otherwise return 0.
150 unsigned getFreePhysReg(LiveInterval* cur);
152 /// assignVirt2StackSlot - assigns this virtual register to a
153 /// stack slot. returns the stack slot
154 int assignVirt2StackSlot(unsigned virtReg);
156 void ComputeRelatedRegClasses();
158 template <typename ItTy>
159 void printIntervals(const char* const str, ItTy i, ItTy e) const {
160 if (str) DOUT << str << " intervals:\n";
161 for (; i != e; ++i) {
162 DOUT << "\t" << *i->first << " -> ";
163 unsigned reg = i->first->reg;
164 if (TargetRegisterInfo::isVirtualRegister(reg)) {
165 reg = vrm_->getPhys(reg);
167 DOUT << tri_->getName(reg) << '\n';
171 char RALinScan::ID = 0;
174 void RALinScan::ComputeRelatedRegClasses() {
175 const TargetRegisterInfo &TRI = *tri_;
177 // First pass, add all reg classes to the union, and determine at least one
178 // reg class that each register is in.
179 bool HasAliases = false;
180 for (TargetRegisterInfo::regclass_iterator RCI = TRI.regclass_begin(),
181 E = TRI.regclass_end(); RCI != E; ++RCI) {
182 RelatedRegClasses.insert(*RCI);
183 for (TargetRegisterClass::iterator I = (*RCI)->begin(), E = (*RCI)->end();
185 HasAliases = HasAliases || *TRI.getAliasSet(*I) != 0;
187 const TargetRegisterClass *&PRC = OneClassForEachPhysReg[*I];
189 // Already processed this register. Just make sure we know that
190 // multiple register classes share a register.
191 RelatedRegClasses.unionSets(PRC, *RCI);
198 // Second pass, now that we know conservatively what register classes each reg
199 // belongs to, add info about aliases. We don't need to do this for targets
200 // without register aliases.
202 for (std::map<unsigned, const TargetRegisterClass*>::iterator
203 I = OneClassForEachPhysReg.begin(), E = OneClassForEachPhysReg.end();
205 for (const unsigned *AS = TRI.getAliasSet(I->first); *AS; ++AS)
206 RelatedRegClasses.unionSets(I->second, OneClassForEachPhysReg[*AS]);
209 /// attemptTrivialCoalescing - If a simple interval is defined by a copy,
210 /// try allocate the definition the same register as the source register
211 /// if the register is not defined during live time of the interval. This
212 /// eliminate a copy. This is used to coalesce copies which were not
213 /// coalesced away before allocation either due to dest and src being in
214 /// different register classes or because the coalescer was overly
216 unsigned RALinScan::attemptTrivialCoalescing(LiveInterval &cur, unsigned Reg) {
217 if ((cur.preference && cur.preference == Reg) || !cur.containsOneValue())
220 VNInfo *vni = cur.getValNumInfo(0);
221 if (!vni->def || vni->def == ~1U || vni->def == ~0U)
223 MachineInstr *CopyMI = li_->getInstructionFromIndex(vni->def);
224 unsigned SrcReg, DstReg;
225 if (!CopyMI || !tii_->isMoveInstr(*CopyMI, SrcReg, DstReg))
227 if (TargetRegisterInfo::isVirtualRegister(SrcReg)) {
228 if (!vrm_->isAssignedReg(SrcReg))
231 SrcReg = vrm_->getPhys(SrcReg);
236 const TargetRegisterClass *RC = reginfo_->getRegClass(cur.reg);
237 if (!RC->contains(SrcReg))
241 if (!li_->conflictsWithPhysRegDef(cur, *vrm_, SrcReg)) {
242 DOUT << "Coalescing: " << cur << " -> " << tri_->getName(SrcReg)
244 vrm_->clearVirt(cur.reg);
245 vrm_->assignVirt2Phys(cur.reg, SrcReg);
253 bool RALinScan::runOnMachineFunction(MachineFunction &fn) {
255 tm_ = &fn.getTarget();
256 tri_ = tm_->getRegisterInfo();
257 tii_ = tm_->getInstrInfo();
258 reginfo_ = &mf_->getRegInfo();
259 allocatableRegs_ = tri_->getAllocatableSet(fn);
260 li_ = &getAnalysis<LiveIntervals>();
261 loopInfo = &getAnalysis<MachineLoopInfo>();
263 // We don't run the coalescer here because we have no reason to
264 // interact with it. If the coalescer requires interaction, it
265 // won't do anything. If it doesn't require interaction, we assume
266 // it was run as a separate pass.
268 // If this is the first function compiled, compute the related reg classes.
269 if (RelatedRegClasses.empty())
270 ComputeRelatedRegClasses();
272 if (!prt_.get()) prt_.reset(new PhysRegTracker(*tri_));
273 vrm_.reset(new VirtRegMap(*mf_));
274 if (!spiller_.get()) spiller_.reset(createSpiller());
280 // Rewrite spill code and update the PhysRegsUsed set.
281 spiller_->runOnMachineFunction(*mf_, *vrm_);
282 vrm_.reset(); // Free the VirtRegMap
284 while (!unhandled_.empty()) unhandled_.pop();
293 /// initIntervalSets - initialize the interval sets.
295 void RALinScan::initIntervalSets()
297 assert(unhandled_.empty() && fixed_.empty() &&
298 active_.empty() && inactive_.empty() &&
299 "interval sets should be empty on initialization");
301 for (LiveIntervals::iterator i = li_->begin(), e = li_->end(); i != e; ++i) {
302 if (TargetRegisterInfo::isPhysicalRegister(i->second.reg)) {
303 reginfo_->setPhysRegUsed(i->second.reg);
304 fixed_.push_back(std::make_pair(&i->second, i->second.begin()));
306 unhandled_.push(&i->second);
310 void RALinScan::linearScan()
312 // linear scan algorithm
313 DOUT << "********** LINEAR SCAN **********\n";
314 DOUT << "********** Function: " << mf_->getFunction()->getName() << '\n';
316 DEBUG(printIntervals("fixed", fixed_.begin(), fixed_.end()));
318 while (!unhandled_.empty()) {
319 // pick the interval with the earliest start point
320 LiveInterval* cur = unhandled_.top();
323 DOUT << "\n*** CURRENT ***: " << *cur << '\n';
326 processActiveIntervals(cur->beginNumber());
327 processInactiveIntervals(cur->beginNumber());
329 assert(TargetRegisterInfo::isVirtualRegister(cur->reg) &&
330 "Can only allocate virtual registers!");
333 // Allocating a virtual register. try to find a free
334 // physical register or spill an interval (possibly this one) in order to
336 assignRegOrStackSlotAtInterval(cur);
338 DEBUG(printIntervals("active", active_.begin(), active_.end()));
339 DEBUG(printIntervals("inactive", inactive_.begin(), inactive_.end()));
342 // expire any remaining active intervals
343 while (!active_.empty()) {
344 IntervalPtr &IP = active_.back();
345 unsigned reg = IP.first->reg;
346 DOUT << "\tinterval " << *IP.first << " expired\n";
347 assert(TargetRegisterInfo::isVirtualRegister(reg) &&
348 "Can only allocate virtual registers!");
349 reg = vrm_->getPhys(reg);
350 prt_->delRegUse(reg);
354 // expire any remaining inactive intervals
355 DEBUG(for (IntervalPtrs::reverse_iterator
356 i = inactive_.rbegin(); i != inactive_.rend(); ++i)
357 DOUT << "\tinterval " << *i->first << " expired\n");
360 // Add live-ins to every BB except for entry. Also perform trivial coalescing.
361 MachineFunction::iterator EntryMBB = mf_->begin();
362 SmallVector<MachineBasicBlock*, 8> LiveInMBBs;
363 for (LiveIntervals::iterator i = li_->begin(), e = li_->end(); i != e; ++i) {
364 LiveInterval &cur = i->second;
366 bool isPhys = TargetRegisterInfo::isPhysicalRegister(cur.reg);
369 else if (vrm_->isAssignedReg(cur.reg))
370 Reg = attemptTrivialCoalescing(cur, vrm_->getPhys(cur.reg));
373 // Ignore splited live intervals.
374 if (!isPhys && vrm_->getPreSplitReg(cur.reg))
376 for (LiveInterval::Ranges::const_iterator I = cur.begin(), E = cur.end();
378 const LiveRange &LR = *I;
379 if (li_->findLiveInMBBs(LR, LiveInMBBs)) {
380 for (unsigned i = 0, e = LiveInMBBs.size(); i != e; ++i)
381 if (LiveInMBBs[i] != EntryMBB)
382 LiveInMBBs[i]->addLiveIn(Reg);
391 /// processActiveIntervals - expire old intervals and move non-overlapping ones
392 /// to the inactive list.
393 void RALinScan::processActiveIntervals(unsigned CurPoint)
395 DOUT << "\tprocessing active intervals:\n";
397 for (unsigned i = 0, e = active_.size(); i != e; ++i) {
398 LiveInterval *Interval = active_[i].first;
399 LiveInterval::iterator IntervalPos = active_[i].second;
400 unsigned reg = Interval->reg;
402 IntervalPos = Interval->advanceTo(IntervalPos, CurPoint);
404 if (IntervalPos == Interval->end()) { // Remove expired intervals.
405 DOUT << "\t\tinterval " << *Interval << " expired\n";
406 assert(TargetRegisterInfo::isVirtualRegister(reg) &&
407 "Can only allocate virtual registers!");
408 reg = vrm_->getPhys(reg);
409 prt_->delRegUse(reg);
411 // Pop off the end of the list.
412 active_[i] = active_.back();
416 } else if (IntervalPos->start > CurPoint) {
417 // Move inactive intervals to inactive list.
418 DOUT << "\t\tinterval " << *Interval << " inactive\n";
419 assert(TargetRegisterInfo::isVirtualRegister(reg) &&
420 "Can only allocate virtual registers!");
421 reg = vrm_->getPhys(reg);
422 prt_->delRegUse(reg);
424 inactive_.push_back(std::make_pair(Interval, IntervalPos));
426 // Pop off the end of the list.
427 active_[i] = active_.back();
431 // Otherwise, just update the iterator position.
432 active_[i].second = IntervalPos;
437 /// processInactiveIntervals - expire old intervals and move overlapping
438 /// ones to the active list.
439 void RALinScan::processInactiveIntervals(unsigned CurPoint)
441 DOUT << "\tprocessing inactive intervals:\n";
443 for (unsigned i = 0, e = inactive_.size(); i != e; ++i) {
444 LiveInterval *Interval = inactive_[i].first;
445 LiveInterval::iterator IntervalPos = inactive_[i].second;
446 unsigned reg = Interval->reg;
448 IntervalPos = Interval->advanceTo(IntervalPos, CurPoint);
450 if (IntervalPos == Interval->end()) { // remove expired intervals.
451 DOUT << "\t\tinterval " << *Interval << " expired\n";
453 // Pop off the end of the list.
454 inactive_[i] = inactive_.back();
455 inactive_.pop_back();
457 } else if (IntervalPos->start <= CurPoint) {
458 // move re-activated intervals in active list
459 DOUT << "\t\tinterval " << *Interval << " active\n";
460 assert(TargetRegisterInfo::isVirtualRegister(reg) &&
461 "Can only allocate virtual registers!");
462 reg = vrm_->getPhys(reg);
463 prt_->addRegUse(reg);
465 active_.push_back(std::make_pair(Interval, IntervalPos));
467 // Pop off the end of the list.
468 inactive_[i] = inactive_.back();
469 inactive_.pop_back();
472 // Otherwise, just update the iterator position.
473 inactive_[i].second = IntervalPos;
478 /// updateSpillWeights - updates the spill weights of the specifed physical
479 /// register and its weight.
480 static void updateSpillWeights(std::vector<float> &Weights,
481 unsigned reg, float weight,
482 const TargetRegisterInfo *TRI) {
483 Weights[reg] += weight;
484 for (const unsigned* as = TRI->getAliasSet(reg); *as; ++as)
485 Weights[*as] += weight;
489 RALinScan::IntervalPtrs::iterator
490 FindIntervalInVector(RALinScan::IntervalPtrs &IP, LiveInterval *LI) {
491 for (RALinScan::IntervalPtrs::iterator I = IP.begin(), E = IP.end();
493 if (I->first == LI) return I;
497 static void RevertVectorIteratorsTo(RALinScan::IntervalPtrs &V, unsigned Point){
498 for (unsigned i = 0, e = V.size(); i != e; ++i) {
499 RALinScan::IntervalPtr &IP = V[i];
500 LiveInterval::iterator I = std::upper_bound(IP.first->begin(),
502 if (I != IP.first->begin()) --I;
507 /// assignRegOrStackSlotAtInterval - assign a register if one is available, or
509 void RALinScan::assignRegOrStackSlotAtInterval(LiveInterval* cur)
511 DOUT << "\tallocating current interval: ";
513 // This is an implicitly defined live interval, just assign any register.
514 const TargetRegisterClass *RC = reginfo_->getRegClass(cur->reg);
516 unsigned physReg = cur->preference;
518 physReg = *RC->allocation_order_begin(*mf_);
519 DOUT << tri_->getName(physReg) << '\n';
520 // Note the register is not really in use.
521 vrm_->assignVirt2Phys(cur->reg, physReg);
522 handled_.push_back(cur);
526 PhysRegTracker backupPrt = *prt_;
528 std::vector<std::pair<unsigned, float> > SpillWeightsToAdd;
529 unsigned StartPosition = cur->beginNumber();
530 const TargetRegisterClass *RCLeader = RelatedRegClasses.getLeaderValue(RC);
532 // If this live interval is defined by a move instruction and its source is
533 // assigned a physical register that is compatible with the target register
534 // class, then we should try to assign it the same register.
535 // This can happen when the move is from a larger register class to a smaller
536 // one, e.g. X86::mov32to32_. These move instructions are not coalescable.
537 if (!cur->preference && cur->containsOneValue()) {
538 VNInfo *vni = cur->getValNumInfo(0);
539 if (vni->def && vni->def != ~1U && vni->def != ~0U) {
540 MachineInstr *CopyMI = li_->getInstructionFromIndex(vni->def);
541 unsigned SrcReg, DstReg;
542 if (tii_->isMoveInstr(*CopyMI, SrcReg, DstReg)) {
544 if (TargetRegisterInfo::isPhysicalRegister(SrcReg))
546 else if (vrm_->isAssignedReg(SrcReg))
547 Reg = vrm_->getPhys(SrcReg);
548 if (Reg && allocatableRegs_[Reg] && RC->contains(Reg))
549 cur->preference = Reg;
554 // for every interval in inactive we overlap with, mark the
555 // register as not free and update spill weights.
556 for (IntervalPtrs::const_iterator i = inactive_.begin(),
557 e = inactive_.end(); i != e; ++i) {
558 unsigned Reg = i->first->reg;
559 assert(TargetRegisterInfo::isVirtualRegister(Reg) &&
560 "Can only allocate virtual registers!");
561 const TargetRegisterClass *RegRC = reginfo_->getRegClass(Reg);
562 // If this is not in a related reg class to the register we're allocating,
564 if (RelatedRegClasses.getLeaderValue(RegRC) == RCLeader &&
565 cur->overlapsFrom(*i->first, i->second-1)) {
566 Reg = vrm_->getPhys(Reg);
567 prt_->addRegUse(Reg);
568 SpillWeightsToAdd.push_back(std::make_pair(Reg, i->first->weight));
572 // Speculatively check to see if we can get a register right now. If not,
573 // we know we won't be able to by adding more constraints. If so, we can
574 // check to see if it is valid. Doing an exhaustive search of the fixed_ list
575 // is very bad (it contains all callee clobbered registers for any functions
576 // with a call), so we want to avoid doing that if possible.
577 unsigned physReg = getFreePhysReg(cur);
578 unsigned BestPhysReg = physReg;
580 // We got a register. However, if it's in the fixed_ list, we might
581 // conflict with it. Check to see if we conflict with it or any of its
583 SmallSet<unsigned, 8> RegAliases;
584 for (const unsigned *AS = tri_->getAliasSet(physReg); *AS; ++AS)
585 RegAliases.insert(*AS);
587 bool ConflictsWithFixed = false;
588 for (unsigned i = 0, e = fixed_.size(); i != e; ++i) {
589 IntervalPtr &IP = fixed_[i];
590 if (physReg == IP.first->reg || RegAliases.count(IP.first->reg)) {
591 // Okay, this reg is on the fixed list. Check to see if we actually
593 LiveInterval *I = IP.first;
594 if (I->endNumber() > StartPosition) {
595 LiveInterval::iterator II = I->advanceTo(IP.second, StartPosition);
597 if (II != I->begin() && II->start > StartPosition)
599 if (cur->overlapsFrom(*I, II)) {
600 ConflictsWithFixed = true;
607 // Okay, the register picked by our speculative getFreePhysReg call turned
608 // out to be in use. Actually add all of the conflicting fixed registers to
609 // prt so we can do an accurate query.
610 if (ConflictsWithFixed) {
611 // For every interval in fixed we overlap with, mark the register as not
612 // free and update spill weights.
613 for (unsigned i = 0, e = fixed_.size(); i != e; ++i) {
614 IntervalPtr &IP = fixed_[i];
615 LiveInterval *I = IP.first;
617 const TargetRegisterClass *RegRC = OneClassForEachPhysReg[I->reg];
618 if (RelatedRegClasses.getLeaderValue(RegRC) == RCLeader &&
619 I->endNumber() > StartPosition) {
620 LiveInterval::iterator II = I->advanceTo(IP.second, StartPosition);
622 if (II != I->begin() && II->start > StartPosition)
624 if (cur->overlapsFrom(*I, II)) {
625 unsigned reg = I->reg;
626 prt_->addRegUse(reg);
627 SpillWeightsToAdd.push_back(std::make_pair(reg, I->weight));
632 // Using the newly updated prt_ object, which includes conflicts in the
633 // future, see if there are any registers available.
634 physReg = getFreePhysReg(cur);
638 // Restore the physical register tracker, removing information about the
642 // if we find a free register, we are done: assign this virtual to
643 // the free physical register and add this interval to the active
646 DOUT << tri_->getName(physReg) << '\n';
647 vrm_->assignVirt2Phys(cur->reg, physReg);
648 prt_->addRegUse(physReg);
649 active_.push_back(std::make_pair(cur, cur->begin()));
650 handled_.push_back(cur);
653 DOUT << "no free registers\n";
655 // Compile the spill weights into an array that is better for scanning.
656 std::vector<float> SpillWeights(tri_->getNumRegs(), 0.0);
657 for (std::vector<std::pair<unsigned, float> >::iterator
658 I = SpillWeightsToAdd.begin(), E = SpillWeightsToAdd.end(); I != E; ++I)
659 updateSpillWeights(SpillWeights, I->first, I->second, tri_);
661 // for each interval in active, update spill weights.
662 for (IntervalPtrs::const_iterator i = active_.begin(), e = active_.end();
664 unsigned reg = i->first->reg;
665 assert(TargetRegisterInfo::isVirtualRegister(reg) &&
666 "Can only allocate virtual registers!");
667 reg = vrm_->getPhys(reg);
668 updateSpillWeights(SpillWeights, reg, i->first->weight, tri_);
671 DOUT << "\tassigning stack slot at interval "<< *cur << ":\n";
673 // Find a register to spill.
674 float minWeight = HUGE_VALF;
675 unsigned minReg = cur->preference; // Try the preferred register first.
677 if (!minReg || SpillWeights[minReg] == HUGE_VALF)
678 for (TargetRegisterClass::iterator i = RC->allocation_order_begin(*mf_),
679 e = RC->allocation_order_end(*mf_); i != e; ++i) {
681 if (minWeight > SpillWeights[reg]) {
682 minWeight = SpillWeights[reg];
687 // If we didn't find a register that is spillable, try aliases?
689 for (TargetRegisterClass::iterator i = RC->allocation_order_begin(*mf_),
690 e = RC->allocation_order_end(*mf_); i != e; ++i) {
692 // No need to worry about if the alias register size < regsize of RC.
693 // We are going to spill all registers that alias it anyway.
694 for (const unsigned* as = tri_->getAliasSet(reg); *as; ++as) {
695 if (minWeight > SpillWeights[*as]) {
696 minWeight = SpillWeights[*as];
702 // All registers must have inf weight. Just grab one!
704 minReg = BestPhysReg ? BestPhysReg : *RC->allocation_order_begin(*mf_);
705 if (cur->weight == HUGE_VALF || cur->getSize() == 1)
706 // Spill a physical register around defs and uses.
707 li_->spillPhysRegAroundRegDefsUses(*cur, minReg, *vrm_);
711 DOUT << "\t\tregister with min weight: "
712 << tri_->getName(minReg) << " (" << minWeight << ")\n";
714 // if the current has the minimum weight, we need to spill it and
715 // add any added intervals back to unhandled, and restart
717 if (cur->weight != HUGE_VALF && cur->weight <= minWeight) {
718 DOUT << "\t\t\tspilling(c): " << *cur << '\n';
719 std::vector<LiveInterval*> added =
720 li_->addIntervalsForSpills(*cur, loopInfo, *vrm_);
722 return; // Early exit if all spills were folded.
724 // Merge added with unhandled. Note that we know that
725 // addIntervalsForSpills returns intervals sorted by their starting
727 for (unsigned i = 0, e = added.size(); i != e; ++i)
728 unhandled_.push(added[i]);
734 // push the current interval back to unhandled since we are going
735 // to re-run at least this iteration. Since we didn't modify it it
736 // should go back right in the front of the list
737 unhandled_.push(cur);
739 // otherwise we spill all intervals aliasing the register with
740 // minimum weight, rollback to the interval with the earliest
741 // start point and let the linear scan algorithm run again
742 std::vector<LiveInterval*> added;
743 assert(TargetRegisterInfo::isPhysicalRegister(minReg) &&
744 "did not choose a register to spill?");
745 BitVector toSpill(tri_->getNumRegs());
747 // We are going to spill minReg and all its aliases.
748 toSpill[minReg] = true;
749 for (const unsigned* as = tri_->getAliasSet(minReg); *as; ++as)
752 // the earliest start of a spilled interval indicates up to where
753 // in handled we need to roll back
754 unsigned earliestStart = cur->beginNumber();
756 // set of spilled vregs (used later to rollback properly)
757 SmallSet<unsigned, 32> spilled;
759 // spill live intervals of virtual regs mapped to the physical register we
760 // want to clear (and its aliases). We only spill those that overlap with the
761 // current interval as the rest do not affect its allocation. we also keep
762 // track of the earliest start of all spilled live intervals since this will
763 // mark our rollback point.
764 for (IntervalPtrs::iterator i = active_.begin(); i != active_.end(); ++i) {
765 unsigned reg = i->first->reg;
766 if (//TargetRegisterInfo::isVirtualRegister(reg) &&
767 toSpill[vrm_->getPhys(reg)] &&
768 cur->overlapsFrom(*i->first, i->second)) {
769 DOUT << "\t\t\tspilling(a): " << *i->first << '\n';
770 earliestStart = std::min(earliestStart, i->first->beginNumber());
771 std::vector<LiveInterval*> newIs =
772 li_->addIntervalsForSpills(*i->first, loopInfo, *vrm_);
773 std::copy(newIs.begin(), newIs.end(), std::back_inserter(added));
777 for (IntervalPtrs::iterator i = inactive_.begin(); i != inactive_.end(); ++i){
778 unsigned reg = i->first->reg;
779 if (//TargetRegisterInfo::isVirtualRegister(reg) &&
780 toSpill[vrm_->getPhys(reg)] &&
781 cur->overlapsFrom(*i->first, i->second-1)) {
782 DOUT << "\t\t\tspilling(i): " << *i->first << '\n';
783 earliestStart = std::min(earliestStart, i->first->beginNumber());
784 std::vector<LiveInterval*> newIs =
785 li_->addIntervalsForSpills(*i->first, loopInfo, *vrm_);
786 std::copy(newIs.begin(), newIs.end(), std::back_inserter(added));
791 DOUT << "\t\trolling back to: " << earliestStart << '\n';
793 // Scan handled in reverse order up to the earliest start of a
794 // spilled live interval and undo each one, restoring the state of
796 while (!handled_.empty()) {
797 LiveInterval* i = handled_.back();
798 // If this interval starts before t we are done.
799 if (i->beginNumber() < earliestStart)
801 DOUT << "\t\t\tundo changes for: " << *i << '\n';
804 // When undoing a live interval allocation we must know if it is active or
805 // inactive to properly update the PhysRegTracker and the VirtRegMap.
806 IntervalPtrs::iterator it;
807 if ((it = FindIntervalInVector(active_, i)) != active_.end()) {
809 assert(!TargetRegisterInfo::isPhysicalRegister(i->reg));
810 if (!spilled.count(i->reg))
812 prt_->delRegUse(vrm_->getPhys(i->reg));
813 vrm_->clearVirt(i->reg);
814 } else if ((it = FindIntervalInVector(inactive_, i)) != inactive_.end()) {
816 assert(!TargetRegisterInfo::isPhysicalRegister(i->reg));
817 if (!spilled.count(i->reg))
819 vrm_->clearVirt(i->reg);
821 assert(TargetRegisterInfo::isVirtualRegister(i->reg) &&
822 "Can only allocate virtual registers!");
823 vrm_->clearVirt(i->reg);
827 // It interval has a preference, it must be defined by a copy. Clear the
828 // preference now since the source interval allocation may have been undone
833 // Rewind the iterators in the active, inactive, and fixed lists back to the
834 // point we reverted to.
835 RevertVectorIteratorsTo(active_, earliestStart);
836 RevertVectorIteratorsTo(inactive_, earliestStart);
837 RevertVectorIteratorsTo(fixed_, earliestStart);
839 // scan the rest and undo each interval that expired after t and
840 // insert it in active (the next iteration of the algorithm will
841 // put it in inactive if required)
842 for (unsigned i = 0, e = handled_.size(); i != e; ++i) {
843 LiveInterval *HI = handled_[i];
844 if (!HI->expiredAt(earliestStart) &&
845 HI->expiredAt(cur->beginNumber())) {
846 DOUT << "\t\t\tundo changes for: " << *HI << '\n';
847 active_.push_back(std::make_pair(HI, HI->begin()));
848 assert(!TargetRegisterInfo::isPhysicalRegister(HI->reg));
849 prt_->addRegUse(vrm_->getPhys(HI->reg));
853 // merge added with unhandled
854 for (unsigned i = 0, e = added.size(); i != e; ++i)
855 unhandled_.push(added[i]);
858 /// getFreePhysReg - return a free physical register for this virtual register
859 /// interval if we have one, otherwise return 0.
860 unsigned RALinScan::getFreePhysReg(LiveInterval *cur) {
861 SmallVector<unsigned, 256> inactiveCounts;
862 unsigned MaxInactiveCount = 0;
864 const TargetRegisterClass *RC = reginfo_->getRegClass(cur->reg);
865 const TargetRegisterClass *RCLeader = RelatedRegClasses.getLeaderValue(RC);
867 for (IntervalPtrs::iterator i = inactive_.begin(), e = inactive_.end();
869 unsigned reg = i->first->reg;
870 assert(TargetRegisterInfo::isVirtualRegister(reg) &&
871 "Can only allocate virtual registers!");
873 // If this is not in a related reg class to the register we're allocating,
875 const TargetRegisterClass *RegRC = reginfo_->getRegClass(reg);
876 if (RelatedRegClasses.getLeaderValue(RegRC) == RCLeader) {
877 reg = vrm_->getPhys(reg);
878 if (inactiveCounts.size() <= reg)
879 inactiveCounts.resize(reg+1);
880 ++inactiveCounts[reg];
881 MaxInactiveCount = std::max(MaxInactiveCount, inactiveCounts[reg]);
885 unsigned FreeReg = 0;
886 unsigned FreeRegInactiveCount = 0;
888 // If copy coalescer has assigned a "preferred" register, check if it's
890 if (cur->preference) {
891 if (prt_->isRegAvail(cur->preference)) {
892 DOUT << "\t\tassigned the preferred register: "
893 << tri_->getName(cur->preference) << "\n";
894 return cur->preference;
896 DOUT << "\t\tunable to assign the preferred register: "
897 << tri_->getName(cur->preference) << "\n";
900 // Scan for the first available register.
901 TargetRegisterClass::iterator I = RC->allocation_order_begin(*mf_);
902 TargetRegisterClass::iterator E = RC->allocation_order_end(*mf_);
903 assert(I != E && "No allocatable register in this register class!");
905 if (prt_->isRegAvail(*I)) {
907 if (FreeReg < inactiveCounts.size())
908 FreeRegInactiveCount = inactiveCounts[FreeReg];
910 FreeRegInactiveCount = 0;
914 // If there are no free regs, or if this reg has the max inactive count,
915 // return this register.
916 if (FreeReg == 0 || FreeRegInactiveCount == MaxInactiveCount) return FreeReg;
918 // Continue scanning the registers, looking for the one with the highest
919 // inactive count. Alkis found that this reduced register pressure very
920 // slightly on X86 (in rev 1.94 of this file), though this should probably be
922 for (; I != E; ++I) {
924 if (prt_->isRegAvail(Reg) && Reg < inactiveCounts.size() &&
925 FreeRegInactiveCount < inactiveCounts[Reg]) {
927 FreeRegInactiveCount = inactiveCounts[Reg];
928 if (FreeRegInactiveCount == MaxInactiveCount)
929 break; // We found the one with the max inactive count.
936 FunctionPass* llvm::createLinearScanRegisterAllocator() {
937 return new RALinScan();