Dan Gohman | 84fbac5 | 2009-02-06 17:22:58 +0000 | [diff] [blame] | 1 | //===---- ScheduleDAGSDNodes.h - SDNode Scheduling --------------*- C++ -*-===// |
Dan Gohman | 343f0c0 | 2008-11-19 23:18:57 +0000 | [diff] [blame] | 2 | // |
| 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
| 5 | // This file is distributed under the University of Illinois Open Source |
| 6 | // License. See LICENSE.TXT for details. |
| 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
| 9 | // |
| 10 | // This file implements the ScheduleDAGSDNodes class, which implements |
| 11 | // scheduling for an SDNode-based dependency graph. |
| 12 | // |
| 13 | //===----------------------------------------------------------------------===// |
| 14 | |
Dan Gohman | 84fbac5 | 2009-02-06 17:22:58 +0000 | [diff] [blame] | 15 | #ifndef SCHEDULEDAGSDNODES_H |
| 16 | #define SCHEDULEDAGSDNODES_H |
Dan Gohman | 343f0c0 | 2008-11-19 23:18:57 +0000 | [diff] [blame] | 17 | |
| 18 | #include "llvm/CodeGen/ScheduleDAG.h" |
| 19 | #include "llvm/CodeGen/SelectionDAG.h" |
Dan Gohman | 343f0c0 | 2008-11-19 23:18:57 +0000 | [diff] [blame] | 20 | |
| 21 | namespace llvm { |
Dan Gohman | 983bbba | 2008-12-22 21:06:20 +0000 | [diff] [blame] | 22 | /// ScheduleDAGSDNodes - A ScheduleDAG for scheduling SDNode-based DAGs. |
Andrew Trick | 92e9466 | 2011-02-04 03:18:17 +0000 | [diff] [blame] | 23 | /// |
Dan Gohman | 983bbba | 2008-12-22 21:06:20 +0000 | [diff] [blame] | 24 | /// Edges between SUnits are initially based on edges in the SelectionDAG, |
| 25 | /// and additional edges can be added by the schedulers as heuristics. |
| 26 | /// SDNodes such as Constants, Registers, and a few others that are not |
| 27 | /// interesting to schedulers are not allocated SUnits. |
| 28 | /// |
Chris Lattner | f1b4eaf | 2010-12-21 02:38:05 +0000 | [diff] [blame] | 29 | /// SDNodes with MVT::Glue operands are grouped along with the flagged |
Dan Gohman | 983bbba | 2008-12-22 21:06:20 +0000 | [diff] [blame] | 30 | /// nodes into a single SUnit so that they are scheduled together. |
| 31 | /// |
| 32 | /// SDNode-based scheduling graphs do not use SDep::Anti or SDep::Output |
| 33 | /// edges. Physical register dependence information is not carried in |
| 34 | /// the DAG and must be handled explicitly by schedulers. |
| 35 | /// |
Dan Gohman | 343f0c0 | 2008-11-19 23:18:57 +0000 | [diff] [blame] | 36 | class ScheduleDAGSDNodes : public ScheduleDAG { |
| 37 | public: |
Andrew Trick | 47c1445 | 2012-03-07 05:21:52 +0000 | [diff] [blame] | 38 | MachineBasicBlock *BB; |
Dan Gohman | 47ac0f0 | 2009-02-11 04:27:20 +0000 | [diff] [blame] | 39 | SelectionDAG *DAG; // DAG of the current basic block |
Evan Cheng | 3ef1c87 | 2010-09-10 01:29:16 +0000 | [diff] [blame] | 40 | const InstrItineraryData *InstrItins; |
Dan Gohman | 47ac0f0 | 2009-02-11 04:27:20 +0000 | [diff] [blame] | 41 | |
Andrew Trick | 47c1445 | 2012-03-07 05:21:52 +0000 | [diff] [blame] | 42 | /// The schedule. Null SUnit*'s represent noop instructions. |
| 43 | std::vector<SUnit*> Sequence; |
| 44 | |
Dan Gohman | 79ce276 | 2009-01-15 19:20:50 +0000 | [diff] [blame] | 45 | explicit ScheduleDAGSDNodes(MachineFunction &mf); |
Dan Gohman | 343f0c0 | 2008-11-19 23:18:57 +0000 | [diff] [blame] | 46 | |
| 47 | virtual ~ScheduleDAGSDNodes() {} |
| 48 | |
Dan Gohman | 47ac0f0 | 2009-02-11 04:27:20 +0000 | [diff] [blame] | 49 | /// Run - perform scheduling. |
| 50 | /// |
Andrew Trick | 47c1445 | 2012-03-07 05:21:52 +0000 | [diff] [blame] | 51 | void Run(SelectionDAG *dag, MachineBasicBlock *bb); |
Dan Gohman | 47ac0f0 | 2009-02-11 04:27:20 +0000 | [diff] [blame] | 52 | |
Dan Gohman | 343f0c0 | 2008-11-19 23:18:57 +0000 | [diff] [blame] | 53 | /// isPassiveNode - Return true if the node is a non-scheduled leaf. |
| 54 | /// |
| 55 | static bool isPassiveNode(SDNode *Node) { |
| 56 | if (isa<ConstantSDNode>(Node)) return true; |
| 57 | if (isa<ConstantFPSDNode>(Node)) return true; |
| 58 | if (isa<RegisterSDNode>(Node)) return true; |
Jakob Stoklund Olesen | 9cf37e8 | 2012-01-18 23:52:12 +0000 | [diff] [blame] | 59 | if (isa<RegisterMaskSDNode>(Node)) return true; |
Dan Gohman | 343f0c0 | 2008-11-19 23:18:57 +0000 | [diff] [blame] | 60 | if (isa<GlobalAddressSDNode>(Node)) return true; |
| 61 | if (isa<BasicBlockSDNode>(Node)) return true; |
| 62 | if (isa<FrameIndexSDNode>(Node)) return true; |
| 63 | if (isa<ConstantPoolSDNode>(Node)) return true; |
Jakob Stoklund Olesen | 74500bd | 2012-08-07 22:37:05 +0000 | [diff] [blame^] | 64 | if (isa<TargetIndexSDNode>(Node)) return true; |
Dan Gohman | 343f0c0 | 2008-11-19 23:18:57 +0000 | [diff] [blame] | 65 | if (isa<JumpTableSDNode>(Node)) return true; |
| 66 | if (isa<ExternalSymbolSDNode>(Node)) return true; |
Dan Gohman | 8c2b525 | 2009-10-30 01:27:03 +0000 | [diff] [blame] | 67 | if (isa<BlockAddressSDNode>(Node)) return true; |
Chris Lattner | decc267 | 2010-04-07 05:20:54 +0000 | [diff] [blame] | 68 | if (Node->getOpcode() == ISD::EntryToken || |
| 69 | isa<MDNodeSDNode>(Node)) return true; |
Dan Gohman | 343f0c0 | 2008-11-19 23:18:57 +0000 | [diff] [blame] | 70 | return false; |
| 71 | } |
| 72 | |
| 73 | /// NewSUnit - Creates a new SUnit and return a ptr to it. |
| 74 | /// |
Andrew Trick | 953be89 | 2012-03-07 23:00:49 +0000 | [diff] [blame] | 75 | SUnit *newSUnit(SDNode *N); |
Dan Gohman | 343f0c0 | 2008-11-19 23:18:57 +0000 | [diff] [blame] | 76 | |
| 77 | /// Clone - Creates a clone of the specified SUnit. It does not copy the |
| 78 | /// predecessors / successors info nor the temporary scheduling states. |
| 79 | /// |
| 80 | SUnit *Clone(SUnit *N); |
Andrew Trick | 92e9466 | 2011-02-04 03:18:17 +0000 | [diff] [blame] | 81 | |
Dan Gohman | c9a5b9e | 2008-12-23 18:36:58 +0000 | [diff] [blame] | 82 | /// BuildSchedGraph - Build the SUnit graph from the selection dag that we |
| 83 | /// are input. This SUnit graph is similar to the SelectionDAG, but |
| 84 | /// excludes nodes that aren't interesting to scheduling, and represents |
| 85 | /// flagged together nodes with a single SUnit. |
Andrew Trick | 084e179 | 2012-03-07 00:18:12 +0000 | [diff] [blame] | 86 | void BuildSchedGraph(AliasAnalysis *AA); |
Dan Gohman | 343f0c0 | 2008-11-19 23:18:57 +0000 | [diff] [blame] | 87 | |
Andrew Trick | 5469976 | 2011-04-07 19:54:57 +0000 | [diff] [blame] | 88 | /// InitVRegCycleFlag - Set isVRegCycle if this node's single use is |
| 89 | /// CopyToReg and its only active data operands are CopyFromReg within a |
| 90 | /// single block loop. |
| 91 | /// |
| 92 | void InitVRegCycleFlag(SUnit *SU); |
| 93 | |
Andrew Trick | 92e9466 | 2011-02-04 03:18:17 +0000 | [diff] [blame] | 94 | /// InitNumRegDefsLeft - Determine the # of regs defined by this node. |
| 95 | /// |
| 96 | void InitNumRegDefsLeft(SUnit *SU); |
| 97 | |
Andrew Trick | 953be89 | 2012-03-07 23:00:49 +0000 | [diff] [blame] | 98 | /// computeLatency - Compute node latency. |
Dan Gohman | 343f0c0 | 2008-11-19 23:18:57 +0000 | [diff] [blame] | 99 | /// |
Andrew Trick | 953be89 | 2012-03-07 23:00:49 +0000 | [diff] [blame] | 100 | virtual void computeLatency(SUnit *SU); |
Dan Gohman | 343f0c0 | 2008-11-19 23:18:57 +0000 | [diff] [blame] | 101 | |
Andrew Trick | 953be89 | 2012-03-07 23:00:49 +0000 | [diff] [blame] | 102 | virtual void computeOperandLatency(SDNode *Def, SDNode *Use, |
Evan Cheng | 15a16de | 2010-05-20 06:13:19 +0000 | [diff] [blame] | 103 | unsigned OpIdx, SDep& dep) const; |
| 104 | |
Dan Gohman | 343f0c0 | 2008-11-19 23:18:57 +0000 | [diff] [blame] | 105 | /// Schedule - Order nodes according to selected style, filling |
| 106 | /// in the Sequence member. |
| 107 | /// |
| 108 | virtual void Schedule() = 0; |
| 109 | |
Andrew Trick | 4c72720 | 2012-03-07 05:21:36 +0000 | [diff] [blame] | 110 | /// VerifyScheduledSequence - Verify that all SUnits are scheduled and |
| 111 | /// consistent with the Sequence of scheduled instructions. |
| 112 | void VerifyScheduledSequence(bool isBottomUp); |
| 113 | |
Andrew Trick | 84b454d | 2012-03-07 05:21:44 +0000 | [diff] [blame] | 114 | /// EmitSchedule - Insert MachineInstrs into the MachineBasicBlock |
| 115 | /// according to the order specified in Sequence. |
| 116 | /// |
| 117 | MachineBasicBlock *EmitSchedule(MachineBasicBlock::iterator &InsertPos); |
| 118 | |
Dan Gohman | 343f0c0 | 2008-11-19 23:18:57 +0000 | [diff] [blame] | 119 | virtual void dumpNode(const SUnit *SU) const; |
| 120 | |
Andrew Trick | 73ba69b | 2012-03-07 05:21:40 +0000 | [diff] [blame] | 121 | void dumpSchedule() const; |
| 122 | |
Dan Gohman | 343f0c0 | 2008-11-19 23:18:57 +0000 | [diff] [blame] | 123 | virtual std::string getGraphNodeLabel(const SUnit *SU) const; |
| 124 | |
Andrew Trick | 56b94c5 | 2012-03-07 00:18:22 +0000 | [diff] [blame] | 125 | virtual std::string getDAGName() const; |
| 126 | |
Dan Gohman | 343f0c0 | 2008-11-19 23:18:57 +0000 | [diff] [blame] | 127 | virtual void getCustomGraphFeatures(GraphWriter<ScheduleDAG*> &GW) const; |
| 128 | |
Andrew Trick | 92e9466 | 2011-02-04 03:18:17 +0000 | [diff] [blame] | 129 | /// RegDefIter - In place iteration over the values defined by an |
| 130 | /// SUnit. This does not need copies of the iterator or any other STLisms. |
| 131 | /// The iterator creates itself, rather than being provided by the SchedDAG. |
| 132 | class RegDefIter { |
| 133 | const ScheduleDAGSDNodes *SchedDAG; |
| 134 | const SDNode *Node; |
| 135 | unsigned DefIdx; |
| 136 | unsigned NodeNumDefs; |
| 137 | EVT ValueType; |
| 138 | public: |
| 139 | RegDefIter(const SUnit *SU, const ScheduleDAGSDNodes *SD); |
| 140 | |
| 141 | bool IsValid() const { return Node != NULL; } |
| 142 | |
| 143 | EVT GetValue() const { |
| 144 | assert(IsValid() && "bad iterator"); |
| 145 | return ValueType; |
| 146 | } |
| 147 | |
Owen Anderson | 77b4b13 | 2011-06-15 23:35:18 +0000 | [diff] [blame] | 148 | const SDNode *GetNode() const { |
| 149 | return Node; |
| 150 | } |
| 151 | |
| 152 | unsigned GetIdx() const { |
Owen Anderson | 7021101 | 2011-06-27 18:34:12 +0000 | [diff] [blame] | 153 | return DefIdx-1; |
Owen Anderson | 77b4b13 | 2011-06-15 23:35:18 +0000 | [diff] [blame] | 154 | } |
| 155 | |
Andrew Trick | 92e9466 | 2011-02-04 03:18:17 +0000 | [diff] [blame] | 156 | void Advance(); |
| 157 | private: |
| 158 | void InitNodeNumDefs(); |
| 159 | }; |
| 160 | |
Dan Gohman | 343f0c0 | 2008-11-19 23:18:57 +0000 | [diff] [blame] | 161 | private: |
Evan Cheng | c589e03 | 2010-01-22 03:36:51 +0000 | [diff] [blame] | 162 | /// ClusterNeighboringLoads - Cluster loads from "near" addresses into |
| 163 | /// combined SUnits. |
Evan Cheng | 302ef83 | 2010-06-10 02:09:31 +0000 | [diff] [blame] | 164 | void ClusterNeighboringLoads(SDNode *Node); |
| 165 | /// ClusterNodes - Cluster certain nodes which should be scheduled together. |
| 166 | /// |
| 167 | void ClusterNodes(); |
Evan Cheng | c589e03 | 2010-01-22 03:36:51 +0000 | [diff] [blame] | 168 | |
Dan Gohman | c9a5b9e | 2008-12-23 18:36:58 +0000 | [diff] [blame] | 169 | /// BuildSchedUnits, AddSchedEdges - Helper functions for BuildSchedGraph. |
| 170 | void BuildSchedUnits(); |
| 171 | void AddSchedEdges(); |
Andrew Trick | 84b454d | 2012-03-07 05:21:44 +0000 | [diff] [blame] | 172 | |
| 173 | void EmitPhysRegCopy(SUnit *SU, DenseMap<SUnit*, unsigned> &VRBaseMap, |
| 174 | MachineBasicBlock::iterator InsertPos); |
Dan Gohman | 343f0c0 | 2008-11-19 23:18:57 +0000 | [diff] [blame] | 175 | }; |
Dan Gohman | 343f0c0 | 2008-11-19 23:18:57 +0000 | [diff] [blame] | 176 | } |
| 177 | |
| 178 | #endif |