blob: 65d96a9a8a54601161f8773f8ec7e556fe00594e [file] [log] [blame]
Dan Gohman343f0c02008-11-19 23:18:57 +00001//===---- llvm/CodeGen/ScheduleDAGSDNodes.h - SDNode Scheduling -*- C++ -*-===//
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
15#ifndef LLVM_CODEGEN_SCHEDULEDAGSDNODES_H
16#define LLVM_CODEGEN_SCHEDULEDAGSDNODES_H
17
18#include "llvm/CodeGen/ScheduleDAG.h"
19#include "llvm/CodeGen/SelectionDAG.h"
Dan Gohman343f0c02008-11-19 23:18:57 +000020
21namespace llvm {
Dan Gohman343f0c02008-11-19 23:18:57 +000022 /// HazardRecognizer - This determines whether or not an instruction can be
23 /// issued this cycle, and whether or not a noop needs to be inserted to handle
24 /// the hazard.
25 class HazardRecognizer {
26 public:
27 virtual ~HazardRecognizer();
28
29 enum HazardType {
30 NoHazard, // This instruction can be emitted at this cycle.
31 Hazard, // This instruction can't be emitted at this cycle.
32 NoopHazard // This instruction can't be emitted, and needs noops.
33 };
34
35 /// getHazardType - Return the hazard type of emitting this node. There are
36 /// three possible results. Either:
37 /// * NoHazard: it is legal to issue this instruction on this cycle.
38 /// * Hazard: issuing this instruction would stall the machine. If some
39 /// other instruction is available, issue it first.
40 /// * NoopHazard: issuing this instruction would break the program. If
41 /// some other instruction can be issued, do so, otherwise issue a noop.
42 virtual HazardType getHazardType(SDNode *) {
43 return NoHazard;
44 }
45
46 /// EmitInstruction - This callback is invoked when an instruction is
47 /// emitted, to advance the hazard state.
48 virtual void EmitInstruction(SDNode *) {}
49
50 /// AdvanceCycle - This callback is invoked when no instructions can be
51 /// issued on this cycle without a hazard. This should increment the
52 /// internal state of the hazard recognizer so that previously "Hazard"
53 /// instructions will now not be hazards.
54 virtual void AdvanceCycle() {}
55
56 /// EmitNoop - This callback is invoked when a noop was added to the
57 /// instruction stream.
58 virtual void EmitNoop() {}
59 };
60
Dan Gohman983bbba2008-12-22 21:06:20 +000061 /// ScheduleDAGSDNodes - A ScheduleDAG for scheduling SDNode-based DAGs.
62 ///
63 /// Edges between SUnits are initially based on edges in the SelectionDAG,
64 /// and additional edges can be added by the schedulers as heuristics.
65 /// SDNodes such as Constants, Registers, and a few others that are not
66 /// interesting to schedulers are not allocated SUnits.
67 ///
68 /// SDNodes with MVT::Flag operands are grouped along with the flagged
69 /// nodes into a single SUnit so that they are scheduled together.
70 ///
71 /// SDNode-based scheduling graphs do not use SDep::Anti or SDep::Output
72 /// edges. Physical register dependence information is not carried in
73 /// the DAG and must be handled explicitly by schedulers.
74 ///
Dan Gohman343f0c02008-11-19 23:18:57 +000075 class ScheduleDAGSDNodes : public ScheduleDAG {
76 public:
Dan Gohman343f0c02008-11-19 23:18:57 +000077 ScheduleDAGSDNodes(SelectionDAG *dag, MachineBasicBlock *bb,
78 const TargetMachine &tm);
79
80 virtual ~ScheduleDAGSDNodes() {}
81
82 /// isPassiveNode - Return true if the node is a non-scheduled leaf.
83 ///
84 static bool isPassiveNode(SDNode *Node) {
85 if (isa<ConstantSDNode>(Node)) return true;
86 if (isa<ConstantFPSDNode>(Node)) return true;
87 if (isa<RegisterSDNode>(Node)) return true;
88 if (isa<GlobalAddressSDNode>(Node)) return true;
89 if (isa<BasicBlockSDNode>(Node)) return true;
90 if (isa<FrameIndexSDNode>(Node)) return true;
91 if (isa<ConstantPoolSDNode>(Node)) return true;
92 if (isa<JumpTableSDNode>(Node)) return true;
93 if (isa<ExternalSymbolSDNode>(Node)) return true;
94 if (isa<MemOperandSDNode>(Node)) return true;
95 if (Node->getOpcode() == ISD::EntryToken) return true;
96 return false;
97 }
98
99 /// NewSUnit - Creates a new SUnit and return a ptr to it.
100 ///
101 SUnit *NewSUnit(SDNode *N) {
Dan Gohman983bbba2008-12-22 21:06:20 +0000102#ifndef NDEBUG
Bill Wendlingd5b207b2009-01-01 01:14:31 +0000103 const SUnit *Addr = 0;
104 if (SUnits.size() > 0)
105 Addr = &SUnits[0];
Dan Gohman983bbba2008-12-22 21:06:20 +0000106#endif
Dan Gohman343f0c02008-11-19 23:18:57 +0000107 SUnits.push_back(SUnit(N, (unsigned)SUnits.size()));
Bill Wendlingd5b207b2009-01-01 01:14:31 +0000108 assert((Addr == 0 || Addr == &SUnits[0]) &&
109 "SUnits std::vector reallocated on the fly!");
Dan Gohman343f0c02008-11-19 23:18:57 +0000110 SUnits.back().OrigNode = &SUnits.back();
111 return &SUnits.back();
112 }
113
114 /// Clone - Creates a clone of the specified SUnit. It does not copy the
115 /// predecessors / successors info nor the temporary scheduling states.
116 ///
117 SUnit *Clone(SUnit *N);
118
119 virtual SelectionDAG *getDAG() { return DAG; }
120
Dan Gohmanc9a5b9e2008-12-23 18:36:58 +0000121 /// BuildSchedGraph - Build the SUnit graph from the selection dag that we
122 /// are input. This SUnit graph is similar to the SelectionDAG, but
123 /// excludes nodes that aren't interesting to scheduling, and represents
124 /// flagged together nodes with a single SUnit.
125 virtual void BuildSchedGraph();
Dan Gohman343f0c02008-11-19 23:18:57 +0000126
127 /// ComputeLatency - Compute node latency.
128 ///
129 virtual void ComputeLatency(SUnit *SU);
130
131 /// CountResults - The results of target nodes have register or immediate
132 /// operands first, then an optional chain, and optional flag operands
133 /// (which do not go into the machine instrs.)
134 static unsigned CountResults(SDNode *Node);
135
136 /// CountOperands - The inputs to target nodes have any actual inputs first,
137 /// followed by special operands that describe memory references, then an
138 /// optional chain operand, then flag operands. Compute the number of
139 /// actual operands that will go into the resulting MachineInstr.
140 static unsigned CountOperands(SDNode *Node);
141
142 /// ComputeMemOperandsEnd - Find the index one past the last
143 /// MemOperandSDNode operand
144 static unsigned ComputeMemOperandsEnd(SDNode *Node);
145
146 /// EmitNode - Generate machine code for an node and needed dependencies.
147 /// VRBaseMap contains, for each already emitted node, the first virtual
148 /// register number for the results of the node.
149 ///
150 void EmitNode(SDNode *Node, bool IsClone,
151 DenseMap<SDValue, unsigned> &VRBaseMap);
152
153 virtual MachineBasicBlock *EmitSchedule();
154
155 /// Schedule - Order nodes according to selected style, filling
156 /// in the Sequence member.
157 ///
158 virtual void Schedule() = 0;
159
160 virtual void dumpNode(const SUnit *SU) const;
161
162 virtual std::string getGraphNodeLabel(const SUnit *SU) const;
163
164 virtual void getCustomGraphFeatures(GraphWriter<ScheduleDAG*> &GW) const;
165
166 private:
167 /// EmitSubregNode - Generate machine code for subreg nodes.
168 ///
169 void EmitSubregNode(SDNode *Node,
170 DenseMap<SDValue, unsigned> &VRBaseMap);
171
172 /// getVR - Return the virtual register corresponding to the specified result
173 /// of the specified node.
174 unsigned getVR(SDValue Op, DenseMap<SDValue, unsigned> &VRBaseMap);
175
176 /// getDstOfCopyToRegUse - If the only use of the specified result number of
177 /// node is a CopyToReg, return its destination register. Return 0 otherwise.
178 unsigned getDstOfOnlyCopyToRegUse(SDNode *Node, unsigned ResNo) const;
179
180 void AddOperand(MachineInstr *MI, SDValue Op, unsigned IIOpNum,
181 const TargetInstrDesc *II,
182 DenseMap<SDValue, unsigned> &VRBaseMap);
183
184 /// EmitCopyFromReg - Generate machine code for an CopyFromReg node or an
185 /// implicit physical register output.
186 void EmitCopyFromReg(SDNode *Node, unsigned ResNo, bool IsClone,
187 unsigned SrcReg,
188 DenseMap<SDValue, unsigned> &VRBaseMap);
189
190 void CreateVirtualRegisters(SDNode *Node, MachineInstr *MI,
Evan Cheng5c3c5a42009-01-09 22:44:02 +0000191 const TargetInstrDesc &II, bool IsClone,
Dan Gohman343f0c02008-11-19 23:18:57 +0000192 DenseMap<SDValue, unsigned> &VRBaseMap);
Dan Gohmanc9a5b9e2008-12-23 18:36:58 +0000193
194 /// BuildSchedUnits, AddSchedEdges - Helper functions for BuildSchedGraph.
195 void BuildSchedUnits();
196 void AddSchedEdges();
Dan Gohman343f0c02008-11-19 23:18:57 +0000197 };
Dan Gohman343f0c02008-11-19 23:18:57 +0000198}
199
200#endif