ScheduleDAG.h revision 7d1cd3f21d68179f4ebf4ee18fb7a0ddca9c5a37
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 189e23336d0c99fc5cae04037ead6d8f2b677e8764Evan Cheng#include "llvm/CodeGen/MachineBasicBlock.h" 19a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng#include "llvm/CodeGen/SelectionDAG.h" 202ba528b3a75955c960347e5b5b28ae74d5a81909Chris Lattner#include "llvm/ADT/DenseMap.h" 213e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman#include "llvm/ADT/GraphTraits.h" 2294c002a190cd2e3a52b1510bc997e53d63af0b3bChris Lattner#include "llvm/ADT/SmallSet.h" 23e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng 24a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengnamespace llvm { 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; 323cc6243ddfdba3ad64035b919c88b09773a60880Dan Gohman class ScheduleDAG; 33a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng class SelectionDAG; 349ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey class SelectionDAGISel; 35a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng class TargetInstrInfo; 36749c6f6b5ed301c84aac562e414486549d7b98ebChris Lattner class TargetInstrDesc; 378a50f1fcf0147d4ba959dc48066ddf281d5bc7e6Evan Cheng class TargetLowering; 38a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng class TargetMachine; 398ed3ffee53105275ca03f06ba0195bc6008477faEvan Cheng class TargetRegisterClass; 40a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 4137e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// HazardRecognizer - This determines whether or not an instruction can be 4237e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// issued this cycle, and whether or not a noop needs to be inserted to handle 4337e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// the hazard. 4437e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner class HazardRecognizer { 4537e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner public: 4637e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner virtual ~HazardRecognizer(); 4737e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner 4837e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner enum HazardType { 4937e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner NoHazard, // This instruction can be emitted at this cycle. 5037e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner Hazard, // This instruction can't be emitted at this cycle. 51d74ea2bbd8bb630331f35ead42d385249bd42af8Chris Lattner NoopHazard // This instruction can't be emitted, and needs noops. 5237e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner }; 5337e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner 5437e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// getHazardType - Return the hazard type of emitting this node. There are 5537e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// three possible results. Either: 5637e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// * NoHazard: it is legal to issue this instruction on this cycle. 5737e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// * Hazard: issuing this instruction would stall the machine. If some 5837e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// other instruction is available, issue it first. 5937e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// * NoopHazard: issuing this instruction would break the program. If 6037e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// some other instruction can be issued, do so, otherwise issue a noop. 6113d57320bd212483463d4f8992d5787b29eda5dfBill Wendling virtual HazardType getHazardType(SDNode *) { 6237e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner return NoHazard; 6337e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner } 6437e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner 6537e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// EmitInstruction - This callback is invoked when an instruction is 6637e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// emitted, to advance the hazard state. 6713d57320bd212483463d4f8992d5787b29eda5dfBill Wendling virtual void EmitInstruction(SDNode *) {} 6837e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner 6937e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// AdvanceCycle - This callback is invoked when no instructions can be 7037e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// issued on this cycle without a hazard. This should increment the 7137e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// internal state of the hazard recognizer so that previously "Hazard" 7237e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// instructions will now not be hazards. 7313d57320bd212483463d4f8992d5787b29eda5dfBill Wendling virtual void AdvanceCycle() {} 7437e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner 7537e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// EmitNoop - This callback is invoked when a noop was added to the 7637e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// instruction stream. 7713d57320bd212483463d4f8992d5787b29eda5dfBill Wendling virtual void EmitNoop() {} 784ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng }; 79713a98dee8ab07a3066d1707a07648d27dd0c19cEvan Cheng 80713a98dee8ab07a3066d1707a07648d27dd0c19cEvan Cheng /// SDep - Scheduling dependency. It keeps track of dependent nodes, 81713a98dee8ab07a3066d1707a07648d27dd0c19cEvan Cheng /// cost of the depdenency, etc. 82713a98dee8ab07a3066d1707a07648d27dd0c19cEvan Cheng struct SDep { 83a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng SUnit *Dep; // Dependent - either a predecessor or a successor. 84a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng unsigned Reg; // If non-zero, this dep is a phy register dependency. 85a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng int Cost; // Cost of the dependency. 86a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng bool isCtrl : 1; // True iff it's a control dependency. 87a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng bool isSpecial : 1; // True iff it's a special ctrl dep added during sched. 88a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng SDep(SUnit *d, unsigned r, int t, bool c, bool s) 89a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng : Dep(d), Reg(r), Cost(t), isCtrl(c), isSpecial(s) {} 90713a98dee8ab07a3066d1707a07648d27dd0c19cEvan Cheng }; 91713a98dee8ab07a3066d1707a07648d27dd0c19cEvan Cheng 92e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// SUnit - Scheduling unit. It's an wrapper around either a single SDNode or 93e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// a group of nodes flagged together. 94e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng struct SUnit { 95550f5afb68ce8f034991863cac65bef22a6554daDan Gohman private: 96e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng SDNode *Node; // Representative node. 97f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman MachineInstr *Instr; // Alternatively, a MachineInstr. 98550f5afb68ce8f034991863cac65bef22a6554daDan Gohman public: 994c8c83022b501759d8559e224c84ae2a9921ba41Dan Gohman SUnit *OrigNode; // If not this, the node from which 1004c8c83022b501759d8559e224c84ae2a9921ba41Dan Gohman // this node was cloned. 101e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng 102e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng // Preds/Succs - The SUnits before/after us in the graph. The boolean value 103e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng // is true if the edge is a token chain edge, false if it is a value edge. 104713a98dee8ab07a3066d1707a07648d27dd0c19cEvan Cheng SmallVector<SDep, 4> Preds; // All sunit predecessors. 105713a98dee8ab07a3066d1707a07648d27dd0c19cEvan Cheng SmallVector<SDep, 4> Succs; // All sunit successors. 106713a98dee8ab07a3066d1707a07648d27dd0c19cEvan Cheng 107713a98dee8ab07a3066d1707a07648d27dd0c19cEvan Cheng typedef SmallVector<SDep, 4>::iterator pred_iterator; 108713a98dee8ab07a3066d1707a07648d27dd0c19cEvan Cheng typedef SmallVector<SDep, 4>::iterator succ_iterator; 109713a98dee8ab07a3066d1707a07648d27dd0c19cEvan Cheng typedef SmallVector<SDep, 4>::const_iterator const_pred_iterator; 110713a98dee8ab07a3066d1707a07648d27dd0c19cEvan Cheng typedef SmallVector<SDep, 4>::const_iterator const_succ_iterator; 111228a18e0f220fb85ee06fd5bfa29304e57047ff1Chris Lattner 112a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng unsigned NodeNum; // Entry # of node in the node vector. 113a0201d52049be8dcefffe4304a49690a831bcb34Roman Levenstein unsigned NodeQueueId; // Queue id of node. 114a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng unsigned short Latency; // Node latency. 115ae78a88e12fa3d5f0cdb723cf009dfd71eb35a70Dan Gohman short NumPreds; // # of non-control preds. 116ae78a88e12fa3d5f0cdb723cf009dfd71eb35a70Dan Gohman short NumSuccs; // # of non-control sucss. 117e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng short NumPredsLeft; // # of preds not scheduled. 118e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng short NumSuccsLeft; // # of succs not scheduled. 119e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng bool isTwoAddress : 1; // Is a two-address instruction. 12013d41b9d721f98372b97d2ec119e6c91932ab0aeEvan Cheng bool isCommutable : 1; // Is a commutable instruction. 121f10c973797cf79da802f9b0118543cbd50954c9cEvan Cheng bool hasPhysRegDefs : 1; // Has physreg defs that are being used. 122e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng bool isPending : 1; // True once pending. 123e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng bool isAvailable : 1; // True once available. 124e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng bool isScheduled : 1; // True once scheduled. 125e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng unsigned CycleBound; // Upper/lower cycle to be scheduled at. 126e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng unsigned Cycle; // Once scheduled, the cycle of the op. 127e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng unsigned Depth; // Node depth; 128e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng unsigned Height; // Node height; 1298ed3ffee53105275ca03f06ba0195bc6008477faEvan Cheng const TargetRegisterClass *CopyDstRC; // Is a special copy node if not null. 1308ed3ffee53105275ca03f06ba0195bc6008477faEvan Cheng const TargetRegisterClass *CopySrcRC; 131e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng 132f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman /// SUnit - Construct an SUnit for pre-regalloc scheduling to represent 133f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman /// an SDNode and any nodes flagged to it. 134e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng SUnit(SDNode *node, unsigned nodenum) 135f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman : Node(node), Instr(0), OrigNode(0), NodeNum(nodenum), NodeQueueId(0), 136f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman Latency(0), NumPreds(0), NumSuccs(0), NumPredsLeft(0), NumSuccsLeft(0), 137f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman isTwoAddress(false), isCommutable(false), hasPhysRegDefs(false), 138f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman isPending(false), isAvailable(false), isScheduled(false), 139f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman CycleBound(0), Cycle(0), Depth(0), Height(0), 140f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman CopyDstRC(NULL), CopySrcRC(NULL) {} 141f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman 142f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman /// SUnit - Construct an SUnit for post-regalloc scheduling to represent 143f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman /// a MachineInstr. 144f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman SUnit(MachineInstr *instr, unsigned nodenum) 145f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman : Node(0), Instr(instr), OrigNode(0), NodeNum(nodenum), NodeQueueId(0), 146f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman Latency(0), NumPreds(0), NumSuccs(0), NumPredsLeft(0), NumSuccsLeft(0), 14722a529990bb4bb86bdb2ae1cfce7340320a6ca7fEvan Cheng isTwoAddress(false), isCommutable(false), hasPhysRegDefs(false), 148e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng isPending(false), isAvailable(false), isScheduled(false), 1498ed3ffee53105275ca03f06ba0195bc6008477faEvan Cheng CycleBound(0), Cycle(0), Depth(0), Height(0), 1508ed3ffee53105275ca03f06ba0195bc6008477faEvan Cheng CopyDstRC(NULL), CopySrcRC(NULL) {} 151a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng 152550f5afb68ce8f034991863cac65bef22a6554daDan Gohman /// setNode - Assign the representative SDNode for this SUnit. 153f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman /// This may be used during pre-regalloc scheduling. 154f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman void setNode(SDNode *N) { 155f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman assert(!Instr && "Setting SDNode of SUnit with MachineInstr!"); 156f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman Node = N; 157f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman } 158550f5afb68ce8f034991863cac65bef22a6554daDan Gohman 159550f5afb68ce8f034991863cac65bef22a6554daDan Gohman /// getNode - Return the representative SDNode for this SUnit. 160f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman /// This may be used during pre-regalloc scheduling. 161f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman SDNode *getNode() const { 162f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman assert(!Instr && "Reading SDNode of SUnit with MachineInstr!"); 163f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman return Node; 164f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman } 165f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman 166f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman /// setInstr - Assign the instruction for the SUnit. 167f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman /// This may be used during post-regalloc scheduling. 168f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman void setInstr(MachineInstr *MI) { 169f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman assert(!Node && "Setting MachineInstr of SUnit with SDNode!"); 170f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman Instr = MI; 171f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman } 172f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman 173f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman /// getInstr - Return the representative MachineInstr for this SUnit. 174f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman /// This may be used during post-regalloc scheduling. 175f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman MachineInstr *getInstr() const { 176f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman assert(!Node && "Reading MachineInstr of SUnit with SDNode!"); 177f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman return Instr; 178f449bf36ef5cb8e23fa2b5bc43f8d54d2b48fa4eDan Gohman } 179550f5afb68ce8f034991863cac65bef22a6554daDan Gohman 180228a18e0f220fb85ee06fd5bfa29304e57047ff1Chris Lattner /// addPred - This adds the specified node as a pred of the current node if 181228a18e0f220fb85ee06fd5bfa29304e57047ff1Chris Lattner /// not already. This returns true if this is a new pred. 182a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng bool addPred(SUnit *N, bool isCtrl, bool isSpecial, 183a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng unsigned PhyReg = 0, int Cost = 1) { 18434cd4a484e532cc463fd5a4bf59b88d13c5467c1Evan Cheng for (unsigned i = 0, e = (unsigned)Preds.size(); i != e; ++i) 185a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng if (Preds[i].Dep == N && 186a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng Preds[i].isCtrl == isCtrl && Preds[i].isSpecial == isSpecial) 187228a18e0f220fb85ee06fd5bfa29304e57047ff1Chris Lattner return false; 188a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng Preds.push_back(SDep(N, PhyReg, Cost, isCtrl, isSpecial)); 189a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng N->Succs.push_back(SDep(this, PhyReg, Cost, isCtrl, isSpecial)); 19074d2fd8dd847e0ebccef30e2c5907ff09495d518Evan Cheng if (!isCtrl) { 191a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng ++NumPreds; 192a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng ++N->NumSuccs; 193a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng } 19474d2fd8dd847e0ebccef30e2c5907ff09495d518Evan Cheng if (!N->isScheduled) 19574d2fd8dd847e0ebccef30e2c5907ff09495d518Evan Cheng ++NumPredsLeft; 19674d2fd8dd847e0ebccef30e2c5907ff09495d518Evan Cheng if (!isScheduled) 19774d2fd8dd847e0ebccef30e2c5907ff09495d518Evan Cheng ++N->NumSuccsLeft; 198228a18e0f220fb85ee06fd5bfa29304e57047ff1Chris Lattner return true; 199228a18e0f220fb85ee06fd5bfa29304e57047ff1Chris Lattner } 200228a18e0f220fb85ee06fd5bfa29304e57047ff1Chris Lattner 201a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng bool removePred(SUnit *N, bool isCtrl, bool isSpecial) { 202a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng for (SmallVector<SDep, 4>::iterator I = Preds.begin(), E = Preds.end(); 203a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng I != E; ++I) 204a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng if (I->Dep == N && I->isCtrl == isCtrl && I->isSpecial == isSpecial) { 205a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng bool FoundSucc = false; 206a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng for (SmallVector<SDep, 4>::iterator II = N->Succs.begin(), 207a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng EE = N->Succs.end(); II != EE; ++II) 208a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng if (II->Dep == this && 209a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng II->isCtrl == isCtrl && II->isSpecial == isSpecial) { 210a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng FoundSucc = true; 211a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng N->Succs.erase(II); 212a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng break; 213a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng } 214a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng assert(FoundSucc && "Mismatching preds / succs lists!"); 215a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng Preds.erase(I); 21674d2fd8dd847e0ebccef30e2c5907ff09495d518Evan Cheng if (!isCtrl) { 217a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng --NumPreds; 218a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng --N->NumSuccs; 219a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng } 22074d2fd8dd847e0ebccef30e2c5907ff09495d518Evan Cheng if (!N->isScheduled) 22174d2fd8dd847e0ebccef30e2c5907ff09495d518Evan Cheng --NumPredsLeft; 22274d2fd8dd847e0ebccef30e2c5907ff09495d518Evan Cheng if (!isScheduled) 22374d2fd8dd847e0ebccef30e2c5907ff09495d518Evan Cheng --N->NumSuccsLeft; 224a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng return true; 225a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng } 226a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng return false; 227a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng } 228a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng 229a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng bool isPred(SUnit *N) { 23034cd4a484e532cc463fd5a4bf59b88d13c5467c1Evan Cheng for (unsigned i = 0, e = (unsigned)Preds.size(); i != e; ++i) 231a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng if (Preds[i].Dep == N) 232a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng return true; 233a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng return false; 234a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng } 235a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng 236a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng bool isSucc(SUnit *N) { 23734cd4a484e532cc463fd5a4bf59b88d13c5467c1Evan Cheng for (unsigned i = 0, e = (unsigned)Succs.size(); i != e; ++i) 238a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng if (Succs[i].Dep == N) 239a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng return true; 240a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng return false; 241228a18e0f220fb85ee06fd5bfa29304e57047ff1Chris Lattner } 242228a18e0f220fb85ee06fd5bfa29304e57047ff1Chris Lattner 2433cc6243ddfdba3ad64035b919c88b09773a60880Dan Gohman void dump(const ScheduleDAG *G) const; 2443cc6243ddfdba3ad64035b919c88b09773a60880Dan Gohman void dumpAll(const ScheduleDAG *G) const; 245252ae9e8ae4efaf1f67a608ad2563323308bd803Dan Gohman void print(raw_ostream &O, const ScheduleDAG *G) const; 246e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng }; 247e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng 248e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng //===--------------------------------------------------------------------===// 249e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// SchedulingPriorityQueue - This interface is used to plug different 250e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// priorities computation algorithms into the list scheduler. It implements 251e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// the interface of a standard priority queue, where nodes are inserted in 252e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// arbitrary order and returned in priority order. The computation of the 253e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// priority and the representation of the queue are totally up to the 254e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// implementation to decide. 255e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// 256e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng class SchedulingPriorityQueue { 257e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng public: 258e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng virtual ~SchedulingPriorityQueue() {} 259e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng 26094d7a5f8156e62532870fbaf197377b34e52ff2aDan Gohman virtual void initNodes(std::vector<SUnit> &SUnits) = 0; 261a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng virtual void addNode(const SUnit *SU) = 0; 262a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng virtual void updateNode(const SUnit *SU) = 0; 263e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng virtual void releaseState() = 0; 264a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng 265a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng virtual unsigned size() const = 0; 266e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng virtual bool empty() const = 0; 267e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng virtual void push(SUnit *U) = 0; 268e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng 269e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng virtual void push_all(const std::vector<SUnit *> &Nodes) = 0; 270e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng virtual SUnit *pop() = 0; 271e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng 272a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng virtual void remove(SUnit *SU) = 0; 273a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng 274e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// ScheduledNode - As each node is scheduled, this method is invoked. This 275a0b50d7f0dd965b4269cce198cab395e2c2be900Dan Gohman /// allows the priority function to adjust the priority of related 276a0b50d7f0dd965b4269cce198cab395e2c2be900Dan Gohman /// unscheduled nodes, for example. 277a0b50d7f0dd965b4269cce198cab395e2c2be900Dan Gohman /// 27813d57320bd212483463d4f8992d5787b29eda5dfBill Wendling virtual void ScheduledNode(SUnit *) {} 279a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng 28013d57320bd212483463d4f8992d5787b29eda5dfBill Wendling virtual void UnscheduledNode(SUnit *) {} 281e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng }; 282e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng 283a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng class ScheduleDAG { 284a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng public: 285a23b3b803e3c65e84d6cadaa221de8b256cbe28dDan Gohman SelectionDAG *DAG; // DAG of the current basic block 286a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng MachineBasicBlock *BB; // Current basic block 287a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng const TargetMachine &TM; // Target processor 288a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng const TargetInstrInfo *TII; // Target instruction information 2896f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman const TargetRegisterInfo *TRI; // Target processor register info 2908a50f1fcf0147d4ba959dc48066ddf281d5bc7e6Evan Cheng TargetLowering *TLI; // Target lowering info 2916b2cf285bd43fdc98ca68df477570ef6938d4fb2Evan Cheng MachineFunction *MF; // Machine function 2929e23336d0c99fc5cae04037ead6d8f2b677e8764Evan Cheng MachineRegisterInfo &MRI; // Virtual/real register map 293a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng MachineConstantPool *ConstPool; // Target constant pool 29413d41b9d721f98372b97d2ec119e6c91932ab0aeEvan Cheng std::vector<SUnit*> Sequence; // The schedule. Null SUnit*'s 29513d41b9d721f98372b97d2ec119e6c91932ab0aeEvan Cheng // represent noop instructions. 296e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng std::vector<SUnit> SUnits; // The scheduling units. 297b1e07ec6a43383ce0baa42e2f139550cc540f631Dan Gohman SmallSet<SDNode*, 16> CommuteSet; // Nodes that should be commuted. 298a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 299a23b3b803e3c65e84d6cadaa221de8b256cbe28dDan Gohman ScheduleDAG(SelectionDAG *dag, MachineBasicBlock *bb, 30084bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner const TargetMachine &tm); 301cccf1232a69e2d78516c61a97e7bfa26acefb714Evan Cheng 30237cb415eec53e20ed77c1c90f86310de217f3e6cChris Lattner virtual ~ScheduleDAG() {} 303a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 3043e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman /// viewGraph - Pop up a GraphViz/gv window with the ScheduleDAG rendered 3053e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman /// using 'dot'. 3063e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman /// 3073e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman void viewGraph(); 3083e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 309a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng /// Run - perform scheduling. 310a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng /// 3115e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman void Run(); 312a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 3134ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng /// isPassiveNode - Return true if the node is a non-scheduled leaf. 3144ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng /// 3150993f1d8338ccf8552a1dbc3fb19461a5e6165d9Evan Cheng static bool isPassiveNode(SDNode *Node) { 3164ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng if (isa<ConstantSDNode>(Node)) return true; 317e179584f9b740cf3a36bde70f8cab40de59b8081Nate Begeman if (isa<ConstantFPSDNode>(Node)) return true; 3184ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng if (isa<RegisterSDNode>(Node)) return true; 3194ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng if (isa<GlobalAddressSDNode>(Node)) return true; 3204ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng if (isa<BasicBlockSDNode>(Node)) return true; 3214ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng if (isa<FrameIndexSDNode>(Node)) return true; 3224ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng if (isa<ConstantPoolSDNode>(Node)) return true; 32337efe6764568a3829fee26aba532283131d1a104Nate Begeman if (isa<JumpTableSDNode>(Node)) return true; 324056292fd738924f3f7703725d8f630983794b5a5Bill Wendling if (isa<ExternalSymbolSDNode>(Node)) return true; 32569de1932b350d7cdfc0ed1f4198d6f78c7822a02Dan Gohman if (isa<MemOperandSDNode>(Node)) return true; 32680792f3ddec43aff7f0758c9096f8cb53dcc1e40Dan Gohman if (Node->getOpcode() == ISD::EntryToken) return true; 3274ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng return false; 3284ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng } 3294ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 330e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// NewSUnit - Creates a new SUnit and return a ptr to it. 331e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// 332e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng SUnit *NewSUnit(SDNode *N) { 33334cd4a484e532cc463fd5a4bf59b88d13c5467c1Evan Cheng SUnits.push_back(SUnit(N, (unsigned)SUnits.size())); 3344c8c83022b501759d8559e224c84ae2a9921ba41Dan Gohman SUnits.back().OrigNode = &SUnits.back(); 335e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng return &SUnits.back(); 336e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng } 337e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng 33859d5f1d13babee143957686003db06f605d05ba2Dan Gohman /// NewSUnit - Creates a new SUnit and return a ptr to it. 33959d5f1d13babee143957686003db06f605d05ba2Dan Gohman /// 34059d5f1d13babee143957686003db06f605d05ba2Dan Gohman SUnit *NewSUnit(MachineInstr *MI) { 34159d5f1d13babee143957686003db06f605d05ba2Dan Gohman SUnits.push_back(SUnit(MI, (unsigned)SUnits.size())); 34259d5f1d13babee143957686003db06f605d05ba2Dan Gohman SUnits.back().OrigNode = &SUnits.back(); 34359d5f1d13babee143957686003db06f605d05ba2Dan Gohman return &SUnits.back(); 34459d5f1d13babee143957686003db06f605d05ba2Dan Gohman } 34559d5f1d13babee143957686003db06f605d05ba2Dan Gohman 346a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng /// Clone - Creates a clone of the specified SUnit. It does not copy the 347a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng /// predecessors / successors info nor the temporary scheduling states. 348a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng SUnit *Clone(SUnit *N); 349a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng 350e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// BuildSchedUnits - Build SUnits from the selection dag that we are input. 351e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// This SUnit graph is similar to the SelectionDAG, but represents flagged 352e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// together nodes with a single SUnit. 353e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng void BuildSchedUnits(); 354e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng 355f10c973797cf79da802f9b0118543cbd50954c9cEvan Cheng /// ComputeLatency - Compute node latency. 356f10c973797cf79da802f9b0118543cbd50954c9cEvan Cheng /// 357f10c973797cf79da802f9b0118543cbd50954c9cEvan Cheng void ComputeLatency(SUnit *SU); 358f10c973797cf79da802f9b0118543cbd50954c9cEvan Cheng 359e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// CalculateDepths, CalculateHeights - Calculate node depth / height. 360e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// 361e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng void CalculateDepths(); 362e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng void CalculateHeights(); 363e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng 364fe0b81759d207072ae468f5154f6a513c3a1be72Evan Cheng /// CountResults - The results of target nodes have register or immediate 365fe0b81759d207072ae468f5154f6a513c3a1be72Evan Cheng /// operands first, then an optional chain, and optional flag operands 366fe0b81759d207072ae468f5154f6a513c3a1be72Evan Cheng /// (which do not go into the machine instrs.) 367fe0b81759d207072ae468f5154f6a513c3a1be72Evan Cheng static unsigned CountResults(SDNode *Node); 368fe0b81759d207072ae468f5154f6a513c3a1be72Evan Cheng 36969de1932b350d7cdfc0ed1f4198d6f78c7822a02Dan Gohman /// CountOperands - The inputs to target nodes have any actual inputs first, 37042a77880a83b76112a1f42ce16b46dbde01cd0a8Dan Gohman /// followed by special operands that describe memory references, then an 37142a77880a83b76112a1f42ce16b46dbde01cd0a8Dan Gohman /// optional chain operand, then flag operands. Compute the number of 37242a77880a83b76112a1f42ce16b46dbde01cd0a8Dan Gohman /// actual operands that will go into the resulting MachineInstr. 373fe0b81759d207072ae468f5154f6a513c3a1be72Evan Cheng static unsigned CountOperands(SDNode *Node); 374fe0b81759d207072ae468f5154f6a513c3a1be72Evan Cheng 37542a77880a83b76112a1f42ce16b46dbde01cd0a8Dan Gohman /// ComputeMemOperandsEnd - Find the index one past the last 37642a77880a83b76112a1f42ce16b46dbde01cd0a8Dan Gohman /// MemOperandSDNode operand 37742a77880a83b76112a1f42ce16b46dbde01cd0a8Dan Gohman static unsigned ComputeMemOperandsEnd(SDNode *Node); 37869de1932b350d7cdfc0ed1f4198d6f78c7822a02Dan Gohman 3794ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng /// EmitNode - Generate machine code for an node and needed dependencies. 3807593639df672018d90331774f45b5ef06da2f385Chris Lattner /// VRBaseMap contains, for each already emitted node, the first virtual 3817593639df672018d90331774f45b5ef06da2f385Chris Lattner /// register number for the results of the node. 3824ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng /// 3834c8c83022b501759d8559e224c84ae2a9921ba41Dan Gohman void EmitNode(SDNode *Node, bool IsClone, 384475871a144eb604ddaf37503397ba0941442e5fbDan Gohman DenseMap<SDValue, unsigned> &VRBaseMap); 385202bc85a9508de5b5f24cfbac060e17ea2f5f8dcChris Lattner 386202bc85a9508de5b5f24cfbac060e17ea2f5f8dcChris Lattner /// EmitNoop - Emit a noop instruction. 387202bc85a9508de5b5f24cfbac060e17ea2f5f8dcChris Lattner /// 388202bc85a9508de5b5f24cfbac060e17ea2f5f8dcChris Lattner void EmitNoop(); 3898409747efadda025aa3cce626b1a2c33429fd5e5Evan Cheng 3905e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman MachineBasicBlock *EmitSchedule(); 3918a50f1fcf0147d4ba959dc48066ddf281d5bc7e6Evan Cheng 3928a50f1fcf0147d4ba959dc48066ddf281d5bc7e6Evan Cheng void dumpSchedule() const; 3938a50f1fcf0147d4ba959dc48066ddf281d5bc7e6Evan Cheng 394a0b50d7f0dd965b4269cce198cab395e2c2be900Dan Gohman /// Schedule - Order nodes according to selected style, filling 395a0b50d7f0dd965b4269cce198cab395e2c2be900Dan Gohman /// in the Sequence member. 3968a50f1fcf0147d4ba959dc48066ddf281d5bc7e6Evan Cheng /// 397a0b50d7f0dd965b4269cce198cab395e2c2be900Dan Gohman virtual void Schedule() = 0; 3988a50f1fcf0147d4ba959dc48066ddf281d5bc7e6Evan Cheng 3997d1cd3f21d68179f4ebf4ee18fb7a0ddca9c5a37Dan Gohman /// getGraphpNodeLabel - Return a label for an SUnit node in a Graphviz or similar 4007d1cd3f21d68179f4ebf4ee18fb7a0ddca9c5a37Dan Gohman /// graph visualization. 4017d1cd3f21d68179f4ebf4ee18fb7a0ddca9c5a37Dan Gohman virtual std::string getGraphNodeLabel(const SUnit *SU) const; 4027d1cd3f21d68179f4ebf4ee18fb7a0ddca9c5a37Dan Gohman 4038a50f1fcf0147d4ba959dc48066ddf281d5bc7e6Evan Cheng private: 4048a50f1fcf0147d4ba959dc48066ddf281d5bc7e6Evan Cheng /// EmitSubregNode - Generate machine code for subreg nodes. 4058a50f1fcf0147d4ba959dc48066ddf281d5bc7e6Evan Cheng /// 4068a50f1fcf0147d4ba959dc48066ddf281d5bc7e6Evan Cheng void EmitSubregNode(SDNode *Node, 407475871a144eb604ddaf37503397ba0941442e5fbDan Gohman DenseMap<SDValue, unsigned> &VRBaseMap); 4088a50f1fcf0147d4ba959dc48066ddf281d5bc7e6Evan Cheng 4098a50f1fcf0147d4ba959dc48066ddf281d5bc7e6Evan Cheng /// getVR - Return the virtual register corresponding to the specified result 4108a50f1fcf0147d4ba959dc48066ddf281d5bc7e6Evan Cheng /// of the specified node. 411475871a144eb604ddaf37503397ba0941442e5fbDan Gohman unsigned getVR(SDValue Op, DenseMap<SDValue, unsigned> &VRBaseMap); 4128a50f1fcf0147d4ba959dc48066ddf281d5bc7e6Evan Cheng 4138a50f1fcf0147d4ba959dc48066ddf281d5bc7e6Evan Cheng /// getDstOfCopyToRegUse - If the only use of the specified result number of 4148a50f1fcf0147d4ba959dc48066ddf281d5bc7e6Evan Cheng /// node is a CopyToReg, return its destination register. Return 0 otherwise. 4158a50f1fcf0147d4ba959dc48066ddf281d5bc7e6Evan Cheng unsigned getDstOfOnlyCopyToRegUse(SDNode *Node, unsigned ResNo) const; 4168a50f1fcf0147d4ba959dc48066ddf281d5bc7e6Evan Cheng 417475871a144eb604ddaf37503397ba0941442e5fbDan Gohman void AddOperand(MachineInstr *MI, SDValue Op, unsigned IIOpNum, 4188a50f1fcf0147d4ba959dc48066ddf281d5bc7e6Evan Cheng const TargetInstrDesc *II, 41986b49f8e2de796cb46c7c8b6a4c4900533fd53f4Dale Johannesen DenseMap<SDValue, unsigned> &VRBaseMap); 42036b5c1338a03453ba1c110b120269ca972fb65a3Dan Gohman void AddMemOperand(MachineInstr *MI, const MachineMemOperand &MO); 4218a50f1fcf0147d4ba959dc48066ddf281d5bc7e6Evan Cheng 4228ed3ffee53105275ca03f06ba0195bc6008477faEvan Cheng void EmitCrossRCCopy(SUnit *SU, DenseMap<SUnit*, unsigned> &VRBaseMap); 4238ed3ffee53105275ca03f06ba0195bc6008477faEvan Cheng 4248409747efadda025aa3cce626b1a2c33429fd5e5Evan Cheng /// EmitCopyFromReg - Generate machine code for an CopyFromReg node or an 4258409747efadda025aa3cce626b1a2c33429fd5e5Evan Cheng /// implicit physical register output. 4264c8c83022b501759d8559e224c84ae2a9921ba41Dan Gohman void EmitCopyFromReg(SDNode *Node, unsigned ResNo, bool IsClone, 427a6fb1b6743ee1411accf2d6e636f73f2ee0a7f5bEvan Cheng unsigned SrcReg, 428475871a144eb604ddaf37503397ba0941442e5fbDan Gohman DenseMap<SDValue, unsigned> &VRBaseMap); 429202bc85a9508de5b5f24cfbac060e17ea2f5f8dcChris Lattner 4308409747efadda025aa3cce626b1a2c33429fd5e5Evan Cheng void CreateVirtualRegisters(SDNode *Node, MachineInstr *MI, 431749c6f6b5ed301c84aac562e414486549d7b98ebChris Lattner const TargetInstrDesc &II, 432475871a144eb604ddaf37503397ba0941442e5fbDan Gohman DenseMap<SDValue, unsigned> &VRBaseMap); 4338409747efadda025aa3cce626b1a2c33429fd5e5Evan Cheng 4349e23336d0c99fc5cae04037ead6d8f2b677e8764Evan Cheng /// EmitLiveInCopy - Emit a copy for a live in physical register. If the 4359e23336d0c99fc5cae04037ead6d8f2b677e8764Evan Cheng /// physical register has only a single copy use, then coalesced the copy 4361090fc99cd63b78f5d672cf0914287656f746f98Evan Cheng /// if possible. 4371090fc99cd63b78f5d672cf0914287656f746f98Evan Cheng void EmitLiveInCopy(MachineBasicBlock *MBB, 4381090fc99cd63b78f5d672cf0914287656f746f98Evan Cheng MachineBasicBlock::iterator &InsertPos, 4391090fc99cd63b78f5d672cf0914287656f746f98Evan Cheng unsigned VirtReg, unsigned PhysReg, 4401090fc99cd63b78f5d672cf0914287656f746f98Evan Cheng const TargetRegisterClass *RC, 4411090fc99cd63b78f5d672cf0914287656f746f98Evan Cheng DenseMap<MachineInstr*, unsigned> &CopyRegMap); 4429e23336d0c99fc5cae04037ead6d8f2b677e8764Evan Cheng 4439e23336d0c99fc5cae04037ead6d8f2b677e8764Evan Cheng /// EmitLiveInCopies - If this is the first basic block in the function, 4449e23336d0c99fc5cae04037ead6d8f2b677e8764Evan Cheng /// and if it has live ins that need to be copied into vregs, emit the 4459e23336d0c99fc5cae04037ead6d8f2b677e8764Evan Cheng /// copies into the top of the block. 4469e23336d0c99fc5cae04037ead6d8f2b677e8764Evan Cheng void EmitLiveInCopies(MachineBasicBlock *MBB); 4477e6a1bc0fa35202ddfd2229821370d6061e3e1f9Dan Gohman 4487e6a1bc0fa35202ddfd2229821370d6061e3e1f9Dan Gohman /// BuildSchedUnitsFromMBB - Build SUnits from the MachineBasicBlock. 4497e6a1bc0fa35202ddfd2229821370d6061e3e1f9Dan Gohman /// This SUnit graph is similar to the pre-regalloc SUnit graph, but represents 4507e6a1bc0fa35202ddfd2229821370d6061e3e1f9Dan Gohman /// MachineInstrs directly instead of SDNodes. 4517e6a1bc0fa35202ddfd2229821370d6061e3e1f9Dan Gohman void BuildSchedUnitsFromMBB(); 452a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng }; 453a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 454f0f9c90204c650b9f3c3feb02ccfcb1e40c6acddEvan Cheng /// createBURRListDAGScheduler - This creates a bottom up register usage 455f0f9c90204c650b9f3c3feb02ccfcb1e40c6acddEvan Cheng /// reduction list scheduler. 4569ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey ScheduleDAG* createBURRListDAGScheduler(SelectionDAGISel *IS, 4579ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey SelectionDAG *DAG, 4589b75b373756288cd39489da7994207f50b31ee40Dan Gohman const TargetMachine *TM, 4594576f6d7a9c0f2c6a3b6c5d4d8a3063bbf763ae5Evan Cheng MachineBasicBlock *BB, 4604576f6d7a9c0f2c6a3b6c5d4d8a3063bbf763ae5Evan Cheng bool Fast); 46120614b956257d8702736ede13762385972cf4e43Chris Lattner 462e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// createTDRRListDAGScheduler - This creates a top down register usage 463e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng /// reduction list scheduler. 4649ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey ScheduleDAG* createTDRRListDAGScheduler(SelectionDAGISel *IS, 4659ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey SelectionDAG *DAG, 4669b75b373756288cd39489da7994207f50b31ee40Dan Gohman const TargetMachine *TM, 4674576f6d7a9c0f2c6a3b6c5d4d8a3063bbf763ae5Evan Cheng MachineBasicBlock *BB, 4684576f6d7a9c0f2c6a3b6c5d4d8a3063bbf763ae5Evan Cheng bool Fast); 469e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng 47037e30cf736f9975704f4994d4181fe65ebb7b76cChris Lattner /// createTDListDAGScheduler - This creates a top-down list scheduler with 47113ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey /// a hazard recognizer. 4729ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey ScheduleDAG* createTDListDAGScheduler(SelectionDAGISel *IS, 4739ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey SelectionDAG *DAG, 4749b75b373756288cd39489da7994207f50b31ee40Dan Gohman const TargetMachine *TM, 4754576f6d7a9c0f2c6a3b6c5d4d8a3063bbf763ae5Evan Cheng MachineBasicBlock *BB, 4764576f6d7a9c0f2c6a3b6c5d4d8a3063bbf763ae5Evan Cheng bool Fast); 47713ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 478ee2e4035450a2d0d6159831e9b9cfa3ffd8da8bcDan Gohman /// createFastDAGScheduler - This creates a "fast" scheduler. 479ee2e4035450a2d0d6159831e9b9cfa3ffd8da8bcDan Gohman /// 480ee2e4035450a2d0d6159831e9b9cfa3ffd8da8bcDan Gohman ScheduleDAG *createFastDAGScheduler(SelectionDAGISel *IS, 481ee2e4035450a2d0d6159831e9b9cfa3ffd8da8bcDan Gohman SelectionDAG *DAG, 4829b75b373756288cd39489da7994207f50b31ee40Dan Gohman const TargetMachine *TM, 483ee2e4035450a2d0d6159831e9b9cfa3ffd8da8bcDan Gohman MachineBasicBlock *BB, 484ee2e4035450a2d0d6159831e9b9cfa3ffd8da8bcDan Gohman bool Fast); 485ee2e4035450a2d0d6159831e9b9cfa3ffd8da8bcDan Gohman 4869373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// createDefaultScheduler - This creates an instruction scheduler appropriate 4879373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// for the target. 4889373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey ScheduleDAG* createDefaultScheduler(SelectionDAGISel *IS, 4899373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey SelectionDAG *DAG, 4909b75b373756288cd39489da7994207f50b31ee40Dan Gohman const TargetMachine *TM, 4914576f6d7a9c0f2c6a3b6c5d4d8a3063bbf763ae5Evan Cheng MachineBasicBlock *BB, 4924576f6d7a9c0f2c6a3b6c5d4d8a3063bbf763ae5Evan Cheng bool Fast); 4933e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 4943e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman class SUnitIterator : public forward_iterator<SUnit, ptrdiff_t> { 4953e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman SUnit *Node; 4963e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman unsigned Operand; 4973e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 4983e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman SUnitIterator(SUnit *N, unsigned Op) : Node(N), Operand(Op) {} 4993e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman public: 5003e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman bool operator==(const SUnitIterator& x) const { 5013e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman return Operand == x.Operand; 5023e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman } 5033e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman bool operator!=(const SUnitIterator& x) const { return !operator==(x); } 5043e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 5053e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman const SUnitIterator &operator=(const SUnitIterator &I) { 5063e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman assert(I.Node == Node && "Cannot assign iterators to two different nodes!"); 5073e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman Operand = I.Operand; 5083e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman return *this; 5093e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman } 5103e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 5113e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman pointer operator*() const { 512713a98dee8ab07a3066d1707a07648d27dd0c19cEvan Cheng return Node->Preds[Operand].Dep; 5133e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman } 5143e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman pointer operator->() const { return operator*(); } 5153e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 5163e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman SUnitIterator& operator++() { // Preincrement 5173e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman ++Operand; 5183e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman return *this; 5193e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman } 5203e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman SUnitIterator operator++(int) { // Postincrement 5213e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman SUnitIterator tmp = *this; ++*this; return tmp; 5223e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman } 5233e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 5243e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman static SUnitIterator begin(SUnit *N) { return SUnitIterator(N, 0); } 5253e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman static SUnitIterator end (SUnit *N) { 52634cd4a484e532cc463fd5a4bf59b88d13c5467c1Evan Cheng return SUnitIterator(N, (unsigned)N->Preds.size()); 5273e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman } 5283e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 5293e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman unsigned getOperand() const { return Operand; } 5303e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman const SUnit *getNode() const { return Node; } 531713a98dee8ab07a3066d1707a07648d27dd0c19cEvan Cheng bool isCtrlDep() const { return Node->Preds[Operand].isCtrl; } 53289bf0a6b05c8c353890c88ed1c10dec96a9a7bd8Dan Gohman bool isSpecialDep() const { return Node->Preds[Operand].isSpecial; } 5333e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman }; 5343e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 5353e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman template <> struct GraphTraits<SUnit*> { 5363e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman typedef SUnit NodeType; 5373e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman typedef SUnitIterator ChildIteratorType; 5383e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman static inline NodeType *getEntryNode(SUnit *N) { return N; } 5393e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman static inline ChildIteratorType child_begin(NodeType *N) { 5403e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman return SUnitIterator::begin(N); 5413e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman } 5423e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman static inline ChildIteratorType child_end(NodeType *N) { 5433e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman return SUnitIterator::end(N); 5443e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman } 5453e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman }; 5463e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 5473e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman template <> struct GraphTraits<ScheduleDAG*> : public GraphTraits<SUnit*> { 5483e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman typedef std::vector<SUnit>::iterator nodes_iterator; 5493e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman static nodes_iterator nodes_begin(ScheduleDAG *G) { 5503e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman return G->SUnits.begin(); 5513e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman } 5523e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman static nodes_iterator nodes_end(ScheduleDAG *G) { 5533e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman return G->SUnits.end(); 5543e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman } 5553e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman }; 556a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng} 557a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 558a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng#endif 559