1 //===-- SimpleRegisterCoalescing.cpp - Register Coalescing ----------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements a simple register coalescing pass that attempts to
11 // aggressively coalesce every register copy that it can.
13 //===----------------------------------------------------------------------===//
15 #define DEBUG_TYPE "regcoalescing"
16 #include "SimpleRegisterCoalescing.h"
17 #include "VirtRegMap.h"
18 #include "llvm/CodeGen/LiveIntervalAnalysis.h"
19 #include "llvm/Value.h"
20 #include "llvm/CodeGen/MachineFrameInfo.h"
21 #include "llvm/CodeGen/MachineInstr.h"
22 #include "llvm/CodeGen/MachineLoopInfo.h"
23 #include "llvm/CodeGen/MachineRegisterInfo.h"
24 #include "llvm/CodeGen/Passes.h"
25 #include "llvm/CodeGen/RegisterCoalescer.h"
26 #include "llvm/Target/TargetInstrInfo.h"
27 #include "llvm/Target/TargetMachine.h"
28 #include "llvm/Target/TargetOptions.h"
29 #include "llvm/Support/CommandLine.h"
30 #include "llvm/Support/Debug.h"
31 #include "llvm/ADT/SmallSet.h"
32 #include "llvm/ADT/Statistic.h"
33 #include "llvm/ADT/STLExtras.h"
38 STATISTIC(numJoins , "Number of interval joins performed");
39 STATISTIC(numCrossRCs , "Number of cross class joins performed");
40 STATISTIC(numCommutes , "Number of instruction commuting performed");
41 STATISTIC(numExtends , "Number of copies extended");
42 STATISTIC(NumReMats , "Number of instructions re-materialized");
43 STATISTIC(numPeep , "Number of identity moves eliminated after coalescing");
44 STATISTIC(numAborts , "Number of times interval joining aborted");
45 STATISTIC(numDeadValNo, "Number of valno def marked dead");
47 char SimpleRegisterCoalescing::ID = 0;
49 EnableJoining("join-liveintervals",
50 cl::desc("Coalesce copies (default=true)"),
54 NewHeuristic("new-coalescer-heuristic",
55 cl::desc("Use new coalescer heuristic"),
56 cl::init(false), cl::Hidden);
59 CrossClassJoin("join-cross-class-copies",
60 cl::desc("Coalesce cross register class copies"),
61 cl::init(false), cl::Hidden);
63 static RegisterPass<SimpleRegisterCoalescing>
64 X("simple-register-coalescing", "Simple Register Coalescing");
66 // Declare that we implement the RegisterCoalescer interface
67 static RegisterAnalysisGroup<RegisterCoalescer, true/*The Default*/> V(X);
69 const PassInfo *const llvm::SimpleRegisterCoalescingID = &X;
71 void SimpleRegisterCoalescing::getAnalysisUsage(AnalysisUsage &AU) const {
72 AU.addRequired<LiveIntervals>();
73 AU.addPreserved<LiveIntervals>();
74 AU.addRequired<MachineLoopInfo>();
75 AU.addPreserved<MachineLoopInfo>();
76 AU.addPreservedID(MachineDominatorsID);
78 AU.addPreservedID(StrongPHIEliminationID);
80 AU.addPreservedID(PHIEliminationID);
81 AU.addPreservedID(TwoAddressInstructionPassID);
82 MachineFunctionPass::getAnalysisUsage(AU);
85 /// AdjustCopiesBackFrom - We found a non-trivially-coalescable copy with IntA
86 /// being the source and IntB being the dest, thus this defines a value number
87 /// in IntB. If the source value number (in IntA) is defined by a copy from B,
88 /// see if we can merge these two pieces of B into a single value number,
89 /// eliminating a copy. For example:
93 /// B1 = A3 <- this copy
95 /// In this case, B0 can be extended to where the B1 copy lives, allowing the B1
96 /// value number to be replaced with B0 (which simplifies the B liveinterval).
98 /// This returns true if an interval was modified.
100 bool SimpleRegisterCoalescing::AdjustCopiesBackFrom(LiveInterval &IntA,
102 MachineInstr *CopyMI) {
103 unsigned CopyIdx = li_->getDefIndex(li_->getInstructionIndex(CopyMI));
105 // BValNo is a value number in B that is defined by a copy from A. 'B3' in
106 // the example above.
107 LiveInterval::iterator BLR = IntB.FindLiveRangeContaining(CopyIdx);
108 assert(BLR != IntB.end() && "Live range not found!");
109 VNInfo *BValNo = BLR->valno;
111 // Get the location that B is defined at. Two options: either this value has
112 // an unknown definition point or it is defined at CopyIdx. If unknown, we
114 if (!BValNo->copy) return false;
115 assert(BValNo->def == CopyIdx && "Copy doesn't define the value?");
117 // AValNo is the value number in A that defines the copy, A3 in the example.
118 LiveInterval::iterator ALR = IntA.FindLiveRangeContaining(CopyIdx-1);
119 assert(ALR != IntA.end() && "Live range not found!");
120 VNInfo *AValNo = ALR->valno;
121 // If it's re-defined by an early clobber somewhere in the live range, then
122 // it's not safe to eliminate the copy. FIXME: This is a temporary workaround.
124 // 172 %ECX<def> = MOV32rr %reg1039<kill>
125 // 180 INLINEASM <es:subl $5,$1
126 // sbbl $3,$0>, 10, %EAX<def>, 14, %ECX<earlyclobber,def>, 9, %EAX<kill>,
127 // 36, <fi#0>, 1, %reg0, 0, 9, %ECX<kill>, 36, <fi#1>, 1, %reg0, 0
128 // 188 %EAX<def> = MOV32rr %EAX<kill>
129 // 196 %ECX<def> = MOV32rr %ECX<kill>
130 // 204 %ECX<def> = MOV32rr %ECX<kill>
131 // 212 %EAX<def> = MOV32rr %EAX<kill>
132 // 220 %EAX<def> = MOV32rr %EAX
133 // 228 %reg1039<def> = MOV32rr %ECX<kill>
134 // The early clobber operand ties ECX input to the ECX def.
136 // The live interval of ECX is represented as this:
137 // %reg20,inf = [46,47:1)[174,230:0) 0@174-(230) 1@46-(47)
138 // The coalescer has no idea there was a def in the middle of [174,230].
139 if (AValNo->redefByEC)
142 // If AValNo is defined as a copy from IntB, we can potentially process this.
143 // Get the instruction that defines this value number.
144 unsigned SrcReg = li_->getVNInfoSourceReg(AValNo);
145 if (!SrcReg) return false; // Not defined by a copy.
147 // If the value number is not defined by a copy instruction, ignore it.
149 // If the source register comes from an interval other than IntB, we can't
151 if (SrcReg != IntB.reg) return false;
153 // Get the LiveRange in IntB that this value number starts with.
154 LiveInterval::iterator ValLR = IntB.FindLiveRangeContaining(AValNo->def-1);
155 assert(ValLR != IntB.end() && "Live range not found!");
157 // Make sure that the end of the live range is inside the same block as
159 MachineInstr *ValLREndInst = li_->getInstructionFromIndex(ValLR->end-1);
161 ValLREndInst->getParent() != CopyMI->getParent()) return false;
163 // Okay, we now know that ValLR ends in the same block that the CopyMI
164 // live-range starts. If there are no intervening live ranges between them in
165 // IntB, we can merge them.
166 if (ValLR+1 != BLR) return false;
168 // If a live interval is a physical register, conservatively check if any
169 // of its sub-registers is overlapping the live interval of the virtual
170 // register. If so, do not coalesce.
171 if (TargetRegisterInfo::isPhysicalRegister(IntB.reg) &&
172 *tri_->getSubRegisters(IntB.reg)) {
173 for (const unsigned* SR = tri_->getSubRegisters(IntB.reg); *SR; ++SR)
174 if (li_->hasInterval(*SR) && IntA.overlaps(li_->getInterval(*SR))) {
175 DOUT << "Interfere with sub-register ";
176 DEBUG(li_->getInterval(*SR).print(DOUT, tri_));
181 DOUT << "\nExtending: "; IntB.print(DOUT, tri_);
183 unsigned FillerStart = ValLR->end, FillerEnd = BLR->start;
184 // We are about to delete CopyMI, so need to remove it as the 'instruction
185 // that defines this value #'. Update the the valnum with the new defining
187 BValNo->def = FillerStart;
190 // Okay, we can merge them. We need to insert a new liverange:
191 // [ValLR.end, BLR.begin) of either value number, then we merge the
192 // two value numbers.
193 IntB.addRange(LiveRange(FillerStart, FillerEnd, BValNo));
195 // If the IntB live range is assigned to a physical register, and if that
196 // physreg has aliases,
197 if (TargetRegisterInfo::isPhysicalRegister(IntB.reg)) {
198 // Update the liveintervals of sub-registers.
199 for (const unsigned *AS = tri_->getSubRegisters(IntB.reg); *AS; ++AS) {
200 LiveInterval &AliasLI = li_->getInterval(*AS);
201 AliasLI.addRange(LiveRange(FillerStart, FillerEnd,
202 AliasLI.getNextValue(FillerStart, 0, li_->getVNInfoAllocator())));
206 // Okay, merge "B1" into the same value number as "B0".
207 if (BValNo != ValLR->valno) {
208 IntB.addKills(ValLR->valno, BValNo->kills);
209 IntB.MergeValueNumberInto(BValNo, ValLR->valno);
211 DOUT << " result = "; IntB.print(DOUT, tri_);
214 // If the source instruction was killing the source register before the
215 // merge, unset the isKill marker given the live range has been extended.
216 int UIdx = ValLREndInst->findRegisterUseOperandIdx(IntB.reg, true);
218 ValLREndInst->getOperand(UIdx).setIsKill(false);
219 IntB.removeKill(ValLR->valno, FillerStart);
226 /// HasOtherReachingDefs - Return true if there are definitions of IntB
227 /// other than BValNo val# that can reach uses of AValno val# of IntA.
228 bool SimpleRegisterCoalescing::HasOtherReachingDefs(LiveInterval &IntA,
232 for (LiveInterval::iterator AI = IntA.begin(), AE = IntA.end();
234 if (AI->valno != AValNo) continue;
235 LiveInterval::Ranges::iterator BI =
236 std::upper_bound(IntB.ranges.begin(), IntB.ranges.end(), AI->start);
237 if (BI != IntB.ranges.begin())
239 for (; BI != IntB.ranges.end() && AI->end >= BI->start; ++BI) {
240 if (BI->valno == BValNo)
242 if (BI->start <= AI->start && BI->end > AI->start)
244 if (BI->start > AI->start && BI->start < AI->end)
251 /// RemoveCopyByCommutingDef - We found a non-trivially-coalescable copy with IntA
252 /// being the source and IntB being the dest, thus this defines a value number
253 /// in IntB. If the source value number (in IntA) is defined by a commutable
254 /// instruction and its other operand is coalesced to the copy dest register,
255 /// see if we can transform the copy into a noop by commuting the definition. For
258 /// A3 = op A2 B0<kill>
260 /// B1 = A3 <- this copy
262 /// = op A3 <- more uses
266 /// B2 = op B0 A2<kill>
268 /// B1 = B2 <- now an identify copy
270 /// = op B2 <- more uses
272 /// This returns true if an interval was modified.
274 bool SimpleRegisterCoalescing::RemoveCopyByCommutingDef(LiveInterval &IntA,
276 MachineInstr *CopyMI) {
277 unsigned CopyIdx = li_->getDefIndex(li_->getInstructionIndex(CopyMI));
279 // FIXME: For now, only eliminate the copy by commuting its def when the
280 // source register is a virtual register. We want to guard against cases
281 // where the copy is a back edge copy and commuting the def lengthen the
282 // live interval of the source register to the entire loop.
283 if (TargetRegisterInfo::isPhysicalRegister(IntA.reg))
286 // BValNo is a value number in B that is defined by a copy from A. 'B3' in
287 // the example above.
288 LiveInterval::iterator BLR = IntB.FindLiveRangeContaining(CopyIdx);
289 assert(BLR != IntB.end() && "Live range not found!");
290 VNInfo *BValNo = BLR->valno;
292 // Get the location that B is defined at. Two options: either this value has
293 // an unknown definition point or it is defined at CopyIdx. If unknown, we
295 if (!BValNo->copy) return false;
296 assert(BValNo->def == CopyIdx && "Copy doesn't define the value?");
298 // AValNo is the value number in A that defines the copy, A3 in the example.
299 LiveInterval::iterator ALR = IntA.FindLiveRangeContaining(CopyIdx-1);
300 assert(ALR != IntA.end() && "Live range not found!");
301 VNInfo *AValNo = ALR->valno;
302 // If other defs can reach uses of this def, then it's not safe to perform
304 if (AValNo->def == ~0U || AValNo->def == ~1U || AValNo->hasPHIKill)
306 MachineInstr *DefMI = li_->getInstructionFromIndex(AValNo->def);
307 const TargetInstrDesc &TID = DefMI->getDesc();
309 if (!TID.isCommutable() ||
310 !tii_->CommuteChangesDestination(DefMI, NewDstIdx))
313 MachineOperand &NewDstMO = DefMI->getOperand(NewDstIdx);
314 unsigned NewReg = NewDstMO.getReg();
315 if (NewReg != IntB.reg || !NewDstMO.isKill())
318 // Make sure there are no other definitions of IntB that would reach the
319 // uses which the new definition can reach.
320 if (HasOtherReachingDefs(IntA, IntB, AValNo, BValNo))
323 // If some of the uses of IntA.reg is already coalesced away, return false.
324 // It's not possible to determine whether it's safe to perform the coalescing.
325 for (MachineRegisterInfo::use_iterator UI = mri_->use_begin(IntA.reg),
326 UE = mri_->use_end(); UI != UE; ++UI) {
327 MachineInstr *UseMI = &*UI;
328 unsigned UseIdx = li_->getInstructionIndex(UseMI);
329 LiveInterval::iterator ULR = IntA.FindLiveRangeContaining(UseIdx);
330 if (ULR == IntA.end())
332 if (ULR->valno == AValNo && JoinedCopies.count(UseMI))
336 // At this point we have decided that it is legal to do this
337 // transformation. Start by commuting the instruction.
338 MachineBasicBlock *MBB = DefMI->getParent();
339 MachineInstr *NewMI = tii_->commuteInstruction(DefMI);
342 if (NewMI != DefMI) {
343 li_->ReplaceMachineInstrInMaps(DefMI, NewMI);
344 MBB->insert(DefMI, NewMI);
347 unsigned OpIdx = NewMI->findRegisterUseOperandIdx(IntA.reg, false);
348 NewMI->getOperand(OpIdx).setIsKill();
350 bool BHasPHIKill = BValNo->hasPHIKill;
351 SmallVector<VNInfo*, 4> BDeadValNos;
352 SmallVector<unsigned, 4> BKills;
353 std::map<unsigned, unsigned> BExtend;
355 // If ALR and BLR overlaps and end of BLR extends beyond end of ALR, e.g.
364 // then do not add kills of A to the newly created B interval.
365 bool Extended = BLR->end > ALR->end && ALR->end != ALR->start;
367 BExtend[ALR->end] = BLR->end;
369 // Update uses of IntA of the specific Val# with IntB.
370 for (MachineRegisterInfo::use_iterator UI = mri_->use_begin(IntA.reg),
371 UE = mri_->use_end(); UI != UE;) {
372 MachineOperand &UseMO = UI.getOperand();
373 MachineInstr *UseMI = &*UI;
375 if (JoinedCopies.count(UseMI))
377 unsigned UseIdx = li_->getInstructionIndex(UseMI);
378 LiveInterval::iterator ULR = IntA.FindLiveRangeContaining(UseIdx);
379 if (ULR == IntA.end() || ULR->valno != AValNo)
381 UseMO.setReg(NewReg);
384 if (UseMO.isKill()) {
386 UseMO.setIsKill(false);
388 BKills.push_back(li_->getUseIndex(UseIdx)+1);
390 unsigned SrcReg, DstReg, SrcSubIdx, DstSubIdx;
391 if (!tii_->isMoveInstr(*UseMI, SrcReg, DstReg, SrcSubIdx, DstSubIdx))
393 if (DstReg == IntB.reg) {
394 // This copy will become a noop. If it's defining a new val#,
395 // remove that val# as well. However this live range is being
396 // extended to the end of the existing live range defined by the copy.
397 unsigned DefIdx = li_->getDefIndex(UseIdx);
398 const LiveRange *DLR = IntB.getLiveRangeContaining(DefIdx);
399 BHasPHIKill |= DLR->valno->hasPHIKill;
400 assert(DLR->valno->def == DefIdx);
401 BDeadValNos.push_back(DLR->valno);
402 BExtend[DLR->start] = DLR->end;
403 JoinedCopies.insert(UseMI);
404 // If this is a kill but it's going to be removed, the last use
405 // of the same val# is the new kill.
411 // We need to insert a new liverange: [ALR.start, LastUse). It may be we can
412 // simply extend BLR if CopyMI doesn't end the range.
413 DOUT << "\nExtending: "; IntB.print(DOUT, tri_);
415 // Remove val#'s defined by copies that will be coalesced away.
416 for (unsigned i = 0, e = BDeadValNos.size(); i != e; ++i)
417 IntB.removeValNo(BDeadValNos[i]);
419 // Extend BValNo by merging in IntA live ranges of AValNo. Val# definition
420 // is updated. Kills are also updated.
421 VNInfo *ValNo = BValNo;
422 ValNo->def = AValNo->def;
424 for (unsigned j = 0, ee = ValNo->kills.size(); j != ee; ++j) {
425 unsigned Kill = ValNo->kills[j];
426 if (Kill != BLR->end)
427 BKills.push_back(Kill);
429 ValNo->kills.clear();
430 for (LiveInterval::iterator AI = IntA.begin(), AE = IntA.end();
432 if (AI->valno != AValNo) continue;
433 unsigned End = AI->end;
434 std::map<unsigned, unsigned>::iterator EI = BExtend.find(End);
435 if (EI != BExtend.end())
437 IntB.addRange(LiveRange(AI->start, End, ValNo));
439 IntB.addKills(ValNo, BKills);
440 ValNo->hasPHIKill = BHasPHIKill;
442 DOUT << " result = "; IntB.print(DOUT, tri_);
445 DOUT << "\nShortening: "; IntA.print(DOUT, tri_);
446 IntA.removeValNo(AValNo);
447 DOUT << " result = "; IntA.print(DOUT, tri_);
454 /// isSameOrFallThroughBB - Return true if MBB == SuccMBB or MBB simply
455 /// fallthoughs to SuccMBB.
456 static bool isSameOrFallThroughBB(MachineBasicBlock *MBB,
457 MachineBasicBlock *SuccMBB,
458 const TargetInstrInfo *tii_) {
461 MachineBasicBlock *TBB = 0, *FBB = 0;
462 SmallVector<MachineOperand, 4> Cond;
463 return !tii_->AnalyzeBranch(*MBB, TBB, FBB, Cond) && !TBB && !FBB &&
464 MBB->isSuccessor(SuccMBB);
467 /// removeRange - Wrapper for LiveInterval::removeRange. This removes a range
468 /// from a physical register live interval as well as from the live intervals
469 /// of its sub-registers.
470 static void removeRange(LiveInterval &li, unsigned Start, unsigned End,
471 LiveIntervals *li_, const TargetRegisterInfo *tri_) {
472 li.removeRange(Start, End, true);
473 if (TargetRegisterInfo::isPhysicalRegister(li.reg)) {
474 for (const unsigned* SR = tri_->getSubRegisters(li.reg); *SR; ++SR) {
475 if (!li_->hasInterval(*SR))
477 LiveInterval &sli = li_->getInterval(*SR);
478 unsigned RemoveEnd = Start;
479 while (RemoveEnd != End) {
480 LiveInterval::iterator LR = sli.FindLiveRangeContaining(Start);
483 RemoveEnd = (LR->end < End) ? LR->end : End;
484 sli.removeRange(Start, RemoveEnd, true);
491 /// TrimLiveIntervalToLastUse - If there is a last use in the same basic block
492 /// as the copy instruction, trim the live interval to the last use and return
495 SimpleRegisterCoalescing::TrimLiveIntervalToLastUse(unsigned CopyIdx,
496 MachineBasicBlock *CopyMBB,
498 const LiveRange *LR) {
499 unsigned MBBStart = li_->getMBBStartIdx(CopyMBB);
501 MachineOperand *LastUse = lastRegisterUse(LR->start, CopyIdx-1, li.reg,
504 MachineInstr *LastUseMI = LastUse->getParent();
505 if (!isSameOrFallThroughBB(LastUseMI->getParent(), CopyMBB, tii_)) {
512 // r1025<dead> = r1024<kill>
513 if (MBBStart < LR->end)
514 removeRange(li, MBBStart, LR->end, li_, tri_);
518 // There are uses before the copy, just shorten the live range to the end
520 LastUse->setIsKill();
521 removeRange(li, li_->getDefIndex(LastUseIdx), LR->end, li_, tri_);
522 unsigned SrcReg, DstReg, SrcSubIdx, DstSubIdx;
523 if (tii_->isMoveInstr(*LastUseMI, SrcReg, DstReg, SrcSubIdx, DstSubIdx) &&
525 // Last use is itself an identity code.
526 int DeadIdx = LastUseMI->findRegisterDefOperandIdx(li.reg, false, tri_);
527 LastUseMI->getOperand(DeadIdx).setIsDead();
533 if (LR->start <= MBBStart && LR->end > MBBStart) {
534 if (LR->start == 0) {
535 assert(TargetRegisterInfo::isPhysicalRegister(li.reg));
536 // Live-in to the function but dead. Remove it from entry live-in set.
537 mf_->begin()->removeLiveIn(li.reg);
539 // FIXME: Shorten intervals in BBs that reaches this BB.
545 /// ReMaterializeTrivialDef - If the source of a copy is defined by a trivial
546 /// computation, replace the copy by rematerialize the definition.
547 bool SimpleRegisterCoalescing::ReMaterializeTrivialDef(LiveInterval &SrcInt,
549 MachineInstr *CopyMI) {
550 unsigned CopyIdx = li_->getUseIndex(li_->getInstructionIndex(CopyMI));
551 LiveInterval::iterator SrcLR = SrcInt.FindLiveRangeContaining(CopyIdx);
552 assert(SrcLR != SrcInt.end() && "Live range not found!");
553 VNInfo *ValNo = SrcLR->valno;
554 // If other defs can reach uses of this def, then it's not safe to perform
556 if (ValNo->def == ~0U || ValNo->def == ~1U || ValNo->hasPHIKill)
558 MachineInstr *DefMI = li_->getInstructionFromIndex(ValNo->def);
559 const TargetInstrDesc &TID = DefMI->getDesc();
560 if (!TID.isAsCheapAsAMove())
562 if (!DefMI->getDesc().isRematerializable() ||
563 !tii_->isTriviallyReMaterializable(DefMI))
565 bool SawStore = false;
566 if (!DefMI->isSafeToMove(tii_, SawStore))
569 unsigned DefIdx = li_->getDefIndex(CopyIdx);
570 const LiveRange *DLR= li_->getInterval(DstReg).getLiveRangeContaining(DefIdx);
571 DLR->valno->copy = NULL;
572 // Don't forget to update sub-register intervals.
573 if (TargetRegisterInfo::isPhysicalRegister(DstReg)) {
574 for (const unsigned* SR = tri_->getSubRegisters(DstReg); *SR; ++SR) {
575 if (!li_->hasInterval(*SR))
577 DLR = li_->getInterval(*SR).getLiveRangeContaining(DefIdx);
578 if (DLR && DLR->valno->copy == CopyMI)
579 DLR->valno->copy = NULL;
583 // If copy kills the source register, find the last use and propagate
585 MachineBasicBlock *MBB = CopyMI->getParent();
586 if (CopyMI->killsRegister(SrcInt.reg))
587 TrimLiveIntervalToLastUse(CopyIdx, MBB, SrcInt, SrcLR);
589 MachineBasicBlock::iterator MII = next(MachineBasicBlock::iterator(CopyMI));
590 CopyMI->removeFromParent();
591 tii_->reMaterialize(*MBB, MII, DstReg, DefMI);
592 MachineInstr *NewMI = prior(MII);
593 // CopyMI may have implicit operands, transfer them over to the newly
594 // rematerialized instruction. And update implicit def interval valnos.
595 for (unsigned i = CopyMI->getDesc().getNumOperands(),
596 e = CopyMI->getNumOperands(); i != e; ++i) {
597 MachineOperand &MO = CopyMI->getOperand(i);
598 if (MO.isReg() && MO.isImplicit())
599 NewMI->addOperand(MO);
600 if (MO.isDef() && li_->hasInterval(MO.getReg())) {
601 unsigned Reg = MO.getReg();
602 DLR = li_->getInterval(Reg).getLiveRangeContaining(DefIdx);
603 if (DLR && DLR->valno->copy == CopyMI)
604 DLR->valno->copy = NULL;
608 li_->ReplaceMachineInstrInMaps(CopyMI, NewMI);
609 MBB->getParent()->DeleteMachineInstr(CopyMI);
610 ReMatCopies.insert(CopyMI);
611 ReMatDefs.insert(DefMI);
616 /// isBackEdgeCopy - Returns true if CopyMI is a back edge copy.
618 bool SimpleRegisterCoalescing::isBackEdgeCopy(MachineInstr *CopyMI,
619 unsigned DstReg) const {
620 MachineBasicBlock *MBB = CopyMI->getParent();
621 const MachineLoop *L = loopInfo->getLoopFor(MBB);
624 if (MBB != L->getLoopLatch())
627 LiveInterval &LI = li_->getInterval(DstReg);
628 unsigned DefIdx = li_->getInstructionIndex(CopyMI);
629 LiveInterval::const_iterator DstLR =
630 LI.FindLiveRangeContaining(li_->getDefIndex(DefIdx));
631 if (DstLR == LI.end())
633 unsigned KillIdx = li_->getMBBEndIdx(MBB) + 1;
634 if (DstLR->valno->kills.size() == 1 &&
635 DstLR->valno->kills[0] == KillIdx && DstLR->valno->hasPHIKill)
640 /// UpdateRegDefsUses - Replace all defs and uses of SrcReg to DstReg and
641 /// update the subregister number if it is not zero. If DstReg is a
642 /// physical register and the existing subregister number of the def / use
643 /// being updated is not zero, make sure to set it to the correct physical
646 SimpleRegisterCoalescing::UpdateRegDefsUses(unsigned SrcReg, unsigned DstReg,
648 bool DstIsPhys = TargetRegisterInfo::isPhysicalRegister(DstReg);
649 if (DstIsPhys && SubIdx) {
650 // Figure out the real physical register we are updating with.
651 DstReg = tri_->getSubReg(DstReg, SubIdx);
655 for (MachineRegisterInfo::reg_iterator I = mri_->reg_begin(SrcReg),
656 E = mri_->reg_end(); I != E; ) {
657 MachineOperand &O = I.getOperand();
658 MachineInstr *UseMI = &*I;
660 unsigned OldSubIdx = O.getSubReg();
662 unsigned UseDstReg = DstReg;
664 UseDstReg = tri_->getSubReg(DstReg, OldSubIdx);
666 unsigned CopySrcReg, CopyDstReg, CopySrcSubIdx, CopyDstSubIdx;
667 if (tii_->isMoveInstr(*UseMI, CopySrcReg, CopyDstReg,
668 CopySrcSubIdx, CopyDstSubIdx) &&
669 CopySrcReg != CopyDstReg &&
670 CopySrcReg == SrcReg && CopyDstReg != UseDstReg) {
671 // If the use is a copy and it won't be coalesced away, and its source
672 // is defined by a trivial computation, try to rematerialize it instead.
673 if (ReMaterializeTrivialDef(li_->getInterval(SrcReg), CopyDstReg,UseMI))
682 // Sub-register indexes goes from small to large. e.g.
683 // RAX: 1 -> AL, 2 -> AX, 3 -> EAX
684 // EAX: 1 -> AL, 2 -> AX
685 // So RAX's sub-register 2 is AX, RAX's sub-regsiter 3 is EAX, whose
686 // sub-register 2 is also AX.
687 if (SubIdx && OldSubIdx && SubIdx != OldSubIdx)
688 assert(OldSubIdx < SubIdx && "Conflicting sub-register index!");
691 // Remove would-be duplicated kill marker.
692 if (O.isKill() && UseMI->killsRegister(DstReg))
696 // After updating the operand, check if the machine instruction has
697 // become a copy. If so, update its val# information.
698 const TargetInstrDesc &TID = UseMI->getDesc();
699 unsigned CopySrcReg, CopyDstReg, CopySrcSubIdx, CopyDstSubIdx;
700 if (TID.getNumDefs() == 1 && TID.getNumOperands() > 2 &&
701 tii_->isMoveInstr(*UseMI, CopySrcReg, CopyDstReg,
702 CopySrcSubIdx, CopyDstSubIdx) &&
703 CopySrcReg != CopyDstReg &&
704 (TargetRegisterInfo::isVirtualRegister(CopyDstReg) ||
705 allocatableRegs_[CopyDstReg])) {
706 LiveInterval &LI = li_->getInterval(CopyDstReg);
707 unsigned DefIdx = li_->getDefIndex(li_->getInstructionIndex(UseMI));
708 const LiveRange *DLR = LI.getLiveRangeContaining(DefIdx);
709 if (DLR->valno->def == DefIdx)
710 DLR->valno->copy = UseMI;
715 /// RemoveDeadImpDef - Remove implicit_def instructions which are "re-defining"
716 /// registers due to insert_subreg coalescing. e.g.
718 /// r1025 = implicit_def
719 /// r1025 = insert_subreg r1025, r1024
723 /// r1025 = implicit_def
724 /// r1025 = insert_subreg r1025, r1025
727 SimpleRegisterCoalescing::RemoveDeadImpDef(unsigned Reg, LiveInterval &LI) {
728 for (MachineRegisterInfo::reg_iterator I = mri_->reg_begin(Reg),
729 E = mri_->reg_end(); I != E; ) {
730 MachineOperand &O = I.getOperand();
731 MachineInstr *DefMI = &*I;
735 if (DefMI->getOpcode() != TargetInstrInfo::IMPLICIT_DEF)
737 if (!LI.liveBeforeAndAt(li_->getInstructionIndex(DefMI)))
739 li_->RemoveMachineInstrFromMaps(DefMI);
740 DefMI->eraseFromParent();
744 /// RemoveUnnecessaryKills - Remove kill markers that are no longer accurate
745 /// due to live range lengthening as the result of coalescing.
746 void SimpleRegisterCoalescing::RemoveUnnecessaryKills(unsigned Reg,
748 for (MachineRegisterInfo::use_iterator UI = mri_->use_begin(Reg),
749 UE = mri_->use_end(); UI != UE; ++UI) {
750 MachineOperand &UseMO = UI.getOperand();
751 if (UseMO.isKill()) {
752 MachineInstr *UseMI = UseMO.getParent();
753 unsigned UseIdx = li_->getUseIndex(li_->getInstructionIndex(UseMI));
754 if (JoinedCopies.count(UseMI))
756 const LiveRange *UI = LI.getLiveRangeContaining(UseIdx);
757 if (!UI || !LI.isKill(UI->valno, UseIdx+1))
758 UseMO.setIsKill(false);
763 /// removeIntervalIfEmpty - Check if the live interval of a physical register
764 /// is empty, if so remove it and also remove the empty intervals of its
765 /// sub-registers. Return true if live interval is removed.
766 static bool removeIntervalIfEmpty(LiveInterval &li, LiveIntervals *li_,
767 const TargetRegisterInfo *tri_) {
769 if (TargetRegisterInfo::isPhysicalRegister(li.reg))
770 for (const unsigned* SR = tri_->getSubRegisters(li.reg); *SR; ++SR) {
771 if (!li_->hasInterval(*SR))
773 LiveInterval &sli = li_->getInterval(*SR);
775 li_->removeInterval(*SR);
777 li_->removeInterval(li.reg);
783 /// ShortenDeadCopyLiveRange - Shorten a live range defined by a dead copy.
784 /// Return true if live interval is removed.
785 bool SimpleRegisterCoalescing::ShortenDeadCopyLiveRange(LiveInterval &li,
786 MachineInstr *CopyMI) {
787 unsigned CopyIdx = li_->getInstructionIndex(CopyMI);
788 LiveInterval::iterator MLR =
789 li.FindLiveRangeContaining(li_->getDefIndex(CopyIdx));
791 return false; // Already removed by ShortenDeadCopySrcLiveRange.
792 unsigned RemoveStart = MLR->start;
793 unsigned RemoveEnd = MLR->end;
794 // Remove the liverange that's defined by this.
795 if (RemoveEnd == li_->getDefIndex(CopyIdx)+1) {
796 removeRange(li, RemoveStart, RemoveEnd, li_, tri_);
797 return removeIntervalIfEmpty(li, li_, tri_);
802 /// RemoveDeadDef - If a def of a live interval is now determined dead, remove
803 /// the val# it defines. If the live interval becomes empty, remove it as well.
804 bool SimpleRegisterCoalescing::RemoveDeadDef(LiveInterval &li,
805 MachineInstr *DefMI) {
806 unsigned DefIdx = li_->getDefIndex(li_->getInstructionIndex(DefMI));
807 LiveInterval::iterator MLR = li.FindLiveRangeContaining(DefIdx);
808 if (DefIdx != MLR->valno->def)
810 li.removeValNo(MLR->valno);
811 return removeIntervalIfEmpty(li, li_, tri_);
814 /// PropagateDeadness - Propagate the dead marker to the instruction which
815 /// defines the val#.
816 static void PropagateDeadness(LiveInterval &li, MachineInstr *CopyMI,
817 unsigned &LRStart, LiveIntervals *li_,
818 const TargetRegisterInfo* tri_) {
819 MachineInstr *DefMI =
820 li_->getInstructionFromIndex(li_->getDefIndex(LRStart));
821 if (DefMI && DefMI != CopyMI) {
822 int DeadIdx = DefMI->findRegisterDefOperandIdx(li.reg, false, tri_);
824 DefMI->getOperand(DeadIdx).setIsDead();
825 // A dead def should have a single cycle interval.
831 /// ShortenDeadCopySrcLiveRange - Shorten a live range as it's artificially
832 /// extended by a dead copy. Mark the last use (if any) of the val# as kill as
833 /// ends the live range there. If there isn't another use, then this live range
834 /// is dead. Return true if live interval is removed.
836 SimpleRegisterCoalescing::ShortenDeadCopySrcLiveRange(LiveInterval &li,
837 MachineInstr *CopyMI) {
838 unsigned CopyIdx = li_->getInstructionIndex(CopyMI);
840 // FIXME: special case: function live in. It can be a general case if the
841 // first instruction index starts at > 0 value.
842 assert(TargetRegisterInfo::isPhysicalRegister(li.reg));
843 // Live-in to the function but dead. Remove it from entry live-in set.
844 if (mf_->begin()->isLiveIn(li.reg))
845 mf_->begin()->removeLiveIn(li.reg);
846 const LiveRange *LR = li.getLiveRangeContaining(CopyIdx);
847 removeRange(li, LR->start, LR->end, li_, tri_);
848 return removeIntervalIfEmpty(li, li_, tri_);
851 LiveInterval::iterator LR = li.FindLiveRangeContaining(CopyIdx-1);
853 // Livein but defined by a phi.
856 unsigned RemoveStart = LR->start;
857 unsigned RemoveEnd = li_->getDefIndex(CopyIdx)+1;
858 if (LR->end > RemoveEnd)
859 // More uses past this copy? Nothing to do.
862 // If there is a last use in the same bb, we can't remove the live range.
863 // Shorten the live interval and return.
864 MachineBasicBlock *CopyMBB = CopyMI->getParent();
865 if (TrimLiveIntervalToLastUse(CopyIdx, CopyMBB, li, LR))
868 MachineBasicBlock *StartMBB = li_->getMBBFromIndex(RemoveStart);
869 if (!isSameOrFallThroughBB(StartMBB, CopyMBB, tii_))
870 // If the live range starts in another mbb and the copy mbb is not a fall
871 // through mbb, then we can only cut the range from the beginning of the
873 RemoveStart = li_->getMBBStartIdx(CopyMBB) + 1;
875 if (LR->valno->def == RemoveStart) {
876 // If the def MI defines the val# and this copy is the only kill of the
877 // val#, then propagate the dead marker.
878 if (li.isOnlyLROfValNo(LR)) {
879 PropagateDeadness(li, CopyMI, RemoveStart, li_, tri_);
882 if (li.isKill(LR->valno, RemoveEnd))
883 li.removeKill(LR->valno, RemoveEnd);
886 removeRange(li, RemoveStart, RemoveEnd, li_, tri_);
887 return removeIntervalIfEmpty(li, li_, tri_);
890 /// CanCoalesceWithImpDef - Returns true if the specified copy instruction
891 /// from an implicit def to another register can be coalesced away.
892 bool SimpleRegisterCoalescing::CanCoalesceWithImpDef(MachineInstr *CopyMI,
894 LiveInterval &ImpLi) const{
895 if (!CopyMI->killsRegister(ImpLi.reg))
897 unsigned CopyIdx = li_->getDefIndex(li_->getInstructionIndex(CopyMI));
898 LiveInterval::iterator LR = li.FindLiveRangeContaining(CopyIdx);
901 if (LR->valno->hasPHIKill)
903 if (LR->valno->def != CopyIdx)
905 // Make sure all of val# uses are copies.
906 for (MachineRegisterInfo::use_iterator UI = mri_->use_begin(li.reg),
907 UE = mri_->use_end(); UI != UE;) {
908 MachineInstr *UseMI = &*UI;
910 if (JoinedCopies.count(UseMI))
912 unsigned UseIdx = li_->getUseIndex(li_->getInstructionIndex(UseMI));
913 LiveInterval::iterator ULR = li.FindLiveRangeContaining(UseIdx);
914 if (ULR == li.end() || ULR->valno != LR->valno)
916 // If the use is not a use, then it's not safe to coalesce the move.
917 unsigned SrcReg, DstReg, SrcSubIdx, DstSubIdx;
918 if (!tii_->isMoveInstr(*UseMI, SrcReg, DstReg, SrcSubIdx, DstSubIdx)) {
919 if (UseMI->getOpcode() == TargetInstrInfo::INSERT_SUBREG &&
920 UseMI->getOperand(1).getReg() == li.reg)
929 /// RemoveCopiesFromValNo - The specified value# is defined by an implicit
930 /// def and it is being removed. Turn all copies from this value# into
931 /// identity copies so they will be removed.
932 void SimpleRegisterCoalescing::RemoveCopiesFromValNo(LiveInterval &li,
934 SmallVector<MachineInstr*, 4> ImpDefs;
935 MachineOperand *LastUse = NULL;
936 unsigned LastUseIdx = li_->getUseIndex(VNI->def);
937 for (MachineRegisterInfo::reg_iterator RI = mri_->reg_begin(li.reg),
938 RE = mri_->reg_end(); RI != RE;) {
939 MachineOperand *MO = &RI.getOperand();
940 MachineInstr *MI = &*RI;
943 if (MI->getOpcode() == TargetInstrInfo::IMPLICIT_DEF) {
944 ImpDefs.push_back(MI);
948 if (JoinedCopies.count(MI))
950 unsigned UseIdx = li_->getUseIndex(li_->getInstructionIndex(MI));
951 LiveInterval::iterator ULR = li.FindLiveRangeContaining(UseIdx);
952 if (ULR == li.end() || ULR->valno != VNI)
954 // If the use is a copy, turn it into an identity copy.
955 unsigned SrcReg, DstReg, SrcSubIdx, DstSubIdx;
956 if (tii_->isMoveInstr(*MI, SrcReg, DstReg, SrcSubIdx, DstSubIdx) &&
958 // Each use MI may have multiple uses of this register. Change them all.
959 for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i) {
960 MachineOperand &MO = MI->getOperand(i);
961 if (MO.isReg() && MO.getReg() == li.reg)
964 JoinedCopies.insert(MI);
965 } else if (UseIdx > LastUseIdx) {
971 LastUse->setIsKill();
973 // Remove dead implicit_def's.
974 while (!ImpDefs.empty()) {
975 MachineInstr *ImpDef = ImpDefs.back();
977 li_->RemoveMachineInstrFromMaps(ImpDef);
978 ImpDef->eraseFromParent();
983 /// getMatchingSuperReg - Return a super-register of the specified register
984 /// Reg so its sub-register of index SubIdx is Reg.
985 static unsigned getMatchingSuperReg(unsigned Reg, unsigned SubIdx,
986 const TargetRegisterClass *RC,
987 const TargetRegisterInfo* TRI) {
988 for (const unsigned *SRs = TRI->getSuperRegisters(Reg);
989 unsigned SR = *SRs; ++SRs)
990 if (Reg == TRI->getSubReg(SR, SubIdx) && RC->contains(SR))
995 /// isWinToJoinCrossClass - Return true if it's profitable to coalesce
996 /// two virtual registers from different register classes.
998 SimpleRegisterCoalescing::isWinToJoinCrossClass(unsigned LargeReg,
1000 unsigned Threshold) {
1001 // Then make sure the intervals are *short*.
1002 LiveInterval &LargeInt = li_->getInterval(LargeReg);
1003 LiveInterval &SmallInt = li_->getInterval(SmallReg);
1004 unsigned LargeSize = li_->getApproximateInstructionCount(LargeInt);
1005 unsigned SmallSize = li_->getApproximateInstructionCount(SmallInt);
1006 if (SmallSize > Threshold || LargeSize > Threshold)
1007 if ((float)std::distance(mri_->use_begin(SmallReg),
1008 mri_->use_end()) / SmallSize <
1009 (float)std::distance(mri_->use_begin(LargeReg),
1010 mri_->use_end()) / LargeSize)
1015 /// HasIncompatibleSubRegDefUse - If we are trying to coalesce a virtual
1016 /// register with a physical register, check if any of the virtual register
1017 /// operand is a sub-register use or def. If so, make sure it won't result
1018 /// in an illegal extract_subreg or insert_subreg instruction. e.g.
1019 /// vr1024 = extract_subreg vr1025, 1
1021 /// vr1024 = mov8rr AH
1022 /// If vr1024 is coalesced with AH, the extract_subreg is now illegal since
1023 /// AH does not have a super-reg whose sub-register 1 is AH.
1025 SimpleRegisterCoalescing::HasIncompatibleSubRegDefUse(MachineInstr *CopyMI,
1028 for (MachineRegisterInfo::reg_iterator I = mri_->reg_begin(VirtReg),
1029 E = mri_->reg_end(); I != E; ++I) {
1030 MachineOperand &O = I.getOperand();
1031 MachineInstr *MI = &*I;
1032 if (MI == CopyMI || JoinedCopies.count(MI))
1034 unsigned SubIdx = O.getSubReg();
1035 if (SubIdx && !tri_->getSubReg(PhysReg, SubIdx))
1037 if (MI->getOpcode() == TargetInstrInfo::EXTRACT_SUBREG) {
1038 SubIdx = MI->getOperand(2).getImm();
1039 if (O.isUse() && !tri_->getSubReg(PhysReg, SubIdx))
1042 unsigned SrcReg = MI->getOperand(1).getReg();
1043 const TargetRegisterClass *RC =
1044 TargetRegisterInfo::isPhysicalRegister(SrcReg)
1045 ? tri_->getPhysicalRegisterRegClass(SrcReg)
1046 : mri_->getRegClass(SrcReg);
1047 if (!getMatchingSuperReg(PhysReg, SubIdx, RC, tri_))
1051 if (MI->getOpcode() == TargetInstrInfo::INSERT_SUBREG) {
1052 SubIdx = MI->getOperand(3).getImm();
1053 if (VirtReg == MI->getOperand(0).getReg()) {
1054 if (!tri_->getSubReg(PhysReg, SubIdx))
1057 unsigned DstReg = MI->getOperand(0).getReg();
1058 const TargetRegisterClass *RC =
1059 TargetRegisterInfo::isPhysicalRegister(DstReg)
1060 ? tri_->getPhysicalRegisterRegClass(DstReg)
1061 : mri_->getRegClass(DstReg);
1062 if (!getMatchingSuperReg(PhysReg, SubIdx, RC, tri_))
1071 /// CanJoinExtractSubRegToPhysReg - Return true if it's possible to coalesce
1072 /// an extract_subreg where dst is a physical register, e.g.
1073 /// cl = EXTRACT_SUBREG reg1024, 1
1075 SimpleRegisterCoalescing::CanJoinExtractSubRegToPhysReg(unsigned DstReg,
1076 unsigned SrcReg, unsigned SubIdx,
1077 unsigned &RealDstReg) {
1078 const TargetRegisterClass *RC = mri_->getRegClass(SrcReg);
1079 RealDstReg = getMatchingSuperReg(DstReg, SubIdx, RC, tri_);
1080 assert(RealDstReg && "Invalid extract_subreg instruction!");
1082 // For this type of EXTRACT_SUBREG, conservatively
1083 // check if the live interval of the source register interfere with the
1084 // actual super physical register we are trying to coalesce with.
1085 LiveInterval &RHS = li_->getInterval(SrcReg);
1086 if (li_->hasInterval(RealDstReg) &&
1087 RHS.overlaps(li_->getInterval(RealDstReg))) {
1088 DOUT << "Interfere with register ";
1089 DEBUG(li_->getInterval(RealDstReg).print(DOUT, tri_));
1090 return false; // Not coalescable
1092 for (const unsigned* SR = tri_->getSubRegisters(RealDstReg); *SR; ++SR)
1093 if (li_->hasInterval(*SR) && RHS.overlaps(li_->getInterval(*SR))) {
1094 DOUT << "Interfere with sub-register ";
1095 DEBUG(li_->getInterval(*SR).print(DOUT, tri_));
1096 return false; // Not coalescable
1101 /// CanJoinInsertSubRegToPhysReg - Return true if it's possible to coalesce
1102 /// an insert_subreg where src is a physical register, e.g.
1103 /// reg1024 = INSERT_SUBREG reg1024, c1, 0
1105 SimpleRegisterCoalescing::CanJoinInsertSubRegToPhysReg(unsigned DstReg,
1106 unsigned SrcReg, unsigned SubIdx,
1107 unsigned &RealSrcReg) {
1108 const TargetRegisterClass *RC = mri_->getRegClass(DstReg);
1109 RealSrcReg = getMatchingSuperReg(SrcReg, SubIdx, RC, tri_);
1110 assert(RealSrcReg && "Invalid extract_subreg instruction!");
1112 LiveInterval &RHS = li_->getInterval(DstReg);
1113 if (li_->hasInterval(RealSrcReg) &&
1114 RHS.overlaps(li_->getInterval(RealSrcReg))) {
1115 DOUT << "Interfere with register ";
1116 DEBUG(li_->getInterval(RealSrcReg).print(DOUT, tri_));
1117 return false; // Not coalescable
1119 for (const unsigned* SR = tri_->getSubRegisters(RealSrcReg); *SR; ++SR)
1120 if (li_->hasInterval(*SR) && RHS.overlaps(li_->getInterval(*SR))) {
1121 DOUT << "Interfere with sub-register ";
1122 DEBUG(li_->getInterval(*SR).print(DOUT, tri_));
1123 return false; // Not coalescable
1128 /// JoinCopy - Attempt to join intervals corresponding to SrcReg/DstReg,
1129 /// which are the src/dst of the copy instruction CopyMI. This returns true
1130 /// if the copy was successfully coalesced away. If it is not currently
1131 /// possible to coalesce this interval, but it may be possible if other
1132 /// things get coalesced, then it returns true by reference in 'Again'.
1133 bool SimpleRegisterCoalescing::JoinCopy(CopyRec &TheCopy, bool &Again) {
1134 MachineInstr *CopyMI = TheCopy.MI;
1137 if (JoinedCopies.count(CopyMI) || ReMatCopies.count(CopyMI))
1138 return false; // Already done.
1140 DOUT << li_->getInstructionIndex(CopyMI) << '\t' << *CopyMI;
1142 unsigned SrcReg, DstReg, SrcSubIdx, DstSubIdx;
1143 bool isExtSubReg = CopyMI->getOpcode() == TargetInstrInfo::EXTRACT_SUBREG;
1144 bool isInsSubReg = CopyMI->getOpcode() == TargetInstrInfo::INSERT_SUBREG;
1145 unsigned SubIdx = 0;
1147 DstReg = CopyMI->getOperand(0).getReg();
1148 SrcReg = CopyMI->getOperand(1).getReg();
1149 } else if (isInsSubReg) {
1150 if (CopyMI->getOperand(2).getSubReg()) {
1151 DOUT << "\tSource of insert_subreg is already coalesced "
1152 << "to another register.\n";
1153 return false; // Not coalescable.
1155 DstReg = CopyMI->getOperand(0).getReg();
1156 SrcReg = CopyMI->getOperand(2).getReg();
1157 } else if (!tii_->isMoveInstr(*CopyMI, SrcReg, DstReg, SrcSubIdx, DstSubIdx)){
1158 assert(0 && "Unrecognized copy instruction!");
1162 // If they are already joined we continue.
1163 if (SrcReg == DstReg) {
1164 DOUT << "\tCopy already coalesced.\n";
1165 return false; // Not coalescable.
1168 bool SrcIsPhys = TargetRegisterInfo::isPhysicalRegister(SrcReg);
1169 bool DstIsPhys = TargetRegisterInfo::isPhysicalRegister(DstReg);
1171 // If they are both physical registers, we cannot join them.
1172 if (SrcIsPhys && DstIsPhys) {
1173 DOUT << "\tCan not coalesce physregs.\n";
1174 return false; // Not coalescable.
1177 // We only join virtual registers with allocatable physical registers.
1178 if (SrcIsPhys && !allocatableRegs_[SrcReg]) {
1179 DOUT << "\tSrc reg is unallocatable physreg.\n";
1180 return false; // Not coalescable.
1182 if (DstIsPhys && !allocatableRegs_[DstReg]) {
1183 DOUT << "\tDst reg is unallocatable physreg.\n";
1184 return false; // Not coalescable.
1187 // Should be non-null only when coalescing to a sub-register class.
1188 bool CrossRC = false;
1189 const TargetRegisterClass *NewRC = NULL;
1190 MachineBasicBlock *CopyMBB = CopyMI->getParent();
1191 unsigned RealDstReg = 0;
1192 unsigned RealSrcReg = 0;
1193 if (isExtSubReg || isInsSubReg) {
1194 SubIdx = CopyMI->getOperand(isExtSubReg ? 2 : 3).getImm();
1195 if (SrcIsPhys && isExtSubReg) {
1196 // r1024 = EXTRACT_SUBREG EAX, 0 then r1024 is really going to be
1197 // coalesced with AX.
1198 unsigned DstSubIdx = CopyMI->getOperand(0).getSubReg();
1200 // r1024<2> = EXTRACT_SUBREG EAX, 2. Then r1024 has already been
1201 // coalesced to a larger register so the subreg indices cancel out.
1202 if (DstSubIdx != SubIdx) {
1203 DOUT << "\t Sub-register indices mismatch.\n";
1204 return false; // Not coalescable.
1207 SrcReg = tri_->getSubReg(SrcReg, SubIdx);
1209 } else if (DstIsPhys && isInsSubReg) {
1210 // EAX = INSERT_SUBREG EAX, r1024, 0
1211 unsigned SrcSubIdx = CopyMI->getOperand(2).getSubReg();
1213 // EAX = INSERT_SUBREG EAX, r1024<2>, 2 Then r1024 has already been
1214 // coalesced to a larger register so the subreg indices cancel out.
1215 if (SrcSubIdx != SubIdx) {
1216 DOUT << "\t Sub-register indices mismatch.\n";
1217 return false; // Not coalescable.
1220 DstReg = tri_->getSubReg(DstReg, SubIdx);
1222 } else if ((DstIsPhys && isExtSubReg) || (SrcIsPhys && isInsSubReg)) {
1223 if (CopyMI->getOperand(1).getSubReg()) {
1224 DOUT << "\tSrc of extract_subreg already coalesced with reg"
1225 << " of a super-class.\n";
1226 return false; // Not coalescable.
1230 if (!CanJoinExtractSubRegToPhysReg(DstReg, SrcReg, SubIdx, RealDstReg))
1231 return false; // Not coalescable
1233 if (!CanJoinInsertSubRegToPhysReg(DstReg, SrcReg, SubIdx, RealSrcReg))
1234 return false; // Not coalescable
1238 unsigned OldSubIdx = isExtSubReg ? CopyMI->getOperand(0).getSubReg()
1239 : CopyMI->getOperand(2).getSubReg();
1241 if (OldSubIdx == SubIdx && !differingRegisterClasses(SrcReg, DstReg))
1242 // r1024<2> = EXTRACT_SUBREG r1025, 2. Then r1024 has already been
1243 // coalesced to a larger register so the subreg indices cancel out.
1244 // Also check if the other larger register is of the same register
1245 // class as the would be resulting register.
1248 DOUT << "\t Sub-register indices mismatch.\n";
1249 return false; // Not coalescable.
1253 unsigned LargeReg = isExtSubReg ? SrcReg : DstReg;
1254 unsigned SmallReg = isExtSubReg ? DstReg : SrcReg;
1255 unsigned Limit= allocatableRCRegs_[mri_->getRegClass(SmallReg)].count();
1256 if (!isWinToJoinCrossClass(LargeReg, SmallReg, Limit)) {
1257 Again = true; // May be possible to coalesce later.
1262 } else if (differingRegisterClasses(SrcReg, DstReg)) {
1263 if (!CrossClassJoin)
1267 // FIXME: What if the result of a EXTRACT_SUBREG is then coalesced
1268 // with another? If it's the resulting destination register, then
1269 // the subidx must be propagated to uses (but only those defined
1270 // by the EXTRACT_SUBREG). If it's being coalesced into another
1271 // register, it should be safe because register is assumed to have
1272 // the register class of the super-register.
1274 // Process moves where one of the registers have a sub-register index.
1275 MachineOperand *DstMO = CopyMI->findRegisterDefOperand(DstReg);
1276 if (DstMO->getSubReg())
1277 // FIXME: Can we handle this?
1279 MachineOperand *SrcMO = CopyMI->findRegisterUseOperand(SrcReg);
1280 SubIdx = SrcMO->getSubReg();
1282 // This is not a extract_subreg but it looks like one.
1283 // e.g. %cl = MOV16rr %reg1024:2
1286 if (!CanJoinExtractSubRegToPhysReg(DstReg, SrcReg, SubIdx,RealDstReg))
1287 return false; // Not coalescable
1292 const TargetRegisterClass *SrcRC= SrcIsPhys ? 0 : mri_->getRegClass(SrcReg);
1293 const TargetRegisterClass *DstRC= DstIsPhys ? 0 : mri_->getRegClass(DstReg);
1294 unsigned LargeReg = SrcReg;
1295 unsigned SmallReg = DstReg;
1298 // Now determine the register class of the joined register.
1300 if (SubIdx && DstRC && DstRC->isASubClass()) {
1301 // This is a move to a sub-register class. However, the source is a
1302 // sub-register of a larger register class. We don't know what should
1303 // the register class be. FIXME.
1307 Limit = allocatableRCRegs_[DstRC].count();
1308 } else if (!SrcIsPhys && !SrcIsPhys) {
1309 unsigned SrcSize = SrcRC->getSize();
1310 unsigned DstSize = DstRC->getSize();
1311 if (SrcSize < DstSize)
1312 // For example X86::MOVSD2PDrr copies from FR64 to VR128.
1314 else if (DstSize > SrcSize) {
1316 std::swap(LargeReg, SmallReg);
1318 unsigned SrcNumRegs = SrcRC->getNumRegs();
1319 unsigned DstNumRegs = DstRC->getNumRegs();
1320 if (DstNumRegs < SrcNumRegs)
1321 // Sub-register class?
1323 else if (SrcNumRegs < DstNumRegs) {
1325 std::swap(LargeReg, SmallReg);
1327 // No idea what's the right register class to use.
1332 // If we are joining two virtual registers and the resulting register
1333 // class is more restrictive (fewer register, smaller size). Check if it's
1334 // worth doing the merge.
1335 if (!SrcIsPhys && !DstIsPhys &&
1336 (isExtSubReg || DstRC->isASubClass()) &&
1337 !isWinToJoinCrossClass(LargeReg, SmallReg,
1338 allocatableRCRegs_[NewRC].count())) {
1339 DOUT << "\tSrc/Dest are different register classes.\n";
1340 // Allow the coalescer to try again in case either side gets coalesced to
1341 // a physical register that's compatible with the other side. e.g.
1342 // r1024 = MOV32to32_ r1025
1343 // But later r1024 is assigned EAX then r1025 may be coalesced with EAX.
1344 Again = true; // May be possible to coalesce later.
1349 // Will it create illegal extract_subreg / insert_subreg?
1350 if (SrcIsPhys && HasIncompatibleSubRegDefUse(CopyMI, DstReg, SrcReg))
1352 if (DstIsPhys && HasIncompatibleSubRegDefUse(CopyMI, SrcReg, DstReg))
1355 LiveInterval &SrcInt = li_->getInterval(SrcReg);
1356 LiveInterval &DstInt = li_->getInterval(DstReg);
1357 assert(SrcInt.reg == SrcReg && DstInt.reg == DstReg &&
1358 "Register mapping is horribly broken!");
1360 DOUT << "\t\tInspecting "; SrcInt.print(DOUT, tri_);
1361 DOUT << " and "; DstInt.print(DOUT, tri_);
1364 // Save a copy of the virtual register live interval. We'll manually
1365 // merge this into the "real" physical register live interval this is
1367 LiveInterval *SavedLI = 0;
1369 SavedLI = li_->dupInterval(&SrcInt);
1370 else if (RealSrcReg)
1371 SavedLI = li_->dupInterval(&DstInt);
1373 // Check if it is necessary to propagate "isDead" property.
1374 if (!isExtSubReg && !isInsSubReg) {
1375 MachineOperand *mopd = CopyMI->findRegisterDefOperand(DstReg, false);
1376 bool isDead = mopd->isDead();
1378 // We need to be careful about coalescing a source physical register with a
1379 // virtual register. Once the coalescing is done, it cannot be broken and
1380 // these are not spillable! If the destination interval uses are far away,
1381 // think twice about coalescing them!
1382 if (!isDead && (SrcIsPhys || DstIsPhys)) {
1383 LiveInterval &JoinVInt = SrcIsPhys ? DstInt : SrcInt;
1384 unsigned JoinVReg = SrcIsPhys ? DstReg : SrcReg;
1385 unsigned JoinPReg = SrcIsPhys ? SrcReg : DstReg;
1386 const TargetRegisterClass *RC = mri_->getRegClass(JoinVReg);
1387 unsigned Threshold = allocatableRCRegs_[RC].count() * 2;
1388 if (TheCopy.isBackEdge)
1389 Threshold *= 2; // Favors back edge copies.
1391 // If the virtual register live interval is long but it has low use desity,
1392 // do not join them, instead mark the physical register as its allocation
1394 unsigned Length = li_->getApproximateInstructionCount(JoinVInt);
1395 if (Length > Threshold &&
1396 (((float)std::distance(mri_->use_begin(JoinVReg), mri_->use_end())
1397 / Length) < (1.0 / Threshold))) {
1398 JoinVInt.preference = JoinPReg;
1400 DOUT << "\tMay tie down a physical register, abort!\n";
1401 Again = true; // May be possible to coalesce later.
1407 // Okay, attempt to join these two intervals. On failure, this returns false.
1408 // Otherwise, if one of the intervals being joined is a physreg, this method
1409 // always canonicalizes DstInt to be it. The output "SrcInt" will not have
1410 // been modified, so we can use this information below to update aliases.
1411 bool Swapped = false;
1412 // If SrcInt is implicitly defined, it's safe to coalesce.
1413 bool isEmpty = SrcInt.empty();
1414 if (isEmpty && !CanCoalesceWithImpDef(CopyMI, DstInt, SrcInt)) {
1415 // Only coalesce an empty interval (defined by implicit_def) with
1416 // another interval which has a valno defined by the CopyMI and the CopyMI
1417 // is a kill of the implicit def.
1418 DOUT << "Not profitable!\n";
1422 if (!isEmpty && !JoinIntervals(DstInt, SrcInt, Swapped)) {
1423 // Coalescing failed.
1425 // If definition of source is defined by trivial computation, try
1426 // rematerializing it.
1427 if (!isExtSubReg && !isInsSubReg &&
1428 ReMaterializeTrivialDef(SrcInt, DstInt.reg, CopyMI))
1431 // If we can eliminate the copy without merging the live ranges, do so now.
1432 if (!isExtSubReg && !isInsSubReg &&
1433 (AdjustCopiesBackFrom(SrcInt, DstInt, CopyMI) ||
1434 RemoveCopyByCommutingDef(SrcInt, DstInt, CopyMI))) {
1435 JoinedCopies.insert(CopyMI);
1439 // Otherwise, we are unable to join the intervals.
1440 DOUT << "Interference!\n";
1441 Again = true; // May be possible to coalesce later.
1445 LiveInterval *ResSrcInt = &SrcInt;
1446 LiveInterval *ResDstInt = &DstInt;
1448 std::swap(SrcReg, DstReg);
1449 std::swap(ResSrcInt, ResDstInt);
1451 assert(TargetRegisterInfo::isVirtualRegister(SrcReg) &&
1452 "LiveInterval::join didn't work right!");
1454 // If we're about to merge live ranges into a physical register live interval,
1455 // we have to update any aliased register's live ranges to indicate that they
1456 // have clobbered values for this range.
1457 if (TargetRegisterInfo::isPhysicalRegister(DstReg)) {
1458 // If this is a extract_subreg where dst is a physical register, e.g.
1459 // cl = EXTRACT_SUBREG reg1024, 1
1460 // then create and update the actual physical register allocated to RHS.
1461 if (RealDstReg || RealSrcReg) {
1462 LiveInterval &RealInt =
1463 li_->getOrCreateInterval(RealDstReg ? RealDstReg : RealSrcReg);
1464 for (LiveInterval::const_vni_iterator I = SavedLI->vni_begin(),
1465 E = SavedLI->vni_end(); I != E; ++I) {
1466 const VNInfo *ValNo = *I;
1467 VNInfo *NewValNo = RealInt.getNextValue(ValNo->def, ValNo->copy,
1468 li_->getVNInfoAllocator());
1469 NewValNo->hasPHIKill = ValNo->hasPHIKill;
1470 NewValNo->redefByEC = ValNo->redefByEC;
1471 RealInt.addKills(NewValNo, ValNo->kills);
1472 RealInt.MergeValueInAsValue(*SavedLI, ValNo, NewValNo);
1474 RealInt.weight += SavedLI->weight;
1475 DstReg = RealDstReg ? RealDstReg : RealSrcReg;
1478 // Update the liveintervals of sub-registers.
1479 for (const unsigned *AS = tri_->getSubRegisters(DstReg); *AS; ++AS)
1480 li_->getOrCreateInterval(*AS).MergeInClobberRanges(*ResSrcInt,
1481 li_->getVNInfoAllocator());
1484 // If this is a EXTRACT_SUBREG, make sure the result of coalescing is the
1485 // larger super-register.
1486 if ((isExtSubReg || isInsSubReg) && !SrcIsPhys && !DstIsPhys) {
1487 if ((isExtSubReg && !Swapped) || (isInsSubReg && Swapped)) {
1488 ResSrcInt->Copy(*ResDstInt, li_->getVNInfoAllocator());
1489 std::swap(SrcReg, DstReg);
1490 std::swap(ResSrcInt, ResDstInt);
1494 // Coalescing to a virtual register that is of a sub-register class of the
1495 // other. Make sure the resulting register is set to the right register class.
1499 mri_->setRegClass(DstReg, NewRC);
1503 // Add all copies that define val# in the source interval into the queue.
1504 for (LiveInterval::const_vni_iterator i = ResSrcInt->vni_begin(),
1505 e = ResSrcInt->vni_end(); i != e; ++i) {
1506 const VNInfo *vni = *i;
1507 if (!vni->def || vni->def == ~1U || vni->def == ~0U)
1509 MachineInstr *CopyMI = li_->getInstructionFromIndex(vni->def);
1510 unsigned NewSrcReg, NewDstReg, NewSrcSubIdx, NewDstSubIdx;
1512 JoinedCopies.count(CopyMI) == 0 &&
1513 tii_->isMoveInstr(*CopyMI, NewSrcReg, NewDstReg,
1514 NewSrcSubIdx, NewDstSubIdx)) {
1515 unsigned LoopDepth = loopInfo->getLoopDepth(CopyMBB);
1516 JoinQueue->push(CopyRec(CopyMI, LoopDepth,
1517 isBackEdgeCopy(CopyMI, DstReg)));
1522 // Remember to delete the copy instruction.
1523 JoinedCopies.insert(CopyMI);
1525 // Some live range has been lengthened due to colaescing, eliminate the
1526 // unnecessary kills.
1527 RemoveUnnecessaryKills(SrcReg, *ResDstInt);
1528 if (TargetRegisterInfo::isVirtualRegister(DstReg))
1529 RemoveUnnecessaryKills(DstReg, *ResDstInt);
1534 // r1024 = implicit_def
1537 RemoveDeadImpDef(DstReg, *ResDstInt);
1538 UpdateRegDefsUses(SrcReg, DstReg, SubIdx);
1540 // SrcReg is guarateed to be the register whose live interval that is
1542 li_->removeInterval(SrcReg);
1544 // Manually deleted the live interval copy.
1551 // Now the copy is being coalesced away, the val# previously defined
1552 // by the copy is being defined by an IMPLICIT_DEF which defines a zero
1553 // length interval. Remove the val#.
1554 unsigned CopyIdx = li_->getDefIndex(li_->getInstructionIndex(CopyMI));
1555 const LiveRange *LR = ResDstInt->getLiveRangeContaining(CopyIdx);
1556 VNInfo *ImpVal = LR->valno;
1557 assert(ImpVal->def == CopyIdx);
1558 unsigned NextDef = LR->end;
1559 RemoveCopiesFromValNo(*ResDstInt, ImpVal);
1560 ResDstInt->removeValNo(ImpVal);
1561 LR = ResDstInt->FindLiveRangeContaining(NextDef);
1562 if (LR != ResDstInt->end() && LR->valno->def == NextDef) {
1563 // Special case: vr1024 = implicit_def
1564 // vr1024 = insert_subreg vr1024, vr1025, c
1565 // The insert_subreg becomes a "copy" that defines a val# which can itself
1566 // be coalesced away.
1567 MachineInstr *DefMI = li_->getInstructionFromIndex(NextDef);
1568 if (DefMI->getOpcode() == TargetInstrInfo::INSERT_SUBREG)
1569 LR->valno->copy = DefMI;
1573 // If resulting interval has a preference that no longer fits because of subreg
1574 // coalescing, just clear the preference.
1575 if (ResDstInt->preference && (isExtSubReg || isInsSubReg) &&
1576 TargetRegisterInfo::isVirtualRegister(ResDstInt->reg)) {
1577 const TargetRegisterClass *RC = mri_->getRegClass(ResDstInt->reg);
1578 if (!RC->contains(ResDstInt->preference))
1579 ResDstInt->preference = 0;
1582 DOUT << "\n\t\tJoined. Result = "; ResDstInt->print(DOUT, tri_);
1589 /// ComputeUltimateVN - Assuming we are going to join two live intervals,
1590 /// compute what the resultant value numbers for each value in the input two
1591 /// ranges will be. This is complicated by copies between the two which can
1592 /// and will commonly cause multiple value numbers to be merged into one.
1594 /// VN is the value number that we're trying to resolve. InstDefiningValue
1595 /// keeps track of the new InstDefiningValue assignment for the result
1596 /// LiveInterval. ThisFromOther/OtherFromThis are sets that keep track of
1597 /// whether a value in this or other is a copy from the opposite set.
1598 /// ThisValNoAssignments/OtherValNoAssignments keep track of value #'s that have
1599 /// already been assigned.
1601 /// ThisFromOther[x] - If x is defined as a copy from the other interval, this
1602 /// contains the value number the copy is from.
1604 static unsigned ComputeUltimateVN(VNInfo *VNI,
1605 SmallVector<VNInfo*, 16> &NewVNInfo,
1606 DenseMap<VNInfo*, VNInfo*> &ThisFromOther,
1607 DenseMap<VNInfo*, VNInfo*> &OtherFromThis,
1608 SmallVector<int, 16> &ThisValNoAssignments,
1609 SmallVector<int, 16> &OtherValNoAssignments) {
1610 unsigned VN = VNI->id;
1612 // If the VN has already been computed, just return it.
1613 if (ThisValNoAssignments[VN] >= 0)
1614 return ThisValNoAssignments[VN];
1615 // assert(ThisValNoAssignments[VN] != -2 && "Cyclic case?");
1617 // If this val is not a copy from the other val, then it must be a new value
1618 // number in the destination.
1619 DenseMap<VNInfo*, VNInfo*>::iterator I = ThisFromOther.find(VNI);
1620 if (I == ThisFromOther.end()) {
1621 NewVNInfo.push_back(VNI);
1622 return ThisValNoAssignments[VN] = NewVNInfo.size()-1;
1624 VNInfo *OtherValNo = I->second;
1626 // Otherwise, this *is* a copy from the RHS. If the other side has already
1627 // been computed, return it.
1628 if (OtherValNoAssignments[OtherValNo->id] >= 0)
1629 return ThisValNoAssignments[VN] = OtherValNoAssignments[OtherValNo->id];
1631 // Mark this value number as currently being computed, then ask what the
1632 // ultimate value # of the other value is.
1633 ThisValNoAssignments[VN] = -2;
1634 unsigned UltimateVN =
1635 ComputeUltimateVN(OtherValNo, NewVNInfo, OtherFromThis, ThisFromOther,
1636 OtherValNoAssignments, ThisValNoAssignments);
1637 return ThisValNoAssignments[VN] = UltimateVN;
1640 static bool InVector(VNInfo *Val, const SmallVector<VNInfo*, 8> &V) {
1641 return std::find(V.begin(), V.end(), Val) != V.end();
1644 /// RangeIsDefinedByCopyFromReg - Return true if the specified live range of
1645 /// the specified live interval is defined by a copy from the specified
1647 bool SimpleRegisterCoalescing::RangeIsDefinedByCopyFromReg(LiveInterval &li,
1650 unsigned SrcReg = li_->getVNInfoSourceReg(LR->valno);
1653 if (LR->valno->def == ~0U &&
1654 TargetRegisterInfo::isPhysicalRegister(li.reg) &&
1655 *tri_->getSuperRegisters(li.reg)) {
1656 // It's a sub-register live interval, we may not have precise information.
1658 MachineInstr *DefMI = li_->getInstructionFromIndex(LR->start);
1659 unsigned SrcReg, DstReg, SrcSubIdx, DstSubIdx;
1661 tii_->isMoveInstr(*DefMI, SrcReg, DstReg, SrcSubIdx, DstSubIdx) &&
1662 DstReg == li.reg && SrcReg == Reg) {
1663 // Cache computed info.
1664 LR->valno->def = LR->start;
1665 LR->valno->copy = DefMI;
1672 /// SimpleJoin - Attempt to joint the specified interval into this one. The
1673 /// caller of this method must guarantee that the RHS only contains a single
1674 /// value number and that the RHS is not defined by a copy from this
1675 /// interval. This returns false if the intervals are not joinable, or it
1676 /// joins them and returns true.
1677 bool SimpleRegisterCoalescing::SimpleJoin(LiveInterval &LHS, LiveInterval &RHS){
1678 assert(RHS.containsOneValue());
1680 // Some number (potentially more than one) value numbers in the current
1681 // interval may be defined as copies from the RHS. Scan the overlapping
1682 // portions of the LHS and RHS, keeping track of this and looking for
1683 // overlapping live ranges that are NOT defined as copies. If these exist, we
1686 LiveInterval::iterator LHSIt = LHS.begin(), LHSEnd = LHS.end();
1687 LiveInterval::iterator RHSIt = RHS.begin(), RHSEnd = RHS.end();
1689 if (LHSIt->start < RHSIt->start) {
1690 LHSIt = std::upper_bound(LHSIt, LHSEnd, RHSIt->start);
1691 if (LHSIt != LHS.begin()) --LHSIt;
1692 } else if (RHSIt->start < LHSIt->start) {
1693 RHSIt = std::upper_bound(RHSIt, RHSEnd, LHSIt->start);
1694 if (RHSIt != RHS.begin()) --RHSIt;
1697 SmallVector<VNInfo*, 8> EliminatedLHSVals;
1700 // Determine if these live intervals overlap.
1701 bool Overlaps = false;
1702 if (LHSIt->start <= RHSIt->start)
1703 Overlaps = LHSIt->end > RHSIt->start;
1705 Overlaps = RHSIt->end > LHSIt->start;
1707 // If the live intervals overlap, there are two interesting cases: if the
1708 // LHS interval is defined by a copy from the RHS, it's ok and we record
1709 // that the LHS value # is the same as the RHS. If it's not, then we cannot
1710 // coalesce these live ranges and we bail out.
1712 // If we haven't already recorded that this value # is safe, check it.
1713 if (!InVector(LHSIt->valno, EliminatedLHSVals)) {
1714 // Copy from the RHS?
1715 if (!RangeIsDefinedByCopyFromReg(LHS, LHSIt, RHS.reg))
1716 return false; // Nope, bail out.
1718 if (LHSIt->contains(RHSIt->valno->def))
1719 // Here is an interesting situation:
1721 // vr1025 = copy vr1024
1726 // Even though vr1025 is copied from vr1024, it's not safe to
1727 // coalesced them since live range of vr1025 intersects the
1728 // def of vr1024. This happens because vr1025 is assigned the
1729 // value of the previous iteration of vr1024.
1731 EliminatedLHSVals.push_back(LHSIt->valno);
1734 // We know this entire LHS live range is okay, so skip it now.
1735 if (++LHSIt == LHSEnd) break;
1739 if (LHSIt->end < RHSIt->end) {
1740 if (++LHSIt == LHSEnd) break;
1742 // One interesting case to check here. It's possible that we have
1743 // something like "X3 = Y" which defines a new value number in the LHS,
1744 // and is the last use of this liverange of the RHS. In this case, we
1745 // want to notice this copy (so that it gets coalesced away) even though
1746 // the live ranges don't actually overlap.
1747 if (LHSIt->start == RHSIt->end) {
1748 if (InVector(LHSIt->valno, EliminatedLHSVals)) {
1749 // We already know that this value number is going to be merged in
1750 // if coalescing succeeds. Just skip the liverange.
1751 if (++LHSIt == LHSEnd) break;
1753 // Otherwise, if this is a copy from the RHS, mark it as being merged
1755 if (RangeIsDefinedByCopyFromReg(LHS, LHSIt, RHS.reg)) {
1756 if (LHSIt->contains(RHSIt->valno->def))
1757 // Here is an interesting situation:
1759 // vr1025 = copy vr1024
1764 // Even though vr1025 is copied from vr1024, it's not safe to
1765 // coalesced them since live range of vr1025 intersects the
1766 // def of vr1024. This happens because vr1025 is assigned the
1767 // value of the previous iteration of vr1024.
1769 EliminatedLHSVals.push_back(LHSIt->valno);
1771 // We know this entire LHS live range is okay, so skip it now.
1772 if (++LHSIt == LHSEnd) break;
1777 if (++RHSIt == RHSEnd) break;
1781 // If we got here, we know that the coalescing will be successful and that
1782 // the value numbers in EliminatedLHSVals will all be merged together. Since
1783 // the most common case is that EliminatedLHSVals has a single number, we
1784 // optimize for it: if there is more than one value, we merge them all into
1785 // the lowest numbered one, then handle the interval as if we were merging
1786 // with one value number.
1787 VNInfo *LHSValNo = NULL;
1788 if (EliminatedLHSVals.size() > 1) {
1789 // Loop through all the equal value numbers merging them into the smallest
1791 VNInfo *Smallest = EliminatedLHSVals[0];
1792 for (unsigned i = 1, e = EliminatedLHSVals.size(); i != e; ++i) {
1793 if (EliminatedLHSVals[i]->id < Smallest->id) {
1794 // Merge the current notion of the smallest into the smaller one.
1795 LHS.MergeValueNumberInto(Smallest, EliminatedLHSVals[i]);
1796 Smallest = EliminatedLHSVals[i];
1798 // Merge into the smallest.
1799 LHS.MergeValueNumberInto(EliminatedLHSVals[i], Smallest);
1802 LHSValNo = Smallest;
1803 } else if (EliminatedLHSVals.empty()) {
1804 if (TargetRegisterInfo::isPhysicalRegister(LHS.reg) &&
1805 *tri_->getSuperRegisters(LHS.reg))
1806 // Imprecise sub-register information. Can't handle it.
1808 assert(0 && "No copies from the RHS?");
1810 LHSValNo = EliminatedLHSVals[0];
1813 // Okay, now that there is a single LHS value number that we're merging the
1814 // RHS into, update the value number info for the LHS to indicate that the
1815 // value number is defined where the RHS value number was.
1816 const VNInfo *VNI = RHS.getValNumInfo(0);
1817 LHSValNo->def = VNI->def;
1818 LHSValNo->copy = VNI->copy;
1820 // Okay, the final step is to loop over the RHS live intervals, adding them to
1822 LHSValNo->hasPHIKill |= VNI->hasPHIKill;
1823 LHS.addKills(LHSValNo, VNI->kills);
1824 LHS.MergeRangesInAsValue(RHS, LHSValNo);
1825 LHS.weight += RHS.weight;
1826 if (RHS.preference && !LHS.preference)
1827 LHS.preference = RHS.preference;
1832 /// JoinIntervals - Attempt to join these two intervals. On failure, this
1833 /// returns false. Otherwise, if one of the intervals being joined is a
1834 /// physreg, this method always canonicalizes LHS to be it. The output
1835 /// "RHS" will not have been modified, so we can use this information
1836 /// below to update aliases.
1838 SimpleRegisterCoalescing::JoinIntervals(LiveInterval &LHS, LiveInterval &RHS,
1840 // Compute the final value assignment, assuming that the live ranges can be
1842 SmallVector<int, 16> LHSValNoAssignments;
1843 SmallVector<int, 16> RHSValNoAssignments;
1844 DenseMap<VNInfo*, VNInfo*> LHSValsDefinedFromRHS;
1845 DenseMap<VNInfo*, VNInfo*> RHSValsDefinedFromLHS;
1846 SmallVector<VNInfo*, 16> NewVNInfo;
1848 // If a live interval is a physical register, conservatively check if any
1849 // of its sub-registers is overlapping the live interval of the virtual
1850 // register. If so, do not coalesce.
1851 if (TargetRegisterInfo::isPhysicalRegister(LHS.reg) &&
1852 *tri_->getSubRegisters(LHS.reg)) {
1853 // If it's coalescing a virtual register to a physical register, estimate
1854 // its live interval length. This is the *cost* of scanning an entire live
1855 // interval. If the cost is low, we'll do an exhaustive check instead.
1857 // If this is something like this:
1865 // That is, the live interval of v1024 crosses a bb. Then we can't rely on
1866 // less conservative check. It's possible a sub-register is defined before
1867 // v1024 (or live in) and live out of BB1.
1868 if (RHS.containsOneValue() &&
1869 li_->intervalIsInOneMBB(RHS) &&
1870 li_->getApproximateInstructionCount(RHS) <= 10) {
1871 // Perform a more exhaustive check for some common cases.
1872 if (li_->conflictsWithPhysRegRef(RHS, LHS.reg, true, JoinedCopies))
1875 for (const unsigned* SR = tri_->getSubRegisters(LHS.reg); *SR; ++SR)
1876 if (li_->hasInterval(*SR) && RHS.overlaps(li_->getInterval(*SR))) {
1877 DOUT << "Interfere with sub-register ";
1878 DEBUG(li_->getInterval(*SR).print(DOUT, tri_));
1882 } else if (TargetRegisterInfo::isPhysicalRegister(RHS.reg) &&
1883 *tri_->getSubRegisters(RHS.reg)) {
1884 if (LHS.containsOneValue() &&
1885 li_->getApproximateInstructionCount(LHS) <= 10) {
1886 // Perform a more exhaustive check for some common cases.
1887 if (li_->conflictsWithPhysRegRef(LHS, RHS.reg, false, JoinedCopies))
1890 for (const unsigned* SR = tri_->getSubRegisters(RHS.reg); *SR; ++SR)
1891 if (li_->hasInterval(*SR) && LHS.overlaps(li_->getInterval(*SR))) {
1892 DOUT << "Interfere with sub-register ";
1893 DEBUG(li_->getInterval(*SR).print(DOUT, tri_));
1899 // Compute ultimate value numbers for the LHS and RHS values.
1900 if (RHS.containsOneValue()) {
1901 // Copies from a liveinterval with a single value are simple to handle and
1902 // very common, handle the special case here. This is important, because
1903 // often RHS is small and LHS is large (e.g. a physreg).
1905 // Find out if the RHS is defined as a copy from some value in the LHS.
1906 int RHSVal0DefinedFromLHS = -1;
1908 VNInfo *RHSValNoInfo = NULL;
1909 VNInfo *RHSValNoInfo0 = RHS.getValNumInfo(0);
1910 unsigned RHSSrcReg = li_->getVNInfoSourceReg(RHSValNoInfo0);
1911 if (RHSSrcReg == 0 || RHSSrcReg != LHS.reg) {
1912 // If RHS is not defined as a copy from the LHS, we can use simpler and
1913 // faster checks to see if the live ranges are coalescable. This joiner
1914 // can't swap the LHS/RHS intervals though.
1915 if (!TargetRegisterInfo::isPhysicalRegister(RHS.reg)) {
1916 return SimpleJoin(LHS, RHS);
1918 RHSValNoInfo = RHSValNoInfo0;
1921 // It was defined as a copy from the LHS, find out what value # it is.
1922 RHSValNoInfo = LHS.getLiveRangeContaining(RHSValNoInfo0->def-1)->valno;
1923 RHSValID = RHSValNoInfo->id;
1924 RHSVal0DefinedFromLHS = RHSValID;
1927 LHSValNoAssignments.resize(LHS.getNumValNums(), -1);
1928 RHSValNoAssignments.resize(RHS.getNumValNums(), -1);
1929 NewVNInfo.resize(LHS.getNumValNums(), NULL);
1931 // Okay, *all* of the values in LHS that are defined as a copy from RHS
1932 // should now get updated.
1933 for (LiveInterval::vni_iterator i = LHS.vni_begin(), e = LHS.vni_end();
1936 unsigned VN = VNI->id;
1937 if (unsigned LHSSrcReg = li_->getVNInfoSourceReg(VNI)) {
1938 if (LHSSrcReg != RHS.reg) {
1939 // If this is not a copy from the RHS, its value number will be
1940 // unmodified by the coalescing.
1941 NewVNInfo[VN] = VNI;
1942 LHSValNoAssignments[VN] = VN;
1943 } else if (RHSValID == -1) {
1944 // Otherwise, it is a copy from the RHS, and we don't already have a
1945 // value# for it. Keep the current value number, but remember it.
1946 LHSValNoAssignments[VN] = RHSValID = VN;
1947 NewVNInfo[VN] = RHSValNoInfo;
1948 LHSValsDefinedFromRHS[VNI] = RHSValNoInfo0;
1950 // Otherwise, use the specified value #.
1951 LHSValNoAssignments[VN] = RHSValID;
1952 if (VN == (unsigned)RHSValID) { // Else this val# is dead.
1953 NewVNInfo[VN] = RHSValNoInfo;
1954 LHSValsDefinedFromRHS[VNI] = RHSValNoInfo0;
1958 NewVNInfo[VN] = VNI;
1959 LHSValNoAssignments[VN] = VN;
1963 assert(RHSValID != -1 && "Didn't find value #?");
1964 RHSValNoAssignments[0] = RHSValID;
1965 if (RHSVal0DefinedFromLHS != -1) {
1966 // This path doesn't go through ComputeUltimateVN so just set
1968 RHSValsDefinedFromLHS[RHSValNoInfo0] = (VNInfo*)1;
1971 // Loop over the value numbers of the LHS, seeing if any are defined from
1973 for (LiveInterval::vni_iterator i = LHS.vni_begin(), e = LHS.vni_end();
1976 if (VNI->def == ~1U || VNI->copy == 0) // Src not defined by a copy?
1979 // DstReg is known to be a register in the LHS interval. If the src is
1980 // from the RHS interval, we can use its value #.
1981 if (li_->getVNInfoSourceReg(VNI) != RHS.reg)
1984 // Figure out the value # from the RHS.
1985 LHSValsDefinedFromRHS[VNI]=RHS.getLiveRangeContaining(VNI->def-1)->valno;
1988 // Loop over the value numbers of the RHS, seeing if any are defined from
1990 for (LiveInterval::vni_iterator i = RHS.vni_begin(), e = RHS.vni_end();
1993 if (VNI->def == ~1U || VNI->copy == 0) // Src not defined by a copy?
1996 // DstReg is known to be a register in the RHS interval. If the src is
1997 // from the LHS interval, we can use its value #.
1998 if (li_->getVNInfoSourceReg(VNI) != LHS.reg)
2001 // Figure out the value # from the LHS.
2002 RHSValsDefinedFromLHS[VNI]=LHS.getLiveRangeContaining(VNI->def-1)->valno;
2005 LHSValNoAssignments.resize(LHS.getNumValNums(), -1);
2006 RHSValNoAssignments.resize(RHS.getNumValNums(), -1);
2007 NewVNInfo.reserve(LHS.getNumValNums() + RHS.getNumValNums());
2009 for (LiveInterval::vni_iterator i = LHS.vni_begin(), e = LHS.vni_end();
2012 unsigned VN = VNI->id;
2013 if (LHSValNoAssignments[VN] >= 0 || VNI->def == ~1U)
2015 ComputeUltimateVN(VNI, NewVNInfo,
2016 LHSValsDefinedFromRHS, RHSValsDefinedFromLHS,
2017 LHSValNoAssignments, RHSValNoAssignments);
2019 for (LiveInterval::vni_iterator i = RHS.vni_begin(), e = RHS.vni_end();
2022 unsigned VN = VNI->id;
2023 if (RHSValNoAssignments[VN] >= 0 || VNI->def == ~1U)
2025 // If this value number isn't a copy from the LHS, it's a new number.
2026 if (RHSValsDefinedFromLHS.find(VNI) == RHSValsDefinedFromLHS.end()) {
2027 NewVNInfo.push_back(VNI);
2028 RHSValNoAssignments[VN] = NewVNInfo.size()-1;
2032 ComputeUltimateVN(VNI, NewVNInfo,
2033 RHSValsDefinedFromLHS, LHSValsDefinedFromRHS,
2034 RHSValNoAssignments, LHSValNoAssignments);
2038 // Armed with the mappings of LHS/RHS values to ultimate values, walk the
2039 // interval lists to see if these intervals are coalescable.
2040 LiveInterval::const_iterator I = LHS.begin();
2041 LiveInterval::const_iterator IE = LHS.end();
2042 LiveInterval::const_iterator J = RHS.begin();
2043 LiveInterval::const_iterator JE = RHS.end();
2045 // Skip ahead until the first place of potential sharing.
2046 if (I->start < J->start) {
2047 I = std::upper_bound(I, IE, J->start);
2048 if (I != LHS.begin()) --I;
2049 } else if (J->start < I->start) {
2050 J = std::upper_bound(J, JE, I->start);
2051 if (J != RHS.begin()) --J;
2055 // Determine if these two live ranges overlap.
2057 if (I->start < J->start) {
2058 Overlaps = I->end > J->start;
2060 Overlaps = J->end > I->start;
2063 // If so, check value # info to determine if they are really different.
2065 // If the live range overlap will map to the same value number in the
2066 // result liverange, we can still coalesce them. If not, we can't.
2067 if (LHSValNoAssignments[I->valno->id] !=
2068 RHSValNoAssignments[J->valno->id])
2072 if (I->end < J->end) {
2081 // Update kill info. Some live ranges are extended due to copy coalescing.
2082 for (DenseMap<VNInfo*, VNInfo*>::iterator I = LHSValsDefinedFromRHS.begin(),
2083 E = LHSValsDefinedFromRHS.end(); I != E; ++I) {
2084 VNInfo *VNI = I->first;
2085 unsigned LHSValID = LHSValNoAssignments[VNI->id];
2086 LiveInterval::removeKill(NewVNInfo[LHSValID], VNI->def);
2087 NewVNInfo[LHSValID]->hasPHIKill |= VNI->hasPHIKill;
2088 RHS.addKills(NewVNInfo[LHSValID], VNI->kills);
2091 // Update kill info. Some live ranges are extended due to copy coalescing.
2092 for (DenseMap<VNInfo*, VNInfo*>::iterator I = RHSValsDefinedFromLHS.begin(),
2093 E = RHSValsDefinedFromLHS.end(); I != E; ++I) {
2094 VNInfo *VNI = I->first;
2095 unsigned RHSValID = RHSValNoAssignments[VNI->id];
2096 LiveInterval::removeKill(NewVNInfo[RHSValID], VNI->def);
2097 NewVNInfo[RHSValID]->hasPHIKill |= VNI->hasPHIKill;
2098 LHS.addKills(NewVNInfo[RHSValID], VNI->kills);
2101 // If we get here, we know that we can coalesce the live ranges. Ask the
2102 // intervals to coalesce themselves now.
2103 if ((RHS.ranges.size() > LHS.ranges.size() &&
2104 TargetRegisterInfo::isVirtualRegister(LHS.reg)) ||
2105 TargetRegisterInfo::isPhysicalRegister(RHS.reg)) {
2106 RHS.join(LHS, &RHSValNoAssignments[0], &LHSValNoAssignments[0], NewVNInfo);
2109 LHS.join(RHS, &LHSValNoAssignments[0], &RHSValNoAssignments[0], NewVNInfo);
2116 // DepthMBBCompare - Comparison predicate that sort first based on the loop
2117 // depth of the basic block (the unsigned), and then on the MBB number.
2118 struct DepthMBBCompare {
2119 typedef std::pair<unsigned, MachineBasicBlock*> DepthMBBPair;
2120 bool operator()(const DepthMBBPair &LHS, const DepthMBBPair &RHS) const {
2121 if (LHS.first > RHS.first) return true; // Deeper loops first
2122 return LHS.first == RHS.first &&
2123 LHS.second->getNumber() < RHS.second->getNumber();
2128 /// getRepIntervalSize - Returns the size of the interval that represents the
2129 /// specified register.
2131 unsigned JoinPriorityQueue<SF>::getRepIntervalSize(unsigned Reg) {
2132 return Rc->getRepIntervalSize(Reg);
2135 /// CopyRecSort::operator - Join priority queue sorting function.
2137 bool CopyRecSort::operator()(CopyRec left, CopyRec right) const {
2138 // Inner loops first.
2139 if (left.LoopDepth > right.LoopDepth)
2141 else if (left.LoopDepth == right.LoopDepth)
2142 if (left.isBackEdge && !right.isBackEdge)
2147 void SimpleRegisterCoalescing::CopyCoalesceInMBB(MachineBasicBlock *MBB,
2148 std::vector<CopyRec> &TryAgain) {
2149 DOUT << ((Value*)MBB->getBasicBlock())->getName() << ":\n";
2151 std::vector<CopyRec> VirtCopies;
2152 std::vector<CopyRec> PhysCopies;
2153 std::vector<CopyRec> ImpDefCopies;
2154 unsigned LoopDepth = loopInfo->getLoopDepth(MBB);
2155 for (MachineBasicBlock::iterator MII = MBB->begin(), E = MBB->end();
2157 MachineInstr *Inst = MII++;
2159 // If this isn't a copy nor a extract_subreg, we can't join intervals.
2160 unsigned SrcReg, DstReg, SrcSubIdx, DstSubIdx;
2161 if (Inst->getOpcode() == TargetInstrInfo::EXTRACT_SUBREG) {
2162 DstReg = Inst->getOperand(0).getReg();
2163 SrcReg = Inst->getOperand(1).getReg();
2164 } else if (Inst->getOpcode() == TargetInstrInfo::INSERT_SUBREG) {
2165 DstReg = Inst->getOperand(0).getReg();
2166 SrcReg = Inst->getOperand(2).getReg();
2167 } else if (!tii_->isMoveInstr(*Inst, SrcReg, DstReg, SrcSubIdx, DstSubIdx))
2170 bool SrcIsPhys = TargetRegisterInfo::isPhysicalRegister(SrcReg);
2171 bool DstIsPhys = TargetRegisterInfo::isPhysicalRegister(DstReg);
2173 JoinQueue->push(CopyRec(Inst, LoopDepth, isBackEdgeCopy(Inst, DstReg)));
2175 if (li_->hasInterval(SrcReg) && li_->getInterval(SrcReg).empty())
2176 ImpDefCopies.push_back(CopyRec(Inst, 0, false));
2177 else if (SrcIsPhys || DstIsPhys)
2178 PhysCopies.push_back(CopyRec(Inst, 0, false));
2180 VirtCopies.push_back(CopyRec(Inst, 0, false));
2187 // Try coalescing implicit copies first, followed by copies to / from
2188 // physical registers, then finally copies from virtual registers to
2189 // virtual registers.
2190 for (unsigned i = 0, e = ImpDefCopies.size(); i != e; ++i) {
2191 CopyRec &TheCopy = ImpDefCopies[i];
2193 if (!JoinCopy(TheCopy, Again))
2195 TryAgain.push_back(TheCopy);
2197 for (unsigned i = 0, e = PhysCopies.size(); i != e; ++i) {
2198 CopyRec &TheCopy = PhysCopies[i];
2200 if (!JoinCopy(TheCopy, Again))
2202 TryAgain.push_back(TheCopy);
2204 for (unsigned i = 0, e = VirtCopies.size(); i != e; ++i) {
2205 CopyRec &TheCopy = VirtCopies[i];
2207 if (!JoinCopy(TheCopy, Again))
2209 TryAgain.push_back(TheCopy);
2213 void SimpleRegisterCoalescing::joinIntervals() {
2214 DOUT << "********** JOINING INTERVALS ***********\n";
2217 JoinQueue = new JoinPriorityQueue<CopyRecSort>(this);
2219 std::vector<CopyRec> TryAgainList;
2220 if (loopInfo->empty()) {
2221 // If there are no loops in the function, join intervals in function order.
2222 for (MachineFunction::iterator I = mf_->begin(), E = mf_->end();
2224 CopyCoalesceInMBB(I, TryAgainList);
2226 // Otherwise, join intervals in inner loops before other intervals.
2227 // Unfortunately we can't just iterate over loop hierarchy here because
2228 // there may be more MBB's than BB's. Collect MBB's for sorting.
2230 // Join intervals in the function prolog first. We want to join physical
2231 // registers with virtual registers before the intervals got too long.
2232 std::vector<std::pair<unsigned, MachineBasicBlock*> > MBBs;
2233 for (MachineFunction::iterator I = mf_->begin(), E = mf_->end();I != E;++I){
2234 MachineBasicBlock *MBB = I;
2235 MBBs.push_back(std::make_pair(loopInfo->getLoopDepth(MBB), I));
2238 // Sort by loop depth.
2239 std::sort(MBBs.begin(), MBBs.end(), DepthMBBCompare());
2241 // Finally, join intervals in loop nest order.
2242 for (unsigned i = 0, e = MBBs.size(); i != e; ++i)
2243 CopyCoalesceInMBB(MBBs[i].second, TryAgainList);
2246 // Joining intervals can allow other intervals to be joined. Iteratively join
2247 // until we make no progress.
2249 SmallVector<CopyRec, 16> TryAgain;
2250 bool ProgressMade = true;
2251 while (ProgressMade) {
2252 ProgressMade = false;
2253 while (!JoinQueue->empty()) {
2254 CopyRec R = JoinQueue->pop();
2256 bool Success = JoinCopy(R, Again);
2258 ProgressMade = true;
2260 TryAgain.push_back(R);
2264 while (!TryAgain.empty()) {
2265 JoinQueue->push(TryAgain.back());
2266 TryAgain.pop_back();
2271 bool ProgressMade = true;
2272 while (ProgressMade) {
2273 ProgressMade = false;
2275 for (unsigned i = 0, e = TryAgainList.size(); i != e; ++i) {
2276 CopyRec &TheCopy = TryAgainList[i];
2279 bool Success = JoinCopy(TheCopy, Again);
2280 if (Success || !Again) {
2281 TheCopy.MI = 0; // Mark this one as done.
2282 ProgressMade = true;
2293 /// Return true if the two specified registers belong to different register
2294 /// classes. The registers may be either phys or virt regs.
2296 SimpleRegisterCoalescing::differingRegisterClasses(unsigned RegA,
2297 unsigned RegB) const {
2298 // Get the register classes for the first reg.
2299 if (TargetRegisterInfo::isPhysicalRegister(RegA)) {
2300 assert(TargetRegisterInfo::isVirtualRegister(RegB) &&
2301 "Shouldn't consider two physregs!");
2302 return !mri_->getRegClass(RegB)->contains(RegA);
2305 // Compare against the regclass for the second reg.
2306 const TargetRegisterClass *RegClassA = mri_->getRegClass(RegA);
2307 if (TargetRegisterInfo::isVirtualRegister(RegB)) {
2308 const TargetRegisterClass *RegClassB = mri_->getRegClass(RegB);
2309 return RegClassA != RegClassB;
2311 return !RegClassA->contains(RegB);
2314 /// lastRegisterUse - Returns the last use of the specific register between
2315 /// cycles Start and End or NULL if there are no uses.
2317 SimpleRegisterCoalescing::lastRegisterUse(unsigned Start, unsigned End,
2318 unsigned Reg, unsigned &UseIdx) const{
2320 if (TargetRegisterInfo::isVirtualRegister(Reg)) {
2321 MachineOperand *LastUse = NULL;
2322 for (MachineRegisterInfo::use_iterator I = mri_->use_begin(Reg),
2323 E = mri_->use_end(); I != E; ++I) {
2324 MachineOperand &Use = I.getOperand();
2325 MachineInstr *UseMI = Use.getParent();
2326 unsigned SrcReg, DstReg, SrcSubIdx, DstSubIdx;
2327 if (tii_->isMoveInstr(*UseMI, SrcReg, DstReg, SrcSubIdx, DstSubIdx) &&
2329 // Ignore identity copies.
2331 unsigned Idx = li_->getInstructionIndex(UseMI);
2332 if (Idx >= Start && Idx < End && Idx >= UseIdx) {
2340 int e = (End-1) / InstrSlots::NUM * InstrSlots::NUM;
2343 // Skip deleted instructions
2344 MachineInstr *MI = li_->getInstructionFromIndex(e);
2345 while ((e - InstrSlots::NUM) >= s && !MI) {
2346 e -= InstrSlots::NUM;
2347 MI = li_->getInstructionFromIndex(e);
2349 if (e < s || MI == NULL)
2352 // Ignore identity copies.
2353 unsigned SrcReg, DstReg, SrcSubIdx, DstSubIdx;
2354 if (!(tii_->isMoveInstr(*MI, SrcReg, DstReg, SrcSubIdx, DstSubIdx) &&
2356 for (unsigned i = 0, NumOps = MI->getNumOperands(); i != NumOps; ++i) {
2357 MachineOperand &Use = MI->getOperand(i);
2358 if (Use.isReg() && Use.isUse() && Use.getReg() &&
2359 tri_->regsOverlap(Use.getReg(), Reg)) {
2365 e -= InstrSlots::NUM;
2372 void SimpleRegisterCoalescing::printRegName(unsigned reg) const {
2373 if (TargetRegisterInfo::isPhysicalRegister(reg))
2374 cerr << tri_->getName(reg);
2376 cerr << "%reg" << reg;
2379 void SimpleRegisterCoalescing::releaseMemory() {
2380 JoinedCopies.clear();
2381 ReMatCopies.clear();
2385 static bool isZeroLengthInterval(LiveInterval *li) {
2386 for (LiveInterval::Ranges::const_iterator
2387 i = li->ranges.begin(), e = li->ranges.end(); i != e; ++i)
2388 if (i->end - i->start > LiveIntervals::InstrSlots::NUM)
2393 /// TurnCopyIntoImpDef - If source of the specified copy is an implicit def,
2394 /// turn the copy into an implicit def.
2396 SimpleRegisterCoalescing::TurnCopyIntoImpDef(MachineBasicBlock::iterator &I,
2397 MachineBasicBlock *MBB,
2398 unsigned DstReg, unsigned SrcReg) {
2399 MachineInstr *CopyMI = &*I;
2400 unsigned CopyIdx = li_->getDefIndex(li_->getInstructionIndex(CopyMI));
2401 if (!li_->hasInterval(SrcReg))
2403 LiveInterval &SrcInt = li_->getInterval(SrcReg);
2404 if (!SrcInt.empty())
2406 if (!li_->hasInterval(DstReg))
2408 LiveInterval &DstInt = li_->getInterval(DstReg);
2409 const LiveRange *DstLR = DstInt.getLiveRangeContaining(CopyIdx);
2410 DstInt.removeValNo(DstLR->valno);
2411 CopyMI->setDesc(tii_->get(TargetInstrInfo::IMPLICIT_DEF));
2412 for (int i = CopyMI->getNumOperands() - 1, e = 0; i > e; --i)
2413 CopyMI->RemoveOperand(i);
2414 bool NoUse = mri_->use_empty(SrcReg);
2416 for (MachineRegisterInfo::reg_iterator I = mri_->reg_begin(SrcReg),
2417 E = mri_->reg_end(); I != E; ) {
2418 assert(I.getOperand().isDef());
2419 MachineInstr *DefMI = &*I;
2421 // The implicit_def source has no other uses, delete it.
2422 assert(DefMI->getOpcode() == TargetInstrInfo::IMPLICIT_DEF);
2423 li_->RemoveMachineInstrFromMaps(DefMI);
2424 DefMI->eraseFromParent();
2432 bool SimpleRegisterCoalescing::runOnMachineFunction(MachineFunction &fn) {
2434 mri_ = &fn.getRegInfo();
2435 tm_ = &fn.getTarget();
2436 tri_ = tm_->getRegisterInfo();
2437 tii_ = tm_->getInstrInfo();
2438 li_ = &getAnalysis<LiveIntervals>();
2439 loopInfo = &getAnalysis<MachineLoopInfo>();
2441 DOUT << "********** SIMPLE REGISTER COALESCING **********\n"
2442 << "********** Function: "
2443 << ((Value*)mf_->getFunction())->getName() << '\n';
2445 allocatableRegs_ = tri_->getAllocatableSet(fn);
2446 for (TargetRegisterInfo::regclass_iterator I = tri_->regclass_begin(),
2447 E = tri_->regclass_end(); I != E; ++I)
2448 allocatableRCRegs_.insert(std::make_pair(*I,
2449 tri_->getAllocatableSet(fn, *I)));
2451 // Join (coalesce) intervals if requested.
2452 if (EnableJoining) {
2455 DOUT << "********** INTERVALS POST JOINING **********\n";
2456 for (LiveIntervals::iterator I = li_->begin(), E = li_->end(); I != E; ++I){
2457 I->second->print(DOUT, tri_);
2463 // Perform a final pass over the instructions and compute spill weights
2464 // and remove identity moves.
2465 SmallVector<unsigned, 4> DeadDefs;
2466 for (MachineFunction::iterator mbbi = mf_->begin(), mbbe = mf_->end();
2467 mbbi != mbbe; ++mbbi) {
2468 MachineBasicBlock* mbb = mbbi;
2469 unsigned loopDepth = loopInfo->getLoopDepth(mbb);
2471 for (MachineBasicBlock::iterator mii = mbb->begin(), mie = mbb->end();
2473 MachineInstr *MI = mii;
2474 unsigned SrcReg, DstReg, SrcSubIdx, DstSubIdx;
2475 if (JoinedCopies.count(MI)) {
2476 // Delete all coalesced copies.
2477 if (!tii_->isMoveInstr(*MI, SrcReg, DstReg, SrcSubIdx, DstSubIdx)) {
2478 assert((MI->getOpcode() == TargetInstrInfo::EXTRACT_SUBREG ||
2479 MI->getOpcode() == TargetInstrInfo::INSERT_SUBREG) &&
2480 "Unrecognized copy instruction");
2481 DstReg = MI->getOperand(0).getReg();
2483 if (MI->registerDefIsDead(DstReg)) {
2484 LiveInterval &li = li_->getInterval(DstReg);
2485 if (!ShortenDeadCopySrcLiveRange(li, MI))
2486 ShortenDeadCopyLiveRange(li, MI);
2488 li_->RemoveMachineInstrFromMaps(MI);
2489 mii = mbbi->erase(mii);
2494 // Now check if this is a remat'ed def instruction which is now dead.
2495 if (ReMatDefs.count(MI)) {
2497 for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i) {
2498 const MachineOperand &MO = MI->getOperand(i);
2501 unsigned Reg = MO.getReg();
2504 if (TargetRegisterInfo::isVirtualRegister(Reg))
2505 DeadDefs.push_back(Reg);
2508 if (TargetRegisterInfo::isPhysicalRegister(Reg) ||
2509 !mri_->use_empty(Reg)) {
2515 while (!DeadDefs.empty()) {
2516 unsigned DeadDef = DeadDefs.back();
2517 DeadDefs.pop_back();
2518 RemoveDeadDef(li_->getInterval(DeadDef), MI);
2520 li_->RemoveMachineInstrFromMaps(mii);
2521 mii = mbbi->erase(mii);
2527 // If the move will be an identity move delete it
2528 bool isMove= tii_->isMoveInstr(*MI, SrcReg, DstReg, SrcSubIdx, DstSubIdx);
2529 if (isMove && SrcReg == DstReg) {
2530 if (li_->hasInterval(SrcReg)) {
2531 LiveInterval &RegInt = li_->getInterval(SrcReg);
2532 // If def of this move instruction is dead, remove its live range
2533 // from the dstination register's live interval.
2534 if (MI->registerDefIsDead(DstReg)) {
2535 if (!ShortenDeadCopySrcLiveRange(RegInt, MI))
2536 ShortenDeadCopyLiveRange(RegInt, MI);
2539 li_->RemoveMachineInstrFromMaps(MI);
2540 mii = mbbi->erase(mii);
2542 } else if (!isMove || !TurnCopyIntoImpDef(mii, mbb, DstReg, SrcReg)) {
2543 SmallSet<unsigned, 4> UniqueUses;
2544 for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i) {
2545 const MachineOperand &mop = MI->getOperand(i);
2546 if (mop.isReg() && mop.getReg() &&
2547 TargetRegisterInfo::isVirtualRegister(mop.getReg())) {
2548 unsigned reg = mop.getReg();
2549 // Multiple uses of reg by the same instruction. It should not
2550 // contribute to spill weight again.
2551 if (UniqueUses.count(reg) != 0)
2553 LiveInterval &RegInt = li_->getInterval(reg);
2555 li_->getSpillWeight(mop.isDef(), mop.isUse(), loopDepth);
2556 UniqueUses.insert(reg);
2564 for (LiveIntervals::iterator I = li_->begin(), E = li_->end(); I != E; ++I) {
2565 LiveInterval &LI = *I->second;
2566 if (TargetRegisterInfo::isVirtualRegister(LI.reg)) {
2567 // If the live interval length is essentially zero, i.e. in every live
2568 // range the use follows def immediately, it doesn't make sense to spill
2569 // it and hope it will be easier to allocate for this li.
2570 if (isZeroLengthInterval(&LI))
2571 LI.weight = HUGE_VALF;
2573 bool isLoad = false;
2574 SmallVector<LiveInterval*, 4> SpillIs;
2575 if (li_->isReMaterializable(LI, SpillIs, isLoad)) {
2576 // If all of the definitions of the interval are re-materializable,
2577 // it is a preferred candidate for spilling. If non of the defs are
2578 // loads, then it's potentially very cheap to re-materialize.
2579 // FIXME: this gets much more complicated once we support non-trivial
2580 // re-materialization.
2588 // Slightly prefer live interval that has been assigned a preferred reg.
2592 // Divide the weight of the interval by its size. This encourages
2593 // spilling of intervals that are large and have few uses, and
2594 // discourages spilling of small intervals with many uses.
2595 LI.weight /= li_->getApproximateInstructionCount(LI) * InstrSlots::NUM;
2603 /// print - Implement the dump method.
2604 void SimpleRegisterCoalescing::print(std::ostream &O, const Module* m) const {
2608 RegisterCoalescer* llvm::createSimpleRegisterCoalescer() {
2609 return new SimpleRegisterCoalescing();
2612 // Make sure that anything that uses RegisterCoalescer pulls in this file...
2613 DEFINING_FILE_FOR(SimpleRegisterCoalescing)