ScheduleDAGSDNodes.cpp revision 151d26d15dc6fe89329d7cccb0638c324c58f485
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; 113151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling 114c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) 115c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng VTs.push_back(N->getValueType(i)); 116151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling 117c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng if (AddFlag) 118c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng VTs.push_back(MVT::Flag); 119151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling 120c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SmallVector<SDValue, 4> Ops; 121c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 122c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng Ops.push_back(N->getOperand(i)); 123151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling 124c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng if (Flag.getNode()) 125c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng Ops.push_back(Flag); 126151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling 127c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SDVTList VTList = DAG->getVTList(&VTs[0], VTs.size()); 128151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling MachineSDNode::mmo_iterator Begin = 0, End = 0; 129151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling MachineSDNode *MN = dyn_cast<MachineSDNode>(N); 130151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling 131151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling // Store memory references. 132151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling if (MN) { 133151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling Begin = MN->memoperands_begin(); 134151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling End = MN->memoperands_end(); 135151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling } 136151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling 137c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng DAG->MorphNodeTo(N, N->getOpcode(), VTList, &Ops[0], Ops.size()); 138151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling 139151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling // Reset the memory references 140151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling if (MN) 141151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling MN->setMemRefs(Begin, End); 142c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng} 143c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 144c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng/// ClusterNeighboringLoads - Force nearby loads together by "flagging" them. 145c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng/// This function finds loads of the same base and different offsets. If the 146c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng/// offsets are not far apart (target specific), it add MVT::Flag inputs and 147c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng/// outputs to ensure they are scheduled together and in order. This 148c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng/// optimization may benefit some targets by improving cache locality. 149302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Chengvoid ScheduleDAGSDNodes::ClusterNeighboringLoads(SDNode *Node) { 150302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng SDNode *Chain = 0; 151302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng unsigned NumOps = Node->getNumOperands(); 152302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng if (Node->getOperand(NumOps-1).getValueType() == MVT::Other) 153302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng Chain = Node->getOperand(NumOps-1).getNode(); 154302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng if (!Chain) 155302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng return; 156302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng 157302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng // Look for other loads of the same chain. Find loads that are loading from 158302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng // the same base pointer and different offsets. 159c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SmallPtrSet<SDNode*, 16> Visited; 160c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SmallVector<int64_t, 4> Offsets; 161c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng DenseMap<long long, SDNode*> O2SMap; // Map from offset to SDNode. 162302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng bool Cluster = false; 163302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng SDNode *Base = Node; 164302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng int64_t BaseOffset; 165302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng for (SDNode::use_iterator I = Chain->use_begin(), E = Chain->use_end(); 166302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng I != E; ++I) { 167302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng SDNode *User = *I; 168302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng if (User == Node || !Visited.insert(User)) 169c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng continue; 170302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng int64_t Offset1, Offset2; 171302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng if (!TII->areLoadsFromSameBasePtr(Base, User, Offset1, Offset2) || 172302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng Offset1 == Offset2) 173302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng // FIXME: Should be ok if they addresses are identical. But earlier 174302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng // optimizations really should have eliminated one of the loads. 175c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng continue; 176302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng if (O2SMap.insert(std::make_pair(Offset1, Base)).second) 177302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng Offsets.push_back(Offset1); 178302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng O2SMap.insert(std::make_pair(Offset2, User)); 179302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng Offsets.push_back(Offset2); 180302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng if (Offset2 < Offset1) { 181302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng Base = User; 182302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng BaseOffset = Offset2; 183302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng } else { 184302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng BaseOffset = Offset1; 185302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng } 186302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng Cluster = true; 187302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng } 188c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 189302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng if (!Cluster) 190302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng return; 191c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 192302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng // Sort them in increasing order. 193302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng std::sort(Offsets.begin(), Offsets.end()); 194c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 195302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng // Check if the loads are close enough. 196302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng SmallVector<SDNode*, 4> Loads; 197302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng unsigned NumLoads = 0; 198302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng int64_t BaseOff = Offsets[0]; 199302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng SDNode *BaseLoad = O2SMap[BaseOff]; 200302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng Loads.push_back(BaseLoad); 201302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng for (unsigned i = 1, e = Offsets.size(); i != e; ++i) { 202302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng int64_t Offset = Offsets[i]; 203302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng SDNode *Load = O2SMap[Offset]; 204302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng if (!TII->shouldScheduleLoadsNear(BaseLoad, Load, BaseOff, Offset,NumLoads)) 205302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng break; // Stop right here. Ignore loads that are further away. 206302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng Loads.push_back(Load); 207302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng ++NumLoads; 208302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng } 209c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 210302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng if (NumLoads == 0) 211302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng return; 212c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 213302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng // Cluster loads by adding MVT::Flag outputs and inputs. This also 214302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng // ensure they are scheduled in order of increasing addresses. 215302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng SDNode *Lead = Loads[0]; 216302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng AddFlags(Lead, SDValue(0,0), true, DAG); 217151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling 218302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng SDValue InFlag = SDValue(Lead, Lead->getNumValues()-1); 219302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng for (unsigned i = 1, e = Loads.size(); i != e; ++i) { 220302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng bool OutFlag = i < e-1; 221302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng SDNode *Load = Loads[i]; 222302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng AddFlags(Load, InFlag, OutFlag, DAG); 223151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling 224302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng if (OutFlag) 225302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng InFlag = SDValue(Load, Load->getNumValues()-1); 226151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling 227302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng ++LoadsClustered; 228302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng } 229302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng} 230c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 231302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng/// ClusterNodes - Cluster certain nodes which should be scheduled together. 232302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng/// 233302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Chengvoid ScheduleDAGSDNodes::ClusterNodes() { 234302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng for (SelectionDAG::allnodes_iterator NI = DAG->allnodes_begin(), 235302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng E = DAG->allnodes_end(); NI != E; ++NI) { 236302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng SDNode *Node = &*NI; 237302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng if (!Node || !Node->isMachineOpcode()) 238c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng continue; 239c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 240302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng unsigned Opc = Node->getMachineOpcode(); 241302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng const TargetInstrDesc &TID = TII->get(Opc); 242302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng if (TID.mayLoad()) 243302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng // Cluster loads from "near" addresses into combined SUnits. 244302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng ClusterNeighboringLoads(Node); 245c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng } 246c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng} 247c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 248343f0c046702831a4a6aec951b6a297a23241a55Dan Gohmanvoid ScheduleDAGSDNodes::BuildSchedUnits() { 249343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // During scheduling, the NodeId field of SDNode is used to map SDNodes 250343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // to their associated SUnits by holding SUnits table indices. A value 251343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // of -1 means the SDNode does not yet have an associated SUnit. 252e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman unsigned NumNodes = 0; 253343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman for (SelectionDAG::allnodes_iterator NI = DAG->allnodes_begin(), 254e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman E = DAG->allnodes_end(); NI != E; ++NI) { 255343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman NI->setNodeId(-1); 256e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman ++NumNodes; 257e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman } 258343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 259e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman // Reserve entries in the vector for each of the SUnits we are creating. This 260e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman // ensure that reallocation of the vector won't happen, so SUnit*'s won't get 261e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman // invalidated. 262e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman // FIXME: Multiply by 2 because we may clone nodes during scheduling. 263e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman // This is a temporary workaround. 264e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman SUnits.reserve(NumNodes * 2); 265e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman 266736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner // Add all nodes in depth first order. 267736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner SmallVector<SDNode*, 64> Worklist; 268736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner SmallPtrSet<SDNode*, 64> Visited; 269736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner Worklist.push_back(DAG->getRoot().getNode()); 270736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner Visited.insert(DAG->getRoot().getNode()); 271736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner 272736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner while (!Worklist.empty()) { 273736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner SDNode *NI = Worklist.pop_back_val(); 274736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner 275736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner // Add all operands to the worklist unless they've already been added. 276736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner for (unsigned i = 0, e = NI->getNumOperands(); i != e; ++i) 277736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner if (Visited.insert(NI->getOperand(i).getNode())) 278736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner Worklist.push_back(NI->getOperand(i).getNode()); 279736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner 280343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (isPassiveNode(NI)) // Leaf node, e.g. a TargetImmediate. 281343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman continue; 282343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 283343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // If this node has already been processed, stop now. 284343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (NI->getNodeId() != -1) continue; 285343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 286343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SUnit *NodeSUnit = NewSUnit(NI); 287343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 288343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // See if anything is flagged to this node, if so, add them to flagged 289343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // nodes. Nodes can have at most one flag input and one flag output. Flags 290db95fa131a229652f925794ca7a5b84e9490050bDan Gohman // are required to be the last operand and result of a node. 291343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 292343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // Scan up to find flagged preds. 293343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SDNode *N = NI; 294db95fa131a229652f925794ca7a5b84e9490050bDan Gohman while (N->getNumOperands() && 295825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson N->getOperand(N->getNumOperands()-1).getValueType() == MVT::Flag) { 296db95fa131a229652f925794ca7a5b84e9490050bDan Gohman N = N->getOperand(N->getNumOperands()-1).getNode(); 297db95fa131a229652f925794ca7a5b84e9490050bDan Gohman assert(N->getNodeId() == -1 && "Node already inserted!"); 298db95fa131a229652f925794ca7a5b84e9490050bDan Gohman N->setNodeId(NodeSUnit->NodeNum); 299343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 300343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 301343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // Scan down to find any flagged succs. 302343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman N = NI; 303825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson while (N->getValueType(N->getNumValues()-1) == MVT::Flag) { 304343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SDValue FlagVal(N, N->getNumValues()-1); 305343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 306343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // There are either zero or one users of the Flag result. 307343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman bool HasFlagUse = false; 308343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman for (SDNode::use_iterator UI = N->use_begin(), E = N->use_end(); 309343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman UI != E; ++UI) 310343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (FlagVal.isOperandOf(*UI)) { 311343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman HasFlagUse = true; 312343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman assert(N->getNodeId() == -1 && "Node already inserted!"); 313343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman N->setNodeId(NodeSUnit->NodeNum); 314343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman N = *UI; 315343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman break; 316343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 317343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (!HasFlagUse) break; 318343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 319343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 320343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // If there are flag operands involved, N is now the bottom-most node 321343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // of the sequence of nodes that are flagged together. 322343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // Update the SUnit. 323343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman NodeSUnit->setNode(N); 324343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman assert(N->getNodeId() == -1 && "Node already inserted!"); 325343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman N->setNodeId(NodeSUnit->NodeNum); 326343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 327787782f4ca0cca2523825131c24a6f78535a3eb8Dan Gohman // Assign the Latency field of NodeSUnit using target-provided information. 328e163168aab987dc3df0845b9e92310f764d8b158Evan Cheng ComputeLatency(NodeSUnit); 329343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 330c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman} 331c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman 332c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohmanvoid ScheduleDAGSDNodes::AddSchedEdges() { 333710461688bba935f0ad5c75da7fec2ad0f225c00David Goodwin const TargetSubtarget &ST = TM.getSubtarget<TargetSubtarget>(); 334710461688bba935f0ad5c75da7fec2ad0f225c00David Goodwin 335dc4bdcdef1c8dd1a28b82deb08df039e5c0ffc5aDavid Goodwin // Check to see if the scheduler cares about latencies. 336dc4bdcdef1c8dd1a28b82deb08df039e5c0ffc5aDavid Goodwin bool UnitLatencies = ForceUnitLatencies(); 337dc4bdcdef1c8dd1a28b82deb08df039e5c0ffc5aDavid Goodwin 338343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // Pass 2: add the preds, succs, etc. 339343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman for (unsigned su = 0, e = SUnits.size(); su != e; ++su) { 340343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SUnit *SU = &SUnits[su]; 341343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SDNode *MainNode = SU->getNode(); 342343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 343343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (MainNode->isMachineOpcode()) { 344343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman unsigned Opc = MainNode->getMachineOpcode(); 345343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman const TargetInstrDesc &TID = TII->get(Opc); 346343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman for (unsigned i = 0; i != TID.getNumOperands(); ++i) { 347343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (TID.getOperandConstraint(i, TOI::TIED_TO) != -1) { 348343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SU->isTwoAddress = true; 349343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman break; 350343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 351343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 352343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (TID.isCommutable()) 353343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SU->isCommutable = true; 354343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 355343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 356343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // Find all predecessors and successors of the group. 357343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman for (SDNode *N = SU->getNode(); N; N = N->getFlaggedNode()) { 358343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (N->isMachineOpcode() && 3593974667c1a6d48686e92f85bc4463bb239af7442Dan Gohman TII->get(N->getMachineOpcode()).getImplicitDefs()) { 3603974667c1a6d48686e92f85bc4463bb239af7442Dan Gohman SU->hasPhysRegClobbers = true; 361bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman unsigned NumUsed = InstrEmitter::CountResults(N); 3628cccf0ef0ced7f4d75ca574b596036a9b6cd4315Dan Gohman while (NumUsed != 0 && !N->hasAnyUseOfValue(NumUsed - 1)) 3638cccf0ef0ced7f4d75ca574b596036a9b6cd4315Dan Gohman --NumUsed; // Skip over unused values at the end. 3648cccf0ef0ced7f4d75ca574b596036a9b6cd4315Dan Gohman if (NumUsed > TII->get(N->getMachineOpcode()).getNumDefs()) 3653974667c1a6d48686e92f85bc4463bb239af7442Dan Gohman SU->hasPhysRegDefs = true; 3663974667c1a6d48686e92f85bc4463bb239af7442Dan Gohman } 367343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 368343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) { 369343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SDNode *OpN = N->getOperand(i).getNode(); 370343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (isPassiveNode(OpN)) continue; // Not scheduled. 371343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SUnit *OpSU = &SUnits[OpN->getNodeId()]; 372343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman assert(OpSU && "Node has no SUnit!"); 373343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (OpSU == SU) continue; // In the same group. 374343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 375e50ed30282bb5b4a9ed952580523f2dda16215acOwen Anderson EVT OpVT = N->getOperand(i).getValueType(); 376825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson assert(OpVT != MVT::Flag && "Flagged nodes should be in same sunit!"); 377825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson bool isChain = OpVT == MVT::Other; 378343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 379343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman unsigned PhysReg = 0; 380c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng int Cost = 1; 381343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // Determine if this is a physical register dependency. 382c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng CheckForPhysRegDependency(OpN, N, i, TRI, TII, PhysReg, Cost); 38354e4c36a7349e94a84773afb56eccd4ca65b49e9Dan Gohman assert((PhysReg == 0 || !isChain) && 38454e4c36a7349e94a84773afb56eccd4ca65b49e9Dan Gohman "Chain dependence via physreg data?"); 385c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng // FIXME: See ScheduleDAGSDNodes::EmitCopyFromReg. For now, scheduler 386c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng // emits a copy from the physical register to a virtual register unless 387c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng // it requires a cross class copy (cost < 0). That means we are only 388c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng // treating "expensive to copy" register dependency as physical register 389c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng // dependency. This may change in the future though. 390c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng if (Cost >= 0) 391c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng PhysReg = 0; 392710461688bba935f0ad5c75da7fec2ad0f225c00David Goodwin 393046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng // If this is a ctrl dep, latency is 1. 394046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng unsigned OpLatency = isChain ? 1 : OpSU->Latency; 395046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng const SDep &dep = SDep(OpSU, isChain ? SDep::Order : SDep::Data, 396046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng OpLatency, PhysReg); 397dc4bdcdef1c8dd1a28b82deb08df039e5c0ffc5aDavid Goodwin if (!isChain && !UnitLatencies) { 39815a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng ComputeOperandLatency(OpN, N, i, const_cast<SDep &>(dep)); 3993fb150a9024a38872ec4abbc3300e08a8bfc1812Dan Gohman ST.adjustSchedDependency(OpSU, SU, const_cast<SDep &>(dep)); 400dc4bdcdef1c8dd1a28b82deb08df039e5c0ffc5aDavid Goodwin } 401710461688bba935f0ad5c75da7fec2ad0f225c00David Goodwin 402710461688bba935f0ad5c75da7fec2ad0f225c00David Goodwin SU->addPred(dep); 403343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 404343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 405343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 406343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman} 407343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 408c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman/// BuildSchedGraph - Build the SUnit graph from the selection dag that we 409c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman/// are input. This SUnit graph is similar to the SelectionDAG, but 410c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman/// excludes nodes that aren't interesting to scheduling, and represents 411c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman/// flagged together nodes with a single SUnit. 41298976e4dcd18adbbe676048c0069e67346eb4adeDan Gohmanvoid ScheduleDAGSDNodes::BuildSchedGraph(AliasAnalysis *AA) { 413302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng // Cluster certain nodes which should be scheduled together. 414302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng ClusterNodes(); 415c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman // Populate the SUnits array. 416c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman BuildSchedUnits(); 417c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman // Compute all the scheduling dependencies between nodes. 418c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman AddSchedEdges(); 419c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman} 420c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman 421343f0c046702831a4a6aec951b6a297a23241a55Dan Gohmanvoid ScheduleDAGSDNodes::ComputeLatency(SUnit *SU) { 422e163168aab987dc3df0845b9e92310f764d8b158Evan Cheng // Check to see if the scheduler cares about latencies. 423e163168aab987dc3df0845b9e92310f764d8b158Evan Cheng if (ForceUnitLatencies()) { 424e163168aab987dc3df0845b9e92310f764d8b158Evan Cheng SU->Latency = 1; 425e163168aab987dc3df0845b9e92310f764d8b158Evan Cheng return; 426e163168aab987dc3df0845b9e92310f764d8b158Evan Cheng } 427e163168aab987dc3df0845b9e92310f764d8b158Evan Cheng 428343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman const InstrItineraryData &InstrItins = TM.getInstrItineraryData(); 42915a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng if (InstrItins.isEmpty()) { 43015a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng SU->Latency = 1; 43115a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng return; 43215a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng } 433343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 434343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // Compute the latency for the node. We use the sum of the latencies for 435343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // all nodes flagged together into this SUnit. 436343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SU->Latency = 0; 437c8c2827993204207ca70a93f62f233fbe81b97efDan Gohman for (SDNode *N = SU->getNode(); N; N = N->getFlaggedNode()) 438343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (N->isMachineOpcode()) { 439dc4bdcdef1c8dd1a28b82deb08df039e5c0ffc5aDavid Goodwin SU->Latency += InstrItins. 440dc4bdcdef1c8dd1a28b82deb08df039e5c0ffc5aDavid Goodwin getStageLatency(TII->get(N->getMachineOpcode()).getSchedClass()); 441343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 442343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman} 443343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 44415a16def6e70c8f7df1023da80ceb89887203b40Evan Chengvoid ScheduleDAGSDNodes::ComputeOperandLatency(SDNode *Def, SDNode *Use, 44515a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng unsigned OpIdx, SDep& dep) const{ 44615a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng // Check to see if the scheduler cares about latencies. 44715a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng if (ForceUnitLatencies()) 44815a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng return; 44915a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng 45015a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng const InstrItineraryData &InstrItins = TM.getInstrItineraryData(); 45115a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng if (InstrItins.isEmpty()) 45215a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng return; 45315a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng 45415a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng if (dep.getKind() != SDep::Data) 45515a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng return; 45615a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng 45715a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng unsigned DefIdx = Use->getOperand(OpIdx).getResNo(); 458046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng if (Def->isMachineOpcode()) { 45915a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng const TargetInstrDesc &II = TII->get(Def->getMachineOpcode()); 46015a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng if (DefIdx >= II.getNumDefs()) 46115a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng return; 46215a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng int DefCycle = InstrItins.getOperandCycle(II.getSchedClass(), DefIdx); 46315a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng if (DefCycle < 0) 46415a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng return; 465046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng int UseCycle = 1; 466046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng if (Use->isMachineOpcode()) { 467046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng const unsigned UseClass = TII->get(Use->getMachineOpcode()).getSchedClass(); 468046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng UseCycle = InstrItins.getOperandCycle(UseClass, OpIdx); 469046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng } 47015a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng if (UseCycle >= 0) { 47115a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng int Latency = DefCycle - UseCycle + 1; 47215a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng if (Latency >= 0) 47315a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng dep.setLatency(Latency); 47415a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng } 47515a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng } 47615a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng} 47715a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng 478343f0c046702831a4a6aec951b6a297a23241a55Dan Gohmanvoid ScheduleDAGSDNodes::dumpNode(const SUnit *SU) const { 479c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng if (!SU->getNode()) { 48084fa8229bbd3813505b7e8d6555fb2e522104e30David Greene dbgs() << "PHYS REG COPY\n"; 481c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng return; 482c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng } 483c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng 484c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng SU->getNode()->dump(DAG); 48584fa8229bbd3813505b7e8d6555fb2e522104e30David Greene dbgs() << "\n"; 486343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SmallVector<SDNode *, 4> FlaggedNodes; 487343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman for (SDNode *N = SU->getNode()->getFlaggedNode(); N; N = N->getFlaggedNode()) 488343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman FlaggedNodes.push_back(N); 489343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman while (!FlaggedNodes.empty()) { 49084fa8229bbd3813505b7e8d6555fb2e522104e30David Greene dbgs() << " "; 491343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman FlaggedNodes.back()->dump(DAG); 49284fa8229bbd3813505b7e8d6555fb2e522104e30David Greene dbgs() << "\n"; 493343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman FlaggedNodes.pop_back(); 494343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 495343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman} 496bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman 497bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Chengnamespace { 498bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng struct OrderSorter { 499bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng bool operator()(const std::pair<unsigned, MachineInstr*> &A, 500bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng const std::pair<unsigned, MachineInstr*> &B) { 501bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng return A.first < B.first; 502bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 503bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng }; 504bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng} 505bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 506bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng// ProcessSourceNode - Process nodes with source order numbers. These are added 507bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng// to a vector which EmitSchedule use to determine how to insert dbg_value 508bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng// instructions in the right order. 509bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Chengstatic void ProcessSourceNode(SDNode *N, SelectionDAG *DAG, 510bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng InstrEmitter &Emitter, 511bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng DenseMap<SDValue, unsigned> &VRBaseMap, 512bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SmallVector<std::pair<unsigned, MachineInstr*>, 32> &Orders, 513bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SmallSet<unsigned, 8> &Seen) { 514bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng unsigned Order = DAG->GetOrdering(N); 515bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (!Order || !Seen.insert(Order)) 516bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng return; 517bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 518bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng MachineBasicBlock *BB = Emitter.getBlock(); 519bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (BB->empty() || BB->back().isPHI()) { 520bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // Did not insert any instruction. 521bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng Orders.push_back(std::make_pair(Order, (MachineInstr*)0)); 522bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng return; 523bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 524bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 525bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng Orders.push_back(std::make_pair(Order, &BB->back())); 526bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (!N->getHasDebugValue()) 527bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng return; 528bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // Opportunistically insert immediate dbg_value uses, i.e. those with source 529bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // order number right after the N. 530bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng MachineBasicBlock::iterator InsertPos = Emitter.getInsertPos(); 531bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SmallVector<SDDbgValue*,2> &DVs = DAG->GetDbgValues(N); 532bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng for (unsigned i = 0, e = DVs.size(); i != e; ++i) { 533bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (DVs[i]->isInvalidated()) 534bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng continue; 535bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng unsigned DVOrder = DVs[i]->getOrder(); 536bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (DVOrder == ++Order) { 537891ff8fbd61a06ef8ea57461fa377ebbb663ed09Dan Gohman MachineInstr *DbgMI = Emitter.EmitDbgValue(DVs[i], VRBaseMap); 538962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng if (DbgMI) { 539962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng Orders.push_back(std::make_pair(DVOrder, DbgMI)); 540962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng BB->insert(InsertPos, DbgMI); 541962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng } 542bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng DVs[i]->setIsInvalidated(); 543bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 544bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 545bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng} 546bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 547bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 548bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman/// EmitSchedule - Emit the machine code in scheduled order. 549af1d8ca44a18f304f207e209b3bdb94b590f86ffDan GohmanMachineBasicBlock *ScheduleDAGSDNodes::EmitSchedule() { 550bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman InstrEmitter Emitter(BB, InsertPos); 551bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman DenseMap<SDValue, unsigned> VRBaseMap; 552bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman DenseMap<SUnit*, unsigned> CopyVRBaseMap; 553bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SmallVector<std::pair<unsigned, MachineInstr*>, 32> Orders; 554bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SmallSet<unsigned, 8> Seen; 555bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng bool HasDbg = DAG->hasDebugValues(); 556bfdf7f38523bd38ae0538861a2bfd8bdc46e5c33Dale Johannesen 557fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen // If this is the first BB, emit byval parameter dbg_value's. 558fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen if (HasDbg && BB->getParent()->begin() == MachineFunction::iterator(BB)) { 559fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen SDDbgInfo::DbgIterator PDI = DAG->ByvalParmDbgBegin(); 560fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen SDDbgInfo::DbgIterator PDE = DAG->ByvalParmDbgEnd(); 561fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen for (; PDI != PDE; ++PDI) { 562891ff8fbd61a06ef8ea57461fa377ebbb663ed09Dan Gohman MachineInstr *DbgMI= Emitter.EmitDbgValue(*PDI, VRBaseMap); 563fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen if (DbgMI) 564403a8cdda5e76ea689693de16474650b4b0df818Dan Gohman BB->push_back(DbgMI); 565fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen } 566fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen } 567fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen 568bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman for (unsigned i = 0, e = Sequence.size(); i != e; i++) { 569bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman SUnit *SU = Sequence[i]; 570bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman if (!SU) { 571bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman // Null SUnit* is a noop. 572bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman EmitNoop(); 573bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman continue; 574bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman } 575bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman 576bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman // For pre-regalloc scheduling, create instructions corresponding to the 577bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman // SDNode and any flagged SDNodes and append them to the block. 578bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman if (!SU->getNode()) { 579bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman // Emit a copy. 580bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman EmitPhysRegCopy(SU, CopyVRBaseMap); 581bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman continue; 582bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman } 583bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman 584bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman SmallVector<SDNode *, 4> FlaggedNodes; 585bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman for (SDNode *N = SU->getNode()->getFlaggedNode(); N; 586bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman N = N->getFlaggedNode()) 587bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman FlaggedNodes.push_back(N); 588bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman while (!FlaggedNodes.empty()) { 589bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SDNode *N = FlaggedNodes.back(); 590bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman Emitter.EmitNode(FlaggedNodes.back(), SU->OrigNode != SU, SU->isCloned, 591af1d8ca44a18f304f207e209b3bdb94b590f86ffDan Gohman VRBaseMap); 592fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen // Remember the source order of the inserted instruction. 593bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (HasDbg) 594891ff8fbd61a06ef8ea57461fa377ebbb663ed09Dan Gohman ProcessSourceNode(N, DAG, Emitter, VRBaseMap, Orders, Seen); 595bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman FlaggedNodes.pop_back(); 596bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman } 597bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman Emitter.EmitNode(SU->getNode(), SU->OrigNode != SU, SU->isCloned, 598af1d8ca44a18f304f207e209b3bdb94b590f86ffDan Gohman VRBaseMap); 599fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen // Remember the source order of the inserted instruction. 600bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (HasDbg) 601891ff8fbd61a06ef8ea57461fa377ebbb663ed09Dan Gohman ProcessSourceNode(SU->getNode(), DAG, Emitter, VRBaseMap, Orders, 602bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng Seen); 603bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 604bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 605fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen // Insert all the dbg_values which have not already been inserted in source 606bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // order sequence. 607bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (HasDbg) { 608bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng MachineBasicBlock::iterator BBBegin = BB->empty() ? BB->end() : BB->begin(); 609bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng while (BBBegin != BB->end() && BBBegin->isPHI()) 610bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng ++BBBegin; 611bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 612bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // Sort the source order instructions and use the order to insert debug 613bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // values. 614bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng std::sort(Orders.begin(), Orders.end(), OrderSorter()); 615bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 616bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SDDbgInfo::DbgIterator DI = DAG->DbgBegin(); 617bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SDDbgInfo::DbgIterator DE = DAG->DbgEnd(); 618bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // Now emit the rest according to source order. 619bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng unsigned LastOrder = 0; 620bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng MachineInstr *LastMI = 0; 621bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng for (unsigned i = 0, e = Orders.size(); i != e && DI != DE; ++i) { 622bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng unsigned Order = Orders[i].first; 623bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng MachineInstr *MI = Orders[i].second; 624bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // Insert all SDDbgValue's whose order(s) are before "Order". 625bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (!MI) 626bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng continue; 627bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng MachineBasicBlock *MIBB = MI->getParent(); 6284ec9bd9a6f92a10185870bae2cebce199f6acc5aEvan Cheng#ifndef NDEBUG 6294ec9bd9a6f92a10185870bae2cebce199f6acc5aEvan Cheng unsigned LastDIOrder = 0; 6304ec9bd9a6f92a10185870bae2cebce199f6acc5aEvan Cheng#endif 631bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng for (; DI != DE && 632bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng (*DI)->getOrder() >= LastOrder && (*DI)->getOrder() < Order; ++DI) { 6334ec9bd9a6f92a10185870bae2cebce199f6acc5aEvan Cheng#ifndef NDEBUG 6344ec9bd9a6f92a10185870bae2cebce199f6acc5aEvan Cheng assert((*DI)->getOrder() >= LastDIOrder && 6354ec9bd9a6f92a10185870bae2cebce199f6acc5aEvan Cheng "SDDbgValue nodes must be in source order!"); 6364ec9bd9a6f92a10185870bae2cebce199f6acc5aEvan Cheng LastDIOrder = (*DI)->getOrder(); 6374ec9bd9a6f92a10185870bae2cebce199f6acc5aEvan Cheng#endif 638bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if ((*DI)->isInvalidated()) 639bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng continue; 640891ff8fbd61a06ef8ea57461fa377ebbb663ed09Dan Gohman MachineInstr *DbgMI = Emitter.EmitDbgValue(*DI, VRBaseMap); 641962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng if (DbgMI) { 642962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng if (!LastOrder) 643962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng // Insert to start of the BB (after PHIs). 644962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng BB->insert(BBBegin, DbgMI); 645962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng else { 646962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng MachineBasicBlock::iterator Pos = MI; 647962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng MIBB->insert(llvm::next(Pos), DbgMI); 648962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng } 649bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 650bfdf7f38523bd38ae0538861a2bfd8bdc46e5c33Dale Johannesen } 651bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng LastOrder = Order; 652bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng LastMI = MI; 653bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 654bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // Add trailing DbgValue's before the terminator. FIXME: May want to add 655bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // some of them before one or more conditional branches? 656bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng while (DI != DE) { 657bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng MachineBasicBlock *InsertBB = Emitter.getBlock(); 658bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng MachineBasicBlock::iterator Pos= Emitter.getBlock()->getFirstTerminator(); 659bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (!(*DI)->isInvalidated()) { 660891ff8fbd61a06ef8ea57461fa377ebbb663ed09Dan Gohman MachineInstr *DbgMI= Emitter.EmitDbgValue(*DI, VRBaseMap); 661962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng if (DbgMI) 662962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng InsertBB->insert(Pos, DbgMI); 663bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 664bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng ++DI; 665bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 666bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman } 667bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman 668bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman BB = Emitter.getBlock(); 669bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman InsertPos = Emitter.getInsertPos(); 670bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman return BB; 671bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman} 672