1 //===-- PreAllocSplitting.cpp - Pre-allocation Interval Spltting Pass. ----===//
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 machine instruction level pre-register allocation
11 // live interval splitting pass. It finds live interval barriers, i.e.
12 // instructions which will kill all physical registers in certain register
13 // classes, and split all live intervals which cross the barrier.
15 //===----------------------------------------------------------------------===//
17 #define DEBUG_TYPE "pre-alloc-split"
18 #include "VirtRegMap.h"
19 #include "llvm/CodeGen/CalcSpillWeights.h"
20 #include "llvm/CodeGen/LiveIntervalAnalysis.h"
21 #include "llvm/CodeGen/LiveStackAnalysis.h"
22 #include "llvm/CodeGen/MachineDominators.h"
23 #include "llvm/CodeGen/MachineFrameInfo.h"
24 #include "llvm/CodeGen/MachineFunctionPass.h"
25 #include "llvm/CodeGen/MachineLoopInfo.h"
26 #include "llvm/CodeGen/MachineRegisterInfo.h"
27 #include "llvm/CodeGen/Passes.h"
28 #include "llvm/CodeGen/RegisterCoalescer.h"
29 #include "llvm/Target/TargetInstrInfo.h"
30 #include "llvm/Target/TargetMachine.h"
31 #include "llvm/Target/TargetOptions.h"
32 #include "llvm/Target/TargetRegisterInfo.h"
33 #include "llvm/Support/CommandLine.h"
34 #include "llvm/Support/Debug.h"
35 #include "llvm/Support/ErrorHandling.h"
36 #include "llvm/ADT/DenseMap.h"
37 #include "llvm/ADT/DepthFirstIterator.h"
38 #include "llvm/ADT/SmallPtrSet.h"
39 #include "llvm/ADT/Statistic.h"
42 static cl::opt<int> PreSplitLimit("pre-split-limit", cl::init(-1), cl::Hidden);
43 static cl::opt<int> DeadSplitLimit("dead-split-limit", cl::init(-1),
45 static cl::opt<int> RestoreFoldLimit("restore-fold-limit", cl::init(-1),
48 STATISTIC(NumSplits, "Number of intervals split");
49 STATISTIC(NumRemats, "Number of intervals split by rematerialization");
50 STATISTIC(NumFolds, "Number of intervals split with spill folding");
51 STATISTIC(NumRestoreFolds, "Number of intervals split with restore folding");
52 STATISTIC(NumRenumbers, "Number of intervals renumbered into new registers");
53 STATISTIC(NumDeadSpills, "Number of dead spills removed");
56 class PreAllocSplitting : public MachineFunctionPass {
57 MachineFunction *CurrMF;
58 const TargetMachine *TM;
59 const TargetInstrInfo *TII;
60 const TargetRegisterInfo* TRI;
61 MachineFrameInfo *MFI;
62 MachineRegisterInfo *MRI;
68 // Barrier - Current barrier being processed.
69 MachineInstr *Barrier;
71 // BarrierMBB - Basic block where the barrier resides in.
72 MachineBasicBlock *BarrierMBB;
74 // Barrier - Current barrier index.
77 // CurrLI - Current live interval being split.
80 // CurrSLI - Current stack slot live interval.
81 LiveInterval *CurrSLI;
83 // CurrSValNo - Current val# for the stack slot live interval.
86 // IntervalSSMap - A map from live interval to spill slots.
87 DenseMap<unsigned, int> IntervalSSMap;
89 // Def2SpillMap - A map from a def instruction index to spill index.
90 DenseMap<SlotIndex, SlotIndex> Def2SpillMap;
95 : MachineFunctionPass(ID) {}
97 virtual bool runOnMachineFunction(MachineFunction &MF);
99 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
100 AU.setPreservesCFG();
101 AU.addRequired<SlotIndexes>();
102 AU.addPreserved<SlotIndexes>();
103 AU.addRequired<LiveIntervals>();
104 AU.addPreserved<LiveIntervals>();
105 AU.addRequired<LiveStacks>();
106 AU.addPreserved<LiveStacks>();
107 AU.addPreserved<RegisterCoalescer>();
108 AU.addPreserved<CalculateSpillWeights>();
110 AU.addPreservedID(StrongPHIEliminationID);
112 AU.addPreservedID(PHIEliminationID);
113 AU.addRequired<MachineDominatorTree>();
114 AU.addRequired<MachineLoopInfo>();
115 AU.addRequired<VirtRegMap>();
116 AU.addPreserved<MachineDominatorTree>();
117 AU.addPreserved<MachineLoopInfo>();
118 AU.addPreserved<VirtRegMap>();
119 MachineFunctionPass::getAnalysisUsage(AU);
122 virtual void releaseMemory() {
123 IntervalSSMap.clear();
124 Def2SpillMap.clear();
127 virtual const char *getPassName() const {
128 return "Pre-Register Allocaton Live Interval Splitting";
131 /// print - Implement the dump method.
132 virtual void print(raw_ostream &O, const Module* M = 0) const {
139 MachineBasicBlock::iterator
140 findSpillPoint(MachineBasicBlock*, MachineInstr*, MachineInstr*,
141 SmallPtrSet<MachineInstr*, 4>&);
143 MachineBasicBlock::iterator
144 findRestorePoint(MachineBasicBlock*, MachineInstr*, SlotIndex,
145 SmallPtrSet<MachineInstr*, 4>&);
147 int CreateSpillStackSlot(unsigned, const TargetRegisterClass *);
149 bool IsAvailableInStack(MachineBasicBlock*, unsigned,
150 SlotIndex, SlotIndex,
151 SlotIndex&, int&) const;
153 void UpdateSpillSlotInterval(VNInfo*, SlotIndex, SlotIndex);
155 bool SplitRegLiveInterval(LiveInterval*);
157 bool SplitRegLiveIntervals(const TargetRegisterClass **,
158 SmallPtrSet<LiveInterval*, 8>&);
160 bool createsNewJoin(LiveRange* LR, MachineBasicBlock* DefMBB,
161 MachineBasicBlock* BarrierMBB);
162 bool Rematerialize(unsigned vreg, VNInfo* ValNo,
164 MachineBasicBlock::iterator RestorePt,
165 SmallPtrSet<MachineInstr*, 4>& RefsInMBB);
166 MachineInstr* FoldSpill(unsigned vreg, const TargetRegisterClass* RC,
168 MachineInstr* Barrier,
169 MachineBasicBlock* MBB,
171 SmallPtrSet<MachineInstr*, 4>& RefsInMBB);
172 MachineInstr* FoldRestore(unsigned vreg,
173 const TargetRegisterClass* RC,
174 MachineInstr* Barrier,
175 MachineBasicBlock* MBB,
177 SmallPtrSet<MachineInstr*, 4>& RefsInMBB);
178 void RenumberValno(VNInfo* VN);
179 void ReconstructLiveInterval(LiveInterval* LI);
180 bool removeDeadSpills(SmallPtrSet<LiveInterval*, 8>& split);
181 unsigned getNumberOfNonSpills(SmallPtrSet<MachineInstr*, 4>& MIs,
182 unsigned Reg, int FrameIndex, bool& TwoAddr);
183 VNInfo* PerformPHIConstruction(MachineBasicBlock::iterator Use,
184 MachineBasicBlock* MBB, LiveInterval* LI,
185 SmallPtrSet<MachineInstr*, 4>& Visited,
186 DenseMap<MachineBasicBlock*, SmallPtrSet<MachineInstr*, 2> >& Defs,
187 DenseMap<MachineBasicBlock*, SmallPtrSet<MachineInstr*, 2> >& Uses,
188 DenseMap<MachineInstr*, VNInfo*>& NewVNs,
189 DenseMap<MachineBasicBlock*, VNInfo*>& LiveOut,
190 DenseMap<MachineBasicBlock*, VNInfo*>& Phis,
191 bool IsTopLevel, bool IsIntraBlock);
192 VNInfo* PerformPHIConstructionFallBack(MachineBasicBlock::iterator Use,
193 MachineBasicBlock* MBB, LiveInterval* LI,
194 SmallPtrSet<MachineInstr*, 4>& Visited,
195 DenseMap<MachineBasicBlock*, SmallPtrSet<MachineInstr*, 2> >& Defs,
196 DenseMap<MachineBasicBlock*, SmallPtrSet<MachineInstr*, 2> >& Uses,
197 DenseMap<MachineInstr*, VNInfo*>& NewVNs,
198 DenseMap<MachineBasicBlock*, VNInfo*>& LiveOut,
199 DenseMap<MachineBasicBlock*, VNInfo*>& Phis,
200 bool IsTopLevel, bool IsIntraBlock);
202 } // end anonymous namespace
204 char PreAllocSplitting::ID = 0;
206 static RegisterPass<PreAllocSplitting>
207 X("pre-alloc-splitting", "Pre-Register Allocation Live Interval Splitting");
209 char &llvm::PreAllocSplittingID = PreAllocSplitting::ID;
211 /// findSpillPoint - Find a gap as far away from the given MI that's suitable
212 /// for spilling the current live interval. The index must be before any
213 /// defs and uses of the live interval register in the mbb. Return begin() if
215 MachineBasicBlock::iterator
216 PreAllocSplitting::findSpillPoint(MachineBasicBlock *MBB, MachineInstr *MI,
218 SmallPtrSet<MachineInstr*, 4> &RefsInMBB) {
219 MachineBasicBlock::iterator Pt = MBB->begin();
221 MachineBasicBlock::iterator MII = MI;
222 MachineBasicBlock::iterator EndPt = DefMI
223 ? MachineBasicBlock::iterator(DefMI) : MBB->begin();
225 while (MII != EndPt && !RefsInMBB.count(MII) &&
226 MII->getOpcode() != TRI->getCallFrameSetupOpcode())
228 if (MII == EndPt || RefsInMBB.count(MII)) return Pt;
230 while (MII != EndPt && !RefsInMBB.count(MII)) {
231 // We can't insert the spill between the barrier (a call), and its
232 // corresponding call frame setup.
233 if (MII->getOpcode() == TRI->getCallFrameDestroyOpcode()) {
234 while (MII->getOpcode() != TRI->getCallFrameSetupOpcode()) {
245 if (RefsInMBB.count(MII))
255 /// findRestorePoint - Find a gap in the instruction index map that's suitable
256 /// for restoring the current live interval value. The index must be before any
257 /// uses of the live interval register in the mbb. Return end() if none is
259 MachineBasicBlock::iterator
260 PreAllocSplitting::findRestorePoint(MachineBasicBlock *MBB, MachineInstr *MI,
262 SmallPtrSet<MachineInstr*, 4> &RefsInMBB) {
263 // FIXME: Allow spill to be inserted to the beginning of the mbb. Update mbb
264 // begin index accordingly.
265 MachineBasicBlock::iterator Pt = MBB->end();
266 MachineBasicBlock::iterator EndPt = MBB->getFirstTerminator();
268 // We start at the call, so walk forward until we find the call frame teardown
269 // since we can't insert restores before that. Bail if we encounter a use
271 MachineBasicBlock::iterator MII = MI;
272 if (MII == EndPt) return Pt;
274 while (MII != EndPt && !RefsInMBB.count(MII) &&
275 MII->getOpcode() != TRI->getCallFrameDestroyOpcode())
277 if (MII == EndPt || RefsInMBB.count(MII)) return Pt;
280 // FIXME: Limit the number of instructions to examine to reduce
282 while (MII != EndPt) {
283 SlotIndex Index = LIs->getInstructionIndex(MII);
287 // We can't insert a restore between the barrier (a call) and its
288 // corresponding call frame teardown.
289 if (MII->getOpcode() == TRI->getCallFrameSetupOpcode()) {
291 if (MII == EndPt || RefsInMBB.count(MII)) return Pt;
293 } while (MII->getOpcode() != TRI->getCallFrameDestroyOpcode());
298 if (RefsInMBB.count(MII))
307 /// CreateSpillStackSlot - Create a stack slot for the live interval being
308 /// split. If the live interval was previously split, just reuse the same
310 int PreAllocSplitting::CreateSpillStackSlot(unsigned Reg,
311 const TargetRegisterClass *RC) {
313 DenseMap<unsigned, int>::iterator I = IntervalSSMap.find(Reg);
314 if (I != IntervalSSMap.end()) {
317 SS = MFI->CreateSpillStackObject(RC->getSize(), RC->getAlignment());
318 IntervalSSMap[Reg] = SS;
321 // Create live interval for stack slot.
322 CurrSLI = &LSs->getOrCreateInterval(SS, RC);
323 if (CurrSLI->hasAtLeastOneValue())
324 CurrSValNo = CurrSLI->getValNumInfo(0);
326 CurrSValNo = CurrSLI->getNextValue(SlotIndex(), 0, false,
327 LSs->getVNInfoAllocator());
331 /// IsAvailableInStack - Return true if register is available in a split stack
332 /// slot at the specified index.
334 PreAllocSplitting::IsAvailableInStack(MachineBasicBlock *DefMBB,
335 unsigned Reg, SlotIndex DefIndex,
336 SlotIndex RestoreIndex,
337 SlotIndex &SpillIndex,
342 DenseMap<unsigned, int>::const_iterator I = IntervalSSMap.find(Reg);
343 if (I == IntervalSSMap.end())
345 DenseMap<SlotIndex, SlotIndex>::const_iterator
346 II = Def2SpillMap.find(DefIndex);
347 if (II == Def2SpillMap.end())
350 // If last spill of def is in the same mbb as barrier mbb (where restore will
351 // be), make sure it's not below the intended restore index.
352 // FIXME: Undo the previous spill?
353 assert(LIs->getMBBFromIndex(II->second) == DefMBB);
354 if (DefMBB == BarrierMBB && II->second >= RestoreIndex)
358 SpillIndex = II->second;
362 /// UpdateSpillSlotInterval - Given the specified val# of the register live
363 /// interval being split, and the spill and restore indicies, update the live
364 /// interval of the spill stack slot.
366 PreAllocSplitting::UpdateSpillSlotInterval(VNInfo *ValNo, SlotIndex SpillIndex,
367 SlotIndex RestoreIndex) {
368 assert(LIs->getMBBFromIndex(RestoreIndex) == BarrierMBB &&
369 "Expect restore in the barrier mbb");
371 MachineBasicBlock *MBB = LIs->getMBBFromIndex(SpillIndex);
372 if (MBB == BarrierMBB) {
373 // Intra-block spill + restore. We are done.
374 LiveRange SLR(SpillIndex, RestoreIndex, CurrSValNo);
375 CurrSLI->addRange(SLR);
379 SmallPtrSet<MachineBasicBlock*, 4> Processed;
380 SlotIndex EndIdx = LIs->getMBBEndIdx(MBB);
381 LiveRange SLR(SpillIndex, EndIdx, CurrSValNo);
382 CurrSLI->addRange(SLR);
383 Processed.insert(MBB);
385 // Start from the spill mbb, figure out the extend of the spill slot's
387 SmallVector<MachineBasicBlock*, 4> WorkList;
388 const LiveRange *LR = CurrLI->getLiveRangeContaining(SpillIndex);
389 if (LR->end > EndIdx)
390 // If live range extend beyond end of mbb, add successors to work list.
391 for (MachineBasicBlock::succ_iterator SI = MBB->succ_begin(),
392 SE = MBB->succ_end(); SI != SE; ++SI)
393 WorkList.push_back(*SI);
395 while (!WorkList.empty()) {
396 MachineBasicBlock *MBB = WorkList.back();
398 if (Processed.count(MBB))
400 SlotIndex Idx = LIs->getMBBStartIdx(MBB);
401 LR = CurrLI->getLiveRangeContaining(Idx);
402 if (LR && LR->valno == ValNo) {
403 EndIdx = LIs->getMBBEndIdx(MBB);
404 if (Idx <= RestoreIndex && RestoreIndex < EndIdx) {
405 // Spill slot live interval stops at the restore.
406 LiveRange SLR(Idx, RestoreIndex, CurrSValNo);
407 CurrSLI->addRange(SLR);
408 } else if (LR->end > EndIdx) {
409 // Live range extends beyond end of mbb, process successors.
410 LiveRange SLR(Idx, EndIdx.getNextIndex(), CurrSValNo);
411 CurrSLI->addRange(SLR);
412 for (MachineBasicBlock::succ_iterator SI = MBB->succ_begin(),
413 SE = MBB->succ_end(); SI != SE; ++SI)
414 WorkList.push_back(*SI);
416 LiveRange SLR(Idx, LR->end, CurrSValNo);
417 CurrSLI->addRange(SLR);
419 Processed.insert(MBB);
424 /// PerformPHIConstruction - From properly set up use and def lists, use a PHI
425 /// construction algorithm to compute the ranges and valnos for an interval.
427 PreAllocSplitting::PerformPHIConstruction(MachineBasicBlock::iterator UseI,
428 MachineBasicBlock* MBB, LiveInterval* LI,
429 SmallPtrSet<MachineInstr*, 4>& Visited,
430 DenseMap<MachineBasicBlock*, SmallPtrSet<MachineInstr*, 2> >& Defs,
431 DenseMap<MachineBasicBlock*, SmallPtrSet<MachineInstr*, 2> >& Uses,
432 DenseMap<MachineInstr*, VNInfo*>& NewVNs,
433 DenseMap<MachineBasicBlock*, VNInfo*>& LiveOut,
434 DenseMap<MachineBasicBlock*, VNInfo*>& Phis,
435 bool IsTopLevel, bool IsIntraBlock) {
436 // Return memoized result if it's available.
437 if (IsTopLevel && Visited.count(UseI) && NewVNs.count(UseI))
439 else if (!IsTopLevel && IsIntraBlock && NewVNs.count(UseI))
441 else if (!IsIntraBlock && LiveOut.count(MBB))
444 // Check if our block contains any uses or defs.
445 bool ContainsDefs = Defs.count(MBB);
446 bool ContainsUses = Uses.count(MBB);
450 // Enumerate the cases of use/def contaning blocks.
451 if (!ContainsDefs && !ContainsUses) {
452 return PerformPHIConstructionFallBack(UseI, MBB, LI, Visited, Defs, Uses,
453 NewVNs, LiveOut, Phis,
454 IsTopLevel, IsIntraBlock);
455 } else if (ContainsDefs && !ContainsUses) {
456 SmallPtrSet<MachineInstr*, 2>& BlockDefs = Defs[MBB];
458 // Search for the def in this block. If we don't find it before the
459 // instruction we care about, go to the fallback case. Note that that
460 // should never happen: this cannot be intrablock, so use should
461 // always be an end() iterator.
462 assert(UseI == MBB->end() && "No use marked in intrablock");
464 MachineBasicBlock::iterator Walker = UseI;
466 while (Walker != MBB->begin()) {
467 if (BlockDefs.count(Walker))
472 // Once we've found it, extend its VNInfo to our instruction.
473 SlotIndex DefIndex = LIs->getInstructionIndex(Walker);
474 DefIndex = DefIndex.getDefIndex();
475 SlotIndex EndIndex = LIs->getMBBEndIdx(MBB);
477 RetVNI = NewVNs[Walker];
478 LI->addRange(LiveRange(DefIndex, EndIndex, RetVNI));
479 } else if (!ContainsDefs && ContainsUses) {
480 SmallPtrSet<MachineInstr*, 2>& BlockUses = Uses[MBB];
482 // Search for the use in this block that precedes the instruction we care
483 // about, going to the fallback case if we don't find it.
484 MachineBasicBlock::iterator Walker = UseI;
486 while (Walker != MBB->begin()) {
488 if (BlockUses.count(Walker)) {
495 return PerformPHIConstructionFallBack(UseI, MBB, LI, Visited, Defs,
496 Uses, NewVNs, LiveOut, Phis,
497 IsTopLevel, IsIntraBlock);
499 SlotIndex UseIndex = LIs->getInstructionIndex(Walker);
500 UseIndex = UseIndex.getUseIndex();
503 EndIndex = LIs->getInstructionIndex(UseI).getDefIndex();
505 EndIndex = LIs->getMBBEndIdx(MBB);
507 // Now, recursively phi construct the VNInfo for the use we found,
508 // and then extend it to include the instruction we care about
509 RetVNI = PerformPHIConstruction(Walker, MBB, LI, Visited, Defs, Uses,
510 NewVNs, LiveOut, Phis, false, true);
512 LI->addRange(LiveRange(UseIndex, EndIndex, RetVNI));
514 // FIXME: Need to set kills properly for inter-block stuff.
515 } else if (ContainsDefs && ContainsUses) {
516 SmallPtrSet<MachineInstr*, 2>& BlockDefs = Defs[MBB];
517 SmallPtrSet<MachineInstr*, 2>& BlockUses = Uses[MBB];
519 // This case is basically a merging of the two preceding case, with the
520 // special note that checking for defs must take precedence over checking
521 // for uses, because of two-address instructions.
522 MachineBasicBlock::iterator Walker = UseI;
523 bool foundDef = false;
524 bool foundUse = false;
525 while (Walker != MBB->begin()) {
527 if (BlockDefs.count(Walker)) {
530 } else if (BlockUses.count(Walker)) {
536 if (!foundDef && !foundUse)
537 return PerformPHIConstructionFallBack(UseI, MBB, LI, Visited, Defs,
538 Uses, NewVNs, LiveOut, Phis,
539 IsTopLevel, IsIntraBlock);
541 SlotIndex StartIndex = LIs->getInstructionIndex(Walker);
542 StartIndex = foundDef ? StartIndex.getDefIndex() : StartIndex.getUseIndex();
545 EndIndex = LIs->getInstructionIndex(UseI).getDefIndex();
547 EndIndex = LIs->getMBBEndIdx(MBB);
550 RetVNI = NewVNs[Walker];
552 RetVNI = PerformPHIConstruction(Walker, MBB, LI, Visited, Defs, Uses,
553 NewVNs, LiveOut, Phis, false, true);
555 LI->addRange(LiveRange(StartIndex, EndIndex, RetVNI));
558 // Memoize results so we don't have to recompute them.
559 if (!IsIntraBlock) LiveOut[MBB] = RetVNI;
561 if (!NewVNs.count(UseI))
562 NewVNs[UseI] = RetVNI;
563 Visited.insert(UseI);
569 /// PerformPHIConstructionFallBack - PerformPHIConstruction fall back path.
572 PreAllocSplitting::PerformPHIConstructionFallBack(MachineBasicBlock::iterator UseI,
573 MachineBasicBlock* MBB, LiveInterval* LI,
574 SmallPtrSet<MachineInstr*, 4>& Visited,
575 DenseMap<MachineBasicBlock*, SmallPtrSet<MachineInstr*, 2> >& Defs,
576 DenseMap<MachineBasicBlock*, SmallPtrSet<MachineInstr*, 2> >& Uses,
577 DenseMap<MachineInstr*, VNInfo*>& NewVNs,
578 DenseMap<MachineBasicBlock*, VNInfo*>& LiveOut,
579 DenseMap<MachineBasicBlock*, VNInfo*>& Phis,
580 bool IsTopLevel, bool IsIntraBlock) {
581 // NOTE: Because this is the fallback case from other cases, we do NOT
582 // assume that we are not intrablock here.
583 if (Phis.count(MBB)) return Phis[MBB];
585 SlotIndex StartIndex = LIs->getMBBStartIdx(MBB);
586 VNInfo *RetVNI = Phis[MBB] =
587 LI->getNextValue(SlotIndex(), /*FIXME*/ 0, false,
588 LIs->getVNInfoAllocator());
590 if (!IsIntraBlock) LiveOut[MBB] = RetVNI;
592 // If there are no uses or defs between our starting point and the
593 // beginning of the block, then recursive perform phi construction
594 // on our predecessors.
595 DenseMap<MachineBasicBlock*, VNInfo*> IncomingVNs;
596 for (MachineBasicBlock::pred_iterator PI = MBB->pred_begin(),
597 PE = MBB->pred_end(); PI != PE; ++PI) {
598 VNInfo* Incoming = PerformPHIConstruction((*PI)->end(), *PI, LI,
599 Visited, Defs, Uses, NewVNs,
600 LiveOut, Phis, false, false);
602 IncomingVNs[*PI] = Incoming;
605 if (MBB->pred_size() == 1 && !RetVNI->hasPHIKill()) {
606 VNInfo* OldVN = RetVNI;
607 VNInfo* NewVN = IncomingVNs.begin()->second;
608 VNInfo* MergedVN = LI->MergeValueNumberInto(OldVN, NewVN);
609 if (MergedVN == OldVN) std::swap(OldVN, NewVN);
611 for (DenseMap<MachineBasicBlock*, VNInfo*>::iterator LOI = LiveOut.begin(),
612 LOE = LiveOut.end(); LOI != LOE; ++LOI)
613 if (LOI->second == OldVN)
614 LOI->second = MergedVN;
615 for (DenseMap<MachineInstr*, VNInfo*>::iterator NVI = NewVNs.begin(),
616 NVE = NewVNs.end(); NVI != NVE; ++NVI)
617 if (NVI->second == OldVN)
618 NVI->second = MergedVN;
619 for (DenseMap<MachineBasicBlock*, VNInfo*>::iterator PI = Phis.begin(),
620 PE = Phis.end(); PI != PE; ++PI)
621 if (PI->second == OldVN)
622 PI->second = MergedVN;
625 // Otherwise, merge the incoming VNInfos with a phi join. Create a new
626 // VNInfo to represent the joined value.
627 for (DenseMap<MachineBasicBlock*, VNInfo*>::iterator I =
628 IncomingVNs.begin(), E = IncomingVNs.end(); I != E; ++I) {
629 I->second->setHasPHIKill(true);
635 EndIndex = LIs->getInstructionIndex(UseI).getDefIndex();
637 EndIndex = LIs->getMBBEndIdx(MBB);
638 LI->addRange(LiveRange(StartIndex, EndIndex, RetVNI));
640 // Memoize results so we don't have to recompute them.
642 LiveOut[MBB] = RetVNI;
644 if (!NewVNs.count(UseI))
645 NewVNs[UseI] = RetVNI;
646 Visited.insert(UseI);
652 /// ReconstructLiveInterval - Recompute a live interval from scratch.
653 void PreAllocSplitting::ReconstructLiveInterval(LiveInterval* LI) {
654 VNInfo::Allocator& Alloc = LIs->getVNInfoAllocator();
656 // Clear the old ranges and valnos;
659 // Cache the uses and defs of the register
660 typedef DenseMap<MachineBasicBlock*, SmallPtrSet<MachineInstr*, 2> > RegMap;
663 // Keep track of the new VNs we're creating.
664 DenseMap<MachineInstr*, VNInfo*> NewVNs;
665 SmallPtrSet<VNInfo*, 2> PhiVNs;
667 // Cache defs, and create a new VNInfo for each def.
668 for (MachineRegisterInfo::def_iterator DI = MRI->def_begin(LI->reg),
669 DE = MRI->def_end(); DI != DE; ++DI) {
670 Defs[(*DI).getParent()].insert(&*DI);
672 SlotIndex DefIdx = LIs->getInstructionIndex(&*DI);
673 DefIdx = DefIdx.getDefIndex();
675 assert(!DI->isPHI() && "PHI instr in code during pre-alloc splitting.");
676 VNInfo* NewVN = LI->getNextValue(DefIdx, 0, true, Alloc);
678 // If the def is a move, set the copy field.
679 if (DI->isCopyLike() && DI->getOperand(0).getReg() == LI->reg)
680 NewVN->setCopy(&*DI);
682 NewVNs[&*DI] = NewVN;
685 // Cache uses as a separate pass from actually processing them.
686 for (MachineRegisterInfo::use_iterator UI = MRI->use_begin(LI->reg),
687 UE = MRI->use_end(); UI != UE; ++UI)
688 Uses[(*UI).getParent()].insert(&*UI);
690 // Now, actually process every use and use a phi construction algorithm
691 // to walk from it to its reaching definitions, building VNInfos along
693 DenseMap<MachineBasicBlock*, VNInfo*> LiveOut;
694 DenseMap<MachineBasicBlock*, VNInfo*> Phis;
695 SmallPtrSet<MachineInstr*, 4> Visited;
696 for (MachineRegisterInfo::use_iterator UI = MRI->use_begin(LI->reg),
697 UE = MRI->use_end(); UI != UE; ++UI) {
698 PerformPHIConstruction(&*UI, UI->getParent(), LI, Visited, Defs,
699 Uses, NewVNs, LiveOut, Phis, true, true);
702 // Add ranges for dead defs
703 for (MachineRegisterInfo::def_iterator DI = MRI->def_begin(LI->reg),
704 DE = MRI->def_end(); DI != DE; ++DI) {
705 SlotIndex DefIdx = LIs->getInstructionIndex(&*DI);
706 DefIdx = DefIdx.getDefIndex();
708 if (LI->liveAt(DefIdx)) continue;
710 VNInfo* DeadVN = NewVNs[&*DI];
711 LI->addRange(LiveRange(DefIdx, DefIdx.getNextSlot(), DeadVN));
715 /// RenumberValno - Split the given valno out into a new vreg, allowing it to
716 /// be allocated to a different register. This function creates a new vreg,
717 /// copies the valno and its live ranges over to the new vreg's interval,
718 /// removes them from the old interval, and rewrites all uses and defs of
719 /// the original reg to the new vreg within those ranges.
720 void PreAllocSplitting::RenumberValno(VNInfo* VN) {
721 SmallVector<VNInfo*, 4> Stack;
722 SmallVector<VNInfo*, 4> VNsToCopy;
725 // Walk through and copy the valno we care about, and any other valnos
726 // that are two-address redefinitions of the one we care about. These
727 // will need to be rewritten as well. We also check for safety of the
728 // renumbering here, by making sure that none of the valno involved has
730 while (!Stack.empty()) {
731 VNInfo* OldVN = Stack.back();
734 // Bail out if we ever encounter a valno that has a PHI kill. We can't
736 if (OldVN->hasPHIKill()) return;
738 VNsToCopy.push_back(OldVN);
740 // Locate two-address redefinitions
741 for (MachineRegisterInfo::def_iterator DI = MRI->def_begin(CurrLI->reg),
742 DE = MRI->def_end(); DI != DE; ++DI) {
743 if (!DI->isRegTiedToUseOperand(DI.getOperandNo())) continue;
744 SlotIndex DefIdx = LIs->getInstructionIndex(&*DI).getDefIndex();
745 VNInfo* NextVN = CurrLI->findDefinedVNInfoForRegInt(DefIdx);
746 if (std::find(VNsToCopy.begin(), VNsToCopy.end(), NextVN) !=
748 Stack.push_back(NextVN);
752 // Create the new vreg
753 unsigned NewVReg = MRI->createVirtualRegister(MRI->getRegClass(CurrLI->reg));
755 // Create the new live interval
756 LiveInterval& NewLI = LIs->getOrCreateInterval(NewVReg);
758 for (SmallVector<VNInfo*, 4>::iterator OI = VNsToCopy.begin(), OE =
759 VNsToCopy.end(); OI != OE; ++OI) {
762 // Copy the valno over
763 VNInfo* NewVN = NewLI.createValueCopy(OldVN, LIs->getVNInfoAllocator());
764 NewLI.MergeValueInAsValue(*CurrLI, OldVN, NewVN);
766 // Remove the valno from the old interval
767 CurrLI->removeValNo(OldVN);
770 // Rewrite defs and uses. This is done in two stages to avoid invalidating
772 SmallVector<std::pair<MachineInstr*, unsigned>, 8> OpsToChange;
774 for (MachineRegisterInfo::reg_iterator I = MRI->reg_begin(CurrLI->reg),
775 E = MRI->reg_end(); I != E; ++I) {
776 MachineOperand& MO = I.getOperand();
777 SlotIndex InstrIdx = LIs->getInstructionIndex(&*I);
779 if ((MO.isUse() && NewLI.liveAt(InstrIdx.getUseIndex())) ||
780 (MO.isDef() && NewLI.liveAt(InstrIdx.getDefIndex())))
781 OpsToChange.push_back(std::make_pair(&*I, I.getOperandNo()));
784 for (SmallVector<std::pair<MachineInstr*, unsigned>, 8>::iterator I =
785 OpsToChange.begin(), E = OpsToChange.end(); I != E; ++I) {
786 MachineInstr* Inst = I->first;
787 unsigned OpIdx = I->second;
788 MachineOperand& MO = Inst->getOperand(OpIdx);
792 // Grow the VirtRegMap, since we've created a new vreg.
795 // The renumbered vreg shares a stack slot with the old register.
796 if (IntervalSSMap.count(CurrLI->reg))
797 IntervalSSMap[NewVReg] = IntervalSSMap[CurrLI->reg];
802 bool PreAllocSplitting::Rematerialize(unsigned VReg, VNInfo* ValNo,
804 MachineBasicBlock::iterator RestorePt,
805 SmallPtrSet<MachineInstr*, 4>& RefsInMBB) {
806 MachineBasicBlock& MBB = *RestorePt->getParent();
808 MachineBasicBlock::iterator KillPt = BarrierMBB->end();
809 if (!ValNo->isDefAccurate() || DefMI->getParent() == BarrierMBB)
810 KillPt = findSpillPoint(BarrierMBB, Barrier, NULL, RefsInMBB);
812 KillPt = llvm::next(MachineBasicBlock::iterator(DefMI));
814 if (KillPt == DefMI->getParent()->end())
817 TII->reMaterialize(MBB, RestorePt, VReg, 0, DefMI, *TRI);
818 SlotIndex RematIdx = LIs->InsertMachineInstrInMaps(prior(RestorePt));
820 ReconstructLiveInterval(CurrLI);
821 RematIdx = RematIdx.getDefIndex();
822 RenumberValno(CurrLI->findDefinedVNInfoForRegInt(RematIdx));
829 MachineInstr* PreAllocSplitting::FoldSpill(unsigned vreg,
830 const TargetRegisterClass* RC,
832 MachineInstr* Barrier,
833 MachineBasicBlock* MBB,
835 SmallPtrSet<MachineInstr*, 4>& RefsInMBB) {
836 // Go top down if RefsInMBB is empty.
837 if (RefsInMBB.empty())
840 MachineBasicBlock::iterator FoldPt = Barrier;
841 while (&*FoldPt != DefMI && FoldPt != MBB->begin() &&
842 !RefsInMBB.count(FoldPt))
845 int OpIdx = FoldPt->findRegisterDefOperandIdx(vreg);
849 SmallVector<unsigned, 1> Ops;
850 Ops.push_back(OpIdx);
852 if (!TII->canFoldMemoryOperand(FoldPt, Ops))
855 DenseMap<unsigned, int>::iterator I = IntervalSSMap.find(vreg);
856 if (I != IntervalSSMap.end()) {
859 SS = MFI->CreateSpillStackObject(RC->getSize(), RC->getAlignment());
862 MachineInstr* FMI = TII->foldMemoryOperand(FoldPt, Ops, SS);
865 LIs->ReplaceMachineInstrInMaps(FoldPt, FMI);
866 FoldPt->eraseFromParent();
869 IntervalSSMap[vreg] = SS;
870 CurrSLI = &LSs->getOrCreateInterval(SS, RC);
871 if (CurrSLI->hasAtLeastOneValue())
872 CurrSValNo = CurrSLI->getValNumInfo(0);
874 CurrSValNo = CurrSLI->getNextValue(SlotIndex(), 0, false,
875 LSs->getVNInfoAllocator());
881 MachineInstr* PreAllocSplitting::FoldRestore(unsigned vreg,
882 const TargetRegisterClass* RC,
883 MachineInstr* Barrier,
884 MachineBasicBlock* MBB,
886 SmallPtrSet<MachineInstr*, 4>& RefsInMBB) {
887 if ((int)RestoreFoldLimit != -1 && RestoreFoldLimit == (int)NumRestoreFolds)
890 // Go top down if RefsInMBB is empty.
891 if (RefsInMBB.empty())
894 // Can't fold a restore between a call stack setup and teardown.
895 MachineBasicBlock::iterator FoldPt = Barrier;
897 // Advance from barrier to call frame teardown.
898 while (FoldPt != MBB->getFirstTerminator() &&
899 FoldPt->getOpcode() != TRI->getCallFrameDestroyOpcode()) {
900 if (RefsInMBB.count(FoldPt))
906 if (FoldPt == MBB->getFirstTerminator())
911 // Now find the restore point.
912 while (FoldPt != MBB->getFirstTerminator() && !RefsInMBB.count(FoldPt)) {
913 if (FoldPt->getOpcode() == TRI->getCallFrameSetupOpcode()) {
914 while (FoldPt != MBB->getFirstTerminator() &&
915 FoldPt->getOpcode() != TRI->getCallFrameDestroyOpcode()) {
916 if (RefsInMBB.count(FoldPt))
922 if (FoldPt == MBB->getFirstTerminator())
929 if (FoldPt == MBB->getFirstTerminator())
932 int OpIdx = FoldPt->findRegisterUseOperandIdx(vreg, true);
936 SmallVector<unsigned, 1> Ops;
937 Ops.push_back(OpIdx);
939 if (!TII->canFoldMemoryOperand(FoldPt, Ops))
942 MachineInstr* FMI = TII->foldMemoryOperand(FoldPt, Ops, SS);
945 LIs->ReplaceMachineInstrInMaps(FoldPt, FMI);
946 FoldPt->eraseFromParent();
953 /// SplitRegLiveInterval - Split (spill and restore) the given live interval
954 /// so it would not cross the barrier that's being processed. Shrink wrap
955 /// (minimize) the live interval to the last uses.
956 bool PreAllocSplitting::SplitRegLiveInterval(LiveInterval *LI) {
957 DEBUG(dbgs() << "Pre-alloc splitting " << LI->reg << " for " << *Barrier
962 // Find live range where current interval cross the barrier.
963 LiveInterval::iterator LR =
964 CurrLI->FindLiveRangeContaining(BarrierIdx.getUseIndex());
965 VNInfo *ValNo = LR->valno;
967 assert(!ValNo->isUnused() && "Val# is defined by a dead def?");
969 MachineInstr *DefMI = ValNo->isDefAccurate()
970 ? LIs->getInstructionFromIndex(ValNo->def) : NULL;
972 // If this would create a new join point, do not split.
973 if (DefMI && createsNewJoin(LR, DefMI->getParent(), Barrier->getParent())) {
974 DEBUG(dbgs() << "FAILED (would create a new join point).\n");
978 // Find all references in the barrier mbb.
979 SmallPtrSet<MachineInstr*, 4> RefsInMBB;
980 for (MachineRegisterInfo::reg_iterator I = MRI->reg_begin(CurrLI->reg),
981 E = MRI->reg_end(); I != E; ++I) {
982 MachineInstr *RefMI = &*I;
983 if (RefMI->getParent() == BarrierMBB)
984 RefsInMBB.insert(RefMI);
987 // Find a point to restore the value after the barrier.
988 MachineBasicBlock::iterator RestorePt =
989 findRestorePoint(BarrierMBB, Barrier, LR->end, RefsInMBB);
990 if (RestorePt == BarrierMBB->end()) {
991 DEBUG(dbgs() << "FAILED (could not find a suitable restore point).\n");
995 if (DefMI && LIs->isReMaterializable(*LI, ValNo, DefMI))
996 if (Rematerialize(LI->reg, ValNo, DefMI, RestorePt, RefsInMBB)) {
997 DEBUG(dbgs() << "success (remat).\n");
1001 // Add a spill either before the barrier or after the definition.
1002 MachineBasicBlock *DefMBB = DefMI ? DefMI->getParent() : NULL;
1003 const TargetRegisterClass *RC = MRI->getRegClass(CurrLI->reg);
1004 SlotIndex SpillIndex;
1005 MachineInstr *SpillMI = NULL;
1007 if (!ValNo->isDefAccurate()) {
1008 // If we don't know where the def is we must split just before the barrier.
1009 if ((SpillMI = FoldSpill(LI->reg, RC, 0, Barrier,
1010 BarrierMBB, SS, RefsInMBB))) {
1011 SpillIndex = LIs->getInstructionIndex(SpillMI);
1013 MachineBasicBlock::iterator SpillPt =
1014 findSpillPoint(BarrierMBB, Barrier, NULL, RefsInMBB);
1015 if (SpillPt == BarrierMBB->begin()) {
1016 DEBUG(dbgs() << "FAILED (could not find a suitable spill point).\n");
1017 return false; // No gap to insert spill.
1021 SS = CreateSpillStackSlot(CurrLI->reg, RC);
1022 TII->storeRegToStackSlot(*BarrierMBB, SpillPt, CurrLI->reg, true, SS, RC,
1024 SpillMI = prior(SpillPt);
1025 SpillIndex = LIs->InsertMachineInstrInMaps(SpillMI);
1027 } else if (!IsAvailableInStack(DefMBB, CurrLI->reg, ValNo->def,
1028 LIs->getZeroIndex(), SpillIndex, SS)) {
1029 // If it's already split, just restore the value. There is no need to spill
1032 DEBUG(dbgs() << "FAILED (def is dead).\n");
1033 return false; // Def is dead. Do nothing.
1036 if ((SpillMI = FoldSpill(LI->reg, RC, DefMI, Barrier,
1037 BarrierMBB, SS, RefsInMBB))) {
1038 SpillIndex = LIs->getInstructionIndex(SpillMI);
1040 // Check if it's possible to insert a spill after the def MI.
1041 MachineBasicBlock::iterator SpillPt;
1042 if (DefMBB == BarrierMBB) {
1043 // Add spill after the def and the last use before the barrier.
1044 SpillPt = findSpillPoint(BarrierMBB, Barrier, DefMI,
1046 if (SpillPt == DefMBB->begin()) {
1047 DEBUG(dbgs() << "FAILED (could not find a suitable spill point).\n");
1048 return false; // No gap to insert spill.
1051 SpillPt = llvm::next(MachineBasicBlock::iterator(DefMI));
1052 if (SpillPt == DefMBB->end()) {
1053 DEBUG(dbgs() << "FAILED (could not find a suitable spill point).\n");
1054 return false; // No gap to insert spill.
1058 SS = CreateSpillStackSlot(CurrLI->reg, RC);
1059 TII->storeRegToStackSlot(*DefMBB, SpillPt, CurrLI->reg, false, SS, RC,
1061 SpillMI = prior(SpillPt);
1062 SpillIndex = LIs->InsertMachineInstrInMaps(SpillMI);
1066 // Remember def instruction index to spill index mapping.
1067 if (DefMI && SpillMI)
1068 Def2SpillMap[ValNo->def] = SpillIndex;
1071 bool FoldedRestore = false;
1072 SlotIndex RestoreIndex;
1073 if (MachineInstr* LMI = FoldRestore(CurrLI->reg, RC, Barrier,
1074 BarrierMBB, SS, RefsInMBB)) {
1076 RestoreIndex = LIs->getInstructionIndex(RestorePt);
1077 FoldedRestore = true;
1079 TII->loadRegFromStackSlot(*BarrierMBB, RestorePt, CurrLI->reg, SS, RC, TRI);
1080 MachineInstr *LoadMI = prior(RestorePt);
1081 RestoreIndex = LIs->InsertMachineInstrInMaps(LoadMI);
1084 // Update spill stack slot live interval.
1085 UpdateSpillSlotInterval(ValNo, SpillIndex.getUseIndex().getNextSlot(),
1086 RestoreIndex.getDefIndex());
1088 ReconstructLiveInterval(CurrLI);
1090 if (!FoldedRestore) {
1091 SlotIndex RestoreIdx = LIs->getInstructionIndex(prior(RestorePt));
1092 RestoreIdx = RestoreIdx.getDefIndex();
1093 RenumberValno(CurrLI->findDefinedVNInfoForRegInt(RestoreIdx));
1097 DEBUG(dbgs() << "success.\n");
1101 /// SplitRegLiveIntervals - Split all register live intervals that cross the
1102 /// barrier that's being processed.
1104 PreAllocSplitting::SplitRegLiveIntervals(const TargetRegisterClass **RCs,
1105 SmallPtrSet<LiveInterval*, 8>& Split) {
1106 // First find all the virtual registers whose live intervals are intercepted
1107 // by the current barrier.
1108 SmallVector<LiveInterval*, 8> Intervals;
1109 for (const TargetRegisterClass **RC = RCs; *RC; ++RC) {
1110 // FIXME: If it's not safe to move any instruction that defines the barrier
1111 // register class, then it means there are some special dependencies which
1112 // codegen is not modelling. Ignore these barriers for now.
1113 if (!TII->isSafeToMoveRegClassDefs(*RC))
1115 const std::vector<unsigned> &VRs = MRI->getRegClassVirtRegs(*RC);
1116 for (unsigned i = 0, e = VRs.size(); i != e; ++i) {
1117 unsigned Reg = VRs[i];
1118 if (!LIs->hasInterval(Reg))
1120 LiveInterval *LI = &LIs->getInterval(Reg);
1121 if (LI->liveAt(BarrierIdx) && !Barrier->readsRegister(Reg))
1122 // Virtual register live interval is intercepted by the barrier. We
1123 // should split and shrink wrap its interval if possible.
1124 Intervals.push_back(LI);
1128 // Process the affected live intervals.
1129 bool Change = false;
1130 while (!Intervals.empty()) {
1131 if (PreSplitLimit != -1 && (int)NumSplits == PreSplitLimit)
1133 LiveInterval *LI = Intervals.back();
1134 Intervals.pop_back();
1135 bool result = SplitRegLiveInterval(LI);
1136 if (result) Split.insert(LI);
1143 unsigned PreAllocSplitting::getNumberOfNonSpills(
1144 SmallPtrSet<MachineInstr*, 4>& MIs,
1145 unsigned Reg, int FrameIndex,
1146 bool& FeedsTwoAddr) {
1147 unsigned NonSpills = 0;
1148 for (SmallPtrSet<MachineInstr*, 4>::iterator UI = MIs.begin(), UE = MIs.end();
1150 int StoreFrameIndex;
1151 unsigned StoreVReg = TII->isStoreToStackSlot(*UI, StoreFrameIndex);
1152 if (StoreVReg != Reg || StoreFrameIndex != FrameIndex)
1155 int DefIdx = (*UI)->findRegisterDefOperandIdx(Reg);
1156 if (DefIdx != -1 && (*UI)->isRegTiedToUseOperand(DefIdx))
1157 FeedsTwoAddr = true;
1163 /// removeDeadSpills - After doing splitting, filter through all intervals we've
1164 /// split, and see if any of the spills are unnecessary. If so, remove them.
1165 bool PreAllocSplitting::removeDeadSpills(SmallPtrSet<LiveInterval*, 8>& split) {
1166 bool changed = false;
1168 // Walk over all of the live intervals that were touched by the splitter,
1169 // and see if we can do any DCE and/or folding.
1170 for (SmallPtrSet<LiveInterval*, 8>::iterator LI = split.begin(),
1171 LE = split.end(); LI != LE; ++LI) {
1172 DenseMap<VNInfo*, SmallPtrSet<MachineInstr*, 4> > VNUseCount;
1174 // First, collect all the uses of the vreg, and sort them by their
1175 // reaching definition (VNInfo).
1176 for (MachineRegisterInfo::use_iterator UI = MRI->use_begin((*LI)->reg),
1177 UE = MRI->use_end(); UI != UE; ++UI) {
1178 SlotIndex index = LIs->getInstructionIndex(&*UI);
1179 index = index.getUseIndex();
1181 const LiveRange* LR = (*LI)->getLiveRangeContaining(index);
1182 VNUseCount[LR->valno].insert(&*UI);
1185 // Now, take the definitions (VNInfo's) one at a time and try to DCE
1186 // and/or fold them away.
1187 for (LiveInterval::vni_iterator VI = (*LI)->vni_begin(),
1188 VE = (*LI)->vni_end(); VI != VE; ++VI) {
1190 if (DeadSplitLimit != -1 && (int)NumDeadSpills == DeadSplitLimit)
1193 VNInfo* CurrVN = *VI;
1195 // We don't currently try to handle definitions with PHI kills, because
1196 // it would involve processing more than one VNInfo at once.
1197 if (CurrVN->hasPHIKill()) continue;
1199 // We also don't try to handle the results of PHI joins, since there's
1200 // no defining instruction to analyze.
1201 if (!CurrVN->isDefAccurate() || CurrVN->isUnused()) continue;
1203 // We're only interested in eliminating cruft introduced by the splitter,
1204 // is of the form load-use or load-use-store. First, check that the
1205 // definition is a load, and remember what stack slot we loaded it from.
1206 MachineInstr* DefMI = LIs->getInstructionFromIndex(CurrVN->def);
1208 if (!TII->isLoadFromStackSlot(DefMI, FrameIndex)) continue;
1210 // If the definition has no uses at all, just DCE it.
1211 if (VNUseCount[CurrVN].size() == 0) {
1212 LIs->RemoveMachineInstrFromMaps(DefMI);
1213 (*LI)->removeValNo(CurrVN);
1214 DefMI->eraseFromParent();
1215 VNUseCount.erase(CurrVN);
1221 // Second, get the number of non-store uses of the definition, as well as
1222 // a flag indicating whether it feeds into a later two-address definition.
1223 bool FeedsTwoAddr = false;
1224 unsigned NonSpillCount = getNumberOfNonSpills(VNUseCount[CurrVN],
1225 (*LI)->reg, FrameIndex,
1228 // If there's one non-store use and it doesn't feed a two-addr, then
1229 // this is a load-use-store case that we can try to fold.
1230 if (NonSpillCount == 1 && !FeedsTwoAddr) {
1231 // Start by finding the non-store use MachineInstr.
1232 SmallPtrSet<MachineInstr*, 4>::iterator UI = VNUseCount[CurrVN].begin();
1233 int StoreFrameIndex;
1234 unsigned StoreVReg = TII->isStoreToStackSlot(*UI, StoreFrameIndex);
1235 while (UI != VNUseCount[CurrVN].end() &&
1236 (StoreVReg == (*LI)->reg && StoreFrameIndex == FrameIndex)) {
1238 if (UI != VNUseCount[CurrVN].end())
1239 StoreVReg = TII->isStoreToStackSlot(*UI, StoreFrameIndex);
1241 if (UI == VNUseCount[CurrVN].end()) continue;
1243 MachineInstr* use = *UI;
1245 // Attempt to fold it away!
1246 int OpIdx = use->findRegisterUseOperandIdx((*LI)->reg, false);
1247 if (OpIdx == -1) continue;
1248 SmallVector<unsigned, 1> Ops;
1249 Ops.push_back(OpIdx);
1250 if (!TII->canFoldMemoryOperand(use, Ops)) continue;
1252 MachineInstr* NewMI = TII->foldMemoryOperand(use, Ops, FrameIndex);
1254 if (!NewMI) continue;
1256 // Update relevant analyses.
1257 LIs->RemoveMachineInstrFromMaps(DefMI);
1258 LIs->ReplaceMachineInstrInMaps(use, NewMI);
1259 (*LI)->removeValNo(CurrVN);
1261 DefMI->eraseFromParent();
1262 use->eraseFromParent();
1263 VNUseCount[CurrVN].erase(use);
1265 // Remove deleted instructions. Note that we need to remove them from
1266 // the VNInfo->use map as well, just to be safe.
1267 for (SmallPtrSet<MachineInstr*, 4>::iterator II =
1268 VNUseCount[CurrVN].begin(), IE = VNUseCount[CurrVN].end();
1270 for (DenseMap<VNInfo*, SmallPtrSet<MachineInstr*, 4> >::iterator
1271 VNI = VNUseCount.begin(), VNE = VNUseCount.end(); VNI != VNE;
1273 if (VNI->first != CurrVN)
1274 VNI->second.erase(*II);
1275 LIs->RemoveMachineInstrFromMaps(*II);
1276 (*II)->eraseFromParent();
1279 VNUseCount.erase(CurrVN);
1281 for (DenseMap<VNInfo*, SmallPtrSet<MachineInstr*, 4> >::iterator
1282 VI = VNUseCount.begin(), VE = VNUseCount.end(); VI != VE; ++VI)
1283 if (VI->second.erase(use))
1284 VI->second.insert(NewMI);
1291 // If there's more than one non-store instruction, we can't profitably
1292 // fold it, so bail.
1293 if (NonSpillCount) continue;
1295 // Otherwise, this is a load-store case, so DCE them.
1296 for (SmallPtrSet<MachineInstr*, 4>::iterator UI =
1297 VNUseCount[CurrVN].begin(), UE = VNUseCount[CurrVN].end();
1299 LIs->RemoveMachineInstrFromMaps(*UI);
1300 (*UI)->eraseFromParent();
1303 VNUseCount.erase(CurrVN);
1305 LIs->RemoveMachineInstrFromMaps(DefMI);
1306 (*LI)->removeValNo(CurrVN);
1307 DefMI->eraseFromParent();
1316 bool PreAllocSplitting::createsNewJoin(LiveRange* LR,
1317 MachineBasicBlock* DefMBB,
1318 MachineBasicBlock* BarrierMBB) {
1319 if (DefMBB == BarrierMBB)
1322 if (LR->valno->hasPHIKill())
1325 SlotIndex MBBEnd = LIs->getMBBEndIdx(BarrierMBB);
1326 if (LR->end < MBBEnd)
1329 MachineLoopInfo& MLI = getAnalysis<MachineLoopInfo>();
1330 if (MLI.getLoopFor(DefMBB) != MLI.getLoopFor(BarrierMBB))
1333 MachineDominatorTree& MDT = getAnalysis<MachineDominatorTree>();
1334 SmallPtrSet<MachineBasicBlock*, 4> Visited;
1335 typedef std::pair<MachineBasicBlock*,
1336 MachineBasicBlock::succ_iterator> ItPair;
1337 SmallVector<ItPair, 4> Stack;
1338 Stack.push_back(std::make_pair(BarrierMBB, BarrierMBB->succ_begin()));
1340 while (!Stack.empty()) {
1341 ItPair P = Stack.back();
1344 MachineBasicBlock* PredMBB = P.first;
1345 MachineBasicBlock::succ_iterator S = P.second;
1347 if (S == PredMBB->succ_end())
1349 else if (Visited.count(*S)) {
1350 Stack.push_back(std::make_pair(PredMBB, ++S));
1353 Stack.push_back(std::make_pair(PredMBB, S+1));
1355 MachineBasicBlock* MBB = *S;
1356 Visited.insert(MBB);
1358 if (MBB == BarrierMBB)
1361 MachineDomTreeNode* DefMDTN = MDT.getNode(DefMBB);
1362 MachineDomTreeNode* BarrierMDTN = MDT.getNode(BarrierMBB);
1363 MachineDomTreeNode* MDTN = MDT.getNode(MBB)->getIDom();
1365 if (MDTN == DefMDTN)
1367 else if (MDTN == BarrierMDTN)
1369 MDTN = MDTN->getIDom();
1372 MBBEnd = LIs->getMBBEndIdx(MBB);
1373 if (LR->end > MBBEnd)
1374 Stack.push_back(std::make_pair(MBB, MBB->succ_begin()));
1381 bool PreAllocSplitting::runOnMachineFunction(MachineFunction &MF) {
1383 TM = &MF.getTarget();
1384 TRI = TM->getRegisterInfo();
1385 TII = TM->getInstrInfo();
1386 MFI = MF.getFrameInfo();
1387 MRI = &MF.getRegInfo();
1388 SIs = &getAnalysis<SlotIndexes>();
1389 LIs = &getAnalysis<LiveIntervals>();
1390 LSs = &getAnalysis<LiveStacks>();
1391 VRM = &getAnalysis<VirtRegMap>();
1393 bool MadeChange = false;
1395 // Make sure blocks are numbered in order.
1396 MF.RenumberBlocks();
1398 MachineBasicBlock *Entry = MF.begin();
1399 SmallPtrSet<MachineBasicBlock*,16> Visited;
1401 SmallPtrSet<LiveInterval*, 8> Split;
1403 for (df_ext_iterator<MachineBasicBlock*, SmallPtrSet<MachineBasicBlock*,16> >
1404 DFI = df_ext_begin(Entry, Visited), E = df_ext_end(Entry, Visited);
1407 for (MachineBasicBlock::iterator I = BarrierMBB->begin(),
1408 E = BarrierMBB->end(); I != E; ++I) {
1410 const TargetRegisterClass **BarrierRCs =
1411 Barrier->getDesc().getRegClassBarriers();
1414 BarrierIdx = LIs->getInstructionIndex(Barrier);
1415 MadeChange |= SplitRegLiveIntervals(BarrierRCs, Split);
1419 MadeChange |= removeDeadSpills(Split);