ScheduleDAGSDNodes.cpp revision 046fa3f90a31ebfa10df89ae348f478d492709a9
1343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman//===--- ScheduleDAGSDNodes.cpp - Implement the ScheduleDAGSDNodes class --===// 2343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman// 3343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman// The LLVM Compiler Infrastructure 4343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman// 5343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman// This file is distributed under the University of Illinois Open Source 6343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman// License. See LICENSE.TXT for details. 7343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman// 8343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman//===----------------------------------------------------------------------===// 9343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman// 10343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman// This implements the ScheduleDAG class, which is a base class used by 11343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman// scheduling implementation classes. 12343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman// 13343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman//===----------------------------------------------------------------------===// 14343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 15343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman#define DEBUG_TYPE "pre-RA-sched" 16a8efe28a44996978faa42a387f1a6087a7b942c7Evan Cheng#include "SDNodeDbgValue.h" 1784fbac580941548a6ab1121ed3b0ffdc4e2bc080Dan Gohman#include "ScheduleDAGSDNodes.h" 18bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman#include "InstrEmitter.h" 19343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman#include "llvm/CodeGen/SelectionDAG.h" 20343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman#include "llvm/Target/TargetMachine.h" 21343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman#include "llvm/Target/TargetInstrInfo.h" 221cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng#include "llvm/Target/TargetLowering.h" 23343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman#include "llvm/Target/TargetRegisterInfo.h" 24710461688bba935f0ad5c75da7fec2ad0f225c00David Goodwin#include "llvm/Target/TargetSubtarget.h" 25c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng#include "llvm/ADT/DenseMap.h" 26c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng#include "llvm/ADT/SmallPtrSet.h" 27bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng#include "llvm/ADT/SmallSet.h" 28c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng#include "llvm/ADT/SmallVector.h" 29c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng#include "llvm/ADT/Statistic.h" 30343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman#include "llvm/Support/Debug.h" 31343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman#include "llvm/Support/raw_ostream.h" 32343f0c046702831a4a6aec951b6a297a23241a55Dan Gohmanusing namespace llvm; 33343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 34c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan ChengSTATISTIC(LoadsClustered, "Number of loads clustered together"); 35c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 3679ce276083ced01256a0eb7d80731e4948ca6e87Dan GohmanScheduleDAGSDNodes::ScheduleDAGSDNodes(MachineFunction &mf) 3779ce276083ced01256a0eb7d80731e4948ca6e87Dan Gohman : ScheduleDAG(mf) { 38343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman} 39343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 4047ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman/// Run - perform scheduling. 4147ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman/// 4247ac0f0c7c39289f5970688154e385be22b7f293Dan Gohmanvoid ScheduleDAGSDNodes::Run(SelectionDAG *dag, MachineBasicBlock *bb, 4347ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman MachineBasicBlock::iterator insertPos) { 4447ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman DAG = dag; 4547ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman ScheduleDAG::Run(bb, insertPos); 4647ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman} 4747ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman 481cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng/// NewSUnit - Creates a new SUnit and return a ptr to it. 491cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng/// 501cc3984148be113c6e5e470f23c9ddbd37679c5fEvan ChengSUnit *ScheduleDAGSDNodes::NewSUnit(SDNode *N) { 511cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng#ifndef NDEBUG 521cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng const SUnit *Addr = 0; 531cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng if (!SUnits.empty()) 541cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng Addr = &SUnits[0]; 551cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng#endif 561cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng SUnits.push_back(SUnit(N, (unsigned)SUnits.size())); 571cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng assert((Addr == 0 || Addr == &SUnits[0]) && 581cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng "SUnits std::vector reallocated on the fly!"); 591cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng SUnits.back().OrigNode = &SUnits.back(); 601cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng SUnit *SU = &SUnits.back(); 611cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng const TargetLowering &TLI = DAG->getTargetLoweringInfo(); 62046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng if (N->isMachineOpcode() && 63046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng N->getMachineOpcode() == TargetOpcode::IMPLICIT_DEF) 64046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng SU->SchedulingPref = Sched::None; 65046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng else 66046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng SU->SchedulingPref = TLI.getSchedulingPreference(N); 671cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng return SU; 681cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng} 691cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng 70343f0c046702831a4a6aec951b6a297a23241a55Dan GohmanSUnit *ScheduleDAGSDNodes::Clone(SUnit *Old) { 71343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SUnit *SU = NewSUnit(Old->getNode()); 72343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SU->OrigNode = Old->OrigNode; 73343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SU->Latency = Old->Latency; 74343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SU->isTwoAddress = Old->isTwoAddress; 75343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SU->isCommutable = Old->isCommutable; 76343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SU->hasPhysRegDefs = Old->hasPhysRegDefs; 773974667c1a6d48686e92f85bc4463bb239af7442Dan Gohman SU->hasPhysRegClobbers = Old->hasPhysRegClobbers; 781cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng SU->SchedulingPref = Old->SchedulingPref; 79e57187cbe321a286f6a7f409a7badd1ae4e4642cEvan Cheng Old->isCloned = true; 80343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman return SU; 81343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman} 82343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 83343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman/// CheckForPhysRegDependency - Check if the dependency between def and use of 84343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman/// a specified operand is a physical register dependency. If so, returns the 85c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng/// register and the cost of copying the register. 86343f0c046702831a4a6aec951b6a297a23241a55Dan Gohmanstatic void CheckForPhysRegDependency(SDNode *Def, SDNode *User, unsigned Op, 87343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman const TargetRegisterInfo *TRI, 88343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman const TargetInstrInfo *TII, 89c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng unsigned &PhysReg, int &Cost) { 90343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (Op != 2 || User->getOpcode() != ISD::CopyToReg) 91343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman return; 92343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 93343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman unsigned Reg = cast<RegisterSDNode>(User->getOperand(1))->getReg(); 94343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (TargetRegisterInfo::isVirtualRegister(Reg)) 95343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman return; 96343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 97343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman unsigned ResNo = User->getOperand(2).getResNo(); 98343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (Def->isMachineOpcode()) { 99343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman const TargetInstrDesc &II = TII->get(Def->getMachineOpcode()); 100343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (ResNo >= II.getNumDefs() && 101c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng II.ImplicitDefs[ResNo - II.getNumDefs()] == Reg) { 102343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman PhysReg = Reg; 103c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng const TargetRegisterClass *RC = 104c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng TRI->getPhysicalRegisterRegClass(Reg, Def->getValueType(ResNo)); 105c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng Cost = RC->getCopyCost(); 106c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng } 107343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 108343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman} 109343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 110c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Chengstatic void AddFlags(SDNode *N, SDValue Flag, bool AddFlag, 111c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SelectionDAG *DAG) { 112c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SmallVector<EVT, 4> VTs; 113c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) 114c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng VTs.push_back(N->getValueType(i)); 115c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng if (AddFlag) 116c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng VTs.push_back(MVT::Flag); 117c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SmallVector<SDValue, 4> Ops; 118c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 119c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng Ops.push_back(N->getOperand(i)); 120c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng if (Flag.getNode()) 121c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng Ops.push_back(Flag); 122c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SDVTList VTList = DAG->getVTList(&VTs[0], VTs.size()); 123c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng DAG->MorphNodeTo(N, N->getOpcode(), VTList, &Ops[0], Ops.size()); 124c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng} 125c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 126c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng/// ClusterNeighboringLoads - Force nearby loads together by "flagging" them. 127c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng/// This function finds loads of the same base and different offsets. If the 128c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng/// offsets are not far apart (target specific), it add MVT::Flag inputs and 129c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng/// outputs to ensure they are scheduled together and in order. This 130c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng/// optimization may benefit some targets by improving cache locality. 131c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Chengvoid ScheduleDAGSDNodes::ClusterNeighboringLoads() { 132c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SmallPtrSet<SDNode*, 16> Visited; 133c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SmallVector<int64_t, 4> Offsets; 134c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng DenseMap<long long, SDNode*> O2SMap; // Map from offset to SDNode. 135c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng for (SelectionDAG::allnodes_iterator NI = DAG->allnodes_begin(), 136c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng E = DAG->allnodes_end(); NI != E; ++NI) { 137c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SDNode *Node = &*NI; 138c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng if (!Node || !Node->isMachineOpcode()) 139c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng continue; 140c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 141c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng unsigned Opc = Node->getMachineOpcode(); 142c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng const TargetInstrDesc &TID = TII->get(Opc); 143c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng if (!TID.mayLoad()) 144c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng continue; 145c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 146c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SDNode *Chain = 0; 147c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng unsigned NumOps = Node->getNumOperands(); 148c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng if (Node->getOperand(NumOps-1).getValueType() == MVT::Other) 149c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng Chain = Node->getOperand(NumOps-1).getNode(); 150c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng if (!Chain) 151c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng continue; 152c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 153c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng // Look for other loads of the same chain. Find loads that are loading from 154c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng // the same base pointer and different offsets. 155c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng Visited.clear(); 156c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng Offsets.clear(); 157c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng O2SMap.clear(); 158c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng bool Cluster = false; 159c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SDNode *Base = Node; 160c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng int64_t BaseOffset; 161c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng for (SDNode::use_iterator I = Chain->use_begin(), E = Chain->use_end(); 162c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng I != E; ++I) { 163c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SDNode *User = *I; 164c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng if (User == Node || !Visited.insert(User)) 165c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng continue; 166c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng int64_t Offset1, Offset2; 167c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng if (!TII->areLoadsFromSameBasePtr(Base, User, Offset1, Offset2) || 168c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng Offset1 == Offset2) 169c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng // FIXME: Should be ok if they addresses are identical. But earlier 170c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng // optimizations really should have eliminated one of the loads. 171c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng continue; 172c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng if (O2SMap.insert(std::make_pair(Offset1, Base)).second) 173c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng Offsets.push_back(Offset1); 174c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng O2SMap.insert(std::make_pair(Offset2, User)); 175c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng Offsets.push_back(Offset2); 176c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng if (Offset2 < Offset1) { 177c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng Base = User; 178c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng BaseOffset = Offset2; 179c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng } else { 180c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng BaseOffset = Offset1; 181c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng } 182c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng Cluster = true; 183c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng } 184c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 185c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng if (!Cluster) 186c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng continue; 187c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 188c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng // Sort them in increasing order. 189c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng std::sort(Offsets.begin(), Offsets.end()); 190c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 191c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng // Check if the loads are close enough. 192c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SmallVector<SDNode*, 4> Loads; 193c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng unsigned NumLoads = 0; 194c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng int64_t BaseOff = Offsets[0]; 195c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SDNode *BaseLoad = O2SMap[BaseOff]; 196c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng Loads.push_back(BaseLoad); 197c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng for (unsigned i = 1, e = Offsets.size(); i != e; ++i) { 198c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng int64_t Offset = Offsets[i]; 199c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SDNode *Load = O2SMap[Offset]; 200c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng if (!TII->shouldScheduleLoadsNear(BaseLoad, Load, BaseOff, Offset, 201c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng NumLoads)) 202c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng break; // Stop right here. Ignore loads that are further away. 203c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng Loads.push_back(Load); 204c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng ++NumLoads; 205c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng } 206c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 207c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng if (NumLoads == 0) 208c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng continue; 209c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 210c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng // Cluster loads by adding MVT::Flag outputs and inputs. This also 211c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng // ensure they are scheduled in order of increasing addresses. 212c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SDNode *Lead = Loads[0]; 213c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng AddFlags(Lead, SDValue(0,0), true, DAG); 214c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SDValue InFlag = SDValue(Lead, Lead->getNumValues()-1); 215c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng for (unsigned i = 1, e = Loads.size(); i != e; ++i) { 216c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng bool OutFlag = i < e-1; 217c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SDNode *Load = Loads[i]; 218c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng AddFlags(Load, InFlag, OutFlag, DAG); 219c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng if (OutFlag) 220c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng InFlag = SDValue(Load, Load->getNumValues()-1); 221c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng ++LoadsClustered; 222c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng } 223c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng } 224c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng} 225c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 226343f0c046702831a4a6aec951b6a297a23241a55Dan Gohmanvoid ScheduleDAGSDNodes::BuildSchedUnits() { 227343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // During scheduling, the NodeId field of SDNode is used to map SDNodes 228343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // to their associated SUnits by holding SUnits table indices. A value 229343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // of -1 means the SDNode does not yet have an associated SUnit. 230e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman unsigned NumNodes = 0; 231343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman for (SelectionDAG::allnodes_iterator NI = DAG->allnodes_begin(), 232e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman E = DAG->allnodes_end(); NI != E; ++NI) { 233343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman NI->setNodeId(-1); 234e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman ++NumNodes; 235e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman } 236343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 237e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman // Reserve entries in the vector for each of the SUnits we are creating. This 238e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman // ensure that reallocation of the vector won't happen, so SUnit*'s won't get 239e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman // invalidated. 240e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman // FIXME: Multiply by 2 because we may clone nodes during scheduling. 241e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman // This is a temporary workaround. 242e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman SUnits.reserve(NumNodes * 2); 243e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman 244736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner // Add all nodes in depth first order. 245736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner SmallVector<SDNode*, 64> Worklist; 246736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner SmallPtrSet<SDNode*, 64> Visited; 247736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner Worklist.push_back(DAG->getRoot().getNode()); 248736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner Visited.insert(DAG->getRoot().getNode()); 249736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner 250736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner while (!Worklist.empty()) { 251736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner SDNode *NI = Worklist.pop_back_val(); 252736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner 253736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner // Add all operands to the worklist unless they've already been added. 254736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner for (unsigned i = 0, e = NI->getNumOperands(); i != e; ++i) 255736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner if (Visited.insert(NI->getOperand(i).getNode())) 256736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner Worklist.push_back(NI->getOperand(i).getNode()); 257736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner 258343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (isPassiveNode(NI)) // Leaf node, e.g. a TargetImmediate. 259343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman continue; 260343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 261343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // If this node has already been processed, stop now. 262343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (NI->getNodeId() != -1) continue; 263343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 264343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SUnit *NodeSUnit = NewSUnit(NI); 265343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 266343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // See if anything is flagged to this node, if so, add them to flagged 267343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // nodes. Nodes can have at most one flag input and one flag output. Flags 268db95fa131a229652f925794ca7a5b84e9490050bDan Gohman // are required to be the last operand and result of a node. 269343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 270343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // Scan up to find flagged preds. 271343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SDNode *N = NI; 272db95fa131a229652f925794ca7a5b84e9490050bDan Gohman while (N->getNumOperands() && 273825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson N->getOperand(N->getNumOperands()-1).getValueType() == MVT::Flag) { 274db95fa131a229652f925794ca7a5b84e9490050bDan Gohman N = N->getOperand(N->getNumOperands()-1).getNode(); 275db95fa131a229652f925794ca7a5b84e9490050bDan Gohman assert(N->getNodeId() == -1 && "Node already inserted!"); 276db95fa131a229652f925794ca7a5b84e9490050bDan Gohman N->setNodeId(NodeSUnit->NodeNum); 277343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 278343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 279343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // Scan down to find any flagged succs. 280343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman N = NI; 281825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson while (N->getValueType(N->getNumValues()-1) == MVT::Flag) { 282343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SDValue FlagVal(N, N->getNumValues()-1); 283343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 284343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // There are either zero or one users of the Flag result. 285343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman bool HasFlagUse = false; 286343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman for (SDNode::use_iterator UI = N->use_begin(), E = N->use_end(); 287343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman UI != E; ++UI) 288343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (FlagVal.isOperandOf(*UI)) { 289343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman HasFlagUse = true; 290343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman assert(N->getNodeId() == -1 && "Node already inserted!"); 291343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman N->setNodeId(NodeSUnit->NodeNum); 292343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman N = *UI; 293343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman break; 294343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 295343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (!HasFlagUse) break; 296343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 297343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 298343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // If there are flag operands involved, N is now the bottom-most node 299343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // of the sequence of nodes that are flagged together. 300343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // Update the SUnit. 301343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman NodeSUnit->setNode(N); 302343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman assert(N->getNodeId() == -1 && "Node already inserted!"); 303343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman N->setNodeId(NodeSUnit->NodeNum); 304343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 305787782f4ca0cca2523825131c24a6f78535a3eb8Dan Gohman // Assign the Latency field of NodeSUnit using target-provided information. 306e163168aab987dc3df0845b9e92310f764d8b158Evan Cheng ComputeLatency(NodeSUnit); 307343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 308c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman} 309c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman 310c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohmanvoid ScheduleDAGSDNodes::AddSchedEdges() { 311710461688bba935f0ad5c75da7fec2ad0f225c00David Goodwin const TargetSubtarget &ST = TM.getSubtarget<TargetSubtarget>(); 312710461688bba935f0ad5c75da7fec2ad0f225c00David Goodwin 313dc4bdcdef1c8dd1a28b82deb08df039e5c0ffc5aDavid Goodwin // Check to see if the scheduler cares about latencies. 314dc4bdcdef1c8dd1a28b82deb08df039e5c0ffc5aDavid Goodwin bool UnitLatencies = ForceUnitLatencies(); 315dc4bdcdef1c8dd1a28b82deb08df039e5c0ffc5aDavid Goodwin 316343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // Pass 2: add the preds, succs, etc. 317343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman for (unsigned su = 0, e = SUnits.size(); su != e; ++su) { 318343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SUnit *SU = &SUnits[su]; 319343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SDNode *MainNode = SU->getNode(); 320343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 321343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (MainNode->isMachineOpcode()) { 322343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman unsigned Opc = MainNode->getMachineOpcode(); 323343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman const TargetInstrDesc &TID = TII->get(Opc); 324343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman for (unsigned i = 0; i != TID.getNumOperands(); ++i) { 325343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (TID.getOperandConstraint(i, TOI::TIED_TO) != -1) { 326343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SU->isTwoAddress = true; 327343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman break; 328343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 329343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 330343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (TID.isCommutable()) 331343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SU->isCommutable = true; 332343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 333343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 334343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // Find all predecessors and successors of the group. 335343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman for (SDNode *N = SU->getNode(); N; N = N->getFlaggedNode()) { 336343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (N->isMachineOpcode() && 3373974667c1a6d48686e92f85bc4463bb239af7442Dan Gohman TII->get(N->getMachineOpcode()).getImplicitDefs()) { 3383974667c1a6d48686e92f85bc4463bb239af7442Dan Gohman SU->hasPhysRegClobbers = true; 339bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman unsigned NumUsed = InstrEmitter::CountResults(N); 3408cccf0ef0ced7f4d75ca574b596036a9b6cd4315Dan Gohman while (NumUsed != 0 && !N->hasAnyUseOfValue(NumUsed - 1)) 3418cccf0ef0ced7f4d75ca574b596036a9b6cd4315Dan Gohman --NumUsed; // Skip over unused values at the end. 3428cccf0ef0ced7f4d75ca574b596036a9b6cd4315Dan Gohman if (NumUsed > TII->get(N->getMachineOpcode()).getNumDefs()) 3433974667c1a6d48686e92f85bc4463bb239af7442Dan Gohman SU->hasPhysRegDefs = true; 3443974667c1a6d48686e92f85bc4463bb239af7442Dan Gohman } 345343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 346343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) { 347343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SDNode *OpN = N->getOperand(i).getNode(); 348343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (isPassiveNode(OpN)) continue; // Not scheduled. 349343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SUnit *OpSU = &SUnits[OpN->getNodeId()]; 350343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman assert(OpSU && "Node has no SUnit!"); 351343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (OpSU == SU) continue; // In the same group. 352343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 353e50ed30282bb5b4a9ed952580523f2dda16215acOwen Anderson EVT OpVT = N->getOperand(i).getValueType(); 354825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson assert(OpVT != MVT::Flag && "Flagged nodes should be in same sunit!"); 355825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson bool isChain = OpVT == MVT::Other; 356343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 357343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman unsigned PhysReg = 0; 358c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng int Cost = 1; 359343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // Determine if this is a physical register dependency. 360c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng CheckForPhysRegDependency(OpN, N, i, TRI, TII, PhysReg, Cost); 36154e4c36a7349e94a84773afb56eccd4ca65b49e9Dan Gohman assert((PhysReg == 0 || !isChain) && 36254e4c36a7349e94a84773afb56eccd4ca65b49e9Dan Gohman "Chain dependence via physreg data?"); 363c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng // FIXME: See ScheduleDAGSDNodes::EmitCopyFromReg. For now, scheduler 364c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng // emits a copy from the physical register to a virtual register unless 365c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng // it requires a cross class copy (cost < 0). That means we are only 366c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng // treating "expensive to copy" register dependency as physical register 367c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng // dependency. This may change in the future though. 368c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng if (Cost >= 0) 369c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng PhysReg = 0; 370710461688bba935f0ad5c75da7fec2ad0f225c00David Goodwin 371046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng // If this is a ctrl dep, latency is 1. 372046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng unsigned OpLatency = isChain ? 1 : OpSU->Latency; 373046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng const SDep &dep = SDep(OpSU, isChain ? SDep::Order : SDep::Data, 374046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng OpLatency, PhysReg); 375dc4bdcdef1c8dd1a28b82deb08df039e5c0ffc5aDavid Goodwin if (!isChain && !UnitLatencies) { 37615a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng ComputeOperandLatency(OpN, N, i, const_cast<SDep &>(dep)); 3773fb150a9024a38872ec4abbc3300e08a8bfc1812Dan Gohman ST.adjustSchedDependency(OpSU, SU, const_cast<SDep &>(dep)); 378dc4bdcdef1c8dd1a28b82deb08df039e5c0ffc5aDavid Goodwin } 379710461688bba935f0ad5c75da7fec2ad0f225c00David Goodwin 380710461688bba935f0ad5c75da7fec2ad0f225c00David Goodwin SU->addPred(dep); 381343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 382343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 383343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 384343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman} 385343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 386c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman/// BuildSchedGraph - Build the SUnit graph from the selection dag that we 387c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman/// are input. This SUnit graph is similar to the SelectionDAG, but 388c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman/// excludes nodes that aren't interesting to scheduling, and represents 389c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman/// flagged together nodes with a single SUnit. 39098976e4dcd18adbbe676048c0069e67346eb4adeDan Gohmanvoid ScheduleDAGSDNodes::BuildSchedGraph(AliasAnalysis *AA) { 391c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng // Cluster loads from "near" addresses into combined SUnits. 39242dae2d5ba0c22bed65e80ac56a7c304de911c33Evan Cheng ClusterNeighboringLoads(); 393c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman // Populate the SUnits array. 394c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman BuildSchedUnits(); 395c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman // Compute all the scheduling dependencies between nodes. 396c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman AddSchedEdges(); 397c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman} 398c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman 399343f0c046702831a4a6aec951b6a297a23241a55Dan Gohmanvoid ScheduleDAGSDNodes::ComputeLatency(SUnit *SU) { 400e163168aab987dc3df0845b9e92310f764d8b158Evan Cheng // Check to see if the scheduler cares about latencies. 401e163168aab987dc3df0845b9e92310f764d8b158Evan Cheng if (ForceUnitLatencies()) { 402e163168aab987dc3df0845b9e92310f764d8b158Evan Cheng SU->Latency = 1; 403e163168aab987dc3df0845b9e92310f764d8b158Evan Cheng return; 404e163168aab987dc3df0845b9e92310f764d8b158Evan Cheng } 405e163168aab987dc3df0845b9e92310f764d8b158Evan Cheng 406343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman const InstrItineraryData &InstrItins = TM.getInstrItineraryData(); 40715a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng if (InstrItins.isEmpty()) { 40815a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng SU->Latency = 1; 40915a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng return; 41015a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng } 411343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 412343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // Compute the latency for the node. We use the sum of the latencies for 413343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // all nodes flagged together into this SUnit. 414343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SU->Latency = 0; 415c8c2827993204207ca70a93f62f233fbe81b97efDan Gohman for (SDNode *N = SU->getNode(); N; N = N->getFlaggedNode()) 416343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (N->isMachineOpcode()) { 417dc4bdcdef1c8dd1a28b82deb08df039e5c0ffc5aDavid Goodwin SU->Latency += InstrItins. 418dc4bdcdef1c8dd1a28b82deb08df039e5c0ffc5aDavid Goodwin getStageLatency(TII->get(N->getMachineOpcode()).getSchedClass()); 419343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 420343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman} 421343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 42215a16def6e70c8f7df1023da80ceb89887203b40Evan Chengvoid ScheduleDAGSDNodes::ComputeOperandLatency(SDNode *Def, SDNode *Use, 42315a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng unsigned OpIdx, SDep& dep) const{ 42415a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng // Check to see if the scheduler cares about latencies. 42515a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng if (ForceUnitLatencies()) 42615a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng return; 42715a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng 42815a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng const InstrItineraryData &InstrItins = TM.getInstrItineraryData(); 42915a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng if (InstrItins.isEmpty()) 43015a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng return; 43115a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng 43215a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng if (dep.getKind() != SDep::Data) 43315a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng return; 43415a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng 43515a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng unsigned DefIdx = Use->getOperand(OpIdx).getResNo(); 436046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng if (Def->isMachineOpcode()) { 43715a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng const TargetInstrDesc &II = TII->get(Def->getMachineOpcode()); 43815a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng if (DefIdx >= II.getNumDefs()) 43915a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng return; 44015a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng int DefCycle = InstrItins.getOperandCycle(II.getSchedClass(), DefIdx); 44115a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng if (DefCycle < 0) 44215a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng return; 443046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng int UseCycle = 1; 444046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng if (Use->isMachineOpcode()) { 445046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng const unsigned UseClass = TII->get(Use->getMachineOpcode()).getSchedClass(); 446046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng UseCycle = InstrItins.getOperandCycle(UseClass, OpIdx); 447046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng } 44815a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng if (UseCycle >= 0) { 44915a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng int Latency = DefCycle - UseCycle + 1; 45015a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng if (Latency >= 0) 45115a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng dep.setLatency(Latency); 45215a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng } 45315a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng } 45415a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng} 45515a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng 456343f0c046702831a4a6aec951b6a297a23241a55Dan Gohmanvoid ScheduleDAGSDNodes::dumpNode(const SUnit *SU) const { 457c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng if (!SU->getNode()) { 45884fa8229bbd3813505b7e8d6555fb2e522104e30David Greene dbgs() << "PHYS REG COPY\n"; 459c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng return; 460c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng } 461c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng 462c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng SU->getNode()->dump(DAG); 46384fa8229bbd3813505b7e8d6555fb2e522104e30David Greene dbgs() << "\n"; 464343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SmallVector<SDNode *, 4> FlaggedNodes; 465343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman for (SDNode *N = SU->getNode()->getFlaggedNode(); N; N = N->getFlaggedNode()) 466343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman FlaggedNodes.push_back(N); 467343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman while (!FlaggedNodes.empty()) { 46884fa8229bbd3813505b7e8d6555fb2e522104e30David Greene dbgs() << " "; 469343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman FlaggedNodes.back()->dump(DAG); 47084fa8229bbd3813505b7e8d6555fb2e522104e30David Greene dbgs() << "\n"; 471343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman FlaggedNodes.pop_back(); 472343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 473343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman} 474bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman 475bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Chengnamespace { 476bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng struct OrderSorter { 477bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng bool operator()(const std::pair<unsigned, MachineInstr*> &A, 478bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng const std::pair<unsigned, MachineInstr*> &B) { 479bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng return A.first < B.first; 480bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 481bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng }; 482bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng} 483bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 484bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng// ProcessSourceNode - Process nodes with source order numbers. These are added 485bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng// to a vector which EmitSchedule use to determine how to insert dbg_value 486bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng// instructions in the right order. 487bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Chengstatic void ProcessSourceNode(SDNode *N, SelectionDAG *DAG, 488bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng InstrEmitter &Emitter, 489bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng DenseMap<SDValue, unsigned> &VRBaseMap, 490bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SmallVector<std::pair<unsigned, MachineInstr*>, 32> &Orders, 491bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SmallSet<unsigned, 8> &Seen) { 492bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng unsigned Order = DAG->GetOrdering(N); 493bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (!Order || !Seen.insert(Order)) 494bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng return; 495bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 496bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng MachineBasicBlock *BB = Emitter.getBlock(); 497bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (BB->empty() || BB->back().isPHI()) { 498bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // Did not insert any instruction. 499bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng Orders.push_back(std::make_pair(Order, (MachineInstr*)0)); 500bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng return; 501bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 502bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 503bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng Orders.push_back(std::make_pair(Order, &BB->back())); 504bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (!N->getHasDebugValue()) 505bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng return; 506bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // Opportunistically insert immediate dbg_value uses, i.e. those with source 507bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // order number right after the N. 508bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng MachineBasicBlock::iterator InsertPos = Emitter.getInsertPos(); 509bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SmallVector<SDDbgValue*,2> &DVs = DAG->GetDbgValues(N); 510bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng for (unsigned i = 0, e = DVs.size(); i != e; ++i) { 511bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (DVs[i]->isInvalidated()) 512bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng continue; 513bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng unsigned DVOrder = DVs[i]->getOrder(); 514bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (DVOrder == ++Order) { 515891ff8fbd61a06ef8ea57461fa377ebbb663ed09Dan Gohman MachineInstr *DbgMI = Emitter.EmitDbgValue(DVs[i], VRBaseMap); 516962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng if (DbgMI) { 517962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng Orders.push_back(std::make_pair(DVOrder, DbgMI)); 518962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng BB->insert(InsertPos, DbgMI); 519962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng } 520bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng DVs[i]->setIsInvalidated(); 521bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 522bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 523bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng} 524bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 525bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 526bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman/// EmitSchedule - Emit the machine code in scheduled order. 527af1d8ca44a18f304f207e209b3bdb94b590f86ffDan GohmanMachineBasicBlock *ScheduleDAGSDNodes::EmitSchedule() { 528bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman InstrEmitter Emitter(BB, InsertPos); 529bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman DenseMap<SDValue, unsigned> VRBaseMap; 530bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman DenseMap<SUnit*, unsigned> CopyVRBaseMap; 531bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SmallVector<std::pair<unsigned, MachineInstr*>, 32> Orders; 532bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SmallSet<unsigned, 8> Seen; 533bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng bool HasDbg = DAG->hasDebugValues(); 534bfdf7f38523bd38ae0538861a2bfd8bdc46e5c33Dale Johannesen 535fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen // If this is the first BB, emit byval parameter dbg_value's. 536fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen if (HasDbg && BB->getParent()->begin() == MachineFunction::iterator(BB)) { 537fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen SDDbgInfo::DbgIterator PDI = DAG->ByvalParmDbgBegin(); 538fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen SDDbgInfo::DbgIterator PDE = DAG->ByvalParmDbgEnd(); 539fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen for (; PDI != PDE; ++PDI) { 540891ff8fbd61a06ef8ea57461fa377ebbb663ed09Dan Gohman MachineInstr *DbgMI= Emitter.EmitDbgValue(*PDI, VRBaseMap); 541fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen if (DbgMI) 542fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen BB->insert(BB->end(), DbgMI); 543fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen } 544fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen } 545fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen 546bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman for (unsigned i = 0, e = Sequence.size(); i != e; i++) { 547bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman SUnit *SU = Sequence[i]; 548bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman if (!SU) { 549bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman // Null SUnit* is a noop. 550bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman EmitNoop(); 551bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman continue; 552bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman } 553bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman 554bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman // For pre-regalloc scheduling, create instructions corresponding to the 555bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman // SDNode and any flagged SDNodes and append them to the block. 556bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman if (!SU->getNode()) { 557bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman // Emit a copy. 558bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman EmitPhysRegCopy(SU, CopyVRBaseMap); 559bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman continue; 560bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman } 561bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman 562bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman SmallVector<SDNode *, 4> FlaggedNodes; 563bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman for (SDNode *N = SU->getNode()->getFlaggedNode(); N; 564bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman N = N->getFlaggedNode()) 565bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman FlaggedNodes.push_back(N); 566bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman while (!FlaggedNodes.empty()) { 567bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SDNode *N = FlaggedNodes.back(); 568bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman Emitter.EmitNode(FlaggedNodes.back(), SU->OrigNode != SU, SU->isCloned, 569af1d8ca44a18f304f207e209b3bdb94b590f86ffDan Gohman VRBaseMap); 570fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen // Remember the source order of the inserted instruction. 571bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (HasDbg) 572891ff8fbd61a06ef8ea57461fa377ebbb663ed09Dan Gohman ProcessSourceNode(N, DAG, Emitter, VRBaseMap, Orders, Seen); 573bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman FlaggedNodes.pop_back(); 574bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman } 575bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman Emitter.EmitNode(SU->getNode(), SU->OrigNode != SU, SU->isCloned, 576af1d8ca44a18f304f207e209b3bdb94b590f86ffDan Gohman VRBaseMap); 577fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen // Remember the source order of the inserted instruction. 578bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (HasDbg) 579891ff8fbd61a06ef8ea57461fa377ebbb663ed09Dan Gohman ProcessSourceNode(SU->getNode(), DAG, Emitter, VRBaseMap, Orders, 580bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng Seen); 581bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 582bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 583fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen // Insert all the dbg_values which have not already been inserted in source 584bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // order sequence. 585bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (HasDbg) { 586bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng MachineBasicBlock::iterator BBBegin = BB->empty() ? BB->end() : BB->begin(); 587bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng while (BBBegin != BB->end() && BBBegin->isPHI()) 588bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng ++BBBegin; 589bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 590bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // Sort the source order instructions and use the order to insert debug 591bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // values. 592bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng std::sort(Orders.begin(), Orders.end(), OrderSorter()); 593bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 594bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SDDbgInfo::DbgIterator DI = DAG->DbgBegin(); 595bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SDDbgInfo::DbgIterator DE = DAG->DbgEnd(); 596bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // Now emit the rest according to source order. 597bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng unsigned LastOrder = 0; 598bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng MachineInstr *LastMI = 0; 599bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng for (unsigned i = 0, e = Orders.size(); i != e && DI != DE; ++i) { 600bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng unsigned Order = Orders[i].first; 601bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng MachineInstr *MI = Orders[i].second; 602bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // Insert all SDDbgValue's whose order(s) are before "Order". 603bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (!MI) 604bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng continue; 605bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng MachineBasicBlock *MIBB = MI->getParent(); 6064ec9bd9a6f92a10185870bae2cebce199f6acc5aEvan Cheng#ifndef NDEBUG 6074ec9bd9a6f92a10185870bae2cebce199f6acc5aEvan Cheng unsigned LastDIOrder = 0; 6084ec9bd9a6f92a10185870bae2cebce199f6acc5aEvan Cheng#endif 609bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng for (; DI != DE && 610bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng (*DI)->getOrder() >= LastOrder && (*DI)->getOrder() < Order; ++DI) { 6114ec9bd9a6f92a10185870bae2cebce199f6acc5aEvan Cheng#ifndef NDEBUG 6124ec9bd9a6f92a10185870bae2cebce199f6acc5aEvan Cheng assert((*DI)->getOrder() >= LastDIOrder && 6134ec9bd9a6f92a10185870bae2cebce199f6acc5aEvan Cheng "SDDbgValue nodes must be in source order!"); 6144ec9bd9a6f92a10185870bae2cebce199f6acc5aEvan Cheng LastDIOrder = (*DI)->getOrder(); 6154ec9bd9a6f92a10185870bae2cebce199f6acc5aEvan Cheng#endif 616bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if ((*DI)->isInvalidated()) 617bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng continue; 618891ff8fbd61a06ef8ea57461fa377ebbb663ed09Dan Gohman MachineInstr *DbgMI = Emitter.EmitDbgValue(*DI, VRBaseMap); 619962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng if (DbgMI) { 620962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng if (!LastOrder) 621962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng // Insert to start of the BB (after PHIs). 622962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng BB->insert(BBBegin, DbgMI); 623962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng else { 624962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng MachineBasicBlock::iterator Pos = MI; 625962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng MIBB->insert(llvm::next(Pos), DbgMI); 626962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng } 627bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 628bfdf7f38523bd38ae0538861a2bfd8bdc46e5c33Dale Johannesen } 629bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng LastOrder = Order; 630bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng LastMI = MI; 631bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 632bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // Add trailing DbgValue's before the terminator. FIXME: May want to add 633bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // some of them before one or more conditional branches? 634bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng while (DI != DE) { 635bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng MachineBasicBlock *InsertBB = Emitter.getBlock(); 636bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng MachineBasicBlock::iterator Pos= Emitter.getBlock()->getFirstTerminator(); 637bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (!(*DI)->isInvalidated()) { 638891ff8fbd61a06ef8ea57461fa377ebbb663ed09Dan Gohman MachineInstr *DbgMI= Emitter.EmitDbgValue(*DI, VRBaseMap); 639962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng if (DbgMI) 640962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng InsertBB->insert(Pos, DbgMI); 641bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 642bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng ++DI; 643bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 644bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman } 645bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman 646bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman BB = Emitter.getBlock(); 647bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman InsertPos = Emitter.getInsertPos(); 648bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman return BB; 649bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman} 650