]>
Commit | Line | Data |
---|---|---|
7adcbafe | 1 | @c Copyright (C) 1988-2022 Free Software Foundation, Inc. |
03dda8e3 RK |
2 | @c This is part of the GCC manual. |
3 | @c For copying conditions, see the file gcc.texi. | |
4 | ||
5 | @ifset INTERNALS | |
6 | @node Machine Desc | |
7 | @chapter Machine Descriptions | |
8 | @cindex machine descriptions | |
9 | ||
10 | A machine description has two parts: a file of instruction patterns | |
11 | (@file{.md} file) and a C header file of macro definitions. | |
12 | ||
13 | The @file{.md} file for a target machine contains a pattern for each | |
14 | instruction that the target machine supports (or at least each instruction | |
15 | that is worth telling the compiler about). It may also contain comments. | |
16 | A semicolon causes the rest of the line to be a comment, unless the semicolon | |
17 | is inside a quoted string. | |
18 | ||
19 | See the next chapter for information on the C header file. | |
20 | ||
21 | @menu | |
55e4756f | 22 | * Overview:: How the machine description is used. |
03dda8e3 RK |
23 | * Patterns:: How to write instruction patterns. |
24 | * Example:: An explained example of a @code{define_insn} pattern. | |
25 | * RTL Template:: The RTL template defines what insns match a pattern. | |
26 | * Output Template:: The output template says how to make assembler code | |
6ccde948 | 27 | from such an insn. |
03dda8e3 | 28 | * Output Statement:: For more generality, write C code to output |
6ccde948 | 29 | the assembler code. |
e543e219 | 30 | * Predicates:: Controlling what kinds of operands can be used |
6ccde948 | 31 | for an insn. |
e543e219 | 32 | * Constraints:: Fine-tuning operand selection. |
03dda8e3 RK |
33 | * Standard Names:: Names mark patterns to use for code generation. |
34 | * Pattern Ordering:: When the order of patterns makes a difference. | |
35 | * Dependent Patterns:: Having one pattern may make you need another. | |
36 | * Jump Patterns:: Special considerations for patterns for jump insns. | |
6e4fcc95 | 37 | * Looping Patterns:: How to define patterns for special looping insns. |
03dda8e3 | 38 | * Insn Canonicalizations::Canonicalization of Instructions |
03dda8e3 | 39 | * Expander Definitions::Generating a sequence of several RTL insns |
6ccde948 | 40 | for a standard operation. |
f3a3d0d3 | 41 | * Insn Splitting:: Splitting Instructions into Multiple Instructions. |
6ccde948 | 42 | * Including Patterns:: Including Patterns in Machine Descriptions. |
f3a3d0d3 | 43 | * Peephole Definitions::Defining machine-specific peephole optimizations. |
03dda8e3 | 44 | * Insn Attributes:: Specifying the value of attributes for generated insns. |
3262c1f5 | 45 | * Conditional Execution::Generating @code{define_insn} patterns for |
6ccde948 | 46 | predication. |
477c104e MK |
47 | * Define Subst:: Generating @code{define_insn} and @code{define_expand} |
48 | patterns from other patterns. | |
c25c12b8 R |
49 | * Constant Definitions::Defining symbolic constants that can be used in the |
50 | md file. | |
3abcb3a7 | 51 | * Iterators:: Using iterators to generate patterns from a template. |
03dda8e3 RK |
52 | @end menu |
53 | ||
55e4756f DD |
54 | @node Overview |
55 | @section Overview of How the Machine Description is Used | |
56 | ||
57 | There are three main conversions that happen in the compiler: | |
58 | ||
59 | @enumerate | |
60 | ||
61 | @item | |
62 | The front end reads the source code and builds a parse tree. | |
63 | ||
64 | @item | |
65 | The parse tree is used to generate an RTL insn list based on named | |
66 | instruction patterns. | |
67 | ||
68 | @item | |
69 | The insn list is matched against the RTL templates to produce assembler | |
70 | code. | |
71 | ||
72 | @end enumerate | |
73 | ||
74 | For the generate pass, only the names of the insns matter, from either a | |
75 | named @code{define_insn} or a @code{define_expand}. The compiler will | |
76 | choose the pattern with the right name and apply the operands according | |
77 | to the documentation later in this chapter, without regard for the RTL | |
78 | template or operand constraints. Note that the names the compiler looks | |
d7d9c429 | 79 | for are hard-coded in the compiler---it will ignore unnamed patterns and |
55e4756f DD |
80 | patterns with names it doesn't know about, but if you don't provide a |
81 | named pattern it needs, it will abort. | |
82 | ||
83 | If a @code{define_insn} is used, the template given is inserted into the | |
84 | insn list. If a @code{define_expand} is used, one of three things | |
85 | happens, based on the condition logic. The condition logic may manually | |
86 | create new insns for the insn list, say via @code{emit_insn()}, and | |
aee96fe9 | 87 | invoke @code{DONE}. For certain named patterns, it may invoke @code{FAIL} to tell the |
55e4756f DD |
88 | compiler to use an alternate way of performing that task. If it invokes |
89 | neither @code{DONE} nor @code{FAIL}, the template given in the pattern | |
90 | is inserted, as if the @code{define_expand} were a @code{define_insn}. | |
91 | ||
92 | Once the insn list is generated, various optimization passes convert, | |
93 | replace, and rearrange the insns in the insn list. This is where the | |
94 | @code{define_split} and @code{define_peephole} patterns get used, for | |
95 | example. | |
96 | ||
97 | Finally, the insn list's RTL is matched up with the RTL templates in the | |
98 | @code{define_insn} patterns, and those patterns are used to emit the | |
99 | final assembly code. For this purpose, each named @code{define_insn} | |
100 | acts like it's unnamed, since the names are ignored. | |
101 | ||
03dda8e3 RK |
102 | @node Patterns |
103 | @section Everything about Instruction Patterns | |
104 | @cindex patterns | |
105 | @cindex instruction patterns | |
106 | ||
107 | @findex define_insn | |
2f9d3709 JG |
108 | A @code{define_insn} expression is used to define instruction patterns |
109 | to which insns may be matched. A @code{define_insn} expression contains | |
110 | an incomplete RTL expression, with pieces to be filled in later, operand | |
111 | constraints that restrict how the pieces can be filled in, and an output | |
112 | template or C code to generate the assembler output. | |
03dda8e3 RK |
113 | |
114 | A @code{define_insn} is an RTL expression containing four or five operands: | |
115 | ||
116 | @enumerate | |
117 | @item | |
0016d8d9 RS |
118 | An optional name @var{n}. When a name is present, the compiler |
119 | automically generates a C++ function @samp{gen_@var{n}} that takes | |
120 | the operands of the instruction as arguments and returns the instruction's | |
121 | rtx pattern. The compiler also assigns the instruction a unique code | |
122 | @samp{CODE_FOR_@var{n}}, with all such codes belonging to an enum | |
123 | called @code{insn_code}. | |
124 | ||
125 | These names serve one of two purposes. The first is to indicate that the | |
126 | instruction performs a certain standard job for the RTL-generation | |
127 | pass of the compiler, such as a move, an addition, or a conditional | |
128 | jump. The second is to help the target generate certain target-specific | |
129 | operations, such as when implementing target-specific intrinsic functions. | |
130 | ||
131 | It is better to prefix target-specific names with the name of the | |
132 | target, to avoid any clash with current or future standard names. | |
03dda8e3 RK |
133 | |
134 | The absence of a name is indicated by writing an empty string | |
135 | where the name should go. Nameless instruction patterns are never | |
136 | used for generating RTL code, but they may permit several simpler insns | |
137 | to be combined later on. | |
138 | ||
661cb0b7 RK |
139 | For the purpose of debugging the compiler, you may also specify a |
140 | name beginning with the @samp{*} character. Such a name is used only | |
2f9d3709 JG |
141 | for identifying the instruction in RTL dumps; it is equivalent to having |
142 | a nameless pattern for all other purposes. Names beginning with the | |
143 | @samp{*} character are not required to be unique. | |
661cb0b7 | 144 | |
0016d8d9 RS |
145 | The name may also have the form @samp{@@@var{n}}. This has the same |
146 | effect as a name @samp{@var{n}}, but in addition tells the compiler to | |
8bdea528 | 147 | generate further helper functions; see @ref{Parameterized Names} for details. |
0016d8d9 | 148 | |
03dda8e3 | 149 | @item |
2f9d3709 JG |
150 | The @dfn{RTL template}: This is a vector of incomplete RTL expressions |
151 | which describe the semantics of the instruction (@pxref{RTL Template}). | |
152 | It is incomplete because it may contain @code{match_operand}, | |
03dda8e3 RK |
153 | @code{match_operator}, and @code{match_dup} expressions that stand for |
154 | operands of the instruction. | |
155 | ||
2f9d3709 JG |
156 | If the vector has multiple elements, the RTL template is treated as a |
157 | @code{parallel} expression. | |
03dda8e3 RK |
158 | |
159 | @item | |
160 | @cindex pattern conditions | |
161 | @cindex conditions, in patterns | |
2f9d3709 JG |
162 | The condition: This is a string which contains a C expression. When the |
163 | compiler attempts to match RTL against a pattern, the condition is | |
164 | evaluated. If the condition evaluates to @code{true}, the match is | |
165 | permitted. The condition may be an empty string, which is treated | |
166 | as always @code{true}. | |
03dda8e3 RK |
167 | |
168 | @cindex named patterns and conditions | |
2f9d3709 JG |
169 | For a named pattern, the condition may not depend on the data in the |
170 | insn being matched, but only the target-machine-type flags. The compiler | |
171 | needs to test these conditions during initialization in order to learn | |
172 | exactly which named instructions are available in a particular run. | |
03dda8e3 RK |
173 | |
174 | @findex operands | |
175 | For nameless patterns, the condition is applied only when matching an | |
176 | individual insn, and only after the insn has matched the pattern's | |
177 | recognition template. The insn's operands may be found in the vector | |
2f9d3709 JG |
178 | @code{operands}. |
179 | ||
49e478af RS |
180 | An instruction condition cannot become more restrictive as compilation |
181 | progresses. If the condition accepts a particular RTL instruction at | |
182 | one stage of compilation, it must continue to accept that instruction | |
183 | until the final pass. For example, @samp{!reload_completed} and | |
184 | @samp{can_create_pseudo_p ()} are both invalid instruction conditions, | |
185 | because they are true during the earlier RTL passes and false during | |
186 | the later ones. For the same reason, if a condition accepts an | |
187 | instruction before register allocation, it cannot later try to control | |
188 | register allocation by excluding certain register or value combinations. | |
189 | ||
190 | Although a condition cannot become more restrictive as compilation | |
191 | progresses, the condition for a nameless pattern @emph{can} become | |
192 | more permissive. For example, a nameless instruction can require | |
193 | @samp{reload_completed} to be true, in which case it only matches | |
194 | after register allocation. | |
03dda8e3 RK |
195 | |
196 | @item | |
2f9d3709 JG |
197 | The @dfn{output template} or @dfn{output statement}: This is either |
198 | a string, or a fragment of C code which returns a string. | |
03dda8e3 RK |
199 | |
200 | When simple substitution isn't general enough, you can specify a piece | |
201 | of C code to compute the output. @xref{Output Statement}. | |
202 | ||
203 | @item | |
2f9d3709 JG |
204 | The @dfn{insn attributes}: This is an optional vector containing the values of |
205 | attributes for insns matching this pattern (@pxref{Insn Attributes}). | |
03dda8e3 RK |
206 | @end enumerate |
207 | ||
208 | @node Example | |
209 | @section Example of @code{define_insn} | |
210 | @cindex @code{define_insn} example | |
211 | ||
2f9d3709 JG |
212 | Here is an example of an instruction pattern, taken from the machine |
213 | description for the 68000/68020. | |
03dda8e3 | 214 | |
3ab51846 | 215 | @smallexample |
03dda8e3 RK |
216 | (define_insn "tstsi" |
217 | [(set (cc0) | |
218 | (match_operand:SI 0 "general_operand" "rm"))] | |
219 | "" | |
220 | "* | |
f282ffb3 | 221 | @{ |
0f40f9f7 | 222 | if (TARGET_68020 || ! ADDRESS_REG_P (operands[0])) |
03dda8e3 | 223 | return \"tstl %0\"; |
f282ffb3 | 224 | return \"cmpl #0,%0\"; |
0f40f9f7 | 225 | @}") |
3ab51846 | 226 | @end smallexample |
0f40f9f7 ZW |
227 | |
228 | @noindent | |
229 | This can also be written using braced strings: | |
230 | ||
3ab51846 | 231 | @smallexample |
0f40f9f7 ZW |
232 | (define_insn "tstsi" |
233 | [(set (cc0) | |
234 | (match_operand:SI 0 "general_operand" "rm"))] | |
235 | "" | |
f282ffb3 | 236 | @{ |
0f40f9f7 ZW |
237 | if (TARGET_68020 || ! ADDRESS_REG_P (operands[0])) |
238 | return "tstl %0"; | |
f282ffb3 | 239 | return "cmpl #0,%0"; |
0f40f9f7 | 240 | @}) |
3ab51846 | 241 | @end smallexample |
03dda8e3 | 242 | |
2f9d3709 JG |
243 | This describes an instruction which sets the condition codes based on the |
244 | value of a general operand. It has no condition, so any insn with an RTL | |
245 | description of the form shown may be matched to this pattern. The name | |
246 | @samp{tstsi} means ``test a @code{SImode} value'' and tells the RTL | |
247 | generation pass that, when it is necessary to test such a value, an insn | |
248 | to do so can be constructed using this pattern. | |
03dda8e3 RK |
249 | |
250 | The output control string is a piece of C code which chooses which | |
251 | output template to return based on the kind of operand and the specific | |
252 | type of CPU for which code is being generated. | |
253 | ||
254 | @samp{"rm"} is an operand constraint. Its meaning is explained below. | |
255 | ||
256 | @node RTL Template | |
257 | @section RTL Template | |
258 | @cindex RTL insn template | |
259 | @cindex generating insns | |
260 | @cindex insns, generating | |
261 | @cindex recognizing insns | |
262 | @cindex insns, recognizing | |
263 | ||
264 | The RTL template is used to define which insns match the particular pattern | |
265 | and how to find their operands. For named patterns, the RTL template also | |
266 | says how to construct an insn from specified operands. | |
267 | ||
268 | Construction involves substituting specified operands into a copy of the | |
269 | template. Matching involves determining the values that serve as the | |
270 | operands in the insn being matched. Both of these activities are | |
271 | controlled by special expression types that direct matching and | |
272 | substitution of the operands. | |
273 | ||
274 | @table @code | |
275 | @findex match_operand | |
276 | @item (match_operand:@var{m} @var{n} @var{predicate} @var{constraint}) | |
277 | This expression is a placeholder for operand number @var{n} of | |
278 | the insn. When constructing an insn, operand number @var{n} | |
279 | will be substituted at this point. When matching an insn, whatever | |
280 | appears at this position in the insn will be taken as operand | |
281 | number @var{n}; but it must satisfy @var{predicate} or this instruction | |
282 | pattern will not match at all. | |
283 | ||
284 | Operand numbers must be chosen consecutively counting from zero in | |
285 | each instruction pattern. There may be only one @code{match_operand} | |
286 | expression in the pattern for each operand number. Usually operands | |
287 | are numbered in the order of appearance in @code{match_operand} | |
72938a4c MM |
288 | expressions. In the case of a @code{define_expand}, any operand numbers |
289 | used only in @code{match_dup} expressions have higher values than all | |
290 | other operand numbers. | |
03dda8e3 | 291 | |
e543e219 ZW |
292 | @var{predicate} is a string that is the name of a function that |
293 | accepts two arguments, an expression and a machine mode. | |
294 | @xref{Predicates}. During matching, the function will be called with | |
295 | the putative operand as the expression and @var{m} as the mode | |
296 | argument (if @var{m} is not specified, @code{VOIDmode} will be used, | |
297 | which normally causes @var{predicate} to accept any mode). If it | |
298 | returns zero, this instruction pattern fails to match. | |
299 | @var{predicate} may be an empty string; then it means no test is to be | |
300 | done on the operand, so anything which occurs in this position is | |
301 | valid. | |
03dda8e3 RK |
302 | |
303 | Most of the time, @var{predicate} will reject modes other than @var{m}---but | |
304 | not always. For example, the predicate @code{address_operand} uses | |
305 | @var{m} as the mode of memory ref that the address should be valid for. | |
306 | Many predicates accept @code{const_int} nodes even though their mode is | |
307 | @code{VOIDmode}. | |
308 | ||
309 | @var{constraint} controls reloading and the choice of the best register | |
310 | class to use for a value, as explained later (@pxref{Constraints}). | |
e543e219 | 311 | If the constraint would be an empty string, it can be omitted. |
03dda8e3 RK |
312 | |
313 | People are often unclear on the difference between the constraint and the | |
314 | predicate. The predicate helps decide whether a given insn matches the | |
315 | pattern. The constraint plays no role in this decision; instead, it | |
316 | controls various decisions in the case of an insn which does match. | |
317 | ||
03dda8e3 RK |
318 | @findex match_scratch |
319 | @item (match_scratch:@var{m} @var{n} @var{constraint}) | |
320 | This expression is also a placeholder for operand number @var{n} | |
321 | and indicates that operand must be a @code{scratch} or @code{reg} | |
322 | expression. | |
323 | ||
324 | When matching patterns, this is equivalent to | |
325 | ||
326 | @smallexample | |
e80f9fef | 327 | (match_operand:@var{m} @var{n} "scratch_operand" @var{constraint}) |
03dda8e3 RK |
328 | @end smallexample |
329 | ||
330 | but, when generating RTL, it produces a (@code{scratch}:@var{m}) | |
331 | expression. | |
332 | ||
333 | If the last few expressions in a @code{parallel} are @code{clobber} | |
334 | expressions whose operands are either a hard register or | |
335 | @code{match_scratch}, the combiner can add or delete them when | |
336 | necessary. @xref{Side Effects}. | |
337 | ||
338 | @findex match_dup | |
339 | @item (match_dup @var{n}) | |
340 | This expression is also a placeholder for operand number @var{n}. | |
341 | It is used when the operand needs to appear more than once in the | |
342 | insn. | |
343 | ||
344 | In construction, @code{match_dup} acts just like @code{match_operand}: | |
345 | the operand is substituted into the insn being constructed. But in | |
346 | matching, @code{match_dup} behaves differently. It assumes that operand | |
347 | number @var{n} has already been determined by a @code{match_operand} | |
348 | appearing earlier in the recognition template, and it matches only an | |
349 | identical-looking expression. | |
350 | ||
55e4756f DD |
351 | Note that @code{match_dup} should not be used to tell the compiler that |
352 | a particular register is being used for two operands (example: | |
353 | @code{add} that adds one register to another; the second register is | |
354 | both an input operand and the output operand). Use a matching | |
355 | constraint (@pxref{Simple Constraints}) for those. @code{match_dup} is for the cases where one | |
356 | operand is used in two places in the template, such as an instruction | |
357 | that computes both a quotient and a remainder, where the opcode takes | |
358 | two input operands but the RTL template has to refer to each of those | |
359 | twice; once for the quotient pattern and once for the remainder pattern. | |
360 | ||
03dda8e3 RK |
361 | @findex match_operator |
362 | @item (match_operator:@var{m} @var{n} @var{predicate} [@var{operands}@dots{}]) | |
363 | This pattern is a kind of placeholder for a variable RTL expression | |
364 | code. | |
365 | ||
366 | When constructing an insn, it stands for an RTL expression whose | |
367 | expression code is taken from that of operand @var{n}, and whose | |
368 | operands are constructed from the patterns @var{operands}. | |
369 | ||
370 | When matching an expression, it matches an expression if the function | |
371 | @var{predicate} returns nonzero on that expression @emph{and} the | |
372 | patterns @var{operands} match the operands of the expression. | |
373 | ||
374 | Suppose that the function @code{commutative_operator} is defined as | |
375 | follows, to match any expression whose operator is one of the | |
376 | commutative arithmetic operators of RTL and whose mode is @var{mode}: | |
377 | ||
378 | @smallexample | |
379 | int | |
ec8e098d | 380 | commutative_integer_operator (x, mode) |
03dda8e3 | 381 | rtx x; |
ef4bddc2 | 382 | machine_mode mode; |
03dda8e3 RK |
383 | @{ |
384 | enum rtx_code code = GET_CODE (x); | |
385 | if (GET_MODE (x) != mode) | |
386 | return 0; | |
ec8e098d | 387 | return (GET_RTX_CLASS (code) == RTX_COMM_ARITH |
03dda8e3 RK |
388 | || code == EQ || code == NE); |
389 | @} | |
390 | @end smallexample | |
391 | ||
392 | Then the following pattern will match any RTL expression consisting | |
393 | of a commutative operator applied to two general operands: | |
394 | ||
395 | @smallexample | |
396 | (match_operator:SI 3 "commutative_operator" | |
397 | [(match_operand:SI 1 "general_operand" "g") | |
398 | (match_operand:SI 2 "general_operand" "g")]) | |
399 | @end smallexample | |
400 | ||
401 | Here the vector @code{[@var{operands}@dots{}]} contains two patterns | |
402 | because the expressions to be matched all contain two operands. | |
403 | ||
404 | When this pattern does match, the two operands of the commutative | |
405 | operator are recorded as operands 1 and 2 of the insn. (This is done | |
406 | by the two instances of @code{match_operand}.) Operand 3 of the insn | |
407 | will be the entire commutative expression: use @code{GET_CODE | |
408 | (operands[3])} to see which commutative operator was used. | |
409 | ||
410 | The machine mode @var{m} of @code{match_operator} works like that of | |
411 | @code{match_operand}: it is passed as the second argument to the | |
412 | predicate function, and that function is solely responsible for | |
413 | deciding whether the expression to be matched ``has'' that mode. | |
414 | ||
415 | When constructing an insn, argument 3 of the gen-function will specify | |
e979f9e8 | 416 | the operation (i.e.@: the expression code) for the expression to be |
03dda8e3 RK |
417 | made. It should be an RTL expression, whose expression code is copied |
418 | into a new expression whose operands are arguments 1 and 2 of the | |
419 | gen-function. The subexpressions of argument 3 are not used; | |
420 | only its expression code matters. | |
421 | ||
422 | When @code{match_operator} is used in a pattern for matching an insn, | |
423 | it usually best if the operand number of the @code{match_operator} | |
424 | is higher than that of the actual operands of the insn. This improves | |
425 | register allocation because the register allocator often looks at | |
426 | operands 1 and 2 of insns to see if it can do register tying. | |
427 | ||
428 | There is no way to specify constraints in @code{match_operator}. The | |
429 | operand of the insn which corresponds to the @code{match_operator} | |
430 | never has any constraints because it is never reloaded as a whole. | |
431 | However, if parts of its @var{operands} are matched by | |
432 | @code{match_operand} patterns, those parts may have constraints of | |
433 | their own. | |
434 | ||
435 | @findex match_op_dup | |
436 | @item (match_op_dup:@var{m} @var{n}[@var{operands}@dots{}]) | |
437 | Like @code{match_dup}, except that it applies to operators instead of | |
438 | operands. When constructing an insn, operand number @var{n} will be | |
439 | substituted at this point. But in matching, @code{match_op_dup} behaves | |
440 | differently. It assumes that operand number @var{n} has already been | |
441 | determined by a @code{match_operator} appearing earlier in the | |
442 | recognition template, and it matches only an identical-looking | |
443 | expression. | |
444 | ||
445 | @findex match_parallel | |
446 | @item (match_parallel @var{n} @var{predicate} [@var{subpat}@dots{}]) | |
447 | This pattern is a placeholder for an insn that consists of a | |
448 | @code{parallel} expression with a variable number of elements. This | |
449 | expression should only appear at the top level of an insn pattern. | |
450 | ||
451 | When constructing an insn, operand number @var{n} will be substituted at | |
452 | this point. When matching an insn, it matches if the body of the insn | |
453 | is a @code{parallel} expression with at least as many elements as the | |
454 | vector of @var{subpat} expressions in the @code{match_parallel}, if each | |
455 | @var{subpat} matches the corresponding element of the @code{parallel}, | |
456 | @emph{and} the function @var{predicate} returns nonzero on the | |
457 | @code{parallel} that is the body of the insn. It is the responsibility | |
458 | of the predicate to validate elements of the @code{parallel} beyond | |
bd819a4a | 459 | those listed in the @code{match_parallel}. |
03dda8e3 RK |
460 | |
461 | A typical use of @code{match_parallel} is to match load and store | |
462 | multiple expressions, which can contain a variable number of elements | |
463 | in a @code{parallel}. For example, | |
03dda8e3 RK |
464 | |
465 | @smallexample | |
466 | (define_insn "" | |
467 | [(match_parallel 0 "load_multiple_operation" | |
468 | [(set (match_operand:SI 1 "gpc_reg_operand" "=r") | |
469 | (match_operand:SI 2 "memory_operand" "m")) | |
470 | (use (reg:SI 179)) | |
471 | (clobber (reg:SI 179))])] | |
472 | "" | |
473 | "loadm 0,0,%1,%2") | |
474 | @end smallexample | |
475 | ||
476 | This example comes from @file{a29k.md}. The function | |
9c34dbbf | 477 | @code{load_multiple_operation} is defined in @file{a29k.c} and checks |
03dda8e3 RK |
478 | that subsequent elements in the @code{parallel} are the same as the |
479 | @code{set} in the pattern, except that they are referencing subsequent | |
480 | registers and memory locations. | |
481 | ||
482 | An insn that matches this pattern might look like: | |
483 | ||
484 | @smallexample | |
485 | (parallel | |
486 | [(set (reg:SI 20) (mem:SI (reg:SI 100))) | |
487 | (use (reg:SI 179)) | |
488 | (clobber (reg:SI 179)) | |
489 | (set (reg:SI 21) | |
490 | (mem:SI (plus:SI (reg:SI 100) | |
491 | (const_int 4)))) | |
492 | (set (reg:SI 22) | |
493 | (mem:SI (plus:SI (reg:SI 100) | |
494 | (const_int 8))))]) | |
495 | @end smallexample | |
496 | ||
497 | @findex match_par_dup | |
498 | @item (match_par_dup @var{n} [@var{subpat}@dots{}]) | |
499 | Like @code{match_op_dup}, but for @code{match_parallel} instead of | |
500 | @code{match_operator}. | |
501 | ||
03dda8e3 RK |
502 | @end table |
503 | ||
504 | @node Output Template | |
505 | @section Output Templates and Operand Substitution | |
506 | @cindex output templates | |
507 | @cindex operand substitution | |
508 | ||
509 | @cindex @samp{%} in template | |
510 | @cindex percent sign | |
511 | The @dfn{output template} is a string which specifies how to output the | |
512 | assembler code for an instruction pattern. Most of the template is a | |
513 | fixed string which is output literally. The character @samp{%} is used | |
514 | to specify where to substitute an operand; it can also be used to | |
515 | identify places where different variants of the assembler require | |
516 | different syntax. | |
517 | ||
518 | In the simplest case, a @samp{%} followed by a digit @var{n} says to output | |
519 | operand @var{n} at that point in the string. | |
520 | ||
521 | @samp{%} followed by a letter and a digit says to output an operand in an | |
522 | alternate fashion. Four letters have standard, built-in meanings described | |
523 | below. The machine description macro @code{PRINT_OPERAND} can define | |
524 | additional letters with nonstandard meanings. | |
525 | ||
526 | @samp{%c@var{digit}} can be used to substitute an operand that is a | |
527 | constant value without the syntax that normally indicates an immediate | |
528 | operand. | |
529 | ||
530 | @samp{%n@var{digit}} is like @samp{%c@var{digit}} except that the value of | |
531 | the constant is negated before printing. | |
532 | ||
533 | @samp{%a@var{digit}} can be used to substitute an operand as if it were a | |
534 | memory reference, with the actual operand treated as the address. This may | |
535 | be useful when outputting a ``load address'' instruction, because often the | |
536 | assembler syntax for such an instruction requires you to write the operand | |
537 | as if it were a memory reference. | |
538 | ||
539 | @samp{%l@var{digit}} is used to substitute a @code{label_ref} into a jump | |
540 | instruction. | |
541 | ||
542 | @samp{%=} outputs a number which is unique to each instruction in the | |
543 | entire compilation. This is useful for making local labels to be | |
544 | referred to more than once in a single template that generates multiple | |
545 | assembler instructions. | |
546 | ||
547 | @samp{%} followed by a punctuation character specifies a substitution that | |
548 | does not use an operand. Only one case is standard: @samp{%%} outputs a | |
549 | @samp{%} into the assembler code. Other nonstandard cases can be | |
550 | defined in the @code{PRINT_OPERAND} macro. You must also define | |
551 | which punctuation characters are valid with the | |
552 | @code{PRINT_OPERAND_PUNCT_VALID_P} macro. | |
553 | ||
554 | @cindex \ | |
555 | @cindex backslash | |
556 | The template may generate multiple assembler instructions. Write the text | |
557 | for the instructions, with @samp{\;} between them. | |
558 | ||
559 | @cindex matching operands | |
560 | When the RTL contains two operands which are required by constraint to match | |
561 | each other, the output template must refer only to the lower-numbered operand. | |
562 | Matching operands are not always identical, and the rest of the compiler | |
563 | arranges to put the proper RTL expression for printing into the lower-numbered | |
564 | operand. | |
565 | ||
566 | One use of nonstandard letters or punctuation following @samp{%} is to | |
567 | distinguish between different assembler languages for the same machine; for | |
568 | example, Motorola syntax versus MIT syntax for the 68000. Motorola syntax | |
569 | requires periods in most opcode names, while MIT syntax does not. For | |
570 | example, the opcode @samp{movel} in MIT syntax is @samp{move.l} in Motorola | |
571 | syntax. The same file of patterns is used for both kinds of output syntax, | |
572 | but the character sequence @samp{%.} is used in each place where Motorola | |
573 | syntax wants a period. The @code{PRINT_OPERAND} macro for Motorola syntax | |
574 | defines the sequence to output a period; the macro for MIT syntax defines | |
575 | it to do nothing. | |
576 | ||
577 | @cindex @code{#} in template | |
578 | As a special case, a template consisting of the single character @code{#} | |
579 | instructs the compiler to first split the insn, and then output the | |
580 | resulting instructions separately. This helps eliminate redundancy in the | |
581 | output templates. If you have a @code{define_insn} that needs to emit | |
e4ae5e77 | 582 | multiple assembler instructions, and there is a matching @code{define_split} |
03dda8e3 RK |
583 | already defined, then you can simply use @code{#} as the output template |
584 | instead of writing an output template that emits the multiple assembler | |
585 | instructions. | |
586 | ||
49e478af RS |
587 | Note that @code{#} only has an effect while generating assembly code; |
588 | it does not affect whether a split occurs earlier. An associated | |
589 | @code{define_split} must exist and it must be suitable for use after | |
590 | register allocation. | |
591 | ||
03dda8e3 RK |
592 | If the macro @code{ASSEMBLER_DIALECT} is defined, you can use construct |
593 | of the form @samp{@{option0|option1|option2@}} in the templates. These | |
594 | describe multiple variants of assembler language syntax. | |
595 | @xref{Instruction Output}. | |
596 | ||
597 | @node Output Statement | |
598 | @section C Statements for Assembler Output | |
599 | @cindex output statements | |
600 | @cindex C statements for assembler output | |
601 | @cindex generating assembler output | |
602 | ||
603 | Often a single fixed template string cannot produce correct and efficient | |
604 | assembler code for all the cases that are recognized by a single | |
605 | instruction pattern. For example, the opcodes may depend on the kinds of | |
606 | operands; or some unfortunate combinations of operands may require extra | |
607 | machine instructions. | |
608 | ||
609 | If the output control string starts with a @samp{@@}, then it is actually | |
610 | a series of templates, each on a separate line. (Blank lines and | |
611 | leading spaces and tabs are ignored.) The templates correspond to the | |
612 | pattern's constraint alternatives (@pxref{Multi-Alternative}). For example, | |
613 | if a target machine has a two-address add instruction @samp{addr} to add | |
614 | into a register and another @samp{addm} to add a register to memory, you | |
615 | might write this pattern: | |
616 | ||
617 | @smallexample | |
618 | (define_insn "addsi3" | |
619 | [(set (match_operand:SI 0 "general_operand" "=r,m") | |
620 | (plus:SI (match_operand:SI 1 "general_operand" "0,0") | |
621 | (match_operand:SI 2 "general_operand" "g,r")))] | |
622 | "" | |
623 | "@@ | |
624 | addr %2,%0 | |
625 | addm %2,%0") | |
626 | @end smallexample | |
627 | ||
628 | @cindex @code{*} in template | |
629 | @cindex asterisk in template | |
630 | If the output control string starts with a @samp{*}, then it is not an | |
631 | output template but rather a piece of C program that should compute a | |
632 | template. It should execute a @code{return} statement to return the | |
633 | template-string you want. Most such templates use C string literals, which | |
634 | require doublequote characters to delimit them. To include these | |
635 | doublequote characters in the string, prefix each one with @samp{\}. | |
636 | ||
0f40f9f7 ZW |
637 | If the output control string is written as a brace block instead of a |
638 | double-quoted string, it is automatically assumed to be C code. In that | |
639 | case, it is not necessary to put in a leading asterisk, or to escape the | |
640 | doublequotes surrounding C string literals. | |
641 | ||
03dda8e3 RK |
642 | The operands may be found in the array @code{operands}, whose C data type |
643 | is @code{rtx []}. | |
644 | ||
645 | It is very common to select different ways of generating assembler code | |
646 | based on whether an immediate operand is within a certain range. Be | |
647 | careful when doing this, because the result of @code{INTVAL} is an | |
648 | integer on the host machine. If the host machine has more bits in an | |
649 | @code{int} than the target machine has in the mode in which the constant | |
650 | will be used, then some of the bits you get from @code{INTVAL} will be | |
651 | superfluous. For proper results, you must carefully disregard the | |
652 | values of those bits. | |
653 | ||
654 | @findex output_asm_insn | |
655 | It is possible to output an assembler instruction and then go on to output | |
656 | or compute more of them, using the subroutine @code{output_asm_insn}. This | |
657 | receives two arguments: a template-string and a vector of operands. The | |
658 | vector may be @code{operands}, or it may be another array of @code{rtx} | |
659 | that you declare locally and initialize yourself. | |
660 | ||
661 | @findex which_alternative | |
662 | When an insn pattern has multiple alternatives in its constraints, often | |
663 | the appearance of the assembler code is determined mostly by which alternative | |
664 | was matched. When this is so, the C code can test the variable | |
665 | @code{which_alternative}, which is the ordinal number of the alternative | |
666 | that was actually satisfied (0 for the first, 1 for the second alternative, | |
667 | etc.). | |
668 | ||
669 | For example, suppose there are two opcodes for storing zero, @samp{clrreg} | |
670 | for registers and @samp{clrmem} for memory locations. Here is how | |
671 | a pattern could use @code{which_alternative} to choose between them: | |
672 | ||
673 | @smallexample | |
674 | (define_insn "" | |
675 | [(set (match_operand:SI 0 "general_operand" "=r,m") | |
676 | (const_int 0))] | |
677 | "" | |
0f40f9f7 | 678 | @{ |
03dda8e3 | 679 | return (which_alternative == 0 |
0f40f9f7 ZW |
680 | ? "clrreg %0" : "clrmem %0"); |
681 | @}) | |
03dda8e3 RK |
682 | @end smallexample |
683 | ||
684 | The example above, where the assembler code to generate was | |
685 | @emph{solely} determined by the alternative, could also have been specified | |
686 | as follows, having the output control string start with a @samp{@@}: | |
687 | ||
688 | @smallexample | |
689 | @group | |
690 | (define_insn "" | |
691 | [(set (match_operand:SI 0 "general_operand" "=r,m") | |
692 | (const_int 0))] | |
693 | "" | |
694 | "@@ | |
695 | clrreg %0 | |
696 | clrmem %0") | |
697 | @end group | |
698 | @end smallexample | |
e543e219 | 699 | |
94c765ab R |
700 | If you just need a little bit of C code in one (or a few) alternatives, |
701 | you can use @samp{*} inside of a @samp{@@} multi-alternative template: | |
702 | ||
703 | @smallexample | |
704 | @group | |
705 | (define_insn "" | |
706 | [(set (match_operand:SI 0 "general_operand" "=r,<,m") | |
707 | (const_int 0))] | |
708 | "" | |
709 | "@@ | |
710 | clrreg %0 | |
711 | * return stack_mem_p (operands[0]) ? \"push 0\" : \"clrmem %0\"; | |
712 | clrmem %0") | |
713 | @end group | |
714 | @end smallexample | |
715 | ||
e543e219 ZW |
716 | @node Predicates |
717 | @section Predicates | |
718 | @cindex predicates | |
719 | @cindex operand predicates | |
720 | @cindex operator predicates | |
721 | ||
722 | A predicate determines whether a @code{match_operand} or | |
723 | @code{match_operator} expression matches, and therefore whether the | |
724 | surrounding instruction pattern will be used for that combination of | |
725 | operands. GCC has a number of machine-independent predicates, and you | |
726 | can define machine-specific predicates as needed. By convention, | |
727 | predicates used with @code{match_operand} have names that end in | |
728 | @samp{_operand}, and those used with @code{match_operator} have names | |
729 | that end in @samp{_operator}. | |
730 | ||
527a3750 | 731 | All predicates are boolean functions (in the mathematical sense) of |
e543e219 ZW |
732 | two arguments: the RTL expression that is being considered at that |
733 | position in the instruction pattern, and the machine mode that the | |
734 | @code{match_operand} or @code{match_operator} specifies. In this | |
735 | section, the first argument is called @var{op} and the second argument | |
736 | @var{mode}. Predicates can be called from C as ordinary two-argument | |
737 | functions; this can be useful in output templates or other | |
738 | machine-specific code. | |
739 | ||
740 | Operand predicates can allow operands that are not actually acceptable | |
741 | to the hardware, as long as the constraints give reload the ability to | |
742 | fix them up (@pxref{Constraints}). However, GCC will usually generate | |
743 | better code if the predicates specify the requirements of the machine | |
744 | instructions as closely as possible. Reload cannot fix up operands | |
745 | that must be constants (``immediate operands''); you must use a | |
746 | predicate that allows only constants, or else enforce the requirement | |
747 | in the extra condition. | |
748 | ||
749 | @cindex predicates and machine modes | |
750 | @cindex normal predicates | |
751 | @cindex special predicates | |
752 | Most predicates handle their @var{mode} argument in a uniform manner. | |
753 | If @var{mode} is @code{VOIDmode} (unspecified), then @var{op} can have | |
754 | any mode. If @var{mode} is anything else, then @var{op} must have the | |
755 | same mode, unless @var{op} is a @code{CONST_INT} or integer | |
756 | @code{CONST_DOUBLE}. These RTL expressions always have | |
757 | @code{VOIDmode}, so it would be counterproductive to check that their | |
758 | mode matches. Instead, predicates that accept @code{CONST_INT} and/or | |
759 | integer @code{CONST_DOUBLE} check that the value stored in the | |
760 | constant will fit in the requested mode. | |
761 | ||
762 | Predicates with this behavior are called @dfn{normal}. | |
763 | @command{genrecog} can optimize the instruction recognizer based on | |
764 | knowledge of how normal predicates treat modes. It can also diagnose | |
765 | certain kinds of common errors in the use of normal predicates; for | |
766 | instance, it is almost always an error to use a normal predicate | |
767 | without specifying a mode. | |
768 | ||
769 | Predicates that do something different with their @var{mode} argument | |
770 | are called @dfn{special}. The generic predicates | |
771 | @code{address_operand} and @code{pmode_register_operand} are special | |
772 | predicates. @command{genrecog} does not do any optimizations or | |
773 | diagnosis when special predicates are used. | |
774 | ||
775 | @menu | |
776 | * Machine-Independent Predicates:: Predicates available to all back ends. | |
777 | * Defining Predicates:: How to write machine-specific predicate | |
778 | functions. | |
779 | @end menu | |
780 | ||
781 | @node Machine-Independent Predicates | |
782 | @subsection Machine-Independent Predicates | |
783 | @cindex machine-independent predicates | |
784 | @cindex generic predicates | |
785 | ||
786 | These are the generic predicates available to all back ends. They are | |
787 | defined in @file{recog.c}. The first category of predicates allow | |
788 | only constant, or @dfn{immediate}, operands. | |
789 | ||
790 | @defun immediate_operand | |
791 | This predicate allows any sort of constant that fits in @var{mode}. | |
792 | It is an appropriate choice for instructions that take operands that | |
793 | must be constant. | |
794 | @end defun | |
795 | ||
796 | @defun const_int_operand | |
797 | This predicate allows any @code{CONST_INT} expression that fits in | |
798 | @var{mode}. It is an appropriate choice for an immediate operand that | |
799 | does not allow a symbol or label. | |
800 | @end defun | |
801 | ||
802 | @defun const_double_operand | |
803 | This predicate accepts any @code{CONST_DOUBLE} expression that has | |
804 | exactly @var{mode}. If @var{mode} is @code{VOIDmode}, it will also | |
805 | accept @code{CONST_INT}. It is intended for immediate floating point | |
806 | constants. | |
807 | @end defun | |
808 | ||
809 | @noindent | |
810 | The second category of predicates allow only some kind of machine | |
811 | register. | |
812 | ||
813 | @defun register_operand | |
814 | This predicate allows any @code{REG} or @code{SUBREG} expression that | |
815 | is valid for @var{mode}. It is often suitable for arithmetic | |
816 | instruction operands on a RISC machine. | |
817 | @end defun | |
818 | ||
819 | @defun pmode_register_operand | |
820 | This is a slight variant on @code{register_operand} which works around | |
821 | a limitation in the machine-description reader. | |
822 | ||
cd1a8088 | 823 | @smallexample |
e543e219 | 824 | (match_operand @var{n} "pmode_register_operand" @var{constraint}) |
cd1a8088 | 825 | @end smallexample |
e543e219 ZW |
826 | |
827 | @noindent | |
828 | means exactly what | |
829 | ||
cd1a8088 | 830 | @smallexample |
e543e219 | 831 | (match_operand:P @var{n} "register_operand" @var{constraint}) |
cd1a8088 | 832 | @end smallexample |
e543e219 ZW |
833 | |
834 | @noindent | |
835 | would mean, if the machine-description reader accepted @samp{:P} | |
836 | mode suffixes. Unfortunately, it cannot, because @code{Pmode} is an | |
837 | alias for some other mode, and might vary with machine-specific | |
8a36672b | 838 | options. @xref{Misc}. |
e543e219 ZW |
839 | @end defun |
840 | ||
841 | @defun scratch_operand | |
842 | This predicate allows hard registers and @code{SCRATCH} expressions, | |
843 | but not pseudo-registers. It is used internally by @code{match_scratch}; | |
844 | it should not be used directly. | |
845 | @end defun | |
846 | ||
847 | @noindent | |
848 | The third category of predicates allow only some kind of memory reference. | |
849 | ||
850 | @defun memory_operand | |
851 | This predicate allows any valid reference to a quantity of mode | |
852 | @var{mode} in memory, as determined by the weak form of | |
853 | @code{GO_IF_LEGITIMATE_ADDRESS} (@pxref{Addressing Modes}). | |
854 | @end defun | |
855 | ||
856 | @defun address_operand | |
857 | This predicate is a little unusual; it allows any operand that is a | |
858 | valid expression for the @emph{address} of a quantity of mode | |
859 | @var{mode}, again determined by the weak form of | |
860 | @code{GO_IF_LEGITIMATE_ADDRESS}. To first order, if | |
861 | @samp{@w{(mem:@var{mode} (@var{exp}))}} is acceptable to | |
862 | @code{memory_operand}, then @var{exp} is acceptable to | |
863 | @code{address_operand}. Note that @var{exp} does not necessarily have | |
864 | the mode @var{mode}. | |
865 | @end defun | |
866 | ||
867 | @defun indirect_operand | |
868 | This is a stricter form of @code{memory_operand} which allows only | |
869 | memory references with a @code{general_operand} as the address | |
870 | expression. New uses of this predicate are discouraged, because | |
871 | @code{general_operand} is very permissive, so it's hard to tell what | |
872 | an @code{indirect_operand} does or does not allow. If a target has | |
873 | different requirements for memory operands for different instructions, | |
874 | it is better to define target-specific predicates which enforce the | |
875 | hardware's requirements explicitly. | |
876 | @end defun | |
877 | ||
878 | @defun push_operand | |
879 | This predicate allows a memory reference suitable for pushing a value | |
880 | onto the stack. This will be a @code{MEM} which refers to | |
df18c24a | 881 | @code{stack_pointer_rtx}, with a side effect in its address expression |
e543e219 ZW |
882 | (@pxref{Incdec}); which one is determined by the |
883 | @code{STACK_PUSH_CODE} macro (@pxref{Frame Layout}). | |
884 | @end defun | |
885 | ||
886 | @defun pop_operand | |
887 | This predicate allows a memory reference suitable for popping a value | |
888 | off the stack. Again, this will be a @code{MEM} referring to | |
df18c24a | 889 | @code{stack_pointer_rtx}, with a side effect in its address |
e543e219 ZW |
890 | expression. However, this time @code{STACK_POP_CODE} is expected. |
891 | @end defun | |
892 | ||
893 | @noindent | |
894 | The fourth category of predicates allow some combination of the above | |
895 | operands. | |
896 | ||
897 | @defun nonmemory_operand | |
898 | This predicate allows any immediate or register operand valid for @var{mode}. | |
899 | @end defun | |
900 | ||
901 | @defun nonimmediate_operand | |
902 | This predicate allows any register or memory operand valid for @var{mode}. | |
903 | @end defun | |
904 | ||
905 | @defun general_operand | |
906 | This predicate allows any immediate, register, or memory operand | |
907 | valid for @var{mode}. | |
908 | @end defun | |
909 | ||
910 | @noindent | |
c6963675 | 911 | Finally, there are two generic operator predicates. |
e543e219 ZW |
912 | |
913 | @defun comparison_operator | |
914 | This predicate matches any expression which performs an arithmetic | |
915 | comparison in @var{mode}; that is, @code{COMPARISON_P} is true for the | |
916 | expression code. | |
917 | @end defun | |
918 | ||
c6963675 PB |
919 | @defun ordered_comparison_operator |
920 | This predicate matches any expression which performs an arithmetic | |
921 | comparison in @var{mode} and whose expression code is valid for integer | |
922 | modes; that is, the expression code will be one of @code{eq}, @code{ne}, | |
923 | @code{lt}, @code{ltu}, @code{le}, @code{leu}, @code{gt}, @code{gtu}, | |
924 | @code{ge}, @code{geu}. | |
925 | @end defun | |
926 | ||
e543e219 ZW |
927 | @node Defining Predicates |
928 | @subsection Defining Machine-Specific Predicates | |
929 | @cindex defining predicates | |
930 | @findex define_predicate | |
931 | @findex define_special_predicate | |
932 | ||
933 | Many machines have requirements for their operands that cannot be | |
934 | expressed precisely using the generic predicates. You can define | |
935 | additional predicates using @code{define_predicate} and | |
936 | @code{define_special_predicate} expressions. These expressions have | |
937 | three operands: | |
938 | ||
939 | @itemize @bullet | |
940 | @item | |
941 | The name of the predicate, as it will be referred to in | |
942 | @code{match_operand} or @code{match_operator} expressions. | |
943 | ||
944 | @item | |
945 | An RTL expression which evaluates to true if the predicate allows the | |
946 | operand @var{op}, false if it does not. This expression can only use | |
947 | the following RTL codes: | |
948 | ||
949 | @table @code | |
950 | @item MATCH_OPERAND | |
951 | When written inside a predicate expression, a @code{MATCH_OPERAND} | |
952 | expression evaluates to true if the predicate it names would allow | |
953 | @var{op}. The operand number and constraint are ignored. Due to | |
954 | limitations in @command{genrecog}, you can only refer to generic | |
955 | predicates and predicates that have already been defined. | |
956 | ||
957 | @item MATCH_CODE | |
6e7a4706 ZW |
958 | This expression evaluates to true if @var{op} or a specified |
959 | subexpression of @var{op} has one of a given list of RTX codes. | |
960 | ||
961 | The first operand of this expression is a string constant containing a | |
962 | comma-separated list of RTX code names (in lower case). These are the | |
963 | codes for which the @code{MATCH_CODE} will be true. | |
964 | ||
965 | The second operand is a string constant which indicates what | |
966 | subexpression of @var{op} to examine. If it is absent or the empty | |
967 | string, @var{op} itself is examined. Otherwise, the string constant | |
968 | must be a sequence of digits and/or lowercase letters. Each character | |
969 | indicates a subexpression to extract from the current expression; for | |
970 | the first character this is @var{op}, for the second and subsequent | |
971 | characters it is the result of the previous character. A digit | |
972 | @var{n} extracts @samp{@w{XEXP (@var{e}, @var{n})}}; a letter @var{l} | |
973 | extracts @samp{@w{XVECEXP (@var{e}, 0, @var{n})}} where @var{n} is the | |
974 | alphabetic ordinal of @var{l} (0 for `a', 1 for 'b', and so on). The | |
975 | @code{MATCH_CODE} then examines the RTX code of the subexpression | |
976 | extracted by the complete string. It is not possible to extract | |
977 | components of an @code{rtvec} that is not at position 0 within its RTX | |
978 | object. | |
e543e219 ZW |
979 | |
980 | @item MATCH_TEST | |
981 | This expression has one operand, a string constant containing a C | |
982 | expression. The predicate's arguments, @var{op} and @var{mode}, are | |
983 | available with those names in the C expression. The @code{MATCH_TEST} | |
984 | evaluates to true if the C expression evaluates to a nonzero value. | |
985 | @code{MATCH_TEST} expressions must not have side effects. | |
986 | ||
987 | @item AND | |
988 | @itemx IOR | |
989 | @itemx NOT | |
990 | @itemx IF_THEN_ELSE | |
991 | The basic @samp{MATCH_} expressions can be combined using these | |
992 | logical operators, which have the semantics of the C operators | |
6e7a4706 ZW |
993 | @samp{&&}, @samp{||}, @samp{!}, and @samp{@w{? :}} respectively. As |
994 | in Common Lisp, you may give an @code{AND} or @code{IOR} expression an | |
995 | arbitrary number of arguments; this has exactly the same effect as | |
996 | writing a chain of two-argument @code{AND} or @code{IOR} expressions. | |
e543e219 ZW |
997 | @end table |
998 | ||
999 | @item | |
f0eb93a8 | 1000 | An optional block of C code, which should execute |
e543e219 ZW |
1001 | @samp{@w{return true}} if the predicate is found to match and |
1002 | @samp{@w{return false}} if it does not. It must not have any side | |
1003 | effects. The predicate arguments, @var{op} and @var{mode}, are | |
1004 | available with those names. | |
1005 | ||
1006 | If a code block is present in a predicate definition, then the RTL | |
1007 | expression must evaluate to true @emph{and} the code block must | |
1008 | execute @samp{@w{return true}} for the predicate to allow the operand. | |
1009 | The RTL expression is evaluated first; do not re-check anything in the | |
1010 | code block that was checked in the RTL expression. | |
1011 | @end itemize | |
1012 | ||
1013 | The program @command{genrecog} scans @code{define_predicate} and | |
1014 | @code{define_special_predicate} expressions to determine which RTX | |
1015 | codes are possibly allowed. You should always make this explicit in | |
1016 | the RTL predicate expression, using @code{MATCH_OPERAND} and | |
1017 | @code{MATCH_CODE}. | |
1018 | ||
1019 | Here is an example of a simple predicate definition, from the IA64 | |
1020 | machine description: | |
1021 | ||
1022 | @smallexample | |
1023 | @group | |
1024 | ;; @r{True if @var{op} is a @code{SYMBOL_REF} which refers to the sdata section.} | |
1025 | (define_predicate "small_addr_symbolic_operand" | |
1026 | (and (match_code "symbol_ref") | |
1027 | (match_test "SYMBOL_REF_SMALL_ADDR_P (op)"))) | |
1028 | @end group | |
1029 | @end smallexample | |
1030 | ||
1031 | @noindent | |
1032 | And here is another, showing the use of the C block. | |
1033 | ||
1034 | @smallexample | |
1035 | @group | |
1036 | ;; @r{True if @var{op} is a register operand that is (or could be) a GR reg.} | |
1037 | (define_predicate "gr_register_operand" | |
1038 | (match_operand 0 "register_operand") | |
1039 | @{ | |
1040 | unsigned int regno; | |
1041 | if (GET_CODE (op) == SUBREG) | |
1042 | op = SUBREG_REG (op); | |
1043 | ||
1044 | regno = REGNO (op); | |
1045 | return (regno >= FIRST_PSEUDO_REGISTER || GENERAL_REGNO_P (regno)); | |
1046 | @}) | |
1047 | @end group | |
1048 | @end smallexample | |
1049 | ||
1050 | Predicates written with @code{define_predicate} automatically include | |
1051 | a test that @var{mode} is @code{VOIDmode}, or @var{op} has the same | |
1052 | mode as @var{mode}, or @var{op} is a @code{CONST_INT} or | |
1053 | @code{CONST_DOUBLE}. They do @emph{not} check specifically for | |
1054 | integer @code{CONST_DOUBLE}, nor do they test that the value of either | |
1055 | kind of constant fits in the requested mode. This is because | |
1056 | target-specific predicates that take constants usually have to do more | |
1057 | stringent value checks anyway. If you need the exact same treatment | |
1058 | of @code{CONST_INT} or @code{CONST_DOUBLE} that the generic predicates | |
1059 | provide, use a @code{MATCH_OPERAND} subexpression to call | |
1060 | @code{const_int_operand}, @code{const_double_operand}, or | |
1061 | @code{immediate_operand}. | |
1062 | ||
1063 | Predicates written with @code{define_special_predicate} do not get any | |
1064 | automatic mode checks, and are treated as having special mode handling | |
1065 | by @command{genrecog}. | |
1066 | ||
1067 | The program @command{genpreds} is responsible for generating code to | |
1068 | test predicates. It also writes a header file containing function | |
1069 | declarations for all machine-specific predicates. It is not necessary | |
1070 | to declare these predicates in @file{@var{cpu}-protos.h}. | |
03dda8e3 RK |
1071 | @end ifset |
1072 | ||
1073 | @c Most of this node appears by itself (in a different place) even | |
b11cc610 JM |
1074 | @c when the INTERNALS flag is clear. Passages that require the internals |
1075 | @c manual's context are conditionalized to appear only in the internals manual. | |
03dda8e3 RK |
1076 | @ifset INTERNALS |
1077 | @node Constraints | |
1078 | @section Operand Constraints | |
1079 | @cindex operand constraints | |
1080 | @cindex constraints | |
1081 | ||
e543e219 ZW |
1082 | Each @code{match_operand} in an instruction pattern can specify |
1083 | constraints for the operands allowed. The constraints allow you to | |
1084 | fine-tune matching within the set of operands allowed by the | |
1085 | predicate. | |
1086 | ||
03dda8e3 RK |
1087 | @end ifset |
1088 | @ifclear INTERNALS | |
1089 | @node Constraints | |
1090 | @section Constraints for @code{asm} Operands | |
1091 | @cindex operand constraints, @code{asm} | |
1092 | @cindex constraints, @code{asm} | |
1093 | @cindex @code{asm} constraints | |
1094 | ||
1095 | Here are specific details on what constraint letters you can use with | |
1096 | @code{asm} operands. | |
1097 | @end ifclear | |
1098 | Constraints can say whether | |
1099 | an operand may be in a register, and which kinds of register; whether the | |
1100 | operand can be a memory reference, and which kinds of address; whether the | |
1101 | operand may be an immediate constant, and which possible values it may | |
1102 | have. Constraints can also require two operands to match. | |
54f044eb JJ |
1103 | Side-effects aren't allowed in operands of inline @code{asm}, unless |
1104 | @samp{<} or @samp{>} constraints are used, because there is no guarantee | |
df18c24a | 1105 | that the side effects will happen exactly once in an instruction that can update |
54f044eb | 1106 | the addressing register. |
03dda8e3 RK |
1107 | |
1108 | @ifset INTERNALS | |
1109 | @menu | |
1110 | * Simple Constraints:: Basic use of constraints. | |
1111 | * Multi-Alternative:: When an insn has two alternative constraint-patterns. | |
1112 | * Class Preferences:: Constraints guide which hard register to put things in. | |
1113 | * Modifiers:: More precise control over effects of constraints. | |
1114 | * Machine Constraints:: Existing constraints for some particular machines. | |
9840b2fa | 1115 | * Disable Insn Alternatives:: Disable insn alternatives using attributes. |
f38840db ZW |
1116 | * Define Constraints:: How to define machine-specific constraints. |
1117 | * C Constraint Interface:: How to test constraints from C code. | |
03dda8e3 RK |
1118 | @end menu |
1119 | @end ifset | |
1120 | ||
1121 | @ifclear INTERNALS | |
1122 | @menu | |
1123 | * Simple Constraints:: Basic use of constraints. | |
1124 | * Multi-Alternative:: When an insn has two alternative constraint-patterns. | |
1125 | * Modifiers:: More precise control over effects of constraints. | |
1126 | * Machine Constraints:: Special constraints for some particular machines. | |
1127 | @end menu | |
1128 | @end ifclear | |
1129 | ||
1130 | @node Simple Constraints | |
1131 | @subsection Simple Constraints | |
1132 | @cindex simple constraints | |
1133 | ||
1134 | The simplest kind of constraint is a string full of letters, each of | |
1135 | which describes one kind of operand that is permitted. Here are | |
1136 | the letters that are allowed: | |
1137 | ||
1138 | @table @asis | |
88a56c2e HPN |
1139 | @item whitespace |
1140 | Whitespace characters are ignored and can be inserted at any position | |
1141 | except the first. This enables each alternative for different operands to | |
1142 | be visually aligned in the machine description even if they have different | |
1143 | number of constraints and modifiers. | |
1144 | ||
03dda8e3 RK |
1145 | @cindex @samp{m} in constraint |
1146 | @cindex memory references in constraints | |
1147 | @item @samp{m} | |
1148 | A memory operand is allowed, with any kind of address that the machine | |
1149 | supports in general. | |
a4edaf83 AK |
1150 | Note that the letter used for the general memory constraint can be |
1151 | re-defined by a back end using the @code{TARGET_MEM_CONSTRAINT} macro. | |
03dda8e3 RK |
1152 | |
1153 | @cindex offsettable address | |
1154 | @cindex @samp{o} in constraint | |
1155 | @item @samp{o} | |
1156 | A memory operand is allowed, but only if the address is | |
1157 | @dfn{offsettable}. This means that adding a small integer (actually, | |
1158 | the width in bytes of the operand, as determined by its machine mode) | |
1159 | may be added to the address and the result is also a valid memory | |
1160 | address. | |
1161 | ||
1162 | @cindex autoincrement/decrement addressing | |
1163 | For example, an address which is constant is offsettable; so is an | |
1164 | address that is the sum of a register and a constant (as long as a | |
1165 | slightly larger constant is also within the range of address-offsets | |
1166 | supported by the machine); but an autoincrement or autodecrement | |
1167 | address is not offsettable. More complicated indirect/indexed | |
1168 | addresses may or may not be offsettable depending on the other | |
1169 | addressing modes that the machine supports. | |
1170 | ||
1171 | Note that in an output operand which can be matched by another | |
1172 | operand, the constraint letter @samp{o} is valid only when accompanied | |
1173 | by both @samp{<} (if the target machine has predecrement addressing) | |
1174 | and @samp{>} (if the target machine has preincrement addressing). | |
1175 | ||
1176 | @cindex @samp{V} in constraint | |
1177 | @item @samp{V} | |
1178 | A memory operand that is not offsettable. In other words, anything that | |
1179 | would fit the @samp{m} constraint but not the @samp{o} constraint. | |
1180 | ||
1181 | @cindex @samp{<} in constraint | |
1182 | @item @samp{<} | |
1183 | A memory operand with autodecrement addressing (either predecrement or | |
54f044eb JJ |
1184 | postdecrement) is allowed. In inline @code{asm} this constraint is only |
1185 | allowed if the operand is used exactly once in an instruction that can | |
df18c24a | 1186 | handle the side effects. Not using an operand with @samp{<} in constraint |
54f044eb | 1187 | string in the inline @code{asm} pattern at all or using it in multiple |
df18c24a | 1188 | instructions isn't valid, because the side effects wouldn't be performed |
54f044eb JJ |
1189 | or would be performed more than once. Furthermore, on some targets |
1190 | the operand with @samp{<} in constraint string must be accompanied by | |
1191 | special instruction suffixes like @code{%U0} instruction suffix on PowerPC | |
1192 | or @code{%P0} on IA-64. | |
03dda8e3 RK |
1193 | |
1194 | @cindex @samp{>} in constraint | |
1195 | @item @samp{>} | |
1196 | A memory operand with autoincrement addressing (either preincrement or | |
54f044eb JJ |
1197 | postincrement) is allowed. In inline @code{asm} the same restrictions |
1198 | as for @samp{<} apply. | |
03dda8e3 RK |
1199 | |
1200 | @cindex @samp{r} in constraint | |
1201 | @cindex registers in constraints | |
1202 | @item @samp{r} | |
1203 | A register operand is allowed provided that it is in a general | |
1204 | register. | |
1205 | ||
03dda8e3 RK |
1206 | @cindex constants in constraints |
1207 | @cindex @samp{i} in constraint | |
1208 | @item @samp{i} | |
1209 | An immediate integer operand (one with constant value) is allowed. | |
1210 | This includes symbolic constants whose values will be known only at | |
8ac658b6 | 1211 | assembly time or later. |
03dda8e3 RK |
1212 | |
1213 | @cindex @samp{n} in constraint | |
1214 | @item @samp{n} | |
1215 | An immediate integer operand with a known numeric value is allowed. | |
1216 | Many systems cannot support assembly-time constants for operands less | |
1217 | than a word wide. Constraints for these operands should use @samp{n} | |
1218 | rather than @samp{i}. | |
1219 | ||
1220 | @cindex @samp{I} in constraint | |
1221 | @item @samp{I}, @samp{J}, @samp{K}, @dots{} @samp{P} | |
1222 | Other letters in the range @samp{I} through @samp{P} may be defined in | |
1223 | a machine-dependent fashion to permit immediate integer operands with | |
1224 | explicit integer values in specified ranges. For example, on the | |
1225 | 68000, @samp{I} is defined to stand for the range of values 1 to 8. | |
1226 | This is the range permitted as a shift count in the shift | |
1227 | instructions. | |
1228 | ||
1229 | @cindex @samp{E} in constraint | |
1230 | @item @samp{E} | |
1231 | An immediate floating operand (expression code @code{const_double}) is | |
1232 | allowed, but only if the target floating point format is the same as | |
1233 | that of the host machine (on which the compiler is running). | |
1234 | ||
1235 | @cindex @samp{F} in constraint | |
1236 | @item @samp{F} | |
bf7cd754 R |
1237 | An immediate floating operand (expression code @code{const_double} or |
1238 | @code{const_vector}) is allowed. | |
03dda8e3 RK |
1239 | |
1240 | @cindex @samp{G} in constraint | |
1241 | @cindex @samp{H} in constraint | |
1242 | @item @samp{G}, @samp{H} | |
1243 | @samp{G} and @samp{H} may be defined in a machine-dependent fashion to | |
1244 | permit immediate floating operands in particular ranges of values. | |
1245 | ||
1246 | @cindex @samp{s} in constraint | |
1247 | @item @samp{s} | |
1248 | An immediate integer operand whose value is not an explicit integer is | |
1249 | allowed. | |
1250 | ||
1251 | This might appear strange; if an insn allows a constant operand with a | |
1252 | value not known at compile time, it certainly must allow any known | |
1253 | value. So why use @samp{s} instead of @samp{i}? Sometimes it allows | |
1254 | better code to be generated. | |
1255 | ||
1256 | For example, on the 68000 in a fullword instruction it is possible to | |
630d3d5a | 1257 | use an immediate operand; but if the immediate value is between @minus{}128 |
03dda8e3 RK |
1258 | and 127, better code results from loading the value into a register and |
1259 | using the register. This is because the load into the register can be | |
1260 | done with a @samp{moveq} instruction. We arrange for this to happen | |
1261 | by defining the letter @samp{K} to mean ``any integer outside the | |
630d3d5a | 1262 | range @minus{}128 to 127'', and then specifying @samp{Ks} in the operand |
03dda8e3 RK |
1263 | constraints. |
1264 | ||
1265 | @cindex @samp{g} in constraint | |
1266 | @item @samp{g} | |
1267 | Any register, memory or immediate integer operand is allowed, except for | |
1268 | registers that are not general registers. | |
1269 | ||
1270 | @cindex @samp{X} in constraint | |
1271 | @item @samp{X} | |
1272 | @ifset INTERNALS | |
1273 | Any operand whatsoever is allowed, even if it does not satisfy | |
1274 | @code{general_operand}. This is normally used in the constraint of | |
1275 | a @code{match_scratch} when certain alternatives will not actually | |
1276 | require a scratch register. | |
1277 | @end ifset | |
1278 | @ifclear INTERNALS | |
1279 | Any operand whatsoever is allowed. | |
1280 | @end ifclear | |
1281 | ||
1282 | @cindex @samp{0} in constraint | |
1283 | @cindex digits in constraint | |
1284 | @item @samp{0}, @samp{1}, @samp{2}, @dots{} @samp{9} | |
1285 | An operand that matches the specified operand number is allowed. If a | |
1286 | digit is used together with letters within the same alternative, the | |
1287 | digit should come last. | |
1288 | ||
84b72302 | 1289 | This number is allowed to be more than a single digit. If multiple |
c0478a66 | 1290 | digits are encountered consecutively, they are interpreted as a single |
84b72302 RH |
1291 | decimal integer. There is scant chance for ambiguity, since to-date |
1292 | it has never been desirable that @samp{10} be interpreted as matching | |
1293 | either operand 1 @emph{or} operand 0. Should this be desired, one | |
1294 | can use multiple alternatives instead. | |
1295 | ||
03dda8e3 RK |
1296 | @cindex matching constraint |
1297 | @cindex constraint, matching | |
1298 | This is called a @dfn{matching constraint} and what it really means is | |
1299 | that the assembler has only a single operand that fills two roles | |
1300 | @ifset INTERNALS | |
1301 | considered separate in the RTL insn. For example, an add insn has two | |
1302 | input operands and one output operand in the RTL, but on most CISC | |
1303 | @end ifset | |
1304 | @ifclear INTERNALS | |
1305 | which @code{asm} distinguishes. For example, an add instruction uses | |
1306 | two input operands and an output operand, but on most CISC | |
1307 | @end ifclear | |
1308 | machines an add instruction really has only two operands, one of them an | |
1309 | input-output operand: | |
1310 | ||
1311 | @smallexample | |
1312 | addl #35,r12 | |
1313 | @end smallexample | |
1314 | ||
1315 | Matching constraints are used in these circumstances. | |
1316 | More precisely, the two operands that match must include one input-only | |
1317 | operand and one output-only operand. Moreover, the digit must be a | |
1318 | smaller number than the number of the operand that uses it in the | |
1319 | constraint. | |
1320 | ||
1321 | @ifset INTERNALS | |
1322 | For operands to match in a particular case usually means that they | |
1323 | are identical-looking RTL expressions. But in a few special cases | |
1324 | specific kinds of dissimilarity are allowed. For example, @code{*x} | |
1325 | as an input operand will match @code{*x++} as an output operand. | |
1326 | For proper results in such cases, the output template should always | |
1327 | use the output-operand's number when printing the operand. | |
1328 | @end ifset | |
1329 | ||
1330 | @cindex load address instruction | |
1331 | @cindex push address instruction | |
1332 | @cindex address constraints | |
1333 | @cindex @samp{p} in constraint | |
1334 | @item @samp{p} | |
1335 | An operand that is a valid memory address is allowed. This is | |
1336 | for ``load address'' and ``push address'' instructions. | |
1337 | ||
1338 | @findex address_operand | |
1339 | @samp{p} in the constraint must be accompanied by @code{address_operand} | |
1340 | as the predicate in the @code{match_operand}. This predicate interprets | |
1341 | the mode specified in the @code{match_operand} as the mode of the memory | |
1342 | reference for which the address would be valid. | |
1343 | ||
c2cba7a9 | 1344 | @cindex other register constraints |
03dda8e3 | 1345 | @cindex extensible constraints |
630d3d5a | 1346 | @item @var{other-letters} |
c2cba7a9 RH |
1347 | Other letters can be defined in machine-dependent fashion to stand for |
1348 | particular classes of registers or other arbitrary operand types. | |
1349 | @samp{d}, @samp{a} and @samp{f} are defined on the 68000/68020 to stand | |
1350 | for data, address and floating point registers. | |
03dda8e3 RK |
1351 | @end table |
1352 | ||
1353 | @ifset INTERNALS | |
1354 | In order to have valid assembler code, each operand must satisfy | |
1355 | its constraint. But a failure to do so does not prevent the pattern | |
1356 | from applying to an insn. Instead, it directs the compiler to modify | |
1357 | the code so that the constraint will be satisfied. Usually this is | |
1358 | done by copying an operand into a register. | |
1359 | ||
1360 | Contrast, therefore, the two instruction patterns that follow: | |
1361 | ||
1362 | @smallexample | |
1363 | (define_insn "" | |
1364 | [(set (match_operand:SI 0 "general_operand" "=r") | |
1365 | (plus:SI (match_dup 0) | |
1366 | (match_operand:SI 1 "general_operand" "r")))] | |
1367 | "" | |
1368 | "@dots{}") | |
1369 | @end smallexample | |
1370 | ||
1371 | @noindent | |
1372 | which has two operands, one of which must appear in two places, and | |
1373 | ||
1374 | @smallexample | |
1375 | (define_insn "" | |
1376 | [(set (match_operand:SI 0 "general_operand" "=r") | |
1377 | (plus:SI (match_operand:SI 1 "general_operand" "0") | |
1378 | (match_operand:SI 2 "general_operand" "r")))] | |
1379 | "" | |
1380 | "@dots{}") | |
1381 | @end smallexample | |
1382 | ||
1383 | @noindent | |
1384 | which has three operands, two of which are required by a constraint to be | |
1385 | identical. If we are considering an insn of the form | |
1386 | ||
1387 | @smallexample | |
1388 | (insn @var{n} @var{prev} @var{next} | |
1389 | (set (reg:SI 3) | |
1390 | (plus:SI (reg:SI 6) (reg:SI 109))) | |
1391 | @dots{}) | |
1392 | @end smallexample | |
1393 | ||
1394 | @noindent | |
1395 | the first pattern would not apply at all, because this insn does not | |
1396 | contain two identical subexpressions in the right place. The pattern would | |
d78aa55c | 1397 | say, ``That does not look like an add instruction; try other patterns''. |
03dda8e3 | 1398 | The second pattern would say, ``Yes, that's an add instruction, but there |
d78aa55c | 1399 | is something wrong with it''. It would direct the reload pass of the |
03dda8e3 RK |
1400 | compiler to generate additional insns to make the constraint true. The |
1401 | results might look like this: | |
1402 | ||
1403 | @smallexample | |
1404 | (insn @var{n2} @var{prev} @var{n} | |
1405 | (set (reg:SI 3) (reg:SI 6)) | |
1406 | @dots{}) | |
1407 | ||
1408 | (insn @var{n} @var{n2} @var{next} | |
1409 | (set (reg:SI 3) | |
1410 | (plus:SI (reg:SI 3) (reg:SI 109))) | |
1411 | @dots{}) | |
1412 | @end smallexample | |
1413 | ||
1414 | It is up to you to make sure that each operand, in each pattern, has | |
1415 | constraints that can handle any RTL expression that could be present for | |
1416 | that operand. (When multiple alternatives are in use, each pattern must, | |
1417 | for each possible combination of operand expressions, have at least one | |
1418 | alternative which can handle that combination of operands.) The | |
1419 | constraints don't need to @emph{allow} any possible operand---when this is | |
1420 | the case, they do not constrain---but they must at least point the way to | |
1421 | reloading any possible operand so that it will fit. | |
1422 | ||
1423 | @itemize @bullet | |
1424 | @item | |
1425 | If the constraint accepts whatever operands the predicate permits, | |
1426 | there is no problem: reloading is never necessary for this operand. | |
1427 | ||
1428 | For example, an operand whose constraints permit everything except | |
1429 | registers is safe provided its predicate rejects registers. | |
1430 | ||
1431 | An operand whose predicate accepts only constant values is safe | |
1432 | provided its constraints include the letter @samp{i}. If any possible | |
1433 | constant value is accepted, then nothing less than @samp{i} will do; | |
1434 | if the predicate is more selective, then the constraints may also be | |
1435 | more selective. | |
1436 | ||
1437 | @item | |
1438 | Any operand expression can be reloaded by copying it into a register. | |
1439 | So if an operand's constraints allow some kind of register, it is | |
1440 | certain to be safe. It need not permit all classes of registers; the | |
1441 | compiler knows how to copy a register into another register of the | |
1442 | proper class in order to make an instruction valid. | |
1443 | ||
1444 | @cindex nonoffsettable memory reference | |
1445 | @cindex memory reference, nonoffsettable | |
1446 | @item | |
1447 | A nonoffsettable memory reference can be reloaded by copying the | |
1448 | address into a register. So if the constraint uses the letter | |
1449 | @samp{o}, all memory references are taken care of. | |
1450 | ||
1451 | @item | |
1452 | A constant operand can be reloaded by allocating space in memory to | |
1453 | hold it as preinitialized data. Then the memory reference can be used | |
1454 | in place of the constant. So if the constraint uses the letters | |
1455 | @samp{o} or @samp{m}, constant operands are not a problem. | |
1456 | ||
1457 | @item | |
1458 | If the constraint permits a constant and a pseudo register used in an insn | |
1459 | was not allocated to a hard register and is equivalent to a constant, | |
1460 | the register will be replaced with the constant. If the predicate does | |
1461 | not permit a constant and the insn is re-recognized for some reason, the | |
1462 | compiler will crash. Thus the predicate must always recognize any | |
1463 | objects allowed by the constraint. | |
1464 | @end itemize | |
1465 | ||
1466 | If the operand's predicate can recognize registers, but the constraint does | |
1467 | not permit them, it can make the compiler crash. When this operand happens | |
1468 | to be a register, the reload pass will be stymied, because it does not know | |
1469 | how to copy a register temporarily into memory. | |
1470 | ||
1471 | If the predicate accepts a unary operator, the constraint applies to the | |
1472 | operand. For example, the MIPS processor at ISA level 3 supports an | |
1473 | instruction which adds two registers in @code{SImode} to produce a | |
1474 | @code{DImode} result, but only if the registers are correctly sign | |
1475 | extended. This predicate for the input operands accepts a | |
1476 | @code{sign_extend} of an @code{SImode} register. Write the constraint | |
1477 | to indicate the type of register that is required for the operand of the | |
1478 | @code{sign_extend}. | |
1479 | @end ifset | |
1480 | ||
1481 | @node Multi-Alternative | |
1482 | @subsection Multiple Alternative Constraints | |
1483 | @cindex multiple alternative constraints | |
1484 | ||
1485 | Sometimes a single instruction has multiple alternative sets of possible | |
1486 | operands. For example, on the 68000, a logical-or instruction can combine | |
1487 | register or an immediate value into memory, or it can combine any kind of | |
1488 | operand into a register; but it cannot combine one memory location into | |
1489 | another. | |
1490 | ||
1491 | These constraints are represented as multiple alternatives. An alternative | |
1492 | can be described by a series of letters for each operand. The overall | |
1493 | constraint for an operand is made from the letters for this operand | |
1494 | from the first alternative, a comma, the letters for this operand from | |
1495 | the second alternative, a comma, and so on until the last alternative. | |
a6fa947e DW |
1496 | All operands for a single instruction must have the same number of |
1497 | alternatives. | |
03dda8e3 RK |
1498 | @ifset INTERNALS |
1499 | Here is how it is done for fullword logical-or on the 68000: | |
1500 | ||
1501 | @smallexample | |
1502 | (define_insn "iorsi3" | |
1503 | [(set (match_operand:SI 0 "general_operand" "=m,d") | |
1504 | (ior:SI (match_operand:SI 1 "general_operand" "%0,0") | |
1505 | (match_operand:SI 2 "general_operand" "dKs,dmKs")))] | |
1506 | @dots{}) | |
1507 | @end smallexample | |
1508 | ||
1509 | The first alternative has @samp{m} (memory) for operand 0, @samp{0} for | |
1510 | operand 1 (meaning it must match operand 0), and @samp{dKs} for operand | |
1511 | 2. The second alternative has @samp{d} (data register) for operand 0, | |
1512 | @samp{0} for operand 1, and @samp{dmKs} for operand 2. The @samp{=} and | |
1513 | @samp{%} in the constraints apply to all the alternatives; their | |
1514 | meaning is explained in the next section (@pxref{Class Preferences}). | |
03dda8e3 | 1515 | |
03dda8e3 RK |
1516 | If all the operands fit any one alternative, the instruction is valid. |
1517 | Otherwise, for each alternative, the compiler counts how many instructions | |
1518 | must be added to copy the operands so that that alternative applies. | |
1519 | The alternative requiring the least copying is chosen. If two alternatives | |
1520 | need the same amount of copying, the one that comes first is chosen. | |
1521 | These choices can be altered with the @samp{?} and @samp{!} characters: | |
1522 | ||
1523 | @table @code | |
1524 | @cindex @samp{?} in constraint | |
1525 | @cindex question mark | |
1526 | @item ? | |
1527 | Disparage slightly the alternative that the @samp{?} appears in, | |
1528 | as a choice when no alternative applies exactly. The compiler regards | |
1529 | this alternative as one unit more costly for each @samp{?} that appears | |
1530 | in it. | |
1531 | ||
1532 | @cindex @samp{!} in constraint | |
1533 | @cindex exclamation point | |
1534 | @item ! | |
1535 | Disparage severely the alternative that the @samp{!} appears in. | |
1536 | This alternative can still be used if it fits without reloading, | |
1537 | but if reloading is needed, some other alternative will be used. | |
d1457701 VM |
1538 | |
1539 | @cindex @samp{^} in constraint | |
1540 | @cindex caret | |
1541 | @item ^ | |
1542 | This constraint is analogous to @samp{?} but it disparages slightly | |
0ab9eed6 | 1543 | the alternative only if the operand with the @samp{^} needs a reload. |
d1457701 VM |
1544 | |
1545 | @cindex @samp{$} in constraint | |
1546 | @cindex dollar sign | |
1547 | @item $ | |
1548 | This constraint is analogous to @samp{!} but it disparages severely | |
1549 | the alternative only if the operand with the @samp{$} needs a reload. | |
03dda8e3 RK |
1550 | @end table |
1551 | ||
03dda8e3 RK |
1552 | When an insn pattern has multiple alternatives in its constraints, often |
1553 | the appearance of the assembler code is determined mostly by which | |
1554 | alternative was matched. When this is so, the C code for writing the | |
1555 | assembler code can use the variable @code{which_alternative}, which is | |
1556 | the ordinal number of the alternative that was actually satisfied (0 for | |
1557 | the first, 1 for the second alternative, etc.). @xref{Output Statement}. | |
1558 | @end ifset | |
a6fa947e DW |
1559 | @ifclear INTERNALS |
1560 | ||
1561 | So the first alternative for the 68000's logical-or could be written as | |
1562 | @code{"+m" (output) : "ir" (input)}. The second could be @code{"+r" | |
1563 | (output): "irm" (input)}. However, the fact that two memory locations | |
1564 | cannot be used in a single instruction prevents simply using @code{"+rm" | |
1565 | (output) : "irm" (input)}. Using multi-alternatives, this might be | |
1566 | written as @code{"+m,r" (output) : "ir,irm" (input)}. This describes | |
1567 | all the available alternatives to the compiler, allowing it to choose | |
1568 | the most efficient one for the current conditions. | |
1569 | ||
1570 | There is no way within the template to determine which alternative was | |
1571 | chosen. However you may be able to wrap your @code{asm} statements with | |
1572 | builtins such as @code{__builtin_constant_p} to achieve the desired results. | |
1573 | @end ifclear | |
03dda8e3 RK |
1574 | |
1575 | @ifset INTERNALS | |
1576 | @node Class Preferences | |
1577 | @subsection Register Class Preferences | |
1578 | @cindex class preference constraints | |
1579 | @cindex register class preference constraints | |
1580 | ||
1581 | @cindex voting between constraint alternatives | |
1582 | The operand constraints have another function: they enable the compiler | |
1583 | to decide which kind of hardware register a pseudo register is best | |
1584 | allocated to. The compiler examines the constraints that apply to the | |
1585 | insns that use the pseudo register, looking for the machine-dependent | |
1586 | letters such as @samp{d} and @samp{a} that specify classes of registers. | |
1587 | The pseudo register is put in whichever class gets the most ``votes''. | |
1588 | The constraint letters @samp{g} and @samp{r} also vote: they vote in | |
1589 | favor of a general register. The machine description says which registers | |
1590 | are considered general. | |
1591 | ||
1592 | Of course, on some machines all registers are equivalent, and no register | |
1593 | classes are defined. Then none of this complexity is relevant. | |
1594 | @end ifset | |
1595 | ||
1596 | @node Modifiers | |
1597 | @subsection Constraint Modifier Characters | |
1598 | @cindex modifiers in constraints | |
1599 | @cindex constraint modifier characters | |
1600 | ||
1601 | @c prevent bad page break with this line | |
1602 | Here are constraint modifier characters. | |
1603 | ||
1604 | @table @samp | |
1605 | @cindex @samp{=} in constraint | |
1606 | @item = | |
5fd4bc96 JG |
1607 | Means that this operand is written to by this instruction: |
1608 | the previous value is discarded and replaced by new data. | |
03dda8e3 RK |
1609 | |
1610 | @cindex @samp{+} in constraint | |
1611 | @item + | |
1612 | Means that this operand is both read and written by the instruction. | |
1613 | ||
1614 | When the compiler fixes up the operands to satisfy the constraints, | |
5fd4bc96 JG |
1615 | it needs to know which operands are read by the instruction and |
1616 | which are written by it. @samp{=} identifies an operand which is only | |
1617 | written; @samp{+} identifies an operand that is both read and written; all | |
1618 | other operands are assumed to only be read. | |
03dda8e3 | 1619 | |
c5c76735 JL |
1620 | If you specify @samp{=} or @samp{+} in a constraint, you put it in the |
1621 | first character of the constraint string. | |
1622 | ||
03dda8e3 RK |
1623 | @cindex @samp{&} in constraint |
1624 | @cindex earlyclobber operand | |
1625 | @item & | |
1626 | Means (in a particular alternative) that this operand is an | |
5fd4bc96 | 1627 | @dfn{earlyclobber} operand, which is written before the instruction is |
03dda8e3 | 1628 | finished using the input operands. Therefore, this operand may not lie |
5fd4bc96 | 1629 | in a register that is read by the instruction or as part of any memory |
03dda8e3 RK |
1630 | address. |
1631 | ||
1632 | @samp{&} applies only to the alternative in which it is written. In | |
1633 | constraints with multiple alternatives, sometimes one alternative | |
1634 | requires @samp{&} while others do not. See, for example, the | |
1635 | @samp{movdf} insn of the 68000. | |
1636 | ||
61fecd4d | 1637 | An operand which is read by the instruction can be tied to an earlyclobber |
5fd4bc96 JG |
1638 | operand if its only use as an input occurs before the early result is |
1639 | written. Adding alternatives of this form often allows GCC to produce | |
1640 | better code when only some of the read operands can be affected by the | |
1641 | earlyclobber. See, for example, the @samp{mulsi3} insn of the ARM@. | |
03dda8e3 | 1642 | |
5fd4bc96 JG |
1643 | Furthermore, if the @dfn{earlyclobber} operand is also a read/write |
1644 | operand, then that operand is written only after it's used. | |
34386e79 | 1645 | |
5fd4bc96 JG |
1646 | @samp{&} does not obviate the need to write @samp{=} or @samp{+}. As |
1647 | @dfn{earlyclobber} operands are always written, a read-only | |
1648 | @dfn{earlyclobber} operand is ill-formed and will be rejected by the | |
1649 | compiler. | |
03dda8e3 RK |
1650 | |
1651 | @cindex @samp{%} in constraint | |
1652 | @item % | |
1653 | Declares the instruction to be commutative for this operand and the | |
1654 | following operand. This means that the compiler may interchange the | |
1655 | two operands if that is the cheapest way to make all operands fit the | |
73f793e3 | 1656 | constraints. @samp{%} applies to all alternatives and must appear as |
5fd4bc96 | 1657 | the first character in the constraint. Only read-only operands can use |
73f793e3 RS |
1658 | @samp{%}. |
1659 | ||
03dda8e3 RK |
1660 | @ifset INTERNALS |
1661 | This is often used in patterns for addition instructions | |
1662 | that really have only two operands: the result must go in one of the | |
1663 | arguments. Here for example, is how the 68000 halfword-add | |
1664 | instruction is defined: | |
1665 | ||
1666 | @smallexample | |
1667 | (define_insn "addhi3" | |
1668 | [(set (match_operand:HI 0 "general_operand" "=m,r") | |
1669 | (plus:HI (match_operand:HI 1 "general_operand" "%0,0") | |
1670 | (match_operand:HI 2 "general_operand" "di,g")))] | |
1671 | @dots{}) | |
1672 | @end smallexample | |
1673 | @end ifset | |
daf2f129 | 1674 | GCC can only handle one commutative pair in an asm; if you use more, |
595163db EB |
1675 | the compiler may fail. Note that you need not use the modifier if |
1676 | the two alternatives are strictly identical; this would only waste | |
4f237f2e DW |
1677 | time in the reload pass. |
1678 | @ifset INTERNALS | |
1679 | The modifier is not operational after | |
be3914df HPN |
1680 | register allocation, so the result of @code{define_peephole2} |
1681 | and @code{define_split}s performed after reload cannot rely on | |
1682 | @samp{%} to make the intended insn match. | |
03dda8e3 RK |
1683 | |
1684 | @cindex @samp{#} in constraint | |
1685 | @item # | |
1686 | Says that all following characters, up to the next comma, are to be | |
1687 | ignored as a constraint. They are significant only for choosing | |
1688 | register preferences. | |
1689 | ||
03dda8e3 RK |
1690 | @cindex @samp{*} in constraint |
1691 | @item * | |
1692 | Says that the following character should be ignored when choosing | |
1693 | register preferences. @samp{*} has no effect on the meaning of the | |
55a2c322 VM |
1694 | constraint as a constraint, and no effect on reloading. For LRA |
1695 | @samp{*} additionally disparages slightly the alternative if the | |
1696 | following character matches the operand. | |
03dda8e3 RK |
1697 | |
1698 | Here is an example: the 68000 has an instruction to sign-extend a | |
1699 | halfword in a data register, and can also sign-extend a value by | |
1700 | copying it into an address register. While either kind of register is | |
1701 | acceptable, the constraints on an address-register destination are | |
1702 | less strict, so it is best if register allocation makes an address | |
1703 | register its goal. Therefore, @samp{*} is used so that the @samp{d} | |
1704 | constraint letter (for data register) is ignored when computing | |
1705 | register preferences. | |
1706 | ||
1707 | @smallexample | |
1708 | (define_insn "extendhisi2" | |
1709 | [(set (match_operand:SI 0 "general_operand" "=*d,a") | |
1710 | (sign_extend:SI | |
1711 | (match_operand:HI 1 "general_operand" "0,g")))] | |
1712 | @dots{}) | |
1713 | @end smallexample | |
1714 | @end ifset | |
1715 | @end table | |
1716 | ||
1717 | @node Machine Constraints | |
1718 | @subsection Constraints for Particular Machines | |
1719 | @cindex machine specific constraints | |
1720 | @cindex constraints, machine specific | |
1721 | ||
1722 | Whenever possible, you should use the general-purpose constraint letters | |
1723 | in @code{asm} arguments, since they will convey meaning more readily to | |
1724 | people reading your code. Failing that, use the constraint letters | |
1725 | that usually have very similar meanings across architectures. The most | |
1726 | commonly used constraints are @samp{m} and @samp{r} (for memory and | |
1727 | general-purpose registers respectively; @pxref{Simple Constraints}), and | |
1728 | @samp{I}, usually the letter indicating the most common | |
1729 | immediate-constant format. | |
1730 | ||
f38840db ZW |
1731 | Each architecture defines additional constraints. These constraints |
1732 | are used by the compiler itself for instruction generation, as well as | |
1733 | for @code{asm} statements; therefore, some of the constraints are not | |
1734 | particularly useful for @code{asm}. Here is a summary of some of the | |
1735 | machine-dependent constraints available on some particular machines; | |
1736 | it includes both constraints that are useful for @code{asm} and | |
1737 | constraints that aren't. The compiler source file mentioned in the | |
1738 | table heading for each architecture is the definitive reference for | |
1739 | the meanings of that architecture's constraints. | |
6ccde948 | 1740 | |
b4fbcb1b | 1741 | @c Please keep this table alphabetized by target! |
03dda8e3 | 1742 | @table @emph |
5c0da018 IB |
1743 | @item AArch64 family---@file{config/aarch64/constraints.md} |
1744 | @table @code | |
1745 | @item k | |
1746 | The stack pointer register (@code{SP}) | |
1747 | ||
1748 | @item w | |
43cacb12 RS |
1749 | Floating point register, Advanced SIMD vector register or SVE vector register |
1750 | ||
163b1f6a RS |
1751 | @item x |
1752 | Like @code{w}, but restricted to registers 0 to 15 inclusive. | |
1753 | ||
1754 | @item y | |
1755 | Like @code{w}, but restricted to registers 0 to 7 inclusive. | |
1756 | ||
43cacb12 RS |
1757 | @item Upl |
1758 | One of the low eight SVE predicate registers (@code{P0} to @code{P7}) | |
1759 | ||
1760 | @item Upa | |
1761 | Any of the SVE predicate registers (@code{P0} to @code{P15}) | |
5c0da018 IB |
1762 | |
1763 | @item I | |
1764 | Integer constant that is valid as an immediate operand in an @code{ADD} | |
1765 | instruction | |
1766 | ||
1767 | @item J | |
1768 | Integer constant that is valid as an immediate operand in a @code{SUB} | |
1769 | instruction (once negated) | |
1770 | ||
1771 | @item K | |
1772 | Integer constant that can be used with a 32-bit logical instruction | |
1773 | ||
1774 | @item L | |
1775 | Integer constant that can be used with a 64-bit logical instruction | |
1776 | ||
1777 | @item M | |
1778 | Integer constant that is valid as an immediate operand in a 32-bit @code{MOV} | |
1779 | pseudo instruction. The @code{MOV} may be assembled to one of several different | |
1780 | machine instructions depending on the value | |
1781 | ||
1782 | @item N | |
1783 | Integer constant that is valid as an immediate operand in a 64-bit @code{MOV} | |
1784 | pseudo instruction | |
1785 | ||
1786 | @item S | |
1787 | An absolute symbolic address or a label reference | |
1788 | ||
1789 | @item Y | |
1790 | Floating point constant zero | |
1791 | ||
1792 | @item Z | |
1793 | Integer constant zero | |
1794 | ||
5c0da018 IB |
1795 | @item Ush |
1796 | The high part (bits 12 and upwards) of the pc-relative address of a symbol | |
1797 | within 4GB of the instruction | |
1798 | ||
1799 | @item Q | |
1800 | A memory address which uses a single base register with no offset | |
1801 | ||
1802 | @item Ump | |
1803 | A memory address suitable for a load/store pair instruction in SI, DI, SF and | |
1804 | DF modes | |
1805 | ||
5c0da018 IB |
1806 | @end table |
1807 | ||
1808 | ||
1b7ee8b4 AS |
1809 | @item AMD GCN ---@file{config/gcn/constraints.md} |
1810 | @table @code | |
1811 | @item I | |
1812 | Immediate integer in the range @minus{}16 to 64 | |
1813 | ||
1814 | @item J | |
1815 | Immediate 16-bit signed integer | |
1816 | ||
1817 | @item Kf | |
1818 | Immediate constant @minus{}1 | |
1819 | ||
1820 | @item L | |
1821 | Immediate 15-bit unsigned integer | |
1822 | ||
1823 | @item A | |
1824 | Immediate constant that can be inlined in an instruction encoding: integer | |
1825 | @minus{}16..64, or float 0.0, +/@minus{}0.5, +/@minus{}1.0, +/@minus{}2.0, | |
1826 | +/@minus{}4.0, 1.0/(2.0*PI) | |
1827 | ||
1828 | @item B | |
1829 | Immediate 32-bit signed integer that can be attached to an instruction encoding | |
1830 | ||
1831 | @item C | |
1832 | Immediate 32-bit integer in range @minus{}16..4294967295 (i.e. 32-bit unsigned | |
1833 | integer or @samp{A} constraint) | |
1834 | ||
1835 | @item DA | |
1836 | Immediate 64-bit constant that can be split into two @samp{A} constants | |
1837 | ||
1838 | @item DB | |
1839 | Immediate 64-bit constant that can be split into two @samp{B} constants | |
1840 | ||
1841 | @item U | |
1842 | Any @code{unspec} | |
1843 | ||
1844 | @item Y | |
1845 | Any @code{symbol_ref} or @code{label_ref} | |
1846 | ||
1847 | @item v | |
1848 | VGPR register | |
1849 | ||
1850 | @item Sg | |
1851 | SGPR register | |
1852 | ||
1853 | @item SD | |
1854 | SGPR registers valid for instruction destinations, including VCC, M0 and EXEC | |
1855 | ||
1856 | @item SS | |
1857 | SGPR registers valid for instruction sources, including VCC, M0, EXEC and SCC | |
1858 | ||
1859 | @item Sm | |
1860 | SGPR registers valid as a source for scalar memory instructions (excludes M0 | |
1861 | and EXEC) | |
1862 | ||
1863 | @item Sv | |
1864 | SGPR registers valid as a source or destination for vector instructions | |
1865 | (excludes EXEC) | |
1866 | ||
1867 | @item ca | |
1868 | All condition registers: SCC, VCCZ, EXECZ | |
1869 | ||
1870 | @item cs | |
1871 | Scalar condition register: SCC | |
1872 | ||
1873 | @item cV | |
1874 | Vector condition register: VCC, VCC_LO, VCC_HI | |
1875 | ||
1876 | @item e | |
1877 | EXEC register (EXEC_LO and EXEC_HI) | |
1878 | ||
1879 | @item RB | |
1880 | Memory operand with address space suitable for @code{buffer_*} instructions | |
1881 | ||
1882 | @item RF | |
1883 | Memory operand with address space suitable for @code{flat_*} instructions | |
1884 | ||
1885 | @item RS | |
1886 | Memory operand with address space suitable for @code{s_*} instructions | |
1887 | ||
1888 | @item RL | |
1889 | Memory operand with address space suitable for @code{ds_*} LDS instructions | |
1890 | ||
1891 | @item RG | |
1892 | Memory operand with address space suitable for @code{ds_*} GDS instructions | |
1893 | ||
1894 | @item RD | |
1895 | Memory operand with address space suitable for any @code{ds_*} instructions | |
1896 | ||
1897 | @item RM | |
1898 | Memory operand with address space suitable for @code{global_*} instructions | |
1899 | ||
1900 | @end table | |
1901 | ||
1902 | ||
5d5f6720 JR |
1903 | @item ARC ---@file{config/arc/constraints.md} |
1904 | @table @code | |
1905 | @item q | |
1906 | Registers usable in ARCompact 16-bit instructions: @code{r0}-@code{r3}, | |
1907 | @code{r12}-@code{r15}. This constraint can only match when the @option{-mq} | |
1908 | option is in effect. | |
1909 | ||
1910 | @item e | |
1911 | Registers usable as base-regs of memory addresses in ARCompact 16-bit memory | |
1912 | instructions: @code{r0}-@code{r3}, @code{r12}-@code{r15}, @code{sp}. | |
1913 | This constraint can only match when the @option{-mq} | |
1914 | option is in effect. | |
1915 | @item D | |
1916 | ARC FPX (dpfp) 64-bit registers. @code{D0}, @code{D1}. | |
1917 | ||
1918 | @item I | |
1919 | A signed 12-bit integer constant. | |
1920 | ||
1921 | @item Cal | |
1922 | constant for arithmetic/logical operations. This might be any constant | |
1923 | that can be put into a long immediate by the assmbler or linker without | |
1924 | involving a PIC relocation. | |
1925 | ||
1926 | @item K | |
1927 | A 3-bit unsigned integer constant. | |
1928 | ||
1929 | @item L | |
1930 | A 6-bit unsigned integer constant. | |
1931 | ||
1932 | @item CnL | |
1933 | One's complement of a 6-bit unsigned integer constant. | |
1934 | ||
1935 | @item CmL | |
1936 | Two's complement of a 6-bit unsigned integer constant. | |
1937 | ||
1938 | @item M | |
1939 | A 5-bit unsigned integer constant. | |
1940 | ||
1941 | @item O | |
1942 | A 7-bit unsigned integer constant. | |
1943 | ||
1944 | @item P | |
1945 | A 8-bit unsigned integer constant. | |
1946 | ||
1947 | @item H | |
1948 | Any const_double value. | |
1949 | @end table | |
1950 | ||
dae840fc | 1951 | @item ARM family---@file{config/arm/constraints.md} |
03dda8e3 | 1952 | @table @code |
b24671f7 RR |
1953 | |
1954 | @item h | |
1955 | In Thumb state, the core registers @code{r8}-@code{r15}. | |
1956 | ||
1957 | @item k | |
1958 | The stack pointer register. | |
1959 | ||
1960 | @item l | |
1961 | In Thumb State the core registers @code{r0}-@code{r7}. In ARM state this | |
1962 | is an alias for the @code{r} constraint. | |
1963 | ||
1964 | @item t | |
1965 | VFP floating-point registers @code{s0}-@code{s31}. Used for 32 bit values. | |
1966 | ||
9b66ebb1 | 1967 | @item w |
b24671f7 RR |
1968 | VFP floating-point registers @code{d0}-@code{d31} and the appropriate |
1969 | subset @code{d0}-@code{d15} based on command line options. | |
1970 | Used for 64 bit values only. Not valid for Thumb1. | |
1971 | ||
1972 | @item y | |
1973 | The iWMMX co-processor registers. | |
1974 | ||
1975 | @item z | |
1976 | The iWMMX GR registers. | |
9b66ebb1 | 1977 | |
03dda8e3 | 1978 | @item G |
dae840fc | 1979 | The floating-point constant 0.0 |
03dda8e3 RK |
1980 | |
1981 | @item I | |
1982 | Integer that is valid as an immediate operand in a data processing | |
1983 | instruction. That is, an integer in the range 0 to 255 rotated by a | |
1984 | multiple of 2 | |
1985 | ||
1986 | @item J | |
630d3d5a | 1987 | Integer in the range @minus{}4095 to 4095 |
03dda8e3 RK |
1988 | |
1989 | @item K | |
1990 | Integer that satisfies constraint @samp{I} when inverted (ones complement) | |
1991 | ||
1992 | @item L | |
1993 | Integer that satisfies constraint @samp{I} when negated (twos complement) | |
1994 | ||
1995 | @item M | |
1996 | Integer in the range 0 to 32 | |
1997 | ||
1998 | @item Q | |
1999 | A memory reference where the exact address is in a single register | |
2000 | (`@samp{m}' is preferable for @code{asm} statements) | |
2001 | ||
2002 | @item R | |
2003 | An item in the constant pool | |
2004 | ||
2005 | @item S | |
2006 | A symbol in the text segment of the current file | |
03dda8e3 | 2007 | |
1e1ab407 | 2008 | @item Uv |
9b66ebb1 PB |
2009 | A memory reference suitable for VFP load/store insns (reg+constant offset) |
2010 | ||
fdd695fd PB |
2011 | @item Uy |
2012 | A memory reference suitable for iWMMXt load/store instructions. | |
2013 | ||
1e1ab407 | 2014 | @item Uq |
0bdcd332 | 2015 | A memory reference suitable for the ARMv4 ldrsb instruction. |
db875b15 | 2016 | @end table |
1e1ab407 | 2017 | |
fc262682 | 2018 | @item AVR family---@file{config/avr/constraints.md} |
052a4b28 DC |
2019 | @table @code |
2020 | @item l | |
2021 | Registers from r0 to r15 | |
2022 | ||
2023 | @item a | |
2024 | Registers from r16 to r23 | |
2025 | ||
2026 | @item d | |
2027 | Registers from r16 to r31 | |
2028 | ||
2029 | @item w | |
3a69a7d5 | 2030 | Registers from r24 to r31. These registers can be used in @samp{adiw} command |
052a4b28 DC |
2031 | |
2032 | @item e | |
d7d9c429 | 2033 | Pointer register (r26--r31) |
052a4b28 DC |
2034 | |
2035 | @item b | |
d7d9c429 | 2036 | Base pointer register (r28--r31) |
052a4b28 | 2037 | |
3a69a7d5 MM |
2038 | @item q |
2039 | Stack pointer register (SPH:SPL) | |
2040 | ||
052a4b28 DC |
2041 | @item t |
2042 | Temporary register r0 | |
2043 | ||
2044 | @item x | |
2045 | Register pair X (r27:r26) | |
2046 | ||
2047 | @item y | |
2048 | Register pair Y (r29:r28) | |
2049 | ||
2050 | @item z | |
2051 | Register pair Z (r31:r30) | |
2052 | ||
2053 | @item I | |
630d3d5a | 2054 | Constant greater than @minus{}1, less than 64 |
052a4b28 DC |
2055 | |
2056 | @item J | |
630d3d5a | 2057 | Constant greater than @minus{}64, less than 1 |
052a4b28 DC |
2058 | |
2059 | @item K | |
2060 | Constant integer 2 | |
2061 | ||
2062 | @item L | |
2063 | Constant integer 0 | |
2064 | ||
2065 | @item M | |
2066 | Constant that fits in 8 bits | |
2067 | ||
2068 | @item N | |
630d3d5a | 2069 | Constant integer @minus{}1 |
052a4b28 DC |
2070 | |
2071 | @item O | |
3a69a7d5 | 2072 | Constant integer 8, 16, or 24 |
052a4b28 DC |
2073 | |
2074 | @item P | |
2075 | Constant integer 1 | |
2076 | ||
2077 | @item G | |
2078 | A floating point constant 0.0 | |
0e8eb4d8 | 2079 | |
0e8eb4d8 EW |
2080 | @item Q |
2081 | A memory address based on Y or Z pointer with displacement. | |
052a4b28 | 2082 | @end table |
53054e77 | 2083 | |
b4fbcb1b SL |
2084 | @item Blackfin family---@file{config/bfin/constraints.md} |
2085 | @table @code | |
2086 | @item a | |
2087 | P register | |
2088 | ||
2089 | @item d | |
2090 | D register | |
2091 | ||
2092 | @item z | |
2093 | A call clobbered P register. | |
2094 | ||
2095 | @item q@var{n} | |
2096 | A single register. If @var{n} is in the range 0 to 7, the corresponding D | |
2097 | register. If it is @code{A}, then the register P0. | |
2098 | ||
2099 | @item D | |
2100 | Even-numbered D register | |
2101 | ||
2102 | @item W | |
2103 | Odd-numbered D register | |
2104 | ||
2105 | @item e | |
2106 | Accumulator register. | |
2107 | ||
2108 | @item A | |
2109 | Even-numbered accumulator register. | |
2110 | ||
2111 | @item B | |
2112 | Odd-numbered accumulator register. | |
2113 | ||
2114 | @item b | |
2115 | I register | |
2116 | ||
2117 | @item v | |
2118 | B register | |
2119 | ||
2120 | @item f | |
2121 | M register | |
2122 | ||
2123 | @item c | |
630ba2fd | 2124 | Registers used for circular buffering, i.e.@: I, B, or L registers. |
b4fbcb1b SL |
2125 | |
2126 | @item C | |
2127 | The CC register. | |
2128 | ||
2129 | @item t | |
2130 | LT0 or LT1. | |
2131 | ||
2132 | @item k | |
2133 | LC0 or LC1. | |
2134 | ||
2135 | @item u | |
2136 | LB0 or LB1. | |
2137 | ||
2138 | @item x | |
2139 | Any D, P, B, M, I or L register. | |
2140 | ||
2141 | @item y | |
2142 | Additional registers typically used only in prologues and epilogues: RETS, | |
2143 | RETN, RETI, RETX, RETE, ASTAT, SEQSTAT and USP. | |
2144 | ||
2145 | @item w | |
2146 | Any register except accumulators or CC. | |
2147 | ||
2148 | @item Ksh | |
2149 | Signed 16 bit integer (in the range @minus{}32768 to 32767) | |
2150 | ||
2151 | @item Kuh | |
2152 | Unsigned 16 bit integer (in the range 0 to 65535) | |
2153 | ||
2154 | @item Ks7 | |
2155 | Signed 7 bit integer (in the range @minus{}64 to 63) | |
2156 | ||
2157 | @item Ku7 | |
2158 | Unsigned 7 bit integer (in the range 0 to 127) | |
2159 | ||
2160 | @item Ku5 | |
2161 | Unsigned 5 bit integer (in the range 0 to 31) | |
2162 | ||
2163 | @item Ks4 | |
2164 | Signed 4 bit integer (in the range @minus{}8 to 7) | |
2165 | ||
2166 | @item Ks3 | |
2167 | Signed 3 bit integer (in the range @minus{}3 to 4) | |
2168 | ||
2169 | @item Ku3 | |
2170 | Unsigned 3 bit integer (in the range 0 to 7) | |
2171 | ||
2172 | @item P@var{n} | |
2173 | Constant @var{n}, where @var{n} is a single-digit constant in the range 0 to 4. | |
2174 | ||
2175 | @item PA | |
2176 | An integer equal to one of the MACFLAG_XXX constants that is suitable for | |
2177 | use with either accumulator. | |
2178 | ||
2179 | @item PB | |
2180 | An integer equal to one of the MACFLAG_XXX constants that is suitable for | |
2181 | use only with accumulator A1. | |
2182 | ||
2183 | @item M1 | |
2184 | Constant 255. | |
2185 | ||
2186 | @item M2 | |
2187 | Constant 65535. | |
2188 | ||
2189 | @item J | |
2190 | An integer constant with exactly a single bit set. | |
2191 | ||
2192 | @item L | |
2193 | An integer constant with all bits set except exactly one. | |
2194 | ||
2195 | @item H | |
2196 | ||
2197 | @item Q | |
2198 | Any SYMBOL_REF. | |
2199 | @end table | |
2200 | ||
2201 | @item CR16 Architecture---@file{config/cr16/cr16.h} | |
2202 | @table @code | |
2203 | ||
2204 | @item b | |
2205 | Registers from r0 to r14 (registers without stack pointer) | |
2206 | ||
2207 | @item t | |
2208 | Register from r0 to r11 (all 16-bit registers) | |
2209 | ||
2210 | @item p | |
2211 | Register from r12 to r15 (all 32-bit registers) | |
2212 | ||
2213 | @item I | |
2214 | Signed constant that fits in 4 bits | |
2215 | ||
2216 | @item J | |
2217 | Signed constant that fits in 5 bits | |
2218 | ||
2219 | @item K | |
2220 | Signed constant that fits in 6 bits | |
2221 | ||
2222 | @item L | |
2223 | Unsigned constant that fits in 4 bits | |
2224 | ||
2225 | @item M | |
2226 | Signed constant that fits in 32 bits | |
2227 | ||
2228 | @item N | |
2229 | Check for 64 bits wide constants for add/sub instructions | |
2230 | ||
2231 | @item G | |
2232 | Floating point constant that is legal for store immediate | |
2233 | @end table | |
2234 | ||
fbceb769 SL |
2235 | @item C-SKY---@file{config/csky/constraints.md} |
2236 | @table @code | |
2237 | ||
2238 | @item a | |
2239 | The mini registers r0 - r7. | |
2240 | ||
2241 | @item b | |
2242 | The low registers r0 - r15. | |
2243 | ||
2244 | @item c | |
2245 | C register. | |
2246 | ||
2247 | @item y | |
2248 | HI and LO registers. | |
2249 | ||
2250 | @item l | |
2251 | LO register. | |
2252 | ||
2253 | @item h | |
2254 | HI register. | |
2255 | ||
2256 | @item v | |
2257 | Vector registers. | |
2258 | ||
2259 | @item z | |
2260 | Stack pointer register (SP). | |
db92bd22 GQ |
2261 | |
2262 | @item Q | |
2263 | A memory address which uses a base register with a short offset | |
2264 | or with a index register with its scale. | |
2265 | ||
2266 | @item W | |
2267 | A memory address which uses a base register with a index register | |
2268 | with its scale. | |
fbceb769 SL |
2269 | @end table |
2270 | ||
2271 | @ifset INTERNALS | |
2272 | The C-SKY back end supports a large set of additional constraints | |
2273 | that are only useful for instruction selection or splitting rather | |
2274 | than inline asm, such as constraints representing constant integer | |
2275 | ranges accepted by particular instruction encodings. | |
2276 | Refer to the source code for details. | |
2277 | @end ifset | |
2278 | ||
feeeff5c JR |
2279 | @item Epiphany---@file{config/epiphany/constraints.md} |
2280 | @table @code | |
2281 | @item U16 | |
2282 | An unsigned 16-bit constant. | |
2283 | ||
2284 | @item K | |
2285 | An unsigned 5-bit constant. | |
2286 | ||
2287 | @item L | |
2288 | A signed 11-bit constant. | |
2289 | ||
2290 | @item Cm1 | |
2291 | A signed 11-bit constant added to @minus{}1. | |
2292 | Can only match when the @option{-m1reg-@var{reg}} option is active. | |
2293 | ||
2294 | @item Cl1 | |
2295 | Left-shift of @minus{}1, i.e., a bit mask with a block of leading ones, the rest | |
2296 | being a block of trailing zeroes. | |
2297 | Can only match when the @option{-m1reg-@var{reg}} option is active. | |
2298 | ||
2299 | @item Cr1 | |
2300 | Right-shift of @minus{}1, i.e., a bit mask with a trailing block of ones, the | |
2301 | rest being zeroes. Or to put it another way, one less than a power of two. | |
2302 | Can only match when the @option{-m1reg-@var{reg}} option is active. | |
2303 | ||
2304 | @item Cal | |
2305 | Constant for arithmetic/logical operations. | |
2306 | This is like @code{i}, except that for position independent code, | |
2307 | no symbols / expressions needing relocations are allowed. | |
2308 | ||
2309 | @item Csy | |
2310 | Symbolic constant for call/jump instruction. | |
2311 | ||
2312 | @item Rcs | |
2313 | The register class usable in short insns. This is a register class | |
2314 | constraint, and can thus drive register allocation. | |
2315 | This constraint won't match unless @option{-mprefer-short-insn-regs} is | |
2316 | in effect. | |
2317 | ||
2318 | @item Rsc | |
2319 | The the register class of registers that can be used to hold a | |
2320 | sibcall call address. I.e., a caller-saved register. | |
2321 | ||
2322 | @item Rct | |
2323 | Core control register class. | |
2324 | ||
2325 | @item Rgs | |
2326 | The register group usable in short insns. | |
2327 | This constraint does not use a register class, so that it only | |
2328 | passively matches suitable registers, and doesn't drive register allocation. | |
2329 | ||
2330 | @ifset INTERNALS | |
2331 | @item Car | |
2332 | Constant suitable for the addsi3_r pattern. This is a valid offset | |
2333 | For byte, halfword, or word addressing. | |
2334 | @end ifset | |
2335 | ||
2336 | @item Rra | |
2337 | Matches the return address if it can be replaced with the link register. | |
2338 | ||
2339 | @item Rcc | |
2340 | Matches the integer condition code register. | |
2341 | ||
2342 | @item Sra | |
2343 | Matches the return address if it is in a stack slot. | |
2344 | ||
2345 | @item Cfm | |
2346 | Matches control register values to switch fp mode, which are encapsulated in | |
2347 | @code{UNSPEC_FP_MODE}. | |
2348 | @end table | |
2349 | ||
b4fbcb1b | 2350 | @item FRV---@file{config/frv/frv.h} |
b25364a0 | 2351 | @table @code |
b4fbcb1b SL |
2352 | @item a |
2353 | Register in the class @code{ACC_REGS} (@code{acc0} to @code{acc7}). | |
b25364a0 S |
2354 | |
2355 | @item b | |
b4fbcb1b SL |
2356 | Register in the class @code{EVEN_ACC_REGS} (@code{acc0} to @code{acc7}). |
2357 | ||
2358 | @item c | |
2359 | Register in the class @code{CC_REGS} (@code{fcc0} to @code{fcc3} and | |
2360 | @code{icc0} to @code{icc3}). | |
2361 | ||
2362 | @item d | |
2363 | Register in the class @code{GPR_REGS} (@code{gr0} to @code{gr63}). | |
2364 | ||
2365 | @item e | |
2366 | Register in the class @code{EVEN_REGS} (@code{gr0} to @code{gr63}). | |
2367 | Odd registers are excluded not in the class but through the use of a machine | |
2368 | mode larger than 4 bytes. | |
2369 | ||
2370 | @item f | |
2371 | Register in the class @code{FPR_REGS} (@code{fr0} to @code{fr63}). | |
2372 | ||
2373 | @item h | |
2374 | Register in the class @code{FEVEN_REGS} (@code{fr0} to @code{fr63}). | |
2375 | Odd registers are excluded not in the class but through the use of a machine | |
2376 | mode larger than 4 bytes. | |
2377 | ||
2378 | @item l | |
2379 | Register in the class @code{LR_REG} (the @code{lr} register). | |
2380 | ||
2381 | @item q | |
2382 | Register in the class @code{QUAD_REGS} (@code{gr2} to @code{gr63}). | |
2383 | Register numbers not divisible by 4 are excluded not in the class but through | |
2384 | the use of a machine mode larger than 8 bytes. | |
b25364a0 S |
2385 | |
2386 | @item t | |
b4fbcb1b | 2387 | Register in the class @code{ICC_REGS} (@code{icc0} to @code{icc3}). |
b25364a0 | 2388 | |
b4fbcb1b SL |
2389 | @item u |
2390 | Register in the class @code{FCC_REGS} (@code{fcc0} to @code{fcc3}). | |
2391 | ||
2392 | @item v | |
2393 | Register in the class @code{ICR_REGS} (@code{cc4} to @code{cc7}). | |
2394 | ||
2395 | @item w | |
2396 | Register in the class @code{FCR_REGS} (@code{cc0} to @code{cc3}). | |
2397 | ||
2398 | @item x | |
2399 | Register in the class @code{QUAD_FPR_REGS} (@code{fr0} to @code{fr63}). | |
2400 | Register numbers not divisible by 4 are excluded not in the class but through | |
2401 | the use of a machine mode larger than 8 bytes. | |
2402 | ||
2403 | @item z | |
2404 | Register in the class @code{SPR_REGS} (@code{lcr} and @code{lr}). | |
2405 | ||
2406 | @item A | |
2407 | Register in the class @code{QUAD_ACC_REGS} (@code{acc0} to @code{acc7}). | |
2408 | ||
2409 | @item B | |
2410 | Register in the class @code{ACCG_REGS} (@code{accg0} to @code{accg7}). | |
2411 | ||
2412 | @item C | |
2413 | Register in the class @code{CR_REGS} (@code{cc0} to @code{cc7}). | |
2414 | ||
2415 | @item G | |
2416 | Floating point constant zero | |
b25364a0 S |
2417 | |
2418 | @item I | |
b4fbcb1b | 2419 | 6-bit signed integer constant |
b25364a0 S |
2420 | |
2421 | @item J | |
b4fbcb1b | 2422 | 10-bit signed integer constant |
b25364a0 S |
2423 | |
2424 | @item L | |
b4fbcb1b | 2425 | 16-bit signed integer constant |
b25364a0 S |
2426 | |
2427 | @item M | |
b4fbcb1b | 2428 | 16-bit unsigned integer constant |
b25364a0 S |
2429 | |
2430 | @item N | |
b4fbcb1b SL |
2431 | 12-bit signed integer constant that is negative---i.e.@: in the |
2432 | range of @minus{}2048 to @minus{}1 | |
2433 | ||
2434 | @item O | |
2435 | Constant zero | |
2436 | ||
2437 | @item P | |
2438 | 12-bit signed integer constant that is greater than zero---i.e.@: in the | |
2439 | range of 1 to 2047. | |
b25364a0 | 2440 | |
b25364a0 S |
2441 | @end table |
2442 | ||
fef939d6 JB |
2443 | @item FT32---@file{config/ft32/constraints.md} |
2444 | @table @code | |
2445 | @item A | |
2446 | An absolute address | |
2447 | ||
2448 | @item B | |
2449 | An offset address | |
2450 | ||
2451 | @item W | |
2452 | A register indirect memory operand | |
2453 | ||
2454 | @item e | |
2455 | An offset address. | |
2456 | ||
2457 | @item f | |
2458 | An offset address. | |
2459 | ||
2460 | @item O | |
2461 | The constant zero or one | |
2462 | ||
2463 | @item I | |
2464 | A 16-bit signed constant (@minus{}32768 @dots{} 32767) | |
2465 | ||
2466 | @item w | |
2467 | A bitfield mask suitable for bext or bins | |
2468 | ||
2469 | @item x | |
2470 | An inverted bitfield mask suitable for bext or bins | |
2471 | ||
2472 | @item L | |
2473 | A 16-bit unsigned constant, multiple of 4 (0 @dots{} 65532) | |
2474 | ||
2475 | @item S | |
2476 | A 20-bit signed constant (@minus{}524288 @dots{} 524287) | |
2477 | ||
2478 | @item b | |
2479 | A constant for a bitfield width (1 @dots{} 16) | |
2480 | ||
2481 | @item KA | |
2482 | A 10-bit signed constant (@minus{}512 @dots{} 511) | |
2483 | ||
2484 | @end table | |
2485 | ||
8119b4e4 JDA |
2486 | @item Hewlett-Packard PA-RISC---@file{config/pa/pa.h} |
2487 | @table @code | |
2488 | @item a | |
2489 | General register 1 | |
2490 | ||
2491 | @item f | |
2492 | Floating point register | |
2493 | ||
2494 | @item q | |
2495 | Shift amount register | |
2496 | ||
2497 | @item x | |
2498 | Floating point register (deprecated) | |
2499 | ||
2500 | @item y | |
2501 | Upper floating point register (32-bit), floating point register (64-bit) | |
2502 | ||
2503 | @item Z | |
2504 | Any register | |
2505 | ||
2506 | @item I | |
2507 | Signed 11-bit integer constant | |
2508 | ||
2509 | @item J | |
2510 | Signed 14-bit integer constant | |
2511 | ||
2512 | @item K | |
2513 | Integer constant that can be deposited with a @code{zdepi} instruction | |
2514 | ||
2515 | @item L | |
2516 | Signed 5-bit integer constant | |
2517 | ||
2518 | @item M | |
2519 | Integer constant 0 | |
2520 | ||
2521 | @item N | |
2522 | Integer constant that can be loaded with a @code{ldil} instruction | |
2523 | ||
2524 | @item O | |
2525 | Integer constant whose value plus one is a power of 2 | |
2526 | ||
2527 | @item P | |
2528 | Integer constant that can be used for @code{and} operations in @code{depi} | |
2529 | and @code{extru} instructions | |
2530 | ||
2531 | @item S | |
2532 | Integer constant 31 | |
2533 | ||
2534 | @item U | |
2535 | Integer constant 63 | |
2536 | ||
2537 | @item G | |
2538 | Floating-point constant 0.0 | |
2539 | ||
2540 | @item A | |
2541 | A @code{lo_sum} data-linkage-table memory operand | |
2542 | ||
2543 | @item Q | |
2544 | A memory operand that can be used as the destination operand of an | |
2545 | integer store instruction | |
2546 | ||
2547 | @item R | |
2548 | A scaled or unscaled indexed memory operand | |
2549 | ||
2550 | @item T | |
2551 | A memory operand for floating-point loads and stores | |
2552 | ||
2553 | @item W | |
2554 | A register indirect memory operand | |
2555 | @end table | |
2556 | ||
b4fbcb1b | 2557 | @item Intel IA-64---@file{config/ia64/ia64.h} |
03dda8e3 | 2558 | @table @code |
b4fbcb1b SL |
2559 | @item a |
2560 | General register @code{r0} to @code{r3} for @code{addl} instruction | |
03dda8e3 | 2561 | |
b4fbcb1b SL |
2562 | @item b |
2563 | Branch register | |
7a430e3b SC |
2564 | |
2565 | @item c | |
2566 | Predicate register (@samp{c} as in ``conditional'') | |
2567 | ||
b4fbcb1b SL |
2568 | @item d |
2569 | Application register residing in M-unit | |
0d4a78eb | 2570 | |
b4fbcb1b SL |
2571 | @item e |
2572 | Application register residing in I-unit | |
0d4a78eb | 2573 | |
b4fbcb1b SL |
2574 | @item f |
2575 | Floating-point register | |
3efd5670 | 2576 | |
b4fbcb1b SL |
2577 | @item m |
2578 | Memory operand. If used together with @samp{<} or @samp{>}, | |
2579 | the operand can have postincrement and postdecrement which | |
2580 | require printing with @samp{%Pn} on IA-64. | |
3efd5670 | 2581 | |
b4fbcb1b SL |
2582 | @item G |
2583 | Floating-point constant 0.0 or 1.0 | |
0d4a78eb | 2584 | |
b4fbcb1b SL |
2585 | @item I |
2586 | 14-bit signed integer constant | |
0d4a78eb BS |
2587 | |
2588 | @item J | |
b4fbcb1b SL |
2589 | 22-bit signed integer constant |
2590 | ||
2591 | @item K | |
2592 | 8-bit signed integer constant for logical instructions | |
0d4a78eb BS |
2593 | |
2594 | @item L | |
b4fbcb1b | 2595 | 8-bit adjusted signed integer constant for compare pseudo-ops |
0d4a78eb | 2596 | |
b4fbcb1b SL |
2597 | @item M |
2598 | 6-bit unsigned integer constant for shift counts | |
2599 | ||
2600 | @item N | |
2601 | 9-bit signed integer constant for load and store postincrements | |
2602 | ||
2603 | @item O | |
2604 | The constant zero | |
2605 | ||
2606 | @item P | |
2607 | 0 or @minus{}1 for @code{dep} instruction | |
0d4a78eb BS |
2608 | |
2609 | @item Q | |
b4fbcb1b SL |
2610 | Non-volatile memory for floating-point loads and stores |
2611 | ||
2612 | @item R | |
2613 | Integer constant in the range 1 to 4 for @code{shladd} instruction | |
2614 | ||
2615 | @item S | |
2616 | Memory operand except postincrement and postdecrement. This is | |
2617 | now roughly the same as @samp{m} when not used together with @samp{<} | |
2618 | or @samp{>}. | |
0d4a78eb BS |
2619 | @end table |
2620 | ||
74fe790b ZW |
2621 | @item M32C---@file{config/m32c/m32c.c} |
2622 | @table @code | |
38b2d076 DD |
2623 | @item Rsp |
2624 | @itemx Rfb | |
2625 | @itemx Rsb | |
2626 | @samp{$sp}, @samp{$fb}, @samp{$sb}. | |
2627 | ||
2628 | @item Rcr | |
2629 | Any control register, when they're 16 bits wide (nothing if control | |
2630 | registers are 24 bits wide) | |
2631 | ||
2632 | @item Rcl | |
2633 | Any control register, when they're 24 bits wide. | |
2634 | ||
2635 | @item R0w | |
2636 | @itemx R1w | |
2637 | @itemx R2w | |
2638 | @itemx R3w | |
2639 | $r0, $r1, $r2, $r3. | |
2640 | ||
2641 | @item R02 | |
2642 | $r0 or $r2, or $r2r0 for 32 bit values. | |
2643 | ||
2644 | @item R13 | |
2645 | $r1 or $r3, or $r3r1 for 32 bit values. | |
2646 | ||
2647 | @item Rdi | |
2648 | A register that can hold a 64 bit value. | |
2649 | ||
2650 | @item Rhl | |
2651 | $r0 or $r1 (registers with addressable high/low bytes) | |
2652 | ||
2653 | @item R23 | |
2654 | $r2 or $r3 | |
2655 | ||
2656 | @item Raa | |
2657 | Address registers | |
2658 | ||
2659 | @item Raw | |
2660 | Address registers when they're 16 bits wide. | |
2661 | ||
2662 | @item Ral | |
2663 | Address registers when they're 24 bits wide. | |
2664 | ||
2665 | @item Rqi | |
2666 | Registers that can hold QI values. | |
2667 | ||
2668 | @item Rad | |
2669 | Registers that can be used with displacements ($a0, $a1, $sb). | |
2670 | ||
2671 | @item Rsi | |
2672 | Registers that can hold 32 bit values. | |
2673 | ||
2674 | @item Rhi | |
2675 | Registers that can hold 16 bit values. | |
2676 | ||
2677 | @item Rhc | |
2678 | Registers chat can hold 16 bit values, including all control | |
2679 | registers. | |
2680 | ||
2681 | @item Rra | |
2682 | $r0 through R1, plus $a0 and $a1. | |
2683 | ||
2684 | @item Rfl | |
2685 | The flags register. | |
2686 | ||
2687 | @item Rmm | |
2688 | The memory-based pseudo-registers $mem0 through $mem15. | |
2689 | ||
2690 | @item Rpi | |
2691 | Registers that can hold pointers (16 bit registers for r8c, m16c; 24 | |
2692 | bit registers for m32cm, m32c). | |
2693 | ||
2694 | @item Rpa | |
2695 | Matches multiple registers in a PARALLEL to form a larger register. | |
2696 | Used to match function return values. | |
2697 | ||
2698 | @item Is3 | |
8ad1dde7 | 2699 | @minus{}8 @dots{} 7 |
38b2d076 DD |
2700 | |
2701 | @item IS1 | |
8ad1dde7 | 2702 | @minus{}128 @dots{} 127 |
38b2d076 DD |
2703 | |
2704 | @item IS2 | |
8ad1dde7 | 2705 | @minus{}32768 @dots{} 32767 |
38b2d076 DD |
2706 | |
2707 | @item IU2 | |
2708 | 0 @dots{} 65535 | |
2709 | ||
2710 | @item In4 | |
8ad1dde7 | 2711 | @minus{}8 @dots{} @minus{}1 or 1 @dots{} 8 |
38b2d076 DD |
2712 | |
2713 | @item In5 | |
8ad1dde7 | 2714 | @minus{}16 @dots{} @minus{}1 or 1 @dots{} 16 |
38b2d076 | 2715 | |
23fed240 | 2716 | @item In6 |
8ad1dde7 | 2717 | @minus{}32 @dots{} @minus{}1 or 1 @dots{} 32 |
38b2d076 DD |
2718 | |
2719 | @item IM2 | |
8ad1dde7 | 2720 | @minus{}65536 @dots{} @minus{}1 |
38b2d076 DD |
2721 | |
2722 | @item Ilb | |
2723 | An 8 bit value with exactly one bit set. | |
2724 | ||
2725 | @item Ilw | |
2726 | A 16 bit value with exactly one bit set. | |
2727 | ||
2728 | @item Sd | |
2729 | The common src/dest memory addressing modes. | |
2730 | ||
2731 | @item Sa | |
2732 | Memory addressed using $a0 or $a1. | |
2733 | ||
2734 | @item Si | |
2735 | Memory addressed with immediate addresses. | |
2736 | ||
2737 | @item Ss | |
2738 | Memory addressed using the stack pointer ($sp). | |
2739 | ||
2740 | @item Sf | |
2741 | Memory addressed using the frame base register ($fb). | |
2742 | ||
2743 | @item Ss | |
2744 | Memory addressed using the small base register ($sb). | |
2745 | ||
2746 | @item S1 | |
2747 | $r1h | |
e2491744 DD |
2748 | @end table |
2749 | ||
80920132 ME |
2750 | @item MicroBlaze---@file{config/microblaze/constraints.md} |
2751 | @table @code | |
2752 | @item d | |
2753 | A general register (@code{r0} to @code{r31}). | |
2754 | ||
2755 | @item z | |
2756 | A status register (@code{rmsr}, @code{$fcc1} to @code{$fcc7}). | |
e2491744 | 2757 | |
74fe790b | 2758 | @end table |
38b2d076 | 2759 | |
cbbb5b6d | 2760 | @item MIPS---@file{config/mips/constraints.md} |
4226378a PK |
2761 | @table @code |
2762 | @item d | |
0cb14750 MR |
2763 | A general-purpose register. This is equivalent to @code{r} unless |
2764 | generating MIPS16 code, in which case the MIPS16 register set is used. | |
4226378a PK |
2765 | |
2766 | @item f | |
cbbb5b6d | 2767 | A floating-point register (if available). |
4226378a PK |
2768 | |
2769 | @item h | |
21dfc6dc | 2770 | Formerly the @code{hi} register. This constraint is no longer supported. |
4226378a PK |
2771 | |
2772 | @item l | |
21dfc6dc RS |
2773 | The @code{lo} register. Use this register to store values that are |
2774 | no bigger than a word. | |
4226378a PK |
2775 | |
2776 | @item x | |
21dfc6dc RS |
2777 | The concatenated @code{hi} and @code{lo} registers. Use this register |
2778 | to store doubleword values. | |
cbbb5b6d RS |
2779 | |
2780 | @item c | |
2781 | A register suitable for use in an indirect jump. This will always be | |
2782 | @code{$25} for @option{-mabicalls}. | |
4226378a | 2783 | |
2feaae20 RS |
2784 | @item v |
2785 | Register @code{$3}. Do not use this constraint in new code; | |
2786 | it is retained only for compatibility with glibc. | |
2787 | ||
4226378a | 2788 | @item y |
cbbb5b6d | 2789 | Equivalent to @code{r}; retained for backwards compatibility. |
4226378a PK |
2790 | |
2791 | @item z | |
cbbb5b6d | 2792 | A floating-point condition code register. |
4226378a PK |
2793 | |
2794 | @item I | |
cbbb5b6d | 2795 | A signed 16-bit constant (for arithmetic instructions). |
4226378a PK |
2796 | |
2797 | @item J | |
cbbb5b6d | 2798 | Integer zero. |
4226378a PK |
2799 | |
2800 | @item K | |
cbbb5b6d | 2801 | An unsigned 16-bit constant (for logic instructions). |
4226378a PK |
2802 | |
2803 | @item L | |
cbbb5b6d RS |
2804 | A signed 32-bit constant in which the lower 16 bits are zero. |
2805 | Such constants can be loaded using @code{lui}. | |
4226378a PK |
2806 | |
2807 | @item M | |
cbbb5b6d RS |
2808 | A constant that cannot be loaded using @code{lui}, @code{addiu} |
2809 | or @code{ori}. | |
4226378a PK |
2810 | |
2811 | @item N | |
8ad1dde7 | 2812 | A constant in the range @minus{}65535 to @minus{}1 (inclusive). |
4226378a PK |
2813 | |
2814 | @item O | |
cbbb5b6d | 2815 | A signed 15-bit constant. |
4226378a PK |
2816 | |
2817 | @item P | |
cbbb5b6d | 2818 | A constant in the range 1 to 65535 (inclusive). |
4226378a PK |
2819 | |
2820 | @item G | |
cbbb5b6d | 2821 | Floating-point zero. |
4226378a PK |
2822 | |
2823 | @item R | |
cbbb5b6d | 2824 | An address that can be used in a non-macro load or store. |
22c4c869 CM |
2825 | |
2826 | @item ZC | |
047b52f6 MF |
2827 | A memory operand whose address is formed by a base register and offset |
2828 | that is suitable for use in instructions with the same addressing mode | |
2829 | as @code{ll} and @code{sc}. | |
22c4c869 CM |
2830 | |
2831 | @item ZD | |
82f84ecb MF |
2832 | An address suitable for a @code{prefetch} instruction, or for any other |
2833 | instruction with the same addressing mode as @code{prefetch}. | |
4226378a PK |
2834 | @end table |
2835 | ||
c47b0cb4 | 2836 | @item Motorola 680x0---@file{config/m68k/constraints.md} |
03dda8e3 RK |
2837 | @table @code |
2838 | @item a | |
2839 | Address register | |
2840 | ||
2841 | @item d | |
2842 | Data register | |
2843 | ||
2844 | @item f | |
2845 | 68881 floating-point register, if available | |
2846 | ||
03dda8e3 RK |
2847 | @item I |
2848 | Integer in the range 1 to 8 | |
2849 | ||
2850 | @item J | |
1e5f973d | 2851 | 16-bit signed number |
03dda8e3 RK |
2852 | |
2853 | @item K | |
2854 | Signed number whose magnitude is greater than 0x80 | |
2855 | ||
2856 | @item L | |
630d3d5a | 2857 | Integer in the range @minus{}8 to @minus{}1 |
03dda8e3 RK |
2858 | |
2859 | @item M | |
2860 | Signed number whose magnitude is greater than 0x100 | |
2861 | ||
c47b0cb4 MK |
2862 | @item N |
2863 | Range 24 to 31, rotatert:SI 8 to 1 expressed as rotate | |
2864 | ||
2865 | @item O | |
2866 | 16 (for rotate using swap) | |
2867 | ||
2868 | @item P | |
2869 | Range 8 to 15, rotatert:HI 8 to 1 expressed as rotate | |
2870 | ||
2871 | @item R | |
2872 | Numbers that mov3q can handle | |
2873 | ||
03dda8e3 RK |
2874 | @item G |
2875 | Floating point constant that is not a 68881 constant | |
c47b0cb4 MK |
2876 | |
2877 | @item S | |
2878 | Operands that satisfy 'm' when -mpcrel is in effect | |
2879 | ||
2880 | @item T | |
2881 | Operands that satisfy 's' when -mpcrel is not in effect | |
2882 | ||
2883 | @item Q | |
2884 | Address register indirect addressing mode | |
2885 | ||
2886 | @item U | |
2887 | Register offset addressing | |
2888 | ||
2889 | @item W | |
2890 | const_call_operand | |
2891 | ||
2892 | @item Cs | |
2893 | symbol_ref or const | |
2894 | ||
2895 | @item Ci | |
2896 | const_int | |
2897 | ||
2898 | @item C0 | |
2899 | const_int 0 | |
2900 | ||
2901 | @item Cj | |
2902 | Range of signed numbers that don't fit in 16 bits | |
2903 | ||
2904 | @item Cmvq | |
2905 | Integers valid for mvq | |
2906 | ||
2907 | @item Capsw | |
2908 | Integers valid for a moveq followed by a swap | |
2909 | ||
2910 | @item Cmvz | |
2911 | Integers valid for mvz | |
2912 | ||
2913 | @item Cmvs | |
2914 | Integers valid for mvs | |
2915 | ||
2916 | @item Ap | |
2917 | push_operand | |
2918 | ||
2919 | @item Ac | |
2920 | Non-register operands allowed in clr | |
2921 | ||
03dda8e3 RK |
2922 | @end table |
2923 | ||
cceb575c AG |
2924 | @item Moxie---@file{config/moxie/constraints.md} |
2925 | @table @code | |
2926 | @item A | |
2927 | An absolute address | |
2928 | ||
2929 | @item B | |
2930 | An offset address | |
2931 | ||
2932 | @item W | |
2933 | A register indirect memory operand | |
2934 | ||
2935 | @item I | |
2936 | A constant in the range of 0 to 255. | |
2937 | ||
2938 | @item N | |
8ad1dde7 | 2939 | A constant in the range of 0 to @minus{}255. |
cceb575c AG |
2940 | |
2941 | @end table | |
2942 | ||
f6a83b4a DD |
2943 | @item MSP430--@file{config/msp430/constraints.md} |
2944 | @table @code | |
2945 | ||
2946 | @item R12 | |
2947 | Register R12. | |
2948 | ||
2949 | @item R13 | |
2950 | Register R13. | |
2951 | ||
2952 | @item K | |
2953 | Integer constant 1. | |
2954 | ||
2955 | @item L | |
2956 | Integer constant -1^20..1^19. | |
2957 | ||
2958 | @item M | |
2959 | Integer constant 1-4. | |
2960 | ||
2961 | @item Ya | |
2962 | Memory references which do not require an extended MOVX instruction. | |
2963 | ||
2964 | @item Yl | |
2965 | Memory reference, labels only. | |
2966 | ||
2967 | @item Ys | |
2968 | Memory reference, stack only. | |
2969 | ||
2970 | @end table | |
2971 | ||
9304f876 CJW |
2972 | @item NDS32---@file{config/nds32/constraints.md} |
2973 | @table @code | |
2974 | @item w | |
2975 | LOW register class $r0 to $r7 constraint for V3/V3M ISA. | |
2976 | @item l | |
2977 | LOW register class $r0 to $r7. | |
2978 | @item d | |
2979 | MIDDLE register class $r0 to $r11, $r16 to $r19. | |
2980 | @item h | |
2981 | HIGH register class $r12 to $r14, $r20 to $r31. | |
2982 | @item t | |
2983 | Temporary assist register $ta (i.e.@: $r15). | |
2984 | @item k | |
2985 | Stack register $sp. | |
2986 | @item Iu03 | |
2987 | Unsigned immediate 3-bit value. | |
2988 | @item In03 | |
2989 | Negative immediate 3-bit value in the range of @minus{}7--0. | |
2990 | @item Iu04 | |
2991 | Unsigned immediate 4-bit value. | |
2992 | @item Is05 | |
2993 | Signed immediate 5-bit value. | |
2994 | @item Iu05 | |
2995 | Unsigned immediate 5-bit value. | |
2996 | @item In05 | |
2997 | Negative immediate 5-bit value in the range of @minus{}31--0. | |
2998 | @item Ip05 | |
2999 | Unsigned immediate 5-bit value for movpi45 instruction with range 16--47. | |
3000 | @item Iu06 | |
3001 | Unsigned immediate 6-bit value constraint for addri36.sp instruction. | |
3002 | @item Iu08 | |
3003 | Unsigned immediate 8-bit value. | |
3004 | @item Iu09 | |
3005 | Unsigned immediate 9-bit value. | |
3006 | @item Is10 | |
3007 | Signed immediate 10-bit value. | |
3008 | @item Is11 | |
3009 | Signed immediate 11-bit value. | |
3010 | @item Is15 | |
3011 | Signed immediate 15-bit value. | |
3012 | @item Iu15 | |
3013 | Unsigned immediate 15-bit value. | |
3014 | @item Ic15 | |
3015 | A constant which is not in the range of imm15u but ok for bclr instruction. | |
3016 | @item Ie15 | |
3017 | A constant which is not in the range of imm15u but ok for bset instruction. | |
3018 | @item It15 | |
3019 | A constant which is not in the range of imm15u but ok for btgl instruction. | |
3020 | @item Ii15 | |
3021 | A constant whose compliment value is in the range of imm15u | |
3022 | and ok for bitci instruction. | |
3023 | @item Is16 | |
3024 | Signed immediate 16-bit value. | |
3025 | @item Is17 | |
3026 | Signed immediate 17-bit value. | |
3027 | @item Is19 | |
3028 | Signed immediate 19-bit value. | |
3029 | @item Is20 | |
3030 | Signed immediate 20-bit value. | |
3031 | @item Ihig | |
3032 | The immediate value that can be simply set high 20-bit. | |
3033 | @item Izeb | |
3034 | The immediate value 0xff. | |
3035 | @item Izeh | |
3036 | The immediate value 0xffff. | |
3037 | @item Ixls | |
3038 | The immediate value 0x01. | |
3039 | @item Ix11 | |
3040 | The immediate value 0x7ff. | |
3041 | @item Ibms | |
3042 | The immediate value with power of 2. | |
3043 | @item Ifex | |
3044 | The immediate value with power of 2 minus 1. | |
3045 | @item U33 | |
3046 | Memory constraint for 333 format. | |
3047 | @item U45 | |
3048 | Memory constraint for 45 format. | |
3049 | @item U37 | |
3050 | Memory constraint for 37 format. | |
3051 | @end table | |
3052 | ||
e430824f CLT |
3053 | @item Nios II family---@file{config/nios2/constraints.md} |
3054 | @table @code | |
3055 | ||
3056 | @item I | |
3057 | Integer that is valid as an immediate operand in an | |
3058 | instruction taking a signed 16-bit number. Range | |
3059 | @minus{}32768 to 32767. | |
3060 | ||
3061 | @item J | |
3062 | Integer that is valid as an immediate operand in an | |
3063 | instruction taking an unsigned 16-bit number. Range | |
3064 | 0 to 65535. | |
3065 | ||
3066 | @item K | |
3067 | Integer that is valid as an immediate operand in an | |
3068 | instruction taking only the upper 16-bits of a | |
3069 | 32-bit number. Range 32-bit numbers with the lower | |
3070 | 16-bits being 0. | |
3071 | ||
3072 | @item L | |
3073 | Integer that is valid as an immediate operand for a | |
3074 | shift instruction. Range 0 to 31. | |
3075 | ||
3076 | @item M | |
3077 | Integer that is valid as an immediate operand for | |
3078 | only the value 0. Can be used in conjunction with | |
3079 | the format modifier @code{z} to use @code{r0} | |
3080 | instead of @code{0} in the assembly output. | |
3081 | ||
3082 | @item N | |
3083 | Integer that is valid as an immediate operand for | |
3084 | a custom instruction opcode. Range 0 to 255. | |
3085 | ||
3bbbe009 SL |
3086 | @item P |
3087 | An immediate operand for R2 andchi/andci instructions. | |
3088 | ||
e430824f CLT |
3089 | @item S |
3090 | Matches immediates which are addresses in the small | |
3091 | data section and therefore can be added to @code{gp} | |
3092 | as a 16-bit immediate to re-create their 32-bit value. | |
3093 | ||
524d2e49 SL |
3094 | @item U |
3095 | Matches constants suitable as an operand for the rdprs and | |
3096 | cache instructions. | |
3097 | ||
3098 | @item v | |
3099 | A memory operand suitable for Nios II R2 load/store | |
3100 | exclusive instructions. | |
3101 | ||
42e6ab74 SL |
3102 | @item w |
3103 | A memory operand suitable for load/store IO and cache | |
3104 | instructions. | |
3105 | ||
e430824f CLT |
3106 | @ifset INTERNALS |
3107 | @item T | |
3108 | A @code{const} wrapped @code{UNSPEC} expression, | |
3109 | representing a supported PIC or TLS relocation. | |
3110 | @end ifset | |
3111 | ||
3112 | @end table | |
3113 | ||
3965b35f SH |
3114 | @item OpenRISC---@file{config/or1k/constraints.md} |
3115 | @table @code | |
3116 | @item I | |
3117 | Integer that is valid as an immediate operand in an | |
3118 | instruction taking a signed 16-bit number. Range | |
3119 | @minus{}32768 to 32767. | |
3120 | ||
3121 | @item K | |
3122 | Integer that is valid as an immediate operand in an | |
3123 | instruction taking an unsigned 16-bit number. Range | |
3124 | 0 to 65535. | |
3125 | ||
3126 | @item M | |
3127 | Signed 16-bit constant shifted left 16 bits. (Used with @code{l.movhi}) | |
3128 | ||
3129 | @item O | |
3130 | Zero | |
3131 | ||
3132 | @ifset INTERNALS | |
3133 | @item c | |
3134 | Register usable for sibcalls. | |
3135 | @end ifset | |
3136 | ||
3137 | @end table | |
3138 | ||
5e426dd4 PK |
3139 | @item PDP-11---@file{config/pdp11/constraints.md} |
3140 | @table @code | |
3141 | @item a | |
3142 | Floating point registers AC0 through AC3. These can be loaded from/to | |
3143 | memory with a single instruction. | |
3144 | ||
3145 | @item d | |
868e54d1 PK |
3146 | Odd numbered general registers (R1, R3, R5). These are used for |
3147 | 16-bit multiply operations. | |
5e426dd4 | 3148 | |
b4324a14 PK |
3149 | @item D |
3150 | A memory reference that is encoded within the opcode, but not | |
3151 | auto-increment or auto-decrement. | |
3152 | ||
5e426dd4 PK |
3153 | @item f |
3154 | Any of the floating point registers (AC0 through AC5). | |
3155 | ||
3156 | @item G | |
3157 | Floating point constant 0. | |
3158 | ||
b4324a14 PK |
3159 | @item h |
3160 | Floating point registers AC4 and AC5. These cannot be loaded from/to | |
3161 | memory with a single instruction. | |
3162 | ||
5e426dd4 PK |
3163 | @item I |
3164 | An integer constant that fits in 16 bits. | |
3165 | ||
b4fbcb1b SL |
3166 | @item J |
3167 | An integer constant whose low order 16 bits are zero. | |
3168 | ||
3169 | @item K | |
3170 | An integer constant that does not meet the constraints for codes | |
3171 | @samp{I} or @samp{J}. | |
3172 | ||
3173 | @item L | |
3174 | The integer constant 1. | |
3175 | ||
3176 | @item M | |
3177 | The integer constant @minus{}1. | |
3178 | ||
3179 | @item N | |
3180 | The integer constant 0. | |
3181 | ||
3182 | @item O | |
b4324a14 | 3183 | Integer constants 0 through 3; shifts by these |
b4fbcb1b SL |
3184 | amounts are handled as multiple single-bit shifts rather than a single |
3185 | variable-length shift. | |
3186 | ||
3187 | @item Q | |
3188 | A memory reference which requires an additional word (address or | |
3189 | offset) after the opcode. | |
3190 | ||
3191 | @item R | |
3192 | A memory reference that is encoded within the opcode. | |
3193 | ||
3194 | @end table | |
3195 | ||
3196 | @item PowerPC and IBM RS6000---@file{config/rs6000/constraints.md} | |
3197 | @table @code | |
e01975f9 SB |
3198 | @item r |
3199 | A general purpose register (GPR), @code{r0}@dots{}@code{r31}. | |
b4fbcb1b | 3200 | |
e01975f9 SB |
3201 | @item b |
3202 | A base register. Like @code{r}, but @code{r0} is not allowed, so | |
3203 | @code{r1}@dots{}@code{r31}. | |
b4fbcb1b SL |
3204 | |
3205 | @item f | |
e01975f9 SB |
3206 | A floating point register (FPR), @code{f0}@dots{}@code{f31}. |
3207 | ||
3208 | @item d | |
3209 | A floating point register. This is the same as @code{f} nowadays; | |
3210 | historically @code{f} was for single-precision and @code{d} was for | |
3211 | double-precision floating point. | |
b4fbcb1b SL |
3212 | |
3213 | @item v | |
e01975f9 | 3214 | An Altivec vector register (VR), @code{v0}@dots{}@code{v31}. |
b4fbcb1b SL |
3215 | |
3216 | @item wa | |
e01975f9 SB |
3217 | A VSX register (VSR), @code{vs0}@dots{}@code{vs63}. This is either an |
3218 | FPR (@code{vs0}@dots{}@code{vs31} are @code{f0}@dots{}@code{f31}) or a VR | |
3219 | (@code{vs32}@dots{}@code{vs63} are @code{v0}@dots{}@code{v31}). | |
b4fbcb1b | 3220 | |
e01975f9 SB |
3221 | When using @code{wa}, you should use the @code{%x} output modifier, so that |
3222 | the correct register number is printed. For example: | |
6a116f14 MM |
3223 | |
3224 | @smallexample | |
dc703d70 SL |
3225 | asm ("xvadddp %x0,%x1,%x2" |
3226 | : "=wa" (v1) | |
3227 | : "wa" (v2), "wa" (v3)); | |
6a116f14 MM |
3228 | @end smallexample |
3229 | ||
e01975f9 | 3230 | You should not use @code{%x} for @code{v} operands: |
dd551aa1 MM |
3231 | |
3232 | @smallexample | |
dc703d70 SL |
3233 | asm ("xsaddqp %0,%1,%2" |
3234 | : "=v" (v1) | |
3235 | : "v" (v2), "v" (v3)); | |
dd551aa1 MM |
3236 | @end smallexample |
3237 | ||
e01975f9 SB |
3238 | @ifset INTERNALS |
3239 | @item h | |
3240 | A special register (@code{vrsave}, @code{ctr}, or @code{lr}). | |
3241 | @end ifset | |
dd551aa1 | 3242 | |
e01975f9 SB |
3243 | @item c |
3244 | The count register, @code{ctr}. | |
dd551aa1 | 3245 | |
e01975f9 SB |
3246 | @item l |
3247 | The link register, @code{lr}. | |
3248 | ||
3249 | @item x | |
3250 | Condition register field 0, @code{cr0}. | |
3251 | ||
3252 | @item y | |
3253 | Any condition register field, @code{cr0}@dots{}@code{cr7}. | |
3254 | ||
3255 | @ifset INTERNALS | |
3256 | @item z | |
3257 | The carry bit, @code{XER[CA]}. | |
dd551aa1 | 3258 | |
dd551aa1 | 3259 | @item we |
e01975f9 SB |
3260 | Like @code{wa}, if @option{-mpower9-vector} and @option{-m64} are used; |
3261 | otherwise, @code{NO_REGS}. | |
dd551aa1 | 3262 | |
b4fbcb1b | 3263 | @item wn |
e01975f9 | 3264 | No register (@code{NO_REGS}). |
b4fbcb1b SL |
3265 | |
3266 | @item wr | |
e01975f9 | 3267 | Like @code{r}, if @option{-mpowerpc64} is used; otherwise, @code{NO_REGS}. |
b4fbcb1b | 3268 | |
b4fbcb1b | 3269 | @item wx |
e01975f9 | 3270 | Like @code{d}, if @option{-mpowerpc-gfxopt} is used; otherwise, @code{NO_REGS}. |
b4fbcb1b | 3271 | |
99211352 | 3272 | @item wA |
e01975f9 | 3273 | Like @code{b}, if @option{-mpowerpc64} is used; otherwise, @code{NO_REGS}. |
99211352 | 3274 | |
1a3c3ee9 | 3275 | @item wB |
e01975f9 | 3276 | Signed 5-bit constant integer that can be loaded into an Altivec register. |
1a3c3ee9 | 3277 | |
b4fbcb1b SL |
3278 | @item wD |
3279 | Int constant that is the element number of the 64-bit scalar in a vector. | |
3280 | ||
50c78b9a MM |
3281 | @item wE |
3282 | Vector constant that can be loaded with the XXSPLTIB instruction. | |
3283 | ||
dd551aa1 | 3284 | @item wF |
e01975f9 | 3285 | Memory operand suitable for power8 GPR load fusion. |
dd551aa1 MM |
3286 | |
3287 | @item wL | |
e01975f9 | 3288 | Int constant that is the element number mfvsrld accesses in a vector. |
dd551aa1 | 3289 | |
50c78b9a MM |
3290 | @item wM |
3291 | Match vector constant with all 1's if the XXLORC instruction is available. | |
3292 | ||
3fd2b007 | 3293 | @item wO |
e01975f9 | 3294 | Memory operand suitable for the ISA 3.0 vector d-form instructions. |
3fd2b007 | 3295 | |
b4fbcb1b | 3296 | @item wQ |
e01975f9 | 3297 | Memory operand suitable for the load/store quad instructions. |
b4fbcb1b | 3298 | |
50c78b9a MM |
3299 | @item wS |
3300 | Vector constant that can be loaded with XXSPLTIB & sign extension. | |
3301 | ||
e01975f9 SB |
3302 | @item wY |
3303 | A memory operand for a DS-form instruction. | |
b4fbcb1b | 3304 | |
e01975f9 SB |
3305 | @item wZ |
3306 | An indexed or indirect memory operand, ignoring the bottom 4 bits. | |
3307 | @end ifset | |
b4fbcb1b SL |
3308 | |
3309 | @item I | |
e01975f9 | 3310 | A signed 16-bit constant. |
b4fbcb1b SL |
3311 | |
3312 | @item J | |
e01975f9 SB |
3313 | An unsigned 16-bit constant shifted left 16 bits (use @code{L} instead |
3314 | for @code{SImode} constants). | |
b4fbcb1b SL |
3315 | |
3316 | @item K | |
e01975f9 | 3317 | An unsigned 16-bit constant. |
b4fbcb1b SL |
3318 | |
3319 | @item L | |
e01975f9 | 3320 | A signed 16-bit constant shifted left 16 bits. |
b4fbcb1b | 3321 | |
e01975f9 | 3322 | @ifset INTERNALS |
b4fbcb1b | 3323 | @item M |
e01975f9 | 3324 | An integer constant greater than 31. |
b4fbcb1b SL |
3325 | |
3326 | @item N | |
e01975f9 | 3327 | An exact power of 2. |
b4fbcb1b SL |
3328 | |
3329 | @item O | |
e01975f9 | 3330 | The integer constant zero. |
b4fbcb1b SL |
3331 | |
3332 | @item P | |
e01975f9 SB |
3333 | A constant whose negation is a signed 16-bit constant. |
3334 | @end ifset | |
b4fbcb1b | 3335 | |
ed383d79 | 3336 | @item eI |
e01975f9 | 3337 | A signed 34-bit integer constant if prefixed instructions are supported. |
ed383d79 | 3338 | |
d730aa8a MM |
3339 | @item eP |
3340 | A scalar floating point constant or a vector constant that can be | |
3341 | loaded to a VSX register with one prefixed instruction. | |
3342 | ||
8ccd8b12 MM |
3343 | @item eQ |
3344 | An IEEE 128-bit constant that can be loaded into a VSX register with | |
3345 | the @code{lxvkq} instruction. | |
3346 | ||
e01975f9 | 3347 | @ifset INTERNALS |
b4fbcb1b | 3348 | @item G |
e01975f9 SB |
3349 | A floating point constant that can be loaded into a register with one |
3350 | instruction per word. | |
b4fbcb1b SL |
3351 | |
3352 | @item H | |
e01975f9 SB |
3353 | A floating point constant that can be loaded into a register using |
3354 | three instructions. | |
3355 | @end ifset | |
b4fbcb1b SL |
3356 | |
3357 | @item m | |
e01975f9 | 3358 | A memory operand. |
b4fbcb1b | 3359 | Normally, @code{m} does not allow addresses that update the base register. |
e01975f9 | 3360 | If the @code{<} or @code{>} constraint is also used, they are allowed and |
b4fbcb1b | 3361 | therefore on PowerPC targets in that case it is only safe |
e01975f9 | 3362 | to use @code{m<>} in an @code{asm} statement if that @code{asm} statement |
b4fbcb1b | 3363 | accesses the operand exactly once. The @code{asm} statement must also |
e01975f9 | 3364 | use @code{%U@var{<opno>}} as a placeholder for the ``update'' flag in the |
b4fbcb1b SL |
3365 | corresponding load or store instruction. For example: |
3366 | ||
3367 | @smallexample | |
3368 | asm ("st%U0 %1,%0" : "=m<>" (mem) : "r" (val)); | |
3369 | @end smallexample | |
3370 | ||
3371 | is correct but: | |
3372 | ||
3373 | @smallexample | |
3374 | asm ("st %1,%0" : "=m<>" (mem) : "r" (val)); | |
3375 | @end smallexample | |
3376 | ||
3377 | is not. | |
3378 | ||
e01975f9 | 3379 | @ifset INTERNALS |
b4fbcb1b SL |
3380 | @item es |
3381 | A ``stable'' memory operand; that is, one which does not include any | |
3382 | automodification of the base register. This used to be useful when | |
e01975f9 SB |
3383 | @code{m} allowed automodification of the base register, but as those |
3384 | are now only allowed when @code{<} or @code{>} is used, @code{es} is | |
3385 | basically the same as @code{m} without @code{<} and @code{>}. | |
3386 | @end ifset | |
b4fbcb1b SL |
3387 | |
3388 | @item Q | |
e5d3611e | 3389 | A memory operand addressed by just a base register. |
b4fbcb1b | 3390 | |
e01975f9 SB |
3391 | @ifset INTERNALS |
3392 | @item Y | |
3393 | A memory operand for a DQ-form instruction. | |
3394 | @end ifset | |
3395 | ||
b4fbcb1b | 3396 | @item Z |
e01975f9 | 3397 | A memory operand accessed with indexed or indirect addressing. |
b4fbcb1b | 3398 | |
e01975f9 | 3399 | @ifset INTERNALS |
b4fbcb1b | 3400 | @item R |
e01975f9 SB |
3401 | An AIX TOC entry. |
3402 | @end ifset | |
5e426dd4 | 3403 | |
b4fbcb1b | 3404 | @item a |
e01975f9 | 3405 | An indexed or indirect address. |
5e426dd4 | 3406 | |
e01975f9 | 3407 | @ifset INTERNALS |
b4fbcb1b | 3408 | @item U |
e01975f9 | 3409 | A V.4 small data reference. |
5e426dd4 | 3410 | |
b4fbcb1b | 3411 | @item W |
e01975f9 | 3412 | A vector constant that does not require memory. |
5e426dd4 | 3413 | |
b4fbcb1b | 3414 | @item j |
e01975f9 SB |
3415 | The zero vector constant. |
3416 | @end ifset | |
5e426dd4 PK |
3417 | |
3418 | @end table | |
3419 | ||
8d2af3a2 DD |
3420 | @item PRU---@file{config/pru/constraints.md} |
3421 | @table @code | |
3422 | @item I | |
3423 | An unsigned 8-bit integer constant. | |
3424 | ||
3425 | @item J | |
3426 | An unsigned 16-bit integer constant. | |
3427 | ||
3428 | @item L | |
3429 | An unsigned 5-bit integer constant (for shift counts). | |
3430 | ||
3431 | @item T | |
3432 | A text segment (program memory) constant label. | |
3433 | ||
3434 | @item Z | |
3435 | Integer constant zero. | |
3436 | ||
3437 | @end table | |
3438 | ||
85b8555e DD |
3439 | @item RL78---@file{config/rl78/constraints.md} |
3440 | @table @code | |
3441 | ||
3442 | @item Int3 | |
3443 | An integer constant in the range 1 @dots{} 7. | |
3444 | @item Int8 | |
3445 | An integer constant in the range 0 @dots{} 255. | |
3446 | @item J | |
3447 | An integer constant in the range @minus{}255 @dots{} 0 | |
3448 | @item K | |
3449 | The integer constant 1. | |
3450 | @item L | |
3451 | The integer constant -1. | |
3452 | @item M | |
3453 | The integer constant 0. | |
3454 | @item N | |
3455 | The integer constant 2. | |
3456 | @item O | |
3457 | The integer constant -2. | |
3458 | @item P | |
3459 | An integer constant in the range 1 @dots{} 15. | |
3460 | @item Qbi | |
3461 | The built-in compare types--eq, ne, gtu, ltu, geu, and leu. | |
3462 | @item Qsc | |
3463 | The synthetic compare types--gt, lt, ge, and le. | |
3464 | @item Wab | |
3465 | A memory reference with an absolute address. | |
3466 | @item Wbc | |
3467 | A memory reference using @code{BC} as a base register, with an optional offset. | |
3468 | @item Wca | |
3469 | A memory reference using @code{AX}, @code{BC}, @code{DE}, or @code{HL} for the address, for calls. | |
3470 | @item Wcv | |
3471 | A memory reference using any 16-bit register pair for the address, for calls. | |
3472 | @item Wd2 | |
3473 | A memory reference using @code{DE} as a base register, with an optional offset. | |
3474 | @item Wde | |
3475 | A memory reference using @code{DE} as a base register, without any offset. | |
3476 | @item Wfr | |
3477 | Any memory reference to an address in the far address space. | |
3478 | @item Wh1 | |
3479 | A memory reference using @code{HL} as a base register, with an optional one-byte offset. | |
3480 | @item Whb | |
3481 | A memory reference using @code{HL} as a base register, with @code{B} or @code{C} as the index register. | |
3482 | @item Whl | |
3483 | A memory reference using @code{HL} as a base register, without any offset. | |
3484 | @item Ws1 | |
3485 | A memory reference using @code{SP} as a base register, with an optional one-byte offset. | |
3486 | @item Y | |
3487 | Any memory reference to an address in the near address space. | |
3488 | @item A | |
3489 | The @code{AX} register. | |
3490 | @item B | |
3491 | The @code{BC} register. | |
3492 | @item D | |
3493 | The @code{DE} register. | |
3494 | @item R | |
3495 | @code{A} through @code{L} registers. | |
3496 | @item S | |
3497 | The @code{SP} register. | |
3498 | @item T | |
3499 | The @code{HL} register. | |
3500 | @item Z08W | |
3501 | The 16-bit @code{R8} register. | |
3502 | @item Z10W | |
3503 | The 16-bit @code{R10} register. | |
3504 | @item Zint | |
3505 | The registers reserved for interrupts (@code{R24} to @code{R31}). | |
3506 | @item a | |
3507 | The @code{A} register. | |
3508 | @item b | |
3509 | The @code{B} register. | |
3510 | @item c | |
3511 | The @code{C} register. | |
3512 | @item d | |
3513 | The @code{D} register. | |
3514 | @item e | |
3515 | The @code{E} register. | |
3516 | @item h | |
3517 | The @code{H} register. | |
3518 | @item l | |
3519 | The @code{L} register. | |
3520 | @item v | |
3521 | The virtual registers. | |
3522 | @item w | |
3523 | The @code{PSW} register. | |
3524 | @item x | |
3525 | The @code{X} register. | |
3526 | ||
3527 | @end table | |
09cae750 PD |
3528 | |
3529 | @item RISC-V---@file{config/riscv/constraints.md} | |
3530 | @table @code | |
3531 | ||
3532 | @item f | |
a0ab54de | 3533 | A floating-point register (if available). |
09cae750 PD |
3534 | |
3535 | @item I | |
3536 | An I-type 12-bit signed immediate. | |
3537 | ||
3538 | @item J | |
3539 | Integer zero. | |
3540 | ||
3541 | @item K | |
3542 | A 5-bit unsigned immediate for CSR access instructions. | |
3543 | ||
3544 | @item A | |
3545 | An address that is held in a general-purpose register. | |
3546 | ||
18a463bb KC |
3547 | @item S |
3548 | A constraint that matches an absolute symbolic address. | |
3549 | ||
09cae750 | 3550 | @end table |
85b8555e | 3551 | |
65a324b4 NC |
3552 | @item RX---@file{config/rx/constraints.md} |
3553 | @table @code | |
3554 | @item Q | |
3555 | An address which does not involve register indirect addressing or | |
3556 | pre/post increment/decrement addressing. | |
3557 | ||
3558 | @item Symbol | |
3559 | A symbol reference. | |
3560 | ||
3561 | @item Int08 | |
3562 | A constant in the range @minus{}256 to 255, inclusive. | |
3563 | ||
3564 | @item Sint08 | |
3565 | A constant in the range @minus{}128 to 127, inclusive. | |
3566 | ||
3567 | @item Sint16 | |
3568 | A constant in the range @minus{}32768 to 32767, inclusive. | |
3569 | ||
3570 | @item Sint24 | |
3571 | A constant in the range @minus{}8388608 to 8388607, inclusive. | |
3572 | ||
3573 | @item Uint04 | |
3574 | A constant in the range 0 to 15, inclusive. | |
3575 | ||
3576 | @end table | |
3577 | ||
b4fbcb1b SL |
3578 | @item S/390 and zSeries---@file{config/s390/s390.h} |
3579 | @table @code | |
3580 | @item a | |
3581 | Address register (general purpose register except r0) | |
3582 | ||
3583 | @item c | |
3584 | Condition code register | |
3585 | ||
3586 | @item d | |
3587 | Data register (arbitrary general purpose register) | |
3588 | ||
3589 | @item f | |
3590 | Floating-point register | |
3591 | ||
3592 | @item I | |
3593 | Unsigned 8-bit constant (0--255) | |
3594 | ||
3595 | @item J | |
3596 | Unsigned 12-bit constant (0--4095) | |
3597 | ||
3598 | @item K | |
3599 | Signed 16-bit constant (@minus{}32768--32767) | |
3600 | ||
3601 | @item L | |
3602 | Value appropriate as displacement. | |
3603 | @table @code | |
3604 | @item (0..4095) | |
3605 | for short displacement | |
3606 | @item (@minus{}524288..524287) | |
3607 | for long displacement | |
3608 | @end table | |
3609 | ||
3610 | @item M | |
3611 | Constant integer with a value of 0x7fffffff. | |
3612 | ||
3613 | @item N | |
3614 | Multiple letter constraint followed by 4 parameter letters. | |
3615 | @table @code | |
3616 | @item 0..9: | |
3617 | number of the part counting from most to least significant | |
3618 | @item H,Q: | |
3619 | mode of the part | |
3620 | @item D,S,H: | |
3621 | mode of the containing operand | |
3622 | @item 0,F: | |
3623 | value of the other parts (F---all bits set) | |
3624 | @end table | |
3625 | The constraint matches if the specified part of a constant | |
3626 | has a value different from its other parts. | |
3627 | ||
3628 | @item Q | |
3629 | Memory reference without index register and with short displacement. | |
3630 | ||
3631 | @item R | |
3632 | Memory reference with index register and short displacement. | |
3633 | ||
3634 | @item S | |
3635 | Memory reference without index register but with long displacement. | |
3636 | ||
3637 | @item T | |
3638 | Memory reference with index register and long displacement. | |
3639 | ||
3640 | @item U | |
3641 | Pointer with short displacement. | |
3642 | ||
3643 | @item W | |
3644 | Pointer with long displacement. | |
3645 | ||
3646 | @item Y | |
3647 | Shift count operand. | |
3648 | ||
3649 | @end table | |
3650 | ||
03dda8e3 | 3651 | @need 1000 |
74fe790b | 3652 | @item SPARC---@file{config/sparc/sparc.h} |
03dda8e3 RK |
3653 | @table @code |
3654 | @item f | |
53e5f173 EB |
3655 | Floating-point register on the SPARC-V8 architecture and |
3656 | lower floating-point register on the SPARC-V9 architecture. | |
03dda8e3 RK |
3657 | |
3658 | @item e | |
8a36672b | 3659 | Floating-point register. It is equivalent to @samp{f} on the |
53e5f173 EB |
3660 | SPARC-V8 architecture and contains both lower and upper |
3661 | floating-point registers on the SPARC-V9 architecture. | |
03dda8e3 | 3662 | |
8a69f99f EB |
3663 | @item c |
3664 | Floating-point condition code register. | |
3665 | ||
3666 | @item d | |
8a36672b | 3667 | Lower floating-point register. It is only valid on the SPARC-V9 |
53e5f173 | 3668 | architecture when the Visual Instruction Set is available. |
8a69f99f EB |
3669 | |
3670 | @item b | |
8a36672b | 3671 | Floating-point register. It is only valid on the SPARC-V9 architecture |
53e5f173 | 3672 | when the Visual Instruction Set is available. |
8a69f99f EB |
3673 | |
3674 | @item h | |
3675 | 64-bit global or out register for the SPARC-V8+ architecture. | |
3676 | ||
923f9ded DM |
3677 | @item C |
3678 | The constant all-ones, for floating-point. | |
3679 | ||
8b98b5fd DM |
3680 | @item A |
3681 | Signed 5-bit constant | |
3682 | ||
66e62b49 KH |
3683 | @item D |
3684 | A vector constant | |
3685 | ||
03dda8e3 | 3686 | @item I |
1e5f973d | 3687 | Signed 13-bit constant |
03dda8e3 RK |
3688 | |
3689 | @item J | |
3690 | Zero | |
3691 | ||
3692 | @item K | |
1e5f973d | 3693 | 32-bit constant with the low 12 bits clear (a constant that can be |
03dda8e3 RK |
3694 | loaded with the @code{sethi} instruction) |
3695 | ||
7d6040e8 | 3696 | @item L |
923f9ded DM |
3697 | A constant in the range supported by @code{movcc} instructions (11-bit |
3698 | signed immediate) | |
7d6040e8 AO |
3699 | |
3700 | @item M | |
923f9ded DM |
3701 | A constant in the range supported by @code{movrcc} instructions (10-bit |
3702 | signed immediate) | |
7d6040e8 AO |
3703 | |
3704 | @item N | |
3705 | Same as @samp{K}, except that it verifies that bits that are not in the | |
57694e40 | 3706 | lower 32-bit range are all zero. Must be used instead of @samp{K} for |
7d6040e8 AO |
3707 | modes wider than @code{SImode} |
3708 | ||
ef0139b1 EB |
3709 | @item O |
3710 | The constant 4096 | |
3711 | ||
03dda8e3 RK |
3712 | @item G |
3713 | Floating-point zero | |
3714 | ||
3715 | @item H | |
1e5f973d | 3716 | Signed 13-bit constant, sign-extended to 32 or 64 bits |
03dda8e3 | 3717 | |
923f9ded DM |
3718 | @item P |
3719 | The constant -1 | |
3720 | ||
03dda8e3 | 3721 | @item Q |
62190128 DM |
3722 | Floating-point constant whose integral representation can |
3723 | be moved into an integer register using a single sethi | |
3724 | instruction | |
3725 | ||
3726 | @item R | |
3727 | Floating-point constant whose integral representation can | |
3728 | be moved into an integer register using a single mov | |
3729 | instruction | |
03dda8e3 RK |
3730 | |
3731 | @item S | |
62190128 DM |
3732 | Floating-point constant whose integral representation can |
3733 | be moved into an integer register using a high/lo_sum | |
3734 | instruction sequence | |
03dda8e3 RK |
3735 | |
3736 | @item T | |
3737 | Memory address aligned to an 8-byte boundary | |
3738 | ||
aaa050aa DM |
3739 | @item U |
3740 | Even register | |
3741 | ||
7a31a340 | 3742 | @item W |
c75d6010 JM |
3743 | Memory address for @samp{e} constraint registers |
3744 | ||
923f9ded DM |
3745 | @item w |
3746 | Memory address with only a base register | |
3747 | ||
c75d6010 JM |
3748 | @item Y |
3749 | Vector zero | |
7a31a340 | 3750 | |
6ca30df6 MH |
3751 | @end table |
3752 | ||
bcead286 BS |
3753 | @item TI C6X family---@file{config/c6x/constraints.md} |
3754 | @table @code | |
3755 | @item a | |
3756 | Register file A (A0--A31). | |
3757 | ||
3758 | @item b | |
3759 | Register file B (B0--B31). | |
3760 | ||
3761 | @item A | |
3762 | Predicate registers in register file A (A0--A2 on C64X and | |
3763 | higher, A1 and A2 otherwise). | |
3764 | ||
3765 | @item B | |
3766 | Predicate registers in register file B (B0--B2). | |
3767 | ||
3768 | @item C | |
3769 | A call-used register in register file B (B0--B9, B16--B31). | |
3770 | ||
3771 | @item Da | |
3772 | Register file A, excluding predicate registers (A3--A31, | |
3773 | plus A0 if not C64X or higher). | |
3774 | ||
3775 | @item Db | |
3776 | Register file B, excluding predicate registers (B3--B31). | |
3777 | ||
3778 | @item Iu4 | |
3779 | Integer constant in the range 0 @dots{} 15. | |
3780 | ||
3781 | @item Iu5 | |
3782 | Integer constant in the range 0 @dots{} 31. | |
3783 | ||
3784 | @item In5 | |
3785 | Integer constant in the range @minus{}31 @dots{} 0. | |
3786 | ||
3787 | @item Is5 | |
3788 | Integer constant in the range @minus{}16 @dots{} 15. | |
3789 | ||
3790 | @item I5x | |
3791 | Integer constant that can be the operand of an ADDA or a SUBA insn. | |
3792 | ||
3793 | @item IuB | |
3794 | Integer constant in the range 0 @dots{} 65535. | |
3795 | ||
3796 | @item IsB | |
3797 | Integer constant in the range @minus{}32768 @dots{} 32767. | |
3798 | ||
3799 | @item IsC | |
3800 | Integer constant in the range @math{-2^{20}} @dots{} @math{2^{20} - 1}. | |
3801 | ||
3802 | @item Jc | |
3803 | Integer constant that is a valid mask for the clr instruction. | |
3804 | ||
3805 | @item Js | |
3806 | Integer constant that is a valid mask for the set instruction. | |
3807 | ||
3808 | @item Q | |
3809 | Memory location with A base register. | |
3810 | ||
3811 | @item R | |
3812 | Memory location with B base register. | |
3813 | ||
3814 | @ifset INTERNALS | |
3815 | @item S0 | |
3816 | On C64x+ targets, a GP-relative small data reference. | |
3817 | ||
3818 | @item S1 | |
3819 | Any kind of @code{SYMBOL_REF}, for use in a call address. | |
3820 | ||
3821 | @item Si | |
3822 | Any kind of immediate operand, unless it matches the S0 constraint. | |
3823 | ||
3824 | @item T | |
3825 | Memory location with B base register, but not using a long offset. | |
3826 | ||
3827 | @item W | |
fd250f0d | 3828 | A memory operand with an address that cannot be used in an unaligned access. |
bcead286 BS |
3829 | |
3830 | @end ifset | |
3831 | @item Z | |
3832 | Register B14 (aka DP). | |
3833 | ||
3834 | @end table | |
3835 | ||
dd552284 WL |
3836 | @item TILE-Gx---@file{config/tilegx/constraints.md} |
3837 | @table @code | |
3838 | @item R00 | |
3839 | @itemx R01 | |
3840 | @itemx R02 | |
3841 | @itemx R03 | |
3842 | @itemx R04 | |
3843 | @itemx R05 | |
3844 | @itemx R06 | |
3845 | @itemx R07 | |
3846 | @itemx R08 | |
3847 | @itemx R09 | |
655c5444 | 3848 | @itemx R10 |
dd552284 WL |
3849 | Each of these represents a register constraint for an individual |
3850 | register, from r0 to r10. | |
3851 | ||
3852 | @item I | |
3853 | Signed 8-bit integer constant. | |
3854 | ||
3855 | @item J | |
3856 | Signed 16-bit integer constant. | |
3857 | ||
3858 | @item K | |
3859 | Unsigned 16-bit integer constant. | |
3860 | ||
3861 | @item L | |
3862 | Integer constant that fits in one signed byte when incremented by one | |
3863 | (@minus{}129 @dots{} 126). | |
3864 | ||
3865 | @item m | |
3866 | Memory operand. If used together with @samp{<} or @samp{>}, the | |
3867 | operand can have postincrement which requires printing with @samp{%In} | |
3868 | and @samp{%in} on TILE-Gx. For example: | |
3869 | ||
3870 | @smallexample | |
3871 | asm ("st_add %I0,%1,%i0" : "=m<>" (*mem) : "r" (val)); | |
3872 | @end smallexample | |
3873 | ||
3874 | @item M | |
3875 | A bit mask suitable for the BFINS instruction. | |
3876 | ||
3877 | @item N | |
3878 | Integer constant that is a byte tiled out eight times. | |
3879 | ||
3880 | @item O | |
3881 | The integer zero constant. | |
3882 | ||
3883 | @item P | |
3884 | Integer constant that is a sign-extended byte tiled out as four shorts. | |
3885 | ||
3886 | @item Q | |
3887 | Integer constant that fits in one signed byte when incremented | |
3888 | (@minus{}129 @dots{} 126), but excluding -1. | |
3889 | ||
3890 | @item S | |
3891 | Integer constant that has all 1 bits consecutive and starting at bit 0. | |
3892 | ||
3893 | @item T | |
3894 | A 16-bit fragment of a got, tls, or pc-relative reference. | |
3895 | ||
3896 | @item U | |
3897 | Memory operand except postincrement. This is roughly the same as | |
3898 | @samp{m} when not used together with @samp{<} or @samp{>}. | |
3899 | ||
3900 | @item W | |
3901 | An 8-element vector constant with identical elements. | |
3902 | ||
3903 | @item Y | |
3904 | A 4-element vector constant with identical elements. | |
3905 | ||
3906 | @item Z0 | |
3907 | The integer constant 0xffffffff. | |
3908 | ||
3909 | @item Z1 | |
3910 | The integer constant 0xffffffff00000000. | |
3911 | ||
3912 | @end table | |
3913 | ||
3914 | @item TILEPro---@file{config/tilepro/constraints.md} | |
3915 | @table @code | |
3916 | @item R00 | |
3917 | @itemx R01 | |
3918 | @itemx R02 | |
3919 | @itemx R03 | |
3920 | @itemx R04 | |
3921 | @itemx R05 | |
3922 | @itemx R06 | |
3923 | @itemx R07 | |
3924 | @itemx R08 | |
3925 | @itemx R09 | |
655c5444 | 3926 | @itemx R10 |
dd552284 WL |
3927 | Each of these represents a register constraint for an individual |
3928 | register, from r0 to r10. | |
3929 | ||
3930 | @item I | |
3931 | Signed 8-bit integer constant. | |
3932 | ||
3933 | @item J | |
3934 | Signed 16-bit integer constant. | |
3935 | ||
3936 | @item K | |
3937 | Nonzero integer constant with low 16 bits zero. | |
3938 | ||
3939 | @item L | |
3940 | Integer constant that fits in one signed byte when incremented by one | |
3941 | (@minus{}129 @dots{} 126). | |
3942 | ||
3943 | @item m | |
3944 | Memory operand. If used together with @samp{<} or @samp{>}, the | |
3945 | operand can have postincrement which requires printing with @samp{%In} | |
3946 | and @samp{%in} on TILEPro. For example: | |
3947 | ||
3948 | @smallexample | |
3949 | asm ("swadd %I0,%1,%i0" : "=m<>" (mem) : "r" (val)); | |
3950 | @end smallexample | |
3951 | ||
3952 | @item M | |
3953 | A bit mask suitable for the MM instruction. | |
3954 | ||
3955 | @item N | |
3956 | Integer constant that is a byte tiled out four times. | |
3957 | ||
3958 | @item O | |
3959 | The integer zero constant. | |
3960 | ||
3961 | @item P | |
3962 | Integer constant that is a sign-extended byte tiled out as two shorts. | |
3963 | ||
3964 | @item Q | |
3965 | Integer constant that fits in one signed byte when incremented | |
3966 | (@minus{}129 @dots{} 126), but excluding -1. | |
3967 | ||
3968 | @item T | |
3969 | A symbolic operand, or a 16-bit fragment of a got, tls, or pc-relative | |
3970 | reference. | |
3971 | ||
3972 | @item U | |
3973 | Memory operand except postincrement. This is roughly the same as | |
3974 | @samp{m} when not used together with @samp{<} or @samp{>}. | |
3975 | ||
3976 | @item W | |
3977 | A 4-element vector constant with identical elements. | |
3978 | ||
3979 | @item Y | |
3980 | A 2-element vector constant with identical elements. | |
3981 | ||
3982 | @end table | |
3983 | ||
0969ec7d EB |
3984 | @item Visium---@file{config/visium/constraints.md} |
3985 | @table @code | |
3986 | @item b | |
3987 | EAM register @code{mdb} | |
3988 | ||
3989 | @item c | |
3990 | EAM register @code{mdc} | |
3991 | ||
3992 | @item f | |
3993 | Floating point register | |
3994 | ||
3995 | @ifset INTERNALS | |
3996 | @item k | |
3997 | Register for sibcall optimization | |
3998 | @end ifset | |
3999 | ||
4000 | @item l | |
4001 | General register, but not @code{r29}, @code{r30} and @code{r31} | |
4002 | ||
4003 | @item t | |
4004 | Register @code{r1} | |
4005 | ||
4006 | @item u | |
4007 | Register @code{r2} | |
4008 | ||
4009 | @item v | |
4010 | Register @code{r3} | |
4011 | ||
4012 | @item G | |
4013 | Floating-point constant 0.0 | |
4014 | ||
4015 | @item J | |
4016 | Integer constant in the range 0 .. 65535 (16-bit immediate) | |
4017 | ||
4018 | @item K | |
4019 | Integer constant in the range 1 .. 31 (5-bit immediate) | |
4020 | ||
4021 | @item L | |
4022 | Integer constant in the range @minus{}65535 .. @minus{}1 (16-bit negative immediate) | |
4023 | ||
4024 | @item M | |
4025 | Integer constant @minus{}1 | |
4026 | ||
4027 | @item O | |
4028 | Integer constant 0 | |
4029 | ||
4030 | @item P | |
4031 | Integer constant 32 | |
4032 | @end table | |
4033 | ||
b4fbcb1b SL |
4034 | @item x86 family---@file{config/i386/constraints.md} |
4035 | @table @code | |
4036 | @item R | |
4037 | Legacy register---the eight integer registers available on all | |
4038 | i386 processors (@code{a}, @code{b}, @code{c}, @code{d}, | |
4039 | @code{si}, @code{di}, @code{bp}, @code{sp}). | |
4040 | ||
4041 | @item q | |
4042 | Any register accessible as @code{@var{r}l}. In 32-bit mode, @code{a}, | |
4043 | @code{b}, @code{c}, and @code{d}; in 64-bit mode, any integer register. | |
4044 | ||
4045 | @item Q | |
4046 | Any register accessible as @code{@var{r}h}: @code{a}, @code{b}, | |
4047 | @code{c}, and @code{d}. | |
4048 | ||
4049 | @ifset INTERNALS | |
4050 | @item l | |
4051 | Any register that can be used as the index in a base+index memory | |
4052 | access: that is, any general register except the stack pointer. | |
4053 | @end ifset | |
4054 | ||
4055 | @item a | |
4056 | The @code{a} register. | |
4057 | ||
4058 | @item b | |
4059 | The @code{b} register. | |
4060 | ||
4061 | @item c | |
4062 | The @code{c} register. | |
4063 | ||
4064 | @item d | |
4065 | The @code{d} register. | |
4066 | ||
4067 | @item S | |
4068 | The @code{si} register. | |
4069 | ||
4070 | @item D | |
4071 | The @code{di} register. | |
4072 | ||
4073 | @item A | |
4074 | The @code{a} and @code{d} registers. This class is used for instructions | |
4075 | that return double word results in the @code{ax:dx} register pair. Single | |
4076 | word values will be allocated either in @code{ax} or @code{dx}. | |
4077 | For example on i386 the following implements @code{rdtsc}: | |
4078 | ||
4079 | @smallexample | |
4080 | unsigned long long rdtsc (void) | |
4081 | @{ | |
4082 | unsigned long long tick; | |
4083 | __asm__ __volatile__("rdtsc":"=A"(tick)); | |
4084 | return tick; | |
4085 | @} | |
4086 | @end smallexample | |
4087 | ||
4088 | This is not correct on x86-64 as it would allocate tick in either @code{ax} | |
4089 | or @code{dx}. You have to use the following variant instead: | |
4090 | ||
4091 | @smallexample | |
4092 | unsigned long long rdtsc (void) | |
4093 | @{ | |
4094 | unsigned int tickl, tickh; | |
4095 | __asm__ __volatile__("rdtsc":"=a"(tickl),"=d"(tickh)); | |
4096 | return ((unsigned long long)tickh << 32)|tickl; | |
4097 | @} | |
4098 | @end smallexample | |
4099 | ||
de3fb1a6 SP |
4100 | @item U |
4101 | The call-clobbered integer registers. | |
b4fbcb1b SL |
4102 | |
4103 | @item f | |
4104 | Any 80387 floating-point (stack) register. | |
4105 | ||
4106 | @item t | |
4107 | Top of 80387 floating-point stack (@code{%st(0)}). | |
4108 | ||
4109 | @item u | |
4110 | Second from top of 80387 floating-point stack (@code{%st(1)}). | |
4111 | ||
de3fb1a6 SP |
4112 | @ifset INTERNALS |
4113 | @item Yk | |
630ba2fd | 4114 | Any mask register that can be used as a predicate, i.e.@: @code{k1-k7}. |
de3fb1a6 SP |
4115 | |
4116 | @item k | |
4117 | Any mask register. | |
4118 | @end ifset | |
4119 | ||
b4fbcb1b SL |
4120 | @item y |
4121 | Any MMX register. | |
4122 | ||
4123 | @item x | |
4124 | Any SSE register. | |
4125 | ||
de3fb1a6 SP |
4126 | @item v |
4127 | Any EVEX encodable SSE register (@code{%xmm0-%xmm31}). | |
4128 | ||
4129 | @ifset INTERNALS | |
4130 | @item w | |
4131 | Any bound register. | |
4132 | @end ifset | |
4133 | ||
b4fbcb1b SL |
4134 | @item Yz |
4135 | First SSE register (@code{%xmm0}). | |
4136 | ||
4137 | @ifset INTERNALS | |
b4fbcb1b SL |
4138 | @item Yi |
4139 | Any SSE register, when SSE2 and inter-unit moves are enabled. | |
4140 | ||
de3fb1a6 SP |
4141 | @item Yj |
4142 | Any SSE register, when SSE2 and inter-unit moves from vector registers are enabled. | |
4143 | ||
b4fbcb1b SL |
4144 | @item Ym |
4145 | Any MMX register, when inter-unit moves are enabled. | |
de3fb1a6 SP |
4146 | |
4147 | @item Yn | |
4148 | Any MMX register, when inter-unit moves from vector registers are enabled. | |
4149 | ||
4150 | @item Yp | |
4151 | Any integer register when @code{TARGET_PARTIAL_REG_STALL} is disabled. | |
4152 | ||
4153 | @item Ya | |
4154 | Any integer register when zero extensions with @code{AND} are disabled. | |
4155 | ||
4156 | @item Yb | |
4157 | Any register that can be used as the GOT base when calling@* | |
4158 | @code{___tls_get_addr}: that is, any general register except @code{a} | |
4159 | and @code{sp} registers, for @option{-fno-plt} if linker supports it. | |
4160 | Otherwise, @code{b} register. | |
4161 | ||
4162 | @item Yf | |
4163 | Any x87 register when 80387 floating-point arithmetic is enabled. | |
4164 | ||
4165 | @item Yr | |
4166 | Lower SSE register when avoiding REX prefix and all SSE registers otherwise. | |
4167 | ||
4168 | @item Yv | |
4169 | For AVX512VL, any EVEX-encodable SSE register (@code{%xmm0-%xmm31}), | |
4170 | otherwise any SSE register. | |
4171 | ||
4172 | @item Yh | |
4173 | Any EVEX-encodable SSE register, that has number factor of four. | |
4174 | ||
4175 | @item Bf | |
4176 | Flags register operand. | |
4177 | ||
4178 | @item Bg | |
4179 | GOT memory operand. | |
4180 | ||
4181 | @item Bm | |
4182 | Vector memory operand. | |
4183 | ||
4184 | @item Bc | |
4185 | Constant memory operand. | |
4186 | ||
4187 | @item Bn | |
4188 | Memory operand without REX prefix. | |
4189 | ||
4190 | @item Bs | |
4191 | Sibcall memory operand. | |
4192 | ||
4193 | @item Bw | |
4194 | Call memory operand. | |
4195 | ||
4196 | @item Bz | |
4197 | Constant call address operand. | |
4198 | ||
4199 | @item BC | |
4200 | SSE constant -1 operand. | |
b4fbcb1b SL |
4201 | @end ifset |
4202 | ||
4203 | @item I | |
4204 | Integer constant in the range 0 @dots{} 31, for 32-bit shifts. | |
4205 | ||
4206 | @item J | |
4207 | Integer constant in the range 0 @dots{} 63, for 64-bit shifts. | |
4208 | ||
4209 | @item K | |
4210 | Signed 8-bit integer constant. | |
4211 | ||
4212 | @item L | |
4213 | @code{0xFF} or @code{0xFFFF}, for andsi as a zero-extending move. | |
4214 | ||
4215 | @item M | |
4216 | 0, 1, 2, or 3 (shifts for the @code{lea} instruction). | |
4217 | ||
4218 | @item N | |
4219 | Unsigned 8-bit integer constant (for @code{in} and @code{out} | |
4220 | instructions). | |
4221 | ||
4222 | @ifset INTERNALS | |
4223 | @item O | |
4224 | Integer constant in the range 0 @dots{} 127, for 128-bit shifts. | |
4225 | @end ifset | |
4226 | ||
4227 | @item G | |
4228 | Standard 80387 floating point constant. | |
4229 | ||
4230 | @item C | |
aec0b19e | 4231 | SSE constant zero operand. |
b4fbcb1b SL |
4232 | |
4233 | @item e | |
4234 | 32-bit signed integer constant, or a symbolic reference known | |
4235 | to fit that range (for immediate operands in sign-extending x86-64 | |
4236 | instructions). | |
4237 | ||
de3fb1a6 SP |
4238 | @item We |
4239 | 32-bit signed integer constant, or a symbolic reference known | |
4240 | to fit that range (for sign-extending conversion operations that | |
4241 | require non-@code{VOIDmode} immediate operands). | |
4242 | ||
4243 | @item Wz | |
4244 | 32-bit unsigned integer constant, or a symbolic reference known | |
4245 | to fit that range (for zero-extending conversion operations that | |
4246 | require non-@code{VOIDmode} immediate operands). | |
4247 | ||
4248 | @item Wd | |
4249 | 128-bit integer constant where both the high and low 64-bit word | |
4250 | satisfy the @code{e} constraint. | |
4251 | ||
b4fbcb1b SL |
4252 | @item Z |
4253 | 32-bit unsigned integer constant, or a symbolic reference known | |
4254 | to fit that range (for immediate operands in zero-extending x86-64 | |
4255 | instructions). | |
4256 | ||
de3fb1a6 SP |
4257 | @item Tv |
4258 | VSIB address operand. | |
4259 | ||
4260 | @item Ts | |
4261 | Address operand without segment register. | |
4262 | ||
b4fbcb1b SL |
4263 | @end table |
4264 | ||
4265 | @item Xstormy16---@file{config/stormy16/stormy16.h} | |
4266 | @table @code | |
4267 | @item a | |
4268 | Register r0. | |
4269 | ||
4270 | @item b | |
4271 | Register r1. | |
4272 | ||
4273 | @item c | |
4274 | Register r2. | |
4275 | ||
4276 | @item d | |
4277 | Register r8. | |
4278 | ||
4279 | @item e | |
4280 | Registers r0 through r7. | |
4281 | ||
4282 | @item t | |
4283 | Registers r0 and r1. | |
4284 | ||
4285 | @item y | |
4286 | The carry register. | |
4287 | ||
4288 | @item z | |
4289 | Registers r8 and r9. | |
4290 | ||
4291 | @item I | |
4292 | A constant between 0 and 3 inclusive. | |
4293 | ||
4294 | @item J | |
4295 | A constant that has exactly one bit set. | |
4296 | ||
4297 | @item K | |
4298 | A constant that has exactly one bit clear. | |
4299 | ||
4300 | @item L | |
4301 | A constant between 0 and 255 inclusive. | |
4302 | ||
4303 | @item M | |
4304 | A constant between @minus{}255 and 0 inclusive. | |
4305 | ||
4306 | @item N | |
4307 | A constant between @minus{}3 and 0 inclusive. | |
4308 | ||
4309 | @item O | |
4310 | A constant between 1 and 4 inclusive. | |
4311 | ||
4312 | @item P | |
4313 | A constant between @minus{}4 and @minus{}1 inclusive. | |
4314 | ||
4315 | @item Q | |
4316 | A memory reference that is a stack push. | |
4317 | ||
4318 | @item R | |
4319 | A memory reference that is a stack pop. | |
4320 | ||
4321 | @item S | |
4322 | A memory reference that refers to a constant address of known value. | |
4323 | ||
4324 | @item T | |
4325 | The register indicated by Rx (not implemented yet). | |
4326 | ||
4327 | @item U | |
4328 | A constant that is not between 2 and 15 inclusive. | |
4329 | ||
4330 | @item Z | |
4331 | The constant 0. | |
4332 | ||
4333 | @end table | |
4334 | ||
887af464 | 4335 | @item Xtensa---@file{config/xtensa/constraints.md} |
03984308 BW |
4336 | @table @code |
4337 | @item a | |
4338 | General-purpose 32-bit register | |
4339 | ||
4340 | @item b | |
4341 | One-bit boolean register | |
4342 | ||
4343 | @item A | |
4344 | MAC16 40-bit accumulator register | |
4345 | ||
4346 | @item I | |
4347 | Signed 12-bit integer constant, for use in MOVI instructions | |
4348 | ||
4349 | @item J | |
4350 | Signed 8-bit integer constant, for use in ADDI instructions | |
4351 | ||
4352 | @item K | |
4353 | Integer constant valid for BccI instructions | |
4354 | ||
4355 | @item L | |
4356 | Unsigned constant valid for BccUI instructions | |
4357 | ||
4358 | @end table | |
4359 | ||
03dda8e3 RK |
4360 | @end table |
4361 | ||
7ac28727 AK |
4362 | @ifset INTERNALS |
4363 | @node Disable Insn Alternatives | |
4364 | @subsection Disable insn alternatives using the @code{enabled} attribute | |
4365 | @cindex enabled | |
4366 | ||
9840b2fa RS |
4367 | There are three insn attributes that may be used to selectively disable |
4368 | instruction alternatives: | |
7ac28727 | 4369 | |
9840b2fa RS |
4370 | @table @code |
4371 | @item enabled | |
4372 | Says whether an alternative is available on the current subtarget. | |
7ac28727 | 4373 | |
9840b2fa RS |
4374 | @item preferred_for_size |
4375 | Says whether an enabled alternative should be used in code that is | |
4376 | optimized for size. | |
7ac28727 | 4377 | |
9840b2fa RS |
4378 | @item preferred_for_speed |
4379 | Says whether an enabled alternative should be used in code that is | |
4380 | optimized for speed. | |
4381 | @end table | |
4382 | ||
4383 | All these attributes should use @code{(const_int 1)} to allow an alternative | |
4384 | or @code{(const_int 0)} to disallow it. The attributes must be a static | |
4385 | property of the subtarget; they cannot for example depend on the | |
4386 | current operands, on the current optimization level, on the location | |
4387 | of the insn within the body of a loop, on whether register allocation | |
4388 | has finished, or on the current compiler pass. | |
4389 | ||
4390 | The @code{enabled} attribute is a correctness property. It tells GCC to act | |
4391 | as though the disabled alternatives were never defined in the first place. | |
4392 | This is useful when adding new instructions to an existing pattern in | |
4393 | cases where the new instructions are only available for certain cpu | |
4394 | architecture levels (typically mapped to the @code{-march=} command-line | |
4395 | option). | |
4396 | ||
4397 | In contrast, the @code{preferred_for_size} and @code{preferred_for_speed} | |
4398 | attributes are strong optimization hints rather than correctness properties. | |
4399 | @code{preferred_for_size} tells GCC which alternatives to consider when | |
4400 | adding or modifying an instruction that GCC wants to optimize for size. | |
4401 | @code{preferred_for_speed} does the same thing for speed. Note that things | |
4402 | like code motion can lead to cases where code optimized for size uses | |
4403 | alternatives that are not preferred for size, and similarly for speed. | |
4404 | ||
4405 | Although @code{define_insn}s can in principle specify the @code{enabled} | |
4406 | attribute directly, it is often clearer to have subsiduary attributes | |
4407 | for each architectural feature of interest. The @code{define_insn}s | |
4408 | can then use these subsiduary attributes to say which alternatives | |
4409 | require which features. The example below does this for @code{cpu_facility}. | |
7ac28727 AK |
4410 | |
4411 | E.g. the following two patterns could easily be merged using the @code{enabled} | |
4412 | attribute: | |
4413 | ||
4414 | @smallexample | |
4415 | ||
4416 | (define_insn "*movdi_old" | |
4417 | [(set (match_operand:DI 0 "register_operand" "=d") | |
4418 | (match_operand:DI 1 "register_operand" " d"))] | |
4419 | "!TARGET_NEW" | |
4420 | "lgr %0,%1") | |
4421 | ||
4422 | (define_insn "*movdi_new" | |
4423 | [(set (match_operand:DI 0 "register_operand" "=d,f,d") | |
4424 | (match_operand:DI 1 "register_operand" " d,d,f"))] | |
4425 | "TARGET_NEW" | |
4426 | "@@ | |
4427 | lgr %0,%1 | |
4428 | ldgr %0,%1 | |
4429 | lgdr %0,%1") | |
4430 | ||
4431 | @end smallexample | |
4432 | ||
4433 | to: | |
4434 | ||
4435 | @smallexample | |
4436 | ||
4437 | (define_insn "*movdi_combined" | |
4438 | [(set (match_operand:DI 0 "register_operand" "=d,f,d") | |
4439 | (match_operand:DI 1 "register_operand" " d,d,f"))] | |
4440 | "" | |
4441 | "@@ | |
4442 | lgr %0,%1 | |
4443 | ldgr %0,%1 | |
4444 | lgdr %0,%1" | |
4445 | [(set_attr "cpu_facility" "*,new,new")]) | |
4446 | ||
4447 | @end smallexample | |
4448 | ||
4449 | with the @code{enabled} attribute defined like this: | |
4450 | ||
4451 | @smallexample | |
4452 | ||
4453 | (define_attr "cpu_facility" "standard,new" (const_string "standard")) | |
4454 | ||
4455 | (define_attr "enabled" "" | |
4456 | (cond [(eq_attr "cpu_facility" "standard") (const_int 1) | |
4457 | (and (eq_attr "cpu_facility" "new") | |
4458 | (ne (symbol_ref "TARGET_NEW") (const_int 0))) | |
4459 | (const_int 1)] | |
4460 | (const_int 0))) | |
4461 | ||
4462 | @end smallexample | |
4463 | ||
4464 | @end ifset | |
4465 | ||
03dda8e3 | 4466 | @ifset INTERNALS |
f38840db ZW |
4467 | @node Define Constraints |
4468 | @subsection Defining Machine-Specific Constraints | |
4469 | @cindex defining constraints | |
4470 | @cindex constraints, defining | |
4471 | ||
4472 | Machine-specific constraints fall into two categories: register and | |
4473 | non-register constraints. Within the latter category, constraints | |
4474 | which allow subsets of all possible memory or address operands should | |
4475 | be specially marked, to give @code{reload} more information. | |
4476 | ||
4477 | Machine-specific constraints can be given names of arbitrary length, | |
4478 | but they must be entirely composed of letters, digits, underscores | |
4479 | (@samp{_}), and angle brackets (@samp{< >}). Like C identifiers, they | |
ff2ce160 | 4480 | must begin with a letter or underscore. |
f38840db ZW |
4481 | |
4482 | In order to avoid ambiguity in operand constraint strings, no | |
4483 | constraint can have a name that begins with any other constraint's | |
4484 | name. For example, if @code{x} is defined as a constraint name, | |
4485 | @code{xy} may not be, and vice versa. As a consequence of this rule, | |
4486 | no constraint may begin with one of the generic constraint letters: | |
4487 | @samp{E F V X g i m n o p r s}. | |
4488 | ||
4489 | Register constraints correspond directly to register classes. | |
4490 | @xref{Register Classes}. There is thus not much flexibility in their | |
4491 | definitions. | |
4492 | ||
4493 | @deffn {MD Expression} define_register_constraint name regclass docstring | |
4494 | All three arguments are string constants. | |
4495 | @var{name} is the name of the constraint, as it will appear in | |
5be527d0 RG |
4496 | @code{match_operand} expressions. If @var{name} is a multi-letter |
4497 | constraint its length shall be the same for all constraints starting | |
4498 | with the same letter. @var{regclass} can be either the | |
f38840db ZW |
4499 | name of the corresponding register class (@pxref{Register Classes}), |
4500 | or a C expression which evaluates to the appropriate register class. | |
4501 | If it is an expression, it must have no side effects, and it cannot | |
4502 | look at the operand. The usual use of expressions is to map some | |
4503 | register constraints to @code{NO_REGS} when the register class | |
4504 | is not available on a given subarchitecture. | |
4505 | ||
4506 | @var{docstring} is a sentence documenting the meaning of the | |
4507 | constraint. Docstrings are explained further below. | |
4508 | @end deffn | |
4509 | ||
4510 | Non-register constraints are more like predicates: the constraint | |
527a3750 | 4511 | definition gives a boolean expression which indicates whether the |
f38840db ZW |
4512 | constraint matches. |
4513 | ||
4514 | @deffn {MD Expression} define_constraint name docstring exp | |
4515 | The @var{name} and @var{docstring} arguments are the same as for | |
4516 | @code{define_register_constraint}, but note that the docstring comes | |
4517 | immediately after the name for these expressions. @var{exp} is an RTL | |
4518 | expression, obeying the same rules as the RTL expressions in predicate | |
4519 | definitions. @xref{Defining Predicates}, for details. If it | |
4520 | evaluates true, the constraint matches; if it evaluates false, it | |
4521 | doesn't. Constraint expressions should indicate which RTL codes they | |
4522 | might match, just like predicate expressions. | |
4523 | ||
4524 | @code{match_test} C expressions have access to the | |
4525 | following variables: | |
4526 | ||
4527 | @table @var | |
4528 | @item op | |
4529 | The RTL object defining the operand. | |
4530 | @item mode | |
4531 | The machine mode of @var{op}. | |
4532 | @item ival | |
4533 | @samp{INTVAL (@var{op})}, if @var{op} is a @code{const_int}. | |
4534 | @item hval | |
4535 | @samp{CONST_DOUBLE_HIGH (@var{op})}, if @var{op} is an integer | |
4536 | @code{const_double}. | |
4537 | @item lval | |
4538 | @samp{CONST_DOUBLE_LOW (@var{op})}, if @var{op} is an integer | |
4539 | @code{const_double}. | |
4540 | @item rval | |
4541 | @samp{CONST_DOUBLE_REAL_VALUE (@var{op})}, if @var{op} is a floating-point | |
3fa1b0e5 | 4542 | @code{const_double}. |
f38840db ZW |
4543 | @end table |
4544 | ||
4545 | The @var{*val} variables should only be used once another piece of the | |
4546 | expression has verified that @var{op} is the appropriate kind of RTL | |
4547 | object. | |
4548 | @end deffn | |
4549 | ||
4550 | Most non-register constraints should be defined with | |
4551 | @code{define_constraint}. The remaining two definition expressions | |
4552 | are only appropriate for constraints that should be handled specially | |
4553 | by @code{reload} if they fail to match. | |
4554 | ||
4555 | @deffn {MD Expression} define_memory_constraint name docstring exp | |
4556 | Use this expression for constraints that match a subset of all memory | |
4557 | operands: that is, @code{reload} can make them match by converting the | |
4558 | operand to the form @samp{@w{(mem (reg @var{X}))}}, where @var{X} is a | |
4559 | base register (from the register class specified by | |
4560 | @code{BASE_REG_CLASS}, @pxref{Register Classes}). | |
4561 | ||
4562 | For example, on the S/390, some instructions do not accept arbitrary | |
4563 | memory references, but only those that do not make use of an index | |
4564 | register. The constraint letter @samp{Q} is defined to represent a | |
4565 | memory address of this type. If @samp{Q} is defined with | |
4566 | @code{define_memory_constraint}, a @samp{Q} constraint can handle any | |
4567 | memory operand, because @code{reload} knows it can simply copy the | |
4568 | memory address into a base register if required. This is analogous to | |
e4ae5e77 | 4569 | the way an @samp{o} constraint can handle any memory operand. |
f38840db ZW |
4570 | |
4571 | The syntax and semantics are otherwise identical to | |
4572 | @code{define_constraint}. | |
4573 | @end deffn | |
4574 | ||
9eb1ca69 VM |
4575 | @deffn {MD Expression} define_special_memory_constraint name docstring exp |
4576 | Use this expression for constraints that match a subset of all memory | |
67914693 | 4577 | operands: that is, @code{reload} cannot make them match by reloading |
9eb1ca69 VM |
4578 | the address as it is described for @code{define_memory_constraint} or |
4579 | such address reload is undesirable with the performance point of view. | |
4580 | ||
4581 | For example, @code{define_special_memory_constraint} can be useful if | |
4582 | specifically aligned memory is necessary or desirable for some insn | |
4583 | operand. | |
4584 | ||
4585 | The syntax and semantics are otherwise identical to | |
02f2dc44 VM |
4586 | @code{define_memory_constraint}. |
4587 | @end deffn | |
4588 | ||
4589 | @deffn {MD Expression} define_relaxed_memory_constraint name docstring exp | |
4590 | The test expression in a @code{define_memory_constraint} can assume | |
4591 | that @code{TARGET_LEGITIMATE_ADDRESS_P} holds for the address inside | |
4592 | a @code{mem} rtx and so it does not need to test this condition itself. | |
4593 | In other words, a @code{define_memory_constraint} test of the form: | |
4594 | ||
4595 | @smallexample | |
4596 | (match_test "mem") | |
4597 | @end smallexample | |
4598 | ||
4599 | is enough to test whether an rtx is a @code{mem} @emph{and} whether | |
4600 | its address satisfies @code{TARGET_MEM_CONSTRAINT} (which is usually | |
4601 | @samp{'m'}). Thus the conditions imposed by a @code{define_memory_constraint} | |
4602 | always apply on top of the conditions imposed by @code{TARGET_MEM_CONSTRAINT}. | |
4603 | ||
4604 | However, it is sometimes useful to define memory constraints that allow | |
4605 | addresses beyond those accepted by @code{TARGET_LEGITIMATE_ADDRESS_P}. | |
4606 | @code{define_relaxed_memory_constraint} exists for this case. | |
4607 | The test expression in a @code{define_relaxed_memory_constraint} is | |
4608 | applied with no preconditions, so that the expression can determine | |
4609 | ``from scratch'' exactly which addresses are valid and which are not. | |
4610 | ||
4611 | The syntax and semantics are otherwise identical to | |
4612 | @code{define_memory_constraint}. | |
9eb1ca69 VM |
4613 | @end deffn |
4614 | ||
f38840db ZW |
4615 | @deffn {MD Expression} define_address_constraint name docstring exp |
4616 | Use this expression for constraints that match a subset of all address | |
4617 | operands: that is, @code{reload} can make the constraint match by | |
4618 | converting the operand to the form @samp{@w{(reg @var{X})}}, again | |
4619 | with @var{X} a base register. | |
4620 | ||
4621 | Constraints defined with @code{define_address_constraint} can only be | |
4622 | used with the @code{address_operand} predicate, or machine-specific | |
4623 | predicates that work the same way. They are treated analogously to | |
4624 | the generic @samp{p} constraint. | |
4625 | ||
4626 | The syntax and semantics are otherwise identical to | |
4627 | @code{define_constraint}. | |
4628 | @end deffn | |
4629 | ||
4630 | For historical reasons, names beginning with the letters @samp{G H} | |
4631 | are reserved for constraints that match only @code{const_double}s, and | |
4632 | names beginning with the letters @samp{I J K L M N O P} are reserved | |
4633 | for constraints that match only @code{const_int}s. This may change in | |
4634 | the future. For the time being, constraints with these names must be | |
4635 | written in a stylized form, so that @code{genpreds} can tell you did | |
4636 | it correctly: | |
4637 | ||
4638 | @smallexample | |
4639 | @group | |
4640 | (define_constraint "[@var{GHIJKLMNOP}]@dots{}" | |
4641 | "@var{doc}@dots{}" | |
4642 | (and (match_code "const_int") ; @r{@code{const_double} for G/H} | |
4643 | @var{condition}@dots{})) ; @r{usually a @code{match_test}} | |
4644 | @end group | |
4645 | @end smallexample | |
4646 | @c the semicolons line up in the formatted manual | |
4647 | ||
4648 | It is fine to use names beginning with other letters for constraints | |
4649 | that match @code{const_double}s or @code{const_int}s. | |
4650 | ||
4651 | Each docstring in a constraint definition should be one or more complete | |
4652 | sentences, marked up in Texinfo format. @emph{They are currently unused.} | |
4653 | In the future they will be copied into the GCC manual, in @ref{Machine | |
4654 | Constraints}, replacing the hand-maintained tables currently found in | |
4655 | that section. Also, in the future the compiler may use this to give | |
4656 | more helpful diagnostics when poor choice of @code{asm} constraints | |
4657 | causes a reload failure. | |
4658 | ||
4659 | If you put the pseudo-Texinfo directive @samp{@@internal} at the | |
4660 | beginning of a docstring, then (in the future) it will appear only in | |
4661 | the internals manual's version of the machine-specific constraint tables. | |
4662 | Use this for constraints that should not appear in @code{asm} statements. | |
4663 | ||
4664 | @node C Constraint Interface | |
4665 | @subsection Testing constraints from C | |
4666 | @cindex testing constraints | |
4667 | @cindex constraints, testing | |
4668 | ||
4669 | It is occasionally useful to test a constraint from C code rather than | |
4670 | implicitly via the constraint string in a @code{match_operand}. The | |
4671 | generated file @file{tm_p.h} declares a few interfaces for working | |
8677664e RS |
4672 | with constraints. At present these are defined for all constraints |
4673 | except @code{g} (which is equivalent to @code{general_operand}). | |
f38840db ZW |
4674 | |
4675 | Some valid constraint names are not valid C identifiers, so there is a | |
4676 | mangling scheme for referring to them from C@. Constraint names that | |
4677 | do not contain angle brackets or underscores are left unchanged. | |
4678 | Underscores are doubled, each @samp{<} is replaced with @samp{_l}, and | |
4679 | each @samp{>} with @samp{_g}. Here are some examples: | |
4680 | ||
4681 | @c the @c's prevent double blank lines in the printed manual. | |
4682 | @example | |
4683 | @multitable {Original} {Mangled} | |
cccb0908 | 4684 | @item @strong{Original} @tab @strong{Mangled} @c |
f38840db ZW |
4685 | @item @code{x} @tab @code{x} @c |
4686 | @item @code{P42x} @tab @code{P42x} @c | |
4687 | @item @code{P4_x} @tab @code{P4__x} @c | |
4688 | @item @code{P4>x} @tab @code{P4_gx} @c | |
4689 | @item @code{P4>>} @tab @code{P4_g_g} @c | |
4690 | @item @code{P4_g>} @tab @code{P4__g_g} @c | |
4691 | @end multitable | |
4692 | @end example | |
4693 | ||
4694 | Throughout this section, the variable @var{c} is either a constraint | |
4695 | in the abstract sense, or a constant from @code{enum constraint_num}; | |
4696 | the variable @var{m} is a mangled constraint name (usually as part of | |
4697 | a larger identifier). | |
4698 | ||
4699 | @deftp Enum constraint_num | |
8677664e | 4700 | For each constraint except @code{g}, there is a corresponding |
f38840db ZW |
4701 | enumeration constant: @samp{CONSTRAINT_} plus the mangled name of the |
4702 | constraint. Functions that take an @code{enum constraint_num} as an | |
4703 | argument expect one of these constants. | |
f38840db ZW |
4704 | @end deftp |
4705 | ||
4706 | @deftypefun {inline bool} satisfies_constraint_@var{m} (rtx @var{exp}) | |
8677664e | 4707 | For each non-register constraint @var{m} except @code{g}, there is |
f38840db ZW |
4708 | one of these functions; it returns @code{true} if @var{exp} satisfies the |
4709 | constraint. These functions are only visible if @file{rtl.h} was included | |
4710 | before @file{tm_p.h}. | |
4711 | @end deftypefun | |
4712 | ||
4713 | @deftypefun bool constraint_satisfied_p (rtx @var{exp}, enum constraint_num @var{c}) | |
4714 | Like the @code{satisfies_constraint_@var{m}} functions, but the | |
4715 | constraint to test is given as an argument, @var{c}. If @var{c} | |
4716 | specifies a register constraint, this function will always return | |
4717 | @code{false}. | |
4718 | @end deftypefun | |
4719 | ||
2aeedf58 | 4720 | @deftypefun {enum reg_class} reg_class_for_constraint (enum constraint_num @var{c}) |
f38840db ZW |
4721 | Returns the register class associated with @var{c}. If @var{c} is not |
4722 | a register constraint, or those registers are not available for the | |
4723 | currently selected subtarget, returns @code{NO_REGS}. | |
4724 | @end deftypefun | |
4725 | ||
4726 | Here is an example use of @code{satisfies_constraint_@var{m}}. In | |
4727 | peephole optimizations (@pxref{Peephole Definitions}), operand | |
4728 | constraint strings are ignored, so if there are relevant constraints, | |
4729 | they must be tested in the C condition. In the example, the | |
4730 | optimization is applied if operand 2 does @emph{not} satisfy the | |
4731 | @samp{K} constraint. (This is a simplified version of a peephole | |
4732 | definition from the i386 machine description.) | |
4733 | ||
4734 | @smallexample | |
4735 | (define_peephole2 | |
4736 | [(match_scratch:SI 3 "r") | |
4737 | (set (match_operand:SI 0 "register_operand" "") | |
6ccde948 RW |
4738 | (mult:SI (match_operand:SI 1 "memory_operand" "") |
4739 | (match_operand:SI 2 "immediate_operand" "")))] | |
f38840db ZW |
4740 | |
4741 | "!satisfies_constraint_K (operands[2])" | |
4742 | ||
4743 | [(set (match_dup 3) (match_dup 1)) | |
4744 | (set (match_dup 0) (mult:SI (match_dup 3) (match_dup 2)))] | |
4745 | ||
4746 | "") | |
4747 | @end smallexample | |
4748 | ||
03dda8e3 RK |
4749 | @node Standard Names |
4750 | @section Standard Pattern Names For Generation | |
4751 | @cindex standard pattern names | |
4752 | @cindex pattern names | |
4753 | @cindex names, pattern | |
4754 | ||
4755 | Here is a table of the instruction names that are meaningful in the RTL | |
4756 | generation pass of the compiler. Giving one of these names to an | |
4757 | instruction pattern tells the RTL generation pass that it can use the | |
556e0f21 | 4758 | pattern to accomplish a certain task. |
03dda8e3 RK |
4759 | |
4760 | @table @asis | |
4761 | @cindex @code{mov@var{m}} instruction pattern | |
4762 | @item @samp{mov@var{m}} | |
4bd0bee9 | 4763 | Here @var{m} stands for a two-letter machine mode name, in lowercase. |
03dda8e3 RK |
4764 | This instruction pattern moves data with that machine mode from operand |
4765 | 1 to operand 0. For example, @samp{movsi} moves full-word data. | |
4766 | ||
4767 | If operand 0 is a @code{subreg} with mode @var{m} of a register whose | |
4768 | own mode is wider than @var{m}, the effect of this instruction is | |
4769 | to store the specified value in the part of the register that corresponds | |
8feb4e28 JL |
4770 | to mode @var{m}. Bits outside of @var{m}, but which are within the |
4771 | same target word as the @code{subreg} are undefined. Bits which are | |
4772 | outside the target word are left unchanged. | |
03dda8e3 RK |
4773 | |
4774 | This class of patterns is special in several ways. First of all, each | |
65945ec1 HPN |
4775 | of these names up to and including full word size @emph{must} be defined, |
4776 | because there is no other way to copy a datum from one place to another. | |
4777 | If there are patterns accepting operands in larger modes, | |
4778 | @samp{mov@var{m}} must be defined for integer modes of those sizes. | |
03dda8e3 RK |
4779 | |
4780 | Second, these patterns are not used solely in the RTL generation pass. | |
4781 | Even the reload pass can generate move insns to copy values from stack | |
4782 | slots into temporary registers. When it does so, one of the operands is | |
4783 | a hard register and the other is an operand that can need to be reloaded | |
4784 | into a register. | |
4785 | ||
4786 | @findex force_reg | |
4787 | Therefore, when given such a pair of operands, the pattern must generate | |
4788 | RTL which needs no reloading and needs no temporary registers---no | |
4789 | registers other than the operands. For example, if you support the | |
4790 | pattern with a @code{define_expand}, then in such a case the | |
4791 | @code{define_expand} mustn't call @code{force_reg} or any other such | |
4792 | function which might generate new pseudo registers. | |
4793 | ||
4794 | This requirement exists even for subword modes on a RISC machine where | |
4795 | fetching those modes from memory normally requires several insns and | |
39ed8974 | 4796 | some temporary registers. |
03dda8e3 RK |
4797 | |
4798 | @findex change_address | |
4799 | During reload a memory reference with an invalid address may be passed | |
4800 | as an operand. Such an address will be replaced with a valid address | |
4801 | later in the reload pass. In this case, nothing may be done with the | |
4802 | address except to use it as it stands. If it is copied, it will not be | |
4803 | replaced with a valid address. No attempt should be made to make such | |
4804 | an address into a valid address and no routine (such as | |
4805 | @code{change_address}) that will do so may be called. Note that | |
4806 | @code{general_operand} will fail when applied to such an address. | |
4807 | ||
4808 | @findex reload_in_progress | |
4809 | The global variable @code{reload_in_progress} (which must be explicitly | |
4810 | declared if required) can be used to determine whether such special | |
4811 | handling is required. | |
4812 | ||
4813 | The variety of operands that have reloads depends on the rest of the | |
4814 | machine description, but typically on a RISC machine these can only be | |
4815 | pseudo registers that did not get hard registers, while on other | |
4816 | machines explicit memory references will get optional reloads. | |
4817 | ||
4818 | If a scratch register is required to move an object to or from memory, | |
f1db3576 JL |
4819 | it can be allocated using @code{gen_reg_rtx} prior to life analysis. |
4820 | ||
9c34dbbf | 4821 | If there are cases which need scratch registers during or after reload, |
8a99f6f9 | 4822 | you must provide an appropriate secondary_reload target hook. |
03dda8e3 | 4823 | |
ef4375b2 KZ |
4824 | @findex can_create_pseudo_p |
4825 | The macro @code{can_create_pseudo_p} can be used to determine if it | |
f1db3576 JL |
4826 | is unsafe to create new pseudo registers. If this variable is nonzero, then |
4827 | it is unsafe to call @code{gen_reg_rtx} to allocate a new pseudo. | |
4828 | ||
956d6950 | 4829 | The constraints on a @samp{mov@var{m}} must permit moving any hard |
03dda8e3 | 4830 | register to any other hard register provided that |
f939c3e6 | 4831 | @code{TARGET_HARD_REGNO_MODE_OK} permits mode @var{m} in both registers and |
de8f4b07 AS |
4832 | @code{TARGET_REGISTER_MOVE_COST} applied to their classes returns a value |
4833 | of 2. | |
03dda8e3 | 4834 | |
956d6950 | 4835 | It is obligatory to support floating point @samp{mov@var{m}} |
03dda8e3 RK |
4836 | instructions into and out of any registers that can hold fixed point |
4837 | values, because unions and structures (which have modes @code{SImode} or | |
4838 | @code{DImode}) can be in those registers and they may have floating | |
4839 | point members. | |
4840 | ||
956d6950 | 4841 | There may also be a need to support fixed point @samp{mov@var{m}} |
03dda8e3 RK |
4842 | instructions in and out of floating point registers. Unfortunately, I |
4843 | have forgotten why this was so, and I don't know whether it is still | |
f939c3e6 | 4844 | true. If @code{TARGET_HARD_REGNO_MODE_OK} rejects fixed point values in |
03dda8e3 | 4845 | floating point registers, then the constraints of the fixed point |
956d6950 | 4846 | @samp{mov@var{m}} instructions must be designed to avoid ever trying to |
03dda8e3 RK |
4847 | reload into a floating point register. |
4848 | ||
4849 | @cindex @code{reload_in} instruction pattern | |
4850 | @cindex @code{reload_out} instruction pattern | |
4851 | @item @samp{reload_in@var{m}} | |
4852 | @itemx @samp{reload_out@var{m}} | |
8a99f6f9 R |
4853 | These named patterns have been obsoleted by the target hook |
4854 | @code{secondary_reload}. | |
4855 | ||
03dda8e3 RK |
4856 | Like @samp{mov@var{m}}, but used when a scratch register is required to |
4857 | move between operand 0 and operand 1. Operand 2 describes the scratch | |
4858 | register. See the discussion of the @code{SECONDARY_RELOAD_CLASS} | |
4859 | macro in @pxref{Register Classes}. | |
4860 | ||
d989f648 | 4861 | There are special restrictions on the form of the @code{match_operand}s |
f282ffb3 | 4862 | used in these patterns. First, only the predicate for the reload |
560dbedd RH |
4863 | operand is examined, i.e., @code{reload_in} examines operand 1, but not |
4864 | the predicates for operand 0 or 2. Second, there may be only one | |
d989f648 RH |
4865 | alternative in the constraints. Third, only a single register class |
4866 | letter may be used for the constraint; subsequent constraint letters | |
4867 | are ignored. As a special exception, an empty constraint string | |
4868 | matches the @code{ALL_REGS} register class. This may relieve ports | |
4869 | of the burden of defining an @code{ALL_REGS} constraint letter just | |
4870 | for these patterns. | |
4871 | ||
03dda8e3 RK |
4872 | @cindex @code{movstrict@var{m}} instruction pattern |
4873 | @item @samp{movstrict@var{m}} | |
4874 | Like @samp{mov@var{m}} except that if operand 0 is a @code{subreg} | |
4875 | with mode @var{m} of a register whose natural mode is wider, | |
4876 | the @samp{movstrict@var{m}} instruction is guaranteed not to alter | |
4877 | any of the register except the part which belongs to mode @var{m}. | |
4878 | ||
1e0598e2 RH |
4879 | @cindex @code{movmisalign@var{m}} instruction pattern |
4880 | @item @samp{movmisalign@var{m}} | |
4881 | This variant of a move pattern is designed to load or store a value | |
4882 | from a memory address that is not naturally aligned for its mode. | |
4883 | For a store, the memory will be in operand 0; for a load, the memory | |
4884 | will be in operand 1. The other operand is guaranteed not to be a | |
4885 | memory, so that it's easy to tell whether this is a load or store. | |
4886 | ||
4887 | This pattern is used by the autovectorizer, and when expanding a | |
4888 | @code{MISALIGNED_INDIRECT_REF} expression. | |
4889 | ||
03dda8e3 RK |
4890 | @cindex @code{load_multiple} instruction pattern |
4891 | @item @samp{load_multiple} | |
4892 | Load several consecutive memory locations into consecutive registers. | |
4893 | Operand 0 is the first of the consecutive registers, operand 1 | |
4894 | is the first memory location, and operand 2 is a constant: the | |
4895 | number of consecutive registers. | |
4896 | ||
4897 | Define this only if the target machine really has such an instruction; | |
4898 | do not define this if the most efficient way of loading consecutive | |
4899 | registers from memory is to do them one at a time. | |
4900 | ||
4901 | On some machines, there are restrictions as to which consecutive | |
4902 | registers can be stored into memory, such as particular starting or | |
4903 | ending register numbers or only a range of valid counts. For those | |
4904 | machines, use a @code{define_expand} (@pxref{Expander Definitions}) | |
4905 | and make the pattern fail if the restrictions are not met. | |
4906 | ||
4907 | Write the generated insn as a @code{parallel} with elements being a | |
4908 | @code{set} of one register from the appropriate memory location (you may | |
4909 | also need @code{use} or @code{clobber} elements). Use a | |
4910 | @code{match_parallel} (@pxref{RTL Template}) to recognize the insn. See | |
c9693e96 | 4911 | @file{rs6000.md} for examples of the use of this insn pattern. |
03dda8e3 RK |
4912 | |
4913 | @cindex @samp{store_multiple} instruction pattern | |
4914 | @item @samp{store_multiple} | |
4915 | Similar to @samp{load_multiple}, but store several consecutive registers | |
4916 | into consecutive memory locations. Operand 0 is the first of the | |
4917 | consecutive memory locations, operand 1 is the first register, and | |
4918 | operand 2 is a constant: the number of consecutive registers. | |
4919 | ||
272c6793 RS |
4920 | @cindex @code{vec_load_lanes@var{m}@var{n}} instruction pattern |
4921 | @item @samp{vec_load_lanes@var{m}@var{n}} | |
4922 | Perform an interleaved load of several vectors from memory operand 1 | |
4923 | into register operand 0. Both operands have mode @var{m}. The register | |
4924 | operand is viewed as holding consecutive vectors of mode @var{n}, | |
4925 | while the memory operand is a flat array that contains the same number | |
4926 | of elements. The operation is equivalent to: | |
4927 | ||
4928 | @smallexample | |
4929 | int c = GET_MODE_SIZE (@var{m}) / GET_MODE_SIZE (@var{n}); | |
4930 | for (j = 0; j < GET_MODE_NUNITS (@var{n}); j++) | |
4931 | for (i = 0; i < c; i++) | |
4932 | operand0[i][j] = operand1[j * c + i]; | |
4933 | @end smallexample | |
4934 | ||
4935 | For example, @samp{vec_load_lanestiv4hi} loads 8 16-bit values | |
4936 | from memory into a register of mode @samp{TI}@. The register | |
4937 | contains two consecutive vectors of mode @samp{V4HI}@. | |
4938 | ||
4939 | This pattern can only be used if: | |
4940 | @smallexample | |
4941 | TARGET_ARRAY_MODE_SUPPORTED_P (@var{n}, @var{c}) | |
4942 | @end smallexample | |
4943 | is true. GCC assumes that, if a target supports this kind of | |
4944 | instruction for some mode @var{n}, it also supports unaligned | |
4945 | loads for vectors of mode @var{n}. | |
4946 | ||
a54a5997 RS |
4947 | This pattern is not allowed to @code{FAIL}. |
4948 | ||
7e11fc7f RS |
4949 | @cindex @code{vec_mask_load_lanes@var{m}@var{n}} instruction pattern |
4950 | @item @samp{vec_mask_load_lanes@var{m}@var{n}} | |
4951 | Like @samp{vec_load_lanes@var{m}@var{n}}, but takes an additional | |
4952 | mask operand (operand 2) that specifies which elements of the destination | |
4953 | vectors should be loaded. Other elements of the destination | |
4954 | vectors are set to zero. The operation is equivalent to: | |
4955 | ||
4956 | @smallexample | |
4957 | int c = GET_MODE_SIZE (@var{m}) / GET_MODE_SIZE (@var{n}); | |
4958 | for (j = 0; j < GET_MODE_NUNITS (@var{n}); j++) | |
4959 | if (operand2[j]) | |
4960 | for (i = 0; i < c; i++) | |
4961 | operand0[i][j] = operand1[j * c + i]; | |
4962 | else | |
4963 | for (i = 0; i < c; i++) | |
4964 | operand0[i][j] = 0; | |
4965 | @end smallexample | |
4966 | ||
4967 | This pattern is not allowed to @code{FAIL}. | |
4968 | ||
272c6793 RS |
4969 | @cindex @code{vec_store_lanes@var{m}@var{n}} instruction pattern |
4970 | @item @samp{vec_store_lanes@var{m}@var{n}} | |
4971 | Equivalent to @samp{vec_load_lanes@var{m}@var{n}}, with the memory | |
4972 | and register operands reversed. That is, the instruction is | |
4973 | equivalent to: | |
4974 | ||
4975 | @smallexample | |
4976 | int c = GET_MODE_SIZE (@var{m}) / GET_MODE_SIZE (@var{n}); | |
4977 | for (j = 0; j < GET_MODE_NUNITS (@var{n}); j++) | |
4978 | for (i = 0; i < c; i++) | |
4979 | operand0[j * c + i] = operand1[i][j]; | |
4980 | @end smallexample | |
4981 | ||
4982 | for a memory operand 0 and register operand 1. | |
4983 | ||
a54a5997 RS |
4984 | This pattern is not allowed to @code{FAIL}. |
4985 | ||
7e11fc7f RS |
4986 | @cindex @code{vec_mask_store_lanes@var{m}@var{n}} instruction pattern |
4987 | @item @samp{vec_mask_store_lanes@var{m}@var{n}} | |
4988 | Like @samp{vec_store_lanes@var{m}@var{n}}, but takes an additional | |
4989 | mask operand (operand 2) that specifies which elements of the source | |
4990 | vectors should be stored. The operation is equivalent to: | |
4991 | ||
4992 | @smallexample | |
4993 | int c = GET_MODE_SIZE (@var{m}) / GET_MODE_SIZE (@var{n}); | |
4994 | for (j = 0; j < GET_MODE_NUNITS (@var{n}); j++) | |
4995 | if (operand2[j]) | |
4996 | for (i = 0; i < c; i++) | |
4997 | operand0[j * c + i] = operand1[i][j]; | |
4998 | @end smallexample | |
4999 | ||
5000 | This pattern is not allowed to @code{FAIL}. | |
5001 | ||
09eb042a RS |
5002 | @cindex @code{gather_load@var{m}@var{n}} instruction pattern |
5003 | @item @samp{gather_load@var{m}@var{n}} | |
bfaa08b7 | 5004 | Load several separate memory locations into a vector of mode @var{m}. |
09eb042a RS |
5005 | Operand 1 is a scalar base address and operand 2 is a vector of mode @var{n} |
5006 | containing offsets from that base. Operand 0 is a destination vector with | |
5007 | the same number of elements as @var{n}. For each element index @var{i}: | |
bfaa08b7 RS |
5008 | |
5009 | @itemize @bullet | |
5010 | @item | |
5011 | extend the offset element @var{i} to address width, using zero | |
5012 | extension if operand 3 is 1 and sign extension if operand 3 is zero; | |
5013 | @item | |
5014 | multiply the extended offset by operand 4; | |
5015 | @item | |
5016 | add the result to the base; and | |
5017 | @item | |
5018 | load the value at that address into element @var{i} of operand 0. | |
5019 | @end itemize | |
5020 | ||
5021 | The value of operand 3 does not matter if the offsets are already | |
5022 | address width. | |
5023 | ||
09eb042a RS |
5024 | @cindex @code{mask_gather_load@var{m}@var{n}} instruction pattern |
5025 | @item @samp{mask_gather_load@var{m}@var{n}} | |
5026 | Like @samp{gather_load@var{m}@var{n}}, but takes an extra mask operand as | |
bfaa08b7 RS |
5027 | operand 5. Bit @var{i} of the mask is set if element @var{i} |
5028 | of the result should be loaded from memory and clear if element @var{i} | |
5029 | of the result should be set to zero. | |
5030 | ||
09eb042a RS |
5031 | @cindex @code{scatter_store@var{m}@var{n}} instruction pattern |
5032 | @item @samp{scatter_store@var{m}@var{n}} | |
f307441a | 5033 | Store a vector of mode @var{m} into several distinct memory locations. |
09eb042a RS |
5034 | Operand 0 is a scalar base address and operand 1 is a vector of mode |
5035 | @var{n} containing offsets from that base. Operand 4 is the vector of | |
5036 | values that should be stored, which has the same number of elements as | |
5037 | @var{n}. For each element index @var{i}: | |
f307441a RS |
5038 | |
5039 | @itemize @bullet | |
5040 | @item | |
5041 | extend the offset element @var{i} to address width, using zero | |
5042 | extension if operand 2 is 1 and sign extension if operand 2 is zero; | |
5043 | @item | |
5044 | multiply the extended offset by operand 3; | |
5045 | @item | |
5046 | add the result to the base; and | |
5047 | @item | |
5048 | store element @var{i} of operand 4 to that address. | |
5049 | @end itemize | |
5050 | ||
5051 | The value of operand 2 does not matter if the offsets are already | |
5052 | address width. | |
5053 | ||
09eb042a RS |
5054 | @cindex @code{mask_scatter_store@var{m}@var{n}} instruction pattern |
5055 | @item @samp{mask_scatter_store@var{m}@var{n}} | |
5056 | Like @samp{scatter_store@var{m}@var{n}}, but takes an extra mask operand as | |
f307441a RS |
5057 | operand 5. Bit @var{i} of the mask is set if element @var{i} |
5058 | of the result should be stored to memory. | |
5059 | ||
ef1140a9 JH |
5060 | @cindex @code{vec_set@var{m}} instruction pattern |
5061 | @item @samp{vec_set@var{m}} | |
5062 | Set given field in the vector value. Operand 0 is the vector to modify, | |
5063 | operand 1 is new value of field and operand 2 specify the field index. | |
5064 | ||
ff03930a JJ |
5065 | @cindex @code{vec_extract@var{m}@var{n}} instruction pattern |
5066 | @item @samp{vec_extract@var{m}@var{n}} | |
ef1140a9 | 5067 | Extract given field from the vector value. Operand 1 is the vector, operand 2 |
ff03930a JJ |
5068 | specify field index and operand 0 place to store value into. The |
5069 | @var{n} mode is the mode of the field or vector of fields that should be | |
5070 | extracted, should be either element mode of the vector mode @var{m}, or | |
5071 | a vector mode with the same element mode and smaller number of elements. | |
5072 | If @var{n} is a vector mode, the index is counted in units of that mode. | |
5073 | ||
5074 | @cindex @code{vec_init@var{m}@var{n}} instruction pattern | |
5075 | @item @samp{vec_init@var{m}@var{n}} | |
425a2bde | 5076 | Initialize the vector to given values. Operand 0 is the vector to initialize |
ff03930a JJ |
5077 | and operand 1 is parallel containing values for individual fields. The |
5078 | @var{n} mode is the mode of the elements, should be either element mode of | |
5079 | the vector mode @var{m}, or a vector mode with the same element mode and | |
5080 | smaller number of elements. | |
ef1140a9 | 5081 | |
be4c1d4a RS |
5082 | @cindex @code{vec_duplicate@var{m}} instruction pattern |
5083 | @item @samp{vec_duplicate@var{m}} | |
5084 | Initialize vector output operand 0 so that each element has the value given | |
5085 | by scalar input operand 1. The vector has mode @var{m} and the scalar has | |
5086 | the mode appropriate for one element of @var{m}. | |
5087 | ||
5088 | This pattern only handles duplicates of non-constant inputs. Constant | |
5089 | vectors go through the @code{mov@var{m}} pattern instead. | |
5090 | ||
5091 | This pattern is not allowed to @code{FAIL}. | |
5092 | ||
9adab579 RS |
5093 | @cindex @code{vec_series@var{m}} instruction pattern |
5094 | @item @samp{vec_series@var{m}} | |
5095 | Initialize vector output operand 0 so that element @var{i} is equal to | |
5096 | operand 1 plus @var{i} times operand 2. In other words, create a linear | |
5097 | series whose base value is operand 1 and whose step is operand 2. | |
5098 | ||
5099 | The vector output has mode @var{m} and the scalar inputs have the mode | |
5100 | appropriate for one element of @var{m}. This pattern is not used for | |
5101 | floating-point vectors, in order to avoid having to specify the | |
5102 | rounding behavior for @var{i} > 1. | |
5103 | ||
5104 | This pattern is not allowed to @code{FAIL}. | |
5105 | ||
7cfb4d93 RS |
5106 | @cindex @code{while_ult@var{m}@var{n}} instruction pattern |
5107 | @item @code{while_ult@var{m}@var{n}} | |
5108 | Set operand 0 to a mask that is true while incrementing operand 1 | |
5109 | gives a value that is less than operand 2. Operand 0 has mode @var{n} | |
5110 | and operands 1 and 2 are scalar integers of mode @var{m}. | |
5111 | The operation is equivalent to: | |
5112 | ||
5113 | @smallexample | |
5114 | operand0[0] = operand1 < operand2; | |
5115 | for (i = 1; i < GET_MODE_NUNITS (@var{n}); i++) | |
5116 | operand0[i] = operand0[i - 1] && (operand1 + i < operand2); | |
5117 | @end smallexample | |
58c036c8 RS |
5118 | |
5119 | @cindex @code{check_raw_ptrs@var{m}} instruction pattern | |
5120 | @item @samp{check_raw_ptrs@var{m}} | |
5121 | Check whether, given two pointers @var{a} and @var{b} and a length @var{len}, | |
5122 | a write of @var{len} bytes at @var{a} followed by a read of @var{len} bytes | |
5123 | at @var{b} can be split into interleaved byte accesses | |
5124 | @samp{@var{a}[0], @var{b}[0], @var{a}[1], @var{b}[1], @dots{}} | |
5125 | without affecting the dependencies between the bytes. Set operand 0 | |
5126 | to true if the split is possible and false otherwise. | |
5127 | ||
5128 | Operands 1, 2 and 3 provide the values of @var{a}, @var{b} and @var{len} | |
5129 | respectively. Operand 4 is a constant integer that provides the known | |
5130 | common alignment of @var{a} and @var{b}. All inputs have mode @var{m}. | |
5131 | ||
5132 | This split is possible if: | |
5133 | ||
5134 | @smallexample | |
5135 | @var{a} == @var{b} || @var{a} + @var{len} <= @var{b} || @var{b} + @var{len} <= @var{a} | |
5136 | @end smallexample | |
5137 | ||
5138 | You should only define this pattern if the target has a way of accelerating | |
5139 | the test without having to do the individual comparisons. | |
5140 | ||
5141 | @cindex @code{check_war_ptrs@var{m}} instruction pattern | |
5142 | @item @samp{check_war_ptrs@var{m}} | |
5143 | Like @samp{check_raw_ptrs@var{m}}, but with the read and write swapped round. | |
5144 | The split is possible in this case if: | |
5145 | ||
5146 | @smallexample | |
5147 | @var{b} <= @var{a} || @var{a} + @var{len} <= @var{b} | |
5148 | @end smallexample | |
7cfb4d93 | 5149 | |
12fb875f IE |
5150 | @cindex @code{vec_cmp@var{m}@var{n}} instruction pattern |
5151 | @item @samp{vec_cmp@var{m}@var{n}} | |
5152 | Output a vector comparison. Operand 0 of mode @var{n} is the destination for | |
5153 | predicate in operand 1 which is a signed vector comparison with operands of | |
5154 | mode @var{m} in operands 2 and 3. Predicate is computed by element-wise | |
5155 | evaluation of the vector comparison with a truth value of all-ones and a false | |
5156 | value of all-zeros. | |
5157 | ||
5158 | @cindex @code{vec_cmpu@var{m}@var{n}} instruction pattern | |
5159 | @item @samp{vec_cmpu@var{m}@var{n}} | |
5160 | Similar to @code{vec_cmp@var{m}@var{n}} but perform unsigned vector comparison. | |
5161 | ||
96592eed JJ |
5162 | @cindex @code{vec_cmpeq@var{m}@var{n}} instruction pattern |
5163 | @item @samp{vec_cmpeq@var{m}@var{n}} | |
5164 | Similar to @code{vec_cmp@var{m}@var{n}} but perform equality or non-equality | |
5165 | vector comparison only. If @code{vec_cmp@var{m}@var{n}} | |
5166 | or @code{vec_cmpu@var{m}@var{n}} instruction pattern is supported, | |
5167 | it will be preferred over @code{vec_cmpeq@var{m}@var{n}}, so there is | |
5168 | no need to define this instruction pattern if the others are supported. | |
5169 | ||
e9e1d143 RG |
5170 | @cindex @code{vcond@var{m}@var{n}} instruction pattern |
5171 | @item @samp{vcond@var{m}@var{n}} | |
5172 | Output a conditional vector move. Operand 0 is the destination to | |
5173 | receive a combination of operand 1 and operand 2, which are of mode @var{m}, | |
12fb875f | 5174 | dependent on the outcome of the predicate in operand 3 which is a signed |
e9e1d143 RG |
5175 | vector comparison with operands of mode @var{n} in operands 4 and 5. The |
5176 | modes @var{m} and @var{n} should have the same size. Operand 0 | |
5177 | will be set to the value @var{op1} & @var{msk} | @var{op2} & ~@var{msk} | |
5178 | where @var{msk} is computed by element-wise evaluation of the vector | |
5179 | comparison with a truth value of all-ones and a false value of all-zeros. | |
5180 | ||
12fb875f IE |
5181 | @cindex @code{vcondu@var{m}@var{n}} instruction pattern |
5182 | @item @samp{vcondu@var{m}@var{n}} | |
5183 | Similar to @code{vcond@var{m}@var{n}} but performs unsigned vector | |
5184 | comparison. | |
5185 | ||
96592eed JJ |
5186 | @cindex @code{vcondeq@var{m}@var{n}} instruction pattern |
5187 | @item @samp{vcondeq@var{m}@var{n}} | |
5188 | Similar to @code{vcond@var{m}@var{n}} but performs equality or | |
5189 | non-equality vector comparison only. If @code{vcond@var{m}@var{n}} | |
5190 | or @code{vcondu@var{m}@var{n}} instruction pattern is supported, | |
5191 | it will be preferred over @code{vcondeq@var{m}@var{n}}, so there is | |
5192 | no need to define this instruction pattern if the others are supported. | |
5193 | ||
12fb875f IE |
5194 | @cindex @code{vcond_mask_@var{m}@var{n}} instruction pattern |
5195 | @item @samp{vcond_mask_@var{m}@var{n}} | |
5196 | Similar to @code{vcond@var{m}@var{n}} but operand 3 holds a pre-computed | |
5197 | result of vector comparison. | |
5198 | ||
5199 | @cindex @code{maskload@var{m}@var{n}} instruction pattern | |
5200 | @item @samp{maskload@var{m}@var{n}} | |
5201 | Perform a masked load of vector from memory operand 1 of mode @var{m} | |
5202 | into register operand 0. Mask is provided in register operand 2 of | |
5203 | mode @var{n}. | |
5204 | ||
a54a5997 RS |
5205 | This pattern is not allowed to @code{FAIL}. |
5206 | ||
12fb875f | 5207 | @cindex @code{maskstore@var{m}@var{n}} instruction pattern |
a54a5997 | 5208 | @item @samp{maskstore@var{m}@var{n}} |
12fb875f IE |
5209 | Perform a masked store of vector from register operand 1 of mode @var{m} |
5210 | into memory operand 0. Mask is provided in register operand 2 of | |
5211 | mode @var{n}. | |
5212 | ||
a54a5997 | 5213 | This pattern is not allowed to @code{FAIL}. |
d496134a KL |
5214 | |
5215 | @cindex @code{len_load_@var{m}} instruction pattern | |
5216 | @item @samp{len_load_@var{m}} | |
5217 | Load the number of vector elements specified by operand 2 from memory | |
5218 | operand 1 into vector register operand 0, setting the other elements of | |
5219 | operand 0 to undefined values. Operands 0 and 1 have mode @var{m}, | |
5220 | which must be a vector mode. Operand 2 has whichever integer mode the | |
5221 | target prefers. If operand 2 exceeds the number of elements in mode | |
5222 | @var{m}, the behavior is undefined. If the target prefers the length | |
5223 | to be measured in bytes rather than elements, it should only implement | |
5224 | this pattern for vectors of @code{QI} elements. | |
5225 | ||
5226 | This pattern is not allowed to @code{FAIL}. | |
5227 | ||
5228 | @cindex @code{len_store_@var{m}} instruction pattern | |
5229 | @item @samp{len_store_@var{m}} | |
5230 | Store the number of vector elements specified by operand 2 from vector | |
5231 | register operand 1 into memory operand 0, leaving the other elements of | |
5232 | operand 0 unchanged. Operands 0 and 1 have mode @var{m}, which must be | |
5233 | a vector mode. Operand 2 has whichever integer mode the target prefers. | |
5234 | If operand 2 exceeds the number of elements in mode @var{m}, the behavior | |
5235 | is undefined. If the target prefers the length to be measured in bytes | |
5236 | rather than elements, it should only implement this pattern for vectors | |
5237 | of @code{QI} elements. | |
5238 | ||
5239 | This pattern is not allowed to @code{FAIL}. | |
a54a5997 | 5240 | |
2205ed25 RH |
5241 | @cindex @code{vec_perm@var{m}} instruction pattern |
5242 | @item @samp{vec_perm@var{m}} | |
5243 | Output a (variable) vector permutation. Operand 0 is the destination | |
5244 | to receive elements from operand 1 and operand 2, which are of mode | |
5245 | @var{m}. Operand 3 is the @dfn{selector}. It is an integral mode | |
5246 | vector of the same width and number of elements as mode @var{m}. | |
5247 | ||
5248 | The input elements are numbered from 0 in operand 1 through | |
5249 | @math{2*@var{N}-1} in operand 2. The elements of the selector must | |
5250 | be computed modulo @math{2*@var{N}}. Note that if | |
5251 | @code{rtx_equal_p(operand1, operand2)}, this can be implemented | |
5252 | with just operand 1 and selector elements modulo @var{N}. | |
5253 | ||
d7943c8b RH |
5254 | In order to make things easy for a number of targets, if there is no |
5255 | @samp{vec_perm} pattern for mode @var{m}, but there is for mode @var{q} | |
5256 | where @var{q} is a vector of @code{QImode} of the same width as @var{m}, | |
5257 | the middle-end will lower the mode @var{m} @code{VEC_PERM_EXPR} to | |
5258 | mode @var{q}. | |
5259 | ||
f151c9e1 RS |
5260 | See also @code{TARGET_VECTORIZER_VEC_PERM_CONST}, which performs |
5261 | the analogous operation for constant selectors. | |
2205ed25 | 5262 | |
759915ca EC |
5263 | @cindex @code{push@var{m}1} instruction pattern |
5264 | @item @samp{push@var{m}1} | |
299c5111 | 5265 | Output a push instruction. Operand 0 is value to push. Used only when |
38f4324c JH |
5266 | @code{PUSH_ROUNDING} is defined. For historical reason, this pattern may be |
5267 | missing and in such case an @code{mov} expander is used instead, with a | |
6e9aac46 | 5268 | @code{MEM} expression forming the push operation. The @code{mov} expander |
38f4324c JH |
5269 | method is deprecated. |
5270 | ||
03dda8e3 RK |
5271 | @cindex @code{add@var{m}3} instruction pattern |
5272 | @item @samp{add@var{m}3} | |
5273 | Add operand 2 and operand 1, storing the result in operand 0. All operands | |
5274 | must have mode @var{m}. This can be used even on two-address machines, by | |
5275 | means of constraints requiring operands 1 and 0 to be the same location. | |
5276 | ||
0f996086 CF |
5277 | @cindex @code{ssadd@var{m}3} instruction pattern |
5278 | @cindex @code{usadd@var{m}3} instruction pattern | |
03dda8e3 | 5279 | @cindex @code{sub@var{m}3} instruction pattern |
0f996086 CF |
5280 | @cindex @code{sssub@var{m}3} instruction pattern |
5281 | @cindex @code{ussub@var{m}3} instruction pattern | |
03dda8e3 | 5282 | @cindex @code{mul@var{m}3} instruction pattern |
0f996086 CF |
5283 | @cindex @code{ssmul@var{m}3} instruction pattern |
5284 | @cindex @code{usmul@var{m}3} instruction pattern | |
03dda8e3 | 5285 | @cindex @code{div@var{m}3} instruction pattern |
0f996086 | 5286 | @cindex @code{ssdiv@var{m}3} instruction pattern |
03dda8e3 | 5287 | @cindex @code{udiv@var{m}3} instruction pattern |
0f996086 | 5288 | @cindex @code{usdiv@var{m}3} instruction pattern |
03dda8e3 RK |
5289 | @cindex @code{mod@var{m}3} instruction pattern |
5290 | @cindex @code{umod@var{m}3} instruction pattern | |
03dda8e3 RK |
5291 | @cindex @code{umin@var{m}3} instruction pattern |
5292 | @cindex @code{umax@var{m}3} instruction pattern | |
5293 | @cindex @code{and@var{m}3} instruction pattern | |
5294 | @cindex @code{ior@var{m}3} instruction pattern | |
5295 | @cindex @code{xor@var{m}3} instruction pattern | |
0f996086 | 5296 | @item @samp{ssadd@var{m}3}, @samp{usadd@var{m}3} |
f457c50c AS |
5297 | @itemx @samp{sub@var{m}3}, @samp{sssub@var{m}3}, @samp{ussub@var{m}3} |
5298 | @itemx @samp{mul@var{m}3}, @samp{ssmul@var{m}3}, @samp{usmul@var{m}3} | |
0f996086 CF |
5299 | @itemx @samp{div@var{m}3}, @samp{ssdiv@var{m}3} |
5300 | @itemx @samp{udiv@var{m}3}, @samp{usdiv@var{m}3} | |
7ae4d8d4 RH |
5301 | @itemx @samp{mod@var{m}3}, @samp{umod@var{m}3} |
5302 | @itemx @samp{umin@var{m}3}, @samp{umax@var{m}3} | |
03dda8e3 RK |
5303 | @itemx @samp{and@var{m}3}, @samp{ior@var{m}3}, @samp{xor@var{m}3} |
5304 | Similar, for other arithmetic operations. | |
7ae4d8d4 | 5305 | |
481efdd9 EB |
5306 | @cindex @code{addv@var{m}4} instruction pattern |
5307 | @item @samp{addv@var{m}4} | |
5308 | Like @code{add@var{m}3} but takes a @code{code_label} as operand 3 and | |
5309 | emits code to jump to it if signed overflow occurs during the addition. | |
5310 | This pattern is used to implement the built-in functions performing | |
5311 | signed integer addition with overflow checking. | |
5312 | ||
5313 | @cindex @code{subv@var{m}4} instruction pattern | |
5314 | @cindex @code{mulv@var{m}4} instruction pattern | |
5315 | @item @samp{subv@var{m}4}, @samp{mulv@var{m}4} | |
5316 | Similar, for other signed arithmetic operations. | |
5317 | ||
cde9d596 RH |
5318 | @cindex @code{uaddv@var{m}4} instruction pattern |
5319 | @item @samp{uaddv@var{m}4} | |
5320 | Like @code{addv@var{m}4} but for unsigned addition. That is to | |
5321 | say, the operation is the same as signed addition but the jump | |
481efdd9 EB |
5322 | is taken only on unsigned overflow. |
5323 | ||
cde9d596 RH |
5324 | @cindex @code{usubv@var{m}4} instruction pattern |
5325 | @cindex @code{umulv@var{m}4} instruction pattern | |
5326 | @item @samp{usubv@var{m}4}, @samp{umulv@var{m}4} | |
5327 | Similar, for other unsigned arithmetic operations. | |
5328 | ||
481efdd9 EB |
5329 | @cindex @code{addptr@var{m}3} instruction pattern |
5330 | @item @samp{addptr@var{m}3} | |
5331 | Like @code{add@var{m}3} but is guaranteed to only be used for address | |
5332 | calculations. The expanded code is not allowed to clobber the | |
5333 | condition code. It only needs to be defined if @code{add@var{m}3} | |
5334 | sets the condition code. If adds used for address calculations and | |
5335 | normal adds are not compatible it is required to expand a distinct | |
630ba2fd | 5336 | pattern (e.g.@: using an unspec). The pattern is used by LRA to emit |
481efdd9 EB |
5337 | address calculations. @code{add@var{m}3} is used if |
5338 | @code{addptr@var{m}3} is not defined. | |
5339 | ||
1b1562a5 MM |
5340 | @cindex @code{fma@var{m}4} instruction pattern |
5341 | @item @samp{fma@var{m}4} | |
5342 | Multiply operand 2 and operand 1, then add operand 3, storing the | |
d6373302 KZ |
5343 | result in operand 0 without doing an intermediate rounding step. All |
5344 | operands must have mode @var{m}. This pattern is used to implement | |
5345 | the @code{fma}, @code{fmaf}, and @code{fmal} builtin functions from | |
5346 | the ISO C99 standard. | |
1b1562a5 | 5347 | |
16949072 RG |
5348 | @cindex @code{fms@var{m}4} instruction pattern |
5349 | @item @samp{fms@var{m}4} | |
5350 | Like @code{fma@var{m}4}, except operand 3 subtracted from the | |
5351 | product instead of added to the product. This is represented | |
5352 | in the rtl as | |
5353 | ||
5354 | @smallexample | |
5355 | (fma:@var{m} @var{op1} @var{op2} (neg:@var{m} @var{op3})) | |
5356 | @end smallexample | |
5357 | ||
5358 | @cindex @code{fnma@var{m}4} instruction pattern | |
5359 | @item @samp{fnma@var{m}4} | |
5360 | Like @code{fma@var{m}4} except that the intermediate product | |
5361 | is negated before being added to operand 3. This is represented | |
5362 | in the rtl as | |
5363 | ||
5364 | @smallexample | |
5365 | (fma:@var{m} (neg:@var{m} @var{op1}) @var{op2} @var{op3}) | |
5366 | @end smallexample | |
5367 | ||
5368 | @cindex @code{fnms@var{m}4} instruction pattern | |
5369 | @item @samp{fnms@var{m}4} | |
5370 | Like @code{fms@var{m}4} except that the intermediate product | |
5371 | is negated before subtracting operand 3. This is represented | |
5372 | in the rtl as | |
5373 | ||
5374 | @smallexample | |
5375 | (fma:@var{m} (neg:@var{m} @var{op1}) @var{op2} (neg:@var{m} @var{op3})) | |
5376 | @end smallexample | |
5377 | ||
b71b019a JH |
5378 | @cindex @code{min@var{m}3} instruction pattern |
5379 | @cindex @code{max@var{m}3} instruction pattern | |
7ae4d8d4 RH |
5380 | @item @samp{smin@var{m}3}, @samp{smax@var{m}3} |
5381 | Signed minimum and maximum operations. When used with floating point, | |
5382 | if both operands are zeros, or if either operand is @code{NaN}, then | |
5383 | it is unspecified which of the two operands is returned as the result. | |
03dda8e3 | 5384 | |
ccb57bb0 DS |
5385 | @cindex @code{fmin@var{m}3} instruction pattern |
5386 | @cindex @code{fmax@var{m}3} instruction pattern | |
5387 | @item @samp{fmin@var{m}3}, @samp{fmax@var{m}3} | |
5388 | IEEE-conformant minimum and maximum operations. If one operand is a quiet | |
5389 | @code{NaN}, then the other operand is returned. If both operands are quiet | |
5390 | @code{NaN}, then a quiet @code{NaN} is returned. In the case when gcc supports | |
18ea359a | 5391 | signaling @code{NaN} (-fsignaling-nans) an invalid floating point exception is |
ccb57bb0 DS |
5392 | raised and a quiet @code{NaN} is returned. |
5393 | ||
a54a5997 RS |
5394 | All operands have mode @var{m}, which is a scalar or vector |
5395 | floating-point mode. These patterns are not allowed to @code{FAIL}. | |
5396 | ||
d43a252e AL |
5397 | @cindex @code{reduc_smin_scal_@var{m}} instruction pattern |
5398 | @cindex @code{reduc_smax_scal_@var{m}} instruction pattern | |
5399 | @item @samp{reduc_smin_scal_@var{m}}, @samp{reduc_smax_scal_@var{m}} | |
5400 | Find the signed minimum/maximum of the elements of a vector. The vector is | |
5401 | operand 1, and operand 0 is the scalar result, with mode equal to the mode of | |
5402 | the elements of the input vector. | |
5403 | ||
5404 | @cindex @code{reduc_umin_scal_@var{m}} instruction pattern | |
5405 | @cindex @code{reduc_umax_scal_@var{m}} instruction pattern | |
5406 | @item @samp{reduc_umin_scal_@var{m}}, @samp{reduc_umax_scal_@var{m}} | |
5407 | Find the unsigned minimum/maximum of the elements of a vector. The vector is | |
5408 | operand 1, and operand 0 is the scalar result, with mode equal to the mode of | |
5409 | the elements of the input vector. | |
5410 | ||
e32b9eb3 RS |
5411 | @cindex @code{reduc_fmin_scal_@var{m}} instruction pattern |
5412 | @cindex @code{reduc_fmax_scal_@var{m}} instruction pattern | |
5413 | @item @samp{reduc_fmin_scal_@var{m}}, @samp{reduc_fmax_scal_@var{m}} | |
5414 | Find the floating-point minimum/maximum of the elements of a vector, | |
5415 | using the same rules as @code{fmin@var{m}3} and @code{fmax@var{m}3}. | |
5416 | Operand 1 is a vector of mode @var{m} and operand 0 is the scalar | |
5417 | result, which has mode @code{GET_MODE_INNER (@var{m})}. | |
5418 | ||
d43a252e AL |
5419 | @cindex @code{reduc_plus_scal_@var{m}} instruction pattern |
5420 | @item @samp{reduc_plus_scal_@var{m}} | |
5421 | Compute the sum of the elements of a vector. The vector is operand 1, and | |
5422 | operand 0 is the scalar result, with mode equal to the mode of the elements of | |
5423 | the input vector. | |
61abee65 | 5424 | |
898f07b0 RS |
5425 | @cindex @code{reduc_and_scal_@var{m}} instruction pattern |
5426 | @item @samp{reduc_and_scal_@var{m}} | |
5427 | @cindex @code{reduc_ior_scal_@var{m}} instruction pattern | |
5428 | @itemx @samp{reduc_ior_scal_@var{m}} | |
5429 | @cindex @code{reduc_xor_scal_@var{m}} instruction pattern | |
5430 | @itemx @samp{reduc_xor_scal_@var{m}} | |
5431 | Compute the bitwise @code{AND}/@code{IOR}/@code{XOR} reduction of the elements | |
5432 | of a vector of mode @var{m}. Operand 1 is the vector input and operand 0 | |
5433 | is the scalar result. The mode of the scalar result is the same as one | |
5434 | element of @var{m}. | |
5435 | ||
bfe1bb57 RS |
5436 | @cindex @code{extract_last_@var{m}} instruction pattern |
5437 | @item @code{extract_last_@var{m}} | |
5438 | Find the last set bit in mask operand 1 and extract the associated element | |
5439 | of vector operand 2. Store the result in scalar operand 0. Operand 2 | |
5440 | has vector mode @var{m} while operand 0 has the mode appropriate for one | |
5441 | element of @var{m}. Operand 1 has the usual mask mode for vectors of mode | |
5442 | @var{m}; see @code{TARGET_VECTORIZE_GET_MASK_MODE}. | |
5443 | ||
bb6c2b68 RS |
5444 | @cindex @code{fold_extract_last_@var{m}} instruction pattern |
5445 | @item @code{fold_extract_last_@var{m}} | |
5446 | If any bits of mask operand 2 are set, find the last set bit, extract | |
5447 | the associated element from vector operand 3, and store the result | |
5448 | in operand 0. Store operand 1 in operand 0 otherwise. Operand 3 | |
5449 | has mode @var{m} and operands 0 and 1 have the mode appropriate for | |
5450 | one element of @var{m}. Operand 2 has the usual mask mode for vectors | |
5451 | of mode @var{m}; see @code{TARGET_VECTORIZE_GET_MASK_MODE}. | |
5452 | ||
b781a135 RS |
5453 | @cindex @code{fold_left_plus_@var{m}} instruction pattern |
5454 | @item @code{fold_left_plus_@var{m}} | |
5455 | Take scalar operand 1 and successively add each element from vector | |
5456 | operand 2. Store the result in scalar operand 0. The vector has | |
5457 | mode @var{m} and the scalars have the mode appropriate for one | |
5458 | element of @var{m}. The operation is strictly in-order: there is | |
5459 | no reassociation. | |
5460 | ||
bce29d65 AM |
5461 | @cindex @code{mask_fold_left_plus_@var{m}} instruction pattern |
5462 | @item @code{mask_fold_left_plus_@var{m}} | |
5463 | Like @samp{fold_left_plus_@var{m}}, but takes an additional mask operand | |
5464 | (operand 3) that specifies which elements of the source vector should be added. | |
5465 | ||
20f06221 DN |
5466 | @cindex @code{sdot_prod@var{m}} instruction pattern |
5467 | @item @samp{sdot_prod@var{m}} | |
ab0a6b21 TC |
5468 | |
5469 | Compute the sum of the products of two signed elements. | |
5470 | Operand 1 and operand 2 are of the same mode. Their | |
5471 | product, which is of a wider mode, is computed and added to operand 3. | |
5472 | Operand 3 is of a mode equal or wider than the mode of the product. The | |
5473 | result is placed in operand 0, which is of the same mode as operand 3. | |
5474 | ||
5475 | Semantically the expressions perform the multiplication in the following signs | |
5476 | ||
5477 | @smallexample | |
5478 | sdot<signed op0, signed op1, signed op2, signed op3> == | |
5479 | op0 = sign-ext (op1) * sign-ext (op2) + op3 | |
5480 | @dots{} | |
5481 | @end smallexample | |
5482 | ||
20f06221 | 5483 | @cindex @code{udot_prod@var{m}} instruction pattern |
ab0a6b21 TC |
5484 | @item @samp{udot_prod@var{m}} |
5485 | ||
5486 | Compute the sum of the products of two unsigned elements. | |
5487 | Operand 1 and operand 2 are of the same mode. Their | |
5488 | product, which is of a wider mode, is computed and added to operand 3. | |
5489 | Operand 3 is of a mode equal or wider than the mode of the product. The | |
5490 | result is placed in operand 0, which is of the same mode as operand 3. | |
5491 | ||
5492 | Semantically the expressions perform the multiplication in the following signs | |
5493 | ||
5494 | @smallexample | |
5495 | udot<unsigned op0, unsigned op1, unsigned op2, unsigned op3> == | |
5496 | op0 = zero-ext (op1) * zero-ext (op2) + op3 | |
5497 | @dots{} | |
5498 | @end smallexample | |
5499 | ||
5500 | @cindex @code{usdot_prod@var{m}} instruction pattern | |
5501 | @item @samp{usdot_prod@var{m}} | |
5502 | Compute the sum of the products of elements of different signs. | |
5503 | Operand 1 must be unsigned and operand 2 signed. Their | |
5504 | product, which is of a wider mode, is computed and added to operand 3. | |
5505 | Operand 3 is of a mode equal or wider than the mode of the product. The | |
5506 | result is placed in operand 0, which is of the same mode as operand 3. | |
5507 | ||
5508 | Semantically the expressions perform the multiplication in the following signs | |
5509 | ||
5510 | @smallexample | |
5511 | usdot<signed op0, unsigned op1, signed op2, signed op3> == | |
5512 | op0 = ((signed-conv) zero-ext (op1)) * sign-ext (op2) + op3 | |
5513 | @dots{} | |
5514 | @end smallexample | |
20f06221 | 5515 | |
79d652a5 CH |
5516 | @cindex @code{ssad@var{m}} instruction pattern |
5517 | @item @samp{ssad@var{m}} | |
5518 | @cindex @code{usad@var{m}} instruction pattern | |
5519 | @item @samp{usad@var{m}} | |
5520 | Compute the sum of absolute differences of two signed/unsigned elements. | |
5521 | Operand 1 and operand 2 are of the same mode. Their absolute difference, which | |
5522 | is of a wider mode, is computed and added to operand 3. Operand 3 is of a mode | |
5523 | equal or wider than the mode of the absolute difference. The result is placed | |
5524 | in operand 0, which is of the same mode as operand 3. | |
5525 | ||
97532d1a MC |
5526 | @cindex @code{widen_ssum@var{m3}} instruction pattern |
5527 | @item @samp{widen_ssum@var{m3}} | |
5528 | @cindex @code{widen_usum@var{m3}} instruction pattern | |
5529 | @itemx @samp{widen_usum@var{m3}} | |
ff2ce160 | 5530 | Operands 0 and 2 are of the same mode, which is wider than the mode of |
20f06221 DN |
5531 | operand 1. Add operand 1 to operand 2 and place the widened result in |
5532 | operand 0. (This is used express accumulation of elements into an accumulator | |
5533 | of a wider mode.) | |
5534 | ||
58cc9876 YW |
5535 | @cindex @code{smulhs@var{m3}} instruction pattern |
5536 | @item @samp{smulhs@var{m3}} | |
5537 | @cindex @code{umulhs@var{m3}} instruction pattern | |
5538 | @itemx @samp{umulhs@var{m3}} | |
5539 | Signed/unsigned multiply high with scale. This is equivalent to the C code: | |
5540 | @smallexample | |
5541 | narrow op0, op1, op2; | |
5542 | @dots{} | |
5543 | op0 = (narrow) (((wide) op1 * (wide) op2) >> (N / 2 - 1)); | |
5544 | @end smallexample | |
5545 | where the sign of @samp{narrow} determines whether this is a signed | |
5546 | or unsigned operation, and @var{N} is the size of @samp{wide} in bits. | |
5547 | ||
5548 | @cindex @code{smulhrs@var{m3}} instruction pattern | |
5549 | @item @samp{smulhrs@var{m3}} | |
5550 | @cindex @code{umulhrs@var{m3}} instruction pattern | |
5551 | @itemx @samp{umulhrs@var{m3}} | |
5552 | Signed/unsigned multiply high with round and scale. This is | |
5553 | equivalent to the C code: | |
5554 | @smallexample | |
5555 | narrow op0, op1, op2; | |
5556 | @dots{} | |
5557 | op0 = (narrow) (((((wide) op1 * (wide) op2) >> (N / 2 - 2)) + 1) >> 1); | |
5558 | @end smallexample | |
5559 | where the sign of @samp{narrow} determines whether this is a signed | |
5560 | or unsigned operation, and @var{N} is the size of @samp{wide} in bits. | |
5561 | ||
c0c2f013 YW |
5562 | @cindex @code{sdiv_pow2@var{m3}} instruction pattern |
5563 | @item @samp{sdiv_pow2@var{m3}} | |
5564 | @cindex @code{sdiv_pow2@var{m3}} instruction pattern | |
5565 | @itemx @samp{sdiv_pow2@var{m3}} | |
5566 | Signed division by power-of-2 immediate. Equivalent to: | |
5567 | @smallexample | |
5568 | signed op0, op1; | |
5569 | @dots{} | |
5570 | op0 = op1 / (1 << imm); | |
5571 | @end smallexample | |
5572 | ||
f1739b48 RS |
5573 | @cindex @code{vec_shl_insert_@var{m}} instruction pattern |
5574 | @item @samp{vec_shl_insert_@var{m}} | |
630ba2fd | 5575 | Shift the elements in vector input operand 1 left one element (i.e.@: |
f1739b48 RS |
5576 | away from element 0) and fill the vacated element 0 with the scalar |
5577 | in operand 2. Store the result in vector output operand 0. Operands | |
5578 | 0 and 1 have mode @var{m} and operand 2 has the mode appropriate for | |
5579 | one element of @var{m}. | |
5580 | ||
2e83f583 JJ |
5581 | @cindex @code{vec_shl_@var{m}} instruction pattern |
5582 | @item @samp{vec_shl_@var{m}} | |
5583 | Whole vector left shift in bits, i.e.@: away from element 0. | |
5584 | Operand 1 is a vector to be shifted. | |
5585 | Operand 2 is an integer shift amount in bits. | |
5586 | Operand 0 is where the resulting shifted vector is stored. | |
5587 | The output and input vectors should have the same modes. | |
5588 | ||
61abee65 | 5589 | @cindex @code{vec_shr_@var{m}} instruction pattern |
e29dfbf0 | 5590 | @item @samp{vec_shr_@var{m}} |
630ba2fd | 5591 | Whole vector right shift in bits, i.e.@: towards element 0. |
61abee65 | 5592 | Operand 1 is a vector to be shifted. |
759915ca | 5593 | Operand 2 is an integer shift amount in bits. |
61abee65 DN |
5594 | Operand 0 is where the resulting shifted vector is stored. |
5595 | The output and input vectors should have the same modes. | |
5596 | ||
8115817b UB |
5597 | @cindex @code{vec_pack_trunc_@var{m}} instruction pattern |
5598 | @item @samp{vec_pack_trunc_@var{m}} | |
5599 | Narrow (demote) and merge the elements of two vectors. Operands 1 and 2 | |
5600 | are vectors of the same mode having N integral or floating point elements | |
0ee2ea09 | 5601 | of size S@. Operand 0 is the resulting vector in which 2*N elements of |
bd2d1b3d | 5602 | size S/2 are concatenated after narrowing them down using truncation. |
8115817b | 5603 | |
4714942e JJ |
5604 | @cindex @code{vec_pack_sbool_trunc_@var{m}} instruction pattern |
5605 | @item @samp{vec_pack_sbool_trunc_@var{m}} | |
5606 | Narrow and merge the elements of two vectors. Operands 1 and 2 are vectors | |
5607 | of the same type having N boolean elements. Operand 0 is the resulting | |
5608 | vector in which 2*N elements are concatenated. The last operand (operand 3) | |
5609 | is the number of elements in the output vector 2*N as a @code{CONST_INT}. | |
5610 | This instruction pattern is used when all the vector input and output | |
5611 | operands have the same scalar mode @var{m} and thus using | |
5612 | @code{vec_pack_trunc_@var{m}} would be ambiguous. | |
5613 | ||
89d67cca DN |
5614 | @cindex @code{vec_pack_ssat_@var{m}} instruction pattern |
5615 | @cindex @code{vec_pack_usat_@var{m}} instruction pattern | |
8115817b UB |
5616 | @item @samp{vec_pack_ssat_@var{m}}, @samp{vec_pack_usat_@var{m}} |
5617 | Narrow (demote) and merge the elements of two vectors. Operands 1 and 2 | |
5618 | are vectors of the same mode having N integral elements of size S. | |
89d67cca | 5619 | Operand 0 is the resulting vector in which the elements of the two input |
8115817b UB |
5620 | vectors are concatenated after narrowing them down using signed/unsigned |
5621 | saturating arithmetic. | |
89d67cca | 5622 | |
d9987fb4 UB |
5623 | @cindex @code{vec_pack_sfix_trunc_@var{m}} instruction pattern |
5624 | @cindex @code{vec_pack_ufix_trunc_@var{m}} instruction pattern | |
5625 | @item @samp{vec_pack_sfix_trunc_@var{m}}, @samp{vec_pack_ufix_trunc_@var{m}} | |
5626 | Narrow, convert to signed/unsigned integral type and merge the elements | |
5627 | of two vectors. Operands 1 and 2 are vectors of the same mode having N | |
0ee2ea09 | 5628 | floating point elements of size S@. Operand 0 is the resulting vector |
bd2d1b3d | 5629 | in which 2*N elements of size S/2 are concatenated. |
d9987fb4 | 5630 | |
1bda738b JJ |
5631 | @cindex @code{vec_packs_float_@var{m}} instruction pattern |
5632 | @cindex @code{vec_packu_float_@var{m}} instruction pattern | |
5633 | @item @samp{vec_packs_float_@var{m}}, @samp{vec_packu_float_@var{m}} | |
5634 | Narrow, convert to floating point type and merge the elements | |
5635 | of two vectors. Operands 1 and 2 are vectors of the same mode having N | |
5636 | signed/unsigned integral elements of size S@. Operand 0 is the resulting vector | |
bd2d1b3d | 5637 | in which 2*N elements of size S/2 are concatenated. |
1bda738b | 5638 | |
89d67cca DN |
5639 | @cindex @code{vec_unpacks_hi_@var{m}} instruction pattern |
5640 | @cindex @code{vec_unpacks_lo_@var{m}} instruction pattern | |
8115817b UB |
5641 | @item @samp{vec_unpacks_hi_@var{m}}, @samp{vec_unpacks_lo_@var{m}} |
5642 | Extract and widen (promote) the high/low part of a vector of signed | |
5643 | integral or floating point elements. The input vector (operand 1) has N | |
0ee2ea09 | 5644 | elements of size S@. Widen (promote) the high/low elements of the vector |
8115817b UB |
5645 | using signed or floating point extension and place the resulting N/2 |
5646 | values of size 2*S in the output vector (operand 0). | |
5647 | ||
89d67cca DN |
5648 | @cindex @code{vec_unpacku_hi_@var{m}} instruction pattern |
5649 | @cindex @code{vec_unpacku_lo_@var{m}} instruction pattern | |
8115817b UB |
5650 | @item @samp{vec_unpacku_hi_@var{m}}, @samp{vec_unpacku_lo_@var{m}} |
5651 | Extract and widen (promote) the high/low part of a vector of unsigned | |
5652 | integral elements. The input vector (operand 1) has N elements of size S. | |
5653 | Widen (promote) the high/low elements of the vector using zero extension and | |
5654 | place the resulting N/2 values of size 2*S in the output vector (operand 0). | |
89d67cca | 5655 | |
4714942e JJ |
5656 | @cindex @code{vec_unpacks_sbool_hi_@var{m}} instruction pattern |
5657 | @cindex @code{vec_unpacks_sbool_lo_@var{m}} instruction pattern | |
5658 | @item @samp{vec_unpacks_sbool_hi_@var{m}}, @samp{vec_unpacks_sbool_lo_@var{m}} | |
5659 | Extract the high/low part of a vector of boolean elements that have scalar | |
5660 | mode @var{m}. The input vector (operand 1) has N elements, the output | |
5661 | vector (operand 0) has N/2 elements. The last operand (operand 2) is the | |
5662 | number of elements of the input vector N as a @code{CONST_INT}. These | |
5663 | patterns are used if both the input and output vectors have the same scalar | |
5664 | mode @var{m} and thus using @code{vec_unpacks_hi_@var{m}} or | |
5665 | @code{vec_unpacks_lo_@var{m}} would be ambiguous. | |
5666 | ||
d9987fb4 UB |
5667 | @cindex @code{vec_unpacks_float_hi_@var{m}} instruction pattern |
5668 | @cindex @code{vec_unpacks_float_lo_@var{m}} instruction pattern | |
5669 | @cindex @code{vec_unpacku_float_hi_@var{m}} instruction pattern | |
5670 | @cindex @code{vec_unpacku_float_lo_@var{m}} instruction pattern | |
5671 | @item @samp{vec_unpacks_float_hi_@var{m}}, @samp{vec_unpacks_float_lo_@var{m}} | |
5672 | @itemx @samp{vec_unpacku_float_hi_@var{m}}, @samp{vec_unpacku_float_lo_@var{m}} | |
5673 | Extract, convert to floating point type and widen the high/low part of a | |
5674 | vector of signed/unsigned integral elements. The input vector (operand 1) | |
0ee2ea09 | 5675 | has N elements of size S@. Convert the high/low elements of the vector using |
d9987fb4 UB |
5676 | floating point conversion and place the resulting N/2 values of size 2*S in |
5677 | the output vector (operand 0). | |
5678 | ||
1bda738b JJ |
5679 | @cindex @code{vec_unpack_sfix_trunc_hi_@var{m}} instruction pattern |
5680 | @cindex @code{vec_unpack_sfix_trunc_lo_@var{m}} instruction pattern | |
5681 | @cindex @code{vec_unpack_ufix_trunc_hi_@var{m}} instruction pattern | |
5682 | @cindex @code{vec_unpack_ufix_trunc_lo_@var{m}} instruction pattern | |
5683 | @item @samp{vec_unpack_sfix_trunc_hi_@var{m}}, | |
5684 | @itemx @samp{vec_unpack_sfix_trunc_lo_@var{m}} | |
5685 | @itemx @samp{vec_unpack_ufix_trunc_hi_@var{m}} | |
5686 | @itemx @samp{vec_unpack_ufix_trunc_lo_@var{m}} | |
5687 | Extract, convert to signed/unsigned integer type and widen the high/low part of a | |
5688 | vector of floating point elements. The input vector (operand 1) | |
5689 | has N elements of size S@. Convert the high/low elements of the vector | |
5690 | to integers and place the resulting N/2 values of size 2*S in | |
5691 | the output vector (operand 0). | |
5692 | ||
89d67cca | 5693 | @cindex @code{vec_widen_umult_hi_@var{m}} instruction pattern |
3f30a9a6 | 5694 | @cindex @code{vec_widen_umult_lo_@var{m}} instruction pattern |
89d67cca DN |
5695 | @cindex @code{vec_widen_smult_hi_@var{m}} instruction pattern |
5696 | @cindex @code{vec_widen_smult_lo_@var{m}} instruction pattern | |
3f30a9a6 RH |
5697 | @cindex @code{vec_widen_umult_even_@var{m}} instruction pattern |
5698 | @cindex @code{vec_widen_umult_odd_@var{m}} instruction pattern | |
5699 | @cindex @code{vec_widen_smult_even_@var{m}} instruction pattern | |
5700 | @cindex @code{vec_widen_smult_odd_@var{m}} instruction pattern | |
d9987fb4 UB |
5701 | @item @samp{vec_widen_umult_hi_@var{m}}, @samp{vec_widen_umult_lo_@var{m}} |
5702 | @itemx @samp{vec_widen_smult_hi_@var{m}}, @samp{vec_widen_smult_lo_@var{m}} | |
3f30a9a6 RH |
5703 | @itemx @samp{vec_widen_umult_even_@var{m}}, @samp{vec_widen_umult_odd_@var{m}} |
5704 | @itemx @samp{vec_widen_smult_even_@var{m}}, @samp{vec_widen_smult_odd_@var{m}} | |
8115817b | 5705 | Signed/Unsigned widening multiplication. The two inputs (operands 1 and 2) |
0ee2ea09 | 5706 | are vectors with N signed/unsigned elements of size S@. Multiply the high/low |
3f30a9a6 | 5707 | or even/odd elements of the two vectors, and put the N/2 products of size 2*S |
4a271b7e BM |
5708 | in the output vector (operand 0). A target shouldn't implement even/odd pattern |
5709 | pair if it is less efficient than lo/hi one. | |
89d67cca | 5710 | |
36ba4aae IR |
5711 | @cindex @code{vec_widen_ushiftl_hi_@var{m}} instruction pattern |
5712 | @cindex @code{vec_widen_ushiftl_lo_@var{m}} instruction pattern | |
5713 | @cindex @code{vec_widen_sshiftl_hi_@var{m}} instruction pattern | |
5714 | @cindex @code{vec_widen_sshiftl_lo_@var{m}} instruction pattern | |
5715 | @item @samp{vec_widen_ushiftl_hi_@var{m}}, @samp{vec_widen_ushiftl_lo_@var{m}} | |
5716 | @itemx @samp{vec_widen_sshiftl_hi_@var{m}}, @samp{vec_widen_sshiftl_lo_@var{m}} | |
5717 | Signed/Unsigned widening shift left. The first input (operand 1) is a vector | |
5718 | with N signed/unsigned elements of size S@. Operand 2 is a constant. Shift | |
5719 | the high/low elements of operand 1, and put the N/2 results of size 2*S in the | |
5720 | output vector (operand 0). | |
5721 | ||
9fc9573f JH |
5722 | @cindex @code{vec_widen_saddl_hi_@var{m}} instruction pattern |
5723 | @cindex @code{vec_widen_saddl_lo_@var{m}} instruction pattern | |
5724 | @cindex @code{vec_widen_uaddl_hi_@var{m}} instruction pattern | |
5725 | @cindex @code{vec_widen_uaddl_lo_@var{m}} instruction pattern | |
5726 | @item @samp{vec_widen_uaddl_hi_@var{m}}, @samp{vec_widen_uaddl_lo_@var{m}} | |
5727 | @itemx @samp{vec_widen_saddl_hi_@var{m}}, @samp{vec_widen_saddl_lo_@var{m}} | |
5728 | Signed/Unsigned widening add long. Operands 1 and 2 are vectors with N | |
5729 | signed/unsigned elements of size S@. Add the high/low elements of 1 and 2 | |
5730 | together, widen the resulting elements and put the N/2 results of size 2*S in | |
5731 | the output vector (operand 0). | |
5732 | ||
5733 | @cindex @code{vec_widen_ssubl_hi_@var{m}} instruction pattern | |
5734 | @cindex @code{vec_widen_ssubl_lo_@var{m}} instruction pattern | |
5735 | @cindex @code{vec_widen_usubl_hi_@var{m}} instruction pattern | |
5736 | @cindex @code{vec_widen_usubl_lo_@var{m}} instruction pattern | |
5737 | @item @samp{vec_widen_usubl_hi_@var{m}}, @samp{vec_widen_usubl_lo_@var{m}} | |
5738 | @itemx @samp{vec_widen_ssubl_hi_@var{m}}, @samp{vec_widen_ssubl_lo_@var{m}} | |
5739 | Signed/Unsigned widening subtract long. Operands 1 and 2 are vectors with N | |
5740 | signed/unsigned elements of size S@. Subtract the high/low elements of 2 from | |
5741 | 1 and widen the resulting elements. Put the N/2 results of size 2*S in the | |
5742 | output vector (operand 0). | |
5743 | ||
7a6c31f0 RB |
5744 | @cindex @code{vec_addsub@var{m}3} instruction pattern |
5745 | @item @samp{vec_addsub@var{m}3} | |
5746 | Alternating subtract, add with even lanes doing subtract and odd | |
5747 | lanes doing addition. Operands 1 and 2 and the outout operand are vectors | |
5748 | with mode @var{m}. | |
5749 | ||
7d810646 RB |
5750 | @cindex @code{vec_fmaddsub@var{m}4} instruction pattern |
5751 | @item @samp{vec_fmaddsub@var{m}4} | |
5752 | Alternating multiply subtract, add with even lanes doing subtract and odd | |
5753 | lanes doing addition of the third operand to the multiplication result | |
5754 | of the first two operands. Operands 1, 2 and 3 and the outout operand are vectors | |
5755 | with mode @var{m}. | |
5756 | ||
5757 | @cindex @code{vec_fmsubadd@var{m}4} instruction pattern | |
5758 | @item @samp{vec_fmsubadd@var{m}4} | |
5759 | Alternating multiply add, subtract with even lanes doing addition and odd | |
5760 | lanes doing subtraction of the third operand to the multiplication result | |
5761 | of the first two operands. Operands 1, 2 and 3 and the outout operand are vectors | |
5762 | with mode @var{m}. | |
5763 | ||
7a6c31f0 RB |
5764 | These instructions are not allowed to @code{FAIL}. |
5765 | ||
03dda8e3 RK |
5766 | @cindex @code{mulhisi3} instruction pattern |
5767 | @item @samp{mulhisi3} | |
5768 | Multiply operands 1 and 2, which have mode @code{HImode}, and store | |
5769 | a @code{SImode} product in operand 0. | |
5770 | ||
5771 | @cindex @code{mulqihi3} instruction pattern | |
5772 | @cindex @code{mulsidi3} instruction pattern | |
5773 | @item @samp{mulqihi3}, @samp{mulsidi3} | |
5774 | Similar widening-multiplication instructions of other widths. | |
5775 | ||
5776 | @cindex @code{umulqihi3} instruction pattern | |
5777 | @cindex @code{umulhisi3} instruction pattern | |
5778 | @cindex @code{umulsidi3} instruction pattern | |
5779 | @item @samp{umulqihi3}, @samp{umulhisi3}, @samp{umulsidi3} | |
5780 | Similar widening-multiplication instructions that do unsigned | |
5781 | multiplication. | |
5782 | ||
8b44057d BS |
5783 | @cindex @code{usmulqihi3} instruction pattern |
5784 | @cindex @code{usmulhisi3} instruction pattern | |
5785 | @cindex @code{usmulsidi3} instruction pattern | |
5786 | @item @samp{usmulqihi3}, @samp{usmulhisi3}, @samp{usmulsidi3} | |
5787 | Similar widening-multiplication instructions that interpret the first | |
5788 | operand as unsigned and the second operand as signed, then do a signed | |
5789 | multiplication. | |
5790 | ||
03dda8e3 | 5791 | @cindex @code{smul@var{m}3_highpart} instruction pattern |
759c58af | 5792 | @item @samp{smul@var{m}3_highpart} |
03dda8e3 RK |
5793 | Perform a signed multiplication of operands 1 and 2, which have mode |
5794 | @var{m}, and store the most significant half of the product in operand 0. | |
555fa354 RS |
5795 | The least significant half of the product is discarded. This may be |
5796 | represented in RTL using a @code{smul_highpart} RTX expression. | |
03dda8e3 RK |
5797 | |
5798 | @cindex @code{umul@var{m}3_highpart} instruction pattern | |
5799 | @item @samp{umul@var{m}3_highpart} | |
555fa354 RS |
5800 | Similar, but the multiplication is unsigned. This may be represented |
5801 | in RTL using an @code{umul_highpart} RTX expression. | |
03dda8e3 | 5802 | |
7f9844ca RS |
5803 | @cindex @code{madd@var{m}@var{n}4} instruction pattern |
5804 | @item @samp{madd@var{m}@var{n}4} | |
5805 | Multiply operands 1 and 2, sign-extend them to mode @var{n}, add | |
5806 | operand 3, and store the result in operand 0. Operands 1 and 2 | |
5807 | have mode @var{m} and operands 0 and 3 have mode @var{n}. | |
0f996086 | 5808 | Both modes must be integer or fixed-point modes and @var{n} must be twice |
7f9844ca RS |
5809 | the size of @var{m}. |
5810 | ||
5811 | In other words, @code{madd@var{m}@var{n}4} is like | |
5812 | @code{mul@var{m}@var{n}3} except that it also adds operand 3. | |
5813 | ||
5814 | These instructions are not allowed to @code{FAIL}. | |
5815 | ||
5816 | @cindex @code{umadd@var{m}@var{n}4} instruction pattern | |
5817 | @item @samp{umadd@var{m}@var{n}4} | |
5818 | Like @code{madd@var{m}@var{n}4}, but zero-extend the multiplication | |
5819 | operands instead of sign-extending them. | |
5820 | ||
0f996086 CF |
5821 | @cindex @code{ssmadd@var{m}@var{n}4} instruction pattern |
5822 | @item @samp{ssmadd@var{m}@var{n}4} | |
5823 | Like @code{madd@var{m}@var{n}4}, but all involved operations must be | |
5824 | signed-saturating. | |
5825 | ||
5826 | @cindex @code{usmadd@var{m}@var{n}4} instruction pattern | |
5827 | @item @samp{usmadd@var{m}@var{n}4} | |
5828 | Like @code{umadd@var{m}@var{n}4}, but all involved operations must be | |
5829 | unsigned-saturating. | |
5830 | ||
14661f36 CF |
5831 | @cindex @code{msub@var{m}@var{n}4} instruction pattern |
5832 | @item @samp{msub@var{m}@var{n}4} | |
5833 | Multiply operands 1 and 2, sign-extend them to mode @var{n}, subtract the | |
5834 | result from operand 3, and store the result in operand 0. Operands 1 and 2 | |
5835 | have mode @var{m} and operands 0 and 3 have mode @var{n}. | |
0f996086 | 5836 | Both modes must be integer or fixed-point modes and @var{n} must be twice |
14661f36 CF |
5837 | the size of @var{m}. |
5838 | ||
5839 | In other words, @code{msub@var{m}@var{n}4} is like | |
5840 | @code{mul@var{m}@var{n}3} except that it also subtracts the result | |
5841 | from operand 3. | |
5842 | ||
5843 | These instructions are not allowed to @code{FAIL}. | |
5844 | ||
5845 | @cindex @code{umsub@var{m}@var{n}4} instruction pattern | |
5846 | @item @samp{umsub@var{m}@var{n}4} | |
5847 | Like @code{msub@var{m}@var{n}4}, but zero-extend the multiplication | |
5848 | operands instead of sign-extending them. | |
5849 | ||
0f996086 CF |
5850 | @cindex @code{ssmsub@var{m}@var{n}4} instruction pattern |
5851 | @item @samp{ssmsub@var{m}@var{n}4} | |
5852 | Like @code{msub@var{m}@var{n}4}, but all involved operations must be | |
5853 | signed-saturating. | |
5854 | ||
5855 | @cindex @code{usmsub@var{m}@var{n}4} instruction pattern | |
5856 | @item @samp{usmsub@var{m}@var{n}4} | |
5857 | Like @code{umsub@var{m}@var{n}4}, but all involved operations must be | |
5858 | unsigned-saturating. | |
5859 | ||
03dda8e3 RK |
5860 | @cindex @code{divmod@var{m}4} instruction pattern |
5861 | @item @samp{divmod@var{m}4} | |
5862 | Signed division that produces both a quotient and a remainder. | |
5863 | Operand 1 is divided by operand 2 to produce a quotient stored | |
5864 | in operand 0 and a remainder stored in operand 3. | |
5865 | ||
5866 | For machines with an instruction that produces both a quotient and a | |
5867 | remainder, provide a pattern for @samp{divmod@var{m}4} but do not | |
5868 | provide patterns for @samp{div@var{m}3} and @samp{mod@var{m}3}. This | |
5869 | allows optimization in the relatively common case when both the quotient | |
5870 | and remainder are computed. | |
5871 | ||
5872 | If an instruction that just produces a quotient or just a remainder | |
5873 | exists and is more efficient than the instruction that produces both, | |
5874 | write the output routine of @samp{divmod@var{m}4} to call | |
5875 | @code{find_reg_note} and look for a @code{REG_UNUSED} note on the | |
5876 | quotient or remainder and generate the appropriate instruction. | |
5877 | ||
5878 | @cindex @code{udivmod@var{m}4} instruction pattern | |
5879 | @item @samp{udivmod@var{m}4} | |
5880 | Similar, but does unsigned division. | |
5881 | ||
273a2526 | 5882 | @anchor{shift patterns} |
03dda8e3 | 5883 | @cindex @code{ashl@var{m}3} instruction pattern |
0f996086 CF |
5884 | @cindex @code{ssashl@var{m}3} instruction pattern |
5885 | @cindex @code{usashl@var{m}3} instruction pattern | |
5886 | @item @samp{ashl@var{m}3}, @samp{ssashl@var{m}3}, @samp{usashl@var{m}3} | |
03dda8e3 RK |
5887 | Arithmetic-shift operand 1 left by a number of bits specified by operand |
5888 | 2, and store the result in operand 0. Here @var{m} is the mode of | |
5889 | operand 0 and operand 1; operand 2's mode is specified by the | |
5890 | instruction pattern, and the compiler will convert the operand to that | |
78250306 JJ |
5891 | mode before generating the instruction. The shift or rotate expander |
5892 | or instruction pattern should explicitly specify the mode of the operand 2, | |
5893 | it should never be @code{VOIDmode}. The meaning of out-of-range shift | |
273a2526 | 5894 | counts can optionally be specified by @code{TARGET_SHIFT_TRUNCATION_MASK}. |
71d46ca5 | 5895 | @xref{TARGET_SHIFT_TRUNCATION_MASK}. Operand 2 is always a scalar type. |
03dda8e3 RK |
5896 | |
5897 | @cindex @code{ashr@var{m}3} instruction pattern | |
5898 | @cindex @code{lshr@var{m}3} instruction pattern | |
5899 | @cindex @code{rotl@var{m}3} instruction pattern | |
5900 | @cindex @code{rotr@var{m}3} instruction pattern | |
5901 | @item @samp{ashr@var{m}3}, @samp{lshr@var{m}3}, @samp{rotl@var{m}3}, @samp{rotr@var{m}3} | |
5902 | Other shift and rotate instructions, analogous to the | |
71d46ca5 MM |
5903 | @code{ashl@var{m}3} instructions. Operand 2 is always a scalar type. |
5904 | ||
5905 | @cindex @code{vashl@var{m}3} instruction pattern | |
5906 | @cindex @code{vashr@var{m}3} instruction pattern | |
5907 | @cindex @code{vlshr@var{m}3} instruction pattern | |
5908 | @cindex @code{vrotl@var{m}3} instruction pattern | |
5909 | @cindex @code{vrotr@var{m}3} instruction pattern | |
5910 | @item @samp{vashl@var{m}3}, @samp{vashr@var{m}3}, @samp{vlshr@var{m}3}, @samp{vrotl@var{m}3}, @samp{vrotr@var{m}3} | |
5911 | Vector shift and rotate instructions that take vectors as operand 2 | |
5912 | instead of a scalar type. | |
03dda8e3 | 5913 | |
0267732b RS |
5914 | @cindex @code{avg@var{m}3_floor} instruction pattern |
5915 | @cindex @code{uavg@var{m}3_floor} instruction pattern | |
5916 | @item @samp{avg@var{m}3_floor} | |
5917 | @itemx @samp{uavg@var{m}3_floor} | |
5918 | Signed and unsigned average instructions. These instructions add | |
5919 | operands 1 and 2 without truncation, divide the result by 2, | |
5920 | round towards -Inf, and store the result in operand 0. This is | |
5921 | equivalent to the C code: | |
5922 | @smallexample | |
5923 | narrow op0, op1, op2; | |
5924 | @dots{} | |
5925 | op0 = (narrow) (((wide) op1 + (wide) op2) >> 1); | |
5926 | @end smallexample | |
5927 | where the sign of @samp{narrow} determines whether this is a signed | |
5928 | or unsigned operation. | |
5929 | ||
5930 | @cindex @code{avg@var{m}3_ceil} instruction pattern | |
5931 | @cindex @code{uavg@var{m}3_ceil} instruction pattern | |
5932 | @item @samp{avg@var{m}3_ceil} | |
5933 | @itemx @samp{uavg@var{m}3_ceil} | |
5934 | Like @samp{avg@var{m}3_floor} and @samp{uavg@var{m}3_floor}, but round | |
5935 | towards +Inf. This is equivalent to the C code: | |
5936 | @smallexample | |
5937 | narrow op0, op1, op2; | |
5938 | @dots{} | |
5939 | op0 = (narrow) (((wide) op1 + (wide) op2 + 1) >> 1); | |
5940 | @end smallexample | |
5941 | ||
ac868f29 EB |
5942 | @cindex @code{bswap@var{m}2} instruction pattern |
5943 | @item @samp{bswap@var{m}2} | |
5944 | Reverse the order of bytes of operand 1 and store the result in operand 0. | |
5945 | ||
03dda8e3 | 5946 | @cindex @code{neg@var{m}2} instruction pattern |
0f996086 CF |
5947 | @cindex @code{ssneg@var{m}2} instruction pattern |
5948 | @cindex @code{usneg@var{m}2} instruction pattern | |
5949 | @item @samp{neg@var{m}2}, @samp{ssneg@var{m}2}, @samp{usneg@var{m}2} | |
03dda8e3 RK |
5950 | Negate operand 1 and store the result in operand 0. |
5951 | ||
481efdd9 EB |
5952 | @cindex @code{negv@var{m}3} instruction pattern |
5953 | @item @samp{negv@var{m}3} | |
5954 | Like @code{neg@var{m}2} but takes a @code{code_label} as operand 2 and | |
5955 | emits code to jump to it if signed overflow occurs during the negation. | |
5956 | ||
03dda8e3 RK |
5957 | @cindex @code{abs@var{m}2} instruction pattern |
5958 | @item @samp{abs@var{m}2} | |
5959 | Store the absolute value of operand 1 into operand 0. | |
5960 | ||
5961 | @cindex @code{sqrt@var{m}2} instruction pattern | |
5962 | @item @samp{sqrt@var{m}2} | |
a54a5997 RS |
5963 | Store the square root of operand 1 into operand 0. Both operands have |
5964 | mode @var{m}, which is a scalar or vector floating-point mode. | |
03dda8e3 | 5965 | |
a54a5997 | 5966 | This pattern is not allowed to @code{FAIL}. |
e7b489c8 | 5967 | |
ee62a5a6 RS |
5968 | @cindex @code{rsqrt@var{m}2} instruction pattern |
5969 | @item @samp{rsqrt@var{m}2} | |
5970 | Store the reciprocal of the square root of operand 1 into operand 0. | |
a54a5997 RS |
5971 | Both operands have mode @var{m}, which is a scalar or vector |
5972 | floating-point mode. | |
5973 | ||
ee62a5a6 RS |
5974 | On most architectures this pattern is only approximate, so either |
5975 | its C condition or the @code{TARGET_OPTAB_SUPPORTED_P} hook should | |
5976 | check for the appropriate math flags. (Using the C condition is | |
5977 | more direct, but using @code{TARGET_OPTAB_SUPPORTED_P} can be useful | |
5978 | if a target-specific built-in also uses the @samp{rsqrt@var{m}2} | |
5979 | pattern.) | |
5980 | ||
5981 | This pattern is not allowed to @code{FAIL}. | |
5982 | ||
17b98269 UB |
5983 | @cindex @code{fmod@var{m}3} instruction pattern |
5984 | @item @samp{fmod@var{m}3} | |
5985 | Store the remainder of dividing operand 1 by operand 2 into | |
a54a5997 RS |
5986 | operand 0, rounded towards zero to an integer. All operands have |
5987 | mode @var{m}, which is a scalar or vector floating-point mode. | |
17b98269 | 5988 | |
a54a5997 | 5989 | This pattern is not allowed to @code{FAIL}. |
17b98269 UB |
5990 | |
5991 | @cindex @code{remainder@var{m}3} instruction pattern | |
5992 | @item @samp{remainder@var{m}3} | |
5993 | Store the remainder of dividing operand 1 by operand 2 into | |
a54a5997 RS |
5994 | operand 0, rounded to the nearest integer. All operands have |
5995 | mode @var{m}, which is a scalar or vector floating-point mode. | |
5996 | ||
5997 | This pattern is not allowed to @code{FAIL}. | |
5998 | ||
5999 | @cindex @code{scalb@var{m}3} instruction pattern | |
6000 | @item @samp{scalb@var{m}3} | |
6001 | Raise @code{FLT_RADIX} to the power of operand 2, multiply it by | |
6002 | operand 1, and store the result in operand 0. All operands have | |
6003 | mode @var{m}, which is a scalar or vector floating-point mode. | |
17b98269 | 6004 | |
a54a5997 RS |
6005 | This pattern is not allowed to @code{FAIL}. |
6006 | ||
6007 | @cindex @code{ldexp@var{m}3} instruction pattern | |
6008 | @item @samp{ldexp@var{m}3} | |
6009 | Raise 2 to the power of operand 2, multiply it by operand 1, and store | |
6010 | the result in operand 0. Operands 0 and 1 have mode @var{m}, which is | |
6011 | a scalar or vector floating-point mode. Operand 2's mode has | |
6012 | the same number of elements as @var{m} and each element is wide | |
6013 | enough to store an @code{int}. The integers are signed. | |
6014 | ||
6015 | This pattern is not allowed to @code{FAIL}. | |
17b98269 | 6016 | |
e7b489c8 RS |
6017 | @cindex @code{cos@var{m}2} instruction pattern |
6018 | @item @samp{cos@var{m}2} | |
a54a5997 RS |
6019 | Store the cosine of operand 1 into operand 0. Both operands have |
6020 | mode @var{m}, which is a scalar or vector floating-point mode. | |
e7b489c8 | 6021 | |
a54a5997 | 6022 | This pattern is not allowed to @code{FAIL}. |
e7b489c8 RS |
6023 | |
6024 | @cindex @code{sin@var{m}2} instruction pattern | |
6025 | @item @samp{sin@var{m}2} | |
a54a5997 RS |
6026 | Store the sine of operand 1 into operand 0. Both operands have |
6027 | mode @var{m}, which is a scalar or vector floating-point mode. | |
e7b489c8 | 6028 | |
a54a5997 | 6029 | This pattern is not allowed to @code{FAIL}. |
e7b489c8 | 6030 | |
6d1f6aff OE |
6031 | @cindex @code{sincos@var{m}3} instruction pattern |
6032 | @item @samp{sincos@var{m}3} | |
6ba9e401 | 6033 | Store the cosine of operand 2 into operand 0 and the sine of |
a54a5997 RS |
6034 | operand 2 into operand 1. All operands have mode @var{m}, |
6035 | which is a scalar or vector floating-point mode. | |
6d1f6aff | 6036 | |
6d1f6aff OE |
6037 | Targets that can calculate the sine and cosine simultaneously can |
6038 | implement this pattern as opposed to implementing individual | |
6039 | @code{sin@var{m}2} and @code{cos@var{m}2} patterns. The @code{sin} | |
6040 | and @code{cos} built-in functions will then be expanded to the | |
6041 | @code{sincos@var{m}3} pattern, with one of the output values | |
6042 | left unused. | |
6043 | ||
a54a5997 RS |
6044 | @cindex @code{tan@var{m}2} instruction pattern |
6045 | @item @samp{tan@var{m}2} | |
6046 | Store the tangent of operand 1 into operand 0. Both operands have | |
6047 | mode @var{m}, which is a scalar or vector floating-point mode. | |
6048 | ||
6049 | This pattern is not allowed to @code{FAIL}. | |
6050 | ||
6051 | @cindex @code{asin@var{m}2} instruction pattern | |
6052 | @item @samp{asin@var{m}2} | |
6053 | Store the arc sine of operand 1 into operand 0. Both operands have | |
6054 | mode @var{m}, which is a scalar or vector floating-point mode. | |
6055 | ||
6056 | This pattern is not allowed to @code{FAIL}. | |
6057 | ||
6058 | @cindex @code{acos@var{m}2} instruction pattern | |
6059 | @item @samp{acos@var{m}2} | |
6060 | Store the arc cosine of operand 1 into operand 0. Both operands have | |
6061 | mode @var{m}, which is a scalar or vector floating-point mode. | |
6062 | ||
6063 | This pattern is not allowed to @code{FAIL}. | |
6064 | ||
6065 | @cindex @code{atan@var{m}2} instruction pattern | |
6066 | @item @samp{atan@var{m}2} | |
6067 | Store the arc tangent of operand 1 into operand 0. Both operands have | |
6068 | mode @var{m}, which is a scalar or vector floating-point mode. | |
6069 | ||
6070 | This pattern is not allowed to @code{FAIL}. | |
6071 | ||
e7b489c8 RS |
6072 | @cindex @code{exp@var{m}2} instruction pattern |
6073 | @item @samp{exp@var{m}2} | |
a54a5997 RS |
6074 | Raise e (the base of natural logarithms) to the power of operand 1 |
6075 | and store the result in operand 0. Both operands have mode @var{m}, | |
6076 | which is a scalar or vector floating-point mode. | |
6077 | ||
6078 | This pattern is not allowed to @code{FAIL}. | |
6079 | ||
6080 | @cindex @code{expm1@var{m}2} instruction pattern | |
6081 | @item @samp{expm1@var{m}2} | |
6082 | Raise e (the base of natural logarithms) to the power of operand 1, | |
6083 | subtract 1, and store the result in operand 0. Both operands have | |
6084 | mode @var{m}, which is a scalar or vector floating-point mode. | |
6085 | ||
6086 | For inputs close to zero, the pattern is expected to be more | |
6087 | accurate than a separate @code{exp@var{m}2} and @code{sub@var{m}3} | |
6088 | would be. | |
6089 | ||
6090 | This pattern is not allowed to @code{FAIL}. | |
6091 | ||
6092 | @cindex @code{exp10@var{m}2} instruction pattern | |
6093 | @item @samp{exp10@var{m}2} | |
6094 | Raise 10 to the power of operand 1 and store the result in operand 0. | |
6095 | Both operands have mode @var{m}, which is a scalar or vector | |
6096 | floating-point mode. | |
6097 | ||
6098 | This pattern is not allowed to @code{FAIL}. | |
6099 | ||
6100 | @cindex @code{exp2@var{m}2} instruction pattern | |
6101 | @item @samp{exp2@var{m}2} | |
6102 | Raise 2 to the power of operand 1 and store the result in operand 0. | |
6103 | Both operands have mode @var{m}, which is a scalar or vector | |
6104 | floating-point mode. | |
e7b489c8 | 6105 | |
a54a5997 | 6106 | This pattern is not allowed to @code{FAIL}. |
e7b489c8 RS |
6107 | |
6108 | @cindex @code{log@var{m}2} instruction pattern | |
6109 | @item @samp{log@var{m}2} | |
a54a5997 RS |
6110 | Store the natural logarithm of operand 1 into operand 0. Both operands |
6111 | have mode @var{m}, which is a scalar or vector floating-point mode. | |
6112 | ||
6113 | This pattern is not allowed to @code{FAIL}. | |
6114 | ||
6115 | @cindex @code{log1p@var{m}2} instruction pattern | |
6116 | @item @samp{log1p@var{m}2} | |
6117 | Add 1 to operand 1, compute the natural logarithm, and store | |
6118 | the result in operand 0. Both operands have mode @var{m}, which is | |
6119 | a scalar or vector floating-point mode. | |
6120 | ||
6121 | For inputs close to zero, the pattern is expected to be more | |
6122 | accurate than a separate @code{add@var{m}3} and @code{log@var{m}2} | |
6123 | would be. | |
6124 | ||
6125 | This pattern is not allowed to @code{FAIL}. | |
6126 | ||
6127 | @cindex @code{log10@var{m}2} instruction pattern | |
6128 | @item @samp{log10@var{m}2} | |
6129 | Store the base-10 logarithm of operand 1 into operand 0. Both operands | |
6130 | have mode @var{m}, which is a scalar or vector floating-point mode. | |
6131 | ||
6132 | This pattern is not allowed to @code{FAIL}. | |
6133 | ||
6134 | @cindex @code{log2@var{m}2} instruction pattern | |
6135 | @item @samp{log2@var{m}2} | |
6136 | Store the base-2 logarithm of operand 1 into operand 0. Both operands | |
6137 | have mode @var{m}, which is a scalar or vector floating-point mode. | |
e7b489c8 | 6138 | |
a54a5997 RS |
6139 | This pattern is not allowed to @code{FAIL}. |
6140 | ||
6141 | @cindex @code{logb@var{m}2} instruction pattern | |
6142 | @item @samp{logb@var{m}2} | |
6143 | Store the base-@code{FLT_RADIX} logarithm of operand 1 into operand 0. | |
6144 | Both operands have mode @var{m}, which is a scalar or vector | |
6145 | floating-point mode. | |
6146 | ||
6147 | This pattern is not allowed to @code{FAIL}. | |
6148 | ||
6149 | @cindex @code{significand@var{m}2} instruction pattern | |
6150 | @item @samp{significand@var{m}2} | |
6151 | Store the significand of floating-point operand 1 in operand 0. | |
6152 | Both operands have mode @var{m}, which is a scalar or vector | |
6153 | floating-point mode. | |
6154 | ||
6155 | This pattern is not allowed to @code{FAIL}. | |
03dda8e3 | 6156 | |
b5e01d4b RS |
6157 | @cindex @code{pow@var{m}3} instruction pattern |
6158 | @item @samp{pow@var{m}3} | |
6159 | Store the value of operand 1 raised to the exponent operand 2 | |
a54a5997 RS |
6160 | into operand 0. All operands have mode @var{m}, which is a scalar |
6161 | or vector floating-point mode. | |
b5e01d4b | 6162 | |
a54a5997 | 6163 | This pattern is not allowed to @code{FAIL}. |
b5e01d4b RS |
6164 | |
6165 | @cindex @code{atan2@var{m}3} instruction pattern | |
6166 | @item @samp{atan2@var{m}3} | |
6167 | Store the arc tangent (inverse tangent) of operand 1 divided by | |
6168 | operand 2 into operand 0, using the signs of both arguments to | |
a54a5997 RS |
6169 | determine the quadrant of the result. All operands have mode |
6170 | @var{m}, which is a scalar or vector floating-point mode. | |
b5e01d4b | 6171 | |
a54a5997 | 6172 | This pattern is not allowed to @code{FAIL}. |
b5e01d4b | 6173 | |
4977bab6 ZW |
6174 | @cindex @code{floor@var{m}2} instruction pattern |
6175 | @item @samp{floor@var{m}2} | |
a54a5997 RS |
6176 | Store the largest integral value not greater than operand 1 in operand 0. |
6177 | Both operands have mode @var{m}, which is a scalar or vector | |
0d2f700f JM |
6178 | floating-point mode. If @option{-ffp-int-builtin-inexact} is in |
6179 | effect, the ``inexact'' exception may be raised for noninteger | |
6180 | operands; otherwise, it may not. | |
4977bab6 | 6181 | |
a54a5997 | 6182 | This pattern is not allowed to @code{FAIL}. |
4977bab6 | 6183 | |
10553f10 UB |
6184 | @cindex @code{btrunc@var{m}2} instruction pattern |
6185 | @item @samp{btrunc@var{m}2} | |
a54a5997 RS |
6186 | Round operand 1 to an integer, towards zero, and store the result in |
6187 | operand 0. Both operands have mode @var{m}, which is a scalar or | |
0d2f700f JM |
6188 | vector floating-point mode. If @option{-ffp-int-builtin-inexact} is |
6189 | in effect, the ``inexact'' exception may be raised for noninteger | |
6190 | operands; otherwise, it may not. | |
4977bab6 | 6191 | |
a54a5997 | 6192 | This pattern is not allowed to @code{FAIL}. |
4977bab6 ZW |
6193 | |
6194 | @cindex @code{round@var{m}2} instruction pattern | |
6195 | @item @samp{round@var{m}2} | |
a54a5997 RS |
6196 | Round operand 1 to the nearest integer, rounding away from zero in the |
6197 | event of a tie, and store the result in operand 0. Both operands have | |
0d2f700f JM |
6198 | mode @var{m}, which is a scalar or vector floating-point mode. If |
6199 | @option{-ffp-int-builtin-inexact} is in effect, the ``inexact'' | |
6200 | exception may be raised for noninteger operands; otherwise, it may | |
6201 | not. | |
4977bab6 | 6202 | |
a54a5997 | 6203 | This pattern is not allowed to @code{FAIL}. |
4977bab6 ZW |
6204 | |
6205 | @cindex @code{ceil@var{m}2} instruction pattern | |
6206 | @item @samp{ceil@var{m}2} | |
a54a5997 RS |
6207 | Store the smallest integral value not less than operand 1 in operand 0. |
6208 | Both operands have mode @var{m}, which is a scalar or vector | |
0d2f700f JM |
6209 | floating-point mode. If @option{-ffp-int-builtin-inexact} is in |
6210 | effect, the ``inexact'' exception may be raised for noninteger | |
6211 | operands; otherwise, it may not. | |
4977bab6 | 6212 | |
a54a5997 | 6213 | This pattern is not allowed to @code{FAIL}. |
4977bab6 ZW |
6214 | |
6215 | @cindex @code{nearbyint@var{m}2} instruction pattern | |
6216 | @item @samp{nearbyint@var{m}2} | |
a54a5997 RS |
6217 | Round operand 1 to an integer, using the current rounding mode, and |
6218 | store the result in operand 0. Do not raise an inexact condition when | |
6219 | the result is different from the argument. Both operands have mode | |
6220 | @var{m}, which is a scalar or vector floating-point mode. | |
4977bab6 | 6221 | |
a54a5997 | 6222 | This pattern is not allowed to @code{FAIL}. |
4977bab6 | 6223 | |
10553f10 UB |
6224 | @cindex @code{rint@var{m}2} instruction pattern |
6225 | @item @samp{rint@var{m}2} | |
a54a5997 RS |
6226 | Round operand 1 to an integer, using the current rounding mode, and |
6227 | store the result in operand 0. Raise an inexact condition when | |
6228 | the result is different from the argument. Both operands have mode | |
6229 | @var{m}, which is a scalar or vector floating-point mode. | |
10553f10 | 6230 | |
a54a5997 | 6231 | This pattern is not allowed to @code{FAIL}. |
10553f10 | 6232 | |
bb7f0423 RG |
6233 | @cindex @code{lrint@var{m}@var{n}2} |
6234 | @item @samp{lrint@var{m}@var{n}2} | |
6235 | Convert operand 1 (valid for floating point mode @var{m}) to fixed | |
6236 | point mode @var{n} as a signed number according to the current | |
6237 | rounding mode and store in operand 0 (which has mode @var{n}). | |
6238 | ||
4d81bf84 | 6239 | @cindex @code{lround@var{m}@var{n}2} |
e0d4c0b3 | 6240 | @item @samp{lround@var{m}@var{n}2} |
4d81bf84 RG |
6241 | Convert operand 1 (valid for floating point mode @var{m}) to fixed |
6242 | point mode @var{n} as a signed number rounding to nearest and away | |
6243 | from zero and store in operand 0 (which has mode @var{n}). | |
6244 | ||
c3a4177f | 6245 | @cindex @code{lfloor@var{m}@var{n}2} |
e0d4c0b3 | 6246 | @item @samp{lfloor@var{m}@var{n}2} |
c3a4177f RG |
6247 | Convert operand 1 (valid for floating point mode @var{m}) to fixed |
6248 | point mode @var{n} as a signed number rounding down and store in | |
6249 | operand 0 (which has mode @var{n}). | |
6250 | ||
6251 | @cindex @code{lceil@var{m}@var{n}2} | |
e0d4c0b3 | 6252 | @item @samp{lceil@var{m}@var{n}2} |
c3a4177f RG |
6253 | Convert operand 1 (valid for floating point mode @var{m}) to fixed |
6254 | point mode @var{n} as a signed number rounding up and store in | |
6255 | operand 0 (which has mode @var{n}). | |
6256 | ||
d35a40fc DE |
6257 | @cindex @code{copysign@var{m}3} instruction pattern |
6258 | @item @samp{copysign@var{m}3} | |
6259 | Store a value with the magnitude of operand 1 and the sign of operand | |
a54a5997 RS |
6260 | 2 into operand 0. All operands have mode @var{m}, which is a scalar or |
6261 | vector floating-point mode. | |
d35a40fc | 6262 | |
a54a5997 | 6263 | This pattern is not allowed to @code{FAIL}. |
d35a40fc | 6264 | |
cb369975 TC |
6265 | @cindex @code{xorsign@var{m}3} instruction pattern |
6266 | @item @samp{xorsign@var{m}3} | |
6267 | Equivalent to @samp{op0 = op1 * copysign (1.0, op2)}: store a value with | |
6268 | the magnitude of operand 1 and the sign of operand 2 into operand 0. | |
6269 | All operands have mode @var{m}, which is a scalar or vector | |
6270 | floating-point mode. | |
6271 | ||
6272 | This pattern is not allowed to @code{FAIL}. | |
6273 | ||
3ed472af TC |
6274 | @cindex @code{cadd90@var{m}3} instruction pattern |
6275 | @item @samp{cadd90@var{m}3} | |
6276 | Perform vector add and subtract on even/odd number pairs. The operation being | |
6277 | matched is semantically described as | |
6278 | ||
6279 | @smallexample | |
6280 | for (int i = 0; i < N; i += 2) | |
6281 | @{ | |
6282 | c[i] = a[i] - b[i+1]; | |
6283 | c[i+1] = a[i+1] + b[i]; | |
6284 | @} | |
6285 | @end smallexample | |
6286 | ||
6287 | This operation is semantically equivalent to performing a vector addition of | |
6288 | complex numbers in operand 1 with operand 2 rotated by 90 degrees around | |
6289 | the argand plane and storing the result in operand 0. | |
6290 | ||
6291 | In GCC lane ordering the real part of the number must be in the even lanes with | |
6292 | the imaginary part in the odd lanes. | |
6293 | ||
6294 | The operation is only supported for vector modes @var{m}. | |
6295 | ||
6296 | This pattern is not allowed to @code{FAIL}. | |
6297 | ||
6298 | @cindex @code{cadd270@var{m}3} instruction pattern | |
6299 | @item @samp{cadd270@var{m}3} | |
6300 | Perform vector add and subtract on even/odd number pairs. The operation being | |
6301 | matched is semantically described as | |
6302 | ||
6303 | @smallexample | |
6304 | for (int i = 0; i < N; i += 2) | |
6305 | @{ | |
6306 | c[i] = a[i] + b[i+1]; | |
6307 | c[i+1] = a[i+1] - b[i]; | |
6308 | @} | |
6309 | @end smallexample | |
6310 | ||
6311 | This operation is semantically equivalent to performing a vector addition of | |
6312 | complex numbers in operand 1 with operand 2 rotated by 270 degrees around | |
6313 | the argand plane and storing the result in operand 0. | |
6314 | ||
6315 | In GCC lane ordering the real part of the number must be in the even lanes with | |
6316 | the imaginary part in the odd lanes. | |
6317 | ||
6318 | The operation is only supported for vector modes @var{m}. | |
6319 | ||
6320 | This pattern is not allowed to @code{FAIL}. | |
6321 | ||
31fac318 TC |
6322 | @cindex @code{cmla@var{m}4} instruction pattern |
6323 | @item @samp{cmla@var{m}4} | |
6324 | Perform a vector multiply and accumulate that is semantically the same as | |
6325 | a multiply and accumulate of complex numbers. | |
6326 | ||
6327 | @smallexample | |
6328 | complex TYPE c[N]; | |
6329 | complex TYPE a[N]; | |
6330 | complex TYPE b[N]; | |
6331 | for (int i = 0; i < N; i += 1) | |
6332 | @{ | |
6333 | c[i] += a[i] * b[i]; | |
6334 | @} | |
6335 | @end smallexample | |
6336 | ||
6337 | In GCC lane ordering the real part of the number must be in the even lanes with | |
6338 | the imaginary part in the odd lanes. | |
6339 | ||
6340 | The operation is only supported for vector modes @var{m}. | |
6341 | ||
6342 | This pattern is not allowed to @code{FAIL}. | |
6343 | ||
6344 | @cindex @code{cmla_conj@var{m}4} instruction pattern | |
6345 | @item @samp{cmla_conj@var{m}4} | |
6346 | Perform a vector multiply by conjugate and accumulate that is semantically | |
6347 | the same as a multiply and accumulate of complex numbers where the second | |
6348 | multiply arguments is conjugated. | |
6349 | ||
6350 | @smallexample | |
6351 | complex TYPE c[N]; | |
6352 | complex TYPE a[N]; | |
6353 | complex TYPE b[N]; | |
6354 | for (int i = 0; i < N; i += 1) | |
6355 | @{ | |
6356 | c[i] += a[i] * conj (b[i]); | |
6357 | @} | |
6358 | @end smallexample | |
6359 | ||
6360 | In GCC lane ordering the real part of the number must be in the even lanes with | |
6361 | the imaginary part in the odd lanes. | |
6362 | ||
6363 | The operation is only supported for vector modes @var{m}. | |
6364 | ||
6365 | This pattern is not allowed to @code{FAIL}. | |
6366 | ||
478e571a TC |
6367 | @cindex @code{cmls@var{m}4} instruction pattern |
6368 | @item @samp{cmls@var{m}4} | |
6369 | Perform a vector multiply and subtract that is semantically the same as | |
6370 | a multiply and subtract of complex numbers. | |
6371 | ||
6372 | @smallexample | |
6373 | complex TYPE c[N]; | |
6374 | complex TYPE a[N]; | |
6375 | complex TYPE b[N]; | |
6376 | for (int i = 0; i < N; i += 1) | |
6377 | @{ | |
6378 | c[i] -= a[i] * b[i]; | |
6379 | @} | |
6380 | @end smallexample | |
6381 | ||
6382 | In GCC lane ordering the real part of the number must be in the even lanes with | |
6383 | the imaginary part in the odd lanes. | |
6384 | ||
6385 | The operation is only supported for vector modes @var{m}. | |
6386 | ||
6387 | This pattern is not allowed to @code{FAIL}. | |
6388 | ||
6389 | @cindex @code{cmls_conj@var{m}4} instruction pattern | |
6390 | @item @samp{cmls_conj@var{m}4} | |
6391 | Perform a vector multiply by conjugate and subtract that is semantically | |
6392 | the same as a multiply and subtract of complex numbers where the second | |
6393 | multiply arguments is conjugated. | |
6394 | ||
6395 | @smallexample | |
6396 | complex TYPE c[N]; | |
6397 | complex TYPE a[N]; | |
6398 | complex TYPE b[N]; | |
6399 | for (int i = 0; i < N; i += 1) | |
6400 | @{ | |
6401 | c[i] -= a[i] * conj (b[i]); | |
6402 | @} | |
6403 | @end smallexample | |
6404 | ||
6405 | In GCC lane ordering the real part of the number must be in the even lanes with | |
6406 | the imaginary part in the odd lanes. | |
6407 | ||
6408 | The operation is only supported for vector modes @var{m}. | |
6409 | ||
6410 | This pattern is not allowed to @code{FAIL}. | |
6411 | ||
e09173d8 TC |
6412 | @cindex @code{cmul@var{m}4} instruction pattern |
6413 | @item @samp{cmul@var{m}4} | |
6414 | Perform a vector multiply that is semantically the same as multiply of | |
6415 | complex numbers. | |
6416 | ||
6417 | @smallexample | |
6418 | complex TYPE c[N]; | |
6419 | complex TYPE a[N]; | |
6420 | complex TYPE b[N]; | |
6421 | for (int i = 0; i < N; i += 1) | |
6422 | @{ | |
6423 | c[i] = a[i] * b[i]; | |
6424 | @} | |
6425 | @end smallexample | |
6426 | ||
6427 | In GCC lane ordering the real part of the number must be in the even lanes with | |
6428 | the imaginary part in the odd lanes. | |
6429 | ||
6430 | The operation is only supported for vector modes @var{m}. | |
6431 | ||
6432 | This pattern is not allowed to @code{FAIL}. | |
6433 | ||
6434 | @cindex @code{cmul_conj@var{m}4} instruction pattern | |
6435 | @item @samp{cmul_conj@var{m}4} | |
6436 | Perform a vector multiply by conjugate that is semantically the same as a | |
6437 | multiply of complex numbers where the second multiply arguments is conjugated. | |
6438 | ||
6439 | @smallexample | |
6440 | complex TYPE c[N]; | |
6441 | complex TYPE a[N]; | |
6442 | complex TYPE b[N]; | |
6443 | for (int i = 0; i < N; i += 1) | |
6444 | @{ | |
6445 | c[i] = a[i] * conj (b[i]); | |
6446 | @} | |
6447 | @end smallexample | |
6448 | ||
6449 | In GCC lane ordering the real part of the number must be in the even lanes with | |
6450 | the imaginary part in the odd lanes. | |
6451 | ||
6452 | The operation is only supported for vector modes @var{m}. | |
6453 | ||
6454 | This pattern is not allowed to @code{FAIL}. | |
6455 | ||
03dda8e3 RK |
6456 | @cindex @code{ffs@var{m}2} instruction pattern |
6457 | @item @samp{ffs@var{m}2} | |
6458 | Store into operand 0 one plus the index of the least significant 1-bit | |
a54a5997 | 6459 | of operand 1. If operand 1 is zero, store zero. |
03dda8e3 | 6460 | |
a54a5997 RS |
6461 | @var{m} is either a scalar or vector integer mode. When it is a scalar, |
6462 | operand 1 has mode @var{m} but operand 0 can have whatever scalar | |
6463 | integer mode is suitable for the target. The compiler will insert | |
6464 | conversion instructions as necessary (typically to convert the result | |
6465 | to the same width as @code{int}). When @var{m} is a vector, both | |
6466 | operands must have mode @var{m}. | |
6467 | ||
6468 | This pattern is not allowed to @code{FAIL}. | |
03dda8e3 | 6469 | |
e7a45277 KT |
6470 | @cindex @code{clrsb@var{m}2} instruction pattern |
6471 | @item @samp{clrsb@var{m}2} | |
6472 | Count leading redundant sign bits. | |
6473 | Store into operand 0 the number of redundant sign bits in operand 1, starting | |
6474 | at the most significant bit position. | |
6475 | A redundant sign bit is defined as any sign bit after the first. As such, | |
6476 | this count will be one less than the count of leading sign bits. | |
6477 | ||
a54a5997 RS |
6478 | @var{m} is either a scalar or vector integer mode. When it is a scalar, |
6479 | operand 1 has mode @var{m} but operand 0 can have whatever scalar | |
6480 | integer mode is suitable for the target. The compiler will insert | |
6481 | conversion instructions as necessary (typically to convert the result | |
6482 | to the same width as @code{int}). When @var{m} is a vector, both | |
6483 | operands must have mode @var{m}. | |
6484 | ||
6485 | This pattern is not allowed to @code{FAIL}. | |
6486 | ||
2928cd7a RH |
6487 | @cindex @code{clz@var{m}2} instruction pattern |
6488 | @item @samp{clz@var{m}2} | |
e7a45277 KT |
6489 | Store into operand 0 the number of leading 0-bits in operand 1, starting |
6490 | at the most significant bit position. If operand 1 is 0, the | |
2a6627c2 JN |
6491 | @code{CLZ_DEFINED_VALUE_AT_ZERO} (@pxref{Misc}) macro defines if |
6492 | the result is undefined or has a useful value. | |
a54a5997 RS |
6493 | |
6494 | @var{m} is either a scalar or vector integer mode. When it is a scalar, | |
6495 | operand 1 has mode @var{m} but operand 0 can have whatever scalar | |
6496 | integer mode is suitable for the target. The compiler will insert | |
6497 | conversion instructions as necessary (typically to convert the result | |
6498 | to the same width as @code{int}). When @var{m} is a vector, both | |
6499 | operands must have mode @var{m}. | |
6500 | ||
6501 | This pattern is not allowed to @code{FAIL}. | |
2928cd7a RH |
6502 | |
6503 | @cindex @code{ctz@var{m}2} instruction pattern | |
6504 | @item @samp{ctz@var{m}2} | |
e7a45277 KT |
6505 | Store into operand 0 the number of trailing 0-bits in operand 1, starting |
6506 | at the least significant bit position. If operand 1 is 0, the | |
2a6627c2 JN |
6507 | @code{CTZ_DEFINED_VALUE_AT_ZERO} (@pxref{Misc}) macro defines if |
6508 | the result is undefined or has a useful value. | |
a54a5997 RS |
6509 | |
6510 | @var{m} is either a scalar or vector integer mode. When it is a scalar, | |
6511 | operand 1 has mode @var{m} but operand 0 can have whatever scalar | |
6512 | integer mode is suitable for the target. The compiler will insert | |
6513 | conversion instructions as necessary (typically to convert the result | |
6514 | to the same width as @code{int}). When @var{m} is a vector, both | |
6515 | operands must have mode @var{m}. | |
6516 | ||
6517 | This pattern is not allowed to @code{FAIL}. | |
2928cd7a RH |
6518 | |
6519 | @cindex @code{popcount@var{m}2} instruction pattern | |
6520 | @item @samp{popcount@var{m}2} | |
a54a5997 RS |
6521 | Store into operand 0 the number of 1-bits in operand 1. |
6522 | ||
6523 | @var{m} is either a scalar or vector integer mode. When it is a scalar, | |
6524 | operand 1 has mode @var{m} but operand 0 can have whatever scalar | |
6525 | integer mode is suitable for the target. The compiler will insert | |
6526 | conversion instructions as necessary (typically to convert the result | |
6527 | to the same width as @code{int}). When @var{m} is a vector, both | |
6528 | operands must have mode @var{m}. | |
6529 | ||
6530 | This pattern is not allowed to @code{FAIL}. | |
2928cd7a RH |
6531 | |
6532 | @cindex @code{parity@var{m}2} instruction pattern | |
6533 | @item @samp{parity@var{m}2} | |
e7a45277 | 6534 | Store into operand 0 the parity of operand 1, i.e.@: the number of 1-bits |
a54a5997 RS |
6535 | in operand 1 modulo 2. |
6536 | ||
6537 | @var{m} is either a scalar or vector integer mode. When it is a scalar, | |
6538 | operand 1 has mode @var{m} but operand 0 can have whatever scalar | |
6539 | integer mode is suitable for the target. The compiler will insert | |
6540 | conversion instructions as necessary (typically to convert the result | |
6541 | to the same width as @code{int}). When @var{m} is a vector, both | |
6542 | operands must have mode @var{m}. | |
6543 | ||
6544 | This pattern is not allowed to @code{FAIL}. | |
2928cd7a | 6545 | |
03dda8e3 RK |
6546 | @cindex @code{one_cmpl@var{m}2} instruction pattern |
6547 | @item @samp{one_cmpl@var{m}2} | |
6548 | Store the bitwise-complement of operand 1 into operand 0. | |
6549 | ||
76715c32 AS |
6550 | @cindex @code{cpymem@var{m}} instruction pattern |
6551 | @item @samp{cpymem@var{m}} | |
6552 | Block copy instruction. The destination and source blocks of memory | |
beed8fc0 AO |
6553 | are the first two operands, and both are @code{mem:BLK}s with an |
6554 | address in mode @code{Pmode}. | |
e5e809f4 | 6555 | |
76715c32 | 6556 | The number of bytes to copy is the third operand, in mode @var{m}. |
5689294c | 6557 | Usually, you specify @code{Pmode} for @var{m}. However, if you can |
e5e809f4 | 6558 | generate better code knowing the range of valid lengths is smaller than |
5689294c L |
6559 | those representable in a full Pmode pointer, you should provide |
6560 | a pattern with a | |
e5e809f4 JL |
6561 | mode corresponding to the range of values you can handle efficiently |
6562 | (e.g., @code{QImode} for values in the range 0--127; note we avoid numbers | |
5689294c | 6563 | that appear negative) and also a pattern with @code{Pmode}. |
03dda8e3 RK |
6564 | |
6565 | The fourth operand is the known shared alignment of the source and | |
6566 | destination, in the form of a @code{const_int} rtx. Thus, if the | |
6567 | compiler knows that both source and destination are word-aligned, | |
6568 | it may provide the value 4 for this operand. | |
6569 | ||
079a182e JH |
6570 | Optional operands 5 and 6 specify expected alignment and size of block |
6571 | respectively. The expected alignment differs from alignment in operand 4 | |
6572 | in a way that the blocks are not required to be aligned according to it in | |
9946ca2d RA |
6573 | all cases. This expected alignment is also in bytes, just like operand 4. |
6574 | Expected size, when unknown, is set to @code{(const_int -1)}. | |
079a182e | 6575 | |
76715c32 | 6576 | Descriptions of multiple @code{cpymem@var{m}} patterns can only be |
4693911f | 6577 | beneficial if the patterns for smaller modes have fewer restrictions |
8c01d9b6 | 6578 | on their first, second and fourth operands. Note that the mode @var{m} |
76715c32 AS |
6579 | in @code{cpymem@var{m}} does not impose any restriction on the mode of |
6580 | individually copied data units in the block. | |
8c01d9b6 | 6581 | |
76715c32 AS |
6582 | The @code{cpymem@var{m}} patterns need not give special consideration |
6583 | to the possibility that the source and destination strings might | |
6584 | overlap. These patterns are used to do inline expansion of | |
6585 | @code{__builtin_memcpy}. | |
03dda8e3 | 6586 | |
02e3025e AS |
6587 | @cindex @code{movmem@var{m}} instruction pattern |
6588 | @item @samp{movmem@var{m}} | |
6589 | Block move instruction. The destination and source blocks of memory | |
6590 | are the first two operands, and both are @code{mem:BLK}s with an | |
6591 | address in mode @code{Pmode}. | |
6592 | ||
6593 | The number of bytes to copy is the third operand, in mode @var{m}. | |
6594 | Usually, you specify @code{Pmode} for @var{m}. However, if you can | |
6595 | generate better code knowing the range of valid lengths is smaller than | |
6596 | those representable in a full Pmode pointer, you should provide | |
6597 | a pattern with a | |
6598 | mode corresponding to the range of values you can handle efficiently | |
6599 | (e.g., @code{QImode} for values in the range 0--127; note we avoid numbers | |
6600 | that appear negative) and also a pattern with @code{Pmode}. | |
6601 | ||
6602 | The fourth operand is the known shared alignment of the source and | |
6603 | destination, in the form of a @code{const_int} rtx. Thus, if the | |
6604 | compiler knows that both source and destination are word-aligned, | |
6605 | it may provide the value 4 for this operand. | |
6606 | ||
6607 | Optional operands 5 and 6 specify expected alignment and size of block | |
6608 | respectively. The expected alignment differs from alignment in operand 4 | |
6609 | in a way that the blocks are not required to be aligned according to it in | |
6610 | all cases. This expected alignment is also in bytes, just like operand 4. | |
6611 | Expected size, when unknown, is set to @code{(const_int -1)}. | |
6612 | ||
6613 | Descriptions of multiple @code{movmem@var{m}} patterns can only be | |
6614 | beneficial if the patterns for smaller modes have fewer restrictions | |
6615 | on their first, second and fourth operands. Note that the mode @var{m} | |
6616 | in @code{movmem@var{m}} does not impose any restriction on the mode of | |
6617 | individually copied data units in the block. | |
6618 | ||
6619 | The @code{movmem@var{m}} patterns must correctly handle the case where | |
6620 | the source and destination strings overlap. These patterns are used to | |
6621 | do inline expansion of @code{__builtin_memmove}. | |
6622 | ||
beed8fc0 AO |
6623 | @cindex @code{movstr} instruction pattern |
6624 | @item @samp{movstr} | |
6625 | String copy instruction, with @code{stpcpy} semantics. Operand 0 is | |
6626 | an output operand in mode @code{Pmode}. The addresses of the | |
6627 | destination and source strings are operands 1 and 2, and both are | |
6628 | @code{mem:BLK}s with addresses in mode @code{Pmode}. The execution of | |
6629 | the expansion of this pattern should store in operand 0 the address in | |
6630 | which the @code{NUL} terminator was stored in the destination string. | |
6631 | ||
2b4f0b89 | 6632 | This pattern has also several optional operands that are same as in |
3918b108 JH |
6633 | @code{setmem}. |
6634 | ||
57e84f18 AS |
6635 | @cindex @code{setmem@var{m}} instruction pattern |
6636 | @item @samp{setmem@var{m}} | |
6637 | Block set instruction. The destination string is the first operand, | |
beed8fc0 | 6638 | given as a @code{mem:BLK} whose address is in mode @code{Pmode}. The |
57e84f18 AS |
6639 | number of bytes to set is the second operand, in mode @var{m}. The value to |
6640 | initialize the memory with is the third operand. Targets that only support the | |
6641 | clearing of memory should reject any value that is not the constant 0. See | |
76715c32 | 6642 | @samp{cpymem@var{m}} for a discussion of the choice of mode. |
03dda8e3 | 6643 | |
57e84f18 | 6644 | The fourth operand is the known alignment of the destination, in the form |
03dda8e3 RK |
6645 | of a @code{const_int} rtx. Thus, if the compiler knows that the |
6646 | destination is word-aligned, it may provide the value 4 for this | |
6647 | operand. | |
6648 | ||
079a182e JH |
6649 | Optional operands 5 and 6 specify expected alignment and size of block |
6650 | respectively. The expected alignment differs from alignment in operand 4 | |
6651 | in a way that the blocks are not required to be aligned according to it in | |
9946ca2d RA |
6652 | all cases. This expected alignment is also in bytes, just like operand 4. |
6653 | Expected size, when unknown, is set to @code{(const_int -1)}. | |
3918b108 | 6654 | Operand 7 is the minimal size of the block and operand 8 is the |
67914693 SL |
6655 | maximal size of the block (NULL if it cannot be represented as CONST_INT). |
6656 | Operand 9 is the probable maximal size (i.e.@: we cannot rely on it for | |
630ba2fd SB |
6657 | correctness, but it can be used for choosing proper code sequence for a |
6658 | given size). | |
079a182e | 6659 | |
76715c32 | 6660 | The use for multiple @code{setmem@var{m}} is as for @code{cpymem@var{m}}. |
8c01d9b6 | 6661 | |
40c1d5f8 AS |
6662 | @cindex @code{cmpstrn@var{m}} instruction pattern |
6663 | @item @samp{cmpstrn@var{m}} | |
358b8f01 | 6664 | String compare instruction, with five operands. Operand 0 is the output; |
03dda8e3 | 6665 | it has mode @var{m}. The remaining four operands are like the operands |
76715c32 | 6666 | of @samp{cpymem@var{m}}. The two memory blocks specified are compared |
5cc2f4f3 KG |
6667 | byte by byte in lexicographic order starting at the beginning of each |
6668 | string. The instruction is not allowed to prefetch more than one byte | |
6669 | at a time since either string may end in the first byte and reading past | |
6670 | that may access an invalid page or segment and cause a fault. The | |
9b0f6f5e NC |
6671 | comparison terminates early if the fetched bytes are different or if |
6672 | they are equal to zero. The effect of the instruction is to store a | |
6673 | value in operand 0 whose sign indicates the result of the comparison. | |
03dda8e3 | 6674 | |
40c1d5f8 AS |
6675 | @cindex @code{cmpstr@var{m}} instruction pattern |
6676 | @item @samp{cmpstr@var{m}} | |
6677 | String compare instruction, without known maximum length. Operand 0 is the | |
6678 | output; it has mode @var{m}. The second and third operand are the blocks of | |
6679 | memory to be compared; both are @code{mem:BLK} with an address in mode | |
6680 | @code{Pmode}. | |
6681 | ||
6682 | The fourth operand is the known shared alignment of the source and | |
6683 | destination, in the form of a @code{const_int} rtx. Thus, if the | |
6684 | compiler knows that both source and destination are word-aligned, | |
6685 | it may provide the value 4 for this operand. | |
6686 | ||
6687 | The two memory blocks specified are compared byte by byte in lexicographic | |
6688 | order starting at the beginning of each string. The instruction is not allowed | |
6689 | to prefetch more than one byte at a time since either string may end in the | |
6690 | first byte and reading past that may access an invalid page or segment and | |
9b0f6f5e NC |
6691 | cause a fault. The comparison will terminate when the fetched bytes |
6692 | are different or if they are equal to zero. The effect of the | |
6693 | instruction is to store a value in operand 0 whose sign indicates the | |
6694 | result of the comparison. | |
40c1d5f8 | 6695 | |
358b8f01 JJ |
6696 | @cindex @code{cmpmem@var{m}} instruction pattern |
6697 | @item @samp{cmpmem@var{m}} | |
6698 | Block compare instruction, with five operands like the operands | |
6699 | of @samp{cmpstr@var{m}}. The two memory blocks specified are compared | |
6700 | byte by byte in lexicographic order starting at the beginning of each | |
6701 | block. Unlike @samp{cmpstr@var{m}} the instruction can prefetch | |
9b0f6f5e NC |
6702 | any bytes in the two memory blocks. Also unlike @samp{cmpstr@var{m}} |
6703 | the comparison will not stop if both bytes are zero. The effect of | |
6704 | the instruction is to store a value in operand 0 whose sign indicates | |
6705 | the result of the comparison. | |
358b8f01 | 6706 | |
03dda8e3 RK |
6707 | @cindex @code{strlen@var{m}} instruction pattern |
6708 | @item @samp{strlen@var{m}} | |
6709 | Compute the length of a string, with three operands. | |
6710 | Operand 0 is the result (of mode @var{m}), operand 1 is | |
6711 | a @code{mem} referring to the first character of the string, | |
6712 | operand 2 is the character to search for (normally zero), | |
6713 | and operand 3 is a constant describing the known alignment | |
6714 | of the beginning of the string. | |
6715 | ||
6f966f06 SSF |
6716 | @cindex @code{rawmemchr@var{m}} instruction pattern |
6717 | @item @samp{rawmemchr@var{m}} | |
6718 | Scan memory referred to by operand 1 for the first occurrence of operand 2. | |
6719 | Operand 1 is a @code{mem} and operand 2 a @code{const_int} of mode @var{m}. | |
6720 | Operand 0 is the result, i.e., a pointer to the first occurrence of operand 2 | |
6721 | in the memory block given by operand 1. | |
6722 | ||
e0d4c0b3 | 6723 | @cindex @code{float@var{m}@var{n}2} instruction pattern |
03dda8e3 RK |
6724 | @item @samp{float@var{m}@var{n}2} |
6725 | Convert signed integer operand 1 (valid for fixed point mode @var{m}) to | |
6726 | floating point mode @var{n} and store in operand 0 (which has mode | |
6727 | @var{n}). | |
6728 | ||
e0d4c0b3 | 6729 | @cindex @code{floatuns@var{m}@var{n}2} instruction pattern |
03dda8e3 RK |
6730 | @item @samp{floatuns@var{m}@var{n}2} |
6731 | Convert unsigned integer operand 1 (valid for fixed point mode @var{m}) | |
6732 | to floating point mode @var{n} and store in operand 0 (which has mode | |
6733 | @var{n}). | |
6734 | ||
e0d4c0b3 | 6735 | @cindex @code{fix@var{m}@var{n}2} instruction pattern |
03dda8e3 RK |
6736 | @item @samp{fix@var{m}@var{n}2} |
6737 | Convert operand 1 (valid for floating point mode @var{m}) to fixed | |
6738 | point mode @var{n} as a signed number and store in operand 0 (which | |
6739 | has mode @var{n}). This instruction's result is defined only when | |
6740 | the value of operand 1 is an integer. | |
6741 | ||
0e1d7f32 AH |
6742 | If the machine description defines this pattern, it also needs to |
6743 | define the @code{ftrunc} pattern. | |
6744 | ||
e0d4c0b3 | 6745 | @cindex @code{fixuns@var{m}@var{n}2} instruction pattern |
03dda8e3 RK |
6746 | @item @samp{fixuns@var{m}@var{n}2} |
6747 | Convert operand 1 (valid for floating point mode @var{m}) to fixed | |
6748 | point mode @var{n} as an unsigned number and store in operand 0 (which | |
6749 | has mode @var{n}). This instruction's result is defined only when the | |
6750 | value of operand 1 is an integer. | |
6751 | ||
6752 | @cindex @code{ftrunc@var{m}2} instruction pattern | |
6753 | @item @samp{ftrunc@var{m}2} | |
6754 | Convert operand 1 (valid for floating point mode @var{m}) to an | |
6755 | integer value, still represented in floating point mode @var{m}, and | |
6756 | store it in operand 0 (valid for floating point mode @var{m}). | |
6757 | ||
e0d4c0b3 | 6758 | @cindex @code{fix_trunc@var{m}@var{n}2} instruction pattern |
03dda8e3 RK |
6759 | @item @samp{fix_trunc@var{m}@var{n}2} |
6760 | Like @samp{fix@var{m}@var{n}2} but works for any floating point value | |
6761 | of mode @var{m} by converting the value to an integer. | |
6762 | ||
e0d4c0b3 | 6763 | @cindex @code{fixuns_trunc@var{m}@var{n}2} instruction pattern |
03dda8e3 RK |
6764 | @item @samp{fixuns_trunc@var{m}@var{n}2} |
6765 | Like @samp{fixuns@var{m}@var{n}2} but works for any floating point | |
6766 | value of mode @var{m} by converting the value to an integer. | |
6767 | ||
e0d4c0b3 | 6768 | @cindex @code{trunc@var{m}@var{n}2} instruction pattern |
03dda8e3 RK |
6769 | @item @samp{trunc@var{m}@var{n}2} |
6770 | Truncate operand 1 (valid for mode @var{m}) to mode @var{n} and | |
6771 | store in operand 0 (which has mode @var{n}). Both modes must be fixed | |
6772 | point or both floating point. | |
6773 | ||
e0d4c0b3 | 6774 | @cindex @code{extend@var{m}@var{n}2} instruction pattern |
03dda8e3 RK |
6775 | @item @samp{extend@var{m}@var{n}2} |
6776 | Sign-extend operand 1 (valid for mode @var{m}) to mode @var{n} and | |
6777 | store in operand 0 (which has mode @var{n}). Both modes must be fixed | |
6778 | point or both floating point. | |
6779 | ||
e0d4c0b3 | 6780 | @cindex @code{zero_extend@var{m}@var{n}2} instruction pattern |
03dda8e3 RK |
6781 | @item @samp{zero_extend@var{m}@var{n}2} |
6782 | Zero-extend operand 1 (valid for mode @var{m}) to mode @var{n} and | |
6783 | store in operand 0 (which has mode @var{n}). Both modes must be fixed | |
6784 | point. | |
6785 | ||
e0d4c0b3 | 6786 | @cindex @code{fract@var{m}@var{n}2} instruction pattern |
0f996086 CF |
6787 | @item @samp{fract@var{m}@var{n}2} |
6788 | Convert operand 1 of mode @var{m} to mode @var{n} and store in | |
6789 | operand 0 (which has mode @var{n}). Mode @var{m} and mode @var{n} | |
6790 | could be fixed-point to fixed-point, signed integer to fixed-point, | |
6791 | fixed-point to signed integer, floating-point to fixed-point, | |
6792 | or fixed-point to floating-point. | |
6793 | When overflows or underflows happen, the results are undefined. | |
6794 | ||
e0d4c0b3 | 6795 | @cindex @code{satfract@var{m}@var{n}2} instruction pattern |
0f996086 CF |
6796 | @item @samp{satfract@var{m}@var{n}2} |
6797 | Convert operand 1 of mode @var{m} to mode @var{n} and store in | |
6798 | operand 0 (which has mode @var{n}). Mode @var{m} and mode @var{n} | |
6799 | could be fixed-point to fixed-point, signed integer to fixed-point, | |
6800 | or floating-point to fixed-point. | |
6801 | When overflows or underflows happen, the instruction saturates the | |
6802 | results to the maximum or the minimum. | |
6803 | ||
e0d4c0b3 | 6804 | @cindex @code{fractuns@var{m}@var{n}2} instruction pattern |
0f996086 CF |
6805 | @item @samp{fractuns@var{m}@var{n}2} |
6806 | Convert operand 1 of mode @var{m} to mode @var{n} and store in | |
6807 | operand 0 (which has mode @var{n}). Mode @var{m} and mode @var{n} | |
6808 | could be unsigned integer to fixed-point, or | |
6809 | fixed-point to unsigned integer. | |
6810 | When overflows or underflows happen, the results are undefined. | |
6811 | ||
e0d4c0b3 | 6812 | @cindex @code{satfractuns@var{m}@var{n}2} instruction pattern |
0f996086 CF |
6813 | @item @samp{satfractuns@var{m}@var{n}2} |
6814 | Convert unsigned integer operand 1 of mode @var{m} to fixed-point mode | |
6815 | @var{n} and store in operand 0 (which has mode @var{n}). | |
6816 | When overflows or underflows happen, the instruction saturates the | |
6817 | results to the maximum or the minimum. | |
6818 | ||
d2eeb2d1 RS |
6819 | @cindex @code{extv@var{m}} instruction pattern |
6820 | @item @samp{extv@var{m}} | |
6821 | Extract a bit-field from register operand 1, sign-extend it, and store | |
6822 | it in operand 0. Operand 2 specifies the width of the field in bits | |
6823 | and operand 3 the starting bit, which counts from the most significant | |
6824 | bit if @samp{BITS_BIG_ENDIAN} is true and from the least significant bit | |
6825 | otherwise. | |
6826 | ||
6827 | Operands 0 and 1 both have mode @var{m}. Operands 2 and 3 have a | |
6828 | target-specific mode. | |
6829 | ||
6830 | @cindex @code{extvmisalign@var{m}} instruction pattern | |
6831 | @item @samp{extvmisalign@var{m}} | |
6832 | Extract a bit-field from memory operand 1, sign extend it, and store | |
6833 | it in operand 0. Operand 2 specifies the width in bits and operand 3 | |
6834 | the starting bit. The starting bit is always somewhere in the first byte of | |
6835 | operand 1; it counts from the most significant bit if @samp{BITS_BIG_ENDIAN} | |
6836 | is true and from the least significant bit otherwise. | |
6837 | ||
6838 | Operand 0 has mode @var{m} while operand 1 has @code{BLK} mode. | |
6839 | Operands 2 and 3 have a target-specific mode. | |
6840 | ||
6841 | The instruction must not read beyond the last byte of the bit-field. | |
6842 | ||
6843 | @cindex @code{extzv@var{m}} instruction pattern | |
6844 | @item @samp{extzv@var{m}} | |
6845 | Like @samp{extv@var{m}} except that the bit-field value is zero-extended. | |
6846 | ||
6847 | @cindex @code{extzvmisalign@var{m}} instruction pattern | |
6848 | @item @samp{extzvmisalign@var{m}} | |
6849 | Like @samp{extvmisalign@var{m}} except that the bit-field value is | |
6850 | zero-extended. | |
6851 | ||
6852 | @cindex @code{insv@var{m}} instruction pattern | |
6853 | @item @samp{insv@var{m}} | |
6854 | Insert operand 3 into a bit-field of register operand 0. Operand 1 | |
6855 | specifies the width of the field in bits and operand 2 the starting bit, | |
6856 | which counts from the most significant bit if @samp{BITS_BIG_ENDIAN} | |
6857 | is true and from the least significant bit otherwise. | |
6858 | ||
6859 | Operands 0 and 3 both have mode @var{m}. Operands 1 and 2 have a | |
6860 | target-specific mode. | |
6861 | ||
6862 | @cindex @code{insvmisalign@var{m}} instruction pattern | |
6863 | @item @samp{insvmisalign@var{m}} | |
6864 | Insert operand 3 into a bit-field of memory operand 0. Operand 1 | |
6865 | specifies the width of the field in bits and operand 2 the starting bit. | |
6866 | The starting bit is always somewhere in the first byte of operand 0; | |
6867 | it counts from the most significant bit if @samp{BITS_BIG_ENDIAN} | |
6868 | is true and from the least significant bit otherwise. | |
6869 | ||
6870 | Operand 3 has mode @var{m} while operand 0 has @code{BLK} mode. | |
6871 | Operands 1 and 2 have a target-specific mode. | |
6872 | ||
6873 | The instruction must not read or write beyond the last byte of the bit-field. | |
6874 | ||
03dda8e3 RK |
6875 | @cindex @code{extv} instruction pattern |
6876 | @item @samp{extv} | |
c771326b | 6877 | Extract a bit-field from operand 1 (a register or memory operand), where |
03dda8e3 RK |
6878 | operand 2 specifies the width in bits and operand 3 the starting bit, |
6879 | and store it in operand 0. Operand 0 must have mode @code{word_mode}. | |
6880 | Operand 1 may have mode @code{byte_mode} or @code{word_mode}; often | |
6881 | @code{word_mode} is allowed only for registers. Operands 2 and 3 must | |
6882 | be valid for @code{word_mode}. | |
6883 | ||
6884 | The RTL generation pass generates this instruction only with constants | |
3ab997e8 | 6885 | for operands 2 and 3 and the constant is never zero for operand 2. |
03dda8e3 RK |
6886 | |
6887 | The bit-field value is sign-extended to a full word integer | |
6888 | before it is stored in operand 0. | |
6889 | ||
d2eeb2d1 RS |
6890 | This pattern is deprecated; please use @samp{extv@var{m}} and |
6891 | @code{extvmisalign@var{m}} instead. | |
6892 | ||
03dda8e3 RK |
6893 | @cindex @code{extzv} instruction pattern |
6894 | @item @samp{extzv} | |
6895 | Like @samp{extv} except that the bit-field value is zero-extended. | |
6896 | ||
d2eeb2d1 RS |
6897 | This pattern is deprecated; please use @samp{extzv@var{m}} and |
6898 | @code{extzvmisalign@var{m}} instead. | |
6899 | ||
03dda8e3 RK |
6900 | @cindex @code{insv} instruction pattern |
6901 | @item @samp{insv} | |
c771326b JM |
6902 | Store operand 3 (which must be valid for @code{word_mode}) into a |
6903 | bit-field in operand 0, where operand 1 specifies the width in bits and | |
03dda8e3 RK |
6904 | operand 2 the starting bit. Operand 0 may have mode @code{byte_mode} or |
6905 | @code{word_mode}; often @code{word_mode} is allowed only for registers. | |
6906 | Operands 1 and 2 must be valid for @code{word_mode}. | |
6907 | ||
6908 | The RTL generation pass generates this instruction only with constants | |
3ab997e8 | 6909 | for operands 1 and 2 and the constant is never zero for operand 1. |
03dda8e3 | 6910 | |
d2eeb2d1 RS |
6911 | This pattern is deprecated; please use @samp{insv@var{m}} and |
6912 | @code{insvmisalign@var{m}} instead. | |
6913 | ||
03dda8e3 RK |
6914 | @cindex @code{mov@var{mode}cc} instruction pattern |
6915 | @item @samp{mov@var{mode}cc} | |
6916 | Conditionally move operand 2 or operand 3 into operand 0 according to the | |
6917 | comparison in operand 1. If the comparison is true, operand 2 is moved | |
6918 | into operand 0, otherwise operand 3 is moved. | |
6919 | ||
6920 | The mode of the operands being compared need not be the same as the operands | |
6921 | being moved. Some machines, sparc64 for example, have instructions that | |
6922 | conditionally move an integer value based on the floating point condition | |
6923 | codes and vice versa. | |
6924 | ||
6925 | If the machine does not have conditional move instructions, do not | |
6926 | define these patterns. | |
6927 | ||
068f5dea | 6928 | @cindex @code{add@var{mode}cc} instruction pattern |
4b5cc2b3 | 6929 | @item @samp{add@var{mode}cc} |
068f5dea JH |
6930 | Similar to @samp{mov@var{mode}cc} but for conditional addition. Conditionally |
6931 | move operand 2 or (operands 2 + operand 3) into operand 0 according to the | |
5285c21c | 6932 | comparison in operand 1. If the comparison is false, operand 2 is moved into |
4b5cc2b3 | 6933 | operand 0, otherwise (operand 2 + operand 3) is moved. |
068f5dea | 6934 | |
0972596e RS |
6935 | @cindex @code{cond_add@var{mode}} instruction pattern |
6936 | @cindex @code{cond_sub@var{mode}} instruction pattern | |
6c4fd4a9 RS |
6937 | @cindex @code{cond_mul@var{mode}} instruction pattern |
6938 | @cindex @code{cond_div@var{mode}} instruction pattern | |
6939 | @cindex @code{cond_udiv@var{mode}} instruction pattern | |
6940 | @cindex @code{cond_mod@var{mode}} instruction pattern | |
6941 | @cindex @code{cond_umod@var{mode}} instruction pattern | |
0972596e RS |
6942 | @cindex @code{cond_and@var{mode}} instruction pattern |
6943 | @cindex @code{cond_ior@var{mode}} instruction pattern | |
6944 | @cindex @code{cond_xor@var{mode}} instruction pattern | |
6945 | @cindex @code{cond_smin@var{mode}} instruction pattern | |
6946 | @cindex @code{cond_smax@var{mode}} instruction pattern | |
6947 | @cindex @code{cond_umin@var{mode}} instruction pattern | |
6948 | @cindex @code{cond_umax@var{mode}} instruction pattern | |
70613000 RS |
6949 | @cindex @code{cond_fmin@var{mode}} instruction pattern |
6950 | @cindex @code{cond_fmax@var{mode}} instruction pattern | |
c04bb6d9 RS |
6951 | @cindex @code{cond_ashl@var{mode}} instruction pattern |
6952 | @cindex @code{cond_ashr@var{mode}} instruction pattern | |
6953 | @cindex @code{cond_lshr@var{mode}} instruction pattern | |
0972596e RS |
6954 | @item @samp{cond_add@var{mode}} |
6955 | @itemx @samp{cond_sub@var{mode}} | |
6c4fd4a9 RS |
6956 | @itemx @samp{cond_mul@var{mode}} |
6957 | @itemx @samp{cond_div@var{mode}} | |
6958 | @itemx @samp{cond_udiv@var{mode}} | |
6959 | @itemx @samp{cond_mod@var{mode}} | |
6960 | @itemx @samp{cond_umod@var{mode}} | |
0972596e RS |
6961 | @itemx @samp{cond_and@var{mode}} |
6962 | @itemx @samp{cond_ior@var{mode}} | |
6963 | @itemx @samp{cond_xor@var{mode}} | |
6964 | @itemx @samp{cond_smin@var{mode}} | |
6965 | @itemx @samp{cond_smax@var{mode}} | |
6966 | @itemx @samp{cond_umin@var{mode}} | |
6967 | @itemx @samp{cond_umax@var{mode}} | |
70613000 RS |
6968 | @itemx @samp{cond_fmin@var{mode}} |
6969 | @itemx @samp{cond_fmax@var{mode}} | |
c04bb6d9 RS |
6970 | @itemx @samp{cond_ashl@var{mode}} |
6971 | @itemx @samp{cond_ashr@var{mode}} | |
6972 | @itemx @samp{cond_lshr@var{mode}} | |
9d4ac06e RS |
6973 | When operand 1 is true, perform an operation on operands 2 and 3 and |
6974 | store the result in operand 0, otherwise store operand 4 in operand 0. | |
6975 | The operation works elementwise if the operands are vectors. | |
6976 | ||
6977 | The scalar case is equivalent to: | |
6978 | ||
6979 | @smallexample | |
6980 | op0 = op1 ? op2 @var{op} op3 : op4; | |
6981 | @end smallexample | |
6982 | ||
6983 | while the vector case is equivalent to: | |
0972596e RS |
6984 | |
6985 | @smallexample | |
9d4ac06e RS |
6986 | for (i = 0; i < GET_MODE_NUNITS (@var{m}); i++) |
6987 | op0[i] = op1[i] ? op2[i] @var{op} op3[i] : op4[i]; | |
0972596e RS |
6988 | @end smallexample |
6989 | ||
6990 | where, for example, @var{op} is @code{+} for @samp{cond_add@var{mode}}. | |
6991 | ||
6992 | When defined for floating-point modes, the contents of @samp{op3[i]} | |
06293766 | 6993 | are not interpreted if @samp{op1[i]} is false, just like they would not |
0972596e RS |
6994 | be in a normal C @samp{?:} condition. |
6995 | ||
9d4ac06e RS |
6996 | Operands 0, 2, 3 and 4 all have mode @var{m}. Operand 1 is a scalar |
6997 | integer if @var{m} is scalar, otherwise it has the mode returned by | |
6998 | @code{TARGET_VECTORIZE_GET_MASK_MODE}. | |
0972596e | 6999 | |
c04bb6d9 RS |
7000 | @samp{cond_@var{op}@var{mode}} generally corresponds to a conditional |
7001 | form of @samp{@var{op}@var{mode}3}. As an exception, the vector forms | |
7002 | of shifts correspond to patterns like @code{vashl@var{mode}3} rather | |
7003 | than patterns like @code{ashl@var{mode}3}. | |
7004 | ||
b41d1f6e RS |
7005 | @cindex @code{cond_fma@var{mode}} instruction pattern |
7006 | @cindex @code{cond_fms@var{mode}} instruction pattern | |
7007 | @cindex @code{cond_fnma@var{mode}} instruction pattern | |
7008 | @cindex @code{cond_fnms@var{mode}} instruction pattern | |
7009 | @item @samp{cond_fma@var{mode}} | |
7010 | @itemx @samp{cond_fms@var{mode}} | |
7011 | @itemx @samp{cond_fnma@var{mode}} | |
7012 | @itemx @samp{cond_fnms@var{mode}} | |
7013 | Like @samp{cond_add@var{m}}, except that the conditional operation | |
7014 | takes 3 operands rather than two. For example, the vector form of | |
7015 | @samp{cond_fma@var{mode}} is equivalent to: | |
7016 | ||
7017 | @smallexample | |
7018 | for (i = 0; i < GET_MODE_NUNITS (@var{m}); i++) | |
7019 | op0[i] = op1[i] ? fma (op2[i], op3[i], op4[i]) : op5[i]; | |
7020 | @end smallexample | |
7021 | ||
ce68b5cf KT |
7022 | @cindex @code{neg@var{mode}cc} instruction pattern |
7023 | @item @samp{neg@var{mode}cc} | |
7024 | Similar to @samp{mov@var{mode}cc} but for conditional negation. Conditionally | |
7025 | move the negation of operand 2 or the unchanged operand 3 into operand 0 | |
7026 | according to the comparison in operand 1. If the comparison is true, the negation | |
7027 | of operand 2 is moved into operand 0, otherwise operand 3 is moved. | |
7028 | ||
7029 | @cindex @code{not@var{mode}cc} instruction pattern | |
7030 | @item @samp{not@var{mode}cc} | |
7031 | Similar to @samp{neg@var{mode}cc} but for conditional complement. | |
7032 | Conditionally move the bitwise complement of operand 2 or the unchanged | |
7033 | operand 3 into operand 0 according to the comparison in operand 1. | |
7034 | If the comparison is true, the complement of operand 2 is moved into | |
7035 | operand 0, otherwise operand 3 is moved. | |
7036 | ||
f90b7a5a PB |
7037 | @cindex @code{cstore@var{mode}4} instruction pattern |
7038 | @item @samp{cstore@var{mode}4} | |
7039 | Store zero or nonzero in operand 0 according to whether a comparison | |
7040 | is true. Operand 1 is a comparison operator. Operand 2 and operand 3 | |
7041 | are the first and second operand of the comparison, respectively. | |
7042 | You specify the mode that operand 0 must have when you write the | |
7043 | @code{match_operand} expression. The compiler automatically sees which | |
7044 | mode you have used and supplies an operand of that mode. | |
03dda8e3 RK |
7045 | |
7046 | The value stored for a true condition must have 1 as its low bit, or | |
7047 | else must be negative. Otherwise the instruction is not suitable and | |
7048 | you should omit it from the machine description. You describe to the | |
7049 | compiler exactly which value is stored by defining the macro | |
7050 | @code{STORE_FLAG_VALUE} (@pxref{Misc}). If a description cannot be | |
ac5eda13 PB |
7051 | found that can be used for all the possible comparison operators, you |
7052 | should pick one and use a @code{define_expand} to map all results | |
7053 | onto the one you chose. | |
7054 | ||
7055 | These operations may @code{FAIL}, but should do so only in relatively | |
7056 | uncommon cases; if they would @code{FAIL} for common cases involving | |
7057 | integer comparisons, it is best to restrict the predicates to not | |
7058 | allow these operands. Likewise if a given comparison operator will | |
7059 | always fail, independent of the operands (for floating-point modes, the | |
7060 | @code{ordered_comparison_operator} predicate is often useful in this case). | |
7061 | ||
7062 | If this pattern is omitted, the compiler will generate a conditional | |
7063 | branch---for example, it may copy a constant one to the target and branching | |
7064 | around an assignment of zero to the target---or a libcall. If the predicate | |
7065 | for operand 1 only rejects some operators, it will also try reordering the | |
7066 | operands and/or inverting the result value (e.g.@: by an exclusive OR). | |
7067 | These possibilities could be cheaper or equivalent to the instructions | |
7068 | used for the @samp{cstore@var{mode}4} pattern followed by those required | |
7069 | to convert a positive result from @code{STORE_FLAG_VALUE} to 1; in this | |
7070 | case, you can and should make operand 1's predicate reject some operators | |
7071 | in the @samp{cstore@var{mode}4} pattern, or remove the pattern altogether | |
7072 | from the machine description. | |
03dda8e3 | 7073 | |
66c87bae KH |
7074 | @cindex @code{cbranch@var{mode}4} instruction pattern |
7075 | @item @samp{cbranch@var{mode}4} | |
7076 | Conditional branch instruction combined with a compare instruction. | |
7077 | Operand 0 is a comparison operator. Operand 1 and operand 2 are the | |
7078 | first and second operands of the comparison, respectively. Operand 3 | |
481efdd9 | 7079 | is the @code{code_label} to jump to. |
66c87bae | 7080 | |
d26eedb6 HPN |
7081 | @cindex @code{jump} instruction pattern |
7082 | @item @samp{jump} | |
7083 | A jump inside a function; an unconditional branch. Operand 0 is the | |
481efdd9 EB |
7084 | @code{code_label} to jump to. This pattern name is mandatory on all |
7085 | machines. | |
d26eedb6 | 7086 | |
03dda8e3 RK |
7087 | @cindex @code{call} instruction pattern |
7088 | @item @samp{call} | |
7089 | Subroutine call instruction returning no value. Operand 0 is the | |
7090 | function to call; operand 1 is the number of bytes of arguments pushed | |
ee189a73 HPN |
7091 | as a @code{const_int}. Operand 2 is the result of calling the target |
7092 | hook @code{TARGET_FUNCTION_ARG} with the second argument @code{arg} | |
7093 | yielding true for @code{arg.end_marker_p ()}, in a call after all | |
7094 | parameters have been passed to that hook. By default this is the first | |
7095 | register beyond those used for arguments in the call, or @code{NULL} if | |
7096 | all the argument-registers are used in the call. | |
03dda8e3 RK |
7097 | |
7098 | On most machines, operand 2 is not actually stored into the RTL | |
7099 | pattern. It is supplied for the sake of some RISC machines which need | |
7100 | to put this information into the assembler code; they can put it in | |
7101 | the RTL instead of operand 1. | |
7102 | ||
7103 | Operand 0 should be a @code{mem} RTX whose address is the address of the | |
7104 | function. Note, however, that this address can be a @code{symbol_ref} | |
7105 | expression even if it would not be a legitimate memory address on the | |
7106 | target machine. If it is also not a valid argument for a call | |
7107 | instruction, the pattern for this operation should be a | |
7108 | @code{define_expand} (@pxref{Expander Definitions}) that places the | |
7109 | address into a register and uses that register in the call instruction. | |
7110 | ||
7111 | @cindex @code{call_value} instruction pattern | |
7112 | @item @samp{call_value} | |
7113 | Subroutine call instruction returning a value. Operand 0 is the hard | |
7114 | register in which the value is returned. There are three more | |
7115 | operands, the same as the three operands of the @samp{call} | |
7116 | instruction (but with numbers increased by one). | |
7117 | ||
7118 | Subroutines that return @code{BLKmode} objects use the @samp{call} | |
7119 | insn. | |
7120 | ||
7121 | @cindex @code{call_pop} instruction pattern | |
7122 | @cindex @code{call_value_pop} instruction pattern | |
7123 | @item @samp{call_pop}, @samp{call_value_pop} | |
7124 | Similar to @samp{call} and @samp{call_value}, except used if defined and | |
df2a54e9 | 7125 | if @code{RETURN_POPS_ARGS} is nonzero. They should emit a @code{parallel} |
03dda8e3 RK |
7126 | that contains both the function call and a @code{set} to indicate the |
7127 | adjustment made to the frame pointer. | |
7128 | ||
df2a54e9 | 7129 | For machines where @code{RETURN_POPS_ARGS} can be nonzero, the use of these |
03dda8e3 RK |
7130 | patterns increases the number of functions for which the frame pointer |
7131 | can be eliminated, if desired. | |
7132 | ||
7133 | @cindex @code{untyped_call} instruction pattern | |
7134 | @item @samp{untyped_call} | |
7135 | Subroutine call instruction returning a value of any type. Operand 0 is | |
7136 | the function to call; operand 1 is a memory location where the result of | |
7137 | calling the function is to be stored; operand 2 is a @code{parallel} | |
7138 | expression where each element is a @code{set} expression that indicates | |
7139 | the saving of a function return value into the result block. | |
7140 | ||
7141 | This instruction pattern should be defined to support | |
7142 | @code{__builtin_apply} on machines where special instructions are needed | |
7143 | to call a subroutine with arbitrary arguments or to save the value | |
7144 | returned. This instruction pattern is required on machines that have | |
e979f9e8 JM |
7145 | multiple registers that can hold a return value |
7146 | (i.e.@: @code{FUNCTION_VALUE_REGNO_P} is true for more than one register). | |
03dda8e3 RK |
7147 | |
7148 | @cindex @code{return} instruction pattern | |
7149 | @item @samp{return} | |
7150 | Subroutine return instruction. This instruction pattern name should be | |
7151 | defined only if a single instruction can do all the work of returning | |
7152 | from a function. | |
7153 | ||
7154 | Like the @samp{mov@var{m}} patterns, this pattern is also used after the | |
7155 | RTL generation phase. In this case it is to support machines where | |
7156 | multiple instructions are usually needed to return from a function, but | |
7157 | some class of functions only requires one instruction to implement a | |
7158 | return. Normally, the applicable functions are those which do not need | |
7159 | to save any registers or allocate stack space. | |
7160 | ||
26898771 BS |
7161 | It is valid for this pattern to expand to an instruction using |
7162 | @code{simple_return} if no epilogue is required. | |
7163 | ||
7164 | @cindex @code{simple_return} instruction pattern | |
7165 | @item @samp{simple_return} | |
7166 | Subroutine return instruction. This instruction pattern name should be | |
7167 | defined only if a single instruction can do all the work of returning | |
7168 | from a function on a path where no epilogue is required. This pattern | |
7169 | is very similar to the @code{return} instruction pattern, but it is emitted | |
7170 | only by the shrink-wrapping optimization on paths where the function | |
7171 | prologue has not been executed, and a function return should occur without | |
7172 | any of the effects of the epilogue. Additional uses may be introduced on | |
7173 | paths where both the prologue and the epilogue have executed. | |
7174 | ||
03dda8e3 RK |
7175 | @findex reload_completed |
7176 | @findex leaf_function_p | |
7177 | For such machines, the condition specified in this pattern should only | |
df2a54e9 | 7178 | be true when @code{reload_completed} is nonzero and the function's |
03dda8e3 RK |
7179 | epilogue would only be a single instruction. For machines with register |
7180 | windows, the routine @code{leaf_function_p} may be used to determine if | |
7181 | a register window push is required. | |
7182 | ||
7183 | Machines that have conditional return instructions should define patterns | |
7184 | such as | |
7185 | ||
7186 | @smallexample | |
7187 | (define_insn "" | |
7188 | [(set (pc) | |
7189 | (if_then_else (match_operator | |
7190 | 0 "comparison_operator" | |
bd1cd0d0 | 7191 | [(reg:CC CC_REG) (const_int 0)]) |
03dda8e3 RK |
7192 | (return) |
7193 | (pc)))] | |
7194 | "@var{condition}" | |
7195 | "@dots{}") | |
7196 | @end smallexample | |
7197 | ||
7198 | where @var{condition} would normally be the same condition specified on the | |
7199 | named @samp{return} pattern. | |
7200 | ||
7201 | @cindex @code{untyped_return} instruction pattern | |
7202 | @item @samp{untyped_return} | |
7203 | Untyped subroutine return instruction. This instruction pattern should | |
7204 | be defined to support @code{__builtin_return} on machines where special | |
7205 | instructions are needed to return a value of any type. | |
7206 | ||
7207 | Operand 0 is a memory location where the result of calling a function | |
7208 | with @code{__builtin_apply} is stored; operand 1 is a @code{parallel} | |
7209 | expression where each element is a @code{set} expression that indicates | |
7210 | the restoring of a function return value from the result block. | |
7211 | ||
7212 | @cindex @code{nop} instruction pattern | |
7213 | @item @samp{nop} | |
7214 | No-op instruction. This instruction pattern name should always be defined | |
7215 | to output a no-op in assembler code. @code{(const_int 0)} will do as an | |
7216 | RTL pattern. | |
7217 | ||
7218 | @cindex @code{indirect_jump} instruction pattern | |
7219 | @item @samp{indirect_jump} | |
7220 | An instruction to jump to an address which is operand zero. | |
7221 | This pattern name is mandatory on all machines. | |
7222 | ||
7223 | @cindex @code{casesi} instruction pattern | |
7224 | @item @samp{casesi} | |
7225 | Instruction to jump through a dispatch table, including bounds checking. | |
7226 | This instruction takes five operands: | |
7227 | ||
7228 | @enumerate | |
7229 | @item | |
7230 | The index to dispatch on, which has mode @code{SImode}. | |
7231 | ||
7232 | @item | |
7233 | The lower bound for indices in the table, an integer constant. | |
7234 | ||
7235 | @item | |
7236 | The total range of indices in the table---the largest index | |
7237 | minus the smallest one (both inclusive). | |
7238 | ||
7239 | @item | |
7240 | A label that precedes the table itself. | |
7241 | ||
7242 | @item | |
7243 | A label to jump to if the index has a value outside the bounds. | |
03dda8e3 RK |
7244 | @end enumerate |
7245 | ||
e4ae5e77 | 7246 | The table is an @code{addr_vec} or @code{addr_diff_vec} inside of a |
da5c6bde | 7247 | @code{jump_table_data}. The number of elements in the table is one plus the |
03dda8e3 RK |
7248 | difference between the upper bound and the lower bound. |
7249 | ||
7250 | @cindex @code{tablejump} instruction pattern | |
7251 | @item @samp{tablejump} | |
7252 | Instruction to jump to a variable address. This is a low-level | |
7253 | capability which can be used to implement a dispatch table when there | |
7254 | is no @samp{casesi} pattern. | |
7255 | ||
7256 | This pattern requires two operands: the address or offset, and a label | |
7257 | which should immediately precede the jump table. If the macro | |
f1f5f142 JL |
7258 | @code{CASE_VECTOR_PC_RELATIVE} evaluates to a nonzero value then the first |
7259 | operand is an offset which counts from the address of the table; otherwise, | |
7260 | it is an absolute address to jump to. In either case, the first operand has | |
03dda8e3 RK |
7261 | mode @code{Pmode}. |
7262 | ||
7263 | The @samp{tablejump} insn is always the last insn before the jump | |
7264 | table it uses. Its assembler code normally has no need to use the | |
7265 | second operand, but you should incorporate it in the RTL pattern so | |
7266 | that the jump optimizer will not delete the table as unreachable code. | |
7267 | ||
6e4fcc95 | 7268 | |
6e4fcc95 MH |
7269 | @cindex @code{doloop_end} instruction pattern |
7270 | @item @samp{doloop_end} | |
1d0216c8 RS |
7271 | Conditional branch instruction that decrements a register and |
7272 | jumps if the register is nonzero. Operand 0 is the register to | |
7273 | decrement and test; operand 1 is the label to jump to if the | |
7274 | register is nonzero. | |
5c25e11d | 7275 | @xref{Looping Patterns}. |
6e4fcc95 MH |
7276 | |
7277 | This optional instruction pattern should be defined for machines with | |
7278 | low-overhead looping instructions as the loop optimizer will try to | |
1d0216c8 RS |
7279 | modify suitable loops to utilize it. The target hook |
7280 | @code{TARGET_CAN_USE_DOLOOP_P} controls the conditions under which | |
7281 | low-overhead loops can be used. | |
6e4fcc95 MH |
7282 | |
7283 | @cindex @code{doloop_begin} instruction pattern | |
7284 | @item @samp{doloop_begin} | |
7285 | Companion instruction to @code{doloop_end} required for machines that | |
1d0216c8 RS |
7286 | need to perform some initialization, such as loading a special counter |
7287 | register. Operand 1 is the associated @code{doloop_end} pattern and | |
7288 | operand 0 is the register that it decrements. | |
6e4fcc95 | 7289 | |
1d0216c8 RS |
7290 | If initialization insns do not always need to be emitted, use a |
7291 | @code{define_expand} (@pxref{Expander Definitions}) and make it fail. | |
6e4fcc95 | 7292 | |
03dda8e3 RK |
7293 | @cindex @code{canonicalize_funcptr_for_compare} instruction pattern |
7294 | @item @samp{canonicalize_funcptr_for_compare} | |
7295 | Canonicalize the function pointer in operand 1 and store the result | |
7296 | into operand 0. | |
7297 | ||
7298 | Operand 0 is always a @code{reg} and has mode @code{Pmode}; operand 1 | |
7299 | may be a @code{reg}, @code{mem}, @code{symbol_ref}, @code{const_int}, etc | |
7300 | and also has mode @code{Pmode}. | |
7301 | ||
7302 | Canonicalization of a function pointer usually involves computing | |
7303 | the address of the function which would be called if the function | |
7304 | pointer were used in an indirect call. | |
7305 | ||
7306 | Only define this pattern if function pointers on the target machine | |
7307 | can have different values but still call the same function when | |
7308 | used in an indirect call. | |
7309 | ||
7310 | @cindex @code{save_stack_block} instruction pattern | |
7311 | @cindex @code{save_stack_function} instruction pattern | |
7312 | @cindex @code{save_stack_nonlocal} instruction pattern | |
7313 | @cindex @code{restore_stack_block} instruction pattern | |
7314 | @cindex @code{restore_stack_function} instruction pattern | |
7315 | @cindex @code{restore_stack_nonlocal} instruction pattern | |
7316 | @item @samp{save_stack_block} | |
7317 | @itemx @samp{save_stack_function} | |
7318 | @itemx @samp{save_stack_nonlocal} | |
7319 | @itemx @samp{restore_stack_block} | |
7320 | @itemx @samp{restore_stack_function} | |
7321 | @itemx @samp{restore_stack_nonlocal} | |
7322 | Most machines save and restore the stack pointer by copying it to or | |
7323 | from an object of mode @code{Pmode}. Do not define these patterns on | |
7324 | such machines. | |
7325 | ||
7326 | Some machines require special handling for stack pointer saves and | |
7327 | restores. On those machines, define the patterns corresponding to the | |
7328 | non-standard cases by using a @code{define_expand} (@pxref{Expander | |
7329 | Definitions}) that produces the required insns. The three types of | |
7330 | saves and restores are: | |
7331 | ||
7332 | @enumerate | |
7333 | @item | |
7334 | @samp{save_stack_block} saves the stack pointer at the start of a block | |
7335 | that allocates a variable-sized object, and @samp{restore_stack_block} | |
7336 | restores the stack pointer when the block is exited. | |
7337 | ||
7338 | @item | |
7339 | @samp{save_stack_function} and @samp{restore_stack_function} do a | |
7340 | similar job for the outermost block of a function and are used when the | |
7341 | function allocates variable-sized objects or calls @code{alloca}. Only | |
7342 | the epilogue uses the restored stack pointer, allowing a simpler save or | |
7343 | restore sequence on some machines. | |
7344 | ||
7345 | @item | |
7346 | @samp{save_stack_nonlocal} is used in functions that contain labels | |
7347 | branched to by nested functions. It saves the stack pointer in such a | |
7348 | way that the inner function can use @samp{restore_stack_nonlocal} to | |
7349 | restore the stack pointer. The compiler generates code to restore the | |
7350 | frame and argument pointer registers, but some machines require saving | |
7351 | and restoring additional data such as register window information or | |
7352 | stack backchains. Place insns in these patterns to save and restore any | |
7353 | such required data. | |
7354 | @end enumerate | |
7355 | ||
7356 | When saving the stack pointer, operand 0 is the save area and operand 1 | |
73c8090f DE |
7357 | is the stack pointer. The mode used to allocate the save area defaults |
7358 | to @code{Pmode} but you can override that choice by defining the | |
7e390c9d | 7359 | @code{STACK_SAVEAREA_MODE} macro (@pxref{Storage Layout}). You must |
73c8090f DE |
7360 | specify an integral mode, or @code{VOIDmode} if no save area is needed |
7361 | for a particular type of save (either because no save is needed or | |
7362 | because a machine-specific save area can be used). Operand 0 is the | |
7363 | stack pointer and operand 1 is the save area for restore operations. If | |
7364 | @samp{save_stack_block} is defined, operand 0 must not be | |
7365 | @code{VOIDmode} since these saves can be arbitrarily nested. | |
03dda8e3 RK |
7366 | |
7367 | A save area is a @code{mem} that is at a constant offset from | |
7368 | @code{virtual_stack_vars_rtx} when the stack pointer is saved for use by | |
7369 | nonlocal gotos and a @code{reg} in the other two cases. | |
7370 | ||
7371 | @cindex @code{allocate_stack} instruction pattern | |
7372 | @item @samp{allocate_stack} | |
72938a4c | 7373 | Subtract (or add if @code{STACK_GROWS_DOWNWARD} is undefined) operand 1 from |
03dda8e3 RK |
7374 | the stack pointer to create space for dynamically allocated data. |
7375 | ||
72938a4c MM |
7376 | Store the resultant pointer to this space into operand 0. If you |
7377 | are allocating space from the main stack, do this by emitting a | |
7378 | move insn to copy @code{virtual_stack_dynamic_rtx} to operand 0. | |
7379 | If you are allocating the space elsewhere, generate code to copy the | |
7380 | location of the space to operand 0. In the latter case, you must | |
956d6950 | 7381 | ensure this space gets freed when the corresponding space on the main |
72938a4c MM |
7382 | stack is free. |
7383 | ||
03dda8e3 RK |
7384 | Do not define this pattern if all that must be done is the subtraction. |
7385 | Some machines require other operations such as stack probes or | |
7386 | maintaining the back chain. Define this pattern to emit those | |
7387 | operations in addition to updating the stack pointer. | |
7388 | ||
861bb6c1 JL |
7389 | @cindex @code{check_stack} instruction pattern |
7390 | @item @samp{check_stack} | |
507d0069 EB |
7391 | If stack checking (@pxref{Stack Checking}) cannot be done on your system by |
7392 | probing the stack, define this pattern to perform the needed check and signal | |
7393 | an error if the stack has overflowed. The single operand is the address in | |
7394 | the stack farthest from the current stack pointer that you need to validate. | |
7395 | Normally, on platforms where this pattern is needed, you would obtain the | |
7396 | stack limit from a global or thread-specific variable or register. | |
d809253a | 7397 | |
7b84aac0 EB |
7398 | @cindex @code{probe_stack_address} instruction pattern |
7399 | @item @samp{probe_stack_address} | |
7400 | If stack checking (@pxref{Stack Checking}) can be done on your system by | |
7401 | probing the stack but without the need to actually access it, define this | |
7402 | pattern and signal an error if the stack has overflowed. The single operand | |
7403 | is the memory address in the stack that needs to be probed. | |
7404 | ||
d809253a EB |
7405 | @cindex @code{probe_stack} instruction pattern |
7406 | @item @samp{probe_stack} | |
507d0069 EB |
7407 | If stack checking (@pxref{Stack Checking}) can be done on your system by |
7408 | probing the stack but doing it with a ``store zero'' instruction is not valid | |
7409 | or optimal, define this pattern to do the probing differently and signal an | |
7410 | error if the stack has overflowed. The single operand is the memory reference | |
7411 | in the stack that needs to be probed. | |
861bb6c1 | 7412 | |
03dda8e3 RK |
7413 | @cindex @code{nonlocal_goto} instruction pattern |
7414 | @item @samp{nonlocal_goto} | |
7415 | Emit code to generate a non-local goto, e.g., a jump from one function | |
7416 | to a label in an outer function. This pattern has four arguments, | |
7417 | each representing a value to be used in the jump. The first | |
45bb86fd | 7418 | argument is to be loaded into the frame pointer, the second is |
03dda8e3 RK |
7419 | the address to branch to (code to dispatch to the actual label), |
7420 | the third is the address of a location where the stack is saved, | |
7421 | and the last is the address of the label, to be placed in the | |
7422 | location for the incoming static chain. | |
7423 | ||
f0523f02 | 7424 | On most machines you need not define this pattern, since GCC will |
03dda8e3 RK |
7425 | already generate the correct code, which is to load the frame pointer |
7426 | and static chain, restore the stack (using the | |
7427 | @samp{restore_stack_nonlocal} pattern, if defined), and jump indirectly | |
7428 | to the dispatcher. You need only define this pattern if this code will | |
7429 | not work on your machine. | |
7430 | ||
7431 | @cindex @code{nonlocal_goto_receiver} instruction pattern | |
7432 | @item @samp{nonlocal_goto_receiver} | |
7433 | This pattern, if defined, contains code needed at the target of a | |
161d7b59 | 7434 | nonlocal goto after the code already generated by GCC@. You will not |
03dda8e3 RK |
7435 | normally need to define this pattern. A typical reason why you might |
7436 | need this pattern is if some value, such as a pointer to a global table, | |
c30ddbc9 | 7437 | must be restored when the frame pointer is restored. Note that a nonlocal |
89bcce1b | 7438 | goto only occurs within a unit-of-translation, so a global table pointer |
c30ddbc9 RH |
7439 | that is shared by all functions of a given module need not be restored. |
7440 | There are no arguments. | |
861bb6c1 JL |
7441 | |
7442 | @cindex @code{exception_receiver} instruction pattern | |
7443 | @item @samp{exception_receiver} | |
7444 | This pattern, if defined, contains code needed at the site of an | |
7445 | exception handler that isn't needed at the site of a nonlocal goto. You | |
7446 | will not normally need to define this pattern. A typical reason why you | |
7447 | might need this pattern is if some value, such as a pointer to a global | |
7448 | table, must be restored after control flow is branched to the handler of | |
7449 | an exception. There are no arguments. | |
c85f7c16 | 7450 | |
c30ddbc9 RH |
7451 | @cindex @code{builtin_setjmp_setup} instruction pattern |
7452 | @item @samp{builtin_setjmp_setup} | |
7453 | This pattern, if defined, contains additional code needed to initialize | |
7454 | the @code{jmp_buf}. You will not normally need to define this pattern. | |
7455 | A typical reason why you might need this pattern is if some value, such | |
7456 | as a pointer to a global table, must be restored. Though it is | |
7457 | preferred that the pointer value be recalculated if possible (given the | |
7458 | address of a label for instance). The single argument is a pointer to | |
7459 | the @code{jmp_buf}. Note that the buffer is five words long and that | |
7460 | the first three are normally used by the generic mechanism. | |
7461 | ||
c85f7c16 JL |
7462 | @cindex @code{builtin_setjmp_receiver} instruction pattern |
7463 | @item @samp{builtin_setjmp_receiver} | |
e4ae5e77 | 7464 | This pattern, if defined, contains code needed at the site of a |
c771326b | 7465 | built-in setjmp that isn't needed at the site of a nonlocal goto. You |
c85f7c16 JL |
7466 | will not normally need to define this pattern. A typical reason why you |
7467 | might need this pattern is if some value, such as a pointer to a global | |
c30ddbc9 | 7468 | table, must be restored. It takes one argument, which is the label |
073a8998 | 7469 | to which builtin_longjmp transferred control; this pattern may be emitted |
c30ddbc9 RH |
7470 | at a small offset from that label. |
7471 | ||
7472 | @cindex @code{builtin_longjmp} instruction pattern | |
7473 | @item @samp{builtin_longjmp} | |
7474 | This pattern, if defined, performs the entire action of the longjmp. | |
7475 | You will not normally need to define this pattern unless you also define | |
7476 | @code{builtin_setjmp_setup}. The single argument is a pointer to the | |
7477 | @code{jmp_buf}. | |
f69864aa | 7478 | |
52a11cbf RH |
7479 | @cindex @code{eh_return} instruction pattern |
7480 | @item @samp{eh_return} | |
f69864aa | 7481 | This pattern, if defined, affects the way @code{__builtin_eh_return}, |
52a11cbf RH |
7482 | and thence the call frame exception handling library routines, are |
7483 | built. It is intended to handle non-trivial actions needed along | |
7484 | the abnormal return path. | |
7485 | ||
34dc173c | 7486 | The address of the exception handler to which the function should return |
daf2f129 | 7487 | is passed as operand to this pattern. It will normally need to copied by |
34dc173c UW |
7488 | the pattern to some special register or memory location. |
7489 | If the pattern needs to determine the location of the target call | |
7490 | frame in order to do so, it may use @code{EH_RETURN_STACKADJ_RTX}, | |
7491 | if defined; it will have already been assigned. | |
7492 | ||
7493 | If this pattern is not defined, the default action will be to simply | |
7494 | copy the return address to @code{EH_RETURN_HANDLER_RTX}. Either | |
7495 | that macro or this pattern needs to be defined if call frame exception | |
7496 | handling is to be used. | |
0b433de6 JL |
7497 | |
7498 | @cindex @code{prologue} instruction pattern | |
17b53c33 | 7499 | @anchor{prologue instruction pattern} |
0b433de6 JL |
7500 | @item @samp{prologue} |
7501 | This pattern, if defined, emits RTL for entry to a function. The function | |
b192711e | 7502 | entry is responsible for setting up the stack frame, initializing the frame |
0b433de6 JL |
7503 | pointer register, saving callee saved registers, etc. |
7504 | ||
7505 | Using a prologue pattern is generally preferred over defining | |
17b53c33 | 7506 | @code{TARGET_ASM_FUNCTION_PROLOGUE} to emit assembly code for the prologue. |
0b433de6 JL |
7507 | |
7508 | The @code{prologue} pattern is particularly useful for targets which perform | |
7509 | instruction scheduling. | |
7510 | ||
12c5ffe5 EB |
7511 | @cindex @code{window_save} instruction pattern |
7512 | @anchor{window_save instruction pattern} | |
7513 | @item @samp{window_save} | |
7514 | This pattern, if defined, emits RTL for a register window save. It should | |
7515 | be defined if the target machine has register windows but the window events | |
7516 | are decoupled from calls to subroutines. The canonical example is the SPARC | |
7517 | architecture. | |
7518 | ||
0b433de6 | 7519 | @cindex @code{epilogue} instruction pattern |
17b53c33 | 7520 | @anchor{epilogue instruction pattern} |
0b433de6 | 7521 | @item @samp{epilogue} |
396ad517 | 7522 | This pattern emits RTL for exit from a function. The function |
b192711e | 7523 | exit is responsible for deallocating the stack frame, restoring callee saved |
0b433de6 JL |
7524 | registers and emitting the return instruction. |
7525 | ||
7526 | Using an epilogue pattern is generally preferred over defining | |
17b53c33 | 7527 | @code{TARGET_ASM_FUNCTION_EPILOGUE} to emit assembly code for the epilogue. |
0b433de6 JL |
7528 | |
7529 | The @code{epilogue} pattern is particularly useful for targets which perform | |
7530 | instruction scheduling or which have delay slots for their return instruction. | |
7531 | ||
7532 | @cindex @code{sibcall_epilogue} instruction pattern | |
7533 | @item @samp{sibcall_epilogue} | |
7534 | This pattern, if defined, emits RTL for exit from a function without the final | |
7535 | branch back to the calling function. This pattern will be emitted before any | |
7536 | sibling call (aka tail call) sites. | |
7537 | ||
7538 | The @code{sibcall_epilogue} pattern must not clobber any arguments used for | |
7539 | parameter passing or any stack slots for arguments passed to the current | |
ebb48a4d | 7540 | function. |
a157febd GK |
7541 | |
7542 | @cindex @code{trap} instruction pattern | |
7543 | @item @samp{trap} | |
7544 | This pattern, if defined, signals an error, typically by causing some | |
4b1ea1f3 | 7545 | kind of signal to be raised. |
a157febd | 7546 | |
f90b7a5a PB |
7547 | @cindex @code{ctrap@var{MM}4} instruction pattern |
7548 | @item @samp{ctrap@var{MM}4} | |
a157febd | 7549 | Conditional trap instruction. Operand 0 is a piece of RTL which |
f90b7a5a PB |
7550 | performs a comparison, and operands 1 and 2 are the arms of the |
7551 | comparison. Operand 3 is the trap code, an integer. | |
a157febd | 7552 | |
f90b7a5a | 7553 | A typical @code{ctrap} pattern looks like |
a157febd GK |
7554 | |
7555 | @smallexample | |
f90b7a5a | 7556 | (define_insn "ctrapsi4" |
ebb48a4d | 7557 | [(trap_if (match_operator 0 "trap_operator" |
f90b7a5a | 7558 | [(match_operand 1 "register_operand") |
73b8bfe1 | 7559 | (match_operand 2 "immediate_operand")]) |
f90b7a5a | 7560 | (match_operand 3 "const_int_operand" "i"))] |
a157febd GK |
7561 | "" |
7562 | "@dots{}") | |
7563 | @end smallexample | |
7564 | ||
e83d297b JJ |
7565 | @cindex @code{prefetch} instruction pattern |
7566 | @item @samp{prefetch} | |
e83d297b JJ |
7567 | This pattern, if defined, emits code for a non-faulting data prefetch |
7568 | instruction. Operand 0 is the address of the memory to prefetch. Operand 1 | |
7569 | is a constant 1 if the prefetch is preparing for a write to the memory | |
7570 | address, or a constant 0 otherwise. Operand 2 is the expected degree of | |
7571 | temporal locality of the data and is a value between 0 and 3, inclusive; 0 | |
7572 | means that the data has no temporal locality, so it need not be left in the | |
7573 | cache after the access; 3 means that the data has a high degree of temporal | |
7574 | locality and should be left in all levels of cache possible; 1 and 2 mean, | |
7575 | respectively, a low or moderate degree of temporal locality. | |
7576 | ||
7577 | Targets that do not support write prefetches or locality hints can ignore | |
7578 | the values of operands 1 and 2. | |
7579 | ||
b6bd3371 DE |
7580 | @cindex @code{blockage} instruction pattern |
7581 | @item @samp{blockage} | |
b6bd3371 | 7582 | This pattern defines a pseudo insn that prevents the instruction |
adddc347 HPN |
7583 | scheduler and other passes from moving instructions and using register |
7584 | equivalences across the boundary defined by the blockage insn. | |
7585 | This needs to be an UNSPEC_VOLATILE pattern or a volatile ASM. | |
b6bd3371 | 7586 | |
51ced7e4 UB |
7587 | @cindex @code{memory_blockage} instruction pattern |
7588 | @item @samp{memory_blockage} | |
7589 | This pattern, if defined, represents a compiler memory barrier, and will be | |
7590 | placed at points across which RTL passes may not propagate memory accesses. | |
7591 | This instruction needs to read and write volatile BLKmode memory. It does | |
7592 | not need to generate any machine instruction. If this pattern is not defined, | |
7593 | the compiler falls back to emitting an instruction corresponding | |
7594 | to @code{asm volatile ("" ::: "memory")}. | |
7595 | ||
48ae6c13 RH |
7596 | @cindex @code{memory_barrier} instruction pattern |
7597 | @item @samp{memory_barrier} | |
48ae6c13 RH |
7598 | If the target memory model is not fully synchronous, then this pattern |
7599 | should be defined to an instruction that orders both loads and stores | |
7600 | before the instruction with respect to loads and stores after the instruction. | |
7601 | This pattern has no operands. | |
7602 | ||
425fc685 RE |
7603 | @cindex @code{speculation_barrier} instruction pattern |
7604 | @item @samp{speculation_barrier} | |
7605 | If the target can support speculative execution, then this pattern should | |
7606 | be defined to an instruction that will block subsequent execution until | |
7607 | any prior speculation conditions has been resolved. The pattern must also | |
7608 | ensure that the compiler cannot move memory operations past the barrier, | |
7609 | so it needs to be an UNSPEC_VOLATILE pattern. The pattern has no | |
7610 | operands. | |
7611 | ||
7612 | If this pattern is not defined then the default expansion of | |
7613 | @code{__builtin_speculation_safe_value} will emit a warning. You can | |
7614 | suppress this warning by defining this pattern with a final condition | |
7615 | of @code{0} (zero), which tells the compiler that a speculation | |
7616 | barrier is not needed for this target. | |
7617 | ||
48ae6c13 RH |
7618 | @cindex @code{sync_compare_and_swap@var{mode}} instruction pattern |
7619 | @item @samp{sync_compare_and_swap@var{mode}} | |
48ae6c13 RH |
7620 | This pattern, if defined, emits code for an atomic compare-and-swap |
7621 | operation. Operand 1 is the memory on which the atomic operation is | |
7622 | performed. Operand 2 is the ``old'' value to be compared against the | |
7623 | current contents of the memory location. Operand 3 is the ``new'' value | |
7624 | to store in the memory if the compare succeeds. Operand 0 is the result | |
915167f5 GK |
7625 | of the operation; it should contain the contents of the memory |
7626 | before the operation. If the compare succeeds, this should obviously be | |
7627 | a copy of operand 2. | |
48ae6c13 RH |
7628 | |
7629 | This pattern must show that both operand 0 and operand 1 are modified. | |
7630 | ||
915167f5 GK |
7631 | This pattern must issue any memory barrier instructions such that all |
7632 | memory operations before the atomic operation occur before the atomic | |
7633 | operation and all memory operations after the atomic operation occur | |
7634 | after the atomic operation. | |
48ae6c13 | 7635 | |
4a77c72b | 7636 | For targets where the success or failure of the compare-and-swap |
f90b7a5a PB |
7637 | operation is available via the status flags, it is possible to |
7638 | avoid a separate compare operation and issue the subsequent | |
7639 | branch or store-flag operation immediately after the compare-and-swap. | |
7640 | To this end, GCC will look for a @code{MODE_CC} set in the | |
7641 | output of @code{sync_compare_and_swap@var{mode}}; if the machine | |
7642 | description includes such a set, the target should also define special | |
7643 | @code{cbranchcc4} and/or @code{cstorecc4} instructions. GCC will then | |
7644 | be able to take the destination of the @code{MODE_CC} set and pass it | |
7645 | to the @code{cbranchcc4} or @code{cstorecc4} pattern as the first | |
7646 | operand of the comparison (the second will be @code{(const_int 0)}). | |
48ae6c13 | 7647 | |
cedb4a1a RH |
7648 | For targets where the operating system may provide support for this |
7649 | operation via library calls, the @code{sync_compare_and_swap_optab} | |
7650 | may be initialized to a function with the same interface as the | |
7651 | @code{__sync_val_compare_and_swap_@var{n}} built-in. If the entire | |
7652 | set of @var{__sync} builtins are supported via library calls, the | |
7653 | target can initialize all of the optabs at once with | |
7654 | @code{init_sync_libfuncs}. | |
7655 | For the purposes of C++11 @code{std::atomic::is_lock_free}, it is | |
7656 | assumed that these library calls do @emph{not} use any kind of | |
7657 | interruptable locking. | |
7658 | ||
48ae6c13 RH |
7659 | @cindex @code{sync_add@var{mode}} instruction pattern |
7660 | @cindex @code{sync_sub@var{mode}} instruction pattern | |
7661 | @cindex @code{sync_ior@var{mode}} instruction pattern | |
7662 | @cindex @code{sync_and@var{mode}} instruction pattern | |
7663 | @cindex @code{sync_xor@var{mode}} instruction pattern | |
7664 | @cindex @code{sync_nand@var{mode}} instruction pattern | |
7665 | @item @samp{sync_add@var{mode}}, @samp{sync_sub@var{mode}} | |
7666 | @itemx @samp{sync_ior@var{mode}}, @samp{sync_and@var{mode}} | |
7667 | @itemx @samp{sync_xor@var{mode}}, @samp{sync_nand@var{mode}} | |
48ae6c13 RH |
7668 | These patterns emit code for an atomic operation on memory. |
7669 | Operand 0 is the memory on which the atomic operation is performed. | |
7670 | Operand 1 is the second operand to the binary operator. | |
7671 | ||
915167f5 GK |
7672 | This pattern must issue any memory barrier instructions such that all |
7673 | memory operations before the atomic operation occur before the atomic | |
7674 | operation and all memory operations after the atomic operation occur | |
7675 | after the atomic operation. | |
48ae6c13 RH |
7676 | |
7677 | If these patterns are not defined, the operation will be constructed | |
7678 | from a compare-and-swap operation, if defined. | |
7679 | ||
7680 | @cindex @code{sync_old_add@var{mode}} instruction pattern | |
7681 | @cindex @code{sync_old_sub@var{mode}} instruction pattern | |
7682 | @cindex @code{sync_old_ior@var{mode}} instruction pattern | |
7683 | @cindex @code{sync_old_and@var{mode}} instruction pattern | |
7684 | @cindex @code{sync_old_xor@var{mode}} instruction pattern | |
7685 | @cindex @code{sync_old_nand@var{mode}} instruction pattern | |
7686 | @item @samp{sync_old_add@var{mode}}, @samp{sync_old_sub@var{mode}} | |
7687 | @itemx @samp{sync_old_ior@var{mode}}, @samp{sync_old_and@var{mode}} | |
7688 | @itemx @samp{sync_old_xor@var{mode}}, @samp{sync_old_nand@var{mode}} | |
c29c1030 | 7689 | These patterns emit code for an atomic operation on memory, |
48ae6c13 RH |
7690 | and return the value that the memory contained before the operation. |
7691 | Operand 0 is the result value, operand 1 is the memory on which the | |
7692 | atomic operation is performed, and operand 2 is the second operand | |
7693 | to the binary operator. | |
7694 | ||
915167f5 GK |
7695 | This pattern must issue any memory barrier instructions such that all |
7696 | memory operations before the atomic operation occur before the atomic | |
7697 | operation and all memory operations after the atomic operation occur | |
7698 | after the atomic operation. | |
48ae6c13 RH |
7699 | |
7700 | If these patterns are not defined, the operation will be constructed | |
7701 | from a compare-and-swap operation, if defined. | |
7702 | ||
7703 | @cindex @code{sync_new_add@var{mode}} instruction pattern | |
7704 | @cindex @code{sync_new_sub@var{mode}} instruction pattern | |
7705 | @cindex @code{sync_new_ior@var{mode}} instruction pattern | |
7706 | @cindex @code{sync_new_and@var{mode}} instruction pattern | |
7707 | @cindex @code{sync_new_xor@var{mode}} instruction pattern | |
7708 | @cindex @code{sync_new_nand@var{mode}} instruction pattern | |
7709 | @item @samp{sync_new_add@var{mode}}, @samp{sync_new_sub@var{mode}} | |
7710 | @itemx @samp{sync_new_ior@var{mode}}, @samp{sync_new_and@var{mode}} | |
7711 | @itemx @samp{sync_new_xor@var{mode}}, @samp{sync_new_nand@var{mode}} | |
48ae6c13 RH |
7712 | These patterns are like their @code{sync_old_@var{op}} counterparts, |
7713 | except that they return the value that exists in the memory location | |
7714 | after the operation, rather than before the operation. | |
7715 | ||
7716 | @cindex @code{sync_lock_test_and_set@var{mode}} instruction pattern | |
7717 | @item @samp{sync_lock_test_and_set@var{mode}} | |
48ae6c13 RH |
7718 | This pattern takes two forms, based on the capabilities of the target. |
7719 | In either case, operand 0 is the result of the operand, operand 1 is | |
7720 | the memory on which the atomic operation is performed, and operand 2 | |
7721 | is the value to set in the lock. | |
7722 | ||
7723 | In the ideal case, this operation is an atomic exchange operation, in | |
7724 | which the previous value in memory operand is copied into the result | |
7725 | operand, and the value operand is stored in the memory operand. | |
7726 | ||
7727 | For less capable targets, any value operand that is not the constant 1 | |
7728 | should be rejected with @code{FAIL}. In this case the target may use | |
7729 | an atomic test-and-set bit operation. The result operand should contain | |
7730 | 1 if the bit was previously set and 0 if the bit was previously clear. | |
7731 | The true contents of the memory operand are implementation defined. | |
7732 | ||
7733 | This pattern must issue any memory barrier instructions such that the | |
915167f5 GK |
7734 | pattern as a whole acts as an acquire barrier, that is all memory |
7735 | operations after the pattern do not occur until the lock is acquired. | |
48ae6c13 RH |
7736 | |
7737 | If this pattern is not defined, the operation will be constructed from | |
7738 | a compare-and-swap operation, if defined. | |
7739 | ||
7740 | @cindex @code{sync_lock_release@var{mode}} instruction pattern | |
7741 | @item @samp{sync_lock_release@var{mode}} | |
48ae6c13 RH |
7742 | This pattern, if defined, releases a lock set by |
7743 | @code{sync_lock_test_and_set@var{mode}}. Operand 0 is the memory | |
8635a919 GK |
7744 | that contains the lock; operand 1 is the value to store in the lock. |
7745 | ||
7746 | If the target doesn't implement full semantics for | |
7747 | @code{sync_lock_test_and_set@var{mode}}, any value operand which is not | |
7748 | the constant 0 should be rejected with @code{FAIL}, and the true contents | |
7749 | of the memory operand are implementation defined. | |
48ae6c13 RH |
7750 | |
7751 | This pattern must issue any memory barrier instructions such that the | |
915167f5 GK |
7752 | pattern as a whole acts as a release barrier, that is the lock is |
7753 | released only after all previous memory operations have completed. | |
48ae6c13 RH |
7754 | |
7755 | If this pattern is not defined, then a @code{memory_barrier} pattern | |
8635a919 | 7756 | will be emitted, followed by a store of the value to the memory operand. |
48ae6c13 | 7757 | |
86951993 AM |
7758 | @cindex @code{atomic_compare_and_swap@var{mode}} instruction pattern |
7759 | @item @samp{atomic_compare_and_swap@var{mode}} | |
7760 | This pattern, if defined, emits code for an atomic compare-and-swap | |
7761 | operation with memory model semantics. Operand 2 is the memory on which | |
7762 | the atomic operation is performed. Operand 0 is an output operand which | |
7763 | is set to true or false based on whether the operation succeeded. Operand | |
7764 | 1 is an output operand which is set to the contents of the memory before | |
7765 | the operation was attempted. Operand 3 is the value that is expected to | |
7766 | be in memory. Operand 4 is the value to put in memory if the expected | |
7767 | value is found there. Operand 5 is set to 1 if this compare and swap is to | |
7768 | be treated as a weak operation. Operand 6 is the memory model to be used | |
7769 | if the operation is a success. Operand 7 is the memory model to be used | |
7770 | if the operation fails. | |
7771 | ||
7772 | If memory referred to in operand 2 contains the value in operand 3, then | |
7773 | operand 4 is stored in memory pointed to by operand 2 and fencing based on | |
7774 | the memory model in operand 6 is issued. | |
7775 | ||
7776 | If memory referred to in operand 2 does not contain the value in operand 3, | |
7777 | then fencing based on the memory model in operand 7 is issued. | |
7778 | ||
7779 | If a target does not support weak compare-and-swap operations, or the port | |
7780 | elects not to implement weak operations, the argument in operand 5 can be | |
7781 | ignored. Note a strong implementation must be provided. | |
7782 | ||
7783 | If this pattern is not provided, the @code{__atomic_compare_exchange} | |
7784 | built-in functions will utilize the legacy @code{sync_compare_and_swap} | |
7785 | pattern with an @code{__ATOMIC_SEQ_CST} memory model. | |
7786 | ||
7787 | @cindex @code{atomic_load@var{mode}} instruction pattern | |
7788 | @item @samp{atomic_load@var{mode}} | |
7789 | This pattern implements an atomic load operation with memory model | |
7790 | semantics. Operand 1 is the memory address being loaded from. Operand 0 | |
7791 | is the result of the load. Operand 2 is the memory model to be used for | |
7792 | the load operation. | |
7793 | ||
7794 | If not present, the @code{__atomic_load} built-in function will either | |
7795 | resort to a normal load with memory barriers, or a compare-and-swap | |
7796 | operation if a normal load would not be atomic. | |
7797 | ||
7798 | @cindex @code{atomic_store@var{mode}} instruction pattern | |
7799 | @item @samp{atomic_store@var{mode}} | |
7800 | This pattern implements an atomic store operation with memory model | |
7801 | semantics. Operand 0 is the memory address being stored to. Operand 1 | |
7802 | is the value to be written. Operand 2 is the memory model to be used for | |
7803 | the operation. | |
7804 | ||
7805 | If not present, the @code{__atomic_store} built-in function will attempt to | |
7806 | perform a normal store and surround it with any required memory fences. If | |
7807 | the store would not be atomic, then an @code{__atomic_exchange} is | |
7808 | attempted with the result being ignored. | |
7809 | ||
7810 | @cindex @code{atomic_exchange@var{mode}} instruction pattern | |
7811 | @item @samp{atomic_exchange@var{mode}} | |
7812 | This pattern implements an atomic exchange operation with memory model | |
7813 | semantics. Operand 1 is the memory location the operation is performed on. | |
7814 | Operand 0 is an output operand which is set to the original value contained | |
7815 | in the memory pointed to by operand 1. Operand 2 is the value to be | |
7816 | stored. Operand 3 is the memory model to be used. | |
7817 | ||
7818 | If this pattern is not present, the built-in function | |
7819 | @code{__atomic_exchange} will attempt to preform the operation with a | |
7820 | compare and swap loop. | |
7821 | ||
7822 | @cindex @code{atomic_add@var{mode}} instruction pattern | |
7823 | @cindex @code{atomic_sub@var{mode}} instruction pattern | |
7824 | @cindex @code{atomic_or@var{mode}} instruction pattern | |
7825 | @cindex @code{atomic_and@var{mode}} instruction pattern | |
7826 | @cindex @code{atomic_xor@var{mode}} instruction pattern | |
7827 | @cindex @code{atomic_nand@var{mode}} instruction pattern | |
7828 | @item @samp{atomic_add@var{mode}}, @samp{atomic_sub@var{mode}} | |
7829 | @itemx @samp{atomic_or@var{mode}}, @samp{atomic_and@var{mode}} | |
7830 | @itemx @samp{atomic_xor@var{mode}}, @samp{atomic_nand@var{mode}} | |
86951993 AM |
7831 | These patterns emit code for an atomic operation on memory with memory |
7832 | model semantics. Operand 0 is the memory on which the atomic operation is | |
7833 | performed. Operand 1 is the second operand to the binary operator. | |
7834 | Operand 2 is the memory model to be used by the operation. | |
7835 | ||
7836 | If these patterns are not defined, attempts will be made to use legacy | |
c29c1030 | 7837 | @code{sync} patterns, or equivalent patterns which return a result. If |
86951993 AM |
7838 | none of these are available a compare-and-swap loop will be used. |
7839 | ||
7840 | @cindex @code{atomic_fetch_add@var{mode}} instruction pattern | |
7841 | @cindex @code{atomic_fetch_sub@var{mode}} instruction pattern | |
7842 | @cindex @code{atomic_fetch_or@var{mode}} instruction pattern | |
7843 | @cindex @code{atomic_fetch_and@var{mode}} instruction pattern | |
7844 | @cindex @code{atomic_fetch_xor@var{mode}} instruction pattern | |
7845 | @cindex @code{atomic_fetch_nand@var{mode}} instruction pattern | |
7846 | @item @samp{atomic_fetch_add@var{mode}}, @samp{atomic_fetch_sub@var{mode}} | |
7847 | @itemx @samp{atomic_fetch_or@var{mode}}, @samp{atomic_fetch_and@var{mode}} | |
7848 | @itemx @samp{atomic_fetch_xor@var{mode}}, @samp{atomic_fetch_nand@var{mode}} | |
86951993 AM |
7849 | These patterns emit code for an atomic operation on memory with memory |
7850 | model semantics, and return the original value. Operand 0 is an output | |
7851 | operand which contains the value of the memory location before the | |
7852 | operation was performed. Operand 1 is the memory on which the atomic | |
7853 | operation is performed. Operand 2 is the second operand to the binary | |
7854 | operator. Operand 3 is the memory model to be used by the operation. | |
7855 | ||
7856 | If these patterns are not defined, attempts will be made to use legacy | |
7857 | @code{sync} patterns. If none of these are available a compare-and-swap | |
7858 | loop will be used. | |
7859 | ||
7860 | @cindex @code{atomic_add_fetch@var{mode}} instruction pattern | |
7861 | @cindex @code{atomic_sub_fetch@var{mode}} instruction pattern | |
7862 | @cindex @code{atomic_or_fetch@var{mode}} instruction pattern | |
7863 | @cindex @code{atomic_and_fetch@var{mode}} instruction pattern | |
7864 | @cindex @code{atomic_xor_fetch@var{mode}} instruction pattern | |
7865 | @cindex @code{atomic_nand_fetch@var{mode}} instruction pattern | |
7866 | @item @samp{atomic_add_fetch@var{mode}}, @samp{atomic_sub_fetch@var{mode}} | |
7867 | @itemx @samp{atomic_or_fetch@var{mode}}, @samp{atomic_and_fetch@var{mode}} | |
7868 | @itemx @samp{atomic_xor_fetch@var{mode}}, @samp{atomic_nand_fetch@var{mode}} | |
86951993 AM |
7869 | These patterns emit code for an atomic operation on memory with memory |
7870 | model semantics and return the result after the operation is performed. | |
7871 | Operand 0 is an output operand which contains the value after the | |
7872 | operation. Operand 1 is the memory on which the atomic operation is | |
7873 | performed. Operand 2 is the second operand to the binary operator. | |
7874 | Operand 3 is the memory model to be used by the operation. | |
7875 | ||
7876 | If these patterns are not defined, attempts will be made to use legacy | |
c29c1030 | 7877 | @code{sync} patterns, or equivalent patterns which return the result before |
86951993 AM |
7878 | the operation followed by the arithmetic operation required to produce the |
7879 | result. If none of these are available a compare-and-swap loop will be | |
7880 | used. | |
7881 | ||
f8a27aa6 RH |
7882 | @cindex @code{atomic_test_and_set} instruction pattern |
7883 | @item @samp{atomic_test_and_set} | |
f8a27aa6 RH |
7884 | This pattern emits code for @code{__builtin_atomic_test_and_set}. |
7885 | Operand 0 is an output operand which is set to true if the previous | |
7886 | previous contents of the byte was "set", and false otherwise. Operand 1 | |
7887 | is the @code{QImode} memory to be modified. Operand 2 is the memory | |
7888 | model to be used. | |
7889 | ||
7890 | The specific value that defines "set" is implementation defined, and | |
7891 | is normally based on what is performed by the native atomic test and set | |
7892 | instruction. | |
7893 | ||
adedd5c1 JJ |
7894 | @cindex @code{atomic_bit_test_and_set@var{mode}} instruction pattern |
7895 | @cindex @code{atomic_bit_test_and_complement@var{mode}} instruction pattern | |
7896 | @cindex @code{atomic_bit_test_and_reset@var{mode}} instruction pattern | |
7897 | @item @samp{atomic_bit_test_and_set@var{mode}} | |
7898 | @itemx @samp{atomic_bit_test_and_complement@var{mode}} | |
7899 | @itemx @samp{atomic_bit_test_and_reset@var{mode}} | |
7900 | These patterns emit code for an atomic bitwise operation on memory with memory | |
7901 | model semantics, and return the original value of the specified bit. | |
7902 | Operand 0 is an output operand which contains the value of the specified bit | |
7903 | from the memory location before the operation was performed. Operand 1 is the | |
7904 | memory on which the atomic operation is performed. Operand 2 is the bit within | |
7905 | the operand, starting with least significant bit. Operand 3 is the memory model | |
7906 | to be used by the operation. Operand 4 is a flag - it is @code{const1_rtx} | |
7907 | if operand 0 should contain the original value of the specified bit in the | |
7908 | least significant bit of the operand, and @code{const0_rtx} if the bit should | |
7909 | be in its original position in the operand. | |
7910 | @code{atomic_bit_test_and_set@var{mode}} atomically sets the specified bit after | |
7911 | remembering its original value, @code{atomic_bit_test_and_complement@var{mode}} | |
7912 | inverts the specified bit and @code{atomic_bit_test_and_reset@var{mode}} clears | |
7913 | the specified bit. | |
7914 | ||
7915 | If these patterns are not defined, attempts will be made to use | |
7916 | @code{atomic_fetch_or@var{mode}}, @code{atomic_fetch_xor@var{mode}} or | |
7917 | @code{atomic_fetch_and@var{mode}} instruction patterns, or their @code{sync} | |
7918 | counterparts. If none of these are available a compare-and-swap | |
7919 | loop will be used. | |
7920 | ||
5e5ccf0d AM |
7921 | @cindex @code{mem_thread_fence} instruction pattern |
7922 | @item @samp{mem_thread_fence} | |
86951993 AM |
7923 | This pattern emits code required to implement a thread fence with |
7924 | memory model semantics. Operand 0 is the memory model to be used. | |
7925 | ||
5e5ccf0d AM |
7926 | For the @code{__ATOMIC_RELAXED} model no instructions need to be issued |
7927 | and this expansion is not invoked. | |
7928 | ||
7929 | The compiler always emits a compiler memory barrier regardless of what | |
7930 | expanding this pattern produced. | |
7931 | ||
7932 | If this pattern is not defined, the compiler falls back to expanding the | |
7933 | @code{memory_barrier} pattern, then to emitting @code{__sync_synchronize} | |
7934 | library call, and finally to just placing a compiler memory barrier. | |
86951993 | 7935 | |
f959607b CLT |
7936 | @cindex @code{get_thread_pointer@var{mode}} instruction pattern |
7937 | @cindex @code{set_thread_pointer@var{mode}} instruction pattern | |
7938 | @item @samp{get_thread_pointer@var{mode}} | |
7939 | @itemx @samp{set_thread_pointer@var{mode}} | |
7940 | These patterns emit code that reads/sets the TLS thread pointer. Currently, | |
7941 | these are only needed if the target needs to support the | |
7942 | @code{__builtin_thread_pointer} and @code{__builtin_set_thread_pointer} | |
7943 | builtins. | |
7944 | ||
7945 | The get/set patterns have a single output/input operand respectively, | |
7946 | with @var{mode} intended to be @code{Pmode}. | |
7947 | ||
89d75572 TP |
7948 | @cindex @code{stack_protect_combined_set} instruction pattern |
7949 | @item @samp{stack_protect_combined_set} | |
7950 | This pattern, if defined, moves a @code{ptr_mode} value from an address | |
7951 | whose declaration RTX is given in operand 1 to the memory in operand 0 | |
7952 | without leaving the value in a register afterward. If several | |
7953 | instructions are needed by the target to perform the operation (eg. to | |
7954 | load the address from a GOT entry then load the @code{ptr_mode} value | |
7955 | and finally store it), it is the backend's responsibility to ensure no | |
7956 | intermediate result gets spilled. This is to avoid leaking the value | |
7957 | some place that an attacker might use to rewrite the stack guard slot | |
7958 | after having clobbered it. | |
7959 | ||
7960 | If this pattern is not defined, then the address declaration is | |
7961 | expanded first in the standard way and a @code{stack_protect_set} | |
7962 | pattern is then generated to move the value from that address to the | |
7963 | address in operand 0. | |
7964 | ||
7d69de61 RH |
7965 | @cindex @code{stack_protect_set} instruction pattern |
7966 | @item @samp{stack_protect_set} | |
89d75572 TP |
7967 | This pattern, if defined, moves a @code{ptr_mode} value from the valid |
7968 | memory location in operand 1 to the memory in operand 0 without leaving | |
7969 | the value in a register afterward. This is to avoid leaking the value | |
7970 | some place that an attacker might use to rewrite the stack guard slot | |
7971 | after having clobbered it. | |
7972 | ||
7973 | Note: on targets where the addressing modes do not allow to load | |
7974 | directly from stack guard address, the address is expanded in a standard | |
7975 | way first which could cause some spills. | |
7d69de61 RH |
7976 | |
7977 | If this pattern is not defined, then a plain move pattern is generated. | |
7978 | ||
89d75572 TP |
7979 | @cindex @code{stack_protect_combined_test} instruction pattern |
7980 | @item @samp{stack_protect_combined_test} | |
7981 | This pattern, if defined, compares a @code{ptr_mode} value from an | |
7982 | address whose declaration RTX is given in operand 1 with the memory in | |
7983 | operand 0 without leaving the value in a register afterward and | |
7984 | branches to operand 2 if the values were equal. If several | |
7985 | instructions are needed by the target to perform the operation (eg. to | |
7986 | load the address from a GOT entry then load the @code{ptr_mode} value | |
7987 | and finally store it), it is the backend's responsibility to ensure no | |
7988 | intermediate result gets spilled. This is to avoid leaking the value | |
7989 | some place that an attacker might use to rewrite the stack guard slot | |
7990 | after having clobbered it. | |
7991 | ||
7992 | If this pattern is not defined, then the address declaration is | |
7993 | expanded first in the standard way and a @code{stack_protect_test} | |
7994 | pattern is then generated to compare the value from that address to the | |
7995 | value at the memory in operand 0. | |
7996 | ||
7d69de61 RH |
7997 | @cindex @code{stack_protect_test} instruction pattern |
7998 | @item @samp{stack_protect_test} | |
643e867f | 7999 | This pattern, if defined, compares a @code{ptr_mode} value from the |
89d75572 TP |
8000 | valid memory location in operand 1 with the memory in operand 0 without |
8001 | leaving the value in a register afterward and branches to operand 2 if | |
8002 | the values were equal. | |
7d69de61 | 8003 | |
3aebbe5f JJ |
8004 | If this pattern is not defined, then a plain compare pattern and |
8005 | conditional branch pattern is used. | |
7d69de61 | 8006 | |
677feb77 DD |
8007 | @cindex @code{clear_cache} instruction pattern |
8008 | @item @samp{clear_cache} | |
677feb77 DD |
8009 | This pattern, if defined, flushes the instruction cache for a region of |
8010 | memory. The region is bounded to by the Pmode pointers in operand 0 | |
8011 | inclusive and operand 1 exclusive. | |
8012 | ||
8013 | If this pattern is not defined, a call to the library function | |
8014 | @code{__clear_cache} is used. | |
8015 | ||
03dda8e3 RK |
8016 | @end table |
8017 | ||
a5249a21 HPN |
8018 | @end ifset |
8019 | @c Each of the following nodes are wrapped in separate | |
8020 | @c "@ifset INTERNALS" to work around memory limits for the default | |
8021 | @c configuration in older tetex distributions. Known to not work: | |
8022 | @c tetex-1.0.7, known to work: tetex-2.0.2. | |
8023 | @ifset INTERNALS | |
03dda8e3 RK |
8024 | @node Pattern Ordering |
8025 | @section When the Order of Patterns Matters | |
8026 | @cindex Pattern Ordering | |
8027 | @cindex Ordering of Patterns | |
8028 | ||
8029 | Sometimes an insn can match more than one instruction pattern. Then the | |
8030 | pattern that appears first in the machine description is the one used. | |
8031 | Therefore, more specific patterns (patterns that will match fewer things) | |
8032 | and faster instructions (those that will produce better code when they | |
8033 | do match) should usually go first in the description. | |
8034 | ||
8035 | In some cases the effect of ordering the patterns can be used to hide | |
8036 | a pattern when it is not valid. For example, the 68000 has an | |
8037 | instruction for converting a fullword to floating point and another | |
8038 | for converting a byte to floating point. An instruction converting | |
8039 | an integer to floating point could match either one. We put the | |
8040 | pattern to convert the fullword first to make sure that one will | |
8041 | be used rather than the other. (Otherwise a large integer might | |
8042 | be generated as a single-byte immediate quantity, which would not work.) | |
8043 | Instead of using this pattern ordering it would be possible to make the | |
8044 | pattern for convert-a-byte smart enough to deal properly with any | |
8045 | constant value. | |
8046 | ||
a5249a21 HPN |
8047 | @end ifset |
8048 | @ifset INTERNALS | |
03dda8e3 RK |
8049 | @node Dependent Patterns |
8050 | @section Interdependence of Patterns | |
8051 | @cindex Dependent Patterns | |
8052 | @cindex Interdependence of Patterns | |
8053 | ||
03dda8e3 RK |
8054 | In some cases machines support instructions identical except for the |
8055 | machine mode of one or more operands. For example, there may be | |
8056 | ``sign-extend halfword'' and ``sign-extend byte'' instructions whose | |
8057 | patterns are | |
8058 | ||
3ab51846 | 8059 | @smallexample |
03dda8e3 RK |
8060 | (set (match_operand:SI 0 @dots{}) |
8061 | (extend:SI (match_operand:HI 1 @dots{}))) | |
8062 | ||
8063 | (set (match_operand:SI 0 @dots{}) | |
8064 | (extend:SI (match_operand:QI 1 @dots{}))) | |
3ab51846 | 8065 | @end smallexample |
03dda8e3 RK |
8066 | |
8067 | @noindent | |
8068 | Constant integers do not specify a machine mode, so an instruction to | |
8069 | extend a constant value could match either pattern. The pattern it | |
8070 | actually will match is the one that appears first in the file. For correct | |
8071 | results, this must be the one for the widest possible mode (@code{HImode}, | |
8072 | here). If the pattern matches the @code{QImode} instruction, the results | |
8073 | will be incorrect if the constant value does not actually fit that mode. | |
8074 | ||
8075 | Such instructions to extend constants are rarely generated because they are | |
8076 | optimized away, but they do occasionally happen in nonoptimized | |
8077 | compilations. | |
8078 | ||
8079 | If a constraint in a pattern allows a constant, the reload pass may | |
8080 | replace a register with a constant permitted by the constraint in some | |
8081 | cases. Similarly for memory references. Because of this substitution, | |
8082 | you should not provide separate patterns for increment and decrement | |
8083 | instructions. Instead, they should be generated from the same pattern | |
8084 | that supports register-register add insns by examining the operands and | |
8085 | generating the appropriate machine instruction. | |
8086 | ||
a5249a21 HPN |
8087 | @end ifset |
8088 | @ifset INTERNALS | |
03dda8e3 RK |
8089 | @node Jump Patterns |
8090 | @section Defining Jump Instruction Patterns | |
8091 | @cindex jump instruction patterns | |
8092 | @cindex defining jump instruction patterns | |
8093 | ||
f90b7a5a PB |
8094 | GCC does not assume anything about how the machine realizes jumps. |
8095 | The machine description should define a single pattern, usually | |
8096 | a @code{define_expand}, which expands to all the required insns. | |
8097 | ||
8098 | Usually, this would be a comparison insn to set the condition code | |
8099 | and a separate branch insn testing the condition code and branching | |
8100 | or not according to its value. For many machines, however, | |
8101 | separating compares and branches is limiting, which is why the | |
8102 | more flexible approach with one @code{define_expand} is used in GCC. | |
8103 | The machine description becomes clearer for architectures that | |
8104 | have compare-and-branch instructions but no condition code. It also | |
8105 | works better when different sets of comparison operators are supported | |
630ba2fd SB |
8106 | by different kinds of conditional branches (e.g.@: integer vs.@: |
8107 | floating-point), or by conditional branches with respect to conditional stores. | |
f90b7a5a | 8108 | |
bd1cd0d0 SB |
8109 | Two separate insns are always used on most machines that use a separate |
8110 | condition code register (@pxref{Condition Code}). | |
f90b7a5a PB |
8111 | |
8112 | Even in this case having a single entry point for conditional branches | |
8113 | is advantageous, because it handles equally well the case where a single | |
8114 | comparison instruction records the results of both signed and unsigned | |
8115 | comparison of the given operands (with the branch insns coming in distinct | |
8116 | signed and unsigned flavors) as in the x86 or SPARC, and the case where | |
8117 | there are distinct signed and unsigned compare instructions and only | |
8118 | one set of conditional branch instructions as in the PowerPC. | |
03dda8e3 | 8119 | |
a5249a21 HPN |
8120 | @end ifset |
8121 | @ifset INTERNALS | |
6e4fcc95 MH |
8122 | @node Looping Patterns |
8123 | @section Defining Looping Instruction Patterns | |
8124 | @cindex looping instruction patterns | |
8125 | @cindex defining looping instruction patterns | |
8126 | ||
05713b80 | 8127 | Some machines have special jump instructions that can be utilized to |
6e4fcc95 MH |
8128 | make loops more efficient. A common example is the 68000 @samp{dbra} |
8129 | instruction which performs a decrement of a register and a branch if the | |
8130 | result was greater than zero. Other machines, in particular digital | |
8131 | signal processors (DSPs), have special block repeat instructions to | |
8132 | provide low-overhead loop support. For example, the TI TMS320C3x/C4x | |
8133 | DSPs have a block repeat instruction that loads special registers to | |
8134 | mark the top and end of a loop and to count the number of loop | |
8135 | iterations. This avoids the need for fetching and executing a | |
c771326b | 8136 | @samp{dbra}-like instruction and avoids pipeline stalls associated with |
6e4fcc95 MH |
8137 | the jump. |
8138 | ||
f9adcdec PK |
8139 | GCC has two special named patterns to support low overhead looping. |
8140 | They are @samp{doloop_begin} and @samp{doloop_end}. These are emitted | |
8141 | by the loop optimizer for certain well-behaved loops with a finite | |
8142 | number of loop iterations using information collected during strength | |
8143 | reduction. | |
6e4fcc95 MH |
8144 | |
8145 | The @samp{doloop_end} pattern describes the actual looping instruction | |
8146 | (or the implicit looping operation) and the @samp{doloop_begin} pattern | |
c21cd8b1 | 8147 | is an optional companion pattern that can be used for initialization |
6e4fcc95 MH |
8148 | needed for some low-overhead looping instructions. |
8149 | ||
8150 | Note that some machines require the actual looping instruction to be | |
8151 | emitted at the top of the loop (e.g., the TMS320C3x/C4x DSPs). Emitting | |
8152 | the true RTL for a looping instruction at the top of the loop can cause | |
8153 | problems with flow analysis. So instead, a dummy @code{doloop} insn is | |
8154 | emitted at the end of the loop. The machine dependent reorg pass checks | |
8155 | for the presence of this @code{doloop} insn and then searches back to | |
8156 | the top of the loop, where it inserts the true looping insn (provided | |
8157 | there are no instructions in the loop which would cause problems). Any | |
8158 | additional labels can be emitted at this point. In addition, if the | |
8159 | desired special iteration counter register was not allocated, this | |
8160 | machine dependent reorg pass could emit a traditional compare and jump | |
8161 | instruction pair. | |
8162 | ||
f9adcdec PK |
8163 | For the @samp{doloop_end} pattern, the loop optimizer allocates an |
8164 | additional pseudo register as an iteration counter. This pseudo | |
8165 | register cannot be used within the loop (i.e., general induction | |
8166 | variables cannot be derived from it), however, in many cases the loop | |
8167 | induction variable may become redundant and removed by the flow pass. | |
8168 | ||
8169 | The @samp{doloop_end} pattern must have a specific structure to be | |
8170 | handled correctly by GCC. The example below is taken (slightly | |
8171 | simplified) from the PDP-11 target: | |
8172 | ||
8173 | @smallexample | |
8174 | @group | |
a01abe9d PK |
8175 | (define_expand "doloop_end" |
8176 | [(parallel [(set (pc) | |
8177 | (if_then_else | |
8178 | (ne (match_operand:HI 0 "nonimmediate_operand" "+r,!m") | |
8179 | (const_int 1)) | |
8180 | (label_ref (match_operand 1 "" "")) | |
8181 | (pc))) | |
8182 | (set (match_dup 0) | |
8183 | (plus:HI (match_dup 0) | |
8184 | (const_int -1)))])] | |
8185 | "" | |
8186 | "@{ | |
8187 | if (GET_MODE (operands[0]) != HImode) | |
8188 | FAIL; | |
8189 | @}") | |
8190 | ||
8191 | (define_insn "doloop_end_insn" | |
f9adcdec PK |
8192 | [(set (pc) |
8193 | (if_then_else | |
8194 | (ne (match_operand:HI 0 "nonimmediate_operand" "+r,!m") | |
8195 | (const_int 1)) | |
8196 | (label_ref (match_operand 1 "" "")) | |
8197 | (pc))) | |
8198 | (set (match_dup 0) | |
8199 | (plus:HI (match_dup 0) | |
8200 | (const_int -1)))] | |
8201 | "" | |
8202 | ||
8203 | @{ | |
8204 | if (which_alternative == 0) | |
8205 | return "sob %0,%l1"; | |
8206 | ||
8207 | /* emulate sob */ | |
8208 | output_asm_insn ("dec %0", operands); | |
8209 | return "bne %l1"; | |
8210 | @}) | |
8211 | @end group | |
8212 | @end smallexample | |
8213 | ||
8214 | The first part of the pattern describes the branch condition. GCC | |
8215 | supports three cases for the way the target machine handles the loop | |
8216 | counter: | |
8217 | @itemize @bullet | |
8218 | @item Loop terminates when the loop register decrements to zero. This | |
8219 | is represented by a @code{ne} comparison of the register (its old value) | |
8220 | with constant 1 (as in the example above). | |
8221 | @item Loop terminates when the loop register decrements to @minus{}1. | |
8222 | This is represented by a @code{ne} comparison of the register with | |
8223 | constant zero. | |
8224 | @item Loop terminates when the loop register decrements to a negative | |
8225 | value. This is represented by a @code{ge} comparison of the register | |
8226 | with constant zero. For this case, GCC will attach a @code{REG_NONNEG} | |
8227 | note to the @code{doloop_end} insn if it can determine that the register | |
8228 | will be non-negative. | |
8229 | @end itemize | |
6e4fcc95 | 8230 | |
f9adcdec PK |
8231 | Since the @code{doloop_end} insn is a jump insn that also has an output, |
8232 | the reload pass does not handle the output operand. Therefore, the | |
8233 | constraint must allow for that operand to be in memory rather than a | |
a01abe9d PK |
8234 | register. In the example shown above, that is handled (in the |
8235 | @code{doloop_end_insn} pattern) by using a loop instruction sequence | |
8236 | that can handle memory operands when the memory alternative appears. | |
8237 | ||
8238 | GCC does not check the mode of the loop register operand when generating | |
8239 | the @code{doloop_end} pattern. If the pattern is only valid for some | |
8240 | modes but not others, the pattern should be a @code{define_expand} | |
8241 | pattern that checks the operand mode in the preparation code, and issues | |
8242 | @code{FAIL} if an unsupported mode is found. The example above does | |
8243 | this, since the machine instruction to be used only exists for | |
8244 | @code{HImode}. | |
8245 | ||
8246 | If the @code{doloop_end} pattern is a @code{define_expand}, there must | |
8247 | also be a @code{define_insn} or @code{define_insn_and_split} matching | |
8248 | the generated pattern. Otherwise, the compiler will fail during loop | |
8249 | optimization. | |
6e4fcc95 | 8250 | |
a5249a21 HPN |
8251 | @end ifset |
8252 | @ifset INTERNALS | |
03dda8e3 RK |
8253 | @node Insn Canonicalizations |
8254 | @section Canonicalization of Instructions | |
8255 | @cindex canonicalization of instructions | |
8256 | @cindex insn canonicalization | |
8257 | ||
8258 | There are often cases where multiple RTL expressions could represent an | |
8259 | operation performed by a single machine instruction. This situation is | |
8260 | most commonly encountered with logical, branch, and multiply-accumulate | |
8261 | instructions. In such cases, the compiler attempts to convert these | |
8262 | multiple RTL expressions into a single canonical form to reduce the | |
8263 | number of insn patterns required. | |
8264 | ||
8265 | In addition to algebraic simplifications, following canonicalizations | |
8266 | are performed: | |
8267 | ||
8268 | @itemize @bullet | |
8269 | @item | |
8270 | For commutative and comparison operators, a constant is always made the | |
8271 | second operand. If a machine only supports a constant as the second | |
8272 | operand, only patterns that match a constant in the second operand need | |
8273 | be supplied. | |
8274 | ||
e3d6e740 GK |
8275 | @item |
8276 | For associative operators, a sequence of operators will always chain | |
8277 | to the left; for instance, only the left operand of an integer @code{plus} | |
8278 | can itself be a @code{plus}. @code{and}, @code{ior}, @code{xor}, | |
8279 | @code{plus}, @code{mult}, @code{smin}, @code{smax}, @code{umin}, and | |
8280 | @code{umax} are associative when applied to integers, and sometimes to | |
8281 | floating-point. | |
8282 | ||
8283 | @item | |
03dda8e3 RK |
8284 | @cindex @code{neg}, canonicalization of |
8285 | @cindex @code{not}, canonicalization of | |
8286 | @cindex @code{mult}, canonicalization of | |
8287 | @cindex @code{plus}, canonicalization of | |
8288 | @cindex @code{minus}, canonicalization of | |
8289 | For these operators, if only one operand is a @code{neg}, @code{not}, | |
8290 | @code{mult}, @code{plus}, or @code{minus} expression, it will be the | |
8291 | first operand. | |
8292 | ||
16823694 GK |
8293 | @item |
8294 | In combinations of @code{neg}, @code{mult}, @code{plus}, and | |
8295 | @code{minus}, the @code{neg} operations (if any) will be moved inside | |
daf2f129 | 8296 | the operations as far as possible. For instance, |
16823694 | 8297 | @code{(neg (mult A B))} is canonicalized as @code{(mult (neg A) B)}, but |
9302a061 | 8298 | @code{(plus (mult (neg B) C) A)} is canonicalized as |
16823694 GK |
8299 | @code{(minus A (mult B C))}. |
8300 | ||
03dda8e3 RK |
8301 | @cindex @code{compare}, canonicalization of |
8302 | @item | |
8303 | For the @code{compare} operator, a constant is always the second operand | |
bd1cd0d0 | 8304 | if the first argument is a condition code register. |
03dda8e3 | 8305 | |
81ad201a UB |
8306 | @item |
8307 | For instructions that inherently set a condition code register, the | |
8308 | @code{compare} operator is always written as the first RTL expression of | |
8309 | the @code{parallel} instruction pattern. For example, | |
8310 | ||
8311 | @smallexample | |
8312 | (define_insn "" | |
8313 | [(set (reg:CCZ FLAGS_REG) | |
8314 | (compare:CCZ | |
8315 | (plus:SI | |
8316 | (match_operand:SI 1 "register_operand" "%r") | |
8317 | (match_operand:SI 2 "register_operand" "r")) | |
8318 | (const_int 0))) | |
8319 | (set (match_operand:SI 0 "register_operand" "=r") | |
8320 | (plus:SI (match_dup 1) (match_dup 2)))] | |
8321 | "" | |
8322 | "addl %0, %1, %2") | |
8323 | @end smallexample | |
8324 | ||
f90b7a5a | 8325 | @item |
03dda8e3 RK |
8326 | An operand of @code{neg}, @code{not}, @code{mult}, @code{plus}, or |
8327 | @code{minus} is made the first operand under the same conditions as | |
8328 | above. | |
8329 | ||
921c4418 RIL |
8330 | @item |
8331 | @code{(ltu (plus @var{a} @var{b}) @var{b})} is converted to | |
8332 | @code{(ltu (plus @var{a} @var{b}) @var{a})}. Likewise with @code{geu} instead | |
8333 | of @code{ltu}. | |
8334 | ||
03dda8e3 RK |
8335 | @item |
8336 | @code{(minus @var{x} (const_int @var{n}))} is converted to | |
8337 | @code{(plus @var{x} (const_int @var{-n}))}. | |
8338 | ||
8339 | @item | |
8340 | Within address computations (i.e., inside @code{mem}), a left shift is | |
8341 | converted into the appropriate multiplication by a power of two. | |
8342 | ||
8343 | @cindex @code{ior}, canonicalization of | |
8344 | @cindex @code{and}, canonicalization of | |
8345 | @cindex De Morgan's law | |
72938a4c | 8346 | @item |
090359d6 | 8347 | De Morgan's Law is used to move bitwise negation inside a bitwise |
03dda8e3 RK |
8348 | logical-and or logical-or operation. If this results in only one |
8349 | operand being a @code{not} expression, it will be the first one. | |
8350 | ||
8351 | A machine that has an instruction that performs a bitwise logical-and of one | |
8352 | operand with the bitwise negation of the other should specify the pattern | |
8353 | for that instruction as | |
8354 | ||
3ab51846 | 8355 | @smallexample |
03dda8e3 RK |
8356 | (define_insn "" |
8357 | [(set (match_operand:@var{m} 0 @dots{}) | |
8358 | (and:@var{m} (not:@var{m} (match_operand:@var{m} 1 @dots{})) | |
8359 | (match_operand:@var{m} 2 @dots{})))] | |
8360 | "@dots{}" | |
8361 | "@dots{}") | |
3ab51846 | 8362 | @end smallexample |
03dda8e3 RK |
8363 | |
8364 | @noindent | |
8365 | Similarly, a pattern for a ``NAND'' instruction should be written | |
8366 | ||
3ab51846 | 8367 | @smallexample |
03dda8e3 RK |
8368 | (define_insn "" |
8369 | [(set (match_operand:@var{m} 0 @dots{}) | |
8370 | (ior:@var{m} (not:@var{m} (match_operand:@var{m} 1 @dots{})) | |
8371 | (not:@var{m} (match_operand:@var{m} 2 @dots{}))))] | |
8372 | "@dots{}" | |
8373 | "@dots{}") | |
3ab51846 | 8374 | @end smallexample |
03dda8e3 RK |
8375 | |
8376 | In both cases, it is not necessary to include patterns for the many | |
8377 | logically equivalent RTL expressions. | |
8378 | ||
8379 | @cindex @code{xor}, canonicalization of | |
8380 | @item | |
8381 | The only possible RTL expressions involving both bitwise exclusive-or | |
8382 | and bitwise negation are @code{(xor:@var{m} @var{x} @var{y})} | |
bd819a4a | 8383 | and @code{(not:@var{m} (xor:@var{m} @var{x} @var{y}))}. |
03dda8e3 RK |
8384 | |
8385 | @item | |
8386 | The sum of three items, one of which is a constant, will only appear in | |
8387 | the form | |
8388 | ||
3ab51846 | 8389 | @smallexample |
03dda8e3 | 8390 | (plus:@var{m} (plus:@var{m} @var{x} @var{y}) @var{constant}) |
3ab51846 | 8391 | @end smallexample |
03dda8e3 | 8392 | |
03dda8e3 RK |
8393 | @cindex @code{zero_extract}, canonicalization of |
8394 | @cindex @code{sign_extract}, canonicalization of | |
8395 | @item | |
8396 | Equality comparisons of a group of bits (usually a single bit) with zero | |
8397 | will be written using @code{zero_extract} rather than the equivalent | |
8398 | @code{and} or @code{sign_extract} operations. | |
8399 | ||
c536876e AS |
8400 | @cindex @code{mult}, canonicalization of |
8401 | @item | |
8402 | @code{(sign_extend:@var{m1} (mult:@var{m2} (sign_extend:@var{m2} @var{x}) | |
8403 | (sign_extend:@var{m2} @var{y})))} is converted to @code{(mult:@var{m1} | |
8404 | (sign_extend:@var{m1} @var{x}) (sign_extend:@var{m1} @var{y}))}, and likewise | |
8405 | for @code{zero_extend}. | |
8406 | ||
8407 | @item | |
8408 | @code{(sign_extend:@var{m1} (mult:@var{m2} (ashiftrt:@var{m2} | |
8409 | @var{x} @var{s}) (sign_extend:@var{m2} @var{y})))} is converted | |
8410 | to @code{(mult:@var{m1} (sign_extend:@var{m1} (ashiftrt:@var{m2} | |
8411 | @var{x} @var{s})) (sign_extend:@var{m1} @var{y}))}, and likewise for | |
8412 | patterns using @code{zero_extend} and @code{lshiftrt}. If the second | |
8413 | operand of @code{mult} is also a shift, then that is extended also. | |
8414 | This transformation is only applied when it can be proven that the | |
8415 | original operation had sufficient precision to prevent overflow. | |
8416 | ||
03dda8e3 RK |
8417 | @end itemize |
8418 | ||
cd16503a HPN |
8419 | Further canonicalization rules are defined in the function |
8420 | @code{commutative_operand_precedence} in @file{gcc/rtlanal.c}. | |
8421 | ||
a5249a21 HPN |
8422 | @end ifset |
8423 | @ifset INTERNALS | |
03dda8e3 RK |
8424 | @node Expander Definitions |
8425 | @section Defining RTL Sequences for Code Generation | |
8426 | @cindex expander definitions | |
8427 | @cindex code generation RTL sequences | |
8428 | @cindex defining RTL sequences for code generation | |
8429 | ||
8430 | On some target machines, some standard pattern names for RTL generation | |
8431 | cannot be handled with single insn, but a sequence of RTL insns can | |
8432 | represent them. For these target machines, you can write a | |
161d7b59 | 8433 | @code{define_expand} to specify how to generate the sequence of RTL@. |
03dda8e3 RK |
8434 | |
8435 | @findex define_expand | |
8436 | A @code{define_expand} is an RTL expression that looks almost like a | |
8437 | @code{define_insn}; but, unlike the latter, a @code{define_expand} is used | |
8438 | only for RTL generation and it can produce more than one RTL insn. | |
8439 | ||
8440 | A @code{define_expand} RTX has four operands: | |
8441 | ||
8442 | @itemize @bullet | |
8443 | @item | |
8444 | The name. Each @code{define_expand} must have a name, since the only | |
8445 | use for it is to refer to it by name. | |
8446 | ||
03dda8e3 | 8447 | @item |
f3a3d0d3 RH |
8448 | The RTL template. This is a vector of RTL expressions representing |
8449 | a sequence of separate instructions. Unlike @code{define_insn}, there | |
8450 | is no implicit surrounding @code{PARALLEL}. | |
03dda8e3 RK |
8451 | |
8452 | @item | |
8453 | The condition, a string containing a C expression. This expression is | |
8454 | used to express how the availability of this pattern depends on | |
f0523f02 JM |
8455 | subclasses of target machine, selected by command-line options when GCC |
8456 | is run. This is just like the condition of a @code{define_insn} that | |
03dda8e3 RK |
8457 | has a standard name. Therefore, the condition (if present) may not |
8458 | depend on the data in the insn being matched, but only the | |
8459 | target-machine-type flags. The compiler needs to test these conditions | |
8460 | during initialization in order to learn exactly which named instructions | |
8461 | are available in a particular run. | |
8462 | ||
8463 | @item | |
8464 | The preparation statements, a string containing zero or more C | |
8465 | statements which are to be executed before RTL code is generated from | |
8466 | the RTL template. | |
8467 | ||
8468 | Usually these statements prepare temporary registers for use as | |
8469 | internal operands in the RTL template, but they can also generate RTL | |
8470 | insns directly by calling routines such as @code{emit_insn}, etc. | |
8471 | Any such insns precede the ones that come from the RTL template. | |
477c104e MK |
8472 | |
8473 | @item | |
8474 | Optionally, a vector containing the values of attributes. @xref{Insn | |
8475 | Attributes}. | |
03dda8e3 RK |
8476 | @end itemize |
8477 | ||
8478 | Every RTL insn emitted by a @code{define_expand} must match some | |
8479 | @code{define_insn} in the machine description. Otherwise, the compiler | |
8480 | will crash when trying to generate code for the insn or trying to optimize | |
8481 | it. | |
8482 | ||
8483 | The RTL template, in addition to controlling generation of RTL insns, | |
8484 | also describes the operands that need to be specified when this pattern | |
8485 | is used. In particular, it gives a predicate for each operand. | |
8486 | ||
8487 | A true operand, which needs to be specified in order to generate RTL from | |
8488 | the pattern, should be described with a @code{match_operand} in its first | |
8489 | occurrence in the RTL template. This enters information on the operand's | |
f0523f02 | 8490 | predicate into the tables that record such things. GCC uses the |
03dda8e3 RK |
8491 | information to preload the operand into a register if that is required for |
8492 | valid RTL code. If the operand is referred to more than once, subsequent | |
8493 | references should use @code{match_dup}. | |
8494 | ||
8495 | The RTL template may also refer to internal ``operands'' which are | |
8496 | temporary registers or labels used only within the sequence made by the | |
8497 | @code{define_expand}. Internal operands are substituted into the RTL | |
8498 | template with @code{match_dup}, never with @code{match_operand}. The | |
8499 | values of the internal operands are not passed in as arguments by the | |
8500 | compiler when it requests use of this pattern. Instead, they are computed | |
8501 | within the pattern, in the preparation statements. These statements | |
8502 | compute the values and store them into the appropriate elements of | |
8503 | @code{operands} so that @code{match_dup} can find them. | |
8504 | ||
8505 | There are two special macros defined for use in the preparation statements: | |
8506 | @code{DONE} and @code{FAIL}. Use them with a following semicolon, | |
8507 | as a statement. | |
8508 | ||
8509 | @table @code | |
8510 | ||
8511 | @findex DONE | |
8512 | @item DONE | |
8513 | Use the @code{DONE} macro to end RTL generation for the pattern. The | |
8514 | only RTL insns resulting from the pattern on this occasion will be | |
8515 | those already emitted by explicit calls to @code{emit_insn} within the | |
8516 | preparation statements; the RTL template will not be generated. | |
8517 | ||
8518 | @findex FAIL | |
8519 | @item FAIL | |
8520 | Make the pattern fail on this occasion. When a pattern fails, it means | |
8521 | that the pattern was not truly available. The calling routines in the | |
8522 | compiler will try other strategies for code generation using other patterns. | |
8523 | ||
8524 | Failure is currently supported only for binary (addition, multiplication, | |
c771326b | 8525 | shifting, etc.) and bit-field (@code{extv}, @code{extzv}, and @code{insv}) |
03dda8e3 RK |
8526 | operations. |
8527 | @end table | |
8528 | ||
55e4756f DD |
8529 | If the preparation falls through (invokes neither @code{DONE} nor |
8530 | @code{FAIL}), then the @code{define_expand} acts like a | |
8531 | @code{define_insn} in that the RTL template is used to generate the | |
8532 | insn. | |
8533 | ||
8534 | The RTL template is not used for matching, only for generating the | |
8535 | initial insn list. If the preparation statement always invokes | |
8536 | @code{DONE} or @code{FAIL}, the RTL template may be reduced to a simple | |
8537 | list of operands, such as this example: | |
8538 | ||
8539 | @smallexample | |
8540 | @group | |
8541 | (define_expand "addsi3" | |
8542 | [(match_operand:SI 0 "register_operand" "") | |
8543 | (match_operand:SI 1 "register_operand" "") | |
8544 | (match_operand:SI 2 "register_operand" "")] | |
55e4756f DD |
8545 | "" |
8546 | " | |
58097133 | 8547 | @{ |
55e4756f DD |
8548 | handle_add (operands[0], operands[1], operands[2]); |
8549 | DONE; | |
58097133 | 8550 | @}") |
55e4756f DD |
8551 | @end group |
8552 | @end smallexample | |
8553 | ||
03dda8e3 RK |
8554 | Here is an example, the definition of left-shift for the SPUR chip: |
8555 | ||
8556 | @smallexample | |
8557 | @group | |
8558 | (define_expand "ashlsi3" | |
8559 | [(set (match_operand:SI 0 "register_operand" "") | |
8560 | (ashift:SI | |
03dda8e3 RK |
8561 | (match_operand:SI 1 "register_operand" "") |
8562 | (match_operand:SI 2 "nonmemory_operand" "")))] | |
8563 | "" | |
8564 | " | |
03dda8e3 RK |
8565 | @{ |
8566 | if (GET_CODE (operands[2]) != CONST_INT | |
8567 | || (unsigned) INTVAL (operands[2]) > 3) | |
8568 | FAIL; | |
8569 | @}") | |
8570 | @end group | |
8571 | @end smallexample | |
8572 | ||
8573 | @noindent | |
8574 | This example uses @code{define_expand} so that it can generate an RTL insn | |
8575 | for shifting when the shift-count is in the supported range of 0 to 3 but | |
8576 | fail in other cases where machine insns aren't available. When it fails, | |
8577 | the compiler tries another strategy using different patterns (such as, a | |
8578 | library call). | |
8579 | ||
8580 | If the compiler were able to handle nontrivial condition-strings in | |
8581 | patterns with names, then it would be possible to use a | |
8582 | @code{define_insn} in that case. Here is another case (zero-extension | |
8583 | on the 68000) which makes more use of the power of @code{define_expand}: | |
8584 | ||
8585 | @smallexample | |
8586 | (define_expand "zero_extendhisi2" | |
8587 | [(set (match_operand:SI 0 "general_operand" "") | |
8588 | (const_int 0)) | |
8589 | (set (strict_low_part | |
8590 | (subreg:HI | |
8591 | (match_dup 0) | |
8592 | 0)) | |
8593 | (match_operand:HI 1 "general_operand" ""))] | |
8594 | "" | |
8595 | "operands[1] = make_safe_from (operands[1], operands[0]);") | |
8596 | @end smallexample | |
8597 | ||
8598 | @noindent | |
8599 | @findex make_safe_from | |
8600 | Here two RTL insns are generated, one to clear the entire output operand | |
8601 | and the other to copy the input operand into its low half. This sequence | |
8602 | is incorrect if the input operand refers to [the old value of] the output | |
8603 | operand, so the preparation statement makes sure this isn't so. The | |
8604 | function @code{make_safe_from} copies the @code{operands[1]} into a | |
8605 | temporary register if it refers to @code{operands[0]}. It does this | |
8606 | by emitting another RTL insn. | |
8607 | ||
8608 | Finally, a third example shows the use of an internal operand. | |
8609 | Zero-extension on the SPUR chip is done by @code{and}-ing the result | |
8610 | against a halfword mask. But this mask cannot be represented by a | |
8611 | @code{const_int} because the constant value is too large to be legitimate | |
8612 | on this machine. So it must be copied into a register with | |
8613 | @code{force_reg} and then the register used in the @code{and}. | |
8614 | ||
8615 | @smallexample | |
8616 | (define_expand "zero_extendhisi2" | |
8617 | [(set (match_operand:SI 0 "register_operand" "") | |
8618 | (and:SI (subreg:SI | |
8619 | (match_operand:HI 1 "register_operand" "") | |
8620 | 0) | |
8621 | (match_dup 2)))] | |
8622 | "" | |
8623 | "operands[2] | |
3a598fbe | 8624 | = force_reg (SImode, GEN_INT (65535)); ") |
03dda8e3 RK |
8625 | @end smallexample |
8626 | ||
f4559287 | 8627 | @emph{Note:} If the @code{define_expand} is used to serve a |
c771326b | 8628 | standard binary or unary arithmetic operation or a bit-field operation, |
03dda8e3 RK |
8629 | then the last insn it generates must not be a @code{code_label}, |
8630 | @code{barrier} or @code{note}. It must be an @code{insn}, | |
8631 | @code{jump_insn} or @code{call_insn}. If you don't need a real insn | |
8632 | at the end, emit an insn to copy the result of the operation into | |
8633 | itself. Such an insn will generate no code, but it can avoid problems | |
bd819a4a | 8634 | in the compiler. |
03dda8e3 | 8635 | |
a5249a21 HPN |
8636 | @end ifset |
8637 | @ifset INTERNALS | |
03dda8e3 RK |
8638 | @node Insn Splitting |
8639 | @section Defining How to Split Instructions | |
8640 | @cindex insn splitting | |
8641 | @cindex instruction splitting | |
8642 | @cindex splitting instructions | |
8643 | ||
fae15c93 VM |
8644 | There are two cases where you should specify how to split a pattern |
8645 | into multiple insns. On machines that have instructions requiring | |
8646 | delay slots (@pxref{Delay Slots}) or that have instructions whose | |
8647 | output is not available for multiple cycles (@pxref{Processor pipeline | |
8648 | description}), the compiler phases that optimize these cases need to | |
8649 | be able to move insns into one-instruction delay slots. However, some | |
8650 | insns may generate more than one machine instruction. These insns | |
8651 | cannot be placed into a delay slot. | |
03dda8e3 RK |
8652 | |
8653 | Often you can rewrite the single insn as a list of individual insns, | |
8654 | each corresponding to one machine instruction. The disadvantage of | |
8655 | doing so is that it will cause the compilation to be slower and require | |
8656 | more space. If the resulting insns are too complex, it may also | |
8657 | suppress some optimizations. The compiler splits the insn if there is a | |
8658 | reason to believe that it might improve instruction or delay slot | |
8659 | scheduling. | |
8660 | ||
8661 | The insn combiner phase also splits putative insns. If three insns are | |
8662 | merged into one insn with a complex expression that cannot be matched by | |
8663 | some @code{define_insn} pattern, the combiner phase attempts to split | |
8664 | the complex pattern into two insns that are recognized. Usually it can | |
8665 | break the complex pattern into two patterns by splitting out some | |
8666 | subexpression. However, in some other cases, such as performing an | |
8667 | addition of a large constant in two insns on a RISC machine, the way to | |
8668 | split the addition into two insns is machine-dependent. | |
8669 | ||
f3a3d0d3 | 8670 | @findex define_split |
03dda8e3 RK |
8671 | The @code{define_split} definition tells the compiler how to split a |
8672 | complex insn into several simpler insns. It looks like this: | |
8673 | ||
8674 | @smallexample | |
8675 | (define_split | |
8676 | [@var{insn-pattern}] | |
8677 | "@var{condition}" | |
8678 | [@var{new-insn-pattern-1} | |
8679 | @var{new-insn-pattern-2} | |
8680 | @dots{}] | |
630d3d5a | 8681 | "@var{preparation-statements}") |
03dda8e3 RK |
8682 | @end smallexample |
8683 | ||
8684 | @var{insn-pattern} is a pattern that needs to be split and | |
8685 | @var{condition} is the final condition to be tested, as in a | |
8686 | @code{define_insn}. When an insn matching @var{insn-pattern} and | |
8687 | satisfying @var{condition} is found, it is replaced in the insn list | |
8688 | with the insns given by @var{new-insn-pattern-1}, | |
8689 | @var{new-insn-pattern-2}, etc. | |
8690 | ||
630d3d5a | 8691 | The @var{preparation-statements} are similar to those statements that |
03dda8e3 RK |
8692 | are specified for @code{define_expand} (@pxref{Expander Definitions}) |
8693 | and are executed before the new RTL is generated to prepare for the | |
8694 | generated code or emit some insns whose pattern is not fixed. Unlike | |
8695 | those in @code{define_expand}, however, these statements must not | |
8696 | generate any new pseudo-registers. Once reload has completed, they also | |
8697 | must not allocate any space in the stack frame. | |
8698 | ||
582d1f90 PK |
8699 | There are two special macros defined for use in the preparation statements: |
8700 | @code{DONE} and @code{FAIL}. Use them with a following semicolon, | |
8701 | as a statement. | |
8702 | ||
8703 | @table @code | |
8704 | ||
8705 | @findex DONE | |
8706 | @item DONE | |
8707 | Use the @code{DONE} macro to end RTL generation for the splitter. The | |
8708 | only RTL insns generated as replacement for the matched input insn will | |
8709 | be those already emitted by explicit calls to @code{emit_insn} within | |
8710 | the preparation statements; the replacement pattern is not used. | |
8711 | ||
8712 | @findex FAIL | |
8713 | @item FAIL | |
8714 | Make the @code{define_split} fail on this occasion. When a @code{define_split} | |
8715 | fails, it means that the splitter was not truly available for the inputs | |
8716 | it was given, and the input insn will not be split. | |
8717 | @end table | |
8718 | ||
8719 | If the preparation falls through (invokes neither @code{DONE} nor | |
8720 | @code{FAIL}), then the @code{define_split} uses the replacement | |
8721 | template. | |
8722 | ||
03dda8e3 RK |
8723 | Patterns are matched against @var{insn-pattern} in two different |
8724 | circumstances. If an insn needs to be split for delay slot scheduling | |
8725 | or insn scheduling, the insn is already known to be valid, which means | |
8726 | that it must have been matched by some @code{define_insn} and, if | |
df2a54e9 | 8727 | @code{reload_completed} is nonzero, is known to satisfy the constraints |
03dda8e3 RK |
8728 | of that @code{define_insn}. In that case, the new insn patterns must |
8729 | also be insns that are matched by some @code{define_insn} and, if | |
df2a54e9 | 8730 | @code{reload_completed} is nonzero, must also satisfy the constraints |
03dda8e3 RK |
8731 | of those definitions. |
8732 | ||
8733 | As an example of this usage of @code{define_split}, consider the following | |
8734 | example from @file{a29k.md}, which splits a @code{sign_extend} from | |
8735 | @code{HImode} to @code{SImode} into a pair of shift insns: | |
8736 | ||
8737 | @smallexample | |
8738 | (define_split | |
8739 | [(set (match_operand:SI 0 "gen_reg_operand" "") | |
8740 | (sign_extend:SI (match_operand:HI 1 "gen_reg_operand" "")))] | |
8741 | "" | |
8742 | [(set (match_dup 0) | |
8743 | (ashift:SI (match_dup 1) | |
8744 | (const_int 16))) | |
8745 | (set (match_dup 0) | |
8746 | (ashiftrt:SI (match_dup 0) | |
8747 | (const_int 16)))] | |
8748 | " | |
8749 | @{ operands[1] = gen_lowpart (SImode, operands[1]); @}") | |
8750 | @end smallexample | |
8751 | ||
8752 | When the combiner phase tries to split an insn pattern, it is always the | |
8753 | case that the pattern is @emph{not} matched by any @code{define_insn}. | |
8754 | The combiner pass first tries to split a single @code{set} expression | |
8755 | and then the same @code{set} expression inside a @code{parallel}, but | |
8756 | followed by a @code{clobber} of a pseudo-reg to use as a scratch | |
8cb0906b | 8757 | register. In these cases, the combiner expects exactly one or two new insn |
03dda8e3 RK |
8758 | patterns to be generated. It will verify that these patterns match some |
8759 | @code{define_insn} definitions, so you need not do this test in the | |
8760 | @code{define_split} (of course, there is no point in writing a | |
8761 | @code{define_split} that will never produce insns that match). | |
8762 | ||
8763 | Here is an example of this use of @code{define_split}, taken from | |
8764 | @file{rs6000.md}: | |
8765 | ||
8766 | @smallexample | |
8767 | (define_split | |
8768 | [(set (match_operand:SI 0 "gen_reg_operand" "") | |
8769 | (plus:SI (match_operand:SI 1 "gen_reg_operand" "") | |
8770 | (match_operand:SI 2 "non_add_cint_operand" "")))] | |
8771 | "" | |
8772 | [(set (match_dup 0) (plus:SI (match_dup 1) (match_dup 3))) | |
8773 | (set (match_dup 0) (plus:SI (match_dup 0) (match_dup 4)))] | |
8774 | " | |
8775 | @{ | |
8776 | int low = INTVAL (operands[2]) & 0xffff; | |
8777 | int high = (unsigned) INTVAL (operands[2]) >> 16; | |
8778 | ||
8779 | if (low & 0x8000) | |
8780 | high++, low |= 0xffff0000; | |
8781 | ||
3a598fbe JL |
8782 | operands[3] = GEN_INT (high << 16); |
8783 | operands[4] = GEN_INT (low); | |
03dda8e3 RK |
8784 | @}") |
8785 | @end smallexample | |
8786 | ||
8787 | Here the predicate @code{non_add_cint_operand} matches any | |
8788 | @code{const_int} that is @emph{not} a valid operand of a single add | |
8789 | insn. The add with the smaller displacement is written so that it | |
8790 | can be substituted into the address of a subsequent operation. | |
8791 | ||
8792 | An example that uses a scratch register, from the same file, generates | |
8793 | an equality comparison of a register and a large constant: | |
8794 | ||
8795 | @smallexample | |
8796 | (define_split | |
8797 | [(set (match_operand:CC 0 "cc_reg_operand" "") | |
8798 | (compare:CC (match_operand:SI 1 "gen_reg_operand" "") | |
8799 | (match_operand:SI 2 "non_short_cint_operand" ""))) | |
8800 | (clobber (match_operand:SI 3 "gen_reg_operand" ""))] | |
8801 | "find_single_use (operands[0], insn, 0) | |
8802 | && (GET_CODE (*find_single_use (operands[0], insn, 0)) == EQ | |
8803 | || GET_CODE (*find_single_use (operands[0], insn, 0)) == NE)" | |
8804 | [(set (match_dup 3) (xor:SI (match_dup 1) (match_dup 4))) | |
8805 | (set (match_dup 0) (compare:CC (match_dup 3) (match_dup 5)))] | |
8806 | " | |
8807 | @{ | |
12bcfaa1 | 8808 | /* @r{Get the constant we are comparing against, C, and see what it |
03dda8e3 | 8809 | looks like sign-extended to 16 bits. Then see what constant |
12bcfaa1 | 8810 | could be XOR'ed with C to get the sign-extended value.} */ |
03dda8e3 RK |
8811 | |
8812 | int c = INTVAL (operands[2]); | |
8813 | int sextc = (c << 16) >> 16; | |
8814 | int xorv = c ^ sextc; | |
8815 | ||
3a598fbe JL |
8816 | operands[4] = GEN_INT (xorv); |
8817 | operands[5] = GEN_INT (sextc); | |
03dda8e3 RK |
8818 | @}") |
8819 | @end smallexample | |
8820 | ||
8821 | To avoid confusion, don't write a single @code{define_split} that | |
8822 | accepts some insns that match some @code{define_insn} as well as some | |
8823 | insns that don't. Instead, write two separate @code{define_split} | |
8824 | definitions, one for the insns that are valid and one for the insns that | |
8825 | are not valid. | |
8826 | ||
6b24c259 JH |
8827 | The splitter is allowed to split jump instructions into sequence of |
8828 | jumps or create new jumps in while splitting non-jump instructions. As | |
d5f9df6a | 8829 | the control flow graph and branch prediction information needs to be updated, |
f282ffb3 | 8830 | several restriction apply. |
6b24c259 JH |
8831 | |
8832 | Splitting of jump instruction into sequence that over by another jump | |
c21cd8b1 | 8833 | instruction is always valid, as compiler expect identical behavior of new |
6b24c259 JH |
8834 | jump. When new sequence contains multiple jump instructions or new labels, |
8835 | more assistance is needed. Splitter is required to create only unconditional | |
8836 | jumps, or simple conditional jump instructions. Additionally it must attach a | |
63519d23 | 8837 | @code{REG_BR_PROB} note to each conditional jump. A global variable |
addd6f64 | 8838 | @code{split_branch_probability} holds the probability of the original branch in case |
e4ae5e77 | 8839 | it was a simple conditional jump, @minus{}1 otherwise. To simplify |
addd6f64 | 8840 | recomputing of edge frequencies, the new sequence is required to have only |
6b24c259 JH |
8841 | forward jumps to the newly created labels. |
8842 | ||
fae81b38 | 8843 | @findex define_insn_and_split |
c88c0d42 CP |
8844 | For the common case where the pattern of a define_split exactly matches the |
8845 | pattern of a define_insn, use @code{define_insn_and_split}. It looks like | |
8846 | this: | |
8847 | ||
8848 | @smallexample | |
8849 | (define_insn_and_split | |
8850 | [@var{insn-pattern}] | |
8851 | "@var{condition}" | |
8852 | "@var{output-template}" | |
8853 | "@var{split-condition}" | |
8854 | [@var{new-insn-pattern-1} | |
8855 | @var{new-insn-pattern-2} | |
8856 | @dots{}] | |
630d3d5a | 8857 | "@var{preparation-statements}" |
c88c0d42 CP |
8858 | [@var{insn-attributes}]) |
8859 | ||
8860 | @end smallexample | |
8861 | ||
8862 | @var{insn-pattern}, @var{condition}, @var{output-template}, and | |
8863 | @var{insn-attributes} are used as in @code{define_insn}. The | |
8864 | @var{new-insn-pattern} vector and the @var{preparation-statements} are used as | |
8865 | in a @code{define_split}. The @var{split-condition} is also used as in | |
8866 | @code{define_split}, with the additional behavior that if the condition starts | |
8867 | with @samp{&&}, the condition used for the split will be the constructed as a | |
d7d9c429 | 8868 | logical ``and'' of the split condition with the insn condition. For example, |
c88c0d42 CP |
8869 | from i386.md: |
8870 | ||
8871 | @smallexample | |
8872 | (define_insn_and_split "zero_extendhisi2_and" | |
8873 | [(set (match_operand:SI 0 "register_operand" "=r") | |
8874 | (zero_extend:SI (match_operand:HI 1 "register_operand" "0"))) | |
8875 | (clobber (reg:CC 17))] | |
8876 | "TARGET_ZERO_EXTEND_WITH_AND && !optimize_size" | |
8877 | "#" | |
8878 | "&& reload_completed" | |
f282ffb3 | 8879 | [(parallel [(set (match_dup 0) |
9c34dbbf | 8880 | (and:SI (match_dup 0) (const_int 65535))) |
6ccde948 | 8881 | (clobber (reg:CC 17))])] |
c88c0d42 CP |
8882 | "" |
8883 | [(set_attr "type" "alu1")]) | |
8884 | ||
8885 | @end smallexample | |
8886 | ||
ebb48a4d | 8887 | In this case, the actual split condition will be |
aee96fe9 | 8888 | @samp{TARGET_ZERO_EXTEND_WITH_AND && !optimize_size && reload_completed}. |
c88c0d42 CP |
8889 | |
8890 | The @code{define_insn_and_split} construction provides exactly the same | |
8891 | functionality as two separate @code{define_insn} and @code{define_split} | |
8892 | patterns. It exists for compactness, and as a maintenance tool to prevent | |
8893 | having to ensure the two patterns' templates match. | |
8894 | ||
f4fde1b3 RS |
8895 | @findex define_insn_and_rewrite |
8896 | It is sometimes useful to have a @code{define_insn_and_split} | |
8897 | that replaces specific operands of an instruction but leaves the | |
8898 | rest of the instruction pattern unchanged. You can do this directly | |
8899 | with a @code{define_insn_and_split}, but it requires a | |
8900 | @var{new-insn-pattern-1} that repeats most of the original @var{insn-pattern}. | |
8901 | There is also the complication that an implicit @code{parallel} in | |
8902 | @var{insn-pattern} must become an explicit @code{parallel} in | |
8903 | @var{new-insn-pattern-1}, which is easy to overlook. | |
8904 | A simpler alternative is to use @code{define_insn_and_rewrite}, which | |
8905 | is a form of @code{define_insn_and_split} that automatically generates | |
8906 | @var{new-insn-pattern-1} by replacing each @code{match_operand} | |
8907 | in @var{insn-pattern} with a corresponding @code{match_dup}, and each | |
8908 | @code{match_operator} in the pattern with a corresponding @code{match_op_dup}. | |
8909 | The arguments are otherwise identical to @code{define_insn_and_split}: | |
8910 | ||
8911 | @smallexample | |
8912 | (define_insn_and_rewrite | |
8913 | [@var{insn-pattern}] | |
8914 | "@var{condition}" | |
8915 | "@var{output-template}" | |
8916 | "@var{split-condition}" | |
8917 | "@var{preparation-statements}" | |
8918 | [@var{insn-attributes}]) | |
8919 | @end smallexample | |
8920 | ||
8921 | The @code{match_dup}s and @code{match_op_dup}s in the new | |
8922 | instruction pattern use any new operand values that the | |
8923 | @var{preparation-statements} store in the @code{operands} array, | |
8924 | as for a normal @code{define_insn_and_split}. @var{preparation-statements} | |
8925 | can also emit additional instructions before the new instruction. | |
8926 | They can even emit an entirely different sequence of instructions and | |
8927 | use @code{DONE} to avoid emitting a new form of the original | |
8928 | instruction. | |
8929 | ||
8930 | The split in a @code{define_insn_and_rewrite} is only intended | |
8931 | to apply to existing instructions that match @var{insn-pattern}. | |
8932 | @var{split-condition} must therefore start with @code{&&}, | |
8933 | so that the split condition applies on top of @var{condition}. | |
8934 | ||
8935 | Here is an example from the AArch64 SVE port, in which operand 1 is | |
8936 | known to be equivalent to an all-true constant and isn't used by the | |
8937 | output template: | |
8938 | ||
8939 | @smallexample | |
8940 | (define_insn_and_rewrite "*while_ult<GPI:mode><PRED_ALL:mode>_cc" | |
8941 | [(set (reg:CC CC_REGNUM) | |
8942 | (compare:CC | |
8943 | (unspec:SI [(match_operand:PRED_ALL 1) | |
8944 | (unspec:PRED_ALL | |
8945 | [(match_operand:GPI 2 "aarch64_reg_or_zero" "rZ") | |
8946 | (match_operand:GPI 3 "aarch64_reg_or_zero" "rZ")] | |
8947 | UNSPEC_WHILE_LO)] | |
8948 | UNSPEC_PTEST_PTRUE) | |
8949 | (const_int 0))) | |
8950 | (set (match_operand:PRED_ALL 0 "register_operand" "=Upa") | |
8951 | (unspec:PRED_ALL [(match_dup 2) | |
8952 | (match_dup 3)] | |
8953 | UNSPEC_WHILE_LO))] | |
8954 | "TARGET_SVE" | |
8955 | "whilelo\t%0.<PRED_ALL:Vetype>, %<w>2, %<w>3" | |
8956 | ;; Force the compiler to drop the unused predicate operand, so that we | |
8957 | ;; don't have an unnecessary PTRUE. | |
8958 | "&& !CONSTANT_P (operands[1])" | |
8959 | @{ | |
8960 | operands[1] = CONSTM1_RTX (<MODE>mode); | |
8961 | @} | |
8962 | ) | |
8963 | @end smallexample | |
8964 | ||
8965 | The splitter in this case simply replaces operand 1 with the constant | |
8966 | value that it is known to have. The equivalent @code{define_insn_and_split} | |
8967 | would be: | |
8968 | ||
8969 | @smallexample | |
8970 | (define_insn_and_split "*while_ult<GPI:mode><PRED_ALL:mode>_cc" | |
8971 | [(set (reg:CC CC_REGNUM) | |
8972 | (compare:CC | |
8973 | (unspec:SI [(match_operand:PRED_ALL 1) | |
8974 | (unspec:PRED_ALL | |
8975 | [(match_operand:GPI 2 "aarch64_reg_or_zero" "rZ") | |
8976 | (match_operand:GPI 3 "aarch64_reg_or_zero" "rZ")] | |
8977 | UNSPEC_WHILE_LO)] | |
8978 | UNSPEC_PTEST_PTRUE) | |
8979 | (const_int 0))) | |
8980 | (set (match_operand:PRED_ALL 0 "register_operand" "=Upa") | |
8981 | (unspec:PRED_ALL [(match_dup 2) | |
8982 | (match_dup 3)] | |
8983 | UNSPEC_WHILE_LO))] | |
8984 | "TARGET_SVE" | |
8985 | "whilelo\t%0.<PRED_ALL:Vetype>, %<w>2, %<w>3" | |
8986 | ;; Force the compiler to drop the unused predicate operand, so that we | |
8987 | ;; don't have an unnecessary PTRUE. | |
8988 | "&& !CONSTANT_P (operands[1])" | |
8989 | [(parallel | |
8990 | [(set (reg:CC CC_REGNUM) | |
8991 | (compare:CC | |
8992 | (unspec:SI [(match_dup 1) | |
8993 | (unspec:PRED_ALL [(match_dup 2) | |
8994 | (match_dup 3)] | |
8995 | UNSPEC_WHILE_LO)] | |
8996 | UNSPEC_PTEST_PTRUE) | |
8997 | (const_int 0))) | |
8998 | (set (match_dup 0) | |
8999 | (unspec:PRED_ALL [(match_dup 2) | |
9000 | (match_dup 3)] | |
9001 | UNSPEC_WHILE_LO))])] | |
9002 | @{ | |
9003 | operands[1] = CONSTM1_RTX (<MODE>mode); | |
9004 | @} | |
9005 | ) | |
9006 | @end smallexample | |
9007 | ||
a5249a21 HPN |
9008 | @end ifset |
9009 | @ifset INTERNALS | |
04d8aa70 AM |
9010 | @node Including Patterns |
9011 | @section Including Patterns in Machine Descriptions. | |
9012 | @cindex insn includes | |
9013 | ||
9014 | @findex include | |
9015 | The @code{include} pattern tells the compiler tools where to | |
9016 | look for patterns that are in files other than in the file | |
8a36672b | 9017 | @file{.md}. This is used only at build time and there is no preprocessing allowed. |
04d8aa70 AM |
9018 | |
9019 | It looks like: | |
9020 | ||
9021 | @smallexample | |
9022 | ||
9023 | (include | |
9024 | @var{pathname}) | |
9025 | @end smallexample | |
9026 | ||
9027 | For example: | |
9028 | ||
9029 | @smallexample | |
9030 | ||
f282ffb3 | 9031 | (include "filestuff") |
04d8aa70 AM |
9032 | |
9033 | @end smallexample | |
9034 | ||
27d30956 | 9035 | Where @var{pathname} is a string that specifies the location of the file, |
8a36672b | 9036 | specifies the include file to be in @file{gcc/config/target/filestuff}. The |
04d8aa70 AM |
9037 | directory @file{gcc/config/target} is regarded as the default directory. |
9038 | ||
9039 | ||
f282ffb3 JM |
9040 | Machine descriptions may be split up into smaller more manageable subsections |
9041 | and placed into subdirectories. | |
04d8aa70 AM |
9042 | |
9043 | By specifying: | |
9044 | ||
9045 | @smallexample | |
9046 | ||
f282ffb3 | 9047 | (include "BOGUS/filestuff") |
04d8aa70 AM |
9048 | |
9049 | @end smallexample | |
9050 | ||
9051 | the include file is specified to be in @file{gcc/config/@var{target}/BOGUS/filestuff}. | |
9052 | ||
9053 | Specifying an absolute path for the include file such as; | |
9054 | @smallexample | |
9055 | ||
f282ffb3 | 9056 | (include "/u2/BOGUS/filestuff") |
04d8aa70 AM |
9057 | |
9058 | @end smallexample | |
f282ffb3 | 9059 | is permitted but is not encouraged. |
04d8aa70 AM |
9060 | |
9061 | @subsection RTL Generation Tool Options for Directory Search | |
9062 | @cindex directory options .md | |
9063 | @cindex options, directory search | |
9064 | @cindex search options | |
9065 | ||
9066 | The @option{-I@var{dir}} option specifies directories to search for machine descriptions. | |
9067 | For example: | |
9068 | ||
9069 | @smallexample | |
9070 | ||
9071 | genrecog -I/p1/abc/proc1 -I/p2/abcd/pro2 target.md | |
9072 | ||
9073 | @end smallexample | |
9074 | ||
9075 | ||
9076 | Add the directory @var{dir} to the head of the list of directories to be | |
9077 | searched for header files. This can be used to override a system machine definition | |
9078 | file, substituting your own version, since these directories are | |
9079 | searched before the default machine description file directories. If you use more than | |
9080 | one @option{-I} option, the directories are scanned in left-to-right | |
9081 | order; the standard default directory come after. | |
9082 | ||
9083 | ||
a5249a21 HPN |
9084 | @end ifset |
9085 | @ifset INTERNALS | |
f3a3d0d3 RH |
9086 | @node Peephole Definitions |
9087 | @section Machine-Specific Peephole Optimizers | |
9088 | @cindex peephole optimizer definitions | |
9089 | @cindex defining peephole optimizers | |
9090 | ||
9091 | In addition to instruction patterns the @file{md} file may contain | |
9092 | definitions of machine-specific peephole optimizations. | |
9093 | ||
9094 | The combiner does not notice certain peephole optimizations when the data | |
9095 | flow in the program does not suggest that it should try them. For example, | |
9096 | sometimes two consecutive insns related in purpose can be combined even | |
9097 | though the second one does not appear to use a register computed in the | |
9098 | first one. A machine-specific peephole optimizer can detect such | |
9099 | opportunities. | |
9100 | ||
9101 | There are two forms of peephole definitions that may be used. The | |
9102 | original @code{define_peephole} is run at assembly output time to | |
9103 | match insns and substitute assembly text. Use of @code{define_peephole} | |
9104 | is deprecated. | |
9105 | ||
9106 | A newer @code{define_peephole2} matches insns and substitutes new | |
9107 | insns. The @code{peephole2} pass is run after register allocation | |
ebb48a4d | 9108 | but before scheduling, which may result in much better code for |
f3a3d0d3 RH |
9109 | targets that do scheduling. |
9110 | ||
9111 | @menu | |
9112 | * define_peephole:: RTL to Text Peephole Optimizers | |
9113 | * define_peephole2:: RTL to RTL Peephole Optimizers | |
9114 | @end menu | |
9115 | ||
a5249a21 HPN |
9116 | @end ifset |
9117 | @ifset INTERNALS | |
f3a3d0d3 RH |
9118 | @node define_peephole |
9119 | @subsection RTL to Text Peephole Optimizers | |
9120 | @findex define_peephole | |
9121 | ||
9122 | @need 1000 | |
9123 | A definition looks like this: | |
9124 | ||
9125 | @smallexample | |
9126 | (define_peephole | |
9127 | [@var{insn-pattern-1} | |
9128 | @var{insn-pattern-2} | |
9129 | @dots{}] | |
9130 | "@var{condition}" | |
9131 | "@var{template}" | |
630d3d5a | 9132 | "@var{optional-insn-attributes}") |
f3a3d0d3 RH |
9133 | @end smallexample |
9134 | ||
9135 | @noindent | |
9136 | The last string operand may be omitted if you are not using any | |
9137 | machine-specific information in this machine description. If present, | |
9138 | it must obey the same rules as in a @code{define_insn}. | |
9139 | ||
9140 | In this skeleton, @var{insn-pattern-1} and so on are patterns to match | |
9141 | consecutive insns. The optimization applies to a sequence of insns when | |
9142 | @var{insn-pattern-1} matches the first one, @var{insn-pattern-2} matches | |
bd819a4a | 9143 | the next, and so on. |
f3a3d0d3 RH |
9144 | |
9145 | Each of the insns matched by a peephole must also match a | |
9146 | @code{define_insn}. Peepholes are checked only at the last stage just | |
9147 | before code generation, and only optionally. Therefore, any insn which | |
9148 | would match a peephole but no @code{define_insn} will cause a crash in code | |
9149 | generation in an unoptimized compilation, or at various optimization | |
9150 | stages. | |
9151 | ||
9152 | The operands of the insns are matched with @code{match_operands}, | |
9153 | @code{match_operator}, and @code{match_dup}, as usual. What is not | |
9154 | usual is that the operand numbers apply to all the insn patterns in the | |
9155 | definition. So, you can check for identical operands in two insns by | |
9156 | using @code{match_operand} in one insn and @code{match_dup} in the | |
9157 | other. | |
9158 | ||
9159 | The operand constraints used in @code{match_operand} patterns do not have | |
9160 | any direct effect on the applicability of the peephole, but they will | |
9161 | be validated afterward, so make sure your constraints are general enough | |
9162 | to apply whenever the peephole matches. If the peephole matches | |
9163 | but the constraints are not satisfied, the compiler will crash. | |
9164 | ||
9165 | It is safe to omit constraints in all the operands of the peephole; or | |
9166 | you can write constraints which serve as a double-check on the criteria | |
9167 | previously tested. | |
9168 | ||
9169 | Once a sequence of insns matches the patterns, the @var{condition} is | |
9170 | checked. This is a C expression which makes the final decision whether to | |
9171 | perform the optimization (we do so if the expression is nonzero). If | |
9172 | @var{condition} is omitted (in other words, the string is empty) then the | |
9173 | optimization is applied to every sequence of insns that matches the | |
9174 | patterns. | |
9175 | ||
9176 | The defined peephole optimizations are applied after register allocation | |
9177 | is complete. Therefore, the peephole definition can check which | |
9178 | operands have ended up in which kinds of registers, just by looking at | |
9179 | the operands. | |
9180 | ||
9181 | @findex prev_active_insn | |
9182 | The way to refer to the operands in @var{condition} is to write | |
9183 | @code{operands[@var{i}]} for operand number @var{i} (as matched by | |
9184 | @code{(match_operand @var{i} @dots{})}). Use the variable @code{insn} | |
9185 | to refer to the last of the insns being matched; use | |
9186 | @code{prev_active_insn} to find the preceding insns. | |
9187 | ||
9188 | @findex dead_or_set_p | |
9189 | When optimizing computations with intermediate results, you can use | |
9190 | @var{condition} to match only when the intermediate results are not used | |
9191 | elsewhere. Use the C expression @code{dead_or_set_p (@var{insn}, | |
9192 | @var{op})}, where @var{insn} is the insn in which you expect the value | |
9193 | to be used for the last time (from the value of @code{insn}, together | |
9194 | with use of @code{prev_nonnote_insn}), and @var{op} is the intermediate | |
bd819a4a | 9195 | value (from @code{operands[@var{i}]}). |
f3a3d0d3 RH |
9196 | |
9197 | Applying the optimization means replacing the sequence of insns with one | |
9198 | new insn. The @var{template} controls ultimate output of assembler code | |
9199 | for this combined insn. It works exactly like the template of a | |
9200 | @code{define_insn}. Operand numbers in this template are the same ones | |
9201 | used in matching the original sequence of insns. | |
9202 | ||
9203 | The result of a defined peephole optimizer does not need to match any of | |
9204 | the insn patterns in the machine description; it does not even have an | |
9205 | opportunity to match them. The peephole optimizer definition itself serves | |
9206 | as the insn pattern to control how the insn is output. | |
9207 | ||
9208 | Defined peephole optimizers are run as assembler code is being output, | |
9209 | so the insns they produce are never combined or rearranged in any way. | |
9210 | ||
9211 | Here is an example, taken from the 68000 machine description: | |
9212 | ||
9213 | @smallexample | |
9214 | (define_peephole | |
9215 | [(set (reg:SI 15) (plus:SI (reg:SI 15) (const_int 4))) | |
9216 | (set (match_operand:DF 0 "register_operand" "=f") | |
9217 | (match_operand:DF 1 "register_operand" "ad"))] | |
9218 | "FP_REG_P (operands[0]) && ! FP_REG_P (operands[1])" | |
f3a3d0d3 RH |
9219 | @{ |
9220 | rtx xoperands[2]; | |
a2a8cc44 | 9221 | xoperands[1] = gen_rtx_REG (SImode, REGNO (operands[1]) + 1); |
f3a3d0d3 | 9222 | #ifdef MOTOROLA |
0f40f9f7 ZW |
9223 | output_asm_insn ("move.l %1,(sp)", xoperands); |
9224 | output_asm_insn ("move.l %1,-(sp)", operands); | |
9225 | return "fmove.d (sp)+,%0"; | |
f3a3d0d3 | 9226 | #else |
0f40f9f7 ZW |
9227 | output_asm_insn ("movel %1,sp@@", xoperands); |
9228 | output_asm_insn ("movel %1,sp@@-", operands); | |
9229 | return "fmoved sp@@+,%0"; | |
f3a3d0d3 | 9230 | #endif |
0f40f9f7 | 9231 | @}) |
f3a3d0d3 RH |
9232 | @end smallexample |
9233 | ||
9234 | @need 1000 | |
9235 | The effect of this optimization is to change | |
9236 | ||
9237 | @smallexample | |
9238 | @group | |
9239 | jbsr _foobar | |
9240 | addql #4,sp | |
9241 | movel d1,sp@@- | |
9242 | movel d0,sp@@- | |
9243 | fmoved sp@@+,fp0 | |
9244 | @end group | |
9245 | @end smallexample | |
9246 | ||
9247 | @noindent | |
9248 | into | |
9249 | ||
9250 | @smallexample | |
9251 | @group | |
9252 | jbsr _foobar | |
9253 | movel d1,sp@@ | |
9254 | movel d0,sp@@- | |
9255 | fmoved sp@@+,fp0 | |
9256 | @end group | |
9257 | @end smallexample | |
9258 | ||
9259 | @ignore | |
9260 | @findex CC_REVERSED | |
9261 | If a peephole matches a sequence including one or more jump insns, you must | |
9262 | take account of the flags such as @code{CC_REVERSED} which specify that the | |
9263 | condition codes are represented in an unusual manner. The compiler | |
9264 | automatically alters any ordinary conditional jumps which occur in such | |
9265 | situations, but the compiler cannot alter jumps which have been replaced by | |
9266 | peephole optimizations. So it is up to you to alter the assembler code | |
9267 | that the peephole produces. Supply C code to write the assembler output, | |
9268 | and in this C code check the condition code status flags and change the | |
9269 | assembler code as appropriate. | |
9270 | @end ignore | |
9271 | ||
9272 | @var{insn-pattern-1} and so on look @emph{almost} like the second | |
9273 | operand of @code{define_insn}. There is one important difference: the | |
9274 | second operand of @code{define_insn} consists of one or more RTX's | |
9275 | enclosed in square brackets. Usually, there is only one: then the same | |
9276 | action can be written as an element of a @code{define_peephole}. But | |
9277 | when there are multiple actions in a @code{define_insn}, they are | |
9278 | implicitly enclosed in a @code{parallel}. Then you must explicitly | |
9279 | write the @code{parallel}, and the square brackets within it, in the | |
9280 | @code{define_peephole}. Thus, if an insn pattern looks like this, | |
9281 | ||
9282 | @smallexample | |
9283 | (define_insn "divmodsi4" | |
9284 | [(set (match_operand:SI 0 "general_operand" "=d") | |
9285 | (div:SI (match_operand:SI 1 "general_operand" "0") | |
9286 | (match_operand:SI 2 "general_operand" "dmsK"))) | |
9287 | (set (match_operand:SI 3 "general_operand" "=d") | |
9288 | (mod:SI (match_dup 1) (match_dup 2)))] | |
9289 | "TARGET_68020" | |
9290 | "divsl%.l %2,%3:%0") | |
9291 | @end smallexample | |
9292 | ||
9293 | @noindent | |
9294 | then the way to mention this insn in a peephole is as follows: | |
9295 | ||
9296 | @smallexample | |
9297 | (define_peephole | |
9298 | [@dots{} | |
9299 | (parallel | |
9300 | [(set (match_operand:SI 0 "general_operand" "=d") | |
9301 | (div:SI (match_operand:SI 1 "general_operand" "0") | |
9302 | (match_operand:SI 2 "general_operand" "dmsK"))) | |
9303 | (set (match_operand:SI 3 "general_operand" "=d") | |
9304 | (mod:SI (match_dup 1) (match_dup 2)))]) | |
9305 | @dots{}] | |
9306 | @dots{}) | |
9307 | @end smallexample | |
9308 | ||
a5249a21 HPN |
9309 | @end ifset |
9310 | @ifset INTERNALS | |
f3a3d0d3 RH |
9311 | @node define_peephole2 |
9312 | @subsection RTL to RTL Peephole Optimizers | |
9313 | @findex define_peephole2 | |
9314 | ||
9315 | The @code{define_peephole2} definition tells the compiler how to | |
ebb48a4d | 9316 | substitute one sequence of instructions for another sequence, |
f3a3d0d3 RH |
9317 | what additional scratch registers may be needed and what their |
9318 | lifetimes must be. | |
9319 | ||
9320 | @smallexample | |
9321 | (define_peephole2 | |
9322 | [@var{insn-pattern-1} | |
9323 | @var{insn-pattern-2} | |
9324 | @dots{}] | |
9325 | "@var{condition}" | |
9326 | [@var{new-insn-pattern-1} | |
9327 | @var{new-insn-pattern-2} | |
9328 | @dots{}] | |
630d3d5a | 9329 | "@var{preparation-statements}") |
f3a3d0d3 RH |
9330 | @end smallexample |
9331 | ||
9332 | The definition is almost identical to @code{define_split} | |
9333 | (@pxref{Insn Splitting}) except that the pattern to match is not a | |
9334 | single instruction, but a sequence of instructions. | |
9335 | ||
9336 | It is possible to request additional scratch registers for use in the | |
9337 | output template. If appropriate registers are not free, the pattern | |
9338 | will simply not match. | |
9339 | ||
9340 | @findex match_scratch | |
9341 | @findex match_dup | |
9342 | Scratch registers are requested with a @code{match_scratch} pattern at | |
9343 | the top level of the input pattern. The allocated register (initially) will | |
9344 | be dead at the point requested within the original sequence. If the scratch | |
9345 | is used at more than a single point, a @code{match_dup} pattern at the | |
9346 | top level of the input pattern marks the last position in the input sequence | |
9347 | at which the register must be available. | |
9348 | ||
9349 | Here is an example from the IA-32 machine description: | |
9350 | ||
9351 | @smallexample | |
9352 | (define_peephole2 | |
9353 | [(match_scratch:SI 2 "r") | |
9354 | (parallel [(set (match_operand:SI 0 "register_operand" "") | |
9355 | (match_operator:SI 3 "arith_or_logical_operator" | |
9356 | [(match_dup 0) | |
9357 | (match_operand:SI 1 "memory_operand" "")])) | |
9358 | (clobber (reg:CC 17))])] | |
9359 | "! optimize_size && ! TARGET_READ_MODIFY" | |
9360 | [(set (match_dup 2) (match_dup 1)) | |
9361 | (parallel [(set (match_dup 0) | |
9362 | (match_op_dup 3 [(match_dup 0) (match_dup 2)])) | |
9363 | (clobber (reg:CC 17))])] | |
9364 | "") | |
9365 | @end smallexample | |
9366 | ||
9367 | @noindent | |
9368 | This pattern tries to split a load from its use in the hopes that we'll be | |
9369 | able to schedule around the memory load latency. It allocates a single | |
9370 | @code{SImode} register of class @code{GENERAL_REGS} (@code{"r"}) that needs | |
9371 | to be live only at the point just before the arithmetic. | |
9372 | ||
b192711e | 9373 | A real example requiring extended scratch lifetimes is harder to come by, |
f3a3d0d3 RH |
9374 | so here's a silly made-up example: |
9375 | ||
9376 | @smallexample | |
9377 | (define_peephole2 | |
9378 | [(match_scratch:SI 4 "r") | |
9379 | (set (match_operand:SI 0 "" "") (match_operand:SI 1 "" "")) | |
9380 | (set (match_operand:SI 2 "" "") (match_dup 1)) | |
9381 | (match_dup 4) | |
9382 | (set (match_operand:SI 3 "" "") (match_dup 1))] | |
630d3d5a | 9383 | "/* @r{determine 1 does not overlap 0 and 2} */" |
f3a3d0d3 RH |
9384 | [(set (match_dup 4) (match_dup 1)) |
9385 | (set (match_dup 0) (match_dup 4)) | |
c8fbf1fa | 9386 | (set (match_dup 2) (match_dup 4)) |
f3a3d0d3 RH |
9387 | (set (match_dup 3) (match_dup 4))] |
9388 | "") | |
9389 | @end smallexample | |
9390 | ||
582d1f90 PK |
9391 | There are two special macros defined for use in the preparation statements: |
9392 | @code{DONE} and @code{FAIL}. Use them with a following semicolon, | |
9393 | as a statement. | |
9394 | ||
9395 | @table @code | |
9396 | ||
9397 | @findex DONE | |
9398 | @item DONE | |
9399 | Use the @code{DONE} macro to end RTL generation for the peephole. The | |
9400 | only RTL insns generated as replacement for the matched input insn will | |
9401 | be those already emitted by explicit calls to @code{emit_insn} within | |
9402 | the preparation statements; the replacement pattern is not used. | |
9403 | ||
9404 | @findex FAIL | |
9405 | @item FAIL | |
9406 | Make the @code{define_peephole2} fail on this occasion. When a @code{define_peephole2} | |
9407 | fails, it means that the replacement was not truly available for the | |
9408 | particular inputs it was given. In that case, GCC may still apply a | |
9409 | later @code{define_peephole2} that also matches the given insn pattern. | |
9410 | (Note that this is different from @code{define_split}, where @code{FAIL} | |
9411 | prevents the input insn from being split at all.) | |
9412 | @end table | |
9413 | ||
9414 | If the preparation falls through (invokes neither @code{DONE} nor | |
9415 | @code{FAIL}), then the @code{define_peephole2} uses the replacement | |
9416 | template. | |
9417 | ||
f3a3d0d3 | 9418 | @noindent |
a628d195 RH |
9419 | If we had not added the @code{(match_dup 4)} in the middle of the input |
9420 | sequence, it might have been the case that the register we chose at the | |
9421 | beginning of the sequence is killed by the first or second @code{set}. | |
f3a3d0d3 | 9422 | |
a5249a21 HPN |
9423 | @end ifset |
9424 | @ifset INTERNALS | |
03dda8e3 RK |
9425 | @node Insn Attributes |
9426 | @section Instruction Attributes | |
9427 | @cindex insn attributes | |
9428 | @cindex instruction attributes | |
9429 | ||
9430 | In addition to describing the instruction supported by the target machine, | |
9431 | the @file{md} file also defines a group of @dfn{attributes} and a set of | |
9432 | values for each. Every generated insn is assigned a value for each attribute. | |
9433 | One possible attribute would be the effect that the insn has on the machine's | |
bd1cd0d0 | 9434 | condition code. |
03dda8e3 RK |
9435 | |
9436 | @menu | |
9437 | * Defining Attributes:: Specifying attributes and their values. | |
9438 | * Expressions:: Valid expressions for attribute values. | |
9439 | * Tagging Insns:: Assigning attribute values to insns. | |
9440 | * Attr Example:: An example of assigning attributes. | |
9441 | * Insn Lengths:: Computing the length of insns. | |
9442 | * Constant Attributes:: Defining attributes that are constant. | |
13b72c22 | 9443 | * Mnemonic Attribute:: Obtain the instruction mnemonic as attribute value. |
03dda8e3 | 9444 | * Delay Slots:: Defining delay slots required for a machine. |
fae15c93 | 9445 | * Processor pipeline description:: Specifying information for insn scheduling. |
03dda8e3 RK |
9446 | @end menu |
9447 | ||
a5249a21 HPN |
9448 | @end ifset |
9449 | @ifset INTERNALS | |
03dda8e3 RK |
9450 | @node Defining Attributes |
9451 | @subsection Defining Attributes and their Values | |
9452 | @cindex defining attributes and their values | |
9453 | @cindex attributes, defining | |
9454 | ||
9455 | @findex define_attr | |
9456 | The @code{define_attr} expression is used to define each attribute required | |
9457 | by the target machine. It looks like: | |
9458 | ||
9459 | @smallexample | |
9460 | (define_attr @var{name} @var{list-of-values} @var{default}) | |
9461 | @end smallexample | |
9462 | ||
13b72c22 AK |
9463 | @var{name} is a string specifying the name of the attribute being |
9464 | defined. Some attributes are used in a special way by the rest of the | |
9465 | compiler. The @code{enabled} attribute can be used to conditionally | |
9466 | enable or disable insn alternatives (@pxref{Disable Insn | |
9467 | Alternatives}). The @code{predicable} attribute, together with a | |
9468 | suitable @code{define_cond_exec} (@pxref{Conditional Execution}), can | |
9469 | be used to automatically generate conditional variants of instruction | |
9470 | patterns. The @code{mnemonic} attribute can be used to check for the | |
9471 | instruction mnemonic (@pxref{Mnemonic Attribute}). The compiler | |
9472 | internally uses the names @code{ce_enabled} and @code{nonce_enabled}, | |
9473 | so they should not be used elsewhere as alternative names. | |
03dda8e3 RK |
9474 | |
9475 | @var{list-of-values} is either a string that specifies a comma-separated | |
9476 | list of values that can be assigned to the attribute, or a null string to | |
9477 | indicate that the attribute takes numeric values. | |
9478 | ||
9479 | @var{default} is an attribute expression that gives the value of this | |
9480 | attribute for insns that match patterns whose definition does not include | |
9481 | an explicit value for this attribute. @xref{Attr Example}, for more | |
9482 | information on the handling of defaults. @xref{Constant Attributes}, | |
9483 | for information on attributes that do not depend on any particular insn. | |
9484 | ||
9485 | @findex insn-attr.h | |
9486 | For each defined attribute, a number of definitions are written to the | |
9487 | @file{insn-attr.h} file. For cases where an explicit set of values is | |
9488 | specified for an attribute, the following are defined: | |
9489 | ||
9490 | @itemize @bullet | |
9491 | @item | |
9492 | A @samp{#define} is written for the symbol @samp{HAVE_ATTR_@var{name}}. | |
9493 | ||
9494 | @item | |
2eac577f | 9495 | An enumerated class is defined for @samp{attr_@var{name}} with |
03dda8e3 | 9496 | elements of the form @samp{@var{upper-name}_@var{upper-value}} where |
4bd0bee9 | 9497 | the attribute name and value are first converted to uppercase. |
03dda8e3 RK |
9498 | |
9499 | @item | |
9500 | A function @samp{get_attr_@var{name}} is defined that is passed an insn and | |
9501 | returns the attribute value for that insn. | |
9502 | @end itemize | |
9503 | ||
9504 | For example, if the following is present in the @file{md} file: | |
9505 | ||
9506 | @smallexample | |
9507 | (define_attr "type" "branch,fp,load,store,arith" @dots{}) | |
9508 | @end smallexample | |
9509 | ||
9510 | @noindent | |
9511 | the following lines will be written to the file @file{insn-attr.h}. | |
9512 | ||
9513 | @smallexample | |
d327457f | 9514 | #define HAVE_ATTR_type 1 |
03dda8e3 RK |
9515 | enum attr_type @{TYPE_BRANCH, TYPE_FP, TYPE_LOAD, |
9516 | TYPE_STORE, TYPE_ARITH@}; | |
9517 | extern enum attr_type get_attr_type (); | |
9518 | @end smallexample | |
9519 | ||
9520 | If the attribute takes numeric values, no @code{enum} type will be | |
9521 | defined and the function to obtain the attribute's value will return | |
9522 | @code{int}. | |
9523 | ||
7ac28727 AK |
9524 | There are attributes which are tied to a specific meaning. These |
9525 | attributes are not free to use for other purposes: | |
9526 | ||
9527 | @table @code | |
9528 | @item length | |
9529 | The @code{length} attribute is used to calculate the length of emitted | |
9530 | code chunks. This is especially important when verifying branch | |
9531 | distances. @xref{Insn Lengths}. | |
9532 | ||
9533 | @item enabled | |
9534 | The @code{enabled} attribute can be defined to prevent certain | |
9535 | alternatives of an insn definition from being used during code | |
9536 | generation. @xref{Disable Insn Alternatives}. | |
13b72c22 AK |
9537 | |
9538 | @item mnemonic | |
9539 | The @code{mnemonic} attribute can be defined to implement instruction | |
630ba2fd | 9540 | specific checks in e.g.@: the pipeline description. |
13b72c22 | 9541 | @xref{Mnemonic Attribute}. |
7ac28727 AK |
9542 | @end table |
9543 | ||
d327457f JR |
9544 | For each of these special attributes, the corresponding |
9545 | @samp{HAVE_ATTR_@var{name}} @samp{#define} is also written when the | |
9546 | attribute is not defined; in that case, it is defined as @samp{0}. | |
9547 | ||
8f4fe86c RS |
9548 | @findex define_enum_attr |
9549 | @anchor{define_enum_attr} | |
9550 | Another way of defining an attribute is to use: | |
9551 | ||
9552 | @smallexample | |
9553 | (define_enum_attr "@var{attr}" "@var{enum}" @var{default}) | |
9554 | @end smallexample | |
9555 | ||
9556 | This works in just the same way as @code{define_attr}, except that | |
9557 | the list of values is taken from a separate enumeration called | |
9558 | @var{enum} (@pxref{define_enum}). This form allows you to use | |
9559 | the same list of values for several attributes without having to | |
9560 | repeat the list each time. For example: | |
9561 | ||
9562 | @smallexample | |
9563 | (define_enum "processor" [ | |
9564 | model_a | |
9565 | model_b | |
9566 | @dots{} | |
9567 | ]) | |
9568 | (define_enum_attr "arch" "processor" | |
9569 | (const (symbol_ref "target_arch"))) | |
9570 | (define_enum_attr "tune" "processor" | |
9571 | (const (symbol_ref "target_tune"))) | |
9572 | @end smallexample | |
9573 | ||
9574 | defines the same attributes as: | |
9575 | ||
9576 | @smallexample | |
9577 | (define_attr "arch" "model_a,model_b,@dots{}" | |
9578 | (const (symbol_ref "target_arch"))) | |
9579 | (define_attr "tune" "model_a,model_b,@dots{}" | |
9580 | (const (symbol_ref "target_tune"))) | |
9581 | @end smallexample | |
9582 | ||
9583 | but without duplicating the processor list. The second example defines two | |
9584 | separate C enums (@code{attr_arch} and @code{attr_tune}) whereas the first | |
9585 | defines a single C enum (@code{processor}). | |
a5249a21 HPN |
9586 | @end ifset |
9587 | @ifset INTERNALS | |
03dda8e3 RK |
9588 | @node Expressions |
9589 | @subsection Attribute Expressions | |
9590 | @cindex attribute expressions | |
9591 | ||
9592 | RTL expressions used to define attributes use the codes described above | |
9593 | plus a few specific to attribute definitions, to be discussed below. | |
9594 | Attribute value expressions must have one of the following forms: | |
9595 | ||
9596 | @table @code | |
9597 | @cindex @code{const_int} and attributes | |
9598 | @item (const_int @var{i}) | |
9599 | The integer @var{i} specifies the value of a numeric attribute. @var{i} | |
9600 | must be non-negative. | |
9601 | ||
9602 | The value of a numeric attribute can be specified either with a | |
00bc45c1 RH |
9603 | @code{const_int}, or as an integer represented as a string in |
9604 | @code{const_string}, @code{eq_attr} (see below), @code{attr}, | |
9605 | @code{symbol_ref}, simple arithmetic expressions, and @code{set_attr} | |
9606 | overrides on specific instructions (@pxref{Tagging Insns}). | |
03dda8e3 RK |
9607 | |
9608 | @cindex @code{const_string} and attributes | |
9609 | @item (const_string @var{value}) | |
9610 | The string @var{value} specifies a constant attribute value. | |
9611 | If @var{value} is specified as @samp{"*"}, it means that the default value of | |
9612 | the attribute is to be used for the insn containing this expression. | |
9613 | @samp{"*"} obviously cannot be used in the @var{default} expression | |
bd819a4a | 9614 | of a @code{define_attr}. |
03dda8e3 RK |
9615 | |
9616 | If the attribute whose value is being specified is numeric, @var{value} | |
9617 | must be a string containing a non-negative integer (normally | |
9618 | @code{const_int} would be used in this case). Otherwise, it must | |
9619 | contain one of the valid values for the attribute. | |
9620 | ||
9621 | @cindex @code{if_then_else} and attributes | |
9622 | @item (if_then_else @var{test} @var{true-value} @var{false-value}) | |
9623 | @var{test} specifies an attribute test, whose format is defined below. | |
9624 | The value of this expression is @var{true-value} if @var{test} is true, | |
9625 | otherwise it is @var{false-value}. | |
9626 | ||
9627 | @cindex @code{cond} and attributes | |
9628 | @item (cond [@var{test1} @var{value1} @dots{}] @var{default}) | |
9629 | The first operand of this expression is a vector containing an even | |
9630 | number of expressions and consisting of pairs of @var{test} and @var{value} | |
9631 | expressions. The value of the @code{cond} expression is that of the | |
9632 | @var{value} corresponding to the first true @var{test} expression. If | |
9633 | none of the @var{test} expressions are true, the value of the @code{cond} | |
9634 | expression is that of the @var{default} expression. | |
9635 | @end table | |
9636 | ||
9637 | @var{test} expressions can have one of the following forms: | |
9638 | ||
9639 | @table @code | |
9640 | @cindex @code{const_int} and attribute tests | |
9641 | @item (const_int @var{i}) | |
df2a54e9 | 9642 | This test is true if @var{i} is nonzero and false otherwise. |
03dda8e3 RK |
9643 | |
9644 | @cindex @code{not} and attributes | |
9645 | @cindex @code{ior} and attributes | |
9646 | @cindex @code{and} and attributes | |
9647 | @item (not @var{test}) | |
9648 | @itemx (ior @var{test1} @var{test2}) | |
9649 | @itemx (and @var{test1} @var{test2}) | |
9650 | These tests are true if the indicated logical function is true. | |
9651 | ||
9652 | @cindex @code{match_operand} and attributes | |
9653 | @item (match_operand:@var{m} @var{n} @var{pred} @var{constraints}) | |
9654 | This test is true if operand @var{n} of the insn whose attribute value | |
9655 | is being determined has mode @var{m} (this part of the test is ignored | |
9656 | if @var{m} is @code{VOIDmode}) and the function specified by the string | |
df2a54e9 | 9657 | @var{pred} returns a nonzero value when passed operand @var{n} and mode |
03dda8e3 RK |
9658 | @var{m} (this part of the test is ignored if @var{pred} is the null |
9659 | string). | |
9660 | ||
9661 | The @var{constraints} operand is ignored and should be the null string. | |
9662 | ||
0c0d3957 RS |
9663 | @cindex @code{match_test} and attributes |
9664 | @item (match_test @var{c-expr}) | |
9665 | The test is true if C expression @var{c-expr} is true. In non-constant | |
9666 | attributes, @var{c-expr} has access to the following variables: | |
9667 | ||
9668 | @table @var | |
9669 | @item insn | |
9670 | The rtl instruction under test. | |
9671 | @item which_alternative | |
9672 | The @code{define_insn} alternative that @var{insn} matches. | |
9673 | @xref{Output Statement}. | |
9674 | @item operands | |
9675 | An array of @var{insn}'s rtl operands. | |
9676 | @end table | |
9677 | ||
9678 | @var{c-expr} behaves like the condition in a C @code{if} statement, | |
9679 | so there is no need to explicitly convert the expression into a boolean | |
9680 | 0 or 1 value. For example, the following two tests are equivalent: | |
9681 | ||
9682 | @smallexample | |
9683 | (match_test "x & 2") | |
9684 | (match_test "(x & 2) != 0") | |
9685 | @end smallexample | |
9686 | ||
03dda8e3 RK |
9687 | @cindex @code{le} and attributes |
9688 | @cindex @code{leu} and attributes | |
9689 | @cindex @code{lt} and attributes | |
9690 | @cindex @code{gt} and attributes | |
9691 | @cindex @code{gtu} and attributes | |
9692 | @cindex @code{ge} and attributes | |
9693 | @cindex @code{geu} and attributes | |
9694 | @cindex @code{ne} and attributes | |
9695 | @cindex @code{eq} and attributes | |
9696 | @cindex @code{plus} and attributes | |
9697 | @cindex @code{minus} and attributes | |
9698 | @cindex @code{mult} and attributes | |
9699 | @cindex @code{div} and attributes | |
9700 | @cindex @code{mod} and attributes | |
9701 | @cindex @code{abs} and attributes | |
9702 | @cindex @code{neg} and attributes | |
9703 | @cindex @code{ashift} and attributes | |
9704 | @cindex @code{lshiftrt} and attributes | |
9705 | @cindex @code{ashiftrt} and attributes | |
9706 | @item (le @var{arith1} @var{arith2}) | |
9707 | @itemx (leu @var{arith1} @var{arith2}) | |
9708 | @itemx (lt @var{arith1} @var{arith2}) | |
9709 | @itemx (ltu @var{arith1} @var{arith2}) | |
9710 | @itemx (gt @var{arith1} @var{arith2}) | |
9711 | @itemx (gtu @var{arith1} @var{arith2}) | |
9712 | @itemx (ge @var{arith1} @var{arith2}) | |
9713 | @itemx (geu @var{arith1} @var{arith2}) | |
9714 | @itemx (ne @var{arith1} @var{arith2}) | |
9715 | @itemx (eq @var{arith1} @var{arith2}) | |
9716 | These tests are true if the indicated comparison of the two arithmetic | |
9717 | expressions is true. Arithmetic expressions are formed with | |
9718 | @code{plus}, @code{minus}, @code{mult}, @code{div}, @code{mod}, | |
9719 | @code{abs}, @code{neg}, @code{and}, @code{ior}, @code{xor}, @code{not}, | |
bd819a4a | 9720 | @code{ashift}, @code{lshiftrt}, and @code{ashiftrt} expressions. |
03dda8e3 RK |
9721 | |
9722 | @findex get_attr | |
9723 | @code{const_int} and @code{symbol_ref} are always valid terms (@pxref{Insn | |
9724 | Lengths},for additional forms). @code{symbol_ref} is a string | |
9725 | denoting a C expression that yields an @code{int} when evaluated by the | |
9726 | @samp{get_attr_@dots{}} routine. It should normally be a global | |
bd819a4a | 9727 | variable. |
03dda8e3 RK |
9728 | |
9729 | @findex eq_attr | |
9730 | @item (eq_attr @var{name} @var{value}) | |
9731 | @var{name} is a string specifying the name of an attribute. | |
9732 | ||
9733 | @var{value} is a string that is either a valid value for attribute | |
9734 | @var{name}, a comma-separated list of values, or @samp{!} followed by a | |
9735 | value or list. If @var{value} does not begin with a @samp{!}, this | |
9736 | test is true if the value of the @var{name} attribute of the current | |
9737 | insn is in the list specified by @var{value}. If @var{value} begins | |
9738 | with a @samp{!}, this test is true if the attribute's value is | |
9739 | @emph{not} in the specified list. | |
9740 | ||
9741 | For example, | |
9742 | ||
9743 | @smallexample | |
9744 | (eq_attr "type" "load,store") | |
9745 | @end smallexample | |
9746 | ||
9747 | @noindent | |
9748 | is equivalent to | |
9749 | ||
9750 | @smallexample | |
9751 | (ior (eq_attr "type" "load") (eq_attr "type" "store")) | |
9752 | @end smallexample | |
9753 | ||
9754 | If @var{name} specifies an attribute of @samp{alternative}, it refers to the | |
9755 | value of the compiler variable @code{which_alternative} | |
9756 | (@pxref{Output Statement}) and the values must be small integers. For | |
bd819a4a | 9757 | example, |
03dda8e3 RK |
9758 | |
9759 | @smallexample | |
9760 | (eq_attr "alternative" "2,3") | |
9761 | @end smallexample | |
9762 | ||
9763 | @noindent | |
9764 | is equivalent to | |
9765 | ||
9766 | @smallexample | |
9767 | (ior (eq (symbol_ref "which_alternative") (const_int 2)) | |
9768 | (eq (symbol_ref "which_alternative") (const_int 3))) | |
9769 | @end smallexample | |
9770 | ||
9771 | Note that, for most attributes, an @code{eq_attr} test is simplified in cases | |
9772 | where the value of the attribute being tested is known for all insns matching | |
bd819a4a | 9773 | a particular pattern. This is by far the most common case. |
03dda8e3 RK |
9774 | |
9775 | @findex attr_flag | |
9776 | @item (attr_flag @var{name}) | |
9777 | The value of an @code{attr_flag} expression is true if the flag | |
9778 | specified by @var{name} is true for the @code{insn} currently being | |
9779 | scheduled. | |
9780 | ||
9781 | @var{name} is a string specifying one of a fixed set of flags to test. | |
9782 | Test the flags @code{forward} and @code{backward} to determine the | |
81e7aa8e | 9783 | direction of a conditional branch. |
03dda8e3 RK |
9784 | |
9785 | This example describes a conditional branch delay slot which | |
9786 | can be nullified for forward branches that are taken (annul-true) or | |
9787 | for backward branches which are not taken (annul-false). | |
9788 | ||
9789 | @smallexample | |
9790 | (define_delay (eq_attr "type" "cbranch") | |
9791 | [(eq_attr "in_branch_delay" "true") | |
9792 | (and (eq_attr "in_branch_delay" "true") | |
9793 | (attr_flag "forward")) | |
9794 | (and (eq_attr "in_branch_delay" "true") | |
9795 | (attr_flag "backward"))]) | |
9796 | @end smallexample | |
9797 | ||
9798 | The @code{forward} and @code{backward} flags are false if the current | |
9799 | @code{insn} being scheduled is not a conditional branch. | |
9800 | ||
03dda8e3 RK |
9801 | @code{attr_flag} is only used during delay slot scheduling and has no |
9802 | meaning to other passes of the compiler. | |
00bc45c1 RH |
9803 | |
9804 | @findex attr | |
9805 | @item (attr @var{name}) | |
9806 | The value of another attribute is returned. This is most useful | |
9807 | for numeric attributes, as @code{eq_attr} and @code{attr_flag} | |
9808 | produce more efficient code for non-numeric attributes. | |
03dda8e3 RK |
9809 | @end table |
9810 | ||
a5249a21 HPN |
9811 | @end ifset |
9812 | @ifset INTERNALS | |
03dda8e3 RK |
9813 | @node Tagging Insns |
9814 | @subsection Assigning Attribute Values to Insns | |
9815 | @cindex tagging insns | |
9816 | @cindex assigning attribute values to insns | |
9817 | ||
9818 | The value assigned to an attribute of an insn is primarily determined by | |
9819 | which pattern is matched by that insn (or which @code{define_peephole} | |
9820 | generated it). Every @code{define_insn} and @code{define_peephole} can | |
9821 | have an optional last argument to specify the values of attributes for | |
9822 | matching insns. The value of any attribute not specified in a particular | |
9823 | insn is set to the default value for that attribute, as specified in its | |
9824 | @code{define_attr}. Extensive use of default values for attributes | |
9825 | permits the specification of the values for only one or two attributes | |
9826 | in the definition of most insn patterns, as seen in the example in the | |
bd819a4a | 9827 | next section. |
03dda8e3 RK |
9828 | |
9829 | The optional last argument of @code{define_insn} and | |
9830 | @code{define_peephole} is a vector of expressions, each of which defines | |
9831 | the value for a single attribute. The most general way of assigning an | |
9832 | attribute's value is to use a @code{set} expression whose first operand is an | |
9833 | @code{attr} expression giving the name of the attribute being set. The | |
9834 | second operand of the @code{set} is an attribute expression | |
bd819a4a | 9835 | (@pxref{Expressions}) giving the value of the attribute. |
03dda8e3 RK |
9836 | |
9837 | When the attribute value depends on the @samp{alternative} attribute | |
9838 | (i.e., which is the applicable alternative in the constraint of the | |
9839 | insn), the @code{set_attr_alternative} expression can be used. It | |
9840 | allows the specification of a vector of attribute expressions, one for | |
9841 | each alternative. | |
9842 | ||
9843 | @findex set_attr | |
9844 | When the generality of arbitrary attribute expressions is not required, | |
9845 | the simpler @code{set_attr} expression can be used, which allows | |
9846 | specifying a string giving either a single attribute value or a list | |
9847 | of attribute values, one for each alternative. | |
9848 | ||
9849 | The form of each of the above specifications is shown below. In each case, | |
9850 | @var{name} is a string specifying the attribute to be set. | |
9851 | ||
9852 | @table @code | |
9853 | @item (set_attr @var{name} @var{value-string}) | |
9854 | @var{value-string} is either a string giving the desired attribute value, | |
9855 | or a string containing a comma-separated list giving the values for | |
9856 | succeeding alternatives. The number of elements must match the number | |
9857 | of alternatives in the constraint of the insn pattern. | |
9858 | ||
9859 | Note that it may be useful to specify @samp{*} for some alternative, in | |
9860 | which case the attribute will assume its default value for insns matching | |
9861 | that alternative. | |
9862 | ||
9863 | @findex set_attr_alternative | |
9864 | @item (set_attr_alternative @var{name} [@var{value1} @var{value2} @dots{}]) | |
9865 | Depending on the alternative of the insn, the value will be one of the | |
9866 | specified values. This is a shorthand for using a @code{cond} with | |
9867 | tests on the @samp{alternative} attribute. | |
9868 | ||
9869 | @findex attr | |
9870 | @item (set (attr @var{name}) @var{value}) | |
9871 | The first operand of this @code{set} must be the special RTL expression | |
9872 | @code{attr}, whose sole operand is a string giving the name of the | |
9873 | attribute being set. @var{value} is the value of the attribute. | |
9874 | @end table | |
9875 | ||
9876 | The following shows three different ways of representing the same | |
9877 | attribute value specification: | |
9878 | ||
9879 | @smallexample | |
9880 | (set_attr "type" "load,store,arith") | |
9881 | ||
9882 | (set_attr_alternative "type" | |
9883 | [(const_string "load") (const_string "store") | |
9884 | (const_string "arith")]) | |
9885 | ||
9886 | (set (attr "type") | |
9887 | (cond [(eq_attr "alternative" "1") (const_string "load") | |
9888 | (eq_attr "alternative" "2") (const_string "store")] | |
9889 | (const_string "arith"))) | |
9890 | @end smallexample | |
9891 | ||
9892 | @need 1000 | |
9893 | @findex define_asm_attributes | |
9894 | The @code{define_asm_attributes} expression provides a mechanism to | |
9895 | specify the attributes assigned to insns produced from an @code{asm} | |
9896 | statement. It has the form: | |
9897 | ||
9898 | @smallexample | |
9899 | (define_asm_attributes [@var{attr-sets}]) | |
9900 | @end smallexample | |
9901 | ||
9902 | @noindent | |
9903 | where @var{attr-sets} is specified the same as for both the | |
9904 | @code{define_insn} and the @code{define_peephole} expressions. | |
9905 | ||
9906 | These values will typically be the ``worst case'' attribute values. For | |
9907 | example, they might indicate that the condition code will be clobbered. | |
9908 | ||
9909 | A specification for a @code{length} attribute is handled specially. The | |
9910 | way to compute the length of an @code{asm} insn is to multiply the | |
9911 | length specified in the expression @code{define_asm_attributes} by the | |
9912 | number of machine instructions specified in the @code{asm} statement, | |
9913 | determined by counting the number of semicolons and newlines in the | |
9914 | string. Therefore, the value of the @code{length} attribute specified | |
9915 | in a @code{define_asm_attributes} should be the maximum possible length | |
9916 | of a single machine instruction. | |
9917 | ||
a5249a21 HPN |
9918 | @end ifset |
9919 | @ifset INTERNALS | |
03dda8e3 RK |
9920 | @node Attr Example |
9921 | @subsection Example of Attribute Specifications | |
9922 | @cindex attribute specifications example | |
9923 | @cindex attribute specifications | |
9924 | ||
9925 | The judicious use of defaulting is important in the efficient use of | |
9926 | insn attributes. Typically, insns are divided into @dfn{types} and an | |
9927 | attribute, customarily called @code{type}, is used to represent this | |
9928 | value. This attribute is normally used only to define the default value | |
9929 | for other attributes. An example will clarify this usage. | |
9930 | ||
9931 | Assume we have a RISC machine with a condition code and in which only | |
9932 | full-word operations are performed in registers. Let us assume that we | |
9933 | can divide all insns into loads, stores, (integer) arithmetic | |
9934 | operations, floating point operations, and branches. | |
9935 | ||
9936 | Here we will concern ourselves with determining the effect of an insn on | |
9937 | the condition code and will limit ourselves to the following possible | |
9938 | effects: The condition code can be set unpredictably (clobbered), not | |
9939 | be changed, be set to agree with the results of the operation, or only | |
9940 | changed if the item previously set into the condition code has been | |
9941 | modified. | |
9942 | ||
9943 | Here is part of a sample @file{md} file for such a machine: | |
9944 | ||
9945 | @smallexample | |
9946 | (define_attr "type" "load,store,arith,fp,branch" (const_string "arith")) | |
9947 | ||
9948 | (define_attr "cc" "clobber,unchanged,set,change0" | |
9949 | (cond [(eq_attr "type" "load") | |
9950 | (const_string "change0") | |
9951 | (eq_attr "type" "store,branch") | |
9952 | (const_string "unchanged") | |
9953 | (eq_attr "type" "arith") | |
9954 | (if_then_else (match_operand:SI 0 "" "") | |
9955 | (const_string "set") | |
9956 | (const_string "clobber"))] | |
9957 | (const_string "clobber"))) | |
9958 | ||
9959 | (define_insn "" | |
9960 | [(set (match_operand:SI 0 "general_operand" "=r,r,m") | |
9961 | (match_operand:SI 1 "general_operand" "r,m,r"))] | |
9962 | "" | |
9963 | "@@ | |
9964 | move %0,%1 | |
9965 | load %0,%1 | |
9966 | store %0,%1" | |
9967 | [(set_attr "type" "arith,load,store")]) | |
9968 | @end smallexample | |
9969 | ||
9970 | Note that we assume in the above example that arithmetic operations | |
9971 | performed on quantities smaller than a machine word clobber the condition | |
9972 | code since they will set the condition code to a value corresponding to the | |
9973 | full-word result. | |
9974 | ||
a5249a21 HPN |
9975 | @end ifset |
9976 | @ifset INTERNALS | |
03dda8e3 RK |
9977 | @node Insn Lengths |
9978 | @subsection Computing the Length of an Insn | |
9979 | @cindex insn lengths, computing | |
9980 | @cindex computing the length of an insn | |
9981 | ||
9982 | For many machines, multiple types of branch instructions are provided, each | |
9983 | for different length branch displacements. In most cases, the assembler | |
9984 | will choose the correct instruction to use. However, when the assembler | |
b49900cc | 9985 | cannot do so, GCC can when a special attribute, the @code{length} |
03dda8e3 RK |
9986 | attribute, is defined. This attribute must be defined to have numeric |
9987 | values by specifying a null string in its @code{define_attr}. | |
9988 | ||
b49900cc | 9989 | In the case of the @code{length} attribute, two additional forms of |
03dda8e3 RK |
9990 | arithmetic terms are allowed in test expressions: |
9991 | ||
9992 | @table @code | |
9993 | @cindex @code{match_dup} and attributes | |
9994 | @item (match_dup @var{n}) | |
9995 | This refers to the address of operand @var{n} of the current insn, which | |
9996 | must be a @code{label_ref}. | |
9997 | ||
9998 | @cindex @code{pc} and attributes | |
9999 | @item (pc) | |
0c94b59f EB |
10000 | For non-branch instructions and backward branch instructions, this refers |
10001 | to the address of the current insn. But for forward branch instructions, | |
10002 | this refers to the address of the next insn, because the length of the | |
03dda8e3 RK |
10003 | current insn is to be computed. |
10004 | @end table | |
10005 | ||
10006 | @cindex @code{addr_vec}, length of | |
10007 | @cindex @code{addr_diff_vec}, length of | |
10008 | For normal insns, the length will be determined by value of the | |
b49900cc | 10009 | @code{length} attribute. In the case of @code{addr_vec} and |
03dda8e3 RK |
10010 | @code{addr_diff_vec} insn patterns, the length is computed as |
10011 | the number of vectors multiplied by the size of each vector. | |
10012 | ||
10013 | Lengths are measured in addressable storage units (bytes). | |
10014 | ||
40da08e0 JL |
10015 | Note that it is possible to call functions via the @code{symbol_ref} |
10016 | mechanism to compute the length of an insn. However, if you use this | |
10017 | mechanism you must provide dummy clauses to express the maximum length | |
b5405bab | 10018 | without using the function call. You can see an example of this in the |
40da08e0 JL |
10019 | @code{pa} machine description for the @code{call_symref} pattern. |
10020 | ||
03dda8e3 RK |
10021 | The following macros can be used to refine the length computation: |
10022 | ||
10023 | @table @code | |
03dda8e3 RK |
10024 | @findex ADJUST_INSN_LENGTH |
10025 | @item ADJUST_INSN_LENGTH (@var{insn}, @var{length}) | |
10026 | If defined, modifies the length assigned to instruction @var{insn} as a | |
10027 | function of the context in which it is used. @var{length} is an lvalue | |
10028 | that contains the initially computed length of the insn and should be | |
a8aa4e0b | 10029 | updated with the correct length of the insn. |
03dda8e3 RK |
10030 | |
10031 | This macro will normally not be required. A case in which it is | |
161d7b59 | 10032 | required is the ROMP@. On this machine, the size of an @code{addr_vec} |
03dda8e3 RK |
10033 | insn must be increased by two to compensate for the fact that alignment |
10034 | may be required. | |
10035 | @end table | |
10036 | ||
10037 | @findex get_attr_length | |
10038 | The routine that returns @code{get_attr_length} (the value of the | |
10039 | @code{length} attribute) can be used by the output routine to | |
10040 | determine the form of the branch instruction to be written, as the | |
10041 | example below illustrates. | |
10042 | ||
10043 | As an example of the specification of variable-length branches, consider | |
10044 | the IBM 360. If we adopt the convention that a register will be set to | |
10045 | the starting address of a function, we can jump to labels within 4k of | |
10046 | the start using a four-byte instruction. Otherwise, we need a six-byte | |
10047 | sequence to load the address from memory and then branch to it. | |
10048 | ||
10049 | On such a machine, a pattern for a branch instruction might be specified | |
10050 | as follows: | |
10051 | ||
10052 | @smallexample | |
10053 | (define_insn "jump" | |
10054 | [(set (pc) | |
10055 | (label_ref (match_operand 0 "" "")))] | |
10056 | "" | |
03dda8e3 RK |
10057 | @{ |
10058 | return (get_attr_length (insn) == 4 | |
0f40f9f7 ZW |
10059 | ? "b %l0" : "l r15,=a(%l0); br r15"); |
10060 | @} | |
9c34dbbf ZW |
10061 | [(set (attr "length") |
10062 | (if_then_else (lt (match_dup 0) (const_int 4096)) | |
10063 | (const_int 4) | |
10064 | (const_int 6)))]) | |
03dda8e3 RK |
10065 | @end smallexample |
10066 | ||
a5249a21 HPN |
10067 | @end ifset |
10068 | @ifset INTERNALS | |
03dda8e3 RK |
10069 | @node Constant Attributes |
10070 | @subsection Constant Attributes | |
10071 | @cindex constant attributes | |
10072 | ||
10073 | A special form of @code{define_attr}, where the expression for the | |
10074 | default value is a @code{const} expression, indicates an attribute that | |
10075 | is constant for a given run of the compiler. Constant attributes may be | |
10076 | used to specify which variety of processor is used. For example, | |
10077 | ||
10078 | @smallexample | |
10079 | (define_attr "cpu" "m88100,m88110,m88000" | |
10080 | (const | |
10081 | (cond [(symbol_ref "TARGET_88100") (const_string "m88100") | |
10082 | (symbol_ref "TARGET_88110") (const_string "m88110")] | |
10083 | (const_string "m88000")))) | |
10084 | ||
10085 | (define_attr "memory" "fast,slow" | |
10086 | (const | |
10087 | (if_then_else (symbol_ref "TARGET_FAST_MEM") | |
10088 | (const_string "fast") | |
10089 | (const_string "slow")))) | |
10090 | @end smallexample | |
10091 | ||
10092 | The routine generated for constant attributes has no parameters as it | |
10093 | does not depend on any particular insn. RTL expressions used to define | |
10094 | the value of a constant attribute may use the @code{symbol_ref} form, | |
10095 | but may not use either the @code{match_operand} form or @code{eq_attr} | |
10096 | forms involving insn attributes. | |
10097 | ||
13b72c22 AK |
10098 | @end ifset |
10099 | @ifset INTERNALS | |
10100 | @node Mnemonic Attribute | |
10101 | @subsection Mnemonic Attribute | |
10102 | @cindex mnemonic attribute | |
10103 | ||
10104 | The @code{mnemonic} attribute is a string type attribute holding the | |
10105 | instruction mnemonic for an insn alternative. The attribute values | |
10106 | will automatically be generated by the machine description parser if | |
10107 | there is an attribute definition in the md file: | |
10108 | ||
10109 | @smallexample | |
10110 | (define_attr "mnemonic" "unknown" (const_string "unknown")) | |
10111 | @end smallexample | |
10112 | ||
10113 | The default value can be freely chosen as long as it does not collide | |
10114 | with any of the instruction mnemonics. This value will be used | |
10115 | whenever the machine description parser is not able to determine the | |
10116 | mnemonic string. This might be the case for output templates | |
10117 | containing more than a single instruction as in | |
10118 | @code{"mvcle\t%0,%1,0\;jo\t.-4"}. | |
10119 | ||
10120 | The @code{mnemonic} attribute set is not generated automatically if the | |
10121 | instruction string is generated via C code. | |
10122 | ||
10123 | An existing @code{mnemonic} attribute set in an insn definition will not | |
10124 | be overriden by the md file parser. That way it is possible to | |
10125 | manually set the instruction mnemonics for the cases where the md file | |
10126 | parser fails to determine it automatically. | |
10127 | ||
10128 | The @code{mnemonic} attribute is useful for dealing with instruction | |
10129 | specific properties in the pipeline description without defining | |
10130 | additional insn attributes. | |
10131 | ||
10132 | @smallexample | |
10133 | (define_attr "ooo_expanded" "" | |
10134 | (cond [(eq_attr "mnemonic" "dlr,dsgr,d,dsgf,stam,dsgfr,dlgr") | |
10135 | (const_int 1)] | |
10136 | (const_int 0))) | |
10137 | @end smallexample | |
10138 | ||
a5249a21 HPN |
10139 | @end ifset |
10140 | @ifset INTERNALS | |
03dda8e3 RK |
10141 | @node Delay Slots |
10142 | @subsection Delay Slot Scheduling | |
10143 | @cindex delay slots, defining | |
10144 | ||
10145 | The insn attribute mechanism can be used to specify the requirements for | |
10146 | delay slots, if any, on a target machine. An instruction is said to | |
10147 | require a @dfn{delay slot} if some instructions that are physically | |
10148 | after the instruction are executed as if they were located before it. | |
10149 | Classic examples are branch and call instructions, which often execute | |
10150 | the following instruction before the branch or call is performed. | |
10151 | ||
10152 | On some machines, conditional branch instructions can optionally | |
10153 | @dfn{annul} instructions in the delay slot. This means that the | |
10154 | instruction will not be executed for certain branch outcomes. Both | |
10155 | instructions that annul if the branch is true and instructions that | |
10156 | annul if the branch is false are supported. | |
10157 | ||
10158 | Delay slot scheduling differs from instruction scheduling in that | |
10159 | determining whether an instruction needs a delay slot is dependent only | |
10160 | on the type of instruction being generated, not on data flow between the | |
10161 | instructions. See the next section for a discussion of data-dependent | |
10162 | instruction scheduling. | |
10163 | ||
10164 | @findex define_delay | |
10165 | The requirement of an insn needing one or more delay slots is indicated | |
10166 | via the @code{define_delay} expression. It has the following form: | |
10167 | ||
10168 | @smallexample | |
10169 | (define_delay @var{test} | |
10170 | [@var{delay-1} @var{annul-true-1} @var{annul-false-1} | |
10171 | @var{delay-2} @var{annul-true-2} @var{annul-false-2} | |
10172 | @dots{}]) | |
10173 | @end smallexample | |
10174 | ||
10175 | @var{test} is an attribute test that indicates whether this | |
10176 | @code{define_delay} applies to a particular insn. If so, the number of | |
10177 | required delay slots is determined by the length of the vector specified | |
10178 | as the second argument. An insn placed in delay slot @var{n} must | |
10179 | satisfy attribute test @var{delay-n}. @var{annul-true-n} is an | |
10180 | attribute test that specifies which insns may be annulled if the branch | |
10181 | is true. Similarly, @var{annul-false-n} specifies which insns in the | |
10182 | delay slot may be annulled if the branch is false. If annulling is not | |
bd819a4a | 10183 | supported for that delay slot, @code{(nil)} should be coded. |
03dda8e3 RK |
10184 | |
10185 | For example, in the common case where branch and call insns require | |
10186 | a single delay slot, which may contain any insn other than a branch or | |
10187 | call, the following would be placed in the @file{md} file: | |
10188 | ||
10189 | @smallexample | |
10190 | (define_delay (eq_attr "type" "branch,call") | |
10191 | [(eq_attr "type" "!branch,call") (nil) (nil)]) | |
10192 | @end smallexample | |
10193 | ||
10194 | Multiple @code{define_delay} expressions may be specified. In this | |
10195 | case, each such expression specifies different delay slot requirements | |
10196 | and there must be no insn for which tests in two @code{define_delay} | |
10197 | expressions are both true. | |
10198 | ||
10199 | For example, if we have a machine that requires one delay slot for branches | |
10200 | but two for calls, no delay slot can contain a branch or call insn, | |
10201 | and any valid insn in the delay slot for the branch can be annulled if the | |
10202 | branch is true, we might represent this as follows: | |
10203 | ||
10204 | @smallexample | |
10205 | (define_delay (eq_attr "type" "branch") | |
10206 | [(eq_attr "type" "!branch,call") | |
10207 | (eq_attr "type" "!branch,call") | |
10208 | (nil)]) | |
10209 | ||
10210 | (define_delay (eq_attr "type" "call") | |
10211 | [(eq_attr "type" "!branch,call") (nil) (nil) | |
10212 | (eq_attr "type" "!branch,call") (nil) (nil)]) | |
10213 | @end smallexample | |
10214 | @c the above is *still* too long. --mew 4feb93 | |
10215 | ||
a5249a21 HPN |
10216 | @end ifset |
10217 | @ifset INTERNALS | |
fae15c93 VM |
10218 | @node Processor pipeline description |
10219 | @subsection Specifying processor pipeline description | |
10220 | @cindex processor pipeline description | |
10221 | @cindex processor functional units | |
10222 | @cindex instruction latency time | |
10223 | @cindex interlock delays | |
10224 | @cindex data dependence delays | |
10225 | @cindex reservation delays | |
10226 | @cindex pipeline hazard recognizer | |
10227 | @cindex automaton based pipeline description | |
10228 | @cindex regular expressions | |
10229 | @cindex deterministic finite state automaton | |
10230 | @cindex automaton based scheduler | |
10231 | @cindex RISC | |
10232 | @cindex VLIW | |
10233 | ||
ef261fee | 10234 | To achieve better performance, most modern processors |
fae15c93 VM |
10235 | (super-pipelined, superscalar @acronym{RISC}, and @acronym{VLIW} |
10236 | processors) have many @dfn{functional units} on which several | |
10237 | instructions can be executed simultaneously. An instruction starts | |
10238 | execution if its issue conditions are satisfied. If not, the | |
ef261fee | 10239 | instruction is stalled until its conditions are satisfied. Such |
fae15c93 | 10240 | @dfn{interlock (pipeline) delay} causes interruption of the fetching |
431ae0bf | 10241 | of successor instructions (or demands nop instructions, e.g.@: for some |
fae15c93 VM |
10242 | MIPS processors). |
10243 | ||
10244 | There are two major kinds of interlock delays in modern processors. | |
10245 | The first one is a data dependence delay determining @dfn{instruction | |
10246 | latency time}. The instruction execution is not started until all | |
10247 | source data have been evaluated by prior instructions (there are more | |
10248 | complex cases when the instruction execution starts even when the data | |
c0478a66 | 10249 | are not available but will be ready in given time after the |
fae15c93 VM |
10250 | instruction execution start). Taking the data dependence delays into |
10251 | account is simple. The data dependence (true, output, and | |
10252 | anti-dependence) delay between two instructions is given by a | |
10253 | constant. In most cases this approach is adequate. The second kind | |
10254 | of interlock delays is a reservation delay. The reservation delay | |
10255 | means that two instructions under execution will be in need of shared | |
431ae0bf | 10256 | processors resources, i.e.@: buses, internal registers, and/or |
fae15c93 VM |
10257 | functional units, which are reserved for some time. Taking this kind |
10258 | of delay into account is complex especially for modern @acronym{RISC} | |
10259 | processors. | |
10260 | ||
10261 | The task of exploiting more processor parallelism is solved by an | |
ef261fee | 10262 | instruction scheduler. For a better solution to this problem, the |
fae15c93 | 10263 | instruction scheduler has to have an adequate description of the |
fa0aee89 PB |
10264 | processor parallelism (or @dfn{pipeline description}). GCC |
10265 | machine descriptions describe processor parallelism and functional | |
10266 | unit reservations for groups of instructions with the aid of | |
10267 | @dfn{regular expressions}. | |
ef261fee R |
10268 | |
10269 | The GCC instruction scheduler uses a @dfn{pipeline hazard recognizer} to | |
fae15c93 | 10270 | figure out the possibility of the instruction issue by the processor |
ef261fee R |
10271 | on a given simulated processor cycle. The pipeline hazard recognizer is |
10272 | automatically generated from the processor pipeline description. The | |
fa0aee89 PB |
10273 | pipeline hazard recognizer generated from the machine description |
10274 | is based on a deterministic finite state automaton (@acronym{DFA}): | |
10275 | the instruction issue is possible if there is a transition from one | |
10276 | automaton state to another one. This algorithm is very fast, and | |
10277 | furthermore, its speed is not dependent on processor | |
10278 | complexity@footnote{However, the size of the automaton depends on | |
6ccde948 RW |
10279 | processor complexity. To limit this effect, machine descriptions |
10280 | can split orthogonal parts of the machine description among several | |
10281 | automata: but then, since each of these must be stepped independently, | |
10282 | this does cause a small decrease in the algorithm's performance.}. | |
fae15c93 | 10283 | |
fae15c93 | 10284 | @cindex automaton based pipeline description |
fa0aee89 PB |
10285 | The rest of this section describes the directives that constitute |
10286 | an automaton-based processor pipeline description. The order of | |
10287 | these constructions within the machine description file is not | |
10288 | important. | |
fae15c93 VM |
10289 | |
10290 | @findex define_automaton | |
10291 | @cindex pipeline hazard recognizer | |
10292 | The following optional construction describes names of automata | |
10293 | generated and used for the pipeline hazards recognition. Sometimes | |
10294 | the generated finite state automaton used by the pipeline hazard | |
ef261fee | 10295 | recognizer is large. If we use more than one automaton and bind functional |
daf2f129 | 10296 | units to the automata, the total size of the automata is usually |
fae15c93 VM |
10297 | less than the size of the single automaton. If there is no one such |
10298 | construction, only one finite state automaton is generated. | |
10299 | ||
10300 | @smallexample | |
10301 | (define_automaton @var{automata-names}) | |
10302 | @end smallexample | |
10303 | ||
10304 | @var{automata-names} is a string giving names of the automata. The | |
10305 | names are separated by commas. All the automata should have unique names. | |
c62347f0 | 10306 | The automaton name is used in the constructions @code{define_cpu_unit} and |
fae15c93 VM |
10307 | @code{define_query_cpu_unit}. |
10308 | ||
10309 | @findex define_cpu_unit | |
10310 | @cindex processor functional units | |
c62347f0 | 10311 | Each processor functional unit used in the description of instruction |
fae15c93 VM |
10312 | reservations should be described by the following construction. |
10313 | ||
10314 | @smallexample | |
10315 | (define_cpu_unit @var{unit-names} [@var{automaton-name}]) | |
10316 | @end smallexample | |
10317 | ||
10318 | @var{unit-names} is a string giving the names of the functional units | |
10319 | separated by commas. Don't use name @samp{nothing}, it is reserved | |
10320 | for other goals. | |
10321 | ||
ef261fee | 10322 | @var{automaton-name} is a string giving the name of the automaton with |
fae15c93 VM |
10323 | which the unit is bound. The automaton should be described in |
10324 | construction @code{define_automaton}. You should give | |
10325 | @dfn{automaton-name}, if there is a defined automaton. | |
10326 | ||
30028c85 VM |
10327 | The assignment of units to automata are constrained by the uses of the |
10328 | units in insn reservations. The most important constraint is: if a | |
10329 | unit reservation is present on a particular cycle of an alternative | |
10330 | for an insn reservation, then some unit from the same automaton must | |
10331 | be present on the same cycle for the other alternatives of the insn | |
10332 | reservation. The rest of the constraints are mentioned in the | |
10333 | description of the subsequent constructions. | |
10334 | ||
fae15c93 VM |
10335 | @findex define_query_cpu_unit |
10336 | @cindex querying function unit reservations | |
10337 | The following construction describes CPU functional units analogously | |
30028c85 VM |
10338 | to @code{define_cpu_unit}. The reservation of such units can be |
10339 | queried for an automaton state. The instruction scheduler never | |
10340 | queries reservation of functional units for given automaton state. So | |
10341 | as a rule, you don't need this construction. This construction could | |
431ae0bf | 10342 | be used for future code generation goals (e.g.@: to generate |
30028c85 | 10343 | @acronym{VLIW} insn templates). |
fae15c93 VM |
10344 | |
10345 | @smallexample | |
10346 | (define_query_cpu_unit @var{unit-names} [@var{automaton-name}]) | |
10347 | @end smallexample | |
10348 | ||
10349 | @var{unit-names} is a string giving names of the functional units | |
10350 | separated by commas. | |
10351 | ||
ef261fee | 10352 | @var{automaton-name} is a string giving the name of the automaton with |
fae15c93 VM |
10353 | which the unit is bound. |
10354 | ||
10355 | @findex define_insn_reservation | |
10356 | @cindex instruction latency time | |
10357 | @cindex regular expressions | |
10358 | @cindex data bypass | |
ef261fee | 10359 | The following construction is the major one to describe pipeline |
fae15c93 VM |
10360 | characteristics of an instruction. |
10361 | ||
10362 | @smallexample | |
10363 | (define_insn_reservation @var{insn-name} @var{default_latency} | |
10364 | @var{condition} @var{regexp}) | |
10365 | @end smallexample | |
10366 | ||
10367 | @var{default_latency} is a number giving latency time of the | |
10368 | instruction. There is an important difference between the old | |
10369 | description and the automaton based pipeline description. The latency | |
10370 | time is used for all dependencies when we use the old description. In | |
ef261fee R |
10371 | the automaton based pipeline description, the given latency time is only |
10372 | used for true dependencies. The cost of anti-dependencies is always | |
fae15c93 VM |
10373 | zero and the cost of output dependencies is the difference between |
10374 | latency times of the producing and consuming insns (if the difference | |
ef261fee R |
10375 | is negative, the cost is considered to be zero). You can always |
10376 | change the default costs for any description by using the target hook | |
fae15c93 VM |
10377 | @code{TARGET_SCHED_ADJUST_COST} (@pxref{Scheduling}). |
10378 | ||
cc6a602b | 10379 | @var{insn-name} is a string giving the internal name of the insn. The |
fae15c93 VM |
10380 | internal names are used in constructions @code{define_bypass} and in |
10381 | the automaton description file generated for debugging. The internal | |
ef261fee | 10382 | name has nothing in common with the names in @code{define_insn}. It is a |
fae15c93 VM |
10383 | good practice to use insn classes described in the processor manual. |
10384 | ||
10385 | @var{condition} defines what RTL insns are described by this | |
10386 | construction. You should remember that you will be in trouble if | |
10387 | @var{condition} for two or more different | |
10388 | @code{define_insn_reservation} constructions is TRUE for an insn. In | |
10389 | this case what reservation will be used for the insn is not defined. | |
10390 | Such cases are not checked during generation of the pipeline hazards | |
10391 | recognizer because in general recognizing that two conditions may have | |
10392 | the same value is quite difficult (especially if the conditions | |
10393 | contain @code{symbol_ref}). It is also not checked during the | |
10394 | pipeline hazard recognizer work because it would slow down the | |
10395 | recognizer considerably. | |
10396 | ||
ef261fee | 10397 | @var{regexp} is a string describing the reservation of the cpu's functional |
fae15c93 VM |
10398 | units by the instruction. The reservations are described by a regular |
10399 | expression according to the following syntax: | |
10400 | ||
10401 | @smallexample | |
10402 | regexp = regexp "," oneof | |
10403 | | oneof | |
10404 | ||
10405 | oneof = oneof "|" allof | |
10406 | | allof | |
10407 | ||
10408 | allof = allof "+" repeat | |
10409 | | repeat | |
daf2f129 | 10410 | |
fae15c93 VM |
10411 | repeat = element "*" number |
10412 | | element | |
10413 | ||
10414 | element = cpu_function_unit_name | |
10415 | | reservation_name | |
10416 | | result_name | |
10417 | | "nothing" | |
10418 | | "(" regexp ")" | |
10419 | @end smallexample | |
10420 | ||
10421 | @itemize @bullet | |
10422 | @item | |
10423 | @samp{,} is used for describing the start of the next cycle in | |
10424 | the reservation. | |
10425 | ||
10426 | @item | |
10427 | @samp{|} is used for describing a reservation described by the first | |
10428 | regular expression @strong{or} a reservation described by the second | |
10429 | regular expression @strong{or} etc. | |
10430 | ||
10431 | @item | |
10432 | @samp{+} is used for describing a reservation described by the first | |
10433 | regular expression @strong{and} a reservation described by the | |
10434 | second regular expression @strong{and} etc. | |
10435 | ||
10436 | @item | |
10437 | @samp{*} is used for convenience and simply means a sequence in which | |
10438 | the regular expression are repeated @var{number} times with cycle | |
10439 | advancing (see @samp{,}). | |
10440 | ||
10441 | @item | |
10442 | @samp{cpu_function_unit_name} denotes reservation of the named | |
10443 | functional unit. | |
10444 | ||
10445 | @item | |
10446 | @samp{reservation_name} --- see description of construction | |
10447 | @samp{define_reservation}. | |
10448 | ||
10449 | @item | |
10450 | @samp{nothing} denotes no unit reservations. | |
10451 | @end itemize | |
10452 | ||
10453 | @findex define_reservation | |
10454 | Sometimes unit reservations for different insns contain common parts. | |
10455 | In such case, you can simplify the pipeline description by describing | |
10456 | the common part by the following construction | |
10457 | ||
10458 | @smallexample | |
10459 | (define_reservation @var{reservation-name} @var{regexp}) | |
10460 | @end smallexample | |
10461 | ||
10462 | @var{reservation-name} is a string giving name of @var{regexp}. | |
10463 | Functional unit names and reservation names are in the same name | |
10464 | space. So the reservation names should be different from the | |
67914693 | 10465 | functional unit names and cannot be the reserved name @samp{nothing}. |
fae15c93 VM |
10466 | |
10467 | @findex define_bypass | |
10468 | @cindex instruction latency time | |
10469 | @cindex data bypass | |
10470 | The following construction is used to describe exceptions in the | |
10471 | latency time for given instruction pair. This is so called bypasses. | |
10472 | ||
10473 | @smallexample | |
10474 | (define_bypass @var{number} @var{out_insn_names} @var{in_insn_names} | |
10475 | [@var{guard}]) | |
10476 | @end smallexample | |
10477 | ||
10478 | @var{number} defines when the result generated by the instructions | |
10479 | given in string @var{out_insn_names} will be ready for the | |
f9bf5a8e RS |
10480 | instructions given in string @var{in_insn_names}. Each of these |
10481 | strings is a comma-separated list of filename-style globs and | |
10482 | they refer to the names of @code{define_insn_reservation}s. | |
10483 | For example: | |
10484 | @smallexample | |
10485 | (define_bypass 1 "cpu1_load_*, cpu1_store_*" "cpu1_load_*") | |
10486 | @end smallexample | |
10487 | defines a bypass between instructions that start with | |
10488 | @samp{cpu1_load_} or @samp{cpu1_store_} and those that start with | |
10489 | @samp{cpu1_load_}. | |
fae15c93 | 10490 | |
ef261fee | 10491 | @var{guard} is an optional string giving the name of a C function which |
fae15c93 VM |
10492 | defines an additional guard for the bypass. The function will get the |
10493 | two insns as parameters. If the function returns zero the bypass will | |
10494 | be ignored for this case. The additional guard is necessary to | |
431ae0bf | 10495 | recognize complicated bypasses, e.g.@: when the consumer is only an address |
fae15c93 VM |
10496 | of insn @samp{store} (not a stored value). |
10497 | ||
20a07f44 VM |
10498 | If there are more one bypass with the same output and input insns, the |
10499 | chosen bypass is the first bypass with a guard in description whose | |
10500 | guard function returns nonzero. If there is no such bypass, then | |
10501 | bypass without the guard function is chosen. | |
10502 | ||
fae15c93 VM |
10503 | @findex exclusion_set |
10504 | @findex presence_set | |
30028c85 | 10505 | @findex final_presence_set |
fae15c93 | 10506 | @findex absence_set |
30028c85 | 10507 | @findex final_absence_set |
fae15c93 VM |
10508 | @cindex VLIW |
10509 | @cindex RISC | |
cc6a602b BE |
10510 | The following five constructions are usually used to describe |
10511 | @acronym{VLIW} processors, or more precisely, to describe a placement | |
10512 | of small instructions into @acronym{VLIW} instruction slots. They | |
10513 | can be used for @acronym{RISC} processors, too. | |
fae15c93 VM |
10514 | |
10515 | @smallexample | |
10516 | (exclusion_set @var{unit-names} @var{unit-names}) | |
30028c85 VM |
10517 | (presence_set @var{unit-names} @var{patterns}) |
10518 | (final_presence_set @var{unit-names} @var{patterns}) | |
10519 | (absence_set @var{unit-names} @var{patterns}) | |
10520 | (final_absence_set @var{unit-names} @var{patterns}) | |
fae15c93 VM |
10521 | @end smallexample |
10522 | ||
10523 | @var{unit-names} is a string giving names of functional units | |
10524 | separated by commas. | |
10525 | ||
30028c85 | 10526 | @var{patterns} is a string giving patterns of functional units |
0bdcd332 | 10527 | separated by comma. Currently pattern is one unit or units |
30028c85 VM |
10528 | separated by white-spaces. |
10529 | ||
fae15c93 | 10530 | The first construction (@samp{exclusion_set}) means that each |
67914693 | 10531 | functional unit in the first string cannot be reserved simultaneously |
fae15c93 VM |
10532 | with a unit whose name is in the second string and vice versa. For |
10533 | example, the construction is useful for describing processors | |
431ae0bf | 10534 | (e.g.@: some SPARC processors) with a fully pipelined floating point |
fae15c93 VM |
10535 | functional unit which can execute simultaneously only single floating |
10536 | point insns or only double floating point insns. | |
10537 | ||
10538 | The second construction (@samp{presence_set}) means that each | |
67914693 | 10539 | functional unit in the first string cannot be reserved unless at |
30028c85 VM |
10540 | least one of pattern of units whose names are in the second string is |
10541 | reserved. This is an asymmetric relation. For example, it is useful | |
10542 | for description that @acronym{VLIW} @samp{slot1} is reserved after | |
10543 | @samp{slot0} reservation. We could describe it by the following | |
10544 | construction | |
10545 | ||
10546 | @smallexample | |
10547 | (presence_set "slot1" "slot0") | |
10548 | @end smallexample | |
10549 | ||
10550 | Or @samp{slot1} is reserved only after @samp{slot0} and unit @samp{b0} | |
10551 | reservation. In this case we could write | |
10552 | ||
10553 | @smallexample | |
10554 | (presence_set "slot1" "slot0 b0") | |
10555 | @end smallexample | |
10556 | ||
10557 | The third construction (@samp{final_presence_set}) is analogous to | |
10558 | @samp{presence_set}. The difference between them is when checking is | |
10559 | done. When an instruction is issued in given automaton state | |
10560 | reflecting all current and planned unit reservations, the automaton | |
10561 | state is changed. The first state is a source state, the second one | |
10562 | is a result state. Checking for @samp{presence_set} is done on the | |
10563 | source state reservation, checking for @samp{final_presence_set} is | |
10564 | done on the result reservation. This construction is useful to | |
10565 | describe a reservation which is actually two subsequent reservations. | |
10566 | For example, if we use | |
10567 | ||
10568 | @smallexample | |
10569 | (presence_set "slot1" "slot0") | |
10570 | @end smallexample | |
10571 | ||
10572 | the following insn will be never issued (because @samp{slot1} requires | |
10573 | @samp{slot0} which is absent in the source state). | |
10574 | ||
10575 | @smallexample | |
10576 | (define_reservation "insn_and_nop" "slot0 + slot1") | |
10577 | @end smallexample | |
10578 | ||
10579 | but it can be issued if we use analogous @samp{final_presence_set}. | |
10580 | ||
10581 | The forth construction (@samp{absence_set}) means that each functional | |
10582 | unit in the first string can be reserved only if each pattern of units | |
10583 | whose names are in the second string is not reserved. This is an | |
10584 | asymmetric relation (actually @samp{exclusion_set} is analogous to | |
ff2ce160 | 10585 | this one but it is symmetric). For example it might be useful in a |
a71b1c58 NC |
10586 | @acronym{VLIW} description to say that @samp{slot0} cannot be reserved |
10587 | after either @samp{slot1} or @samp{slot2} have been reserved. This | |
10588 | can be described as: | |
30028c85 VM |
10589 | |
10590 | @smallexample | |
a71b1c58 | 10591 | (absence_set "slot0" "slot1, slot2") |
30028c85 VM |
10592 | @end smallexample |
10593 | ||
67914693 | 10594 | Or @samp{slot2} cannot be reserved if @samp{slot0} and unit @samp{b0} |
30028c85 VM |
10595 | are reserved or @samp{slot1} and unit @samp{b1} are reserved. In |
10596 | this case we could write | |
10597 | ||
10598 | @smallexample | |
10599 | (absence_set "slot2" "slot0 b0, slot1 b1") | |
10600 | @end smallexample | |
fae15c93 | 10601 | |
ef261fee | 10602 | All functional units mentioned in a set should belong to the same |
fae15c93 VM |
10603 | automaton. |
10604 | ||
30028c85 VM |
10605 | The last construction (@samp{final_absence_set}) is analogous to |
10606 | @samp{absence_set} but checking is done on the result (state) | |
10607 | reservation. See comments for @samp{final_presence_set}. | |
10608 | ||
fae15c93 VM |
10609 | @findex automata_option |
10610 | @cindex deterministic finite state automaton | |
10611 | @cindex nondeterministic finite state automaton | |
10612 | @cindex finite state automaton minimization | |
10613 | You can control the generator of the pipeline hazard recognizer with | |
10614 | the following construction. | |
10615 | ||
10616 | @smallexample | |
10617 | (automata_option @var{options}) | |
10618 | @end smallexample | |
10619 | ||
10620 | @var{options} is a string giving options which affect the generated | |
10621 | code. Currently there are the following options: | |
10622 | ||
10623 | @itemize @bullet | |
10624 | @item | |
10625 | @dfn{no-minimization} makes no minimization of the automaton. This is | |
30028c85 VM |
10626 | only worth to do when we are debugging the description and need to |
10627 | look more accurately at reservations of states. | |
fae15c93 VM |
10628 | |
10629 | @item | |
df1133a6 BE |
10630 | @dfn{time} means printing time statistics about the generation of |
10631 | automata. | |
10632 | ||
10633 | @item | |
10634 | @dfn{stats} means printing statistics about the generated automata | |
10635 | such as the number of DFA states, NDFA states and arcs. | |
e3c8eb86 VM |
10636 | |
10637 | @item | |
10638 | @dfn{v} means a generation of the file describing the result automata. | |
10639 | The file has suffix @samp{.dfa} and can be used for the description | |
10640 | verification and debugging. | |
10641 | ||
10642 | @item | |
10643 | @dfn{w} means a generation of warning instead of error for | |
10644 | non-critical errors. | |
fae15c93 | 10645 | |
e12da141 BS |
10646 | @item |
10647 | @dfn{no-comb-vect} prevents the automaton generator from generating | |
10648 | two data structures and comparing them for space efficiency. Using | |
10649 | a comb vector to represent transitions may be better, but it can be | |
10650 | very expensive to construct. This option is useful if the build | |
10651 | process spends an unacceptably long time in genautomata. | |
10652 | ||
fae15c93 VM |
10653 | @item |
10654 | @dfn{ndfa} makes nondeterministic finite state automata. This affects | |
10655 | the treatment of operator @samp{|} in the regular expressions. The | |
10656 | usual treatment of the operator is to try the first alternative and, | |
10657 | if the reservation is not possible, the second alternative. The | |
10658 | nondeterministic treatment means trying all alternatives, some of them | |
96ddf8ef | 10659 | may be rejected by reservations in the subsequent insns. |
dfa849f3 | 10660 | |
1e6a9047 | 10661 | @item |
9c582551 | 10662 | @dfn{collapse-ndfa} modifies the behavior of the generator when |
1e6a9047 BS |
10663 | producing an automaton. An additional state transition to collapse a |
10664 | nondeterministic @acronym{NDFA} state to a deterministic @acronym{DFA} | |
10665 | state is generated. It can be triggered by passing @code{const0_rtx} to | |
10666 | state_transition. In such an automaton, cycle advance transitions are | |
10667 | available only for these collapsed states. This option is useful for | |
10668 | ports that want to use the @code{ndfa} option, but also want to use | |
10669 | @code{define_query_cpu_unit} to assign units to insns issued in a cycle. | |
10670 | ||
dfa849f3 VM |
10671 | @item |
10672 | @dfn{progress} means output of a progress bar showing how many states | |
10673 | were generated so far for automaton being processed. This is useful | |
10674 | during debugging a @acronym{DFA} description. If you see too many | |
10675 | generated states, you could interrupt the generator of the pipeline | |
10676 | hazard recognizer and try to figure out a reason for generation of the | |
10677 | huge automaton. | |
fae15c93 VM |
10678 | @end itemize |
10679 | ||
10680 | As an example, consider a superscalar @acronym{RISC} machine which can | |
10681 | issue three insns (two integer insns and one floating point insn) on | |
10682 | the cycle but can finish only two insns. To describe this, we define | |
10683 | the following functional units. | |
10684 | ||
10685 | @smallexample | |
10686 | (define_cpu_unit "i0_pipeline, i1_pipeline, f_pipeline") | |
ef261fee | 10687 | (define_cpu_unit "port0, port1") |
fae15c93 VM |
10688 | @end smallexample |
10689 | ||
10690 | All simple integer insns can be executed in any integer pipeline and | |
10691 | their result is ready in two cycles. The simple integer insns are | |
10692 | issued into the first pipeline unless it is reserved, otherwise they | |
10693 | are issued into the second pipeline. Integer division and | |
10694 | multiplication insns can be executed only in the second integer | |
793e17f9 | 10695 | pipeline and their results are ready correspondingly in 9 and 4 |
431ae0bf | 10696 | cycles. The integer division is not pipelined, i.e.@: the subsequent |
67914693 | 10697 | integer division insn cannot be issued until the current division |
fae15c93 | 10698 | insn finished. Floating point insns are fully pipelined and their |
ef261fee R |
10699 | results are ready in 3 cycles. Where the result of a floating point |
10700 | insn is used by an integer insn, an additional delay of one cycle is | |
10701 | incurred. To describe all of this we could specify | |
fae15c93 VM |
10702 | |
10703 | @smallexample | |
10704 | (define_cpu_unit "div") | |
10705 | ||
68e4d4c5 | 10706 | (define_insn_reservation "simple" 2 (eq_attr "type" "int") |
ef261fee | 10707 | "(i0_pipeline | i1_pipeline), (port0 | port1)") |
fae15c93 | 10708 | |
68e4d4c5 | 10709 | (define_insn_reservation "mult" 4 (eq_attr "type" "mult") |
ef261fee | 10710 | "i1_pipeline, nothing*2, (port0 | port1)") |
fae15c93 | 10711 | |
793e17f9 | 10712 | (define_insn_reservation "div" 9 (eq_attr "type" "div") |
ef261fee | 10713 | "i1_pipeline, div*7, div + (port0 | port1)") |
fae15c93 | 10714 | |
68e4d4c5 | 10715 | (define_insn_reservation "float" 3 (eq_attr "type" "float") |
ef261fee | 10716 | "f_pipeline, nothing, (port0 | port1)) |
fae15c93 | 10717 | |
ef261fee | 10718 | (define_bypass 4 "float" "simple,mult,div") |
fae15c93 VM |
10719 | @end smallexample |
10720 | ||
10721 | To simplify the description we could describe the following reservation | |
10722 | ||
10723 | @smallexample | |
10724 | (define_reservation "finish" "port0|port1") | |
10725 | @end smallexample | |
10726 | ||
10727 | and use it in all @code{define_insn_reservation} as in the following | |
10728 | construction | |
10729 | ||
10730 | @smallexample | |
68e4d4c5 | 10731 | (define_insn_reservation "simple" 2 (eq_attr "type" "int") |
fae15c93 VM |
10732 | "(i0_pipeline | i1_pipeline), finish") |
10733 | @end smallexample | |
10734 | ||
10735 | ||
a5249a21 HPN |
10736 | @end ifset |
10737 | @ifset INTERNALS | |
3262c1f5 RH |
10738 | @node Conditional Execution |
10739 | @section Conditional Execution | |
10740 | @cindex conditional execution | |
10741 | @cindex predication | |
10742 | ||
10743 | A number of architectures provide for some form of conditional | |
10744 | execution, or predication. The hallmark of this feature is the | |
10745 | ability to nullify most of the instructions in the instruction set. | |
10746 | When the instruction set is large and not entirely symmetric, it | |
10747 | can be quite tedious to describe these forms directly in the | |
10748 | @file{.md} file. An alternative is the @code{define_cond_exec} template. | |
10749 | ||
10750 | @findex define_cond_exec | |
10751 | @smallexample | |
10752 | (define_cond_exec | |
10753 | [@var{predicate-pattern}] | |
10754 | "@var{condition}" | |
aadaf24e KT |
10755 | "@var{output-template}" |
10756 | "@var{optional-insn-attribues}") | |
3262c1f5 RH |
10757 | @end smallexample |
10758 | ||
10759 | @var{predicate-pattern} is the condition that must be true for the | |
10760 | insn to be executed at runtime and should match a relational operator. | |
10761 | One can use @code{match_operator} to match several relational operators | |
10762 | at once. Any @code{match_operand} operands must have no more than one | |
10763 | alternative. | |
10764 | ||
10765 | @var{condition} is a C expression that must be true for the generated | |
10766 | pattern to match. | |
10767 | ||
10768 | @findex current_insn_predicate | |
630d3d5a | 10769 | @var{output-template} is a string similar to the @code{define_insn} |
3262c1f5 RH |
10770 | output template (@pxref{Output Template}), except that the @samp{*} |
10771 | and @samp{@@} special cases do not apply. This is only useful if the | |
10772 | assembly text for the predicate is a simple prefix to the main insn. | |
10773 | In order to handle the general case, there is a global variable | |
10774 | @code{current_insn_predicate} that will contain the entire predicate | |
10775 | if the current insn is predicated, and will otherwise be @code{NULL}. | |
10776 | ||
aadaf24e KT |
10777 | @var{optional-insn-attributes} is an optional vector of attributes that gets |
10778 | appended to the insn attributes of the produced cond_exec rtx. It can | |
10779 | be used to add some distinguishing attribute to cond_exec rtxs produced | |
10780 | that way. An example usage would be to use this attribute in conjunction | |
10781 | with attributes on the main pattern to disable particular alternatives under | |
10782 | certain conditions. | |
10783 | ||
ebb48a4d JM |
10784 | When @code{define_cond_exec} is used, an implicit reference to |
10785 | the @code{predicable} instruction attribute is made. | |
0bddee8e BS |
10786 | @xref{Insn Attributes}. This attribute must be a boolean (i.e.@: have |
10787 | exactly two elements in its @var{list-of-values}), with the possible | |
10788 | values being @code{no} and @code{yes}. The default and all uses in | |
10789 | the insns must be a simple constant, not a complex expressions. It | |
10790 | may, however, depend on the alternative, by using a comma-separated | |
10791 | list of values. If that is the case, the port should also define an | |
10792 | @code{enabled} attribute (@pxref{Disable Insn Alternatives}), which | |
10793 | should also allow only @code{no} and @code{yes} as its values. | |
3262c1f5 | 10794 | |
ebb48a4d | 10795 | For each @code{define_insn} for which the @code{predicable} |
3262c1f5 RH |
10796 | attribute is true, a new @code{define_insn} pattern will be |
10797 | generated that matches a predicated version of the instruction. | |
10798 | For example, | |
10799 | ||
10800 | @smallexample | |
10801 | (define_insn "addsi" | |
10802 | [(set (match_operand:SI 0 "register_operand" "r") | |
10803 | (plus:SI (match_operand:SI 1 "register_operand" "r") | |
10804 | (match_operand:SI 2 "register_operand" "r")))] | |
10805 | "@var{test1}" | |
10806 | "add %2,%1,%0") | |
10807 | ||
10808 | (define_cond_exec | |
10809 | [(ne (match_operand:CC 0 "register_operand" "c") | |
10810 | (const_int 0))] | |
10811 | "@var{test2}" | |
10812 | "(%0)") | |
10813 | @end smallexample | |
10814 | ||
10815 | @noindent | |
10816 | generates a new pattern | |
10817 | ||
10818 | @smallexample | |
10819 | (define_insn "" | |
10820 | [(cond_exec | |
10821 | (ne (match_operand:CC 3 "register_operand" "c") (const_int 0)) | |
10822 | (set (match_operand:SI 0 "register_operand" "r") | |
10823 | (plus:SI (match_operand:SI 1 "register_operand" "r") | |
10824 | (match_operand:SI 2 "register_operand" "r"))))] | |
10825 | "(@var{test2}) && (@var{test1})" | |
10826 | "(%3) add %2,%1,%0") | |
10827 | @end smallexample | |
c25c12b8 | 10828 | |
a5249a21 | 10829 | @end ifset |
477c104e MK |
10830 | @ifset INTERNALS |
10831 | @node Define Subst | |
10832 | @section RTL Templates Transformations | |
10833 | @cindex define_subst | |
10834 | ||
10835 | For some hardware architectures there are common cases when the RTL | |
10836 | templates for the instructions can be derived from the other RTL | |
10837 | templates using simple transformations. E.g., @file{i386.md} contains | |
10838 | an RTL template for the ordinary @code{sub} instruction--- | |
10839 | @code{*subsi_1}, and for the @code{sub} instruction with subsequent | |
10840 | zero-extension---@code{*subsi_1_zext}. Such cases can be easily | |
10841 | implemented by a single meta-template capable of generating a modified | |
10842 | case based on the initial one: | |
10843 | ||
10844 | @findex define_subst | |
10845 | @smallexample | |
10846 | (define_subst "@var{name}" | |
10847 | [@var{input-template}] | |
10848 | "@var{condition}" | |
10849 | [@var{output-template}]) | |
10850 | @end smallexample | |
10851 | @var{input-template} is a pattern describing the source RTL template, | |
10852 | which will be transformed. | |
10853 | ||
10854 | @var{condition} is a C expression that is conjunct with the condition | |
10855 | from the input-template to generate a condition to be used in the | |
10856 | output-template. | |
10857 | ||
10858 | @var{output-template} is a pattern that will be used in the resulting | |
10859 | template. | |
10860 | ||
10861 | @code{define_subst} mechanism is tightly coupled with the notion of the | |
bdb6985c | 10862 | subst attribute (@pxref{Subst Iterators}). The use of |
477c104e MK |
10863 | @code{define_subst} is triggered by a reference to a subst attribute in |
10864 | the transforming RTL template. This reference initiates duplication of | |
10865 | the source RTL template and substitution of the attributes with their | |
10866 | values. The source RTL template is left unchanged, while the copy is | |
10867 | transformed by @code{define_subst}. This transformation can fail in the | |
10868 | case when the source RTL template is not matched against the | |
10869 | input-template of the @code{define_subst}. In such case the copy is | |
10870 | deleted. | |
10871 | ||
10872 | @code{define_subst} can be used only in @code{define_insn} and | |
630ba2fd | 10873 | @code{define_expand}, it cannot be used in other expressions (e.g.@: in |
477c104e MK |
10874 | @code{define_insn_and_split}). |
10875 | ||
10876 | @menu | |
10877 | * Define Subst Example:: Example of @code{define_subst} work. | |
10878 | * Define Subst Pattern Matching:: Process of template comparison. | |
10879 | * Define Subst Output Template:: Generation of output template. | |
10880 | @end menu | |
10881 | ||
10882 | @node Define Subst Example | |
10883 | @subsection @code{define_subst} Example | |
10884 | @cindex define_subst | |
10885 | ||
10886 | To illustrate how @code{define_subst} works, let us examine a simple | |
10887 | template transformation. | |
10888 | ||
10889 | Suppose there are two kinds of instructions: one that touches flags and | |
10890 | the other that does not. The instructions of the second type could be | |
10891 | generated with the following @code{define_subst}: | |
10892 | ||
10893 | @smallexample | |
10894 | (define_subst "add_clobber_subst" | |
10895 | [(set (match_operand:SI 0 "" "") | |
10896 | (match_operand:SI 1 "" ""))] | |
10897 | "" | |
10898 | [(set (match_dup 0) | |
10899 | (match_dup 1)) | |
339ab27a | 10900 | (clobber (reg:CC FLAGS_REG))]) |
477c104e MK |
10901 | @end smallexample |
10902 | ||
10903 | This @code{define_subst} can be applied to any RTL pattern containing | |
10904 | @code{set} of mode SI and generates a copy with clobber when it is | |
10905 | applied. | |
10906 | ||
10907 | Assume there is an RTL template for a @code{max} instruction to be used | |
10908 | in @code{define_subst} mentioned above: | |
10909 | ||
10910 | @smallexample | |
10911 | (define_insn "maxsi" | |
10912 | [(set (match_operand:SI 0 "register_operand" "=r") | |
10913 | (max:SI | |
10914 | (match_operand:SI 1 "register_operand" "r") | |
10915 | (match_operand:SI 2 "register_operand" "r")))] | |
10916 | "" | |
10917 | "max\t@{%2, %1, %0|%0, %1, %2@}" | |
10918 | [@dots{}]) | |
10919 | @end smallexample | |
10920 | ||
10921 | To mark the RTL template for @code{define_subst} application, | |
10922 | subst-attributes are used. They should be declared in advance: | |
10923 | ||
10924 | @smallexample | |
10925 | (define_subst_attr "add_clobber_name" "add_clobber_subst" "_noclobber" "_clobber") | |
10926 | @end smallexample | |
10927 | ||
10928 | Here @samp{add_clobber_name} is the attribute name, | |
10929 | @samp{add_clobber_subst} is the name of the corresponding | |
10930 | @code{define_subst}, the third argument (@samp{_noclobber}) is the | |
10931 | attribute value that would be substituted into the unchanged version of | |
10932 | the source RTL template, and the last argument (@samp{_clobber}) is the | |
10933 | value that would be substituted into the second, transformed, | |
10934 | version of the RTL template. | |
10935 | ||
10936 | Once the subst-attribute has been defined, it should be used in RTL | |
10937 | templates which need to be processed by the @code{define_subst}. So, | |
10938 | the original RTL template should be changed: | |
10939 | ||
10940 | @smallexample | |
10941 | (define_insn "maxsi<add_clobber_name>" | |
10942 | [(set (match_operand:SI 0 "register_operand" "=r") | |
10943 | (max:SI | |
10944 | (match_operand:SI 1 "register_operand" "r") | |
10945 | (match_operand:SI 2 "register_operand" "r")))] | |
10946 | "" | |
10947 | "max\t@{%2, %1, %0|%0, %1, %2@}" | |
10948 | [@dots{}]) | |
10949 | @end smallexample | |
10950 | ||
10951 | The result of the @code{define_subst} usage would look like the following: | |
10952 | ||
10953 | @smallexample | |
10954 | (define_insn "maxsi_noclobber" | |
10955 | [(set (match_operand:SI 0 "register_operand" "=r") | |
10956 | (max:SI | |
10957 | (match_operand:SI 1 "register_operand" "r") | |
10958 | (match_operand:SI 2 "register_operand" "r")))] | |
10959 | "" | |
10960 | "max\t@{%2, %1, %0|%0, %1, %2@}" | |
10961 | [@dots{}]) | |
10962 | (define_insn "maxsi_clobber" | |
10963 | [(set (match_operand:SI 0 "register_operand" "=r") | |
10964 | (max:SI | |
10965 | (match_operand:SI 1 "register_operand" "r") | |
10966 | (match_operand:SI 2 "register_operand" "r"))) | |
10967 | (clobber (reg:CC FLAGS_REG))] | |
10968 | "" | |
10969 | "max\t@{%2, %1, %0|%0, %1, %2@}" | |
10970 | [@dots{}]) | |
10971 | @end smallexample | |
10972 | ||
10973 | @node Define Subst Pattern Matching | |
10974 | @subsection Pattern Matching in @code{define_subst} | |
10975 | @cindex define_subst | |
10976 | ||
10977 | All expressions, allowed in @code{define_insn} or @code{define_expand}, | |
10978 | are allowed in the input-template of @code{define_subst}, except | |
10979 | @code{match_par_dup}, @code{match_scratch}, @code{match_parallel}. The | |
10980 | meanings of expressions in the input-template were changed: | |
10981 | ||
10982 | @code{match_operand} matches any expression (possibly, a subtree in | |
10983 | RTL-template), if modes of the @code{match_operand} and this expression | |
10984 | are the same, or mode of the @code{match_operand} is @code{VOIDmode}, or | |
10985 | this expression is @code{match_dup}, @code{match_op_dup}. If the | |
10986 | expression is @code{match_operand} too, and predicate of | |
10987 | @code{match_operand} from the input pattern is not empty, then the | |
10988 | predicates are compared. That can be used for more accurate filtering | |
10989 | of accepted RTL-templates. | |
10990 | ||
10991 | @code{match_operator} matches common operators (like @code{plus}, | |
10992 | @code{minus}), @code{unspec}, @code{unspec_volatile} operators and | |
10993 | @code{match_operator}s from the original pattern if the modes match and | |
10994 | @code{match_operator} from the input pattern has the same number of | |
10995 | operands as the operator from the original pattern. | |
10996 | ||
10997 | @node Define Subst Output Template | |
10998 | @subsection Generation of output template in @code{define_subst} | |
10999 | @cindex define_subst | |
11000 | ||
11001 | If all necessary checks for @code{define_subst} application pass, a new | |
11002 | RTL-pattern, based on the output-template, is created to replace the old | |
11003 | template. Like in input-patterns, meanings of some RTL expressions are | |
11004 | changed when they are used in output-patterns of a @code{define_subst}. | |
11005 | Thus, @code{match_dup} is used for copying the whole expression from the | |
11006 | original pattern, which matched corresponding @code{match_operand} from | |
11007 | the input pattern. | |
11008 | ||
11009 | @code{match_dup N} is used in the output template to be replaced with | |
11010 | the expression from the original pattern, which matched | |
11011 | @code{match_operand N} from the input pattern. As a consequence, | |
11012 | @code{match_dup} cannot be used to point to @code{match_operand}s from | |
11013 | the output pattern, it should always refer to a @code{match_operand} | |
8245edf3 PK |
11014 | from the input pattern. If a @code{match_dup N} occurs more than once |
11015 | in the output template, its first occurrence is replaced with the | |
11016 | expression from the original pattern, and the subsequent expressions | |
11017 | are replaced with @code{match_dup N}, i.e., a reference to the first | |
11018 | expression. | |
477c104e MK |
11019 | |
11020 | In the output template one can refer to the expressions from the | |
11021 | original pattern and create new ones. For instance, some operands could | |
11022 | be added by means of standard @code{match_operand}. | |
11023 | ||
11024 | After replacing @code{match_dup} with some RTL-subtree from the original | |
11025 | pattern, it could happen that several @code{match_operand}s in the | |
11026 | output pattern have the same indexes. It is unknown, how many and what | |
11027 | indexes would be used in the expression which would replace | |
11028 | @code{match_dup}, so such conflicts in indexes are inevitable. To | |
11029 | overcome this issue, @code{match_operands} and @code{match_operators}, | |
11030 | which were introduced into the output pattern, are renumerated when all | |
11031 | @code{match_dup}s are replaced. | |
11032 | ||
11033 | Number of alternatives in @code{match_operand}s introduced into the | |
11034 | output template @code{M} could differ from the number of alternatives in | |
11035 | the original pattern @code{N}, so in the resultant pattern there would | |
11036 | be @code{N*M} alternatives. Thus, constraints from the original pattern | |
11037 | would be duplicated @code{N} times, constraints from the output pattern | |
11038 | would be duplicated @code{M} times, producing all possible combinations. | |
11039 | @end ifset | |
11040 | ||
a5249a21 | 11041 | @ifset INTERNALS |
c25c12b8 R |
11042 | @node Constant Definitions |
11043 | @section Constant Definitions | |
11044 | @cindex constant definitions | |
11045 | @findex define_constants | |
11046 | ||
11047 | Using literal constants inside instruction patterns reduces legibility and | |
11048 | can be a maintenance problem. | |
11049 | ||
11050 | To overcome this problem, you may use the @code{define_constants} | |
11051 | expression. It contains a vector of name-value pairs. From that | |
11052 | point on, wherever any of the names appears in the MD file, it is as | |
11053 | if the corresponding value had been written instead. You may use | |
11054 | @code{define_constants} multiple times; each appearance adds more | |
11055 | constants to the table. It is an error to redefine a constant with | |
11056 | a different value. | |
11057 | ||
11058 | To come back to the a29k load multiple example, instead of | |
11059 | ||
11060 | @smallexample | |
11061 | (define_insn "" | |
11062 | [(match_parallel 0 "load_multiple_operation" | |
11063 | [(set (match_operand:SI 1 "gpc_reg_operand" "=r") | |
11064 | (match_operand:SI 2 "memory_operand" "m")) | |
11065 | (use (reg:SI 179)) | |
11066 | (clobber (reg:SI 179))])] | |
11067 | "" | |
11068 | "loadm 0,0,%1,%2") | |
11069 | @end smallexample | |
11070 | ||
11071 | You could write: | |
11072 | ||
11073 | @smallexample | |
11074 | (define_constants [ | |
11075 | (R_BP 177) | |
11076 | (R_FC 178) | |
11077 | (R_CR 179) | |
11078 | (R_Q 180) | |
11079 | ]) | |
11080 | ||
11081 | (define_insn "" | |
11082 | [(match_parallel 0 "load_multiple_operation" | |
11083 | [(set (match_operand:SI 1 "gpc_reg_operand" "=r") | |
11084 | (match_operand:SI 2 "memory_operand" "m")) | |
11085 | (use (reg:SI R_CR)) | |
11086 | (clobber (reg:SI R_CR))])] | |
11087 | "" | |
11088 | "loadm 0,0,%1,%2") | |
11089 | @end smallexample | |
11090 | ||
11091 | The constants that are defined with a define_constant are also output | |
11092 | in the insn-codes.h header file as #defines. | |
24609606 RS |
11093 | |
11094 | @cindex enumerations | |
11095 | @findex define_c_enum | |
11096 | You can also use the machine description file to define enumerations. | |
11097 | Like the constants defined by @code{define_constant}, these enumerations | |
11098 | are visible to both the machine description file and the main C code. | |
11099 | ||
11100 | The syntax is as follows: | |
11101 | ||
11102 | @smallexample | |
11103 | (define_c_enum "@var{name}" [ | |
11104 | @var{value0} | |
11105 | @var{value1} | |
7c922606 YS |
11106 | (@var{value32} 32) |
11107 | @var{value33} | |
24609606 RS |
11108 | @dots{} |
11109 | @var{valuen} | |
11110 | ]) | |
11111 | @end smallexample | |
11112 | ||
11113 | This definition causes the equivalent of the following C code to appear | |
11114 | in @file{insn-constants.h}: | |
11115 | ||
11116 | @smallexample | |
11117 | enum @var{name} @{ | |
11118 | @var{value0} = 0, | |
11119 | @var{value1} = 1, | |
7c922606 YS |
11120 | @var{value32} = 32, |
11121 | @var{value33} = 33, | |
24609606 RS |
11122 | @dots{} |
11123 | @var{valuen} = @var{n} | |
11124 | @}; | |
11125 | #define NUM_@var{cname}_VALUES (@var{n} + 1) | |
11126 | @end smallexample | |
11127 | ||
11128 | where @var{cname} is the capitalized form of @var{name}. | |
11129 | It also makes each @var{valuei} available in the machine description | |
11130 | file, just as if it had been declared with: | |
11131 | ||
11132 | @smallexample | |
11133 | (define_constants [(@var{valuei} @var{i})]) | |
11134 | @end smallexample | |
11135 | ||
11136 | Each @var{valuei} is usually an upper-case identifier and usually | |
11137 | begins with @var{cname}. | |
11138 | ||
11139 | You can split the enumeration definition into as many statements as | |
11140 | you like. The above example is directly equivalent to: | |
11141 | ||
11142 | @smallexample | |
11143 | (define_c_enum "@var{name}" [@var{value0}]) | |
11144 | (define_c_enum "@var{name}" [@var{value1}]) | |
11145 | @dots{} | |
11146 | (define_c_enum "@var{name}" [@var{valuen}]) | |
11147 | @end smallexample | |
11148 | ||
11149 | Splitting the enumeration helps to improve the modularity of each | |
11150 | individual @code{.md} file. For example, if a port defines its | |
11151 | synchronization instructions in a separate @file{sync.md} file, | |
11152 | it is convenient to define all synchronization-specific enumeration | |
11153 | values in @file{sync.md} rather than in the main @file{.md} file. | |
11154 | ||
0fe60a1b RS |
11155 | Some enumeration names have special significance to GCC: |
11156 | ||
11157 | @table @code | |
11158 | @item unspecv | |
11159 | @findex unspec_volatile | |
11160 | If an enumeration called @code{unspecv} is defined, GCC will use it | |
11161 | when printing out @code{unspec_volatile} expressions. For example: | |
11162 | ||
11163 | @smallexample | |
11164 | (define_c_enum "unspecv" [ | |
11165 | UNSPECV_BLOCKAGE | |
11166 | ]) | |
11167 | @end smallexample | |
11168 | ||
11169 | causes GCC to print @samp{(unspec_volatile @dots{} 0)} as: | |
11170 | ||
11171 | @smallexample | |
11172 | (unspec_volatile ... UNSPECV_BLOCKAGE) | |
11173 | @end smallexample | |
11174 | ||
11175 | @item unspec | |
11176 | @findex unspec | |
11177 | If an enumeration called @code{unspec} is defined, GCC will use | |
11178 | it when printing out @code{unspec} expressions. GCC will also use | |
11179 | it when printing out @code{unspec_volatile} expressions unless an | |
11180 | @code{unspecv} enumeration is also defined. You can therefore | |
11181 | decide whether to keep separate enumerations for volatile and | |
11182 | non-volatile expressions or whether to use the same enumeration | |
11183 | for both. | |
11184 | @end table | |
11185 | ||
24609606 | 11186 | @findex define_enum |
8f4fe86c | 11187 | @anchor{define_enum} |
24609606 RS |
11188 | Another way of defining an enumeration is to use @code{define_enum}: |
11189 | ||
11190 | @smallexample | |
11191 | (define_enum "@var{name}" [ | |
11192 | @var{value0} | |
11193 | @var{value1} | |
11194 | @dots{} | |
11195 | @var{valuen} | |
11196 | ]) | |
11197 | @end smallexample | |
11198 | ||
11199 | This directive implies: | |
11200 | ||
11201 | @smallexample | |
11202 | (define_c_enum "@var{name}" [ | |
11203 | @var{cname}_@var{cvalue0} | |
11204 | @var{cname}_@var{cvalue1} | |
11205 | @dots{} | |
11206 | @var{cname}_@var{cvaluen} | |
11207 | ]) | |
11208 | @end smallexample | |
11209 | ||
8f4fe86c | 11210 | @findex define_enum_attr |
24609606 | 11211 | where @var{cvaluei} is the capitalized form of @var{valuei}. |
8f4fe86c RS |
11212 | However, unlike @code{define_c_enum}, the enumerations defined |
11213 | by @code{define_enum} can be used in attribute specifications | |
11214 | (@pxref{define_enum_attr}). | |
b11cc610 | 11215 | @end ifset |
032e8348 | 11216 | @ifset INTERNALS |
3abcb3a7 HPN |
11217 | @node Iterators |
11218 | @section Iterators | |
11219 | @cindex iterators in @file{.md} files | |
032e8348 RS |
11220 | |
11221 | Ports often need to define similar patterns for more than one machine | |
3abcb3a7 | 11222 | mode or for more than one rtx code. GCC provides some simple iterator |
032e8348 RS |
11223 | facilities to make this process easier. |
11224 | ||
11225 | @menu | |
3abcb3a7 HPN |
11226 | * Mode Iterators:: Generating variations of patterns for different modes. |
11227 | * Code Iterators:: Doing the same for codes. | |
57a4717b | 11228 | * Int Iterators:: Doing the same for integers. |
477c104e | 11229 | * Subst Iterators:: Generating variations of patterns for define_subst. |
0016d8d9 | 11230 | * Parameterized Names:: Specifying iterator values in C++ code. |
032e8348 RS |
11231 | @end menu |
11232 | ||
3abcb3a7 HPN |
11233 | @node Mode Iterators |
11234 | @subsection Mode Iterators | |
11235 | @cindex mode iterators in @file{.md} files | |
032e8348 RS |
11236 | |
11237 | Ports often need to define similar patterns for two or more different modes. | |
11238 | For example: | |
11239 | ||
11240 | @itemize @bullet | |
11241 | @item | |
11242 | If a processor has hardware support for both single and double | |
11243 | floating-point arithmetic, the @code{SFmode} patterns tend to be | |
11244 | very similar to the @code{DFmode} ones. | |
11245 | ||
11246 | @item | |
11247 | If a port uses @code{SImode} pointers in one configuration and | |
11248 | @code{DImode} pointers in another, it will usually have very similar | |
11249 | @code{SImode} and @code{DImode} patterns for manipulating pointers. | |
11250 | @end itemize | |
11251 | ||
3abcb3a7 | 11252 | Mode iterators allow several patterns to be instantiated from one |
032e8348 RS |
11253 | @file{.md} file template. They can be used with any type of |
11254 | rtx-based construct, such as a @code{define_insn}, | |
11255 | @code{define_split}, or @code{define_peephole2}. | |
11256 | ||
11257 | @menu | |
3abcb3a7 | 11258 | * Defining Mode Iterators:: Defining a new mode iterator. |
6ccde948 RW |
11259 | * Substitutions:: Combining mode iterators with substitutions |
11260 | * Examples:: Examples | |
032e8348 RS |
11261 | @end menu |
11262 | ||
3abcb3a7 HPN |
11263 | @node Defining Mode Iterators |
11264 | @subsubsection Defining Mode Iterators | |
11265 | @findex define_mode_iterator | |
032e8348 | 11266 | |
3abcb3a7 | 11267 | The syntax for defining a mode iterator is: |
032e8348 RS |
11268 | |
11269 | @smallexample | |
923158be | 11270 | (define_mode_iterator @var{name} [(@var{mode1} "@var{cond1}") @dots{} (@var{moden} "@var{condn}")]) |
032e8348 RS |
11271 | @end smallexample |
11272 | ||
11273 | This allows subsequent @file{.md} file constructs to use the mode suffix | |
11274 | @code{:@var{name}}. Every construct that does so will be expanded | |
11275 | @var{n} times, once with every use of @code{:@var{name}} replaced by | |
11276 | @code{:@var{mode1}}, once with every use replaced by @code{:@var{mode2}}, | |
11277 | and so on. In the expansion for a particular @var{modei}, every | |
11278 | C condition will also require that @var{condi} be true. | |
11279 | ||
11280 | For example: | |
11281 | ||
11282 | @smallexample | |
3abcb3a7 | 11283 | (define_mode_iterator P [(SI "Pmode == SImode") (DI "Pmode == DImode")]) |
032e8348 RS |
11284 | @end smallexample |
11285 | ||
11286 | defines a new mode suffix @code{:P}. Every construct that uses | |
11287 | @code{:P} will be expanded twice, once with every @code{:P} replaced | |
11288 | by @code{:SI} and once with every @code{:P} replaced by @code{:DI}. | |
11289 | The @code{:SI} version will only apply if @code{Pmode == SImode} and | |
11290 | the @code{:DI} version will only apply if @code{Pmode == DImode}. | |
11291 | ||
11292 | As with other @file{.md} conditions, an empty string is treated | |
11293 | as ``always true''. @code{(@var{mode} "")} can also be abbreviated | |
11294 | to @code{@var{mode}}. For example: | |
11295 | ||
11296 | @smallexample | |
3abcb3a7 | 11297 | (define_mode_iterator GPR [SI (DI "TARGET_64BIT")]) |
032e8348 RS |
11298 | @end smallexample |
11299 | ||
11300 | means that the @code{:DI} expansion only applies if @code{TARGET_64BIT} | |
11301 | but that the @code{:SI} expansion has no such constraint. | |
11302 | ||
3abcb3a7 HPN |
11303 | Iterators are applied in the order they are defined. This can be |
11304 | significant if two iterators are used in a construct that requires | |
f30990b2 | 11305 | substitutions. @xref{Substitutions}. |
032e8348 | 11306 | |
f30990b2 | 11307 | @node Substitutions |
3abcb3a7 | 11308 | @subsubsection Substitution in Mode Iterators |
032e8348 RS |
11309 | @findex define_mode_attr |
11310 | ||
3abcb3a7 | 11311 | If an @file{.md} file construct uses mode iterators, each version of the |
f30990b2 ILT |
11312 | construct will often need slightly different strings or modes. For |
11313 | example: | |
032e8348 RS |
11314 | |
11315 | @itemize @bullet | |
11316 | @item | |
11317 | When a @code{define_expand} defines several @code{add@var{m}3} patterns | |
11318 | (@pxref{Standard Names}), each expander will need to use the | |
11319 | appropriate mode name for @var{m}. | |
11320 | ||
11321 | @item | |
11322 | When a @code{define_insn} defines several instruction patterns, | |
11323 | each instruction will often use a different assembler mnemonic. | |
f30990b2 ILT |
11324 | |
11325 | @item | |
11326 | When a @code{define_insn} requires operands with different modes, | |
3abcb3a7 | 11327 | using an iterator for one of the operand modes usually requires a specific |
f30990b2 | 11328 | mode for the other operand(s). |
032e8348 RS |
11329 | @end itemize |
11330 | ||
11331 | GCC supports such variations through a system of ``mode attributes''. | |
11332 | There are two standard attributes: @code{mode}, which is the name of | |
11333 | the mode in lower case, and @code{MODE}, which is the same thing in | |
11334 | upper case. You can define other attributes using: | |
11335 | ||
11336 | @smallexample | |
923158be | 11337 | (define_mode_attr @var{name} [(@var{mode1} "@var{value1}") @dots{} (@var{moden} "@var{valuen}")]) |
032e8348 RS |
11338 | @end smallexample |
11339 | ||
11340 | where @var{name} is the name of the attribute and @var{valuei} | |
11341 | is the value associated with @var{modei}. | |
11342 | ||
3abcb3a7 | 11343 | When GCC replaces some @var{:iterator} with @var{:mode}, it will scan |
f30990b2 | 11344 | each string and mode in the pattern for sequences of the form |
3abcb3a7 | 11345 | @code{<@var{iterator}:@var{attr}>}, where @var{attr} is the name of a |
f30990b2 | 11346 | mode attribute. If the attribute is defined for @var{mode}, the whole |
923158be | 11347 | @code{<@dots{}>} sequence will be replaced by the appropriate attribute |
f30990b2 | 11348 | value. |
032e8348 RS |
11349 | |
11350 | For example, suppose an @file{.md} file has: | |
11351 | ||
11352 | @smallexample | |
3abcb3a7 | 11353 | (define_mode_iterator P [(SI "Pmode == SImode") (DI "Pmode == DImode")]) |
032e8348 RS |
11354 | (define_mode_attr load [(SI "lw") (DI "ld")]) |
11355 | @end smallexample | |
11356 | ||
11357 | If one of the patterns that uses @code{:P} contains the string | |
11358 | @code{"<P:load>\t%0,%1"}, the @code{SI} version of that pattern | |
11359 | will use @code{"lw\t%0,%1"} and the @code{DI} version will use | |
11360 | @code{"ld\t%0,%1"}. | |
11361 | ||
f30990b2 ILT |
11362 | Here is an example of using an attribute for a mode: |
11363 | ||
11364 | @smallexample | |
3abcb3a7 | 11365 | (define_mode_iterator LONG [SI DI]) |
f30990b2 | 11366 | (define_mode_attr SHORT [(SI "HI") (DI "SI")]) |
923158be RW |
11367 | (define_insn @dots{} |
11368 | (sign_extend:LONG (match_operand:<LONG:SHORT> @dots{})) @dots{}) | |
f30990b2 ILT |
11369 | @end smallexample |
11370 | ||
3abcb3a7 HPN |
11371 | The @code{@var{iterator}:} prefix may be omitted, in which case the |
11372 | substitution will be attempted for every iterator expansion. | |
032e8348 RS |
11373 | |
11374 | @node Examples | |
3abcb3a7 | 11375 | @subsubsection Mode Iterator Examples |
032e8348 RS |
11376 | |
11377 | Here is an example from the MIPS port. It defines the following | |
11378 | modes and attributes (among others): | |
11379 | ||
11380 | @smallexample | |
3abcb3a7 | 11381 | (define_mode_iterator GPR [SI (DI "TARGET_64BIT")]) |
032e8348 RS |
11382 | (define_mode_attr d [(SI "") (DI "d")]) |
11383 | @end smallexample | |
11384 | ||
11385 | and uses the following template to define both @code{subsi3} | |
11386 | and @code{subdi3}: | |
11387 | ||
11388 | @smallexample | |
11389 | (define_insn "sub<mode>3" | |
11390 | [(set (match_operand:GPR 0 "register_operand" "=d") | |
11391 | (minus:GPR (match_operand:GPR 1 "register_operand" "d") | |
11392 | (match_operand:GPR 2 "register_operand" "d")))] | |
11393 | "" | |
11394 | "<d>subu\t%0,%1,%2" | |
11395 | [(set_attr "type" "arith") | |
11396 | (set_attr "mode" "<MODE>")]) | |
11397 | @end smallexample | |
11398 | ||
11399 | This is exactly equivalent to: | |
11400 | ||
11401 | @smallexample | |
11402 | (define_insn "subsi3" | |
11403 | [(set (match_operand:SI 0 "register_operand" "=d") | |
11404 | (minus:SI (match_operand:SI 1 "register_operand" "d") | |
11405 | (match_operand:SI 2 "register_operand" "d")))] | |
11406 | "" | |
11407 | "subu\t%0,%1,%2" | |
11408 | [(set_attr "type" "arith") | |
11409 | (set_attr "mode" "SI")]) | |
11410 | ||
11411 | (define_insn "subdi3" | |
11412 | [(set (match_operand:DI 0 "register_operand" "=d") | |
11413 | (minus:DI (match_operand:DI 1 "register_operand" "d") | |
11414 | (match_operand:DI 2 "register_operand" "d")))] | |
11415 | "" | |
11416 | "dsubu\t%0,%1,%2" | |
11417 | [(set_attr "type" "arith") | |
11418 | (set_attr "mode" "DI")]) | |
11419 | @end smallexample | |
11420 | ||
3abcb3a7 HPN |
11421 | @node Code Iterators |
11422 | @subsection Code Iterators | |
11423 | @cindex code iterators in @file{.md} files | |
11424 | @findex define_code_iterator | |
032e8348 RS |
11425 | @findex define_code_attr |
11426 | ||
3abcb3a7 | 11427 | Code iterators operate in a similar way to mode iterators. @xref{Mode Iterators}. |
032e8348 RS |
11428 | |
11429 | The construct: | |
11430 | ||
11431 | @smallexample | |
923158be | 11432 | (define_code_iterator @var{name} [(@var{code1} "@var{cond1}") @dots{} (@var{coden} "@var{condn}")]) |
032e8348 RS |
11433 | @end smallexample |
11434 | ||
11435 | defines a pseudo rtx code @var{name} that can be instantiated as | |
11436 | @var{codei} if condition @var{condi} is true. Each @var{codei} | |
11437 | must have the same rtx format. @xref{RTL Classes}. | |
11438 | ||
3abcb3a7 | 11439 | As with mode iterators, each pattern that uses @var{name} will be |
032e8348 RS |
11440 | expanded @var{n} times, once with all uses of @var{name} replaced by |
11441 | @var{code1}, once with all uses replaced by @var{code2}, and so on. | |
3abcb3a7 | 11442 | @xref{Defining Mode Iterators}. |
032e8348 RS |
11443 | |
11444 | It is possible to define attributes for codes as well as for modes. | |
11445 | There are two standard code attributes: @code{code}, the name of the | |
11446 | code in lower case, and @code{CODE}, the name of the code in upper case. | |
11447 | Other attributes are defined using: | |
11448 | ||
11449 | @smallexample | |
923158be | 11450 | (define_code_attr @var{name} [(@var{code1} "@var{value1}") @dots{} (@var{coden} "@var{valuen}")]) |
032e8348 RS |
11451 | @end smallexample |
11452 | ||
75df257b RS |
11453 | Instruction patterns can use code attributes as rtx codes, which can be |
11454 | useful if two sets of codes act in tandem. For example, the following | |
11455 | @code{define_insn} defines two patterns, one calculating a signed absolute | |
11456 | difference and another calculating an unsigned absolute difference: | |
11457 | ||
11458 | @smallexample | |
11459 | (define_code_iterator any_max [smax umax]) | |
11460 | (define_code_attr paired_min [(smax "smin") (umax "umin")]) | |
11461 | (define_insn @dots{} | |
11462 | [(set (match_operand:SI 0 @dots{}) | |
11463 | (minus:SI (any_max:SI (match_operand:SI 1 @dots{}) | |
11464 | (match_operand:SI 2 @dots{})) | |
11465 | (<paired_min>:SI (match_dup 1) (match_dup 2))))] | |
11466 | @dots{}) | |
11467 | @end smallexample | |
11468 | ||
11469 | The signed version of the instruction uses @code{smax} and @code{smin} | |
11470 | while the unsigned version uses @code{umax} and @code{umin}. There | |
11471 | are no versions that pair @code{smax} with @code{umin} or @code{umax} | |
11472 | with @code{smin}. | |
11473 | ||
3abcb3a7 | 11474 | Here's an example of code iterators in action, taken from the MIPS port: |
032e8348 RS |
11475 | |
11476 | @smallexample | |
3abcb3a7 HPN |
11477 | (define_code_iterator any_cond [unordered ordered unlt unge uneq ltgt unle ungt |
11478 | eq ne gt ge lt le gtu geu ltu leu]) | |
032e8348 RS |
11479 | |
11480 | (define_expand "b<code>" | |
11481 | [(set (pc) | |
11482 | (if_then_else (any_cond:CC (cc0) | |
11483 | (const_int 0)) | |
11484 | (label_ref (match_operand 0 "")) | |
11485 | (pc)))] | |
11486 | "" | |
11487 | @{ | |
11488 | gen_conditional_branch (operands, <CODE>); | |
11489 | DONE; | |
11490 | @}) | |
11491 | @end smallexample | |
11492 | ||
11493 | This is equivalent to: | |
11494 | ||
11495 | @smallexample | |
11496 | (define_expand "bunordered" | |
11497 | [(set (pc) | |
11498 | (if_then_else (unordered:CC (cc0) | |
11499 | (const_int 0)) | |
11500 | (label_ref (match_operand 0 "")) | |
11501 | (pc)))] | |
11502 | "" | |
11503 | @{ | |
11504 | gen_conditional_branch (operands, UNORDERED); | |
11505 | DONE; | |
11506 | @}) | |
11507 | ||
11508 | (define_expand "bordered" | |
11509 | [(set (pc) | |
11510 | (if_then_else (ordered:CC (cc0) | |
11511 | (const_int 0)) | |
11512 | (label_ref (match_operand 0 "")) | |
11513 | (pc)))] | |
11514 | "" | |
11515 | @{ | |
11516 | gen_conditional_branch (operands, ORDERED); | |
11517 | DONE; | |
11518 | @}) | |
11519 | ||
923158be | 11520 | @dots{} |
032e8348 RS |
11521 | @end smallexample |
11522 | ||
57a4717b TB |
11523 | @node Int Iterators |
11524 | @subsection Int Iterators | |
11525 | @cindex int iterators in @file{.md} files | |
11526 | @findex define_int_iterator | |
11527 | @findex define_int_attr | |
11528 | ||
11529 | Int iterators operate in a similar way to code iterators. @xref{Code Iterators}. | |
11530 | ||
11531 | The construct: | |
11532 | ||
11533 | @smallexample | |
11534 | (define_int_iterator @var{name} [(@var{int1} "@var{cond1}") @dots{} (@var{intn} "@var{condn}")]) | |
11535 | @end smallexample | |
11536 | ||
11537 | defines a pseudo integer constant @var{name} that can be instantiated as | |
da749b98 MR |
11538 | @var{inti} if condition @var{condi} is true. Each @var{int} must have the |
11539 | same rtx format. @xref{RTL Classes}. Int iterators can appear in only | |
11540 | those rtx fields that have 'i', 'n', 'w', or 'p' as the specifier. This | |
11541 | means that each @var{int} has to be a constant defined using define_constant | |
11542 | or define_c_enum. | |
57a4717b TB |
11543 | |
11544 | As with mode and code iterators, each pattern that uses @var{name} will be | |
11545 | expanded @var{n} times, once with all uses of @var{name} replaced by | |
11546 | @var{int1}, once with all uses replaced by @var{int2}, and so on. | |
11547 | @xref{Defining Mode Iterators}. | |
11548 | ||
11549 | It is possible to define attributes for ints as well as for codes and modes. | |
11550 | Attributes are defined using: | |
11551 | ||
11552 | @smallexample | |
11553 | (define_int_attr @var{name} [(@var{int1} "@var{value1}") @dots{} (@var{intn} "@var{valuen}")]) | |
11554 | @end smallexample | |
11555 | ||
11556 | Here's an example of int iterators in action, taken from the ARM port: | |
11557 | ||
11558 | @smallexample | |
11559 | (define_int_iterator QABSNEG [UNSPEC_VQABS UNSPEC_VQNEG]) | |
11560 | ||
11561 | (define_int_attr absneg [(UNSPEC_VQABS "abs") (UNSPEC_VQNEG "neg")]) | |
11562 | ||
11563 | (define_insn "neon_vq<absneg><mode>" | |
11564 | [(set (match_operand:VDQIW 0 "s_register_operand" "=w") | |
11565 | (unspec:VDQIW [(match_operand:VDQIW 1 "s_register_operand" "w") | |
11566 | (match_operand:SI 2 "immediate_operand" "i")] | |
11567 | QABSNEG))] | |
11568 | "TARGET_NEON" | |
11569 | "vq<absneg>.<V_s_elem>\t%<V_reg>0, %<V_reg>1" | |
003bb7f3 | 11570 | [(set_attr "type" "neon_vqneg_vqabs")] |
57a4717b TB |
11571 | ) |
11572 | ||
11573 | @end smallexample | |
11574 | ||
11575 | This is equivalent to: | |
11576 | ||
11577 | @smallexample | |
11578 | (define_insn "neon_vqabs<mode>" | |
11579 | [(set (match_operand:VDQIW 0 "s_register_operand" "=w") | |
11580 | (unspec:VDQIW [(match_operand:VDQIW 1 "s_register_operand" "w") | |
11581 | (match_operand:SI 2 "immediate_operand" "i")] | |
11582 | UNSPEC_VQABS))] | |
11583 | "TARGET_NEON" | |
11584 | "vqabs.<V_s_elem>\t%<V_reg>0, %<V_reg>1" | |
003bb7f3 | 11585 | [(set_attr "type" "neon_vqneg_vqabs")] |
57a4717b TB |
11586 | ) |
11587 | ||
11588 | (define_insn "neon_vqneg<mode>" | |
11589 | [(set (match_operand:VDQIW 0 "s_register_operand" "=w") | |
11590 | (unspec:VDQIW [(match_operand:VDQIW 1 "s_register_operand" "w") | |
11591 | (match_operand:SI 2 "immediate_operand" "i")] | |
11592 | UNSPEC_VQNEG))] | |
11593 | "TARGET_NEON" | |
11594 | "vqneg.<V_s_elem>\t%<V_reg>0, %<V_reg>1" | |
003bb7f3 | 11595 | [(set_attr "type" "neon_vqneg_vqabs")] |
57a4717b TB |
11596 | ) |
11597 | ||
11598 | @end smallexample | |
11599 | ||
477c104e MK |
11600 | @node Subst Iterators |
11601 | @subsection Subst Iterators | |
11602 | @cindex subst iterators in @file{.md} files | |
11603 | @findex define_subst | |
11604 | @findex define_subst_attr | |
11605 | ||
11606 | Subst iterators are special type of iterators with the following | |
11607 | restrictions: they could not be declared explicitly, they always have | |
11608 | only two values, and they do not have explicit dedicated name. | |
11609 | Subst-iterators are triggered only when corresponding subst-attribute is | |
11610 | used in RTL-pattern. | |
11611 | ||
11612 | Subst iterators transform templates in the following way: the templates | |
11613 | are duplicated, the subst-attributes in these templates are replaced | |
11614 | with the corresponding values, and a new attribute is implicitly added | |
11615 | to the given @code{define_insn}/@code{define_expand}. The name of the | |
11616 | added attribute matches the name of @code{define_subst}. Such | |
11617 | attributes are declared implicitly, and it is not allowed to have a | |
11618 | @code{define_attr} named as a @code{define_subst}. | |
11619 | ||
11620 | Each subst iterator is linked to a @code{define_subst}. It is declared | |
11621 | implicitly by the first appearance of the corresponding | |
11622 | @code{define_subst_attr}, and it is not allowed to define it explicitly. | |
11623 | ||
11624 | Declarations of subst-attributes have the following syntax: | |
11625 | ||
11626 | @findex define_subst_attr | |
11627 | @smallexample | |
11628 | (define_subst_attr "@var{name}" | |
11629 | "@var{subst-name}" | |
11630 | "@var{no-subst-value}" | |
11631 | "@var{subst-applied-value}") | |
11632 | @end smallexample | |
11633 | ||
11634 | @var{name} is a string with which the given subst-attribute could be | |
11635 | referred to. | |
11636 | ||
11637 | @var{subst-name} shows which @code{define_subst} should be applied to an | |
11638 | RTL-template if the given subst-attribute is present in the | |
11639 | RTL-template. | |
11640 | ||
11641 | @var{no-subst-value} is a value with which subst-attribute would be | |
11642 | replaced in the first copy of the original RTL-template. | |
11643 | ||
11644 | @var{subst-applied-value} is a value with which subst-attribute would be | |
11645 | replaced in the second copy of the original RTL-template. | |
11646 | ||
0016d8d9 RS |
11647 | @node Parameterized Names |
11648 | @subsection Parameterized Names | |
11649 | @cindex @samp{@@} in instruction pattern names | |
11650 | Ports sometimes need to apply iterators using C++ code, in order to | |
11651 | get the code or RTL pattern for a specific instruction. For example, | |
11652 | suppose we have the @samp{neon_vq<absneg><mode>} pattern given above: | |
11653 | ||
11654 | @smallexample | |
11655 | (define_int_iterator QABSNEG [UNSPEC_VQABS UNSPEC_VQNEG]) | |
11656 | ||
11657 | (define_int_attr absneg [(UNSPEC_VQABS "abs") (UNSPEC_VQNEG "neg")]) | |
11658 | ||
11659 | (define_insn "neon_vq<absneg><mode>" | |
11660 | [(set (match_operand:VDQIW 0 "s_register_operand" "=w") | |
11661 | (unspec:VDQIW [(match_operand:VDQIW 1 "s_register_operand" "w") | |
11662 | (match_operand:SI 2 "immediate_operand" "i")] | |
11663 | QABSNEG))] | |
11664 | @dots{} | |
11665 | ) | |
11666 | @end smallexample | |
11667 | ||
11668 | A port might need to generate this pattern for a variable | |
11669 | @samp{QABSNEG} value and a variable @samp{VDQIW} mode. There are two | |
11670 | ways of doing this. The first is to build the rtx for the pattern | |
11671 | directly from C++ code; this is a valid technique and avoids any risk | |
11672 | of combinatorial explosion. The second is to prefix the instruction | |
11673 | name with the special character @samp{@@}, which tells GCC to generate | |
11674 | the four additional functions below. In each case, @var{name} is the | |
11675 | name of the instruction without the leading @samp{@@} character, | |
11676 | without the @samp{<@dots{}>} placeholders, and with any underscore | |
11677 | before a @samp{<@dots{}>} placeholder removed if keeping it would | |
11678 | lead to a double or trailing underscore. | |
11679 | ||
11680 | @table @samp | |
11681 | @item insn_code maybe_code_for_@var{name} (@var{i1}, @var{i2}, @dots{}) | |
11682 | See whether replacing the first @samp{<@dots{}>} placeholder with | |
11683 | iterator value @var{i1}, the second with iterator value @var{i2}, and | |
11684 | so on, gives a valid instruction. Return its code if so, otherwise | |
11685 | return @code{CODE_FOR_nothing}. | |
11686 | ||
11687 | @item insn_code code_for_@var{name} (@var{i1}, @var{i2}, @dots{}) | |
11688 | Same, but abort the compiler if the requested instruction does not exist. | |
11689 | ||
11690 | @item rtx maybe_gen_@var{name} (@var{i1}, @var{i2}, @dots{}, @var{op0}, @var{op1}, @dots{}) | |
11691 | Check for a valid instruction in the same way as | |
11692 | @code{maybe_code_for_@var{name}}. If the instruction exists, | |
11693 | generate an instance of it using the operand values given by @var{op0}, | |
11694 | @var{op1}, and so on, otherwise return null. | |
11695 | ||
11696 | @item rtx gen_@var{name} (@var{i1}, @var{i2}, @dots{}, @var{op0}, @var{op1}, @dots{}) | |
11697 | Same, but abort the compiler if the requested instruction does not exist, | |
11698 | or if the instruction generator invoked the @code{FAIL} macro. | |
11699 | @end table | |
11700 | ||
11701 | For example, changing the pattern above to: | |
11702 | ||
11703 | @smallexample | |
11704 | (define_insn "@@neon_vq<absneg><mode>" | |
11705 | [(set (match_operand:VDQIW 0 "s_register_operand" "=w") | |
11706 | (unspec:VDQIW [(match_operand:VDQIW 1 "s_register_operand" "w") | |
11707 | (match_operand:SI 2 "immediate_operand" "i")] | |
11708 | QABSNEG))] | |
11709 | @dots{} | |
11710 | ) | |
11711 | @end smallexample | |
11712 | ||
11713 | would define the same patterns as before, but in addition would generate | |
11714 | the four functions below: | |
11715 | ||
11716 | @smallexample | |
11717 | insn_code maybe_code_for_neon_vq (int, machine_mode); | |
11718 | insn_code code_for_neon_vq (int, machine_mode); | |
11719 | rtx maybe_gen_neon_vq (int, machine_mode, rtx, rtx, rtx); | |
11720 | rtx gen_neon_vq (int, machine_mode, rtx, rtx, rtx); | |
11721 | @end smallexample | |
11722 | ||
11723 | Calling @samp{code_for_neon_vq (UNSPEC_VQABS, V8QImode)} | |
11724 | would then give @code{CODE_FOR_neon_vqabsv8qi}. | |
11725 | ||
11726 | It is possible to have multiple @samp{@@} patterns with the same | |
11727 | name and same types of iterator. For example: | |
11728 | ||
11729 | @smallexample | |
11730 | (define_insn "@@some_arithmetic_op<mode>" | |
11731 | [(set (match_operand:INTEGER_MODES 0 "register_operand") @dots{})] | |
11732 | @dots{} | |
11733 | ) | |
11734 | ||
11735 | (define_insn "@@some_arithmetic_op<mode>" | |
11736 | [(set (match_operand:FLOAT_MODES 0 "register_operand") @dots{})] | |
11737 | @dots{} | |
11738 | ) | |
11739 | @end smallexample | |
11740 | ||
11741 | would produce a single set of functions that handles both | |
11742 | @code{INTEGER_MODES} and @code{FLOAT_MODES}. | |
11743 | ||
d281492d RS |
11744 | It is also possible for these @samp{@@} patterns to have different |
11745 | numbers of operands from each other. For example, patterns with | |
11746 | a binary rtl code might take three operands (one output and two inputs) | |
11747 | while patterns with a ternary rtl code might take four operands (one | |
11748 | output and three inputs). This combination would produce separate | |
11749 | @samp{maybe_gen_@var{name}} and @samp{gen_@var{name}} functions for | |
11750 | each operand count, but it would still produce a single | |
11751 | @samp{maybe_code_for_@var{name}} and a single @samp{code_for_@var{name}}. | |
11752 | ||
032e8348 | 11753 | @end ifset |