1 //===-- LiveIntervalAnalysis.cpp - Live Interval Analysis -----------------===//
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 the LiveInterval analysis pass which is used
11 // by the Linear Scan Register allocator. This pass linearizes the
12 // basic blocks of the function in DFS order and uses the
13 // LiveVariables pass to conservatively compute live intervals for
14 // each virtual and physical register.
16 //===----------------------------------------------------------------------===//
18 #include "llvm/CodeGen/LiveIntervalAnalysis.h"
19 #include "LiveRangeCalc.h"
20 #include "llvm/ADT/DenseSet.h"
21 #include "llvm/ADT/STLExtras.h"
22 #include "llvm/Analysis/AliasAnalysis.h"
23 #include "llvm/CodeGen/LiveVariables.h"
24 #include "llvm/CodeGen/MachineBlockFrequencyInfo.h"
25 #include "llvm/CodeGen/MachineDominators.h"
26 #include "llvm/CodeGen/MachineInstr.h"
27 #include "llvm/CodeGen/MachineRegisterInfo.h"
28 #include "llvm/CodeGen/Passes.h"
29 #include "llvm/CodeGen/VirtRegMap.h"
30 #include "llvm/IR/Value.h"
31 #include "llvm/Support/BlockFrequency.h"
32 #include "llvm/Support/CommandLine.h"
33 #include "llvm/Support/Debug.h"
34 #include "llvm/Support/ErrorHandling.h"
35 #include "llvm/Support/Format.h"
36 #include "llvm/Support/raw_ostream.h"
37 #include "llvm/Target/TargetInstrInfo.h"
38 #include "llvm/Target/TargetRegisterInfo.h"
39 #include "llvm/Target/TargetSubtargetInfo.h"
45 #define DEBUG_TYPE "regalloc"
47 char LiveIntervals::ID = 0;
48 char &llvm::LiveIntervalsID = LiveIntervals::ID;
49 INITIALIZE_PASS_BEGIN(LiveIntervals, "liveintervals",
50 "Live Interval Analysis", false, false)
51 INITIALIZE_AG_DEPENDENCY(AliasAnalysis)
52 INITIALIZE_PASS_DEPENDENCY(LiveVariables)
53 INITIALIZE_PASS_DEPENDENCY(MachineDominatorTree)
54 INITIALIZE_PASS_DEPENDENCY(SlotIndexes)
55 INITIALIZE_PASS_END(LiveIntervals, "liveintervals",
56 "Live Interval Analysis", false, false)
59 static cl::opt<bool> EnablePrecomputePhysRegs(
60 "precompute-phys-liveness", cl::Hidden,
61 cl::desc("Eagerly compute live intervals for all physreg units."));
63 static bool EnablePrecomputePhysRegs = false;
66 static cl::opt<bool> EnableSubRegLiveness(
67 "enable-subreg-liveness", cl::Hidden, cl::init(true),
68 cl::desc("Enable subregister liveness tracking."));
70 void LiveIntervals::getAnalysisUsage(AnalysisUsage &AU) const {
72 AU.addRequired<AliasAnalysis>();
73 AU.addPreserved<AliasAnalysis>();
74 // LiveVariables isn't really required by this analysis, it is only required
75 // here to make sure it is live during TwoAddressInstructionPass and
76 // PHIElimination. This is temporary.
77 AU.addRequired<LiveVariables>();
78 AU.addPreserved<LiveVariables>();
79 AU.addPreservedID(MachineLoopInfoID);
80 AU.addRequiredTransitiveID(MachineDominatorsID);
81 AU.addPreservedID(MachineDominatorsID);
82 AU.addPreserved<SlotIndexes>();
83 AU.addRequiredTransitive<SlotIndexes>();
84 MachineFunctionPass::getAnalysisUsage(AU);
87 LiveIntervals::LiveIntervals() : MachineFunctionPass(ID),
88 DomTree(nullptr), LRCalc(nullptr) {
89 initializeLiveIntervalsPass(*PassRegistry::getPassRegistry());
92 LiveIntervals::~LiveIntervals() {
96 void LiveIntervals::releaseMemory() {
97 // Free the live intervals themselves.
98 for (unsigned i = 0, e = VirtRegIntervals.size(); i != e; ++i)
99 delete VirtRegIntervals[TargetRegisterInfo::index2VirtReg(i)];
100 VirtRegIntervals.clear();
101 RegMaskSlots.clear();
103 RegMaskBlocks.clear();
105 for (unsigned i = 0, e = RegUnitRanges.size(); i != e; ++i)
106 delete RegUnitRanges[i];
107 RegUnitRanges.clear();
109 // Release VNInfo memory regions, VNInfo objects don't need to be dtor'd.
110 VNInfoAllocator.Reset();
113 /// runOnMachineFunction - calculates LiveIntervals
115 bool LiveIntervals::runOnMachineFunction(MachineFunction &fn) {
117 MRI = &MF->getRegInfo();
118 TRI = MF->getSubtarget().getRegisterInfo();
119 TII = MF->getSubtarget().getInstrInfo();
120 AA = &getAnalysis<AliasAnalysis>();
121 Indexes = &getAnalysis<SlotIndexes>();
122 DomTree = &getAnalysis<MachineDominatorTree>();
124 if (EnableSubRegLiveness && MF->getSubtarget().enableSubRegLiveness())
125 MRI->enableSubRegLiveness(true);
128 LRCalc = new LiveRangeCalc();
130 // Allocate space for all virtual registers.
131 VirtRegIntervals.resize(MRI->getNumVirtRegs());
135 computeLiveInRegUnits();
137 if (EnablePrecomputePhysRegs) {
138 // For stress testing, precompute live ranges of all physical register
139 // units, including reserved registers.
140 for (unsigned i = 0, e = TRI->getNumRegUnits(); i != e; ++i)
147 /// print - Implement the dump method.
148 void LiveIntervals::print(raw_ostream &OS, const Module* ) const {
149 OS << "********** INTERVALS **********\n";
151 // Dump the regunits.
152 for (unsigned i = 0, e = RegUnitRanges.size(); i != e; ++i)
153 if (LiveRange *LR = RegUnitRanges[i])
154 OS << PrintRegUnit(i, TRI) << ' ' << *LR << '\n';
156 // Dump the virtregs.
157 for (unsigned i = 0, e = MRI->getNumVirtRegs(); i != e; ++i) {
158 unsigned Reg = TargetRegisterInfo::index2VirtReg(i);
159 if (hasInterval(Reg))
160 OS << getInterval(Reg) << '\n';
164 for (unsigned i = 0, e = RegMaskSlots.size(); i != e; ++i)
165 OS << ' ' << RegMaskSlots[i];
171 void LiveIntervals::printInstrs(raw_ostream &OS) const {
172 OS << "********** MACHINEINSTRS **********\n";
173 MF->print(OS, Indexes);
176 #if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
177 void LiveIntervals::dumpInstrs() const {
182 LiveInterval* LiveIntervals::createInterval(unsigned reg) {
183 float Weight = TargetRegisterInfo::isPhysicalRegister(reg) ?
184 llvm::huge_valf : 0.0F;
185 return new LiveInterval(reg, Weight);
189 /// computeVirtRegInterval - Compute the live interval of a virtual register,
190 /// based on defs and uses.
191 void LiveIntervals::computeVirtRegInterval(LiveInterval &LI) {
192 assert(LRCalc && "LRCalc not initialized.");
193 assert(LI.empty() && "Should only compute empty intervals.");
194 LRCalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator());
195 LRCalc->createDeadDefs(LI);
196 LRCalc->extendToUses(LI);
197 computeDeadValues(LI, LI);
200 void LiveIntervals::computeVirtRegs() {
201 for (unsigned i = 0, e = MRI->getNumVirtRegs(); i != e; ++i) {
202 unsigned Reg = TargetRegisterInfo::index2VirtReg(i);
203 if (MRI->reg_nodbg_empty(Reg))
205 createAndComputeVirtRegInterval(Reg);
209 void LiveIntervals::computeRegMasks() {
210 RegMaskBlocks.resize(MF->getNumBlockIDs());
212 // Find all instructions with regmask operands.
213 for (MachineFunction::iterator MBBI = MF->begin(), E = MF->end();
215 MachineBasicBlock *MBB = MBBI;
216 std::pair<unsigned, unsigned> &RMB = RegMaskBlocks[MBB->getNumber()];
217 RMB.first = RegMaskSlots.size();
218 for (MachineBasicBlock::iterator MI = MBB->begin(), ME = MBB->end();
220 for (MIOperands MO(MI); MO.isValid(); ++MO) {
221 if (!MO->isRegMask())
223 RegMaskSlots.push_back(Indexes->getInstructionIndex(MI).getRegSlot());
224 RegMaskBits.push_back(MO->getRegMask());
226 // Compute the number of register mask instructions in this block.
227 RMB.second = RegMaskSlots.size() - RMB.first;
231 //===----------------------------------------------------------------------===//
232 // Register Unit Liveness
233 //===----------------------------------------------------------------------===//
235 // Fixed interference typically comes from ABI boundaries: Function arguments
236 // and return values are passed in fixed registers, and so are exception
237 // pointers entering landing pads. Certain instructions require values to be
238 // present in specific registers. That is also represented through fixed
242 /// computeRegUnitInterval - Compute the live range of a register unit, based
243 /// on the uses and defs of aliasing registers. The range should be empty,
244 /// or contain only dead phi-defs from ABI blocks.
245 void LiveIntervals::computeRegUnitRange(LiveRange &LR, unsigned Unit) {
246 assert(LRCalc && "LRCalc not initialized.");
247 LRCalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator());
249 // The physregs aliasing Unit are the roots and their super-registers.
250 // Create all values as dead defs before extending to uses. Note that roots
251 // may share super-registers. That's OK because createDeadDefs() is
252 // idempotent. It is very rare for a register unit to have multiple roots, so
253 // uniquing super-registers is probably not worthwhile.
254 for (MCRegUnitRootIterator Roots(Unit, TRI); Roots.isValid(); ++Roots) {
255 for (MCSuperRegIterator Supers(*Roots, TRI, /*IncludeSelf=*/true);
256 Supers.isValid(); ++Supers) {
257 if (!MRI->reg_empty(*Supers))
258 LRCalc->createDeadDefs(LR, *Supers);
262 // Now extend LR to reach all uses.
263 // Ignore uses of reserved registers. We only track defs of those.
264 for (MCRegUnitRootIterator Roots(Unit, TRI); Roots.isValid(); ++Roots) {
265 for (MCSuperRegIterator Supers(*Roots, TRI, /*IncludeSelf=*/true);
266 Supers.isValid(); ++Supers) {
267 unsigned Reg = *Supers;
268 if (!MRI->isReserved(Reg) && !MRI->reg_empty(Reg))
269 LRCalc->extendToUses(LR, Reg);
275 /// computeLiveInRegUnits - Precompute the live ranges of any register units
276 /// that are live-in to an ABI block somewhere. Register values can appear
277 /// without a corresponding def when entering the entry block or a landing pad.
279 void LiveIntervals::computeLiveInRegUnits() {
280 RegUnitRanges.resize(TRI->getNumRegUnits());
281 DEBUG(dbgs() << "Computing live-in reg-units in ABI blocks.\n");
283 // Keep track of the live range sets allocated.
284 SmallVector<unsigned, 8> NewRanges;
286 // Check all basic blocks for live-ins.
287 for (MachineFunction::const_iterator MFI = MF->begin(), MFE = MF->end();
289 const MachineBasicBlock *MBB = MFI;
291 // We only care about ABI blocks: Entry + landing pads.
292 if ((MFI != MF->begin() && !MBB->isLandingPad()) || MBB->livein_empty())
295 // Create phi-defs at Begin for all live-in registers.
296 SlotIndex Begin = Indexes->getMBBStartIdx(MBB);
297 DEBUG(dbgs() << Begin << "\tBB#" << MBB->getNumber());
298 for (MachineBasicBlock::livein_iterator LII = MBB->livein_begin(),
299 LIE = MBB->livein_end(); LII != LIE; ++LII) {
300 for (MCRegUnitIterator Units(*LII, TRI); Units.isValid(); ++Units) {
301 unsigned Unit = *Units;
302 LiveRange *LR = RegUnitRanges[Unit];
304 LR = RegUnitRanges[Unit] = new LiveRange();
305 NewRanges.push_back(Unit);
307 VNInfo *VNI = LR->createDeadDef(Begin, getVNInfoAllocator());
309 DEBUG(dbgs() << ' ' << PrintRegUnit(Unit, TRI) << '#' << VNI->id);
312 DEBUG(dbgs() << '\n');
314 DEBUG(dbgs() << "Created " << NewRanges.size() << " new intervals.\n");
316 // Compute the 'normal' part of the ranges.
317 for (unsigned i = 0, e = NewRanges.size(); i != e; ++i) {
318 unsigned Unit = NewRanges[i];
319 computeRegUnitRange(*RegUnitRanges[Unit], Unit);
324 static void createSegmentsForValues(LiveRange &LR,
325 iterator_range<LiveInterval::vni_iterator> VNIs) {
326 for (auto VNI : VNIs) {
329 SlotIndex Def = VNI->def;
330 LR.addSegment(LiveRange::Segment(Def, Def.getDeadSlot(), VNI));
334 typedef SmallVector<std::pair<SlotIndex, VNInfo*>, 16> ShrinkToUsesWorkList;
336 static void extendSegmentsToUses(LiveRange &LR, const SlotIndexes &Indexes,
337 ShrinkToUsesWorkList &WorkList,
338 const LiveRange &OldRange) {
339 // Keep track of the PHIs that are in use.
340 SmallPtrSet<VNInfo*, 8> UsedPHIs;
341 // Blocks that have already been added to WorkList as live-out.
342 SmallPtrSet<MachineBasicBlock*, 16> LiveOut;
344 // Extend intervals to reach all uses in WorkList.
345 while (!WorkList.empty()) {
346 SlotIndex Idx = WorkList.back().first;
347 VNInfo *VNI = WorkList.back().second;
349 const MachineBasicBlock *MBB = Indexes.getMBBFromIndex(Idx.getPrevSlot());
350 SlotIndex BlockStart = Indexes.getMBBStartIdx(MBB);
352 // Extend the live range for VNI to be live at Idx.
353 if (VNInfo *ExtVNI = LR.extendInBlock(BlockStart, Idx)) {
354 assert(ExtVNI == VNI && "Unexpected existing value number");
356 // Is this a PHIDef we haven't seen before?
357 if (!VNI->isPHIDef() || VNI->def != BlockStart ||
358 !UsedPHIs.insert(VNI).second)
360 // The PHI is live, make sure the predecessors are live-out.
361 for (auto &Pred : MBB->predecessors()) {
362 if (!LiveOut.insert(Pred).second)
364 SlotIndex Stop = Indexes.getMBBEndIdx(Pred);
365 // A predecessor is not required to have a live-out value for a PHI.
366 if (VNInfo *PVNI = OldRange.getVNInfoBefore(Stop))
367 WorkList.push_back(std::make_pair(Stop, PVNI));
372 // VNI is live-in to MBB.
373 DEBUG(dbgs() << " live-in at " << BlockStart << '\n');
374 LR.addSegment(LiveRange::Segment(BlockStart, Idx, VNI));
376 // Make sure VNI is live-out from the predecessors.
377 for (auto &Pred : MBB->predecessors()) {
378 if (!LiveOut.insert(Pred).second)
380 SlotIndex Stop = Indexes.getMBBEndIdx(Pred);
381 assert(OldRange.getVNInfoBefore(Stop) == VNI &&
382 "Wrong value out of predecessor");
383 WorkList.push_back(std::make_pair(Stop, VNI));
388 /// shrinkToUses - After removing some uses of a register, shrink its live
389 /// range to just the remaining uses. This method does not compute reaching
390 /// defs for new uses, and it doesn't remove dead defs.
391 bool LiveIntervals::shrinkToUses(LiveInterval *li,
392 SmallVectorImpl<MachineInstr*> *dead) {
393 DEBUG(dbgs() << "Shrink: " << *li << '\n');
394 assert(TargetRegisterInfo::isVirtualRegister(li->reg)
395 && "Can only shrink virtual registers");
397 // Shrink subregister live ranges.
398 for (LiveInterval::subrange_iterator I = li->subrange_begin(),
399 E = li->subrange_end(); I != E; ++I) {
400 shrinkToUses(*I, li->reg);
403 // Find all the values used, including PHI kills.
404 ShrinkToUsesWorkList WorkList;
406 // Visit all instructions reading li->reg.
407 for (MachineRegisterInfo::reg_instr_iterator
408 I = MRI->reg_instr_begin(li->reg), E = MRI->reg_instr_end();
410 MachineInstr *UseMI = &*(I++);
411 if (UseMI->isDebugValue() || !UseMI->readsVirtualRegister(li->reg))
413 SlotIndex Idx = getInstructionIndex(UseMI).getRegSlot();
414 LiveQueryResult LRQ = li->Query(Idx);
415 VNInfo *VNI = LRQ.valueIn();
417 // This shouldn't happen: readsVirtualRegister returns true, but there is
418 // no live value. It is likely caused by a target getting <undef> flags
420 DEBUG(dbgs() << Idx << '\t' << *UseMI
421 << "Warning: Instr claims to read non-existent value in "
425 // Special case: An early-clobber tied operand reads and writes the
426 // register one slot early.
427 if (VNInfo *DefVNI = LRQ.valueDefined())
430 WorkList.push_back(std::make_pair(Idx, VNI));
433 // Create new live ranges with only minimal live segments per def.
435 createSegmentsForValues(NewLR, make_range(li->vni_begin(), li->vni_end()));
436 extendSegmentsToUses(NewLR, *Indexes, WorkList, *li);
438 // Handle dead values.
440 computeDeadValues(NewLR, *li, &CanSeparate, li->reg, dead);
442 // Move the trimmed segments back.
443 li->segments.swap(NewLR.segments);
444 DEBUG(dbgs() << "Shrunk: " << *li << '\n');
448 void LiveIntervals::computeDeadValues(LiveRange &Segments, LiveRange &LR,
449 bool *CanSeparateRes, unsigned Reg,
450 SmallVectorImpl<MachineInstr*> *dead) {
451 bool CanSeparate = false;
452 for (auto VNI : make_range(LR.vni_begin(), LR.vni_end())) {
455 LiveRange::iterator LRI = Segments.FindSegmentContaining(VNI->def);
456 assert(LRI != Segments.end() && "Missing segment for PHI");
457 if (LRI->end != VNI->def.getDeadSlot())
459 if (VNI->isPHIDef()) {
460 // This is a dead PHI. Remove it.
462 Segments.removeSegment(LRI->start, LRI->end);
463 DEBUG(dbgs() << "Dead PHI at " << VNI->def << " may separate interval\n");
465 } else if (dead != nullptr) {
466 // This is a dead def. Make sure the instruction knows.
467 MachineInstr *MI = getInstructionFromIndex(VNI->def);
468 assert(MI && "No instruction defining live value");
469 MI->addRegisterDead(Reg, TRI);
470 if (dead && MI->allDefsAreDead()) {
471 DEBUG(dbgs() << "All defs dead: " << VNI->def << '\t' << *MI);
476 if (CanSeparateRes != nullptr)
477 *CanSeparateRes = CanSeparate;
480 bool LiveIntervals::shrinkToUses(LiveInterval::SubRange &SR, unsigned Reg)
482 DEBUG(dbgs() << "Shrink: " << SR << '\n');
483 assert(TargetRegisterInfo::isVirtualRegister(Reg)
484 && "Can only shrink virtual registers");
485 // Find all the values used, including PHI kills.
486 ShrinkToUsesWorkList WorkList;
488 // Visit all instructions reading Reg.
490 for (MachineOperand &MO : MRI->reg_operands(Reg)) {
491 MachineInstr *UseMI = MO.getParent();
492 if (UseMI->isDebugValue())
494 // Maybe the operand is for a subregister we don't care about.
495 unsigned SubReg = MO.getSubReg();
497 unsigned SubRegMask = TRI->getSubRegIndexLaneMask(SubReg);
498 if ((SubRegMask & SR.LaneMask) == 0)
501 // We only need to visit each instruction once.
502 SlotIndex Idx = getInstructionIndex(UseMI).getRegSlot();
507 LiveQueryResult LRQ = SR.Query(Idx);
508 VNInfo *VNI = LRQ.valueIn();
509 // For Subranges it is possible that only undef values are left in that
510 // part of the subregister, so there is no real liverange at the use
514 // Special case: An early-clobber tied operand reads and writes the
515 // register one slot early.
516 if (VNInfo *DefVNI = LRQ.valueDefined())
519 WorkList.push_back(std::make_pair(Idx, VNI));
522 // Create a new live ranges with only minimal live segments per def.
524 createSegmentsForValues(NewLR, make_range(SR.vni_begin(), SR.vni_end()));
525 extendSegmentsToUses(NewLR, *Indexes, WorkList, SR);
527 // Handle dead values.
529 computeDeadValues(NewLR, SR, &CanSeparate);
531 // Move the trimmed ranges back.
532 SR.segments.swap(NewLR.segments);
533 DEBUG(dbgs() << "Shrunk: " << SR << '\n');
537 void LiveIntervals::extendToIndices(LiveRange &LR,
538 ArrayRef<SlotIndex> Indices) {
539 assert(LRCalc && "LRCalc not initialized.");
540 LRCalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator());
541 for (unsigned i = 0, e = Indices.size(); i != e; ++i)
542 LRCalc->extend(LR, Indices[i]);
545 void LiveIntervals::pruneValue(LiveRange &LR, SlotIndex Kill,
546 SmallVectorImpl<SlotIndex> *EndPoints) {
547 LiveQueryResult LRQ = LR.Query(Kill);
548 VNInfo *VNI = LRQ.valueOutOrDead();
552 MachineBasicBlock *KillMBB = Indexes->getMBBFromIndex(Kill);
553 SlotIndex MBBEnd = Indexes->getMBBEndIdx(KillMBB);
555 // If VNI isn't live out from KillMBB, the value is trivially pruned.
556 if (LRQ.endPoint() < MBBEnd) {
557 LR.removeSegment(Kill, LRQ.endPoint());
558 if (EndPoints) EndPoints->push_back(LRQ.endPoint());
562 // VNI is live out of KillMBB.
563 LR.removeSegment(Kill, MBBEnd);
564 if (EndPoints) EndPoints->push_back(MBBEnd);
566 // Find all blocks that are reachable from KillMBB without leaving VNI's live
567 // range. It is possible that KillMBB itself is reachable, so start a DFS
568 // from each successor.
569 typedef SmallPtrSet<MachineBasicBlock*, 9> VisitedTy;
571 for (MachineBasicBlock::succ_iterator
572 SuccI = KillMBB->succ_begin(), SuccE = KillMBB->succ_end();
573 SuccI != SuccE; ++SuccI) {
574 for (df_ext_iterator<MachineBasicBlock*, VisitedTy>
575 I = df_ext_begin(*SuccI, Visited), E = df_ext_end(*SuccI, Visited);
577 MachineBasicBlock *MBB = *I;
579 // Check if VNI is live in to MBB.
580 SlotIndex MBBStart, MBBEnd;
581 std::tie(MBBStart, MBBEnd) = Indexes->getMBBRange(MBB);
582 LiveQueryResult LRQ = LR.Query(MBBStart);
583 if (LRQ.valueIn() != VNI) {
584 // This block isn't part of the VNI segment. Prune the search.
589 // Prune the search if VNI is killed in MBB.
590 if (LRQ.endPoint() < MBBEnd) {
591 LR.removeSegment(MBBStart, LRQ.endPoint());
592 if (EndPoints) EndPoints->push_back(LRQ.endPoint());
597 // VNI is live through MBB.
598 LR.removeSegment(MBBStart, MBBEnd);
599 if (EndPoints) EndPoints->push_back(MBBEnd);
605 void LiveIntervals::pruneValue(LiveInterval &LI, SlotIndex Kill,
606 SmallVectorImpl<SlotIndex> *EndPoints) {
607 pruneValue((LiveRange&)LI, Kill, EndPoints);
609 for (LiveInterval::subrange_iterator SR = LI.subrange_begin(),
610 SE = LI.subrange_end(); SR != SE; ++SR) {
611 pruneValue(*SR, Kill, nullptr);
615 //===----------------------------------------------------------------------===//
616 // Register allocator hooks.
619 void LiveIntervals::addKillFlags(const VirtRegMap *VRM) {
620 // Keep track of regunit ranges.
621 SmallVector<std::pair<LiveRange*, LiveRange::iterator>, 8> RU;
623 for (unsigned i = 0, e = MRI->getNumVirtRegs(); i != e; ++i) {
624 unsigned Reg = TargetRegisterInfo::index2VirtReg(i);
625 if (MRI->reg_nodbg_empty(Reg))
627 LiveInterval *LI = &getInterval(Reg);
631 // Find the regunit intervals for the assigned register. They may overlap
632 // the virtual register live range, cancelling any kills.
634 for (MCRegUnitIterator Units(VRM->getPhys(Reg), TRI); Units.isValid();
636 LiveRange &RURanges = getRegUnit(*Units);
637 if (RURanges.empty())
639 RU.push_back(std::make_pair(&RURanges, RURanges.find(LI->begin()->end)));
642 // Every instruction that kills Reg corresponds to a segment range end
644 for (LiveInterval::iterator RI = LI->begin(), RE = LI->end(); RI != RE;
646 // A block index indicates an MBB edge.
647 if (RI->end.isBlock())
649 MachineInstr *MI = getInstructionFromIndex(RI->end);
653 // Check if any of the regunits are live beyond the end of RI. That could
654 // happen when a physreg is defined as a copy of a virtreg:
656 // %EAX = COPY %vreg5
657 // FOO %vreg5 <--- MI, cancel kill because %EAX is live.
660 // There should be no kill flag on FOO when %vreg5 is rewritten as %EAX.
661 bool CancelKill = false;
662 for (unsigned u = 0, e = RU.size(); u != e; ++u) {
663 LiveRange &RRanges = *RU[u].first;
664 LiveRange::iterator &I = RU[u].second;
665 if (I == RRanges.end())
667 I = RRanges.advanceTo(I, RI->end);
668 if (I == RRanges.end() || I->start >= RI->end)
670 // I is overlapping RI.
675 MI->clearRegisterKills(Reg, nullptr);
677 MI->addRegisterKilled(Reg, nullptr);
683 LiveIntervals::intervalIsInOneMBB(const LiveInterval &LI) const {
684 // A local live range must be fully contained inside the block, meaning it is
685 // defined and killed at instructions, not at block boundaries. It is not
686 // live in or or out of any block.
688 // It is technically possible to have a PHI-defined live range identical to a
689 // single block, but we are going to return false in that case.
691 SlotIndex Start = LI.beginIndex();
695 SlotIndex Stop = LI.endIndex();
699 // getMBBFromIndex doesn't need to search the MBB table when both indexes
700 // belong to proper instructions.
701 MachineBasicBlock *MBB1 = Indexes->getMBBFromIndex(Start);
702 MachineBasicBlock *MBB2 = Indexes->getMBBFromIndex(Stop);
703 return MBB1 == MBB2 ? MBB1 : nullptr;
707 LiveIntervals::hasPHIKill(const LiveInterval &LI, const VNInfo *VNI) const {
708 for (LiveInterval::const_vni_iterator I = LI.vni_begin(), E = LI.vni_end();
710 const VNInfo *PHI = *I;
711 if (PHI->isUnused() || !PHI->isPHIDef())
713 const MachineBasicBlock *PHIMBB = getMBBFromIndex(PHI->def);
714 // Conservatively return true instead of scanning huge predecessor lists.
715 if (PHIMBB->pred_size() > 100)
717 for (MachineBasicBlock::const_pred_iterator
718 PI = PHIMBB->pred_begin(), PE = PHIMBB->pred_end(); PI != PE; ++PI)
719 if (VNI == LI.getVNInfoBefore(Indexes->getMBBEndIdx(*PI)))
726 LiveIntervals::getSpillWeight(bool isDef, bool isUse,
727 const MachineBlockFrequencyInfo *MBFI,
728 const MachineInstr *MI) {
729 BlockFrequency Freq = MBFI->getBlockFreq(MI->getParent());
730 const float Scale = 1.0f / MBFI->getEntryFreq();
731 return (isDef + isUse) * (Freq.getFrequency() * Scale);
735 LiveIntervals::addSegmentToEndOfBlock(unsigned reg, MachineInstr* startInst) {
736 LiveInterval& Interval = createEmptyInterval(reg);
737 VNInfo* VN = Interval.getNextValue(
738 SlotIndex(getInstructionIndex(startInst).getRegSlot()),
739 getVNInfoAllocator());
740 LiveRange::Segment S(
741 SlotIndex(getInstructionIndex(startInst).getRegSlot()),
742 getMBBEndIdx(startInst->getParent()), VN);
743 Interval.addSegment(S);
749 //===----------------------------------------------------------------------===//
750 // Register mask functions
751 //===----------------------------------------------------------------------===//
753 bool LiveIntervals::checkRegMaskInterference(LiveInterval &LI,
754 BitVector &UsableRegs) {
757 LiveInterval::iterator LiveI = LI.begin(), LiveE = LI.end();
759 // Use a smaller arrays for local live ranges.
760 ArrayRef<SlotIndex> Slots;
761 ArrayRef<const uint32_t*> Bits;
762 if (MachineBasicBlock *MBB = intervalIsInOneMBB(LI)) {
763 Slots = getRegMaskSlotsInBlock(MBB->getNumber());
764 Bits = getRegMaskBitsInBlock(MBB->getNumber());
766 Slots = getRegMaskSlots();
767 Bits = getRegMaskBits();
770 // We are going to enumerate all the register mask slots contained in LI.
771 // Start with a binary search of RegMaskSlots to find a starting point.
772 ArrayRef<SlotIndex>::iterator SlotI =
773 std::lower_bound(Slots.begin(), Slots.end(), LiveI->start);
774 ArrayRef<SlotIndex>::iterator SlotE = Slots.end();
776 // No slots in range, LI begins after the last call.
782 assert(*SlotI >= LiveI->start);
783 // Loop over all slots overlapping this segment.
784 while (*SlotI < LiveI->end) {
785 // *SlotI overlaps LI. Collect mask bits.
787 // This is the first overlap. Initialize UsableRegs to all ones.
789 UsableRegs.resize(TRI->getNumRegs(), true);
792 // Remove usable registers clobbered by this mask.
793 UsableRegs.clearBitsNotInMask(Bits[SlotI-Slots.begin()]);
794 if (++SlotI == SlotE)
797 // *SlotI is beyond the current LI segment.
798 LiveI = LI.advanceTo(LiveI, *SlotI);
801 // Advance SlotI until it overlaps.
802 while (*SlotI < LiveI->start)
803 if (++SlotI == SlotE)
808 //===----------------------------------------------------------------------===//
809 // IntervalUpdate class.
810 //===----------------------------------------------------------------------===//
812 // HMEditor is a toolkit used by handleMove to trim or extend live intervals.
813 class LiveIntervals::HMEditor {
816 const MachineRegisterInfo& MRI;
817 const TargetRegisterInfo& TRI;
820 SmallPtrSet<LiveRange*, 8> Updated;
824 HMEditor(LiveIntervals& LIS, const MachineRegisterInfo& MRI,
825 const TargetRegisterInfo& TRI,
826 SlotIndex OldIdx, SlotIndex NewIdx, bool UpdateFlags)
827 : LIS(LIS), MRI(MRI), TRI(TRI), OldIdx(OldIdx), NewIdx(NewIdx),
828 UpdateFlags(UpdateFlags) {}
830 // FIXME: UpdateFlags is a workaround that creates live intervals for all
831 // physregs, even those that aren't needed for regalloc, in order to update
832 // kill flags. This is wasteful. Eventually, LiveVariables will strip all kill
833 // flags, and postRA passes will use a live register utility instead.
834 LiveRange *getRegUnitLI(unsigned Unit) {
836 return &LIS.getRegUnit(Unit);
837 return LIS.getCachedRegUnit(Unit);
840 /// Update all live ranges touched by MI, assuming a move from OldIdx to
842 void updateAllRanges(MachineInstr *MI) {
843 DEBUG(dbgs() << "handleMove " << OldIdx << " -> " << NewIdx << ": " << *MI);
844 bool hasRegMask = false;
845 for (MIOperands MO(MI); MO.isValid(); ++MO) {
850 // Aggressively clear all kill flags.
851 // They are reinserted by VirtRegRewriter.
853 MO->setIsKill(false);
855 unsigned Reg = MO->getReg();
858 if (TargetRegisterInfo::isVirtualRegister(Reg)) {
859 LiveInterval &LI = LIS.getInterval(Reg);
860 if (LI.hasSubRanges()) {
861 unsigned SubReg = MO->getSubReg();
862 unsigned LaneMask = TRI.getSubRegIndexLaneMask(SubReg);
863 for (LiveInterval::subrange_iterator S = LI.subrange_begin(),
864 SE = LI.subrange_end(); S != SE; ++S) {
865 if ((S->LaneMask & LaneMask) == 0)
867 updateRange(*S, Reg, S->LaneMask);
870 updateRange(LI, Reg, 0);
874 // For physregs, only update the regunits that actually have a
875 // precomputed live range.
876 for (MCRegUnitIterator Units(Reg, &TRI); Units.isValid(); ++Units)
877 if (LiveRange *LR = getRegUnitLI(*Units))
878 updateRange(*LR, *Units, 0);
881 updateRegMaskSlots();
885 /// Update a single live range, assuming an instruction has been moved from
886 /// OldIdx to NewIdx.
887 void updateRange(LiveRange &LR, unsigned Reg, unsigned LaneMask) {
888 if (!Updated.insert(&LR).second)
892 if (TargetRegisterInfo::isVirtualRegister(Reg)) {
893 dbgs() << PrintReg(Reg);
895 dbgs() << format(" L%04X", LaneMask);
897 dbgs() << PrintRegUnit(Reg, &TRI);
899 dbgs() << ":\t" << LR << '\n';
901 if (SlotIndex::isEarlierInstr(OldIdx, NewIdx))
904 handleMoveUp(LR, Reg, LaneMask);
905 DEBUG(dbgs() << " -->\t" << LR << '\n');
909 /// Update LR to reflect an instruction has been moved downwards from OldIdx
912 /// 1. Live def at OldIdx:
913 /// Move def to NewIdx, assert endpoint after NewIdx.
915 /// 2. Live def at OldIdx, killed at NewIdx:
916 /// Change to dead def at NewIdx.
917 /// (Happens when bundling def+kill together).
919 /// 3. Dead def at OldIdx:
920 /// Move def to NewIdx, possibly across another live value.
922 /// 4. Def at OldIdx AND at NewIdx:
923 /// Remove segment [OldIdx;NewIdx) and value defined at OldIdx.
924 /// (Happens when bundling multiple defs together).
926 /// 5. Value read at OldIdx, killed before NewIdx:
927 /// Extend kill to NewIdx.
929 void handleMoveDown(LiveRange &LR) {
930 // First look for a kill at OldIdx.
931 LiveRange::iterator I = LR.find(OldIdx.getBaseIndex());
932 LiveRange::iterator E = LR.end();
933 // Is LR even live at OldIdx?
934 if (I == E || SlotIndex::isEarlierInstr(OldIdx, I->start))
937 // Handle a live-in value.
938 if (!SlotIndex::isSameInstr(I->start, OldIdx)) {
939 bool isKill = SlotIndex::isSameInstr(OldIdx, I->end);
940 // If the live-in value already extends to NewIdx, there is nothing to do.
941 if (!SlotIndex::isEarlierInstr(I->end, NewIdx))
943 // Aggressively remove all kill flags from the old kill point.
944 // Kill flags shouldn't be used while live intervals exist, they will be
945 // reinserted by VirtRegRewriter.
946 if (MachineInstr *KillMI = LIS.getInstructionFromIndex(I->end))
947 for (MIBundleOperands MO(KillMI); MO.isValid(); ++MO)
948 if (MO->isReg() && MO->isUse())
949 MO->setIsKill(false);
950 // Adjust I->end to reach NewIdx. This may temporarily make LR invalid by
951 // overlapping ranges. Case 5 above.
952 I->end = NewIdx.getRegSlot(I->end.isEarlyClobber());
953 // If this was a kill, there may also be a def. Otherwise we're done.
959 // Check for a def at OldIdx.
960 if (I == E || !SlotIndex::isSameInstr(OldIdx, I->start))
962 // We have a def at OldIdx.
963 VNInfo *DefVNI = I->valno;
964 assert(DefVNI->def == I->start && "Inconsistent def");
965 DefVNI->def = NewIdx.getRegSlot(I->start.isEarlyClobber());
966 // If the defined value extends beyond NewIdx, just move the def down.
967 // This is case 1 above.
968 if (SlotIndex::isEarlierInstr(NewIdx, I->end)) {
969 I->start = DefVNI->def;
972 // The remaining possibilities are now:
973 // 2. Live def at OldIdx, killed at NewIdx: isSameInstr(I->end, NewIdx).
974 // 3. Dead def at OldIdx: I->end = OldIdx.getDeadSlot().
975 // In either case, it is possible that there is an existing def at NewIdx.
976 assert((I->end == OldIdx.getDeadSlot() ||
977 SlotIndex::isSameInstr(I->end, NewIdx)) &&
978 "Cannot move def below kill");
979 LiveRange::iterator NewI = LR.advanceTo(I, NewIdx.getRegSlot());
980 if (NewI != E && SlotIndex::isSameInstr(NewI->start, NewIdx)) {
981 // There is an existing def at NewIdx, case 4 above. The def at OldIdx is
982 // coalesced into that value.
983 assert(NewI->valno != DefVNI && "Multiple defs of value?");
984 LR.removeValNo(DefVNI);
987 // There was no existing def at NewIdx. Turn *I into a dead def at NewIdx.
988 // If the def at OldIdx was dead, we allow it to be moved across other LR
989 // values. The new range should be placed immediately before NewI, move any
990 // intermediate ranges up.
991 assert(NewI != I && "Inconsistent iterators");
992 std::copy(std::next(I), NewI, I);
994 = LiveRange::Segment(DefVNI->def, NewIdx.getDeadSlot(), DefVNI);
997 /// Update LR to reflect an instruction has been moved upwards from OldIdx
1000 /// 1. Live def at OldIdx:
1001 /// Hoist def to NewIdx.
1003 /// 2. Dead def at OldIdx:
1004 /// Hoist def+end to NewIdx, possibly move across other values.
1006 /// 3. Dead def at OldIdx AND existing def at NewIdx:
1007 /// Remove value defined at OldIdx, coalescing it with existing value.
1009 /// 4. Live def at OldIdx AND existing def at NewIdx:
1010 /// Remove value defined at NewIdx, hoist OldIdx def to NewIdx.
1011 /// (Happens when bundling multiple defs together).
1013 /// 5. Value killed at OldIdx:
1014 /// Hoist kill to NewIdx, then scan for last kill between NewIdx and
1017 void handleMoveUp(LiveRange &LR, unsigned Reg, unsigned LaneMask) {
1018 // First look for a kill at OldIdx.
1019 LiveRange::iterator I = LR.find(OldIdx.getBaseIndex());
1020 LiveRange::iterator E = LR.end();
1021 // Is LR even live at OldIdx?
1022 if (I == E || SlotIndex::isEarlierInstr(OldIdx, I->start))
1025 // Handle a live-in value.
1026 if (!SlotIndex::isSameInstr(I->start, OldIdx)) {
1027 // If the live-in value isn't killed here, there is nothing to do.
1028 if (!SlotIndex::isSameInstr(OldIdx, I->end))
1030 // Adjust I->end to end at NewIdx. If we are hoisting a kill above
1031 // another use, we need to search for that use. Case 5 above.
1032 I->end = NewIdx.getRegSlot(I->end.isEarlyClobber());
1034 // If OldIdx also defines a value, there couldn't have been another use.
1035 if (I == E || !SlotIndex::isSameInstr(I->start, OldIdx)) {
1036 // No def, search for the new kill.
1037 // This can never be an early clobber kill since there is no def.
1038 std::prev(I)->end = findLastUseBefore(Reg, LaneMask).getRegSlot();
1043 // Now deal with the def at OldIdx.
1044 assert(I != E && SlotIndex::isSameInstr(I->start, OldIdx) && "No def?");
1045 VNInfo *DefVNI = I->valno;
1046 assert(DefVNI->def == I->start && "Inconsistent def");
1047 DefVNI->def = NewIdx.getRegSlot(I->start.isEarlyClobber());
1049 // Check for an existing def at NewIdx.
1050 LiveRange::iterator NewI = LR.find(NewIdx.getRegSlot());
1051 if (SlotIndex::isSameInstr(NewI->start, NewIdx)) {
1052 assert(NewI->valno != DefVNI && "Same value defined more than once?");
1053 // There is an existing def at NewIdx.
1054 if (I->end.isDead()) {
1055 // Case 3: Remove the dead def at OldIdx.
1056 LR.removeValNo(DefVNI);
1059 // Case 4: Replace def at NewIdx with live def at OldIdx.
1060 I->start = DefVNI->def;
1061 LR.removeValNo(NewI->valno);
1065 // There is no existing def at NewIdx. Hoist DefVNI.
1066 if (!I->end.isDead()) {
1067 // Leave the end point of a live def.
1068 I->start = DefVNI->def;
1072 // DefVNI is a dead def. It may have been moved across other values in LR,
1073 // so move I up to NewI. Slide [NewI;I) down one position.
1074 std::copy_backward(NewI, I, std::next(I));
1075 *NewI = LiveRange::Segment(DefVNI->def, NewIdx.getDeadSlot(), DefVNI);
1078 void updateRegMaskSlots() {
1079 SmallVectorImpl<SlotIndex>::iterator RI =
1080 std::lower_bound(LIS.RegMaskSlots.begin(), LIS.RegMaskSlots.end(),
1082 assert(RI != LIS.RegMaskSlots.end() && *RI == OldIdx.getRegSlot() &&
1083 "No RegMask at OldIdx.");
1084 *RI = NewIdx.getRegSlot();
1085 assert((RI == LIS.RegMaskSlots.begin() ||
1086 SlotIndex::isEarlierInstr(*std::prev(RI), *RI)) &&
1087 "Cannot move regmask instruction above another call");
1088 assert((std::next(RI) == LIS.RegMaskSlots.end() ||
1089 SlotIndex::isEarlierInstr(*RI, *std::next(RI))) &&
1090 "Cannot move regmask instruction below another call");
1093 // Return the last use of reg between NewIdx and OldIdx.
1094 SlotIndex findLastUseBefore(unsigned Reg, unsigned LaneMask) {
1096 if (TargetRegisterInfo::isVirtualRegister(Reg)) {
1097 SlotIndex LastUse = NewIdx;
1098 for (MachineOperand &MO : MRI.use_nodbg_operands(Reg)) {
1099 unsigned SubReg = MO.getSubReg();
1100 if (SubReg != 0 && LaneMask != 0
1101 && (TRI.getSubRegIndexLaneMask(SubReg) & LaneMask) == 0)
1104 const MachineInstr *MI = MO.getParent();
1105 SlotIndex InstSlot = LIS.getSlotIndexes()->getInstructionIndex(MI);
1106 if (InstSlot > LastUse && InstSlot < OldIdx)
1112 // This is a regunit interval, so scanning the use list could be very
1113 // expensive. Scan upwards from OldIdx instead.
1114 assert(NewIdx < OldIdx && "Expected upwards move");
1115 SlotIndexes *Indexes = LIS.getSlotIndexes();
1116 MachineBasicBlock *MBB = Indexes->getMBBFromIndex(NewIdx);
1118 // OldIdx may not correspond to an instruction any longer, so set MII to
1119 // point to the next instruction after OldIdx, or MBB->end().
1120 MachineBasicBlock::iterator MII = MBB->end();
1121 if (MachineInstr *MI = Indexes->getInstructionFromIndex(
1122 Indexes->getNextNonNullIndex(OldIdx)))
1123 if (MI->getParent() == MBB)
1126 MachineBasicBlock::iterator Begin = MBB->begin();
1127 while (MII != Begin) {
1128 if ((--MII)->isDebugValue())
1130 SlotIndex Idx = Indexes->getInstructionIndex(MII);
1132 // Stop searching when NewIdx is reached.
1133 if (!SlotIndex::isEarlierInstr(NewIdx, Idx))
1136 // Check if MII uses Reg.
1137 for (MIBundleOperands MO(MII); MO.isValid(); ++MO)
1139 TargetRegisterInfo::isPhysicalRegister(MO->getReg()) &&
1140 TRI.hasRegUnit(MO->getReg(), Reg))
1143 // Didn't reach NewIdx. It must be the first instruction in the block.
1148 void LiveIntervals::handleMove(MachineInstr* MI, bool UpdateFlags) {
1149 assert(!MI->isBundled() && "Can't handle bundled instructions yet.");
1150 SlotIndex OldIndex = Indexes->getInstructionIndex(MI);
1151 Indexes->removeMachineInstrFromMaps(MI);
1152 SlotIndex NewIndex = Indexes->insertMachineInstrInMaps(MI);
1153 assert(getMBBStartIdx(MI->getParent()) <= OldIndex &&
1154 OldIndex < getMBBEndIdx(MI->getParent()) &&
1155 "Cannot handle moves across basic block boundaries.");
1157 HMEditor HME(*this, *MRI, *TRI, OldIndex, NewIndex, UpdateFlags);
1158 HME.updateAllRanges(MI);
1161 void LiveIntervals::handleMoveIntoBundle(MachineInstr* MI,
1162 MachineInstr* BundleStart,
1164 SlotIndex OldIndex = Indexes->getInstructionIndex(MI);
1165 SlotIndex NewIndex = Indexes->getInstructionIndex(BundleStart);
1166 HMEditor HME(*this, *MRI, *TRI, OldIndex, NewIndex, UpdateFlags);
1167 HME.updateAllRanges(MI);
1170 void LiveIntervals::repairOldRegInRange(const MachineBasicBlock::iterator Begin,
1171 const MachineBasicBlock::iterator End,
1172 const SlotIndex endIdx,
1173 LiveRange &LR, const unsigned Reg,
1174 const unsigned LaneMask) {
1175 LiveInterval::iterator LII = LR.find(endIdx);
1176 SlotIndex lastUseIdx;
1177 if (LII != LR.end() && LII->start < endIdx)
1178 lastUseIdx = LII->end;
1182 for (MachineBasicBlock::iterator I = End; I != Begin;) {
1184 MachineInstr *MI = I;
1185 if (MI->isDebugValue())
1188 SlotIndex instrIdx = getInstructionIndex(MI);
1189 bool isStartValid = getInstructionFromIndex(LII->start);
1190 bool isEndValid = getInstructionFromIndex(LII->end);
1192 // FIXME: This doesn't currently handle early-clobber or multiple removed
1193 // defs inside of the region to repair.
1194 for (MachineInstr::mop_iterator OI = MI->operands_begin(),
1195 OE = MI->operands_end(); OI != OE; ++OI) {
1196 const MachineOperand &MO = *OI;
1197 if (!MO.isReg() || MO.getReg() != Reg)
1200 unsigned SubReg = MO.getSubReg();
1201 unsigned Mask = TRI->getSubRegIndexLaneMask(SubReg);
1202 if ((Mask & LaneMask) == 0)
1206 if (!isStartValid) {
1207 if (LII->end.isDead()) {
1208 SlotIndex prevStart;
1209 if (LII != LR.begin())
1210 prevStart = std::prev(LII)->start;
1212 // FIXME: This could be more efficient if there was a
1213 // removeSegment method that returned an iterator.
1214 LR.removeSegment(*LII, true);
1215 if (prevStart.isValid())
1216 LII = LR.find(prevStart);
1220 LII->start = instrIdx.getRegSlot();
1221 LII->valno->def = instrIdx.getRegSlot();
1222 if (MO.getSubReg() && !MO.isUndef())
1223 lastUseIdx = instrIdx.getRegSlot();
1225 lastUseIdx = SlotIndex();
1230 if (!lastUseIdx.isValid()) {
1231 VNInfo *VNI = LR.getNextValue(instrIdx.getRegSlot(), VNInfoAllocator);
1232 LiveRange::Segment S(instrIdx.getRegSlot(),
1233 instrIdx.getDeadSlot(), VNI);
1234 LII = LR.addSegment(S);
1235 } else if (LII->start != instrIdx.getRegSlot()) {
1236 VNInfo *VNI = LR.getNextValue(instrIdx.getRegSlot(), VNInfoAllocator);
1237 LiveRange::Segment S(instrIdx.getRegSlot(), lastUseIdx, VNI);
1238 LII = LR.addSegment(S);
1241 if (MO.getSubReg() && !MO.isUndef())
1242 lastUseIdx = instrIdx.getRegSlot();
1244 lastUseIdx = SlotIndex();
1245 } else if (MO.isUse()) {
1246 // FIXME: This should probably be handled outside of this branch,
1247 // either as part of the def case (for defs inside of the region) or
1248 // after the loop over the region.
1249 if (!isEndValid && !LII->end.isBlock())
1250 LII->end = instrIdx.getRegSlot();
1251 if (!lastUseIdx.isValid())
1252 lastUseIdx = instrIdx.getRegSlot();
1259 LiveIntervals::repairIntervalsInRange(MachineBasicBlock *MBB,
1260 MachineBasicBlock::iterator Begin,
1261 MachineBasicBlock::iterator End,
1262 ArrayRef<unsigned> OrigRegs) {
1263 // Find anchor points, which are at the beginning/end of blocks or at
1264 // instructions that already have indexes.
1265 while (Begin != MBB->begin() && !Indexes->hasIndex(Begin))
1267 while (End != MBB->end() && !Indexes->hasIndex(End))
1271 if (End == MBB->end())
1272 endIdx = getMBBEndIdx(MBB).getPrevSlot();
1274 endIdx = getInstructionIndex(End);
1276 Indexes->repairIndexesInRange(MBB, Begin, End);
1278 for (MachineBasicBlock::iterator I = End; I != Begin;) {
1280 MachineInstr *MI = I;
1281 if (MI->isDebugValue())
1283 for (MachineInstr::const_mop_iterator MOI = MI->operands_begin(),
1284 MOE = MI->operands_end(); MOI != MOE; ++MOI) {
1286 TargetRegisterInfo::isVirtualRegister(MOI->getReg()) &&
1287 !hasInterval(MOI->getReg())) {
1288 createAndComputeVirtRegInterval(MOI->getReg());
1293 for (unsigned i = 0, e = OrigRegs.size(); i != e; ++i) {
1294 unsigned Reg = OrigRegs[i];
1295 if (!TargetRegisterInfo::isVirtualRegister(Reg))
1298 LiveInterval &LI = getInterval(Reg);
1299 // FIXME: Should we support undefs that gain defs?
1300 if (!LI.hasAtLeastOneValue())
1303 for (LiveInterval::subrange_iterator S = LI.subrange_begin(),
1304 SE = LI.subrange_end(); S != SE; ++S) {
1305 repairOldRegInRange(Begin, End, endIdx, *S, Reg, S->LaneMask);
1307 repairOldRegInRange(Begin, End, endIdx, LI, Reg);