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/CalcSpillWeights.h"
19 #include "llvm/CodeGen/LiveIntervalAnalysis.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))
74 DEBUG(dbgs() << " counted "
75 << usingInstrs_.size() << " instrs, "
76 << usingBlocks_.size() << " blocks, "
77 << usingLoops_.size() << " loops.\n");
80 /// removeUse - Update statistics by noting that MI no longer uses curli.
81 void SplitAnalysis::removeUse(const MachineInstr *MI) {
82 if (!usingInstrs_.erase(MI))
85 // Decrement MBB count.
86 const MachineBasicBlock *MBB = MI->getParent();
87 BlockCountMap::iterator bi = usingBlocks_.find(MBB);
88 assert(bi != usingBlocks_.end() && "MBB missing");
89 assert(bi->second && "0 count in map");
92 // No more uses in MBB.
93 usingBlocks_.erase(bi);
95 // Decrement loop count.
96 MachineLoop *Loop = loops_.getLoopFor(MBB);
99 LoopCountMap::iterator li = usingLoops_.find(Loop);
100 assert(li != usingLoops_.end() && "Loop missing");
101 assert(li->second && "0 count in map");
104 // No more blocks in Loop.
105 usingLoops_.erase(li);
108 // Get three sets of basic blocks surrounding a loop: Blocks inside the loop,
109 // predecessor blocks, and exit blocks.
110 void SplitAnalysis::getLoopBlocks(const MachineLoop *Loop, LoopBlocks &Blocks) {
113 // Blocks in the loop.
114 Blocks.Loop.insert(Loop->block_begin(), Loop->block_end());
116 // Predecessor blocks.
117 const MachineBasicBlock *Header = Loop->getHeader();
118 for (MachineBasicBlock::const_pred_iterator I = Header->pred_begin(),
119 E = Header->pred_end(); I != E; ++I)
120 if (!Blocks.Loop.count(*I))
121 Blocks.Preds.insert(*I);
124 for (MachineLoop::block_iterator I = Loop->block_begin(),
125 E = Loop->block_end(); I != E; ++I) {
126 const MachineBasicBlock *MBB = *I;
127 for (MachineBasicBlock::const_succ_iterator SI = MBB->succ_begin(),
128 SE = MBB->succ_end(); SI != SE; ++SI)
129 if (!Blocks.Loop.count(*SI))
130 Blocks.Exits.insert(*SI);
134 /// analyzeLoopPeripheralUse - Return an enum describing how curli_ is used in
135 /// and around the Loop.
136 SplitAnalysis::LoopPeripheralUse SplitAnalysis::
137 analyzeLoopPeripheralUse(const SplitAnalysis::LoopBlocks &Blocks) {
138 LoopPeripheralUse use = ContainedInLoop;
139 for (BlockCountMap::iterator I = usingBlocks_.begin(), E = usingBlocks_.end();
141 const MachineBasicBlock *MBB = I->first;
142 // Is this a peripheral block?
143 if (use < MultiPeripheral &&
144 (Blocks.Preds.count(MBB) || Blocks.Exits.count(MBB))) {
145 if (I->second > 1) use = MultiPeripheral;
146 else use = SinglePeripheral;
149 // Is it a loop block?
150 if (Blocks.Loop.count(MBB))
152 // It must be an unrelated block.
158 /// getCriticalExits - It may be necessary to partially break critical edges
159 /// leaving the loop if an exit block has phi uses of curli. Collect the exit
160 /// blocks that need special treatment into CriticalExits.
161 void SplitAnalysis::getCriticalExits(const SplitAnalysis::LoopBlocks &Blocks,
162 BlockPtrSet &CriticalExits) {
163 CriticalExits.clear();
165 // A critical exit block contains a phi def of curli, and has a predecessor
166 // that is not in the loop nor a loop predecessor.
167 // For such an exit block, the edges carrying the new variable must be moved
168 // to a new pre-exit block.
169 for (BlockPtrSet::iterator I = Blocks.Exits.begin(), E = Blocks.Exits.end();
171 const MachineBasicBlock *Succ = *I;
172 SlotIndex SuccIdx = lis_.getMBBStartIdx(Succ);
173 VNInfo *SuccVNI = curli_->getVNInfoAt(SuccIdx);
174 // This exit may not have curli live in at all. No need to split.
177 // If this is not a PHI def, it is either using a value from before the
178 // loop, or a value defined inside the loop. Both are safe.
179 if (!SuccVNI->isPHIDef() || SuccVNI->def.getBaseIndex() != SuccIdx)
181 // This exit block does have a PHI. Does it also have a predecessor that is
182 // not a loop block or loop predecessor?
183 for (MachineBasicBlock::const_pred_iterator PI = Succ->pred_begin(),
184 PE = Succ->pred_end(); PI != PE; ++PI) {
185 const MachineBasicBlock *Pred = *PI;
186 if (Blocks.Loop.count(Pred) || Blocks.Preds.count(Pred))
188 // This is a critical exit block, and we need to split the exit edge.
189 CriticalExits.insert(Succ);
195 /// canSplitCriticalExits - Return true if it is possible to insert new exit
196 /// blocks before the blocks in CriticalExits.
198 SplitAnalysis::canSplitCriticalExits(const SplitAnalysis::LoopBlocks &Blocks,
199 BlockPtrSet &CriticalExits) {
200 // If we don't allow critical edge splitting, require no critical exits.
202 return CriticalExits.empty();
204 for (BlockPtrSet::iterator I = CriticalExits.begin(), E = CriticalExits.end();
206 const MachineBasicBlock *Succ = *I;
207 // We want to insert a new pre-exit MBB before Succ, and change all the
208 // in-loop blocks to branch to the pre-exit instead of Succ.
209 // Check that all the in-loop predecessors can be changed.
210 for (MachineBasicBlock::const_pred_iterator PI = Succ->pred_begin(),
211 PE = Succ->pred_end(); PI != PE; ++PI) {
212 const MachineBasicBlock *Pred = *PI;
213 // The external predecessors won't be altered.
214 if (!Blocks.Loop.count(Pred) && !Blocks.Preds.count(Pred))
216 if (!canAnalyzeBranch(Pred))
220 // If Succ's layout predecessor falls through, that too must be analyzable.
221 // We need to insert the pre-exit block in the gap.
222 MachineFunction::const_iterator MFI = Succ;
223 if (MFI == mf_.begin())
225 if (!canAnalyzeBranch(--MFI))
228 // No problems found.
232 void SplitAnalysis::analyze(const LiveInterval *li) {
238 const MachineLoop *SplitAnalysis::getBestSplitLoop() {
239 assert(curli_ && "Call analyze() before getBestSplitLoop");
240 if (usingLoops_.empty())
243 LoopPtrSet Loops, SecondLoops;
245 BlockPtrSet CriticalExits;
247 // Find first-class and second class candidate loops.
248 // We prefer to split around loops where curli is used outside the periphery.
249 for (LoopCountMap::const_iterator I = usingLoops_.begin(),
250 E = usingLoops_.end(); I != E; ++I) {
251 const MachineLoop *Loop = I->first;
252 getLoopBlocks(Loop, Blocks);
254 // FIXME: We need an SSA updater to properly handle multiple exit blocks.
255 if (Blocks.Exits.size() > 1) {
256 DEBUG(dbgs() << " multiple exits from " << *Loop);
261 switch(analyzeLoopPeripheralUse(Blocks)) {
265 case MultiPeripheral:
268 case ContainedInLoop:
269 DEBUG(dbgs() << " contained in " << *Loop);
271 case SinglePeripheral:
272 DEBUG(dbgs() << " single peripheral use in " << *Loop);
275 // Will it be possible to split around this loop?
276 getCriticalExits(Blocks, CriticalExits);
277 DEBUG(dbgs() << " " << CriticalExits.size() << " critical exits from "
279 if (!canSplitCriticalExits(Blocks, CriticalExits))
281 // This is a possible split.
286 DEBUG(dbgs() << " getBestSplitLoop found " << Loops.size() << " + "
287 << SecondLoops.size() << " candidate loops.\n");
289 // If there are no first class loops available, look at second class loops.
296 // Pick the earliest loop.
297 // FIXME: Are there other heuristics to consider?
298 const MachineLoop *Best = 0;
300 for (LoopPtrSet::const_iterator I = Loops.begin(), E = Loops.end(); I != E;
302 SlotIndex Idx = lis_.getMBBStartIdx((*I)->getHeader());
303 if (!Best || Idx < BestIdx)
304 Best = *I, BestIdx = Idx;
306 DEBUG(dbgs() << " getBestSplitLoop found " << *Best);
310 /// getMultiUseBlocks - if curli has more than one use in a basic block, it
311 /// may be an advantage to split curli for the duration of the block.
312 bool SplitAnalysis::getMultiUseBlocks(BlockPtrSet &Blocks) {
313 // If curli is local to one block, there is no point to splitting it.
314 if (usingBlocks_.size() <= 1)
316 // Add blocks with multiple uses.
317 for (BlockCountMap::iterator I = usingBlocks_.begin(), E = usingBlocks_.end();
324 // It doesn't pay to split a 2-instr block if it redefines curli.
325 VNInfo *VN1 = curli_->getVNInfoAt(lis_.getMBBStartIdx(I->first));
327 curli_->getVNInfoAt(lis_.getMBBEndIdx(I->first).getPrevIndex());
328 // live-in and live-out with a different value.
329 if (VN1 && VN2 && VN1 != VN2)
333 Blocks.insert(I->first);
335 return !Blocks.empty();
338 //===----------------------------------------------------------------------===//
340 //===----------------------------------------------------------------------===//
342 // Work around the fact that the std::pair constructors are broken for pointer
343 // pairs in some implementations. makeVV(x, 0) works.
344 static inline std::pair<const VNInfo*, VNInfo*>
345 makeVV(const VNInfo *a, VNInfo *b) {
346 return std::make_pair(a, b);
349 void LiveIntervalMap::reset(LiveInterval *li) {
354 // defValue - Introduce a li_ def for ParentVNI that could be later than
356 VNInfo *LiveIntervalMap::defValue(const VNInfo *ParentVNI, SlotIndex Idx) {
357 assert(li_ && "call reset first");
358 assert(ParentVNI && "Mapping NULL value");
359 assert(Idx.isValid() && "Invalid SlotIndex");
360 assert(parentli_.getVNInfoAt(Idx) == ParentVNI && "Bad ParentVNI");
362 // Is this a simple 1-1 mapping? Not likely.
363 if (Idx == ParentVNI->def)
364 return mapValue(ParentVNI, Idx);
366 // This is a complex def. Mark with a NULL in valueMap.
367 VNInfo *&OldVNI = valueMap_[ParentVNI];
368 assert(!OldVNI && "Simple/Complex values mixed");
371 // Should we insert a minimal snippet of VNI LiveRange, or can we count on
372 // callers to do that? We need it for lookups of complex values.
373 VNInfo *VNI = li_->getNextValue(Idx, 0, true, lis_.getVNInfoAllocator());
377 // mapValue - Find the mapped value for ParentVNI at Idx.
378 // Potentially create phi-def values.
379 VNInfo *LiveIntervalMap::mapValue(const VNInfo *ParentVNI, SlotIndex Idx) {
380 assert(li_ && "call reset first");
381 assert(ParentVNI && "Mapping NULL value");
382 assert(Idx.isValid() && "Invalid SlotIndex");
383 assert(parentli_.getVNInfoAt(Idx) == ParentVNI && "Bad ParentVNI");
385 // Use insert for lookup, so we can add missing values with a second lookup.
386 std::pair<ValueMap::iterator,bool> InsP =
387 valueMap_.insert(makeVV(ParentVNI, 0));
389 // This was an unknown value. Create a simple mapping.
391 return InsP.first->second = li_->createValueCopy(ParentVNI,
392 lis_.getVNInfoAllocator());
393 // This was a simple mapped value.
394 if (InsP.first->second)
395 return InsP.first->second;
397 // This is a complex mapped value. There may be multiple defs, and we may need
398 // to create phi-defs.
399 MachineBasicBlock *IdxMBB = lis_.getMBBFromIndex(Idx);
400 assert(IdxMBB && "No MBB at Idx");
402 // Is there a def in the same MBB we can extend?
403 if (VNInfo *VNI = extendTo(IdxMBB, Idx))
406 // Now for the fun part. We know that ParentVNI potentially has multiple defs,
407 // and we may need to create even more phi-defs to preserve VNInfo SSA form.
408 // Perform a depth-first search for predecessor blocks where we know the
409 // dominating VNInfo. Insert phi-def VNInfos along the path back to IdxMBB.
411 // Track MBBs where we have created or learned the dominating value.
412 // This may change during the DFS as we create new phi-defs.
413 typedef DenseMap<MachineBasicBlock*, VNInfo*> MBBValueMap;
414 MBBValueMap DomValue;
416 for (idf_iterator<MachineBasicBlock*>
417 IDFI = idf_begin(IdxMBB),
418 IDFE = idf_end(IdxMBB); IDFI != IDFE;) {
419 MachineBasicBlock *MBB = *IDFI;
420 SlotIndex End = lis_.getMBBEndIdx(MBB);
422 // We are operating on the restricted CFG where ParentVNI is live.
423 if (parentli_.getVNInfoAt(End.getPrevSlot()) != ParentVNI) {
428 // Do we have a dominating value in this block?
429 VNInfo *VNI = extendTo(MBB, End);
435 // Yes, VNI dominates MBB. Track the path back to IdxMBB, creating phi-defs
436 // as needed along the way.
437 for (unsigned PI = IDFI.getPathLength()-1; PI != 0; --PI) {
438 // Start from MBB's immediate successor. End at IdxMBB.
439 MachineBasicBlock *Succ = IDFI.getPath(PI-1);
440 std::pair<MBBValueMap::iterator, bool> InsP =
441 DomValue.insert(MBBValueMap::value_type(Succ, VNI));
443 // This is the first time we backtrack to Succ.
447 // We reached Succ again with the same VNI. Nothing is going to change.
448 VNInfo *OVNI = InsP.first->second;
452 // Succ already has a phi-def. No need to continue.
453 SlotIndex Start = lis_.getMBBStartIdx(Succ);
454 if (OVNI->def == Start)
457 // We have a collision between the old and new VNI at Succ. That means
458 // neither dominates and we need a new phi-def.
459 VNI = li_->getNextValue(Start, 0, true, lis_.getVNInfoAllocator());
460 VNI->setIsPHIDef(true);
461 InsP.first->second = VNI;
463 // Replace OVNI with VNI in the remaining path.
464 for (; PI > 1 ; --PI) {
465 MBBValueMap::iterator I = DomValue.find(IDFI.getPath(PI-2));
466 if (I == DomValue.end() || I->second != OVNI)
472 // No need to search the children, we found a dominating value.
476 // The search should at least find a dominating value for IdxMBB.
477 assert(!DomValue.empty() && "Couldn't find a reaching definition");
479 // Since we went through the trouble of a full DFS visiting all reaching defs,
480 // the values in DomValue are now accurate. No more phi-defs are needed for
481 // these blocks, so we can color the live ranges.
482 // This makes the next mapValue call much faster.
484 for (MBBValueMap::iterator I = DomValue.begin(), E = DomValue.end(); I != E;
486 MachineBasicBlock *MBB = I->first;
487 VNInfo *VNI = I->second;
488 SlotIndex Start = lis_.getMBBStartIdx(MBB);
490 // Don't add full liveness to IdxMBB, stop at Idx.
492 li_->addRange(LiveRange(Start, Idx, VNI));
493 // The caller had better add some liveness to IdxVNI, or it leaks.
496 li_->addRange(LiveRange(Start, lis_.getMBBEndIdx(MBB), VNI));
499 assert(IdxVNI && "Didn't find value for Idx");
503 // extendTo - Find the last li_ value defined in MBB at or before Idx. The
504 // parentli_ is assumed to be live at Idx. Extend the live range to Idx.
505 // Return the found VNInfo, or NULL.
506 VNInfo *LiveIntervalMap::extendTo(MachineBasicBlock *MBB, SlotIndex Idx) {
507 assert(li_ && "call reset first");
508 LiveInterval::iterator I = std::upper_bound(li_->begin(), li_->end(), Idx);
509 if (I == li_->begin())
512 if (I->start < lis_.getMBBStartIdx(MBB))
519 // addSimpleRange - Add a simple range from parentli_ to li_.
520 // ParentVNI must be live in the [Start;End) interval.
521 void LiveIntervalMap::addSimpleRange(SlotIndex Start, SlotIndex End,
522 const VNInfo *ParentVNI) {
523 assert(li_ && "call reset first");
524 VNInfo *VNI = mapValue(ParentVNI, Start);
525 // A simple mappoing is easy.
526 if (VNI->def == ParentVNI->def) {
527 li_->addRange(LiveRange(Start, End, VNI));
531 // ParentVNI is a complex value. We must map per MBB.
532 MachineFunction::iterator MBB = lis_.getMBBFromIndex(Start);
533 MachineFunction::iterator MBBE = lis_.getMBBFromIndex(End);
536 li_->addRange(LiveRange(Start, End, VNI));
541 li_->addRange(LiveRange(Start, lis_.getMBBEndIdx(MBB), VNI));
543 // Run sequence of full blocks.
544 for (++MBB; MBB != MBBE; ++MBB) {
545 Start = lis_.getMBBStartIdx(MBB);
546 li_->addRange(LiveRange(Start, lis_.getMBBEndIdx(MBB),
547 mapValue(ParentVNI, Start)));
551 Start = lis_.getMBBStartIdx(MBB);
553 li_->addRange(LiveRange(Start, End, mapValue(ParentVNI, Start)));
556 /// addRange - Add live ranges to li_ where [Start;End) intersects parentli_.
557 /// All needed values whose def is not inside [Start;End) must be defined
558 /// beforehand so mapValue will work.
559 void LiveIntervalMap::addRange(SlotIndex Start, SlotIndex End) {
560 assert(li_ && "call reset first");
561 LiveInterval::const_iterator B = parentli_.begin(), E = parentli_.end();
562 LiveInterval::const_iterator I = std::lower_bound(B, E, Start);
564 // Check if --I begins before Start and overlaps.
568 addSimpleRange(Start, std::min(End, I->end), I->valno);
572 // The remaining ranges begin after Start.
573 for (;I != E && I->start < End; ++I)
574 addSimpleRange(I->start, std::min(End, I->end), I->valno);
577 //===----------------------------------------------------------------------===//
579 //===----------------------------------------------------------------------===//
581 /// Create a new SplitEditor for editing the LiveInterval analyzed by SA.
582 SplitEditor::SplitEditor(SplitAnalysis &sa, LiveIntervals &lis, VirtRegMap &vrm,
583 SmallVectorImpl<LiveInterval*> &intervals)
584 : sa_(sa), lis_(lis), vrm_(vrm),
585 mri_(vrm.getMachineFunction().getRegInfo()),
586 tii_(*vrm.getMachineFunction().getTarget().getInstrInfo()),
587 curli_(sa_.getCurLI()),
588 dupli_(0), openli_(0),
589 intervals_(intervals),
590 firstInterval(intervals_.size())
592 assert(curli_ && "SplitEditor created from empty SplitAnalysis");
594 // Make sure curli_ is assigned a stack slot, so all our intervals get the
595 // same slot as curli_.
596 if (vrm_.getStackSlot(curli_->reg) == VirtRegMap::NO_STACK_SLOT)
597 vrm_.assignVirt2StackSlot(curli_->reg);
601 LiveInterval *SplitEditor::createInterval() {
602 unsigned curli = sa_.getCurLI()->reg;
603 unsigned Reg = mri_.createVirtualRegister(mri_.getRegClass(curli));
604 LiveInterval &Intv = lis_.getOrCreateInterval(Reg);
606 vrm_.assignVirt2StackSlot(Reg, vrm_.getStackSlot(curli));
610 LiveInterval *SplitEditor::getDupLI() {
612 // Create an interval for dupli that is a copy of curli.
613 dupli_ = createInterval();
614 dupli_->Copy(*curli_, &mri_, lis_.getVNInfoAllocator());
619 VNInfo *SplitEditor::mapValue(const VNInfo *curliVNI) {
620 VNInfo *&VNI = valueMap_[curliVNI];
622 VNI = openli_->createValueCopy(curliVNI, lis_.getVNInfoAllocator());
626 /// Insert a COPY instruction curli -> li. Allocate a new value from li
627 /// defined by the COPY. Note that rewrite() will deal with the curli
628 /// register, so this function can be used to copy from any interval - openli,
630 VNInfo *SplitEditor::insertCopy(LiveInterval &LI,
631 MachineBasicBlock &MBB,
632 MachineBasicBlock::iterator I) {
633 MachineInstr *MI = BuildMI(MBB, I, DebugLoc(), tii_.get(TargetOpcode::COPY),
634 LI.reg).addReg(curli_->reg);
635 SlotIndex DefIdx = lis_.InsertMachineInstrInMaps(MI).getDefIndex();
636 return LI.getNextValue(DefIdx, MI, true, lis_.getVNInfoAllocator());
639 /// Create a new virtual register and live interval.
640 void SplitEditor::openIntv() {
641 assert(!openli_ && "Previous LI not closed before openIntv");
642 openli_ = createInterval();
643 intervals_.push_back(openli_);
644 liveThrough_ = false;
647 /// enterIntvBefore - Enter openli before the instruction at Idx. If curli is
648 /// not live before Idx, a COPY is not inserted.
649 void SplitEditor::enterIntvBefore(SlotIndex Idx) {
650 assert(openli_ && "openIntv not called before enterIntvBefore");
652 // Copy from curli_ if it is live.
653 if (VNInfo *CurVNI = curli_->getVNInfoAt(Idx.getUseIndex())) {
654 MachineInstr *MI = lis_.getInstructionFromIndex(Idx);
655 assert(MI && "enterIntvBefore called with invalid index");
656 VNInfo *VNI = insertCopy(*openli_, *MI->getParent(), MI);
657 openli_->addRange(LiveRange(VNI->def, Idx.getDefIndex(), VNI));
659 // Make sure CurVNI is properly mapped.
660 VNInfo *&mapVNI = valueMap_[CurVNI];
661 // We dont have SSA update yet, so only one entry per value is allowed.
662 assert(!mapVNI && "enterIntvBefore called more than once for the same value");
665 DEBUG(dbgs() << " enterIntvBefore " << Idx << ": " << *openli_ << '\n');
668 /// enterIntvAtEnd - Enter openli at the end of MBB.
669 /// PhiMBB is a successor inside openli where a PHI value is created.
670 /// Currently, all entries must share the same PhiMBB.
671 void SplitEditor::enterIntvAtEnd(MachineBasicBlock &A, MachineBasicBlock &B) {
672 assert(openli_ && "openIntv not called before enterIntvAtEnd");
674 SlotIndex EndA = lis_.getMBBEndIdx(&A);
675 VNInfo *CurVNIA = curli_->getVNInfoAt(EndA.getPrevIndex());
677 DEBUG(dbgs() << " enterIntvAtEnd, curli not live out of BB#"
678 << A.getNumber() << ".\n");
682 // Add a phi kill value and live range out of A.
683 VNInfo *VNIA = insertCopy(*openli_, A, A.getFirstTerminator());
684 openli_->addRange(LiveRange(VNIA->def, EndA, VNIA));
686 // FIXME: If this is the only entry edge, we don't need the extra PHI value.
687 // FIXME: If there are multiple entry blocks (so not a loop), we need proper
690 // Now look at the start of B.
691 SlotIndex StartB = lis_.getMBBStartIdx(&B);
692 SlotIndex EndB = lis_.getMBBEndIdx(&B);
693 const LiveRange *CurB = curli_->getLiveRangeContaining(StartB);
695 DEBUG(dbgs() << " enterIntvAtEnd: curli not live in to BB#"
696 << B.getNumber() << ".\n");
700 VNInfo *VNIB = openli_->getVNInfoAt(StartB);
702 // Create a phi value.
703 VNIB = openli_->getNextValue(SlotIndex(StartB, true), 0, false,
704 lis_.getVNInfoAllocator());
705 VNIB->setIsPHIDef(true);
706 VNInfo *&mapVNI = valueMap_[CurB->valno];
708 // Multiple copies - must create PHI value.
711 // This is the first copy of dupLR. Mark the mapping.
717 DEBUG(dbgs() << " enterIntvAtEnd: " << *openli_ << '\n');
720 /// useIntv - indicate that all instructions in MBB should use openli.
721 void SplitEditor::useIntv(const MachineBasicBlock &MBB) {
722 useIntv(lis_.getMBBStartIdx(&MBB), lis_.getMBBEndIdx(&MBB));
725 void SplitEditor::useIntv(SlotIndex Start, SlotIndex End) {
726 assert(openli_ && "openIntv not called before useIntv");
728 // Map the curli values from the interval into openli_
729 LiveInterval::const_iterator B = curli_->begin(), E = curli_->end();
730 LiveInterval::const_iterator I = std::lower_bound(B, E, Start);
734 // I begins before Start, but overlaps.
736 openli_->addRange(LiveRange(Start, std::min(End, I->end),
737 mapValue(I->valno)));
741 // The remaining ranges begin after Start.
742 for (;I != E && I->start < End; ++I)
743 openli_->addRange(LiveRange(I->start, std::min(End, I->end),
744 mapValue(I->valno)));
745 DEBUG(dbgs() << " use [" << Start << ';' << End << "): " << *openli_
749 /// leaveIntvAfter - Leave openli after the instruction at Idx.
750 void SplitEditor::leaveIntvAfter(SlotIndex Idx) {
751 assert(openli_ && "openIntv not called before leaveIntvAfter");
753 const LiveRange *CurLR = curli_->getLiveRangeContaining(Idx.getDefIndex());
754 if (!CurLR || CurLR->end <= Idx.getBoundaryIndex()) {
755 DEBUG(dbgs() << " leaveIntvAfter " << Idx << ": not live\n");
759 // Was this value of curli live through openli?
760 if (!openli_->liveAt(CurLR->valno->def)) {
761 DEBUG(dbgs() << " leaveIntvAfter " << Idx << ": using external value\n");
766 // We are going to insert a back copy, so we must have a dupli_.
767 LiveRange *DupLR = getDupLI()->getLiveRangeContaining(Idx.getDefIndex());
768 assert(DupLR && "dupli not live into black, but curli is?");
770 // Insert the COPY instruction.
771 MachineBasicBlock::iterator I = lis_.getInstructionFromIndex(Idx);
772 MachineInstr *MI = BuildMI(*I->getParent(), llvm::next(I), I->getDebugLoc(),
773 tii_.get(TargetOpcode::COPY), dupli_->reg)
774 .addReg(openli_->reg);
775 SlotIndex CopyIdx = lis_.InsertMachineInstrInMaps(MI).getDefIndex();
776 openli_->addRange(LiveRange(Idx.getDefIndex(), CopyIdx,
777 mapValue(CurLR->valno)));
778 DupLR->valno->def = CopyIdx;
779 DEBUG(dbgs() << " leaveIntvAfter " << Idx << ": " << *openli_ << '\n');
782 /// leaveIntvAtTop - Leave the interval at the top of MBB.
783 /// Currently, only one value can leave the interval.
784 void SplitEditor::leaveIntvAtTop(MachineBasicBlock &MBB) {
785 assert(openli_ && "openIntv not called before leaveIntvAtTop");
787 SlotIndex Start = lis_.getMBBStartIdx(&MBB);
788 const LiveRange *CurLR = curli_->getLiveRangeContaining(Start);
790 // Is curli even live-in to MBB?
792 DEBUG(dbgs() << " leaveIntvAtTop at " << Start << ": not live\n");
796 // Is curli defined by PHI at the beginning of MBB?
797 bool isPHIDef = CurLR->valno->isPHIDef() &&
798 CurLR->valno->def.getBaseIndex() == Start;
800 // If MBB is using a value of curli that was defined outside the openli range,
801 // we don't want to copy it back here.
802 if (!isPHIDef && !openli_->liveAt(CurLR->valno->def)) {
803 DEBUG(dbgs() << " leaveIntvAtTop at " << Start
804 << ": using external value\n");
809 // We are going to insert a back copy, so we must have a dupli_.
810 LiveRange *DupLR = getDupLI()->getLiveRangeContaining(Start);
811 assert(DupLR && "dupli not live into black, but curli is?");
813 // Insert the COPY instruction.
814 MachineInstr *MI = BuildMI(MBB, MBB.begin(), DebugLoc(),
815 tii_.get(TargetOpcode::COPY), dupli_->reg)
816 .addReg(openli_->reg);
817 SlotIndex Idx = lis_.InsertMachineInstrInMaps(MI).getDefIndex();
819 // Adjust dupli and openli values.
821 // dupli was already a PHI on entry to MBB. Simply insert an openli PHI,
822 // and shift the dupli def down to the COPY.
823 VNInfo *VNI = openli_->getNextValue(SlotIndex(Start, true), 0, false,
824 lis_.getVNInfoAllocator());
825 VNI->setIsPHIDef(true);
826 openli_->addRange(LiveRange(VNI->def, Idx, VNI));
828 dupli_->removeRange(Start, Idx);
829 DupLR->valno->def = Idx;
830 DupLR->valno->setIsPHIDef(false);
832 // The dupli value was defined somewhere inside the openli range.
833 DEBUG(dbgs() << " leaveIntvAtTop source value defined at "
834 << DupLR->valno->def << "\n");
835 // FIXME: We may not need a PHI here if all predecessors have the same
837 VNInfo *VNI = openli_->getNextValue(SlotIndex(Start, true), 0, false,
838 lis_.getVNInfoAllocator());
839 VNI->setIsPHIDef(true);
840 openli_->addRange(LiveRange(VNI->def, Idx, VNI));
842 // FIXME: What if DupLR->valno is used by multiple exits? SSA Update.
844 // closeIntv is going to remove the superfluous live ranges.
845 DupLR->valno->def = Idx;
846 DupLR->valno->setIsPHIDef(false);
849 DEBUG(dbgs() << " leaveIntvAtTop at " << Idx << ": " << *openli_ << '\n');
852 /// closeIntv - Indicate that we are done editing the currently open
853 /// LiveInterval, and ranges can be trimmed.
854 void SplitEditor::closeIntv() {
855 assert(openli_ && "openIntv not called before closeIntv");
857 DEBUG(dbgs() << " closeIntv cleaning up\n");
858 DEBUG(dbgs() << " open " << *openli_ << '\n');
861 DEBUG(dbgs() << " value live through region, leaving dupli as is.\n");
863 // live out with copies inserted, or killed by region. Either way we need to
864 // remove the overlapping region from dupli.
866 for (LiveInterval::iterator I = openli_->begin(), E = openli_->end();
868 dupli_->removeRange(I->start, I->end);
870 // FIXME: A block branching to the entry block may also branch elsewhere
871 // curli is live. We need both openli and curli to be live in that case.
872 DEBUG(dbgs() << " dup2 " << *dupli_ << '\n');
878 /// rewrite - after all the new live ranges have been created, rewrite
879 /// instructions using curli to use the new intervals.
880 void SplitEditor::rewrite() {
881 assert(!openli_ && "Previous LI not closed before rewrite");
882 const LiveInterval *curli = sa_.getCurLI();
883 for (MachineRegisterInfo::reg_iterator RI = mri_.reg_begin(curli->reg),
884 RE = mri_.reg_end(); RI != RE;) {
885 MachineOperand &MO = RI.getOperand();
886 MachineInstr *MI = MO.getParent();
888 if (MI->isDebugValue()) {
889 DEBUG(dbgs() << "Zapping " << *MI);
890 // FIXME: We can do much better with debug values.
894 SlotIndex Idx = lis_.getInstructionIndex(MI);
895 Idx = MO.isUse() ? Idx.getUseIndex() : Idx.getDefIndex();
896 LiveInterval *LI = dupli_;
897 for (unsigned i = firstInterval, e = intervals_.size(); i != e; ++i) {
898 LiveInterval *testli = intervals_[i];
899 if (testli->liveAt(Idx)) {
907 DEBUG(dbgs() << " rewrite " << Idx << '\t' << *MI);
911 // dupli_ goes in last, after rewriting.
913 if (dupli_->empty()) {
914 DEBUG(dbgs() << " dupli became empty?\n");
915 lis_.removeInterval(dupli_->reg);
918 dupli_->RenumberValues(lis_);
919 intervals_.push_back(dupli_);
923 // Calculate spill weight and allocation hints for new intervals.
924 VirtRegAuxInfo vrai(vrm_.getMachineFunction(), lis_, sa_.loops_);
925 for (unsigned i = firstInterval, e = intervals_.size(); i != e; ++i) {
926 LiveInterval &li = *intervals_[i];
927 vrai.CalculateRegClass(li.reg);
928 vrai.CalculateWeightAndHint(li);
929 DEBUG(dbgs() << " new interval " << mri_.getRegClass(li.reg)->getName()
930 << ":" << li << '\n');
935 //===----------------------------------------------------------------------===//
937 //===----------------------------------------------------------------------===//
939 bool SplitEditor::splitAroundLoop(const MachineLoop *Loop) {
940 SplitAnalysis::LoopBlocks Blocks;
941 sa_.getLoopBlocks(Loop, Blocks);
943 // Break critical edges as needed.
944 SplitAnalysis::BlockPtrSet CriticalExits;
945 sa_.getCriticalExits(Blocks, CriticalExits);
946 assert(CriticalExits.empty() && "Cannot break critical exits yet");
948 // Create new live interval for the loop.
951 // Insert copies in the predecessors.
952 for (SplitAnalysis::BlockPtrSet::iterator I = Blocks.Preds.begin(),
953 E = Blocks.Preds.end(); I != E; ++I) {
954 MachineBasicBlock &MBB = const_cast<MachineBasicBlock&>(**I);
955 enterIntvAtEnd(MBB, *Loop->getHeader());
958 // Switch all loop blocks.
959 for (SplitAnalysis::BlockPtrSet::iterator I = Blocks.Loop.begin(),
960 E = Blocks.Loop.end(); I != E; ++I)
963 // Insert back copies in the exit blocks.
964 for (SplitAnalysis::BlockPtrSet::iterator I = Blocks.Exits.begin(),
965 E = Blocks.Exits.end(); I != E; ++I) {
966 MachineBasicBlock &MBB = const_cast<MachineBasicBlock&>(**I);
977 //===----------------------------------------------------------------------===//
978 // Single Block Splitting
979 //===----------------------------------------------------------------------===//
981 /// splitSingleBlocks - Split curli into a separate live interval inside each
982 /// basic block in Blocks. Return true if curli has been completely replaced,
983 /// false if curli is still intact, and needs to be spilled or split further.
984 bool SplitEditor::splitSingleBlocks(const SplitAnalysis::BlockPtrSet &Blocks) {
985 DEBUG(dbgs() << " splitSingleBlocks for " << Blocks.size() << " blocks.\n");
986 // Determine the first and last instruction using curli in each block.
987 typedef std::pair<SlotIndex,SlotIndex> IndexPair;
988 typedef DenseMap<const MachineBasicBlock*,IndexPair> IndexPairMap;
989 IndexPairMap MBBRange;
990 for (SplitAnalysis::InstrPtrSet::const_iterator I = sa_.usingInstrs_.begin(),
991 E = sa_.usingInstrs_.end(); I != E; ++I) {
992 const MachineBasicBlock *MBB = (*I)->getParent();
993 if (!Blocks.count(MBB))
995 SlotIndex Idx = lis_.getInstructionIndex(*I);
996 DEBUG(dbgs() << " BB#" << MBB->getNumber() << '\t' << Idx << '\t' << **I);
997 IndexPair &IP = MBBRange[MBB];
998 if (!IP.first.isValid() || Idx < IP.first)
1000 if (!IP.second.isValid() || Idx > IP.second)
1004 // Create a new interval for each block.
1005 for (SplitAnalysis::BlockPtrSet::const_iterator I = Blocks.begin(),
1006 E = Blocks.end(); I != E; ++I) {
1007 IndexPair &IP = MBBRange[*I];
1008 DEBUG(dbgs() << " splitting for BB#" << (*I)->getNumber() << ": ["
1009 << IP.first << ';' << IP.second << ")\n");
1010 assert(IP.first.isValid() && IP.second.isValid());
1013 enterIntvBefore(IP.first);
1014 useIntv(IP.first.getBaseIndex(), IP.second.getBoundaryIndex());
1015 leaveIntvAfter(IP.second);
1023 //===----------------------------------------------------------------------===//
1024 // Sub Block Splitting
1025 //===----------------------------------------------------------------------===//
1027 /// getBlockForInsideSplit - If curli is contained inside a single basic block,
1028 /// and it wou pay to subdivide the interval inside that block, return it.
1029 /// Otherwise return NULL. The returned block can be passed to
1030 /// SplitEditor::splitInsideBlock.
1031 const MachineBasicBlock *SplitAnalysis::getBlockForInsideSplit() {
1032 // The interval must be exclusive to one block.
1033 if (usingBlocks_.size() != 1)
1035 // Don't to this for less than 4 instructions. We want to be sure that
1036 // splitting actually reduces the instruction count per interval.
1037 if (usingInstrs_.size() < 4)
1039 return usingBlocks_.begin()->first;
1042 /// splitInsideBlock - Split curli into multiple intervals inside MBB. Return
1043 /// true if curli has been completely replaced, false if curli is still
1044 /// intact, and needs to be spilled or split further.
1045 bool SplitEditor::splitInsideBlock(const MachineBasicBlock *MBB) {
1046 SmallVector<SlotIndex, 32> Uses;
1047 Uses.reserve(sa_.usingInstrs_.size());
1048 for (SplitAnalysis::InstrPtrSet::const_iterator I = sa_.usingInstrs_.begin(),
1049 E = sa_.usingInstrs_.end(); I != E; ++I)
1050 if ((*I)->getParent() == MBB)
1051 Uses.push_back(lis_.getInstructionIndex(*I));
1052 DEBUG(dbgs() << " splitInsideBlock BB#" << MBB->getNumber() << " for "
1053 << Uses.size() << " instructions.\n");
1054 assert(Uses.size() >= 3 && "Need at least 3 instructions");
1055 array_pod_sort(Uses.begin(), Uses.end());
1057 // Simple algorithm: Find the largest gap between uses as determined by slot
1058 // indices. Create new intervals for instructions before the gap and after the
1060 unsigned bestPos = 0;
1062 DEBUG(dbgs() << " dist (" << Uses[0]);
1063 for (unsigned i = 1, e = Uses.size(); i != e; ++i) {
1064 int g = Uses[i-1].distance(Uses[i]);
1065 DEBUG(dbgs() << ") -" << g << "- (" << Uses[i]);
1067 bestPos = i, bestGap = g;
1069 DEBUG(dbgs() << "), best: -" << bestGap << "-\n");
1071 // bestPos points to the first use after the best gap.
1072 assert(bestPos > 0 && "Invalid gap");
1074 // FIXME: Don't create intervals for low densities.
1076 // First interval before the gap. Don't create single-instr intervals.
1079 enterIntvBefore(Uses.front());
1080 useIntv(Uses.front().getBaseIndex(), Uses[bestPos-1].getBoundaryIndex());
1081 leaveIntvAfter(Uses[bestPos-1]);
1085 // Second interval after the gap.
1086 if (bestPos < Uses.size()-1) {
1088 enterIntvBefore(Uses[bestPos]);
1089 useIntv(Uses[bestPos].getBaseIndex(), Uses.back().getBoundaryIndex());
1090 leaveIntvAfter(Uses.back());