1 //===- TargetSelectionDAG.td - Common code for DAG isels ---*- tablegen -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by the LLVM research group and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file defines the target-independent interfaces used by SelectionDAG
11 // instruction selection generators.
13 //===----------------------------------------------------------------------===//
15 //===----------------------------------------------------------------------===//
16 // Selection DAG Type Constraint definitions.
18 // Note that the semantics of these constraints are hard coded into tblgen. To
19 // modify or add constraints, you have to hack tblgen.
22 class SDTypeConstraint<int opnum> {
23 int OperandNum = opnum;
26 // SDTCisVT - The specified operand has exactly this VT.
27 class SDTCisVT <int OpNum, ValueType vt> : SDTypeConstraint<OpNum> {
31 // SDTCisInt - The specified operand is has integer type.
32 class SDTCisInt<int OpNum> : SDTypeConstraint<OpNum>;
34 // SDTCisFP - The specified operand is has floating point type.
35 class SDTCisFP <int OpNum> : SDTypeConstraint<OpNum>;
37 // SDTCisSameAs - The two specified operands have identical types.
38 class SDTCisSameAs<int OpNum, int OtherOp> : SDTypeConstraint<OpNum> {
39 int OtherOperandNum = OtherOp;
42 // SDTCisVTSmallerThanOp - The specified operand is a VT SDNode, and its type is
43 // smaller than the 'Other' operand.
44 class SDTCisVTSmallerThanOp<int OpNum, int OtherOp> : SDTypeConstraint<OpNum> {
45 int OtherOperandNum = OtherOp;
48 class SDTCisOpSmallerThanOp<int SmallOp, int BigOp> : SDTypeConstraint<SmallOp>{
49 int BigOperandNum = BigOp;
52 //===----------------------------------------------------------------------===//
53 // Selection DAG Type Profile definitions.
55 // These use the constraints defined above to describe the type requirements of
56 // the various nodes. These are not hard coded into tblgen, allowing targets to
57 // add their own if needed.
60 // SDTypeProfile - This profile describes the type requirements of a Selection
62 class SDTypeProfile<int numresults, int numoperands,
63 list<SDTypeConstraint> constraints> {
64 int NumResults = numresults;
65 int NumOperands = numoperands;
66 list<SDTypeConstraint> Constraints = constraints;
70 def SDTImm : SDTypeProfile<1, 0, [SDTCisInt<0>]>; // for 'imm'.
71 def SDTVT : SDTypeProfile<1, 0, [SDTCisVT<0, OtherVT>]>; // for 'vt'.
72 def SDTUNDEF : SDTypeProfile<1, 0, []>; // for 'undef'.
73 def SDTIntBinOp : SDTypeProfile<1, 2, [ // add, and, or, xor, udiv, etc.
74 SDTCisSameAs<0, 1>, SDTCisSameAs<0, 2>, SDTCisInt<0>
76 def SDTFPBinOp : SDTypeProfile<1, 2, [ // fadd, fmul, etc.
77 SDTCisSameAs<0, 1>, SDTCisSameAs<0, 2>, SDTCisFP<0>
79 def SDTIntUnaryOp : SDTypeProfile<1, 1, [ // ctlz
80 SDTCisSameAs<0, 1>, SDTCisInt<0>
82 def SDTIntExtendOp : SDTypeProfile<1, 1, [ // sext, zext, anyext
83 SDTCisInt<0>, SDTCisInt<1>, SDTCisOpSmallerThanOp<1, 0>
85 def SDTIntTruncOp : SDTypeProfile<1, 1, [ // trunc
86 SDTCisInt<0>, SDTCisInt<1>, SDTCisOpSmallerThanOp<0, 1>
88 def SDTFPUnaryOp : SDTypeProfile<1, 1, [ // fneg, fsqrt, etc
89 SDTCisSameAs<0, 1>, SDTCisFP<0>
91 def SDTFPRoundOp : SDTypeProfile<1, 1, [ // fround
92 SDTCisFP<0>, SDTCisFP<1>, SDTCisOpSmallerThanOp<0, 1>
94 def SDTFPExtendOp : SDTypeProfile<1, 1, [ // fextend
95 SDTCisFP<0>, SDTCisFP<1>, SDTCisOpSmallerThanOp<1, 0>
97 def SDTIntToFPOp : SDTypeProfile<1, 1, [ // [su]int_to_fp
98 SDTCisFP<0>, SDTCisInt<1>
100 def SDTFPToIntOp : SDTypeProfile<1, 1, [ // fp_to_[su]int
101 SDTCisInt<0>, SDTCisFP<1>
103 def SDTExtInreg : SDTypeProfile<1, 2, [ // sext_inreg
104 SDTCisSameAs<0, 1>, SDTCisInt<0>, SDTCisVT<2, OtherVT>,
105 SDTCisVTSmallerThanOp<2, 1>
108 def SDTSetCC : SDTypeProfile<1, 3, [ // setcc
109 SDTCisInt<0>, SDTCisSameAs<1, 2>, SDTCisVT<3, OtherVT>
112 def SDTSelect : SDTypeProfile<1, 3, [ // select
113 SDTCisInt<1>, SDTCisSameAs<0, 2>, SDTCisSameAs<2, 3>
116 //===----------------------------------------------------------------------===//
117 // Selection DAG Node Properties.
119 // Note: These are hard coded into tblgen.
121 class SDNodeProperty;
122 def SDNPCommutative : SDNodeProperty; // X op Y == Y op X
123 def SDNPAssociative : SDNodeProperty; // (X op Y) op Z == X op (Y op Z)
125 //===----------------------------------------------------------------------===//
126 // Selection DAG Node definitions.
128 class SDNode<string opcode, SDTypeProfile typeprof,
129 list<SDNodeProperty> props = [], string sdclass = "SDNode"> {
130 string Opcode = opcode;
131 string SDClass = sdclass;
132 list<SDNodeProperty> Properties = props;
133 SDTypeProfile TypeProfile = typeprof;
139 def imm : SDNode<"ISD::Constant" , SDTImm , [], "ConstantSDNode">;
140 def vt : SDNode<"ISD::VALUETYPE" , SDTVT , [], "VTSDNode">;
141 def cond : SDNode<"ISD::CONDCODE" , SDTVT , [], "CondCodeSDNode">;
142 def undef : SDNode<"ISD::UNDEF" , SDTUNDEF , []>;
143 def add : SDNode<"ISD::ADD" , SDTIntBinOp ,
144 [SDNPCommutative, SDNPAssociative]>;
145 def sub : SDNode<"ISD::SUB" , SDTIntBinOp>;
146 def mul : SDNode<"ISD::MUL" , SDTIntBinOp,
147 [SDNPCommutative, SDNPAssociative]>;
148 def mulhs : SDNode<"ISD::MULHS" , SDTIntBinOp, [SDNPCommutative]>;
149 def mulhu : SDNode<"ISD::MULHU" , SDTIntBinOp, [SDNPCommutative]>;
150 def sdiv : SDNode<"ISD::SDIV" , SDTIntBinOp>;
151 def udiv : SDNode<"ISD::UDIV" , SDTIntBinOp>;
152 def srem : SDNode<"ISD::SREM" , SDTIntBinOp>;
153 def urem : SDNode<"ISD::UREM" , SDTIntBinOp>;
154 def srl : SDNode<"ISD::SRL" , SDTIntBinOp>;
155 def sra : SDNode<"ISD::SRA" , SDTIntBinOp>;
156 def shl : SDNode<"ISD::SHL" , SDTIntBinOp>;
157 def and : SDNode<"ISD::AND" , SDTIntBinOp,
158 [SDNPCommutative, SDNPAssociative]>;
159 def or : SDNode<"ISD::OR" , SDTIntBinOp,
160 [SDNPCommutative, SDNPAssociative]>;
161 def xor : SDNode<"ISD::XOR" , SDTIntBinOp,
162 [SDNPCommutative, SDNPAssociative]>;
164 def sext_inreg : SDNode<"ISD::SIGN_EXTEND_INREG", SDTExtInreg>;
165 def ctlz : SDNode<"ISD::CTLZ" , SDTIntUnaryOp>;
166 def cttz : SDNode<"ISD::CTTZ" , SDTIntUnaryOp>;
167 def ctpop : SDNode<"ISD::CTPOP" , SDTIntUnaryOp>;
168 def sext : SDNode<"ISD::SIGN_EXTEND", SDTIntExtendOp>;
169 def zext : SDNode<"ISD::ZERO_EXTEND", SDTIntExtendOp>;
170 def anyext : SDNode<"ISD::ANY_EXTEND" , SDTIntExtendOp>;
171 def trunc : SDNode<"ISD::TRUNCATE" , SDTIntTruncOp>;
173 def fadd : SDNode<"ISD::FADD" , SDTFPBinOp, [SDNPCommutative]>;
174 def fsub : SDNode<"ISD::FSUB" , SDTFPBinOp>;
175 def fmul : SDNode<"ISD::FMUL" , SDTFPBinOp, [SDNPCommutative]>;
176 def fdiv : SDNode<"ISD::FDIV" , SDTFPBinOp>;
177 def frem : SDNode<"ISD::FREM" , SDTFPBinOp>;
178 def fabs : SDNode<"ISD::FABS" , SDTFPUnaryOp>;
179 def fneg : SDNode<"ISD::FNEG" , SDTFPUnaryOp>;
180 def fsqrt : SDNode<"ISD::FSQRT" , SDTFPUnaryOp>;
182 def fround : SDNode<"ISD::FP_ROUND" , SDTFPRoundOp>;
183 def fextend : SDNode<"ISD::FP_EXTEND" , SDTFPExtendOp>;
185 def sint_to_fp : SDNode<"ISD::SINT_TO_FP" , SDTIntToFPOp>;
186 def uint_to_fp : SDNode<"ISD::UINT_TO_FP" , SDTIntToFPOp>;
187 def fp_to_sint : SDNode<"ISD::FP_TO_SINT" , SDTFPToIntOp>;
188 def fp_to_uint : SDNode<"ISD::FP_TO_UINT" , SDTFPToIntOp>;
190 def setcc : SDNode<"ISD::SETCC" , SDTSetCC>;
191 def select : SDNode<"ISD::SELECT" , SDTSelect>;
193 //===----------------------------------------------------------------------===//
194 // Selection DAG Condition Codes
196 class CondCode; // ISD::CondCode enums
197 def SETOEQ : CondCode; def SETOGT : CondCode;
198 def SETOGE : CondCode; def SETOLT : CondCode; def SETOLE : CondCode;
199 def SETONE : CondCode; def SETO : CondCode; def SETUO : CondCode;
200 def SETUEQ : CondCode; def SETUGT : CondCode; def SETUGE : CondCode;
201 def SETULT : CondCode; def SETULE : CondCode; def SETUNE : CondCode;
203 def SETEQ : CondCode; def SETGT : CondCode; def SETGE : CondCode;
204 def SETLT : CondCode; def SETLE : CondCode; def SETNE : CondCode;
207 //===----------------------------------------------------------------------===//
208 // Selection DAG Node Transformation Functions.
210 // This mechanism allows targets to manipulate nodes in the output DAG once a
211 // match has been formed. This is typically used to manipulate immediate
214 class SDNodeXForm<SDNode opc, code xformFunction> {
216 code XFormFunction = xformFunction;
219 def NOOP_SDNodeXForm : SDNodeXForm<imm, [{}]>;
222 //===----------------------------------------------------------------------===//
223 // Selection DAG Pattern Fragments.
225 // Pattern fragments are reusable chunks of dags that match specific things.
226 // They can take arguments and have C++ predicates that control whether they
227 // match. They are intended to make the patterns for common instructions more
228 // compact and readable.
231 /// PatFrag - Represents a pattern fragment. This can match something on the
232 /// DAG, frame a single node to multiply nested other fragments.
234 class PatFrag<dag ops, dag frag, code pred = [{}],
235 SDNodeXForm xform = NOOP_SDNodeXForm> {
238 code Predicate = pred;
239 SDNodeXForm OperandTransform = xform;
242 // PatLeaf's are pattern fragments that have no operands. This is just a helper
243 // to define immediates and other common things concisely.
244 class PatLeaf<dag frag, code pred = [{}], SDNodeXForm xform = NOOP_SDNodeXForm>
245 : PatFrag<(ops), frag, pred, xform>;
249 def immAllOnes : PatLeaf<(imm), [{ return N->isAllOnesValue(); }]>;
251 def vtInt : PatLeaf<(vt), [{ return MVT::isInteger(N->getVT()); }]>;
252 def vtFP : PatLeaf<(vt), [{ return MVT::isFloatingPoint(N->getVT()); }]>;
254 // Other helper fragments.
256 def not : PatFrag<(ops node:$in), (xor node:$in, immAllOnes)>;
257 def ineg : PatFrag<(ops node:$in), (sub 0, node:$in)>;
260 // setcc convenience fragments.
261 def setoeq : PatFrag<(ops node:$lhs, node:$rhs),
262 (setcc node:$lhs, node:$rhs, SETOEQ)>;
263 def setogt : PatFrag<(ops node:$lhs, node:$rhs),
264 (setcc node:$lhs, node:$rhs, SETOGT)>;
265 def setoge : PatFrag<(ops node:$lhs, node:$rhs),
266 (setcc node:$lhs, node:$rhs, SETOGE)>;
267 def setolt : PatFrag<(ops node:$lhs, node:$rhs),
268 (setcc node:$lhs, node:$rhs, SETOLT)>;
269 def setole : PatFrag<(ops node:$lhs, node:$rhs),
270 (setcc node:$lhs, node:$rhs, SETOLE)>;
271 def setone : PatFrag<(ops node:$lhs, node:$rhs),
272 (setcc node:$lhs, node:$rhs, SETONE)>;
273 def seto : PatFrag<(ops node:$lhs, node:$rhs),
274 (setcc node:$lhs, node:$rhs, SETO)>;
275 def setuo : PatFrag<(ops node:$lhs, node:$rhs),
276 (setcc node:$lhs, node:$rhs, SETUO)>;
277 def setueq : PatFrag<(ops node:$lhs, node:$rhs),
278 (setcc node:$lhs, node:$rhs, SETUEQ)>;
279 def setugt : PatFrag<(ops node:$lhs, node:$rhs),
280 (setcc node:$lhs, node:$rhs, SETUGT)>;
281 def setuge : PatFrag<(ops node:$lhs, node:$rhs),
282 (setcc node:$lhs, node:$rhs, SETUGE)>;
283 def setult : PatFrag<(ops node:$lhs, node:$rhs),
284 (setcc node:$lhs, node:$rhs, SETULT)>;
285 def setule : PatFrag<(ops node:$lhs, node:$rhs),
286 (setcc node:$lhs, node:$rhs, SETULE)>;
287 def setune : PatFrag<(ops node:$lhs, node:$rhs),
288 (setcc node:$lhs, node:$rhs, SETUNE)>;
289 def seteq : PatFrag<(ops node:$lhs, node:$rhs),
290 (setcc node:$lhs, node:$rhs, SETEQ)>;
291 def setgt : PatFrag<(ops node:$lhs, node:$rhs),
292 (setcc node:$lhs, node:$rhs, SETGT)>;
293 def setge : PatFrag<(ops node:$lhs, node:$rhs),
294 (setcc node:$lhs, node:$rhs, SETGE)>;
295 def setlt : PatFrag<(ops node:$lhs, node:$rhs),
296 (setcc node:$lhs, node:$rhs, SETLT)>;
297 def setle : PatFrag<(ops node:$lhs, node:$rhs),
298 (setcc node:$lhs, node:$rhs, SETLE)>;
299 def setne : PatFrag<(ops node:$lhs, node:$rhs),
300 (setcc node:$lhs, node:$rhs, SETNE)>;
302 //===----------------------------------------------------------------------===//
303 // Selection DAG Pattern Support.
305 // Patterns are what are actually matched against the target-flavored
306 // instruction selection DAG. Instructions defined by the target implicitly
307 // define patterns in most cases, but patterns can also be explicitly added when
308 // an operation is defined by a sequence of instructions (e.g. loading a large
309 // immediate value on RISC targets that do not support immediates as large as
313 class Pattern<dag patternToMatch, list<dag> resultInstrs> {
314 dag PatternToMatch = patternToMatch;
315 list<dag> ResultInstrs = resultInstrs;
318 // Pat - A simple (but common) form of a pattern, which produces a simple result
319 // not needing a full list.
320 class Pat<dag pattern, dag result> : Pattern<pattern, [result]>;