ScheduleDAGSDNodes.cpp revision 7a2bdde0a0eebcd2125055e0eacaca040f0b766c
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" 30e0ef509aeb47b396cf1bdc170ca4f468f799719fAndrew Trick#include "llvm/Support/CommandLine.h" 31343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman#include "llvm/Support/Debug.h" 32343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman#include "llvm/Support/raw_ostream.h" 33343f0c046702831a4a6aec951b6a297a23241a55Dan Gohmanusing namespace llvm; 34343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 35c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan ChengSTATISTIC(LoadsClustered, "Number of loads clustered together"); 36c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 37e0ef509aeb47b396cf1bdc170ca4f468f799719fAndrew Trick// This allows latency based scheduler to notice high latency instructions 38e0ef509aeb47b396cf1bdc170ca4f468f799719fAndrew Trick// without a target itinerary. The choise if number here has more to do with 39e0ef509aeb47b396cf1bdc170ca4f468f799719fAndrew Trick// balancing scheduler heursitics than with the actual machine latency. 40e0ef509aeb47b396cf1bdc170ca4f468f799719fAndrew Trickstatic cl::opt<int> HighLatencyCycles( 41e0ef509aeb47b396cf1bdc170ca4f468f799719fAndrew Trick "sched-high-latency-cycles", cl::Hidden, cl::init(10), 42e0ef509aeb47b396cf1bdc170ca4f468f799719fAndrew Trick cl::desc("Roughly estimate the number of cycles that 'long latency'" 43e0ef509aeb47b396cf1bdc170ca4f468f799719fAndrew Trick "instructions take for targets with no itinerary")); 44e0ef509aeb47b396cf1bdc170ca4f468f799719fAndrew Trick 4579ce276083ced01256a0eb7d80731e4948ca6e87Dan GohmanScheduleDAGSDNodes::ScheduleDAGSDNodes(MachineFunction &mf) 463ef1c8759a20167457eb7fd82ebcaffe7ccaa1d1Evan Cheng : ScheduleDAG(mf), 473ef1c8759a20167457eb7fd82ebcaffe7ccaa1d1Evan Cheng InstrItins(mf.getTarget().getInstrItineraryData()) {} 48343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 4947ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman/// Run - perform scheduling. 5047ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman/// 5147ac0f0c7c39289f5970688154e385be22b7f293Dan Gohmanvoid ScheduleDAGSDNodes::Run(SelectionDAG *dag, MachineBasicBlock *bb, 5247ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman MachineBasicBlock::iterator insertPos) { 5347ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman DAG = dag; 5447ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman ScheduleDAG::Run(bb, insertPos); 5547ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman} 5647ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman 571cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng/// NewSUnit - Creates a new SUnit and return a ptr to it. 581cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng/// 591cc3984148be113c6e5e470f23c9ddbd37679c5fEvan ChengSUnit *ScheduleDAGSDNodes::NewSUnit(SDNode *N) { 601cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng#ifndef NDEBUG 611cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng const SUnit *Addr = 0; 621cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng if (!SUnits.empty()) 631cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng Addr = &SUnits[0]; 641cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng#endif 651cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng SUnits.push_back(SUnit(N, (unsigned)SUnits.size())); 661cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng assert((Addr == 0 || Addr == &SUnits[0]) && 671cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng "SUnits std::vector reallocated on the fly!"); 681cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng SUnits.back().OrigNode = &SUnits.back(); 691cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng SUnit *SU = &SUnits.back(); 701cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng const TargetLowering &TLI = DAG->getTargetLoweringInfo(); 71c120af45671c75fd1297ac6300c03a6a9e1264daEvan Cheng if (!N || 72c120af45671c75fd1297ac6300c03a6a9e1264daEvan Cheng (N->isMachineOpcode() && 73c120af45671c75fd1297ac6300c03a6a9e1264daEvan Cheng N->getMachineOpcode() == TargetOpcode::IMPLICIT_DEF)) 74046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng SU->SchedulingPref = Sched::None; 75046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng else 76046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng SU->SchedulingPref = TLI.getSchedulingPreference(N); 771cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng return SU; 781cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng} 791cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng 80343f0c046702831a4a6aec951b6a297a23241a55Dan GohmanSUnit *ScheduleDAGSDNodes::Clone(SUnit *Old) { 81343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SUnit *SU = NewSUnit(Old->getNode()); 82343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SU->OrigNode = Old->OrigNode; 83343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SU->Latency = Old->Latency; 8454699765064842fd08d1466adc93453660bc2a85Andrew Trick SU->isVRegCycle = Old->isVRegCycle; 858239daf7c83a65a189c352cce3191cdc3bbfe151Evan Cheng SU->isCall = Old->isCall; 86343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SU->isTwoAddress = Old->isTwoAddress; 87343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SU->isCommutable = Old->isCommutable; 88343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SU->hasPhysRegDefs = Old->hasPhysRegDefs; 893974667c1a6d48686e92f85bc4463bb239af7442Dan Gohman SU->hasPhysRegClobbers = Old->hasPhysRegClobbers; 9012f0dc6bb556976f22d89ebcf42bce273c9e7d38Andrew Trick SU->isScheduleHigh = Old->isScheduleHigh; 9112f0dc6bb556976f22d89ebcf42bce273c9e7d38Andrew Trick SU->isScheduleLow = Old->isScheduleLow; 921cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng SU->SchedulingPref = Old->SchedulingPref; 93e57187cbe321a286f6a7f409a7badd1ae4e4642cEvan Cheng Old->isCloned = true; 94343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman return SU; 95343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman} 96343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 97343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman/// CheckForPhysRegDependency - Check if the dependency between def and use of 98343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman/// a specified operand is a physical register dependency. If so, returns the 99c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng/// register and the cost of copying the register. 100343f0c046702831a4a6aec951b6a297a23241a55Dan Gohmanstatic void CheckForPhysRegDependency(SDNode *Def, SDNode *User, unsigned Op, 101cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trick const TargetRegisterInfo *TRI, 102343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman const TargetInstrInfo *TII, 103c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng unsigned &PhysReg, int &Cost) { 104343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (Op != 2 || User->getOpcode() != ISD::CopyToReg) 105343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman return; 106343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 107343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman unsigned Reg = cast<RegisterSDNode>(User->getOperand(1))->getReg(); 108343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (TargetRegisterInfo::isVirtualRegister(Reg)) 109343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman return; 110343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 111343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman unsigned ResNo = User->getOperand(2).getResNo(); 112343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (Def->isMachineOpcode()) { 113343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman const TargetInstrDesc &II = TII->get(Def->getMachineOpcode()); 114343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (ResNo >= II.getNumDefs() && 115c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng II.ImplicitDefs[ResNo - II.getNumDefs()] == Reg) { 116343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman PhysReg = Reg; 117c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng const TargetRegisterClass *RC = 118d31f972bd33de85071c716f69bf5c6d735f730f2Rafael Espindola TRI->getMinimalPhysRegClass(Reg, Def->getValueType(ResNo)); 119c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng Cost = RC->getCopyCost(); 120c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng } 121343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 122343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman} 123343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 12429d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattnerstatic void AddGlue(SDNode *N, SDValue Glue, bool AddGlue, SelectionDAG *DAG) { 125c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SmallVector<EVT, 4> VTs; 12629d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner SDNode *GlueDestNode = Glue.getNode(); 127151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling 12829d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner // Don't add glue from a node to itself. 12929d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner if (GlueDestNode == N) return; 13010707f3b442aa5a6cc55b899d630871f06b8ebbcBill Wendling 13129d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner // Don't add glue to something which already has glue. 132f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner if (N->getValueType(N->getNumValues() - 1) == MVT::Glue) return; 13310707f3b442aa5a6cc55b899d630871f06b8ebbcBill Wendling 13410707f3b442aa5a6cc55b899d630871f06b8ebbcBill Wendling for (unsigned I = 0, E = N->getNumValues(); I != E; ++I) 13510707f3b442aa5a6cc55b899d630871f06b8ebbcBill Wendling VTs.push_back(N->getValueType(I)); 136151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling 13729d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner if (AddGlue) 138f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner VTs.push_back(MVT::Glue); 139151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling 140c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SmallVector<SDValue, 4> Ops; 14110707f3b442aa5a6cc55b899d630871f06b8ebbcBill Wendling for (unsigned I = 0, E = N->getNumOperands(); I != E; ++I) 14210707f3b442aa5a6cc55b899d630871f06b8ebbcBill Wendling Ops.push_back(N->getOperand(I)); 143151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling 14429d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner if (GlueDestNode) 14529d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner Ops.push_back(Glue); 146151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling 147c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SDVTList VTList = DAG->getVTList(&VTs[0], VTs.size()); 148151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling MachineSDNode::mmo_iterator Begin = 0, End = 0; 149151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling MachineSDNode *MN = dyn_cast<MachineSDNode>(N); 150151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling 151151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling // Store memory references. 152151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling if (MN) { 153151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling Begin = MN->memoperands_begin(); 154151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling End = MN->memoperands_end(); 155151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling } 156151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling 157c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng DAG->MorphNodeTo(N, N->getOpcode(), VTList, &Ops[0], Ops.size()); 158151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling 159151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling // Reset the memory references 160151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling if (MN) 161151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling MN->setMemRefs(Begin, End); 162c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng} 163c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 16429d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner/// ClusterNeighboringLoads - Force nearby loads together by "gluing" them. 165c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng/// This function finds loads of the same base and different offsets. If the 166f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner/// offsets are not far apart (target specific), it add MVT::Glue inputs and 167c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng/// outputs to ensure they are scheduled together and in order. This 168c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng/// optimization may benefit some targets by improving cache locality. 169302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Chengvoid ScheduleDAGSDNodes::ClusterNeighboringLoads(SDNode *Node) { 170302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng SDNode *Chain = 0; 171302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng unsigned NumOps = Node->getNumOperands(); 172302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng if (Node->getOperand(NumOps-1).getValueType() == MVT::Other) 173302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng Chain = Node->getOperand(NumOps-1).getNode(); 174302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng if (!Chain) 175302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng return; 176302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng 177302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng // Look for other loads of the same chain. Find loads that are loading from 178302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng // the same base pointer and different offsets. 179c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SmallPtrSet<SDNode*, 16> Visited; 180c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SmallVector<int64_t, 4> Offsets; 181c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng DenseMap<long long, SDNode*> O2SMap; // Map from offset to SDNode. 182302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng bool Cluster = false; 183302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng SDNode *Base = Node; 184302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng for (SDNode::use_iterator I = Chain->use_begin(), E = Chain->use_end(); 185302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng I != E; ++I) { 186302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng SDNode *User = *I; 187302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng if (User == Node || !Visited.insert(User)) 188c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng continue; 189302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng int64_t Offset1, Offset2; 190302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng if (!TII->areLoadsFromSameBasePtr(Base, User, Offset1, Offset2) || 191302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng Offset1 == Offset2) 192302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng // FIXME: Should be ok if they addresses are identical. But earlier 193302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng // optimizations really should have eliminated one of the loads. 194c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng continue; 195302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng if (O2SMap.insert(std::make_pair(Offset1, Base)).second) 196302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng Offsets.push_back(Offset1); 197302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng O2SMap.insert(std::make_pair(Offset2, User)); 198302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng Offsets.push_back(Offset2); 199b447c4e65b5f6d39db16cb8fc338133965291972Duncan Sands if (Offset2 < Offset1) 200302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng Base = User; 201302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng Cluster = true; 202302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng } 203c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 204302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng if (!Cluster) 205302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng return; 206c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 207302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng // Sort them in increasing order. 208302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng std::sort(Offsets.begin(), Offsets.end()); 209c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 210302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng // Check if the loads are close enough. 211302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng SmallVector<SDNode*, 4> Loads; 212302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng unsigned NumLoads = 0; 213302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng int64_t BaseOff = Offsets[0]; 214302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng SDNode *BaseLoad = O2SMap[BaseOff]; 215302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng Loads.push_back(BaseLoad); 216302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng for (unsigned i = 1, e = Offsets.size(); i != e; ++i) { 217302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng int64_t Offset = Offsets[i]; 218302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng SDNode *Load = O2SMap[Offset]; 219302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng if (!TII->shouldScheduleLoadsNear(BaseLoad, Load, BaseOff, Offset,NumLoads)) 220302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng break; // Stop right here. Ignore loads that are further away. 221302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng Loads.push_back(Load); 222302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng ++NumLoads; 223302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng } 224c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 225302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng if (NumLoads == 0) 226302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng return; 227c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 228f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner // Cluster loads by adding MVT::Glue outputs and inputs. This also 229302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng // ensure they are scheduled in order of increasing addresses. 230302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng SDNode *Lead = Loads[0]; 23129d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner AddGlue(Lead, SDValue(0, 0), true, DAG); 23210707f3b442aa5a6cc55b899d630871f06b8ebbcBill Wendling 23329d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner SDValue InGlue = SDValue(Lead, Lead->getNumValues() - 1); 23410707f3b442aa5a6cc55b899d630871f06b8ebbcBill Wendling for (unsigned I = 1, E = Loads.size(); I != E; ++I) { 23529d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner bool OutGlue = I < E - 1; 23610707f3b442aa5a6cc55b899d630871f06b8ebbcBill Wendling SDNode *Load = Loads[I]; 237151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling 23829d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner AddGlue(Load, InGlue, OutGlue, DAG); 239151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling 24029d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner if (OutGlue) 24129d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner InGlue = SDValue(Load, Load->getNumValues() - 1); 242151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling 243302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng ++LoadsClustered; 244302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng } 245302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng} 246c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 247302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng/// ClusterNodes - Cluster certain nodes which should be scheduled together. 248302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng/// 249302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Chengvoid ScheduleDAGSDNodes::ClusterNodes() { 250302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng for (SelectionDAG::allnodes_iterator NI = DAG->allnodes_begin(), 251302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng E = DAG->allnodes_end(); NI != E; ++NI) { 252302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng SDNode *Node = &*NI; 253302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng if (!Node || !Node->isMachineOpcode()) 254c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng continue; 255c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 256302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng unsigned Opc = Node->getMachineOpcode(); 257302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng const TargetInstrDesc &TID = TII->get(Opc); 258302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng if (TID.mayLoad()) 259302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng // Cluster loads from "near" addresses into combined SUnits. 260302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng ClusterNeighboringLoads(Node); 261c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng } 262c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng} 263c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 264343f0c046702831a4a6aec951b6a297a23241a55Dan Gohmanvoid ScheduleDAGSDNodes::BuildSchedUnits() { 265343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // During scheduling, the NodeId field of SDNode is used to map SDNodes 266343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // to their associated SUnits by holding SUnits table indices. A value 267343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // of -1 means the SDNode does not yet have an associated SUnit. 268e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman unsigned NumNodes = 0; 269343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman for (SelectionDAG::allnodes_iterator NI = DAG->allnodes_begin(), 270e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman E = DAG->allnodes_end(); NI != E; ++NI) { 271343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman NI->setNodeId(-1); 272e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman ++NumNodes; 273e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman } 274343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 275e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman // Reserve entries in the vector for each of the SUnits we are creating. This 276e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman // ensure that reallocation of the vector won't happen, so SUnit*'s won't get 277e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman // invalidated. 278e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman // FIXME: Multiply by 2 because we may clone nodes during scheduling. 279e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman // This is a temporary workaround. 280e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman SUnits.reserve(NumNodes * 2); 281cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trick 282736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner // Add all nodes in depth first order. 283736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner SmallVector<SDNode*, 64> Worklist; 284736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner SmallPtrSet<SDNode*, 64> Visited; 285736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner Worklist.push_back(DAG->getRoot().getNode()); 286736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner Visited.insert(DAG->getRoot().getNode()); 287cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trick 288736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner while (!Worklist.empty()) { 289736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner SDNode *NI = Worklist.pop_back_val(); 290cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trick 291736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner // Add all operands to the worklist unless they've already been added. 292736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner for (unsigned i = 0, e = NI->getNumOperands(); i != e; ++i) 293736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner if (Visited.insert(NI->getOperand(i).getNode())) 294736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner Worklist.push_back(NI->getOperand(i).getNode()); 295cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trick 296343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (isPassiveNode(NI)) // Leaf node, e.g. a TargetImmediate. 297343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman continue; 298cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trick 299343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // If this node has already been processed, stop now. 300343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (NI->getNodeId() != -1) continue; 301cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trick 302343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SUnit *NodeSUnit = NewSUnit(NI); 303cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trick 30429d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner // See if anything is glued to this node, if so, add them to glued 30529d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner // nodes. Nodes can have at most one glue input and one glue output. Glue 30629d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner // is required to be the last operand and result of a node. 307cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trick 30829d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner // Scan up to find glued preds. 309343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SDNode *N = NI; 310db95fa131a229652f925794ca7a5b84e9490050bDan Gohman while (N->getNumOperands() && 311f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner N->getOperand(N->getNumOperands()-1).getValueType() == MVT::Glue) { 312db95fa131a229652f925794ca7a5b84e9490050bDan Gohman N = N->getOperand(N->getNumOperands()-1).getNode(); 313db95fa131a229652f925794ca7a5b84e9490050bDan Gohman assert(N->getNodeId() == -1 && "Node already inserted!"); 314db95fa131a229652f925794ca7a5b84e9490050bDan Gohman N->setNodeId(NodeSUnit->NodeNum); 3158239daf7c83a65a189c352cce3191cdc3bbfe151Evan Cheng if (N->isMachineOpcode() && TII->get(N->getMachineOpcode()).isCall()) 3168239daf7c83a65a189c352cce3191cdc3bbfe151Evan Cheng NodeSUnit->isCall = true; 317343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 318cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trick 31929d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner // Scan down to find any glued succs. 320343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman N = NI; 321f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner while (N->getValueType(N->getNumValues()-1) == MVT::Glue) { 32229d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner SDValue GlueVal(N, N->getNumValues()-1); 323cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trick 32429d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner // There are either zero or one users of the Glue result. 32529d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner bool HasGlueUse = false; 326cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trick for (SDNode::use_iterator UI = N->use_begin(), E = N->use_end(); 327343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman UI != E; ++UI) 32829d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner if (GlueVal.isOperandOf(*UI)) { 32929d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner HasGlueUse = true; 330343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman assert(N->getNodeId() == -1 && "Node already inserted!"); 331343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman N->setNodeId(NodeSUnit->NodeNum); 332343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman N = *UI; 3338239daf7c83a65a189c352cce3191cdc3bbfe151Evan Cheng if (N->isMachineOpcode() && TII->get(N->getMachineOpcode()).isCall()) 3348239daf7c83a65a189c352cce3191cdc3bbfe151Evan Cheng NodeSUnit->isCall = true; 335343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman break; 336343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 33729d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner if (!HasGlueUse) break; 338343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 339cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trick 34012f0dc6bb556976f22d89ebcf42bce273c9e7d38Andrew Trick // Schedule zero-latency TokenFactor below any nodes that may increase the 34112f0dc6bb556976f22d89ebcf42bce273c9e7d38Andrew Trick // schedule height. Otherwise, ancestors of the TokenFactor may appear to 34212f0dc6bb556976f22d89ebcf42bce273c9e7d38Andrew Trick // have false stalls. 34312f0dc6bb556976f22d89ebcf42bce273c9e7d38Andrew Trick if (NI->getOpcode() == ISD::TokenFactor) 34412f0dc6bb556976f22d89ebcf42bce273c9e7d38Andrew Trick NodeSUnit->isScheduleLow = true; 34512f0dc6bb556976f22d89ebcf42bce273c9e7d38Andrew Trick 34629d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner // If there are glue operands involved, N is now the bottom-most node 34729d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner // of the sequence of nodes that are glued together. 348343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // Update the SUnit. 349343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman NodeSUnit->setNode(N); 350343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman assert(N->getNodeId() == -1 && "Node already inserted!"); 351343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman N->setNodeId(NodeSUnit->NodeNum); 352343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 35392e946630d5f9bb092853b93501387dd216899b9Andrew Trick // Compute NumRegDefsLeft. This must be done before AddSchedEdges. 35492e946630d5f9bb092853b93501387dd216899b9Andrew Trick InitNumRegDefsLeft(NodeSUnit); 35592e946630d5f9bb092853b93501387dd216899b9Andrew Trick 356787782f4ca0cca2523825131c24a6f78535a3eb8Dan Gohman // Assign the Latency field of NodeSUnit using target-provided information. 357e163168aab987dc3df0845b9e92310f764d8b158Evan Cheng ComputeLatency(NodeSUnit); 358343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 359c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman} 360c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman 361c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohmanvoid ScheduleDAGSDNodes::AddSchedEdges() { 362710461688bba935f0ad5c75da7fec2ad0f225c00David Goodwin const TargetSubtarget &ST = TM.getSubtarget<TargetSubtarget>(); 363710461688bba935f0ad5c75da7fec2ad0f225c00David Goodwin 364dc4bdcdef1c8dd1a28b82deb08df039e5c0ffc5aDavid Goodwin // Check to see if the scheduler cares about latencies. 365dc4bdcdef1c8dd1a28b82deb08df039e5c0ffc5aDavid Goodwin bool UnitLatencies = ForceUnitLatencies(); 366dc4bdcdef1c8dd1a28b82deb08df039e5c0ffc5aDavid Goodwin 367343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // Pass 2: add the preds, succs, etc. 368343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman for (unsigned su = 0, e = SUnits.size(); su != e; ++su) { 369343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SUnit *SU = &SUnits[su]; 370343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SDNode *MainNode = SU->getNode(); 371cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trick 372343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (MainNode->isMachineOpcode()) { 373343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman unsigned Opc = MainNode->getMachineOpcode(); 374343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman const TargetInstrDesc &TID = TII->get(Opc); 375343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman for (unsigned i = 0; i != TID.getNumOperands(); ++i) { 376343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (TID.getOperandConstraint(i, TOI::TIED_TO) != -1) { 377343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SU->isTwoAddress = true; 378343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman break; 379343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 380343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 381343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (TID.isCommutable()) 382343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SU->isCommutable = true; 383343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 384cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trick 385343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // Find all predecessors and successors of the group. 38629d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner for (SDNode *N = SU->getNode(); N; N = N->getGluedNode()) { 387343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (N->isMachineOpcode() && 3883974667c1a6d48686e92f85bc4463bb239af7442Dan Gohman TII->get(N->getMachineOpcode()).getImplicitDefs()) { 3893974667c1a6d48686e92f85bc4463bb239af7442Dan Gohman SU->hasPhysRegClobbers = true; 390bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman unsigned NumUsed = InstrEmitter::CountResults(N); 3918cccf0ef0ced7f4d75ca574b596036a9b6cd4315Dan Gohman while (NumUsed != 0 && !N->hasAnyUseOfValue(NumUsed - 1)) 3928cccf0ef0ced7f4d75ca574b596036a9b6cd4315Dan Gohman --NumUsed; // Skip over unused values at the end. 3938cccf0ef0ced7f4d75ca574b596036a9b6cd4315Dan Gohman if (NumUsed > TII->get(N->getMachineOpcode()).getNumDefs()) 3943974667c1a6d48686e92f85bc4463bb239af7442Dan Gohman SU->hasPhysRegDefs = true; 3953974667c1a6d48686e92f85bc4463bb239af7442Dan Gohman } 396cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trick 397343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) { 398343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SDNode *OpN = N->getOperand(i).getNode(); 399343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (isPassiveNode(OpN)) continue; // Not scheduled. 400343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SUnit *OpSU = &SUnits[OpN->getNodeId()]; 401343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman assert(OpSU && "Node has no SUnit!"); 402343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (OpSU == SU) continue; // In the same group. 403343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 404e50ed30282bb5b4a9ed952580523f2dda16215acOwen Anderson EVT OpVT = N->getOperand(i).getValueType(); 40529d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner assert(OpVT != MVT::Glue && "Glued nodes should be in same sunit!"); 406825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson bool isChain = OpVT == MVT::Other; 407343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 408343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman unsigned PhysReg = 0; 409c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng int Cost = 1; 410343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // Determine if this is a physical register dependency. 411c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng CheckForPhysRegDependency(OpN, N, i, TRI, TII, PhysReg, Cost); 41254e4c36a7349e94a84773afb56eccd4ca65b49e9Dan Gohman assert((PhysReg == 0 || !isChain) && 41354e4c36a7349e94a84773afb56eccd4ca65b49e9Dan Gohman "Chain dependence via physreg data?"); 414c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng // FIXME: See ScheduleDAGSDNodes::EmitCopyFromReg. For now, scheduler 415c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng // emits a copy from the physical register to a virtual register unless 416c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng // it requires a cross class copy (cost < 0). That means we are only 417c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng // treating "expensive to copy" register dependency as physical register 418c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng // dependency. This may change in the future though. 419c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng if (Cost >= 0) 420c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng PhysReg = 0; 421710461688bba935f0ad5c75da7fec2ad0f225c00David Goodwin 422046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng // If this is a ctrl dep, latency is 1. 423c558bf397257f5ef902bdb45a28e622ee2b5b4f2Andrew Trick unsigned OpLatency = isChain ? 1 : OpSU->Latency; 42487896d9368e08d93493427ce7bf8272d1e5cca35Andrew Trick // Special-case TokenFactor chains as zero-latency. 42587896d9368e08d93493427ce7bf8272d1e5cca35Andrew Trick if(isChain && OpN->getOpcode() == ISD::TokenFactor) 42687896d9368e08d93493427ce7bf8272d1e5cca35Andrew Trick OpLatency = 0; 42787896d9368e08d93493427ce7bf8272d1e5cca35Andrew Trick 428046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng const SDep &dep = SDep(OpSU, isChain ? SDep::Order : SDep::Data, 429046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng OpLatency, PhysReg); 430dc4bdcdef1c8dd1a28b82deb08df039e5c0ffc5aDavid Goodwin if (!isChain && !UnitLatencies) { 43115a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng ComputeOperandLatency(OpN, N, i, const_cast<SDep &>(dep)); 4323fb150a9024a38872ec4abbc3300e08a8bfc1812Dan Gohman ST.adjustSchedDependency(OpSU, SU, const_cast<SDep &>(dep)); 433dc4bdcdef1c8dd1a28b82deb08df039e5c0ffc5aDavid Goodwin } 434710461688bba935f0ad5c75da7fec2ad0f225c00David Goodwin 4354bbf4678e341e9bf899c0faa3e3bcfe134db81ebAndrew Trick if (!SU->addPred(dep) && !dep.isCtrl() && OpSU->NumRegDefsLeft > 1) { 43692e946630d5f9bb092853b93501387dd216899b9Andrew Trick // Multiple register uses are combined in the same SUnit. For example, 43792e946630d5f9bb092853b93501387dd216899b9Andrew Trick // we could have a set of glued nodes with all their defs consumed by 43892e946630d5f9bb092853b93501387dd216899b9Andrew Trick // another set of glued nodes. Register pressure tracking sees this as 43992e946630d5f9bb092853b93501387dd216899b9Andrew Trick // a single use, so to keep pressure balanced we reduce the defs. 4404bbf4678e341e9bf899c0faa3e3bcfe134db81ebAndrew Trick // 4414bbf4678e341e9bf899c0faa3e3bcfe134db81ebAndrew Trick // We can't tell (without more book-keeping) if this results from 4424bbf4678e341e9bf899c0faa3e3bcfe134db81ebAndrew Trick // glued nodes or duplicate operands. As long as we don't reduce 4434bbf4678e341e9bf899c0faa3e3bcfe134db81ebAndrew Trick // NumRegDefsLeft to zero, we handle the common cases well. 44492e946630d5f9bb092853b93501387dd216899b9Andrew Trick --OpSU->NumRegDefsLeft; 44592e946630d5f9bb092853b93501387dd216899b9Andrew Trick } 446343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 447343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 448343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 449343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman} 450343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 451c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman/// BuildSchedGraph - Build the SUnit graph from the selection dag that we 452c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman/// are input. This SUnit graph is similar to the SelectionDAG, but 453c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman/// excludes nodes that aren't interesting to scheduling, and represents 45429d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner/// glued together nodes with a single SUnit. 45598976e4dcd18adbbe676048c0069e67346eb4adeDan Gohmanvoid ScheduleDAGSDNodes::BuildSchedGraph(AliasAnalysis *AA) { 456302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng // Cluster certain nodes which should be scheduled together. 457302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng ClusterNodes(); 458c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman // Populate the SUnits array. 459c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman BuildSchedUnits(); 460c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman // Compute all the scheduling dependencies between nodes. 461c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman AddSchedEdges(); 462c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman} 463c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman 46492e946630d5f9bb092853b93501387dd216899b9Andrew Trick// Initialize NumNodeDefs for the current Node's opcode. 46592e946630d5f9bb092853b93501387dd216899b9Andrew Trickvoid ScheduleDAGSDNodes::RegDefIter::InitNodeNumDefs() { 46629449448b0f0420dfcf52e278fc01adbf1690d70Eric Christopher // Check for phys reg copy. 46729449448b0f0420dfcf52e278fc01adbf1690d70Eric Christopher if (!Node) 46829449448b0f0420dfcf52e278fc01adbf1690d70Eric Christopher return; 46929449448b0f0420dfcf52e278fc01adbf1690d70Eric Christopher 47092e946630d5f9bb092853b93501387dd216899b9Andrew Trick if (!Node->isMachineOpcode()) { 47192e946630d5f9bb092853b93501387dd216899b9Andrew Trick if (Node->getOpcode() == ISD::CopyFromReg) 47292e946630d5f9bb092853b93501387dd216899b9Andrew Trick NodeNumDefs = 1; 47392e946630d5f9bb092853b93501387dd216899b9Andrew Trick else 47492e946630d5f9bb092853b93501387dd216899b9Andrew Trick NodeNumDefs = 0; 47592e946630d5f9bb092853b93501387dd216899b9Andrew Trick return; 47692e946630d5f9bb092853b93501387dd216899b9Andrew Trick } 47792e946630d5f9bb092853b93501387dd216899b9Andrew Trick unsigned POpc = Node->getMachineOpcode(); 47892e946630d5f9bb092853b93501387dd216899b9Andrew Trick if (POpc == TargetOpcode::IMPLICIT_DEF) { 47992e946630d5f9bb092853b93501387dd216899b9Andrew Trick // No register need be allocated for this. 48092e946630d5f9bb092853b93501387dd216899b9Andrew Trick NodeNumDefs = 0; 48192e946630d5f9bb092853b93501387dd216899b9Andrew Trick return; 48292e946630d5f9bb092853b93501387dd216899b9Andrew Trick } 48392e946630d5f9bb092853b93501387dd216899b9Andrew Trick unsigned NRegDefs = SchedDAG->TII->get(Node->getMachineOpcode()).getNumDefs(); 48492e946630d5f9bb092853b93501387dd216899b9Andrew Trick // Some instructions define regs that are not represented in the selection DAG 48592e946630d5f9bb092853b93501387dd216899b9Andrew Trick // (e.g. unused flags). See tMOVi8. Make sure we don't access past NumValues. 48692e946630d5f9bb092853b93501387dd216899b9Andrew Trick NodeNumDefs = std::min(Node->getNumValues(), NRegDefs); 48792e946630d5f9bb092853b93501387dd216899b9Andrew Trick DefIdx = 0; 48892e946630d5f9bb092853b93501387dd216899b9Andrew Trick} 48992e946630d5f9bb092853b93501387dd216899b9Andrew Trick 49092e946630d5f9bb092853b93501387dd216899b9Andrew Trick// Construct a RegDefIter for this SUnit and find the first valid value. 49192e946630d5f9bb092853b93501387dd216899b9Andrew TrickScheduleDAGSDNodes::RegDefIter::RegDefIter(const SUnit *SU, 49292e946630d5f9bb092853b93501387dd216899b9Andrew Trick const ScheduleDAGSDNodes *SD) 49392e946630d5f9bb092853b93501387dd216899b9Andrew Trick : SchedDAG(SD), Node(SU->getNode()), DefIdx(0), NodeNumDefs(0) { 49492e946630d5f9bb092853b93501387dd216899b9Andrew Trick InitNodeNumDefs(); 49592e946630d5f9bb092853b93501387dd216899b9Andrew Trick Advance(); 49692e946630d5f9bb092853b93501387dd216899b9Andrew Trick} 49792e946630d5f9bb092853b93501387dd216899b9Andrew Trick 49892e946630d5f9bb092853b93501387dd216899b9Andrew Trick// Advance to the next valid value defined by the SUnit. 49992e946630d5f9bb092853b93501387dd216899b9Andrew Trickvoid ScheduleDAGSDNodes::RegDefIter::Advance() { 50092e946630d5f9bb092853b93501387dd216899b9Andrew Trick for (;Node;) { // Visit all glued nodes. 50192e946630d5f9bb092853b93501387dd216899b9Andrew Trick for (;DefIdx < NodeNumDefs; ++DefIdx) { 50292e946630d5f9bb092853b93501387dd216899b9Andrew Trick if (!Node->hasAnyUseOfValue(DefIdx)) 50392e946630d5f9bb092853b93501387dd216899b9Andrew Trick continue; 50492e946630d5f9bb092853b93501387dd216899b9Andrew Trick if (Node->isMachineOpcode() && 50592e946630d5f9bb092853b93501387dd216899b9Andrew Trick Node->getMachineOpcode() == TargetOpcode::EXTRACT_SUBREG) { 50692e946630d5f9bb092853b93501387dd216899b9Andrew Trick // Propagate the incoming (full-register) type. I doubt it's needed. 50792e946630d5f9bb092853b93501387dd216899b9Andrew Trick ValueType = Node->getOperand(0).getValueType(); 50892e946630d5f9bb092853b93501387dd216899b9Andrew Trick } 50992e946630d5f9bb092853b93501387dd216899b9Andrew Trick else { 51092e946630d5f9bb092853b93501387dd216899b9Andrew Trick ValueType = Node->getValueType(DefIdx); 51192e946630d5f9bb092853b93501387dd216899b9Andrew Trick } 51292e946630d5f9bb092853b93501387dd216899b9Andrew Trick ++DefIdx; 51392e946630d5f9bb092853b93501387dd216899b9Andrew Trick return; // Found a normal regdef. 51492e946630d5f9bb092853b93501387dd216899b9Andrew Trick } 51592e946630d5f9bb092853b93501387dd216899b9Andrew Trick Node = Node->getGluedNode(); 51692e946630d5f9bb092853b93501387dd216899b9Andrew Trick if (Node == NULL) { 51792e946630d5f9bb092853b93501387dd216899b9Andrew Trick return; // No values left to visit. 51892e946630d5f9bb092853b93501387dd216899b9Andrew Trick } 51992e946630d5f9bb092853b93501387dd216899b9Andrew Trick InitNodeNumDefs(); 52092e946630d5f9bb092853b93501387dd216899b9Andrew Trick } 52192e946630d5f9bb092853b93501387dd216899b9Andrew Trick} 52292e946630d5f9bb092853b93501387dd216899b9Andrew Trick 52392e946630d5f9bb092853b93501387dd216899b9Andrew Trickvoid ScheduleDAGSDNodes::InitNumRegDefsLeft(SUnit *SU) { 52492e946630d5f9bb092853b93501387dd216899b9Andrew Trick assert(SU->NumRegDefsLeft == 0 && "expect a new node"); 52592e946630d5f9bb092853b93501387dd216899b9Andrew Trick for (RegDefIter I(SU, this); I.IsValid(); I.Advance()) { 52692e946630d5f9bb092853b93501387dd216899b9Andrew Trick assert(SU->NumRegDefsLeft < USHRT_MAX && "overflow is ok but unexpected"); 52792e946630d5f9bb092853b93501387dd216899b9Andrew Trick ++SU->NumRegDefsLeft; 52892e946630d5f9bb092853b93501387dd216899b9Andrew Trick } 52992e946630d5f9bb092853b93501387dd216899b9Andrew Trick} 53092e946630d5f9bb092853b93501387dd216899b9Andrew Trick 531343f0c046702831a4a6aec951b6a297a23241a55Dan Gohmanvoid ScheduleDAGSDNodes::ComputeLatency(SUnit *SU) { 53287896d9368e08d93493427ce7bf8272d1e5cca35Andrew Trick SDNode *N = SU->getNode(); 53387896d9368e08d93493427ce7bf8272d1e5cca35Andrew Trick 53487896d9368e08d93493427ce7bf8272d1e5cca35Andrew Trick // TokenFactor operands are considered zero latency, and some schedulers 53587896d9368e08d93493427ce7bf8272d1e5cca35Andrew Trick // (e.g. Top-Down list) may rely on the fact that operand latency is nonzero 53687896d9368e08d93493427ce7bf8272d1e5cca35Andrew Trick // whenever node latency is nonzero. 53787896d9368e08d93493427ce7bf8272d1e5cca35Andrew Trick if (N && N->getOpcode() == ISD::TokenFactor) { 53887896d9368e08d93493427ce7bf8272d1e5cca35Andrew Trick SU->Latency = 0; 53987896d9368e08d93493427ce7bf8272d1e5cca35Andrew Trick return; 54087896d9368e08d93493427ce7bf8272d1e5cca35Andrew Trick } 54187896d9368e08d93493427ce7bf8272d1e5cca35Andrew Trick 542e163168aab987dc3df0845b9e92310f764d8b158Evan Cheng // Check to see if the scheduler cares about latencies. 543e163168aab987dc3df0845b9e92310f764d8b158Evan Cheng if (ForceUnitLatencies()) { 544e163168aab987dc3df0845b9e92310f764d8b158Evan Cheng SU->Latency = 1; 545e163168aab987dc3df0845b9e92310f764d8b158Evan Cheng return; 546e163168aab987dc3df0845b9e92310f764d8b158Evan Cheng } 547e163168aab987dc3df0845b9e92310f764d8b158Evan Cheng 5483ef1c8759a20167457eb7fd82ebcaffe7ccaa1d1Evan Cheng if (!InstrItins || InstrItins->isEmpty()) { 5495e84e3ccaa555bd48ecca384e93e55abd76fb40aAndrew Trick if (N && N->isMachineOpcode() && 5505e84e3ccaa555bd48ecca384e93e55abd76fb40aAndrew Trick TII->isHighLatencyDef(N->getMachineOpcode())) 551e0ef509aeb47b396cf1bdc170ca4f468f799719fAndrew Trick SU->Latency = HighLatencyCycles; 552e0ef509aeb47b396cf1bdc170ca4f468f799719fAndrew Trick else 553e0ef509aeb47b396cf1bdc170ca4f468f799719fAndrew Trick SU->Latency = 1; 55415a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng return; 55515a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng } 556cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trick 557343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // Compute the latency for the node. We use the sum of the latencies for 55829d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner // all nodes glued together into this SUnit. 559343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SU->Latency = 0; 56029d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner for (SDNode *N = SU->getNode(); N; N = N->getGluedNode()) 5618239daf7c83a65a189c352cce3191cdc3bbfe151Evan Cheng if (N->isMachineOpcode()) 5628239daf7c83a65a189c352cce3191cdc3bbfe151Evan Cheng SU->Latency += TII->getInstrLatency(InstrItins, N); 563343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman} 564343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 56515a16def6e70c8f7df1023da80ceb89887203b40Evan Chengvoid ScheduleDAGSDNodes::ComputeOperandLatency(SDNode *Def, SDNode *Use, 56615a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng unsigned OpIdx, SDep& dep) const{ 56715a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng // Check to see if the scheduler cares about latencies. 56815a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng if (ForceUnitLatencies()) 56915a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng return; 57015a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng 57115a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng if (dep.getKind() != SDep::Data) 57215a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng return; 57315a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng 57415a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng unsigned DefIdx = Use->getOperand(OpIdx).getResNo(); 5757e2fe9150f905167f6685c9730911c2abc08293cEvan Cheng if (Use->isMachineOpcode()) 5767e2fe9150f905167f6685c9730911c2abc08293cEvan Cheng // Adjust the use operand index by num of defs. 5777e2fe9150f905167f6685c9730911c2abc08293cEvan Cheng OpIdx += TII->get(Use->getMachineOpcode()).getNumDefs(); 578a0792de66c8364d47b0a688c7f408efb7b10f31bEvan Cheng int Latency = TII->getOperandLatency(InstrItins, Def, DefIdx, Use, OpIdx); 579089751535d6e9adf65842e2ca5867bf9a70e1e95Evan Cheng if (Latency > 1 && Use->getOpcode() == ISD::CopyToReg && 580089751535d6e9adf65842e2ca5867bf9a70e1e95Evan Cheng !BB->succ_empty()) { 581089751535d6e9adf65842e2ca5867bf9a70e1e95Evan Cheng unsigned Reg = cast<RegisterSDNode>(Use->getOperand(1))->getReg(); 582089751535d6e9adf65842e2ca5867bf9a70e1e95Evan Cheng if (TargetRegisterInfo::isVirtualRegister(Reg)) 583089751535d6e9adf65842e2ca5867bf9a70e1e95Evan Cheng // This copy is a liveout value. It is likely coalesced, so reduce the 584089751535d6e9adf65842e2ca5867bf9a70e1e95Evan Cheng // latency so not to penalize the def. 585089751535d6e9adf65842e2ca5867bf9a70e1e95Evan Cheng // FIXME: need target specific adjustment here? 586089751535d6e9adf65842e2ca5867bf9a70e1e95Evan Cheng Latency = (Latency > 1) ? Latency - 1 : 1; 587089751535d6e9adf65842e2ca5867bf9a70e1e95Evan Cheng } 5883881cb7a5d54c0011b40997adcd742e1c7b91abdEvan Cheng if (Latency >= 0) 5893881cb7a5d54c0011b40997adcd742e1c7b91abdEvan Cheng dep.setLatency(Latency); 59015a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng} 59115a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng 592343f0c046702831a4a6aec951b6a297a23241a55Dan Gohmanvoid ScheduleDAGSDNodes::dumpNode(const SUnit *SU) const { 593c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng if (!SU->getNode()) { 59484fa8229bbd3813505b7e8d6555fb2e522104e30David Greene dbgs() << "PHYS REG COPY\n"; 595c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng return; 596c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng } 597c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng 598c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng SU->getNode()->dump(DAG); 59984fa8229bbd3813505b7e8d6555fb2e522104e30David Greene dbgs() << "\n"; 60029d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner SmallVector<SDNode *, 4> GluedNodes; 60129d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner for (SDNode *N = SU->getNode()->getGluedNode(); N; N = N->getGluedNode()) 60229d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner GluedNodes.push_back(N); 60329d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner while (!GluedNodes.empty()) { 60484fa8229bbd3813505b7e8d6555fb2e522104e30David Greene dbgs() << " "; 60529d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner GluedNodes.back()->dump(DAG); 60684fa8229bbd3813505b7e8d6555fb2e522104e30David Greene dbgs() << "\n"; 60729d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner GluedNodes.pop_back(); 608343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 609343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman} 610bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman 611bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Chengnamespace { 612bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng struct OrderSorter { 613bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng bool operator()(const std::pair<unsigned, MachineInstr*> &A, 614bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng const std::pair<unsigned, MachineInstr*> &B) { 615bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng return A.first < B.first; 616bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 617bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng }; 618bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng} 619bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 6207a2bdde0a0eebcd2125055e0eacaca040f0b766cChris Lattner/// ProcessSDDbgValues - Process SDDbgValues associated with this node. 621cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trickstatic void ProcessSDDbgValues(SDNode *N, SelectionDAG *DAG, 62255d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel InstrEmitter &Emitter, 62355d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel SmallVector<std::pair<unsigned, MachineInstr*>, 32> &Orders, 62455d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel DenseMap<SDValue, unsigned> &VRBaseMap, 62555d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel unsigned Order) { 62655d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel if (!N->getHasDebugValue()) 62755d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel return; 62855d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel 62955d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel // Opportunistically insert immediate dbg_value uses, i.e. those with source 63055d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel // order number right after the N. 63155d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel MachineBasicBlock *BB = Emitter.getBlock(); 63255d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel MachineBasicBlock::iterator InsertPos = Emitter.getInsertPos(); 63355d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel SmallVector<SDDbgValue*,2> &DVs = DAG->GetDbgValues(N); 63455d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel for (unsigned i = 0, e = DVs.size(); i != e; ++i) { 63555d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel if (DVs[i]->isInvalidated()) 63655d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel continue; 63755d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel unsigned DVOrder = DVs[i]->getOrder(); 63855d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel if (!Order || DVOrder == ++Order) { 63955d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel MachineInstr *DbgMI = Emitter.EmitDbgValue(DVs[i], VRBaseMap); 64055d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel if (DbgMI) { 64155d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel Orders.push_back(std::make_pair(DVOrder, DbgMI)); 64255d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel BB->insert(InsertPos, DbgMI); 64355d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel } 64455d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel DVs[i]->setIsInvalidated(); 64555d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel } 64655d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel } 64755d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel} 64855d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel 649bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng// ProcessSourceNode - Process nodes with source order numbers. These are added 650d27946d1d4272d7e2bbee00fac020dc8147dfd25Jim Grosbach// to a vector which EmitSchedule uses to determine how to insert dbg_value 651bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng// instructions in the right order. 652bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Chengstatic void ProcessSourceNode(SDNode *N, SelectionDAG *DAG, 653bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng InstrEmitter &Emitter, 654bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng DenseMap<SDValue, unsigned> &VRBaseMap, 655bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SmallVector<std::pair<unsigned, MachineInstr*>, 32> &Orders, 656bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SmallSet<unsigned, 8> &Seen) { 657bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng unsigned Order = DAG->GetOrdering(N); 65839078a8bde256ee22e981713a4d2ff8235dc7706Devang Patel if (!Order || !Seen.insert(Order)) { 65939078a8bde256ee22e981713a4d2ff8235dc7706Devang Patel // Process any valid SDDbgValues even if node does not have any order 66039078a8bde256ee22e981713a4d2ff8235dc7706Devang Patel // assigned. 66139078a8bde256ee22e981713a4d2ff8235dc7706Devang Patel ProcessSDDbgValues(N, DAG, Emitter, Orders, VRBaseMap, 0); 662bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng return; 66339078a8bde256ee22e981713a4d2ff8235dc7706Devang Patel } 664bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 665bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng MachineBasicBlock *BB = Emitter.getBlock(); 66684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman if (Emitter.getInsertPos() == BB->begin() || BB->back().isPHI()) { 667bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // Did not insert any instruction. 668bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng Orders.push_back(std::make_pair(Order, (MachineInstr*)0)); 669bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng return; 670bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 671bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 67284023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman Orders.push_back(std::make_pair(Order, prior(Emitter.getInsertPos()))); 67355d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel ProcessSDDbgValues(N, DAG, Emitter, Orders, VRBaseMap, Order); 674bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng} 675bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 676bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 677bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman/// EmitSchedule - Emit the machine code in scheduled order. 678af1d8ca44a18f304f207e209b3bdb94b590f86ffDan GohmanMachineBasicBlock *ScheduleDAGSDNodes::EmitSchedule() { 679bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman InstrEmitter Emitter(BB, InsertPos); 680bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman DenseMap<SDValue, unsigned> VRBaseMap; 681bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman DenseMap<SUnit*, unsigned> CopyVRBaseMap; 682bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SmallVector<std::pair<unsigned, MachineInstr*>, 32> Orders; 683bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SmallSet<unsigned, 8> Seen; 684bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng bool HasDbg = DAG->hasDebugValues(); 685bfdf7f38523bd38ae0538861a2bfd8bdc46e5c33Dale Johannesen 686fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen // If this is the first BB, emit byval parameter dbg_value's. 687fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen if (HasDbg && BB->getParent()->begin() == MachineFunction::iterator(BB)) { 688fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen SDDbgInfo::DbgIterator PDI = DAG->ByvalParmDbgBegin(); 689fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen SDDbgInfo::DbgIterator PDE = DAG->ByvalParmDbgEnd(); 690fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen for (; PDI != PDE; ++PDI) { 691891ff8fbd61a06ef8ea57461fa377ebbb663ed09Dan Gohman MachineInstr *DbgMI= Emitter.EmitDbgValue(*PDI, VRBaseMap); 692fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen if (DbgMI) 69384023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman BB->insert(InsertPos, DbgMI); 694fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen } 695fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen } 696fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen 697bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman for (unsigned i = 0, e = Sequence.size(); i != e; i++) { 698bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman SUnit *SU = Sequence[i]; 699bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman if (!SU) { 700bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman // Null SUnit* is a noop. 701bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman EmitNoop(); 702bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman continue; 703bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman } 704bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman 705bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman // For pre-regalloc scheduling, create instructions corresponding to the 70629d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner // SDNode and any glued SDNodes and append them to the block. 707bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman if (!SU->getNode()) { 708bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman // Emit a copy. 709bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman EmitPhysRegCopy(SU, CopyVRBaseMap); 710bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman continue; 711bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman } 712bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman 71329d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner SmallVector<SDNode *, 4> GluedNodes; 71429d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner for (SDNode *N = SU->getNode()->getGluedNode(); N; 71529d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner N = N->getGluedNode()) 71629d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner GluedNodes.push_back(N); 71729d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner while (!GluedNodes.empty()) { 71829d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner SDNode *N = GluedNodes.back(); 71929d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner Emitter.EmitNode(GluedNodes.back(), SU->OrigNode != SU, SU->isCloned, 720af1d8ca44a18f304f207e209b3bdb94b590f86ffDan Gohman VRBaseMap); 721fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen // Remember the source order of the inserted instruction. 722bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (HasDbg) 723891ff8fbd61a06ef8ea57461fa377ebbb663ed09Dan Gohman ProcessSourceNode(N, DAG, Emitter, VRBaseMap, Orders, Seen); 72429d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner GluedNodes.pop_back(); 725bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman } 726bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman Emitter.EmitNode(SU->getNode(), SU->OrigNode != SU, SU->isCloned, 727af1d8ca44a18f304f207e209b3bdb94b590f86ffDan Gohman VRBaseMap); 728fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen // Remember the source order of the inserted instruction. 729bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (HasDbg) 730891ff8fbd61a06ef8ea57461fa377ebbb663ed09Dan Gohman ProcessSourceNode(SU->getNode(), DAG, Emitter, VRBaseMap, Orders, 731bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng Seen); 732bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 733bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 734fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen // Insert all the dbg_values which have not already been inserted in source 735bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // order sequence. 736bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (HasDbg) { 73784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman MachineBasicBlock::iterator BBBegin = BB->getFirstNonPHI(); 738bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 739bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // Sort the source order instructions and use the order to insert debug 740bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // values. 741bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng std::sort(Orders.begin(), Orders.end(), OrderSorter()); 742bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 743bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SDDbgInfo::DbgIterator DI = DAG->DbgBegin(); 744bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SDDbgInfo::DbgIterator DE = DAG->DbgEnd(); 745bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // Now emit the rest according to source order. 746bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng unsigned LastOrder = 0; 747bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng for (unsigned i = 0, e = Orders.size(); i != e && DI != DE; ++i) { 748bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng unsigned Order = Orders[i].first; 749bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng MachineInstr *MI = Orders[i].second; 750bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // Insert all SDDbgValue's whose order(s) are before "Order". 751bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (!MI) 752bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng continue; 753bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng for (; DI != DE && 754bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng (*DI)->getOrder() >= LastOrder && (*DI)->getOrder() < Order; ++DI) { 755bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if ((*DI)->isInvalidated()) 756bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng continue; 757891ff8fbd61a06ef8ea57461fa377ebbb663ed09Dan Gohman MachineInstr *DbgMI = Emitter.EmitDbgValue(*DI, VRBaseMap); 758962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng if (DbgMI) { 759962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng if (!LastOrder) 760962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng // Insert to start of the BB (after PHIs). 761962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng BB->insert(BBBegin, DbgMI); 762962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng else { 763a8dab36f3dfdfcd3f74224afa4ffb32776674c93Dan Gohman // Insert at the instruction, which may be in a different 764a8dab36f3dfdfcd3f74224afa4ffb32776674c93Dan Gohman // block, if the block was split by a custom inserter. 765962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng MachineBasicBlock::iterator Pos = MI; 766a8dab36f3dfdfcd3f74224afa4ffb32776674c93Dan Gohman MI->getParent()->insert(llvm::next(Pos), DbgMI); 767962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng } 768bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 769bfdf7f38523bd38ae0538861a2bfd8bdc46e5c33Dale Johannesen } 770bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng LastOrder = Order; 771bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 772bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // Add trailing DbgValue's before the terminator. FIXME: May want to add 773bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // some of them before one or more conditional branches? 774bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng while (DI != DE) { 775bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng MachineBasicBlock *InsertBB = Emitter.getBlock(); 776bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng MachineBasicBlock::iterator Pos= Emitter.getBlock()->getFirstTerminator(); 777bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (!(*DI)->isInvalidated()) { 778891ff8fbd61a06ef8ea57461fa377ebbb663ed09Dan Gohman MachineInstr *DbgMI= Emitter.EmitDbgValue(*DI, VRBaseMap); 779962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng if (DbgMI) 780962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng InsertBB->insert(Pos, DbgMI); 781bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 782bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng ++DI; 783bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 784bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman } 785bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman 786bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman BB = Emitter.getBlock(); 787bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman InsertPos = Emitter.getInsertPos(); 788bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman return BB; 789bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman} 790