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" 2084b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick#include "llvm/CodeGen/MachineInstrBuilder.h" 2184b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick#include "llvm/CodeGen/MachineRegisterInfo.h" 22ab8be96fd30ca9396e6b84fdddf1ac6208984cadEvan Cheng#include "llvm/MC/MCInstrItineraries.h" 23343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman#include "llvm/Target/TargetMachine.h" 24343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman#include "llvm/Target/TargetInstrInfo.h" 251cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng#include "llvm/Target/TargetLowering.h" 26343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman#include "llvm/Target/TargetRegisterInfo.h" 275b1b4489cf3a0f56f8be0673fc5cc380a32d277bEvan Cheng#include "llvm/Target/TargetSubtargetInfo.h" 28c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng#include "llvm/ADT/DenseMap.h" 29c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng#include "llvm/ADT/SmallPtrSet.h" 30bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng#include "llvm/ADT/SmallSet.h" 31c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng#include "llvm/ADT/SmallVector.h" 32c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng#include "llvm/ADT/Statistic.h" 33e0ef509aeb47b396cf1bdc170ca4f468f799719fAndrew Trick#include "llvm/Support/CommandLine.h" 34343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman#include "llvm/Support/Debug.h" 35343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman#include "llvm/Support/raw_ostream.h" 36343f0c046702831a4a6aec951b6a297a23241a55Dan Gohmanusing namespace llvm; 37343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 38c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan ChengSTATISTIC(LoadsClustered, "Number of loads clustered together"); 39c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 40e0ef509aeb47b396cf1bdc170ca4f468f799719fAndrew Trick// This allows latency based scheduler to notice high latency instructions 41e0ef509aeb47b396cf1bdc170ca4f468f799719fAndrew Trick// without a target itinerary. The choise if number here has more to do with 42e0ef509aeb47b396cf1bdc170ca4f468f799719fAndrew Trick// balancing scheduler heursitics than with the actual machine latency. 43e0ef509aeb47b396cf1bdc170ca4f468f799719fAndrew Trickstatic cl::opt<int> HighLatencyCycles( 44e0ef509aeb47b396cf1bdc170ca4f468f799719fAndrew Trick "sched-high-latency-cycles", cl::Hidden, cl::init(10), 45e0ef509aeb47b396cf1bdc170ca4f468f799719fAndrew Trick cl::desc("Roughly estimate the number of cycles that 'long latency'" 46e0ef509aeb47b396cf1bdc170ca4f468f799719fAndrew Trick "instructions take for targets with no itinerary")); 47e0ef509aeb47b396cf1bdc170ca4f468f799719fAndrew Trick 4879ce276083ced01256a0eb7d80731e4948ca6e87Dan GohmanScheduleDAGSDNodes::ScheduleDAGSDNodes(MachineFunction &mf) 4947c144505b9be28ed22c626b3a407c11dba2fec5Andrew Trick : ScheduleDAG(mf), BB(0), DAG(0), 503ef1c8759a20167457eb7fd82ebcaffe7ccaa1d1Evan Cheng InstrItins(mf.getTarget().getInstrItineraryData()) {} 51343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 5247ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman/// Run - perform scheduling. 5347ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman/// 5447c144505b9be28ed22c626b3a407c11dba2fec5Andrew Trickvoid ScheduleDAGSDNodes::Run(SelectionDAG *dag, MachineBasicBlock *bb) { 5547c144505b9be28ed22c626b3a407c11dba2fec5Andrew Trick BB = bb; 5647ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman DAG = dag; 5747c144505b9be28ed22c626b3a407c11dba2fec5Andrew Trick 5847c144505b9be28ed22c626b3a407c11dba2fec5Andrew Trick // Clear the scheduler's SUnit DAG. 5947c144505b9be28ed22c626b3a407c11dba2fec5Andrew Trick ScheduleDAG::clearDAG(); 6047c144505b9be28ed22c626b3a407c11dba2fec5Andrew Trick Sequence.clear(); 6147c144505b9be28ed22c626b3a407c11dba2fec5Andrew Trick 6247c144505b9be28ed22c626b3a407c11dba2fec5Andrew Trick // Invoke the target's selection of scheduler. 6347c144505b9be28ed22c626b3a407c11dba2fec5Andrew Trick Schedule(); 6447ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman} 6547ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman 661cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng/// NewSUnit - Creates a new SUnit and return a ptr to it. 671cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng/// 68953be893e8cffa0ef9bf410036cd96aeb526e98aAndrew TrickSUnit *ScheduleDAGSDNodes::newSUnit(SDNode *N) { 691cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng#ifndef NDEBUG 701cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng const SUnit *Addr = 0; 711cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng if (!SUnits.empty()) 721cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng Addr = &SUnits[0]; 731cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng#endif 741cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng SUnits.push_back(SUnit(N, (unsigned)SUnits.size())); 751cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng assert((Addr == 0 || Addr == &SUnits[0]) && 761cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng "SUnits std::vector reallocated on the fly!"); 771cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng SUnits.back().OrigNode = &SUnits.back(); 781cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng SUnit *SU = &SUnits.back(); 791cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng const TargetLowering &TLI = DAG->getTargetLoweringInfo(); 80c120af45671c75fd1297ac6300c03a6a9e1264daEvan Cheng if (!N || 81c120af45671c75fd1297ac6300c03a6a9e1264daEvan Cheng (N->isMachineOpcode() && 82c120af45671c75fd1297ac6300c03a6a9e1264daEvan Cheng N->getMachineOpcode() == TargetOpcode::IMPLICIT_DEF)) 83046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng SU->SchedulingPref = Sched::None; 84046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng else 85046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng SU->SchedulingPref = TLI.getSchedulingPreference(N); 861cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng return SU; 871cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng} 881cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng 89343f0c046702831a4a6aec951b6a297a23241a55Dan GohmanSUnit *ScheduleDAGSDNodes::Clone(SUnit *Old) { 90953be893e8cffa0ef9bf410036cd96aeb526e98aAndrew Trick SUnit *SU = newSUnit(Old->getNode()); 91343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SU->OrigNode = Old->OrigNode; 92343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SU->Latency = Old->Latency; 9354699765064842fd08d1466adc93453660bc2a85Andrew Trick SU->isVRegCycle = Old->isVRegCycle; 948239daf7c83a65a189c352cce3191cdc3bbfe151Evan Cheng SU->isCall = Old->isCall; 95554daa67bd1c4f01fb7a00f2f4255a52b81e9fa3Evan Cheng SU->isCallOp = Old->isCallOp; 96343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SU->isTwoAddress = Old->isTwoAddress; 97343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SU->isCommutable = Old->isCommutable; 98343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SU->hasPhysRegDefs = Old->hasPhysRegDefs; 993974667c1a6d48686e92f85bc4463bb239af7442Dan Gohman SU->hasPhysRegClobbers = Old->hasPhysRegClobbers; 10012f0dc6bb556976f22d89ebcf42bce273c9e7d38Andrew Trick SU->isScheduleHigh = Old->isScheduleHigh; 10112f0dc6bb556976f22d89ebcf42bce273c9e7d38Andrew Trick SU->isScheduleLow = Old->isScheduleLow; 1021cc3984148be113c6e5e470f23c9ddbd37679c5fEvan Cheng SU->SchedulingPref = Old->SchedulingPref; 103e57187cbe321a286f6a7f409a7badd1ae4e4642cEvan Cheng Old->isCloned = true; 104343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman return SU; 105343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman} 106343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 107343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman/// CheckForPhysRegDependency - Check if the dependency between def and use of 108343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman/// a specified operand is a physical register dependency. If so, returns the 109c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng/// register and the cost of copying the register. 110343f0c046702831a4a6aec951b6a297a23241a55Dan Gohmanstatic void CheckForPhysRegDependency(SDNode *Def, SDNode *User, unsigned Op, 111cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trick const TargetRegisterInfo *TRI, 112343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman const TargetInstrInfo *TII, 113c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng unsigned &PhysReg, int &Cost) { 114343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (Op != 2 || User->getOpcode() != ISD::CopyToReg) 115343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman return; 116343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 117343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman unsigned Reg = cast<RegisterSDNode>(User->getOperand(1))->getReg(); 118343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (TargetRegisterInfo::isVirtualRegister(Reg)) 119343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman return; 120343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 121343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman unsigned ResNo = User->getOperand(2).getResNo(); 122343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (Def->isMachineOpcode()) { 123e837dead3c8dc3445ef6a0e2322179c57e264a13Evan Cheng const MCInstrDesc &II = TII->get(Def->getMachineOpcode()); 124343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (ResNo >= II.getNumDefs() && 125c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng II.ImplicitDefs[ResNo - II.getNumDefs()] == Reg) { 126343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman PhysReg = Reg; 127c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng const TargetRegisterClass *RC = 128d31f972bd33de85071c716f69bf5c6d735f730f2Rafael Espindola TRI->getMinimalPhysRegClass(Reg, Def->getValueType(ResNo)); 129c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng Cost = RC->getCopyCost(); 130c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng } 131343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 132343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman} 133343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 13429d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattnerstatic void AddGlue(SDNode *N, SDValue Glue, bool AddGlue, SelectionDAG *DAG) { 135c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SmallVector<EVT, 4> VTs; 13629d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner SDNode *GlueDestNode = Glue.getNode(); 137151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling 13829d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner // Don't add glue from a node to itself. 13929d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner if (GlueDestNode == N) return; 14010707f3b442aa5a6cc55b899d630871f06b8ebbcBill Wendling 14129d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner // Don't add glue to something which already has glue. 142f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner if (N->getValueType(N->getNumValues() - 1) == MVT::Glue) return; 14310707f3b442aa5a6cc55b899d630871f06b8ebbcBill Wendling 14410707f3b442aa5a6cc55b899d630871f06b8ebbcBill Wendling for (unsigned I = 0, E = N->getNumValues(); I != E; ++I) 14510707f3b442aa5a6cc55b899d630871f06b8ebbcBill Wendling VTs.push_back(N->getValueType(I)); 146151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling 14729d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner if (AddGlue) 148f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner VTs.push_back(MVT::Glue); 149151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling 150c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SmallVector<SDValue, 4> Ops; 15110707f3b442aa5a6cc55b899d630871f06b8ebbcBill Wendling for (unsigned I = 0, E = N->getNumOperands(); I != E; ++I) 15210707f3b442aa5a6cc55b899d630871f06b8ebbcBill Wendling Ops.push_back(N->getOperand(I)); 153151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling 15429d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner if (GlueDestNode) 15529d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner Ops.push_back(Glue); 156151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling 157c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SDVTList VTList = DAG->getVTList(&VTs[0], VTs.size()); 158151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling MachineSDNode::mmo_iterator Begin = 0, End = 0; 159151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling MachineSDNode *MN = dyn_cast<MachineSDNode>(N); 160151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling 161151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling // Store memory references. 162151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling if (MN) { 163151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling Begin = MN->memoperands_begin(); 164151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling End = MN->memoperands_end(); 165151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling } 166151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling 167c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng DAG->MorphNodeTo(N, N->getOpcode(), VTList, &Ops[0], Ops.size()); 168151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling 169151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling // Reset the memory references 170151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling if (MN) 171151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling MN->setMemRefs(Begin, End); 172c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng} 173c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 17429d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner/// ClusterNeighboringLoads - Force nearby loads together by "gluing" them. 175c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng/// This function finds loads of the same base and different offsets. If the 176f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner/// offsets are not far apart (target specific), it add MVT::Glue inputs and 177c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng/// outputs to ensure they are scheduled together and in order. This 178c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng/// optimization may benefit some targets by improving cache locality. 179302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Chengvoid ScheduleDAGSDNodes::ClusterNeighboringLoads(SDNode *Node) { 180302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng SDNode *Chain = 0; 181302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng unsigned NumOps = Node->getNumOperands(); 182302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng if (Node->getOperand(NumOps-1).getValueType() == MVT::Other) 183302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng Chain = Node->getOperand(NumOps-1).getNode(); 184302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng if (!Chain) 185302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng return; 186302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng 187302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng // Look for other loads of the same chain. Find loads that are loading from 188302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng // the same base pointer and different offsets. 189c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SmallPtrSet<SDNode*, 16> Visited; 190c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng SmallVector<int64_t, 4> Offsets; 191c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng DenseMap<long long, SDNode*> O2SMap; // Map from offset to SDNode. 192302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng bool Cluster = false; 193302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng SDNode *Base = Node; 194302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng for (SDNode::use_iterator I = Chain->use_begin(), E = Chain->use_end(); 195302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng I != E; ++I) { 196302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng SDNode *User = *I; 197302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng if (User == Node || !Visited.insert(User)) 198c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng continue; 199302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng int64_t Offset1, Offset2; 200302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng if (!TII->areLoadsFromSameBasePtr(Base, User, Offset1, Offset2) || 201302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng Offset1 == Offset2) 202302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng // FIXME: Should be ok if they addresses are identical. But earlier 203302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng // optimizations really should have eliminated one of the loads. 204c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng continue; 205302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng if (O2SMap.insert(std::make_pair(Offset1, Base)).second) 206302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng Offsets.push_back(Offset1); 207302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng O2SMap.insert(std::make_pair(Offset2, User)); 208302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng Offsets.push_back(Offset2); 209b447c4e65b5f6d39db16cb8fc338133965291972Duncan Sands if (Offset2 < Offset1) 210302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng Base = User; 211302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng Cluster = true; 212302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng } 213c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 214302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng if (!Cluster) 215302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng return; 216c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 217302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng // Sort them in increasing order. 218302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng std::sort(Offsets.begin(), Offsets.end()); 219c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 220302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng // Check if the loads are close enough. 221302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng SmallVector<SDNode*, 4> Loads; 222302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng unsigned NumLoads = 0; 223302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng int64_t BaseOff = Offsets[0]; 224302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng SDNode *BaseLoad = O2SMap[BaseOff]; 225302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng Loads.push_back(BaseLoad); 226302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng for (unsigned i = 1, e = Offsets.size(); i != e; ++i) { 227302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng int64_t Offset = Offsets[i]; 228302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng SDNode *Load = O2SMap[Offset]; 229302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng if (!TII->shouldScheduleLoadsNear(BaseLoad, Load, BaseOff, Offset,NumLoads)) 230302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng break; // Stop right here. Ignore loads that are further away. 231302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng Loads.push_back(Load); 232302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng ++NumLoads; 233302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng } 234c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 235302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng if (NumLoads == 0) 236302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng return; 237c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 238f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner // Cluster loads by adding MVT::Glue outputs and inputs. This also 239302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng // ensure they are scheduled in order of increasing addresses. 240302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng SDNode *Lead = Loads[0]; 24129d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner AddGlue(Lead, SDValue(0, 0), true, DAG); 24210707f3b442aa5a6cc55b899d630871f06b8ebbcBill Wendling 24329d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner SDValue InGlue = SDValue(Lead, Lead->getNumValues() - 1); 24410707f3b442aa5a6cc55b899d630871f06b8ebbcBill Wendling for (unsigned I = 1, E = Loads.size(); I != E; ++I) { 24529d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner bool OutGlue = I < E - 1; 24610707f3b442aa5a6cc55b899d630871f06b8ebbcBill Wendling SDNode *Load = Loads[I]; 247151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling 24829d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner AddGlue(Load, InGlue, OutGlue, DAG); 249151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling 25029d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner if (OutGlue) 25129d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner InGlue = SDValue(Load, Load->getNumValues() - 1); 252151d26d15dc6fe89329d7cccb0638c324c58f485Bill Wendling 253302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng ++LoadsClustered; 254302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng } 255302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng} 256c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 257302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng/// ClusterNodes - Cluster certain nodes which should be scheduled together. 258302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng/// 259302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Chengvoid ScheduleDAGSDNodes::ClusterNodes() { 260302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng for (SelectionDAG::allnodes_iterator NI = DAG->allnodes_begin(), 261302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng E = DAG->allnodes_end(); NI != E; ++NI) { 262302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng SDNode *Node = &*NI; 263302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng if (!Node || !Node->isMachineOpcode()) 264c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng continue; 265c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 266302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng unsigned Opc = Node->getMachineOpcode(); 267e837dead3c8dc3445ef6a0e2322179c57e264a13Evan Cheng const MCInstrDesc &MCID = TII->get(Opc); 268e837dead3c8dc3445ef6a0e2322179c57e264a13Evan Cheng if (MCID.mayLoad()) 269302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng // Cluster loads from "near" addresses into combined SUnits. 270302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng ClusterNeighboringLoads(Node); 271c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng } 272c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng} 273c589e03865bb31da70e0037d5c32fdaaa5f79f24Evan Cheng 274343f0c046702831a4a6aec951b6a297a23241a55Dan Gohmanvoid ScheduleDAGSDNodes::BuildSchedUnits() { 275343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // During scheduling, the NodeId field of SDNode is used to map SDNodes 276343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // to their associated SUnits by holding SUnits table indices. A value 277343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // of -1 means the SDNode does not yet have an associated SUnit. 278e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman unsigned NumNodes = 0; 279343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman for (SelectionDAG::allnodes_iterator NI = DAG->allnodes_begin(), 280e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman E = DAG->allnodes_end(); NI != E; ++NI) { 281343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman NI->setNodeId(-1); 282e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman ++NumNodes; 283e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman } 284343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 285e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman // Reserve entries in the vector for each of the SUnits we are creating. This 286e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman // ensure that reallocation of the vector won't happen, so SUnit*'s won't get 287e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman // invalidated. 288e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman // FIXME: Multiply by 2 because we may clone nodes during scheduling. 289e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman // This is a temporary workaround. 290e1dfc7da8991270db5094aa736fde273bfab6061Dan Gohman SUnits.reserve(NumNodes * 2); 291cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trick 292736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner // Add all nodes in depth first order. 293736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner SmallVector<SDNode*, 64> Worklist; 294736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner SmallPtrSet<SDNode*, 64> Visited; 295736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner Worklist.push_back(DAG->getRoot().getNode()); 296736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner Visited.insert(DAG->getRoot().getNode()); 297cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trick 298554daa67bd1c4f01fb7a00f2f4255a52b81e9fa3Evan Cheng SmallVector<SUnit*, 8> CallSUnits; 299736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner while (!Worklist.empty()) { 300736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner SDNode *NI = Worklist.pop_back_val(); 301cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trick 302736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner // Add all operands to the worklist unless they've already been added. 303736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner for (unsigned i = 0, e = NI->getNumOperands(); i != e; ++i) 304736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner if (Visited.insert(NI->getOperand(i).getNode())) 305736a6ea3a2a5322db0e09d97651a1acc07502e41Chris Lattner Worklist.push_back(NI->getOperand(i).getNode()); 306cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trick 307343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (isPassiveNode(NI)) // Leaf node, e.g. a TargetImmediate. 308343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman continue; 309cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trick 310343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // If this node has already been processed, stop now. 311343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (NI->getNodeId() != -1) continue; 312cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trick 313953be893e8cffa0ef9bf410036cd96aeb526e98aAndrew Trick SUnit *NodeSUnit = newSUnit(NI); 314cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trick 31529d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner // See if anything is glued to this node, if so, add them to glued 31629d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner // nodes. Nodes can have at most one glue input and one glue output. Glue 31729d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner // is required to be the last operand and result of a node. 318cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trick 31929d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner // Scan up to find glued preds. 320343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SDNode *N = NI; 321db95fa131a229652f925794ca7a5b84e9490050bDan Gohman while (N->getNumOperands() && 322f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner N->getOperand(N->getNumOperands()-1).getValueType() == MVT::Glue) { 323db95fa131a229652f925794ca7a5b84e9490050bDan Gohman N = N->getOperand(N->getNumOperands()-1).getNode(); 324db95fa131a229652f925794ca7a5b84e9490050bDan Gohman assert(N->getNodeId() == -1 && "Node already inserted!"); 325db95fa131a229652f925794ca7a5b84e9490050bDan Gohman N->setNodeId(NodeSUnit->NodeNum); 3268239daf7c83a65a189c352cce3191cdc3bbfe151Evan Cheng if (N->isMachineOpcode() && TII->get(N->getMachineOpcode()).isCall()) 3278239daf7c83a65a189c352cce3191cdc3bbfe151Evan Cheng NodeSUnit->isCall = true; 328343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 329cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trick 33029d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner // Scan down to find any glued succs. 331343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman N = NI; 332f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner while (N->getValueType(N->getNumValues()-1) == MVT::Glue) { 33329d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner SDValue GlueVal(N, N->getNumValues()-1); 334cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trick 33529d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner // There are either zero or one users of the Glue result. 33629d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner bool HasGlueUse = false; 337cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trick for (SDNode::use_iterator UI = N->use_begin(), E = N->use_end(); 338343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman UI != E; ++UI) 33929d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner if (GlueVal.isOperandOf(*UI)) { 34029d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner HasGlueUse = true; 341343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman assert(N->getNodeId() == -1 && "Node already inserted!"); 342343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman N->setNodeId(NodeSUnit->NodeNum); 343343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman N = *UI; 3448239daf7c83a65a189c352cce3191cdc3bbfe151Evan Cheng if (N->isMachineOpcode() && TII->get(N->getMachineOpcode()).isCall()) 3458239daf7c83a65a189c352cce3191cdc3bbfe151Evan Cheng NodeSUnit->isCall = true; 346343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman break; 347343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 34829d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner if (!HasGlueUse) break; 349343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 350cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trick 351554daa67bd1c4f01fb7a00f2f4255a52b81e9fa3Evan Cheng if (NodeSUnit->isCall) 352554daa67bd1c4f01fb7a00f2f4255a52b81e9fa3Evan Cheng CallSUnits.push_back(NodeSUnit); 353554daa67bd1c4f01fb7a00f2f4255a52b81e9fa3Evan Cheng 35412f0dc6bb556976f22d89ebcf42bce273c9e7d38Andrew Trick // Schedule zero-latency TokenFactor below any nodes that may increase the 35512f0dc6bb556976f22d89ebcf42bce273c9e7d38Andrew Trick // schedule height. Otherwise, ancestors of the TokenFactor may appear to 35612f0dc6bb556976f22d89ebcf42bce273c9e7d38Andrew Trick // have false stalls. 35712f0dc6bb556976f22d89ebcf42bce273c9e7d38Andrew Trick if (NI->getOpcode() == ISD::TokenFactor) 35812f0dc6bb556976f22d89ebcf42bce273c9e7d38Andrew Trick NodeSUnit->isScheduleLow = true; 35912f0dc6bb556976f22d89ebcf42bce273c9e7d38Andrew Trick 36029d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner // If there are glue operands involved, N is now the bottom-most node 36129d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner // of the sequence of nodes that are glued together. 362343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // Update the SUnit. 363343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman NodeSUnit->setNode(N); 364343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman assert(N->getNodeId() == -1 && "Node already inserted!"); 365343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman N->setNodeId(NodeSUnit->NodeNum); 366343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 36792e946630d5f9bb092853b93501387dd216899b9Andrew Trick // Compute NumRegDefsLeft. This must be done before AddSchedEdges. 36892e946630d5f9bb092853b93501387dd216899b9Andrew Trick InitNumRegDefsLeft(NodeSUnit); 36992e946630d5f9bb092853b93501387dd216899b9Andrew Trick 370787782f4ca0cca2523825131c24a6f78535a3eb8Dan Gohman // Assign the Latency field of NodeSUnit using target-provided information. 371953be893e8cffa0ef9bf410036cd96aeb526e98aAndrew Trick computeLatency(NodeSUnit); 372343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 373554daa67bd1c4f01fb7a00f2f4255a52b81e9fa3Evan Cheng 374554daa67bd1c4f01fb7a00f2f4255a52b81e9fa3Evan Cheng // Find all call operands. 375554daa67bd1c4f01fb7a00f2f4255a52b81e9fa3Evan Cheng while (!CallSUnits.empty()) { 376554daa67bd1c4f01fb7a00f2f4255a52b81e9fa3Evan Cheng SUnit *SU = CallSUnits.pop_back_val(); 377554daa67bd1c4f01fb7a00f2f4255a52b81e9fa3Evan Cheng for (const SDNode *SUNode = SU->getNode(); SUNode; 378554daa67bd1c4f01fb7a00f2f4255a52b81e9fa3Evan Cheng SUNode = SUNode->getGluedNode()) { 379554daa67bd1c4f01fb7a00f2f4255a52b81e9fa3Evan Cheng if (SUNode->getOpcode() != ISD::CopyToReg) 380554daa67bd1c4f01fb7a00f2f4255a52b81e9fa3Evan Cheng continue; 381554daa67bd1c4f01fb7a00f2f4255a52b81e9fa3Evan Cheng SDNode *SrcN = SUNode->getOperand(2).getNode(); 382554daa67bd1c4f01fb7a00f2f4255a52b81e9fa3Evan Cheng if (isPassiveNode(SrcN)) continue; // Not scheduled. 383554daa67bd1c4f01fb7a00f2f4255a52b81e9fa3Evan Cheng SUnit *SrcSU = &SUnits[SrcN->getNodeId()]; 384554daa67bd1c4f01fb7a00f2f4255a52b81e9fa3Evan Cheng SrcSU->isCallOp = true; 385554daa67bd1c4f01fb7a00f2f4255a52b81e9fa3Evan Cheng } 386554daa67bd1c4f01fb7a00f2f4255a52b81e9fa3Evan Cheng } 387c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman} 388c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman 389c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohmanvoid ScheduleDAGSDNodes::AddSchedEdges() { 3905b1b4489cf3a0f56f8be0673fc5cc380a32d277bEvan Cheng const TargetSubtargetInfo &ST = TM.getSubtarget<TargetSubtargetInfo>(); 391710461688bba935f0ad5c75da7fec2ad0f225c00David Goodwin 392dc4bdcdef1c8dd1a28b82deb08df039e5c0ffc5aDavid Goodwin // Check to see if the scheduler cares about latencies. 393953be893e8cffa0ef9bf410036cd96aeb526e98aAndrew Trick bool UnitLatencies = forceUnitLatencies(); 394dc4bdcdef1c8dd1a28b82deb08df039e5c0ffc5aDavid Goodwin 395343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // Pass 2: add the preds, succs, etc. 396343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman for (unsigned su = 0, e = SUnits.size(); su != e; ++su) { 397343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SUnit *SU = &SUnits[su]; 398343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SDNode *MainNode = SU->getNode(); 399cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trick 400343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (MainNode->isMachineOpcode()) { 401343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman unsigned Opc = MainNode->getMachineOpcode(); 402e837dead3c8dc3445ef6a0e2322179c57e264a13Evan Cheng const MCInstrDesc &MCID = TII->get(Opc); 403e837dead3c8dc3445ef6a0e2322179c57e264a13Evan Cheng for (unsigned i = 0; i != MCID.getNumOperands(); ++i) { 404e837dead3c8dc3445ef6a0e2322179c57e264a13Evan Cheng if (MCID.getOperandConstraint(i, MCOI::TIED_TO) != -1) { 405343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SU->isTwoAddress = true; 406343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman break; 407343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 408343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 409e837dead3c8dc3445ef6a0e2322179c57e264a13Evan Cheng if (MCID.isCommutable()) 410343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SU->isCommutable = true; 411343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 412cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trick 413343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // Find all predecessors and successors of the group. 41429d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner for (SDNode *N = SU->getNode(); N; N = N->getGluedNode()) { 415343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (N->isMachineOpcode() && 4163974667c1a6d48686e92f85bc4463bb239af7442Dan Gohman TII->get(N->getMachineOpcode()).getImplicitDefs()) { 4173974667c1a6d48686e92f85bc4463bb239af7442Dan Gohman SU->hasPhysRegClobbers = true; 418bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman unsigned NumUsed = InstrEmitter::CountResults(N); 4198cccf0ef0ced7f4d75ca574b596036a9b6cd4315Dan Gohman while (NumUsed != 0 && !N->hasAnyUseOfValue(NumUsed - 1)) 4208cccf0ef0ced7f4d75ca574b596036a9b6cd4315Dan Gohman --NumUsed; // Skip over unused values at the end. 4218cccf0ef0ced7f4d75ca574b596036a9b6cd4315Dan Gohman if (NumUsed > TII->get(N->getMachineOpcode()).getNumDefs()) 4223974667c1a6d48686e92f85bc4463bb239af7442Dan Gohman SU->hasPhysRegDefs = true; 4233974667c1a6d48686e92f85bc4463bb239af7442Dan Gohman } 424cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trick 425343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) { 426343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SDNode *OpN = N->getOperand(i).getNode(); 427343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (isPassiveNode(OpN)) continue; // Not scheduled. 428343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SUnit *OpSU = &SUnits[OpN->getNodeId()]; 429343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman assert(OpSU && "Node has no SUnit!"); 430343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman if (OpSU == SU) continue; // In the same group. 431343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 432e50ed30282bb5b4a9ed952580523f2dda16215acOwen Anderson EVT OpVT = N->getOperand(i).getValueType(); 43329d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner assert(OpVT != MVT::Glue && "Glued nodes should be in same sunit!"); 434825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson bool isChain = OpVT == MVT::Other; 435343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 436343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman unsigned PhysReg = 0; 437c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng int Cost = 1; 438343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // Determine if this is a physical register dependency. 439c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng CheckForPhysRegDependency(OpN, N, i, TRI, TII, PhysReg, Cost); 44054e4c36a7349e94a84773afb56eccd4ca65b49e9Dan Gohman assert((PhysReg == 0 || !isChain) && 44154e4c36a7349e94a84773afb56eccd4ca65b49e9Dan Gohman "Chain dependence via physreg data?"); 442c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng // FIXME: See ScheduleDAGSDNodes::EmitCopyFromReg. For now, scheduler 443c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng // emits a copy from the physical register to a virtual register unless 444c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng // it requires a cross class copy (cost < 0). That means we are only 445c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng // treating "expensive to copy" register dependency as physical register 446c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng // dependency. This may change in the future though. 4474cb971ce1c8b254f29365c988b55f6dcfe86d21eAndrew Trick if (Cost >= 0 && !StressSched) 448c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng PhysReg = 0; 449710461688bba935f0ad5c75da7fec2ad0f225c00David Goodwin 450046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng // If this is a ctrl dep, latency is 1. 451c558bf397257f5ef902bdb45a28e622ee2b5b4f2Andrew Trick unsigned OpLatency = isChain ? 1 : OpSU->Latency; 45287896d9368e08d93493427ce7bf8272d1e5cca35Andrew Trick // Special-case TokenFactor chains as zero-latency. 45387896d9368e08d93493427ce7bf8272d1e5cca35Andrew Trick if(isChain && OpN->getOpcode() == ISD::TokenFactor) 45487896d9368e08d93493427ce7bf8272d1e5cca35Andrew Trick OpLatency = 0; 45587896d9368e08d93493427ce7bf8272d1e5cca35Andrew Trick 456046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng const SDep &dep = SDep(OpSU, isChain ? SDep::Order : SDep::Data, 457046fa3f90a31ebfa10df89ae348f478d492709a9Evan Cheng OpLatency, PhysReg); 458dc4bdcdef1c8dd1a28b82deb08df039e5c0ffc5aDavid Goodwin if (!isChain && !UnitLatencies) { 459953be893e8cffa0ef9bf410036cd96aeb526e98aAndrew Trick computeOperandLatency(OpN, N, i, const_cast<SDep &>(dep)); 4603fb150a9024a38872ec4abbc3300e08a8bfc1812Dan Gohman ST.adjustSchedDependency(OpSU, SU, const_cast<SDep &>(dep)); 461dc4bdcdef1c8dd1a28b82deb08df039e5c0ffc5aDavid Goodwin } 462710461688bba935f0ad5c75da7fec2ad0f225c00David Goodwin 4634bbf4678e341e9bf899c0faa3e3bcfe134db81ebAndrew Trick if (!SU->addPred(dep) && !dep.isCtrl() && OpSU->NumRegDefsLeft > 1) { 46492e946630d5f9bb092853b93501387dd216899b9Andrew Trick // Multiple register uses are combined in the same SUnit. For example, 46592e946630d5f9bb092853b93501387dd216899b9Andrew Trick // we could have a set of glued nodes with all their defs consumed by 46692e946630d5f9bb092853b93501387dd216899b9Andrew Trick // another set of glued nodes. Register pressure tracking sees this as 46792e946630d5f9bb092853b93501387dd216899b9Andrew Trick // a single use, so to keep pressure balanced we reduce the defs. 4684bbf4678e341e9bf899c0faa3e3bcfe134db81ebAndrew Trick // 4694bbf4678e341e9bf899c0faa3e3bcfe134db81ebAndrew Trick // We can't tell (without more book-keeping) if this results from 4704bbf4678e341e9bf899c0faa3e3bcfe134db81ebAndrew Trick // glued nodes or duplicate operands. As long as we don't reduce 4714bbf4678e341e9bf899c0faa3e3bcfe134db81ebAndrew Trick // NumRegDefsLeft to zero, we handle the common cases well. 47292e946630d5f9bb092853b93501387dd216899b9Andrew Trick --OpSU->NumRegDefsLeft; 47392e946630d5f9bb092853b93501387dd216899b9Andrew Trick } 474343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 475343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 476343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 477343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman} 478343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 479c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman/// BuildSchedGraph - Build the SUnit graph from the selection dag that we 480c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman/// are input. This SUnit graph is similar to the SelectionDAG, but 481c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman/// excludes nodes that aren't interesting to scheduling, and represents 48229d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner/// glued together nodes with a single SUnit. 48398976e4dcd18adbbe676048c0069e67346eb4adeDan Gohmanvoid ScheduleDAGSDNodes::BuildSchedGraph(AliasAnalysis *AA) { 484302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng // Cluster certain nodes which should be scheduled together. 485302ef834e0a2fd03e4b435079a9fa6c1e1cdc23bEvan Cheng ClusterNodes(); 486c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman // Populate the SUnits array. 487c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman BuildSchedUnits(); 488c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman // Compute all the scheduling dependencies between nodes. 489c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman AddSchedEdges(); 490c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman} 491c9a5b9e38b442c2ae6b115213a07df3fcd14708dDan Gohman 49292e946630d5f9bb092853b93501387dd216899b9Andrew Trick// Initialize NumNodeDefs for the current Node's opcode. 49392e946630d5f9bb092853b93501387dd216899b9Andrew Trickvoid ScheduleDAGSDNodes::RegDefIter::InitNodeNumDefs() { 49429449448b0f0420dfcf52e278fc01adbf1690d70Eric Christopher // Check for phys reg copy. 49529449448b0f0420dfcf52e278fc01adbf1690d70Eric Christopher if (!Node) 49629449448b0f0420dfcf52e278fc01adbf1690d70Eric Christopher return; 49729449448b0f0420dfcf52e278fc01adbf1690d70Eric Christopher 49892e946630d5f9bb092853b93501387dd216899b9Andrew Trick if (!Node->isMachineOpcode()) { 49992e946630d5f9bb092853b93501387dd216899b9Andrew Trick if (Node->getOpcode() == ISD::CopyFromReg) 50092e946630d5f9bb092853b93501387dd216899b9Andrew Trick NodeNumDefs = 1; 50192e946630d5f9bb092853b93501387dd216899b9Andrew Trick else 50292e946630d5f9bb092853b93501387dd216899b9Andrew Trick NodeNumDefs = 0; 50392e946630d5f9bb092853b93501387dd216899b9Andrew Trick return; 50492e946630d5f9bb092853b93501387dd216899b9Andrew Trick } 50592e946630d5f9bb092853b93501387dd216899b9Andrew Trick unsigned POpc = Node->getMachineOpcode(); 50692e946630d5f9bb092853b93501387dd216899b9Andrew Trick if (POpc == TargetOpcode::IMPLICIT_DEF) { 50792e946630d5f9bb092853b93501387dd216899b9Andrew Trick // No register need be allocated for this. 50892e946630d5f9bb092853b93501387dd216899b9Andrew Trick NodeNumDefs = 0; 50992e946630d5f9bb092853b93501387dd216899b9Andrew Trick return; 51092e946630d5f9bb092853b93501387dd216899b9Andrew Trick } 51192e946630d5f9bb092853b93501387dd216899b9Andrew Trick unsigned NRegDefs = SchedDAG->TII->get(Node->getMachineOpcode()).getNumDefs(); 51292e946630d5f9bb092853b93501387dd216899b9Andrew Trick // Some instructions define regs that are not represented in the selection DAG 51392e946630d5f9bb092853b93501387dd216899b9Andrew Trick // (e.g. unused flags). See tMOVi8. Make sure we don't access past NumValues. 51492e946630d5f9bb092853b93501387dd216899b9Andrew Trick NodeNumDefs = std::min(Node->getNumValues(), NRegDefs); 51592e946630d5f9bb092853b93501387dd216899b9Andrew Trick DefIdx = 0; 51692e946630d5f9bb092853b93501387dd216899b9Andrew Trick} 51792e946630d5f9bb092853b93501387dd216899b9Andrew Trick 51892e946630d5f9bb092853b93501387dd216899b9Andrew Trick// Construct a RegDefIter for this SUnit and find the first valid value. 51992e946630d5f9bb092853b93501387dd216899b9Andrew TrickScheduleDAGSDNodes::RegDefIter::RegDefIter(const SUnit *SU, 52092e946630d5f9bb092853b93501387dd216899b9Andrew Trick const ScheduleDAGSDNodes *SD) 52192e946630d5f9bb092853b93501387dd216899b9Andrew Trick : SchedDAG(SD), Node(SU->getNode()), DefIdx(0), NodeNumDefs(0) { 52292e946630d5f9bb092853b93501387dd216899b9Andrew Trick InitNodeNumDefs(); 52392e946630d5f9bb092853b93501387dd216899b9Andrew Trick Advance(); 52492e946630d5f9bb092853b93501387dd216899b9Andrew Trick} 52592e946630d5f9bb092853b93501387dd216899b9Andrew Trick 52692e946630d5f9bb092853b93501387dd216899b9Andrew Trick// Advance to the next valid value defined by the SUnit. 52792e946630d5f9bb092853b93501387dd216899b9Andrew Trickvoid ScheduleDAGSDNodes::RegDefIter::Advance() { 52892e946630d5f9bb092853b93501387dd216899b9Andrew Trick for (;Node;) { // Visit all glued nodes. 52992e946630d5f9bb092853b93501387dd216899b9Andrew Trick for (;DefIdx < NodeNumDefs; ++DefIdx) { 53092e946630d5f9bb092853b93501387dd216899b9Andrew Trick if (!Node->hasAnyUseOfValue(DefIdx)) 53192e946630d5f9bb092853b93501387dd216899b9Andrew Trick continue; 5324ef4c171dba8e479f5f3fe7acb22e9fe97a4d6f8Andrew Trick ValueType = Node->getValueType(DefIdx); 53392e946630d5f9bb092853b93501387dd216899b9Andrew Trick ++DefIdx; 53492e946630d5f9bb092853b93501387dd216899b9Andrew Trick return; // Found a normal regdef. 53592e946630d5f9bb092853b93501387dd216899b9Andrew Trick } 53692e946630d5f9bb092853b93501387dd216899b9Andrew Trick Node = Node->getGluedNode(); 53792e946630d5f9bb092853b93501387dd216899b9Andrew Trick if (Node == NULL) { 53892e946630d5f9bb092853b93501387dd216899b9Andrew Trick return; // No values left to visit. 53992e946630d5f9bb092853b93501387dd216899b9Andrew Trick } 54092e946630d5f9bb092853b93501387dd216899b9Andrew Trick InitNodeNumDefs(); 54192e946630d5f9bb092853b93501387dd216899b9Andrew Trick } 54292e946630d5f9bb092853b93501387dd216899b9Andrew Trick} 54392e946630d5f9bb092853b93501387dd216899b9Andrew Trick 54492e946630d5f9bb092853b93501387dd216899b9Andrew Trickvoid ScheduleDAGSDNodes::InitNumRegDefsLeft(SUnit *SU) { 54592e946630d5f9bb092853b93501387dd216899b9Andrew Trick assert(SU->NumRegDefsLeft == 0 && "expect a new node"); 54692e946630d5f9bb092853b93501387dd216899b9Andrew Trick for (RegDefIter I(SU, this); I.IsValid(); I.Advance()) { 54792e946630d5f9bb092853b93501387dd216899b9Andrew Trick assert(SU->NumRegDefsLeft < USHRT_MAX && "overflow is ok but unexpected"); 54892e946630d5f9bb092853b93501387dd216899b9Andrew Trick ++SU->NumRegDefsLeft; 54992e946630d5f9bb092853b93501387dd216899b9Andrew Trick } 55092e946630d5f9bb092853b93501387dd216899b9Andrew Trick} 55192e946630d5f9bb092853b93501387dd216899b9Andrew Trick 552953be893e8cffa0ef9bf410036cd96aeb526e98aAndrew Trickvoid ScheduleDAGSDNodes::computeLatency(SUnit *SU) { 55387896d9368e08d93493427ce7bf8272d1e5cca35Andrew Trick SDNode *N = SU->getNode(); 55487896d9368e08d93493427ce7bf8272d1e5cca35Andrew Trick 55587896d9368e08d93493427ce7bf8272d1e5cca35Andrew Trick // TokenFactor operands are considered zero latency, and some schedulers 55687896d9368e08d93493427ce7bf8272d1e5cca35Andrew Trick // (e.g. Top-Down list) may rely on the fact that operand latency is nonzero 55787896d9368e08d93493427ce7bf8272d1e5cca35Andrew Trick // whenever node latency is nonzero. 55887896d9368e08d93493427ce7bf8272d1e5cca35Andrew Trick if (N && N->getOpcode() == ISD::TokenFactor) { 55987896d9368e08d93493427ce7bf8272d1e5cca35Andrew Trick SU->Latency = 0; 56087896d9368e08d93493427ce7bf8272d1e5cca35Andrew Trick return; 56187896d9368e08d93493427ce7bf8272d1e5cca35Andrew Trick } 56287896d9368e08d93493427ce7bf8272d1e5cca35Andrew Trick 563e163168aab987dc3df0845b9e92310f764d8b158Evan Cheng // Check to see if the scheduler cares about latencies. 564953be893e8cffa0ef9bf410036cd96aeb526e98aAndrew Trick if (forceUnitLatencies()) { 565e163168aab987dc3df0845b9e92310f764d8b158Evan Cheng SU->Latency = 1; 566e163168aab987dc3df0845b9e92310f764d8b158Evan Cheng return; 567e163168aab987dc3df0845b9e92310f764d8b158Evan Cheng } 568e163168aab987dc3df0845b9e92310f764d8b158Evan Cheng 5693ef1c8759a20167457eb7fd82ebcaffe7ccaa1d1Evan Cheng if (!InstrItins || InstrItins->isEmpty()) { 5705e84e3ccaa555bd48ecca384e93e55abd76fb40aAndrew Trick if (N && N->isMachineOpcode() && 5715e84e3ccaa555bd48ecca384e93e55abd76fb40aAndrew Trick TII->isHighLatencyDef(N->getMachineOpcode())) 572e0ef509aeb47b396cf1bdc170ca4f468f799719fAndrew Trick SU->Latency = HighLatencyCycles; 573e0ef509aeb47b396cf1bdc170ca4f468f799719fAndrew Trick else 574e0ef509aeb47b396cf1bdc170ca4f468f799719fAndrew Trick SU->Latency = 1; 57515a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng return; 57615a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng } 577cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trick 578343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman // Compute the latency for the node. We use the sum of the latencies for 57929d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner // all nodes glued together into this SUnit. 580343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman SU->Latency = 0; 58129d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner for (SDNode *N = SU->getNode(); N; N = N->getGluedNode()) 5828239daf7c83a65a189c352cce3191cdc3bbfe151Evan Cheng if (N->isMachineOpcode()) 5838239daf7c83a65a189c352cce3191cdc3bbfe151Evan Cheng SU->Latency += TII->getInstrLatency(InstrItins, N); 584343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman} 585343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman 586953be893e8cffa0ef9bf410036cd96aeb526e98aAndrew Trickvoid ScheduleDAGSDNodes::computeOperandLatency(SDNode *Def, SDNode *Use, 58715a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng unsigned OpIdx, SDep& dep) const{ 58815a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng // Check to see if the scheduler cares about latencies. 589953be893e8cffa0ef9bf410036cd96aeb526e98aAndrew Trick if (forceUnitLatencies()) 59015a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng return; 59115a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng 59215a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng if (dep.getKind() != SDep::Data) 59315a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng return; 59415a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng 59515a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng unsigned DefIdx = Use->getOperand(OpIdx).getResNo(); 5967e2fe9150f905167f6685c9730911c2abc08293cEvan Cheng if (Use->isMachineOpcode()) 5977e2fe9150f905167f6685c9730911c2abc08293cEvan Cheng // Adjust the use operand index by num of defs. 5987e2fe9150f905167f6685c9730911c2abc08293cEvan Cheng OpIdx += TII->get(Use->getMachineOpcode()).getNumDefs(); 599a0792de66c8364d47b0a688c7f408efb7b10f31bEvan Cheng int Latency = TII->getOperandLatency(InstrItins, Def, DefIdx, Use, OpIdx); 600089751535d6e9adf65842e2ca5867bf9a70e1e95Evan Cheng if (Latency > 1 && Use->getOpcode() == ISD::CopyToReg && 601089751535d6e9adf65842e2ca5867bf9a70e1e95Evan Cheng !BB->succ_empty()) { 602089751535d6e9adf65842e2ca5867bf9a70e1e95Evan Cheng unsigned Reg = cast<RegisterSDNode>(Use->getOperand(1))->getReg(); 603089751535d6e9adf65842e2ca5867bf9a70e1e95Evan Cheng if (TargetRegisterInfo::isVirtualRegister(Reg)) 604089751535d6e9adf65842e2ca5867bf9a70e1e95Evan Cheng // This copy is a liveout value. It is likely coalesced, so reduce the 605089751535d6e9adf65842e2ca5867bf9a70e1e95Evan Cheng // latency so not to penalize the def. 606089751535d6e9adf65842e2ca5867bf9a70e1e95Evan Cheng // FIXME: need target specific adjustment here? 607089751535d6e9adf65842e2ca5867bf9a70e1e95Evan Cheng Latency = (Latency > 1) ? Latency - 1 : 1; 608089751535d6e9adf65842e2ca5867bf9a70e1e95Evan Cheng } 6093881cb7a5d54c0011b40997adcd742e1c7b91abdEvan Cheng if (Latency >= 0) 6103881cb7a5d54c0011b40997adcd742e1c7b91abdEvan Cheng dep.setLatency(Latency); 61115a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng} 61215a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng 613343f0c046702831a4a6aec951b6a297a23241a55Dan Gohmanvoid ScheduleDAGSDNodes::dumpNode(const SUnit *SU) const { 614c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng if (!SU->getNode()) { 61584fa8229bbd3813505b7e8d6555fb2e522104e30David Greene dbgs() << "PHYS REG COPY\n"; 616c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng return; 617c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng } 618c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng 619c29a56dedbe4297dad94b9bf2e19035c5903fd1fEvan Cheng SU->getNode()->dump(DAG); 62084fa8229bbd3813505b7e8d6555fb2e522104e30David Greene dbgs() << "\n"; 62129d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner SmallVector<SDNode *, 4> GluedNodes; 62229d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner for (SDNode *N = SU->getNode()->getGluedNode(); N; N = N->getGluedNode()) 62329d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner GluedNodes.push_back(N); 62429d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner while (!GluedNodes.empty()) { 62584fa8229bbd3813505b7e8d6555fb2e522104e30David Greene dbgs() << " "; 62629d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner GluedNodes.back()->dump(DAG); 62784fa8229bbd3813505b7e8d6555fb2e522104e30David Greene dbgs() << "\n"; 62829d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner GluedNodes.pop_back(); 629343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman } 630343f0c046702831a4a6aec951b6a297a23241a55Dan Gohman} 631bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman 63273ba69b6843f7f23345b1e8745cb328952cae0d8Andrew Trickvoid ScheduleDAGSDNodes::dumpSchedule() const { 63373ba69b6843f7f23345b1e8745cb328952cae0d8Andrew Trick for (unsigned i = 0, e = Sequence.size(); i != e; i++) { 63473ba69b6843f7f23345b1e8745cb328952cae0d8Andrew Trick if (SUnit *SU = Sequence[i]) 63573ba69b6843f7f23345b1e8745cb328952cae0d8Andrew Trick SU->dump(this); 63673ba69b6843f7f23345b1e8745cb328952cae0d8Andrew Trick else 63773ba69b6843f7f23345b1e8745cb328952cae0d8Andrew Trick dbgs() << "**** NOOP ****\n"; 63873ba69b6843f7f23345b1e8745cb328952cae0d8Andrew Trick } 63973ba69b6843f7f23345b1e8745cb328952cae0d8Andrew Trick} 64073ba69b6843f7f23345b1e8745cb328952cae0d8Andrew Trick 6414c727204271067f3dbf50bd23098b2df8e1cc47aAndrew Trick#ifndef NDEBUG 6424c727204271067f3dbf50bd23098b2df8e1cc47aAndrew Trick/// VerifyScheduledSequence - Verify that all SUnits were scheduled and that 6434c727204271067f3dbf50bd23098b2df8e1cc47aAndrew Trick/// their state is consistent with the nodes listed in Sequence. 6444c727204271067f3dbf50bd23098b2df8e1cc47aAndrew Trick/// 6454c727204271067f3dbf50bd23098b2df8e1cc47aAndrew Trickvoid ScheduleDAGSDNodes::VerifyScheduledSequence(bool isBottomUp) { 6464c727204271067f3dbf50bd23098b2df8e1cc47aAndrew Trick unsigned ScheduledNodes = ScheduleDAG::VerifyScheduledDAG(isBottomUp); 6474c727204271067f3dbf50bd23098b2df8e1cc47aAndrew Trick unsigned Noops = 0; 6484c727204271067f3dbf50bd23098b2df8e1cc47aAndrew Trick for (unsigned i = 0, e = Sequence.size(); i != e; ++i) 6494c727204271067f3dbf50bd23098b2df8e1cc47aAndrew Trick if (!Sequence[i]) 6504c727204271067f3dbf50bd23098b2df8e1cc47aAndrew Trick ++Noops; 6514c727204271067f3dbf50bd23098b2df8e1cc47aAndrew Trick assert(Sequence.size() - Noops == ScheduledNodes && 6524c727204271067f3dbf50bd23098b2df8e1cc47aAndrew Trick "The number of nodes scheduled doesn't match the expected number!"); 6534c727204271067f3dbf50bd23098b2df8e1cc47aAndrew Trick} 6544c727204271067f3dbf50bd23098b2df8e1cc47aAndrew Trick#endif // NDEBUG 6554c727204271067f3dbf50bd23098b2df8e1cc47aAndrew Trick 656bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Chengnamespace { 657bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng struct OrderSorter { 658bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng bool operator()(const std::pair<unsigned, MachineInstr*> &A, 659bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng const std::pair<unsigned, MachineInstr*> &B) { 660bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng return A.first < B.first; 661bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 662bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng }; 663bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng} 664bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 6657a2bdde0a0eebcd2125055e0eacaca040f0b766cChris Lattner/// ProcessSDDbgValues - Process SDDbgValues associated with this node. 666cd5af07c4573c6b1270d6737e76ef3219091a733Andrew Trickstatic void ProcessSDDbgValues(SDNode *N, SelectionDAG *DAG, 66755d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel InstrEmitter &Emitter, 66855d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel SmallVector<std::pair<unsigned, MachineInstr*>, 32> &Orders, 66955d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel DenseMap<SDValue, unsigned> &VRBaseMap, 67055d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel unsigned Order) { 67155d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel if (!N->getHasDebugValue()) 67255d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel return; 67355d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel 67455d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel // Opportunistically insert immediate dbg_value uses, i.e. those with source 67555d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel // order number right after the N. 67655d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel MachineBasicBlock *BB = Emitter.getBlock(); 67755d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel MachineBasicBlock::iterator InsertPos = Emitter.getInsertPos(); 67822a54c1cd711afccd4558374918d12a939e1cca5Benjamin Kramer ArrayRef<SDDbgValue*> DVs = DAG->GetDbgValues(N); 67955d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel for (unsigned i = 0, e = DVs.size(); i != e; ++i) { 68055d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel if (DVs[i]->isInvalidated()) 68155d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel continue; 68255d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel unsigned DVOrder = DVs[i]->getOrder(); 68355d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel if (!Order || DVOrder == ++Order) { 68455d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel MachineInstr *DbgMI = Emitter.EmitDbgValue(DVs[i], VRBaseMap); 68555d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel if (DbgMI) { 68655d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel Orders.push_back(std::make_pair(DVOrder, DbgMI)); 68755d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel BB->insert(InsertPos, DbgMI); 68855d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel } 68955d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel DVs[i]->setIsInvalidated(); 69055d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel } 69155d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel } 69255d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel} 69355d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel 694bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng// ProcessSourceNode - Process nodes with source order numbers. These are added 695d27946d1d4272d7e2bbee00fac020dc8147dfd25Jim Grosbach// to a vector which EmitSchedule uses to determine how to insert dbg_value 696bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng// instructions in the right order. 697bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Chengstatic void ProcessSourceNode(SDNode *N, SelectionDAG *DAG, 698bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng InstrEmitter &Emitter, 699bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng DenseMap<SDValue, unsigned> &VRBaseMap, 700bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SmallVector<std::pair<unsigned, MachineInstr*>, 32> &Orders, 701bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SmallSet<unsigned, 8> &Seen) { 702bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng unsigned Order = DAG->GetOrdering(N); 70339078a8bde256ee22e981713a4d2ff8235dc7706Devang Patel if (!Order || !Seen.insert(Order)) { 70439078a8bde256ee22e981713a4d2ff8235dc7706Devang Patel // Process any valid SDDbgValues even if node does not have any order 70539078a8bde256ee22e981713a4d2ff8235dc7706Devang Patel // assigned. 70639078a8bde256ee22e981713a4d2ff8235dc7706Devang Patel ProcessSDDbgValues(N, DAG, Emitter, Orders, VRBaseMap, 0); 707bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng return; 70839078a8bde256ee22e981713a4d2ff8235dc7706Devang Patel } 709bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 710bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng MachineBasicBlock *BB = Emitter.getBlock(); 71184023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman if (Emitter.getInsertPos() == BB->begin() || BB->back().isPHI()) { 712bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // Did not insert any instruction. 713bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng Orders.push_back(std::make_pair(Order, (MachineInstr*)0)); 714bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng return; 715bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 716bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 71784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman Orders.push_back(std::make_pair(Order, prior(Emitter.getInsertPos()))); 71855d20e8ff1e458f177302386d14f1a4dbdd86028Devang Patel ProcessSDDbgValues(N, DAG, Emitter, Orders, VRBaseMap, Order); 719bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng} 720bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 72184b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trickvoid ScheduleDAGSDNodes:: 72284b454d1a270a5d685e01686ed15e68c44b0b56aAndrew TrickEmitPhysRegCopy(SUnit *SU, DenseMap<SUnit*, unsigned> &VRBaseMap, 72384b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick MachineBasicBlock::iterator InsertPos) { 72484b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); 72584b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick I != E; ++I) { 72684b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick if (I->isCtrl()) continue; // ignore chain preds 72784b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick if (I->getSUnit()->CopyDstRC) { 72884b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick // Copy to physical register. 72984b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick DenseMap<SUnit*, unsigned>::iterator VRI = VRBaseMap.find(I->getSUnit()); 73084b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick assert(VRI != VRBaseMap.end() && "Node emitted out of order - late"); 73184b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick // Find the destination physical register. 73284b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick unsigned Reg = 0; 73384b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick for (SUnit::const_succ_iterator II = SU->Succs.begin(), 73484b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick EE = SU->Succs.end(); II != EE; ++II) { 73584b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick if (II->isCtrl()) continue; // ignore chain preds 73684b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick if (II->getReg()) { 73784b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick Reg = II->getReg(); 73884b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick break; 73984b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick } 74084b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick } 74184b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick BuildMI(*BB, InsertPos, DebugLoc(), TII->get(TargetOpcode::COPY), Reg) 74284b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick .addReg(VRI->second); 74384b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick } else { 74484b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick // Copy from physical register. 74584b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick assert(I->getReg() && "Unknown physical register!"); 74684b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick unsigned VRBase = MRI.createVirtualRegister(SU->CopyDstRC); 74784b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick bool isNew = VRBaseMap.insert(std::make_pair(SU, VRBase)).second; 74884b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick (void)isNew; // Silence compiler warning. 74984b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick assert(isNew && "Node emitted out of order - early"); 75084b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick BuildMI(*BB, InsertPos, DebugLoc(), TII->get(TargetOpcode::COPY), VRBase) 75184b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick .addReg(I->getReg()); 75284b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick } 75384b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick break; 75484b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick } 75584b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick} 756bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 75784b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick/// EmitSchedule - Emit the machine code in scheduled order. Return the new 75884b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick/// InsertPos and MachineBasicBlock that contains this insertion 75984b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick/// point. ScheduleDAGSDNodes holds a BB pointer for convenience, but this does 76084b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick/// not necessarily refer to returned BB. The emitter may split blocks. 76147c144505b9be28ed22c626b3a407c11dba2fec5Andrew TrickMachineBasicBlock *ScheduleDAGSDNodes:: 76247c144505b9be28ed22c626b3a407c11dba2fec5Andrew TrickEmitSchedule(MachineBasicBlock::iterator &InsertPos) { 763bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman InstrEmitter Emitter(BB, InsertPos); 764bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman DenseMap<SDValue, unsigned> VRBaseMap; 765bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman DenseMap<SUnit*, unsigned> CopyVRBaseMap; 766bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SmallVector<std::pair<unsigned, MachineInstr*>, 32> Orders; 767bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SmallSet<unsigned, 8> Seen; 768bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng bool HasDbg = DAG->hasDebugValues(); 769bfdf7f38523bd38ae0538861a2bfd8bdc46e5c33Dale Johannesen 770fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen // If this is the first BB, emit byval parameter dbg_value's. 771fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen if (HasDbg && BB->getParent()->begin() == MachineFunction::iterator(BB)) { 772fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen SDDbgInfo::DbgIterator PDI = DAG->ByvalParmDbgBegin(); 773fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen SDDbgInfo::DbgIterator PDE = DAG->ByvalParmDbgEnd(); 774fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen for (; PDI != PDE; ++PDI) { 775891ff8fbd61a06ef8ea57461fa377ebbb663ed09Dan Gohman MachineInstr *DbgMI= Emitter.EmitDbgValue(*PDI, VRBaseMap); 776fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen if (DbgMI) 77784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman BB->insert(InsertPos, DbgMI); 778fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen } 779fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen } 780fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen 781bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman for (unsigned i = 0, e = Sequence.size(); i != e; i++) { 782bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman SUnit *SU = Sequence[i]; 783bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman if (!SU) { 784bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman // Null SUnit* is a noop. 78584b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick TII->insertNoop(*Emitter.getBlock(), InsertPos); 786bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman continue; 787bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman } 788bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman 789bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman // For pre-regalloc scheduling, create instructions corresponding to the 79029d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner // SDNode and any glued SDNodes and append them to the block. 791bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman if (!SU->getNode()) { 792bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman // Emit a copy. 79384b454d1a270a5d685e01686ed15e68c44b0b56aAndrew Trick EmitPhysRegCopy(SU, CopyVRBaseMap, InsertPos); 794bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman continue; 795bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman } 796bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman 79729d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner SmallVector<SDNode *, 4> GluedNodes; 79829d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner for (SDNode *N = SU->getNode()->getGluedNode(); N; 79929d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner N = N->getGluedNode()) 80029d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner GluedNodes.push_back(N); 80129d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner while (!GluedNodes.empty()) { 80229d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner SDNode *N = GluedNodes.back(); 80329d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner Emitter.EmitNode(GluedNodes.back(), SU->OrigNode != SU, SU->isCloned, 804af1d8ca44a18f304f207e209b3bdb94b590f86ffDan Gohman VRBaseMap); 805fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen // Remember the source order of the inserted instruction. 806bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (HasDbg) 807891ff8fbd61a06ef8ea57461fa377ebbb663ed09Dan Gohman ProcessSourceNode(N, DAG, Emitter, VRBaseMap, Orders, Seen); 80829d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner GluedNodes.pop_back(); 809bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman } 810bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman Emitter.EmitNode(SU->getNode(), SU->OrigNode != SU, SU->isCloned, 811af1d8ca44a18f304f207e209b3bdb94b590f86ffDan Gohman VRBaseMap); 812fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen // Remember the source order of the inserted instruction. 813bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (HasDbg) 814891ff8fbd61a06ef8ea57461fa377ebbb663ed09Dan Gohman ProcessSourceNode(SU->getNode(), DAG, Emitter, VRBaseMap, Orders, 815bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng Seen); 816bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 817bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 818fdb42fa5fe794cc2c89e2ed7f57a89ed24d9952aDale Johannesen // Insert all the dbg_values which have not already been inserted in source 819bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // order sequence. 820bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (HasDbg) { 82184023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman MachineBasicBlock::iterator BBBegin = BB->getFirstNonPHI(); 822bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 823bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // Sort the source order instructions and use the order to insert debug 824bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // values. 825bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng std::sort(Orders.begin(), Orders.end(), OrderSorter()); 826bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng 827bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SDDbgInfo::DbgIterator DI = DAG->DbgBegin(); 828bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng SDDbgInfo::DbgIterator DE = DAG->DbgEnd(); 829bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // Now emit the rest according to source order. 830bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng unsigned LastOrder = 0; 831bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng for (unsigned i = 0, e = Orders.size(); i != e && DI != DE; ++i) { 832bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng unsigned Order = Orders[i].first; 833bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng MachineInstr *MI = Orders[i].second; 834bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // Insert all SDDbgValue's whose order(s) are before "Order". 835bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if (!MI) 836bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng continue; 837bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng for (; DI != DE && 838bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng (*DI)->getOrder() >= LastOrder && (*DI)->getOrder() < Order; ++DI) { 839bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng if ((*DI)->isInvalidated()) 840bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng continue; 841891ff8fbd61a06ef8ea57461fa377ebbb663ed09Dan Gohman MachineInstr *DbgMI = Emitter.EmitDbgValue(*DI, VRBaseMap); 842962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng if (DbgMI) { 843962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng if (!LastOrder) 844962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng // Insert to start of the BB (after PHIs). 845962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng BB->insert(BBBegin, DbgMI); 846962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng else { 847a8dab36f3dfdfcd3f74224afa4ffb32776674c93Dan Gohman // Insert at the instruction, which may be in a different 848a8dab36f3dfdfcd3f74224afa4ffb32776674c93Dan Gohman // block, if the block was split by a custom inserter. 849962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng MachineBasicBlock::iterator Pos = MI; 850a8dab36f3dfdfcd3f74224afa4ffb32776674c93Dan Gohman MI->getParent()->insert(llvm::next(Pos), DbgMI); 851962021bc7f6721c20c7dfe8ca809e2d98b1c554aEvan Cheng } 852bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 853bfdf7f38523bd38ae0538861a2bfd8bdc46e5c33Dale Johannesen } 854bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng LastOrder = Order; 855bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 856bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // Add trailing DbgValue's before the terminator. FIXME: May want to add 857bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng // some of them before one or more conditional branches? 8587bf116acd417e50f6fac677b9cb9204ee7f35c00Bill Wendling SmallVector<MachineInstr*, 8> DbgMIs; 859bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng while (DI != DE) { 8607bf116acd417e50f6fac677b9cb9204ee7f35c00Bill Wendling if (!(*DI)->isInvalidated()) 8617bf116acd417e50f6fac677b9cb9204ee7f35c00Bill Wendling if (MachineInstr *DbgMI = Emitter.EmitDbgValue(*DI, VRBaseMap)) 8627bf116acd417e50f6fac677b9cb9204ee7f35c00Bill Wendling DbgMIs.push_back(DbgMI); 863bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng ++DI; 864bfcb3051899b7141a946d769fcf6e8a8453bc530Evan Cheng } 8657bf116acd417e50f6fac677b9cb9204ee7f35c00Bill Wendling 8667bf116acd417e50f6fac677b9cb9204ee7f35c00Bill Wendling MachineBasicBlock *InsertBB = Emitter.getBlock(); 8677bf116acd417e50f6fac677b9cb9204ee7f35c00Bill Wendling MachineBasicBlock::iterator Pos = InsertBB->getFirstTerminator(); 8687bf116acd417e50f6fac677b9cb9204ee7f35c00Bill Wendling InsertBB->insert(Pos, DbgMIs.begin(), DbgMIs.end()); 869bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman } 870bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman 871bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman InsertPos = Emitter.getInsertPos(); 87247c144505b9be28ed22c626b3a407c11dba2fec5Andrew Trick return Emitter.getBlock(); 873bcea859fc1dd1af9ac66ec93ea04ce9a19c8451cDan Gohman} 87456b94c52c9bf0342106ca7d274b9bb469d5ef619Andrew Trick 87556b94c52c9bf0342106ca7d274b9bb469d5ef619Andrew Trick/// Return the basic block label. 87656b94c52c9bf0342106ca7d274b9bb469d5ef619Andrew Trickstd::string ScheduleDAGSDNodes::getDAGName() const { 87756b94c52c9bf0342106ca7d274b9bb469d5ef619Andrew Trick return "sunit-dag." + BB->getFullName(); 87856b94c52c9bf0342106ca7d274b9bb469d5ef619Andrew Trick} 879