ScheduleDAG.h revision 42a77880a83b76112a1f42ce16b46dbde01cd0a8
1a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng//===------- llvm/CodeGen/ScheduleDAG.h - Common Base Class------*- C++ -*-===// 2a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng// 3a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng// The LLVM Compiler Infrastructure 4a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng// 57ed47a13356daed2a34cd2209a31f92552e3bdd8Chris Lattner// This file is distributed under the University of Illinois Open Source 67ed47a13356daed2a34cd2209a31f92552e3bdd8Chris Lattner// License. See LICENSE.TXT for details. 7a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng// 8a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng//===----------------------------------------------------------------------===// 9a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng// 10a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng// This file implements the ScheduleDAG class, which is used as the common 11a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng// base class for SelectionDAG-based instruction scheduler. 12a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng// 13a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng//===----------------------------------------------------------------------===// 14a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 15a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng#ifndef LLVM_CODEGEN_SCHEDULEDAG_H 16a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng#define LLVM_CODEGEN_SCHEDULEDAG_H 17a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 18a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng#include "llvm/CodeGen/SelectionDAG.h" 192ba528b3a75955c960347e5b5b28ae74d5a81909Chris Lattner#include "llvm/ADT/DenseMap.h" 203e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman#include "llvm/ADT/GraphTraits.h" 2194c002a190cd2e3a52b1510bc997e53d63af0b3bChris Lattner#include "llvm/ADT/SmallSet.h" 22e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng 23a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengnamespace llvm { 24ca5ca41a635d361604a74ea8f6dd447093a0b681Jeff Cohen struct InstrStage; 25713a98dee8ab07a3066d1707a07648d27dd0c19cEvan Cheng struct SUnit; 26a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng class MachineConstantPool; 276b2cf285bd43fdc98ca68df477570ef6938d4fb2Evan Cheng class MachineFunction; 2844c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey class MachineModuleInfo; 2984bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner class MachineRegisterInfo; 30a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng class MachineInstr; 316f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman class TargetRegisterInfo; 32a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng class SelectionDAG; 339ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey class SelectionDAGISel; 34a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng class TargetInstrInfo; 35749c6f6b5ed301c84aac562e414486549d7b98ebChris Lattner class TargetInstrDesc; 36a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng class TargetMachine; 378ed3ffee53105275ca03f06ba0195bc6008477faEvan Cheng class TargetRegisterClass; 38a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 3937e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// HazardRecognizer - This determines whether or not an instruction can be 4037e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// issued this cycle, and whether or not a noop needs to be inserted to handle 4137e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// the hazard. 4237e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner class HazardRecognizer { 4337e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner public: 4437e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner virtual ~HazardRecognizer(); 4537e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner 4637e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner enum HazardType { 4737e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner NoHazard, // This instruction can be emitted at this cycle. 4837e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner Hazard, // This instruction can't be emitted at this cycle. 49d74ea2bbd8bb630331f35ead42d385249bd42af8Chris Lattner NoopHazard // This instruction can't be emitted, and needs noops. 5037e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner }; 5137e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner 5237e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// getHazardType - Return the hazard type of emitting this node. There are 5337e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// three possible results. Either: 5437e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// * NoHazard: it is legal to issue this instruction on this cycle. 5537e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// * Hazard: issuing this instruction would stall the machine. If some 5637e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// other instruction is available, issue it first. 5737e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// * NoopHazard: issuing this instruction would break the program. If 5837e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// some other instruction can be issued, do so, otherwise issue a noop. 5937e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner virtual HazardType getHazardType(SDNode *Node) { 6037e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner return NoHazard; 6137e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner } 6237e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner 6337e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// EmitInstruction - This callback is invoked when an instruction is 6437e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// emitted, to advance the hazard state. 6537e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner virtual void EmitInstruction(SDNode *Node) { 6637e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner } 6737e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner 6837e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// AdvanceCycle - This callback is invoked when no instructions can be 6937e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// issued on this cycle without a hazard. This should increment the 7037e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// internal state of the hazard recognizer so that previously "Hazard" 7137e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// instructions will now not be hazards. 7237e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner virtual void AdvanceCycle() { 7337e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner } 7437e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner 7537e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// EmitNoop - This callback is invoked when a noop was added to the 7637e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// instruction stream. 7737e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner virtual void EmitNoop() { 7837e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner } 794ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng }; 80713a98dee8ab07a3066d1707a07648d27dd0c19cEvan Cheng 81713a98dee8ab07a3066d1707a07648d27dd0c19cEvan Cheng /// SDep - Scheduling dependency. It keeps track of dependent nodes, 82713a98dee8ab07a3066d1707a07648d27dd0c19cEvan Cheng /// cost of the depdenency, etc. 83713a98dee8ab07a3066d1707a07648d27dd0c19cEvan Cheng struct SDep { 84a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng SUnit *Dep; // Dependent - either a predecessor or a successor. 85a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng unsigned Reg; // If non-zero, this dep is a phy register dependency. 86a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng int Cost; // Cost of the dependency. 87a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng bool isCtrl : 1; // True iff it's a control dependency. 88a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng bool isSpecial : 1; // True iff it's a special ctrl dep added during sched. 89a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng SDep(SUnit *d, unsigned r, int t, bool c, bool s) 90a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng : Dep(d), Reg(r), Cost(t), isCtrl(c), isSpecial(s) {} 91713a98dee8ab07a3066d1707a07648d27dd0c19cEvan Cheng }; 92713a98dee8ab07a3066d1707a07648d27dd0c19cEvan Cheng 93e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// SUnit - Scheduling unit. It's an wrapper around either a single SDNode or 94e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// a group of nodes flagged together. 95e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng struct SUnit { 96e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng SDNode *Node; // Representative node. 979522ee3d93cb15ebcfd80200fea42378cc510d21Chris Lattner SmallVector<SDNode*,4> FlaggedNodes;// All nodes flagged to Node. 98a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng unsigned InstanceNo; // Instance#. One SDNode can be multiple 99a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng // SUnit due to cloning. 100e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng 101e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng // Preds/Succs - The SUnits before/after us in the graph. The boolean value 102e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng // is true if the edge is a token chain edge, false if it is a value edge. 103713a98dee8ab07a3066d1707a07648d27dd0c19cEvan Cheng SmallVector<SDep, 4> Preds; // All sunit predecessors. 104713a98dee8ab07a3066d1707a07648d27dd0c19cEvan Cheng SmallVector<SDep, 4> Succs; // All sunit successors. 105713a98dee8ab07a3066d1707a07648d27dd0c19cEvan Cheng 106713a98dee8ab07a3066d1707a07648d27dd0c19cEvan Cheng typedef SmallVector<SDep, 4>::iterator pred_iterator; 107713a98dee8ab07a3066d1707a07648d27dd0c19cEvan Cheng typedef SmallVector<SDep, 4>::iterator succ_iterator; 108713a98dee8ab07a3066d1707a07648d27dd0c19cEvan Cheng typedef SmallVector<SDep, 4>::const_iterator const_pred_iterator; 109713a98dee8ab07a3066d1707a07648d27dd0c19cEvan Cheng typedef SmallVector<SDep, 4>::const_iterator const_succ_iterator; 110228a18e0f220fb85ee06fd5bfa29304e57047ff1Chris Lattner 111a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng unsigned NodeNum; // Entry # of node in the node vector. 112a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng unsigned short Latency; // Node latency. 113e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng short NumPreds; // # of preds. 114e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng short NumSuccs; // # of sucss. 115e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng short NumPredsLeft; // # of preds not scheduled. 116e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng short NumSuccsLeft; // # of succs not scheduled. 117e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng bool isTwoAddress : 1; // Is a two-address instruction. 11813d41b9d721f98372b97d2ec119e6c91932ab0aeEvan Cheng bool isCommutable : 1; // Is a commutable instruction. 119f10c973797cf79da802f9b0118543cbd50954c9cEvan Cheng bool hasPhysRegDefs : 1; // Has physreg defs that are being used. 120e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng bool isPending : 1; // True once pending. 121e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng bool isAvailable : 1; // True once available. 122e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng bool isScheduled : 1; // True once scheduled. 123e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng unsigned CycleBound; // Upper/lower cycle to be scheduled at. 124e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng unsigned Cycle; // Once scheduled, the cycle of the op. 125e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng unsigned Depth; // Node depth; 126e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng unsigned Height; // Node height; 1278ed3ffee53105275ca03f06ba0195bc6008477faEvan Cheng const TargetRegisterClass *CopyDstRC; // Is a special copy node if not null. 1288ed3ffee53105275ca03f06ba0195bc6008477faEvan Cheng const TargetRegisterClass *CopySrcRC; 129e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng 130e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng SUnit(SDNode *node, unsigned nodenum) 131a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng : Node(node), InstanceNo(0), NodeNum(nodenum), Latency(0), 132a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng NumPreds(0), NumSuccs(0), NumPredsLeft(0), NumSuccsLeft(0), 13322a529990bb4bb86bdb2ae1cfce7340320a6ca7fEvan Cheng isTwoAddress(false), isCommutable(false), hasPhysRegDefs(false), 134e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng isPending(false), isAvailable(false), isScheduled(false), 1358ed3ffee53105275ca03f06ba0195bc6008477faEvan Cheng CycleBound(0), Cycle(0), Depth(0), Height(0), 1368ed3ffee53105275ca03f06ba0195bc6008477faEvan Cheng CopyDstRC(NULL), CopySrcRC(NULL) {} 137a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng 138228a18e0f220fb85ee06fd5bfa29304e57047ff1Chris Lattner /// addPred - This adds the specified node as a pred of the current node if 139228a18e0f220fb85ee06fd5bfa29304e57047ff1Chris Lattner /// not already. This returns true if this is a new pred. 140a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng bool addPred(SUnit *N, bool isCtrl, bool isSpecial, 141a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng unsigned PhyReg = 0, int Cost = 1) { 142228a18e0f220fb85ee06fd5bfa29304e57047ff1Chris Lattner for (unsigned i = 0, e = Preds.size(); i != e; ++i) 143a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng if (Preds[i].Dep == N && 144a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng Preds[i].isCtrl == isCtrl && Preds[i].isSpecial == isSpecial) 145228a18e0f220fb85ee06fd5bfa29304e57047ff1Chris Lattner return false; 146a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng Preds.push_back(SDep(N, PhyReg, Cost, isCtrl, isSpecial)); 147a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng N->Succs.push_back(SDep(this, PhyReg, Cost, isCtrl, isSpecial)); 14874d2fd8dd847e0ebccef30e2c5907ff09495d518Evan Cheng if (!isCtrl) { 149a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng ++NumPreds; 150a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng ++N->NumSuccs; 151a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng } 15274d2fd8dd847e0ebccef30e2c5907ff09495d518Evan Cheng if (!N->isScheduled) 15374d2fd8dd847e0ebccef30e2c5907ff09495d518Evan Cheng ++NumPredsLeft; 15474d2fd8dd847e0ebccef30e2c5907ff09495d518Evan Cheng if (!isScheduled) 15574d2fd8dd847e0ebccef30e2c5907ff09495d518Evan Cheng ++N->NumSuccsLeft; 156228a18e0f220fb85ee06fd5bfa29304e57047ff1Chris Lattner return true; 157228a18e0f220fb85ee06fd5bfa29304e57047ff1Chris Lattner } 158228a18e0f220fb85ee06fd5bfa29304e57047ff1Chris Lattner 159a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng bool removePred(SUnit *N, bool isCtrl, bool isSpecial) { 160a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng for (SmallVector<SDep, 4>::iterator I = Preds.begin(), E = Preds.end(); 161a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng I != E; ++I) 162a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng if (I->Dep == N && I->isCtrl == isCtrl && I->isSpecial == isSpecial) { 163a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng bool FoundSucc = false; 164a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng for (SmallVector<SDep, 4>::iterator II = N->Succs.begin(), 165a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng EE = N->Succs.end(); II != EE; ++II) 166a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng if (II->Dep == this && 167a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng II->isCtrl == isCtrl && II->isSpecial == isSpecial) { 168a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng FoundSucc = true; 169a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng N->Succs.erase(II); 170a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng break; 171a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng } 172a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng assert(FoundSucc && "Mismatching preds / succs lists!"); 173a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng Preds.erase(I); 17474d2fd8dd847e0ebccef30e2c5907ff09495d518Evan Cheng if (!isCtrl) { 175a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng --NumPreds; 176a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng --N->NumSuccs; 177a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng } 17874d2fd8dd847e0ebccef30e2c5907ff09495d518Evan Cheng if (!N->isScheduled) 17974d2fd8dd847e0ebccef30e2c5907ff09495d518Evan Cheng --NumPredsLeft; 18074d2fd8dd847e0ebccef30e2c5907ff09495d518Evan Cheng if (!isScheduled) 18174d2fd8dd847e0ebccef30e2c5907ff09495d518Evan Cheng --N->NumSuccsLeft; 182a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng return true; 183a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng } 184a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng return false; 185a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng } 186a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng 187a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng bool isPred(SUnit *N) { 188a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng for (unsigned i = 0, e = Preds.size(); i != e; ++i) 189a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng if (Preds[i].Dep == N) 190a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng return true; 191a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng return false; 192a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng } 193a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng 194a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng bool isSucc(SUnit *N) { 195228a18e0f220fb85ee06fd5bfa29304e57047ff1Chris Lattner for (unsigned i = 0, e = Succs.size(); i != e; ++i) 196a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng if (Succs[i].Dep == N) 197a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng return true; 198a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng return false; 199228a18e0f220fb85ee06fd5bfa29304e57047ff1Chris Lattner } 200228a18e0f220fb85ee06fd5bfa29304e57047ff1Chris Lattner 201e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng void dump(const SelectionDAG *G) const; 202e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng void dumpAll(const SelectionDAG *G) const; 203e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng }; 204e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng 205e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng //===--------------------------------------------------------------------===// 206e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// SchedulingPriorityQueue - This interface is used to plug different 207e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// priorities computation algorithms into the list scheduler. It implements 208e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// the interface of a standard priority queue, where nodes are inserted in 209e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// arbitrary order and returned in priority order. The computation of the 210e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// priority and the representation of the queue are totally up to the 211e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// implementation to decide. 212e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// 213e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng class SchedulingPriorityQueue { 214e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng public: 215e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng virtual ~SchedulingPriorityQueue() {} 216e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng 217a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng virtual void initNodes(DenseMap<SDNode*, std::vector<SUnit*> > &SUMap, 218fe0b81759d207072ae468f5154f6a513c3a1be72Evan Cheng std::vector<SUnit> &SUnits) = 0; 219a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng virtual void addNode(const SUnit *SU) = 0; 220a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng virtual void updateNode(const SUnit *SU) = 0; 221e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng virtual void releaseState() = 0; 222a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng 223a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng virtual unsigned size() const = 0; 224e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng virtual bool empty() const = 0; 225e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng virtual void push(SUnit *U) = 0; 226e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng 227e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng virtual void push_all(const std::vector<SUnit *> &Nodes) = 0; 228e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng virtual SUnit *pop() = 0; 229e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng 230a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng virtual void remove(SUnit *SU) = 0; 231a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng 232e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// ScheduledNode - As each node is scheduled, this method is invoked. This 233e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// allows the priority function to adjust the priority of node that have 234e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// already been emitted. 235e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng virtual void ScheduledNode(SUnit *Node) {} 236a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng 237a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng virtual void UnscheduledNode(SUnit *Node) {} 238e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng }; 239e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng 240a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng class ScheduleDAG { 241a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng public: 242a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng SelectionDAG &DAG; // DAG of the current basic block 243a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng MachineBasicBlock *BB; // Current basic block 244a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng const TargetMachine &TM; // Target processor 245a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng const TargetInstrInfo *TII; // Target instruction information 2466f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman const TargetRegisterInfo *TRI; // Target processor register info 2476b2cf285bd43fdc98ca68df477570ef6938d4fb2Evan Cheng MachineFunction *MF; // Machine function 24884bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner MachineRegisterInfo &RegInfo; // Virtual/real register map 249a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng MachineConstantPool *ConstPool; // Target constant pool 25013d41b9d721f98372b97d2ec119e6c91932ab0aeEvan Cheng std::vector<SUnit*> Sequence; // The schedule. Null SUnit*'s 25113d41b9d721f98372b97d2ec119e6c91932ab0aeEvan Cheng // represent noop instructions. 252a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng DenseMap<SDNode*, std::vector<SUnit*> > SUnitMap; 253a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng // SDNode to SUnit mapping (n -> n). 254e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng std::vector<SUnit> SUnits; // The scheduling units. 25594c002a190cd2e3a52b1510bc997e53d63af0b3bChris Lattner SmallSet<SDNode*, 16> CommuteSet; // Nodes the should be commuted. 256a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 2572f5806c2b37a4e59cb12a6d49f0e3423c2082a64Chris Lattner ScheduleDAG(SelectionDAG &dag, MachineBasicBlock *bb, 25884bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner const TargetMachine &tm); 259cccf1232a69e2d78516c61a97e7bfa26acefb714Evan Cheng 26037cb415eec53e20ed77c1c90f86310de217f3e6cChris Lattner virtual ~ScheduleDAG() {} 261a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 2623e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman /// viewGraph - Pop up a GraphViz/gv window with the ScheduleDAG rendered 2633e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman /// using 'dot'. 2643e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman /// 2653e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman void viewGraph(); 2663e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 267a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng /// Run - perform scheduling. 268a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng /// 269a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng MachineBasicBlock *Run(); 270a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 2714ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng /// isPassiveNode - Return true if the node is a non-scheduled leaf. 2724ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng /// 2730993f1d8338ccf8552a1dbc3fb19461a5e6165d9Evan Cheng static bool isPassiveNode(SDNode *Node) { 2744ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng if (isa<ConstantSDNode>(Node)) return true; 275e179584f9b740cf3a36bde70f8cab40de59b8081Nate Begeman if (isa<ConstantFPSDNode>(Node)) return true; 2764ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng if (isa<RegisterSDNode>(Node)) return true; 2774ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng if (isa<GlobalAddressSDNode>(Node)) return true; 2784ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng if (isa<BasicBlockSDNode>(Node)) return true; 2794ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng if (isa<FrameIndexSDNode>(Node)) return true; 2804ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng if (isa<ConstantPoolSDNode>(Node)) return true; 28137efe6764568a3829fee26aba532283131d1a104Nate Begeman if (isa<JumpTableSDNode>(Node)) return true; 2824ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng if (isa<ExternalSymbolSDNode>(Node)) return true; 28369de1932b350d7cdfc0ed1f4198d6f78c7822a02Dan Gohman if (isa<MemOperandSDNode>(Node)) return true; 2844ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng return false; 2854ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng } 2864ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 287e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// NewSUnit - Creates a new SUnit and return a ptr to it. 288e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// 289e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng SUnit *NewSUnit(SDNode *N) { 290e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng SUnits.push_back(SUnit(N, SUnits.size())); 291e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng return &SUnits.back(); 292e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng } 293e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng 294a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng /// Clone - Creates a clone of the specified SUnit. It does not copy the 295a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng /// predecessors / successors info nor the temporary scheduling states. 296a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng SUnit *Clone(SUnit *N); 297a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng 298e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// BuildSchedUnits - Build SUnits from the selection dag that we are input. 299e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// This SUnit graph is similar to the SelectionDAG, but represents flagged 300e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// together nodes with a single SUnit. 301e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng void BuildSchedUnits(); 302e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng 303f10c973797cf79da802f9b0118543cbd50954c9cEvan Cheng /// ComputeLatency - Compute node latency. 304f10c973797cf79da802f9b0118543cbd50954c9cEvan Cheng /// 305f10c973797cf79da802f9b0118543cbd50954c9cEvan Cheng void ComputeLatency(SUnit *SU); 306f10c973797cf79da802f9b0118543cbd50954c9cEvan Cheng 307e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// CalculateDepths, CalculateHeights - Calculate node depth / height. 308e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// 309e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng void CalculateDepths(); 310e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng void CalculateHeights(); 311e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng 312fe0b81759d207072ae468f5154f6a513c3a1be72Evan Cheng /// CountResults - The results of target nodes have register or immediate 313fe0b81759d207072ae468f5154f6a513c3a1be72Evan Cheng /// operands first, then an optional chain, and optional flag operands 314fe0b81759d207072ae468f5154f6a513c3a1be72Evan Cheng /// (which do not go into the machine instrs.) 315fe0b81759d207072ae468f5154f6a513c3a1be72Evan Cheng static unsigned CountResults(SDNode *Node); 316fe0b81759d207072ae468f5154f6a513c3a1be72Evan Cheng 31769de1932b350d7cdfc0ed1f4198d6f78c7822a02Dan Gohman /// CountOperands - The inputs to target nodes have any actual inputs first, 31842a77880a83b76112a1f42ce16b46dbde01cd0a8Dan Gohman /// followed by special operands that describe memory references, then an 31942a77880a83b76112a1f42ce16b46dbde01cd0a8Dan Gohman /// optional chain operand, then flag operands. Compute the number of 32042a77880a83b76112a1f42ce16b46dbde01cd0a8Dan Gohman /// actual operands that will go into the resulting MachineInstr. 321fe0b81759d207072ae468f5154f6a513c3a1be72Evan Cheng static unsigned CountOperands(SDNode *Node); 322fe0b81759d207072ae468f5154f6a513c3a1be72Evan Cheng 32342a77880a83b76112a1f42ce16b46dbde01cd0a8Dan Gohman /// ComputeMemOperandsEnd - Find the index one past the last 32442a77880a83b76112a1f42ce16b46dbde01cd0a8Dan Gohman /// MemOperandSDNode operand 32542a77880a83b76112a1f42ce16b46dbde01cd0a8Dan Gohman static unsigned ComputeMemOperandsEnd(SDNode *Node); 32669de1932b350d7cdfc0ed1f4198d6f78c7822a02Dan Gohman 3274ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng /// EmitNode - Generate machine code for an node and needed dependencies. 3287593639df672018d90331774f45b5ef06da2f385Chris Lattner /// VRBaseMap contains, for each already emitted node, the first virtual 3297593639df672018d90331774f45b5ef06da2f385Chris Lattner /// register number for the results of the node. 3304ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng /// 331a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng void EmitNode(SDNode *Node, unsigned InstNo, 332a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng DenseMap<SDOperand, unsigned> &VRBaseMap); 333202bc85a9508de5b5f24cfbac060e17ea2f5f8dcChris Lattner 334202bc85a9508de5b5f24cfbac060e17ea2f5f8dcChris Lattner /// EmitNoop - Emit a noop instruction. 335202bc85a9508de5b5f24cfbac060e17ea2f5f8dcChris Lattner /// 336202bc85a9508de5b5f24cfbac060e17ea2f5f8dcChris Lattner void EmitNoop(); 3378409747efadda025aa3cce626b1a2c33429fd5e5Evan Cheng 3388ed3ffee53105275ca03f06ba0195bc6008477faEvan Cheng void EmitCrossRCCopy(SUnit *SU, DenseMap<SUnit*, unsigned> &VRBaseMap); 3398ed3ffee53105275ca03f06ba0195bc6008477faEvan Cheng 3408409747efadda025aa3cce626b1a2c33429fd5e5Evan Cheng /// EmitCopyFromReg - Generate machine code for an CopyFromReg node or an 3418409747efadda025aa3cce626b1a2c33429fd5e5Evan Cheng /// implicit physical register output. 342a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng void EmitCopyFromReg(SDNode *Node, unsigned ResNo, unsigned InstNo, 343a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng unsigned SrcReg, 3448409747efadda025aa3cce626b1a2c33429fd5e5Evan Cheng DenseMap<SDOperand, unsigned> &VRBaseMap); 345202bc85a9508de5b5f24cfbac060e17ea2f5f8dcChris Lattner 3468409747efadda025aa3cce626b1a2c33429fd5e5Evan Cheng void CreateVirtualRegisters(SDNode *Node, MachineInstr *MI, 347749c6f6b5ed301c84aac562e414486549d7b98ebChris Lattner const TargetInstrDesc &II, 3488409747efadda025aa3cce626b1a2c33429fd5e5Evan Cheng DenseMap<SDOperand, unsigned> &VRBaseMap); 3498409747efadda025aa3cce626b1a2c33429fd5e5Evan Cheng 350e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng void EmitSchedule(); 351e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng 352e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng void dumpSchedule() const; 3534ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 3544ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng /// Schedule - Order nodes according to selected style. 3554ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng /// 356202bc85a9508de5b5f24cfbac060e17ea2f5f8dcChris Lattner virtual void Schedule() {} 357a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 358a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng private: 359e24f8f1ec9277dc80ebf38f0d914053f8c31caf1Christopher Lamb /// EmitSubregNode - Generate machine code for subreg nodes. 360e24f8f1ec9277dc80ebf38f0d914053f8c31caf1Christopher Lamb /// 361e24f8f1ec9277dc80ebf38f0d914053f8c31caf1Christopher Lamb void EmitSubregNode(SDNode *Node, 362e24f8f1ec9277dc80ebf38f0d914053f8c31caf1Christopher Lamb DenseMap<SDOperand, unsigned> &VRBaseMap); 363e24f8f1ec9277dc80ebf38f0d914053f8c31caf1Christopher Lamb 3643c2da661b6886dc430cffe1e0358bc08995b0125Chris Lattner void AddOperand(MachineInstr *MI, SDOperand Op, unsigned IIOpNum, 365749c6f6b5ed301c84aac562e414486549d7b98ebChris Lattner const TargetInstrDesc *II, 366af825c840ebc4ca5248c62325b2371091c9fb4b4Evan Cheng DenseMap<SDOperand, unsigned> &VRBaseMap); 36769de1932b350d7cdfc0ed1f4198d6f78c7822a02Dan Gohman 36869de1932b350d7cdfc0ed1f4198d6f78c7822a02Dan Gohman void AddMemOperand(MachineInstr *MI, const MemOperand &MO); 369a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng }; 370a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 371f0f9c90204c650b9f3c3feb02ccfcb1e40c6acddEvan Cheng /// createBURRListDAGScheduler - This creates a bottom up register usage 372f0f9c90204c650b9f3c3feb02ccfcb1e40c6acddEvan Cheng /// reduction list scheduler. 3739ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey ScheduleDAG* createBURRListDAGScheduler(SelectionDAGISel *IS, 3749ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey SelectionDAG *DAG, 375f0f9c90204c650b9f3c3feb02ccfcb1e40c6acddEvan Cheng MachineBasicBlock *BB); 37620614b956257d8702736ede13762385972cf4e43Chris Lattner 377e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// createTDRRListDAGScheduler - This creates a top down register usage 378e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// reduction list scheduler. 3799ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey ScheduleDAG* createTDRRListDAGScheduler(SelectionDAGISel *IS, 3809ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey SelectionDAG *DAG, 381e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng MachineBasicBlock *BB); 382e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng 38337e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// createTDListDAGScheduler - This creates a top-down list scheduler with 38413ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey /// a hazard recognizer. 3859ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey ScheduleDAG* createTDListDAGScheduler(SelectionDAGISel *IS, 3869ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey SelectionDAG *DAG, 38713ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey MachineBasicBlock *BB); 38813ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 3899373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// createDefaultScheduler - This creates an instruction scheduler appropriate 3909373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// for the target. 3919373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey ScheduleDAG* createDefaultScheduler(SelectionDAGISel *IS, 3929373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey SelectionDAG *DAG, 3939373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey MachineBasicBlock *BB); 3943e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 3953e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman class SUnitIterator : public forward_iterator<SUnit, ptrdiff_t> { 3963e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman SUnit *Node; 3973e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman unsigned Operand; 3983e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 3993e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman SUnitIterator(SUnit *N, unsigned Op) : Node(N), Operand(Op) {} 4003e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman public: 4013e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman bool operator==(const SUnitIterator& x) const { 4023e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman return Operand == x.Operand; 4033e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman } 4043e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman bool operator!=(const SUnitIterator& x) const { return !operator==(x); } 4053e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 4063e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman const SUnitIterator &operator=(const SUnitIterator &I) { 4073e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman assert(I.Node == Node && "Cannot assign iterators to two different nodes!"); 4083e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman Operand = I.Operand; 4093e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman return *this; 4103e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman } 4113e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 4123e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman pointer operator*() const { 413713a98dee8ab07a3066d1707a07648d27dd0c19cEvan Cheng return Node->Preds[Operand].Dep; 4143e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman } 4153e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman pointer operator->() const { return operator*(); } 4163e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 4173e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman SUnitIterator& operator++() { // Preincrement 4183e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman ++Operand; 4193e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman return *this; 4203e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman } 4213e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman SUnitIterator operator++(int) { // Postincrement 4223e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman SUnitIterator tmp = *this; ++*this; return tmp; 4233e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman } 4243e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 4253e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman static SUnitIterator begin(SUnit *N) { return SUnitIterator(N, 0); } 4263e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman static SUnitIterator end (SUnit *N) { 4273e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman return SUnitIterator(N, N->Preds.size()); 4283e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman } 4293e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 4303e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman unsigned getOperand() const { return Operand; } 4313e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman const SUnit *getNode() const { return Node; } 432713a98dee8ab07a3066d1707a07648d27dd0c19cEvan Cheng bool isCtrlDep() const { return Node->Preds[Operand].isCtrl; } 4333e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman }; 4343e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 4353e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman template <> struct GraphTraits<SUnit*> { 4363e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman typedef SUnit NodeType; 4373e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman typedef SUnitIterator ChildIteratorType; 4383e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman static inline NodeType *getEntryNode(SUnit *N) { return N; } 4393e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman static inline ChildIteratorType child_begin(NodeType *N) { 4403e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman return SUnitIterator::begin(N); 4413e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman } 4423e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman static inline ChildIteratorType child_end(NodeType *N) { 4433e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman return SUnitIterator::end(N); 4443e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman } 4453e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman }; 4463e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 4473e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman template <> struct GraphTraits<ScheduleDAG*> : public GraphTraits<SUnit*> { 4483e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman typedef std::vector<SUnit>::iterator nodes_iterator; 4493e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman static nodes_iterator nodes_begin(ScheduleDAG *G) { 4503e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman return G->SUnits.begin(); 4513e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman } 4523e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman static nodes_iterator nodes_end(ScheduleDAG *G) { 4533e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman return G->SUnits.end(); 4543e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman } 4553e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman }; 456a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng} 457a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 458a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng#endif 459