blob: 84e41fc4a1ba3c3d57ea8a01cf7e442508e581c8 [file] [log] [blame]
Dan Gohman84fbac52009-02-06 17:22:58 +00001//===---- ScheduleDAGSDNodes.h - SDNode Scheduling --------------*- C++ -*-===//
Dan Gohman343f0c02008-11-19 23:18:57 +00002//
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 Gohman84fbac52009-02-06 17:22:58 +000015#ifndef SCHEDULEDAGSDNODES_H
16#define SCHEDULEDAGSDNODES_H
Dan Gohman343f0c02008-11-19 23:18:57 +000017
18#include "llvm/CodeGen/ScheduleDAG.h"
19#include "llvm/CodeGen/SelectionDAG.h"
Dan Gohman343f0c02008-11-19 23:18:57 +000020
21namespace llvm {
Dan Gohman983bbba2008-12-22 21:06:20 +000022 /// ScheduleDAGSDNodes - A ScheduleDAG for scheduling SDNode-based DAGs.
Andrew Trick92e94662011-02-04 03:18:17 +000023 ///
Dan Gohman983bbba2008-12-22 21:06:20 +000024 /// 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 Lattnerf1b4eaf2010-12-21 02:38:05 +000029 /// SDNodes with MVT::Glue operands are grouped along with the flagged
Dan Gohman983bbba2008-12-22 21:06:20 +000030 /// 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 Gohman343f0c02008-11-19 23:18:57 +000036 class ScheduleDAGSDNodes : public ScheduleDAG {
37 public:
Andrew Trick47c14452012-03-07 05:21:52 +000038 MachineBasicBlock *BB;
Dan Gohman47ac0f02009-02-11 04:27:20 +000039 SelectionDAG *DAG; // DAG of the current basic block
Evan Cheng3ef1c872010-09-10 01:29:16 +000040 const InstrItineraryData *InstrItins;
Dan Gohman47ac0f02009-02-11 04:27:20 +000041
Andrew Trick47c14452012-03-07 05:21:52 +000042 /// The schedule. Null SUnit*'s represent noop instructions.
43 std::vector<SUnit*> Sequence;
44
Dan Gohman79ce2762009-01-15 19:20:50 +000045 explicit ScheduleDAGSDNodes(MachineFunction &mf);
Dan Gohman343f0c02008-11-19 23:18:57 +000046
47 virtual ~ScheduleDAGSDNodes() {}
48
Dan Gohman47ac0f02009-02-11 04:27:20 +000049 /// Run - perform scheduling.
50 ///
Andrew Trick47c14452012-03-07 05:21:52 +000051 void Run(SelectionDAG *dag, MachineBasicBlock *bb);
Dan Gohman47ac0f02009-02-11 04:27:20 +000052
Dan Gohman343f0c02008-11-19 23:18:57 +000053 /// 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 Olesen9cf37e82012-01-18 23:52:12 +000059 if (isa<RegisterMaskSDNode>(Node)) return true;
Dan Gohman343f0c02008-11-19 23:18:57 +000060 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 Olesen74500bd2012-08-07 22:37:05 +000064 if (isa<TargetIndexSDNode>(Node)) return true;
Dan Gohman343f0c02008-11-19 23:18:57 +000065 if (isa<JumpTableSDNode>(Node)) return true;
66 if (isa<ExternalSymbolSDNode>(Node)) return true;
Dan Gohman8c2b5252009-10-30 01:27:03 +000067 if (isa<BlockAddressSDNode>(Node)) return true;
Chris Lattnerdecc2672010-04-07 05:20:54 +000068 if (Node->getOpcode() == ISD::EntryToken ||
69 isa<MDNodeSDNode>(Node)) return true;
Dan Gohman343f0c02008-11-19 23:18:57 +000070 return false;
71 }
72
73 /// NewSUnit - Creates a new SUnit and return a ptr to it.
74 ///
Andrew Trick953be892012-03-07 23:00:49 +000075 SUnit *newSUnit(SDNode *N);
Dan Gohman343f0c02008-11-19 23:18:57 +000076
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 Trick92e94662011-02-04 03:18:17 +000081
Dan Gohmanc9a5b9e2008-12-23 18:36:58 +000082 /// 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 Trick084e1792012-03-07 00:18:12 +000086 void BuildSchedGraph(AliasAnalysis *AA);
Dan Gohman343f0c02008-11-19 23:18:57 +000087
Andrew Trick54699762011-04-07 19:54:57 +000088 /// 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 Trick92e94662011-02-04 03:18:17 +000094 /// InitNumRegDefsLeft - Determine the # of regs defined by this node.
95 ///
96 void InitNumRegDefsLeft(SUnit *SU);
97
Andrew Trick953be892012-03-07 23:00:49 +000098 /// computeLatency - Compute node latency.
Dan Gohman343f0c02008-11-19 23:18:57 +000099 ///
Andrew Trick953be892012-03-07 23:00:49 +0000100 virtual void computeLatency(SUnit *SU);
Dan Gohman343f0c02008-11-19 23:18:57 +0000101
Andrew Trick953be892012-03-07 23:00:49 +0000102 virtual void computeOperandLatency(SDNode *Def, SDNode *Use,
Evan Cheng15a16de2010-05-20 06:13:19 +0000103 unsigned OpIdx, SDep& dep) const;
104
Dan Gohman343f0c02008-11-19 23:18:57 +0000105 /// Schedule - Order nodes according to selected style, filling
106 /// in the Sequence member.
107 ///
108 virtual void Schedule() = 0;
109
Andrew Trick4c727202012-03-07 05:21:36 +0000110 /// VerifyScheduledSequence - Verify that all SUnits are scheduled and
111 /// consistent with the Sequence of scheduled instructions.
112 void VerifyScheduledSequence(bool isBottomUp);
113
Andrew Trick84b454d2012-03-07 05:21:44 +0000114 /// EmitSchedule - Insert MachineInstrs into the MachineBasicBlock
115 /// according to the order specified in Sequence.
116 ///
117 MachineBasicBlock *EmitSchedule(MachineBasicBlock::iterator &InsertPos);
118
Dan Gohman343f0c02008-11-19 23:18:57 +0000119 virtual void dumpNode(const SUnit *SU) const;
120
Andrew Trick73ba69b2012-03-07 05:21:40 +0000121 void dumpSchedule() const;
122
Dan Gohman343f0c02008-11-19 23:18:57 +0000123 virtual std::string getGraphNodeLabel(const SUnit *SU) const;
124
Andrew Trick56b94c52012-03-07 00:18:22 +0000125 virtual std::string getDAGName() const;
126
Dan Gohman343f0c02008-11-19 23:18:57 +0000127 virtual void getCustomGraphFeatures(GraphWriter<ScheduleDAG*> &GW) const;
128
Andrew Trick92e94662011-02-04 03:18:17 +0000129 /// 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 Anderson77b4b132011-06-15 23:35:18 +0000148 const SDNode *GetNode() const {
149 return Node;
150 }
151
152 unsigned GetIdx() const {
Owen Anderson70211012011-06-27 18:34:12 +0000153 return DefIdx-1;
Owen Anderson77b4b132011-06-15 23:35:18 +0000154 }
155
Andrew Trick92e94662011-02-04 03:18:17 +0000156 void Advance();
157 private:
158 void InitNodeNumDefs();
159 };
160
Dan Gohman343f0c02008-11-19 23:18:57 +0000161 private:
Evan Chengc589e032010-01-22 03:36:51 +0000162 /// ClusterNeighboringLoads - Cluster loads from "near" addresses into
163 /// combined SUnits.
Evan Cheng302ef832010-06-10 02:09:31 +0000164 void ClusterNeighboringLoads(SDNode *Node);
165 /// ClusterNodes - Cluster certain nodes which should be scheduled together.
166 ///
167 void ClusterNodes();
Evan Chengc589e032010-01-22 03:36:51 +0000168
Dan Gohmanc9a5b9e2008-12-23 18:36:58 +0000169 /// BuildSchedUnits, AddSchedEdges - Helper functions for BuildSchedGraph.
170 void BuildSchedUnits();
171 void AddSchedEdges();
Andrew Trick84b454d2012-03-07 05:21:44 +0000172
173 void EmitPhysRegCopy(SUnit *SU, DenseMap<SUnit*, unsigned> &VRBaseMap,
174 MachineBasicBlock::iterator InsertPos);
Dan Gohman343f0c02008-11-19 23:18:57 +0000175 };
Dan Gohman343f0c02008-11-19 23:18:57 +0000176}
177
178#endif