1 //===-- SimpleRegisterCoalescing.cpp - Register Coalescing ----------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements a simple register coalescing pass that attempts to
11 // aggressively coalesce every register copy that it can.
13 //===----------------------------------------------------------------------===//
15 #define DEBUG_TYPE "regcoalescing"
16 #include "SimpleRegisterCoalescing.h"
17 #include "VirtRegMap.h"
18 #include "llvm/CodeGen/LiveIntervalAnalysis.h"
19 #include "llvm/Value.h"
20 #include "llvm/CodeGen/MachineFrameInfo.h"
21 #include "llvm/CodeGen/MachineInstr.h"
22 #include "llvm/CodeGen/MachineLoopInfo.h"
23 #include "llvm/CodeGen/MachineRegisterInfo.h"
24 #include "llvm/CodeGen/Passes.h"
25 #include "llvm/CodeGen/RegisterCoalescer.h"
26 #include "llvm/Target/TargetInstrInfo.h"
27 #include "llvm/Target/TargetMachine.h"
28 #include "llvm/Target/TargetOptions.h"
29 #include "llvm/Support/CommandLine.h"
30 #include "llvm/Support/Debug.h"
31 #include "llvm/ADT/SmallSet.h"
32 #include "llvm/ADT/Statistic.h"
33 #include "llvm/ADT/STLExtras.h"
38 STATISTIC(numJoins , "Number of interval joins performed");
39 STATISTIC(numCrossRCs , "Number of cross class joins performed");
40 STATISTIC(numCommutes , "Number of instruction commuting performed");
41 STATISTIC(numExtends , "Number of copies extended");
42 STATISTIC(NumReMats , "Number of instructions re-materialized");
43 STATISTIC(numPeep , "Number of identity moves eliminated after coalescing");
44 STATISTIC(numAborts , "Number of times interval joining aborted");
45 STATISTIC(numDeadValNo, "Number of valno def marked dead");
47 char SimpleRegisterCoalescing::ID = 0;
49 EnableJoining("join-liveintervals",
50 cl::desc("Coalesce copies (default=true)"),
54 NewHeuristic("new-coalescer-heuristic",
55 cl::desc("Use new coalescer heuristic"),
56 cl::init(false), cl::Hidden);
59 CrossClassJoin("join-cross-class-copies",
60 cl::desc("Coalesce cross register class copies"),
61 cl::init(false), cl::Hidden);
64 PhysJoinTweak("tweak-phys-join-heuristics",
65 cl::desc("Tweak heuristics for joining phys reg with vr"),
66 cl::init(false), cl::Hidden);
68 static RegisterPass<SimpleRegisterCoalescing>
69 X("simple-register-coalescing", "Simple Register Coalescing");
71 // Declare that we implement the RegisterCoalescer interface
72 static RegisterAnalysisGroup<RegisterCoalescer, true/*The Default*/> V(X);
74 const PassInfo *const llvm::SimpleRegisterCoalescingID = &X;
76 void SimpleRegisterCoalescing::getAnalysisUsage(AnalysisUsage &AU) const {
77 AU.addRequired<LiveIntervals>();
78 AU.addPreserved<LiveIntervals>();
79 AU.addRequired<MachineLoopInfo>();
80 AU.addPreserved<MachineLoopInfo>();
81 AU.addPreservedID(MachineDominatorsID);
83 AU.addPreservedID(StrongPHIEliminationID);
85 AU.addPreservedID(PHIEliminationID);
86 AU.addPreservedID(TwoAddressInstructionPassID);
87 MachineFunctionPass::getAnalysisUsage(AU);
90 /// AdjustCopiesBackFrom - We found a non-trivially-coalescable copy with IntA
91 /// being the source and IntB being the dest, thus this defines a value number
92 /// in IntB. If the source value number (in IntA) is defined by a copy from B,
93 /// see if we can merge these two pieces of B into a single value number,
94 /// eliminating a copy. For example:
98 /// B1 = A3 <- this copy
100 /// In this case, B0 can be extended to where the B1 copy lives, allowing the B1
101 /// value number to be replaced with B0 (which simplifies the B liveinterval).
103 /// This returns true if an interval was modified.
105 bool SimpleRegisterCoalescing::AdjustCopiesBackFrom(LiveInterval &IntA,
107 MachineInstr *CopyMI) {
108 unsigned CopyIdx = li_->getDefIndex(li_->getInstructionIndex(CopyMI));
110 // BValNo is a value number in B that is defined by a copy from A. 'B3' in
111 // the example above.
112 LiveInterval::iterator BLR = IntB.FindLiveRangeContaining(CopyIdx);
113 assert(BLR != IntB.end() && "Live range not found!");
114 VNInfo *BValNo = BLR->valno;
116 // Get the location that B is defined at. Two options: either this value has
117 // an unknown definition point or it is defined at CopyIdx. If unknown, we
119 if (!BValNo->copy) return false;
120 assert(BValNo->def == CopyIdx && "Copy doesn't define the value?");
122 // AValNo is the value number in A that defines the copy, A3 in the example.
123 LiveInterval::iterator ALR = IntA.FindLiveRangeContaining(CopyIdx-1);
124 assert(ALR != IntA.end() && "Live range not found!");
125 VNInfo *AValNo = ALR->valno;
126 // If it's re-defined by an early clobber somewhere in the live range, then
127 // it's not safe to eliminate the copy. FIXME: This is a temporary workaround.
129 // 172 %ECX<def> = MOV32rr %reg1039<kill>
130 // 180 INLINEASM <es:subl $5,$1
131 // sbbl $3,$0>, 10, %EAX<def>, 14, %ECX<earlyclobber,def>, 9, %EAX<kill>,
132 // 36, <fi#0>, 1, %reg0, 0, 9, %ECX<kill>, 36, <fi#1>, 1, %reg0, 0
133 // 188 %EAX<def> = MOV32rr %EAX<kill>
134 // 196 %ECX<def> = MOV32rr %ECX<kill>
135 // 204 %ECX<def> = MOV32rr %ECX<kill>
136 // 212 %EAX<def> = MOV32rr %EAX<kill>
137 // 220 %EAX<def> = MOV32rr %EAX
138 // 228 %reg1039<def> = MOV32rr %ECX<kill>
139 // The early clobber operand ties ECX input to the ECX def.
141 // The live interval of ECX is represented as this:
142 // %reg20,inf = [46,47:1)[174,230:0) 0@174-(230) 1@46-(47)
143 // The coalescer has no idea there was a def in the middle of [174,230].
144 if (AValNo->redefByEC)
147 // If AValNo is defined as a copy from IntB, we can potentially process this.
148 // Get the instruction that defines this value number.
149 unsigned SrcReg = li_->getVNInfoSourceReg(AValNo);
150 if (!SrcReg) return false; // Not defined by a copy.
152 // If the value number is not defined by a copy instruction, ignore it.
154 // If the source register comes from an interval other than IntB, we can't
156 if (SrcReg != IntB.reg) return false;
158 // Get the LiveRange in IntB that this value number starts with.
159 LiveInterval::iterator ValLR = IntB.FindLiveRangeContaining(AValNo->def-1);
160 assert(ValLR != IntB.end() && "Live range not found!");
162 // Make sure that the end of the live range is inside the same block as
164 MachineInstr *ValLREndInst = li_->getInstructionFromIndex(ValLR->end-1);
166 ValLREndInst->getParent() != CopyMI->getParent()) return false;
168 // Okay, we now know that ValLR ends in the same block that the CopyMI
169 // live-range starts. If there are no intervening live ranges between them in
170 // IntB, we can merge them.
171 if (ValLR+1 != BLR) return false;
173 // If a live interval is a physical register, conservatively check if any
174 // of its sub-registers is overlapping the live interval of the virtual
175 // register. If so, do not coalesce.
176 if (TargetRegisterInfo::isPhysicalRegister(IntB.reg) &&
177 *tri_->getSubRegisters(IntB.reg)) {
178 for (const unsigned* SR = tri_->getSubRegisters(IntB.reg); *SR; ++SR)
179 if (li_->hasInterval(*SR) && IntA.overlaps(li_->getInterval(*SR))) {
180 DOUT << "Interfere with sub-register ";
181 DEBUG(li_->getInterval(*SR).print(DOUT, tri_));
186 DOUT << "\nExtending: "; IntB.print(DOUT, tri_);
188 unsigned FillerStart = ValLR->end, FillerEnd = BLR->start;
189 // We are about to delete CopyMI, so need to remove it as the 'instruction
190 // that defines this value #'. Update the the valnum with the new defining
192 BValNo->def = FillerStart;
195 // Okay, we can merge them. We need to insert a new liverange:
196 // [ValLR.end, BLR.begin) of either value number, then we merge the
197 // two value numbers.
198 IntB.addRange(LiveRange(FillerStart, FillerEnd, BValNo));
200 // If the IntB live range is assigned to a physical register, and if that
201 // physreg has sub-registers, update their live intervals as well.
202 if (TargetRegisterInfo::isPhysicalRegister(IntB.reg)) {
203 for (const unsigned *SR = tri_->getSubRegisters(IntB.reg); *SR; ++SR) {
204 LiveInterval &SRLI = li_->getInterval(*SR);
205 SRLI.addRange(LiveRange(FillerStart, FillerEnd,
206 SRLI.getNextValue(FillerStart, 0, li_->getVNInfoAllocator())));
210 // Okay, merge "B1" into the same value number as "B0".
211 if (BValNo != ValLR->valno) {
212 IntB.addKills(ValLR->valno, BValNo->kills);
213 IntB.MergeValueNumberInto(BValNo, ValLR->valno);
215 DOUT << " result = "; IntB.print(DOUT, tri_);
218 // If the source instruction was killing the source register before the
219 // merge, unset the isKill marker given the live range has been extended.
220 int UIdx = ValLREndInst->findRegisterUseOperandIdx(IntB.reg, true);
222 ValLREndInst->getOperand(UIdx).setIsKill(false);
223 IntB.removeKill(ValLR->valno, FillerStart);
230 /// HasOtherReachingDefs - Return true if there are definitions of IntB
231 /// other than BValNo val# that can reach uses of AValno val# of IntA.
232 bool SimpleRegisterCoalescing::HasOtherReachingDefs(LiveInterval &IntA,
236 for (LiveInterval::iterator AI = IntA.begin(), AE = IntA.end();
238 if (AI->valno != AValNo) continue;
239 LiveInterval::Ranges::iterator BI =
240 std::upper_bound(IntB.ranges.begin(), IntB.ranges.end(), AI->start);
241 if (BI != IntB.ranges.begin())
243 for (; BI != IntB.ranges.end() && AI->end >= BI->start; ++BI) {
244 if (BI->valno == BValNo)
246 if (BI->start <= AI->start && BI->end > AI->start)
248 if (BI->start > AI->start && BI->start < AI->end)
255 /// RemoveCopyByCommutingDef - We found a non-trivially-coalescable copy with IntA
256 /// being the source and IntB being the dest, thus this defines a value number
257 /// in IntB. If the source value number (in IntA) is defined by a commutable
258 /// instruction and its other operand is coalesced to the copy dest register,
259 /// see if we can transform the copy into a noop by commuting the definition. For
262 /// A3 = op A2 B0<kill>
264 /// B1 = A3 <- this copy
266 /// = op A3 <- more uses
270 /// B2 = op B0 A2<kill>
272 /// B1 = B2 <- now an identify copy
274 /// = op B2 <- more uses
276 /// This returns true if an interval was modified.
278 bool SimpleRegisterCoalescing::RemoveCopyByCommutingDef(LiveInterval &IntA,
280 MachineInstr *CopyMI) {
281 unsigned CopyIdx = li_->getDefIndex(li_->getInstructionIndex(CopyMI));
283 // FIXME: For now, only eliminate the copy by commuting its def when the
284 // source register is a virtual register. We want to guard against cases
285 // where the copy is a back edge copy and commuting the def lengthen the
286 // live interval of the source register to the entire loop.
287 if (TargetRegisterInfo::isPhysicalRegister(IntA.reg))
290 // BValNo is a value number in B that is defined by a copy from A. 'B3' in
291 // the example above.
292 LiveInterval::iterator BLR = IntB.FindLiveRangeContaining(CopyIdx);
293 assert(BLR != IntB.end() && "Live range not found!");
294 VNInfo *BValNo = BLR->valno;
296 // Get the location that B is defined at. Two options: either this value has
297 // an unknown definition point or it is defined at CopyIdx. If unknown, we
299 if (!BValNo->copy) return false;
300 assert(BValNo->def == CopyIdx && "Copy doesn't define the value?");
302 // AValNo is the value number in A that defines the copy, A3 in the example.
303 LiveInterval::iterator ALR = IntA.FindLiveRangeContaining(CopyIdx-1);
304 assert(ALR != IntA.end() && "Live range not found!");
305 VNInfo *AValNo = ALR->valno;
306 // If other defs can reach uses of this def, then it's not safe to perform
308 if (AValNo->def == ~0U || AValNo->def == ~1U || AValNo->hasPHIKill)
310 MachineInstr *DefMI = li_->getInstructionFromIndex(AValNo->def);
311 const TargetInstrDesc &TID = DefMI->getDesc();
313 if (!TID.isCommutable() ||
314 !tii_->CommuteChangesDestination(DefMI, NewDstIdx))
317 MachineOperand &NewDstMO = DefMI->getOperand(NewDstIdx);
318 unsigned NewReg = NewDstMO.getReg();
319 if (NewReg != IntB.reg || !NewDstMO.isKill())
322 // Make sure there are no other definitions of IntB that would reach the
323 // uses which the new definition can reach.
324 if (HasOtherReachingDefs(IntA, IntB, AValNo, BValNo))
327 // If some of the uses of IntA.reg is already coalesced away, return false.
328 // It's not possible to determine whether it's safe to perform the coalescing.
329 for (MachineRegisterInfo::use_iterator UI = mri_->use_begin(IntA.reg),
330 UE = mri_->use_end(); UI != UE; ++UI) {
331 MachineInstr *UseMI = &*UI;
332 unsigned UseIdx = li_->getInstructionIndex(UseMI);
333 LiveInterval::iterator ULR = IntA.FindLiveRangeContaining(UseIdx);
334 if (ULR == IntA.end())
336 if (ULR->valno == AValNo && JoinedCopies.count(UseMI))
340 // At this point we have decided that it is legal to do this
341 // transformation. Start by commuting the instruction.
342 MachineBasicBlock *MBB = DefMI->getParent();
343 MachineInstr *NewMI = tii_->commuteInstruction(DefMI);
346 if (NewMI != DefMI) {
347 li_->ReplaceMachineInstrInMaps(DefMI, NewMI);
348 MBB->insert(DefMI, NewMI);
351 unsigned OpIdx = NewMI->findRegisterUseOperandIdx(IntA.reg, false);
352 NewMI->getOperand(OpIdx).setIsKill();
354 bool BHasPHIKill = BValNo->hasPHIKill;
355 SmallVector<VNInfo*, 4> BDeadValNos;
356 SmallVector<unsigned, 4> BKills;
357 std::map<unsigned, unsigned> BExtend;
359 // If ALR and BLR overlaps and end of BLR extends beyond end of ALR, e.g.
368 // then do not add kills of A to the newly created B interval.
369 bool Extended = BLR->end > ALR->end && ALR->end != ALR->start;
371 BExtend[ALR->end] = BLR->end;
373 // Update uses of IntA of the specific Val# with IntB.
374 bool BHasSubRegs = false;
375 if (TargetRegisterInfo::isPhysicalRegister(IntB.reg))
376 BHasSubRegs = *tri_->getSubRegisters(IntB.reg);
377 for (MachineRegisterInfo::use_iterator UI = mri_->use_begin(IntA.reg),
378 UE = mri_->use_end(); UI != UE;) {
379 MachineOperand &UseMO = UI.getOperand();
380 MachineInstr *UseMI = &*UI;
382 if (JoinedCopies.count(UseMI))
384 unsigned UseIdx = li_->getInstructionIndex(UseMI);
385 LiveInterval::iterator ULR = IntA.FindLiveRangeContaining(UseIdx);
386 if (ULR == IntA.end() || ULR->valno != AValNo)
388 UseMO.setReg(NewReg);
391 if (UseMO.isKill()) {
393 UseMO.setIsKill(false);
395 BKills.push_back(li_->getUseIndex(UseIdx)+1);
397 unsigned SrcReg, DstReg, SrcSubIdx, DstSubIdx;
398 if (!tii_->isMoveInstr(*UseMI, SrcReg, DstReg, SrcSubIdx, DstSubIdx))
400 if (DstReg == IntB.reg) {
401 // This copy will become a noop. If it's defining a new val#,
402 // remove that val# as well. However this live range is being
403 // extended to the end of the existing live range defined by the copy.
404 unsigned DefIdx = li_->getDefIndex(UseIdx);
405 const LiveRange *DLR = IntB.getLiveRangeContaining(DefIdx);
406 BHasPHIKill |= DLR->valno->hasPHIKill;
407 assert(DLR->valno->def == DefIdx);
408 BDeadValNos.push_back(DLR->valno);
409 BExtend[DLR->start] = DLR->end;
410 JoinedCopies.insert(UseMI);
411 // If this is a kill but it's going to be removed, the last use
412 // of the same val# is the new kill.
418 // We need to insert a new liverange: [ALR.start, LastUse). It may be we can
419 // simply extend BLR if CopyMI doesn't end the range.
420 DOUT << "\nExtending: "; IntB.print(DOUT, tri_);
422 // Remove val#'s defined by copies that will be coalesced away.
423 for (unsigned i = 0, e = BDeadValNos.size(); i != e; ++i) {
424 VNInfo *DeadVNI = BDeadValNos[i];
426 for (const unsigned *SR = tri_->getSubRegisters(IntB.reg); *SR; ++SR) {
427 LiveInterval &SRLI = li_->getInterval(*SR);
428 const LiveRange *SRLR = SRLI.getLiveRangeContaining(DeadVNI->def);
429 SRLI.removeValNo(SRLR->valno);
432 IntB.removeValNo(BDeadValNos[i]);
435 // Extend BValNo by merging in IntA live ranges of AValNo. Val# definition
436 // is updated. Kills are also updated.
437 VNInfo *ValNo = BValNo;
438 ValNo->def = AValNo->def;
440 for (unsigned j = 0, ee = ValNo->kills.size(); j != ee; ++j) {
441 unsigned Kill = ValNo->kills[j];
442 if (Kill != BLR->end)
443 BKills.push_back(Kill);
445 ValNo->kills.clear();
446 for (LiveInterval::iterator AI = IntA.begin(), AE = IntA.end();
448 if (AI->valno != AValNo) continue;
449 unsigned End = AI->end;
450 std::map<unsigned, unsigned>::iterator EI = BExtend.find(End);
451 if (EI != BExtend.end())
453 IntB.addRange(LiveRange(AI->start, End, ValNo));
455 // If the IntB live range is assigned to a physical register, and if that
456 // physreg has sub-registers, update their live intervals as well.
458 for (const unsigned *SR = tri_->getSubRegisters(IntB.reg); *SR; ++SR) {
459 LiveInterval &SRLI = li_->getInterval(*SR);
460 SRLI.MergeInClobberRange(AI->start, End, li_->getVNInfoAllocator());
464 IntB.addKills(ValNo, BKills);
465 ValNo->hasPHIKill = BHasPHIKill;
467 DOUT << " result = "; IntB.print(DOUT, tri_);
470 DOUT << "\nShortening: "; IntA.print(DOUT, tri_);
471 IntA.removeValNo(AValNo);
472 DOUT << " result = "; IntA.print(DOUT, tri_);
479 /// isSameOrFallThroughBB - Return true if MBB == SuccMBB or MBB simply
480 /// fallthoughs to SuccMBB.
481 static bool isSameOrFallThroughBB(MachineBasicBlock *MBB,
482 MachineBasicBlock *SuccMBB,
483 const TargetInstrInfo *tii_) {
486 MachineBasicBlock *TBB = 0, *FBB = 0;
487 SmallVector<MachineOperand, 4> Cond;
488 return !tii_->AnalyzeBranch(*MBB, TBB, FBB, Cond) && !TBB && !FBB &&
489 MBB->isSuccessor(SuccMBB);
492 /// removeRange - Wrapper for LiveInterval::removeRange. This removes a range
493 /// from a physical register live interval as well as from the live intervals
494 /// of its sub-registers.
495 static void removeRange(LiveInterval &li, unsigned Start, unsigned End,
496 LiveIntervals *li_, const TargetRegisterInfo *tri_) {
497 li.removeRange(Start, End, true);
498 if (TargetRegisterInfo::isPhysicalRegister(li.reg)) {
499 for (const unsigned* SR = tri_->getSubRegisters(li.reg); *SR; ++SR) {
500 if (!li_->hasInterval(*SR))
502 LiveInterval &sli = li_->getInterval(*SR);
503 unsigned RemoveEnd = Start;
504 while (RemoveEnd != End) {
505 LiveInterval::iterator LR = sli.FindLiveRangeContaining(Start);
508 RemoveEnd = (LR->end < End) ? LR->end : End;
509 sli.removeRange(Start, RemoveEnd, true);
516 /// TrimLiveIntervalToLastUse - If there is a last use in the same basic block
517 /// as the copy instruction, trim the live interval to the last use and return
520 SimpleRegisterCoalescing::TrimLiveIntervalToLastUse(unsigned CopyIdx,
521 MachineBasicBlock *CopyMBB,
523 const LiveRange *LR) {
524 unsigned MBBStart = li_->getMBBStartIdx(CopyMBB);
526 MachineOperand *LastUse = lastRegisterUse(LR->start, CopyIdx-1, li.reg,
529 MachineInstr *LastUseMI = LastUse->getParent();
530 if (!isSameOrFallThroughBB(LastUseMI->getParent(), CopyMBB, tii_)) {
537 // r1025<dead> = r1024<kill>
538 if (MBBStart < LR->end)
539 removeRange(li, MBBStart, LR->end, li_, tri_);
543 // There are uses before the copy, just shorten the live range to the end
545 LastUse->setIsKill();
546 removeRange(li, li_->getDefIndex(LastUseIdx), LR->end, li_, tri_);
547 li.addKill(LR->valno, LastUseIdx+1);
548 unsigned SrcReg, DstReg, SrcSubIdx, DstSubIdx;
549 if (tii_->isMoveInstr(*LastUseMI, SrcReg, DstReg, SrcSubIdx, DstSubIdx) &&
551 // Last use is itself an identity code.
552 int DeadIdx = LastUseMI->findRegisterDefOperandIdx(li.reg, false, tri_);
553 LastUseMI->getOperand(DeadIdx).setIsDead();
559 if (LR->start <= MBBStart && LR->end > MBBStart) {
560 if (LR->start == 0) {
561 assert(TargetRegisterInfo::isPhysicalRegister(li.reg));
562 // Live-in to the function but dead. Remove it from entry live-in set.
563 mf_->begin()->removeLiveIn(li.reg);
565 // FIXME: Shorten intervals in BBs that reaches this BB.
571 /// ReMaterializeTrivialDef - If the source of a copy is defined by a trivial
572 /// computation, replace the copy by rematerialize the definition.
573 bool SimpleRegisterCoalescing::ReMaterializeTrivialDef(LiveInterval &SrcInt,
575 MachineInstr *CopyMI) {
576 unsigned CopyIdx = li_->getUseIndex(li_->getInstructionIndex(CopyMI));
577 LiveInterval::iterator SrcLR = SrcInt.FindLiveRangeContaining(CopyIdx);
578 assert(SrcLR != SrcInt.end() && "Live range not found!");
579 VNInfo *ValNo = SrcLR->valno;
580 // If other defs can reach uses of this def, then it's not safe to perform
582 if (ValNo->def == ~0U || ValNo->def == ~1U || ValNo->hasPHIKill)
584 MachineInstr *DefMI = li_->getInstructionFromIndex(ValNo->def);
585 const TargetInstrDesc &TID = DefMI->getDesc();
586 if (!TID.isAsCheapAsAMove())
588 if (!DefMI->getDesc().isRematerializable() ||
589 !tii_->isTriviallyReMaterializable(DefMI))
591 bool SawStore = false;
592 if (!DefMI->isSafeToMove(tii_, SawStore))
595 unsigned DefIdx = li_->getDefIndex(CopyIdx);
596 const LiveRange *DLR= li_->getInterval(DstReg).getLiveRangeContaining(DefIdx);
597 DLR->valno->copy = NULL;
598 // Don't forget to update sub-register intervals.
599 if (TargetRegisterInfo::isPhysicalRegister(DstReg)) {
600 for (const unsigned* SR = tri_->getSubRegisters(DstReg); *SR; ++SR) {
601 if (!li_->hasInterval(*SR))
603 DLR = li_->getInterval(*SR).getLiveRangeContaining(DefIdx);
604 if (DLR && DLR->valno->copy == CopyMI)
605 DLR->valno->copy = NULL;
609 // If copy kills the source register, find the last use and propagate
611 bool checkForDeadDef = false;
612 MachineBasicBlock *MBB = CopyMI->getParent();
613 if (CopyMI->killsRegister(SrcInt.reg))
614 if (!TrimLiveIntervalToLastUse(CopyIdx, MBB, SrcInt, SrcLR)) {
615 checkForDeadDef = true;
618 MachineBasicBlock::iterator MII = next(MachineBasicBlock::iterator(CopyMI));
619 CopyMI->removeFromParent();
620 tii_->reMaterialize(*MBB, MII, DstReg, DefMI);
621 MachineInstr *NewMI = prior(MII);
623 if (checkForDeadDef) {
624 // PR4090 fix: Trim interval failed because there was no use of the
625 // source interval in this MBB. If the def is in this MBB too then we
626 // should mark it dead:
627 if (DefMI->getParent() == MBB) {
628 DefMI->addRegisterDead(SrcInt.reg, tri_);
629 SrcLR->end = SrcLR->start + 1;
634 // CopyMI may have implicit operands, transfer them over to the newly
635 // rematerialized instruction. And update implicit def interval valnos.
636 for (unsigned i = CopyMI->getDesc().getNumOperands(),
637 e = CopyMI->getNumOperands(); i != e; ++i) {
638 MachineOperand &MO = CopyMI->getOperand(i);
639 if (MO.isReg() && MO.isImplicit())
640 NewMI->addOperand(MO);
641 if (MO.isDef() && li_->hasInterval(MO.getReg())) {
642 unsigned Reg = MO.getReg();
643 DLR = li_->getInterval(Reg).getLiveRangeContaining(DefIdx);
644 if (DLR && DLR->valno->copy == CopyMI)
645 DLR->valno->copy = NULL;
649 li_->ReplaceMachineInstrInMaps(CopyMI, NewMI);
650 MBB->getParent()->DeleteMachineInstr(CopyMI);
651 ReMatCopies.insert(CopyMI);
652 ReMatDefs.insert(DefMI);
657 /// isBackEdgeCopy - Returns true if CopyMI is a back edge copy.
659 bool SimpleRegisterCoalescing::isBackEdgeCopy(MachineInstr *CopyMI,
660 unsigned DstReg) const {
661 MachineBasicBlock *MBB = CopyMI->getParent();
662 const MachineLoop *L = loopInfo->getLoopFor(MBB);
665 if (MBB != L->getLoopLatch())
668 LiveInterval &LI = li_->getInterval(DstReg);
669 unsigned DefIdx = li_->getInstructionIndex(CopyMI);
670 LiveInterval::const_iterator DstLR =
671 LI.FindLiveRangeContaining(li_->getDefIndex(DefIdx));
672 if (DstLR == LI.end())
674 unsigned KillIdx = li_->getMBBEndIdx(MBB) + 1;
675 if (DstLR->valno->kills.size() == 1 &&
676 DstLR->valno->kills[0] == KillIdx && DstLR->valno->hasPHIKill)
681 /// UpdateRegDefsUses - Replace all defs and uses of SrcReg to DstReg and
682 /// update the subregister number if it is not zero. If DstReg is a
683 /// physical register and the existing subregister number of the def / use
684 /// being updated is not zero, make sure to set it to the correct physical
687 SimpleRegisterCoalescing::UpdateRegDefsUses(unsigned SrcReg, unsigned DstReg,
689 bool DstIsPhys = TargetRegisterInfo::isPhysicalRegister(DstReg);
690 if (DstIsPhys && SubIdx) {
691 // Figure out the real physical register we are updating with.
692 DstReg = tri_->getSubReg(DstReg, SubIdx);
696 for (MachineRegisterInfo::reg_iterator I = mri_->reg_begin(SrcReg),
697 E = mri_->reg_end(); I != E; ) {
698 MachineOperand &O = I.getOperand();
699 MachineInstr *UseMI = &*I;
701 unsigned OldSubIdx = O.getSubReg();
703 unsigned UseDstReg = DstReg;
705 UseDstReg = tri_->getSubReg(DstReg, OldSubIdx);
707 unsigned CopySrcReg, CopyDstReg, CopySrcSubIdx, CopyDstSubIdx;
708 if (tii_->isMoveInstr(*UseMI, CopySrcReg, CopyDstReg,
709 CopySrcSubIdx, CopyDstSubIdx) &&
710 CopySrcReg != CopyDstReg &&
711 CopySrcReg == SrcReg && CopyDstReg != UseDstReg) {
712 // If the use is a copy and it won't be coalesced away, and its source
713 // is defined by a trivial computation, try to rematerialize it instead.
714 if (ReMaterializeTrivialDef(li_->getInterval(SrcReg), CopyDstReg,UseMI))
723 // Sub-register indexes goes from small to large. e.g.
724 // RAX: 1 -> AL, 2 -> AX, 3 -> EAX
725 // EAX: 1 -> AL, 2 -> AX
726 // So RAX's sub-register 2 is AX, RAX's sub-regsiter 3 is EAX, whose
727 // sub-register 2 is also AX.
728 if (SubIdx && OldSubIdx && SubIdx != OldSubIdx)
729 assert(OldSubIdx < SubIdx && "Conflicting sub-register index!");
732 // Remove would-be duplicated kill marker.
733 if (O.isKill() && UseMI->killsRegister(DstReg))
737 // After updating the operand, check if the machine instruction has
738 // become a copy. If so, update its val# information.
739 const TargetInstrDesc &TID = UseMI->getDesc();
740 unsigned CopySrcReg, CopyDstReg, CopySrcSubIdx, CopyDstSubIdx;
741 if (TID.getNumDefs() == 1 && TID.getNumOperands() > 2 &&
742 tii_->isMoveInstr(*UseMI, CopySrcReg, CopyDstReg,
743 CopySrcSubIdx, CopyDstSubIdx) &&
744 CopySrcReg != CopyDstReg &&
745 (TargetRegisterInfo::isVirtualRegister(CopyDstReg) ||
746 allocatableRegs_[CopyDstReg])) {
747 LiveInterval &LI = li_->getInterval(CopyDstReg);
748 unsigned DefIdx = li_->getDefIndex(li_->getInstructionIndex(UseMI));
749 const LiveRange *DLR = LI.getLiveRangeContaining(DefIdx);
750 if (DLR->valno->def == DefIdx)
751 DLR->valno->copy = UseMI;
756 /// RemoveDeadImpDef - Remove implicit_def instructions which are "re-defining"
757 /// registers due to insert_subreg coalescing. e.g.
759 /// r1025 = implicit_def
760 /// r1025 = insert_subreg r1025, r1024
764 /// r1025 = implicit_def
765 /// r1025 = insert_subreg r1025, r1025
768 SimpleRegisterCoalescing::RemoveDeadImpDef(unsigned Reg, LiveInterval &LI) {
769 for (MachineRegisterInfo::reg_iterator I = mri_->reg_begin(Reg),
770 E = mri_->reg_end(); I != E; ) {
771 MachineOperand &O = I.getOperand();
772 MachineInstr *DefMI = &*I;
776 if (DefMI->getOpcode() != TargetInstrInfo::IMPLICIT_DEF)
778 if (!LI.liveBeforeAndAt(li_->getInstructionIndex(DefMI)))
780 li_->RemoveMachineInstrFromMaps(DefMI);
781 DefMI->eraseFromParent();
785 /// RemoveUnnecessaryKills - Remove kill markers that are no longer accurate
786 /// due to live range lengthening as the result of coalescing.
787 void SimpleRegisterCoalescing::RemoveUnnecessaryKills(unsigned Reg,
789 for (MachineRegisterInfo::use_iterator UI = mri_->use_begin(Reg),
790 UE = mri_->use_end(); UI != UE; ++UI) {
791 MachineOperand &UseMO = UI.getOperand();
792 if (UseMO.isKill()) {
793 MachineInstr *UseMI = UseMO.getParent();
794 unsigned UseIdx = li_->getUseIndex(li_->getInstructionIndex(UseMI));
795 const LiveRange *UI = LI.getLiveRangeContaining(UseIdx);
796 if (!UI || !LI.isKill(UI->valno, UseIdx+1))
797 UseMO.setIsKill(false);
802 /// removeIntervalIfEmpty - Check if the live interval of a physical register
803 /// is empty, if so remove it and also remove the empty intervals of its
804 /// sub-registers. Return true if live interval is removed.
805 static bool removeIntervalIfEmpty(LiveInterval &li, LiveIntervals *li_,
806 const TargetRegisterInfo *tri_) {
808 if (TargetRegisterInfo::isPhysicalRegister(li.reg))
809 for (const unsigned* SR = tri_->getSubRegisters(li.reg); *SR; ++SR) {
810 if (!li_->hasInterval(*SR))
812 LiveInterval &sli = li_->getInterval(*SR);
814 li_->removeInterval(*SR);
816 li_->removeInterval(li.reg);
822 /// ShortenDeadCopyLiveRange - Shorten a live range defined by a dead copy.
823 /// Return true if live interval is removed.
824 bool SimpleRegisterCoalescing::ShortenDeadCopyLiveRange(LiveInterval &li,
825 MachineInstr *CopyMI) {
826 unsigned CopyIdx = li_->getInstructionIndex(CopyMI);
827 LiveInterval::iterator MLR =
828 li.FindLiveRangeContaining(li_->getDefIndex(CopyIdx));
830 return false; // Already removed by ShortenDeadCopySrcLiveRange.
831 unsigned RemoveStart = MLR->start;
832 unsigned RemoveEnd = MLR->end;
833 // Remove the liverange that's defined by this.
834 if (RemoveEnd == li_->getDefIndex(CopyIdx)+1) {
835 removeRange(li, RemoveStart, RemoveEnd, li_, tri_);
836 return removeIntervalIfEmpty(li, li_, tri_);
841 /// RemoveDeadDef - If a def of a live interval is now determined dead, remove
842 /// the val# it defines. If the live interval becomes empty, remove it as well.
843 bool SimpleRegisterCoalescing::RemoveDeadDef(LiveInterval &li,
844 MachineInstr *DefMI) {
845 unsigned DefIdx = li_->getDefIndex(li_->getInstructionIndex(DefMI));
846 LiveInterval::iterator MLR = li.FindLiveRangeContaining(DefIdx);
847 if (DefIdx != MLR->valno->def)
849 li.removeValNo(MLR->valno);
850 return removeIntervalIfEmpty(li, li_, tri_);
853 /// PropagateDeadness - Propagate the dead marker to the instruction which
854 /// defines the val#.
855 static void PropagateDeadness(LiveInterval &li, MachineInstr *CopyMI,
856 unsigned &LRStart, LiveIntervals *li_,
857 const TargetRegisterInfo* tri_) {
858 MachineInstr *DefMI =
859 li_->getInstructionFromIndex(li_->getDefIndex(LRStart));
860 if (DefMI && DefMI != CopyMI) {
861 int DeadIdx = DefMI->findRegisterDefOperandIdx(li.reg, false, tri_);
863 DefMI->getOperand(DeadIdx).setIsDead();
864 // A dead def should have a single cycle interval.
870 /// ShortenDeadCopySrcLiveRange - Shorten a live range as it's artificially
871 /// extended by a dead copy. Mark the last use (if any) of the val# as kill as
872 /// ends the live range there. If there isn't another use, then this live range
873 /// is dead. Return true if live interval is removed.
875 SimpleRegisterCoalescing::ShortenDeadCopySrcLiveRange(LiveInterval &li,
876 MachineInstr *CopyMI) {
877 unsigned CopyIdx = li_->getInstructionIndex(CopyMI);
879 // FIXME: special case: function live in. It can be a general case if the
880 // first instruction index starts at > 0 value.
881 assert(TargetRegisterInfo::isPhysicalRegister(li.reg));
882 // Live-in to the function but dead. Remove it from entry live-in set.
883 if (mf_->begin()->isLiveIn(li.reg))
884 mf_->begin()->removeLiveIn(li.reg);
885 const LiveRange *LR = li.getLiveRangeContaining(CopyIdx);
886 removeRange(li, LR->start, LR->end, li_, tri_);
887 return removeIntervalIfEmpty(li, li_, tri_);
890 LiveInterval::iterator LR = li.FindLiveRangeContaining(CopyIdx-1);
892 // Livein but defined by a phi.
895 unsigned RemoveStart = LR->start;
896 unsigned RemoveEnd = li_->getDefIndex(CopyIdx)+1;
897 if (LR->end > RemoveEnd)
898 // More uses past this copy? Nothing to do.
901 // If there is a last use in the same bb, we can't remove the live range.
902 // Shorten the live interval and return.
903 MachineBasicBlock *CopyMBB = CopyMI->getParent();
904 if (TrimLiveIntervalToLastUse(CopyIdx, CopyMBB, li, LR))
907 MachineBasicBlock *StartMBB = li_->getMBBFromIndex(RemoveStart);
908 if (!isSameOrFallThroughBB(StartMBB, CopyMBB, tii_))
909 // If the live range starts in another mbb and the copy mbb is not a fall
910 // through mbb, then we can only cut the range from the beginning of the
912 RemoveStart = li_->getMBBStartIdx(CopyMBB) + 1;
914 if (LR->valno->def == RemoveStart) {
915 // If the def MI defines the val# and this copy is the only kill of the
916 // val#, then propagate the dead marker.
917 if (li.isOnlyLROfValNo(LR)) {
918 PropagateDeadness(li, CopyMI, RemoveStart, li_, tri_);
921 if (li.isKill(LR->valno, RemoveEnd))
922 li.removeKill(LR->valno, RemoveEnd);
925 removeRange(li, RemoveStart, RemoveEnd, li_, tri_);
926 return removeIntervalIfEmpty(li, li_, tri_);
929 /// CanCoalesceWithImpDef - Returns true if the specified copy instruction
930 /// from an implicit def to another register can be coalesced away.
931 bool SimpleRegisterCoalescing::CanCoalesceWithImpDef(MachineInstr *CopyMI,
933 LiveInterval &ImpLi) const{
934 if (!CopyMI->killsRegister(ImpLi.reg))
936 unsigned CopyIdx = li_->getDefIndex(li_->getInstructionIndex(CopyMI));
937 LiveInterval::iterator LR = li.FindLiveRangeContaining(CopyIdx);
940 if (LR->valno->hasPHIKill)
942 if (LR->valno->def != CopyIdx)
944 // Make sure all of val# uses are copies.
945 for (MachineRegisterInfo::use_iterator UI = mri_->use_begin(li.reg),
946 UE = mri_->use_end(); UI != UE;) {
947 MachineInstr *UseMI = &*UI;
949 if (JoinedCopies.count(UseMI))
951 unsigned UseIdx = li_->getUseIndex(li_->getInstructionIndex(UseMI));
952 LiveInterval::iterator ULR = li.FindLiveRangeContaining(UseIdx);
953 if (ULR == li.end() || ULR->valno != LR->valno)
955 // If the use is not a use, then it's not safe to coalesce the move.
956 unsigned SrcReg, DstReg, SrcSubIdx, DstSubIdx;
957 if (!tii_->isMoveInstr(*UseMI, SrcReg, DstReg, SrcSubIdx, DstSubIdx)) {
958 if (UseMI->getOpcode() == TargetInstrInfo::INSERT_SUBREG &&
959 UseMI->getOperand(1).getReg() == li.reg)
968 /// RemoveCopiesFromValNo - The specified value# is defined by an implicit
969 /// def and it is being removed. Turn all copies from this value# into
970 /// identity copies so they will be removed.
971 void SimpleRegisterCoalescing::RemoveCopiesFromValNo(LiveInterval &li,
973 SmallVector<MachineInstr*, 4> ImpDefs;
974 MachineOperand *LastUse = NULL;
975 unsigned LastUseIdx = li_->getUseIndex(VNI->def);
976 for (MachineRegisterInfo::reg_iterator RI = mri_->reg_begin(li.reg),
977 RE = mri_->reg_end(); RI != RE;) {
978 MachineOperand *MO = &RI.getOperand();
979 MachineInstr *MI = &*RI;
982 if (MI->getOpcode() == TargetInstrInfo::IMPLICIT_DEF) {
983 ImpDefs.push_back(MI);
987 if (JoinedCopies.count(MI))
989 unsigned UseIdx = li_->getUseIndex(li_->getInstructionIndex(MI));
990 LiveInterval::iterator ULR = li.FindLiveRangeContaining(UseIdx);
991 if (ULR == li.end() || ULR->valno != VNI)
993 // If the use is a copy, turn it into an identity copy.
994 unsigned SrcReg, DstReg, SrcSubIdx, DstSubIdx;
995 if (tii_->isMoveInstr(*MI, SrcReg, DstReg, SrcSubIdx, DstSubIdx) &&
997 // Each use MI may have multiple uses of this register. Change them all.
998 for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i) {
999 MachineOperand &MO = MI->getOperand(i);
1000 if (MO.isReg() && MO.getReg() == li.reg)
1003 JoinedCopies.insert(MI);
1004 } else if (UseIdx > LastUseIdx) {
1005 LastUseIdx = UseIdx;
1010 LastUse->setIsKill();
1011 li.addKill(VNI, LastUseIdx+1);
1013 // Remove dead implicit_def's.
1014 while (!ImpDefs.empty()) {
1015 MachineInstr *ImpDef = ImpDefs.back();
1017 li_->RemoveMachineInstrFromMaps(ImpDef);
1018 ImpDef->eraseFromParent();
1023 /// isWinToJoinVRWithSrcPhysReg - Return true if it's worth while to join a
1024 /// a virtual destination register with physical source register.
1026 SimpleRegisterCoalescing::isWinToJoinVRWithSrcPhysReg(MachineInstr *CopyMI,
1027 MachineBasicBlock *CopyMBB,
1028 LiveInterval &DstInt,
1029 LiveInterval &SrcInt) {
1030 // If the virtual register live interval is long but it has low use desity,
1031 // do not join them, instead mark the physical register as its allocation
1033 const TargetRegisterClass *RC = mri_->getRegClass(DstInt.reg);
1034 unsigned Threshold = allocatableRCRegs_[RC].count() * 2;
1035 unsigned Length = li_->getApproximateInstructionCount(DstInt);
1036 if (Length > Threshold &&
1037 (((float)std::distance(mri_->use_begin(DstInt.reg),
1038 mri_->use_end()) / Length) < (1.0 / Threshold)))
1041 // If the virtual register live interval extends into a loop, turn down
1043 unsigned CopyIdx = li_->getDefIndex(li_->getInstructionIndex(CopyMI));
1044 const MachineLoop *L = loopInfo->getLoopFor(CopyMBB);
1046 // Let's see if the virtual register live interval extends into the loop.
1047 LiveInterval::iterator DLR = DstInt.FindLiveRangeContaining(CopyIdx);
1048 assert(DLR != DstInt.end() && "Live range not found!");
1049 DLR = DstInt.FindLiveRangeContaining(DLR->end+1);
1050 if (DLR != DstInt.end()) {
1051 CopyMBB = li_->getMBBFromIndex(DLR->start);
1052 L = loopInfo->getLoopFor(CopyMBB);
1056 if (!L || Length <= Threshold)
1059 unsigned UseIdx = li_->getUseIndex(CopyIdx);
1060 LiveInterval::iterator SLR = SrcInt.FindLiveRangeContaining(UseIdx);
1061 MachineBasicBlock *SMBB = li_->getMBBFromIndex(SLR->start);
1062 if (loopInfo->getLoopFor(SMBB) != L) {
1063 if (!loopInfo->isLoopHeader(CopyMBB))
1065 // If vr's live interval extends pass the loop header, do not join.
1066 for (MachineBasicBlock::succ_iterator SI = CopyMBB->succ_begin(),
1067 SE = CopyMBB->succ_end(); SI != SE; ++SI) {
1068 MachineBasicBlock *SuccMBB = *SI;
1069 if (SuccMBB == CopyMBB)
1071 if (DstInt.overlaps(li_->getMBBStartIdx(SuccMBB),
1072 li_->getMBBEndIdx(SuccMBB)+1))
1079 /// isWinToJoinVRWithDstPhysReg - Return true if it's worth while to join a
1080 /// copy from a virtual source register to a physical destination register.
1082 SimpleRegisterCoalescing::isWinToJoinVRWithDstPhysReg(MachineInstr *CopyMI,
1083 MachineBasicBlock *CopyMBB,
1084 LiveInterval &DstInt,
1085 LiveInterval &SrcInt) {
1086 // If the virtual register live interval is long but it has low use desity,
1087 // do not join them, instead mark the physical register as its allocation
1089 const TargetRegisterClass *RC = mri_->getRegClass(SrcInt.reg);
1090 unsigned Threshold = allocatableRCRegs_[RC].count() * 2;
1091 unsigned Length = li_->getApproximateInstructionCount(SrcInt);
1092 if (Length > Threshold &&
1093 (((float)std::distance(mri_->use_begin(SrcInt.reg),
1094 mri_->use_end()) / Length) < (1.0 / Threshold)))
1098 // Must be implicit_def.
1101 // If the virtual register live interval is defined or cross a loop, turn
1102 // down aggressiveness.
1103 unsigned CopyIdx = li_->getDefIndex(li_->getInstructionIndex(CopyMI));
1104 unsigned UseIdx = li_->getUseIndex(CopyIdx);
1105 LiveInterval::iterator SLR = SrcInt.FindLiveRangeContaining(UseIdx);
1106 assert(SLR != SrcInt.end() && "Live range not found!");
1107 SLR = SrcInt.FindLiveRangeContaining(SLR->start-1);
1108 if (SLR == SrcInt.end())
1110 MachineBasicBlock *SMBB = li_->getMBBFromIndex(SLR->start);
1111 const MachineLoop *L = loopInfo->getLoopFor(SMBB);
1113 if (!L || Length <= Threshold)
1116 if (loopInfo->getLoopFor(CopyMBB) != L) {
1117 if (SMBB != L->getLoopLatch())
1119 // If vr's live interval is extended from before the loop latch, do not
1121 for (MachineBasicBlock::pred_iterator PI = SMBB->pred_begin(),
1122 PE = SMBB->pred_end(); PI != PE; ++PI) {
1123 MachineBasicBlock *PredMBB = *PI;
1124 if (PredMBB == SMBB)
1126 if (SrcInt.overlaps(li_->getMBBStartIdx(PredMBB),
1127 li_->getMBBEndIdx(PredMBB)+1))
1134 /// isWinToJoinCrossClass - Return true if it's profitable to coalesce
1135 /// two virtual registers from different register classes.
1137 SimpleRegisterCoalescing::isWinToJoinCrossClass(unsigned LargeReg,
1139 unsigned Threshold) {
1140 // Then make sure the intervals are *short*.
1141 LiveInterval &LargeInt = li_->getInterval(LargeReg);
1142 LiveInterval &SmallInt = li_->getInterval(SmallReg);
1143 unsigned LargeSize = li_->getApproximateInstructionCount(LargeInt);
1144 unsigned SmallSize = li_->getApproximateInstructionCount(SmallInt);
1145 if (SmallSize > Threshold || LargeSize > Threshold)
1146 if ((float)std::distance(mri_->use_begin(SmallReg),
1147 mri_->use_end()) / SmallSize <
1148 (float)std::distance(mri_->use_begin(LargeReg),
1149 mri_->use_end()) / LargeSize)
1154 /// HasIncompatibleSubRegDefUse - If we are trying to coalesce a virtual
1155 /// register with a physical register, check if any of the virtual register
1156 /// operand is a sub-register use or def. If so, make sure it won't result
1157 /// in an illegal extract_subreg or insert_subreg instruction. e.g.
1158 /// vr1024 = extract_subreg vr1025, 1
1160 /// vr1024 = mov8rr AH
1161 /// If vr1024 is coalesced with AH, the extract_subreg is now illegal since
1162 /// AH does not have a super-reg whose sub-register 1 is AH.
1164 SimpleRegisterCoalescing::HasIncompatibleSubRegDefUse(MachineInstr *CopyMI,
1167 for (MachineRegisterInfo::reg_iterator I = mri_->reg_begin(VirtReg),
1168 E = mri_->reg_end(); I != E; ++I) {
1169 MachineOperand &O = I.getOperand();
1170 MachineInstr *MI = &*I;
1171 if (MI == CopyMI || JoinedCopies.count(MI))
1173 unsigned SubIdx = O.getSubReg();
1174 if (SubIdx && !tri_->getSubReg(PhysReg, SubIdx))
1176 if (MI->getOpcode() == TargetInstrInfo::EXTRACT_SUBREG) {
1177 SubIdx = MI->getOperand(2).getImm();
1178 if (O.isUse() && !tri_->getSubReg(PhysReg, SubIdx))
1181 unsigned SrcReg = MI->getOperand(1).getReg();
1182 const TargetRegisterClass *RC =
1183 TargetRegisterInfo::isPhysicalRegister(SrcReg)
1184 ? tri_->getPhysicalRegisterRegClass(SrcReg)
1185 : mri_->getRegClass(SrcReg);
1186 if (!tri_->getMatchingSuperReg(PhysReg, SubIdx, RC))
1190 if (MI->getOpcode() == TargetInstrInfo::INSERT_SUBREG ||
1191 MI->getOpcode() == TargetInstrInfo::SUBREG_TO_REG) {
1192 SubIdx = MI->getOperand(3).getImm();
1193 if (VirtReg == MI->getOperand(0).getReg()) {
1194 if (!tri_->getSubReg(PhysReg, SubIdx))
1197 unsigned DstReg = MI->getOperand(0).getReg();
1198 const TargetRegisterClass *RC =
1199 TargetRegisterInfo::isPhysicalRegister(DstReg)
1200 ? tri_->getPhysicalRegisterRegClass(DstReg)
1201 : mri_->getRegClass(DstReg);
1202 if (!tri_->getMatchingSuperReg(PhysReg, SubIdx, RC))
1211 /// CanJoinExtractSubRegToPhysReg - Return true if it's possible to coalesce
1212 /// an extract_subreg where dst is a physical register, e.g.
1213 /// cl = EXTRACT_SUBREG reg1024, 1
1215 SimpleRegisterCoalescing::CanJoinExtractSubRegToPhysReg(unsigned DstReg,
1216 unsigned SrcReg, unsigned SubIdx,
1217 unsigned &RealDstReg) {
1218 const TargetRegisterClass *RC = mri_->getRegClass(SrcReg);
1219 RealDstReg = tri_->getMatchingSuperReg(DstReg, SubIdx, RC);
1220 assert(RealDstReg && "Invalid extract_subreg instruction!");
1222 // For this type of EXTRACT_SUBREG, conservatively
1223 // check if the live interval of the source register interfere with the
1224 // actual super physical register we are trying to coalesce with.
1225 LiveInterval &RHS = li_->getInterval(SrcReg);
1226 if (li_->hasInterval(RealDstReg) &&
1227 RHS.overlaps(li_->getInterval(RealDstReg))) {
1228 DOUT << "Interfere with register ";
1229 DEBUG(li_->getInterval(RealDstReg).print(DOUT, tri_));
1230 return false; // Not coalescable
1232 for (const unsigned* SR = tri_->getSubRegisters(RealDstReg); *SR; ++SR)
1233 if (li_->hasInterval(*SR) && RHS.overlaps(li_->getInterval(*SR))) {
1234 DOUT << "Interfere with sub-register ";
1235 DEBUG(li_->getInterval(*SR).print(DOUT, tri_));
1236 return false; // Not coalescable
1241 /// CanJoinInsertSubRegToPhysReg - Return true if it's possible to coalesce
1242 /// an insert_subreg where src is a physical register, e.g.
1243 /// reg1024 = INSERT_SUBREG reg1024, c1, 0
1245 SimpleRegisterCoalescing::CanJoinInsertSubRegToPhysReg(unsigned DstReg,
1246 unsigned SrcReg, unsigned SubIdx,
1247 unsigned &RealSrcReg) {
1248 const TargetRegisterClass *RC = mri_->getRegClass(DstReg);
1249 RealSrcReg = tri_->getMatchingSuperReg(SrcReg, SubIdx, RC);
1250 assert(RealSrcReg && "Invalid extract_subreg instruction!");
1252 LiveInterval &RHS = li_->getInterval(DstReg);
1253 if (li_->hasInterval(RealSrcReg) &&
1254 RHS.overlaps(li_->getInterval(RealSrcReg))) {
1255 DOUT << "Interfere with register ";
1256 DEBUG(li_->getInterval(RealSrcReg).print(DOUT, tri_));
1257 return false; // Not coalescable
1259 for (const unsigned* SR = tri_->getSubRegisters(RealSrcReg); *SR; ++SR)
1260 if (li_->hasInterval(*SR) && RHS.overlaps(li_->getInterval(*SR))) {
1261 DOUT << "Interfere with sub-register ";
1262 DEBUG(li_->getInterval(*SR).print(DOUT, tri_));
1263 return false; // Not coalescable
1268 /// getRegAllocPreference - Return register allocation preference register.
1270 static unsigned getRegAllocPreference(unsigned Reg, MachineFunction &MF,
1271 MachineRegisterInfo *MRI,
1272 const TargetRegisterInfo *TRI) {
1273 if (TargetRegisterInfo::isPhysicalRegister(Reg))
1275 std::pair<unsigned, unsigned> Hint = MRI->getRegAllocationHint(Reg);
1276 return TRI->ResolveRegAllocHint(Hint.first, Hint.second, MF);
1279 /// JoinCopy - Attempt to join intervals corresponding to SrcReg/DstReg,
1280 /// which are the src/dst of the copy instruction CopyMI. This returns true
1281 /// if the copy was successfully coalesced away. If it is not currently
1282 /// possible to coalesce this interval, but it may be possible if other
1283 /// things get coalesced, then it returns true by reference in 'Again'.
1284 bool SimpleRegisterCoalescing::JoinCopy(CopyRec &TheCopy, bool &Again) {
1285 MachineInstr *CopyMI = TheCopy.MI;
1288 if (JoinedCopies.count(CopyMI) || ReMatCopies.count(CopyMI))
1289 return false; // Already done.
1291 DOUT << li_->getInstructionIndex(CopyMI) << '\t' << *CopyMI;
1293 unsigned SrcReg, DstReg, SrcSubIdx = 0, DstSubIdx = 0;
1294 bool isExtSubReg = CopyMI->getOpcode() == TargetInstrInfo::EXTRACT_SUBREG;
1295 bool isInsSubReg = CopyMI->getOpcode() == TargetInstrInfo::INSERT_SUBREG;
1296 bool isSubRegToReg = CopyMI->getOpcode() == TargetInstrInfo::SUBREG_TO_REG;
1297 unsigned SubIdx = 0;
1299 DstReg = CopyMI->getOperand(0).getReg();
1300 DstSubIdx = CopyMI->getOperand(0).getSubReg();
1301 SrcReg = CopyMI->getOperand(1).getReg();
1302 SrcSubIdx = CopyMI->getOperand(2).getImm();
1303 } else if (isInsSubReg || isSubRegToReg) {
1304 if (CopyMI->getOperand(2).getSubReg()) {
1305 DOUT << "\tSource of insert_subreg is already coalesced "
1306 << "to another register.\n";
1307 return false; // Not coalescable.
1309 DstReg = CopyMI->getOperand(0).getReg();
1310 DstSubIdx = CopyMI->getOperand(3).getImm();
1311 SrcReg = CopyMI->getOperand(2).getReg();
1312 } else if (!tii_->isMoveInstr(*CopyMI, SrcReg, DstReg, SrcSubIdx, DstSubIdx)){
1313 assert(0 && "Unrecognized copy instruction!");
1317 // If they are already joined we continue.
1318 if (SrcReg == DstReg) {
1319 DOUT << "\tCopy already coalesced.\n";
1320 return false; // Not coalescable.
1323 bool SrcIsPhys = TargetRegisterInfo::isPhysicalRegister(SrcReg);
1324 bool DstIsPhys = TargetRegisterInfo::isPhysicalRegister(DstReg);
1326 // If they are both physical registers, we cannot join them.
1327 if (SrcIsPhys && DstIsPhys) {
1328 DOUT << "\tCan not coalesce physregs.\n";
1329 return false; // Not coalescable.
1332 // We only join virtual registers with allocatable physical registers.
1333 if (SrcIsPhys && !allocatableRegs_[SrcReg]) {
1334 DOUT << "\tSrc reg is unallocatable physreg.\n";
1335 return false; // Not coalescable.
1337 if (DstIsPhys && !allocatableRegs_[DstReg]) {
1338 DOUT << "\tDst reg is unallocatable physreg.\n";
1339 return false; // Not coalescable.
1342 // Check that a physical source register is compatible with dst regclass
1344 unsigned SrcSubReg = SrcSubIdx ?
1345 tri_->getSubReg(SrcReg, SrcSubIdx) : SrcReg;
1346 const TargetRegisterClass *DstRC = mri_->getRegClass(DstReg);
1347 const TargetRegisterClass *DstSubRC = DstRC;
1349 DstSubRC = DstRC->getSubRegisterRegClass(DstSubIdx);
1350 assert(DstSubRC && "Illegal subregister index");
1351 if (!DstSubRC->contains(SrcSubReg)) {
1352 DOUT << "\tIncompatible destination regclass: "
1353 << tri_->getName(SrcSubReg) << " not in " << DstSubRC->getName()
1355 return false; // Not coalescable.
1359 // Check that a physical dst register is compatible with source regclass
1361 unsigned DstSubReg = DstSubIdx ?
1362 tri_->getSubReg(DstReg, DstSubIdx) : DstReg;
1363 const TargetRegisterClass *SrcRC = mri_->getRegClass(SrcReg);
1364 const TargetRegisterClass *SrcSubRC = SrcRC;
1366 SrcSubRC = SrcRC->getSubRegisterRegClass(SrcSubIdx);
1367 assert(SrcSubRC && "Illegal subregister index");
1368 if (!SrcSubRC->contains(DstReg)) {
1369 DOUT << "\tIncompatible source regclass: "
1370 << tri_->getName(DstSubReg) << " not in " << SrcSubRC->getName()
1372 return false; // Not coalescable.
1376 // Should be non-null only when coalescing to a sub-register class.
1377 bool CrossRC = false;
1378 const TargetRegisterClass *NewRC = NULL;
1379 MachineBasicBlock *CopyMBB = CopyMI->getParent();
1380 unsigned RealDstReg = 0;
1381 unsigned RealSrcReg = 0;
1382 if (isExtSubReg || isInsSubReg || isSubRegToReg) {
1383 SubIdx = CopyMI->getOperand(isExtSubReg ? 2 : 3).getImm();
1384 if (SrcIsPhys && isExtSubReg) {
1385 // r1024 = EXTRACT_SUBREG EAX, 0 then r1024 is really going to be
1386 // coalesced with AX.
1387 unsigned DstSubIdx = CopyMI->getOperand(0).getSubReg();
1389 // r1024<2> = EXTRACT_SUBREG EAX, 2. Then r1024 has already been
1390 // coalesced to a larger register so the subreg indices cancel out.
1391 if (DstSubIdx != SubIdx) {
1392 DOUT << "\t Sub-register indices mismatch.\n";
1393 return false; // Not coalescable.
1396 SrcReg = tri_->getSubReg(SrcReg, SubIdx);
1398 } else if (DstIsPhys && (isInsSubReg || isSubRegToReg)) {
1399 // EAX = INSERT_SUBREG EAX, r1024, 0
1400 unsigned SrcSubIdx = CopyMI->getOperand(2).getSubReg();
1402 // EAX = INSERT_SUBREG EAX, r1024<2>, 2 Then r1024 has already been
1403 // coalesced to a larger register so the subreg indices cancel out.
1404 if (SrcSubIdx != SubIdx) {
1405 DOUT << "\t Sub-register indices mismatch.\n";
1406 return false; // Not coalescable.
1409 DstReg = tri_->getSubReg(DstReg, SubIdx);
1411 } else if ((DstIsPhys && isExtSubReg) ||
1412 (SrcIsPhys && (isInsSubReg || isSubRegToReg))) {
1413 if (!isSubRegToReg && CopyMI->getOperand(1).getSubReg()) {
1414 DOUT << "\tSrc of extract_subreg already coalesced with reg"
1415 << " of a super-class.\n";
1416 return false; // Not coalescable.
1420 if (!CanJoinExtractSubRegToPhysReg(DstReg, SrcReg, SubIdx, RealDstReg))
1421 return false; // Not coalescable
1423 if (!CanJoinInsertSubRegToPhysReg(DstReg, SrcReg, SubIdx, RealSrcReg))
1424 return false; // Not coalescable
1428 unsigned OldSubIdx = isExtSubReg ? CopyMI->getOperand(0).getSubReg()
1429 : CopyMI->getOperand(2).getSubReg();
1431 if (OldSubIdx == SubIdx && !differingRegisterClasses(SrcReg, DstReg))
1432 // r1024<2> = EXTRACT_SUBREG r1025, 2. Then r1024 has already been
1433 // coalesced to a larger register so the subreg indices cancel out.
1434 // Also check if the other larger register is of the same register
1435 // class as the would be resulting register.
1438 DOUT << "\t Sub-register indices mismatch.\n";
1439 return false; // Not coalescable.
1443 unsigned LargeReg = isExtSubReg ? SrcReg : DstReg;
1444 unsigned SmallReg = isExtSubReg ? DstReg : SrcReg;
1445 unsigned Limit= allocatableRCRegs_[mri_->getRegClass(SmallReg)].count();
1446 if (!isWinToJoinCrossClass(LargeReg, SmallReg, Limit)) {
1447 Again = true; // May be possible to coalesce later.
1452 } else if (differingRegisterClasses(SrcReg, DstReg)) {
1453 if (!CrossClassJoin)
1457 // FIXME: What if the result of a EXTRACT_SUBREG is then coalesced
1458 // with another? If it's the resulting destination register, then
1459 // the subidx must be propagated to uses (but only those defined
1460 // by the EXTRACT_SUBREG). If it's being coalesced into another
1461 // register, it should be safe because register is assumed to have
1462 // the register class of the super-register.
1464 // Process moves where one of the registers have a sub-register index.
1465 MachineOperand *DstMO = CopyMI->findRegisterDefOperand(DstReg);
1466 MachineOperand *SrcMO = CopyMI->findRegisterUseOperand(SrcReg);
1467 SubIdx = DstMO->getSubReg();
1469 if (SrcMO->getSubReg())
1470 // FIXME: can we handle this?
1472 // This is not an insert_subreg but it looks like one.
1473 // e.g. %reg1024:4 = MOV32rr %EAX
1476 if (!CanJoinInsertSubRegToPhysReg(DstReg, SrcReg, SubIdx, RealSrcReg))
1477 return false; // Not coalescable
1481 SubIdx = SrcMO->getSubReg();
1483 // This is not a extract_subreg but it looks like one.
1484 // e.g. %cl = MOV16rr %reg1024:1
1487 if (!CanJoinExtractSubRegToPhysReg(DstReg, SrcReg, SubIdx,RealDstReg))
1488 return false; // Not coalescable
1494 const TargetRegisterClass *SrcRC= SrcIsPhys ? 0 : mri_->getRegClass(SrcReg);
1495 const TargetRegisterClass *DstRC= DstIsPhys ? 0 : mri_->getRegClass(DstReg);
1496 unsigned LargeReg = SrcReg;
1497 unsigned SmallReg = DstReg;
1500 // Now determine the register class of the joined register.
1502 if (SubIdx && DstRC && DstRC->isASubClass()) {
1503 // This is a move to a sub-register class. However, the source is a
1504 // sub-register of a larger register class. We don't know what should
1505 // the register class be. FIXME.
1509 Limit = allocatableRCRegs_[DstRC].count();
1510 } else if (!SrcIsPhys && !DstIsPhys) {
1511 NewRC = getCommonSubClass(SrcRC, DstRC);
1513 DOUT << "\tDisjoint regclasses: "
1514 << SrcRC->getName() << ", "
1515 << DstRC->getName() << ".\n";
1516 return false; // Not coalescable.
1518 if (DstRC->getSize() > SrcRC->getSize())
1519 std::swap(LargeReg, SmallReg);
1522 // If we are joining two virtual registers and the resulting register
1523 // class is more restrictive (fewer register, smaller size). Check if it's
1524 // worth doing the merge.
1525 if (!SrcIsPhys && !DstIsPhys &&
1526 (isExtSubReg || DstRC->isASubClass()) &&
1527 !isWinToJoinCrossClass(LargeReg, SmallReg,
1528 allocatableRCRegs_[NewRC].count())) {
1529 DOUT << "\tSrc/Dest are different register classes.\n";
1530 // Allow the coalescer to try again in case either side gets coalesced to
1531 // a physical register that's compatible with the other side. e.g.
1532 // r1024 = MOV32to32_ r1025
1533 // But later r1024 is assigned EAX then r1025 may be coalesced with EAX.
1534 Again = true; // May be possible to coalesce later.
1539 // Will it create illegal extract_subreg / insert_subreg?
1540 if (SrcIsPhys && HasIncompatibleSubRegDefUse(CopyMI, DstReg, SrcReg))
1542 if (DstIsPhys && HasIncompatibleSubRegDefUse(CopyMI, SrcReg, DstReg))
1545 LiveInterval &SrcInt = li_->getInterval(SrcReg);
1546 LiveInterval &DstInt = li_->getInterval(DstReg);
1547 assert(SrcInt.reg == SrcReg && DstInt.reg == DstReg &&
1548 "Register mapping is horribly broken!");
1550 DOUT << "\t\tInspecting "; SrcInt.print(DOUT, tri_);
1551 DOUT << " and "; DstInt.print(DOUT, tri_);
1554 // Save a copy of the virtual register live interval. We'll manually
1555 // merge this into the "real" physical register live interval this is
1557 LiveInterval *SavedLI = 0;
1559 SavedLI = li_->dupInterval(&SrcInt);
1560 else if (RealSrcReg)
1561 SavedLI = li_->dupInterval(&DstInt);
1563 // Check if it is necessary to propagate "isDead" property.
1564 if (!isExtSubReg && !isInsSubReg && !isSubRegToReg) {
1565 MachineOperand *mopd = CopyMI->findRegisterDefOperand(DstReg, false);
1566 bool isDead = mopd->isDead();
1568 // We need to be careful about coalescing a source physical register with a
1569 // virtual register. Once the coalescing is done, it cannot be broken and
1570 // these are not spillable! If the destination interval uses are far away,
1571 // think twice about coalescing them!
1572 if (!isDead && (SrcIsPhys || DstIsPhys)) {
1573 // If the copy is in a loop, take care not to coalesce aggressively if the
1574 // src is coming in from outside the loop (or the dst is out of the loop).
1575 // If it's not in a loop, then determine whether to join them base purely
1576 // by the length of the interval.
1577 if (PhysJoinTweak) {
1579 if (!isWinToJoinVRWithSrcPhysReg(CopyMI, CopyMBB, DstInt, SrcInt)) {
1580 mri_->setRegAllocationHint(DstInt.reg, 0, SrcReg);
1582 DOUT << "\tMay tie down a physical register, abort!\n";
1583 Again = true; // May be possible to coalesce later.
1587 if (!isWinToJoinVRWithDstPhysReg(CopyMI, CopyMBB, DstInt, SrcInt)) {
1588 mri_->setRegAllocationHint(SrcInt.reg, 0, DstReg);
1590 DOUT << "\tMay tie down a physical register, abort!\n";
1591 Again = true; // May be possible to coalesce later.
1596 // If the virtual register live interval is long but it has low use desity,
1597 // do not join them, instead mark the physical register as its allocation
1599 LiveInterval &JoinVInt = SrcIsPhys ? DstInt : SrcInt;
1600 unsigned JoinVReg = SrcIsPhys ? DstReg : SrcReg;
1601 unsigned JoinPReg = SrcIsPhys ? SrcReg : DstReg;
1602 const TargetRegisterClass *RC = mri_->getRegClass(JoinVReg);
1603 unsigned Threshold = allocatableRCRegs_[RC].count() * 2;
1604 if (TheCopy.isBackEdge)
1605 Threshold *= 2; // Favors back edge copies.
1607 unsigned Length = li_->getApproximateInstructionCount(JoinVInt);
1608 float Ratio = 1.0 / Threshold;
1609 if (Length > Threshold &&
1610 (((float)std::distance(mri_->use_begin(JoinVReg),
1611 mri_->use_end()) / Length) < Ratio)) {
1612 mri_->setRegAllocationHint(JoinVInt.reg, 0, JoinPReg);
1614 DOUT << "\tMay tie down a physical register, abort!\n";
1615 Again = true; // May be possible to coalesce later.
1622 // Okay, attempt to join these two intervals. On failure, this returns false.
1623 // Otherwise, if one of the intervals being joined is a physreg, this method
1624 // always canonicalizes DstInt to be it. The output "SrcInt" will not have
1625 // been modified, so we can use this information below to update aliases.
1626 bool Swapped = false;
1627 // If SrcInt is implicitly defined, it's safe to coalesce.
1628 bool isEmpty = SrcInt.empty();
1629 if (isEmpty && !CanCoalesceWithImpDef(CopyMI, DstInt, SrcInt)) {
1630 // Only coalesce an empty interval (defined by implicit_def) with
1631 // another interval which has a valno defined by the CopyMI and the CopyMI
1632 // is a kill of the implicit def.
1633 DOUT << "Not profitable!\n";
1637 if (!isEmpty && !JoinIntervals(DstInt, SrcInt, Swapped)) {
1638 // Coalescing failed.
1640 // If definition of source is defined by trivial computation, try
1641 // rematerializing it.
1642 if (!isExtSubReg && !isInsSubReg && !isSubRegToReg &&
1643 ReMaterializeTrivialDef(SrcInt, DstInt.reg, CopyMI))
1646 // If we can eliminate the copy without merging the live ranges, do so now.
1647 if (!isExtSubReg && !isInsSubReg && !isSubRegToReg &&
1648 (AdjustCopiesBackFrom(SrcInt, DstInt, CopyMI) ||
1649 RemoveCopyByCommutingDef(SrcInt, DstInt, CopyMI))) {
1650 JoinedCopies.insert(CopyMI);
1654 // Otherwise, we are unable to join the intervals.
1655 DOUT << "Interference!\n";
1656 Again = true; // May be possible to coalesce later.
1660 LiveInterval *ResSrcInt = &SrcInt;
1661 LiveInterval *ResDstInt = &DstInt;
1663 std::swap(SrcReg, DstReg);
1664 std::swap(ResSrcInt, ResDstInt);
1666 assert(TargetRegisterInfo::isVirtualRegister(SrcReg) &&
1667 "LiveInterval::join didn't work right!");
1669 // If we're about to merge live ranges into a physical register live interval,
1670 // we have to update any aliased register's live ranges to indicate that they
1671 // have clobbered values for this range.
1672 if (TargetRegisterInfo::isPhysicalRegister(DstReg)) {
1673 // If this is a extract_subreg where dst is a physical register, e.g.
1674 // cl = EXTRACT_SUBREG reg1024, 1
1675 // then create and update the actual physical register allocated to RHS.
1676 if (RealDstReg || RealSrcReg) {
1677 LiveInterval &RealInt =
1678 li_->getOrCreateInterval(RealDstReg ? RealDstReg : RealSrcReg);
1679 for (LiveInterval::const_vni_iterator I = SavedLI->vni_begin(),
1680 E = SavedLI->vni_end(); I != E; ++I) {
1681 const VNInfo *ValNo = *I;
1682 VNInfo *NewValNo = RealInt.getNextValue(ValNo->def, ValNo->copy,
1683 li_->getVNInfoAllocator());
1684 NewValNo->hasPHIKill = ValNo->hasPHIKill;
1685 NewValNo->redefByEC = ValNo->redefByEC;
1686 RealInt.addKills(NewValNo, ValNo->kills);
1687 RealInt.MergeValueInAsValue(*SavedLI, ValNo, NewValNo);
1689 RealInt.weight += SavedLI->weight;
1690 DstReg = RealDstReg ? RealDstReg : RealSrcReg;
1693 // Update the liveintervals of sub-registers.
1694 for (const unsigned *AS = tri_->getSubRegisters(DstReg); *AS; ++AS)
1695 li_->getOrCreateInterval(*AS).MergeInClobberRanges(*ResSrcInt,
1696 li_->getVNInfoAllocator());
1699 // If this is a EXTRACT_SUBREG, make sure the result of coalescing is the
1700 // larger super-register.
1701 if ((isExtSubReg || isInsSubReg || isSubRegToReg) &&
1702 !SrcIsPhys && !DstIsPhys) {
1703 if ((isExtSubReg && !Swapped) ||
1704 ((isInsSubReg || isSubRegToReg) && Swapped)) {
1705 ResSrcInt->Copy(*ResDstInt, mri_, li_->getVNInfoAllocator());
1706 std::swap(SrcReg, DstReg);
1707 std::swap(ResSrcInt, ResDstInt);
1711 // Coalescing to a virtual register that is of a sub-register class of the
1712 // other. Make sure the resulting register is set to the right register class.
1716 mri_->setRegClass(DstReg, NewRC);
1720 // Add all copies that define val# in the source interval into the queue.
1721 for (LiveInterval::const_vni_iterator i = ResSrcInt->vni_begin(),
1722 e = ResSrcInt->vni_end(); i != e; ++i) {
1723 const VNInfo *vni = *i;
1724 if (!vni->def || vni->def == ~1U || vni->def == ~0U)
1726 MachineInstr *CopyMI = li_->getInstructionFromIndex(vni->def);
1727 unsigned NewSrcReg, NewDstReg, NewSrcSubIdx, NewDstSubIdx;
1729 JoinedCopies.count(CopyMI) == 0 &&
1730 tii_->isMoveInstr(*CopyMI, NewSrcReg, NewDstReg,
1731 NewSrcSubIdx, NewDstSubIdx)) {
1732 unsigned LoopDepth = loopInfo->getLoopDepth(CopyMBB);
1733 JoinQueue->push(CopyRec(CopyMI, LoopDepth,
1734 isBackEdgeCopy(CopyMI, DstReg)));
1739 // Remember to delete the copy instruction.
1740 JoinedCopies.insert(CopyMI);
1742 // Some live range has been lengthened due to colaescing, eliminate the
1743 // unnecessary kills.
1744 RemoveUnnecessaryKills(SrcReg, *ResDstInt);
1745 if (TargetRegisterInfo::isVirtualRegister(DstReg))
1746 RemoveUnnecessaryKills(DstReg, *ResDstInt);
1751 // r1024 = implicit_def
1754 RemoveDeadImpDef(DstReg, *ResDstInt);
1755 UpdateRegDefsUses(SrcReg, DstReg, SubIdx);
1757 // SrcReg is guarateed to be the register whose live interval that is
1759 li_->removeInterval(SrcReg);
1761 // Manually deleted the live interval copy.
1768 // Now the copy is being coalesced away, the val# previously defined
1769 // by the copy is being defined by an IMPLICIT_DEF which defines a zero
1770 // length interval. Remove the val#.
1771 unsigned CopyIdx = li_->getDefIndex(li_->getInstructionIndex(CopyMI));
1772 const LiveRange *LR = ResDstInt->getLiveRangeContaining(CopyIdx);
1773 VNInfo *ImpVal = LR->valno;
1774 assert(ImpVal->def == CopyIdx);
1775 unsigned NextDef = LR->end;
1776 RemoveCopiesFromValNo(*ResDstInt, ImpVal);
1777 ResDstInt->removeValNo(ImpVal);
1778 LR = ResDstInt->FindLiveRangeContaining(NextDef);
1779 if (LR != ResDstInt->end() && LR->valno->def == NextDef) {
1780 // Special case: vr1024 = implicit_def
1781 // vr1024 = insert_subreg vr1024, vr1025, c
1782 // The insert_subreg becomes a "copy" that defines a val# which can itself
1783 // be coalesced away.
1784 MachineInstr *DefMI = li_->getInstructionFromIndex(NextDef);
1785 if (DefMI->getOpcode() == TargetInstrInfo::INSERT_SUBREG)
1786 LR->valno->copy = DefMI;
1790 // If resulting interval has a preference that no longer fits because of subreg
1791 // coalescing, just clear the preference.
1792 unsigned Preference = getRegAllocPreference(ResDstInt->reg, *mf_, mri_, tri_);
1793 if (Preference && (isExtSubReg || isInsSubReg || isSubRegToReg) &&
1794 TargetRegisterInfo::isVirtualRegister(ResDstInt->reg)) {
1795 const TargetRegisterClass *RC = mri_->getRegClass(ResDstInt->reg);
1796 if (!RC->contains(Preference))
1797 mri_->setRegAllocationHint(ResDstInt->reg, 0, 0);
1800 DOUT << "\n\t\tJoined. Result = "; ResDstInt->print(DOUT, tri_);
1807 /// ComputeUltimateVN - Assuming we are going to join two live intervals,
1808 /// compute what the resultant value numbers for each value in the input two
1809 /// ranges will be. This is complicated by copies between the two which can
1810 /// and will commonly cause multiple value numbers to be merged into one.
1812 /// VN is the value number that we're trying to resolve. InstDefiningValue
1813 /// keeps track of the new InstDefiningValue assignment for the result
1814 /// LiveInterval. ThisFromOther/OtherFromThis are sets that keep track of
1815 /// whether a value in this or other is a copy from the opposite set.
1816 /// ThisValNoAssignments/OtherValNoAssignments keep track of value #'s that have
1817 /// already been assigned.
1819 /// ThisFromOther[x] - If x is defined as a copy from the other interval, this
1820 /// contains the value number the copy is from.
1822 static unsigned ComputeUltimateVN(VNInfo *VNI,
1823 SmallVector<VNInfo*, 16> &NewVNInfo,
1824 DenseMap<VNInfo*, VNInfo*> &ThisFromOther,
1825 DenseMap<VNInfo*, VNInfo*> &OtherFromThis,
1826 SmallVector<int, 16> &ThisValNoAssignments,
1827 SmallVector<int, 16> &OtherValNoAssignments) {
1828 unsigned VN = VNI->id;
1830 // If the VN has already been computed, just return it.
1831 if (ThisValNoAssignments[VN] >= 0)
1832 return ThisValNoAssignments[VN];
1833 // assert(ThisValNoAssignments[VN] != -2 && "Cyclic case?");
1835 // If this val is not a copy from the other val, then it must be a new value
1836 // number in the destination.
1837 DenseMap<VNInfo*, VNInfo*>::iterator I = ThisFromOther.find(VNI);
1838 if (I == ThisFromOther.end()) {
1839 NewVNInfo.push_back(VNI);
1840 return ThisValNoAssignments[VN] = NewVNInfo.size()-1;
1842 VNInfo *OtherValNo = I->second;
1844 // Otherwise, this *is* a copy from the RHS. If the other side has already
1845 // been computed, return it.
1846 if (OtherValNoAssignments[OtherValNo->id] >= 0)
1847 return ThisValNoAssignments[VN] = OtherValNoAssignments[OtherValNo->id];
1849 // Mark this value number as currently being computed, then ask what the
1850 // ultimate value # of the other value is.
1851 ThisValNoAssignments[VN] = -2;
1852 unsigned UltimateVN =
1853 ComputeUltimateVN(OtherValNo, NewVNInfo, OtherFromThis, ThisFromOther,
1854 OtherValNoAssignments, ThisValNoAssignments);
1855 return ThisValNoAssignments[VN] = UltimateVN;
1858 static bool InVector(VNInfo *Val, const SmallVector<VNInfo*, 8> &V) {
1859 return std::find(V.begin(), V.end(), Val) != V.end();
1862 /// RangeIsDefinedByCopyFromReg - Return true if the specified live range of
1863 /// the specified live interval is defined by a copy from the specified
1865 bool SimpleRegisterCoalescing::RangeIsDefinedByCopyFromReg(LiveInterval &li,
1868 unsigned SrcReg = li_->getVNInfoSourceReg(LR->valno);
1871 if (LR->valno->def == ~0U &&
1872 TargetRegisterInfo::isPhysicalRegister(li.reg) &&
1873 *tri_->getSuperRegisters(li.reg)) {
1874 // It's a sub-register live interval, we may not have precise information.
1876 MachineInstr *DefMI = li_->getInstructionFromIndex(LR->start);
1877 unsigned SrcReg, DstReg, SrcSubIdx, DstSubIdx;
1879 tii_->isMoveInstr(*DefMI, SrcReg, DstReg, SrcSubIdx, DstSubIdx) &&
1880 DstReg == li.reg && SrcReg == Reg) {
1881 // Cache computed info.
1882 LR->valno->def = LR->start;
1883 LR->valno->copy = DefMI;
1890 /// SimpleJoin - Attempt to joint the specified interval into this one. The
1891 /// caller of this method must guarantee that the RHS only contains a single
1892 /// value number and that the RHS is not defined by a copy from this
1893 /// interval. This returns false if the intervals are not joinable, or it
1894 /// joins them and returns true.
1895 bool SimpleRegisterCoalescing::SimpleJoin(LiveInterval &LHS, LiveInterval &RHS){
1896 assert(RHS.containsOneValue());
1898 // Some number (potentially more than one) value numbers in the current
1899 // interval may be defined as copies from the RHS. Scan the overlapping
1900 // portions of the LHS and RHS, keeping track of this and looking for
1901 // overlapping live ranges that are NOT defined as copies. If these exist, we
1904 LiveInterval::iterator LHSIt = LHS.begin(), LHSEnd = LHS.end();
1905 LiveInterval::iterator RHSIt = RHS.begin(), RHSEnd = RHS.end();
1907 if (LHSIt->start < RHSIt->start) {
1908 LHSIt = std::upper_bound(LHSIt, LHSEnd, RHSIt->start);
1909 if (LHSIt != LHS.begin()) --LHSIt;
1910 } else if (RHSIt->start < LHSIt->start) {
1911 RHSIt = std::upper_bound(RHSIt, RHSEnd, LHSIt->start);
1912 if (RHSIt != RHS.begin()) --RHSIt;
1915 SmallVector<VNInfo*, 8> EliminatedLHSVals;
1918 // Determine if these live intervals overlap.
1919 bool Overlaps = false;
1920 if (LHSIt->start <= RHSIt->start)
1921 Overlaps = LHSIt->end > RHSIt->start;
1923 Overlaps = RHSIt->end > LHSIt->start;
1925 // If the live intervals overlap, there are two interesting cases: if the
1926 // LHS interval is defined by a copy from the RHS, it's ok and we record
1927 // that the LHS value # is the same as the RHS. If it's not, then we cannot
1928 // coalesce these live ranges and we bail out.
1930 // If we haven't already recorded that this value # is safe, check it.
1931 if (!InVector(LHSIt->valno, EliminatedLHSVals)) {
1932 // Copy from the RHS?
1933 if (!RangeIsDefinedByCopyFromReg(LHS, LHSIt, RHS.reg))
1934 return false; // Nope, bail out.
1936 if (LHSIt->contains(RHSIt->valno->def))
1937 // Here is an interesting situation:
1939 // vr1025 = copy vr1024
1944 // Even though vr1025 is copied from vr1024, it's not safe to
1945 // coalesce them since the live range of vr1025 intersects the
1946 // def of vr1024. This happens because vr1025 is assigned the
1947 // value of the previous iteration of vr1024.
1949 EliminatedLHSVals.push_back(LHSIt->valno);
1952 // We know this entire LHS live range is okay, so skip it now.
1953 if (++LHSIt == LHSEnd) break;
1957 if (LHSIt->end < RHSIt->end) {
1958 if (++LHSIt == LHSEnd) break;
1960 // One interesting case to check here. It's possible that we have
1961 // something like "X3 = Y" which defines a new value number in the LHS,
1962 // and is the last use of this liverange of the RHS. In this case, we
1963 // want to notice this copy (so that it gets coalesced away) even though
1964 // the live ranges don't actually overlap.
1965 if (LHSIt->start == RHSIt->end) {
1966 if (InVector(LHSIt->valno, EliminatedLHSVals)) {
1967 // We already know that this value number is going to be merged in
1968 // if coalescing succeeds. Just skip the liverange.
1969 if (++LHSIt == LHSEnd) break;
1971 // Otherwise, if this is a copy from the RHS, mark it as being merged
1973 if (RangeIsDefinedByCopyFromReg(LHS, LHSIt, RHS.reg)) {
1974 if (LHSIt->contains(RHSIt->valno->def))
1975 // Here is an interesting situation:
1977 // vr1025 = copy vr1024
1982 // Even though vr1025 is copied from vr1024, it's not safe to
1983 // coalesced them since live range of vr1025 intersects the
1984 // def of vr1024. This happens because vr1025 is assigned the
1985 // value of the previous iteration of vr1024.
1987 EliminatedLHSVals.push_back(LHSIt->valno);
1989 // We know this entire LHS live range is okay, so skip it now.
1990 if (++LHSIt == LHSEnd) break;
1995 if (++RHSIt == RHSEnd) break;
1999 // If we got here, we know that the coalescing will be successful and that
2000 // the value numbers in EliminatedLHSVals will all be merged together. Since
2001 // the most common case is that EliminatedLHSVals has a single number, we
2002 // optimize for it: if there is more than one value, we merge them all into
2003 // the lowest numbered one, then handle the interval as if we were merging
2004 // with one value number.
2005 VNInfo *LHSValNo = NULL;
2006 if (EliminatedLHSVals.size() > 1) {
2007 // Loop through all the equal value numbers merging them into the smallest
2009 VNInfo *Smallest = EliminatedLHSVals[0];
2010 for (unsigned i = 1, e = EliminatedLHSVals.size(); i != e; ++i) {
2011 if (EliminatedLHSVals[i]->id < Smallest->id) {
2012 // Merge the current notion of the smallest into the smaller one.
2013 LHS.MergeValueNumberInto(Smallest, EliminatedLHSVals[i]);
2014 Smallest = EliminatedLHSVals[i];
2016 // Merge into the smallest.
2017 LHS.MergeValueNumberInto(EliminatedLHSVals[i], Smallest);
2020 LHSValNo = Smallest;
2021 } else if (EliminatedLHSVals.empty()) {
2022 if (TargetRegisterInfo::isPhysicalRegister(LHS.reg) &&
2023 *tri_->getSuperRegisters(LHS.reg))
2024 // Imprecise sub-register information. Can't handle it.
2026 assert(0 && "No copies from the RHS?");
2028 LHSValNo = EliminatedLHSVals[0];
2031 // Okay, now that there is a single LHS value number that we're merging the
2032 // RHS into, update the value number info for the LHS to indicate that the
2033 // value number is defined where the RHS value number was.
2034 const VNInfo *VNI = RHS.getValNumInfo(0);
2035 LHSValNo->def = VNI->def;
2036 LHSValNo->copy = VNI->copy;
2038 // Okay, the final step is to loop over the RHS live intervals, adding them to
2040 LHSValNo->hasPHIKill |= VNI->hasPHIKill;
2041 LHS.addKills(LHSValNo, VNI->kills);
2042 LHS.MergeRangesInAsValue(RHS, LHSValNo);
2043 LHS.weight += RHS.weight;
2045 // Update regalloc hint if both are virtual registers.
2046 if (TargetRegisterInfo::isVirtualRegister(LHS.reg) &&
2047 TargetRegisterInfo::isVirtualRegister(RHS.reg)) {
2048 std::pair<unsigned, unsigned> RHSPref = mri_->getRegAllocationHint(RHS.reg);
2049 std::pair<unsigned, unsigned> LHSPref = mri_->getRegAllocationHint(LHS.reg);
2050 if (RHSPref != LHSPref)
2051 mri_->setRegAllocationHint(LHS.reg, RHSPref.first, RHSPref.second);
2054 // Update the liveintervals of sub-registers.
2055 if (TargetRegisterInfo::isPhysicalRegister(LHS.reg))
2056 for (const unsigned *AS = tri_->getSubRegisters(LHS.reg); *AS; ++AS)
2057 li_->getOrCreateInterval(*AS).MergeInClobberRanges(LHS,
2058 li_->getVNInfoAllocator());
2063 /// JoinIntervals - Attempt to join these two intervals. On failure, this
2064 /// returns false. Otherwise, if one of the intervals being joined is a
2065 /// physreg, this method always canonicalizes LHS to be it. The output
2066 /// "RHS" will not have been modified, so we can use this information
2067 /// below to update aliases.
2069 SimpleRegisterCoalescing::JoinIntervals(LiveInterval &LHS, LiveInterval &RHS,
2071 // Compute the final value assignment, assuming that the live ranges can be
2073 SmallVector<int, 16> LHSValNoAssignments;
2074 SmallVector<int, 16> RHSValNoAssignments;
2075 DenseMap<VNInfo*, VNInfo*> LHSValsDefinedFromRHS;
2076 DenseMap<VNInfo*, VNInfo*> RHSValsDefinedFromLHS;
2077 SmallVector<VNInfo*, 16> NewVNInfo;
2079 // If a live interval is a physical register, conservatively check if any
2080 // of its sub-registers is overlapping the live interval of the virtual
2081 // register. If so, do not coalesce.
2082 if (TargetRegisterInfo::isPhysicalRegister(LHS.reg) &&
2083 *tri_->getSubRegisters(LHS.reg)) {
2084 // If it's coalescing a virtual register to a physical register, estimate
2085 // its live interval length. This is the *cost* of scanning an entire live
2086 // interval. If the cost is low, we'll do an exhaustive check instead.
2088 // If this is something like this:
2096 // That is, the live interval of v1024 crosses a bb. Then we can't rely on
2097 // less conservative check. It's possible a sub-register is defined before
2098 // v1024 (or live in) and live out of BB1.
2099 if (RHS.containsOneValue() &&
2100 li_->intervalIsInOneMBB(RHS) &&
2101 li_->getApproximateInstructionCount(RHS) <= 10) {
2102 // Perform a more exhaustive check for some common cases.
2103 if (li_->conflictsWithPhysRegRef(RHS, LHS.reg, true, JoinedCopies))
2106 for (const unsigned* SR = tri_->getSubRegisters(LHS.reg); *SR; ++SR)
2107 if (li_->hasInterval(*SR) && RHS.overlaps(li_->getInterval(*SR))) {
2108 DOUT << "Interfere with sub-register ";
2109 DEBUG(li_->getInterval(*SR).print(DOUT, tri_));
2113 } else if (TargetRegisterInfo::isPhysicalRegister(RHS.reg) &&
2114 *tri_->getSubRegisters(RHS.reg)) {
2115 if (LHS.containsOneValue() &&
2116 li_->getApproximateInstructionCount(LHS) <= 10) {
2117 // Perform a more exhaustive check for some common cases.
2118 if (li_->conflictsWithPhysRegRef(LHS, RHS.reg, false, JoinedCopies))
2121 for (const unsigned* SR = tri_->getSubRegisters(RHS.reg); *SR; ++SR)
2122 if (li_->hasInterval(*SR) && LHS.overlaps(li_->getInterval(*SR))) {
2123 DOUT << "Interfere with sub-register ";
2124 DEBUG(li_->getInterval(*SR).print(DOUT, tri_));
2130 // Compute ultimate value numbers for the LHS and RHS values.
2131 if (RHS.containsOneValue()) {
2132 // Copies from a liveinterval with a single value are simple to handle and
2133 // very common, handle the special case here. This is important, because
2134 // often RHS is small and LHS is large (e.g. a physreg).
2136 // Find out if the RHS is defined as a copy from some value in the LHS.
2137 int RHSVal0DefinedFromLHS = -1;
2139 VNInfo *RHSValNoInfo = NULL;
2140 VNInfo *RHSValNoInfo0 = RHS.getValNumInfo(0);
2141 unsigned RHSSrcReg = li_->getVNInfoSourceReg(RHSValNoInfo0);
2142 if (RHSSrcReg == 0 || RHSSrcReg != LHS.reg) {
2143 // If RHS is not defined as a copy from the LHS, we can use simpler and
2144 // faster checks to see if the live ranges are coalescable. This joiner
2145 // can't swap the LHS/RHS intervals though.
2146 if (!TargetRegisterInfo::isPhysicalRegister(RHS.reg)) {
2147 return SimpleJoin(LHS, RHS);
2149 RHSValNoInfo = RHSValNoInfo0;
2152 // It was defined as a copy from the LHS, find out what value # it is.
2153 RHSValNoInfo = LHS.getLiveRangeContaining(RHSValNoInfo0->def-1)->valno;
2154 RHSValID = RHSValNoInfo->id;
2155 RHSVal0DefinedFromLHS = RHSValID;
2158 LHSValNoAssignments.resize(LHS.getNumValNums(), -1);
2159 RHSValNoAssignments.resize(RHS.getNumValNums(), -1);
2160 NewVNInfo.resize(LHS.getNumValNums(), NULL);
2162 // Okay, *all* of the values in LHS that are defined as a copy from RHS
2163 // should now get updated.
2164 for (LiveInterval::vni_iterator i = LHS.vni_begin(), e = LHS.vni_end();
2167 unsigned VN = VNI->id;
2168 if (unsigned LHSSrcReg = li_->getVNInfoSourceReg(VNI)) {
2169 if (LHSSrcReg != RHS.reg) {
2170 // If this is not a copy from the RHS, its value number will be
2171 // unmodified by the coalescing.
2172 NewVNInfo[VN] = VNI;
2173 LHSValNoAssignments[VN] = VN;
2174 } else if (RHSValID == -1) {
2175 // Otherwise, it is a copy from the RHS, and we don't already have a
2176 // value# for it. Keep the current value number, but remember it.
2177 LHSValNoAssignments[VN] = RHSValID = VN;
2178 NewVNInfo[VN] = RHSValNoInfo;
2179 LHSValsDefinedFromRHS[VNI] = RHSValNoInfo0;
2181 // Otherwise, use the specified value #.
2182 LHSValNoAssignments[VN] = RHSValID;
2183 if (VN == (unsigned)RHSValID) { // Else this val# is dead.
2184 NewVNInfo[VN] = RHSValNoInfo;
2185 LHSValsDefinedFromRHS[VNI] = RHSValNoInfo0;
2189 NewVNInfo[VN] = VNI;
2190 LHSValNoAssignments[VN] = VN;
2194 assert(RHSValID != -1 && "Didn't find value #?");
2195 RHSValNoAssignments[0] = RHSValID;
2196 if (RHSVal0DefinedFromLHS != -1) {
2197 // This path doesn't go through ComputeUltimateVN so just set
2199 RHSValsDefinedFromLHS[RHSValNoInfo0] = (VNInfo*)1;
2202 // Loop over the value numbers of the LHS, seeing if any are defined from
2204 for (LiveInterval::vni_iterator i = LHS.vni_begin(), e = LHS.vni_end();
2207 if (VNI->def == ~1U || VNI->copy == 0) // Src not defined by a copy?
2210 // DstReg is known to be a register in the LHS interval. If the src is
2211 // from the RHS interval, we can use its value #.
2212 if (li_->getVNInfoSourceReg(VNI) != RHS.reg)
2215 // Figure out the value # from the RHS.
2216 LHSValsDefinedFromRHS[VNI]=RHS.getLiveRangeContaining(VNI->def-1)->valno;
2219 // Loop over the value numbers of the RHS, seeing if any are defined from
2221 for (LiveInterval::vni_iterator i = RHS.vni_begin(), e = RHS.vni_end();
2224 if (VNI->def == ~1U || VNI->copy == 0) // Src not defined by a copy?
2227 // DstReg is known to be a register in the RHS interval. If the src is
2228 // from the LHS interval, we can use its value #.
2229 if (li_->getVNInfoSourceReg(VNI) != LHS.reg)
2232 // Figure out the value # from the LHS.
2233 RHSValsDefinedFromLHS[VNI]=LHS.getLiveRangeContaining(VNI->def-1)->valno;
2236 LHSValNoAssignments.resize(LHS.getNumValNums(), -1);
2237 RHSValNoAssignments.resize(RHS.getNumValNums(), -1);
2238 NewVNInfo.reserve(LHS.getNumValNums() + RHS.getNumValNums());
2240 for (LiveInterval::vni_iterator i = LHS.vni_begin(), e = LHS.vni_end();
2243 unsigned VN = VNI->id;
2244 if (LHSValNoAssignments[VN] >= 0 || VNI->def == ~1U)
2246 ComputeUltimateVN(VNI, NewVNInfo,
2247 LHSValsDefinedFromRHS, RHSValsDefinedFromLHS,
2248 LHSValNoAssignments, RHSValNoAssignments);
2250 for (LiveInterval::vni_iterator i = RHS.vni_begin(), e = RHS.vni_end();
2253 unsigned VN = VNI->id;
2254 if (RHSValNoAssignments[VN] >= 0 || VNI->def == ~1U)
2256 // If this value number isn't a copy from the LHS, it's a new number.
2257 if (RHSValsDefinedFromLHS.find(VNI) == RHSValsDefinedFromLHS.end()) {
2258 NewVNInfo.push_back(VNI);
2259 RHSValNoAssignments[VN] = NewVNInfo.size()-1;
2263 ComputeUltimateVN(VNI, NewVNInfo,
2264 RHSValsDefinedFromLHS, LHSValsDefinedFromRHS,
2265 RHSValNoAssignments, LHSValNoAssignments);
2269 // Armed with the mappings of LHS/RHS values to ultimate values, walk the
2270 // interval lists to see if these intervals are coalescable.
2271 LiveInterval::const_iterator I = LHS.begin();
2272 LiveInterval::const_iterator IE = LHS.end();
2273 LiveInterval::const_iterator J = RHS.begin();
2274 LiveInterval::const_iterator JE = RHS.end();
2276 // Skip ahead until the first place of potential sharing.
2277 if (I->start < J->start) {
2278 I = std::upper_bound(I, IE, J->start);
2279 if (I != LHS.begin()) --I;
2280 } else if (J->start < I->start) {
2281 J = std::upper_bound(J, JE, I->start);
2282 if (J != RHS.begin()) --J;
2286 // Determine if these two live ranges overlap.
2288 if (I->start < J->start) {
2289 Overlaps = I->end > J->start;
2291 Overlaps = J->end > I->start;
2294 // If so, check value # info to determine if they are really different.
2296 // If the live range overlap will map to the same value number in the
2297 // result liverange, we can still coalesce them. If not, we can't.
2298 if (LHSValNoAssignments[I->valno->id] !=
2299 RHSValNoAssignments[J->valno->id])
2303 if (I->end < J->end) {
2312 // Update kill info. Some live ranges are extended due to copy coalescing.
2313 for (DenseMap<VNInfo*, VNInfo*>::iterator I = LHSValsDefinedFromRHS.begin(),
2314 E = LHSValsDefinedFromRHS.end(); I != E; ++I) {
2315 VNInfo *VNI = I->first;
2316 unsigned LHSValID = LHSValNoAssignments[VNI->id];
2317 LiveInterval::removeKill(NewVNInfo[LHSValID], VNI->def);
2318 NewVNInfo[LHSValID]->hasPHIKill |= VNI->hasPHIKill;
2319 RHS.addKills(NewVNInfo[LHSValID], VNI->kills);
2322 // Update kill info. Some live ranges are extended due to copy coalescing.
2323 for (DenseMap<VNInfo*, VNInfo*>::iterator I = RHSValsDefinedFromLHS.begin(),
2324 E = RHSValsDefinedFromLHS.end(); I != E; ++I) {
2325 VNInfo *VNI = I->first;
2326 unsigned RHSValID = RHSValNoAssignments[VNI->id];
2327 LiveInterval::removeKill(NewVNInfo[RHSValID], VNI->def);
2328 NewVNInfo[RHSValID]->hasPHIKill |= VNI->hasPHIKill;
2329 LHS.addKills(NewVNInfo[RHSValID], VNI->kills);
2332 // If we get here, we know that we can coalesce the live ranges. Ask the
2333 // intervals to coalesce themselves now.
2334 if ((RHS.ranges.size() > LHS.ranges.size() &&
2335 TargetRegisterInfo::isVirtualRegister(LHS.reg)) ||
2336 TargetRegisterInfo::isPhysicalRegister(RHS.reg)) {
2337 RHS.join(LHS, &RHSValNoAssignments[0], &LHSValNoAssignments[0], NewVNInfo,
2341 LHS.join(RHS, &LHSValNoAssignments[0], &RHSValNoAssignments[0], NewVNInfo,
2349 // DepthMBBCompare - Comparison predicate that sort first based on the loop
2350 // depth of the basic block (the unsigned), and then on the MBB number.
2351 struct DepthMBBCompare {
2352 typedef std::pair<unsigned, MachineBasicBlock*> DepthMBBPair;
2353 bool operator()(const DepthMBBPair &LHS, const DepthMBBPair &RHS) const {
2354 if (LHS.first > RHS.first) return true; // Deeper loops first
2355 return LHS.first == RHS.first &&
2356 LHS.second->getNumber() < RHS.second->getNumber();
2361 /// getRepIntervalSize - Returns the size of the interval that represents the
2362 /// specified register.
2364 unsigned JoinPriorityQueue<SF>::getRepIntervalSize(unsigned Reg) {
2365 return Rc->getRepIntervalSize(Reg);
2368 /// CopyRecSort::operator - Join priority queue sorting function.
2370 bool CopyRecSort::operator()(CopyRec left, CopyRec right) const {
2371 // Inner loops first.
2372 if (left.LoopDepth > right.LoopDepth)
2374 else if (left.LoopDepth == right.LoopDepth)
2375 if (left.isBackEdge && !right.isBackEdge)
2380 void SimpleRegisterCoalescing::CopyCoalesceInMBB(MachineBasicBlock *MBB,
2381 std::vector<CopyRec> &TryAgain) {
2382 DOUT << ((Value*)MBB->getBasicBlock())->getName() << ":\n";
2384 std::vector<CopyRec> VirtCopies;
2385 std::vector<CopyRec> PhysCopies;
2386 std::vector<CopyRec> ImpDefCopies;
2387 unsigned LoopDepth = loopInfo->getLoopDepth(MBB);
2388 for (MachineBasicBlock::iterator MII = MBB->begin(), E = MBB->end();
2390 MachineInstr *Inst = MII++;
2392 // If this isn't a copy nor a extract_subreg, we can't join intervals.
2393 unsigned SrcReg, DstReg, SrcSubIdx, DstSubIdx;
2394 if (Inst->getOpcode() == TargetInstrInfo::EXTRACT_SUBREG) {
2395 DstReg = Inst->getOperand(0).getReg();
2396 SrcReg = Inst->getOperand(1).getReg();
2397 } else if (Inst->getOpcode() == TargetInstrInfo::INSERT_SUBREG ||
2398 Inst->getOpcode() == TargetInstrInfo::SUBREG_TO_REG) {
2399 DstReg = Inst->getOperand(0).getReg();
2400 SrcReg = Inst->getOperand(2).getReg();
2401 } else if (!tii_->isMoveInstr(*Inst, SrcReg, DstReg, SrcSubIdx, DstSubIdx))
2404 bool SrcIsPhys = TargetRegisterInfo::isPhysicalRegister(SrcReg);
2405 bool DstIsPhys = TargetRegisterInfo::isPhysicalRegister(DstReg);
2407 JoinQueue->push(CopyRec(Inst, LoopDepth, isBackEdgeCopy(Inst, DstReg)));
2409 if (li_->hasInterval(SrcReg) && li_->getInterval(SrcReg).empty())
2410 ImpDefCopies.push_back(CopyRec(Inst, 0, false));
2411 else if (SrcIsPhys || DstIsPhys)
2412 PhysCopies.push_back(CopyRec(Inst, 0, false));
2414 VirtCopies.push_back(CopyRec(Inst, 0, false));
2421 // Try coalescing implicit copies first, followed by copies to / from
2422 // physical registers, then finally copies from virtual registers to
2423 // virtual registers.
2424 for (unsigned i = 0, e = ImpDefCopies.size(); i != e; ++i) {
2425 CopyRec &TheCopy = ImpDefCopies[i];
2427 if (!JoinCopy(TheCopy, Again))
2429 TryAgain.push_back(TheCopy);
2431 for (unsigned i = 0, e = PhysCopies.size(); i != e; ++i) {
2432 CopyRec &TheCopy = PhysCopies[i];
2434 if (!JoinCopy(TheCopy, Again))
2436 TryAgain.push_back(TheCopy);
2438 for (unsigned i = 0, e = VirtCopies.size(); i != e; ++i) {
2439 CopyRec &TheCopy = VirtCopies[i];
2441 if (!JoinCopy(TheCopy, Again))
2443 TryAgain.push_back(TheCopy);
2447 void SimpleRegisterCoalescing::joinIntervals() {
2448 DOUT << "********** JOINING INTERVALS ***********\n";
2451 JoinQueue = new JoinPriorityQueue<CopyRecSort>(this);
2453 std::vector<CopyRec> TryAgainList;
2454 if (loopInfo->empty()) {
2455 // If there are no loops in the function, join intervals in function order.
2456 for (MachineFunction::iterator I = mf_->begin(), E = mf_->end();
2458 CopyCoalesceInMBB(I, TryAgainList);
2460 // Otherwise, join intervals in inner loops before other intervals.
2461 // Unfortunately we can't just iterate over loop hierarchy here because
2462 // there may be more MBB's than BB's. Collect MBB's for sorting.
2464 // Join intervals in the function prolog first. We want to join physical
2465 // registers with virtual registers before the intervals got too long.
2466 std::vector<std::pair<unsigned, MachineBasicBlock*> > MBBs;
2467 for (MachineFunction::iterator I = mf_->begin(), E = mf_->end();I != E;++I){
2468 MachineBasicBlock *MBB = I;
2469 MBBs.push_back(std::make_pair(loopInfo->getLoopDepth(MBB), I));
2472 // Sort by loop depth.
2473 std::sort(MBBs.begin(), MBBs.end(), DepthMBBCompare());
2475 // Finally, join intervals in loop nest order.
2476 for (unsigned i = 0, e = MBBs.size(); i != e; ++i)
2477 CopyCoalesceInMBB(MBBs[i].second, TryAgainList);
2480 // Joining intervals can allow other intervals to be joined. Iteratively join
2481 // until we make no progress.
2483 SmallVector<CopyRec, 16> TryAgain;
2484 bool ProgressMade = true;
2485 while (ProgressMade) {
2486 ProgressMade = false;
2487 while (!JoinQueue->empty()) {
2488 CopyRec R = JoinQueue->pop();
2490 bool Success = JoinCopy(R, Again);
2492 ProgressMade = true;
2494 TryAgain.push_back(R);
2498 while (!TryAgain.empty()) {
2499 JoinQueue->push(TryAgain.back());
2500 TryAgain.pop_back();
2505 bool ProgressMade = true;
2506 while (ProgressMade) {
2507 ProgressMade = false;
2509 for (unsigned i = 0, e = TryAgainList.size(); i != e; ++i) {
2510 CopyRec &TheCopy = TryAgainList[i];
2513 bool Success = JoinCopy(TheCopy, Again);
2514 if (Success || !Again) {
2515 TheCopy.MI = 0; // Mark this one as done.
2516 ProgressMade = true;
2527 /// Return true if the two specified registers belong to different register
2528 /// classes. The registers may be either phys or virt regs.
2530 SimpleRegisterCoalescing::differingRegisterClasses(unsigned RegA,
2531 unsigned RegB) const {
2532 // Get the register classes for the first reg.
2533 if (TargetRegisterInfo::isPhysicalRegister(RegA)) {
2534 assert(TargetRegisterInfo::isVirtualRegister(RegB) &&
2535 "Shouldn't consider two physregs!");
2536 return !mri_->getRegClass(RegB)->contains(RegA);
2539 // Compare against the regclass for the second reg.
2540 const TargetRegisterClass *RegClassA = mri_->getRegClass(RegA);
2541 if (TargetRegisterInfo::isVirtualRegister(RegB)) {
2542 const TargetRegisterClass *RegClassB = mri_->getRegClass(RegB);
2543 return RegClassA != RegClassB;
2545 return !RegClassA->contains(RegB);
2548 /// lastRegisterUse - Returns the last use of the specific register between
2549 /// cycles Start and End or NULL if there are no uses.
2551 SimpleRegisterCoalescing::lastRegisterUse(unsigned Start, unsigned End,
2552 unsigned Reg, unsigned &UseIdx) const{
2554 if (TargetRegisterInfo::isVirtualRegister(Reg)) {
2555 MachineOperand *LastUse = NULL;
2556 for (MachineRegisterInfo::use_iterator I = mri_->use_begin(Reg),
2557 E = mri_->use_end(); I != E; ++I) {
2558 MachineOperand &Use = I.getOperand();
2559 MachineInstr *UseMI = Use.getParent();
2560 unsigned SrcReg, DstReg, SrcSubIdx, DstSubIdx;
2561 if (tii_->isMoveInstr(*UseMI, SrcReg, DstReg, SrcSubIdx, DstSubIdx) &&
2563 // Ignore identity copies.
2565 unsigned Idx = li_->getInstructionIndex(UseMI);
2566 if (Idx >= Start && Idx < End && Idx >= UseIdx) {
2568 UseIdx = li_->getUseIndex(Idx);
2574 int e = (End-1) / InstrSlots::NUM * InstrSlots::NUM;
2577 // Skip deleted instructions
2578 MachineInstr *MI = li_->getInstructionFromIndex(e);
2579 while ((e - InstrSlots::NUM) >= s && !MI) {
2580 e -= InstrSlots::NUM;
2581 MI = li_->getInstructionFromIndex(e);
2583 if (e < s || MI == NULL)
2586 // Ignore identity copies.
2587 unsigned SrcReg, DstReg, SrcSubIdx, DstSubIdx;
2588 if (!(tii_->isMoveInstr(*MI, SrcReg, DstReg, SrcSubIdx, DstSubIdx) &&
2590 for (unsigned i = 0, NumOps = MI->getNumOperands(); i != NumOps; ++i) {
2591 MachineOperand &Use = MI->getOperand(i);
2592 if (Use.isReg() && Use.isUse() && Use.getReg() &&
2593 tri_->regsOverlap(Use.getReg(), Reg)) {
2594 UseIdx = li_->getUseIndex(e);
2599 e -= InstrSlots::NUM;
2606 void SimpleRegisterCoalescing::printRegName(unsigned reg) const {
2607 if (TargetRegisterInfo::isPhysicalRegister(reg))
2608 cerr << tri_->getName(reg);
2610 cerr << "%reg" << reg;
2613 void SimpleRegisterCoalescing::releaseMemory() {
2614 JoinedCopies.clear();
2615 ReMatCopies.clear();
2619 static bool isZeroLengthInterval(LiveInterval *li) {
2620 for (LiveInterval::Ranges::const_iterator
2621 i = li->ranges.begin(), e = li->ranges.end(); i != e; ++i)
2622 if (i->end - i->start > LiveInterval::InstrSlots::NUM)
2627 /// TurnCopyIntoImpDef - If source of the specified copy is an implicit def,
2628 /// turn the copy into an implicit def.
2630 SimpleRegisterCoalescing::TurnCopyIntoImpDef(MachineBasicBlock::iterator &I,
2631 MachineBasicBlock *MBB,
2632 unsigned DstReg, unsigned SrcReg) {
2633 MachineInstr *CopyMI = &*I;
2634 unsigned CopyIdx = li_->getDefIndex(li_->getInstructionIndex(CopyMI));
2635 if (!li_->hasInterval(SrcReg))
2637 LiveInterval &SrcInt = li_->getInterval(SrcReg);
2638 if (!SrcInt.empty())
2640 if (!li_->hasInterval(DstReg))
2642 LiveInterval &DstInt = li_->getInterval(DstReg);
2643 const LiveRange *DstLR = DstInt.getLiveRangeContaining(CopyIdx);
2644 DstInt.removeValNo(DstLR->valno);
2645 CopyMI->setDesc(tii_->get(TargetInstrInfo::IMPLICIT_DEF));
2646 for (int i = CopyMI->getNumOperands() - 1, e = 0; i > e; --i)
2647 CopyMI->RemoveOperand(i);
2648 bool NoUse = mri_->use_empty(SrcReg);
2650 for (MachineRegisterInfo::reg_iterator I = mri_->reg_begin(SrcReg),
2651 E = mri_->reg_end(); I != E; ) {
2652 assert(I.getOperand().isDef());
2653 MachineInstr *DefMI = &*I;
2655 // The implicit_def source has no other uses, delete it.
2656 assert(DefMI->getOpcode() == TargetInstrInfo::IMPLICIT_DEF);
2657 li_->RemoveMachineInstrFromMaps(DefMI);
2658 DefMI->eraseFromParent();
2666 bool SimpleRegisterCoalescing::runOnMachineFunction(MachineFunction &fn) {
2668 mri_ = &fn.getRegInfo();
2669 tm_ = &fn.getTarget();
2670 tri_ = tm_->getRegisterInfo();
2671 tii_ = tm_->getInstrInfo();
2672 li_ = &getAnalysis<LiveIntervals>();
2673 loopInfo = &getAnalysis<MachineLoopInfo>();
2675 DOUT << "********** SIMPLE REGISTER COALESCING **********\n"
2676 << "********** Function: "
2677 << ((Value*)mf_->getFunction())->getName() << '\n';
2679 allocatableRegs_ = tri_->getAllocatableSet(fn);
2680 for (TargetRegisterInfo::regclass_iterator I = tri_->regclass_begin(),
2681 E = tri_->regclass_end(); I != E; ++I)
2682 allocatableRCRegs_.insert(std::make_pair(*I,
2683 tri_->getAllocatableSet(fn, *I)));
2685 // Join (coalesce) intervals if requested.
2686 if (EnableJoining) {
2689 DOUT << "********** INTERVALS POST JOINING **********\n";
2690 for (LiveIntervals::iterator I = li_->begin(), E = li_->end(); I != E; ++I){
2691 I->second->print(DOUT, tri_);
2697 // Perform a final pass over the instructions and compute spill weights
2698 // and remove identity moves.
2699 SmallVector<unsigned, 4> DeadDefs;
2700 for (MachineFunction::iterator mbbi = mf_->begin(), mbbe = mf_->end();
2701 mbbi != mbbe; ++mbbi) {
2702 MachineBasicBlock* mbb = mbbi;
2703 unsigned loopDepth = loopInfo->getLoopDepth(mbb);
2705 for (MachineBasicBlock::iterator mii = mbb->begin(), mie = mbb->end();
2707 MachineInstr *MI = mii;
2708 unsigned SrcReg, DstReg, SrcSubIdx, DstSubIdx;
2709 if (JoinedCopies.count(MI)) {
2710 // Delete all coalesced copies.
2711 if (!tii_->isMoveInstr(*MI, SrcReg, DstReg, SrcSubIdx, DstSubIdx)) {
2712 assert((MI->getOpcode() == TargetInstrInfo::EXTRACT_SUBREG ||
2713 MI->getOpcode() == TargetInstrInfo::INSERT_SUBREG ||
2714 MI->getOpcode() == TargetInstrInfo::SUBREG_TO_REG) &&
2715 "Unrecognized copy instruction");
2716 DstReg = MI->getOperand(0).getReg();
2718 if (MI->registerDefIsDead(DstReg)) {
2719 LiveInterval &li = li_->getInterval(DstReg);
2720 if (!ShortenDeadCopySrcLiveRange(li, MI))
2721 ShortenDeadCopyLiveRange(li, MI);
2723 li_->RemoveMachineInstrFromMaps(MI);
2724 mii = mbbi->erase(mii);
2729 // Now check if this is a remat'ed def instruction which is now dead.
2730 if (ReMatDefs.count(MI)) {
2732 for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i) {
2733 const MachineOperand &MO = MI->getOperand(i);
2736 unsigned Reg = MO.getReg();
2739 if (TargetRegisterInfo::isVirtualRegister(Reg))
2740 DeadDefs.push_back(Reg);
2743 if (TargetRegisterInfo::isPhysicalRegister(Reg) ||
2744 !mri_->use_empty(Reg)) {
2750 while (!DeadDefs.empty()) {
2751 unsigned DeadDef = DeadDefs.back();
2752 DeadDefs.pop_back();
2753 RemoveDeadDef(li_->getInterval(DeadDef), MI);
2755 li_->RemoveMachineInstrFromMaps(mii);
2756 mii = mbbi->erase(mii);
2762 // If the move will be an identity move delete it
2763 bool isMove= tii_->isMoveInstr(*MI, SrcReg, DstReg, SrcSubIdx, DstSubIdx);
2764 if (isMove && SrcReg == DstReg) {
2765 if (li_->hasInterval(SrcReg)) {
2766 LiveInterval &RegInt = li_->getInterval(SrcReg);
2767 // If def of this move instruction is dead, remove its live range
2768 // from the dstination register's live interval.
2769 if (MI->registerDefIsDead(DstReg)) {
2770 if (!ShortenDeadCopySrcLiveRange(RegInt, MI))
2771 ShortenDeadCopyLiveRange(RegInt, MI);
2774 li_->RemoveMachineInstrFromMaps(MI);
2775 mii = mbbi->erase(mii);
2777 } else if (!isMove || !TurnCopyIntoImpDef(mii, mbb, DstReg, SrcReg)) {
2778 SmallSet<unsigned, 4> UniqueUses;
2779 for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i) {
2780 const MachineOperand &mop = MI->getOperand(i);
2781 if (mop.isReg() && mop.getReg() &&
2782 TargetRegisterInfo::isVirtualRegister(mop.getReg())) {
2783 unsigned reg = mop.getReg();
2784 // Multiple uses of reg by the same instruction. It should not
2785 // contribute to spill weight again.
2786 if (UniqueUses.count(reg) != 0)
2788 LiveInterval &RegInt = li_->getInterval(reg);
2790 li_->getSpillWeight(mop.isDef(), mop.isUse(), loopDepth);
2791 UniqueUses.insert(reg);
2799 for (LiveIntervals::iterator I = li_->begin(), E = li_->end(); I != E; ++I) {
2800 LiveInterval &LI = *I->second;
2801 if (TargetRegisterInfo::isVirtualRegister(LI.reg)) {
2802 // If the live interval length is essentially zero, i.e. in every live
2803 // range the use follows def immediately, it doesn't make sense to spill
2804 // it and hope it will be easier to allocate for this li.
2805 if (isZeroLengthInterval(&LI))
2806 LI.weight = HUGE_VALF;
2808 bool isLoad = false;
2809 SmallVector<LiveInterval*, 4> SpillIs;
2810 if (li_->isReMaterializable(LI, SpillIs, isLoad)) {
2811 // If all of the definitions of the interval are re-materializable,
2812 // it is a preferred candidate for spilling. If non of the defs are
2813 // loads, then it's potentially very cheap to re-materialize.
2814 // FIXME: this gets much more complicated once we support non-trivial
2815 // re-materialization.
2823 // Slightly prefer live interval that has been assigned a preferred reg.
2824 std::pair<unsigned, unsigned> Hint = mri_->getRegAllocationHint(LI.reg);
2825 if (Hint.first || Hint.second)
2828 // Divide the weight of the interval by its size. This encourages
2829 // spilling of intervals that are large and have few uses, and
2830 // discourages spilling of small intervals with many uses.
2831 LI.weight /= li_->getApproximateInstructionCount(LI) * InstrSlots::NUM;
2839 /// print - Implement the dump method.
2840 void SimpleRegisterCoalescing::print(std::ostream &O, const Module* m) const {
2844 RegisterCoalescer* llvm::createSimpleRegisterCoalescer() {
2845 return new SimpleRegisterCoalescing();
2848 // Make sure that anything that uses RegisterCoalescer pulls in this file...
2849 DEFINING_FILE_FOR(SimpleRegisterCoalescing)