ScheduleDAGSDNodes.cpp revision 15a16def6e70c8f7df1023da80ceb89887203b40
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" 22343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman#include "llvm/Target/TargetRegisterInfo.h" 23710461688bba935f0ad5c75da7fec2ad0f225c00David Goodwin#include "llvm/Target/TargetSubtarget.h" 24c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng#include "llvm/ADT/DenseMap.h" 25c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng#include "llvm/ADT/SmallPtrSet.h" 26bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng#include "llvm/ADT/SmallSet.h" 27c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng#include "llvm/ADT/SmallVector.h" 28c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng#include "llvm/ADT/Statistic.h" 29343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman#include "llvm/Support/Debug.h" 30343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman#include "llvm/Support/raw_ostream.h" 31343f0c046702831a4a6aec951b6a297a23241a55Dan Gohmanusing namespace llvm; 32343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 33c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan ChengSTATISTIC(LoadsClustered, "Number of loads clustered together"); 34c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 3579ce276083ced01256a0eb7d80731e4948ca6e87Dan GohmanScheduleDAGSDNodes::ScheduleDAGSDNodes(MachineFunction &mf) 3679ce276083ced01256a0eb7d80731e4948ca6e87Dan Gohman : ScheduleDAG(mf) { 37343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman} 38343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 3947ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman/// Run - perform scheduling. 4047ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman/// 4147ac0f0c7c39289f5970688154e385be22b7f293Dan Gohmanvoid ScheduleDAGSDNodes::Run(SelectionDAG *dag, MachineBasicBlock *bb, 4247ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman MachineBasicBlock::iterator insertPos) { 4347ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman DAG = dag; 4447ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman ScheduleDAG::Run(bb, insertPos); 4547ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman} 4647ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman 47343f0c046702831a4a6aec951b6a297a23241a55Dan GohmanSUnit *ScheduleDAGSDNodes::Clone(SUnit *Old) { 48343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SUnit *SU = NewSUnit(Old->getNode()); 49343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SU->OrigNode = Old->OrigNode; 50343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SU->Latency = Old->Latency; 51343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SU->isTwoAddress = Old->isTwoAddress; 52343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SU->isCommutable = Old->isCommutable; 53343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SU->hasPhysRegDefs = Old->hasPhysRegDefs; 543974667c1a6d48686e92f85bc4463bb239af7442Dan Gohman SU->hasPhysRegClobbers = Old->hasPhysRegClobbers; 55e57187cbe321a286f6a7f409a7badd1ae4e4642cEvan Cheng Old->isCloned = true; 56343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman return SU; 57343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman} 58343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 59343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman/// CheckForPhysRegDependency - Check if the dependency between def and use of 60343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman/// a specified operand is a physical register dependency. If so, returns the 61c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng/// register and the cost of copying the register. 62343f0c046702831a4a6aec951b6a297a23241a55Dan Gohmanstatic void CheckForPhysRegDependency(SDNode *Def, SDNode *User, unsigned Op, 63343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman const TargetRegisterInfo *TRI, 64343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman const TargetInstrInfo *TII, 65c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng unsigned &PhysReg, int &Cost) { 66343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (Op != 2 || User->getOpcode() != ISD::CopyToReg) 67343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman return; 68343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 69343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman unsigned Reg = cast<RegisterSDNode>(User->getOperand(1))->getReg(); 70343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (TargetRegisterInfo::isVirtualRegister(Reg)) 71343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman return; 72343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 73343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman unsigned ResNo = User->getOperand(2).getResNo(); 74343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (Def->isMachineOpcode()) { 75343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman const TargetInstrDesc &II = TII->get(Def->getMachineOpcode()); 76343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (ResNo >= II.getNumDefs() && 77c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng II.ImplicitDefs[ResNo - II.getNumDefs()] == Reg) { 78343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman PhysReg = Reg; 79c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng const TargetRegisterClass *RC = 80c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng TRI->getPhysicalRegisterRegClass(Reg, Def->getValueType(ResNo)); 81c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng Cost = RC->getCopyCost(); 82c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng } 83343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 84343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman} 85343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 86c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Chengstatic void AddFlags(SDNode *N, SDValue Flag, bool AddFlag, 87c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SelectionDAG *DAG) { 88c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SmallVector<EVT, 4> VTs; 89c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) 90c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng VTs.push_back(N->getValueType(i)); 91c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng if (AddFlag) 92c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng VTs.push_back(MVT::Flag); 93c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SmallVector<SDValue, 4> Ops; 94c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 95c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng Ops.push_back(N->getOperand(i)); 96c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng if (Flag.getNode()) 97c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng Ops.push_back(Flag); 98c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SDVTList VTList = DAG->getVTList(&VTs[0], VTs.size()); 99c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng DAG->MorphNodeTo(N, N->getOpcode(), VTList, &Ops[0], Ops.size()); 100c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng} 101c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 102c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng/// ClusterNeighboringLoads - Force nearby loads together by "flagging" them. 103c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng/// This function finds loads of the same base and different offsets. If the 104c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng/// offsets are not far apart (target specific), it add MVT::Flag inputs and 105c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng/// outputs to ensure they are scheduled together and in order. This 106c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng/// optimization may benefit some targets by improving cache locality. 107c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Chengvoid ScheduleDAGSDNodes::ClusterNeighboringLoads() { 108c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SmallPtrSet<SDNode*, 16> Visited; 109c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SmallVector<int64_t, 4> Offsets; 110c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng DenseMap<long long, SDNode*> O2SMap; // Map from offset to SDNode. 111c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng for (SelectionDAG::allnodes_iterator NI = DAG->allnodes_begin(), 112c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng E = DAG->allnodes_end(); NI != E; ++NI) { 113c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SDNode *Node = &*NI; 114c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng if (!Node || !Node->isMachineOpcode()) 115c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng continue; 116c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 117c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng unsigned Opc = Node->getMachineOpcode(); 118c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng const TargetInstrDesc &TID = TII->get(Opc); 119c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng if (!TID.mayLoad()) 120c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng continue; 121c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 122c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SDNode *Chain = 0; 123c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng unsigned NumOps = Node->getNumOperands(); 124c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng if (Node->getOperand(NumOps-1).getValueType() == MVT::Other) 125c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng Chain = Node->getOperand(NumOps-1).getNode(); 126c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng if (!Chain) 127c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng continue; 128c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 129c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng // Look for other loads of the same chain. Find loads that are loading from 130c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng // the same base pointer and different offsets. 131c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng Visited.clear(); 132c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng Offsets.clear(); 133c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng O2SMap.clear(); 134c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng bool Cluster = false; 135c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SDNode *Base = Node; 136c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng int64_t BaseOffset; 137c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng for (SDNode::use_iterator I = Chain->use_begin(), E = Chain->use_end(); 138c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng I != E; ++I) { 139c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SDNode *User = *I; 140c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng if (User == Node || !Visited.insert(User)) 141c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng continue; 142c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng int64_t Offset1, Offset2; 143c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng if (!TII->areLoadsFromSameBasePtr(Base, User, Offset1, Offset2) || 144c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng Offset1 == Offset2) 145c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng // FIXME: Should be ok if they addresses are identical. But earlier 146c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng // optimizations really should have eliminated one of the loads. 147c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng continue; 148c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng if (O2SMap.insert(std::make_pair(Offset1, Base)).second) 149c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng Offsets.push_back(Offset1); 150c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng O2SMap.insert(std::make_pair(Offset2, User)); 151c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng Offsets.push_back(Offset2); 152c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng if (Offset2 < Offset1) { 153c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng Base = User; 154c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng BaseOffset = Offset2; 155c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng } else { 156c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng BaseOffset = Offset1; 157c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng } 158c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng Cluster = true; 159c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng } 160c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 161c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng if (!Cluster) 162c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng continue; 163c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 164c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng // Sort them in increasing order. 165c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng std::sort(Offsets.begin(), Offsets.end()); 166c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 167c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng // Check if the loads are close enough. 168c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SmallVector<SDNode*, 4> Loads; 169c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng unsigned NumLoads = 0; 170c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng int64_t BaseOff = Offsets[0]; 171c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SDNode *BaseLoad = O2SMap[BaseOff]; 172c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng Loads.push_back(BaseLoad); 173c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng for (unsigned i = 1, e = Offsets.size(); i != e; ++i) { 174c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng int64_t Offset = Offsets[i]; 175c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SDNode *Load = O2SMap[Offset]; 176c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng if (!TII->shouldScheduleLoadsNear(BaseLoad, Load, BaseOff, Offset, 177c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng NumLoads)) 178c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng break; // Stop right here. Ignore loads that are further away. 179c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng Loads.push_back(Load); 180c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng ++NumLoads; 181c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng } 182c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 183c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng if (NumLoads == 0) 184c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng continue; 185c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 186c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng // Cluster loads by adding MVT::Flag outputs and inputs. This also 187c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng // ensure they are scheduled in order of increasing addresses. 188c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SDNode *Lead = Loads[0]; 189c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng AddFlags(Lead, SDValue(0,0), true, DAG); 190c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SDValue InFlag = SDValue(Lead, Lead->getNumValues()-1); 191c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng for (unsigned i = 1, e = Loads.size(); i != e; ++i) { 192c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng bool OutFlag = i < e-1; 193c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SDNode *Load = Loads[i]; 194c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng AddFlags(Load, InFlag, OutFlag, DAG); 195c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng if (OutFlag) 196c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng InFlag = SDValue(Load, Load->getNumValues()-1); 197c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng ++LoadsClustered; 198c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng } 199c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng } 200c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng} 201c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 202343f0c046702831a4a6aec951b6a297a23241a55Dan Gohmanvoid ScheduleDAGSDNodes::BuildSchedUnits() { 203343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // During scheduling, the NodeId field of SDNode is used to map SDNodes 204343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // to their associated SUnits by holding SUnits table indices. A value 205343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // of -1 means the SDNode does not yet have an associated SUnit. 206e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman unsigned NumNodes = 0; 207343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman for (SelectionDAG::allnodes_iterator NI = DAG->allnodes_begin(), 208e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman E = DAG->allnodes_end(); NI != E; ++NI) { 209343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman NI->setNodeId(-1); 210e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman ++NumNodes; 211e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman } 212343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 213e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman // Reserve entries in the vector for each of the SUnits we are creating. This 214e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman // ensure that reallocation of the vector won't happen, so SUnit*'s won't get 215e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman // invalidated. 216e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman // FIXME: Multiply by 2 because we may clone nodes during scheduling. 217e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman // This is a temporary workaround. 218e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman SUnits.reserve(NumNodes * 2); 219e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman 220736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner // Add all nodes in depth first order. 221736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner SmallVector<SDNode*, 64> Worklist; 222736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner SmallPtrSet<SDNode*, 64> Visited; 223736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner Worklist.push_back(DAG->getRoot().getNode()); 224736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner Visited.insert(DAG->getRoot().getNode()); 225736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner 226736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner while (!Worklist.empty()) { 227736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner SDNode *NI = Worklist.pop_back_val(); 228736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner 229736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner // Add all operands to the worklist unless they've already been added. 230736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner for (unsigned i = 0, e = NI->getNumOperands(); i != e; ++i) 231736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner if (Visited.insert(NI->getOperand(i).getNode())) 232736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner Worklist.push_back(NI->getOperand(i).getNode()); 233736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner 234343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (isPassiveNode(NI)) // Leaf node, e.g. a TargetImmediate. 235343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman continue; 236343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 237343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // If this node has already been processed, stop now. 238343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (NI->getNodeId() != -1) continue; 239343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 240343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SUnit *NodeSUnit = NewSUnit(NI); 241343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 242343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // See if anything is flagged to this node, if so, add them to flagged 243343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // nodes. Nodes can have at most one flag input and one flag output. Flags 244db95fa131a229652f925794ca7a5b84e9490050bDan Gohman // are required to be the last operand and result of a node. 245343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 246343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // Scan up to find flagged preds. 247343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SDNode *N = NI; 248db95fa131a229652f925794ca7a5b84e9490050bDan Gohman while (N->getNumOperands() && 249825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson N->getOperand(N->getNumOperands()-1).getValueType() == MVT::Flag) { 250db95fa131a229652f925794ca7a5b84e9490050bDan Gohman N = N->getOperand(N->getNumOperands()-1).getNode(); 251db95fa131a229652f925794ca7a5b84e9490050bDan Gohman assert(N->getNodeId() == -1 && "Node already inserted!"); 252db95fa131a229652f925794ca7a5b84e9490050bDan Gohman N->setNodeId(NodeSUnit->NodeNum); 253343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 254343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 255343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // Scan down to find any flagged succs. 256343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman N = NI; 257825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson while (N->getValueType(N->getNumValues()-1) == MVT::Flag) { 258343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SDValue FlagVal(N, N->getNumValues()-1); 259343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 260343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // There are either zero or one users of the Flag result. 261343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman bool HasFlagUse = false; 262343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman for (SDNode::use_iterator UI = N->use_begin(), E = N->use_end(); 263343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman UI != E; ++UI) 264343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (FlagVal.isOperandOf(*UI)) { 265343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman HasFlagUse = true; 266343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman assert(N->getNodeId() == -1 && "Node already inserted!"); 267343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman N->setNodeId(NodeSUnit->NodeNum); 268343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman N = *UI; 269343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman break; 270343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 271343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (!HasFlagUse) break; 272343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 273343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 274343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // If there are flag operands involved, N is now the bottom-most node 275343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // of the sequence of nodes that are flagged together. 276343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // Update the SUnit. 277343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman NodeSUnit->setNode(N); 278343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman assert(N->getNodeId() == -1 && "Node already inserted!"); 279343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman N->setNodeId(NodeSUnit->NodeNum); 280343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 281787782f4ca0cca2523825131c24a6f78535a3eb8Dan Gohman // Assign the Latency field of NodeSUnit using target-provided information. 282e163168aab987dc3df0845b9e92310f764d8b158Evan Cheng ComputeLatency(NodeSUnit); 283343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 284c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman} 285c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman 286c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohmanvoid ScheduleDAGSDNodes::AddSchedEdges() { 287710461688bba935f0ad5c75da7fec2ad0f225c00David Goodwin const TargetSubtarget &ST = TM.getSubtarget<TargetSubtarget>(); 288710461688bba935f0ad5c75da7fec2ad0f225c00David Goodwin 289dc4bdcdef1c8dd1a28b82deb08df039e5c0ffc5aDavid Goodwin // Check to see if the scheduler cares about latencies. 290dc4bdcdef1c8dd1a28b82deb08df039e5c0ffc5aDavid Goodwin bool UnitLatencies = ForceUnitLatencies(); 291dc4bdcdef1c8dd1a28b82deb08df039e5c0ffc5aDavid Goodwin 292343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // Pass 2: add the preds, succs, etc. 293343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman for (unsigned su = 0, e = SUnits.size(); su != e; ++su) { 294343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SUnit *SU = &SUnits[su]; 295343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SDNode *MainNode = SU->getNode(); 296343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 297343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (MainNode->isMachineOpcode()) { 298343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman unsigned Opc = MainNode->getMachineOpcode(); 299343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman const TargetInstrDesc &TID = TII->get(Opc); 300343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman for (unsigned i = 0; i != TID.getNumOperands(); ++i) { 301343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (TID.getOperandConstraint(i, TOI::TIED_TO) != -1) { 302343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SU->isTwoAddress = true; 303343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman break; 304343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 305343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 306343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (TID.isCommutable()) 307343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SU->isCommutable = true; 308343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 309343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 310343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // Find all predecessors and successors of the group. 311343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman for (SDNode *N = SU->getNode(); N; N = N->getFlaggedNode()) { 312343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (N->isMachineOpcode() && 3133974667c1a6d48686e92f85bc4463bb239af7442Dan Gohman TII->get(N->getMachineOpcode()).getImplicitDefs()) { 3143974667c1a6d48686e92f85bc4463bb239af7442Dan Gohman SU->hasPhysRegClobbers = true; 315bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman unsigned NumUsed = InstrEmitter::CountResults(N); 3168cccf0ef0ced7f4d75ca574b596036a9b6cd4315Dan Gohman while (NumUsed != 0 && !N->hasAnyUseOfValue(NumUsed - 1)) 3178cccf0ef0ced7f4d75ca574b596036a9b6cd4315Dan Gohman --NumUsed; // Skip over unused values at the end. 3188cccf0ef0ced7f4d75ca574b596036a9b6cd4315Dan Gohman if (NumUsed > TII->get(N->getMachineOpcode()).getNumDefs()) 3193974667c1a6d48686e92f85bc4463bb239af7442Dan Gohman SU->hasPhysRegDefs = true; 3203974667c1a6d48686e92f85bc4463bb239af7442Dan Gohman } 321343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 322343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) { 323343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SDNode *OpN = N->getOperand(i).getNode(); 324343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (isPassiveNode(OpN)) continue; // Not scheduled. 325343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SUnit *OpSU = &SUnits[OpN->getNodeId()]; 326343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman assert(OpSU && "Node has no SUnit!"); 327343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (OpSU == SU) continue; // In the same group. 328343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 329e50ed30282bb5b4a9ed952580523f2dda16215acOwen Anderson EVT OpVT = N->getOperand(i).getValueType(); 330825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson assert(OpVT != MVT::Flag && "Flagged nodes should be in same sunit!"); 331825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson bool isChain = OpVT == MVT::Other; 332343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 333343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman unsigned PhysReg = 0; 334c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng int Cost = 1; 335343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // Determine if this is a physical register dependency. 336c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng CheckForPhysRegDependency(OpN, N, i, TRI, TII, PhysReg, Cost); 33754e4c36a7349e94a84773afb56eccd4ca65b49e9Dan Gohman assert((PhysReg == 0 || !isChain) && 33854e4c36a7349e94a84773afb56eccd4ca65b49e9Dan Gohman "Chain dependence via physreg data?"); 339c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng // FIXME: See ScheduleDAGSDNodes::EmitCopyFromReg. For now, scheduler 340c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng // emits a copy from the physical register to a virtual register unless 341c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng // it requires a cross class copy (cost < 0). That means we are only 342c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng // treating "expensive to copy" register dependency as physical register 343c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng // dependency. This may change in the future though. 344c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng if (Cost >= 0) 345c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng PhysReg = 0; 346710461688bba935f0ad5c75da7fec2ad0f225c00David Goodwin 347710461688bba935f0ad5c75da7fec2ad0f225c00David Goodwin const SDep& dep = SDep(OpSU, isChain ? SDep::Order : SDep::Data, 348710461688bba935f0ad5c75da7fec2ad0f225c00David Goodwin OpSU->Latency, PhysReg); 349dc4bdcdef1c8dd1a28b82deb08df039e5c0ffc5aDavid Goodwin if (!isChain && !UnitLatencies) { 35015a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng ComputeOperandLatency(OpN, N, i, const_cast<SDep &>(dep)); 3513fb150a9024a38872ec4abbc3300e08a8bfc1812Dan Gohman ST.adjustSchedDependency(OpSU, SU, const_cast<SDep &>(dep)); 352dc4bdcdef1c8dd1a28b82deb08df039e5c0ffc5aDavid Goodwin } 353710461688bba935f0ad5c75da7fec2ad0f225c00David Goodwin 354710461688bba935f0ad5c75da7fec2ad0f225c00David Goodwin SU->addPred(dep); 355343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 356343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 357343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 358343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman} 359343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 360c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman/// BuildSchedGraph - Build the SUnit graph from the selection dag that we 361c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman/// are input. This SUnit graph is similar to the SelectionDAG, but 362c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman/// excludes nodes that aren't interesting to scheduling, and represents 363c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman/// flagged together nodes with a single SUnit. 36498976e4dcd18adbbe676048c0069e67346eb4adeDan Gohmanvoid ScheduleDAGSDNodes::BuildSchedGraph(AliasAnalysis *AA) { 365c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng // Cluster loads from "near" addresses into combined SUnits. 36642dae2d5ba0c22bed65e80ac56a7c304de911c33Evan Cheng ClusterNeighboringLoads(); 367c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman // Populate the SUnits array. 368c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman BuildSchedUnits(); 369c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman // Compute all the scheduling dependencies between nodes. 370c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman AddSchedEdges(); 371c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman} 372c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman 373343f0c046702831a4a6aec951b6a297a23241a55Dan Gohmanvoid ScheduleDAGSDNodes::ComputeLatency(SUnit *SU) { 374e163168aab987dc3df0845b9e92310f764d8b158Evan Cheng // Check to see if the scheduler cares about latencies. 375e163168aab987dc3df0845b9e92310f764d8b158Evan Cheng if (ForceUnitLatencies()) { 376e163168aab987dc3df0845b9e92310f764d8b158Evan Cheng SU->Latency = 1; 377e163168aab987dc3df0845b9e92310f764d8b158Evan Cheng return; 378e163168aab987dc3df0845b9e92310f764d8b158Evan Cheng } 379e163168aab987dc3df0845b9e92310f764d8b158Evan Cheng 380343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman const InstrItineraryData &InstrItins = TM.getInstrItineraryData(); 38115a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng if (InstrItins.isEmpty()) { 38215a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng SU->Latency = 1; 38315a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng return; 38415a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng } 385343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 386343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // Compute the latency for the node. We use the sum of the latencies for 387343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // all nodes flagged together into this SUnit. 388343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SU->Latency = 0; 389c8c2827993204207ca70a93f62f233fbe81b97efDan Gohman for (SDNode *N = SU->getNode(); N; N = N->getFlaggedNode()) 390343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (N->isMachineOpcode()) { 391dc4bdcdef1c8dd1a28b82deb08df039e5c0ffc5aDavid Goodwin SU->Latency += InstrItins. 392dc4bdcdef1c8dd1a28b82deb08df039e5c0ffc5aDavid Goodwin getStageLatency(TII->get(N->getMachineOpcode()).getSchedClass()); 393343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 394343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman} 395343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 39615a16def6e70c8f7df1023da80ceb89887203b40Evan Chengvoid ScheduleDAGSDNodes::ComputeOperandLatency(SDNode *Def, SDNode *Use, 39715a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng unsigned OpIdx, SDep& dep) const{ 39815a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng // Check to see if the scheduler cares about latencies. 39915a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng if (ForceUnitLatencies()) 40015a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng return; 40115a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng 40215a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng const InstrItineraryData &InstrItins = TM.getInstrItineraryData(); 40315a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng if (InstrItins.isEmpty()) 40415a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng return; 40515a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng 40615a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng if (dep.getKind() != SDep::Data) 40715a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng return; 40815a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng 40915a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng unsigned DefIdx = Use->getOperand(OpIdx).getResNo(); 41015a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng if (Def->isMachineOpcode() && Use->isMachineOpcode()) { 41115a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng const TargetInstrDesc &II = TII->get(Def->getMachineOpcode()); 41215a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng if (DefIdx >= II.getNumDefs()) 41315a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng return; 41415a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng int DefCycle = InstrItins.getOperandCycle(II.getSchedClass(), DefIdx); 41515a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng if (DefCycle < 0) 41615a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng return; 41715a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng const unsigned UseClass = TII->get(Use->getMachineOpcode()).getSchedClass(); 41815a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng int UseCycle = InstrItins.getOperandCycle(UseClass, OpIdx); 41915a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng if (UseCycle >= 0) { 42015a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng int Latency = DefCycle - UseCycle + 1; 42115a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng if (Latency >= 0) 42215a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng dep.setLatency(Latency); 42315a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng } 42415a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng } 42515a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng} 42615a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng 427343f0c046702831a4a6aec951b6a297a23241a55Dan Gohmanvoid ScheduleDAGSDNodes::dumpNode(const SUnit *SU) const { 428c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng if (!SU->getNode()) { 42984fa8229bbd3813505b7e8d6555fb2e522104e30David Greene dbgs() << "PHYS REG COPY\n"; 430c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng return; 431c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng } 432c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng 433c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng SU->getNode()->dump(DAG); 43484fa8229bbd3813505b7e8d6555fb2e522104e30David Greene dbgs() << "\n"; 435343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SmallVector<SDNode *, 4> FlaggedNodes; 436343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman for (SDNode *N = SU->getNode()->getFlaggedNode(); N; N = N->getFlaggedNode()) 437343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman FlaggedNodes.push_back(N); 438343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman while (!FlaggedNodes.empty()) { 43984fa8229bbd3813505b7e8d6555fb2e522104e30David Greene dbgs() << " "; 440343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman FlaggedNodes.back()->dump(DAG); 44184fa8229bbd3813505b7e8d6555fb2e522104e30David Greene dbgs() << "\n"; 442343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman FlaggedNodes.pop_back(); 443343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 444343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman} 445bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman 446bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Chengnamespace { 447bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng struct OrderSorter { 448bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng bool operator()(const std::pair<unsigned, MachineInstr*> &A, 449bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng const std::pair<unsigned, MachineInstr*> &B) { 450bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng return A.first < B.first; 451bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 452bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng }; 453bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng} 454bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 455bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng// ProcessSourceNode - Process nodes with source order numbers. These are added 456bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng// to a vector which EmitSchedule use to determine how to insert dbg_value 457bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng// instructions in the right order. 458bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Chengstatic void ProcessSourceNode(SDNode *N, SelectionDAG *DAG, 459bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng InstrEmitter &Emitter, 460bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng DenseMap<SDValue, unsigned> &VRBaseMap, 461bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SmallVector<std::pair<unsigned, MachineInstr*>, 32> &Orders, 462bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SmallSet<unsigned, 8> &Seen) { 463bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng unsigned Order = DAG->GetOrdering(N); 464bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (!Order || !Seen.insert(Order)) 465bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng return; 466bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 467bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng MachineBasicBlock *BB = Emitter.getBlock(); 468bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (BB->empty() || BB->back().isPHI()) { 469bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // Did not insert any instruction. 470bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng Orders.push_back(std::make_pair(Order, (MachineInstr*)0)); 471bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng return; 472bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 473bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 474bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng Orders.push_back(std::make_pair(Order, &BB->back())); 475bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (!N->getHasDebugValue()) 476bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng return; 477bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // Opportunistically insert immediate dbg_value uses, i.e. those with source 478bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // order number right after the N. 479bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng MachineBasicBlock::iterator InsertPos = Emitter.getInsertPos(); 480bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SmallVector<SDDbgValue*,2> &DVs = DAG->GetDbgValues(N); 481bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng for (unsigned i = 0, e = DVs.size(); i != e; ++i) { 482bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (DVs[i]->isInvalidated()) 483bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng continue; 484bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng unsigned DVOrder = DVs[i]->getOrder(); 485bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (DVOrder == ++Order) { 486891ff8fbd61a06ef8ea57461fa377ebbb663ed09Dan Gohman MachineInstr *DbgMI = Emitter.EmitDbgValue(DVs[i], VRBaseMap); 487962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng if (DbgMI) { 488962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng Orders.push_back(std::make_pair(DVOrder, DbgMI)); 489962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng BB->insert(InsertPos, DbgMI); 490962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng } 491bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng DVs[i]->setIsInvalidated(); 492bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 493bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 494bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng} 495bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 496bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 497bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman/// EmitSchedule - Emit the machine code in scheduled order. 498af1d8ca44a18f304f207e209b3bdb94b590f86ffDan GohmanMachineBasicBlock *ScheduleDAGSDNodes::EmitSchedule() { 499bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman InstrEmitter Emitter(BB, InsertPos); 500bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman DenseMap<SDValue, unsigned> VRBaseMap; 501bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman DenseMap<SUnit*, unsigned> CopyVRBaseMap; 502bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SmallVector<std::pair<unsigned, MachineInstr*>, 32> Orders; 503bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SmallSet<unsigned, 8> Seen; 504bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng bool HasDbg = DAG->hasDebugValues(); 505bfdf7f38523bd38ae0538861a2bfd8bdc46e5c33Dale Johannesen 506fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen // If this is the first BB, emit byval parameter dbg_value's. 507fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen if (HasDbg && BB->getParent()->begin() == MachineFunction::iterator(BB)) { 508fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen SDDbgInfo::DbgIterator PDI = DAG->ByvalParmDbgBegin(); 509fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen SDDbgInfo::DbgIterator PDE = DAG->ByvalParmDbgEnd(); 510fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen for (; PDI != PDE; ++PDI) { 511891ff8fbd61a06ef8ea57461fa377ebbb663ed09Dan Gohman MachineInstr *DbgMI= Emitter.EmitDbgValue(*PDI, VRBaseMap); 512fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen if (DbgMI) 513fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen BB->insert(BB->end(), DbgMI); 514fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen } 515fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen } 516fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen 517bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman for (unsigned i = 0, e = Sequence.size(); i != e; i++) { 518bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman SUnit *SU = Sequence[i]; 519bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman if (!SU) { 520bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman // Null SUnit* is a noop. 521bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman EmitNoop(); 522bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman continue; 523bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman } 524bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman 525bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman // For pre-regalloc scheduling, create instructions corresponding to the 526bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman // SDNode and any flagged SDNodes and append them to the block. 527bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman if (!SU->getNode()) { 528bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman // Emit a copy. 529bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman EmitPhysRegCopy(SU, CopyVRBaseMap); 530bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman continue; 531bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman } 532bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman 533bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman SmallVector<SDNode *, 4> FlaggedNodes; 534bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman for (SDNode *N = SU->getNode()->getFlaggedNode(); N; 535bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman N = N->getFlaggedNode()) 536bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman FlaggedNodes.push_back(N); 537bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman while (!FlaggedNodes.empty()) { 538bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SDNode *N = FlaggedNodes.back(); 539bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman Emitter.EmitNode(FlaggedNodes.back(), SU->OrigNode != SU, SU->isCloned, 540af1d8ca44a18f304f207e209b3bdb94b590f86ffDan Gohman VRBaseMap); 541fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen // Remember the source order of the inserted instruction. 542bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (HasDbg) 543891ff8fbd61a06ef8ea57461fa377ebbb663ed09Dan Gohman ProcessSourceNode(N, DAG, Emitter, VRBaseMap, Orders, Seen); 544bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman FlaggedNodes.pop_back(); 545bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman } 546bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman Emitter.EmitNode(SU->getNode(), SU->OrigNode != SU, SU->isCloned, 547af1d8ca44a18f304f207e209b3bdb94b590f86ffDan Gohman VRBaseMap); 548fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen // Remember the source order of the inserted instruction. 549bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (HasDbg) 550891ff8fbd61a06ef8ea57461fa377ebbb663ed09Dan Gohman ProcessSourceNode(SU->getNode(), DAG, Emitter, VRBaseMap, Orders, 551bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng Seen); 552bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 553bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 554fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen // Insert all the dbg_values which have not already been inserted in source 555bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // order sequence. 556bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (HasDbg) { 557bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng MachineBasicBlock::iterator BBBegin = BB->empty() ? BB->end() : BB->begin(); 558bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng while (BBBegin != BB->end() && BBBegin->isPHI()) 559bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng ++BBBegin; 560bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 561bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // Sort the source order instructions and use the order to insert debug 562bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // values. 563bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng std::sort(Orders.begin(), Orders.end(), OrderSorter()); 564bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 565bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SDDbgInfo::DbgIterator DI = DAG->DbgBegin(); 566bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SDDbgInfo::DbgIterator DE = DAG->DbgEnd(); 567bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // Now emit the rest according to source order. 568bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng unsigned LastOrder = 0; 569bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng MachineInstr *LastMI = 0; 570bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng for (unsigned i = 0, e = Orders.size(); i != e && DI != DE; ++i) { 571bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng unsigned Order = Orders[i].first; 572bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng MachineInstr *MI = Orders[i].second; 573bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // Insert all SDDbgValue's whose order(s) are before "Order". 574bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (!MI) 575bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng continue; 576bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng MachineBasicBlock *MIBB = MI->getParent(); 5774ec9bd9a6f92a10185870bae2cebce199f6acc5aEvan Cheng#ifndef NDEBUG 5784ec9bd9a6f92a10185870bae2cebce199f6acc5aEvan Cheng unsigned LastDIOrder = 0; 5794ec9bd9a6f92a10185870bae2cebce199f6acc5aEvan Cheng#endif 580bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng for (; DI != DE && 581bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng (*DI)->getOrder() >= LastOrder && (*DI)->getOrder() < Order; ++DI) { 5824ec9bd9a6f92a10185870bae2cebce199f6acc5aEvan Cheng#ifndef NDEBUG 5834ec9bd9a6f92a10185870bae2cebce199f6acc5aEvan Cheng assert((*DI)->getOrder() >= LastDIOrder && 5844ec9bd9a6f92a10185870bae2cebce199f6acc5aEvan Cheng "SDDbgValue nodes must be in source order!"); 5854ec9bd9a6f92a10185870bae2cebce199f6acc5aEvan Cheng LastDIOrder = (*DI)->getOrder(); 5864ec9bd9a6f92a10185870bae2cebce199f6acc5aEvan Cheng#endif 587bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if ((*DI)->isInvalidated()) 588bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng continue; 589891ff8fbd61a06ef8ea57461fa377ebbb663ed09Dan Gohman MachineInstr *DbgMI = Emitter.EmitDbgValue(*DI, VRBaseMap); 590962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng if (DbgMI) { 591962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng if (!LastOrder) 592962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng // Insert to start of the BB (after PHIs). 593962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng BB->insert(BBBegin, DbgMI); 594962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng else { 595962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng MachineBasicBlock::iterator Pos = MI; 596962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng MIBB->insert(llvm::next(Pos), DbgMI); 597962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng } 598bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 599bfdf7f38523bd38ae0538861a2bfd8bdc46e5c33Dale Johannesen } 600bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng LastOrder = Order; 601bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng LastMI = MI; 602bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 603bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // Add trailing DbgValue's before the terminator. FIXME: May want to add 604bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // some of them before one or more conditional branches? 605bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng while (DI != DE) { 606bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng MachineBasicBlock *InsertBB = Emitter.getBlock(); 607bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng MachineBasicBlock::iterator Pos= Emitter.getBlock()->getFirstTerminator(); 608bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (!(*DI)->isInvalidated()) { 609891ff8fbd61a06ef8ea57461fa377ebbb663ed09Dan Gohman MachineInstr *DbgMI= Emitter.EmitDbgValue(*DI, VRBaseMap); 610962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng if (DbgMI) 611962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng InsertBB->insert(Pos, DbgMI); 612bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 613bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng ++DI; 614bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 615bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman } 616bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman 617bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman BB = Emitter.getBlock(); 618bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman InsertPos = Emitter.getInsertPos(); 619bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman return BB; 620bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman} 621