CriticalAntiDepBreaker.cpp revision 59718a4f42551fc0034b860cb8119f728023c303
12e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin//===----- CriticalAntiDepBreaker.cpp - Anti-dep breaker -------- ---------===// 22e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin// 32e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin// The LLVM Compiler Infrastructure 42e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin// 52e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin// This file is distributed under the University of Illinois Open Source 62e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin// License. See LICENSE.TXT for details. 72e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin// 82e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin//===----------------------------------------------------------------------===// 92e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin// 102e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin// This file implements the CriticalAntiDepBreaker class, which 112e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin// implements register anti-dependence breaking along a blocks 122e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin// critical path during post-RA scheduler. 132e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin// 142e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin//===----------------------------------------------------------------------===// 152e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 164de099d8ca651e00fa5fac22bace4f4dba2d0292David Goodwin#define DEBUG_TYPE "post-RA-sched" 172e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin#include "CriticalAntiDepBreaker.h" 182e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin#include "llvm/CodeGen/MachineBasicBlock.h" 192e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin#include "llvm/CodeGen/MachineFrameInfo.h" 202e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin#include "llvm/Target/TargetMachine.h" 2146df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng#include "llvm/Target/TargetInstrInfo.h" 222e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin#include "llvm/Target/TargetRegisterInfo.h" 232e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin#include "llvm/Support/Debug.h" 242e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin#include "llvm/Support/ErrorHandling.h" 252e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin#include "llvm/Support/raw_ostream.h" 262e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 272e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwinusing namespace llvm; 282e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 292e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid GoodwinCriticalAntiDepBreaker:: 3001384ef159caa7eebff0e1d703638f2e2c862092Jim GrosbachCriticalAntiDepBreaker(MachineFunction& MFi) : 312e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin AntiDepBreaker(), MF(MFi), 322e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin MRI(MF.getRegInfo()), 3346df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng TII(MF.getTarget().getInstrInfo()), 342e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin TRI(MF.getTarget().getRegisterInfo()), 359c2a034730b289a2cf48bc91aa2ef69737a7afbbBill Wendling AllocatableSet(TRI->getAllocatableSet(MF)), 369c2a034730b289a2cf48bc91aa2ef69737a7afbbBill Wendling Classes(TRI->getNumRegs(), static_cast<const TargetRegisterClass *>(0)), 379c2a034730b289a2cf48bc91aa2ef69737a7afbbBill Wendling KillIndices(TRI->getNumRegs(), 0), 389c2a034730b289a2cf48bc91aa2ef69737a7afbbBill Wendling DefIndices(TRI->getNumRegs(), 0) {} 392e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 402e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid GoodwinCriticalAntiDepBreaker::~CriticalAntiDepBreaker() { 412e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin} 422e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 432e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwinvoid CriticalAntiDepBreaker::StartBlock(MachineBasicBlock *BB) { 44990d2857654cb80e46d207533834be3047494830David Goodwin const unsigned BBSize = BB->size(); 459c2a034730b289a2cf48bc91aa2ef69737a7afbbBill Wendling for (unsigned i = 0, e = TRI->getNumRegs(); i != e; ++i) { 469c2a034730b289a2cf48bc91aa2ef69737a7afbbBill Wendling // Clear out the register class data. 479c2a034730b289a2cf48bc91aa2ef69737a7afbbBill Wendling Classes[i] = static_cast<const TargetRegisterClass *>(0); 489c2a034730b289a2cf48bc91aa2ef69737a7afbbBill Wendling 499c2a034730b289a2cf48bc91aa2ef69737a7afbbBill Wendling // Initialize the indices to indicate that no registers are live. 50990d2857654cb80e46d207533834be3047494830David Goodwin KillIndices[i] = ~0u; 51990d2857654cb80e46d207533834be3047494830David Goodwin DefIndices[i] = BBSize; 52990d2857654cb80e46d207533834be3047494830David Goodwin } 532e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 542e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // Clear "do not change" set. 552e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin KeepRegs.clear(); 562e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 572e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin bool IsReturnBlock = (!BB->empty() && BB->back().getDesc().isReturn()); 582e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 592e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // Determine the live-out physregs for this block. 602e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin if (IsReturnBlock) { 612e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // In a return block, examine the function live-out regs. 622e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin for (MachineRegisterInfo::liveout_iterator I = MRI.liveout_begin(), 632e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin E = MRI.liveout_end(); I != E; ++I) { 642e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin unsigned Reg = *I; 652e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin Classes[Reg] = reinterpret_cast<TargetRegisterClass *>(-1); 662e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin KillIndices[Reg] = BB->size(); 672e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin DefIndices[Reg] = ~0u; 689c2a034730b289a2cf48bc91aa2ef69737a7afbbBill Wendling 692e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // Repeat, for all aliases. 702e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin for (const unsigned *Alias = TRI->getAliasSet(Reg); *Alias; ++Alias) { 712e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin unsigned AliasReg = *Alias; 722e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin Classes[AliasReg] = reinterpret_cast<TargetRegisterClass *>(-1); 732e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin KillIndices[AliasReg] = BB->size(); 742e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin DefIndices[AliasReg] = ~0u; 752e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin } 762e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin } 7746df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng } 7846df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng 7946df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng // In a non-return block, examine the live-in regs of all successors. 8046df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng // Note a return block can have successors if the return instruction is 8146df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng // predicated. 8246df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng for (MachineBasicBlock::succ_iterator SI = BB->succ_begin(), 832e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin SE = BB->succ_end(); SI != SE; ++SI) 8446df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng for (MachineBasicBlock::livein_iterator I = (*SI)->livein_begin(), 852e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin E = (*SI)->livein_end(); I != E; ++I) { 8646df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng unsigned Reg = *I; 8746df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng Classes[Reg] = reinterpret_cast<TargetRegisterClass *>(-1); 8846df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng KillIndices[Reg] = BB->size(); 8946df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng DefIndices[Reg] = ~0u; 909c2a034730b289a2cf48bc91aa2ef69737a7afbbBill Wendling 9146df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng // Repeat, for all aliases. 9246df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng for (const unsigned *Alias = TRI->getAliasSet(Reg); *Alias; ++Alias) { 9346df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng unsigned AliasReg = *Alias; 9446df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng Classes[AliasReg] = reinterpret_cast<TargetRegisterClass *>(-1); 9546df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng KillIndices[AliasReg] = BB->size(); 9646df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng DefIndices[AliasReg] = ~0u; 972e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin } 9846df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng } 992e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 1002e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // Mark live-out callee-saved registers. In a return block this is 1012e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // all callee-saved registers. In non-return this is any 1022e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // callee-saved register that is not saved in the prolog. 1032e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin const MachineFrameInfo *MFI = MF.getFrameInfo(); 1042e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin BitVector Pristine = MFI->getPristineRegs(BB); 1052e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin for (const unsigned *I = TRI->getCalleeSavedRegs(); *I; ++I) { 1062e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin unsigned Reg = *I; 1072e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin if (!IsReturnBlock && !Pristine.test(Reg)) continue; 1082e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin Classes[Reg] = reinterpret_cast<TargetRegisterClass *>(-1); 1092e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin KillIndices[Reg] = BB->size(); 1102e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin DefIndices[Reg] = ~0u; 1119c2a034730b289a2cf48bc91aa2ef69737a7afbbBill Wendling 1122e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // Repeat, for all aliases. 1132e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin for (const unsigned *Alias = TRI->getAliasSet(Reg); *Alias; ++Alias) { 1142e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin unsigned AliasReg = *Alias; 1152e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin Classes[AliasReg] = reinterpret_cast<TargetRegisterClass *>(-1); 1162e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin KillIndices[AliasReg] = BB->size(); 1172e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin DefIndices[AliasReg] = ~0u; 1182e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin } 1192e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin } 1202e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin} 1212e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 1222e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwinvoid CriticalAntiDepBreaker::FinishBlock() { 1232e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin RegRefs.clear(); 1242e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin KeepRegs.clear(); 1252e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin} 1262e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 1272e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwinvoid CriticalAntiDepBreaker::Observe(MachineInstr *MI, unsigned Count, 1282e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin unsigned InsertPosIndex) { 129b0812f114b83a32c4b90a4b553c7177c557558b5Dale Johannesen if (MI->isDebugValue()) 130b0812f114b83a32c4b90a4b553c7177c557558b5Dale Johannesen return; 1312e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin assert(Count < InsertPosIndex && "Instruction index out of expected range!"); 1322e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 1332e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // Any register which was defined within the previous scheduling region 1342e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // may have been rescheduled and its lifetime may overlap with registers 1352e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // in ways not reflected in our current liveness state. For each such 1362e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // register, adjust the liveness state to be conservatively correct. 137990d2857654cb80e46d207533834be3047494830David Goodwin for (unsigned Reg = 0; Reg != TRI->getNumRegs(); ++Reg) 1382e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin if (DefIndices[Reg] < InsertPosIndex && DefIndices[Reg] >= Count) { 1392e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin assert(KillIndices[Reg] == ~0u && "Clobbered register is live!"); 1409c2a034730b289a2cf48bc91aa2ef69737a7afbbBill Wendling 1412e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // Mark this register to be non-renamable. 1422e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin Classes[Reg] = reinterpret_cast<TargetRegisterClass *>(-1); 1439c2a034730b289a2cf48bc91aa2ef69737a7afbbBill Wendling 1442e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // Move the def index to the end of the previous region, to reflect 1452e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // that the def could theoretically have been scheduled at the end. 1462e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin DefIndices[Reg] = InsertPosIndex; 1472e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin } 1482e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 1492e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin PrescanInstruction(MI); 1502e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin ScanInstruction(MI, Count); 1512e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin} 1522e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 1532e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin/// CriticalPathStep - Return the next SUnit after SU on the bottom-up 1542e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin/// critical path. 15566db3a0f10e96ae190c8a46a1a8d5242928d068cDan Gohmanstatic const SDep *CriticalPathStep(const SUnit *SU) { 15666db3a0f10e96ae190c8a46a1a8d5242928d068cDan Gohman const SDep *Next = 0; 1572e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin unsigned NextDepth = 0; 1582e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // Find the predecessor edge with the greatest depth. 15966db3a0f10e96ae190c8a46a1a8d5242928d068cDan Gohman for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end(); 1602e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin P != PE; ++P) { 16166db3a0f10e96ae190c8a46a1a8d5242928d068cDan Gohman const SUnit *PredSU = P->getSUnit(); 1622e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin unsigned PredLatency = P->getLatency(); 1632e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin unsigned PredTotalLatency = PredSU->getDepth() + PredLatency; 1642e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // In the case of a latency tie, prefer an anti-dependency edge over 1652e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // other types of edges. 1662e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin if (NextDepth < PredTotalLatency || 1672e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin (NextDepth == PredTotalLatency && P->getKind() == SDep::Anti)) { 1682e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin NextDepth = PredTotalLatency; 1692e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin Next = &*P; 1702e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin } 1712e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin } 1722e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin return Next; 1732e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin} 1742e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 1752e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwinvoid CriticalAntiDepBreaker::PrescanInstruction(MachineInstr *MI) { 17646df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng // It's not safe to change register allocation for source operands of 17746df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng // that have special allocation requirements. Also assume all registers 17846df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng // used in a call must not be changed (ABI). 17946df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng // FIXME: The issue with predicated instruction is more complex. We are being 18059718a4f42551fc0034b860cb8119f728023c303Bob Wilson // conservative here because the kill markers cannot be trusted after 18146df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng // if-conversion: 18246df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng // %R6<def> = LDR %SP, %reg0, 92, pred:14, pred:%reg0; mem:LD4[FixedStack14] 18346df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng // ... 18446df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng // STR %R0, %R6<kill>, %reg0, 0, pred:0, pred:%CPSR; mem:ST4[%395] 18546df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng // %R6<def> = LDR %SP, %reg0, 100, pred:0, pred:%CPSR; mem:LD4[FixedStack12] 18646df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng // STR %R0, %R6<kill>, %reg0, 0, pred:14, pred:%reg0; mem:ST4[%396](align=8) 18746df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng // 18846df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng // The first R6 kill is not really a kill since it's killed by a predicated 18946df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng // instruction which may not be executed. The second R6 def may or may not 19046df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng // re-define R6 so it's not safe to change it since the last R6 use cannot be 19146df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng // changed. 19246df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng bool Special = MI->getDesc().isCall() || 19346df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng MI->getDesc().hasExtraSrcRegAllocReq() || 19446df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng TII->isPredicated(MI); 19546df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng 1962e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // Scan the register operands for this instruction and update 1972e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // Classes and RegRefs. 1982e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i) { 1992e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin MachineOperand &MO = MI->getOperand(i); 2002e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin if (!MO.isReg()) continue; 2012e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin unsigned Reg = MO.getReg(); 2022e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin if (Reg == 0) continue; 2032e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin const TargetRegisterClass *NewRC = 0; 20401384ef159caa7eebff0e1d703638f2e2c862092Jim Grosbach 2052e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin if (i < MI->getDesc().getNumOperands()) 2062e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin NewRC = MI->getDesc().OpInfo[i].getRegClass(TRI); 2072e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 2082e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // For now, only allow the register to be changed if its register 2092e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // class is consistent across all uses. 2102e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin if (!Classes[Reg] && NewRC) 2112e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin Classes[Reg] = NewRC; 2122e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin else if (!NewRC || Classes[Reg] != NewRC) 2132e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin Classes[Reg] = reinterpret_cast<TargetRegisterClass *>(-1); 2142e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 2152e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // Now check for aliases. 2162e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin for (const unsigned *Alias = TRI->getAliasSet(Reg); *Alias; ++Alias) { 2172e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // If an alias of the reg is used during the live range, give up. 2182e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // Note that this allows us to skip checking if AntiDepReg 2192e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // overlaps with any of the aliases, among other things. 2202e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin unsigned AliasReg = *Alias; 2212e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin if (Classes[AliasReg]) { 2222e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin Classes[AliasReg] = reinterpret_cast<TargetRegisterClass *>(-1); 2232e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin Classes[Reg] = reinterpret_cast<TargetRegisterClass *>(-1); 2242e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin } 2252e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin } 2262e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 2272e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // If we're still willing to consider this register, note the reference. 2282e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin if (Classes[Reg] != reinterpret_cast<TargetRegisterClass *>(-1)) 2292e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin RegRefs.insert(std::make_pair(Reg, &MO)); 2302e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 23146df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng if (MO.isUse() && Special) { 2322e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin if (KeepRegs.insert(Reg)) { 2332e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin for (const unsigned *Subreg = TRI->getSubRegisters(Reg); 2342e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin *Subreg; ++Subreg) 2352e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin KeepRegs.insert(*Subreg); 2362e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin } 2372e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin } 2382e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin } 2392e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin} 2402e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 2412e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwinvoid CriticalAntiDepBreaker::ScanInstruction(MachineInstr *MI, 2422e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin unsigned Count) { 2432e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // Update liveness. 2442e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // Proceding upwards, registers that are defed but not used in this 2452e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // instruction are now dead. 24646df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng 24746df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng if (!TII->isPredicated(MI)) { 24846df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng // Predicated defs are modeled as read + write, i.e. similar to two 24946df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng // address updates. 25046df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i) { 25146df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng MachineOperand &MO = MI->getOperand(i); 25246df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng if (!MO.isReg()) continue; 25346df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng unsigned Reg = MO.getReg(); 25446df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng if (Reg == 0) continue; 25546df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng if (!MO.isDef()) continue; 25646df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng // Ignore two-addr defs. 25746df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng if (MI->isRegTiedToUseOperand(i)) continue; 25846df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng 25946df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng DefIndices[Reg] = Count; 26046df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng KillIndices[Reg] = ~0u; 26146df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng assert(((KillIndices[Reg] == ~0u) != 26246df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng (DefIndices[Reg] == ~0u)) && 26346df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng "Kill and Def maps aren't consistent for Reg!"); 26446df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng KeepRegs.erase(Reg); 26546df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng Classes[Reg] = 0; 26646df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng RegRefs.erase(Reg); 26746df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng // Repeat, for all subregs. 26846df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng for (const unsigned *Subreg = TRI->getSubRegisters(Reg); 26946df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng *Subreg; ++Subreg) { 27046df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng unsigned SubregReg = *Subreg; 27146df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng DefIndices[SubregReg] = Count; 27246df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng KillIndices[SubregReg] = ~0u; 27346df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng KeepRegs.erase(SubregReg); 27446df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng Classes[SubregReg] = 0; 27546df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng RegRefs.erase(SubregReg); 27646df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng } 27746df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng // Conservatively mark super-registers as unusable. 27846df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng for (const unsigned *Super = TRI->getSuperRegisters(Reg); 27946df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng *Super; ++Super) { 28046df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng unsigned SuperReg = *Super; 28146df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng Classes[SuperReg] = reinterpret_cast<TargetRegisterClass *>(-1); 28246df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng } 2832e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin } 2842e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin } 2852e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i) { 2862e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin MachineOperand &MO = MI->getOperand(i); 2872e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin if (!MO.isReg()) continue; 2882e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin unsigned Reg = MO.getReg(); 2892e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin if (Reg == 0) continue; 2902e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin if (!MO.isUse()) continue; 2912e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 2922e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin const TargetRegisterClass *NewRC = 0; 2932e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin if (i < MI->getDesc().getNumOperands()) 2942e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin NewRC = MI->getDesc().OpInfo[i].getRegClass(TRI); 2952e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 2962e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // For now, only allow the register to be changed if its register 2972e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // class is consistent across all uses. 2982e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin if (!Classes[Reg] && NewRC) 2992e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin Classes[Reg] = NewRC; 3002e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin else if (!NewRC || Classes[Reg] != NewRC) 3012e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin Classes[Reg] = reinterpret_cast<TargetRegisterClass *>(-1); 3022e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 3032e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin RegRefs.insert(std::make_pair(Reg, &MO)); 3042e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 3052e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // It wasn't previously live but now it is, this is a kill. 3062e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin if (KillIndices[Reg] == ~0u) { 3072e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin KillIndices[Reg] = Count; 3082e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin DefIndices[Reg] = ~0u; 3092e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin assert(((KillIndices[Reg] == ~0u) != 3102e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin (DefIndices[Reg] == ~0u)) && 3112e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin "Kill and Def maps aren't consistent for Reg!"); 3122e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin } 3132e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // Repeat, for all aliases. 3142e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin for (const unsigned *Alias = TRI->getAliasSet(Reg); *Alias; ++Alias) { 3152e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin unsigned AliasReg = *Alias; 3162e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin if (KillIndices[AliasReg] == ~0u) { 3172e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin KillIndices[AliasReg] = Count; 3182e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin DefIndices[AliasReg] = ~0u; 3192e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin } 3202e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin } 3212e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin } 3222e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin} 3232e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 3242e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwinunsigned 32580c2b0d9efc951b23f90a3cf12b9853177994961Jim GrosbachCriticalAntiDepBreaker::findSuitableFreeRegister(MachineInstr *MI, 32680c2b0d9efc951b23f90a3cf12b9853177994961Jim Grosbach unsigned AntiDepReg, 3272e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin unsigned LastNewReg, 3282973b57093b017f2e3b5f5edd0be9d4ea180f0e9Jim Grosbach const TargetRegisterClass *RC) 3292973b57093b017f2e3b5f5edd0be9d4ea180f0e9Jim Grosbach{ 3302e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin for (TargetRegisterClass::iterator R = RC->allocation_order_begin(MF), 3312e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin RE = RC->allocation_order_end(MF); R != RE; ++R) { 3322e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin unsigned NewReg = *R; 3339b041c92efb5b0f6e74e154f0a6151968dc1ab58Jim Grosbach // Don't consider non-allocatable registers 3349b041c92efb5b0f6e74e154f0a6151968dc1ab58Jim Grosbach if (!AllocatableSet.test(NewReg)) continue; 3352e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // Don't replace a register with itself. 3362e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin if (NewReg == AntiDepReg) continue; 3372e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // Don't replace a register with one that was recently used to repair 3382e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // an anti-dependence with this AntiDepReg, because that would 3392e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // re-introduce that anti-dependence. 3402e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin if (NewReg == LastNewReg) continue; 34180c2b0d9efc951b23f90a3cf12b9853177994961Jim Grosbach // If the instruction already has a def of the NewReg, it's not suitable. 34280c2b0d9efc951b23f90a3cf12b9853177994961Jim Grosbach // For example, Instruction with multiple definitions can result in this 34380c2b0d9efc951b23f90a3cf12b9853177994961Jim Grosbach // condition. 34480c2b0d9efc951b23f90a3cf12b9853177994961Jim Grosbach if (MI->modifiesRegister(NewReg, TRI)) continue; 3452e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // If NewReg is dead and NewReg's most recent def is not before 3462e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // AntiDepReg's kill, it's safe to replace AntiDepReg with NewReg. 3472973b57093b017f2e3b5f5edd0be9d4ea180f0e9Jim Grosbach assert(((KillIndices[AntiDepReg] == ~0u) != (DefIndices[AntiDepReg] == ~0u)) 3482973b57093b017f2e3b5f5edd0be9d4ea180f0e9Jim Grosbach && "Kill and Def maps aren't consistent for AntiDepReg!"); 3492973b57093b017f2e3b5f5edd0be9d4ea180f0e9Jim Grosbach assert(((KillIndices[NewReg] == ~0u) != (DefIndices[NewReg] == ~0u)) 3502973b57093b017f2e3b5f5edd0be9d4ea180f0e9Jim Grosbach && "Kill and Def maps aren't consistent for NewReg!"); 3512e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin if (KillIndices[NewReg] != ~0u || 3522e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin Classes[NewReg] == reinterpret_cast<TargetRegisterClass *>(-1) || 3532e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin KillIndices[AntiDepReg] > DefIndices[NewReg]) 3542e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin continue; 3552e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin return NewReg; 3562e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin } 3572e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 3582e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // No registers are free and available! 3592e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin return 0; 3602e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin} 3612e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 3622e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwinunsigned CriticalAntiDepBreaker:: 36366db3a0f10e96ae190c8a46a1a8d5242928d068cDan GohmanBreakAntiDependencies(const std::vector<SUnit>& SUnits, 36466db3a0f10e96ae190c8a46a1a8d5242928d068cDan Gohman MachineBasicBlock::iterator Begin, 36566db3a0f10e96ae190c8a46a1a8d5242928d068cDan Gohman MachineBasicBlock::iterator End, 3662e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin unsigned InsertPosIndex) { 3672e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // The code below assumes that there is at least one instruction, 3682e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // so just duck out immediately if the block is empty. 3692e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin if (SUnits.empty()) return 0; 3702e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 371533934e06e99a86e8c93f8ec9b9d3b2c527b747eJim Grosbach // Keep a map of the MachineInstr*'s back to the SUnit representing them. 372533934e06e99a86e8c93f8ec9b9d3b2c527b747eJim Grosbach // This is used for updating debug information. 373533934e06e99a86e8c93f8ec9b9d3b2c527b747eJim Grosbach DenseMap<MachineInstr*,const SUnit*> MISUnitMap; 374533934e06e99a86e8c93f8ec9b9d3b2c527b747eJim Grosbach 3752e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // Find the node at the bottom of the critical path. 37666db3a0f10e96ae190c8a46a1a8d5242928d068cDan Gohman const SUnit *Max = 0; 3772e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin for (unsigned i = 0, e = SUnits.size(); i != e; ++i) { 37866db3a0f10e96ae190c8a46a1a8d5242928d068cDan Gohman const SUnit *SU = &SUnits[i]; 379533934e06e99a86e8c93f8ec9b9d3b2c527b747eJim Grosbach MISUnitMap[SU->getInstr()] = SU; 3802e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin if (!Max || SU->getDepth() + SU->Latency > Max->getDepth() + Max->Latency) 3812e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin Max = SU; 3822e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin } 3832e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 3842e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin#ifndef NDEBUG 3852e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin { 38689d6a2426256b56780c7934ddad24e6ecc4f690aDavid Greene DEBUG(dbgs() << "Critical path has total latency " 3872e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin << (Max->getDepth() + Max->Latency) << "\n"); 38889d6a2426256b56780c7934ddad24e6ecc4f690aDavid Greene DEBUG(dbgs() << "Available regs:"); 3892e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin for (unsigned Reg = 0; Reg < TRI->getNumRegs(); ++Reg) { 3902e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin if (KillIndices[Reg] == ~0u) 39189d6a2426256b56780c7934ddad24e6ecc4f690aDavid Greene DEBUG(dbgs() << " " << TRI->getName(Reg)); 3922e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin } 39389d6a2426256b56780c7934ddad24e6ecc4f690aDavid Greene DEBUG(dbgs() << '\n'); 3942e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin } 3952e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin#endif 3962e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 3972e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // Track progress along the critical path through the SUnit graph as we walk 3982e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // the instructions. 39966db3a0f10e96ae190c8a46a1a8d5242928d068cDan Gohman const SUnit *CriticalPathSU = Max; 4002e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin MachineInstr *CriticalPathMI = CriticalPathSU->getInstr(); 4012e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 4022e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // Consider this pattern: 4032e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // A = ... 4042e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // ... = A 4052e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // A = ... 4062e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // ... = A 4072e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // A = ... 4082e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // ... = A 4092e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // A = ... 4102e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // ... = A 4112e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // There are three anti-dependencies here, and without special care, 4122e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // we'd break all of them using the same register: 4132e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // A = ... 4142e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // ... = A 4152e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // B = ... 4162e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // ... = B 4172e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // B = ... 4182e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // ... = B 4192e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // B = ... 4202e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // ... = B 4212e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // because at each anti-dependence, B is the first register that 4222e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // isn't A which is free. This re-introduces anti-dependencies 4232e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // at all but one of the original anti-dependencies that we were 4242e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // trying to break. To avoid this, keep track of the most recent 4252e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // register that each register was replaced with, avoid 4262e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // using it to repair an anti-dependence on the same register. 4272e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // This lets us produce this: 4282e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // A = ... 4292e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // ... = A 4302e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // B = ... 4312e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // ... = B 4322e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // C = ... 4332e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // ... = C 4342e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // B = ... 4352e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // ... = B 4362e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // This still has an anti-dependence on B, but at least it isn't on the 4372e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // original critical path. 4382e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // 4392e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // TODO: If we tracked more than one register here, we could potentially 4402e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // fix that remaining critical edge too. This is a little more involved, 4412e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // because unlike the most recent register, less recent registers should 4422e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // still be considered, though only if no other registers are available. 4439c2a034730b289a2cf48bc91aa2ef69737a7afbbBill Wendling std::vector<unsigned> LastNewReg(TRI->getNumRegs(), 0); 4442e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 4452e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // Attempt to break anti-dependence edges on the critical path. Walk the 4462e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // instructions from the bottom up, tracking information about liveness 4472e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // as we go to help determine which registers are available. 4482e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin unsigned Broken = 0; 4492e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin unsigned Count = InsertPosIndex - 1; 4502e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin for (MachineBasicBlock::iterator I = End, E = Begin; 4512e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin I != E; --Count) { 4522e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin MachineInstr *MI = --I; 453b0812f114b83a32c4b90a4b553c7177c557558b5Dale Johannesen if (MI->isDebugValue()) 454b0812f114b83a32c4b90a4b553c7177c557558b5Dale Johannesen continue; 4552e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 4562e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // Check if this instruction has a dependence on the critical path that 4572e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // is an anti-dependence that we may be able to break. If it is, set 4582e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // AntiDepReg to the non-zero register associated with the anti-dependence. 4592e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // 4602e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // We limit our attention to the critical path as a heuristic to avoid 4612e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // breaking anti-dependence edges that aren't going to significantly 4622e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // impact the overall schedule. There are a limited number of registers 4632e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // and we want to save them for the important edges. 46401384ef159caa7eebff0e1d703638f2e2c862092Jim Grosbach // 4652e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // TODO: Instructions with multiple defs could have multiple 4662e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // anti-dependencies. The current code here only knows how to break one 4672e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // edge per instruction. Note that we'd have to be able to break all of 4682e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // the anti-dependencies in an instruction in order to be effective. 4692e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin unsigned AntiDepReg = 0; 4702e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin if (MI == CriticalPathMI) { 47166db3a0f10e96ae190c8a46a1a8d5242928d068cDan Gohman if (const SDep *Edge = CriticalPathStep(CriticalPathSU)) { 47266db3a0f10e96ae190c8a46a1a8d5242928d068cDan Gohman const SUnit *NextSU = Edge->getSUnit(); 4732e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 4742e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // Only consider anti-dependence edges. 4752e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin if (Edge->getKind() == SDep::Anti) { 4762e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin AntiDepReg = Edge->getReg(); 4772e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin assert(AntiDepReg != 0 && "Anti-dependence on reg0?"); 4782e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin if (!AllocatableSet.test(AntiDepReg)) 4792e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // Don't break anti-dependencies on non-allocatable registers. 4802e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin AntiDepReg = 0; 4812e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin else if (KeepRegs.count(AntiDepReg)) 4822e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // Don't break anti-dependencies if an use down below requires 4832e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // this exact register. 4842e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin AntiDepReg = 0; 4852e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin else { 4862e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // If the SUnit has other dependencies on the SUnit that it 4872e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // anti-depends on, don't bother breaking the anti-dependency 4882e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // since those edges would prevent such units from being 4892e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // scheduled past each other regardless. 4902e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // 4912e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // Also, if there are dependencies on other SUnits with the 4922e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // same register as the anti-dependency, don't attempt to 4932e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // break it. 49466db3a0f10e96ae190c8a46a1a8d5242928d068cDan Gohman for (SUnit::const_pred_iterator P = CriticalPathSU->Preds.begin(), 4952e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin PE = CriticalPathSU->Preds.end(); P != PE; ++P) 4962e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin if (P->getSUnit() == NextSU ? 4972e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin (P->getKind() != SDep::Anti || P->getReg() != AntiDepReg) : 4982e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin (P->getKind() == SDep::Data && P->getReg() == AntiDepReg)) { 4992e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin AntiDepReg = 0; 5002e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin break; 5012e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin } 5022e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin } 5032e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin } 5042e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin CriticalPathSU = NextSU; 5052e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin CriticalPathMI = CriticalPathSU->getInstr(); 5062e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin } else { 5072e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // We've reached the end of the critical path. 5082e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin CriticalPathSU = 0; 5092e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin CriticalPathMI = 0; 5102e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin } 5112e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin } 5122e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 5132e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin PrescanInstruction(MI); 5142e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 51546df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng // If MI's defs have a special allocation requirement, don't allow 51646df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng // any def registers to be changed. Also assume all registers 51746df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng // defined in a call must not be changed (ABI). 51846df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng if (MI->getDesc().isCall() || MI->getDesc().hasExtraDefRegAllocReq() || 51946df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng TII->isPredicated(MI)) 5202e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // If this instruction's defs have special allocation requirement, don't 5212e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // break this anti-dependency. 5222e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin AntiDepReg = 0; 5232e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin else if (AntiDepReg) { 5242e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // If this instruction has a use of AntiDepReg, breaking it 5252e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // is invalid. 5262e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i) { 5272e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin MachineOperand &MO = MI->getOperand(i); 5282e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin if (!MO.isReg()) continue; 5292e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin unsigned Reg = MO.getReg(); 5302e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin if (Reg == 0) continue; 53146df4eb46e784036cf895db271fe29e1cf2a975aEvan Cheng if (MO.isUse() && TRI->regsOverlap(AntiDepReg, Reg)) { 5322e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin AntiDepReg = 0; 5332e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin break; 5342e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin } 5352e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin } 5362e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin } 5372e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 5382e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // Determine AntiDepReg's register class, if it is live and is 5392e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // consistently used within a single class. 5402e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin const TargetRegisterClass *RC = AntiDepReg != 0 ? Classes[AntiDepReg] : 0; 5412e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin assert((AntiDepReg == 0 || RC != NULL) && 5422e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin "Register should be live if it's causing an anti-dependence!"); 5432e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin if (RC == reinterpret_cast<TargetRegisterClass *>(-1)) 5442e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin AntiDepReg = 0; 5452e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 5462e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // Look for a suitable register to use to break the anti-depenence. 5472e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // 5482e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // TODO: Instead of picking the first free register, consider which might 5492e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // be the best. 5502e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin if (AntiDepReg != 0) { 55180c2b0d9efc951b23f90a3cf12b9853177994961Jim Grosbach if (unsigned NewReg = findSuitableFreeRegister(MI, AntiDepReg, 5522e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin LastNewReg[AntiDepReg], 5532e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin RC)) { 55489d6a2426256b56780c7934ddad24e6ecc4f690aDavid Greene DEBUG(dbgs() << "Breaking anti-dependence edge on " 5552e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin << TRI->getName(AntiDepReg) 5562e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin << " with " << RegRefs.count(AntiDepReg) << " references" 5572e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin << " using " << TRI->getName(NewReg) << "!\n"); 5582e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 5592e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // Update the references to the old register to refer to the new 5602e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // register. 5612e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin std::pair<std::multimap<unsigned, MachineOperand *>::iterator, 5622e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin std::multimap<unsigned, MachineOperand *>::iterator> 5632e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin Range = RegRefs.equal_range(AntiDepReg); 5642e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin for (std::multimap<unsigned, MachineOperand *>::iterator 565533934e06e99a86e8c93f8ec9b9d3b2c527b747eJim Grosbach Q = Range.first, QE = Range.second; Q != QE; ++Q) { 5662e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin Q->second->setReg(NewReg); 567533934e06e99a86e8c93f8ec9b9d3b2c527b747eJim Grosbach // If the SU for the instruction being updated has debug information 568533934e06e99a86e8c93f8ec9b9d3b2c527b747eJim Grosbach // related to the anti-dependency register, make sure to update that 569533934e06e99a86e8c93f8ec9b9d3b2c527b747eJim Grosbach // as well. 570533934e06e99a86e8c93f8ec9b9d3b2c527b747eJim Grosbach const SUnit *SU = MISUnitMap[Q->second->getParent()]; 571086723d244952aee690a8aa39485a0fa0d3a7700Jim Grosbach if (!SU) continue; 572533934e06e99a86e8c93f8ec9b9d3b2c527b747eJim Grosbach for (unsigned i = 0, e = SU->DbgInstrList.size() ; i < e ; ++i) { 573533934e06e99a86e8c93f8ec9b9d3b2c527b747eJim Grosbach MachineInstr *DI = SU->DbgInstrList[i]; 574533934e06e99a86e8c93f8ec9b9d3b2c527b747eJim Grosbach assert (DI->getNumOperands()==3 && DI->getOperand(0).isReg() && 575533934e06e99a86e8c93f8ec9b9d3b2c527b747eJim Grosbach DI->getOperand(0).getReg() 576533934e06e99a86e8c93f8ec9b9d3b2c527b747eJim Grosbach && "Non register dbg_value attached to SUnit!"); 577533934e06e99a86e8c93f8ec9b9d3b2c527b747eJim Grosbach if (DI->getOperand(0).getReg() == AntiDepReg) 578533934e06e99a86e8c93f8ec9b9d3b2c527b747eJim Grosbach DI->getOperand(0).setReg(NewReg); 579533934e06e99a86e8c93f8ec9b9d3b2c527b747eJim Grosbach } 580533934e06e99a86e8c93f8ec9b9d3b2c527b747eJim Grosbach } 5812e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 5822e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // We just went back in time and modified history; the 5832e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // liveness information for the anti-depenence reg is now 5842e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin // inconsistent. Set the state as if it were dead. 5852e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin Classes[NewReg] = Classes[AntiDepReg]; 5862e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin DefIndices[NewReg] = DefIndices[AntiDepReg]; 5872e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin KillIndices[NewReg] = KillIndices[AntiDepReg]; 5882e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin assert(((KillIndices[NewReg] == ~0u) != 5892e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin (DefIndices[NewReg] == ~0u)) && 5902e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin "Kill and Def maps aren't consistent for NewReg!"); 5912e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 5922e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin Classes[AntiDepReg] = 0; 5932e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin DefIndices[AntiDepReg] = KillIndices[AntiDepReg]; 5942e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin KillIndices[AntiDepReg] = ~0u; 5952e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin assert(((KillIndices[AntiDepReg] == ~0u) != 5962e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin (DefIndices[AntiDepReg] == ~0u)) && 5972e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin "Kill and Def maps aren't consistent for AntiDepReg!"); 5982e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 5992e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin RegRefs.erase(AntiDepReg); 6002e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin LastNewReg[AntiDepReg] = NewReg; 6012e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin ++Broken; 6022e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin } 6032e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin } 6042e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 6052e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin ScanInstruction(MI, Count); 6062e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin } 6072e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin 6082e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin return Broken; 6092e7be612d5d0eb42ee3ae08194dbb03b750cc6bfDavid Goodwin} 610