1 //===---------- SplitKit.cpp - Toolkit for splitting live ranges ----------===//
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 contains the SplitAnalysis class as well as mutator functions for
11 // live range splitting.
13 //===----------------------------------------------------------------------===//
15 #define DEBUG_TYPE "splitter"
17 #include "VirtRegMap.h"
18 #include "llvm/CodeGen/LiveIntervalAnalysis.h"
19 #include "llvm/CodeGen/MachineFunctionPass.h"
20 #include "llvm/CodeGen/MachineInstrBuilder.h"
21 #include "llvm/CodeGen/MachineLoopInfo.h"
22 #include "llvm/CodeGen/MachineRegisterInfo.h"
23 #include "llvm/Support/CommandLine.h"
24 #include "llvm/Support/Debug.h"
25 #include "llvm/Support/raw_ostream.h"
26 #include "llvm/Target/TargetInstrInfo.h"
27 #include "llvm/Target/TargetMachine.h"
32 AllowSplit("spiller-splits-edges",
33 cl::desc("Allow critical edge splitting during spilling"));
35 //===----------------------------------------------------------------------===//
37 //===----------------------------------------------------------------------===//
39 SplitAnalysis::SplitAnalysis(const MachineFunction &mf,
40 const LiveIntervals &lis,
41 const MachineLoopInfo &mli)
45 tii_(*mf.getTarget().getInstrInfo()),
48 void SplitAnalysis::clear() {
55 bool SplitAnalysis::canAnalyzeBranch(const MachineBasicBlock *MBB) {
56 MachineBasicBlock *T, *F;
57 SmallVector<MachineOperand, 4> Cond;
58 return !tii_.AnalyzeBranch(const_cast<MachineBasicBlock&>(*MBB), T, F, Cond);
61 /// analyzeUses - Count instructions, basic blocks, and loops using curli.
62 void SplitAnalysis::analyzeUses() {
63 const MachineRegisterInfo &MRI = mf_.getRegInfo();
64 for (MachineRegisterInfo::reg_iterator I = MRI.reg_begin(curli_->reg);
65 MachineInstr *MI = I.skipInstruction();) {
66 if (MI->isDebugValue() || !usingInstrs_.insert(MI))
68 MachineBasicBlock *MBB = MI->getParent();
69 if (usingBlocks_[MBB]++)
71 if (MachineLoop *Loop = loops_.getLoopFor(MBB))
72 usingLoops_.insert(Loop);
74 DEBUG(dbgs() << "Counted "
75 << usingInstrs_.size() << " instrs, "
76 << usingBlocks_.size() << " blocks, "
77 << usingLoops_.size() << " loops in "
81 // Get three sets of basic blocks surrounding a loop: Blocks inside the loop,
82 // predecessor blocks, and exit blocks.
83 void SplitAnalysis::getLoopBlocks(const MachineLoop *Loop, LoopBlocks &Blocks) {
86 // Blocks in the loop.
87 Blocks.Loop.insert(Loop->block_begin(), Loop->block_end());
89 // Predecessor blocks.
90 const MachineBasicBlock *Header = Loop->getHeader();
91 for (MachineBasicBlock::const_pred_iterator I = Header->pred_begin(),
92 E = Header->pred_end(); I != E; ++I)
93 if (!Blocks.Loop.count(*I))
94 Blocks.Preds.insert(*I);
97 for (MachineLoop::block_iterator I = Loop->block_begin(),
98 E = Loop->block_end(); I != E; ++I) {
99 const MachineBasicBlock *MBB = *I;
100 for (MachineBasicBlock::const_succ_iterator SI = MBB->succ_begin(),
101 SE = MBB->succ_end(); SI != SE; ++SI)
102 if (!Blocks.Loop.count(*SI))
103 Blocks.Exits.insert(*SI);
107 /// analyzeLoopPeripheralUse - Return an enum describing how curli_ is used in
108 /// and around the Loop.
109 SplitAnalysis::LoopPeripheralUse SplitAnalysis::
110 analyzeLoopPeripheralUse(const SplitAnalysis::LoopBlocks &Blocks) {
111 LoopPeripheralUse use = ContainedInLoop;
112 for (BlockCountMap::iterator I = usingBlocks_.begin(), E = usingBlocks_.end();
114 const MachineBasicBlock *MBB = I->first;
115 // Is this a peripheral block?
116 if (use < MultiPeripheral &&
117 (Blocks.Preds.count(MBB) || Blocks.Exits.count(MBB))) {
118 if (I->second > 1) use = MultiPeripheral;
119 else use = SinglePeripheral;
122 // Is it a loop block?
123 if (Blocks.Loop.count(MBB))
125 // It must be an unrelated block.
131 /// getCriticalExits - It may be necessary to partially break critical edges
132 /// leaving the loop if an exit block has phi uses of curli. Collect the exit
133 /// blocks that need special treatment into CriticalExits.
134 void SplitAnalysis::getCriticalExits(const SplitAnalysis::LoopBlocks &Blocks,
135 BlockPtrSet &CriticalExits) {
136 CriticalExits.clear();
138 // A critical exit block contains a phi def of curli, and has a predecessor
139 // that is not in the loop nor a loop predecessor.
140 // For such an exit block, the edges carrying the new variable must be moved
141 // to a new pre-exit block.
142 for (BlockPtrSet::iterator I = Blocks.Exits.begin(), E = Blocks.Exits.end();
144 const MachineBasicBlock *Succ = *I;
145 SlotIndex SuccIdx = lis_.getMBBStartIdx(Succ);
146 VNInfo *SuccVNI = curli_->getVNInfoAt(SuccIdx);
147 // This exit may not have curli live in at all. No need to split.
150 // If this is not a PHI def, it is either using a value from before the
151 // loop, or a value defined inside the loop. Both are safe.
152 if (!SuccVNI->isPHIDef() || SuccVNI->def.getBaseIndex() != SuccIdx)
154 // This exit block does have a PHI. Does it also have a predecessor that is
155 // not a loop block or loop predecessor?
156 for (MachineBasicBlock::const_pred_iterator PI = Succ->pred_begin(),
157 PE = Succ->pred_end(); PI != PE; ++PI) {
158 const MachineBasicBlock *Pred = *PI;
159 if (Blocks.Loop.count(Pred) || Blocks.Preds.count(Pred))
161 // This is a critical exit block, and we need to split the exit edge.
162 CriticalExits.insert(Succ);
168 /// canSplitCriticalExits - Return true if it is possible to insert new exit
169 /// blocks before the blocks in CriticalExits.
171 SplitAnalysis::canSplitCriticalExits(const SplitAnalysis::LoopBlocks &Blocks,
172 BlockPtrSet &CriticalExits) {
173 // If we don't allow critical edge splitting, require no critical exits.
175 return CriticalExits.empty();
177 for (BlockPtrSet::iterator I = CriticalExits.begin(), E = CriticalExits.end();
179 const MachineBasicBlock *Succ = *I;
180 // We want to insert a new pre-exit MBB before Succ, and change all the
181 // in-loop blocks to branch to the pre-exit instead of Succ.
182 // Check that all the in-loop predecessors can be changed.
183 for (MachineBasicBlock::const_pred_iterator PI = Succ->pred_begin(),
184 PE = Succ->pred_end(); PI != PE; ++PI) {
185 const MachineBasicBlock *Pred = *PI;
186 // The external predecessors won't be altered.
187 if (!Blocks.Loop.count(Pred) && !Blocks.Preds.count(Pred))
189 if (!canAnalyzeBranch(Pred))
193 // If Succ's layout predecessor falls through, that too must be analyzable.
194 // We need to insert the pre-exit block in the gap.
195 MachineFunction::const_iterator MFI = Succ;
196 if (MFI == mf_.begin())
198 if (!canAnalyzeBranch(--MFI))
201 // No problems found.
205 void SplitAnalysis::analyze(const LiveInterval *li) {
211 const MachineLoop *SplitAnalysis::getBestSplitLoop() {
212 assert(curli_ && "Call analyze() before getBestSplitLoop");
213 if (usingLoops_.empty())
216 LoopPtrSet Loops, SecondLoops;
218 BlockPtrSet CriticalExits;
220 // Find first-class and second class candidate loops.
221 // We prefer to split around loops where curli is used outside the periphery.
222 for (LoopPtrSet::const_iterator I = usingLoops_.begin(),
223 E = usingLoops_.end(); I != E; ++I) {
224 getLoopBlocks(*I, Blocks);
226 // FIXME: We need an SSA updater to properly handle multiple exit blocks.
227 if (Blocks.Exits.size() > 1) {
228 DEBUG(dbgs() << "MultipleExits: " << **I);
233 switch(analyzeLoopPeripheralUse(Blocks)) {
237 case MultiPeripheral:
240 case ContainedInLoop:
241 DEBUG(dbgs() << "ContainedInLoop: " << **I);
243 case SinglePeripheral:
244 DEBUG(dbgs() << "SinglePeripheral: " << **I);
247 // Will it be possible to split around this loop?
248 getCriticalExits(Blocks, CriticalExits);
249 DEBUG(dbgs() << CriticalExits.size() << " critical exits: " << **I);
250 if (!canSplitCriticalExits(Blocks, CriticalExits))
252 // This is a possible split.
257 DEBUG(dbgs() << "Got " << Loops.size() << " + " << SecondLoops.size()
258 << " candidate loops\n");
260 // If there are no first class loops available, look at second class loops.
267 // Pick the earliest loop.
268 // FIXME: Are there other heuristics to consider?
269 const MachineLoop *Best = 0;
271 for (LoopPtrSet::const_iterator I = Loops.begin(), E = Loops.end(); I != E;
273 SlotIndex Idx = lis_.getMBBStartIdx((*I)->getHeader());
274 if (!Best || Idx < BestIdx)
275 Best = *I, BestIdx = Idx;
277 DEBUG(dbgs() << "Best: " << *Best);
282 //===----------------------------------------------------------------------===//
284 //===----------------------------------------------------------------------===//
286 /// Create a new SplitEditor for editing the LiveInterval analyzed by SA.
287 SplitEditor::SplitEditor(SplitAnalysis &sa, LiveIntervals &lis, VirtRegMap &vrm,
288 std::vector<LiveInterval*> &intervals)
289 : sa_(sa), lis_(lis), vrm_(vrm),
290 mri_(vrm.getMachineFunction().getRegInfo()),
291 tii_(*vrm.getMachineFunction().getTarget().getInstrInfo()),
292 dupli_(0), openli_(0),
293 intervals_(intervals),
294 firstInterval(intervals_.size())
296 const LiveInterval *curli = sa_.getCurLI();
297 assert(curli && "SplitEditor created from empty SplitAnalysis");
299 // Make sure curli is assigned a stack slot, so all our intervals get the
300 // same slot as curli.
301 if (vrm_.getStackSlot(curli->reg) == VirtRegMap::NO_STACK_SLOT)
302 vrm_.assignVirt2StackSlot(curli->reg);
304 // Create an interval for dupli that is a copy of curli.
305 dupli_ = createInterval();
306 dupli_->Copy(*curli, &mri_, lis_.getVNInfoAllocator());
307 DEBUG(dbgs() << "SplitEditor DupLI: " << *dupli_ << '\n');
310 LiveInterval *SplitEditor::createInterval() {
311 unsigned curli = sa_.getCurLI()->reg;
312 unsigned Reg = mri_.createVirtualRegister(mri_.getRegClass(curli));
313 LiveInterval &Intv = lis_.getOrCreateInterval(Reg);
315 vrm_.assignVirt2StackSlot(Reg, vrm_.getStackSlot(curli));
319 VNInfo *SplitEditor::mapValue(VNInfo *dupliVNI) {
320 VNInfo *&VNI = valueMap_[dupliVNI];
322 VNI = openli_->createValueCopy(dupliVNI, lis_.getVNInfoAllocator());
326 /// Insert a COPY instruction curli -> li. Allocate a new value from li
327 /// defined by the COPY. Note that rewrite() will deal with the curli
328 /// register, so this function can be used to copy from any interval - openli,
330 VNInfo *SplitEditor::insertCopy(LiveInterval &LI,
331 MachineBasicBlock &MBB,
332 MachineBasicBlock::iterator I) {
333 unsigned curli = sa_.getCurLI()->reg;
334 MachineInstr *MI = BuildMI(MBB, I, DebugLoc(), tii_.get(TargetOpcode::COPY),
335 LI.reg).addReg(curli);
336 SlotIndex DefIdx = lis_.InsertMachineInstrInMaps(MI).getDefIndex();
337 return LI.getNextValue(DefIdx, MI, true, lis_.getVNInfoAllocator());
340 /// Create a new virtual register and live interval.
341 void SplitEditor::openIntv() {
342 assert(!openli_ && "Previous LI not closed before openIntv");
343 openli_ = createInterval();
344 intervals_.push_back(openli_);
345 liveThrough_ = false;
348 /// enterIntvAtEnd - Enter openli at the end of MBB.
349 /// PhiMBB is a successor inside openli where a PHI value is created.
350 /// Currently, all entries must share the same PhiMBB.
351 void SplitEditor::enterIntvAtEnd(MachineBasicBlock &A, MachineBasicBlock &B) {
352 assert(openli_ && "openIntv not called before enterIntvAtEnd");
354 SlotIndex EndA = lis_.getMBBEndIdx(&A);
355 VNInfo *DupVNIA = dupli_->getVNInfoAt(EndA.getPrevIndex());
357 DEBUG(dbgs() << " ignoring enterIntvAtEnd, dupli not live out of BB#"
358 << A.getNumber() << ".\n");
362 // Add a phi kill value and live range out of A.
363 VNInfo *VNIA = insertCopy(*openli_, A, A.getFirstTerminator());
364 openli_->addRange(LiveRange(VNIA->def, EndA, VNIA));
366 // FIXME: If this is the only entry edge, we don't need the extra PHI value.
367 // FIXME: If there are multiple entry blocks (so not a loop), we need proper
370 // Now look at the start of B.
371 SlotIndex StartB = lis_.getMBBStartIdx(&B);
372 SlotIndex EndB = lis_.getMBBEndIdx(&B);
373 LiveRange *DupB = dupli_->getLiveRangeContaining(StartB);
375 DEBUG(dbgs() << " enterIntvAtEnd: dupli not live in to BB#"
376 << B.getNumber() << ".\n");
380 VNInfo *VNIB = openli_->getVNInfoAt(StartB);
382 // Create a phi value.
383 VNIB = openli_->getNextValue(SlotIndex(StartB, true), 0, false,
384 lis_.getVNInfoAllocator());
385 VNIB->setIsPHIDef(true);
386 // Add a minimal range for the new value.
387 openli_->addRange(LiveRange(VNIB->def, std::min(EndB, DupB->end), VNIB));
389 VNInfo *&mapVNI = valueMap_[DupB->valno];
391 // Multiple copies - must create PHI value.
394 // This is the first copy of dupLR. Mark the mapping.
400 DEBUG(dbgs() << " enterIntvAtEnd: " << *openli_ << '\n');
403 /// useIntv - indicate that all instructions in MBB should use openli.
404 void SplitEditor::useIntv(const MachineBasicBlock &MBB) {
405 useIntv(lis_.getMBBStartIdx(&MBB), lis_.getMBBEndIdx(&MBB));
408 void SplitEditor::useIntv(SlotIndex Start, SlotIndex End) {
409 assert(openli_ && "openIntv not called before useIntv");
411 // Map the dupli values from the interval into openli_
412 LiveInterval::const_iterator B = dupli_->begin(), E = dupli_->end();
413 LiveInterval::const_iterator I = std::lower_bound(B, E, Start);
417 // I begins before Start, but overlaps. openli may already have a value.
418 if (I->end > Start && !openli_->liveAt(Start))
419 openli_->addRange(LiveRange(Start, std::min(End, I->end),
420 mapValue(I->valno)));
424 // The remaining ranges begin after Start.
425 for (;I != E && I->start < End; ++I)
426 openli_->addRange(LiveRange(I->start, std::min(End, I->end),
427 mapValue(I->valno)));
428 DEBUG(dbgs() << " added range [" << Start << ';' << End << "): " << *openli_
432 /// leaveIntvAtTop - Leave the interval at the top of MBB.
433 /// Currently, only one value can leave the interval.
434 void SplitEditor::leaveIntvAtTop(MachineBasicBlock &MBB) {
435 assert(openli_ && "openIntv not called before leaveIntvAtTop");
437 SlotIndex Start = lis_.getMBBStartIdx(&MBB);
438 LiveRange *DupLR = dupli_->getLiveRangeContaining(Start);
440 // Is dupli even live-in to MBB?
442 DEBUG(dbgs() << " leaveIntvAtTop at " << Start << ": not live\n");
446 // Is dupli defined by PHI at the beginning of MBB?
447 bool isPHIDef = DupLR->valno->isPHIDef() &&
448 DupLR->valno->def.getBaseIndex() == Start;
450 // If MBB is using a value of dupli that was defined outside the openli range,
451 // we don't want to copy it back here.
452 if (!isPHIDef && !openli_->liveAt(DupLR->valno->def)) {
453 DEBUG(dbgs() << " leaveIntvAtTop at " << Start
454 << ": using external value\n");
459 // Insert the COPY instruction.
460 MachineInstr *MI = BuildMI(MBB, MBB.begin(), DebugLoc(),
461 tii_.get(TargetOpcode::COPY), openli_->reg)
462 .addReg(dupli_->reg);
463 SlotIndex Idx = lis_.InsertMachineInstrInMaps(MI).getDefIndex();
465 // Adjust dupli and openli values.
467 // dupli was already a PHI on entry to MBB. Simply insert an openli PHI,
468 // and shift the dupli def down to the COPY.
469 VNInfo *VNI = openli_->getNextValue(SlotIndex(Start, true), 0, false,
470 lis_.getVNInfoAllocator());
471 VNI->setIsPHIDef(true);
472 openli_->addRange(LiveRange(VNI->def, Idx, VNI));
474 dupli_->removeRange(Start, Idx);
475 DupLR->valno->def = Idx;
476 DupLR->valno->setIsPHIDef(false);
478 // The dupli value was defined somewhere inside the openli range.
479 DEBUG(dbgs() << " leaveIntvAtTop source value defined at "
480 << DupLR->valno->def << "\n");
481 // FIXME: We may not need a PHI here if all predecessors have the same
483 VNInfo *VNI = openli_->getNextValue(SlotIndex(Start, true), 0, false,
484 lis_.getVNInfoAllocator());
485 VNI->setIsPHIDef(true);
486 openli_->addRange(LiveRange(VNI->def, Idx, VNI));
488 // FIXME: What if DupLR->valno is used by multiple exits? SSA Update.
490 // closeIntv is going to remove the superfluous live ranges.
491 DupLR->valno->def = Idx;
492 DupLR->valno->setIsPHIDef(false);
495 DEBUG(dbgs() << " leaveIntvAtTop at " << Idx << ": " << *openli_ << '\n');
498 /// closeIntv - Indicate that we are done editing the currently open
499 /// LiveInterval, and ranges can be trimmed.
500 void SplitEditor::closeIntv() {
501 assert(openli_ && "openIntv not called before closeIntv");
503 DEBUG(dbgs() << " closeIntv cleaning up\n");
505 DEBUG(dbgs() << " dup " << *dupli_ << '\n');
506 DEBUG(dbgs() << " open " << *openli_ << '\n');
509 DEBUG(dbgs() << " value live through region, leaving dupli as is.\n");
511 // live out with copies inserted, or killed by region. Either way we need to
512 // remove the overlapping region from dupli.
513 for (LiveInterval::iterator I = openli_->begin(), E = openli_->end();
515 dupli_->removeRange(I->start, I->end);
517 // FIXME: A block branching to the entry block may also branch elsewhere
518 // curli is live. We need both openli and curli to be live in that case.
519 DEBUG(dbgs() << " dup2 " << *dupli_ << '\n');
524 /// rewrite - after all the new live ranges have been created, rewrite
525 /// instructions using curli to use the new intervals.
526 void SplitEditor::rewrite() {
527 assert(!openli_ && "Previous LI not closed before rewrite");
528 const LiveInterval *curli = sa_.getCurLI();
529 for (MachineRegisterInfo::reg_iterator RI = mri_.reg_begin(curli->reg),
530 RE = mri_.reg_end(); RI != RE;) {
531 MachineOperand &MO = RI.getOperand();
532 MachineInstr *MI = MO.getParent();
534 if (MI->isDebugValue()) {
535 DEBUG(dbgs() << "Zapping " << *MI);
536 // FIXME: We can do much better with debug values.
540 SlotIndex Idx = lis_.getInstructionIndex(MI);
541 Idx = MO.isUse() ? Idx.getUseIndex() : Idx.getDefIndex();
542 LiveInterval *LI = dupli_;
543 for (unsigned i = firstInterval, e = intervals_.size(); i != e; ++i) {
544 LiveInterval *testli = intervals_[i];
545 if (testli->liveAt(Idx)) {
552 DEBUG(dbgs() << "rewrite " << Idx << '\t' << *MI);
555 // dupli_ goes in last, after rewriting.
557 intervals_.push_back(dupli_);
559 // FIXME: *Calculate spill weights, allocation hints, and register classes for
564 //===----------------------------------------------------------------------===//
566 //===----------------------------------------------------------------------===//
568 void SplitEditor::splitAroundLoop(const MachineLoop *Loop) {
569 SplitAnalysis::LoopBlocks Blocks;
570 sa_.getLoopBlocks(Loop, Blocks);
572 // Break critical edges as needed.
573 SplitAnalysis::BlockPtrSet CriticalExits;
574 sa_.getCriticalExits(Blocks, CriticalExits);
575 assert(CriticalExits.empty() && "Cannot break critical exits yet");
577 // Create new live interval for the loop.
580 // Insert copies in the predecessors.
581 for (SplitAnalysis::BlockPtrSet::iterator I = Blocks.Preds.begin(),
582 E = Blocks.Preds.end(); I != E; ++I) {
583 MachineBasicBlock &MBB = const_cast<MachineBasicBlock&>(**I);
584 enterIntvAtEnd(MBB, *Loop->getHeader());
587 // Switch all loop blocks.
588 for (SplitAnalysis::BlockPtrSet::iterator I = Blocks.Loop.begin(),
589 E = Blocks.Loop.end(); I != E; ++I)
592 // Insert back copies in the exit blocks.
593 for (SplitAnalysis::BlockPtrSet::iterator I = Blocks.Exits.begin(),
594 E = Blocks.Exits.end(); I != E; ++I) {
595 MachineBasicBlock &MBB = const_cast<MachineBasicBlock&>(**I);