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/Analysis/AliasAnalysis.h"
21 #include "llvm/CodeGen/MachineFrameInfo.h"
22 #include "llvm/CodeGen/MachineInstr.h"
23 #include "llvm/CodeGen/MachineLoopInfo.h"
24 #include "llvm/CodeGen/MachineRegisterInfo.h"
25 #include "llvm/CodeGen/Passes.h"
26 #include "llvm/CodeGen/RegisterCoalescer.h"
27 #include "llvm/Target/TargetInstrInfo.h"
28 #include "llvm/Target/TargetMachine.h"
29 #include "llvm/Target/TargetOptions.h"
30 #include "llvm/Support/CommandLine.h"
31 #include "llvm/Support/Debug.h"
32 #include "llvm/Support/ErrorHandling.h"
33 #include "llvm/Support/raw_ostream.h"
34 #include "llvm/ADT/SmallSet.h"
35 #include "llvm/ADT/Statistic.h"
36 #include "llvm/ADT/STLExtras.h"
41 STATISTIC(numJoins , "Number of interval joins performed");
42 STATISTIC(numCrossRCs , "Number of cross class joins performed");
43 STATISTIC(numCommutes , "Number of instruction commuting performed");
44 STATISTIC(numExtends , "Number of copies extended");
45 STATISTIC(NumReMats , "Number of instructions re-materialized");
46 STATISTIC(numPeep , "Number of identity moves eliminated after coalescing");
47 STATISTIC(numAborts , "Number of times interval joining aborted");
48 STATISTIC(numDeadValNo, "Number of valno def marked dead");
50 char SimpleRegisterCoalescing::ID = 0;
52 EnableJoining("join-liveintervals",
53 cl::desc("Coalesce copies (default=true)"),
57 DisableCrossClassJoin("disable-cross-class-join",
58 cl::desc("Avoid coalescing cross register class copies"),
59 cl::init(false), cl::Hidden);
62 PhysJoinTweak("tweak-phys-join-heuristics",
63 cl::desc("Tweak heuristics for joining phys reg with vr"),
64 cl::init(false), cl::Hidden);
66 static RegisterPass<SimpleRegisterCoalescing>
67 X("simple-register-coalescing", "Simple Register Coalescing");
69 // Declare that we implement the RegisterCoalescer interface
70 static RegisterAnalysisGroup<RegisterCoalescer, true/*The Default*/> V(X);
72 const PassInfo *const llvm::SimpleRegisterCoalescingID = &X;
74 void SimpleRegisterCoalescing::getAnalysisUsage(AnalysisUsage &AU) const {
76 AU.addRequired<AliasAnalysis>();
77 AU.addRequired<LiveIntervals>();
78 AU.addPreserved<LiveIntervals>();
79 AU.addPreserved<SlotIndexes>();
80 AU.addRequired<MachineLoopInfo>();
81 AU.addPreserved<MachineLoopInfo>();
82 AU.addPreservedID(MachineDominatorsID);
84 AU.addPreservedID(StrongPHIEliminationID);
86 AU.addPreservedID(PHIEliminationID);
87 AU.addPreservedID(TwoAddressInstructionPassID);
88 MachineFunctionPass::getAnalysisUsage(AU);
91 /// AdjustCopiesBackFrom - We found a non-trivially-coalescable copy with IntA
92 /// being the source and IntB being the dest, thus this defines a value number
93 /// in IntB. If the source value number (in IntA) is defined by a copy from B,
94 /// see if we can merge these two pieces of B into a single value number,
95 /// eliminating a copy. For example:
99 /// B1 = A3 <- this copy
101 /// In this case, B0 can be extended to where the B1 copy lives, allowing the B1
102 /// value number to be replaced with B0 (which simplifies the B liveinterval).
104 /// This returns true if an interval was modified.
106 bool SimpleRegisterCoalescing::AdjustCopiesBackFrom(LiveInterval &IntA,
108 MachineInstr *CopyMI) {
109 SlotIndex CopyIdx = li_->getInstructionIndex(CopyMI).getDefIndex();
111 // BValNo is a value number in B that is defined by a copy from A. 'B3' in
112 // the example above.
113 LiveInterval::iterator BLR = IntB.FindLiveRangeContaining(CopyIdx);
114 assert(BLR != IntB.end() && "Live range not found!");
115 VNInfo *BValNo = BLR->valno;
117 // Get the location that B is defined at. Two options: either this value has
118 // an unknown definition point or it is defined at CopyIdx. If unknown, we
120 if (!BValNo->getCopy()) return false;
121 assert(BValNo->def == CopyIdx && "Copy doesn't define the value?");
123 // AValNo is the value number in A that defines the copy, A3 in the example.
124 SlotIndex CopyUseIdx = CopyIdx.getUseIndex();
125 LiveInterval::iterator ALR = IntA.FindLiveRangeContaining(CopyUseIdx);
126 assert(ALR != IntA.end() && "Live range not found!");
127 VNInfo *AValNo = ALR->valno;
128 // If it's re-defined by an early clobber somewhere in the live range, then
129 // it's not safe to eliminate the copy. FIXME: This is a temporary workaround.
131 // 172 %ECX<def> = MOV32rr %reg1039<kill>
132 // 180 INLINEASM <es:subl $5,$1
133 // sbbl $3,$0>, 10, %EAX<def>, 14, %ECX<earlyclobber,def>, 9,
135 // 36, <fi#0>, 1, %reg0, 0, 9, %ECX<kill>, 36, <fi#1>, 1, %reg0, 0
136 // 188 %EAX<def> = MOV32rr %EAX<kill>
137 // 196 %ECX<def> = MOV32rr %ECX<kill>
138 // 204 %ECX<def> = MOV32rr %ECX<kill>
139 // 212 %EAX<def> = MOV32rr %EAX<kill>
140 // 220 %EAX<def> = MOV32rr %EAX
141 // 228 %reg1039<def> = MOV32rr %ECX<kill>
142 // The early clobber operand ties ECX input to the ECX def.
144 // The live interval of ECX is represented as this:
145 // %reg20,inf = [46,47:1)[174,230:0) 0@174-(230) 1@46-(47)
146 // The coalescer has no idea there was a def in the middle of [174,230].
147 if (AValNo->hasRedefByEC())
150 // If AValNo is defined as a copy from IntB, we can potentially process this.
151 // Get the instruction that defines this value number.
152 unsigned SrcReg = li_->getVNInfoSourceReg(AValNo);
153 if (!SrcReg) return false; // Not defined by a copy.
155 // If the value number is not defined by a copy instruction, ignore it.
157 // If the source register comes from an interval other than IntB, we can't
159 if (SrcReg != IntB.reg) return false;
161 // Get the LiveRange in IntB that this value number starts with.
162 LiveInterval::iterator ValLR =
163 IntB.FindLiveRangeContaining(AValNo->def.getPrevSlot());
164 assert(ValLR != IntB.end() && "Live range not found!");
166 // Make sure that the end of the live range is inside the same block as
168 MachineInstr *ValLREndInst =
169 li_->getInstructionFromIndex(ValLR->end.getPrevSlot());
171 ValLREndInst->getParent() != CopyMI->getParent()) return false;
173 // Okay, we now know that ValLR ends in the same block that the CopyMI
174 // live-range starts. If there are no intervening live ranges between them in
175 // IntB, we can merge them.
176 if (ValLR+1 != BLR) return false;
178 // If a live interval is a physical register, conservatively check if any
179 // of its sub-registers is overlapping the live interval of the virtual
180 // register. If so, do not coalesce.
181 if (TargetRegisterInfo::isPhysicalRegister(IntB.reg) &&
182 *tri_->getSubRegisters(IntB.reg)) {
183 for (const unsigned* SR = tri_->getSubRegisters(IntB.reg); *SR; ++SR)
184 if (li_->hasInterval(*SR) && IntA.overlaps(li_->getInterval(*SR))) {
186 dbgs() << "Interfere with sub-register ";
187 li_->getInterval(*SR).print(dbgs(), tri_);
194 dbgs() << "\nExtending: ";
195 IntB.print(dbgs(), tri_);
198 SlotIndex FillerStart = ValLR->end, FillerEnd = BLR->start;
199 // We are about to delete CopyMI, so need to remove it as the 'instruction
200 // that defines this value #'. Update the valnum with the new defining
202 BValNo->def = FillerStart;
205 // Okay, we can merge them. We need to insert a new liverange:
206 // [ValLR.end, BLR.begin) of either value number, then we merge the
207 // two value numbers.
208 IntB.addRange(LiveRange(FillerStart, FillerEnd, BValNo));
210 // If the IntB live range is assigned to a physical register, and if that
211 // physreg has sub-registers, update their live intervals as well.
212 if (TargetRegisterInfo::isPhysicalRegister(IntB.reg)) {
213 for (const unsigned *SR = tri_->getSubRegisters(IntB.reg); *SR; ++SR) {
214 LiveInterval &SRLI = li_->getInterval(*SR);
215 SRLI.addRange(LiveRange(FillerStart, FillerEnd,
216 SRLI.getNextValue(FillerStart, 0, true,
217 li_->getVNInfoAllocator())));
221 // Okay, merge "B1" into the same value number as "B0".
222 if (BValNo != ValLR->valno) {
223 IntB.addKills(ValLR->valno, BValNo->kills);
224 IntB.MergeValueNumberInto(BValNo, ValLR->valno);
227 dbgs() << " result = ";
228 IntB.print(dbgs(), tri_);
232 // If the source instruction was killing the source register before the
233 // merge, unset the isKill marker given the live range has been extended.
234 int UIdx = ValLREndInst->findRegisterUseOperandIdx(IntB.reg, true);
236 ValLREndInst->getOperand(UIdx).setIsKill(false);
237 ValLR->valno->removeKill(FillerStart);
240 // If the copy instruction was killing the destination register before the
241 // merge, find the last use and trim the live range. That will also add the
243 if (CopyMI->killsRegister(IntA.reg))
244 TrimLiveIntervalToLastUse(CopyUseIdx, CopyMI->getParent(), IntA, ALR);
250 /// HasOtherReachingDefs - Return true if there are definitions of IntB
251 /// other than BValNo val# that can reach uses of AValno val# of IntA.
252 bool SimpleRegisterCoalescing::HasOtherReachingDefs(LiveInterval &IntA,
256 for (LiveInterval::iterator AI = IntA.begin(), AE = IntA.end();
258 if (AI->valno != AValNo) continue;
259 LiveInterval::Ranges::iterator BI =
260 std::upper_bound(IntB.ranges.begin(), IntB.ranges.end(), AI->start);
261 if (BI != IntB.ranges.begin())
263 for (; BI != IntB.ranges.end() && AI->end >= BI->start; ++BI) {
264 if (BI->valno == BValNo)
266 if (BI->start <= AI->start && BI->end > AI->start)
268 if (BI->start > AI->start && BI->start < AI->end)
276 TransferImplicitOps(MachineInstr *MI, MachineInstr *NewMI) {
277 for (unsigned i = MI->getDesc().getNumOperands(), e = MI->getNumOperands();
279 MachineOperand &MO = MI->getOperand(i);
280 if (MO.isReg() && MO.isImplicit())
281 NewMI->addOperand(MO);
285 /// RemoveCopyByCommutingDef - We found a non-trivially-coalescable copy with
286 /// IntA being the source and IntB being the dest, thus this defines a value
287 /// number in IntB. If the source value number (in IntA) is defined by a
288 /// commutable instruction and its other operand is coalesced to the copy dest
289 /// register, see if we can transform the copy into a noop by commuting the
290 /// definition. For example,
292 /// A3 = op A2 B0<kill>
294 /// B1 = A3 <- this copy
296 /// = op A3 <- more uses
300 /// B2 = op B0 A2<kill>
302 /// B1 = B2 <- now an identify copy
304 /// = op B2 <- more uses
306 /// This returns true if an interval was modified.
308 bool SimpleRegisterCoalescing::RemoveCopyByCommutingDef(LiveInterval &IntA,
310 MachineInstr *CopyMI) {
312 li_->getInstructionIndex(CopyMI).getDefIndex();
314 // FIXME: For now, only eliminate the copy by commuting its def when the
315 // source register is a virtual register. We want to guard against cases
316 // where the copy is a back edge copy and commuting the def lengthen the
317 // live interval of the source register to the entire loop.
318 if (TargetRegisterInfo::isPhysicalRegister(IntA.reg))
321 // BValNo is a value number in B that is defined by a copy from A. 'B3' in
322 // the example above.
323 LiveInterval::iterator BLR = IntB.FindLiveRangeContaining(CopyIdx);
324 assert(BLR != IntB.end() && "Live range not found!");
325 VNInfo *BValNo = BLR->valno;
327 // Get the location that B is defined at. Two options: either this value has
328 // an unknown definition point or it is defined at CopyIdx. If unknown, we
330 if (!BValNo->getCopy()) return false;
331 assert(BValNo->def == CopyIdx && "Copy doesn't define the value?");
333 // AValNo is the value number in A that defines the copy, A3 in the example.
334 LiveInterval::iterator ALR =
335 IntA.FindLiveRangeContaining(CopyIdx.getUseIndex()); //
337 assert(ALR != IntA.end() && "Live range not found!");
338 VNInfo *AValNo = ALR->valno;
339 // If other defs can reach uses of this def, then it's not safe to perform
340 // the optimization. FIXME: Do isPHIDef and isDefAccurate both need to be
342 if (AValNo->isPHIDef() || !AValNo->isDefAccurate() ||
343 AValNo->isUnused() || AValNo->hasPHIKill())
345 MachineInstr *DefMI = li_->getInstructionFromIndex(AValNo->def);
346 const TargetInstrDesc &TID = DefMI->getDesc();
347 if (!TID.isCommutable())
349 // If DefMI is a two-address instruction then commuting it will change the
350 // destination register.
351 int DefIdx = DefMI->findRegisterDefOperandIdx(IntA.reg);
352 assert(DefIdx != -1);
354 if (!DefMI->isRegTiedToUseOperand(DefIdx, &UseOpIdx))
356 unsigned Op1, Op2, NewDstIdx;
357 if (!tii_->findCommutedOpIndices(DefMI, Op1, Op2))
361 else if (Op2 == UseOpIdx)
366 MachineOperand &NewDstMO = DefMI->getOperand(NewDstIdx);
367 unsigned NewReg = NewDstMO.getReg();
368 if (NewReg != IntB.reg || !NewDstMO.isKill())
371 // Make sure there are no other definitions of IntB that would reach the
372 // uses which the new definition can reach.
373 if (HasOtherReachingDefs(IntA, IntB, AValNo, BValNo))
376 // If some of the uses of IntA.reg is already coalesced away, return false.
377 // It's not possible to determine whether it's safe to perform the coalescing.
378 for (MachineRegisterInfo::use_nodbg_iterator UI =
379 mri_->use_nodbg_begin(IntA.reg),
380 UE = mri_->use_nodbg_end(); UI != UE; ++UI) {
381 MachineInstr *UseMI = &*UI;
382 SlotIndex UseIdx = li_->getInstructionIndex(UseMI);
383 LiveInterval::iterator ULR = IntA.FindLiveRangeContaining(UseIdx);
384 if (ULR == IntA.end())
386 if (ULR->valno == AValNo && JoinedCopies.count(UseMI))
390 // At this point we have decided that it is legal to do this
391 // transformation. Start by commuting the instruction.
392 MachineBasicBlock *MBB = DefMI->getParent();
393 MachineInstr *NewMI = tii_->commuteInstruction(DefMI);
396 if (NewMI != DefMI) {
397 li_->ReplaceMachineInstrInMaps(DefMI, NewMI);
398 MBB->insert(DefMI, NewMI);
401 unsigned OpIdx = NewMI->findRegisterUseOperandIdx(IntA.reg, false);
402 NewMI->getOperand(OpIdx).setIsKill();
404 bool BHasPHIKill = BValNo->hasPHIKill();
405 SmallVector<VNInfo*, 4> BDeadValNos;
406 VNInfo::KillSet BKills;
407 std::map<SlotIndex, SlotIndex> BExtend;
409 // If ALR and BLR overlaps and end of BLR extends beyond end of ALR, e.g.
418 // then do not add kills of A to the newly created B interval.
419 bool Extended = BLR->end > ALR->end && ALR->end != ALR->start;
421 BExtend[ALR->end] = BLR->end;
423 // Update uses of IntA of the specific Val# with IntB.
424 bool BHasSubRegs = false;
425 if (TargetRegisterInfo::isPhysicalRegister(IntB.reg))
426 BHasSubRegs = *tri_->getSubRegisters(IntB.reg);
427 for (MachineRegisterInfo::use_iterator UI = mri_->use_begin(IntA.reg),
428 UE = mri_->use_end(); UI != UE;) {
429 MachineOperand &UseMO = UI.getOperand();
430 MachineInstr *UseMI = &*UI;
432 if (JoinedCopies.count(UseMI))
434 if (UseMI->isDebugValue()) {
435 // FIXME These don't have an instruction index. Not clear we have enough
436 // info to decide whether to do this replacement or not. For now do it.
437 UseMO.setReg(NewReg);
440 SlotIndex UseIdx = li_->getInstructionIndex(UseMI).getUseIndex();
441 LiveInterval::iterator ULR = IntA.FindLiveRangeContaining(UseIdx);
442 if (ULR == IntA.end() || ULR->valno != AValNo)
444 UseMO.setReg(NewReg);
447 if (UseMO.isKill()) {
449 UseMO.setIsKill(false);
451 BKills.push_back(UseIdx.getDefIndex());
453 unsigned SrcReg, DstReg, SrcSubIdx, DstSubIdx;
454 if (!tii_->isMoveInstr(*UseMI, SrcReg, DstReg, SrcSubIdx, DstSubIdx))
456 if (DstReg == IntB.reg) {
457 // This copy will become a noop. If it's defining a new val#,
458 // remove that val# as well. However this live range is being
459 // extended to the end of the existing live range defined by the copy.
460 SlotIndex DefIdx = UseIdx.getDefIndex();
461 const LiveRange *DLR = IntB.getLiveRangeContaining(DefIdx);
462 BHasPHIKill |= DLR->valno->hasPHIKill();
463 assert(DLR->valno->def == DefIdx);
464 BDeadValNos.push_back(DLR->valno);
465 BExtend[DLR->start] = DLR->end;
466 JoinedCopies.insert(UseMI);
467 // If this is a kill but it's going to be removed, the last use
468 // of the same val# is the new kill.
474 // We need to insert a new liverange: [ALR.start, LastUse). It may be we can
475 // simply extend BLR if CopyMI doesn't end the range.
477 dbgs() << "\nExtending: ";
478 IntB.print(dbgs(), tri_);
481 // Remove val#'s defined by copies that will be coalesced away.
482 for (unsigned i = 0, e = BDeadValNos.size(); i != e; ++i) {
483 VNInfo *DeadVNI = BDeadValNos[i];
485 for (const unsigned *SR = tri_->getSubRegisters(IntB.reg); *SR; ++SR) {
486 LiveInterval &SRLI = li_->getInterval(*SR);
487 const LiveRange *SRLR = SRLI.getLiveRangeContaining(DeadVNI->def);
488 SRLI.removeValNo(SRLR->valno);
491 IntB.removeValNo(BDeadValNos[i]);
494 // Extend BValNo by merging in IntA live ranges of AValNo. Val# definition
495 // is updated. Kills are also updated.
496 VNInfo *ValNo = BValNo;
497 ValNo->def = AValNo->def;
499 for (unsigned j = 0, ee = ValNo->kills.size(); j != ee; ++j) {
500 if (ValNo->kills[j] != BLR->end)
501 BKills.push_back(ValNo->kills[j]);
503 ValNo->kills.clear();
504 for (LiveInterval::iterator AI = IntA.begin(), AE = IntA.end();
506 if (AI->valno != AValNo) continue;
507 SlotIndex End = AI->end;
508 std::map<SlotIndex, SlotIndex>::iterator
509 EI = BExtend.find(End);
510 if (EI != BExtend.end())
512 IntB.addRange(LiveRange(AI->start, End, ValNo));
514 // If the IntB live range is assigned to a physical register, and if that
515 // physreg has sub-registers, update their live intervals as well.
517 for (const unsigned *SR = tri_->getSubRegisters(IntB.reg); *SR; ++SR) {
518 LiveInterval &SRLI = li_->getInterval(*SR);
519 SRLI.MergeInClobberRange(*li_, AI->start, End,
520 li_->getVNInfoAllocator());
524 IntB.addKills(ValNo, BKills);
525 ValNo->setHasPHIKill(BHasPHIKill);
528 dbgs() << " result = ";
529 IntB.print(dbgs(), tri_);
531 dbgs() << "\nShortening: ";
532 IntA.print(dbgs(), tri_);
535 IntA.removeValNo(AValNo);
538 dbgs() << " result = ";
539 IntA.print(dbgs(), tri_);
547 /// isSameOrFallThroughBB - Return true if MBB == SuccMBB or MBB simply
548 /// fallthoughs to SuccMBB.
549 static bool isSameOrFallThroughBB(MachineBasicBlock *MBB,
550 MachineBasicBlock *SuccMBB,
551 const TargetInstrInfo *tii_) {
554 MachineBasicBlock *TBB = 0, *FBB = 0;
555 SmallVector<MachineOperand, 4> Cond;
556 return !tii_->AnalyzeBranch(*MBB, TBB, FBB, Cond) && !TBB && !FBB &&
557 MBB->isSuccessor(SuccMBB);
560 /// removeRange - Wrapper for LiveInterval::removeRange. This removes a range
561 /// from a physical register live interval as well as from the live intervals
562 /// of its sub-registers.
563 static void removeRange(LiveInterval &li,
564 SlotIndex Start, SlotIndex End,
565 LiveIntervals *li_, const TargetRegisterInfo *tri_) {
566 li.removeRange(Start, End, true);
567 if (TargetRegisterInfo::isPhysicalRegister(li.reg)) {
568 for (const unsigned* SR = tri_->getSubRegisters(li.reg); *SR; ++SR) {
569 if (!li_->hasInterval(*SR))
571 LiveInterval &sli = li_->getInterval(*SR);
572 SlotIndex RemoveStart = Start;
573 SlotIndex RemoveEnd = Start;
575 while (RemoveEnd != End) {
576 LiveInterval::iterator LR = sli.FindLiveRangeContaining(RemoveStart);
579 RemoveEnd = (LR->end < End) ? LR->end : End;
580 sli.removeRange(RemoveStart, RemoveEnd, true);
581 RemoveStart = RemoveEnd;
587 /// TrimLiveIntervalToLastUse - If there is a last use in the same basic block
588 /// as the copy instruction, trim the live interval to the last use and return
591 SimpleRegisterCoalescing::TrimLiveIntervalToLastUse(SlotIndex CopyIdx,
592 MachineBasicBlock *CopyMBB,
594 const LiveRange *LR) {
595 SlotIndex MBBStart = li_->getMBBStartIdx(CopyMBB);
596 SlotIndex LastUseIdx;
597 MachineOperand *LastUse =
598 lastRegisterUse(LR->start, CopyIdx.getPrevSlot(), li.reg, LastUseIdx);
600 MachineInstr *LastUseMI = LastUse->getParent();
601 if (!isSameOrFallThroughBB(LastUseMI->getParent(), CopyMBB, tii_)) {
608 // r1025<dead> = r1024<kill>
609 if (MBBStart < LR->end)
610 removeRange(li, MBBStart, LR->end, li_, tri_);
614 // There are uses before the copy, just shorten the live range to the end
616 LastUse->setIsKill();
617 removeRange(li, LastUseIdx.getDefIndex(), LR->end, li_, tri_);
618 LR->valno->addKill(LastUseIdx.getDefIndex());
619 unsigned SrcReg, DstReg, SrcSubIdx, DstSubIdx;
620 if (tii_->isMoveInstr(*LastUseMI, SrcReg, DstReg, SrcSubIdx, DstSubIdx) &&
622 // Last use is itself an identity code.
623 int DeadIdx = LastUseMI->findRegisterDefOperandIdx(li.reg, false, tri_);
624 LastUseMI->getOperand(DeadIdx).setIsDead();
630 if (LR->start <= MBBStart && LR->end > MBBStart) {
631 if (LR->start == li_->getZeroIndex()) {
632 assert(TargetRegisterInfo::isPhysicalRegister(li.reg));
633 // Live-in to the function but dead. Remove it from entry live-in set.
634 mf_->begin()->removeLiveIn(li.reg);
636 // FIXME: Shorten intervals in BBs that reaches this BB.
642 /// ReMaterializeTrivialDef - If the source of a copy is defined by a trivial
643 /// computation, replace the copy by rematerialize the definition.
644 bool SimpleRegisterCoalescing::ReMaterializeTrivialDef(LiveInterval &SrcInt,
647 MachineInstr *CopyMI) {
648 SlotIndex CopyIdx = li_->getInstructionIndex(CopyMI).getUseIndex();
649 LiveInterval::iterator SrcLR = SrcInt.FindLiveRangeContaining(CopyIdx);
650 assert(SrcLR != SrcInt.end() && "Live range not found!");
651 VNInfo *ValNo = SrcLR->valno;
652 // If other defs can reach uses of this def, then it's not safe to perform
653 // the optimization. FIXME: Do isPHIDef and isDefAccurate both need to be
655 if (ValNo->isPHIDef() || !ValNo->isDefAccurate() ||
656 ValNo->isUnused() || ValNo->hasPHIKill())
658 MachineInstr *DefMI = li_->getInstructionFromIndex(ValNo->def);
659 const TargetInstrDesc &TID = DefMI->getDesc();
660 if (!TID.isAsCheapAsAMove())
662 if (!tii_->isTriviallyReMaterializable(DefMI, AA))
664 bool SawStore = false;
665 if (!DefMI->isSafeToMove(tii_, SawStore, AA))
667 if (TID.getNumDefs() != 1)
669 if (!DefMI->isImplicitDef()) {
670 // Make sure the copy destination register class fits the instruction
671 // definition register class. The mismatch can happen as a result of earlier
672 // extract_subreg, insert_subreg, subreg_to_reg coalescing.
673 const TargetRegisterClass *RC = TID.OpInfo[0].getRegClass(tri_);
674 if (TargetRegisterInfo::isVirtualRegister(DstReg)) {
675 if (mri_->getRegClass(DstReg) != RC)
677 } else if (!RC->contains(DstReg))
681 // If destination register has a sub-register index on it, make sure it mtches
682 // the instruction register class.
684 const TargetInstrDesc &TID = DefMI->getDesc();
685 if (TID.getNumDefs() != 1)
687 const TargetRegisterClass *DstRC = mri_->getRegClass(DstReg);
688 const TargetRegisterClass *DstSubRC =
689 DstRC->getSubRegisterRegClass(DstSubIdx);
690 const TargetRegisterClass *DefRC = TID.OpInfo[0].getRegClass(tri_);
693 else if (DefRC != DstSubRC)
697 SlotIndex DefIdx = CopyIdx.getDefIndex();
698 const LiveRange *DLR= li_->getInterval(DstReg).getLiveRangeContaining(DefIdx);
699 DLR->valno->setCopy(0);
700 // Don't forget to update sub-register intervals.
701 if (TargetRegisterInfo::isPhysicalRegister(DstReg)) {
702 for (const unsigned* SR = tri_->getSubRegisters(DstReg); *SR; ++SR) {
703 if (!li_->hasInterval(*SR))
705 DLR = li_->getInterval(*SR).getLiveRangeContaining(DefIdx);
706 if (DLR && DLR->valno->getCopy() == CopyMI)
707 DLR->valno->setCopy(0);
711 // If copy kills the source register, find the last use and propagate
713 bool checkForDeadDef = false;
714 MachineBasicBlock *MBB = CopyMI->getParent();
715 if (CopyMI->killsRegister(SrcInt.reg))
716 if (!TrimLiveIntervalToLastUse(CopyIdx, MBB, SrcInt, SrcLR)) {
717 checkForDeadDef = true;
720 MachineBasicBlock::iterator MII =
721 llvm::next(MachineBasicBlock::iterator(CopyMI));
722 tii_->reMaterialize(*MBB, MII, DstReg, DstSubIdx, DefMI, tri_);
723 MachineInstr *NewMI = prior(MII);
725 if (checkForDeadDef) {
726 // PR4090 fix: Trim interval failed because there was no use of the
727 // source interval in this MBB. If the def is in this MBB too then we
728 // should mark it dead:
729 if (DefMI->getParent() == MBB) {
730 DefMI->addRegisterDead(SrcInt.reg, tri_);
731 SrcLR->end = SrcLR->start.getNextSlot();
735 // CopyMI may have implicit operands, transfer them over to the newly
736 // rematerialized instruction. And update implicit def interval valnos.
737 for (unsigned i = CopyMI->getDesc().getNumOperands(),
738 e = CopyMI->getNumOperands(); i != e; ++i) {
739 MachineOperand &MO = CopyMI->getOperand(i);
740 if (MO.isReg() && MO.isImplicit())
741 NewMI->addOperand(MO);
742 if (MO.isDef() && li_->hasInterval(MO.getReg())) {
743 unsigned Reg = MO.getReg();
744 DLR = li_->getInterval(Reg).getLiveRangeContaining(DefIdx);
745 if (DLR && DLR->valno->getCopy() == CopyMI)
746 DLR->valno->setCopy(0);
750 TransferImplicitOps(CopyMI, NewMI);
751 li_->ReplaceMachineInstrInMaps(CopyMI, NewMI);
752 CopyMI->eraseFromParent();
753 ReMatCopies.insert(CopyMI);
754 ReMatDefs.insert(DefMI);
759 /// UpdateRegDefsUses - Replace all defs and uses of SrcReg to DstReg and
760 /// update the subregister number if it is not zero. If DstReg is a
761 /// physical register and the existing subregister number of the def / use
762 /// being updated is not zero, make sure to set it to the correct physical
765 SimpleRegisterCoalescing::UpdateRegDefsUses(unsigned SrcReg, unsigned DstReg,
767 bool DstIsPhys = TargetRegisterInfo::isPhysicalRegister(DstReg);
768 if (DstIsPhys && SubIdx) {
769 // Figure out the real physical register we are updating with.
770 DstReg = tri_->getSubReg(DstReg, SubIdx);
774 for (MachineRegisterInfo::reg_iterator I = mri_->reg_begin(SrcReg),
775 E = mri_->reg_end(); I != E; ) {
776 MachineOperand &O = I.getOperand();
777 MachineInstr *UseMI = &*I;
779 unsigned OldSubIdx = O.getSubReg();
781 unsigned UseDstReg = DstReg;
783 UseDstReg = tri_->getSubReg(DstReg, OldSubIdx);
785 unsigned CopySrcReg, CopyDstReg, CopySrcSubIdx, CopyDstSubIdx;
786 if (tii_->isMoveInstr(*UseMI, CopySrcReg, CopyDstReg,
787 CopySrcSubIdx, CopyDstSubIdx) &&
788 CopySrcReg != CopyDstReg &&
789 CopySrcReg == SrcReg && CopyDstReg != UseDstReg) {
790 // If the use is a copy and it won't be coalesced away, and its source
791 // is defined by a trivial computation, try to rematerialize it instead.
792 if (ReMaterializeTrivialDef(li_->getInterval(SrcReg), CopyDstReg,
793 CopyDstSubIdx, UseMI))
802 // Sub-register indexes goes from small to large. e.g.
803 // RAX: 1 -> AL, 2 -> AX, 3 -> EAX
804 // EAX: 1 -> AL, 2 -> AX
805 // So RAX's sub-register 2 is AX, RAX's sub-regsiter 3 is EAX, whose
806 // sub-register 2 is also AX.
807 if (SubIdx && OldSubIdx && SubIdx != OldSubIdx)
808 assert(OldSubIdx < SubIdx && "Conflicting sub-register index!");
811 // Remove would-be duplicated kill marker.
812 if (O.isKill() && UseMI->killsRegister(DstReg))
816 // After updating the operand, check if the machine instruction has
817 // become a copy. If so, update its val# information.
818 if (JoinedCopies.count(UseMI))
821 const TargetInstrDesc &TID = UseMI->getDesc();
822 unsigned CopySrcReg, CopyDstReg, CopySrcSubIdx, CopyDstSubIdx;
823 if (TID.getNumDefs() == 1 && TID.getNumOperands() > 2 &&
824 tii_->isMoveInstr(*UseMI, CopySrcReg, CopyDstReg,
825 CopySrcSubIdx, CopyDstSubIdx) &&
826 CopySrcReg != CopyDstReg &&
827 (TargetRegisterInfo::isVirtualRegister(CopyDstReg) ||
828 allocatableRegs_[CopyDstReg])) {
829 LiveInterval &LI = li_->getInterval(CopyDstReg);
831 li_->getInstructionIndex(UseMI).getDefIndex();
832 if (const LiveRange *DLR = LI.getLiveRangeContaining(DefIdx)) {
833 if (DLR->valno->def == DefIdx)
834 DLR->valno->setCopy(UseMI);
840 /// RemoveUnnecessaryKills - Remove kill markers that are no longer accurate
841 /// due to live range lengthening as the result of coalescing.
842 void SimpleRegisterCoalescing::RemoveUnnecessaryKills(unsigned Reg,
844 for (MachineRegisterInfo::use_iterator UI = mri_->use_begin(Reg),
845 UE = mri_->use_end(); UI != UE; ++UI) {
846 MachineOperand &UseMO = UI.getOperand();
849 MachineInstr *UseMI = UseMO.getParent();
851 li_->getInstructionIndex(UseMI).getUseIndex();
852 const LiveRange *LR = LI.getLiveRangeContaining(UseIdx);
854 (!LR->valno->isKill(UseIdx.getDefIndex()) &&
855 LR->valno->def != UseIdx.getDefIndex())) {
856 // Interesting problem. After coalescing reg1027's def and kill are both
857 // at the same point: %reg1027,0.000000e+00 = [56,814:0) 0@70-(814)
860 // 60 %reg1027<def> = t2MOVr %reg1027, 14, %reg0, %reg0
861 // 68 %reg1027<def> = t2LDRi12 %reg1027<kill>, 8, 14, %reg0
862 // 76 t2CMPzri %reg1038<kill,undef>, 0, 14, %reg0, %CPSR<imp-def>
863 // 84 %reg1027<def> = t2MOVr %reg1027, 14, %reg0, %reg0
864 // 96 t2Bcc mbb<bb5,0x2030910>, 1, %CPSR<kill>
866 // Do not remove the kill marker on t2LDRi12.
867 UseMO.setIsKill(false);
872 /// removeIntervalIfEmpty - Check if the live interval of a physical register
873 /// is empty, if so remove it and also remove the empty intervals of its
874 /// sub-registers. Return true if live interval is removed.
875 static bool removeIntervalIfEmpty(LiveInterval &li, LiveIntervals *li_,
876 const TargetRegisterInfo *tri_) {
878 if (TargetRegisterInfo::isPhysicalRegister(li.reg))
879 for (const unsigned* SR = tri_->getSubRegisters(li.reg); *SR; ++SR) {
880 if (!li_->hasInterval(*SR))
882 LiveInterval &sli = li_->getInterval(*SR);
884 li_->removeInterval(*SR);
886 li_->removeInterval(li.reg);
892 /// ShortenDeadCopyLiveRange - Shorten a live range defined by a dead copy.
893 /// Return true if live interval is removed.
894 bool SimpleRegisterCoalescing::ShortenDeadCopyLiveRange(LiveInterval &li,
895 MachineInstr *CopyMI) {
896 SlotIndex CopyIdx = li_->getInstructionIndex(CopyMI);
897 LiveInterval::iterator MLR =
898 li.FindLiveRangeContaining(CopyIdx.getDefIndex());
900 return false; // Already removed by ShortenDeadCopySrcLiveRange.
901 SlotIndex RemoveStart = MLR->start;
902 SlotIndex RemoveEnd = MLR->end;
903 SlotIndex DefIdx = CopyIdx.getDefIndex();
904 // Remove the liverange that's defined by this.
905 if (RemoveStart == DefIdx && RemoveEnd == DefIdx.getStoreIndex()) {
906 removeRange(li, RemoveStart, RemoveEnd, li_, tri_);
907 return removeIntervalIfEmpty(li, li_, tri_);
912 /// RemoveDeadDef - If a def of a live interval is now determined dead, remove
913 /// the val# it defines. If the live interval becomes empty, remove it as well.
914 bool SimpleRegisterCoalescing::RemoveDeadDef(LiveInterval &li,
915 MachineInstr *DefMI) {
916 SlotIndex DefIdx = li_->getInstructionIndex(DefMI).getDefIndex();
917 LiveInterval::iterator MLR = li.FindLiveRangeContaining(DefIdx);
918 if (DefIdx != MLR->valno->def)
920 li.removeValNo(MLR->valno);
921 return removeIntervalIfEmpty(li, li_, tri_);
924 /// PropagateDeadness - Propagate the dead marker to the instruction which
925 /// defines the val#.
926 static void PropagateDeadness(LiveInterval &li, MachineInstr *CopyMI,
927 SlotIndex &LRStart, LiveIntervals *li_,
928 const TargetRegisterInfo* tri_) {
929 MachineInstr *DefMI =
930 li_->getInstructionFromIndex(LRStart.getDefIndex());
931 if (DefMI && DefMI != CopyMI) {
932 int DeadIdx = DefMI->findRegisterDefOperandIdx(li.reg, false);
934 DefMI->getOperand(DeadIdx).setIsDead();
936 DefMI->addOperand(MachineOperand::CreateReg(li.reg,
937 /*def*/true, /*implicit*/true, /*kill*/false, /*dead*/true));
938 LRStart = LRStart.getNextSlot();
942 /// ShortenDeadCopySrcLiveRange - Shorten a live range as it's artificially
943 /// extended by a dead copy. Mark the last use (if any) of the val# as kill as
944 /// ends the live range there. If there isn't another use, then this live range
945 /// is dead. Return true if live interval is removed.
947 SimpleRegisterCoalescing::ShortenDeadCopySrcLiveRange(LiveInterval &li,
948 MachineInstr *CopyMI) {
949 SlotIndex CopyIdx = li_->getInstructionIndex(CopyMI);
950 if (CopyIdx == SlotIndex()) {
951 // FIXME: special case: function live in. It can be a general case if the
952 // first instruction index starts at > 0 value.
953 assert(TargetRegisterInfo::isPhysicalRegister(li.reg));
954 // Live-in to the function but dead. Remove it from entry live-in set.
955 if (mf_->begin()->isLiveIn(li.reg))
956 mf_->begin()->removeLiveIn(li.reg);
957 const LiveRange *LR = li.getLiveRangeContaining(CopyIdx);
958 removeRange(li, LR->start, LR->end, li_, tri_);
959 return removeIntervalIfEmpty(li, li_, tri_);
962 LiveInterval::iterator LR =
963 li.FindLiveRangeContaining(CopyIdx.getPrevIndex().getStoreIndex());
965 // Livein but defined by a phi.
968 SlotIndex RemoveStart = LR->start;
969 SlotIndex RemoveEnd = CopyIdx.getStoreIndex();
970 if (LR->end > RemoveEnd)
971 // More uses past this copy? Nothing to do.
974 // If there is a last use in the same bb, we can't remove the live range.
975 // Shorten the live interval and return.
976 MachineBasicBlock *CopyMBB = CopyMI->getParent();
977 if (TrimLiveIntervalToLastUse(CopyIdx, CopyMBB, li, LR))
980 // There are other kills of the val#. Nothing to do.
981 if (!li.isOnlyLROfValNo(LR))
984 MachineBasicBlock *StartMBB = li_->getMBBFromIndex(RemoveStart);
985 if (!isSameOrFallThroughBB(StartMBB, CopyMBB, tii_))
986 // If the live range starts in another mbb and the copy mbb is not a fall
987 // through mbb, then we can only cut the range from the beginning of the
989 RemoveStart = li_->getMBBStartIdx(CopyMBB).getNextIndex().getBaseIndex();
991 if (LR->valno->def == RemoveStart) {
992 // If the def MI defines the val# and this copy is the only kill of the
993 // val#, then propagate the dead marker.
994 PropagateDeadness(li, CopyMI, RemoveStart, li_, tri_);
997 if (LR->valno->isKill(RemoveEnd))
998 LR->valno->removeKill(RemoveEnd);
1001 removeRange(li, RemoveStart, RemoveEnd, li_, tri_);
1002 return removeIntervalIfEmpty(li, li_, tri_);
1005 /// CanCoalesceWithImpDef - Returns true if the specified copy instruction
1006 /// from an implicit def to another register can be coalesced away.
1007 bool SimpleRegisterCoalescing::CanCoalesceWithImpDef(MachineInstr *CopyMI,
1009 LiveInterval &ImpLi) const{
1010 if (!CopyMI->killsRegister(ImpLi.reg))
1012 // Make sure this is the only use.
1013 for (MachineRegisterInfo::use_iterator UI = mri_->use_begin(ImpLi.reg),
1014 UE = mri_->use_end(); UI != UE;) {
1015 MachineInstr *UseMI = &*UI;
1017 if (CopyMI == UseMI || JoinedCopies.count(UseMI))
1025 /// isWinToJoinVRWithSrcPhysReg - Return true if it's worth while to join a
1026 /// a virtual destination register with physical source register.
1028 SimpleRegisterCoalescing::isWinToJoinVRWithSrcPhysReg(MachineInstr *CopyMI,
1029 MachineBasicBlock *CopyMBB,
1030 LiveInterval &DstInt,
1031 LiveInterval &SrcInt) {
1032 // If the virtual register live interval is long but it has low use desity,
1033 // do not join them, instead mark the physical register as its allocation
1035 const TargetRegisterClass *RC = mri_->getRegClass(DstInt.reg);
1036 unsigned Threshold = allocatableRCRegs_[RC].count() * 2;
1037 unsigned Length = li_->getApproximateInstructionCount(DstInt);
1038 if (Length > Threshold &&
1039 (((float)std::distance(mri_->use_nodbg_begin(DstInt.reg),
1040 mri_->use_nodbg_end()) / Length) <
1044 // If the virtual register live interval extends into a loop, turn down
1047 li_->getInstructionIndex(CopyMI).getDefIndex();
1048 const MachineLoop *L = loopInfo->getLoopFor(CopyMBB);
1050 // Let's see if the virtual register live interval extends into the loop.
1051 LiveInterval::iterator DLR = DstInt.FindLiveRangeContaining(CopyIdx);
1052 assert(DLR != DstInt.end() && "Live range not found!");
1053 DLR = DstInt.FindLiveRangeContaining(DLR->end.getNextSlot());
1054 if (DLR != DstInt.end()) {
1055 CopyMBB = li_->getMBBFromIndex(DLR->start);
1056 L = loopInfo->getLoopFor(CopyMBB);
1060 if (!L || Length <= Threshold)
1063 SlotIndex UseIdx = CopyIdx.getUseIndex();
1064 LiveInterval::iterator SLR = SrcInt.FindLiveRangeContaining(UseIdx);
1065 MachineBasicBlock *SMBB = li_->getMBBFromIndex(SLR->start);
1066 if (loopInfo->getLoopFor(SMBB) != L) {
1067 if (!loopInfo->isLoopHeader(CopyMBB))
1069 // If vr's live interval extends pass the loop header, do not join.
1070 for (MachineBasicBlock::succ_iterator SI = CopyMBB->succ_begin(),
1071 SE = CopyMBB->succ_end(); SI != SE; ++SI) {
1072 MachineBasicBlock *SuccMBB = *SI;
1073 if (SuccMBB == CopyMBB)
1075 if (DstInt.overlaps(li_->getMBBStartIdx(SuccMBB),
1076 li_->getMBBEndIdx(SuccMBB)))
1083 /// isWinToJoinVRWithDstPhysReg - Return true if it's worth while to join a
1084 /// copy from a virtual source register to a physical destination register.
1086 SimpleRegisterCoalescing::isWinToJoinVRWithDstPhysReg(MachineInstr *CopyMI,
1087 MachineBasicBlock *CopyMBB,
1088 LiveInterval &DstInt,
1089 LiveInterval &SrcInt) {
1090 // If the virtual register live interval is long but it has low use density,
1091 // do not join them, instead mark the physical register as its allocation
1093 const TargetRegisterClass *RC = mri_->getRegClass(SrcInt.reg);
1094 unsigned Threshold = allocatableRCRegs_[RC].count() * 2;
1095 unsigned Length = li_->getApproximateInstructionCount(SrcInt);
1096 if (Length > Threshold &&
1097 (((float)std::distance(mri_->use_nodbg_begin(SrcInt.reg),
1098 mri_->use_nodbg_end()) / Length) <
1103 // Must be implicit_def.
1106 // If the virtual register live interval is defined or cross a loop, turn
1107 // down aggressiveness.
1109 li_->getInstructionIndex(CopyMI).getDefIndex();
1110 SlotIndex UseIdx = CopyIdx.getUseIndex();
1111 LiveInterval::iterator SLR = SrcInt.FindLiveRangeContaining(UseIdx);
1112 assert(SLR != SrcInt.end() && "Live range not found!");
1113 SLR = SrcInt.FindLiveRangeContaining(SLR->start.getPrevSlot());
1114 if (SLR == SrcInt.end())
1116 MachineBasicBlock *SMBB = li_->getMBBFromIndex(SLR->start);
1117 const MachineLoop *L = loopInfo->getLoopFor(SMBB);
1119 if (!L || Length <= Threshold)
1122 if (loopInfo->getLoopFor(CopyMBB) != L) {
1123 if (SMBB != L->getLoopLatch())
1125 // If vr's live interval is extended from before the loop latch, do not
1127 for (MachineBasicBlock::pred_iterator PI = SMBB->pred_begin(),
1128 PE = SMBB->pred_end(); PI != PE; ++PI) {
1129 MachineBasicBlock *PredMBB = *PI;
1130 if (PredMBB == SMBB)
1132 if (SrcInt.overlaps(li_->getMBBStartIdx(PredMBB),
1133 li_->getMBBEndIdx(PredMBB)))
1140 /// isWinToJoinCrossClass - Return true if it's profitable to coalesce
1141 /// two virtual registers from different register classes.
1143 SimpleRegisterCoalescing::isWinToJoinCrossClass(unsigned LargeReg,
1145 unsigned Threshold) {
1146 // Then make sure the intervals are *short*.
1147 LiveInterval &LargeInt = li_->getInterval(LargeReg);
1148 LiveInterval &SmallInt = li_->getInterval(SmallReg);
1149 unsigned LargeSize = li_->getApproximateInstructionCount(LargeInt);
1150 unsigned SmallSize = li_->getApproximateInstructionCount(SmallInt);
1151 if (LargeSize > Threshold) {
1152 unsigned SmallUses = std::distance(mri_->use_nodbg_begin(SmallReg),
1153 mri_->use_nodbg_end());
1154 unsigned LargeUses = std::distance(mri_->use_nodbg_begin(LargeReg),
1155 mri_->use_nodbg_end());
1156 if (SmallUses*LargeSize < LargeUses*SmallSize)
1162 /// HasIncompatibleSubRegDefUse - If we are trying to coalesce a virtual
1163 /// register with a physical register, check if any of the virtual register
1164 /// operand is a sub-register use or def. If so, make sure it won't result
1165 /// in an illegal extract_subreg or insert_subreg instruction. e.g.
1166 /// vr1024 = extract_subreg vr1025, 1
1168 /// vr1024 = mov8rr AH
1169 /// If vr1024 is coalesced with AH, the extract_subreg is now illegal since
1170 /// AH does not have a super-reg whose sub-register 1 is AH.
1172 SimpleRegisterCoalescing::HasIncompatibleSubRegDefUse(MachineInstr *CopyMI,
1175 for (MachineRegisterInfo::reg_iterator I = mri_->reg_begin(VirtReg),
1176 E = mri_->reg_end(); I != E; ++I) {
1177 MachineOperand &O = I.getOperand();
1180 MachineInstr *MI = &*I;
1181 if (MI == CopyMI || JoinedCopies.count(MI))
1183 unsigned SubIdx = O.getSubReg();
1184 if (SubIdx && !tri_->getSubReg(PhysReg, SubIdx))
1186 if (MI->isExtractSubreg()) {
1187 SubIdx = MI->getOperand(2).getImm();
1188 if (O.isUse() && !tri_->getSubReg(PhysReg, SubIdx))
1191 unsigned SrcReg = MI->getOperand(1).getReg();
1192 const TargetRegisterClass *RC =
1193 TargetRegisterInfo::isPhysicalRegister(SrcReg)
1194 ? tri_->getPhysicalRegisterRegClass(SrcReg)
1195 : mri_->getRegClass(SrcReg);
1196 if (!tri_->getMatchingSuperReg(PhysReg, SubIdx, RC))
1200 if (MI->isInsertSubreg() || MI->isSubregToReg()) {
1201 SubIdx = MI->getOperand(3).getImm();
1202 if (VirtReg == MI->getOperand(0).getReg()) {
1203 if (!tri_->getSubReg(PhysReg, SubIdx))
1206 unsigned DstReg = MI->getOperand(0).getReg();
1207 const TargetRegisterClass *RC =
1208 TargetRegisterInfo::isPhysicalRegister(DstReg)
1209 ? tri_->getPhysicalRegisterRegClass(DstReg)
1210 : mri_->getRegClass(DstReg);
1211 if (!tri_->getMatchingSuperReg(PhysReg, SubIdx, RC))
1220 /// CanJoinExtractSubRegToPhysReg - Return true if it's possible to coalesce
1221 /// an extract_subreg where dst is a physical register, e.g.
1222 /// cl = EXTRACT_SUBREG reg1024, 1
1224 SimpleRegisterCoalescing::CanJoinExtractSubRegToPhysReg(unsigned DstReg,
1225 unsigned SrcReg, unsigned SubIdx,
1226 unsigned &RealDstReg) {
1227 const TargetRegisterClass *RC = mri_->getRegClass(SrcReg);
1228 RealDstReg = tri_->getMatchingSuperReg(DstReg, SubIdx, RC);
1229 assert(RealDstReg && "Invalid extract_subreg instruction!");
1231 // For this type of EXTRACT_SUBREG, conservatively
1232 // check if the live interval of the source register interfere with the
1233 // actual super physical register we are trying to coalesce with.
1234 LiveInterval &RHS = li_->getInterval(SrcReg);
1235 if (li_->hasInterval(RealDstReg) &&
1236 RHS.overlaps(li_->getInterval(RealDstReg))) {
1238 dbgs() << "Interfere with register ";
1239 li_->getInterval(RealDstReg).print(dbgs(), tri_);
1241 return false; // Not coalescable
1243 for (const unsigned* SR = tri_->getSubRegisters(RealDstReg); *SR; ++SR)
1244 if (li_->hasInterval(*SR) && RHS.overlaps(li_->getInterval(*SR))) {
1246 dbgs() << "Interfere with sub-register ";
1247 li_->getInterval(*SR).print(dbgs(), tri_);
1249 return false; // Not coalescable
1254 /// CanJoinInsertSubRegToPhysReg - Return true if it's possible to coalesce
1255 /// an insert_subreg where src is a physical register, e.g.
1256 /// reg1024 = INSERT_SUBREG reg1024, c1, 0
1258 SimpleRegisterCoalescing::CanJoinInsertSubRegToPhysReg(unsigned DstReg,
1259 unsigned SrcReg, unsigned SubIdx,
1260 unsigned &RealSrcReg) {
1261 const TargetRegisterClass *RC = mri_->getRegClass(DstReg);
1262 RealSrcReg = tri_->getMatchingSuperReg(SrcReg, SubIdx, RC);
1263 assert(RealSrcReg && "Invalid extract_subreg instruction!");
1265 LiveInterval &RHS = li_->getInterval(DstReg);
1266 if (li_->hasInterval(RealSrcReg) &&
1267 RHS.overlaps(li_->getInterval(RealSrcReg))) {
1269 dbgs() << "Interfere with register ";
1270 li_->getInterval(RealSrcReg).print(dbgs(), tri_);
1272 return false; // Not coalescable
1274 for (const unsigned* SR = tri_->getSubRegisters(RealSrcReg); *SR; ++SR)
1275 if (li_->hasInterval(*SR) && RHS.overlaps(li_->getInterval(*SR))) {
1277 dbgs() << "Interfere with sub-register ";
1278 li_->getInterval(*SR).print(dbgs(), tri_);
1280 return false; // Not coalescable
1285 /// getRegAllocPreference - Return register allocation preference register.
1287 static unsigned getRegAllocPreference(unsigned Reg, MachineFunction &MF,
1288 MachineRegisterInfo *MRI,
1289 const TargetRegisterInfo *TRI) {
1290 if (TargetRegisterInfo::isPhysicalRegister(Reg))
1292 std::pair<unsigned, unsigned> Hint = MRI->getRegAllocationHint(Reg);
1293 return TRI->ResolveRegAllocHint(Hint.first, Hint.second, MF);
1296 /// JoinCopy - Attempt to join intervals corresponding to SrcReg/DstReg,
1297 /// which are the src/dst of the copy instruction CopyMI. This returns true
1298 /// if the copy was successfully coalesced away. If it is not currently
1299 /// possible to coalesce this interval, but it may be possible if other
1300 /// things get coalesced, then it returns true by reference in 'Again'.
1301 bool SimpleRegisterCoalescing::JoinCopy(CopyRec &TheCopy, bool &Again) {
1302 MachineInstr *CopyMI = TheCopy.MI;
1305 if (JoinedCopies.count(CopyMI) || ReMatCopies.count(CopyMI))
1306 return false; // Already done.
1308 DEBUG(dbgs() << li_->getInstructionIndex(CopyMI) << '\t' << *CopyMI);
1310 unsigned SrcReg, DstReg, SrcSubIdx = 0, DstSubIdx = 0;
1311 bool isExtSubReg = CopyMI->isExtractSubreg();
1312 bool isInsSubReg = CopyMI->isInsertSubreg();
1313 bool isSubRegToReg = CopyMI->isSubregToReg();
1314 unsigned SubIdx = 0;
1316 DstReg = CopyMI->getOperand(0).getReg();
1317 DstSubIdx = CopyMI->getOperand(0).getSubReg();
1318 SrcReg = CopyMI->getOperand(1).getReg();
1319 SrcSubIdx = CopyMI->getOperand(2).getImm();
1320 } else if (isInsSubReg || isSubRegToReg) {
1321 DstReg = CopyMI->getOperand(0).getReg();
1322 DstSubIdx = CopyMI->getOperand(3).getImm();
1323 SrcReg = CopyMI->getOperand(2).getReg();
1324 SrcSubIdx = CopyMI->getOperand(2).getSubReg();
1325 if (SrcSubIdx && SrcSubIdx != DstSubIdx) {
1326 // r1025 = INSERT_SUBREG r1025, r1024<2>, 2 Then r1024 has already been
1327 // coalesced to a larger register so the subreg indices cancel out.
1328 DEBUG(dbgs() << "\tSource of insert_subreg or subreg_to_reg is already "
1329 "coalesced to another register.\n");
1330 return false; // Not coalescable.
1332 } else if (tii_->isMoveInstr(*CopyMI, SrcReg, DstReg, SrcSubIdx, DstSubIdx)) {
1333 if (SrcSubIdx && DstSubIdx && SrcSubIdx != DstSubIdx) {
1334 // e.g. %reg16404:1<def> = MOV8rr %reg16412:2<kill>
1336 return false; // Not coalescable.
1339 llvm_unreachable("Unrecognized copy instruction!");
1342 // If they are already joined we continue.
1343 if (SrcReg == DstReg) {
1344 DEBUG(dbgs() << "\tCopy already coalesced.\n");
1345 return false; // Not coalescable.
1348 bool SrcIsPhys = TargetRegisterInfo::isPhysicalRegister(SrcReg);
1349 bool DstIsPhys = TargetRegisterInfo::isPhysicalRegister(DstReg);
1351 // If they are both physical registers, we cannot join them.
1352 if (SrcIsPhys && DstIsPhys) {
1353 DEBUG(dbgs() << "\tCan not coalesce physregs.\n");
1354 return false; // Not coalescable.
1357 // We only join virtual registers with allocatable physical registers.
1358 if (SrcIsPhys && !allocatableRegs_[SrcReg]) {
1359 DEBUG(dbgs() << "\tSrc reg is unallocatable physreg.\n");
1360 return false; // Not coalescable.
1362 if (DstIsPhys && !allocatableRegs_[DstReg]) {
1363 DEBUG(dbgs() << "\tDst reg is unallocatable physreg.\n");
1364 return false; // Not coalescable.
1367 // Check that a physical source register is compatible with dst regclass
1369 unsigned SrcSubReg = SrcSubIdx ?
1370 tri_->getSubReg(SrcReg, SrcSubIdx) : SrcReg;
1371 const TargetRegisterClass *DstRC = mri_->getRegClass(DstReg);
1372 const TargetRegisterClass *DstSubRC = DstRC;
1374 DstSubRC = DstRC->getSubRegisterRegClass(DstSubIdx);
1375 assert(DstSubRC && "Illegal subregister index");
1376 if (!DstSubRC->contains(SrcSubReg)) {
1377 DEBUG(dbgs() << "\tIncompatible destination regclass: "
1378 << tri_->getName(SrcSubReg) << " not in "
1379 << DstSubRC->getName() << ".\n");
1380 return false; // Not coalescable.
1384 // Check that a physical dst register is compatible with source regclass
1386 unsigned DstSubReg = DstSubIdx ?
1387 tri_->getSubReg(DstReg, DstSubIdx) : DstReg;
1388 const TargetRegisterClass *SrcRC = mri_->getRegClass(SrcReg);
1389 const TargetRegisterClass *SrcSubRC = SrcRC;
1391 SrcSubRC = SrcRC->getSubRegisterRegClass(SrcSubIdx);
1392 assert(SrcSubRC && "Illegal subregister index");
1393 if (!SrcSubRC->contains(DstSubReg)) {
1394 DEBUG(dbgs() << "\tIncompatible source regclass: "
1395 << tri_->getName(DstSubReg) << " not in "
1396 << SrcSubRC->getName() << ".\n");
1398 return false; // Not coalescable.
1402 // Should be non-null only when coalescing to a sub-register class.
1403 bool CrossRC = false;
1404 const TargetRegisterClass *SrcRC= SrcIsPhys ? 0 : mri_->getRegClass(SrcReg);
1405 const TargetRegisterClass *DstRC= DstIsPhys ? 0 : mri_->getRegClass(DstReg);
1406 const TargetRegisterClass *NewRC = NULL;
1407 MachineBasicBlock *CopyMBB = CopyMI->getParent();
1408 unsigned RealDstReg = 0;
1409 unsigned RealSrcReg = 0;
1410 if (isExtSubReg || isInsSubReg || isSubRegToReg) {
1411 SubIdx = CopyMI->getOperand(isExtSubReg ? 2 : 3).getImm();
1412 if (SrcIsPhys && isExtSubReg) {
1413 // r1024 = EXTRACT_SUBREG EAX, 0 then r1024 is really going to be
1414 // coalesced with AX.
1415 unsigned DstSubIdx = CopyMI->getOperand(0).getSubReg();
1417 // r1024<2> = EXTRACT_SUBREG EAX, 2. Then r1024 has already been
1418 // coalesced to a larger register so the subreg indices cancel out.
1419 if (DstSubIdx != SubIdx) {
1420 DEBUG(dbgs() << "\t Sub-register indices mismatch.\n");
1421 return false; // Not coalescable.
1424 SrcReg = tri_->getSubReg(SrcReg, SubIdx);
1426 } else if (DstIsPhys && (isInsSubReg || isSubRegToReg)) {
1427 // EAX = INSERT_SUBREG EAX, r1024, 0
1428 unsigned SrcSubIdx = CopyMI->getOperand(2).getSubReg();
1430 // EAX = INSERT_SUBREG EAX, r1024<2>, 2 Then r1024 has already been
1431 // coalesced to a larger register so the subreg indices cancel out.
1432 if (SrcSubIdx != SubIdx) {
1433 DEBUG(dbgs() << "\t Sub-register indices mismatch.\n");
1434 return false; // Not coalescable.
1437 DstReg = tri_->getSubReg(DstReg, SubIdx);
1439 } else if ((DstIsPhys && isExtSubReg) ||
1440 (SrcIsPhys && (isInsSubReg || isSubRegToReg))) {
1441 if (!isSubRegToReg && CopyMI->getOperand(1).getSubReg()) {
1442 DEBUG(dbgs() << "\tSrc of extract_subreg already coalesced with reg"
1443 << " of a super-class.\n");
1444 return false; // Not coalescable.
1448 if (!CanJoinExtractSubRegToPhysReg(DstReg, SrcReg, SubIdx, RealDstReg))
1449 return false; // Not coalescable
1451 if (!CanJoinInsertSubRegToPhysReg(DstReg, SrcReg, SubIdx, RealSrcReg))
1452 return false; // Not coalescable
1456 unsigned OldSubIdx = isExtSubReg ? CopyMI->getOperand(0).getSubReg()
1457 : CopyMI->getOperand(2).getSubReg();
1459 if (OldSubIdx == SubIdx && !differingRegisterClasses(SrcReg, DstReg))
1460 // r1024<2> = EXTRACT_SUBREG r1025, 2. Then r1024 has already been
1461 // coalesced to a larger register so the subreg indices cancel out.
1462 // Also check if the other larger register is of the same register
1463 // class as the would be resulting register.
1466 DEBUG(dbgs() << "\t Sub-register indices mismatch.\n");
1467 return false; // Not coalescable.
1471 if (!DstIsPhys && !SrcIsPhys) {
1472 if (isInsSubReg || isSubRegToReg) {
1473 NewRC = tri_->getMatchingSuperRegClass(DstRC, SrcRC, SubIdx);
1474 } else // extract_subreg {
1475 NewRC = tri_->getMatchingSuperRegClass(SrcRC, DstRC, SubIdx);
1478 DEBUG(dbgs() << "\t Conflicting sub-register indices.\n");
1479 return false; // Not coalescable
1482 unsigned LargeReg = isExtSubReg ? SrcReg : DstReg;
1483 unsigned SmallReg = isExtSubReg ? DstReg : SrcReg;
1484 unsigned Limit= allocatableRCRegs_[mri_->getRegClass(SmallReg)].count();
1485 if (!isWinToJoinCrossClass(LargeReg, SmallReg, Limit)) {
1486 Again = true; // May be possible to coalesce later.
1491 } else if (differingRegisterClasses(SrcReg, DstReg)) {
1492 if (DisableCrossClassJoin)
1496 // FIXME: What if the result of a EXTRACT_SUBREG is then coalesced
1497 // with another? If it's the resulting destination register, then
1498 // the subidx must be propagated to uses (but only those defined
1499 // by the EXTRACT_SUBREG). If it's being coalesced into another
1500 // register, it should be safe because register is assumed to have
1501 // the register class of the super-register.
1503 // Process moves where one of the registers have a sub-register index.
1504 MachineOperand *DstMO = CopyMI->findRegisterDefOperand(DstReg);
1505 MachineOperand *SrcMO = CopyMI->findRegisterUseOperand(SrcReg);
1506 SubIdx = DstMO->getSubReg();
1508 if (SrcMO->getSubReg())
1509 // FIXME: can we handle this?
1511 // This is not an insert_subreg but it looks like one.
1512 // e.g. %reg1024:4 = MOV32rr %EAX
1515 if (!CanJoinInsertSubRegToPhysReg(DstReg, SrcReg, SubIdx, RealSrcReg))
1516 return false; // Not coalescable
1520 SubIdx = SrcMO->getSubReg();
1522 // This is not a extract_subreg but it looks like one.
1523 // e.g. %cl = MOV16rr %reg1024:1
1526 if (!CanJoinExtractSubRegToPhysReg(DstReg, SrcReg, SubIdx,RealDstReg))
1527 return false; // Not coalescable
1533 unsigned LargeReg = SrcReg;
1534 unsigned SmallReg = DstReg;
1536 // Now determine the register class of the joined register.
1538 if (SubIdx && DstRC && DstRC->isASubClass()) {
1539 // This is a move to a sub-register class. However, the source is a
1540 // sub-register of a larger register class. We don't know what should
1541 // the register class be. FIXME.
1545 if (!DstIsPhys && !SrcIsPhys)
1547 } else if (!SrcIsPhys && !DstIsPhys) {
1548 NewRC = getCommonSubClass(SrcRC, DstRC);
1550 DEBUG(dbgs() << "\tDisjoint regclasses: "
1551 << SrcRC->getName() << ", "
1552 << DstRC->getName() << ".\n");
1553 return false; // Not coalescable.
1555 if (DstRC->getSize() > SrcRC->getSize())
1556 std::swap(LargeReg, SmallReg);
1559 // If we are joining two virtual registers and the resulting register
1560 // class is more restrictive (fewer register, smaller size). Check if it's
1561 // worth doing the merge.
1562 if (!SrcIsPhys && !DstIsPhys &&
1563 (isExtSubReg || DstRC->isASubClass()) &&
1564 !isWinToJoinCrossClass(LargeReg, SmallReg,
1565 allocatableRCRegs_[NewRC].count())) {
1566 DEBUG(dbgs() << "\tSrc/Dest are different register classes: "
1567 << SrcRC->getName() << "/"
1568 << DstRC->getName() << " -> "
1569 << NewRC->getName() << ".\n");
1570 // Allow the coalescer to try again in case either side gets coalesced to
1571 // a physical register that's compatible with the other side. e.g.
1572 // r1024 = MOV32to32_ r1025
1573 // But later r1024 is assigned EAX then r1025 may be coalesced with EAX.
1574 Again = true; // May be possible to coalesce later.
1579 // Will it create illegal extract_subreg / insert_subreg?
1580 if (SrcIsPhys && HasIncompatibleSubRegDefUse(CopyMI, DstReg, SrcReg))
1582 if (DstIsPhys && HasIncompatibleSubRegDefUse(CopyMI, SrcReg, DstReg))
1585 LiveInterval &SrcInt = li_->getInterval(SrcReg);
1586 LiveInterval &DstInt = li_->getInterval(DstReg);
1587 assert(SrcInt.reg == SrcReg && DstInt.reg == DstReg &&
1588 "Register mapping is horribly broken!");
1591 dbgs() << "\t\tInspecting "; SrcInt.print(dbgs(), tri_);
1592 dbgs() << " and "; DstInt.print(dbgs(), tri_);
1596 // Save a copy of the virtual register live interval. We'll manually
1597 // merge this into the "real" physical register live interval this is
1599 LiveInterval *SavedLI = 0;
1601 SavedLI = li_->dupInterval(&SrcInt);
1602 else if (RealSrcReg)
1603 SavedLI = li_->dupInterval(&DstInt);
1605 // Check if it is necessary to propagate "isDead" property.
1606 if (!isExtSubReg && !isInsSubReg && !isSubRegToReg) {
1607 MachineOperand *mopd = CopyMI->findRegisterDefOperand(DstReg, false);
1608 bool isDead = mopd->isDead();
1610 // We need to be careful about coalescing a source physical register with a
1611 // virtual register. Once the coalescing is done, it cannot be broken and
1612 // these are not spillable! If the destination interval uses are far away,
1613 // think twice about coalescing them!
1614 if (!isDead && (SrcIsPhys || DstIsPhys)) {
1615 // If the copy is in a loop, take care not to coalesce aggressively if the
1616 // src is coming in from outside the loop (or the dst is out of the loop).
1617 // If it's not in a loop, then determine whether to join them base purely
1618 // by the length of the interval.
1619 if (PhysJoinTweak) {
1621 if (!isWinToJoinVRWithSrcPhysReg(CopyMI, CopyMBB, DstInt, SrcInt)) {
1622 mri_->setRegAllocationHint(DstInt.reg, 0, SrcReg);
1624 DEBUG(dbgs() << "\tMay tie down a physical register, abort!\n");
1625 Again = true; // May be possible to coalesce later.
1629 if (!isWinToJoinVRWithDstPhysReg(CopyMI, CopyMBB, DstInt, SrcInt)) {
1630 mri_->setRegAllocationHint(SrcInt.reg, 0, DstReg);
1632 DEBUG(dbgs() << "\tMay tie down a physical register, abort!\n");
1633 Again = true; // May be possible to coalesce later.
1638 // If the virtual register live interval is long but it has low use
1639 // density, do not join them, instead mark the physical register as its
1640 // allocation preference.
1641 LiveInterval &JoinVInt = SrcIsPhys ? DstInt : SrcInt;
1642 unsigned JoinVReg = SrcIsPhys ? DstReg : SrcReg;
1643 unsigned JoinPReg = SrcIsPhys ? SrcReg : DstReg;
1644 const TargetRegisterClass *RC = mri_->getRegClass(JoinVReg);
1645 unsigned Threshold = allocatableRCRegs_[RC].count() * 2;
1646 unsigned Length = li_->getApproximateInstructionCount(JoinVInt);
1647 float Ratio = 1.0 / Threshold;
1648 if (Length > Threshold &&
1649 (((float)std::distance(mri_->use_nodbg_begin(JoinVReg),
1650 mri_->use_nodbg_end()) / Length) < Ratio)) {
1651 mri_->setRegAllocationHint(JoinVInt.reg, 0, JoinPReg);
1653 DEBUG(dbgs() << "\tMay tie down a physical register, abort!\n");
1654 Again = true; // May be possible to coalesce later.
1661 // Okay, attempt to join these two intervals. On failure, this returns false.
1662 // Otherwise, if one of the intervals being joined is a physreg, this method
1663 // always canonicalizes DstInt to be it. The output "SrcInt" will not have
1664 // been modified, so we can use this information below to update aliases.
1665 bool Swapped = false;
1666 // If SrcInt is implicitly defined, it's safe to coalesce.
1667 bool isEmpty = SrcInt.empty();
1668 if (isEmpty && !CanCoalesceWithImpDef(CopyMI, DstInt, SrcInt)) {
1669 // Only coalesce an empty interval (defined by implicit_def) with
1670 // another interval which has a valno defined by the CopyMI and the CopyMI
1671 // is a kill of the implicit def.
1672 DEBUG(dbgs() << "Not profitable!\n");
1676 if (!isEmpty && !JoinIntervals(DstInt, SrcInt, Swapped)) {
1677 // Coalescing failed.
1679 // If definition of source is defined by trivial computation, try
1680 // rematerializing it.
1681 if (!isExtSubReg && !isInsSubReg && !isSubRegToReg &&
1682 ReMaterializeTrivialDef(SrcInt, DstReg, DstSubIdx, CopyMI))
1685 // If we can eliminate the copy without merging the live ranges, do so now.
1686 if (!isExtSubReg && !isInsSubReg && !isSubRegToReg &&
1687 (AdjustCopiesBackFrom(SrcInt, DstInt, CopyMI) ||
1688 RemoveCopyByCommutingDef(SrcInt, DstInt, CopyMI))) {
1689 JoinedCopies.insert(CopyMI);
1693 // Otherwise, we are unable to join the intervals.
1694 DEBUG(dbgs() << "Interference!\n");
1695 Again = true; // May be possible to coalesce later.
1699 LiveInterval *ResSrcInt = &SrcInt;
1700 LiveInterval *ResDstInt = &DstInt;
1702 std::swap(SrcReg, DstReg);
1703 std::swap(ResSrcInt, ResDstInt);
1705 assert(TargetRegisterInfo::isVirtualRegister(SrcReg) &&
1706 "LiveInterval::join didn't work right!");
1708 // If we're about to merge live ranges into a physical register live interval,
1709 // we have to update any aliased register's live ranges to indicate that they
1710 // have clobbered values for this range.
1711 if (TargetRegisterInfo::isPhysicalRegister(DstReg)) {
1712 // If this is a extract_subreg where dst is a physical register, e.g.
1713 // cl = EXTRACT_SUBREG reg1024, 1
1714 // then create and update the actual physical register allocated to RHS.
1715 if (RealDstReg || RealSrcReg) {
1716 LiveInterval &RealInt =
1717 li_->getOrCreateInterval(RealDstReg ? RealDstReg : RealSrcReg);
1718 for (LiveInterval::const_vni_iterator I = SavedLI->vni_begin(),
1719 E = SavedLI->vni_end(); I != E; ++I) {
1720 const VNInfo *ValNo = *I;
1721 VNInfo *NewValNo = RealInt.getNextValue(ValNo->def, ValNo->getCopy(),
1722 false, // updated at *
1723 li_->getVNInfoAllocator());
1724 NewValNo->setFlags(ValNo->getFlags()); // * updated here.
1725 RealInt.addKills(NewValNo, ValNo->kills);
1726 RealInt.MergeValueInAsValue(*SavedLI, ValNo, NewValNo);
1728 RealInt.weight += SavedLI->weight;
1729 DstReg = RealDstReg ? RealDstReg : RealSrcReg;
1732 // Update the liveintervals of sub-registers.
1733 for (const unsigned *AS = tri_->getSubRegisters(DstReg); *AS; ++AS)
1734 li_->getOrCreateInterval(*AS).MergeInClobberRanges(*li_, *ResSrcInt,
1735 li_->getVNInfoAllocator());
1738 // If this is a EXTRACT_SUBREG, make sure the result of coalescing is the
1739 // larger super-register.
1740 if ((isExtSubReg || isInsSubReg || isSubRegToReg) &&
1741 !SrcIsPhys && !DstIsPhys) {
1742 if ((isExtSubReg && !Swapped) ||
1743 ((isInsSubReg || isSubRegToReg) && Swapped)) {
1744 ResSrcInt->Copy(*ResDstInt, mri_, li_->getVNInfoAllocator());
1745 std::swap(SrcReg, DstReg);
1746 std::swap(ResSrcInt, ResDstInt);
1750 // Coalescing to a virtual register that is of a sub-register class of the
1751 // other. Make sure the resulting register is set to the right register class.
1755 // This may happen even if it's cross-rc coalescing. e.g.
1756 // %reg1026<def> = SUBREG_TO_REG 0, %reg1037<kill>, 4
1757 // reg1026 -> GR64, reg1037 -> GR32_ABCD. The resulting register will have to
1758 // be allocate a register from GR64_ABCD.
1760 mri_->setRegClass(DstReg, NewRC);
1762 // Remember to delete the copy instruction.
1763 JoinedCopies.insert(CopyMI);
1765 // Some live range has been lengthened due to colaescing, eliminate the
1766 // unnecessary kills.
1767 RemoveUnnecessaryKills(SrcReg, *ResDstInt);
1768 if (TargetRegisterInfo::isVirtualRegister(DstReg))
1769 RemoveUnnecessaryKills(DstReg, *ResDstInt);
1771 UpdateRegDefsUses(SrcReg, DstReg, SubIdx);
1773 // If we have extended the live range of a physical register, make sure we
1774 // update live-in lists as well.
1775 if (TargetRegisterInfo::isPhysicalRegister(DstReg)) {
1776 const LiveInterval &VRegInterval = li_->getInterval(SrcReg);
1777 SmallVector<MachineBasicBlock*, 16> BlockSeq;
1778 for (LiveInterval::const_iterator I = VRegInterval.begin(),
1779 E = VRegInterval.end(); I != E; ++I ) {
1780 li_->findLiveInMBBs(I->start, I->end, BlockSeq);
1781 for (unsigned idx = 0, size = BlockSeq.size(); idx != size; ++idx) {
1782 MachineBasicBlock &block = *BlockSeq[idx];
1783 if (!block.isLiveIn(DstReg))
1784 block.addLiveIn(DstReg);
1790 // SrcReg is guarateed to be the register whose live interval that is
1792 li_->removeInterval(SrcReg);
1794 // Update regalloc hint.
1795 tri_->UpdateRegAllocHint(SrcReg, DstReg, *mf_);
1797 // Manually deleted the live interval copy.
1803 // If resulting interval has a preference that no longer fits because of subreg
1804 // coalescing, just clear the preference.
1805 unsigned Preference = getRegAllocPreference(ResDstInt->reg, *mf_, mri_, tri_);
1806 if (Preference && (isExtSubReg || isInsSubReg || isSubRegToReg) &&
1807 TargetRegisterInfo::isVirtualRegister(ResDstInt->reg)) {
1808 const TargetRegisterClass *RC = mri_->getRegClass(ResDstInt->reg);
1809 if (!RC->contains(Preference))
1810 mri_->setRegAllocationHint(ResDstInt->reg, 0, 0);
1814 dbgs() << "\n\t\tJoined. Result = ";
1815 ResDstInt->print(dbgs(), tri_);
1823 /// ComputeUltimateVN - Assuming we are going to join two live intervals,
1824 /// compute what the resultant value numbers for each value in the input two
1825 /// ranges will be. This is complicated by copies between the two which can
1826 /// and will commonly cause multiple value numbers to be merged into one.
1828 /// VN is the value number that we're trying to resolve. InstDefiningValue
1829 /// keeps track of the new InstDefiningValue assignment for the result
1830 /// LiveInterval. ThisFromOther/OtherFromThis are sets that keep track of
1831 /// whether a value in this or other is a copy from the opposite set.
1832 /// ThisValNoAssignments/OtherValNoAssignments keep track of value #'s that have
1833 /// already been assigned.
1835 /// ThisFromOther[x] - If x is defined as a copy from the other interval, this
1836 /// contains the value number the copy is from.
1838 static unsigned ComputeUltimateVN(VNInfo *VNI,
1839 SmallVector<VNInfo*, 16> &NewVNInfo,
1840 DenseMap<VNInfo*, VNInfo*> &ThisFromOther,
1841 DenseMap<VNInfo*, VNInfo*> &OtherFromThis,
1842 SmallVector<int, 16> &ThisValNoAssignments,
1843 SmallVector<int, 16> &OtherValNoAssignments) {
1844 unsigned VN = VNI->id;
1846 // If the VN has already been computed, just return it.
1847 if (ThisValNoAssignments[VN] >= 0)
1848 return ThisValNoAssignments[VN];
1849 // assert(ThisValNoAssignments[VN] != -2 && "Cyclic case?");
1851 // If this val is not a copy from the other val, then it must be a new value
1852 // number in the destination.
1853 DenseMap<VNInfo*, VNInfo*>::iterator I = ThisFromOther.find(VNI);
1854 if (I == ThisFromOther.end()) {
1855 NewVNInfo.push_back(VNI);
1856 return ThisValNoAssignments[VN] = NewVNInfo.size()-1;
1858 VNInfo *OtherValNo = I->second;
1860 // Otherwise, this *is* a copy from the RHS. If the other side has already
1861 // been computed, return it.
1862 if (OtherValNoAssignments[OtherValNo->id] >= 0)
1863 return ThisValNoAssignments[VN] = OtherValNoAssignments[OtherValNo->id];
1865 // Mark this value number as currently being computed, then ask what the
1866 // ultimate value # of the other value is.
1867 ThisValNoAssignments[VN] = -2;
1868 unsigned UltimateVN =
1869 ComputeUltimateVN(OtherValNo, NewVNInfo, OtherFromThis, ThisFromOther,
1870 OtherValNoAssignments, ThisValNoAssignments);
1871 return ThisValNoAssignments[VN] = UltimateVN;
1874 static bool InVector(VNInfo *Val, const SmallVector<VNInfo*, 8> &V) {
1875 return std::find(V.begin(), V.end(), Val) != V.end();
1878 static bool isValNoDefMove(const MachineInstr *MI, unsigned DR, unsigned SR,
1879 const TargetInstrInfo *TII,
1880 const TargetRegisterInfo *TRI) {
1881 unsigned SrcReg, DstReg, SrcSubIdx, DstSubIdx;
1882 if (TII->isMoveInstr(*MI, SrcReg, DstReg, SrcSubIdx, DstSubIdx))
1884 else if (MI->isExtractSubreg()) {
1885 DstReg = MI->getOperand(0).getReg();
1886 SrcReg = MI->getOperand(1).getReg();
1887 } else if (MI->isSubregToReg() ||
1888 MI->isInsertSubreg()) {
1889 DstReg = MI->getOperand(0).getReg();
1890 SrcReg = MI->getOperand(2).getReg();
1893 return (SrcReg == SR || TRI->isSuperRegister(SR, SrcReg)) &&
1894 (DstReg == DR || TRI->isSuperRegister(DR, DstReg));
1897 /// RangeIsDefinedByCopyFromReg - Return true if the specified live range of
1898 /// the specified live interval is defined by a copy from the specified
1900 bool SimpleRegisterCoalescing::RangeIsDefinedByCopyFromReg(LiveInterval &li,
1903 unsigned SrcReg = li_->getVNInfoSourceReg(LR->valno);
1906 // FIXME: Do isPHIDef and isDefAccurate both need to be tested?
1907 if ((LR->valno->isPHIDef() || !LR->valno->isDefAccurate()) &&
1908 TargetRegisterInfo::isPhysicalRegister(li.reg) &&
1909 *tri_->getSuperRegisters(li.reg)) {
1910 // It's a sub-register live interval, we may not have precise information.
1912 MachineInstr *DefMI = li_->getInstructionFromIndex(LR->start);
1913 if (DefMI && isValNoDefMove(DefMI, li.reg, Reg, tii_, tri_)) {
1914 // Cache computed info.
1915 LR->valno->def = LR->start;
1916 LR->valno->setCopy(DefMI);
1924 /// ValueLiveAt - Return true if the LiveRange pointed to by the given
1925 /// iterator, or any subsequent range with the same value number,
1926 /// is live at the given point.
1927 bool SimpleRegisterCoalescing::ValueLiveAt(LiveInterval::iterator LRItr,
1928 LiveInterval::iterator LREnd,
1929 SlotIndex defPoint) const {
1930 for (const VNInfo *valno = LRItr->valno;
1931 (LRItr != LREnd) && (LRItr->valno == valno); ++LRItr) {
1932 if (LRItr->contains(defPoint))
1940 /// SimpleJoin - Attempt to joint the specified interval into this one. The
1941 /// caller of this method must guarantee that the RHS only contains a single
1942 /// value number and that the RHS is not defined by a copy from this
1943 /// interval. This returns false if the intervals are not joinable, or it
1944 /// joins them and returns true.
1945 bool SimpleRegisterCoalescing::SimpleJoin(LiveInterval &LHS, LiveInterval &RHS){
1946 assert(RHS.containsOneValue());
1948 // Some number (potentially more than one) value numbers in the current
1949 // interval may be defined as copies from the RHS. Scan the overlapping
1950 // portions of the LHS and RHS, keeping track of this and looking for
1951 // overlapping live ranges that are NOT defined as copies. If these exist, we
1954 LiveInterval::iterator LHSIt = LHS.begin(), LHSEnd = LHS.end();
1955 LiveInterval::iterator RHSIt = RHS.begin(), RHSEnd = RHS.end();
1957 if (LHSIt->start < RHSIt->start) {
1958 LHSIt = std::upper_bound(LHSIt, LHSEnd, RHSIt->start);
1959 if (LHSIt != LHS.begin()) --LHSIt;
1960 } else if (RHSIt->start < LHSIt->start) {
1961 RHSIt = std::upper_bound(RHSIt, RHSEnd, LHSIt->start);
1962 if (RHSIt != RHS.begin()) --RHSIt;
1965 SmallVector<VNInfo*, 8> EliminatedLHSVals;
1968 // Determine if these live intervals overlap.
1969 bool Overlaps = false;
1970 if (LHSIt->start <= RHSIt->start)
1971 Overlaps = LHSIt->end > RHSIt->start;
1973 Overlaps = RHSIt->end > LHSIt->start;
1975 // If the live intervals overlap, there are two interesting cases: if the
1976 // LHS interval is defined by a copy from the RHS, it's ok and we record
1977 // that the LHS value # is the same as the RHS. If it's not, then we cannot
1978 // coalesce these live ranges and we bail out.
1980 // If we haven't already recorded that this value # is safe, check it.
1981 if (!InVector(LHSIt->valno, EliminatedLHSVals)) {
1982 // If it's re-defined by an early clobber somewhere in the live range,
1983 // then conservatively abort coalescing.
1984 if (LHSIt->valno->hasRedefByEC())
1986 // Copy from the RHS?
1987 if (!RangeIsDefinedByCopyFromReg(LHS, LHSIt, RHS.reg))
1988 return false; // Nope, bail out.
1990 if (ValueLiveAt(LHSIt, LHS.end(), RHSIt->valno->def))
1991 // Here is an interesting situation:
1993 // vr1025 = copy vr1024
1998 // Even though vr1025 is copied from vr1024, it's not safe to
1999 // coalesce them since the live range of vr1025 intersects the
2000 // def of vr1024. This happens because vr1025 is assigned the
2001 // value of the previous iteration of vr1024.
2003 EliminatedLHSVals.push_back(LHSIt->valno);
2006 // We know this entire LHS live range is okay, so skip it now.
2007 if (++LHSIt == LHSEnd) break;
2011 if (LHSIt->end < RHSIt->end) {
2012 if (++LHSIt == LHSEnd) break;
2014 // One interesting case to check here. It's possible that we have
2015 // something like "X3 = Y" which defines a new value number in the LHS,
2016 // and is the last use of this liverange of the RHS. In this case, we
2017 // want to notice this copy (so that it gets coalesced away) even though
2018 // the live ranges don't actually overlap.
2019 if (LHSIt->start == RHSIt->end) {
2020 if (InVector(LHSIt->valno, EliminatedLHSVals)) {
2021 // We already know that this value number is going to be merged in
2022 // if coalescing succeeds. Just skip the liverange.
2023 if (++LHSIt == LHSEnd) break;
2025 // If it's re-defined by an early clobber somewhere in the live range,
2026 // then conservatively abort coalescing.
2027 if (LHSIt->valno->hasRedefByEC())
2029 // Otherwise, if this is a copy from the RHS, mark it as being merged
2031 if (RangeIsDefinedByCopyFromReg(LHS, LHSIt, RHS.reg)) {
2032 if (ValueLiveAt(LHSIt, LHS.end(), RHSIt->valno->def))
2033 // Here is an interesting situation:
2035 // vr1025 = copy vr1024
2040 // Even though vr1025 is copied from vr1024, it's not safe to
2041 // coalesced them since live range of vr1025 intersects the
2042 // def of vr1024. This happens because vr1025 is assigned the
2043 // value of the previous iteration of vr1024.
2045 EliminatedLHSVals.push_back(LHSIt->valno);
2047 // We know this entire LHS live range is okay, so skip it now.
2048 if (++LHSIt == LHSEnd) break;
2053 if (++RHSIt == RHSEnd) break;
2057 // If we got here, we know that the coalescing will be successful and that
2058 // the value numbers in EliminatedLHSVals will all be merged together. Since
2059 // the most common case is that EliminatedLHSVals has a single number, we
2060 // optimize for it: if there is more than one value, we merge them all into
2061 // the lowest numbered one, then handle the interval as if we were merging
2062 // with one value number.
2063 VNInfo *LHSValNo = NULL;
2064 if (EliminatedLHSVals.size() > 1) {
2065 // Loop through all the equal value numbers merging them into the smallest
2067 VNInfo *Smallest = EliminatedLHSVals[0];
2068 for (unsigned i = 1, e = EliminatedLHSVals.size(); i != e; ++i) {
2069 if (EliminatedLHSVals[i]->id < Smallest->id) {
2070 // Merge the current notion of the smallest into the smaller one.
2071 LHS.MergeValueNumberInto(Smallest, EliminatedLHSVals[i]);
2072 Smallest = EliminatedLHSVals[i];
2074 // Merge into the smallest.
2075 LHS.MergeValueNumberInto(EliminatedLHSVals[i], Smallest);
2078 LHSValNo = Smallest;
2079 } else if (EliminatedLHSVals.empty()) {
2080 if (TargetRegisterInfo::isPhysicalRegister(LHS.reg) &&
2081 *tri_->getSuperRegisters(LHS.reg))
2082 // Imprecise sub-register information. Can't handle it.
2084 llvm_unreachable("No copies from the RHS?");
2086 LHSValNo = EliminatedLHSVals[0];
2089 // Okay, now that there is a single LHS value number that we're merging the
2090 // RHS into, update the value number info for the LHS to indicate that the
2091 // value number is defined where the RHS value number was.
2092 const VNInfo *VNI = RHS.getValNumInfo(0);
2093 LHSValNo->def = VNI->def;
2094 LHSValNo->setCopy(VNI->getCopy());
2096 // Okay, the final step is to loop over the RHS live intervals, adding them to
2098 if (VNI->hasPHIKill())
2099 LHSValNo->setHasPHIKill(true);
2100 LHS.addKills(LHSValNo, VNI->kills);
2101 LHS.MergeRangesInAsValue(RHS, LHSValNo);
2103 LHS.ComputeJoinedWeight(RHS);
2105 // Update regalloc hint if both are virtual registers.
2106 if (TargetRegisterInfo::isVirtualRegister(LHS.reg) &&
2107 TargetRegisterInfo::isVirtualRegister(RHS.reg)) {
2108 std::pair<unsigned, unsigned> RHSPref = mri_->getRegAllocationHint(RHS.reg);
2109 std::pair<unsigned, unsigned> LHSPref = mri_->getRegAllocationHint(LHS.reg);
2110 if (RHSPref != LHSPref)
2111 mri_->setRegAllocationHint(LHS.reg, RHSPref.first, RHSPref.second);
2114 // Update the liveintervals of sub-registers.
2115 if (TargetRegisterInfo::isPhysicalRegister(LHS.reg))
2116 for (const unsigned *AS = tri_->getSubRegisters(LHS.reg); *AS; ++AS)
2117 li_->getOrCreateInterval(*AS).MergeInClobberRanges(*li_, LHS,
2118 li_->getVNInfoAllocator());
2123 /// JoinIntervals - Attempt to join these two intervals. On failure, this
2124 /// returns false. Otherwise, if one of the intervals being joined is a
2125 /// physreg, this method always canonicalizes LHS to be it. The output
2126 /// "RHS" will not have been modified, so we can use this information
2127 /// below to update aliases.
2129 SimpleRegisterCoalescing::JoinIntervals(LiveInterval &LHS, LiveInterval &RHS,
2131 // Compute the final value assignment, assuming that the live ranges can be
2133 SmallVector<int, 16> LHSValNoAssignments;
2134 SmallVector<int, 16> RHSValNoAssignments;
2135 DenseMap<VNInfo*, VNInfo*> LHSValsDefinedFromRHS;
2136 DenseMap<VNInfo*, VNInfo*> RHSValsDefinedFromLHS;
2137 SmallVector<VNInfo*, 16> NewVNInfo;
2139 // If a live interval is a physical register, conservatively check if any
2140 // of its sub-registers is overlapping the live interval of the virtual
2141 // register. If so, do not coalesce.
2142 if (TargetRegisterInfo::isPhysicalRegister(LHS.reg) &&
2143 *tri_->getSubRegisters(LHS.reg)) {
2144 // If it's coalescing a virtual register to a physical register, estimate
2145 // its live interval length. This is the *cost* of scanning an entire live
2146 // interval. If the cost is low, we'll do an exhaustive check instead.
2148 // If this is something like this:
2156 // That is, the live interval of v1024 crosses a bb. Then we can't rely on
2157 // less conservative check. It's possible a sub-register is defined before
2158 // v1024 (or live in) and live out of BB1.
2159 if (RHS.containsOneValue() &&
2160 li_->intervalIsInOneMBB(RHS) &&
2161 li_->getApproximateInstructionCount(RHS) <= 10) {
2162 // Perform a more exhaustive check for some common cases.
2163 if (li_->conflictsWithPhysRegRef(RHS, LHS.reg, true, JoinedCopies))
2166 for (const unsigned* SR = tri_->getSubRegisters(LHS.reg); *SR; ++SR)
2167 if (li_->hasInterval(*SR) && RHS.overlaps(li_->getInterval(*SR))) {
2169 dbgs() << "Interfere with sub-register ";
2170 li_->getInterval(*SR).print(dbgs(), tri_);
2175 } else if (TargetRegisterInfo::isPhysicalRegister(RHS.reg) &&
2176 *tri_->getSubRegisters(RHS.reg)) {
2177 if (LHS.containsOneValue() &&
2178 li_->getApproximateInstructionCount(LHS) <= 10) {
2179 // Perform a more exhaustive check for some common cases.
2180 if (li_->conflictsWithPhysRegRef(LHS, RHS.reg, false, JoinedCopies))
2183 for (const unsigned* SR = tri_->getSubRegisters(RHS.reg); *SR; ++SR)
2184 if (li_->hasInterval(*SR) && LHS.overlaps(li_->getInterval(*SR))) {
2186 dbgs() << "Interfere with sub-register ";
2187 li_->getInterval(*SR).print(dbgs(), tri_);
2194 // Compute ultimate value numbers for the LHS and RHS values.
2195 if (RHS.containsOneValue()) {
2196 // Copies from a liveinterval with a single value are simple to handle and
2197 // very common, handle the special case here. This is important, because
2198 // often RHS is small and LHS is large (e.g. a physreg).
2200 // Find out if the RHS is defined as a copy from some value in the LHS.
2201 int RHSVal0DefinedFromLHS = -1;
2203 VNInfo *RHSValNoInfo = NULL;
2204 VNInfo *RHSValNoInfo0 = RHS.getValNumInfo(0);
2205 unsigned RHSSrcReg = li_->getVNInfoSourceReg(RHSValNoInfo0);
2206 if (RHSSrcReg == 0 || RHSSrcReg != LHS.reg) {
2207 // If RHS is not defined as a copy from the LHS, we can use simpler and
2208 // faster checks to see if the live ranges are coalescable. This joiner
2209 // can't swap the LHS/RHS intervals though.
2210 if (!TargetRegisterInfo::isPhysicalRegister(RHS.reg)) {
2211 return SimpleJoin(LHS, RHS);
2213 RHSValNoInfo = RHSValNoInfo0;
2216 // It was defined as a copy from the LHS, find out what value # it is.
2218 LHS.getLiveRangeContaining(RHSValNoInfo0->def.getPrevSlot())->valno;
2219 RHSValID = RHSValNoInfo->id;
2220 RHSVal0DefinedFromLHS = RHSValID;
2223 LHSValNoAssignments.resize(LHS.getNumValNums(), -1);
2224 RHSValNoAssignments.resize(RHS.getNumValNums(), -1);
2225 NewVNInfo.resize(LHS.getNumValNums(), NULL);
2227 // Okay, *all* of the values in LHS that are defined as a copy from RHS
2228 // should now get updated.
2229 for (LiveInterval::vni_iterator i = LHS.vni_begin(), e = LHS.vni_end();
2232 unsigned VN = VNI->id;
2233 if (unsigned LHSSrcReg = li_->getVNInfoSourceReg(VNI)) {
2234 if (LHSSrcReg != RHS.reg) {
2235 // If this is not a copy from the RHS, its value number will be
2236 // unmodified by the coalescing.
2237 NewVNInfo[VN] = VNI;
2238 LHSValNoAssignments[VN] = VN;
2239 } else if (RHSValID == -1) {
2240 // Otherwise, it is a copy from the RHS, and we don't already have a
2241 // value# for it. Keep the current value number, but remember it.
2242 LHSValNoAssignments[VN] = RHSValID = VN;
2243 NewVNInfo[VN] = RHSValNoInfo;
2244 LHSValsDefinedFromRHS[VNI] = RHSValNoInfo0;
2246 // Otherwise, use the specified value #.
2247 LHSValNoAssignments[VN] = RHSValID;
2248 if (VN == (unsigned)RHSValID) { // Else this val# is dead.
2249 NewVNInfo[VN] = RHSValNoInfo;
2250 LHSValsDefinedFromRHS[VNI] = RHSValNoInfo0;
2254 NewVNInfo[VN] = VNI;
2255 LHSValNoAssignments[VN] = VN;
2259 assert(RHSValID != -1 && "Didn't find value #?");
2260 RHSValNoAssignments[0] = RHSValID;
2261 if (RHSVal0DefinedFromLHS != -1) {
2262 // This path doesn't go through ComputeUltimateVN so just set
2264 RHSValsDefinedFromLHS[RHSValNoInfo0] = (VNInfo*)1;
2267 // Loop over the value numbers of the LHS, seeing if any are defined from
2269 for (LiveInterval::vni_iterator i = LHS.vni_begin(), e = LHS.vni_end();
2272 if (VNI->isUnused() || VNI->getCopy() == 0) // Src not defined by a copy?
2275 // DstReg is known to be a register in the LHS interval. If the src is
2276 // from the RHS interval, we can use its value #.
2277 if (li_->getVNInfoSourceReg(VNI) != RHS.reg)
2280 // Figure out the value # from the RHS.
2281 LiveRange *lr = RHS.getLiveRangeContaining(VNI->def.getPrevSlot());
2282 assert(lr && "Cannot find live range");
2283 LHSValsDefinedFromRHS[VNI] = lr->valno;
2286 // Loop over the value numbers of the RHS, seeing if any are defined from
2288 for (LiveInterval::vni_iterator i = RHS.vni_begin(), e = RHS.vni_end();
2291 if (VNI->isUnused() || VNI->getCopy() == 0) // Src not defined by a copy?
2294 // DstReg is known to be a register in the RHS interval. If the src is
2295 // from the LHS interval, we can use its value #.
2296 if (li_->getVNInfoSourceReg(VNI) != LHS.reg)
2299 // Figure out the value # from the LHS.
2300 LiveRange *lr = LHS.getLiveRangeContaining(VNI->def.getPrevSlot());
2301 assert(lr && "Cannot find live range");
2302 RHSValsDefinedFromLHS[VNI] = lr->valno;
2305 LHSValNoAssignments.resize(LHS.getNumValNums(), -1);
2306 RHSValNoAssignments.resize(RHS.getNumValNums(), -1);
2307 NewVNInfo.reserve(LHS.getNumValNums() + RHS.getNumValNums());
2309 for (LiveInterval::vni_iterator i = LHS.vni_begin(), e = LHS.vni_end();
2312 unsigned VN = VNI->id;
2313 if (LHSValNoAssignments[VN] >= 0 || VNI->isUnused())
2315 ComputeUltimateVN(VNI, NewVNInfo,
2316 LHSValsDefinedFromRHS, RHSValsDefinedFromLHS,
2317 LHSValNoAssignments, RHSValNoAssignments);
2319 for (LiveInterval::vni_iterator i = RHS.vni_begin(), e = RHS.vni_end();
2322 unsigned VN = VNI->id;
2323 if (RHSValNoAssignments[VN] >= 0 || VNI->isUnused())
2325 // If this value number isn't a copy from the LHS, it's a new number.
2326 if (RHSValsDefinedFromLHS.find(VNI) == RHSValsDefinedFromLHS.end()) {
2327 NewVNInfo.push_back(VNI);
2328 RHSValNoAssignments[VN] = NewVNInfo.size()-1;
2332 ComputeUltimateVN(VNI, NewVNInfo,
2333 RHSValsDefinedFromLHS, LHSValsDefinedFromRHS,
2334 RHSValNoAssignments, LHSValNoAssignments);
2338 // Armed with the mappings of LHS/RHS values to ultimate values, walk the
2339 // interval lists to see if these intervals are coalescable.
2340 LiveInterval::const_iterator I = LHS.begin();
2341 LiveInterval::const_iterator IE = LHS.end();
2342 LiveInterval::const_iterator J = RHS.begin();
2343 LiveInterval::const_iterator JE = RHS.end();
2345 // Skip ahead until the first place of potential sharing.
2346 if (I->start < J->start) {
2347 I = std::upper_bound(I, IE, J->start);
2348 if (I != LHS.begin()) --I;
2349 } else if (J->start < I->start) {
2350 J = std::upper_bound(J, JE, I->start);
2351 if (J != RHS.begin()) --J;
2355 // Determine if these two live ranges overlap.
2357 if (I->start < J->start) {
2358 Overlaps = I->end > J->start;
2360 Overlaps = J->end > I->start;
2363 // If so, check value # info to determine if they are really different.
2365 // If the live range overlap will map to the same value number in the
2366 // result liverange, we can still coalesce them. If not, we can't.
2367 if (LHSValNoAssignments[I->valno->id] !=
2368 RHSValNoAssignments[J->valno->id])
2370 // If it's re-defined by an early clobber somewhere in the live range,
2371 // then conservatively abort coalescing.
2372 if (NewVNInfo[LHSValNoAssignments[I->valno->id]]->hasRedefByEC())
2376 if (I->end < J->end) {
2385 // Update kill info. Some live ranges are extended due to copy coalescing.
2386 for (DenseMap<VNInfo*, VNInfo*>::iterator I = LHSValsDefinedFromRHS.begin(),
2387 E = LHSValsDefinedFromRHS.end(); I != E; ++I) {
2388 VNInfo *VNI = I->first;
2389 unsigned LHSValID = LHSValNoAssignments[VNI->id];
2390 NewVNInfo[LHSValID]->removeKill(VNI->def);
2391 if (VNI->hasPHIKill())
2392 NewVNInfo[LHSValID]->setHasPHIKill(true);
2393 RHS.addKills(NewVNInfo[LHSValID], VNI->kills);
2396 // Update kill info. Some live ranges are extended due to copy coalescing.
2397 for (DenseMap<VNInfo*, VNInfo*>::iterator I = RHSValsDefinedFromLHS.begin(),
2398 E = RHSValsDefinedFromLHS.end(); I != E; ++I) {
2399 VNInfo *VNI = I->first;
2400 unsigned RHSValID = RHSValNoAssignments[VNI->id];
2401 NewVNInfo[RHSValID]->removeKill(VNI->def);
2402 if (VNI->hasPHIKill())
2403 NewVNInfo[RHSValID]->setHasPHIKill(true);
2404 LHS.addKills(NewVNInfo[RHSValID], VNI->kills);
2407 // If we get here, we know that we can coalesce the live ranges. Ask the
2408 // intervals to coalesce themselves now.
2409 if ((RHS.ranges.size() > LHS.ranges.size() &&
2410 TargetRegisterInfo::isVirtualRegister(LHS.reg)) ||
2411 TargetRegisterInfo::isPhysicalRegister(RHS.reg)) {
2412 RHS.join(LHS, &RHSValNoAssignments[0], &LHSValNoAssignments[0], NewVNInfo,
2416 LHS.join(RHS, &LHSValNoAssignments[0], &RHSValNoAssignments[0], NewVNInfo,
2424 // DepthMBBCompare - Comparison predicate that sort first based on the loop
2425 // depth of the basic block (the unsigned), and then on the MBB number.
2426 struct DepthMBBCompare {
2427 typedef std::pair<unsigned, MachineBasicBlock*> DepthMBBPair;
2428 bool operator()(const DepthMBBPair &LHS, const DepthMBBPair &RHS) const {
2429 // Deeper loops first
2430 if (LHS.first != RHS.first)
2431 return LHS.first > RHS.first;
2433 // Prefer blocks that are more connected in the CFG. This takes care of
2434 // the most difficult copies first while intervals are short.
2435 unsigned cl = LHS.second->pred_size() + LHS.second->succ_size();
2436 unsigned cr = RHS.second->pred_size() + RHS.second->succ_size();
2440 // As a last resort, sort by block number.
2441 return LHS.second->getNumber() < RHS.second->getNumber();
2446 void SimpleRegisterCoalescing::CopyCoalesceInMBB(MachineBasicBlock *MBB,
2447 std::vector<CopyRec> &TryAgain) {
2448 DEBUG(dbgs() << MBB->getName() << ":\n");
2450 std::vector<CopyRec> VirtCopies;
2451 std::vector<CopyRec> PhysCopies;
2452 std::vector<CopyRec> ImpDefCopies;
2453 for (MachineBasicBlock::iterator MII = MBB->begin(), E = MBB->end();
2455 MachineInstr *Inst = MII++;
2457 // If this isn't a copy nor a extract_subreg, we can't join intervals.
2458 unsigned SrcReg, DstReg, SrcSubIdx, DstSubIdx;
2459 bool isInsUndef = false;
2460 if (Inst->isExtractSubreg()) {
2461 DstReg = Inst->getOperand(0).getReg();
2462 SrcReg = Inst->getOperand(1).getReg();
2463 } else if (Inst->isInsertSubreg()) {
2464 DstReg = Inst->getOperand(0).getReg();
2465 SrcReg = Inst->getOperand(2).getReg();
2466 if (Inst->getOperand(1).isUndef())
2468 } else if (Inst->isInsertSubreg() || Inst->isSubregToReg()) {
2469 DstReg = Inst->getOperand(0).getReg();
2470 SrcReg = Inst->getOperand(2).getReg();
2471 } else if (!tii_->isMoveInstr(*Inst, SrcReg, DstReg, SrcSubIdx, DstSubIdx))
2474 bool SrcIsPhys = TargetRegisterInfo::isPhysicalRegister(SrcReg);
2475 bool DstIsPhys = TargetRegisterInfo::isPhysicalRegister(DstReg);
2477 (li_->hasInterval(SrcReg) && li_->getInterval(SrcReg).empty()))
2478 ImpDefCopies.push_back(CopyRec(Inst, 0));
2479 else if (SrcIsPhys || DstIsPhys)
2480 PhysCopies.push_back(CopyRec(Inst, 0));
2482 VirtCopies.push_back(CopyRec(Inst, 0));
2485 // Try coalescing implicit copies and insert_subreg <undef> first,
2486 // followed by copies to / from physical registers, then finally copies
2487 // from virtual registers to virtual registers.
2488 for (unsigned i = 0, e = ImpDefCopies.size(); i != e; ++i) {
2489 CopyRec &TheCopy = ImpDefCopies[i];
2491 if (!JoinCopy(TheCopy, Again))
2493 TryAgain.push_back(TheCopy);
2495 for (unsigned i = 0, e = PhysCopies.size(); i != e; ++i) {
2496 CopyRec &TheCopy = PhysCopies[i];
2498 if (!JoinCopy(TheCopy, Again))
2500 TryAgain.push_back(TheCopy);
2502 for (unsigned i = 0, e = VirtCopies.size(); i != e; ++i) {
2503 CopyRec &TheCopy = VirtCopies[i];
2505 if (!JoinCopy(TheCopy, Again))
2507 TryAgain.push_back(TheCopy);
2511 void SimpleRegisterCoalescing::joinIntervals() {
2512 DEBUG(dbgs() << "********** JOINING INTERVALS ***********\n");
2514 std::vector<CopyRec> TryAgainList;
2515 if (loopInfo->empty()) {
2516 // If there are no loops in the function, join intervals in function order.
2517 for (MachineFunction::iterator I = mf_->begin(), E = mf_->end();
2519 CopyCoalesceInMBB(I, TryAgainList);
2521 // Otherwise, join intervals in inner loops before other intervals.
2522 // Unfortunately we can't just iterate over loop hierarchy here because
2523 // there may be more MBB's than BB's. Collect MBB's for sorting.
2525 // Join intervals in the function prolog first. We want to join physical
2526 // registers with virtual registers before the intervals got too long.
2527 std::vector<std::pair<unsigned, MachineBasicBlock*> > MBBs;
2528 for (MachineFunction::iterator I = mf_->begin(), E = mf_->end();I != E;++I){
2529 MachineBasicBlock *MBB = I;
2530 MBBs.push_back(std::make_pair(loopInfo->getLoopDepth(MBB), I));
2533 // Sort by loop depth.
2534 std::sort(MBBs.begin(), MBBs.end(), DepthMBBCompare());
2536 // Finally, join intervals in loop nest order.
2537 for (unsigned i = 0, e = MBBs.size(); i != e; ++i)
2538 CopyCoalesceInMBB(MBBs[i].second, TryAgainList);
2541 // Joining intervals can allow other intervals to be joined. Iteratively join
2542 // until we make no progress.
2543 bool ProgressMade = true;
2544 while (ProgressMade) {
2545 ProgressMade = false;
2547 for (unsigned i = 0, e = TryAgainList.size(); i != e; ++i) {
2548 CopyRec &TheCopy = TryAgainList[i];
2553 bool Success = JoinCopy(TheCopy, Again);
2554 if (Success || !Again) {
2555 TheCopy.MI = 0; // Mark this one as done.
2556 ProgressMade = true;
2562 /// Return true if the two specified registers belong to different register
2563 /// classes. The registers may be either phys or virt regs.
2565 SimpleRegisterCoalescing::differingRegisterClasses(unsigned RegA,
2566 unsigned RegB) const {
2567 // Get the register classes for the first reg.
2568 if (TargetRegisterInfo::isPhysicalRegister(RegA)) {
2569 assert(TargetRegisterInfo::isVirtualRegister(RegB) &&
2570 "Shouldn't consider two physregs!");
2571 return !mri_->getRegClass(RegB)->contains(RegA);
2574 // Compare against the regclass for the second reg.
2575 const TargetRegisterClass *RegClassA = mri_->getRegClass(RegA);
2576 if (TargetRegisterInfo::isVirtualRegister(RegB)) {
2577 const TargetRegisterClass *RegClassB = mri_->getRegClass(RegB);
2578 return RegClassA != RegClassB;
2580 return !RegClassA->contains(RegB);
2583 /// lastRegisterUse - Returns the last (non-debug) use of the specific register
2584 /// between cycles Start and End or NULL if there are no uses.
2586 SimpleRegisterCoalescing::lastRegisterUse(SlotIndex Start,
2589 SlotIndex &UseIdx) const{
2590 UseIdx = SlotIndex();
2591 if (TargetRegisterInfo::isVirtualRegister(Reg)) {
2592 MachineOperand *LastUse = NULL;
2593 for (MachineRegisterInfo::use_nodbg_iterator I = mri_->use_nodbg_begin(Reg),
2594 E = mri_->use_nodbg_end(); I != E; ++I) {
2595 MachineOperand &Use = I.getOperand();
2596 MachineInstr *UseMI = Use.getParent();
2597 unsigned SrcReg, DstReg, SrcSubIdx, DstSubIdx;
2598 if (tii_->isMoveInstr(*UseMI, SrcReg, DstReg, SrcSubIdx, DstSubIdx) &&
2600 // Ignore identity copies.
2602 SlotIndex Idx = li_->getInstructionIndex(UseMI);
2603 // FIXME: Should this be Idx != UseIdx? SlotIndex() will return something
2604 // that compares higher than any other interval.
2605 if (Idx >= Start && Idx < End && Idx >= UseIdx) {
2607 UseIdx = Idx.getUseIndex();
2613 SlotIndex s = Start;
2614 SlotIndex e = End.getPrevSlot().getBaseIndex();
2616 // Skip deleted instructions
2617 MachineInstr *MI = li_->getInstructionFromIndex(e);
2618 while (e != SlotIndex() && e.getPrevIndex() >= s && !MI) {
2619 e = e.getPrevIndex();
2620 MI = li_->getInstructionFromIndex(e);
2622 if (e < s || MI == NULL)
2625 // Ignore identity copies.
2626 unsigned SrcReg, DstReg, SrcSubIdx, DstSubIdx;
2627 if (!(tii_->isMoveInstr(*MI, SrcReg, DstReg, SrcSubIdx, DstSubIdx) &&
2629 for (unsigned i = 0, NumOps = MI->getNumOperands(); i != NumOps; ++i) {
2630 MachineOperand &Use = MI->getOperand(i);
2631 if (Use.isReg() && Use.isUse() && Use.getReg() &&
2632 tri_->regsOverlap(Use.getReg(), Reg)) {
2633 UseIdx = e.getUseIndex();
2638 e = e.getPrevIndex();
2644 void SimpleRegisterCoalescing::printRegName(unsigned reg) const {
2645 if (TargetRegisterInfo::isPhysicalRegister(reg))
2646 dbgs() << tri_->getName(reg);
2648 dbgs() << "%reg" << reg;
2651 void SimpleRegisterCoalescing::releaseMemory() {
2652 JoinedCopies.clear();
2653 ReMatCopies.clear();
2657 bool SimpleRegisterCoalescing::runOnMachineFunction(MachineFunction &fn) {
2659 mri_ = &fn.getRegInfo();
2660 tm_ = &fn.getTarget();
2661 tri_ = tm_->getRegisterInfo();
2662 tii_ = tm_->getInstrInfo();
2663 li_ = &getAnalysis<LiveIntervals>();
2664 AA = &getAnalysis<AliasAnalysis>();
2665 loopInfo = &getAnalysis<MachineLoopInfo>();
2667 DEBUG(dbgs() << "********** SIMPLE REGISTER COALESCING **********\n"
2668 << "********** Function: "
2669 << ((Value*)mf_->getFunction())->getName() << '\n');
2671 allocatableRegs_ = tri_->getAllocatableSet(fn);
2672 for (TargetRegisterInfo::regclass_iterator I = tri_->regclass_begin(),
2673 E = tri_->regclass_end(); I != E; ++I)
2674 allocatableRCRegs_.insert(std::make_pair(*I,
2675 tri_->getAllocatableSet(fn, *I)));
2677 // Join (coalesce) intervals if requested.
2678 if (EnableJoining) {
2681 dbgs() << "********** INTERVALS POST JOINING **********\n";
2682 for (LiveIntervals::iterator I = li_->begin(), E = li_->end();
2684 I->second->print(dbgs(), tri_);
2690 // Perform a final pass over the instructions and compute spill weights
2691 // and remove identity moves.
2692 SmallVector<unsigned, 4> DeadDefs;
2693 for (MachineFunction::iterator mbbi = mf_->begin(), mbbe = mf_->end();
2694 mbbi != mbbe; ++mbbi) {
2695 MachineBasicBlock* mbb = mbbi;
2696 for (MachineBasicBlock::iterator mii = mbb->begin(), mie = mbb->end();
2698 MachineInstr *MI = mii;
2699 unsigned SrcReg, DstReg, SrcSubIdx, DstSubIdx;
2700 if (JoinedCopies.count(MI)) {
2701 // Delete all coalesced copies.
2702 bool DoDelete = true;
2703 if (!tii_->isMoveInstr(*MI, SrcReg, DstReg, SrcSubIdx, DstSubIdx)) {
2704 assert((MI->isExtractSubreg() || MI->isInsertSubreg() ||
2705 MI->isSubregToReg()) && "Unrecognized copy instruction");
2706 DstReg = MI->getOperand(0).getReg();
2707 if (TargetRegisterInfo::isPhysicalRegister(DstReg))
2708 // Do not delete extract_subreg, insert_subreg of physical
2709 // registers unless the definition is dead. e.g.
2710 // %DO<def> = INSERT_SUBREG %D0<undef>, %S0<kill>, 1
2711 // or else the scavenger may complain. LowerSubregs will
2712 // delete them later.
2715 if (MI->registerDefIsDead(DstReg)) {
2716 LiveInterval &li = li_->getInterval(DstReg);
2717 if (!ShortenDeadCopySrcLiveRange(li, MI))
2718 ShortenDeadCopyLiveRange(li, MI);
2722 mii = llvm::next(mii);
2724 li_->RemoveMachineInstrFromMaps(MI);
2725 mii = mbbi->erase(mii);
2731 // Now check if this is a remat'ed def instruction which is now dead.
2732 if (ReMatDefs.count(MI)) {
2734 for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i) {
2735 const MachineOperand &MO = MI->getOperand(i);
2738 unsigned Reg = MO.getReg();
2741 if (TargetRegisterInfo::isVirtualRegister(Reg))
2742 DeadDefs.push_back(Reg);
2745 if (TargetRegisterInfo::isPhysicalRegister(Reg) ||
2746 !mri_->use_empty(Reg)) {
2752 while (!DeadDefs.empty()) {
2753 unsigned DeadDef = DeadDefs.back();
2754 DeadDefs.pop_back();
2755 RemoveDeadDef(li_->getInterval(DeadDef), MI);
2757 li_->RemoveMachineInstrFromMaps(mii);
2758 mii = mbbi->erase(mii);
2764 // If the move will be an identity move delete it
2765 bool isMove= tii_->isMoveInstr(*MI, SrcReg, DstReg, SrcSubIdx, DstSubIdx);
2766 if (isMove && SrcReg == DstReg) {
2767 if (li_->hasInterval(SrcReg)) {
2768 LiveInterval &RegInt = li_->getInterval(SrcReg);
2769 // If def of this move instruction is dead, remove its live range
2770 // from the dstination register's live interval.
2771 if (MI->registerDefIsDead(DstReg)) {
2772 if (!ShortenDeadCopySrcLiveRange(RegInt, MI))
2773 ShortenDeadCopyLiveRange(RegInt, MI);
2776 li_->RemoveMachineInstrFromMaps(MI);
2777 mii = mbbi->erase(mii);
2789 /// print - Implement the dump method.
2790 void SimpleRegisterCoalescing::print(raw_ostream &O, const Module* m) const {
2794 RegisterCoalescer* llvm::createSimpleRegisterCoalescer() {
2795 return new SimpleRegisterCoalescing();
2798 // Make sure that anything that uses RegisterCoalescer pulls in this file...
2799 DEFINING_FILE_FOR(SimpleRegisterCoalescing)