blob: 5cc806668b12fbe00cf4f121b145217eacba1e75 [file] [log] [blame]
Dan Gohman483377c2009-02-06 17:22:58 +00001//===---- ScheduleDAGSDNodes.h - SDNode Scheduling --------------*- C++ -*-===//
Dan Gohman60cb69e2008-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
Benjamin Kramera7c40ef2014-08-13 16:26:38 +000015#ifndef LLVM_LIB_CODEGEN_SELECTIONDAG_SCHEDULEDAGSDNODES_H
16#define LLVM_LIB_CODEGEN_SELECTIONDAG_SCHEDULEDAGSDNODES_H
Dan Gohman60cb69e2008-11-19 23:18:57 +000017
Jakub Staszak8bc7af12013-02-20 00:26:25 +000018#include "llvm/CodeGen/MachineBasicBlock.h"
Dan Gohman60cb69e2008-11-19 23:18:57 +000019#include "llvm/CodeGen/ScheduleDAG.h"
Dan Gohman60cb69e2008-11-19 23:18:57 +000020
21namespace llvm {
Dan Gohman7782de72008-12-22 21:06:20 +000022 /// ScheduleDAGSDNodes - A ScheduleDAG for scheduling SDNode-based DAGs.
Andrew Trickd0548ae2011-02-04 03:18:17 +000023 ///
Dan Gohman7782de72008-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 Lattner3e5fbd72010-12-21 02:38:05 +000029 /// SDNodes with MVT::Glue operands are grouped along with the flagged
Dan Gohman7782de72008-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 ///
Benjamin Kramer079b96e2013-09-11 18:05:11 +000036 class ScheduleDAGSDNodes : public ScheduleDAG {
Dan Gohman60cb69e2008-11-19 23:18:57 +000037 public:
Andrew Trick60cf03e2012-03-07 05:21:52 +000038 MachineBasicBlock *BB;
Dan Gohmandfaf6462009-02-11 04:27:20 +000039 SelectionDAG *DAG; // DAG of the current basic block
Evan Chengbf407072010-09-10 01:29:16 +000040 const InstrItineraryData *InstrItins;
Dan Gohmandfaf6462009-02-11 04:27:20 +000041
Andrew Trick60cf03e2012-03-07 05:21:52 +000042 /// The schedule. Null SUnit*'s represent noop instructions.
43 std::vector<SUnit*> Sequence;
44
Dan Gohman619ef482009-01-15 19:20:50 +000045 explicit ScheduleDAGSDNodes(MachineFunction &mf);
Dan Gohman60cb69e2008-11-19 23:18:57 +000046
Alexander Kornienkof817c1c2015-04-11 02:11:45 +000047 ~ScheduleDAGSDNodes() override {}
Dan Gohman60cb69e2008-11-19 23:18:57 +000048
Dan Gohmandfaf6462009-02-11 04:27:20 +000049 /// Run - perform scheduling.
50 ///
Andrew Trick60cf03e2012-03-07 05:21:52 +000051 void Run(SelectionDAG *dag, MachineBasicBlock *bb);
Dan Gohmandfaf6462009-02-11 04:27:20 +000052
Dan Gohman60cb69e2008-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 Olesen9349351d2012-01-18 23:52:12 +000059 if (isa<RegisterMaskSDNode>(Node)) return true;
Dan Gohman60cb69e2008-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 Olesen505715d2012-08-07 22:37:05 +000064 if (isa<TargetIndexSDNode>(Node)) return true;
Dan Gohman60cb69e2008-11-19 23:18:57 +000065 if (isa<JumpTableSDNode>(Node)) return true;
66 if (isa<ExternalSymbolSDNode>(Node)) return true;
Rafael Espindola36b718f2015-06-22 17:46:53 +000067 if (isa<MCSymbolSDNode>(Node)) return true;
Dan Gohman6c938802009-10-30 01:27:03 +000068 if (isa<BlockAddressSDNode>(Node)) return true;
Chris Lattner3b9f02a2010-04-07 05:20:54 +000069 if (Node->getOpcode() == ISD::EntryToken ||
70 isa<MDNodeSDNode>(Node)) return true;
Dan Gohman60cb69e2008-11-19 23:18:57 +000071 return false;
72 }
73
74 /// NewSUnit - Creates a new SUnit and return a ptr to it.
75 ///
Andrew Trick52226d42012-03-07 23:00:49 +000076 SUnit *newSUnit(SDNode *N);
Dan Gohman60cb69e2008-11-19 23:18:57 +000077
78 /// Clone - Creates a clone of the specified SUnit. It does not copy the
79 /// predecessors / successors info nor the temporary scheduling states.
80 ///
81 SUnit *Clone(SUnit *N);
Andrew Trickd0548ae2011-02-04 03:18:17 +000082
Dan Gohman04543e72008-12-23 18:36:58 +000083 /// BuildSchedGraph - Build the SUnit graph from the selection dag that we
84 /// are input. This SUnit graph is similar to the SelectionDAG, but
85 /// excludes nodes that aren't interesting to scheduling, and represents
86 /// flagged together nodes with a single SUnit.
Andrew Trick0c84efe2012-03-07 00:18:12 +000087 void BuildSchedGraph(AliasAnalysis *AA);
Dan Gohman60cb69e2008-11-19 23:18:57 +000088
Andrew Trickd0548ae2011-02-04 03:18:17 +000089 /// InitNumRegDefsLeft - Determine the # of regs defined by this node.
90 ///
91 void InitNumRegDefsLeft(SUnit *SU);
92
Andrew Trick52226d42012-03-07 23:00:49 +000093 /// computeLatency - Compute node latency.
Dan Gohman60cb69e2008-11-19 23:18:57 +000094 ///
Andrew Trick52226d42012-03-07 23:00:49 +000095 virtual void computeLatency(SUnit *SU);
Dan Gohman60cb69e2008-11-19 23:18:57 +000096
Andrew Trick52226d42012-03-07 23:00:49 +000097 virtual void computeOperandLatency(SDNode *Def, SDNode *Use,
Evan Chengbdd062d2010-05-20 06:13:19 +000098 unsigned OpIdx, SDep& dep) const;
99
Dan Gohman60cb69e2008-11-19 23:18:57 +0000100 /// Schedule - Order nodes according to selected style, filling
101 /// in the Sequence member.
102 ///
103 virtual void Schedule() = 0;
104
Andrew Trick46a58662012-03-07 05:21:36 +0000105 /// VerifyScheduledSequence - Verify that all SUnits are scheduled and
106 /// consistent with the Sequence of scheduled instructions.
107 void VerifyScheduledSequence(bool isBottomUp);
108
Andrew Tricke932bb72012-03-07 05:21:44 +0000109 /// EmitSchedule - Insert MachineInstrs into the MachineBasicBlock
110 /// according to the order specified in Sequence.
111 ///
Evan Cheng839fb652012-10-17 19:39:36 +0000112 virtual MachineBasicBlock*
113 EmitSchedule(MachineBasicBlock::iterator &InsertPos);
Andrew Tricke932bb72012-03-07 05:21:44 +0000114
Craig Topper7b883b32014-03-08 06:31:39 +0000115 void dumpNode(const SUnit *SU) const override;
Dan Gohman60cb69e2008-11-19 23:18:57 +0000116
Andrew Trickedee68c2012-03-07 05:21:40 +0000117 void dumpSchedule() const;
118
Craig Topper7b883b32014-03-08 06:31:39 +0000119 std::string getGraphNodeLabel(const SUnit *SU) const override;
Dan Gohman60cb69e2008-11-19 23:18:57 +0000120
Craig Topper7b883b32014-03-08 06:31:39 +0000121 std::string getDAGName() const override;
Andrew Trick1b2324d2012-03-07 00:18:22 +0000122
Dan Gohman60cb69e2008-11-19 23:18:57 +0000123 virtual void getCustomGraphFeatures(GraphWriter<ScheduleDAG*> &GW) const;
124
Andrew Trickd0548ae2011-02-04 03:18:17 +0000125 /// RegDefIter - In place iteration over the values defined by an
126 /// SUnit. This does not need copies of the iterator or any other STLisms.
127 /// The iterator creates itself, rather than being provided by the SchedDAG.
128 class RegDefIter {
129 const ScheduleDAGSDNodes *SchedDAG;
130 const SDNode *Node;
131 unsigned DefIdx;
132 unsigned NodeNumDefs;
Patrik Hagglund05394352012-12-13 18:45:35 +0000133 MVT ValueType;
Andrew Trickd0548ae2011-02-04 03:18:17 +0000134 public:
135 RegDefIter(const SUnit *SU, const ScheduleDAGSDNodes *SD);
136
Craig Topperada08572014-04-16 04:21:27 +0000137 bool IsValid() const { return Node != nullptr; }
Andrew Trickd0548ae2011-02-04 03:18:17 +0000138
Patrik Hagglund05394352012-12-13 18:45:35 +0000139 MVT GetValue() const {
Andrew Trickd0548ae2011-02-04 03:18:17 +0000140 assert(IsValid() && "bad iterator");
141 return ValueType;
142 }
143
Owen Anderson96adc4a2011-06-15 23:35:18 +0000144 const SDNode *GetNode() const {
145 return Node;
146 }
147
148 unsigned GetIdx() const {
Owen Andersonb0a5a1e2011-06-27 18:34:12 +0000149 return DefIdx-1;
Owen Anderson96adc4a2011-06-15 23:35:18 +0000150 }
151
Andrew Trickd0548ae2011-02-04 03:18:17 +0000152 void Advance();
153 private:
154 void InitNodeNumDefs();
155 };
156
Andrew Trick09650df2012-10-08 18:53:57 +0000157 protected:
158 /// ForceUnitLatencies - Return true if all scheduling edges should be given
159 /// a latency value of one. The default is to return false; schedulers may
160 /// override this as needed.
161 virtual bool forceUnitLatencies() const { return false; }
162
Dan Gohman60cb69e2008-11-19 23:18:57 +0000163 private:
Evan Cheng9d92aaa2010-01-22 03:36:51 +0000164 /// ClusterNeighboringLoads - Cluster loads from "near" addresses into
165 /// combined SUnits.
Evan Cheng38f65602010-06-10 02:09:31 +0000166 void ClusterNeighboringLoads(SDNode *Node);
167 /// ClusterNodes - Cluster certain nodes which should be scheduled together.
168 ///
169 void ClusterNodes();
Evan Cheng9d92aaa2010-01-22 03:36:51 +0000170
Dan Gohman04543e72008-12-23 18:36:58 +0000171 /// BuildSchedUnits, AddSchedEdges - Helper functions for BuildSchedGraph.
172 void BuildSchedUnits();
173 void AddSchedEdges();
Andrew Tricke932bb72012-03-07 05:21:44 +0000174
175 void EmitPhysRegCopy(SUnit *SU, DenseMap<SUnit*, unsigned> &VRBaseMap,
176 MachineBasicBlock::iterator InsertPos);
Dan Gohman60cb69e2008-11-19 23:18:57 +0000177 };
Alexander Kornienkof00654e2015-06-23 09:49:53 +0000178}
Dan Gohman60cb69e2008-11-19 23:18:57 +0000179
180#endif