1 /* Expand builtin functions.
2 Copyright (C) 1988-2015 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /* Legacy warning! Please add no further builtin simplifications here
21 (apart from pure constant folding) - builtin simplifications should go
22 to match.pd or gimple-fold.c instead. */
26 #include "coretypes.h"
34 #include "stringpool.h"
35 #include "tree-ssanames.h"
40 #include "diagnostic-core.h"
42 #include "fold-const.h"
43 #include "fold-const-call.h"
44 #include "stor-layout.h"
47 #include "tree-object-size.h"
57 #include "typeclass.h"
58 #include "langhooks.h"
59 #include "value-prof.h"
63 #include "tree-chkp.h"
65 #include "internal-fn.h"
66 #include "case-cfn-macros.h"
69 struct target_builtins default_target_builtins
;
71 struct target_builtins
*this_target_builtins
= &default_target_builtins
;
74 /* Define the names of the builtin function types and codes. */
75 const char *const built_in_class_names
[BUILT_IN_LAST
]
76 = {"NOT_BUILT_IN", "BUILT_IN_FRONTEND", "BUILT_IN_MD", "BUILT_IN_NORMAL"};
78 #define DEF_BUILTIN(X, N, C, T, LT, B, F, NA, AT, IM, COND) #X,
79 const char * built_in_names
[(int) END_BUILTINS
] =
81 #include "builtins.def"
84 /* Setup an array of builtin_info_type, make sure each element decl is
85 initialized to NULL_TREE. */
86 builtin_info_type builtin_info
[(int)END_BUILTINS
];
88 /* Non-zero if __builtin_constant_p should be folded right away. */
89 bool force_folding_builtin_constant_p
;
91 static rtx
c_readstr (const char *, machine_mode
);
92 static int target_char_cast (tree
, char *);
93 static rtx
get_memory_rtx (tree
, tree
);
94 static int apply_args_size (void);
95 static int apply_result_size (void);
96 static rtx
result_vector (int, rtx
);
97 static void expand_builtin_prefetch (tree
);
98 static rtx
expand_builtin_apply_args (void);
99 static rtx
expand_builtin_apply_args_1 (void);
100 static rtx
expand_builtin_apply (rtx
, rtx
, rtx
);
101 static void expand_builtin_return (rtx
);
102 static enum type_class
type_to_class (tree
);
103 static rtx
expand_builtin_classify_type (tree
);
104 static rtx
expand_builtin_mathfn_3 (tree
, rtx
, rtx
);
105 static rtx
expand_builtin_mathfn_ternary (tree
, rtx
, rtx
);
106 static rtx
expand_builtin_interclass_mathfn (tree
, rtx
);
107 static rtx
expand_builtin_sincos (tree
);
108 static rtx
expand_builtin_cexpi (tree
, rtx
);
109 static rtx
expand_builtin_int_roundingfn (tree
, rtx
);
110 static rtx
expand_builtin_int_roundingfn_2 (tree
, rtx
);
111 static rtx
expand_builtin_next_arg (void);
112 static rtx
expand_builtin_va_start (tree
);
113 static rtx
expand_builtin_va_end (tree
);
114 static rtx
expand_builtin_va_copy (tree
);
115 static rtx
expand_builtin_strcmp (tree
, rtx
);
116 static rtx
expand_builtin_strncmp (tree
, rtx
, machine_mode
);
117 static rtx
builtin_memcpy_read_str (void *, HOST_WIDE_INT
, machine_mode
);
118 static rtx
expand_builtin_memcpy (tree
, rtx
);
119 static rtx
expand_builtin_memcpy_with_bounds (tree
, rtx
);
120 static rtx
expand_builtin_memcpy_args (tree
, tree
, tree
, rtx
, tree
);
121 static rtx
expand_builtin_mempcpy (tree
, rtx
, machine_mode
);
122 static rtx
expand_builtin_mempcpy_with_bounds (tree
, rtx
, machine_mode
);
123 static rtx
expand_builtin_mempcpy_args (tree
, tree
, tree
, rtx
,
124 machine_mode
, int, tree
);
125 static rtx
expand_builtin_strcpy (tree
, rtx
);
126 static rtx
expand_builtin_strcpy_args (tree
, tree
, rtx
);
127 static rtx
expand_builtin_stpcpy (tree
, rtx
, machine_mode
);
128 static rtx
expand_builtin_strncpy (tree
, rtx
);
129 static rtx
builtin_memset_gen_str (void *, HOST_WIDE_INT
, machine_mode
);
130 static rtx
expand_builtin_memset (tree
, rtx
, machine_mode
);
131 static rtx
expand_builtin_memset_with_bounds (tree
, rtx
, machine_mode
);
132 static rtx
expand_builtin_memset_args (tree
, tree
, tree
, rtx
, machine_mode
, tree
);
133 static rtx
expand_builtin_bzero (tree
);
134 static rtx
expand_builtin_strlen (tree
, rtx
, machine_mode
);
135 static rtx
expand_builtin_alloca (tree
, bool);
136 static rtx
expand_builtin_unop (machine_mode
, tree
, rtx
, rtx
, optab
);
137 static rtx
expand_builtin_frame_address (tree
, tree
);
138 static tree
stabilize_va_list_loc (location_t
, tree
, int);
139 static rtx
expand_builtin_expect (tree
, rtx
);
140 static tree
fold_builtin_constant_p (tree
);
141 static tree
fold_builtin_classify_type (tree
);
142 static tree
fold_builtin_strlen (location_t
, tree
, tree
);
143 static tree
fold_builtin_inf (location_t
, tree
, int);
144 static tree
rewrite_call_expr (location_t
, tree
, int, tree
, int, ...);
145 static bool validate_arg (const_tree
, enum tree_code code
);
146 static rtx
expand_builtin_fabs (tree
, rtx
, rtx
);
147 static rtx
expand_builtin_signbit (tree
, rtx
);
148 static tree
fold_builtin_strchr (location_t
, tree
, tree
, tree
);
149 static tree
fold_builtin_memchr (location_t
, tree
, tree
, tree
, tree
);
150 static tree
fold_builtin_memcmp (location_t
, tree
, tree
, tree
);
151 static tree
fold_builtin_strcmp (location_t
, tree
, tree
);
152 static tree
fold_builtin_strncmp (location_t
, tree
, tree
, tree
);
153 static tree
fold_builtin_isascii (location_t
, tree
);
154 static tree
fold_builtin_toascii (location_t
, tree
);
155 static tree
fold_builtin_isdigit (location_t
, tree
);
156 static tree
fold_builtin_fabs (location_t
, tree
, tree
);
157 static tree
fold_builtin_abs (location_t
, tree
, tree
);
158 static tree
fold_builtin_unordered_cmp (location_t
, tree
, tree
, tree
, enum tree_code
,
160 static tree
fold_builtin_0 (location_t
, tree
);
161 static tree
fold_builtin_1 (location_t
, tree
, tree
);
162 static tree
fold_builtin_2 (location_t
, tree
, tree
, tree
);
163 static tree
fold_builtin_3 (location_t
, tree
, tree
, tree
, tree
);
164 static tree
fold_builtin_varargs (location_t
, tree
, tree
*, int);
166 static tree
fold_builtin_strpbrk (location_t
, tree
, tree
, tree
);
167 static tree
fold_builtin_strstr (location_t
, tree
, tree
, tree
);
168 static tree
fold_builtin_strrchr (location_t
, tree
, tree
, tree
);
169 static tree
fold_builtin_strspn (location_t
, tree
, tree
);
170 static tree
fold_builtin_strcspn (location_t
, tree
, tree
);
172 static rtx
expand_builtin_object_size (tree
);
173 static rtx
expand_builtin_memory_chk (tree
, rtx
, machine_mode
,
174 enum built_in_function
);
175 static void maybe_emit_chk_warning (tree
, enum built_in_function
);
176 static void maybe_emit_sprintf_chk_warning (tree
, enum built_in_function
);
177 static void maybe_emit_free_warning (tree
);
178 static tree
fold_builtin_object_size (tree
, tree
);
180 unsigned HOST_WIDE_INT target_newline
;
181 unsigned HOST_WIDE_INT target_percent
;
182 static unsigned HOST_WIDE_INT target_c
;
183 static unsigned HOST_WIDE_INT target_s
;
184 char target_percent_c
[3];
185 char target_percent_s
[3];
186 char target_percent_s_newline
[4];
187 static tree
do_mpfr_remquo (tree
, tree
, tree
);
188 static tree
do_mpfr_lgamma_r (tree
, tree
, tree
);
189 static void expand_builtin_sync_synchronize (void);
191 /* Return true if NAME starts with __builtin_ or __sync_. */
194 is_builtin_name (const char *name
)
196 if (strncmp (name
, "__builtin_", 10) == 0)
198 if (strncmp (name
, "__sync_", 7) == 0)
200 if (strncmp (name
, "__atomic_", 9) == 0)
203 && (!strcmp (name
, "__cilkrts_detach")
204 || !strcmp (name
, "__cilkrts_pop_frame")))
210 /* Return true if DECL is a function symbol representing a built-in. */
213 is_builtin_fn (tree decl
)
215 return TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_BUILT_IN (decl
);
218 /* Return true if NODE should be considered for inline expansion regardless
219 of the optimization level. This means whenever a function is invoked with
220 its "internal" name, which normally contains the prefix "__builtin". */
223 called_as_built_in (tree node
)
225 /* Note that we must use DECL_NAME, not DECL_ASSEMBLER_NAME_SET_P since
226 we want the name used to call the function, not the name it
228 const char *name
= IDENTIFIER_POINTER (DECL_NAME (node
));
229 return is_builtin_name (name
);
232 /* Compute values M and N such that M divides (address of EXP - N) and such
233 that N < M. If these numbers can be determined, store M in alignp and N in
234 *BITPOSP and return true. Otherwise return false and store BITS_PER_UNIT to
235 *alignp and any bit-offset to *bitposp.
237 Note that the address (and thus the alignment) computed here is based
238 on the address to which a symbol resolves, whereas DECL_ALIGN is based
239 on the address at which an object is actually located. These two
240 addresses are not always the same. For example, on ARM targets,
241 the address &foo of a Thumb function foo() has the lowest bit set,
242 whereas foo() itself starts on an even address.
244 If ADDR_P is true we are taking the address of the memory reference EXP
245 and thus cannot rely on the access taking place. */
248 get_object_alignment_2 (tree exp
, unsigned int *alignp
,
249 unsigned HOST_WIDE_INT
*bitposp
, bool addr_p
)
251 HOST_WIDE_INT bitsize
, bitpos
;
254 int unsignedp
, reversep
, volatilep
;
255 unsigned int align
= BITS_PER_UNIT
;
256 bool known_alignment
= false;
258 /* Get the innermost object and the constant (bitpos) and possibly
259 variable (offset) offset of the access. */
260 exp
= get_inner_reference (exp
, &bitsize
, &bitpos
, &offset
, &mode
,
261 &unsignedp
, &reversep
, &volatilep
, true);
263 /* Extract alignment information from the innermost object and
264 possibly adjust bitpos and offset. */
265 if (TREE_CODE (exp
) == FUNCTION_DECL
)
267 /* Function addresses can encode extra information besides their
268 alignment. However, if TARGET_PTRMEMFUNC_VBIT_LOCATION
269 allows the low bit to be used as a virtual bit, we know
270 that the address itself must be at least 2-byte aligned. */
271 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_pfn
)
272 align
= 2 * BITS_PER_UNIT
;
274 else if (TREE_CODE (exp
) == LABEL_DECL
)
276 else if (TREE_CODE (exp
) == CONST_DECL
)
278 /* The alignment of a CONST_DECL is determined by its initializer. */
279 exp
= DECL_INITIAL (exp
);
280 align
= TYPE_ALIGN (TREE_TYPE (exp
));
281 if (CONSTANT_CLASS_P (exp
))
282 align
= (unsigned) CONSTANT_ALIGNMENT (exp
, align
);
284 known_alignment
= true;
286 else if (DECL_P (exp
))
288 align
= DECL_ALIGN (exp
);
289 known_alignment
= true;
291 else if (TREE_CODE (exp
) == VIEW_CONVERT_EXPR
)
293 align
= TYPE_ALIGN (TREE_TYPE (exp
));
295 else if (TREE_CODE (exp
) == INDIRECT_REF
296 || TREE_CODE (exp
) == MEM_REF
297 || TREE_CODE (exp
) == TARGET_MEM_REF
)
299 tree addr
= TREE_OPERAND (exp
, 0);
301 unsigned HOST_WIDE_INT ptr_bitpos
;
302 unsigned HOST_WIDE_INT ptr_bitmask
= ~0;
304 /* If the address is explicitely aligned, handle that. */
305 if (TREE_CODE (addr
) == BIT_AND_EXPR
306 && TREE_CODE (TREE_OPERAND (addr
, 1)) == INTEGER_CST
)
308 ptr_bitmask
= TREE_INT_CST_LOW (TREE_OPERAND (addr
, 1));
309 ptr_bitmask
*= BITS_PER_UNIT
;
310 align
= ptr_bitmask
& -ptr_bitmask
;
311 addr
= TREE_OPERAND (addr
, 0);
315 = get_pointer_alignment_1 (addr
, &ptr_align
, &ptr_bitpos
);
316 align
= MAX (ptr_align
, align
);
318 /* Re-apply explicit alignment to the bitpos. */
319 ptr_bitpos
&= ptr_bitmask
;
321 /* The alignment of the pointer operand in a TARGET_MEM_REF
322 has to take the variable offset parts into account. */
323 if (TREE_CODE (exp
) == TARGET_MEM_REF
)
327 unsigned HOST_WIDE_INT step
= 1;
329 step
= TREE_INT_CST_LOW (TMR_STEP (exp
));
330 align
= MIN (align
, (step
& -step
) * BITS_PER_UNIT
);
332 if (TMR_INDEX2 (exp
))
333 align
= BITS_PER_UNIT
;
334 known_alignment
= false;
337 /* When EXP is an actual memory reference then we can use
338 TYPE_ALIGN of a pointer indirection to derive alignment.
339 Do so only if get_pointer_alignment_1 did not reveal absolute
340 alignment knowledge and if using that alignment would
341 improve the situation. */
342 if (!addr_p
&& !known_alignment
343 && TYPE_ALIGN (TREE_TYPE (exp
)) > align
)
344 align
= TYPE_ALIGN (TREE_TYPE (exp
));
347 /* Else adjust bitpos accordingly. */
348 bitpos
+= ptr_bitpos
;
349 if (TREE_CODE (exp
) == MEM_REF
350 || TREE_CODE (exp
) == TARGET_MEM_REF
)
351 bitpos
+= mem_ref_offset (exp
).to_short_addr () * BITS_PER_UNIT
;
354 else if (TREE_CODE (exp
) == STRING_CST
)
356 /* STRING_CST are the only constant objects we allow to be not
357 wrapped inside a CONST_DECL. */
358 align
= TYPE_ALIGN (TREE_TYPE (exp
));
359 if (CONSTANT_CLASS_P (exp
))
360 align
= (unsigned) CONSTANT_ALIGNMENT (exp
, align
);
362 known_alignment
= true;
365 /* If there is a non-constant offset part extract the maximum
366 alignment that can prevail. */
369 unsigned int trailing_zeros
= tree_ctz (offset
);
370 if (trailing_zeros
< HOST_BITS_PER_INT
)
372 unsigned int inner
= (1U << trailing_zeros
) * BITS_PER_UNIT
;
374 align
= MIN (align
, inner
);
379 *bitposp
= bitpos
& (*alignp
- 1);
380 return known_alignment
;
383 /* For a memory reference expression EXP compute values M and N such that M
384 divides (&EXP - N) and such that N < M. If these numbers can be determined,
385 store M in alignp and N in *BITPOSP and return true. Otherwise return false
386 and store BITS_PER_UNIT to *alignp and any bit-offset to *bitposp. */
389 get_object_alignment_1 (tree exp
, unsigned int *alignp
,
390 unsigned HOST_WIDE_INT
*bitposp
)
392 return get_object_alignment_2 (exp
, alignp
, bitposp
, false);
395 /* Return the alignment in bits of EXP, an object. */
398 get_object_alignment (tree exp
)
400 unsigned HOST_WIDE_INT bitpos
= 0;
403 get_object_alignment_1 (exp
, &align
, &bitpos
);
405 /* align and bitpos now specify known low bits of the pointer.
406 ptr & (align - 1) == bitpos. */
409 align
= (bitpos
& -bitpos
);
413 /* For a pointer valued expression EXP compute values M and N such that M
414 divides (EXP - N) and such that N < M. If these numbers can be determined,
415 store M in alignp and N in *BITPOSP and return true. Return false if
416 the results are just a conservative approximation.
418 If EXP is not a pointer, false is returned too. */
421 get_pointer_alignment_1 (tree exp
, unsigned int *alignp
,
422 unsigned HOST_WIDE_INT
*bitposp
)
426 if (TREE_CODE (exp
) == ADDR_EXPR
)
427 return get_object_alignment_2 (TREE_OPERAND (exp
, 0),
428 alignp
, bitposp
, true);
429 else if (TREE_CODE (exp
) == POINTER_PLUS_EXPR
)
432 unsigned HOST_WIDE_INT bitpos
;
433 bool res
= get_pointer_alignment_1 (TREE_OPERAND (exp
, 0),
435 if (TREE_CODE (TREE_OPERAND (exp
, 1)) == INTEGER_CST
)
436 bitpos
+= TREE_INT_CST_LOW (TREE_OPERAND (exp
, 1)) * BITS_PER_UNIT
;
439 unsigned int trailing_zeros
= tree_ctz (TREE_OPERAND (exp
, 1));
440 if (trailing_zeros
< HOST_BITS_PER_INT
)
442 unsigned int inner
= (1U << trailing_zeros
) * BITS_PER_UNIT
;
444 align
= MIN (align
, inner
);
448 *bitposp
= bitpos
& (align
- 1);
451 else if (TREE_CODE (exp
) == SSA_NAME
452 && POINTER_TYPE_P (TREE_TYPE (exp
)))
454 unsigned int ptr_align
, ptr_misalign
;
455 struct ptr_info_def
*pi
= SSA_NAME_PTR_INFO (exp
);
457 if (pi
&& get_ptr_info_alignment (pi
, &ptr_align
, &ptr_misalign
))
459 *bitposp
= ptr_misalign
* BITS_PER_UNIT
;
460 *alignp
= ptr_align
* BITS_PER_UNIT
;
461 /* Make sure to return a sensible alignment when the multiplication
462 by BITS_PER_UNIT overflowed. */
464 *alignp
= 1u << (HOST_BITS_PER_INT
- 1);
465 /* We cannot really tell whether this result is an approximation. */
471 *alignp
= BITS_PER_UNIT
;
475 else if (TREE_CODE (exp
) == INTEGER_CST
)
477 *alignp
= BIGGEST_ALIGNMENT
;
478 *bitposp
= ((TREE_INT_CST_LOW (exp
) * BITS_PER_UNIT
)
479 & (BIGGEST_ALIGNMENT
- 1));
484 *alignp
= BITS_PER_UNIT
;
488 /* Return the alignment in bits of EXP, a pointer valued expression.
489 The alignment returned is, by default, the alignment of the thing that
490 EXP points to. If it is not a POINTER_TYPE, 0 is returned.
492 Otherwise, look at the expression to see if we can do better, i.e., if the
493 expression is actually pointing at an object whose alignment is tighter. */
496 get_pointer_alignment (tree exp
)
498 unsigned HOST_WIDE_INT bitpos
= 0;
501 get_pointer_alignment_1 (exp
, &align
, &bitpos
);
503 /* align and bitpos now specify known low bits of the pointer.
504 ptr & (align - 1) == bitpos. */
507 align
= (bitpos
& -bitpos
);
512 /* Compute the length of a C string. TREE_STRING_LENGTH is not the right
513 way, because it could contain a zero byte in the middle.
514 TREE_STRING_LENGTH is the size of the character array, not the string.
516 ONLY_VALUE should be nonzero if the result is not going to be emitted
517 into the instruction stream and zero if it is going to be expanded.
518 E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3
519 is returned, otherwise NULL, since
520 len = c_strlen (src, 1); if (len) expand_expr (len, ...); would not
521 evaluate the side-effects.
523 If ONLY_VALUE is two then we do not emit warnings about out-of-bound
524 accesses. Note that this implies the result is not going to be emitted
525 into the instruction stream.
527 The value returned is of type `ssizetype'.
529 Unfortunately, string_constant can't access the values of const char
530 arrays with initializers, so neither can we do so here. */
533 c_strlen (tree src
, int only_value
)
536 HOST_WIDE_INT offset
;
542 if (TREE_CODE (src
) == COND_EXPR
543 && (only_value
|| !TREE_SIDE_EFFECTS (TREE_OPERAND (src
, 0))))
547 len1
= c_strlen (TREE_OPERAND (src
, 1), only_value
);
548 len2
= c_strlen (TREE_OPERAND (src
, 2), only_value
);
549 if (tree_int_cst_equal (len1
, len2
))
553 if (TREE_CODE (src
) == COMPOUND_EXPR
554 && (only_value
|| !TREE_SIDE_EFFECTS (TREE_OPERAND (src
, 0))))
555 return c_strlen (TREE_OPERAND (src
, 1), only_value
);
557 loc
= EXPR_LOC_OR_LOC (src
, input_location
);
559 src
= string_constant (src
, &offset_node
);
563 max
= TREE_STRING_LENGTH (src
) - 1;
564 ptr
= TREE_STRING_POINTER (src
);
566 if (offset_node
&& TREE_CODE (offset_node
) != INTEGER_CST
)
568 /* If the string has an internal zero byte (e.g., "foo\0bar"), we can't
569 compute the offset to the following null if we don't know where to
570 start searching for it. */
573 for (i
= 0; i
< max
; i
++)
577 /* We don't know the starting offset, but we do know that the string
578 has no internal zero bytes. We can assume that the offset falls
579 within the bounds of the string; otherwise, the programmer deserves
580 what he gets. Subtract the offset from the length of the string,
581 and return that. This would perhaps not be valid if we were dealing
582 with named arrays in addition to literal string constants. */
584 return size_diffop_loc (loc
, size_int (max
), offset_node
);
587 /* We have a known offset into the string. Start searching there for
588 a null character if we can represent it as a single HOST_WIDE_INT. */
589 if (offset_node
== 0)
591 else if (! tree_fits_shwi_p (offset_node
))
594 offset
= tree_to_shwi (offset_node
);
596 /* If the offset is known to be out of bounds, warn, and call strlen at
598 if (offset
< 0 || offset
> max
)
600 /* Suppress multiple warnings for propagated constant strings. */
602 && !TREE_NO_WARNING (src
))
604 warning_at (loc
, 0, "offset outside bounds of constant string");
605 TREE_NO_WARNING (src
) = 1;
610 /* Use strlen to search for the first zero byte. Since any strings
611 constructed with build_string will have nulls appended, we win even
612 if we get handed something like (char[4])"abcd".
614 Since OFFSET is our starting index into the string, no further
615 calculation is needed. */
616 return ssize_int (strlen (ptr
+ offset
));
619 /* Return a constant integer corresponding to target reading
620 GET_MODE_BITSIZE (MODE) bits from string constant STR. */
623 c_readstr (const char *str
, machine_mode mode
)
627 HOST_WIDE_INT tmp
[MAX_BITSIZE_MODE_ANY_INT
/ HOST_BITS_PER_WIDE_INT
];
629 gcc_assert (GET_MODE_CLASS (mode
) == MODE_INT
);
630 unsigned int len
= (GET_MODE_PRECISION (mode
) + HOST_BITS_PER_WIDE_INT
- 1)
631 / HOST_BITS_PER_WIDE_INT
;
633 gcc_assert (len
<= MAX_BITSIZE_MODE_ANY_INT
/ HOST_BITS_PER_WIDE_INT
);
634 for (i
= 0; i
< len
; i
++)
638 for (i
= 0; i
< GET_MODE_SIZE (mode
); i
++)
641 if (WORDS_BIG_ENDIAN
)
642 j
= GET_MODE_SIZE (mode
) - i
- 1;
643 if (BYTES_BIG_ENDIAN
!= WORDS_BIG_ENDIAN
644 && GET_MODE_SIZE (mode
) >= UNITS_PER_WORD
)
645 j
= j
+ UNITS_PER_WORD
- 2 * (j
% UNITS_PER_WORD
) - 1;
649 ch
= (unsigned char) str
[i
];
650 tmp
[j
/ HOST_BITS_PER_WIDE_INT
] |= ch
<< (j
% HOST_BITS_PER_WIDE_INT
);
653 wide_int c
= wide_int::from_array (tmp
, len
, GET_MODE_PRECISION (mode
));
654 return immed_wide_int_const (c
, mode
);
657 /* Cast a target constant CST to target CHAR and if that value fits into
658 host char type, return zero and put that value into variable pointed to by
662 target_char_cast (tree cst
, char *p
)
664 unsigned HOST_WIDE_INT val
, hostval
;
666 if (TREE_CODE (cst
) != INTEGER_CST
667 || CHAR_TYPE_SIZE
> HOST_BITS_PER_WIDE_INT
)
670 /* Do not care if it fits or not right here. */
671 val
= TREE_INT_CST_LOW (cst
);
673 if (CHAR_TYPE_SIZE
< HOST_BITS_PER_WIDE_INT
)
674 val
&= (((unsigned HOST_WIDE_INT
) 1) << CHAR_TYPE_SIZE
) - 1;
677 if (HOST_BITS_PER_CHAR
< HOST_BITS_PER_WIDE_INT
)
678 hostval
&= (((unsigned HOST_WIDE_INT
) 1) << HOST_BITS_PER_CHAR
) - 1;
687 /* Similar to save_expr, but assumes that arbitrary code is not executed
688 in between the multiple evaluations. In particular, we assume that a
689 non-addressable local variable will not be modified. */
692 builtin_save_expr (tree exp
)
694 if (TREE_CODE (exp
) == SSA_NAME
695 || (TREE_ADDRESSABLE (exp
) == 0
696 && (TREE_CODE (exp
) == PARM_DECL
697 || (TREE_CODE (exp
) == VAR_DECL
&& !TREE_STATIC (exp
)))))
700 return save_expr (exp
);
703 /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT
704 times to get the address of either a higher stack frame, or a return
705 address located within it (depending on FNDECL_CODE). */
708 expand_builtin_return_addr (enum built_in_function fndecl_code
, int count
)
711 rtx tem
= INITIAL_FRAME_ADDRESS_RTX
;
714 /* For a zero count with __builtin_return_address, we don't care what
715 frame address we return, because target-specific definitions will
716 override us. Therefore frame pointer elimination is OK, and using
717 the soft frame pointer is OK.
719 For a nonzero count, or a zero count with __builtin_frame_address,
720 we require a stable offset from the current frame pointer to the
721 previous one, so we must use the hard frame pointer, and
722 we must disable frame pointer elimination. */
723 if (count
== 0 && fndecl_code
== BUILT_IN_RETURN_ADDRESS
)
724 tem
= frame_pointer_rtx
;
727 tem
= hard_frame_pointer_rtx
;
729 /* Tell reload not to eliminate the frame pointer. */
730 crtl
->accesses_prior_frames
= 1;
735 SETUP_FRAME_ADDRESSES ();
737 /* On the SPARC, the return address is not in the frame, it is in a
738 register. There is no way to access it off of the current frame
739 pointer, but it can be accessed off the previous frame pointer by
740 reading the value from the register window save area. */
741 if (RETURN_ADDR_IN_PREVIOUS_FRAME
&& fndecl_code
== BUILT_IN_RETURN_ADDRESS
)
744 /* Scan back COUNT frames to the specified frame. */
745 for (i
= 0; i
< count
; i
++)
747 /* Assume the dynamic chain pointer is in the word that the
748 frame address points to, unless otherwise specified. */
749 tem
= DYNAMIC_CHAIN_ADDRESS (tem
);
750 tem
= memory_address (Pmode
, tem
);
751 tem
= gen_frame_mem (Pmode
, tem
);
752 tem
= copy_to_reg (tem
);
755 /* For __builtin_frame_address, return what we've got. But, on
756 the SPARC for example, we may have to add a bias. */
757 if (fndecl_code
== BUILT_IN_FRAME_ADDRESS
)
758 return FRAME_ADDR_RTX (tem
);
760 /* For __builtin_return_address, get the return address from that frame. */
761 #ifdef RETURN_ADDR_RTX
762 tem
= RETURN_ADDR_RTX (count
, tem
);
764 tem
= memory_address (Pmode
,
765 plus_constant (Pmode
, tem
, GET_MODE_SIZE (Pmode
)));
766 tem
= gen_frame_mem (Pmode
, tem
);
771 /* Alias set used for setjmp buffer. */
772 static alias_set_type setjmp_alias_set
= -1;
774 /* Construct the leading half of a __builtin_setjmp call. Control will
775 return to RECEIVER_LABEL. This is also called directly by the SJLJ
776 exception handling code. */
779 expand_builtin_setjmp_setup (rtx buf_addr
, rtx receiver_label
)
781 machine_mode sa_mode
= STACK_SAVEAREA_MODE (SAVE_NONLOCAL
);
785 if (setjmp_alias_set
== -1)
786 setjmp_alias_set
= new_alias_set ();
788 buf_addr
= convert_memory_address (Pmode
, buf_addr
);
790 buf_addr
= force_reg (Pmode
, force_operand (buf_addr
, NULL_RTX
));
792 /* We store the frame pointer and the address of receiver_label in
793 the buffer and use the rest of it for the stack save area, which
794 is machine-dependent. */
796 mem
= gen_rtx_MEM (Pmode
, buf_addr
);
797 set_mem_alias_set (mem
, setjmp_alias_set
);
798 emit_move_insn (mem
, targetm
.builtin_setjmp_frame_value ());
800 mem
= gen_rtx_MEM (Pmode
, plus_constant (Pmode
, buf_addr
,
801 GET_MODE_SIZE (Pmode
))),
802 set_mem_alias_set (mem
, setjmp_alias_set
);
804 emit_move_insn (validize_mem (mem
),
805 force_reg (Pmode
, gen_rtx_LABEL_REF (Pmode
, receiver_label
)));
807 stack_save
= gen_rtx_MEM (sa_mode
,
808 plus_constant (Pmode
, buf_addr
,
809 2 * GET_MODE_SIZE (Pmode
)));
810 set_mem_alias_set (stack_save
, setjmp_alias_set
);
811 emit_stack_save (SAVE_NONLOCAL
, &stack_save
);
813 /* If there is further processing to do, do it. */
814 if (targetm
.have_builtin_setjmp_setup ())
815 emit_insn (targetm
.gen_builtin_setjmp_setup (buf_addr
));
817 /* We have a nonlocal label. */
818 cfun
->has_nonlocal_label
= 1;
821 /* Construct the trailing part of a __builtin_setjmp call. This is
822 also called directly by the SJLJ exception handling code.
823 If RECEIVER_LABEL is NULL, instead contruct a nonlocal goto handler. */
826 expand_builtin_setjmp_receiver (rtx receiver_label
)
830 /* Mark the FP as used when we get here, so we have to make sure it's
831 marked as used by this function. */
832 emit_use (hard_frame_pointer_rtx
);
834 /* Mark the static chain as clobbered here so life information
835 doesn't get messed up for it. */
836 chain
= targetm
.calls
.static_chain (current_function_decl
, true);
837 if (chain
&& REG_P (chain
))
838 emit_clobber (chain
);
840 /* Now put in the code to restore the frame pointer, and argument
841 pointer, if needed. */
842 if (! targetm
.have_nonlocal_goto ())
844 /* First adjust our frame pointer to its actual value. It was
845 previously set to the start of the virtual area corresponding to
846 the stacked variables when we branched here and now needs to be
847 adjusted to the actual hardware fp value.
849 Assignments to virtual registers are converted by
850 instantiate_virtual_regs into the corresponding assignment
851 to the underlying register (fp in this case) that makes
852 the original assignment true.
853 So the following insn will actually be decrementing fp by
854 STARTING_FRAME_OFFSET. */
855 emit_move_insn (virtual_stack_vars_rtx
, hard_frame_pointer_rtx
);
857 /* Restoring the frame pointer also modifies the hard frame pointer.
858 Mark it used (so that the previous assignment remains live once
859 the frame pointer is eliminated) and clobbered (to represent the
860 implicit update from the assignment). */
861 emit_use (hard_frame_pointer_rtx
);
862 emit_clobber (hard_frame_pointer_rtx
);
865 if (!HARD_FRAME_POINTER_IS_ARG_POINTER
&& fixed_regs
[ARG_POINTER_REGNUM
])
867 #ifdef ELIMINABLE_REGS
868 /* If the argument pointer can be eliminated in favor of the
869 frame pointer, we don't need to restore it. We assume here
870 that if such an elimination is present, it can always be used.
871 This is the case on all known machines; if we don't make this
872 assumption, we do unnecessary saving on many machines. */
874 static const struct elims
{const int from
, to
;} elim_regs
[] = ELIMINABLE_REGS
;
876 for (i
= 0; i
< ARRAY_SIZE (elim_regs
); i
++)
877 if (elim_regs
[i
].from
== ARG_POINTER_REGNUM
878 && elim_regs
[i
].to
== HARD_FRAME_POINTER_REGNUM
)
881 if (i
== ARRAY_SIZE (elim_regs
))
884 /* Now restore our arg pointer from the address at which it
885 was saved in our stack frame. */
886 emit_move_insn (crtl
->args
.internal_arg_pointer
,
887 copy_to_reg (get_arg_pointer_save_area ()));
891 if (receiver_label
!= NULL
&& targetm
.have_builtin_setjmp_receiver ())
892 emit_insn (targetm
.gen_builtin_setjmp_receiver (receiver_label
));
893 else if (targetm
.have_nonlocal_goto_receiver ())
894 emit_insn (targetm
.gen_nonlocal_goto_receiver ());
898 /* We must not allow the code we just generated to be reordered by
899 scheduling. Specifically, the update of the frame pointer must
900 happen immediately, not later. */
901 emit_insn (gen_blockage ());
904 /* __builtin_longjmp is passed a pointer to an array of five words (not
905 all will be used on all machines). It operates similarly to the C
906 library function of the same name, but is more efficient. Much of
907 the code below is copied from the handling of non-local gotos. */
910 expand_builtin_longjmp (rtx buf_addr
, rtx value
)
913 rtx_insn
*insn
, *last
;
914 machine_mode sa_mode
= STACK_SAVEAREA_MODE (SAVE_NONLOCAL
);
916 /* DRAP is needed for stack realign if longjmp is expanded to current
918 if (SUPPORTS_STACK_ALIGNMENT
)
919 crtl
->need_drap
= true;
921 if (setjmp_alias_set
== -1)
922 setjmp_alias_set
= new_alias_set ();
924 buf_addr
= convert_memory_address (Pmode
, buf_addr
);
926 buf_addr
= force_reg (Pmode
, buf_addr
);
928 /* We require that the user must pass a second argument of 1, because
929 that is what builtin_setjmp will return. */
930 gcc_assert (value
== const1_rtx
);
932 last
= get_last_insn ();
933 if (targetm
.have_builtin_longjmp ())
934 emit_insn (targetm
.gen_builtin_longjmp (buf_addr
));
937 fp
= gen_rtx_MEM (Pmode
, buf_addr
);
938 lab
= gen_rtx_MEM (Pmode
, plus_constant (Pmode
, buf_addr
,
939 GET_MODE_SIZE (Pmode
)));
941 stack
= gen_rtx_MEM (sa_mode
, plus_constant (Pmode
, buf_addr
,
942 2 * GET_MODE_SIZE (Pmode
)));
943 set_mem_alias_set (fp
, setjmp_alias_set
);
944 set_mem_alias_set (lab
, setjmp_alias_set
);
945 set_mem_alias_set (stack
, setjmp_alias_set
);
947 /* Pick up FP, label, and SP from the block and jump. This code is
948 from expand_goto in stmt.c; see there for detailed comments. */
949 if (targetm
.have_nonlocal_goto ())
950 /* We have to pass a value to the nonlocal_goto pattern that will
951 get copied into the static_chain pointer, but it does not matter
952 what that value is, because builtin_setjmp does not use it. */
953 emit_insn (targetm
.gen_nonlocal_goto (value
, lab
, stack
, fp
));
956 lab
= copy_to_reg (lab
);
958 emit_clobber (gen_rtx_MEM (BLKmode
, gen_rtx_SCRATCH (VOIDmode
)));
959 emit_clobber (gen_rtx_MEM (BLKmode
, hard_frame_pointer_rtx
));
961 emit_move_insn (hard_frame_pointer_rtx
, fp
);
962 emit_stack_restore (SAVE_NONLOCAL
, stack
);
964 emit_use (hard_frame_pointer_rtx
);
965 emit_use (stack_pointer_rtx
);
966 emit_indirect_jump (lab
);
970 /* Search backwards and mark the jump insn as a non-local goto.
971 Note that this precludes the use of __builtin_longjmp to a
972 __builtin_setjmp target in the same function. However, we've
973 already cautioned the user that these functions are for
974 internal exception handling use only. */
975 for (insn
= get_last_insn (); insn
; insn
= PREV_INSN (insn
))
977 gcc_assert (insn
!= last
);
981 add_reg_note (insn
, REG_NON_LOCAL_GOTO
, const0_rtx
);
984 else if (CALL_P (insn
))
990 more_const_call_expr_args_p (const const_call_expr_arg_iterator
*iter
)
992 return (iter
->i
< iter
->n
);
995 /* This function validates the types of a function call argument list
996 against a specified list of tree_codes. If the last specifier is a 0,
997 that represents an ellipses, otherwise the last specifier must be a
1001 validate_arglist (const_tree callexpr
, ...)
1003 enum tree_code code
;
1006 const_call_expr_arg_iterator iter
;
1009 va_start (ap
, callexpr
);
1010 init_const_call_expr_arg_iterator (callexpr
, &iter
);
1014 code
= (enum tree_code
) va_arg (ap
, int);
1018 /* This signifies an ellipses, any further arguments are all ok. */
1022 /* This signifies an endlink, if no arguments remain, return
1023 true, otherwise return false. */
1024 res
= !more_const_call_expr_args_p (&iter
);
1027 /* If no parameters remain or the parameter's code does not
1028 match the specified code, return false. Otherwise continue
1029 checking any remaining arguments. */
1030 arg
= next_const_call_expr_arg (&iter
);
1031 if (!validate_arg (arg
, code
))
1038 /* We need gotos here since we can only have one VA_CLOSE in a
1046 /* Expand a call to __builtin_nonlocal_goto. We're passed the target label
1047 and the address of the save area. */
1050 expand_builtin_nonlocal_goto (tree exp
)
1052 tree t_label
, t_save_area
;
1053 rtx r_label
, r_save_area
, r_fp
, r_sp
;
1056 if (!validate_arglist (exp
, POINTER_TYPE
, POINTER_TYPE
, VOID_TYPE
))
1059 t_label
= CALL_EXPR_ARG (exp
, 0);
1060 t_save_area
= CALL_EXPR_ARG (exp
, 1);
1062 r_label
= expand_normal (t_label
);
1063 r_label
= convert_memory_address (Pmode
, r_label
);
1064 r_save_area
= expand_normal (t_save_area
);
1065 r_save_area
= convert_memory_address (Pmode
, r_save_area
);
1066 /* Copy the address of the save location to a register just in case it was
1067 based on the frame pointer. */
1068 r_save_area
= copy_to_reg (r_save_area
);
1069 r_fp
= gen_rtx_MEM (Pmode
, r_save_area
);
1070 r_sp
= gen_rtx_MEM (STACK_SAVEAREA_MODE (SAVE_NONLOCAL
),
1071 plus_constant (Pmode
, r_save_area
,
1072 GET_MODE_SIZE (Pmode
)));
1074 crtl
->has_nonlocal_goto
= 1;
1076 /* ??? We no longer need to pass the static chain value, afaik. */
1077 if (targetm
.have_nonlocal_goto ())
1078 emit_insn (targetm
.gen_nonlocal_goto (const0_rtx
, r_label
, r_sp
, r_fp
));
1081 r_label
= copy_to_reg (r_label
);
1083 emit_clobber (gen_rtx_MEM (BLKmode
, gen_rtx_SCRATCH (VOIDmode
)));
1084 emit_clobber (gen_rtx_MEM (BLKmode
, hard_frame_pointer_rtx
));
1086 /* Restore frame pointer for containing function. */
1087 emit_move_insn (hard_frame_pointer_rtx
, r_fp
);
1088 emit_stack_restore (SAVE_NONLOCAL
, r_sp
);
1090 /* USE of hard_frame_pointer_rtx added for consistency;
1091 not clear if really needed. */
1092 emit_use (hard_frame_pointer_rtx
);
1093 emit_use (stack_pointer_rtx
);
1095 /* If the architecture is using a GP register, we must
1096 conservatively assume that the target function makes use of it.
1097 The prologue of functions with nonlocal gotos must therefore
1098 initialize the GP register to the appropriate value, and we
1099 must then make sure that this value is live at the point
1100 of the jump. (Note that this doesn't necessarily apply
1101 to targets with a nonlocal_goto pattern; they are free
1102 to implement it in their own way. Note also that this is
1103 a no-op if the GP register is a global invariant.) */
1104 if ((unsigned) PIC_OFFSET_TABLE_REGNUM
!= INVALID_REGNUM
1105 && fixed_regs
[PIC_OFFSET_TABLE_REGNUM
])
1106 emit_use (pic_offset_table_rtx
);
1108 emit_indirect_jump (r_label
);
1111 /* Search backwards to the jump insn and mark it as a
1113 for (insn
= get_last_insn (); insn
; insn
= PREV_INSN (insn
))
1117 add_reg_note (insn
, REG_NON_LOCAL_GOTO
, const0_rtx
);
1120 else if (CALL_P (insn
))
1127 /* __builtin_update_setjmp_buf is passed a pointer to an array of five words
1128 (not all will be used on all machines) that was passed to __builtin_setjmp.
1129 It updates the stack pointer in that block to the current value. This is
1130 also called directly by the SJLJ exception handling code. */
1133 expand_builtin_update_setjmp_buf (rtx buf_addr
)
1135 machine_mode sa_mode
= STACK_SAVEAREA_MODE (SAVE_NONLOCAL
);
1137 = gen_rtx_MEM (sa_mode
,
1140 plus_constant (Pmode
, buf_addr
,
1141 2 * GET_MODE_SIZE (Pmode
))));
1143 emit_stack_save (SAVE_NONLOCAL
, &stack_save
);
1146 /* Expand a call to __builtin_prefetch. For a target that does not support
1147 data prefetch, evaluate the memory address argument in case it has side
1151 expand_builtin_prefetch (tree exp
)
1153 tree arg0
, arg1
, arg2
;
1157 if (!validate_arglist (exp
, POINTER_TYPE
, 0))
1160 arg0
= CALL_EXPR_ARG (exp
, 0);
1162 /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
1163 zero (read) and argument 2 (locality) defaults to 3 (high degree of
1165 nargs
= call_expr_nargs (exp
);
1167 arg1
= CALL_EXPR_ARG (exp
, 1);
1169 arg1
= integer_zero_node
;
1171 arg2
= CALL_EXPR_ARG (exp
, 2);
1173 arg2
= integer_three_node
;
1175 /* Argument 0 is an address. */
1176 op0
= expand_expr (arg0
, NULL_RTX
, Pmode
, EXPAND_NORMAL
);
1178 /* Argument 1 (read/write flag) must be a compile-time constant int. */
1179 if (TREE_CODE (arg1
) != INTEGER_CST
)
1181 error ("second argument to %<__builtin_prefetch%> must be a constant");
1182 arg1
= integer_zero_node
;
1184 op1
= expand_normal (arg1
);
1185 /* Argument 1 must be either zero or one. */
1186 if (INTVAL (op1
) != 0 && INTVAL (op1
) != 1)
1188 warning (0, "invalid second argument to %<__builtin_prefetch%>;"
1193 /* Argument 2 (locality) must be a compile-time constant int. */
1194 if (TREE_CODE (arg2
) != INTEGER_CST
)
1196 error ("third argument to %<__builtin_prefetch%> must be a constant");
1197 arg2
= integer_zero_node
;
1199 op2
= expand_normal (arg2
);
1200 /* Argument 2 must be 0, 1, 2, or 3. */
1201 if (INTVAL (op2
) < 0 || INTVAL (op2
) > 3)
1203 warning (0, "invalid third argument to %<__builtin_prefetch%>; using zero");
1207 if (targetm
.have_prefetch ())
1209 struct expand_operand ops
[3];
1211 create_address_operand (&ops
[0], op0
);
1212 create_integer_operand (&ops
[1], INTVAL (op1
));
1213 create_integer_operand (&ops
[2], INTVAL (op2
));
1214 if (maybe_expand_insn (targetm
.code_for_prefetch
, 3, ops
))
1218 /* Don't do anything with direct references to volatile memory, but
1219 generate code to handle other side effects. */
1220 if (!MEM_P (op0
) && side_effects_p (op0
))
1224 /* Get a MEM rtx for expression EXP which is the address of an operand
1225 to be used in a string instruction (cmpstrsi, movmemsi, ..). LEN is
1226 the maximum length of the block of memory that might be accessed or
1230 get_memory_rtx (tree exp
, tree len
)
1232 tree orig_exp
= exp
;
1235 /* When EXP is not resolved SAVE_EXPR, MEM_ATTRS can be still derived
1236 from its expression, for expr->a.b only <variable>.a.b is recorded. */
1237 if (TREE_CODE (exp
) == SAVE_EXPR
&& !SAVE_EXPR_RESOLVED_P (exp
))
1238 exp
= TREE_OPERAND (exp
, 0);
1240 addr
= expand_expr (orig_exp
, NULL_RTX
, ptr_mode
, EXPAND_NORMAL
);
1241 mem
= gen_rtx_MEM (BLKmode
, memory_address (BLKmode
, addr
));
1243 /* Get an expression we can use to find the attributes to assign to MEM.
1244 First remove any nops. */
1245 while (CONVERT_EXPR_P (exp
)
1246 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (exp
, 0))))
1247 exp
= TREE_OPERAND (exp
, 0);
1249 /* Build a MEM_REF representing the whole accessed area as a byte blob,
1250 (as builtin stringops may alias with anything). */
1251 exp
= fold_build2 (MEM_REF
,
1252 build_array_type (char_type_node
,
1253 build_range_type (sizetype
,
1254 size_one_node
, len
)),
1255 exp
, build_int_cst (ptr_type_node
, 0));
1257 /* If the MEM_REF has no acceptable address, try to get the base object
1258 from the original address we got, and build an all-aliasing
1259 unknown-sized access to that one. */
1260 if (is_gimple_mem_ref_addr (TREE_OPERAND (exp
, 0)))
1261 set_mem_attributes (mem
, exp
, 0);
1262 else if (TREE_CODE (TREE_OPERAND (exp
, 0)) == ADDR_EXPR
1263 && (exp
= get_base_address (TREE_OPERAND (TREE_OPERAND (exp
, 0),
1266 exp
= build_fold_addr_expr (exp
);
1267 exp
= fold_build2 (MEM_REF
,
1268 build_array_type (char_type_node
,
1269 build_range_type (sizetype
,
1272 exp
, build_int_cst (ptr_type_node
, 0));
1273 set_mem_attributes (mem
, exp
, 0);
1275 set_mem_alias_set (mem
, 0);
1279 /* Built-in functions to perform an untyped call and return. */
1281 #define apply_args_mode \
1282 (this_target_builtins->x_apply_args_mode)
1283 #define apply_result_mode \
1284 (this_target_builtins->x_apply_result_mode)
1286 /* Return the size required for the block returned by __builtin_apply_args,
1287 and initialize apply_args_mode. */
1290 apply_args_size (void)
1292 static int size
= -1;
1297 /* The values computed by this function never change. */
1300 /* The first value is the incoming arg-pointer. */
1301 size
= GET_MODE_SIZE (Pmode
);
1303 /* The second value is the structure value address unless this is
1304 passed as an "invisible" first argument. */
1305 if (targetm
.calls
.struct_value_rtx (cfun
? TREE_TYPE (cfun
->decl
) : 0, 0))
1306 size
+= GET_MODE_SIZE (Pmode
);
1308 for (regno
= 0; regno
< FIRST_PSEUDO_REGISTER
; regno
++)
1309 if (FUNCTION_ARG_REGNO_P (regno
))
1311 mode
= targetm
.calls
.get_raw_arg_mode (regno
);
1313 gcc_assert (mode
!= VOIDmode
);
1315 align
= GET_MODE_ALIGNMENT (mode
) / BITS_PER_UNIT
;
1316 if (size
% align
!= 0)
1317 size
= CEIL (size
, align
) * align
;
1318 size
+= GET_MODE_SIZE (mode
);
1319 apply_args_mode
[regno
] = mode
;
1323 apply_args_mode
[regno
] = VOIDmode
;
1329 /* Return the size required for the block returned by __builtin_apply,
1330 and initialize apply_result_mode. */
1333 apply_result_size (void)
1335 static int size
= -1;
1339 /* The values computed by this function never change. */
1344 for (regno
= 0; regno
< FIRST_PSEUDO_REGISTER
; regno
++)
1345 if (targetm
.calls
.function_value_regno_p (regno
))
1347 mode
= targetm
.calls
.get_raw_result_mode (regno
);
1349 gcc_assert (mode
!= VOIDmode
);
1351 align
= GET_MODE_ALIGNMENT (mode
) / BITS_PER_UNIT
;
1352 if (size
% align
!= 0)
1353 size
= CEIL (size
, align
) * align
;
1354 size
+= GET_MODE_SIZE (mode
);
1355 apply_result_mode
[regno
] = mode
;
1358 apply_result_mode
[regno
] = VOIDmode
;
1360 /* Allow targets that use untyped_call and untyped_return to override
1361 the size so that machine-specific information can be stored here. */
1362 #ifdef APPLY_RESULT_SIZE
1363 size
= APPLY_RESULT_SIZE
;
1369 /* Create a vector describing the result block RESULT. If SAVEP is true,
1370 the result block is used to save the values; otherwise it is used to
1371 restore the values. */
1374 result_vector (int savep
, rtx result
)
1376 int regno
, size
, align
, nelts
;
1379 rtx
*savevec
= XALLOCAVEC (rtx
, FIRST_PSEUDO_REGISTER
);
1382 for (regno
= 0; regno
< FIRST_PSEUDO_REGISTER
; regno
++)
1383 if ((mode
= apply_result_mode
[regno
]) != VOIDmode
)
1385 align
= GET_MODE_ALIGNMENT (mode
) / BITS_PER_UNIT
;
1386 if (size
% align
!= 0)
1387 size
= CEIL (size
, align
) * align
;
1388 reg
= gen_rtx_REG (mode
, savep
? regno
: INCOMING_REGNO (regno
));
1389 mem
= adjust_address (result
, mode
, size
);
1390 savevec
[nelts
++] = (savep
1391 ? gen_rtx_SET (mem
, reg
)
1392 : gen_rtx_SET (reg
, mem
));
1393 size
+= GET_MODE_SIZE (mode
);
1395 return gen_rtx_PARALLEL (VOIDmode
, gen_rtvec_v (nelts
, savevec
));
1398 /* Save the state required to perform an untyped call with the same
1399 arguments as were passed to the current function. */
1402 expand_builtin_apply_args_1 (void)
1405 int size
, align
, regno
;
1407 rtx struct_incoming_value
= targetm
.calls
.struct_value_rtx (cfun
? TREE_TYPE (cfun
->decl
) : 0, 1);
1409 /* Create a block where the arg-pointer, structure value address,
1410 and argument registers can be saved. */
1411 registers
= assign_stack_local (BLKmode
, apply_args_size (), -1);
1413 /* Walk past the arg-pointer and structure value address. */
1414 size
= GET_MODE_SIZE (Pmode
);
1415 if (targetm
.calls
.struct_value_rtx (cfun
? TREE_TYPE (cfun
->decl
) : 0, 0))
1416 size
+= GET_MODE_SIZE (Pmode
);
1418 /* Save each register used in calling a function to the block. */
1419 for (regno
= 0; regno
< FIRST_PSEUDO_REGISTER
; regno
++)
1420 if ((mode
= apply_args_mode
[regno
]) != VOIDmode
)
1422 align
= GET_MODE_ALIGNMENT (mode
) / BITS_PER_UNIT
;
1423 if (size
% align
!= 0)
1424 size
= CEIL (size
, align
) * align
;
1426 tem
= gen_rtx_REG (mode
, INCOMING_REGNO (regno
));
1428 emit_move_insn (adjust_address (registers
, mode
, size
), tem
);
1429 size
+= GET_MODE_SIZE (mode
);
1432 /* Save the arg pointer to the block. */
1433 tem
= copy_to_reg (crtl
->args
.internal_arg_pointer
);
1434 /* We need the pointer as the caller actually passed them to us, not
1435 as we might have pretended they were passed. Make sure it's a valid
1436 operand, as emit_move_insn isn't expected to handle a PLUS. */
1437 if (STACK_GROWS_DOWNWARD
)
1439 = force_operand (plus_constant (Pmode
, tem
,
1440 crtl
->args
.pretend_args_size
),
1442 emit_move_insn (adjust_address (registers
, Pmode
, 0), tem
);
1444 size
= GET_MODE_SIZE (Pmode
);
1446 /* Save the structure value address unless this is passed as an
1447 "invisible" first argument. */
1448 if (struct_incoming_value
)
1450 emit_move_insn (adjust_address (registers
, Pmode
, size
),
1451 copy_to_reg (struct_incoming_value
));
1452 size
+= GET_MODE_SIZE (Pmode
);
1455 /* Return the address of the block. */
1456 return copy_addr_to_reg (XEXP (registers
, 0));
1459 /* __builtin_apply_args returns block of memory allocated on
1460 the stack into which is stored the arg pointer, structure
1461 value address, static chain, and all the registers that might
1462 possibly be used in performing a function call. The code is
1463 moved to the start of the function so the incoming values are
1467 expand_builtin_apply_args (void)
1469 /* Don't do __builtin_apply_args more than once in a function.
1470 Save the result of the first call and reuse it. */
1471 if (apply_args_value
!= 0)
1472 return apply_args_value
;
1474 /* When this function is called, it means that registers must be
1475 saved on entry to this function. So we migrate the
1476 call to the first insn of this function. */
1480 temp
= expand_builtin_apply_args_1 ();
1481 rtx_insn
*seq
= get_insns ();
1484 apply_args_value
= temp
;
1486 /* Put the insns after the NOTE that starts the function.
1487 If this is inside a start_sequence, make the outer-level insn
1488 chain current, so the code is placed at the start of the
1489 function. If internal_arg_pointer is a non-virtual pseudo,
1490 it needs to be placed after the function that initializes
1492 push_topmost_sequence ();
1493 if (REG_P (crtl
->args
.internal_arg_pointer
)
1494 && REGNO (crtl
->args
.internal_arg_pointer
) > LAST_VIRTUAL_REGISTER
)
1495 emit_insn_before (seq
, parm_birth_insn
);
1497 emit_insn_before (seq
, NEXT_INSN (entry_of_function ()));
1498 pop_topmost_sequence ();
1503 /* Perform an untyped call and save the state required to perform an
1504 untyped return of whatever value was returned by the given function. */
1507 expand_builtin_apply (rtx function
, rtx arguments
, rtx argsize
)
1509 int size
, align
, regno
;
1511 rtx incoming_args
, result
, reg
, dest
, src
;
1512 rtx_call_insn
*call_insn
;
1513 rtx old_stack_level
= 0;
1514 rtx call_fusage
= 0;
1515 rtx struct_value
= targetm
.calls
.struct_value_rtx (cfun
? TREE_TYPE (cfun
->decl
) : 0, 0);
1517 arguments
= convert_memory_address (Pmode
, arguments
);
1519 /* Create a block where the return registers can be saved. */
1520 result
= assign_stack_local (BLKmode
, apply_result_size (), -1);
1522 /* Fetch the arg pointer from the ARGUMENTS block. */
1523 incoming_args
= gen_reg_rtx (Pmode
);
1524 emit_move_insn (incoming_args
, gen_rtx_MEM (Pmode
, arguments
));
1525 if (!STACK_GROWS_DOWNWARD
)
1526 incoming_args
= expand_simple_binop (Pmode
, MINUS
, incoming_args
, argsize
,
1527 incoming_args
, 0, OPTAB_LIB_WIDEN
);
1529 /* Push a new argument block and copy the arguments. Do not allow
1530 the (potential) memcpy call below to interfere with our stack
1532 do_pending_stack_adjust ();
1535 /* Save the stack with nonlocal if available. */
1536 if (targetm
.have_save_stack_nonlocal ())
1537 emit_stack_save (SAVE_NONLOCAL
, &old_stack_level
);
1539 emit_stack_save (SAVE_BLOCK
, &old_stack_level
);
1541 /* Allocate a block of memory onto the stack and copy the memory
1542 arguments to the outgoing arguments address. We can pass TRUE
1543 as the 4th argument because we just saved the stack pointer
1544 and will restore it right after the call. */
1545 allocate_dynamic_stack_space (argsize
, 0, BIGGEST_ALIGNMENT
, true);
1547 /* Set DRAP flag to true, even though allocate_dynamic_stack_space
1548 may have already set current_function_calls_alloca to true.
1549 current_function_calls_alloca won't be set if argsize is zero,
1550 so we have to guarantee need_drap is true here. */
1551 if (SUPPORTS_STACK_ALIGNMENT
)
1552 crtl
->need_drap
= true;
1554 dest
= virtual_outgoing_args_rtx
;
1555 if (!STACK_GROWS_DOWNWARD
)
1557 if (CONST_INT_P (argsize
))
1558 dest
= plus_constant (Pmode
, dest
, -INTVAL (argsize
));
1560 dest
= gen_rtx_PLUS (Pmode
, dest
, negate_rtx (Pmode
, argsize
));
1562 dest
= gen_rtx_MEM (BLKmode
, dest
);
1563 set_mem_align (dest
, PARM_BOUNDARY
);
1564 src
= gen_rtx_MEM (BLKmode
, incoming_args
);
1565 set_mem_align (src
, PARM_BOUNDARY
);
1566 emit_block_move (dest
, src
, argsize
, BLOCK_OP_NORMAL
);
1568 /* Refer to the argument block. */
1570 arguments
= gen_rtx_MEM (BLKmode
, arguments
);
1571 set_mem_align (arguments
, PARM_BOUNDARY
);
1573 /* Walk past the arg-pointer and structure value address. */
1574 size
= GET_MODE_SIZE (Pmode
);
1576 size
+= GET_MODE_SIZE (Pmode
);
1578 /* Restore each of the registers previously saved. Make USE insns
1579 for each of these registers for use in making the call. */
1580 for (regno
= 0; regno
< FIRST_PSEUDO_REGISTER
; regno
++)
1581 if ((mode
= apply_args_mode
[regno
]) != VOIDmode
)
1583 align
= GET_MODE_ALIGNMENT (mode
) / BITS_PER_UNIT
;
1584 if (size
% align
!= 0)
1585 size
= CEIL (size
, align
) * align
;
1586 reg
= gen_rtx_REG (mode
, regno
);
1587 emit_move_insn (reg
, adjust_address (arguments
, mode
, size
));
1588 use_reg (&call_fusage
, reg
);
1589 size
+= GET_MODE_SIZE (mode
);
1592 /* Restore the structure value address unless this is passed as an
1593 "invisible" first argument. */
1594 size
= GET_MODE_SIZE (Pmode
);
1597 rtx value
= gen_reg_rtx (Pmode
);
1598 emit_move_insn (value
, adjust_address (arguments
, Pmode
, size
));
1599 emit_move_insn (struct_value
, value
);
1600 if (REG_P (struct_value
))
1601 use_reg (&call_fusage
, struct_value
);
1602 size
+= GET_MODE_SIZE (Pmode
);
1605 /* All arguments and registers used for the call are set up by now! */
1606 function
= prepare_call_address (NULL
, function
, NULL
, &call_fusage
, 0, 0);
1608 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1609 and we don't want to load it into a register as an optimization,
1610 because prepare_call_address already did it if it should be done. */
1611 if (GET_CODE (function
) != SYMBOL_REF
)
1612 function
= memory_address (FUNCTION_MODE
, function
);
1614 /* Generate the actual call instruction and save the return value. */
1615 if (targetm
.have_untyped_call ())
1617 rtx mem
= gen_rtx_MEM (FUNCTION_MODE
, function
);
1618 emit_call_insn (targetm
.gen_untyped_call (mem
, result
,
1619 result_vector (1, result
)));
1621 else if (targetm
.have_call_value ())
1625 /* Locate the unique return register. It is not possible to
1626 express a call that sets more than one return register using
1627 call_value; use untyped_call for that. In fact, untyped_call
1628 only needs to save the return registers in the given block. */
1629 for (regno
= 0; regno
< FIRST_PSEUDO_REGISTER
; regno
++)
1630 if ((mode
= apply_result_mode
[regno
]) != VOIDmode
)
1632 gcc_assert (!valreg
); /* have_untyped_call required. */
1634 valreg
= gen_rtx_REG (mode
, regno
);
1637 emit_insn (targetm
.gen_call_value (valreg
,
1638 gen_rtx_MEM (FUNCTION_MODE
, function
),
1639 const0_rtx
, NULL_RTX
, const0_rtx
));
1641 emit_move_insn (adjust_address (result
, GET_MODE (valreg
), 0), valreg
);
1646 /* Find the CALL insn we just emitted, and attach the register usage
1648 call_insn
= last_call_insn ();
1649 add_function_usage_to (call_insn
, call_fusage
);
1651 /* Restore the stack. */
1652 if (targetm
.have_save_stack_nonlocal ())
1653 emit_stack_restore (SAVE_NONLOCAL
, old_stack_level
);
1655 emit_stack_restore (SAVE_BLOCK
, old_stack_level
);
1656 fixup_args_size_notes (call_insn
, get_last_insn (), 0);
1660 /* Return the address of the result block. */
1661 result
= copy_addr_to_reg (XEXP (result
, 0));
1662 return convert_memory_address (ptr_mode
, result
);
1665 /* Perform an untyped return. */
1668 expand_builtin_return (rtx result
)
1670 int size
, align
, regno
;
1673 rtx_insn
*call_fusage
= 0;
1675 result
= convert_memory_address (Pmode
, result
);
1677 apply_result_size ();
1678 result
= gen_rtx_MEM (BLKmode
, result
);
1680 if (targetm
.have_untyped_return ())
1682 rtx vector
= result_vector (0, result
);
1683 emit_jump_insn (targetm
.gen_untyped_return (result
, vector
));
1688 /* Restore the return value and note that each value is used. */
1690 for (regno
= 0; regno
< FIRST_PSEUDO_REGISTER
; regno
++)
1691 if ((mode
= apply_result_mode
[regno
]) != VOIDmode
)
1693 align
= GET_MODE_ALIGNMENT (mode
) / BITS_PER_UNIT
;
1694 if (size
% align
!= 0)
1695 size
= CEIL (size
, align
) * align
;
1696 reg
= gen_rtx_REG (mode
, INCOMING_REGNO (regno
));
1697 emit_move_insn (reg
, adjust_address (result
, mode
, size
));
1699 push_to_sequence (call_fusage
);
1701 call_fusage
= get_insns ();
1703 size
+= GET_MODE_SIZE (mode
);
1706 /* Put the USE insns before the return. */
1707 emit_insn (call_fusage
);
1709 /* Return whatever values was restored by jumping directly to the end
1711 expand_naked_return ();
1714 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1716 static enum type_class
1717 type_to_class (tree type
)
1719 switch (TREE_CODE (type
))
1721 case VOID_TYPE
: return void_type_class
;
1722 case INTEGER_TYPE
: return integer_type_class
;
1723 case ENUMERAL_TYPE
: return enumeral_type_class
;
1724 case BOOLEAN_TYPE
: return boolean_type_class
;
1725 case POINTER_TYPE
: return pointer_type_class
;
1726 case REFERENCE_TYPE
: return reference_type_class
;
1727 case OFFSET_TYPE
: return offset_type_class
;
1728 case REAL_TYPE
: return real_type_class
;
1729 case COMPLEX_TYPE
: return complex_type_class
;
1730 case FUNCTION_TYPE
: return function_type_class
;
1731 case METHOD_TYPE
: return method_type_class
;
1732 case RECORD_TYPE
: return record_type_class
;
1734 case QUAL_UNION_TYPE
: return union_type_class
;
1735 case ARRAY_TYPE
: return (TYPE_STRING_FLAG (type
)
1736 ? string_type_class
: array_type_class
);
1737 case LANG_TYPE
: return lang_type_class
;
1738 default: return no_type_class
;
1742 /* Expand a call EXP to __builtin_classify_type. */
1745 expand_builtin_classify_type (tree exp
)
1747 if (call_expr_nargs (exp
))
1748 return GEN_INT (type_to_class (TREE_TYPE (CALL_EXPR_ARG (exp
, 0))));
1749 return GEN_INT (no_type_class
);
1752 /* This helper macro, meant to be used in mathfn_built_in below,
1753 determines which among a set of three builtin math functions is
1754 appropriate for a given type mode. The `F' and `L' cases are
1755 automatically generated from the `double' case. */
1756 #define CASE_MATHFN(MATHFN) \
1757 CASE_CFN_##MATHFN: \
1758 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1759 fcodel = BUILT_IN_##MATHFN##L ; break;
1760 /* Similar to above, but appends _R after any F/L suffix. */
1761 #define CASE_MATHFN_REENT(MATHFN) \
1762 case CFN_BUILT_IN_##MATHFN##_R: \
1763 case CFN_BUILT_IN_##MATHFN##F_R: \
1764 case CFN_BUILT_IN_##MATHFN##L_R: \
1765 fcode = BUILT_IN_##MATHFN##_R; fcodef = BUILT_IN_##MATHFN##F_R ; \
1766 fcodel = BUILT_IN_##MATHFN##L_R ; break;
1768 /* Return a function equivalent to FN but operating on floating-point
1769 values of type TYPE, or END_BUILTINS if no such function exists.
1770 This is purely an operation on function codes; it does not guarantee
1771 that the target actually has an implementation of the function. */
1773 static built_in_function
1774 mathfn_built_in_2 (tree type
, combined_fn fn
)
1776 built_in_function fcode
, fcodef
, fcodel
;
1790 CASE_MATHFN (COPYSIGN
)
1809 CASE_MATHFN_REENT (GAMMA
) /* GAMMA_R */
1810 CASE_MATHFN (HUGE_VAL
)
1814 CASE_MATHFN (IFLOOR
)
1817 CASE_MATHFN (IROUND
)
1824 CASE_MATHFN (LFLOOR
)
1825 CASE_MATHFN (LGAMMA
)
1826 CASE_MATHFN_REENT (LGAMMA
) /* LGAMMA_R */
1827 CASE_MATHFN (LLCEIL
)
1828 CASE_MATHFN (LLFLOOR
)
1829 CASE_MATHFN (LLRINT
)
1830 CASE_MATHFN (LLROUND
)
1837 CASE_MATHFN (LROUND
)
1841 CASE_MATHFN (NEARBYINT
)
1842 CASE_MATHFN (NEXTAFTER
)
1843 CASE_MATHFN (NEXTTOWARD
)
1847 CASE_MATHFN (REMAINDER
)
1848 CASE_MATHFN (REMQUO
)
1852 CASE_MATHFN (SCALBLN
)
1853 CASE_MATHFN (SCALBN
)
1854 CASE_MATHFN (SIGNBIT
)
1855 CASE_MATHFN (SIGNIFICAND
)
1857 CASE_MATHFN (SINCOS
)
1862 CASE_MATHFN (TGAMMA
)
1869 return END_BUILTINS
;
1872 if (TYPE_MAIN_VARIANT (type
) == double_type_node
)
1874 else if (TYPE_MAIN_VARIANT (type
) == float_type_node
)
1876 else if (TYPE_MAIN_VARIANT (type
) == long_double_type_node
)
1879 return END_BUILTINS
;
1882 /* Return mathematic function equivalent to FN but operating directly on TYPE,
1883 if available. If IMPLICIT_P is true use the implicit builtin declaration,
1884 otherwise use the explicit declaration. If we can't do the conversion,
1888 mathfn_built_in_1 (tree type
, combined_fn fn
, bool implicit_p
)
1890 built_in_function fcode2
= mathfn_built_in_2 (type
, fn
);
1891 if (fcode2
== END_BUILTINS
)
1894 if (implicit_p
&& !builtin_decl_implicit_p (fcode2
))
1897 return builtin_decl_explicit (fcode2
);
1900 /* Like mathfn_built_in_1, but always use the implicit array. */
1903 mathfn_built_in (tree type
, combined_fn fn
)
1905 return mathfn_built_in_1 (type
, fn
, /*implicit=*/ 1);
1908 /* Like mathfn_built_in_1, but take a built_in_function and
1909 always use the implicit array. */
1912 mathfn_built_in (tree type
, enum built_in_function fn
)
1914 return mathfn_built_in_1 (type
, as_combined_fn (fn
), /*implicit=*/ 1);
1917 /* If BUILT_IN_NORMAL function FNDECL has an associated internal function,
1918 return its code, otherwise return IFN_LAST. Note that this function
1919 only tests whether the function is defined in internals.def, not whether
1920 it is actually available on the target. */
1923 associated_internal_fn (tree fndecl
)
1925 gcc_checking_assert (DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
);
1926 tree return_type
= TREE_TYPE (TREE_TYPE (fndecl
));
1927 switch (DECL_FUNCTION_CODE (fndecl
))
1929 #define DEF_INTERNAL_FLT_FN(NAME, FLAGS, OPTAB, TYPE) \
1930 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME;
1931 #define DEF_INTERNAL_INT_FN(NAME, FLAGS, OPTAB, TYPE) \
1932 CASE_INT_FN (BUILT_IN_##NAME): return IFN_##NAME;
1933 #include "internal-fn.def"
1935 CASE_FLT_FN (BUILT_IN_POW10
):
1938 CASE_FLT_FN (BUILT_IN_DREM
):
1939 return IFN_REMAINDER
;
1941 CASE_FLT_FN (BUILT_IN_SCALBN
):
1942 CASE_FLT_FN (BUILT_IN_SCALBLN
):
1943 if (REAL_MODE_FORMAT (TYPE_MODE (return_type
))->b
== 2)
1952 /* If CALL is a call to a BUILT_IN_NORMAL function that could be replaced
1953 on the current target by a call to an internal function, return the
1954 code of that internal function, otherwise return IFN_LAST. The caller
1955 is responsible for ensuring that any side-effects of the built-in
1956 call are dealt with correctly. E.g. if CALL sets errno, the caller
1957 must decide that the errno result isn't needed or make it available
1958 in some other way. */
1961 replacement_internal_fn (gcall
*call
)
1963 if (gimple_call_builtin_p (call
, BUILT_IN_NORMAL
))
1965 internal_fn ifn
= associated_internal_fn (gimple_call_fndecl (call
));
1966 if (ifn
!= IFN_LAST
)
1968 tree_pair types
= direct_internal_fn_types (ifn
, call
);
1969 optimization_type opt_type
= bb_optimization_type (gimple_bb (call
));
1970 if (direct_internal_fn_supported_p (ifn
, types
, opt_type
))
1977 /* Expand a call to the builtin trinary math functions (fma).
1978 Return NULL_RTX if a normal call should be emitted rather than expanding the
1979 function in-line. EXP is the expression that is a call to the builtin
1980 function; if convenient, the result should be placed in TARGET.
1981 SUBTARGET may be used as the target for computing one of EXP's
1985 expand_builtin_mathfn_ternary (tree exp
, rtx target
, rtx subtarget
)
1987 optab builtin_optab
;
1988 rtx op0
, op1
, op2
, result
;
1990 tree fndecl
= get_callee_fndecl (exp
);
1991 tree arg0
, arg1
, arg2
;
1994 if (!validate_arglist (exp
, REAL_TYPE
, REAL_TYPE
, REAL_TYPE
, VOID_TYPE
))
1997 arg0
= CALL_EXPR_ARG (exp
, 0);
1998 arg1
= CALL_EXPR_ARG (exp
, 1);
1999 arg2
= CALL_EXPR_ARG (exp
, 2);
2001 switch (DECL_FUNCTION_CODE (fndecl
))
2003 CASE_FLT_FN (BUILT_IN_FMA
):
2004 builtin_optab
= fma_optab
; break;
2009 /* Make a suitable register to place result in. */
2010 mode
= TYPE_MODE (TREE_TYPE (exp
));
2012 /* Before working hard, check whether the instruction is available. */
2013 if (optab_handler (builtin_optab
, mode
) == CODE_FOR_nothing
)
2016 result
= gen_reg_rtx (mode
);
2018 /* Always stabilize the argument list. */
2019 CALL_EXPR_ARG (exp
, 0) = arg0
= builtin_save_expr (arg0
);
2020 CALL_EXPR_ARG (exp
, 1) = arg1
= builtin_save_expr (arg1
);
2021 CALL_EXPR_ARG (exp
, 2) = arg2
= builtin_save_expr (arg2
);
2023 op0
= expand_expr (arg0
, subtarget
, VOIDmode
, EXPAND_NORMAL
);
2024 op1
= expand_normal (arg1
);
2025 op2
= expand_normal (arg2
);
2029 /* Compute into RESULT.
2030 Set RESULT to wherever the result comes back. */
2031 result
= expand_ternary_op (mode
, builtin_optab
, op0
, op1
, op2
,
2034 /* If we were unable to expand via the builtin, stop the sequence
2035 (without outputting the insns) and call to the library function
2036 with the stabilized argument list. */
2040 return expand_call (exp
, target
, target
== const0_rtx
);
2043 /* Output the entire sequence. */
2044 insns
= get_insns ();
2051 /* Expand a call to the builtin sin and cos math functions.
2052 Return NULL_RTX if a normal call should be emitted rather than expanding the
2053 function in-line. EXP is the expression that is a call to the builtin
2054 function; if convenient, the result should be placed in TARGET.
2055 SUBTARGET may be used as the target for computing one of EXP's
2059 expand_builtin_mathfn_3 (tree exp
, rtx target
, rtx subtarget
)
2061 optab builtin_optab
;
2064 tree fndecl
= get_callee_fndecl (exp
);
2068 if (!validate_arglist (exp
, REAL_TYPE
, VOID_TYPE
))
2071 arg
= CALL_EXPR_ARG (exp
, 0);
2073 switch (DECL_FUNCTION_CODE (fndecl
))
2075 CASE_FLT_FN (BUILT_IN_SIN
):
2076 CASE_FLT_FN (BUILT_IN_COS
):
2077 builtin_optab
= sincos_optab
; break;
2082 /* Make a suitable register to place result in. */
2083 mode
= TYPE_MODE (TREE_TYPE (exp
));
2085 /* Check if sincos insn is available, otherwise fallback
2086 to sin or cos insn. */
2087 if (optab_handler (builtin_optab
, mode
) == CODE_FOR_nothing
)
2088 switch (DECL_FUNCTION_CODE (fndecl
))
2090 CASE_FLT_FN (BUILT_IN_SIN
):
2091 builtin_optab
= sin_optab
; break;
2092 CASE_FLT_FN (BUILT_IN_COS
):
2093 builtin_optab
= cos_optab
; break;
2098 /* Before working hard, check whether the instruction is available. */
2099 if (optab_handler (builtin_optab
, mode
) != CODE_FOR_nothing
)
2101 rtx result
= gen_reg_rtx (mode
);
2103 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2104 need to expand the argument again. This way, we will not perform
2105 side-effects more the once. */
2106 CALL_EXPR_ARG (exp
, 0) = arg
= builtin_save_expr (arg
);
2108 op0
= expand_expr (arg
, subtarget
, VOIDmode
, EXPAND_NORMAL
);
2112 /* Compute into RESULT.
2113 Set RESULT to wherever the result comes back. */
2114 if (builtin_optab
== sincos_optab
)
2118 switch (DECL_FUNCTION_CODE (fndecl
))
2120 CASE_FLT_FN (BUILT_IN_SIN
):
2121 ok
= expand_twoval_unop (builtin_optab
, op0
, 0, result
, 0);
2123 CASE_FLT_FN (BUILT_IN_COS
):
2124 ok
= expand_twoval_unop (builtin_optab
, op0
, result
, 0, 0);
2132 result
= expand_unop (mode
, builtin_optab
, op0
, result
, 0);
2136 /* Output the entire sequence. */
2137 insns
= get_insns ();
2143 /* If we were unable to expand via the builtin, stop the sequence
2144 (without outputting the insns) and call to the library function
2145 with the stabilized argument list. */
2149 return expand_call (exp
, target
, target
== const0_rtx
);
2152 /* Given an interclass math builtin decl FNDECL and it's argument ARG
2153 return an RTL instruction code that implements the functionality.
2154 If that isn't possible or available return CODE_FOR_nothing. */
2156 static enum insn_code
2157 interclass_mathfn_icode (tree arg
, tree fndecl
)
2159 bool errno_set
= false;
2160 optab builtin_optab
= unknown_optab
;
2163 switch (DECL_FUNCTION_CODE (fndecl
))
2165 CASE_FLT_FN (BUILT_IN_ILOGB
):
2166 errno_set
= true; builtin_optab
= ilogb_optab
; break;
2167 CASE_FLT_FN (BUILT_IN_ISINF
):
2168 builtin_optab
= isinf_optab
; break;
2169 case BUILT_IN_ISNORMAL
:
2170 case BUILT_IN_ISFINITE
:
2171 CASE_FLT_FN (BUILT_IN_FINITE
):
2172 case BUILT_IN_FINITED32
:
2173 case BUILT_IN_FINITED64
:
2174 case BUILT_IN_FINITED128
:
2175 case BUILT_IN_ISINFD32
:
2176 case BUILT_IN_ISINFD64
:
2177 case BUILT_IN_ISINFD128
:
2178 /* These builtins have no optabs (yet). */
2184 /* There's no easy way to detect the case we need to set EDOM. */
2185 if (flag_errno_math
&& errno_set
)
2186 return CODE_FOR_nothing
;
2188 /* Optab mode depends on the mode of the input argument. */
2189 mode
= TYPE_MODE (TREE_TYPE (arg
));
2192 return optab_handler (builtin_optab
, mode
);
2193 return CODE_FOR_nothing
;
2196 /* Expand a call to one of the builtin math functions that operate on
2197 floating point argument and output an integer result (ilogb, isinf,
2199 Return 0 if a normal call should be emitted rather than expanding the
2200 function in-line. EXP is the expression that is a call to the builtin
2201 function; if convenient, the result should be placed in TARGET. */
2204 expand_builtin_interclass_mathfn (tree exp
, rtx target
)
2206 enum insn_code icode
= CODE_FOR_nothing
;
2208 tree fndecl
= get_callee_fndecl (exp
);
2212 if (!validate_arglist (exp
, REAL_TYPE
, VOID_TYPE
))
2215 arg
= CALL_EXPR_ARG (exp
, 0);
2216 icode
= interclass_mathfn_icode (arg
, fndecl
);
2217 mode
= TYPE_MODE (TREE_TYPE (arg
));
2219 if (icode
!= CODE_FOR_nothing
)
2221 struct expand_operand ops
[1];
2222 rtx_insn
*last
= get_last_insn ();
2223 tree orig_arg
= arg
;
2225 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2226 need to expand the argument again. This way, we will not perform
2227 side-effects more the once. */
2228 CALL_EXPR_ARG (exp
, 0) = arg
= builtin_save_expr (arg
);
2230 op0
= expand_expr (arg
, NULL_RTX
, VOIDmode
, EXPAND_NORMAL
);
2232 if (mode
!= GET_MODE (op0
))
2233 op0
= convert_to_mode (mode
, op0
, 0);
2235 create_output_operand (&ops
[0], target
, TYPE_MODE (TREE_TYPE (exp
)));
2236 if (maybe_legitimize_operands (icode
, 0, 1, ops
)
2237 && maybe_emit_unop_insn (icode
, ops
[0].value
, op0
, UNKNOWN
))
2238 return ops
[0].value
;
2240 delete_insns_since (last
);
2241 CALL_EXPR_ARG (exp
, 0) = orig_arg
;
2247 /* Expand a call to the builtin sincos math function.
2248 Return NULL_RTX if a normal call should be emitted rather than expanding the
2249 function in-line. EXP is the expression that is a call to the builtin
2253 expand_builtin_sincos (tree exp
)
2255 rtx op0
, op1
, op2
, target1
, target2
;
2257 tree arg
, sinp
, cosp
;
2259 location_t loc
= EXPR_LOCATION (exp
);
2260 tree alias_type
, alias_off
;
2262 if (!validate_arglist (exp
, REAL_TYPE
,
2263 POINTER_TYPE
, POINTER_TYPE
, VOID_TYPE
))
2266 arg
= CALL_EXPR_ARG (exp
, 0);
2267 sinp
= CALL_EXPR_ARG (exp
, 1);
2268 cosp
= CALL_EXPR_ARG (exp
, 2);
2270 /* Make a suitable register to place result in. */
2271 mode
= TYPE_MODE (TREE_TYPE (arg
));
2273 /* Check if sincos insn is available, otherwise emit the call. */
2274 if (optab_handler (sincos_optab
, mode
) == CODE_FOR_nothing
)
2277 target1
= gen_reg_rtx (mode
);
2278 target2
= gen_reg_rtx (mode
);
2280 op0
= expand_normal (arg
);
2281 alias_type
= build_pointer_type_for_mode (TREE_TYPE (arg
), ptr_mode
, true);
2282 alias_off
= build_int_cst (alias_type
, 0);
2283 op1
= expand_normal (fold_build2_loc (loc
, MEM_REF
, TREE_TYPE (arg
),
2285 op2
= expand_normal (fold_build2_loc (loc
, MEM_REF
, TREE_TYPE (arg
),
2288 /* Compute into target1 and target2.
2289 Set TARGET to wherever the result comes back. */
2290 result
= expand_twoval_unop (sincos_optab
, op0
, target2
, target1
, 0);
2291 gcc_assert (result
);
2293 /* Move target1 and target2 to the memory locations indicated
2295 emit_move_insn (op1
, target1
);
2296 emit_move_insn (op2
, target2
);
2301 /* Expand a call to the internal cexpi builtin to the sincos math function.
2302 EXP is the expression that is a call to the builtin function; if convenient,
2303 the result should be placed in TARGET. */
2306 expand_builtin_cexpi (tree exp
, rtx target
)
2308 tree fndecl
= get_callee_fndecl (exp
);
2312 location_t loc
= EXPR_LOCATION (exp
);
2314 if (!validate_arglist (exp
, REAL_TYPE
, VOID_TYPE
))
2317 arg
= CALL_EXPR_ARG (exp
, 0);
2318 type
= TREE_TYPE (arg
);
2319 mode
= TYPE_MODE (TREE_TYPE (arg
));
2321 /* Try expanding via a sincos optab, fall back to emitting a libcall
2322 to sincos or cexp. We are sure we have sincos or cexp because cexpi
2323 is only generated from sincos, cexp or if we have either of them. */
2324 if (optab_handler (sincos_optab
, mode
) != CODE_FOR_nothing
)
2326 op1
= gen_reg_rtx (mode
);
2327 op2
= gen_reg_rtx (mode
);
2329 op0
= expand_expr (arg
, NULL_RTX
, VOIDmode
, EXPAND_NORMAL
);
2331 /* Compute into op1 and op2. */
2332 expand_twoval_unop (sincos_optab
, op0
, op2
, op1
, 0);
2334 else if (targetm
.libc_has_function (function_sincos
))
2336 tree call
, fn
= NULL_TREE
;
2340 if (DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CEXPIF
)
2341 fn
= builtin_decl_explicit (BUILT_IN_SINCOSF
);
2342 else if (DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CEXPI
)
2343 fn
= builtin_decl_explicit (BUILT_IN_SINCOS
);
2344 else if (DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CEXPIL
)
2345 fn
= builtin_decl_explicit (BUILT_IN_SINCOSL
);
2349 op1
= assign_temp (TREE_TYPE (arg
), 1, 1);
2350 op2
= assign_temp (TREE_TYPE (arg
), 1, 1);
2351 op1a
= copy_addr_to_reg (XEXP (op1
, 0));
2352 op2a
= copy_addr_to_reg (XEXP (op2
, 0));
2353 top1
= make_tree (build_pointer_type (TREE_TYPE (arg
)), op1a
);
2354 top2
= make_tree (build_pointer_type (TREE_TYPE (arg
)), op2a
);
2356 /* Make sure not to fold the sincos call again. */
2357 call
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (fn
)), fn
);
2358 expand_normal (build_call_nary (TREE_TYPE (TREE_TYPE (fn
)),
2359 call
, 3, arg
, top1
, top2
));
2363 tree call
, fn
= NULL_TREE
, narg
;
2364 tree ctype
= build_complex_type (type
);
2366 if (DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CEXPIF
)
2367 fn
= builtin_decl_explicit (BUILT_IN_CEXPF
);
2368 else if (DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CEXPI
)
2369 fn
= builtin_decl_explicit (BUILT_IN_CEXP
);
2370 else if (DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CEXPIL
)
2371 fn
= builtin_decl_explicit (BUILT_IN_CEXPL
);
2375 /* If we don't have a decl for cexp create one. This is the
2376 friendliest fallback if the user calls __builtin_cexpi
2377 without full target C99 function support. */
2378 if (fn
== NULL_TREE
)
2381 const char *name
= NULL
;
2383 if (DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CEXPIF
)
2385 else if (DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CEXPI
)
2387 else if (DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CEXPIL
)
2390 fntype
= build_function_type_list (ctype
, ctype
, NULL_TREE
);
2391 fn
= build_fn_decl (name
, fntype
);
2394 narg
= fold_build2_loc (loc
, COMPLEX_EXPR
, ctype
,
2395 build_real (type
, dconst0
), arg
);
2397 /* Make sure not to fold the cexp call again. */
2398 call
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (fn
)), fn
);
2399 return expand_expr (build_call_nary (ctype
, call
, 1, narg
),
2400 target
, VOIDmode
, EXPAND_NORMAL
);
2403 /* Now build the proper return type. */
2404 return expand_expr (build2 (COMPLEX_EXPR
, build_complex_type (type
),
2405 make_tree (TREE_TYPE (arg
), op2
),
2406 make_tree (TREE_TYPE (arg
), op1
)),
2407 target
, VOIDmode
, EXPAND_NORMAL
);
2410 /* Conveniently construct a function call expression. FNDECL names the
2411 function to be called, N is the number of arguments, and the "..."
2412 parameters are the argument expressions. Unlike build_call_exr
2413 this doesn't fold the call, hence it will always return a CALL_EXPR. */
2416 build_call_nofold_loc (location_t loc
, tree fndecl
, int n
, ...)
2419 tree fntype
= TREE_TYPE (fndecl
);
2420 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
2423 fn
= build_call_valist (TREE_TYPE (fntype
), fn
, n
, ap
);
2425 SET_EXPR_LOCATION (fn
, loc
);
2429 /* Expand a call to one of the builtin rounding functions gcc defines
2430 as an extension (lfloor and lceil). As these are gcc extensions we
2431 do not need to worry about setting errno to EDOM.
2432 If expanding via optab fails, lower expression to (int)(floor(x)).
2433 EXP is the expression that is a call to the builtin function;
2434 if convenient, the result should be placed in TARGET. */
2437 expand_builtin_int_roundingfn (tree exp
, rtx target
)
2439 convert_optab builtin_optab
;
2442 tree fndecl
= get_callee_fndecl (exp
);
2443 enum built_in_function fallback_fn
;
2444 tree fallback_fndecl
;
2448 if (!validate_arglist (exp
, REAL_TYPE
, VOID_TYPE
))
2451 arg
= CALL_EXPR_ARG (exp
, 0);
2453 switch (DECL_FUNCTION_CODE (fndecl
))
2455 CASE_FLT_FN (BUILT_IN_ICEIL
):
2456 CASE_FLT_FN (BUILT_IN_LCEIL
):
2457 CASE_FLT_FN (BUILT_IN_LLCEIL
):
2458 builtin_optab
= lceil_optab
;
2459 fallback_fn
= BUILT_IN_CEIL
;
2462 CASE_FLT_FN (BUILT_IN_IFLOOR
):
2463 CASE_FLT_FN (BUILT_IN_LFLOOR
):
2464 CASE_FLT_FN (BUILT_IN_LLFLOOR
):
2465 builtin_optab
= lfloor_optab
;
2466 fallback_fn
= BUILT_IN_FLOOR
;
2473 /* Make a suitable register to place result in. */
2474 mode
= TYPE_MODE (TREE_TYPE (exp
));
2476 target
= gen_reg_rtx (mode
);
2478 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2479 need to expand the argument again. This way, we will not perform
2480 side-effects more the once. */
2481 CALL_EXPR_ARG (exp
, 0) = arg
= builtin_save_expr (arg
);
2483 op0
= expand_expr (arg
, NULL
, VOIDmode
, EXPAND_NORMAL
);
2487 /* Compute into TARGET. */
2488 if (expand_sfix_optab (target
, op0
, builtin_optab
))
2490 /* Output the entire sequence. */
2491 insns
= get_insns ();
2497 /* If we were unable to expand via the builtin, stop the sequence
2498 (without outputting the insns). */
2501 /* Fall back to floating point rounding optab. */
2502 fallback_fndecl
= mathfn_built_in (TREE_TYPE (arg
), fallback_fn
);
2504 /* For non-C99 targets we may end up without a fallback fndecl here
2505 if the user called __builtin_lfloor directly. In this case emit
2506 a call to the floor/ceil variants nevertheless. This should result
2507 in the best user experience for not full C99 targets. */
2508 if (fallback_fndecl
== NULL_TREE
)
2511 const char *name
= NULL
;
2513 switch (DECL_FUNCTION_CODE (fndecl
))
2515 case BUILT_IN_ICEIL
:
2516 case BUILT_IN_LCEIL
:
2517 case BUILT_IN_LLCEIL
:
2520 case BUILT_IN_ICEILF
:
2521 case BUILT_IN_LCEILF
:
2522 case BUILT_IN_LLCEILF
:
2525 case BUILT_IN_ICEILL
:
2526 case BUILT_IN_LCEILL
:
2527 case BUILT_IN_LLCEILL
:
2530 case BUILT_IN_IFLOOR
:
2531 case BUILT_IN_LFLOOR
:
2532 case BUILT_IN_LLFLOOR
:
2535 case BUILT_IN_IFLOORF
:
2536 case BUILT_IN_LFLOORF
:
2537 case BUILT_IN_LLFLOORF
:
2540 case BUILT_IN_IFLOORL
:
2541 case BUILT_IN_LFLOORL
:
2542 case BUILT_IN_LLFLOORL
:
2549 fntype
= build_function_type_list (TREE_TYPE (arg
),
2550 TREE_TYPE (arg
), NULL_TREE
);
2551 fallback_fndecl
= build_fn_decl (name
, fntype
);
2554 exp
= build_call_nofold_loc (EXPR_LOCATION (exp
), fallback_fndecl
, 1, arg
);
2556 tmp
= expand_normal (exp
);
2557 tmp
= maybe_emit_group_store (tmp
, TREE_TYPE (exp
));
2559 /* Truncate the result of floating point optab to integer
2560 via expand_fix (). */
2561 target
= gen_reg_rtx (mode
);
2562 expand_fix (target
, tmp
, 0);
2567 /* Expand a call to one of the builtin math functions doing integer
2569 Return 0 if a normal call should be emitted rather than expanding the
2570 function in-line. EXP is the expression that is a call to the builtin
2571 function; if convenient, the result should be placed in TARGET. */
2574 expand_builtin_int_roundingfn_2 (tree exp
, rtx target
)
2576 convert_optab builtin_optab
;
2579 tree fndecl
= get_callee_fndecl (exp
);
2582 enum built_in_function fallback_fn
= BUILT_IN_NONE
;
2584 if (!validate_arglist (exp
, REAL_TYPE
, VOID_TYPE
))
2587 arg
= CALL_EXPR_ARG (exp
, 0);
2589 switch (DECL_FUNCTION_CODE (fndecl
))
2591 CASE_FLT_FN (BUILT_IN_IRINT
):
2592 fallback_fn
= BUILT_IN_LRINT
;
2594 CASE_FLT_FN (BUILT_IN_LRINT
):
2595 CASE_FLT_FN (BUILT_IN_LLRINT
):
2596 builtin_optab
= lrint_optab
;
2599 CASE_FLT_FN (BUILT_IN_IROUND
):
2600 fallback_fn
= BUILT_IN_LROUND
;
2602 CASE_FLT_FN (BUILT_IN_LROUND
):
2603 CASE_FLT_FN (BUILT_IN_LLROUND
):
2604 builtin_optab
= lround_optab
;
2611 /* There's no easy way to detect the case we need to set EDOM. */
2612 if (flag_errno_math
&& fallback_fn
== BUILT_IN_NONE
)
2615 /* Make a suitable register to place result in. */
2616 mode
= TYPE_MODE (TREE_TYPE (exp
));
2618 /* There's no easy way to detect the case we need to set EDOM. */
2619 if (!flag_errno_math
)
2621 rtx result
= gen_reg_rtx (mode
);
2623 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2624 need to expand the argument again. This way, we will not perform
2625 side-effects more the once. */
2626 CALL_EXPR_ARG (exp
, 0) = arg
= builtin_save_expr (arg
);
2628 op0
= expand_expr (arg
, NULL
, VOIDmode
, EXPAND_NORMAL
);
2632 if (expand_sfix_optab (result
, op0
, builtin_optab
))
2634 /* Output the entire sequence. */
2635 insns
= get_insns ();
2641 /* If we were unable to expand via the builtin, stop the sequence
2642 (without outputting the insns) and call to the library function
2643 with the stabilized argument list. */
2647 if (fallback_fn
!= BUILT_IN_NONE
)
2649 /* Fall back to rounding to long int. Use implicit_p 0 - for non-C99
2650 targets, (int) round (x) should never be transformed into
2651 BUILT_IN_IROUND and if __builtin_iround is called directly, emit
2652 a call to lround in the hope that the target provides at least some
2653 C99 functions. This should result in the best user experience for
2654 not full C99 targets. */
2655 tree fallback_fndecl
= mathfn_built_in_1
2656 (TREE_TYPE (arg
), as_combined_fn (fallback_fn
), 0);
2658 exp
= build_call_nofold_loc (EXPR_LOCATION (exp
),
2659 fallback_fndecl
, 1, arg
);
2661 target
= expand_call (exp
, NULL_RTX
, target
== const0_rtx
);
2662 target
= maybe_emit_group_store (target
, TREE_TYPE (exp
));
2663 return convert_to_mode (mode
, target
, 0);
2666 return expand_call (exp
, target
, target
== const0_rtx
);
2669 /* Expand a call to the powi built-in mathematical function. Return NULL_RTX if
2670 a normal call should be emitted rather than expanding the function
2671 in-line. EXP is the expression that is a call to the builtin
2672 function; if convenient, the result should be placed in TARGET. */
2675 expand_builtin_powi (tree exp
, rtx target
)
2682 if (! validate_arglist (exp
, REAL_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
2685 arg0
= CALL_EXPR_ARG (exp
, 0);
2686 arg1
= CALL_EXPR_ARG (exp
, 1);
2687 mode
= TYPE_MODE (TREE_TYPE (exp
));
2689 /* Emit a libcall to libgcc. */
2691 /* Mode of the 2nd argument must match that of an int. */
2692 mode2
= mode_for_size (INT_TYPE_SIZE
, MODE_INT
, 0);
2694 if (target
== NULL_RTX
)
2695 target
= gen_reg_rtx (mode
);
2697 op0
= expand_expr (arg0
, NULL_RTX
, mode
, EXPAND_NORMAL
);
2698 if (GET_MODE (op0
) != mode
)
2699 op0
= convert_to_mode (mode
, op0
, 0);
2700 op1
= expand_expr (arg1
, NULL_RTX
, mode2
, EXPAND_NORMAL
);
2701 if (GET_MODE (op1
) != mode2
)
2702 op1
= convert_to_mode (mode2
, op1
, 0);
2704 target
= emit_library_call_value (optab_libfunc (powi_optab
, mode
),
2705 target
, LCT_CONST
, mode
, 2,
2706 op0
, mode
, op1
, mode2
);
2711 /* Expand expression EXP which is a call to the strlen builtin. Return
2712 NULL_RTX if we failed the caller should emit a normal call, otherwise
2713 try to get the result in TARGET, if convenient. */
2716 expand_builtin_strlen (tree exp
, rtx target
,
2717 machine_mode target_mode
)
2719 if (!validate_arglist (exp
, POINTER_TYPE
, VOID_TYPE
))
2723 struct expand_operand ops
[4];
2726 tree src
= CALL_EXPR_ARG (exp
, 0);
2728 rtx_insn
*before_strlen
;
2729 machine_mode insn_mode
= target_mode
;
2730 enum insn_code icode
= CODE_FOR_nothing
;
2733 /* If the length can be computed at compile-time, return it. */
2734 len
= c_strlen (src
, 0);
2736 return expand_expr (len
, target
, target_mode
, EXPAND_NORMAL
);
2738 /* If the length can be computed at compile-time and is constant
2739 integer, but there are side-effects in src, evaluate
2740 src for side-effects, then return len.
2741 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
2742 can be optimized into: i++; x = 3; */
2743 len
= c_strlen (src
, 1);
2744 if (len
&& TREE_CODE (len
) == INTEGER_CST
)
2746 expand_expr (src
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
2747 return expand_expr (len
, target
, target_mode
, EXPAND_NORMAL
);
2750 align
= get_pointer_alignment (src
) / BITS_PER_UNIT
;
2752 /* If SRC is not a pointer type, don't do this operation inline. */
2756 /* Bail out if we can't compute strlen in the right mode. */
2757 while (insn_mode
!= VOIDmode
)
2759 icode
= optab_handler (strlen_optab
, insn_mode
);
2760 if (icode
!= CODE_FOR_nothing
)
2763 insn_mode
= GET_MODE_WIDER_MODE (insn_mode
);
2765 if (insn_mode
== VOIDmode
)
2768 /* Make a place to hold the source address. We will not expand
2769 the actual source until we are sure that the expansion will
2770 not fail -- there are trees that cannot be expanded twice. */
2771 src_reg
= gen_reg_rtx (Pmode
);
2773 /* Mark the beginning of the strlen sequence so we can emit the
2774 source operand later. */
2775 before_strlen
= get_last_insn ();
2777 create_output_operand (&ops
[0], target
, insn_mode
);
2778 create_fixed_operand (&ops
[1], gen_rtx_MEM (BLKmode
, src_reg
));
2779 create_integer_operand (&ops
[2], 0);
2780 create_integer_operand (&ops
[3], align
);
2781 if (!maybe_expand_insn (icode
, 4, ops
))
2784 /* Now that we are assured of success, expand the source. */
2786 pat
= expand_expr (src
, src_reg
, Pmode
, EXPAND_NORMAL
);
2789 #ifdef POINTERS_EXTEND_UNSIGNED
2790 if (GET_MODE (pat
) != Pmode
)
2791 pat
= convert_to_mode (Pmode
, pat
,
2792 POINTERS_EXTEND_UNSIGNED
);
2794 emit_move_insn (src_reg
, pat
);
2800 emit_insn_after (pat
, before_strlen
);
2802 emit_insn_before (pat
, get_insns ());
2804 /* Return the value in the proper mode for this function. */
2805 if (GET_MODE (ops
[0].value
) == target_mode
)
2806 target
= ops
[0].value
;
2807 else if (target
!= 0)
2808 convert_move (target
, ops
[0].value
, 0);
2810 target
= convert_to_mode (target_mode
, ops
[0].value
, 0);
2816 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
2817 bytes from constant string DATA + OFFSET and return it as target
2821 builtin_memcpy_read_str (void *data
, HOST_WIDE_INT offset
,
2824 const char *str
= (const char *) data
;
2826 gcc_assert (offset
>= 0
2827 && ((unsigned HOST_WIDE_INT
) offset
+ GET_MODE_SIZE (mode
)
2828 <= strlen (str
) + 1));
2830 return c_readstr (str
+ offset
, mode
);
2833 /* LEN specify length of the block of memcpy/memset operation.
2834 Figure out its range and put it into MIN_SIZE/MAX_SIZE.
2835 In some cases we can make very likely guess on max size, then we
2836 set it into PROBABLE_MAX_SIZE. */
2839 determine_block_size (tree len
, rtx len_rtx
,
2840 unsigned HOST_WIDE_INT
*min_size
,
2841 unsigned HOST_WIDE_INT
*max_size
,
2842 unsigned HOST_WIDE_INT
*probable_max_size
)
2844 if (CONST_INT_P (len_rtx
))
2846 *min_size
= *max_size
= *probable_max_size
= UINTVAL (len_rtx
);
2852 enum value_range_type range_type
= VR_UNDEFINED
;
2854 /* Determine bounds from the type. */
2855 if (tree_fits_uhwi_p (TYPE_MIN_VALUE (TREE_TYPE (len
))))
2856 *min_size
= tree_to_uhwi (TYPE_MIN_VALUE (TREE_TYPE (len
)));
2859 if (tree_fits_uhwi_p (TYPE_MAX_VALUE (TREE_TYPE (len
))))
2860 *probable_max_size
= *max_size
2861 = tree_to_uhwi (TYPE_MAX_VALUE (TREE_TYPE (len
)));
2863 *probable_max_size
= *max_size
= GET_MODE_MASK (GET_MODE (len_rtx
));
2865 if (TREE_CODE (len
) == SSA_NAME
)
2866 range_type
= get_range_info (len
, &min
, &max
);
2867 if (range_type
== VR_RANGE
)
2869 if (wi::fits_uhwi_p (min
) && *min_size
< min
.to_uhwi ())
2870 *min_size
= min
.to_uhwi ();
2871 if (wi::fits_uhwi_p (max
) && *max_size
> max
.to_uhwi ())
2872 *probable_max_size
= *max_size
= max
.to_uhwi ();
2874 else if (range_type
== VR_ANTI_RANGE
)
2876 /* Anti range 0...N lets us to determine minimal size to N+1. */
2879 if (wi::fits_uhwi_p (max
) && max
.to_uhwi () + 1 != 0)
2880 *min_size
= max
.to_uhwi () + 1;
2888 Produce anti range allowing negative values of N. We still
2889 can use the information and make a guess that N is not negative.
2891 else if (!wi::leu_p (max
, 1 << 30) && wi::fits_uhwi_p (min
))
2892 *probable_max_size
= min
.to_uhwi () - 1;
2895 gcc_checking_assert (*max_size
<=
2896 (unsigned HOST_WIDE_INT
)
2897 GET_MODE_MASK (GET_MODE (len_rtx
)));
2900 /* Helper function to do the actual work for expand_builtin_memcpy. */
2903 expand_builtin_memcpy_args (tree dest
, tree src
, tree len
, rtx target
, tree exp
)
2905 const char *src_str
;
2906 unsigned int src_align
= get_pointer_alignment (src
);
2907 unsigned int dest_align
= get_pointer_alignment (dest
);
2908 rtx dest_mem
, src_mem
, dest_addr
, len_rtx
;
2909 HOST_WIDE_INT expected_size
= -1;
2910 unsigned int expected_align
= 0;
2911 unsigned HOST_WIDE_INT min_size
;
2912 unsigned HOST_WIDE_INT max_size
;
2913 unsigned HOST_WIDE_INT probable_max_size
;
2915 /* If DEST is not a pointer type, call the normal function. */
2916 if (dest_align
== 0)
2919 /* If either SRC is not a pointer type, don't do this
2920 operation in-line. */
2924 if (currently_expanding_gimple_stmt
)
2925 stringop_block_profile (currently_expanding_gimple_stmt
,
2926 &expected_align
, &expected_size
);
2928 if (expected_align
< dest_align
)
2929 expected_align
= dest_align
;
2930 dest_mem
= get_memory_rtx (dest
, len
);
2931 set_mem_align (dest_mem
, dest_align
);
2932 len_rtx
= expand_normal (len
);
2933 determine_block_size (len
, len_rtx
, &min_size
, &max_size
,
2934 &probable_max_size
);
2935 src_str
= c_getstr (src
);
2937 /* If SRC is a string constant and block move would be done
2938 by pieces, we can avoid loading the string from memory
2939 and only stored the computed constants. */
2941 && CONST_INT_P (len_rtx
)
2942 && (unsigned HOST_WIDE_INT
) INTVAL (len_rtx
) <= strlen (src_str
) + 1
2943 && can_store_by_pieces (INTVAL (len_rtx
), builtin_memcpy_read_str
,
2944 CONST_CAST (char *, src_str
),
2947 dest_mem
= store_by_pieces (dest_mem
, INTVAL (len_rtx
),
2948 builtin_memcpy_read_str
,
2949 CONST_CAST (char *, src_str
),
2950 dest_align
, false, 0);
2951 dest_mem
= force_operand (XEXP (dest_mem
, 0), target
);
2952 dest_mem
= convert_memory_address (ptr_mode
, dest_mem
);
2956 src_mem
= get_memory_rtx (src
, len
);
2957 set_mem_align (src_mem
, src_align
);
2959 /* Copy word part most expediently. */
2960 dest_addr
= emit_block_move_hints (dest_mem
, src_mem
, len_rtx
,
2961 CALL_EXPR_TAILCALL (exp
)
2962 ? BLOCK_OP_TAILCALL
: BLOCK_OP_NORMAL
,
2963 expected_align
, expected_size
,
2964 min_size
, max_size
, probable_max_size
);
2968 dest_addr
= force_operand (XEXP (dest_mem
, 0), target
);
2969 dest_addr
= convert_memory_address (ptr_mode
, dest_addr
);
2975 /* Expand a call EXP to the memcpy builtin.
2976 Return NULL_RTX if we failed, the caller should emit a normal call,
2977 otherwise try to get the result in TARGET, if convenient (and in
2978 mode MODE if that's convenient). */
2981 expand_builtin_memcpy (tree exp
, rtx target
)
2983 if (!validate_arglist (exp
,
2984 POINTER_TYPE
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
2988 tree dest
= CALL_EXPR_ARG (exp
, 0);
2989 tree src
= CALL_EXPR_ARG (exp
, 1);
2990 tree len
= CALL_EXPR_ARG (exp
, 2);
2991 return expand_builtin_memcpy_args (dest
, src
, len
, target
, exp
);
2995 /* Expand an instrumented call EXP to the memcpy builtin.
2996 Return NULL_RTX if we failed, the caller should emit a normal call,
2997 otherwise try to get the result in TARGET, if convenient (and in
2998 mode MODE if that's convenient). */
3001 expand_builtin_memcpy_with_bounds (tree exp
, rtx target
)
3003 if (!validate_arglist (exp
,
3004 POINTER_TYPE
, POINTER_BOUNDS_TYPE
,
3005 POINTER_TYPE
, POINTER_BOUNDS_TYPE
,
3006 INTEGER_TYPE
, VOID_TYPE
))
3010 tree dest
= CALL_EXPR_ARG (exp
, 0);
3011 tree src
= CALL_EXPR_ARG (exp
, 2);
3012 tree len
= CALL_EXPR_ARG (exp
, 4);
3013 rtx res
= expand_builtin_memcpy_args (dest
, src
, len
, target
, exp
);
3015 /* Return src bounds with the result. */
3018 rtx bnd
= force_reg (targetm
.chkp_bound_mode (),
3019 expand_normal (CALL_EXPR_ARG (exp
, 1)));
3020 res
= chkp_join_splitted_slot (res
, bnd
);
3026 /* Expand a call EXP to the mempcpy builtin.
3027 Return NULL_RTX if we failed; the caller should emit a normal call,
3028 otherwise try to get the result in TARGET, if convenient (and in
3029 mode MODE if that's convenient). If ENDP is 0 return the
3030 destination pointer, if ENDP is 1 return the end pointer ala
3031 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3035 expand_builtin_mempcpy (tree exp
, rtx target
, machine_mode mode
)
3037 if (!validate_arglist (exp
,
3038 POINTER_TYPE
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
3042 tree dest
= CALL_EXPR_ARG (exp
, 0);
3043 tree src
= CALL_EXPR_ARG (exp
, 1);
3044 tree len
= CALL_EXPR_ARG (exp
, 2);
3045 return expand_builtin_mempcpy_args (dest
, src
, len
,
3046 target
, mode
, /*endp=*/ 1,
3051 /* Expand an instrumented call EXP to the mempcpy builtin.
3052 Return NULL_RTX if we failed, the caller should emit a normal call,
3053 otherwise try to get the result in TARGET, if convenient (and in
3054 mode MODE if that's convenient). */
3057 expand_builtin_mempcpy_with_bounds (tree exp
, rtx target
, machine_mode mode
)
3059 if (!validate_arglist (exp
,
3060 POINTER_TYPE
, POINTER_BOUNDS_TYPE
,
3061 POINTER_TYPE
, POINTER_BOUNDS_TYPE
,
3062 INTEGER_TYPE
, VOID_TYPE
))
3066 tree dest
= CALL_EXPR_ARG (exp
, 0);
3067 tree src
= CALL_EXPR_ARG (exp
, 2);
3068 tree len
= CALL_EXPR_ARG (exp
, 4);
3069 rtx res
= expand_builtin_mempcpy_args (dest
, src
, len
, target
,
3072 /* Return src bounds with the result. */
3075 rtx bnd
= force_reg (targetm
.chkp_bound_mode (),
3076 expand_normal (CALL_EXPR_ARG (exp
, 1)));
3077 res
= chkp_join_splitted_slot (res
, bnd
);
3083 /* Helper function to do the actual work for expand_builtin_mempcpy. The
3084 arguments to the builtin_mempcpy call DEST, SRC, and LEN are broken out
3085 so that this can also be called without constructing an actual CALL_EXPR.
3086 The other arguments and return value are the same as for
3087 expand_builtin_mempcpy. */
3090 expand_builtin_mempcpy_args (tree dest
, tree src
, tree len
,
3091 rtx target
, machine_mode mode
, int endp
,
3094 tree fndecl
= get_callee_fndecl (orig_exp
);
3096 /* If return value is ignored, transform mempcpy into memcpy. */
3097 if (target
== const0_rtx
3098 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CHKP_MEMPCPY_NOBND_NOCHK_CHKP
3099 && builtin_decl_implicit_p (BUILT_IN_CHKP_MEMCPY_NOBND_NOCHK_CHKP
))
3101 tree fn
= builtin_decl_implicit (BUILT_IN_CHKP_MEMCPY_NOBND_NOCHK_CHKP
);
3102 tree result
= build_call_nofold_loc (UNKNOWN_LOCATION
, fn
, 3,
3104 return expand_expr (result
, target
, mode
, EXPAND_NORMAL
);
3106 else if (target
== const0_rtx
3107 && builtin_decl_implicit_p (BUILT_IN_MEMCPY
))
3109 tree fn
= builtin_decl_implicit (BUILT_IN_MEMCPY
);
3110 tree result
= build_call_nofold_loc (UNKNOWN_LOCATION
, fn
, 3,
3112 return expand_expr (result
, target
, mode
, EXPAND_NORMAL
);
3116 const char *src_str
;
3117 unsigned int src_align
= get_pointer_alignment (src
);
3118 unsigned int dest_align
= get_pointer_alignment (dest
);
3119 rtx dest_mem
, src_mem
, len_rtx
;
3121 /* If either SRC or DEST is not a pointer type, don't do this
3122 operation in-line. */
3123 if (dest_align
== 0 || src_align
== 0)
3126 /* If LEN is not constant, call the normal function. */
3127 if (! tree_fits_uhwi_p (len
))
3130 len_rtx
= expand_normal (len
);
3131 src_str
= c_getstr (src
);
3133 /* If SRC is a string constant and block move would be done
3134 by pieces, we can avoid loading the string from memory
3135 and only stored the computed constants. */
3137 && CONST_INT_P (len_rtx
)
3138 && (unsigned HOST_WIDE_INT
) INTVAL (len_rtx
) <= strlen (src_str
) + 1
3139 && can_store_by_pieces (INTVAL (len_rtx
), builtin_memcpy_read_str
,
3140 CONST_CAST (char *, src_str
),
3143 dest_mem
= get_memory_rtx (dest
, len
);
3144 set_mem_align (dest_mem
, dest_align
);
3145 dest_mem
= store_by_pieces (dest_mem
, INTVAL (len_rtx
),
3146 builtin_memcpy_read_str
,
3147 CONST_CAST (char *, src_str
),
3148 dest_align
, false, endp
);
3149 dest_mem
= force_operand (XEXP (dest_mem
, 0), NULL_RTX
);
3150 dest_mem
= convert_memory_address (ptr_mode
, dest_mem
);
3154 if (CONST_INT_P (len_rtx
)
3155 && can_move_by_pieces (INTVAL (len_rtx
),
3156 MIN (dest_align
, src_align
)))
3158 dest_mem
= get_memory_rtx (dest
, len
);
3159 set_mem_align (dest_mem
, dest_align
);
3160 src_mem
= get_memory_rtx (src
, len
);
3161 set_mem_align (src_mem
, src_align
);
3162 dest_mem
= move_by_pieces (dest_mem
, src_mem
, INTVAL (len_rtx
),
3163 MIN (dest_align
, src_align
), endp
);
3164 dest_mem
= force_operand (XEXP (dest_mem
, 0), NULL_RTX
);
3165 dest_mem
= convert_memory_address (ptr_mode
, dest_mem
);
3173 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
3174 we failed, the caller should emit a normal call, otherwise try to
3175 get the result in TARGET, if convenient. If ENDP is 0 return the
3176 destination pointer, if ENDP is 1 return the end pointer ala
3177 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3181 expand_movstr (tree dest
, tree src
, rtx target
, int endp
)
3183 struct expand_operand ops
[3];
3187 if (!targetm
.have_movstr ())
3190 dest_mem
= get_memory_rtx (dest
, NULL
);
3191 src_mem
= get_memory_rtx (src
, NULL
);
3194 target
= force_reg (Pmode
, XEXP (dest_mem
, 0));
3195 dest_mem
= replace_equiv_address (dest_mem
, target
);
3198 create_output_operand (&ops
[0], endp
? target
: NULL_RTX
, Pmode
);
3199 create_fixed_operand (&ops
[1], dest_mem
);
3200 create_fixed_operand (&ops
[2], src_mem
);
3201 if (!maybe_expand_insn (targetm
.code_for_movstr
, 3, ops
))
3204 if (endp
&& target
!= const0_rtx
)
3206 target
= ops
[0].value
;
3207 /* movstr is supposed to set end to the address of the NUL
3208 terminator. If the caller requested a mempcpy-like return value,
3212 rtx tem
= plus_constant (GET_MODE (target
),
3213 gen_lowpart (GET_MODE (target
), target
), 1);
3214 emit_move_insn (target
, force_operand (tem
, NULL_RTX
));
3220 /* Expand expression EXP, which is a call to the strcpy builtin. Return
3221 NULL_RTX if we failed the caller should emit a normal call, otherwise
3222 try to get the result in TARGET, if convenient (and in mode MODE if that's
3226 expand_builtin_strcpy (tree exp
, rtx target
)
3228 if (validate_arglist (exp
, POINTER_TYPE
, POINTER_TYPE
, VOID_TYPE
))
3230 tree dest
= CALL_EXPR_ARG (exp
, 0);
3231 tree src
= CALL_EXPR_ARG (exp
, 1);
3232 return expand_builtin_strcpy_args (dest
, src
, target
);
3237 /* Helper function to do the actual work for expand_builtin_strcpy. The
3238 arguments to the builtin_strcpy call DEST and SRC are broken out
3239 so that this can also be called without constructing an actual CALL_EXPR.
3240 The other arguments and return value are the same as for
3241 expand_builtin_strcpy. */
3244 expand_builtin_strcpy_args (tree dest
, tree src
, rtx target
)
3246 return expand_movstr (dest
, src
, target
, /*endp=*/0);
3249 /* Expand a call EXP to the stpcpy builtin.
3250 Return NULL_RTX if we failed the caller should emit a normal call,
3251 otherwise try to get the result in TARGET, if convenient (and in
3252 mode MODE if that's convenient). */
3255 expand_builtin_stpcpy (tree exp
, rtx target
, machine_mode mode
)
3258 location_t loc
= EXPR_LOCATION (exp
);
3260 if (!validate_arglist (exp
, POINTER_TYPE
, POINTER_TYPE
, VOID_TYPE
))
3263 dst
= CALL_EXPR_ARG (exp
, 0);
3264 src
= CALL_EXPR_ARG (exp
, 1);
3266 /* If return value is ignored, transform stpcpy into strcpy. */
3267 if (target
== const0_rtx
&& builtin_decl_implicit (BUILT_IN_STRCPY
))
3269 tree fn
= builtin_decl_implicit (BUILT_IN_STRCPY
);
3270 tree result
= build_call_nofold_loc (loc
, fn
, 2, dst
, src
);
3271 return expand_expr (result
, target
, mode
, EXPAND_NORMAL
);
3278 /* Ensure we get an actual string whose length can be evaluated at
3279 compile-time, not an expression containing a string. This is
3280 because the latter will potentially produce pessimized code
3281 when used to produce the return value. */
3282 if (! c_getstr (src
) || ! (len
= c_strlen (src
, 0)))
3283 return expand_movstr (dst
, src
, target
, /*endp=*/2);
3285 lenp1
= size_binop_loc (loc
, PLUS_EXPR
, len
, ssize_int (1));
3286 ret
= expand_builtin_mempcpy_args (dst
, src
, lenp1
,
3287 target
, mode
, /*endp=*/2,
3293 if (TREE_CODE (len
) == INTEGER_CST
)
3295 rtx len_rtx
= expand_normal (len
);
3297 if (CONST_INT_P (len_rtx
))
3299 ret
= expand_builtin_strcpy_args (dst
, src
, target
);
3305 if (mode
!= VOIDmode
)
3306 target
= gen_reg_rtx (mode
);
3308 target
= gen_reg_rtx (GET_MODE (ret
));
3310 if (GET_MODE (target
) != GET_MODE (ret
))
3311 ret
= gen_lowpart (GET_MODE (target
), ret
);
3313 ret
= plus_constant (GET_MODE (ret
), ret
, INTVAL (len_rtx
));
3314 ret
= emit_move_insn (target
, force_operand (ret
, NULL_RTX
));
3322 return expand_movstr (dst
, src
, target
, /*endp=*/2);
3326 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3327 bytes from constant string DATA + OFFSET and return it as target
3331 builtin_strncpy_read_str (void *data
, HOST_WIDE_INT offset
,
3334 const char *str
= (const char *) data
;
3336 if ((unsigned HOST_WIDE_INT
) offset
> strlen (str
))
3339 return c_readstr (str
+ offset
, mode
);
3342 /* Expand expression EXP, which is a call to the strncpy builtin. Return
3343 NULL_RTX if we failed the caller should emit a normal call. */
3346 expand_builtin_strncpy (tree exp
, rtx target
)
3348 location_t loc
= EXPR_LOCATION (exp
);
3350 if (validate_arglist (exp
,
3351 POINTER_TYPE
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
3353 tree dest
= CALL_EXPR_ARG (exp
, 0);
3354 tree src
= CALL_EXPR_ARG (exp
, 1);
3355 tree len
= CALL_EXPR_ARG (exp
, 2);
3356 tree slen
= c_strlen (src
, 1);
3358 /* We must be passed a constant len and src parameter. */
3359 if (!tree_fits_uhwi_p (len
) || !slen
|| !tree_fits_uhwi_p (slen
))
3362 slen
= size_binop_loc (loc
, PLUS_EXPR
, slen
, ssize_int (1));
3364 /* We're required to pad with trailing zeros if the requested
3365 len is greater than strlen(s2)+1. In that case try to
3366 use store_by_pieces, if it fails, punt. */
3367 if (tree_int_cst_lt (slen
, len
))
3369 unsigned int dest_align
= get_pointer_alignment (dest
);
3370 const char *p
= c_getstr (src
);
3373 if (!p
|| dest_align
== 0 || !tree_fits_uhwi_p (len
)
3374 || !can_store_by_pieces (tree_to_uhwi (len
),
3375 builtin_strncpy_read_str
,
3376 CONST_CAST (char *, p
),
3380 dest_mem
= get_memory_rtx (dest
, len
);
3381 store_by_pieces (dest_mem
, tree_to_uhwi (len
),
3382 builtin_strncpy_read_str
,
3383 CONST_CAST (char *, p
), dest_align
, false, 0);
3384 dest_mem
= force_operand (XEXP (dest_mem
, 0), target
);
3385 dest_mem
= convert_memory_address (ptr_mode
, dest_mem
);
3392 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3393 bytes from constant string DATA + OFFSET and return it as target
3397 builtin_memset_read_str (void *data
, HOST_WIDE_INT offset ATTRIBUTE_UNUSED
,
3400 const char *c
= (const char *) data
;
3401 char *p
= XALLOCAVEC (char, GET_MODE_SIZE (mode
));
3403 memset (p
, *c
, GET_MODE_SIZE (mode
));
3405 return c_readstr (p
, mode
);
3408 /* Callback routine for store_by_pieces. Return the RTL of a register
3409 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
3410 char value given in the RTL register data. For example, if mode is
3411 4 bytes wide, return the RTL for 0x01010101*data. */
3414 builtin_memset_gen_str (void *data
, HOST_WIDE_INT offset ATTRIBUTE_UNUSED
,
3421 size
= GET_MODE_SIZE (mode
);
3425 p
= XALLOCAVEC (char, size
);
3426 memset (p
, 1, size
);
3427 coeff
= c_readstr (p
, mode
);
3429 target
= convert_to_mode (mode
, (rtx
) data
, 1);
3430 target
= expand_mult (mode
, target
, coeff
, NULL_RTX
, 1);
3431 return force_reg (mode
, target
);
3434 /* Expand expression EXP, which is a call to the memset builtin. Return
3435 NULL_RTX if we failed the caller should emit a normal call, otherwise
3436 try to get the result in TARGET, if convenient (and in mode MODE if that's
3440 expand_builtin_memset (tree exp
, rtx target
, machine_mode mode
)
3442 if (!validate_arglist (exp
,
3443 POINTER_TYPE
, INTEGER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
3447 tree dest
= CALL_EXPR_ARG (exp
, 0);
3448 tree val
= CALL_EXPR_ARG (exp
, 1);
3449 tree len
= CALL_EXPR_ARG (exp
, 2);
3450 return expand_builtin_memset_args (dest
, val
, len
, target
, mode
, exp
);
3454 /* Expand expression EXP, which is an instrumented call to the memset builtin.
3455 Return NULL_RTX if we failed the caller should emit a normal call, otherwise
3456 try to get the result in TARGET, if convenient (and in mode MODE if that's
3460 expand_builtin_memset_with_bounds (tree exp
, rtx target
, machine_mode mode
)
3462 if (!validate_arglist (exp
,
3463 POINTER_TYPE
, POINTER_BOUNDS_TYPE
,
3464 INTEGER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
3468 tree dest
= CALL_EXPR_ARG (exp
, 0);
3469 tree val
= CALL_EXPR_ARG (exp
, 2);
3470 tree len
= CALL_EXPR_ARG (exp
, 3);
3471 rtx res
= expand_builtin_memset_args (dest
, val
, len
, target
, mode
, exp
);
3473 /* Return src bounds with the result. */
3476 rtx bnd
= force_reg (targetm
.chkp_bound_mode (),
3477 expand_normal (CALL_EXPR_ARG (exp
, 1)));
3478 res
= chkp_join_splitted_slot (res
, bnd
);
3484 /* Helper function to do the actual work for expand_builtin_memset. The
3485 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
3486 so that this can also be called without constructing an actual CALL_EXPR.
3487 The other arguments and return value are the same as for
3488 expand_builtin_memset. */
3491 expand_builtin_memset_args (tree dest
, tree val
, tree len
,
3492 rtx target
, machine_mode mode
, tree orig_exp
)
3495 enum built_in_function fcode
;
3496 machine_mode val_mode
;
3498 unsigned int dest_align
;
3499 rtx dest_mem
, dest_addr
, len_rtx
;
3500 HOST_WIDE_INT expected_size
= -1;
3501 unsigned int expected_align
= 0;
3502 unsigned HOST_WIDE_INT min_size
;
3503 unsigned HOST_WIDE_INT max_size
;
3504 unsigned HOST_WIDE_INT probable_max_size
;
3506 dest_align
= get_pointer_alignment (dest
);
3508 /* If DEST is not a pointer type, don't do this operation in-line. */
3509 if (dest_align
== 0)
3512 if (currently_expanding_gimple_stmt
)
3513 stringop_block_profile (currently_expanding_gimple_stmt
,
3514 &expected_align
, &expected_size
);
3516 if (expected_align
< dest_align
)
3517 expected_align
= dest_align
;
3519 /* If the LEN parameter is zero, return DEST. */
3520 if (integer_zerop (len
))
3522 /* Evaluate and ignore VAL in case it has side-effects. */
3523 expand_expr (val
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
3524 return expand_expr (dest
, target
, mode
, EXPAND_NORMAL
);
3527 /* Stabilize the arguments in case we fail. */
3528 dest
= builtin_save_expr (dest
);
3529 val
= builtin_save_expr (val
);
3530 len
= builtin_save_expr (len
);
3532 len_rtx
= expand_normal (len
);
3533 determine_block_size (len
, len_rtx
, &min_size
, &max_size
,
3534 &probable_max_size
);
3535 dest_mem
= get_memory_rtx (dest
, len
);
3536 val_mode
= TYPE_MODE (unsigned_char_type_node
);
3538 if (TREE_CODE (val
) != INTEGER_CST
)
3542 val_rtx
= expand_normal (val
);
3543 val_rtx
= convert_to_mode (val_mode
, val_rtx
, 0);
3545 /* Assume that we can memset by pieces if we can store
3546 * the coefficients by pieces (in the required modes).
3547 * We can't pass builtin_memset_gen_str as that emits RTL. */
3549 if (tree_fits_uhwi_p (len
)
3550 && can_store_by_pieces (tree_to_uhwi (len
),
3551 builtin_memset_read_str
, &c
, dest_align
,
3554 val_rtx
= force_reg (val_mode
, val_rtx
);
3555 store_by_pieces (dest_mem
, tree_to_uhwi (len
),
3556 builtin_memset_gen_str
, val_rtx
, dest_align
,
3559 else if (!set_storage_via_setmem (dest_mem
, len_rtx
, val_rtx
,
3560 dest_align
, expected_align
,
3561 expected_size
, min_size
, max_size
,
3565 dest_mem
= force_operand (XEXP (dest_mem
, 0), NULL_RTX
);
3566 dest_mem
= convert_memory_address (ptr_mode
, dest_mem
);
3570 if (target_char_cast (val
, &c
))
3575 if (tree_fits_uhwi_p (len
)
3576 && can_store_by_pieces (tree_to_uhwi (len
),
3577 builtin_memset_read_str
, &c
, dest_align
,
3579 store_by_pieces (dest_mem
, tree_to_uhwi (len
),
3580 builtin_memset_read_str
, &c
, dest_align
, true, 0);
3581 else if (!set_storage_via_setmem (dest_mem
, len_rtx
,
3582 gen_int_mode (c
, val_mode
),
3583 dest_align
, expected_align
,
3584 expected_size
, min_size
, max_size
,
3588 dest_mem
= force_operand (XEXP (dest_mem
, 0), NULL_RTX
);
3589 dest_mem
= convert_memory_address (ptr_mode
, dest_mem
);
3593 set_mem_align (dest_mem
, dest_align
);
3594 dest_addr
= clear_storage_hints (dest_mem
, len_rtx
,
3595 CALL_EXPR_TAILCALL (orig_exp
)
3596 ? BLOCK_OP_TAILCALL
: BLOCK_OP_NORMAL
,
3597 expected_align
, expected_size
,
3603 dest_addr
= force_operand (XEXP (dest_mem
, 0), NULL_RTX
);
3604 dest_addr
= convert_memory_address (ptr_mode
, dest_addr
);
3610 fndecl
= get_callee_fndecl (orig_exp
);
3611 fcode
= DECL_FUNCTION_CODE (fndecl
);
3612 if (fcode
== BUILT_IN_MEMSET
3613 || fcode
== BUILT_IN_CHKP_MEMSET_NOBND_NOCHK_CHKP
)
3614 fn
= build_call_nofold_loc (EXPR_LOCATION (orig_exp
), fndecl
, 3,
3616 else if (fcode
== BUILT_IN_BZERO
)
3617 fn
= build_call_nofold_loc (EXPR_LOCATION (orig_exp
), fndecl
, 2,
3621 gcc_assert (TREE_CODE (fn
) == CALL_EXPR
);
3622 CALL_EXPR_TAILCALL (fn
) = CALL_EXPR_TAILCALL (orig_exp
);
3623 return expand_call (fn
, target
, target
== const0_rtx
);
3626 /* Expand expression EXP, which is a call to the bzero builtin. Return
3627 NULL_RTX if we failed the caller should emit a normal call. */
3630 expand_builtin_bzero (tree exp
)
3633 location_t loc
= EXPR_LOCATION (exp
);
3635 if (!validate_arglist (exp
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
3638 dest
= CALL_EXPR_ARG (exp
, 0);
3639 size
= CALL_EXPR_ARG (exp
, 1);
3641 /* New argument list transforming bzero(ptr x, int y) to
3642 memset(ptr x, int 0, size_t y). This is done this way
3643 so that if it isn't expanded inline, we fallback to
3644 calling bzero instead of memset. */
3646 return expand_builtin_memset_args (dest
, integer_zero_node
,
3647 fold_convert_loc (loc
,
3648 size_type_node
, size
),
3649 const0_rtx
, VOIDmode
, exp
);
3652 /* Try to expand cmpstr operation ICODE with the given operands.
3653 Return the result rtx on success, otherwise return null. */
3656 expand_cmpstr (insn_code icode
, rtx target
, rtx arg1_rtx
, rtx arg2_rtx
,
3657 HOST_WIDE_INT align
)
3659 machine_mode insn_mode
= insn_data
[icode
].operand
[0].mode
;
3661 if (target
&& (!REG_P (target
) || HARD_REGISTER_P (target
)))
3664 struct expand_operand ops
[4];
3665 create_output_operand (&ops
[0], target
, insn_mode
);
3666 create_fixed_operand (&ops
[1], arg1_rtx
);
3667 create_fixed_operand (&ops
[2], arg2_rtx
);
3668 create_integer_operand (&ops
[3], align
);
3669 if (maybe_expand_insn (icode
, 4, ops
))
3670 return ops
[0].value
;
3674 /* Try to expand cmpstrn or cmpmem operation ICODE with the given operands.
3675 ARG3_TYPE is the type of ARG3_RTX. Return the result rtx on success,
3676 otherwise return null. */
3679 expand_cmpstrn_or_cmpmem (insn_code icode
, rtx target
, rtx arg1_rtx
,
3680 rtx arg2_rtx
, tree arg3_type
, rtx arg3_rtx
,
3681 HOST_WIDE_INT align
)
3683 machine_mode insn_mode
= insn_data
[icode
].operand
[0].mode
;
3685 if (target
&& (!REG_P (target
) || HARD_REGISTER_P (target
)))
3688 struct expand_operand ops
[5];
3689 create_output_operand (&ops
[0], target
, insn_mode
);
3690 create_fixed_operand (&ops
[1], arg1_rtx
);
3691 create_fixed_operand (&ops
[2], arg2_rtx
);
3692 create_convert_operand_from (&ops
[3], arg3_rtx
, TYPE_MODE (arg3_type
),
3693 TYPE_UNSIGNED (arg3_type
));
3694 create_integer_operand (&ops
[4], align
);
3695 if (maybe_expand_insn (icode
, 5, ops
))
3696 return ops
[0].value
;
3700 /* Expand expression EXP, which is a call to the memcmp built-in function.
3701 Return NULL_RTX if we failed and the caller should emit a normal call,
3702 otherwise try to get the result in TARGET, if convenient. */
3705 expand_builtin_memcmp (tree exp
, rtx target
)
3707 if (!validate_arglist (exp
,
3708 POINTER_TYPE
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
3711 /* Note: The cmpstrnsi pattern, if it exists, is not suitable for
3712 implementing memcmp because it will stop if it encounters two
3714 insn_code icode
= direct_optab_handler (cmpmem_optab
, SImode
);
3715 if (icode
== CODE_FOR_nothing
)
3718 tree arg1
= CALL_EXPR_ARG (exp
, 0);
3719 tree arg2
= CALL_EXPR_ARG (exp
, 1);
3720 tree len
= CALL_EXPR_ARG (exp
, 2);
3722 unsigned int arg1_align
= get_pointer_alignment (arg1
) / BITS_PER_UNIT
;
3723 unsigned int arg2_align
= get_pointer_alignment (arg2
) / BITS_PER_UNIT
;
3725 /* If we don't have POINTER_TYPE, call the function. */
3726 if (arg1_align
== 0 || arg2_align
== 0)
3729 machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
3730 location_t loc
= EXPR_LOCATION (exp
);
3731 rtx arg1_rtx
= get_memory_rtx (arg1
, len
);
3732 rtx arg2_rtx
= get_memory_rtx (arg2
, len
);
3733 rtx arg3_rtx
= expand_normal (fold_convert_loc (loc
, sizetype
, len
));
3735 /* Set MEM_SIZE as appropriate. */
3736 if (CONST_INT_P (arg3_rtx
))
3738 set_mem_size (arg1_rtx
, INTVAL (arg3_rtx
));
3739 set_mem_size (arg2_rtx
, INTVAL (arg3_rtx
));
3742 rtx result
= expand_cmpstrn_or_cmpmem (icode
, target
, arg1_rtx
, arg2_rtx
,
3743 TREE_TYPE (len
), arg3_rtx
,
3744 MIN (arg1_align
, arg2_align
));
3747 /* Return the value in the proper mode for this function. */
3748 if (GET_MODE (result
) == mode
)
3753 convert_move (target
, result
, 0);
3757 return convert_to_mode (mode
, result
, 0);
3762 && REG_P (result
) && GET_MODE (result
) == mode
3763 && REGNO (result
) >= FIRST_PSEUDO_REGISTER
))
3764 result
= gen_reg_rtx (mode
);
3766 emit_library_call_value (memcmp_libfunc
, result
, LCT_PURE
,
3767 TYPE_MODE (integer_type_node
), 3,
3768 XEXP (arg1_rtx
, 0), Pmode
,
3769 XEXP (arg2_rtx
, 0), Pmode
,
3770 convert_to_mode (TYPE_MODE (sizetype
), arg3_rtx
,
3771 TYPE_UNSIGNED (sizetype
)),
3772 TYPE_MODE (sizetype
));
3776 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
3777 if we failed the caller should emit a normal call, otherwise try to get
3778 the result in TARGET, if convenient. */
3781 expand_builtin_strcmp (tree exp
, ATTRIBUTE_UNUSED rtx target
)
3783 if (!validate_arglist (exp
, POINTER_TYPE
, POINTER_TYPE
, VOID_TYPE
))
3786 insn_code cmpstr_icode
= direct_optab_handler (cmpstr_optab
, SImode
);
3787 insn_code cmpstrn_icode
= direct_optab_handler (cmpstrn_optab
, SImode
);
3788 if (cmpstr_icode
!= CODE_FOR_nothing
|| cmpstrn_icode
!= CODE_FOR_nothing
)
3790 rtx arg1_rtx
, arg2_rtx
;
3792 tree arg1
= CALL_EXPR_ARG (exp
, 0);
3793 tree arg2
= CALL_EXPR_ARG (exp
, 1);
3794 rtx result
= NULL_RTX
;
3796 unsigned int arg1_align
= get_pointer_alignment (arg1
) / BITS_PER_UNIT
;
3797 unsigned int arg2_align
= get_pointer_alignment (arg2
) / BITS_PER_UNIT
;
3799 /* If we don't have POINTER_TYPE, call the function. */
3800 if (arg1_align
== 0 || arg2_align
== 0)
3803 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
3804 arg1
= builtin_save_expr (arg1
);
3805 arg2
= builtin_save_expr (arg2
);
3807 arg1_rtx
= get_memory_rtx (arg1
, NULL
);
3808 arg2_rtx
= get_memory_rtx (arg2
, NULL
);
3810 /* Try to call cmpstrsi. */
3811 if (cmpstr_icode
!= CODE_FOR_nothing
)
3812 result
= expand_cmpstr (cmpstr_icode
, target
, arg1_rtx
, arg2_rtx
,
3813 MIN (arg1_align
, arg2_align
));
3815 /* Try to determine at least one length and call cmpstrnsi. */
3816 if (!result
&& cmpstrn_icode
!= CODE_FOR_nothing
)
3821 tree len1
= c_strlen (arg1
, 1);
3822 tree len2
= c_strlen (arg2
, 1);
3825 len1
= size_binop (PLUS_EXPR
, ssize_int (1), len1
);
3827 len2
= size_binop (PLUS_EXPR
, ssize_int (1), len2
);
3829 /* If we don't have a constant length for the first, use the length
3830 of the second, if we know it. We don't require a constant for
3831 this case; some cost analysis could be done if both are available
3832 but neither is constant. For now, assume they're equally cheap,
3833 unless one has side effects. If both strings have constant lengths,
3840 else if (TREE_SIDE_EFFECTS (len1
))
3842 else if (TREE_SIDE_EFFECTS (len2
))
3844 else if (TREE_CODE (len1
) != INTEGER_CST
)
3846 else if (TREE_CODE (len2
) != INTEGER_CST
)
3848 else if (tree_int_cst_lt (len1
, len2
))
3853 /* If both arguments have side effects, we cannot optimize. */
3854 if (len
&& !TREE_SIDE_EFFECTS (len
))
3856 arg3_rtx
= expand_normal (len
);
3857 result
= expand_cmpstrn_or_cmpmem
3858 (cmpstrn_icode
, target
, arg1_rtx
, arg2_rtx
, TREE_TYPE (len
),
3859 arg3_rtx
, MIN (arg1_align
, arg2_align
));
3865 /* Return the value in the proper mode for this function. */
3866 machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
3867 if (GET_MODE (result
) == mode
)
3870 return convert_to_mode (mode
, result
, 0);
3871 convert_move (target
, result
, 0);
3875 /* Expand the library call ourselves using a stabilized argument
3876 list to avoid re-evaluating the function's arguments twice. */
3877 fndecl
= get_callee_fndecl (exp
);
3878 fn
= build_call_nofold_loc (EXPR_LOCATION (exp
), fndecl
, 2, arg1
, arg2
);
3879 gcc_assert (TREE_CODE (fn
) == CALL_EXPR
);
3880 CALL_EXPR_TAILCALL (fn
) = CALL_EXPR_TAILCALL (exp
);
3881 return expand_call (fn
, target
, target
== const0_rtx
);
3886 /* Expand expression EXP, which is a call to the strncmp builtin. Return
3887 NULL_RTX if we failed the caller should emit a normal call, otherwise try to get
3888 the result in TARGET, if convenient. */
3891 expand_builtin_strncmp (tree exp
, ATTRIBUTE_UNUSED rtx target
,
3892 ATTRIBUTE_UNUSED machine_mode mode
)
3894 location_t loc ATTRIBUTE_UNUSED
= EXPR_LOCATION (exp
);
3896 if (!validate_arglist (exp
,
3897 POINTER_TYPE
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
3900 /* If c_strlen can determine an expression for one of the string
3901 lengths, and it doesn't have side effects, then emit cmpstrnsi
3902 using length MIN(strlen(string)+1, arg3). */
3903 insn_code cmpstrn_icode
= direct_optab_handler (cmpstrn_optab
, SImode
);
3904 if (cmpstrn_icode
!= CODE_FOR_nothing
)
3906 tree len
, len1
, len2
;
3907 rtx arg1_rtx
, arg2_rtx
, arg3_rtx
;
3910 tree arg1
= CALL_EXPR_ARG (exp
, 0);
3911 tree arg2
= CALL_EXPR_ARG (exp
, 1);
3912 tree arg3
= CALL_EXPR_ARG (exp
, 2);
3914 unsigned int arg1_align
= get_pointer_alignment (arg1
) / BITS_PER_UNIT
;
3915 unsigned int arg2_align
= get_pointer_alignment (arg2
) / BITS_PER_UNIT
;
3917 len1
= c_strlen (arg1
, 1);
3918 len2
= c_strlen (arg2
, 1);
3921 len1
= size_binop_loc (loc
, PLUS_EXPR
, ssize_int (1), len1
);
3923 len2
= size_binop_loc (loc
, PLUS_EXPR
, ssize_int (1), len2
);
3925 /* If we don't have a constant length for the first, use the length
3926 of the second, if we know it. We don't require a constant for
3927 this case; some cost analysis could be done if both are available
3928 but neither is constant. For now, assume they're equally cheap,
3929 unless one has side effects. If both strings have constant lengths,
3936 else if (TREE_SIDE_EFFECTS (len1
))
3938 else if (TREE_SIDE_EFFECTS (len2
))
3940 else if (TREE_CODE (len1
) != INTEGER_CST
)
3942 else if (TREE_CODE (len2
) != INTEGER_CST
)
3944 else if (tree_int_cst_lt (len1
, len2
))
3949 /* If both arguments have side effects, we cannot optimize. */
3950 if (!len
|| TREE_SIDE_EFFECTS (len
))
3953 /* The actual new length parameter is MIN(len,arg3). */
3954 len
= fold_build2_loc (loc
, MIN_EXPR
, TREE_TYPE (len
), len
,
3955 fold_convert_loc (loc
, TREE_TYPE (len
), arg3
));
3957 /* If we don't have POINTER_TYPE, call the function. */
3958 if (arg1_align
== 0 || arg2_align
== 0)
3961 /* Stabilize the arguments in case gen_cmpstrnsi fails. */
3962 arg1
= builtin_save_expr (arg1
);
3963 arg2
= builtin_save_expr (arg2
);
3964 len
= builtin_save_expr (len
);
3966 arg1_rtx
= get_memory_rtx (arg1
, len
);
3967 arg2_rtx
= get_memory_rtx (arg2
, len
);
3968 arg3_rtx
= expand_normal (len
);
3969 result
= expand_cmpstrn_or_cmpmem (cmpstrn_icode
, target
, arg1_rtx
,
3970 arg2_rtx
, TREE_TYPE (len
), arg3_rtx
,
3971 MIN (arg1_align
, arg2_align
));
3974 /* Return the value in the proper mode for this function. */
3975 mode
= TYPE_MODE (TREE_TYPE (exp
));
3976 if (GET_MODE (result
) == mode
)
3979 return convert_to_mode (mode
, result
, 0);
3980 convert_move (target
, result
, 0);
3984 /* Expand the library call ourselves using a stabilized argument
3985 list to avoid re-evaluating the function's arguments twice. */
3986 fndecl
= get_callee_fndecl (exp
);
3987 fn
= build_call_nofold_loc (EXPR_LOCATION (exp
), fndecl
, 3,
3989 gcc_assert (TREE_CODE (fn
) == CALL_EXPR
);
3990 CALL_EXPR_TAILCALL (fn
) = CALL_EXPR_TAILCALL (exp
);
3991 return expand_call (fn
, target
, target
== const0_rtx
);
3996 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
3997 if that's convenient. */
4000 expand_builtin_saveregs (void)
4005 /* Don't do __builtin_saveregs more than once in a function.
4006 Save the result of the first call and reuse it. */
4007 if (saveregs_value
!= 0)
4008 return saveregs_value
;
4010 /* When this function is called, it means that registers must be
4011 saved on entry to this function. So we migrate the call to the
4012 first insn of this function. */
4016 /* Do whatever the machine needs done in this case. */
4017 val
= targetm
.calls
.expand_builtin_saveregs ();
4022 saveregs_value
= val
;
4024 /* Put the insns after the NOTE that starts the function. If this
4025 is inside a start_sequence, make the outer-level insn chain current, so
4026 the code is placed at the start of the function. */
4027 push_topmost_sequence ();
4028 emit_insn_after (seq
, entry_of_function ());
4029 pop_topmost_sequence ();
4034 /* Expand a call to __builtin_next_arg. */
4037 expand_builtin_next_arg (void)
4039 /* Checking arguments is already done in fold_builtin_next_arg
4040 that must be called before this function. */
4041 return expand_binop (ptr_mode
, add_optab
,
4042 crtl
->args
.internal_arg_pointer
,
4043 crtl
->args
.arg_offset_rtx
,
4044 NULL_RTX
, 0, OPTAB_LIB_WIDEN
);
4047 /* Make it easier for the backends by protecting the valist argument
4048 from multiple evaluations. */
4051 stabilize_va_list_loc (location_t loc
, tree valist
, int needs_lvalue
)
4053 tree vatype
= targetm
.canonical_va_list_type (TREE_TYPE (valist
));
4055 /* The current way of determining the type of valist is completely
4056 bogus. We should have the information on the va builtin instead. */
4058 vatype
= targetm
.fn_abi_va_list (cfun
->decl
);
4060 if (TREE_CODE (vatype
) == ARRAY_TYPE
)
4062 if (TREE_SIDE_EFFECTS (valist
))
4063 valist
= save_expr (valist
);
4065 /* For this case, the backends will be expecting a pointer to
4066 vatype, but it's possible we've actually been given an array
4067 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
4069 if (TREE_CODE (TREE_TYPE (valist
)) == ARRAY_TYPE
)
4071 tree p1
= build_pointer_type (TREE_TYPE (vatype
));
4072 valist
= build_fold_addr_expr_with_type_loc (loc
, valist
, p1
);
4077 tree pt
= build_pointer_type (vatype
);
4081 if (! TREE_SIDE_EFFECTS (valist
))
4084 valist
= fold_build1_loc (loc
, ADDR_EXPR
, pt
, valist
);
4085 TREE_SIDE_EFFECTS (valist
) = 1;
4088 if (TREE_SIDE_EFFECTS (valist
))
4089 valist
= save_expr (valist
);
4090 valist
= fold_build2_loc (loc
, MEM_REF
,
4091 vatype
, valist
, build_int_cst (pt
, 0));
4097 /* The "standard" definition of va_list is void*. */
4100 std_build_builtin_va_list (void)
4102 return ptr_type_node
;
4105 /* The "standard" abi va_list is va_list_type_node. */
4108 std_fn_abi_va_list (tree fndecl ATTRIBUTE_UNUSED
)
4110 return va_list_type_node
;
4113 /* The "standard" type of va_list is va_list_type_node. */
4116 std_canonical_va_list_type (tree type
)
4120 if (INDIRECT_REF_P (type
))
4121 type
= TREE_TYPE (type
);
4122 else if (POINTER_TYPE_P (type
) && POINTER_TYPE_P (TREE_TYPE (type
)))
4123 type
= TREE_TYPE (type
);
4124 wtype
= va_list_type_node
;
4126 /* Treat structure va_list types. */
4127 if (TREE_CODE (wtype
) == RECORD_TYPE
&& POINTER_TYPE_P (htype
))
4128 htype
= TREE_TYPE (htype
);
4129 else if (TREE_CODE (wtype
) == ARRAY_TYPE
)
4131 /* If va_list is an array type, the argument may have decayed
4132 to a pointer type, e.g. by being passed to another function.
4133 In that case, unwrap both types so that we can compare the
4134 underlying records. */
4135 if (TREE_CODE (htype
) == ARRAY_TYPE
4136 || POINTER_TYPE_P (htype
))
4138 wtype
= TREE_TYPE (wtype
);
4139 htype
= TREE_TYPE (htype
);
4142 if (TYPE_MAIN_VARIANT (wtype
) == TYPE_MAIN_VARIANT (htype
))
4143 return va_list_type_node
;
4148 /* The "standard" implementation of va_start: just assign `nextarg' to
4152 std_expand_builtin_va_start (tree valist
, rtx nextarg
)
4154 rtx va_r
= expand_expr (valist
, NULL_RTX
, VOIDmode
, EXPAND_WRITE
);
4155 convert_move (va_r
, nextarg
, 0);
4157 /* We do not have any valid bounds for the pointer, so
4158 just store zero bounds for it. */
4159 if (chkp_function_instrumented_p (current_function_decl
))
4160 chkp_expand_bounds_reset_for_mem (valist
,
4161 make_tree (TREE_TYPE (valist
),
4165 /* Expand EXP, a call to __builtin_va_start. */
4168 expand_builtin_va_start (tree exp
)
4172 location_t loc
= EXPR_LOCATION (exp
);
4174 if (call_expr_nargs (exp
) < 2)
4176 error_at (loc
, "too few arguments to function %<va_start%>");
4180 if (fold_builtin_next_arg (exp
, true))
4183 nextarg
= expand_builtin_next_arg ();
4184 valist
= stabilize_va_list_loc (loc
, CALL_EXPR_ARG (exp
, 0), 1);
4186 if (targetm
.expand_builtin_va_start
)
4187 targetm
.expand_builtin_va_start (valist
, nextarg
);
4189 std_expand_builtin_va_start (valist
, nextarg
);
4194 /* Expand EXP, a call to __builtin_va_end. */
4197 expand_builtin_va_end (tree exp
)
4199 tree valist
= CALL_EXPR_ARG (exp
, 0);
4201 /* Evaluate for side effects, if needed. I hate macros that don't
4203 if (TREE_SIDE_EFFECTS (valist
))
4204 expand_expr (valist
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
4209 /* Expand EXP, a call to __builtin_va_copy. We do this as a
4210 builtin rather than just as an assignment in stdarg.h because of the
4211 nastiness of array-type va_list types. */
4214 expand_builtin_va_copy (tree exp
)
4217 location_t loc
= EXPR_LOCATION (exp
);
4219 dst
= CALL_EXPR_ARG (exp
, 0);
4220 src
= CALL_EXPR_ARG (exp
, 1);
4222 dst
= stabilize_va_list_loc (loc
, dst
, 1);
4223 src
= stabilize_va_list_loc (loc
, src
, 0);
4225 gcc_assert (cfun
!= NULL
&& cfun
->decl
!= NULL_TREE
);
4227 if (TREE_CODE (targetm
.fn_abi_va_list (cfun
->decl
)) != ARRAY_TYPE
)
4229 t
= build2 (MODIFY_EXPR
, targetm
.fn_abi_va_list (cfun
->decl
), dst
, src
);
4230 TREE_SIDE_EFFECTS (t
) = 1;
4231 expand_expr (t
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
4235 rtx dstb
, srcb
, size
;
4237 /* Evaluate to pointers. */
4238 dstb
= expand_expr (dst
, NULL_RTX
, Pmode
, EXPAND_NORMAL
);
4239 srcb
= expand_expr (src
, NULL_RTX
, Pmode
, EXPAND_NORMAL
);
4240 size
= expand_expr (TYPE_SIZE_UNIT (targetm
.fn_abi_va_list (cfun
->decl
)),
4241 NULL_RTX
, VOIDmode
, EXPAND_NORMAL
);
4243 dstb
= convert_memory_address (Pmode
, dstb
);
4244 srcb
= convert_memory_address (Pmode
, srcb
);
4246 /* "Dereference" to BLKmode memories. */
4247 dstb
= gen_rtx_MEM (BLKmode
, dstb
);
4248 set_mem_alias_set (dstb
, get_alias_set (TREE_TYPE (TREE_TYPE (dst
))));
4249 set_mem_align (dstb
, TYPE_ALIGN (targetm
.fn_abi_va_list (cfun
->decl
)));
4250 srcb
= gen_rtx_MEM (BLKmode
, srcb
);
4251 set_mem_alias_set (srcb
, get_alias_set (TREE_TYPE (TREE_TYPE (src
))));
4252 set_mem_align (srcb
, TYPE_ALIGN (targetm
.fn_abi_va_list (cfun
->decl
)));
4255 emit_block_move (dstb
, srcb
, size
, BLOCK_OP_NORMAL
);
4261 /* Expand a call to one of the builtin functions __builtin_frame_address or
4262 __builtin_return_address. */
4265 expand_builtin_frame_address (tree fndecl
, tree exp
)
4267 /* The argument must be a nonnegative integer constant.
4268 It counts the number of frames to scan up the stack.
4269 The value is either the frame pointer value or the return
4270 address saved in that frame. */
4271 if (call_expr_nargs (exp
) == 0)
4272 /* Warning about missing arg was already issued. */
4274 else if (! tree_fits_uhwi_p (CALL_EXPR_ARG (exp
, 0)))
4276 error ("invalid argument to %qD", fndecl
);
4281 /* Number of frames to scan up the stack. */
4282 unsigned HOST_WIDE_INT count
= tree_to_uhwi (CALL_EXPR_ARG (exp
, 0));
4284 rtx tem
= expand_builtin_return_addr (DECL_FUNCTION_CODE (fndecl
), count
);
4286 /* Some ports cannot access arbitrary stack frames. */
4289 warning (0, "unsupported argument to %qD", fndecl
);
4295 /* Warn since no effort is made to ensure that any frame
4296 beyond the current one exists or can be safely reached. */
4297 warning (OPT_Wframe_address
, "calling %qD with "
4298 "a nonzero argument is unsafe", fndecl
);
4301 /* For __builtin_frame_address, return what we've got. */
4302 if (DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_FRAME_ADDRESS
)
4306 && ! CONSTANT_P (tem
))
4307 tem
= copy_addr_to_reg (tem
);
4312 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we
4313 failed and the caller should emit a normal call. CANNOT_ACCUMULATE
4314 is the same as for allocate_dynamic_stack_space. */
4317 expand_builtin_alloca (tree exp
, bool cannot_accumulate
)
4323 bool alloca_with_align
= (DECL_FUNCTION_CODE (get_callee_fndecl (exp
))
4324 == BUILT_IN_ALLOCA_WITH_ALIGN
);
4327 = (alloca_with_align
4328 ? validate_arglist (exp
, INTEGER_TYPE
, INTEGER_TYPE
, VOID_TYPE
)
4329 : validate_arglist (exp
, INTEGER_TYPE
, VOID_TYPE
));
4334 /* Compute the argument. */
4335 op0
= expand_normal (CALL_EXPR_ARG (exp
, 0));
4337 /* Compute the alignment. */
4338 align
= (alloca_with_align
4339 ? TREE_INT_CST_LOW (CALL_EXPR_ARG (exp
, 1))
4340 : BIGGEST_ALIGNMENT
);
4342 /* Allocate the desired space. */
4343 result
= allocate_dynamic_stack_space (op0
, 0, align
, cannot_accumulate
);
4344 result
= convert_memory_address (ptr_mode
, result
);
4349 /* Expand a call to bswap builtin in EXP.
4350 Return NULL_RTX if a normal call should be emitted rather than expanding the
4351 function in-line. If convenient, the result should be placed in TARGET.
4352 SUBTARGET may be used as the target for computing one of EXP's operands. */
4355 expand_builtin_bswap (machine_mode target_mode
, tree exp
, rtx target
,
4361 if (!validate_arglist (exp
, INTEGER_TYPE
, VOID_TYPE
))
4364 arg
= CALL_EXPR_ARG (exp
, 0);
4365 op0
= expand_expr (arg
,
4366 subtarget
&& GET_MODE (subtarget
) == target_mode
4367 ? subtarget
: NULL_RTX
,
4368 target_mode
, EXPAND_NORMAL
);
4369 if (GET_MODE (op0
) != target_mode
)
4370 op0
= convert_to_mode (target_mode
, op0
, 1);
4372 target
= expand_unop (target_mode
, bswap_optab
, op0
, target
, 1);
4374 gcc_assert (target
);
4376 return convert_to_mode (target_mode
, target
, 1);
4379 /* Expand a call to a unary builtin in EXP.
4380 Return NULL_RTX if a normal call should be emitted rather than expanding the
4381 function in-line. If convenient, the result should be placed in TARGET.
4382 SUBTARGET may be used as the target for computing one of EXP's operands. */
4385 expand_builtin_unop (machine_mode target_mode
, tree exp
, rtx target
,
4386 rtx subtarget
, optab op_optab
)
4390 if (!validate_arglist (exp
, INTEGER_TYPE
, VOID_TYPE
))
4393 /* Compute the argument. */
4394 op0
= expand_expr (CALL_EXPR_ARG (exp
, 0),
4396 && (TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp
, 0)))
4397 == GET_MODE (subtarget
))) ? subtarget
: NULL_RTX
,
4398 VOIDmode
, EXPAND_NORMAL
);
4399 /* Compute op, into TARGET if possible.
4400 Set TARGET to wherever the result comes back. */
4401 target
= expand_unop (TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp
, 0))),
4402 op_optab
, op0
, target
, op_optab
!= clrsb_optab
);
4403 gcc_assert (target
);
4405 return convert_to_mode (target_mode
, target
, 0);
4408 /* Expand a call to __builtin_expect. We just return our argument
4409 as the builtin_expect semantic should've been already executed by
4410 tree branch prediction pass. */
4413 expand_builtin_expect (tree exp
, rtx target
)
4417 if (call_expr_nargs (exp
) < 2)
4419 arg
= CALL_EXPR_ARG (exp
, 0);
4421 target
= expand_expr (arg
, target
, VOIDmode
, EXPAND_NORMAL
);
4422 /* When guessing was done, the hints should be already stripped away. */
4423 gcc_assert (!flag_guess_branch_prob
4424 || optimize
== 0 || seen_error ());
4428 /* Expand a call to __builtin_assume_aligned. We just return our first
4429 argument as the builtin_assume_aligned semantic should've been already
4433 expand_builtin_assume_aligned (tree exp
, rtx target
)
4435 if (call_expr_nargs (exp
) < 2)
4437 target
= expand_expr (CALL_EXPR_ARG (exp
, 0), target
, VOIDmode
,
4439 gcc_assert (!TREE_SIDE_EFFECTS (CALL_EXPR_ARG (exp
, 1))
4440 && (call_expr_nargs (exp
) < 3
4441 || !TREE_SIDE_EFFECTS (CALL_EXPR_ARG (exp
, 2))));
4446 expand_builtin_trap (void)
4448 if (targetm
.have_trap ())
4450 rtx_insn
*insn
= emit_insn (targetm
.gen_trap ());
4451 /* For trap insns when not accumulating outgoing args force
4452 REG_ARGS_SIZE note to prevent crossjumping of calls with
4453 different args sizes. */
4454 if (!ACCUMULATE_OUTGOING_ARGS
)
4455 add_reg_note (insn
, REG_ARGS_SIZE
, GEN_INT (stack_pointer_delta
));
4458 emit_library_call (abort_libfunc
, LCT_NORETURN
, VOIDmode
, 0);
4462 /* Expand a call to __builtin_unreachable. We do nothing except emit
4463 a barrier saying that control flow will not pass here.
4465 It is the responsibility of the program being compiled to ensure
4466 that control flow does never reach __builtin_unreachable. */
4468 expand_builtin_unreachable (void)
4473 /* Expand EXP, a call to fabs, fabsf or fabsl.
4474 Return NULL_RTX if a normal call should be emitted rather than expanding
4475 the function inline. If convenient, the result should be placed
4476 in TARGET. SUBTARGET may be used as the target for computing
4480 expand_builtin_fabs (tree exp
, rtx target
, rtx subtarget
)
4486 if (!validate_arglist (exp
, REAL_TYPE
, VOID_TYPE
))
4489 arg
= CALL_EXPR_ARG (exp
, 0);
4490 CALL_EXPR_ARG (exp
, 0) = arg
= builtin_save_expr (arg
);
4491 mode
= TYPE_MODE (TREE_TYPE (arg
));
4492 op0
= expand_expr (arg
, subtarget
, VOIDmode
, EXPAND_NORMAL
);
4493 return expand_abs (mode
, op0
, target
, 0, safe_from_p (target
, arg
, 1));
4496 /* Expand EXP, a call to copysign, copysignf, or copysignl.
4497 Return NULL is a normal call should be emitted rather than expanding the
4498 function inline. If convenient, the result should be placed in TARGET.
4499 SUBTARGET may be used as the target for computing the operand. */
4502 expand_builtin_copysign (tree exp
, rtx target
, rtx subtarget
)
4507 if (!validate_arglist (exp
, REAL_TYPE
, REAL_TYPE
, VOID_TYPE
))
4510 arg
= CALL_EXPR_ARG (exp
, 0);
4511 op0
= expand_expr (arg
, subtarget
, VOIDmode
, EXPAND_NORMAL
);
4513 arg
= CALL_EXPR_ARG (exp
, 1);
4514 op1
= expand_normal (arg
);
4516 return expand_copysign (op0
, op1
, target
);
4519 /* Expand a call to __builtin___clear_cache. */
4522 expand_builtin___clear_cache (tree exp
)
4524 if (!targetm
.code_for_clear_cache
)
4526 #ifdef CLEAR_INSN_CACHE
4527 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
4528 does something. Just do the default expansion to a call to
4532 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
4533 does nothing. There is no need to call it. Do nothing. */
4535 #endif /* CLEAR_INSN_CACHE */
4538 /* We have a "clear_cache" insn, and it will handle everything. */
4540 rtx begin_rtx
, end_rtx
;
4542 /* We must not expand to a library call. If we did, any
4543 fallback library function in libgcc that might contain a call to
4544 __builtin___clear_cache() would recurse infinitely. */
4545 if (!validate_arglist (exp
, POINTER_TYPE
, POINTER_TYPE
, VOID_TYPE
))
4547 error ("both arguments to %<__builtin___clear_cache%> must be pointers");
4551 if (targetm
.have_clear_cache ())
4553 struct expand_operand ops
[2];
4555 begin
= CALL_EXPR_ARG (exp
, 0);
4556 begin_rtx
= expand_expr (begin
, NULL_RTX
, Pmode
, EXPAND_NORMAL
);
4558 end
= CALL_EXPR_ARG (exp
, 1);
4559 end_rtx
= expand_expr (end
, NULL_RTX
, Pmode
, EXPAND_NORMAL
);
4561 create_address_operand (&ops
[0], begin_rtx
);
4562 create_address_operand (&ops
[1], end_rtx
);
4563 if (maybe_expand_insn (targetm
.code_for_clear_cache
, 2, ops
))
4569 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
4572 round_trampoline_addr (rtx tramp
)
4574 rtx temp
, addend
, mask
;
4576 /* If we don't need too much alignment, we'll have been guaranteed
4577 proper alignment by get_trampoline_type. */
4578 if (TRAMPOLINE_ALIGNMENT
<= STACK_BOUNDARY
)
4581 /* Round address up to desired boundary. */
4582 temp
= gen_reg_rtx (Pmode
);
4583 addend
= gen_int_mode (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
- 1, Pmode
);
4584 mask
= gen_int_mode (-TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
, Pmode
);
4586 temp
= expand_simple_binop (Pmode
, PLUS
, tramp
, addend
,
4587 temp
, 0, OPTAB_LIB_WIDEN
);
4588 tramp
= expand_simple_binop (Pmode
, AND
, temp
, mask
,
4589 temp
, 0, OPTAB_LIB_WIDEN
);
4595 expand_builtin_init_trampoline (tree exp
, bool onstack
)
4597 tree t_tramp
, t_func
, t_chain
;
4598 rtx m_tramp
, r_tramp
, r_chain
, tmp
;
4600 if (!validate_arglist (exp
, POINTER_TYPE
, POINTER_TYPE
,
4601 POINTER_TYPE
, VOID_TYPE
))
4604 t_tramp
= CALL_EXPR_ARG (exp
, 0);
4605 t_func
= CALL_EXPR_ARG (exp
, 1);
4606 t_chain
= CALL_EXPR_ARG (exp
, 2);
4608 r_tramp
= expand_normal (t_tramp
);
4609 m_tramp
= gen_rtx_MEM (BLKmode
, r_tramp
);
4610 MEM_NOTRAP_P (m_tramp
) = 1;
4612 /* If ONSTACK, the TRAMP argument should be the address of a field
4613 within the local function's FRAME decl. Either way, let's see if
4614 we can fill in the MEM_ATTRs for this memory. */
4615 if (TREE_CODE (t_tramp
) == ADDR_EXPR
)
4616 set_mem_attributes (m_tramp
, TREE_OPERAND (t_tramp
, 0), true);
4618 /* Creator of a heap trampoline is responsible for making sure the
4619 address is aligned to at least STACK_BOUNDARY. Normally malloc
4620 will ensure this anyhow. */
4621 tmp
= round_trampoline_addr (r_tramp
);
4624 m_tramp
= change_address (m_tramp
, BLKmode
, tmp
);
4625 set_mem_align (m_tramp
, TRAMPOLINE_ALIGNMENT
);
4626 set_mem_size (m_tramp
, TRAMPOLINE_SIZE
);
4629 /* The FUNC argument should be the address of the nested function.
4630 Extract the actual function decl to pass to the hook. */
4631 gcc_assert (TREE_CODE (t_func
) == ADDR_EXPR
);
4632 t_func
= TREE_OPERAND (t_func
, 0);
4633 gcc_assert (TREE_CODE (t_func
) == FUNCTION_DECL
);
4635 r_chain
= expand_normal (t_chain
);
4637 /* Generate insns to initialize the trampoline. */
4638 targetm
.calls
.trampoline_init (m_tramp
, t_func
, r_chain
);
4642 trampolines_created
= 1;
4644 warning_at (DECL_SOURCE_LOCATION (t_func
), OPT_Wtrampolines
,
4645 "trampoline generated for nested function %qD", t_func
);
4652 expand_builtin_adjust_trampoline (tree exp
)
4656 if (!validate_arglist (exp
, POINTER_TYPE
, VOID_TYPE
))
4659 tramp
= expand_normal (CALL_EXPR_ARG (exp
, 0));
4660 tramp
= round_trampoline_addr (tramp
);
4661 if (targetm
.calls
.trampoline_adjust_address
)
4662 tramp
= targetm
.calls
.trampoline_adjust_address (tramp
);
4667 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
4668 function. The function first checks whether the back end provides
4669 an insn to implement signbit for the respective mode. If not, it
4670 checks whether the floating point format of the value is such that
4671 the sign bit can be extracted. If that is not the case, error out.
4672 EXP is the expression that is a call to the builtin function; if
4673 convenient, the result should be placed in TARGET. */
4675 expand_builtin_signbit (tree exp
, rtx target
)
4677 const struct real_format
*fmt
;
4678 machine_mode fmode
, imode
, rmode
;
4681 enum insn_code icode
;
4683 location_t loc
= EXPR_LOCATION (exp
);
4685 if (!validate_arglist (exp
, REAL_TYPE
, VOID_TYPE
))
4688 arg
= CALL_EXPR_ARG (exp
, 0);
4689 fmode
= TYPE_MODE (TREE_TYPE (arg
));
4690 rmode
= TYPE_MODE (TREE_TYPE (exp
));
4691 fmt
= REAL_MODE_FORMAT (fmode
);
4693 arg
= builtin_save_expr (arg
);
4695 /* Expand the argument yielding a RTX expression. */
4696 temp
= expand_normal (arg
);
4698 /* Check if the back end provides an insn that handles signbit for the
4700 icode
= optab_handler (signbit_optab
, fmode
);
4701 if (icode
!= CODE_FOR_nothing
)
4703 rtx_insn
*last
= get_last_insn ();
4704 target
= gen_reg_rtx (TYPE_MODE (TREE_TYPE (exp
)));
4705 if (maybe_emit_unop_insn (icode
, target
, temp
, UNKNOWN
))
4707 delete_insns_since (last
);
4710 /* For floating point formats without a sign bit, implement signbit
4712 bitpos
= fmt
->signbit_ro
;
4715 /* But we can't do this if the format supports signed zero. */
4716 gcc_assert (!fmt
->has_signed_zero
|| !HONOR_SIGNED_ZEROS (fmode
));
4718 arg
= fold_build2_loc (loc
, LT_EXPR
, TREE_TYPE (exp
), arg
,
4719 build_real (TREE_TYPE (arg
), dconst0
));
4720 return expand_expr (arg
, target
, VOIDmode
, EXPAND_NORMAL
);
4723 if (GET_MODE_SIZE (fmode
) <= UNITS_PER_WORD
)
4725 imode
= int_mode_for_mode (fmode
);
4726 gcc_assert (imode
!= BLKmode
);
4727 temp
= gen_lowpart (imode
, temp
);
4732 /* Handle targets with different FP word orders. */
4733 if (FLOAT_WORDS_BIG_ENDIAN
)
4734 word
= (GET_MODE_BITSIZE (fmode
) - bitpos
) / BITS_PER_WORD
;
4736 word
= bitpos
/ BITS_PER_WORD
;
4737 temp
= operand_subword_force (temp
, word
, fmode
);
4738 bitpos
= bitpos
% BITS_PER_WORD
;
4741 /* Force the intermediate word_mode (or narrower) result into a
4742 register. This avoids attempting to create paradoxical SUBREGs
4743 of floating point modes below. */
4744 temp
= force_reg (imode
, temp
);
4746 /* If the bitpos is within the "result mode" lowpart, the operation
4747 can be implement with a single bitwise AND. Otherwise, we need
4748 a right shift and an AND. */
4750 if (bitpos
< GET_MODE_BITSIZE (rmode
))
4752 wide_int mask
= wi::set_bit_in_zero (bitpos
, GET_MODE_PRECISION (rmode
));
4754 if (GET_MODE_SIZE (imode
) > GET_MODE_SIZE (rmode
))
4755 temp
= gen_lowpart (rmode
, temp
);
4756 temp
= expand_binop (rmode
, and_optab
, temp
,
4757 immed_wide_int_const (mask
, rmode
),
4758 NULL_RTX
, 1, OPTAB_LIB_WIDEN
);
4762 /* Perform a logical right shift to place the signbit in the least
4763 significant bit, then truncate the result to the desired mode
4764 and mask just this bit. */
4765 temp
= expand_shift (RSHIFT_EXPR
, imode
, temp
, bitpos
, NULL_RTX
, 1);
4766 temp
= gen_lowpart (rmode
, temp
);
4767 temp
= expand_binop (rmode
, and_optab
, temp
, const1_rtx
,
4768 NULL_RTX
, 1, OPTAB_LIB_WIDEN
);
4774 /* Expand fork or exec calls. TARGET is the desired target of the
4775 call. EXP is the call. FN is the
4776 identificator of the actual function. IGNORE is nonzero if the
4777 value is to be ignored. */
4780 expand_builtin_fork_or_exec (tree fn
, tree exp
, rtx target
, int ignore
)
4785 /* If we are not profiling, just call the function. */
4786 if (!profile_arc_flag
)
4789 /* Otherwise call the wrapper. This should be equivalent for the rest of
4790 compiler, so the code does not diverge, and the wrapper may run the
4791 code necessary for keeping the profiling sane. */
4793 switch (DECL_FUNCTION_CODE (fn
))
4796 id
= get_identifier ("__gcov_fork");
4799 case BUILT_IN_EXECL
:
4800 id
= get_identifier ("__gcov_execl");
4803 case BUILT_IN_EXECV
:
4804 id
= get_identifier ("__gcov_execv");
4807 case BUILT_IN_EXECLP
:
4808 id
= get_identifier ("__gcov_execlp");
4811 case BUILT_IN_EXECLE
:
4812 id
= get_identifier ("__gcov_execle");
4815 case BUILT_IN_EXECVP
:
4816 id
= get_identifier ("__gcov_execvp");
4819 case BUILT_IN_EXECVE
:
4820 id
= get_identifier ("__gcov_execve");
4827 decl
= build_decl (DECL_SOURCE_LOCATION (fn
),
4828 FUNCTION_DECL
, id
, TREE_TYPE (fn
));
4829 DECL_EXTERNAL (decl
) = 1;
4830 TREE_PUBLIC (decl
) = 1;
4831 DECL_ARTIFICIAL (decl
) = 1;
4832 TREE_NOTHROW (decl
) = 1;
4833 DECL_VISIBILITY (decl
) = VISIBILITY_DEFAULT
;
4834 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
4835 call
= rewrite_call_expr (EXPR_LOCATION (exp
), exp
, 0, decl
, 0);
4836 return expand_call (call
, target
, ignore
);
4841 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
4842 the pointer in these functions is void*, the tree optimizers may remove
4843 casts. The mode computed in expand_builtin isn't reliable either, due
4844 to __sync_bool_compare_and_swap.
4846 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
4847 group of builtins. This gives us log2 of the mode size. */
4849 static inline machine_mode
4850 get_builtin_sync_mode (int fcode_diff
)
4852 /* The size is not negotiable, so ask not to get BLKmode in return
4853 if the target indicates that a smaller size would be better. */
4854 return mode_for_size (BITS_PER_UNIT
<< fcode_diff
, MODE_INT
, 0);
4857 /* Expand the memory expression LOC and return the appropriate memory operand
4858 for the builtin_sync operations. */
4861 get_builtin_sync_mem (tree loc
, machine_mode mode
)
4865 addr
= expand_expr (loc
, NULL_RTX
, ptr_mode
, EXPAND_SUM
);
4866 addr
= convert_memory_address (Pmode
, addr
);
4868 /* Note that we explicitly do not want any alias information for this
4869 memory, so that we kill all other live memories. Otherwise we don't
4870 satisfy the full barrier semantics of the intrinsic. */
4871 mem
= validize_mem (gen_rtx_MEM (mode
, addr
));
4873 /* The alignment needs to be at least according to that of the mode. */
4874 set_mem_align (mem
, MAX (GET_MODE_ALIGNMENT (mode
),
4875 get_pointer_alignment (loc
)));
4876 set_mem_alias_set (mem
, ALIAS_SET_MEMORY_BARRIER
);
4877 MEM_VOLATILE_P (mem
) = 1;
4882 /* Make sure an argument is in the right mode.
4883 EXP is the tree argument.
4884 MODE is the mode it should be in. */
4887 expand_expr_force_mode (tree exp
, machine_mode mode
)
4890 machine_mode old_mode
;
4892 val
= expand_expr (exp
, NULL_RTX
, mode
, EXPAND_NORMAL
);
4893 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
4894 of CONST_INTs, where we know the old_mode only from the call argument. */
4896 old_mode
= GET_MODE (val
);
4897 if (old_mode
== VOIDmode
)
4898 old_mode
= TYPE_MODE (TREE_TYPE (exp
));
4899 val
= convert_modes (mode
, old_mode
, val
, 1);
4904 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
4905 EXP is the CALL_EXPR. CODE is the rtx code
4906 that corresponds to the arithmetic or logical operation from the name;
4907 an exception here is that NOT actually means NAND. TARGET is an optional
4908 place for us to store the results; AFTER is true if this is the
4909 fetch_and_xxx form. */
4912 expand_builtin_sync_operation (machine_mode mode
, tree exp
,
4913 enum rtx_code code
, bool after
,
4917 location_t loc
= EXPR_LOCATION (exp
);
4919 if (code
== NOT
&& warn_sync_nand
)
4921 tree fndecl
= get_callee_fndecl (exp
);
4922 enum built_in_function fcode
= DECL_FUNCTION_CODE (fndecl
);
4924 static bool warned_f_a_n
, warned_n_a_f
;
4928 case BUILT_IN_SYNC_FETCH_AND_NAND_1
:
4929 case BUILT_IN_SYNC_FETCH_AND_NAND_2
:
4930 case BUILT_IN_SYNC_FETCH_AND_NAND_4
:
4931 case BUILT_IN_SYNC_FETCH_AND_NAND_8
:
4932 case BUILT_IN_SYNC_FETCH_AND_NAND_16
:
4936 fndecl
= builtin_decl_implicit (BUILT_IN_SYNC_FETCH_AND_NAND_N
);
4937 inform (loc
, "%qD changed semantics in GCC 4.4", fndecl
);
4938 warned_f_a_n
= true;
4941 case BUILT_IN_SYNC_NAND_AND_FETCH_1
:
4942 case BUILT_IN_SYNC_NAND_AND_FETCH_2
:
4943 case BUILT_IN_SYNC_NAND_AND_FETCH_4
:
4944 case BUILT_IN_SYNC_NAND_AND_FETCH_8
:
4945 case BUILT_IN_SYNC_NAND_AND_FETCH_16
:
4949 fndecl
= builtin_decl_implicit (BUILT_IN_SYNC_NAND_AND_FETCH_N
);
4950 inform (loc
, "%qD changed semantics in GCC 4.4", fndecl
);
4951 warned_n_a_f
= true;
4959 /* Expand the operands. */
4960 mem
= get_builtin_sync_mem (CALL_EXPR_ARG (exp
, 0), mode
);
4961 val
= expand_expr_force_mode (CALL_EXPR_ARG (exp
, 1), mode
);
4963 return expand_atomic_fetch_op (target
, mem
, val
, code
, MEMMODEL_SYNC_SEQ_CST
,
4967 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
4968 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
4969 true if this is the boolean form. TARGET is a place for us to store the
4970 results; this is NOT optional if IS_BOOL is true. */
4973 expand_builtin_compare_and_swap (machine_mode mode
, tree exp
,
4974 bool is_bool
, rtx target
)
4976 rtx old_val
, new_val
, mem
;
4979 /* Expand the operands. */
4980 mem
= get_builtin_sync_mem (CALL_EXPR_ARG (exp
, 0), mode
);
4981 old_val
= expand_expr_force_mode (CALL_EXPR_ARG (exp
, 1), mode
);
4982 new_val
= expand_expr_force_mode (CALL_EXPR_ARG (exp
, 2), mode
);
4984 pbool
= poval
= NULL
;
4985 if (target
!= const0_rtx
)
4992 if (!expand_atomic_compare_and_swap (pbool
, poval
, mem
, old_val
, new_val
,
4993 false, MEMMODEL_SYNC_SEQ_CST
,
4994 MEMMODEL_SYNC_SEQ_CST
))
5000 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
5001 general form is actually an atomic exchange, and some targets only
5002 support a reduced form with the second argument being a constant 1.
5003 EXP is the CALL_EXPR; TARGET is an optional place for us to store
5007 expand_builtin_sync_lock_test_and_set (machine_mode mode
, tree exp
,
5012 /* Expand the operands. */
5013 mem
= get_builtin_sync_mem (CALL_EXPR_ARG (exp
, 0), mode
);
5014 val
= expand_expr_force_mode (CALL_EXPR_ARG (exp
, 1), mode
);
5016 return expand_sync_lock_test_and_set (target
, mem
, val
);
5019 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
5022 expand_builtin_sync_lock_release (machine_mode mode
, tree exp
)
5026 /* Expand the operands. */
5027 mem
= get_builtin_sync_mem (CALL_EXPR_ARG (exp
, 0), mode
);
5029 expand_atomic_store (mem
, const0_rtx
, MEMMODEL_SYNC_RELEASE
, true);
5032 /* Given an integer representing an ``enum memmodel'', verify its
5033 correctness and return the memory model enum. */
5035 static enum memmodel
5036 get_memmodel (tree exp
)
5039 unsigned HOST_WIDE_INT val
;
5041 /* If the parameter is not a constant, it's a run time value so we'll just
5042 convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking. */
5043 if (TREE_CODE (exp
) != INTEGER_CST
)
5044 return MEMMODEL_SEQ_CST
;
5046 op
= expand_normal (exp
);
5049 if (targetm
.memmodel_check
)
5050 val
= targetm
.memmodel_check (val
);
5051 else if (val
& ~MEMMODEL_MASK
)
5053 warning (OPT_Winvalid_memory_model
,
5054 "Unknown architecture specifier in memory model to builtin.");
5055 return MEMMODEL_SEQ_CST
;
5058 /* Should never see a user explicit SYNC memodel model, so >= LAST works. */
5059 if (memmodel_base (val
) >= MEMMODEL_LAST
)
5061 warning (OPT_Winvalid_memory_model
,
5062 "invalid memory model argument to builtin");
5063 return MEMMODEL_SEQ_CST
;
5066 /* Workaround for Bugzilla 59448. GCC doesn't track consume properly, so
5067 be conservative and promote consume to acquire. */
5068 if (val
== MEMMODEL_CONSUME
)
5069 val
= MEMMODEL_ACQUIRE
;
5071 return (enum memmodel
) val
;
5074 /* Expand the __atomic_exchange intrinsic:
5075 TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel)
5076 EXP is the CALL_EXPR.
5077 TARGET is an optional place for us to store the results. */
5080 expand_builtin_atomic_exchange (machine_mode mode
, tree exp
, rtx target
)
5083 enum memmodel model
;
5085 model
= get_memmodel (CALL_EXPR_ARG (exp
, 2));
5087 if (!flag_inline_atomics
)
5090 /* Expand the operands. */
5091 mem
= get_builtin_sync_mem (CALL_EXPR_ARG (exp
, 0), mode
);
5092 val
= expand_expr_force_mode (CALL_EXPR_ARG (exp
, 1), mode
);
5094 return expand_atomic_exchange (target
, mem
, val
, model
);
5097 /* Expand the __atomic_compare_exchange intrinsic:
5098 bool __atomic_compare_exchange (TYPE *object, TYPE *expect,
5099 TYPE desired, BOOL weak,
5100 enum memmodel success,
5101 enum memmodel failure)
5102 EXP is the CALL_EXPR.
5103 TARGET is an optional place for us to store the results. */
5106 expand_builtin_atomic_compare_exchange (machine_mode mode
, tree exp
,
5109 rtx expect
, desired
, mem
, oldval
;
5110 rtx_code_label
*label
;
5111 enum memmodel success
, failure
;
5115 success
= get_memmodel (CALL_EXPR_ARG (exp
, 4));
5116 failure
= get_memmodel (CALL_EXPR_ARG (exp
, 5));
5118 if (failure
> success
)
5120 warning (OPT_Winvalid_memory_model
,
5121 "failure memory model cannot be stronger than success memory "
5122 "model for %<__atomic_compare_exchange%>");
5123 success
= MEMMODEL_SEQ_CST
;
5126 if (is_mm_release (failure
) || is_mm_acq_rel (failure
))
5128 warning (OPT_Winvalid_memory_model
,
5129 "invalid failure memory model for "
5130 "%<__atomic_compare_exchange%>");
5131 failure
= MEMMODEL_SEQ_CST
;
5132 success
= MEMMODEL_SEQ_CST
;
5136 if (!flag_inline_atomics
)
5139 /* Expand the operands. */
5140 mem
= get_builtin_sync_mem (CALL_EXPR_ARG (exp
, 0), mode
);
5142 expect
= expand_normal (CALL_EXPR_ARG (exp
, 1));
5143 expect
= convert_memory_address (Pmode
, expect
);
5144 expect
= gen_rtx_MEM (mode
, expect
);
5145 desired
= expand_expr_force_mode (CALL_EXPR_ARG (exp
, 2), mode
);
5147 weak
= CALL_EXPR_ARG (exp
, 3);
5149 if (tree_fits_shwi_p (weak
) && tree_to_shwi (weak
) != 0)
5152 if (target
== const0_rtx
)
5155 /* Lest the rtl backend create a race condition with an imporoper store
5156 to memory, always create a new pseudo for OLDVAL. */
5159 if (!expand_atomic_compare_and_swap (&target
, &oldval
, mem
, expect
, desired
,
5160 is_weak
, success
, failure
))
5163 /* Conditionally store back to EXPECT, lest we create a race condition
5164 with an improper store to memory. */
5165 /* ??? With a rearrangement of atomics at the gimple level, we can handle
5166 the normal case where EXPECT is totally private, i.e. a register. At
5167 which point the store can be unconditional. */
5168 label
= gen_label_rtx ();
5169 emit_cmp_and_jump_insns (target
, const0_rtx
, NE
, NULL
,
5170 GET_MODE (target
), 1, label
);
5171 emit_move_insn (expect
, oldval
);
5177 /* Expand the __atomic_load intrinsic:
5178 TYPE __atomic_load (TYPE *object, enum memmodel)
5179 EXP is the CALL_EXPR.
5180 TARGET is an optional place for us to store the results. */
5183 expand_builtin_atomic_load (machine_mode mode
, tree exp
, rtx target
)
5186 enum memmodel model
;
5188 model
= get_memmodel (CALL_EXPR_ARG (exp
, 1));
5189 if (is_mm_release (model
) || is_mm_acq_rel (model
))
5191 warning (OPT_Winvalid_memory_model
,
5192 "invalid memory model for %<__atomic_load%>");
5193 model
= MEMMODEL_SEQ_CST
;
5196 if (!flag_inline_atomics
)
5199 /* Expand the operand. */
5200 mem
= get_builtin_sync_mem (CALL_EXPR_ARG (exp
, 0), mode
);
5202 return expand_atomic_load (target
, mem
, model
);
5206 /* Expand the __atomic_store intrinsic:
5207 void __atomic_store (TYPE *object, TYPE desired, enum memmodel)
5208 EXP is the CALL_EXPR.
5209 TARGET is an optional place for us to store the results. */
5212 expand_builtin_atomic_store (machine_mode mode
, tree exp
)
5215 enum memmodel model
;
5217 model
= get_memmodel (CALL_EXPR_ARG (exp
, 2));
5218 if (!(is_mm_relaxed (model
) || is_mm_seq_cst (model
)
5219 || is_mm_release (model
)))
5221 warning (OPT_Winvalid_memory_model
,
5222 "invalid memory model for %<__atomic_store%>");
5223 model
= MEMMODEL_SEQ_CST
;
5226 if (!flag_inline_atomics
)
5229 /* Expand the operands. */
5230 mem
= get_builtin_sync_mem (CALL_EXPR_ARG (exp
, 0), mode
);
5231 val
= expand_expr_force_mode (CALL_EXPR_ARG (exp
, 1), mode
);
5233 return expand_atomic_store (mem
, val
, model
, false);
5236 /* Expand the __atomic_fetch_XXX intrinsic:
5237 TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel)
5238 EXP is the CALL_EXPR.
5239 TARGET is an optional place for us to store the results.
5240 CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR.
5241 FETCH_AFTER is true if returning the result of the operation.
5242 FETCH_AFTER is false if returning the value before the operation.
5243 IGNORE is true if the result is not used.
5244 EXT_CALL is the correct builtin for an external call if this cannot be
5245 resolved to an instruction sequence. */
5248 expand_builtin_atomic_fetch_op (machine_mode mode
, tree exp
, rtx target
,
5249 enum rtx_code code
, bool fetch_after
,
5250 bool ignore
, enum built_in_function ext_call
)
5253 enum memmodel model
;
5257 model
= get_memmodel (CALL_EXPR_ARG (exp
, 2));
5259 /* Expand the operands. */
5260 mem
= get_builtin_sync_mem (CALL_EXPR_ARG (exp
, 0), mode
);
5261 val
= expand_expr_force_mode (CALL_EXPR_ARG (exp
, 1), mode
);
5263 /* Only try generating instructions if inlining is turned on. */
5264 if (flag_inline_atomics
)
5266 ret
= expand_atomic_fetch_op (target
, mem
, val
, code
, model
, fetch_after
);
5271 /* Return if a different routine isn't needed for the library call. */
5272 if (ext_call
== BUILT_IN_NONE
)
5275 /* Change the call to the specified function. */
5276 fndecl
= get_callee_fndecl (exp
);
5277 addr
= CALL_EXPR_FN (exp
);
5280 gcc_assert (TREE_OPERAND (addr
, 0) == fndecl
);
5281 TREE_OPERAND (addr
, 0) = builtin_decl_explicit (ext_call
);
5283 /* Expand the call here so we can emit trailing code. */
5284 ret
= expand_call (exp
, target
, ignore
);
5286 /* Replace the original function just in case it matters. */
5287 TREE_OPERAND (addr
, 0) = fndecl
;
5289 /* Then issue the arithmetic correction to return the right result. */
5294 ret
= expand_simple_binop (mode
, AND
, ret
, val
, NULL_RTX
, true,
5296 ret
= expand_simple_unop (mode
, NOT
, ret
, target
, true);
5299 ret
= expand_simple_binop (mode
, code
, ret
, val
, target
, true,
5305 /* Expand an atomic clear operation.
5306 void _atomic_clear (BOOL *obj, enum memmodel)
5307 EXP is the call expression. */
5310 expand_builtin_atomic_clear (tree exp
)
5314 enum memmodel model
;
5316 mode
= mode_for_size (BOOL_TYPE_SIZE
, MODE_INT
, 0);
5317 mem
= get_builtin_sync_mem (CALL_EXPR_ARG (exp
, 0), mode
);
5318 model
= get_memmodel (CALL_EXPR_ARG (exp
, 1));
5320 if (is_mm_consume (model
) || is_mm_acquire (model
) || is_mm_acq_rel (model
))
5322 warning (OPT_Winvalid_memory_model
,
5323 "invalid memory model for %<__atomic_store%>");
5324 model
= MEMMODEL_SEQ_CST
;
5327 /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
5328 Failing that, a store is issued by __atomic_store. The only way this can
5329 fail is if the bool type is larger than a word size. Unlikely, but
5330 handle it anyway for completeness. Assume a single threaded model since
5331 there is no atomic support in this case, and no barriers are required. */
5332 ret
= expand_atomic_store (mem
, const0_rtx
, model
, true);
5334 emit_move_insn (mem
, const0_rtx
);
5338 /* Expand an atomic test_and_set operation.
5339 bool _atomic_test_and_set (BOOL *obj, enum memmodel)
5340 EXP is the call expression. */
5343 expand_builtin_atomic_test_and_set (tree exp
, rtx target
)
5346 enum memmodel model
;
5349 mode
= mode_for_size (BOOL_TYPE_SIZE
, MODE_INT
, 0);
5350 mem
= get_builtin_sync_mem (CALL_EXPR_ARG (exp
, 0), mode
);
5351 model
= get_memmodel (CALL_EXPR_ARG (exp
, 1));
5353 return expand_atomic_test_and_set (target
, mem
, model
);
5357 /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
5358 this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */
5361 fold_builtin_atomic_always_lock_free (tree arg0
, tree arg1
)
5365 unsigned int mode_align
, type_align
;
5367 if (TREE_CODE (arg0
) != INTEGER_CST
)
5370 size
= INTVAL (expand_normal (arg0
)) * BITS_PER_UNIT
;
5371 mode
= mode_for_size (size
, MODE_INT
, 0);
5372 mode_align
= GET_MODE_ALIGNMENT (mode
);
5374 if (TREE_CODE (arg1
) == INTEGER_CST
)
5376 unsigned HOST_WIDE_INT val
= UINTVAL (expand_normal (arg1
));
5378 /* Either this argument is null, or it's a fake pointer encoding
5379 the alignment of the object. */
5381 val
*= BITS_PER_UNIT
;
5383 if (val
== 0 || mode_align
< val
)
5384 type_align
= mode_align
;
5390 tree ttype
= TREE_TYPE (arg1
);
5392 /* This function is usually invoked and folded immediately by the front
5393 end before anything else has a chance to look at it. The pointer
5394 parameter at this point is usually cast to a void *, so check for that
5395 and look past the cast. */
5396 if (CONVERT_EXPR_P (arg1
) && POINTER_TYPE_P (ttype
)
5397 && VOID_TYPE_P (TREE_TYPE (ttype
)))
5398 arg1
= TREE_OPERAND (arg1
, 0);
5400 ttype
= TREE_TYPE (arg1
);
5401 gcc_assert (POINTER_TYPE_P (ttype
));
5403 /* Get the underlying type of the object. */
5404 ttype
= TREE_TYPE (ttype
);
5405 type_align
= TYPE_ALIGN (ttype
);
5408 /* If the object has smaller alignment, the lock free routines cannot
5410 if (type_align
< mode_align
)
5411 return boolean_false_node
;
5413 /* Check if a compare_and_swap pattern exists for the mode which represents
5414 the required size. The pattern is not allowed to fail, so the existence
5415 of the pattern indicates support is present. */
5416 if (can_compare_and_swap_p (mode
, true))
5417 return boolean_true_node
;
5419 return boolean_false_node
;
5422 /* Return true if the parameters to call EXP represent an object which will
5423 always generate lock free instructions. The first argument represents the
5424 size of the object, and the second parameter is a pointer to the object
5425 itself. If NULL is passed for the object, then the result is based on
5426 typical alignment for an object of the specified size. Otherwise return
5430 expand_builtin_atomic_always_lock_free (tree exp
)
5433 tree arg0
= CALL_EXPR_ARG (exp
, 0);
5434 tree arg1
= CALL_EXPR_ARG (exp
, 1);
5436 if (TREE_CODE (arg0
) != INTEGER_CST
)
5438 error ("non-constant argument 1 to __atomic_always_lock_free");
5442 size
= fold_builtin_atomic_always_lock_free (arg0
, arg1
);
5443 if (size
== boolean_true_node
)
5448 /* Return a one or zero if it can be determined that object ARG1 of size ARG
5449 is lock free on this architecture. */
5452 fold_builtin_atomic_is_lock_free (tree arg0
, tree arg1
)
5454 if (!flag_inline_atomics
)
5457 /* If it isn't always lock free, don't generate a result. */
5458 if (fold_builtin_atomic_always_lock_free (arg0
, arg1
) == boolean_true_node
)
5459 return boolean_true_node
;
5464 /* Return true if the parameters to call EXP represent an object which will
5465 always generate lock free instructions. The first argument represents the
5466 size of the object, and the second parameter is a pointer to the object
5467 itself. If NULL is passed for the object, then the result is based on
5468 typical alignment for an object of the specified size. Otherwise return
5472 expand_builtin_atomic_is_lock_free (tree exp
)
5475 tree arg0
= CALL_EXPR_ARG (exp
, 0);
5476 tree arg1
= CALL_EXPR_ARG (exp
, 1);
5478 if (!INTEGRAL_TYPE_P (TREE_TYPE (arg0
)))
5480 error ("non-integer argument 1 to __atomic_is_lock_free");
5484 if (!flag_inline_atomics
)
5487 /* If the value is known at compile time, return the RTX for it. */
5488 size
= fold_builtin_atomic_is_lock_free (arg0
, arg1
);
5489 if (size
== boolean_true_node
)
5495 /* Expand the __atomic_thread_fence intrinsic:
5496 void __atomic_thread_fence (enum memmodel)
5497 EXP is the CALL_EXPR. */
5500 expand_builtin_atomic_thread_fence (tree exp
)
5502 enum memmodel model
= get_memmodel (CALL_EXPR_ARG (exp
, 0));
5503 expand_mem_thread_fence (model
);
5506 /* Expand the __atomic_signal_fence intrinsic:
5507 void __atomic_signal_fence (enum memmodel)
5508 EXP is the CALL_EXPR. */
5511 expand_builtin_atomic_signal_fence (tree exp
)
5513 enum memmodel model
= get_memmodel (CALL_EXPR_ARG (exp
, 0));
5514 expand_mem_signal_fence (model
);
5517 /* Expand the __sync_synchronize intrinsic. */
5520 expand_builtin_sync_synchronize (void)
5522 expand_mem_thread_fence (MEMMODEL_SYNC_SEQ_CST
);
5526 expand_builtin_thread_pointer (tree exp
, rtx target
)
5528 enum insn_code icode
;
5529 if (!validate_arglist (exp
, VOID_TYPE
))
5531 icode
= direct_optab_handler (get_thread_pointer_optab
, Pmode
);
5532 if (icode
!= CODE_FOR_nothing
)
5534 struct expand_operand op
;
5535 /* If the target is not sutitable then create a new target. */
5536 if (target
== NULL_RTX
5538 || GET_MODE (target
) != Pmode
)
5539 target
= gen_reg_rtx (Pmode
);
5540 create_output_operand (&op
, target
, Pmode
);
5541 expand_insn (icode
, 1, &op
);
5544 error ("__builtin_thread_pointer is not supported on this target");
5549 expand_builtin_set_thread_pointer (tree exp
)
5551 enum insn_code icode
;
5552 if (!validate_arglist (exp
, POINTER_TYPE
, VOID_TYPE
))
5554 icode
= direct_optab_handler (set_thread_pointer_optab
, Pmode
);
5555 if (icode
!= CODE_FOR_nothing
)
5557 struct expand_operand op
;
5558 rtx val
= expand_expr (CALL_EXPR_ARG (exp
, 0), NULL_RTX
,
5559 Pmode
, EXPAND_NORMAL
);
5560 create_input_operand (&op
, val
, Pmode
);
5561 expand_insn (icode
, 1, &op
);
5564 error ("__builtin_set_thread_pointer is not supported on this target");
5568 /* Emit code to restore the current value of stack. */
5571 expand_stack_restore (tree var
)
5574 rtx sa
= expand_normal (var
);
5576 sa
= convert_memory_address (Pmode
, sa
);
5578 prev
= get_last_insn ();
5579 emit_stack_restore (SAVE_BLOCK
, sa
);
5581 record_new_stack_level ();
5583 fixup_args_size_notes (prev
, get_last_insn (), 0);
5586 /* Emit code to save the current value of stack. */
5589 expand_stack_save (void)
5593 emit_stack_save (SAVE_BLOCK
, &ret
);
5598 /* Expand an expression EXP that calls a built-in function,
5599 with result going to TARGET if that's convenient
5600 (and in mode MODE if that's convenient).
5601 SUBTARGET may be used as the target for computing one of EXP's operands.
5602 IGNORE is nonzero if the value is to be ignored. */
5605 expand_builtin (tree exp
, rtx target
, rtx subtarget
, machine_mode mode
,
5608 tree fndecl
= get_callee_fndecl (exp
);
5609 enum built_in_function fcode
= DECL_FUNCTION_CODE (fndecl
);
5610 machine_mode target_mode
= TYPE_MODE (TREE_TYPE (exp
));
5613 if (DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_MD
)
5614 return targetm
.expand_builtin (exp
, target
, subtarget
, mode
, ignore
);
5616 /* When ASan is enabled, we don't want to expand some memory/string
5617 builtins and rely on libsanitizer's hooks. This allows us to avoid
5618 redundant checks and be sure, that possible overflow will be detected
5621 if ((flag_sanitize
& SANITIZE_ADDRESS
) && asan_intercepted_p (fcode
))
5622 return expand_call (exp
, target
, ignore
);
5624 /* When not optimizing, generate calls to library functions for a certain
5627 && !called_as_built_in (fndecl
)
5628 && fcode
!= BUILT_IN_FORK
5629 && fcode
!= BUILT_IN_EXECL
5630 && fcode
!= BUILT_IN_EXECV
5631 && fcode
!= BUILT_IN_EXECLP
5632 && fcode
!= BUILT_IN_EXECLE
5633 && fcode
!= BUILT_IN_EXECVP
5634 && fcode
!= BUILT_IN_EXECVE
5635 && fcode
!= BUILT_IN_ALLOCA
5636 && fcode
!= BUILT_IN_ALLOCA_WITH_ALIGN
5637 && fcode
!= BUILT_IN_FREE
5638 && fcode
!= BUILT_IN_CHKP_SET_PTR_BOUNDS
5639 && fcode
!= BUILT_IN_CHKP_INIT_PTR_BOUNDS
5640 && fcode
!= BUILT_IN_CHKP_NULL_PTR_BOUNDS
5641 && fcode
!= BUILT_IN_CHKP_COPY_PTR_BOUNDS
5642 && fcode
!= BUILT_IN_CHKP_NARROW_PTR_BOUNDS
5643 && fcode
!= BUILT_IN_CHKP_STORE_PTR_BOUNDS
5644 && fcode
!= BUILT_IN_CHKP_CHECK_PTR_LBOUNDS
5645 && fcode
!= BUILT_IN_CHKP_CHECK_PTR_UBOUNDS
5646 && fcode
!= BUILT_IN_CHKP_CHECK_PTR_BOUNDS
5647 && fcode
!= BUILT_IN_CHKP_GET_PTR_LBOUND
5648 && fcode
!= BUILT_IN_CHKP_GET_PTR_UBOUND
5649 && fcode
!= BUILT_IN_CHKP_BNDRET
)
5650 return expand_call (exp
, target
, ignore
);
5652 /* The built-in function expanders test for target == const0_rtx
5653 to determine whether the function's result will be ignored. */
5655 target
= const0_rtx
;
5657 /* If the result of a pure or const built-in function is ignored, and
5658 none of its arguments are volatile, we can avoid expanding the
5659 built-in call and just evaluate the arguments for side-effects. */
5660 if (target
== const0_rtx
5661 && ((flags
= flags_from_decl_or_type (fndecl
)) & (ECF_CONST
| ECF_PURE
))
5662 && !(flags
& ECF_LOOPING_CONST_OR_PURE
))
5664 bool volatilep
= false;
5666 call_expr_arg_iterator iter
;
5668 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, exp
)
5669 if (TREE_THIS_VOLATILE (arg
))
5677 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, exp
)
5678 expand_expr (arg
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
5683 /* expand_builtin_with_bounds is supposed to be used for
5684 instrumented builtin calls. */
5685 gcc_assert (!CALL_WITH_BOUNDS_P (exp
));
5689 CASE_FLT_FN (BUILT_IN_FABS
):
5690 case BUILT_IN_FABSD32
:
5691 case BUILT_IN_FABSD64
:
5692 case BUILT_IN_FABSD128
:
5693 target
= expand_builtin_fabs (exp
, target
, subtarget
);
5698 CASE_FLT_FN (BUILT_IN_COPYSIGN
):
5699 target
= expand_builtin_copysign (exp
, target
, subtarget
);
5704 /* Just do a normal library call if we were unable to fold
5706 CASE_FLT_FN (BUILT_IN_CABS
):
5709 CASE_FLT_FN (BUILT_IN_FMA
):
5710 target
= expand_builtin_mathfn_ternary (exp
, target
, subtarget
);
5715 CASE_FLT_FN (BUILT_IN_ILOGB
):
5716 if (! flag_unsafe_math_optimizations
)
5718 CASE_FLT_FN (BUILT_IN_ISINF
):
5719 CASE_FLT_FN (BUILT_IN_FINITE
):
5720 case BUILT_IN_ISFINITE
:
5721 case BUILT_IN_ISNORMAL
:
5722 target
= expand_builtin_interclass_mathfn (exp
, target
);
5727 CASE_FLT_FN (BUILT_IN_ICEIL
):
5728 CASE_FLT_FN (BUILT_IN_LCEIL
):
5729 CASE_FLT_FN (BUILT_IN_LLCEIL
):
5730 CASE_FLT_FN (BUILT_IN_LFLOOR
):
5731 CASE_FLT_FN (BUILT_IN_IFLOOR
):
5732 CASE_FLT_FN (BUILT_IN_LLFLOOR
):
5733 target
= expand_builtin_int_roundingfn (exp
, target
);
5738 CASE_FLT_FN (BUILT_IN_IRINT
):
5739 CASE_FLT_FN (BUILT_IN_LRINT
):
5740 CASE_FLT_FN (BUILT_IN_LLRINT
):
5741 CASE_FLT_FN (BUILT_IN_IROUND
):
5742 CASE_FLT_FN (BUILT_IN_LROUND
):
5743 CASE_FLT_FN (BUILT_IN_LLROUND
):
5744 target
= expand_builtin_int_roundingfn_2 (exp
, target
);
5749 CASE_FLT_FN (BUILT_IN_POWI
):
5750 target
= expand_builtin_powi (exp
, target
);
5755 CASE_FLT_FN (BUILT_IN_CEXPI
):
5756 target
= expand_builtin_cexpi (exp
, target
);
5757 gcc_assert (target
);
5760 CASE_FLT_FN (BUILT_IN_SIN
):
5761 CASE_FLT_FN (BUILT_IN_COS
):
5762 if (! flag_unsafe_math_optimizations
)
5764 target
= expand_builtin_mathfn_3 (exp
, target
, subtarget
);
5769 CASE_FLT_FN (BUILT_IN_SINCOS
):
5770 if (! flag_unsafe_math_optimizations
)
5772 target
= expand_builtin_sincos (exp
);
5777 case BUILT_IN_APPLY_ARGS
:
5778 return expand_builtin_apply_args ();
5780 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
5781 FUNCTION with a copy of the parameters described by
5782 ARGUMENTS, and ARGSIZE. It returns a block of memory
5783 allocated on the stack into which is stored all the registers
5784 that might possibly be used for returning the result of a
5785 function. ARGUMENTS is the value returned by
5786 __builtin_apply_args. ARGSIZE is the number of bytes of
5787 arguments that must be copied. ??? How should this value be
5788 computed? We'll also need a safe worst case value for varargs
5790 case BUILT_IN_APPLY
:
5791 if (!validate_arglist (exp
, POINTER_TYPE
,
5792 POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
)
5793 && !validate_arglist (exp
, REFERENCE_TYPE
,
5794 POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
5800 ops
[0] = expand_normal (CALL_EXPR_ARG (exp
, 0));
5801 ops
[1] = expand_normal (CALL_EXPR_ARG (exp
, 1));
5802 ops
[2] = expand_normal (CALL_EXPR_ARG (exp
, 2));
5804 return expand_builtin_apply (ops
[0], ops
[1], ops
[2]);
5807 /* __builtin_return (RESULT) causes the function to return the
5808 value described by RESULT. RESULT is address of the block of
5809 memory returned by __builtin_apply. */
5810 case BUILT_IN_RETURN
:
5811 if (validate_arglist (exp
, POINTER_TYPE
, VOID_TYPE
))
5812 expand_builtin_return (expand_normal (CALL_EXPR_ARG (exp
, 0)));
5815 case BUILT_IN_SAVEREGS
:
5816 return expand_builtin_saveregs ();
5818 case BUILT_IN_VA_ARG_PACK
:
5819 /* All valid uses of __builtin_va_arg_pack () are removed during
5821 error ("%Kinvalid use of %<__builtin_va_arg_pack ()%>", exp
);
5824 case BUILT_IN_VA_ARG_PACK_LEN
:
5825 /* All valid uses of __builtin_va_arg_pack_len () are removed during
5827 error ("%Kinvalid use of %<__builtin_va_arg_pack_len ()%>", exp
);
5830 /* Return the address of the first anonymous stack arg. */
5831 case BUILT_IN_NEXT_ARG
:
5832 if (fold_builtin_next_arg (exp
, false))
5834 return expand_builtin_next_arg ();
5836 case BUILT_IN_CLEAR_CACHE
:
5837 target
= expand_builtin___clear_cache (exp
);
5842 case BUILT_IN_CLASSIFY_TYPE
:
5843 return expand_builtin_classify_type (exp
);
5845 case BUILT_IN_CONSTANT_P
:
5848 case BUILT_IN_FRAME_ADDRESS
:
5849 case BUILT_IN_RETURN_ADDRESS
:
5850 return expand_builtin_frame_address (fndecl
, exp
);
5852 /* Returns the address of the area where the structure is returned.
5854 case BUILT_IN_AGGREGATE_INCOMING_ADDRESS
:
5855 if (call_expr_nargs (exp
) != 0
5856 || ! AGGREGATE_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
)))
5857 || !MEM_P (DECL_RTL (DECL_RESULT (current_function_decl
))))
5860 return XEXP (DECL_RTL (DECL_RESULT (current_function_decl
)), 0);
5862 case BUILT_IN_ALLOCA
:
5863 case BUILT_IN_ALLOCA_WITH_ALIGN
:
5864 /* If the allocation stems from the declaration of a variable-sized
5865 object, it cannot accumulate. */
5866 target
= expand_builtin_alloca (exp
, CALL_ALLOCA_FOR_VAR_P (exp
));
5871 case BUILT_IN_STACK_SAVE
:
5872 return expand_stack_save ();
5874 case BUILT_IN_STACK_RESTORE
:
5875 expand_stack_restore (CALL_EXPR_ARG (exp
, 0));
5878 case BUILT_IN_BSWAP16
:
5879 case BUILT_IN_BSWAP32
:
5880 case BUILT_IN_BSWAP64
:
5881 target
= expand_builtin_bswap (target_mode
, exp
, target
, subtarget
);
5886 CASE_INT_FN (BUILT_IN_FFS
):
5887 target
= expand_builtin_unop (target_mode
, exp
, target
,
5888 subtarget
, ffs_optab
);
5893 CASE_INT_FN (BUILT_IN_CLZ
):
5894 target
= expand_builtin_unop (target_mode
, exp
, target
,
5895 subtarget
, clz_optab
);
5900 CASE_INT_FN (BUILT_IN_CTZ
):
5901 target
= expand_builtin_unop (target_mode
, exp
, target
,
5902 subtarget
, ctz_optab
);
5907 CASE_INT_FN (BUILT_IN_CLRSB
):
5908 target
= expand_builtin_unop (target_mode
, exp
, target
,
5909 subtarget
, clrsb_optab
);
5914 CASE_INT_FN (BUILT_IN_POPCOUNT
):
5915 target
= expand_builtin_unop (target_mode
, exp
, target
,
5916 subtarget
, popcount_optab
);
5921 CASE_INT_FN (BUILT_IN_PARITY
):
5922 target
= expand_builtin_unop (target_mode
, exp
, target
,
5923 subtarget
, parity_optab
);
5928 case BUILT_IN_STRLEN
:
5929 target
= expand_builtin_strlen (exp
, target
, target_mode
);
5934 case BUILT_IN_STRCPY
:
5935 target
= expand_builtin_strcpy (exp
, target
);
5940 case BUILT_IN_STRNCPY
:
5941 target
= expand_builtin_strncpy (exp
, target
);
5946 case BUILT_IN_STPCPY
:
5947 target
= expand_builtin_stpcpy (exp
, target
, mode
);
5952 case BUILT_IN_MEMCPY
:
5953 target
= expand_builtin_memcpy (exp
, target
);
5958 case BUILT_IN_MEMPCPY
:
5959 target
= expand_builtin_mempcpy (exp
, target
, mode
);
5964 case BUILT_IN_MEMSET
:
5965 target
= expand_builtin_memset (exp
, target
, mode
);
5970 case BUILT_IN_BZERO
:
5971 target
= expand_builtin_bzero (exp
);
5976 case BUILT_IN_STRCMP
:
5977 target
= expand_builtin_strcmp (exp
, target
);
5982 case BUILT_IN_STRNCMP
:
5983 target
= expand_builtin_strncmp (exp
, target
, mode
);
5989 case BUILT_IN_MEMCMP
:
5990 target
= expand_builtin_memcmp (exp
, target
);
5995 case BUILT_IN_SETJMP
:
5996 /* This should have been lowered to the builtins below. */
5999 case BUILT_IN_SETJMP_SETUP
:
6000 /* __builtin_setjmp_setup is passed a pointer to an array of five words
6001 and the receiver label. */
6002 if (validate_arglist (exp
, POINTER_TYPE
, POINTER_TYPE
, VOID_TYPE
))
6004 rtx buf_addr
= expand_expr (CALL_EXPR_ARG (exp
, 0), subtarget
,
6005 VOIDmode
, EXPAND_NORMAL
);
6006 tree label
= TREE_OPERAND (CALL_EXPR_ARG (exp
, 1), 0);
6007 rtx_insn
*label_r
= label_rtx (label
);
6009 /* This is copied from the handling of non-local gotos. */
6010 expand_builtin_setjmp_setup (buf_addr
, label_r
);
6011 nonlocal_goto_handler_labels
6012 = gen_rtx_INSN_LIST (VOIDmode
, label_r
,
6013 nonlocal_goto_handler_labels
);
6014 /* ??? Do not let expand_label treat us as such since we would
6015 not want to be both on the list of non-local labels and on
6016 the list of forced labels. */
6017 FORCED_LABEL (label
) = 0;
6022 case BUILT_IN_SETJMP_RECEIVER
:
6023 /* __builtin_setjmp_receiver is passed the receiver label. */
6024 if (validate_arglist (exp
, POINTER_TYPE
, VOID_TYPE
))
6026 tree label
= TREE_OPERAND (CALL_EXPR_ARG (exp
, 0), 0);
6027 rtx_insn
*label_r
= label_rtx (label
);
6029 expand_builtin_setjmp_receiver (label_r
);
6034 /* __builtin_longjmp is passed a pointer to an array of five words.
6035 It's similar to the C library longjmp function but works with
6036 __builtin_setjmp above. */
6037 case BUILT_IN_LONGJMP
:
6038 if (validate_arglist (exp
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
6040 rtx buf_addr
= expand_expr (CALL_EXPR_ARG (exp
, 0), subtarget
,
6041 VOIDmode
, EXPAND_NORMAL
);
6042 rtx value
= expand_normal (CALL_EXPR_ARG (exp
, 1));
6044 if (value
!= const1_rtx
)
6046 error ("%<__builtin_longjmp%> second argument must be 1");
6050 expand_builtin_longjmp (buf_addr
, value
);
6055 case BUILT_IN_NONLOCAL_GOTO
:
6056 target
= expand_builtin_nonlocal_goto (exp
);
6061 /* This updates the setjmp buffer that is its argument with the value
6062 of the current stack pointer. */
6063 case BUILT_IN_UPDATE_SETJMP_BUF
:
6064 if (validate_arglist (exp
, POINTER_TYPE
, VOID_TYPE
))
6067 = expand_normal (CALL_EXPR_ARG (exp
, 0));
6069 expand_builtin_update_setjmp_buf (buf_addr
);
6075 expand_builtin_trap ();
6078 case BUILT_IN_UNREACHABLE
:
6079 expand_builtin_unreachable ();
6082 CASE_FLT_FN (BUILT_IN_SIGNBIT
):
6083 case BUILT_IN_SIGNBITD32
:
6084 case BUILT_IN_SIGNBITD64
:
6085 case BUILT_IN_SIGNBITD128
:
6086 target
= expand_builtin_signbit (exp
, target
);
6091 /* Various hooks for the DWARF 2 __throw routine. */
6092 case BUILT_IN_UNWIND_INIT
:
6093 expand_builtin_unwind_init ();
6095 case BUILT_IN_DWARF_CFA
:
6096 return virtual_cfa_rtx
;
6097 #ifdef DWARF2_UNWIND_INFO
6098 case BUILT_IN_DWARF_SP_COLUMN
:
6099 return expand_builtin_dwarf_sp_column ();
6100 case BUILT_IN_INIT_DWARF_REG_SIZES
:
6101 expand_builtin_init_dwarf_reg_sizes (CALL_EXPR_ARG (exp
, 0));
6104 case BUILT_IN_FROB_RETURN_ADDR
:
6105 return expand_builtin_frob_return_addr (CALL_EXPR_ARG (exp
, 0));
6106 case BUILT_IN_EXTRACT_RETURN_ADDR
:
6107 return expand_builtin_extract_return_addr (CALL_EXPR_ARG (exp
, 0));
6108 case BUILT_IN_EH_RETURN
:
6109 expand_builtin_eh_return (CALL_EXPR_ARG (exp
, 0),
6110 CALL_EXPR_ARG (exp
, 1));
6112 case BUILT_IN_EH_RETURN_DATA_REGNO
:
6113 return expand_builtin_eh_return_data_regno (exp
);
6114 case BUILT_IN_EXTEND_POINTER
:
6115 return expand_builtin_extend_pointer (CALL_EXPR_ARG (exp
, 0));
6116 case BUILT_IN_EH_POINTER
:
6117 return expand_builtin_eh_pointer (exp
);
6118 case BUILT_IN_EH_FILTER
:
6119 return expand_builtin_eh_filter (exp
);
6120 case BUILT_IN_EH_COPY_VALUES
:
6121 return expand_builtin_eh_copy_values (exp
);
6123 case BUILT_IN_VA_START
:
6124 return expand_builtin_va_start (exp
);
6125 case BUILT_IN_VA_END
:
6126 return expand_builtin_va_end (exp
);
6127 case BUILT_IN_VA_COPY
:
6128 return expand_builtin_va_copy (exp
);
6129 case BUILT_IN_EXPECT
:
6130 return expand_builtin_expect (exp
, target
);
6131 case BUILT_IN_ASSUME_ALIGNED
:
6132 return expand_builtin_assume_aligned (exp
, target
);
6133 case BUILT_IN_PREFETCH
:
6134 expand_builtin_prefetch (exp
);
6137 case BUILT_IN_INIT_TRAMPOLINE
:
6138 return expand_builtin_init_trampoline (exp
, true);
6139 case BUILT_IN_INIT_HEAP_TRAMPOLINE
:
6140 return expand_builtin_init_trampoline (exp
, false);
6141 case BUILT_IN_ADJUST_TRAMPOLINE
:
6142 return expand_builtin_adjust_trampoline (exp
);
6145 case BUILT_IN_EXECL
:
6146 case BUILT_IN_EXECV
:
6147 case BUILT_IN_EXECLP
:
6148 case BUILT_IN_EXECLE
:
6149 case BUILT_IN_EXECVP
:
6150 case BUILT_IN_EXECVE
:
6151 target
= expand_builtin_fork_or_exec (fndecl
, exp
, target
, ignore
);
6156 case BUILT_IN_SYNC_FETCH_AND_ADD_1
:
6157 case BUILT_IN_SYNC_FETCH_AND_ADD_2
:
6158 case BUILT_IN_SYNC_FETCH_AND_ADD_4
:
6159 case BUILT_IN_SYNC_FETCH_AND_ADD_8
:
6160 case BUILT_IN_SYNC_FETCH_AND_ADD_16
:
6161 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_SYNC_FETCH_AND_ADD_1
);
6162 target
= expand_builtin_sync_operation (mode
, exp
, PLUS
, false, target
);
6167 case BUILT_IN_SYNC_FETCH_AND_SUB_1
:
6168 case BUILT_IN_SYNC_FETCH_AND_SUB_2
:
6169 case BUILT_IN_SYNC_FETCH_AND_SUB_4
:
6170 case BUILT_IN_SYNC_FETCH_AND_SUB_8
:
6171 case BUILT_IN_SYNC_FETCH_AND_SUB_16
:
6172 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_SYNC_FETCH_AND_SUB_1
);
6173 target
= expand_builtin_sync_operation (mode
, exp
, MINUS
, false, target
);
6178 case BUILT_IN_SYNC_FETCH_AND_OR_1
:
6179 case BUILT_IN_SYNC_FETCH_AND_OR_2
:
6180 case BUILT_IN_SYNC_FETCH_AND_OR_4
:
6181 case BUILT_IN_SYNC_FETCH_AND_OR_8
:
6182 case BUILT_IN_SYNC_FETCH_AND_OR_16
:
6183 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_SYNC_FETCH_AND_OR_1
);
6184 target
= expand_builtin_sync_operation (mode
, exp
, IOR
, false, target
);
6189 case BUILT_IN_SYNC_FETCH_AND_AND_1
:
6190 case BUILT_IN_SYNC_FETCH_AND_AND_2
:
6191 case BUILT_IN_SYNC_FETCH_AND_AND_4
:
6192 case BUILT_IN_SYNC_FETCH_AND_AND_8
:
6193 case BUILT_IN_SYNC_FETCH_AND_AND_16
:
6194 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_SYNC_FETCH_AND_AND_1
);
6195 target
= expand_builtin_sync_operation (mode
, exp
, AND
, false, target
);
6200 case BUILT_IN_SYNC_FETCH_AND_XOR_1
:
6201 case BUILT_IN_SYNC_FETCH_AND_XOR_2
:
6202 case BUILT_IN_SYNC_FETCH_AND_XOR_4
:
6203 case BUILT_IN_SYNC_FETCH_AND_XOR_8
:
6204 case BUILT_IN_SYNC_FETCH_AND_XOR_16
:
6205 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_SYNC_FETCH_AND_XOR_1
);
6206 target
= expand_builtin_sync_operation (mode
, exp
, XOR
, false, target
);
6211 case BUILT_IN_SYNC_FETCH_AND_NAND_1
:
6212 case BUILT_IN_SYNC_FETCH_AND_NAND_2
:
6213 case BUILT_IN_SYNC_FETCH_AND_NAND_4
:
6214 case BUILT_IN_SYNC_FETCH_AND_NAND_8
:
6215 case BUILT_IN_SYNC_FETCH_AND_NAND_16
:
6216 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_SYNC_FETCH_AND_NAND_1
);
6217 target
= expand_builtin_sync_operation (mode
, exp
, NOT
, false, target
);
6222 case BUILT_IN_SYNC_ADD_AND_FETCH_1
:
6223 case BUILT_IN_SYNC_ADD_AND_FETCH_2
:
6224 case BUILT_IN_SYNC_ADD_AND_FETCH_4
:
6225 case BUILT_IN_SYNC_ADD_AND_FETCH_8
:
6226 case BUILT_IN_SYNC_ADD_AND_FETCH_16
:
6227 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_SYNC_ADD_AND_FETCH_1
);
6228 target
= expand_builtin_sync_operation (mode
, exp
, PLUS
, true, target
);
6233 case BUILT_IN_SYNC_SUB_AND_FETCH_1
:
6234 case BUILT_IN_SYNC_SUB_AND_FETCH_2
:
6235 case BUILT_IN_SYNC_SUB_AND_FETCH_4
:
6236 case BUILT_IN_SYNC_SUB_AND_FETCH_8
:
6237 case BUILT_IN_SYNC_SUB_AND_FETCH_16
:
6238 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_SYNC_SUB_AND_FETCH_1
);
6239 target
= expand_builtin_sync_operation (mode
, exp
, MINUS
, true, target
);
6244 case BUILT_IN_SYNC_OR_AND_FETCH_1
:
6245 case BUILT_IN_SYNC_OR_AND_FETCH_2
:
6246 case BUILT_IN_SYNC_OR_AND_FETCH_4
:
6247 case BUILT_IN_SYNC_OR_AND_FETCH_8
:
6248 case BUILT_IN_SYNC_OR_AND_FETCH_16
:
6249 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_SYNC_OR_AND_FETCH_1
);
6250 target
= expand_builtin_sync_operation (mode
, exp
, IOR
, true, target
);
6255 case BUILT_IN_SYNC_AND_AND_FETCH_1
:
6256 case BUILT_IN_SYNC_AND_AND_FETCH_2
:
6257 case BUILT_IN_SYNC_AND_AND_FETCH_4
:
6258 case BUILT_IN_SYNC_AND_AND_FETCH_8
:
6259 case BUILT_IN_SYNC_AND_AND_FETCH_16
:
6260 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_SYNC_AND_AND_FETCH_1
);
6261 target
= expand_builtin_sync_operation (mode
, exp
, AND
, true, target
);
6266 case BUILT_IN_SYNC_XOR_AND_FETCH_1
:
6267 case BUILT_IN_SYNC_XOR_AND_FETCH_2
:
6268 case BUILT_IN_SYNC_XOR_AND_FETCH_4
:
6269 case BUILT_IN_SYNC_XOR_AND_FETCH_8
:
6270 case BUILT_IN_SYNC_XOR_AND_FETCH_16
:
6271 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_SYNC_XOR_AND_FETCH_1
);
6272 target
= expand_builtin_sync_operation (mode
, exp
, XOR
, true, target
);
6277 case BUILT_IN_SYNC_NAND_AND_FETCH_1
:
6278 case BUILT_IN_SYNC_NAND_AND_FETCH_2
:
6279 case BUILT_IN_SYNC_NAND_AND_FETCH_4
:
6280 case BUILT_IN_SYNC_NAND_AND_FETCH_8
:
6281 case BUILT_IN_SYNC_NAND_AND_FETCH_16
:
6282 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_SYNC_NAND_AND_FETCH_1
);
6283 target
= expand_builtin_sync_operation (mode
, exp
, NOT
, true, target
);
6288 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_1
:
6289 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_2
:
6290 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_4
:
6291 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_8
:
6292 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_16
:
6293 if (mode
== VOIDmode
)
6294 mode
= TYPE_MODE (boolean_type_node
);
6295 if (!target
|| !register_operand (target
, mode
))
6296 target
= gen_reg_rtx (mode
);
6298 mode
= get_builtin_sync_mode
6299 (fcode
- BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_1
);
6300 target
= expand_builtin_compare_and_swap (mode
, exp
, true, target
);
6305 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_1
:
6306 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_2
:
6307 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_4
:
6308 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_8
:
6309 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_16
:
6310 mode
= get_builtin_sync_mode
6311 (fcode
- BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_1
);
6312 target
= expand_builtin_compare_and_swap (mode
, exp
, false, target
);
6317 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_1
:
6318 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_2
:
6319 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_4
:
6320 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_8
:
6321 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_16
:
6322 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_SYNC_LOCK_TEST_AND_SET_1
);
6323 target
= expand_builtin_sync_lock_test_and_set (mode
, exp
, target
);
6328 case BUILT_IN_SYNC_LOCK_RELEASE_1
:
6329 case BUILT_IN_SYNC_LOCK_RELEASE_2
:
6330 case BUILT_IN_SYNC_LOCK_RELEASE_4
:
6331 case BUILT_IN_SYNC_LOCK_RELEASE_8
:
6332 case BUILT_IN_SYNC_LOCK_RELEASE_16
:
6333 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_SYNC_LOCK_RELEASE_1
);
6334 expand_builtin_sync_lock_release (mode
, exp
);
6337 case BUILT_IN_SYNC_SYNCHRONIZE
:
6338 expand_builtin_sync_synchronize ();
6341 case BUILT_IN_ATOMIC_EXCHANGE_1
:
6342 case BUILT_IN_ATOMIC_EXCHANGE_2
:
6343 case BUILT_IN_ATOMIC_EXCHANGE_4
:
6344 case BUILT_IN_ATOMIC_EXCHANGE_8
:
6345 case BUILT_IN_ATOMIC_EXCHANGE_16
:
6346 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_ATOMIC_EXCHANGE_1
);
6347 target
= expand_builtin_atomic_exchange (mode
, exp
, target
);
6352 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_1
:
6353 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_2
:
6354 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_4
:
6355 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_8
:
6356 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_16
:
6358 unsigned int nargs
, z
;
6359 vec
<tree
, va_gc
> *vec
;
6362 get_builtin_sync_mode (fcode
- BUILT_IN_ATOMIC_COMPARE_EXCHANGE_1
);
6363 target
= expand_builtin_atomic_compare_exchange (mode
, exp
, target
);
6367 /* If this is turned into an external library call, the weak parameter
6368 must be dropped to match the expected parameter list. */
6369 nargs
= call_expr_nargs (exp
);
6370 vec_alloc (vec
, nargs
- 1);
6371 for (z
= 0; z
< 3; z
++)
6372 vec
->quick_push (CALL_EXPR_ARG (exp
, z
));
6373 /* Skip the boolean weak parameter. */
6374 for (z
= 4; z
< 6; z
++)
6375 vec
->quick_push (CALL_EXPR_ARG (exp
, z
));
6376 exp
= build_call_vec (TREE_TYPE (exp
), CALL_EXPR_FN (exp
), vec
);
6380 case BUILT_IN_ATOMIC_LOAD_1
:
6381 case BUILT_IN_ATOMIC_LOAD_2
:
6382 case BUILT_IN_ATOMIC_LOAD_4
:
6383 case BUILT_IN_ATOMIC_LOAD_8
:
6384 case BUILT_IN_ATOMIC_LOAD_16
:
6385 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_ATOMIC_LOAD_1
);
6386 target
= expand_builtin_atomic_load (mode
, exp
, target
);
6391 case BUILT_IN_ATOMIC_STORE_1
:
6392 case BUILT_IN_ATOMIC_STORE_2
:
6393 case BUILT_IN_ATOMIC_STORE_4
:
6394 case BUILT_IN_ATOMIC_STORE_8
:
6395 case BUILT_IN_ATOMIC_STORE_16
:
6396 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_ATOMIC_STORE_1
);
6397 target
= expand_builtin_atomic_store (mode
, exp
);
6402 case BUILT_IN_ATOMIC_ADD_FETCH_1
:
6403 case BUILT_IN_ATOMIC_ADD_FETCH_2
:
6404 case BUILT_IN_ATOMIC_ADD_FETCH_4
:
6405 case BUILT_IN_ATOMIC_ADD_FETCH_8
:
6406 case BUILT_IN_ATOMIC_ADD_FETCH_16
:
6408 enum built_in_function lib
;
6409 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_ATOMIC_ADD_FETCH_1
);
6410 lib
= (enum built_in_function
)((int)BUILT_IN_ATOMIC_FETCH_ADD_1
+
6411 (fcode
- BUILT_IN_ATOMIC_ADD_FETCH_1
));
6412 target
= expand_builtin_atomic_fetch_op (mode
, exp
, target
, PLUS
, true,
6418 case BUILT_IN_ATOMIC_SUB_FETCH_1
:
6419 case BUILT_IN_ATOMIC_SUB_FETCH_2
:
6420 case BUILT_IN_ATOMIC_SUB_FETCH_4
:
6421 case BUILT_IN_ATOMIC_SUB_FETCH_8
:
6422 case BUILT_IN_ATOMIC_SUB_FETCH_16
:
6424 enum built_in_function lib
;
6425 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_ATOMIC_SUB_FETCH_1
);
6426 lib
= (enum built_in_function
)((int)BUILT_IN_ATOMIC_FETCH_SUB_1
+
6427 (fcode
- BUILT_IN_ATOMIC_SUB_FETCH_1
));
6428 target
= expand_builtin_atomic_fetch_op (mode
, exp
, target
, MINUS
, true,
6434 case BUILT_IN_ATOMIC_AND_FETCH_1
:
6435 case BUILT_IN_ATOMIC_AND_FETCH_2
:
6436 case BUILT_IN_ATOMIC_AND_FETCH_4
:
6437 case BUILT_IN_ATOMIC_AND_FETCH_8
:
6438 case BUILT_IN_ATOMIC_AND_FETCH_16
:
6440 enum built_in_function lib
;
6441 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_ATOMIC_AND_FETCH_1
);
6442 lib
= (enum built_in_function
)((int)BUILT_IN_ATOMIC_FETCH_AND_1
+
6443 (fcode
- BUILT_IN_ATOMIC_AND_FETCH_1
));
6444 target
= expand_builtin_atomic_fetch_op (mode
, exp
, target
, AND
, true,
6450 case BUILT_IN_ATOMIC_NAND_FETCH_1
:
6451 case BUILT_IN_ATOMIC_NAND_FETCH_2
:
6452 case BUILT_IN_ATOMIC_NAND_FETCH_4
:
6453 case BUILT_IN_ATOMIC_NAND_FETCH_8
:
6454 case BUILT_IN_ATOMIC_NAND_FETCH_16
:
6456 enum built_in_function lib
;
6457 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_ATOMIC_NAND_FETCH_1
);
6458 lib
= (enum built_in_function
)((int)BUILT_IN_ATOMIC_FETCH_NAND_1
+
6459 (fcode
- BUILT_IN_ATOMIC_NAND_FETCH_1
));
6460 target
= expand_builtin_atomic_fetch_op (mode
, exp
, target
, NOT
, true,
6466 case BUILT_IN_ATOMIC_XOR_FETCH_1
:
6467 case BUILT_IN_ATOMIC_XOR_FETCH_2
:
6468 case BUILT_IN_ATOMIC_XOR_FETCH_4
:
6469 case BUILT_IN_ATOMIC_XOR_FETCH_8
:
6470 case BUILT_IN_ATOMIC_XOR_FETCH_16
:
6472 enum built_in_function lib
;
6473 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_ATOMIC_XOR_FETCH_1
);
6474 lib
= (enum built_in_function
)((int)BUILT_IN_ATOMIC_FETCH_XOR_1
+
6475 (fcode
- BUILT_IN_ATOMIC_XOR_FETCH_1
));
6476 target
= expand_builtin_atomic_fetch_op (mode
, exp
, target
, XOR
, true,
6482 case BUILT_IN_ATOMIC_OR_FETCH_1
:
6483 case BUILT_IN_ATOMIC_OR_FETCH_2
:
6484 case BUILT_IN_ATOMIC_OR_FETCH_4
:
6485 case BUILT_IN_ATOMIC_OR_FETCH_8
:
6486 case BUILT_IN_ATOMIC_OR_FETCH_16
:
6488 enum built_in_function lib
;
6489 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_ATOMIC_OR_FETCH_1
);
6490 lib
= (enum built_in_function
)((int)BUILT_IN_ATOMIC_FETCH_OR_1
+
6491 (fcode
- BUILT_IN_ATOMIC_OR_FETCH_1
));
6492 target
= expand_builtin_atomic_fetch_op (mode
, exp
, target
, IOR
, true,
6498 case BUILT_IN_ATOMIC_FETCH_ADD_1
:
6499 case BUILT_IN_ATOMIC_FETCH_ADD_2
:
6500 case BUILT_IN_ATOMIC_FETCH_ADD_4
:
6501 case BUILT_IN_ATOMIC_FETCH_ADD_8
:
6502 case BUILT_IN_ATOMIC_FETCH_ADD_16
:
6503 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_ATOMIC_FETCH_ADD_1
);
6504 target
= expand_builtin_atomic_fetch_op (mode
, exp
, target
, PLUS
, false,
6505 ignore
, BUILT_IN_NONE
);
6510 case BUILT_IN_ATOMIC_FETCH_SUB_1
:
6511 case BUILT_IN_ATOMIC_FETCH_SUB_2
:
6512 case BUILT_IN_ATOMIC_FETCH_SUB_4
:
6513 case BUILT_IN_ATOMIC_FETCH_SUB_8
:
6514 case BUILT_IN_ATOMIC_FETCH_SUB_16
:
6515 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_ATOMIC_FETCH_SUB_1
);
6516 target
= expand_builtin_atomic_fetch_op (mode
, exp
, target
, MINUS
, false,
6517 ignore
, BUILT_IN_NONE
);
6522 case BUILT_IN_ATOMIC_FETCH_AND_1
:
6523 case BUILT_IN_ATOMIC_FETCH_AND_2
:
6524 case BUILT_IN_ATOMIC_FETCH_AND_4
:
6525 case BUILT_IN_ATOMIC_FETCH_AND_8
:
6526 case BUILT_IN_ATOMIC_FETCH_AND_16
:
6527 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_ATOMIC_FETCH_AND_1
);
6528 target
= expand_builtin_atomic_fetch_op (mode
, exp
, target
, AND
, false,
6529 ignore
, BUILT_IN_NONE
);
6534 case BUILT_IN_ATOMIC_FETCH_NAND_1
:
6535 case BUILT_IN_ATOMIC_FETCH_NAND_2
:
6536 case BUILT_IN_ATOMIC_FETCH_NAND_4
:
6537 case BUILT_IN_ATOMIC_FETCH_NAND_8
:
6538 case BUILT_IN_ATOMIC_FETCH_NAND_16
:
6539 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_ATOMIC_FETCH_NAND_1
);
6540 target
= expand_builtin_atomic_fetch_op (mode
, exp
, target
, NOT
, false,
6541 ignore
, BUILT_IN_NONE
);
6546 case BUILT_IN_ATOMIC_FETCH_XOR_1
:
6547 case BUILT_IN_ATOMIC_FETCH_XOR_2
:
6548 case BUILT_IN_ATOMIC_FETCH_XOR_4
:
6549 case BUILT_IN_ATOMIC_FETCH_XOR_8
:
6550 case BUILT_IN_ATOMIC_FETCH_XOR_16
:
6551 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_ATOMIC_FETCH_XOR_1
);
6552 target
= expand_builtin_atomic_fetch_op (mode
, exp
, target
, XOR
, false,
6553 ignore
, BUILT_IN_NONE
);
6558 case BUILT_IN_ATOMIC_FETCH_OR_1
:
6559 case BUILT_IN_ATOMIC_FETCH_OR_2
:
6560 case BUILT_IN_ATOMIC_FETCH_OR_4
:
6561 case BUILT_IN_ATOMIC_FETCH_OR_8
:
6562 case BUILT_IN_ATOMIC_FETCH_OR_16
:
6563 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_ATOMIC_FETCH_OR_1
);
6564 target
= expand_builtin_atomic_fetch_op (mode
, exp
, target
, IOR
, false,
6565 ignore
, BUILT_IN_NONE
);
6570 case BUILT_IN_ATOMIC_TEST_AND_SET
:
6571 return expand_builtin_atomic_test_and_set (exp
, target
);
6573 case BUILT_IN_ATOMIC_CLEAR
:
6574 return expand_builtin_atomic_clear (exp
);
6576 case BUILT_IN_ATOMIC_ALWAYS_LOCK_FREE
:
6577 return expand_builtin_atomic_always_lock_free (exp
);
6579 case BUILT_IN_ATOMIC_IS_LOCK_FREE
:
6580 target
= expand_builtin_atomic_is_lock_free (exp
);
6585 case BUILT_IN_ATOMIC_THREAD_FENCE
:
6586 expand_builtin_atomic_thread_fence (exp
);
6589 case BUILT_IN_ATOMIC_SIGNAL_FENCE
:
6590 expand_builtin_atomic_signal_fence (exp
);
6593 case BUILT_IN_OBJECT_SIZE
:
6594 return expand_builtin_object_size (exp
);
6596 case BUILT_IN_MEMCPY_CHK
:
6597 case BUILT_IN_MEMPCPY_CHK
:
6598 case BUILT_IN_MEMMOVE_CHK
:
6599 case BUILT_IN_MEMSET_CHK
:
6600 target
= expand_builtin_memory_chk (exp
, target
, mode
, fcode
);
6605 case BUILT_IN_STRCPY_CHK
:
6606 case BUILT_IN_STPCPY_CHK
:
6607 case BUILT_IN_STRNCPY_CHK
:
6608 case BUILT_IN_STPNCPY_CHK
:
6609 case BUILT_IN_STRCAT_CHK
:
6610 case BUILT_IN_STRNCAT_CHK
:
6611 case BUILT_IN_SNPRINTF_CHK
:
6612 case BUILT_IN_VSNPRINTF_CHK
:
6613 maybe_emit_chk_warning (exp
, fcode
);
6616 case BUILT_IN_SPRINTF_CHK
:
6617 case BUILT_IN_VSPRINTF_CHK
:
6618 maybe_emit_sprintf_chk_warning (exp
, fcode
);
6622 if (warn_free_nonheap_object
)
6623 maybe_emit_free_warning (exp
);
6626 case BUILT_IN_THREAD_POINTER
:
6627 return expand_builtin_thread_pointer (exp
, target
);
6629 case BUILT_IN_SET_THREAD_POINTER
:
6630 expand_builtin_set_thread_pointer (exp
);
6633 case BUILT_IN_CILK_DETACH
:
6634 expand_builtin_cilk_detach (exp
);
6637 case BUILT_IN_CILK_POP_FRAME
:
6638 expand_builtin_cilk_pop_frame (exp
);
6641 case BUILT_IN_CHKP_INIT_PTR_BOUNDS
:
6642 case BUILT_IN_CHKP_NULL_PTR_BOUNDS
:
6643 case BUILT_IN_CHKP_COPY_PTR_BOUNDS
:
6644 case BUILT_IN_CHKP_CHECK_PTR_LBOUNDS
:
6645 case BUILT_IN_CHKP_CHECK_PTR_UBOUNDS
:
6646 case BUILT_IN_CHKP_CHECK_PTR_BOUNDS
:
6647 case BUILT_IN_CHKP_SET_PTR_BOUNDS
:
6648 case BUILT_IN_CHKP_NARROW_PTR_BOUNDS
:
6649 case BUILT_IN_CHKP_STORE_PTR_BOUNDS
:
6650 case BUILT_IN_CHKP_GET_PTR_LBOUND
:
6651 case BUILT_IN_CHKP_GET_PTR_UBOUND
:
6652 /* We allow user CHKP builtins if Pointer Bounds
6654 if (!chkp_function_instrumented_p (current_function_decl
))
6656 if (fcode
== BUILT_IN_CHKP_SET_PTR_BOUNDS
6657 || fcode
== BUILT_IN_CHKP_NARROW_PTR_BOUNDS
6658 || fcode
== BUILT_IN_CHKP_INIT_PTR_BOUNDS
6659 || fcode
== BUILT_IN_CHKP_NULL_PTR_BOUNDS
6660 || fcode
== BUILT_IN_CHKP_COPY_PTR_BOUNDS
)
6661 return expand_normal (CALL_EXPR_ARG (exp
, 0));
6662 else if (fcode
== BUILT_IN_CHKP_GET_PTR_LBOUND
)
6663 return expand_normal (size_zero_node
);
6664 else if (fcode
== BUILT_IN_CHKP_GET_PTR_UBOUND
)
6665 return expand_normal (size_int (-1));
6671 case BUILT_IN_CHKP_BNDMK
:
6672 case BUILT_IN_CHKP_BNDSTX
:
6673 case BUILT_IN_CHKP_BNDCL
:
6674 case BUILT_IN_CHKP_BNDCU
:
6675 case BUILT_IN_CHKP_BNDLDX
:
6676 case BUILT_IN_CHKP_BNDRET
:
6677 case BUILT_IN_CHKP_INTERSECT
:
6678 case BUILT_IN_CHKP_NARROW
:
6679 case BUILT_IN_CHKP_EXTRACT_LOWER
:
6680 case BUILT_IN_CHKP_EXTRACT_UPPER
:
6681 /* Software implementation of Pointer Bounds Checker is NYI.
6682 Target support is required. */
6683 error ("Your target platform does not support -fcheck-pointer-bounds");
6686 case BUILT_IN_ACC_ON_DEVICE
:
6687 /* Do library call, if we failed to expand the builtin when
6691 default: /* just do library call, if unknown builtin */
6695 /* The switch statement above can drop through to cause the function
6696 to be called normally. */
6697 return expand_call (exp
, target
, ignore
);
6700 /* Similar to expand_builtin but is used for instrumented calls. */
6703 expand_builtin_with_bounds (tree exp
, rtx target
,
6704 rtx subtarget ATTRIBUTE_UNUSED
,
6705 machine_mode mode
, int ignore
)
6707 tree fndecl
= get_callee_fndecl (exp
);
6708 enum built_in_function fcode
= DECL_FUNCTION_CODE (fndecl
);
6710 gcc_assert (CALL_WITH_BOUNDS_P (exp
));
6712 if (DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_MD
)
6713 return targetm
.expand_builtin (exp
, target
, subtarget
, mode
, ignore
);
6715 gcc_assert (fcode
> BEGIN_CHKP_BUILTINS
6716 && fcode
< END_CHKP_BUILTINS
);
6720 case BUILT_IN_CHKP_MEMCPY_NOBND_NOCHK_CHKP
:
6721 target
= expand_builtin_memcpy_with_bounds (exp
, target
);
6726 case BUILT_IN_CHKP_MEMPCPY_NOBND_NOCHK_CHKP
:
6727 target
= expand_builtin_mempcpy_with_bounds (exp
, target
, mode
);
6732 case BUILT_IN_CHKP_MEMSET_NOBND_NOCHK_CHKP
:
6733 target
= expand_builtin_memset_with_bounds (exp
, target
, mode
);
6742 /* The switch statement above can drop through to cause the function
6743 to be called normally. */
6744 return expand_call (exp
, target
, ignore
);
6747 /* Determine whether a tree node represents a call to a built-in
6748 function. If the tree T is a call to a built-in function with
6749 the right number of arguments of the appropriate types, return
6750 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
6751 Otherwise the return value is END_BUILTINS. */
6753 enum built_in_function
6754 builtin_mathfn_code (const_tree t
)
6756 const_tree fndecl
, arg
, parmlist
;
6757 const_tree argtype
, parmtype
;
6758 const_call_expr_arg_iterator iter
;
6760 if (TREE_CODE (t
) != CALL_EXPR
6761 || TREE_CODE (CALL_EXPR_FN (t
)) != ADDR_EXPR
)
6762 return END_BUILTINS
;
6764 fndecl
= get_callee_fndecl (t
);
6765 if (fndecl
== NULL_TREE
6766 || TREE_CODE (fndecl
) != FUNCTION_DECL
6767 || ! DECL_BUILT_IN (fndecl
)
6768 || DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_MD
)
6769 return END_BUILTINS
;
6771 parmlist
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
6772 init_const_call_expr_arg_iterator (t
, &iter
);
6773 for (; parmlist
; parmlist
= TREE_CHAIN (parmlist
))
6775 /* If a function doesn't take a variable number of arguments,
6776 the last element in the list will have type `void'. */
6777 parmtype
= TREE_VALUE (parmlist
);
6778 if (VOID_TYPE_P (parmtype
))
6780 if (more_const_call_expr_args_p (&iter
))
6781 return END_BUILTINS
;
6782 return DECL_FUNCTION_CODE (fndecl
);
6785 if (! more_const_call_expr_args_p (&iter
))
6786 return END_BUILTINS
;
6788 arg
= next_const_call_expr_arg (&iter
);
6789 argtype
= TREE_TYPE (arg
);
6791 if (SCALAR_FLOAT_TYPE_P (parmtype
))
6793 if (! SCALAR_FLOAT_TYPE_P (argtype
))
6794 return END_BUILTINS
;
6796 else if (COMPLEX_FLOAT_TYPE_P (parmtype
))
6798 if (! COMPLEX_FLOAT_TYPE_P (argtype
))
6799 return END_BUILTINS
;
6801 else if (POINTER_TYPE_P (parmtype
))
6803 if (! POINTER_TYPE_P (argtype
))
6804 return END_BUILTINS
;
6806 else if (INTEGRAL_TYPE_P (parmtype
))
6808 if (! INTEGRAL_TYPE_P (argtype
))
6809 return END_BUILTINS
;
6812 return END_BUILTINS
;
6815 /* Variable-length argument list. */
6816 return DECL_FUNCTION_CODE (fndecl
);
6819 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
6820 evaluate to a constant. */
6823 fold_builtin_constant_p (tree arg
)
6825 /* We return 1 for a numeric type that's known to be a constant
6826 value at compile-time or for an aggregate type that's a
6827 literal constant. */
6830 /* If we know this is a constant, emit the constant of one. */
6831 if (CONSTANT_CLASS_P (arg
)
6832 || (TREE_CODE (arg
) == CONSTRUCTOR
6833 && TREE_CONSTANT (arg
)))
6834 return integer_one_node
;
6835 if (TREE_CODE (arg
) == ADDR_EXPR
)
6837 tree op
= TREE_OPERAND (arg
, 0);
6838 if (TREE_CODE (op
) == STRING_CST
6839 || (TREE_CODE (op
) == ARRAY_REF
6840 && integer_zerop (TREE_OPERAND (op
, 1))
6841 && TREE_CODE (TREE_OPERAND (op
, 0)) == STRING_CST
))
6842 return integer_one_node
;
6845 /* If this expression has side effects, show we don't know it to be a
6846 constant. Likewise if it's a pointer or aggregate type since in
6847 those case we only want literals, since those are only optimized
6848 when generating RTL, not later.
6849 And finally, if we are compiling an initializer, not code, we
6850 need to return a definite result now; there's not going to be any
6851 more optimization done. */
6852 if (TREE_SIDE_EFFECTS (arg
)
6853 || AGGREGATE_TYPE_P (TREE_TYPE (arg
))
6854 || POINTER_TYPE_P (TREE_TYPE (arg
))
6856 || folding_initializer
6857 || force_folding_builtin_constant_p
)
6858 return integer_zero_node
;
6863 /* Create builtin_expect with PRED and EXPECTED as its arguments and
6864 return it as a truthvalue. */
6867 build_builtin_expect_predicate (location_t loc
, tree pred
, tree expected
,
6870 tree fn
, arg_types
, pred_type
, expected_type
, call_expr
, ret_type
;
6872 fn
= builtin_decl_explicit (BUILT_IN_EXPECT
);
6873 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
6874 ret_type
= TREE_TYPE (TREE_TYPE (fn
));
6875 pred_type
= TREE_VALUE (arg_types
);
6876 expected_type
= TREE_VALUE (TREE_CHAIN (arg_types
));
6878 pred
= fold_convert_loc (loc
, pred_type
, pred
);
6879 expected
= fold_convert_loc (loc
, expected_type
, expected
);
6880 call_expr
= build_call_expr_loc (loc
, fn
, predictor
? 3 : 2, pred
, expected
,
6883 return build2 (NE_EXPR
, TREE_TYPE (pred
), call_expr
,
6884 build_int_cst (ret_type
, 0));
6887 /* Fold a call to builtin_expect with arguments ARG0 and ARG1. Return
6888 NULL_TREE if no simplification is possible. */
6891 fold_builtin_expect (location_t loc
, tree arg0
, tree arg1
, tree arg2
)
6893 tree inner
, fndecl
, inner_arg0
;
6894 enum tree_code code
;
6896 /* Distribute the expected value over short-circuiting operators.
6897 See through the cast from truthvalue_type_node to long. */
6899 while (CONVERT_EXPR_P (inner_arg0
)
6900 && INTEGRAL_TYPE_P (TREE_TYPE (inner_arg0
))
6901 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (inner_arg0
, 0))))
6902 inner_arg0
= TREE_OPERAND (inner_arg0
, 0);
6904 /* If this is a builtin_expect within a builtin_expect keep the
6905 inner one. See through a comparison against a constant. It
6906 might have been added to create a thruthvalue. */
6909 if (COMPARISON_CLASS_P (inner
)
6910 && TREE_CODE (TREE_OPERAND (inner
, 1)) == INTEGER_CST
)
6911 inner
= TREE_OPERAND (inner
, 0);
6913 if (TREE_CODE (inner
) == CALL_EXPR
6914 && (fndecl
= get_callee_fndecl (inner
))
6915 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
6916 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_EXPECT
)
6920 code
= TREE_CODE (inner
);
6921 if (code
== TRUTH_ANDIF_EXPR
|| code
== TRUTH_ORIF_EXPR
)
6923 tree op0
= TREE_OPERAND (inner
, 0);
6924 tree op1
= TREE_OPERAND (inner
, 1);
6926 op0
= build_builtin_expect_predicate (loc
, op0
, arg1
, arg2
);
6927 op1
= build_builtin_expect_predicate (loc
, op1
, arg1
, arg2
);
6928 inner
= build2 (code
, TREE_TYPE (inner
), op0
, op1
);
6930 return fold_convert_loc (loc
, TREE_TYPE (arg0
), inner
);
6933 /* If the argument isn't invariant then there's nothing else we can do. */
6934 if (!TREE_CONSTANT (inner_arg0
))
6937 /* If we expect that a comparison against the argument will fold to
6938 a constant return the constant. In practice, this means a true
6939 constant or the address of a non-weak symbol. */
6942 if (TREE_CODE (inner
) == ADDR_EXPR
)
6946 inner
= TREE_OPERAND (inner
, 0);
6948 while (TREE_CODE (inner
) == COMPONENT_REF
6949 || TREE_CODE (inner
) == ARRAY_REF
);
6950 if ((TREE_CODE (inner
) == VAR_DECL
6951 || TREE_CODE (inner
) == FUNCTION_DECL
)
6952 && DECL_WEAK (inner
))
6956 /* Otherwise, ARG0 already has the proper type for the return value. */
6960 /* Fold a call to __builtin_classify_type with argument ARG. */
6963 fold_builtin_classify_type (tree arg
)
6966 return build_int_cst (integer_type_node
, no_type_class
);
6968 return build_int_cst (integer_type_node
, type_to_class (TREE_TYPE (arg
)));
6971 /* Fold a call to __builtin_strlen with argument ARG. */
6974 fold_builtin_strlen (location_t loc
, tree type
, tree arg
)
6976 if (!validate_arg (arg
, POINTER_TYPE
))
6980 tree len
= c_strlen (arg
, 0);
6983 return fold_convert_loc (loc
, type
, len
);
6989 /* Fold a call to __builtin_inf or __builtin_huge_val. */
6992 fold_builtin_inf (location_t loc
, tree type
, int warn
)
6994 REAL_VALUE_TYPE real
;
6996 /* __builtin_inff is intended to be usable to define INFINITY on all
6997 targets. If an infinity is not available, INFINITY expands "to a
6998 positive constant of type float that overflows at translation
6999 time", footnote "In this case, using INFINITY will violate the
7000 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
7001 Thus we pedwarn to ensure this constraint violation is
7003 if (!MODE_HAS_INFINITIES (TYPE_MODE (type
)) && warn
)
7004 pedwarn (loc
, 0, "target format does not support infinity");
7007 return build_real (type
, real
);
7010 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
7011 NULL_TREE if no simplification can be made. */
7014 fold_builtin_sincos (location_t loc
,
7015 tree arg0
, tree arg1
, tree arg2
)
7018 tree fndecl
, call
= NULL_TREE
;
7020 if (!validate_arg (arg0
, REAL_TYPE
)
7021 || !validate_arg (arg1
, POINTER_TYPE
)
7022 || !validate_arg (arg2
, POINTER_TYPE
))
7025 type
= TREE_TYPE (arg0
);
7027 /* Calculate the result when the argument is a constant. */
7028 built_in_function fn
= mathfn_built_in_2 (type
, CFN_BUILT_IN_CEXPI
);
7029 if (fn
== END_BUILTINS
)
7032 /* Canonicalize sincos to cexpi. */
7033 if (TREE_CODE (arg0
) == REAL_CST
)
7035 tree complex_type
= build_complex_type (type
);
7036 call
= fold_const_call (as_combined_fn (fn
), complex_type
, arg0
);
7040 if (!targetm
.libc_has_function (function_c99_math_complex
)
7041 || !builtin_decl_implicit_p (fn
))
7043 fndecl
= builtin_decl_explicit (fn
);
7044 call
= build_call_expr_loc (loc
, fndecl
, 1, arg0
);
7045 call
= builtin_save_expr (call
);
7048 return build2 (COMPOUND_EXPR
, void_type_node
,
7049 build2 (MODIFY_EXPR
, void_type_node
,
7050 build_fold_indirect_ref_loc (loc
, arg1
),
7051 fold_build1_loc (loc
, IMAGPART_EXPR
, type
, call
)),
7052 build2 (MODIFY_EXPR
, void_type_node
,
7053 build_fold_indirect_ref_loc (loc
, arg2
),
7054 fold_build1_loc (loc
, REALPART_EXPR
, type
, call
)));
7057 /* Fold function call to builtin memchr. ARG1, ARG2 and LEN are the
7058 arguments to the call, and TYPE is its return type.
7059 Return NULL_TREE if no simplification can be made. */
7062 fold_builtin_memchr (location_t loc
, tree arg1
, tree arg2
, tree len
, tree type
)
7064 if (!validate_arg (arg1
, POINTER_TYPE
)
7065 || !validate_arg (arg2
, INTEGER_TYPE
)
7066 || !validate_arg (len
, INTEGER_TYPE
))
7072 if (TREE_CODE (arg2
) != INTEGER_CST
7073 || !tree_fits_uhwi_p (len
))
7076 p1
= c_getstr (arg1
);
7077 if (p1
&& compare_tree_int (len
, strlen (p1
) + 1) <= 0)
7083 if (target_char_cast (arg2
, &c
))
7086 r
= (const char *) memchr (p1
, c
, tree_to_uhwi (len
));
7089 return build_int_cst (TREE_TYPE (arg1
), 0);
7091 tem
= fold_build_pointer_plus_hwi_loc (loc
, arg1
, r
- p1
);
7092 return fold_convert_loc (loc
, type
, tem
);
7098 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
7099 Return NULL_TREE if no simplification can be made. */
7102 fold_builtin_memcmp (location_t loc
, tree arg1
, tree arg2
, tree len
)
7104 if (!validate_arg (arg1
, POINTER_TYPE
)
7105 || !validate_arg (arg2
, POINTER_TYPE
)
7106 || !validate_arg (len
, INTEGER_TYPE
))
7109 /* If the LEN parameter is zero, return zero. */
7110 if (integer_zerop (len
))
7111 return omit_two_operands_loc (loc
, integer_type_node
, integer_zero_node
,
7114 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
7115 if (operand_equal_p (arg1
, arg2
, 0))
7116 return omit_one_operand_loc (loc
, integer_type_node
, integer_zero_node
, len
);
7118 /* If len parameter is one, return an expression corresponding to
7119 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
7120 if (tree_fits_uhwi_p (len
) && tree_to_uhwi (len
) == 1)
7122 tree cst_uchar_node
= build_type_variant (unsigned_char_type_node
, 1, 0);
7123 tree cst_uchar_ptr_node
7124 = build_pointer_type_for_mode (cst_uchar_node
, ptr_mode
, true);
7127 = fold_convert_loc (loc
, integer_type_node
,
7128 build1 (INDIRECT_REF
, cst_uchar_node
,
7129 fold_convert_loc (loc
,
7133 = fold_convert_loc (loc
, integer_type_node
,
7134 build1 (INDIRECT_REF
, cst_uchar_node
,
7135 fold_convert_loc (loc
,
7138 return fold_build2_loc (loc
, MINUS_EXPR
, integer_type_node
, ind1
, ind2
);
7144 /* Fold function call to builtin strcmp with arguments ARG1 and ARG2.
7145 Return NULL_TREE if no simplification can be made. */
7148 fold_builtin_strcmp (location_t loc
, tree arg1
, tree arg2
)
7150 if (!validate_arg (arg1
, POINTER_TYPE
)
7151 || !validate_arg (arg2
, POINTER_TYPE
))
7154 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
7155 if (operand_equal_p (arg1
, arg2
, 0))
7156 return integer_zero_node
;
7158 /* If the second arg is "", return *(const unsigned char*)arg1. */
7159 const char *p2
= c_getstr (arg2
);
7160 if (p2
&& *p2
== '\0')
7162 tree cst_uchar_node
= build_type_variant (unsigned_char_type_node
, 1, 0);
7163 tree cst_uchar_ptr_node
7164 = build_pointer_type_for_mode (cst_uchar_node
, ptr_mode
, true);
7166 return fold_convert_loc (loc
, integer_type_node
,
7167 build1 (INDIRECT_REF
, cst_uchar_node
,
7168 fold_convert_loc (loc
,
7173 /* If the first arg is "", return -*(const unsigned char*)arg2. */
7174 const char *p1
= c_getstr (arg1
);
7175 if (p1
&& *p1
== '\0')
7177 tree cst_uchar_node
= build_type_variant (unsigned_char_type_node
, 1, 0);
7178 tree cst_uchar_ptr_node
7179 = build_pointer_type_for_mode (cst_uchar_node
, ptr_mode
, true);
7182 = fold_convert_loc (loc
, integer_type_node
,
7183 build1 (INDIRECT_REF
, cst_uchar_node
,
7184 fold_convert_loc (loc
,
7187 return fold_build1_loc (loc
, NEGATE_EXPR
, integer_type_node
, temp
);
7193 /* Fold function call to builtin strncmp with arguments ARG1, ARG2, and LEN.
7194 Return NULL_TREE if no simplification can be made. */
7197 fold_builtin_strncmp (location_t loc
, tree arg1
, tree arg2
, tree len
)
7199 if (!validate_arg (arg1
, POINTER_TYPE
)
7200 || !validate_arg (arg2
, POINTER_TYPE
)
7201 || !validate_arg (len
, INTEGER_TYPE
))
7204 /* If the LEN parameter is zero, return zero. */
7205 if (integer_zerop (len
))
7206 return omit_two_operands_loc (loc
, integer_type_node
, integer_zero_node
,
7209 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
7210 if (operand_equal_p (arg1
, arg2
, 0))
7211 return omit_one_operand_loc (loc
, integer_type_node
, integer_zero_node
, len
);
7213 /* If the second arg is "", and the length is greater than zero,
7214 return *(const unsigned char*)arg1. */
7215 const char *p2
= c_getstr (arg2
);
7216 if (p2
&& *p2
== '\0'
7217 && TREE_CODE (len
) == INTEGER_CST
7218 && tree_int_cst_sgn (len
) == 1)
7220 tree cst_uchar_node
= build_type_variant (unsigned_char_type_node
, 1, 0);
7221 tree cst_uchar_ptr_node
7222 = build_pointer_type_for_mode (cst_uchar_node
, ptr_mode
, true);
7224 return fold_convert_loc (loc
, integer_type_node
,
7225 build1 (INDIRECT_REF
, cst_uchar_node
,
7226 fold_convert_loc (loc
,
7231 /* If the first arg is "", and the length is greater than zero,
7232 return -*(const unsigned char*)arg2. */
7233 const char *p1
= c_getstr (arg1
);
7234 if (p1
&& *p1
== '\0'
7235 && TREE_CODE (len
) == INTEGER_CST
7236 && tree_int_cst_sgn (len
) == 1)
7238 tree cst_uchar_node
= build_type_variant (unsigned_char_type_node
, 1, 0);
7239 tree cst_uchar_ptr_node
7240 = build_pointer_type_for_mode (cst_uchar_node
, ptr_mode
, true);
7242 tree temp
= fold_convert_loc (loc
, integer_type_node
,
7243 build1 (INDIRECT_REF
, cst_uchar_node
,
7244 fold_convert_loc (loc
,
7247 return fold_build1_loc (loc
, NEGATE_EXPR
, integer_type_node
, temp
);
7250 /* If len parameter is one, return an expression corresponding to
7251 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
7252 if (tree_fits_uhwi_p (len
) && tree_to_uhwi (len
) == 1)
7254 tree cst_uchar_node
= build_type_variant (unsigned_char_type_node
, 1, 0);
7255 tree cst_uchar_ptr_node
7256 = build_pointer_type_for_mode (cst_uchar_node
, ptr_mode
, true);
7258 tree ind1
= fold_convert_loc (loc
, integer_type_node
,
7259 build1 (INDIRECT_REF
, cst_uchar_node
,
7260 fold_convert_loc (loc
,
7263 tree ind2
= fold_convert_loc (loc
, integer_type_node
,
7264 build1 (INDIRECT_REF
, cst_uchar_node
,
7265 fold_convert_loc (loc
,
7268 return fold_build2_loc (loc
, MINUS_EXPR
, integer_type_node
, ind1
, ind2
);
7274 /* Fold a call to builtin isascii with argument ARG. */
7277 fold_builtin_isascii (location_t loc
, tree arg
)
7279 if (!validate_arg (arg
, INTEGER_TYPE
))
7283 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
7284 arg
= fold_build2 (BIT_AND_EXPR
, integer_type_node
, arg
,
7285 build_int_cst (integer_type_node
,
7286 ~ (unsigned HOST_WIDE_INT
) 0x7f));
7287 return fold_build2_loc (loc
, EQ_EXPR
, integer_type_node
,
7288 arg
, integer_zero_node
);
7292 /* Fold a call to builtin toascii with argument ARG. */
7295 fold_builtin_toascii (location_t loc
, tree arg
)
7297 if (!validate_arg (arg
, INTEGER_TYPE
))
7300 /* Transform toascii(c) -> (c & 0x7f). */
7301 return fold_build2_loc (loc
, BIT_AND_EXPR
, integer_type_node
, arg
,
7302 build_int_cst (integer_type_node
, 0x7f));
7305 /* Fold a call to builtin isdigit with argument ARG. */
7308 fold_builtin_isdigit (location_t loc
, tree arg
)
7310 if (!validate_arg (arg
, INTEGER_TYPE
))
7314 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
7315 /* According to the C standard, isdigit is unaffected by locale.
7316 However, it definitely is affected by the target character set. */
7317 unsigned HOST_WIDE_INT target_digit0
7318 = lang_hooks
.to_target_charset ('0');
7320 if (target_digit0
== 0)
7323 arg
= fold_convert_loc (loc
, unsigned_type_node
, arg
);
7324 arg
= fold_build2 (MINUS_EXPR
, unsigned_type_node
, arg
,
7325 build_int_cst (unsigned_type_node
, target_digit0
));
7326 return fold_build2_loc (loc
, LE_EXPR
, integer_type_node
, arg
,
7327 build_int_cst (unsigned_type_node
, 9));
7331 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
7334 fold_builtin_fabs (location_t loc
, tree arg
, tree type
)
7336 if (!validate_arg (arg
, REAL_TYPE
))
7339 arg
= fold_convert_loc (loc
, type
, arg
);
7340 return fold_build1_loc (loc
, ABS_EXPR
, type
, arg
);
7343 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
7346 fold_builtin_abs (location_t loc
, tree arg
, tree type
)
7348 if (!validate_arg (arg
, INTEGER_TYPE
))
7351 arg
= fold_convert_loc (loc
, type
, arg
);
7352 return fold_build1_loc (loc
, ABS_EXPR
, type
, arg
);
7355 /* Fold a call to fma, fmaf, or fmal with arguments ARG[012]. */
7358 fold_builtin_fma (location_t loc
, tree arg0
, tree arg1
, tree arg2
, tree type
)
7360 /* ??? Only expand to FMA_EXPR if it's directly supported. */
7361 if (validate_arg (arg0
, REAL_TYPE
)
7362 && validate_arg (arg1
, REAL_TYPE
)
7363 && validate_arg (arg2
, REAL_TYPE
)
7364 && optab_handler (fma_optab
, TYPE_MODE (type
)) != CODE_FOR_nothing
)
7365 return fold_build3_loc (loc
, FMA_EXPR
, type
, arg0
, arg1
, arg2
);
7370 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
7373 fold_builtin_carg (location_t loc
, tree arg
, tree type
)
7375 if (validate_arg (arg
, COMPLEX_TYPE
)
7376 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg
))) == REAL_TYPE
)
7378 tree atan2_fn
= mathfn_built_in (type
, BUILT_IN_ATAN2
);
7382 tree new_arg
= builtin_save_expr (arg
);
7383 tree r_arg
= fold_build1_loc (loc
, REALPART_EXPR
, type
, new_arg
);
7384 tree i_arg
= fold_build1_loc (loc
, IMAGPART_EXPR
, type
, new_arg
);
7385 return build_call_expr_loc (loc
, atan2_fn
, 2, i_arg
, r_arg
);
7392 /* Fold a call to builtin frexp, we can assume the base is 2. */
7395 fold_builtin_frexp (location_t loc
, tree arg0
, tree arg1
, tree rettype
)
7397 if (! validate_arg (arg0
, REAL_TYPE
) || ! validate_arg (arg1
, POINTER_TYPE
))
7402 if (!(TREE_CODE (arg0
) == REAL_CST
&& ! TREE_OVERFLOW (arg0
)))
7405 arg1
= build_fold_indirect_ref_loc (loc
, arg1
);
7407 /* Proceed if a valid pointer type was passed in. */
7408 if (TYPE_MAIN_VARIANT (TREE_TYPE (arg1
)) == integer_type_node
)
7410 const REAL_VALUE_TYPE
*const value
= TREE_REAL_CST_PTR (arg0
);
7416 /* For +-0, return (*exp = 0, +-0). */
7417 exp
= integer_zero_node
;
7422 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
7423 return omit_one_operand_loc (loc
, rettype
, arg0
, arg1
);
7426 /* Since the frexp function always expects base 2, and in
7427 GCC normalized significands are already in the range
7428 [0.5, 1.0), we have exactly what frexp wants. */
7429 REAL_VALUE_TYPE frac_rvt
= *value
;
7430 SET_REAL_EXP (&frac_rvt
, 0);
7431 frac
= build_real (rettype
, frac_rvt
);
7432 exp
= build_int_cst (integer_type_node
, REAL_EXP (value
));
7439 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
7440 arg1
= fold_build2_loc (loc
, MODIFY_EXPR
, rettype
, arg1
, exp
);
7441 TREE_SIDE_EFFECTS (arg1
) = 1;
7442 return fold_build2_loc (loc
, COMPOUND_EXPR
, rettype
, arg1
, frac
);
7448 /* Fold a call to builtin modf. */
7451 fold_builtin_modf (location_t loc
, tree arg0
, tree arg1
, tree rettype
)
7453 if (! validate_arg (arg0
, REAL_TYPE
) || ! validate_arg (arg1
, POINTER_TYPE
))
7458 if (!(TREE_CODE (arg0
) == REAL_CST
&& ! TREE_OVERFLOW (arg0
)))
7461 arg1
= build_fold_indirect_ref_loc (loc
, arg1
);
7463 /* Proceed if a valid pointer type was passed in. */
7464 if (TYPE_MAIN_VARIANT (TREE_TYPE (arg1
)) == TYPE_MAIN_VARIANT (rettype
))
7466 const REAL_VALUE_TYPE
*const value
= TREE_REAL_CST_PTR (arg0
);
7467 REAL_VALUE_TYPE trunc
, frac
;
7473 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
7474 trunc
= frac
= *value
;
7477 /* For +-Inf, return (*arg1 = arg0, +-0). */
7479 frac
.sign
= value
->sign
;
7483 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
7484 real_trunc (&trunc
, VOIDmode
, value
);
7485 real_arithmetic (&frac
, MINUS_EXPR
, value
, &trunc
);
7486 /* If the original number was negative and already
7487 integral, then the fractional part is -0.0. */
7488 if (value
->sign
&& frac
.cl
== rvc_zero
)
7489 frac
.sign
= value
->sign
;
7493 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
7494 arg1
= fold_build2_loc (loc
, MODIFY_EXPR
, rettype
, arg1
,
7495 build_real (rettype
, trunc
));
7496 TREE_SIDE_EFFECTS (arg1
) = 1;
7497 return fold_build2_loc (loc
, COMPOUND_EXPR
, rettype
, arg1
,
7498 build_real (rettype
, frac
));
7504 /* Given a location LOC, an interclass builtin function decl FNDECL
7505 and its single argument ARG, return an folded expression computing
7506 the same, or NULL_TREE if we either couldn't or didn't want to fold
7507 (the latter happen if there's an RTL instruction available). */
7510 fold_builtin_interclass_mathfn (location_t loc
, tree fndecl
, tree arg
)
7514 if (!validate_arg (arg
, REAL_TYPE
))
7517 if (interclass_mathfn_icode (arg
, fndecl
) != CODE_FOR_nothing
)
7520 mode
= TYPE_MODE (TREE_TYPE (arg
));
7522 /* If there is no optab, try generic code. */
7523 switch (DECL_FUNCTION_CODE (fndecl
))
7527 CASE_FLT_FN (BUILT_IN_ISINF
):
7529 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
7530 tree
const isgr_fn
= builtin_decl_explicit (BUILT_IN_ISGREATER
);
7531 tree
const type
= TREE_TYPE (arg
);
7535 get_max_float (REAL_MODE_FORMAT (mode
), buf
, sizeof (buf
));
7536 real_from_string (&r
, buf
);
7537 result
= build_call_expr (isgr_fn
, 2,
7538 fold_build1_loc (loc
, ABS_EXPR
, type
, arg
),
7539 build_real (type
, r
));
7542 CASE_FLT_FN (BUILT_IN_FINITE
):
7543 case BUILT_IN_ISFINITE
:
7545 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
7546 tree
const isle_fn
= builtin_decl_explicit (BUILT_IN_ISLESSEQUAL
);
7547 tree
const type
= TREE_TYPE (arg
);
7551 get_max_float (REAL_MODE_FORMAT (mode
), buf
, sizeof (buf
));
7552 real_from_string (&r
, buf
);
7553 result
= build_call_expr (isle_fn
, 2,
7554 fold_build1_loc (loc
, ABS_EXPR
, type
, arg
),
7555 build_real (type
, r
));
7556 /*result = fold_build2_loc (loc, UNGT_EXPR,
7557 TREE_TYPE (TREE_TYPE (fndecl)),
7558 fold_build1_loc (loc, ABS_EXPR, type, arg),
7559 build_real (type, r));
7560 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
7561 TREE_TYPE (TREE_TYPE (fndecl)),
7565 case BUILT_IN_ISNORMAL
:
7567 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
7568 islessequal(fabs(x),DBL_MAX). */
7569 tree
const isle_fn
= builtin_decl_explicit (BUILT_IN_ISLESSEQUAL
);
7570 tree
const isge_fn
= builtin_decl_explicit (BUILT_IN_ISGREATEREQUAL
);
7571 tree
const type
= TREE_TYPE (arg
);
7572 REAL_VALUE_TYPE rmax
, rmin
;
7575 get_max_float (REAL_MODE_FORMAT (mode
), buf
, sizeof (buf
));
7576 real_from_string (&rmax
, buf
);
7577 sprintf (buf
, "0x1p%d", REAL_MODE_FORMAT (mode
)->emin
- 1);
7578 real_from_string (&rmin
, buf
);
7579 arg
= builtin_save_expr (fold_build1_loc (loc
, ABS_EXPR
, type
, arg
));
7580 result
= build_call_expr (isle_fn
, 2, arg
,
7581 build_real (type
, rmax
));
7582 result
= fold_build2 (BIT_AND_EXPR
, integer_type_node
, result
,
7583 build_call_expr (isge_fn
, 2, arg
,
7584 build_real (type
, rmin
)));
7594 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
7595 ARG is the argument for the call. */
7598 fold_builtin_classify (location_t loc
, tree fndecl
, tree arg
, int builtin_index
)
7600 tree type
= TREE_TYPE (TREE_TYPE (fndecl
));
7602 if (!validate_arg (arg
, REAL_TYPE
))
7605 switch (builtin_index
)
7607 case BUILT_IN_ISINF
:
7608 if (!HONOR_INFINITIES (arg
))
7609 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg
);
7613 case BUILT_IN_ISINF_SIGN
:
7615 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
7616 /* In a boolean context, GCC will fold the inner COND_EXPR to
7617 1. So e.g. "if (isinf_sign(x))" would be folded to just
7618 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
7619 tree signbit_fn
= mathfn_built_in_1
7620 (TREE_TYPE (arg
), CFN_BUILT_IN_SIGNBIT
, 0);
7621 tree isinf_fn
= builtin_decl_explicit (BUILT_IN_ISINF
);
7622 tree tmp
= NULL_TREE
;
7624 arg
= builtin_save_expr (arg
);
7626 if (signbit_fn
&& isinf_fn
)
7628 tree signbit_call
= build_call_expr_loc (loc
, signbit_fn
, 1, arg
);
7629 tree isinf_call
= build_call_expr_loc (loc
, isinf_fn
, 1, arg
);
7631 signbit_call
= fold_build2_loc (loc
, NE_EXPR
, integer_type_node
,
7632 signbit_call
, integer_zero_node
);
7633 isinf_call
= fold_build2_loc (loc
, NE_EXPR
, integer_type_node
,
7634 isinf_call
, integer_zero_node
);
7636 tmp
= fold_build3_loc (loc
, COND_EXPR
, integer_type_node
, signbit_call
,
7637 integer_minus_one_node
, integer_one_node
);
7638 tmp
= fold_build3_loc (loc
, COND_EXPR
, integer_type_node
,
7646 case BUILT_IN_ISFINITE
:
7647 if (!HONOR_NANS (arg
)
7648 && !HONOR_INFINITIES (arg
))
7649 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg
);
7653 case BUILT_IN_ISNAN
:
7654 if (!HONOR_NANS (arg
))
7655 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg
);
7657 arg
= builtin_save_expr (arg
);
7658 return fold_build2_loc (loc
, UNORDERED_EXPR
, type
, arg
, arg
);
7665 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
7666 This builtin will generate code to return the appropriate floating
7667 point classification depending on the value of the floating point
7668 number passed in. The possible return values must be supplied as
7669 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
7670 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
7671 one floating point argument which is "type generic". */
7674 fold_builtin_fpclassify (location_t loc
, tree
*args
, int nargs
)
7676 tree fp_nan
, fp_infinite
, fp_normal
, fp_subnormal
, fp_zero
,
7677 arg
, type
, res
, tmp
;
7682 /* Verify the required arguments in the original call. */
7684 || !validate_arg (args
[0], INTEGER_TYPE
)
7685 || !validate_arg (args
[1], INTEGER_TYPE
)
7686 || !validate_arg (args
[2], INTEGER_TYPE
)
7687 || !validate_arg (args
[3], INTEGER_TYPE
)
7688 || !validate_arg (args
[4], INTEGER_TYPE
)
7689 || !validate_arg (args
[5], REAL_TYPE
))
7693 fp_infinite
= args
[1];
7694 fp_normal
= args
[2];
7695 fp_subnormal
= args
[3];
7698 type
= TREE_TYPE (arg
);
7699 mode
= TYPE_MODE (type
);
7700 arg
= builtin_save_expr (fold_build1_loc (loc
, ABS_EXPR
, type
, arg
));
7704 (fabs(x) == Inf ? FP_INFINITE :
7705 (fabs(x) >= DBL_MIN ? FP_NORMAL :
7706 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
7708 tmp
= fold_build2_loc (loc
, EQ_EXPR
, integer_type_node
, arg
,
7709 build_real (type
, dconst0
));
7710 res
= fold_build3_loc (loc
, COND_EXPR
, integer_type_node
,
7711 tmp
, fp_zero
, fp_subnormal
);
7713 sprintf (buf
, "0x1p%d", REAL_MODE_FORMAT (mode
)->emin
- 1);
7714 real_from_string (&r
, buf
);
7715 tmp
= fold_build2_loc (loc
, GE_EXPR
, integer_type_node
,
7716 arg
, build_real (type
, r
));
7717 res
= fold_build3_loc (loc
, COND_EXPR
, integer_type_node
, tmp
, fp_normal
, res
);
7719 if (HONOR_INFINITIES (mode
))
7722 tmp
= fold_build2_loc (loc
, EQ_EXPR
, integer_type_node
, arg
,
7723 build_real (type
, r
));
7724 res
= fold_build3_loc (loc
, COND_EXPR
, integer_type_node
, tmp
,
7728 if (HONOR_NANS (mode
))
7730 tmp
= fold_build2_loc (loc
, ORDERED_EXPR
, integer_type_node
, arg
, arg
);
7731 res
= fold_build3_loc (loc
, COND_EXPR
, integer_type_node
, tmp
, res
, fp_nan
);
7737 /* Fold a call to an unordered comparison function such as
7738 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
7739 being called and ARG0 and ARG1 are the arguments for the call.
7740 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
7741 the opposite of the desired result. UNORDERED_CODE is used
7742 for modes that can hold NaNs and ORDERED_CODE is used for
7746 fold_builtin_unordered_cmp (location_t loc
, tree fndecl
, tree arg0
, tree arg1
,
7747 enum tree_code unordered_code
,
7748 enum tree_code ordered_code
)
7750 tree type
= TREE_TYPE (TREE_TYPE (fndecl
));
7751 enum tree_code code
;
7753 enum tree_code code0
, code1
;
7754 tree cmp_type
= NULL_TREE
;
7756 type0
= TREE_TYPE (arg0
);
7757 type1
= TREE_TYPE (arg1
);
7759 code0
= TREE_CODE (type0
);
7760 code1
= TREE_CODE (type1
);
7762 if (code0
== REAL_TYPE
&& code1
== REAL_TYPE
)
7763 /* Choose the wider of two real types. */
7764 cmp_type
= TYPE_PRECISION (type0
) >= TYPE_PRECISION (type1
)
7766 else if (code0
== REAL_TYPE
&& code1
== INTEGER_TYPE
)
7768 else if (code0
== INTEGER_TYPE
&& code1
== REAL_TYPE
)
7771 arg0
= fold_convert_loc (loc
, cmp_type
, arg0
);
7772 arg1
= fold_convert_loc (loc
, cmp_type
, arg1
);
7774 if (unordered_code
== UNORDERED_EXPR
)
7776 if (!HONOR_NANS (arg0
))
7777 return omit_two_operands_loc (loc
, type
, integer_zero_node
, arg0
, arg1
);
7778 return fold_build2_loc (loc
, UNORDERED_EXPR
, type
, arg0
, arg1
);
7781 code
= HONOR_NANS (arg0
) ? unordered_code
: ordered_code
;
7782 return fold_build1_loc (loc
, TRUTH_NOT_EXPR
, type
,
7783 fold_build2_loc (loc
, code
, type
, arg0
, arg1
));
7786 /* Fold __builtin_{,s,u}{add,sub,mul}{,l,ll}_overflow, either into normal
7787 arithmetics if it can never overflow, or into internal functions that
7788 return both result of arithmetics and overflowed boolean flag in
7789 a complex integer result, or some other check for overflow. */
7792 fold_builtin_arith_overflow (location_t loc
, enum built_in_function fcode
,
7793 tree arg0
, tree arg1
, tree arg2
)
7795 enum internal_fn ifn
= IFN_LAST
;
7796 tree type
= TREE_TYPE (TREE_TYPE (arg2
));
7797 tree mem_arg2
= build_fold_indirect_ref_loc (loc
, arg2
);
7800 case BUILT_IN_ADD_OVERFLOW
:
7801 case BUILT_IN_SADD_OVERFLOW
:
7802 case BUILT_IN_SADDL_OVERFLOW
:
7803 case BUILT_IN_SADDLL_OVERFLOW
:
7804 case BUILT_IN_UADD_OVERFLOW
:
7805 case BUILT_IN_UADDL_OVERFLOW
:
7806 case BUILT_IN_UADDLL_OVERFLOW
:
7807 ifn
= IFN_ADD_OVERFLOW
;
7809 case BUILT_IN_SUB_OVERFLOW
:
7810 case BUILT_IN_SSUB_OVERFLOW
:
7811 case BUILT_IN_SSUBL_OVERFLOW
:
7812 case BUILT_IN_SSUBLL_OVERFLOW
:
7813 case BUILT_IN_USUB_OVERFLOW
:
7814 case BUILT_IN_USUBL_OVERFLOW
:
7815 case BUILT_IN_USUBLL_OVERFLOW
:
7816 ifn
= IFN_SUB_OVERFLOW
;
7818 case BUILT_IN_MUL_OVERFLOW
:
7819 case BUILT_IN_SMUL_OVERFLOW
:
7820 case BUILT_IN_SMULL_OVERFLOW
:
7821 case BUILT_IN_SMULLL_OVERFLOW
:
7822 case BUILT_IN_UMUL_OVERFLOW
:
7823 case BUILT_IN_UMULL_OVERFLOW
:
7824 case BUILT_IN_UMULLL_OVERFLOW
:
7825 ifn
= IFN_MUL_OVERFLOW
;
7830 tree ctype
= build_complex_type (type
);
7831 tree call
= build_call_expr_internal_loc (loc
, ifn
, ctype
,
7833 tree tgt
= save_expr (call
);
7834 tree intres
= build1_loc (loc
, REALPART_EXPR
, type
, tgt
);
7835 tree ovfres
= build1_loc (loc
, IMAGPART_EXPR
, type
, tgt
);
7836 ovfres
= fold_convert_loc (loc
, boolean_type_node
, ovfres
);
7838 = fold_build2_loc (loc
, MODIFY_EXPR
, void_type_node
, mem_arg2
, intres
);
7839 return build2_loc (loc
, COMPOUND_EXPR
, boolean_type_node
, store
, ovfres
);
7842 /* Fold a call to built-in function FNDECL with 0 arguments.
7843 This function returns NULL_TREE if no simplification was possible. */
7846 fold_builtin_0 (location_t loc
, tree fndecl
)
7848 tree type
= TREE_TYPE (TREE_TYPE (fndecl
));
7849 enum built_in_function fcode
= DECL_FUNCTION_CODE (fndecl
);
7852 CASE_FLT_FN (BUILT_IN_INF
):
7853 case BUILT_IN_INFD32
:
7854 case BUILT_IN_INFD64
:
7855 case BUILT_IN_INFD128
:
7856 return fold_builtin_inf (loc
, type
, true);
7858 CASE_FLT_FN (BUILT_IN_HUGE_VAL
):
7859 return fold_builtin_inf (loc
, type
, false);
7861 case BUILT_IN_CLASSIFY_TYPE
:
7862 return fold_builtin_classify_type (NULL_TREE
);
7870 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
7871 This function returns NULL_TREE if no simplification was possible. */
7874 fold_builtin_1 (location_t loc
, tree fndecl
, tree arg0
)
7876 tree type
= TREE_TYPE (TREE_TYPE (fndecl
));
7877 enum built_in_function fcode
= DECL_FUNCTION_CODE (fndecl
);
7879 if (TREE_CODE (arg0
) == ERROR_MARK
)
7882 if (tree ret
= fold_const_call (as_combined_fn (fcode
), type
, arg0
))
7887 case BUILT_IN_CONSTANT_P
:
7889 tree val
= fold_builtin_constant_p (arg0
);
7891 /* Gimplification will pull the CALL_EXPR for the builtin out of
7892 an if condition. When not optimizing, we'll not CSE it back.
7893 To avoid link error types of regressions, return false now. */
7894 if (!val
&& !optimize
)
7895 val
= integer_zero_node
;
7900 case BUILT_IN_CLASSIFY_TYPE
:
7901 return fold_builtin_classify_type (arg0
);
7903 case BUILT_IN_STRLEN
:
7904 return fold_builtin_strlen (loc
, type
, arg0
);
7906 CASE_FLT_FN (BUILT_IN_FABS
):
7907 case BUILT_IN_FABSD32
:
7908 case BUILT_IN_FABSD64
:
7909 case BUILT_IN_FABSD128
:
7910 return fold_builtin_fabs (loc
, arg0
, type
);
7914 case BUILT_IN_LLABS
:
7915 case BUILT_IN_IMAXABS
:
7916 return fold_builtin_abs (loc
, arg0
, type
);
7918 CASE_FLT_FN (BUILT_IN_CONJ
):
7919 if (validate_arg (arg0
, COMPLEX_TYPE
)
7920 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0
))) == REAL_TYPE
)
7921 return fold_build1_loc (loc
, CONJ_EXPR
, type
, arg0
);
7924 CASE_FLT_FN (BUILT_IN_CREAL
):
7925 if (validate_arg (arg0
, COMPLEX_TYPE
)
7926 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0
))) == REAL_TYPE
)
7927 return non_lvalue_loc (loc
, fold_build1_loc (loc
, REALPART_EXPR
, type
, arg0
));
7930 CASE_FLT_FN (BUILT_IN_CIMAG
):
7931 if (validate_arg (arg0
, COMPLEX_TYPE
)
7932 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0
))) == REAL_TYPE
)
7933 return non_lvalue_loc (loc
, fold_build1_loc (loc
, IMAGPART_EXPR
, type
, arg0
));
7936 CASE_FLT_FN (BUILT_IN_CARG
):
7937 return fold_builtin_carg (loc
, arg0
, type
);
7939 case BUILT_IN_ISASCII
:
7940 return fold_builtin_isascii (loc
, arg0
);
7942 case BUILT_IN_TOASCII
:
7943 return fold_builtin_toascii (loc
, arg0
);
7945 case BUILT_IN_ISDIGIT
:
7946 return fold_builtin_isdigit (loc
, arg0
);
7948 CASE_FLT_FN (BUILT_IN_FINITE
):
7949 case BUILT_IN_FINITED32
:
7950 case BUILT_IN_FINITED64
:
7951 case BUILT_IN_FINITED128
:
7952 case BUILT_IN_ISFINITE
:
7954 tree ret
= fold_builtin_classify (loc
, fndecl
, arg0
, BUILT_IN_ISFINITE
);
7957 return fold_builtin_interclass_mathfn (loc
, fndecl
, arg0
);
7960 CASE_FLT_FN (BUILT_IN_ISINF
):
7961 case BUILT_IN_ISINFD32
:
7962 case BUILT_IN_ISINFD64
:
7963 case BUILT_IN_ISINFD128
:
7965 tree ret
= fold_builtin_classify (loc
, fndecl
, arg0
, BUILT_IN_ISINF
);
7968 return fold_builtin_interclass_mathfn (loc
, fndecl
, arg0
);
7971 case BUILT_IN_ISNORMAL
:
7972 return fold_builtin_interclass_mathfn (loc
, fndecl
, arg0
);
7974 case BUILT_IN_ISINF_SIGN
:
7975 return fold_builtin_classify (loc
, fndecl
, arg0
, BUILT_IN_ISINF_SIGN
);
7977 CASE_FLT_FN (BUILT_IN_ISNAN
):
7978 case BUILT_IN_ISNAND32
:
7979 case BUILT_IN_ISNAND64
:
7980 case BUILT_IN_ISNAND128
:
7981 return fold_builtin_classify (loc
, fndecl
, arg0
, BUILT_IN_ISNAN
);
7984 if (integer_zerop (arg0
))
7985 return build_empty_stmt (loc
);
7996 /* Fold a call to built-in function FNDECL with 2 arguments, ARG0 and ARG1.
7997 This function returns NULL_TREE if no simplification was possible. */
8000 fold_builtin_2 (location_t loc
, tree fndecl
, tree arg0
, tree arg1
)
8002 tree type
= TREE_TYPE (TREE_TYPE (fndecl
));
8003 enum built_in_function fcode
= DECL_FUNCTION_CODE (fndecl
);
8005 if (TREE_CODE (arg0
) == ERROR_MARK
8006 || TREE_CODE (arg1
) == ERROR_MARK
)
8009 if (tree ret
= fold_const_call (as_combined_fn (fcode
), type
, arg0
, arg1
))
8014 CASE_FLT_FN_REENT (BUILT_IN_GAMMA
): /* GAMMA_R */
8015 CASE_FLT_FN_REENT (BUILT_IN_LGAMMA
): /* LGAMMA_R */
8016 if (validate_arg (arg0
, REAL_TYPE
)
8017 && validate_arg (arg1
, POINTER_TYPE
))
8018 return do_mpfr_lgamma_r (arg0
, arg1
, type
);
8021 CASE_FLT_FN (BUILT_IN_FREXP
):
8022 return fold_builtin_frexp (loc
, arg0
, arg1
, type
);
8024 CASE_FLT_FN (BUILT_IN_MODF
):
8025 return fold_builtin_modf (loc
, arg0
, arg1
, type
);
8027 case BUILT_IN_STRSTR
:
8028 return fold_builtin_strstr (loc
, arg0
, arg1
, type
);
8030 case BUILT_IN_STRSPN
:
8031 return fold_builtin_strspn (loc
, arg0
, arg1
);
8033 case BUILT_IN_STRCSPN
:
8034 return fold_builtin_strcspn (loc
, arg0
, arg1
);
8036 case BUILT_IN_STRCHR
:
8037 case BUILT_IN_INDEX
:
8038 return fold_builtin_strchr (loc
, arg0
, arg1
, type
);
8040 case BUILT_IN_STRRCHR
:
8041 case BUILT_IN_RINDEX
:
8042 return fold_builtin_strrchr (loc
, arg0
, arg1
, type
);
8044 case BUILT_IN_STRCMP
:
8045 return fold_builtin_strcmp (loc
, arg0
, arg1
);
8047 case BUILT_IN_STRPBRK
:
8048 return fold_builtin_strpbrk (loc
, arg0
, arg1
, type
);
8050 case BUILT_IN_EXPECT
:
8051 return fold_builtin_expect (loc
, arg0
, arg1
, NULL_TREE
);
8053 case BUILT_IN_ISGREATER
:
8054 return fold_builtin_unordered_cmp (loc
, fndecl
,
8055 arg0
, arg1
, UNLE_EXPR
, LE_EXPR
);
8056 case BUILT_IN_ISGREATEREQUAL
:
8057 return fold_builtin_unordered_cmp (loc
, fndecl
,
8058 arg0
, arg1
, UNLT_EXPR
, LT_EXPR
);
8059 case BUILT_IN_ISLESS
:
8060 return fold_builtin_unordered_cmp (loc
, fndecl
,
8061 arg0
, arg1
, UNGE_EXPR
, GE_EXPR
);
8062 case BUILT_IN_ISLESSEQUAL
:
8063 return fold_builtin_unordered_cmp (loc
, fndecl
,
8064 arg0
, arg1
, UNGT_EXPR
, GT_EXPR
);
8065 case BUILT_IN_ISLESSGREATER
:
8066 return fold_builtin_unordered_cmp (loc
, fndecl
,
8067 arg0
, arg1
, UNEQ_EXPR
, EQ_EXPR
);
8068 case BUILT_IN_ISUNORDERED
:
8069 return fold_builtin_unordered_cmp (loc
, fndecl
,
8070 arg0
, arg1
, UNORDERED_EXPR
,
8073 /* We do the folding for va_start in the expander. */
8074 case BUILT_IN_VA_START
:
8077 case BUILT_IN_OBJECT_SIZE
:
8078 return fold_builtin_object_size (arg0
, arg1
);
8080 case BUILT_IN_ATOMIC_ALWAYS_LOCK_FREE
:
8081 return fold_builtin_atomic_always_lock_free (arg0
, arg1
);
8083 case BUILT_IN_ATOMIC_IS_LOCK_FREE
:
8084 return fold_builtin_atomic_is_lock_free (arg0
, arg1
);
8092 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
8094 This function returns NULL_TREE if no simplification was possible. */
8097 fold_builtin_3 (location_t loc
, tree fndecl
,
8098 tree arg0
, tree arg1
, tree arg2
)
8100 tree type
= TREE_TYPE (TREE_TYPE (fndecl
));
8101 enum built_in_function fcode
= DECL_FUNCTION_CODE (fndecl
);
8103 if (TREE_CODE (arg0
) == ERROR_MARK
8104 || TREE_CODE (arg1
) == ERROR_MARK
8105 || TREE_CODE (arg2
) == ERROR_MARK
)
8108 if (tree ret
= fold_const_call (as_combined_fn (fcode
), type
,
8115 CASE_FLT_FN (BUILT_IN_SINCOS
):
8116 return fold_builtin_sincos (loc
, arg0
, arg1
, arg2
);
8118 CASE_FLT_FN (BUILT_IN_FMA
):
8119 return fold_builtin_fma (loc
, arg0
, arg1
, arg2
, type
);
8121 CASE_FLT_FN (BUILT_IN_REMQUO
):
8122 if (validate_arg (arg0
, REAL_TYPE
)
8123 && validate_arg (arg1
, REAL_TYPE
)
8124 && validate_arg (arg2
, POINTER_TYPE
))
8125 return do_mpfr_remquo (arg0
, arg1
, arg2
);
8128 case BUILT_IN_STRNCMP
:
8129 return fold_builtin_strncmp (loc
, arg0
, arg1
, arg2
);
8131 case BUILT_IN_MEMCHR
:
8132 return fold_builtin_memchr (loc
, arg0
, arg1
, arg2
, type
);
8135 case BUILT_IN_MEMCMP
:
8136 return fold_builtin_memcmp (loc
, arg0
, arg1
, arg2
);;
8138 case BUILT_IN_EXPECT
:
8139 return fold_builtin_expect (loc
, arg0
, arg1
, arg2
);
8141 case BUILT_IN_ADD_OVERFLOW
:
8142 case BUILT_IN_SUB_OVERFLOW
:
8143 case BUILT_IN_MUL_OVERFLOW
:
8144 case BUILT_IN_SADD_OVERFLOW
:
8145 case BUILT_IN_SADDL_OVERFLOW
:
8146 case BUILT_IN_SADDLL_OVERFLOW
:
8147 case BUILT_IN_SSUB_OVERFLOW
:
8148 case BUILT_IN_SSUBL_OVERFLOW
:
8149 case BUILT_IN_SSUBLL_OVERFLOW
:
8150 case BUILT_IN_SMUL_OVERFLOW
:
8151 case BUILT_IN_SMULL_OVERFLOW
:
8152 case BUILT_IN_SMULLL_OVERFLOW
:
8153 case BUILT_IN_UADD_OVERFLOW
:
8154 case BUILT_IN_UADDL_OVERFLOW
:
8155 case BUILT_IN_UADDLL_OVERFLOW
:
8156 case BUILT_IN_USUB_OVERFLOW
:
8157 case BUILT_IN_USUBL_OVERFLOW
:
8158 case BUILT_IN_USUBLL_OVERFLOW
:
8159 case BUILT_IN_UMUL_OVERFLOW
:
8160 case BUILT_IN_UMULL_OVERFLOW
:
8161 case BUILT_IN_UMULLL_OVERFLOW
:
8162 return fold_builtin_arith_overflow (loc
, fcode
, arg0
, arg1
, arg2
);
8170 /* Fold a call to built-in function FNDECL. ARGS is an array of NARGS
8171 arguments. IGNORE is true if the result of the
8172 function call is ignored. This function returns NULL_TREE if no
8173 simplification was possible. */
8176 fold_builtin_n (location_t loc
, tree fndecl
, tree
*args
, int nargs
, bool)
8178 tree ret
= NULL_TREE
;
8183 ret
= fold_builtin_0 (loc
, fndecl
);
8186 ret
= fold_builtin_1 (loc
, fndecl
, args
[0]);
8189 ret
= fold_builtin_2 (loc
, fndecl
, args
[0], args
[1]);
8192 ret
= fold_builtin_3 (loc
, fndecl
, args
[0], args
[1], args
[2]);
8195 ret
= fold_builtin_varargs (loc
, fndecl
, args
, nargs
);
8200 ret
= build1 (NOP_EXPR
, TREE_TYPE (ret
), ret
);
8201 SET_EXPR_LOCATION (ret
, loc
);
8202 TREE_NO_WARNING (ret
) = 1;
8208 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
8209 list ARGS along with N new arguments in NEWARGS. SKIP is the number
8210 of arguments in ARGS to be omitted. OLDNARGS is the number of
8211 elements in ARGS. */
8214 rewrite_call_expr_valist (location_t loc
, int oldnargs
, tree
*args
,
8215 int skip
, tree fndecl
, int n
, va_list newargs
)
8217 int nargs
= oldnargs
- skip
+ n
;
8224 buffer
= XALLOCAVEC (tree
, nargs
);
8225 for (i
= 0; i
< n
; i
++)
8226 buffer
[i
] = va_arg (newargs
, tree
);
8227 for (j
= skip
; j
< oldnargs
; j
++, i
++)
8228 buffer
[i
] = args
[j
];
8231 buffer
= args
+ skip
;
8233 return build_call_expr_loc_array (loc
, fndecl
, nargs
, buffer
);
8236 /* Return true if FNDECL shouldn't be folded right now.
8237 If a built-in function has an inline attribute always_inline
8238 wrapper, defer folding it after always_inline functions have
8239 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
8240 might not be performed. */
8243 avoid_folding_inline_builtin (tree fndecl
)
8245 return (DECL_DECLARED_INLINE_P (fndecl
)
8246 && DECL_DISREGARD_INLINE_LIMITS (fndecl
)
8248 && !cfun
->always_inline_functions_inlined
8249 && lookup_attribute ("always_inline", DECL_ATTRIBUTES (fndecl
)));
8252 /* A wrapper function for builtin folding that prevents warnings for
8253 "statement without effect" and the like, caused by removing the
8254 call node earlier than the warning is generated. */
8257 fold_call_expr (location_t loc
, tree exp
, bool ignore
)
8259 tree ret
= NULL_TREE
;
8260 tree fndecl
= get_callee_fndecl (exp
);
8262 && TREE_CODE (fndecl
) == FUNCTION_DECL
8263 && DECL_BUILT_IN (fndecl
)
8264 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
8265 yet. Defer folding until we see all the arguments
8266 (after inlining). */
8267 && !CALL_EXPR_VA_ARG_PACK (exp
))
8269 int nargs
= call_expr_nargs (exp
);
8271 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
8272 instead last argument is __builtin_va_arg_pack (). Defer folding
8273 even in that case, until arguments are finalized. */
8274 if (nargs
&& TREE_CODE (CALL_EXPR_ARG (exp
, nargs
- 1)) == CALL_EXPR
)
8276 tree fndecl2
= get_callee_fndecl (CALL_EXPR_ARG (exp
, nargs
- 1));
8278 && TREE_CODE (fndecl2
) == FUNCTION_DECL
8279 && DECL_BUILT_IN_CLASS (fndecl2
) == BUILT_IN_NORMAL
8280 && DECL_FUNCTION_CODE (fndecl2
) == BUILT_IN_VA_ARG_PACK
)
8284 if (avoid_folding_inline_builtin (fndecl
))
8287 if (DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_MD
)
8288 return targetm
.fold_builtin (fndecl
, call_expr_nargs (exp
),
8289 CALL_EXPR_ARGP (exp
), ignore
);
8292 tree
*args
= CALL_EXPR_ARGP (exp
);
8293 ret
= fold_builtin_n (loc
, fndecl
, args
, nargs
, ignore
);
8301 /* Fold a CALL_EXPR with type TYPE with FN as the function expression.
8302 N arguments are passed in the array ARGARRAY. Return a folded
8303 expression or NULL_TREE if no simplification was possible. */
8306 fold_builtin_call_array (location_t loc
, tree
,
8311 if (TREE_CODE (fn
) != ADDR_EXPR
)
8314 tree fndecl
= TREE_OPERAND (fn
, 0);
8315 if (TREE_CODE (fndecl
) == FUNCTION_DECL
8316 && DECL_BUILT_IN (fndecl
))
8318 /* If last argument is __builtin_va_arg_pack (), arguments to this
8319 function are not finalized yet. Defer folding until they are. */
8320 if (n
&& TREE_CODE (argarray
[n
- 1]) == CALL_EXPR
)
8322 tree fndecl2
= get_callee_fndecl (argarray
[n
- 1]);
8324 && TREE_CODE (fndecl2
) == FUNCTION_DECL
8325 && DECL_BUILT_IN_CLASS (fndecl2
) == BUILT_IN_NORMAL
8326 && DECL_FUNCTION_CODE (fndecl2
) == BUILT_IN_VA_ARG_PACK
)
8329 if (avoid_folding_inline_builtin (fndecl
))
8331 if (DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_MD
)
8332 return targetm
.fold_builtin (fndecl
, n
, argarray
, false);
8334 return fold_builtin_n (loc
, fndecl
, argarray
, n
, false);
8340 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
8341 along with N new arguments specified as the "..." parameters. SKIP
8342 is the number of arguments in EXP to be omitted. This function is used
8343 to do varargs-to-varargs transformations. */
8346 rewrite_call_expr (location_t loc
, tree exp
, int skip
, tree fndecl
, int n
, ...)
8352 t
= rewrite_call_expr_valist (loc
, call_expr_nargs (exp
),
8353 CALL_EXPR_ARGP (exp
), skip
, fndecl
, n
, ap
);
8359 /* Validate a single argument ARG against a tree code CODE representing
8363 validate_arg (const_tree arg
, enum tree_code code
)
8367 else if (code
== POINTER_TYPE
)
8368 return POINTER_TYPE_P (TREE_TYPE (arg
));
8369 else if (code
== INTEGER_TYPE
)
8370 return INTEGRAL_TYPE_P (TREE_TYPE (arg
));
8371 return code
== TREE_CODE (TREE_TYPE (arg
));
8374 /* This function validates the types of a function call argument list
8375 against a specified list of tree_codes. If the last specifier is a 0,
8376 that represents an ellipses, otherwise the last specifier must be a
8379 This is the GIMPLE version of validate_arglist. Eventually we want to
8380 completely convert builtins.c to work from GIMPLEs and the tree based
8381 validate_arglist will then be removed. */
8384 validate_gimple_arglist (const gcall
*call
, ...)
8386 enum tree_code code
;
8392 va_start (ap
, call
);
8397 code
= (enum tree_code
) va_arg (ap
, int);
8401 /* This signifies an ellipses, any further arguments are all ok. */
8405 /* This signifies an endlink, if no arguments remain, return
8406 true, otherwise return false. */
8407 res
= (i
== gimple_call_num_args (call
));
8410 /* If no parameters remain or the parameter's code does not
8411 match the specified code, return false. Otherwise continue
8412 checking any remaining arguments. */
8413 arg
= gimple_call_arg (call
, i
++);
8414 if (!validate_arg (arg
, code
))
8421 /* We need gotos here since we can only have one VA_CLOSE in a
8429 /* Default target-specific builtin expander that does nothing. */
8432 default_expand_builtin (tree exp ATTRIBUTE_UNUSED
,
8433 rtx target ATTRIBUTE_UNUSED
,
8434 rtx subtarget ATTRIBUTE_UNUSED
,
8435 machine_mode mode ATTRIBUTE_UNUSED
,
8436 int ignore ATTRIBUTE_UNUSED
)
8441 /* Returns true is EXP represents data that would potentially reside
8442 in a readonly section. */
8445 readonly_data_expr (tree exp
)
8449 if (TREE_CODE (exp
) != ADDR_EXPR
)
8452 exp
= get_base_address (TREE_OPERAND (exp
, 0));
8456 /* Make sure we call decl_readonly_section only for trees it
8457 can handle (since it returns true for everything it doesn't
8459 if (TREE_CODE (exp
) == STRING_CST
8460 || TREE_CODE (exp
) == CONSTRUCTOR
8461 || (TREE_CODE (exp
) == VAR_DECL
&& TREE_STATIC (exp
)))
8462 return decl_readonly_section (exp
, 0);
8467 /* Simplify a call to the strstr builtin. S1 and S2 are the arguments
8468 to the call, and TYPE is its return type.
8470 Return NULL_TREE if no simplification was possible, otherwise return the
8471 simplified form of the call as a tree.
8473 The simplified form may be a constant or other expression which
8474 computes the same value, but in a more efficient manner (including
8475 calls to other builtin functions).
8477 The call may contain arguments which need to be evaluated, but
8478 which are not useful to determine the result of the call. In
8479 this case we return a chain of COMPOUND_EXPRs. The LHS of each
8480 COMPOUND_EXPR will be an argument which must be evaluated.
8481 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
8482 COMPOUND_EXPR in the chain will contain the tree for the simplified
8483 form of the builtin function call. */
8486 fold_builtin_strstr (location_t loc
, tree s1
, tree s2
, tree type
)
8488 if (!validate_arg (s1
, POINTER_TYPE
)
8489 || !validate_arg (s2
, POINTER_TYPE
))
8494 const char *p1
, *p2
;
8503 const char *r
= strstr (p1
, p2
);
8507 return build_int_cst (TREE_TYPE (s1
), 0);
8509 /* Return an offset into the constant string argument. */
8510 tem
= fold_build_pointer_plus_hwi_loc (loc
, s1
, r
- p1
);
8511 return fold_convert_loc (loc
, type
, tem
);
8514 /* The argument is const char *, and the result is char *, so we need
8515 a type conversion here to avoid a warning. */
8517 return fold_convert_loc (loc
, type
, s1
);
8522 fn
= builtin_decl_implicit (BUILT_IN_STRCHR
);
8526 /* New argument list transforming strstr(s1, s2) to
8527 strchr(s1, s2[0]). */
8528 return build_call_expr_loc (loc
, fn
, 2, s1
,
8529 build_int_cst (integer_type_node
, p2
[0]));
8533 /* Simplify a call to the strchr builtin. S1 and S2 are the arguments to
8534 the call, and TYPE is its return type.
8536 Return NULL_TREE if no simplification was possible, otherwise return the
8537 simplified form of the call as a tree.
8539 The simplified form may be a constant or other expression which
8540 computes the same value, but in a more efficient manner (including
8541 calls to other builtin functions).
8543 The call may contain arguments which need to be evaluated, but
8544 which are not useful to determine the result of the call. In
8545 this case we return a chain of COMPOUND_EXPRs. The LHS of each
8546 COMPOUND_EXPR will be an argument which must be evaluated.
8547 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
8548 COMPOUND_EXPR in the chain will contain the tree for the simplified
8549 form of the builtin function call. */
8552 fold_builtin_strchr (location_t loc
, tree s1
, tree s2
, tree type
)
8554 if (!validate_arg (s1
, POINTER_TYPE
)
8555 || !validate_arg (s2
, INTEGER_TYPE
))
8561 if (TREE_CODE (s2
) != INTEGER_CST
)
8571 if (target_char_cast (s2
, &c
))
8577 return build_int_cst (TREE_TYPE (s1
), 0);
8579 /* Return an offset into the constant string argument. */
8580 tem
= fold_build_pointer_plus_hwi_loc (loc
, s1
, r
- p1
);
8581 return fold_convert_loc (loc
, type
, tem
);
8587 /* Simplify a call to the strrchr builtin. S1 and S2 are the arguments to
8588 the call, and TYPE is its return type.
8590 Return NULL_TREE if no simplification was possible, otherwise return the
8591 simplified form of the call as a tree.
8593 The simplified form may be a constant or other expression which
8594 computes the same value, but in a more efficient manner (including
8595 calls to other builtin functions).
8597 The call may contain arguments which need to be evaluated, but
8598 which are not useful to determine the result of the call. In
8599 this case we return a chain of COMPOUND_EXPRs. The LHS of each
8600 COMPOUND_EXPR will be an argument which must be evaluated.
8601 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
8602 COMPOUND_EXPR in the chain will contain the tree for the simplified
8603 form of the builtin function call. */
8606 fold_builtin_strrchr (location_t loc
, tree s1
, tree s2
, tree type
)
8608 if (!validate_arg (s1
, POINTER_TYPE
)
8609 || !validate_arg (s2
, INTEGER_TYPE
))
8616 if (TREE_CODE (s2
) != INTEGER_CST
)
8626 if (target_char_cast (s2
, &c
))
8629 r
= strrchr (p1
, c
);
8632 return build_int_cst (TREE_TYPE (s1
), 0);
8634 /* Return an offset into the constant string argument. */
8635 tem
= fold_build_pointer_plus_hwi_loc (loc
, s1
, r
- p1
);
8636 return fold_convert_loc (loc
, type
, tem
);
8639 if (! integer_zerop (s2
))
8642 fn
= builtin_decl_implicit (BUILT_IN_STRCHR
);
8646 /* Transform strrchr(s1, '\0') to strchr(s1, '\0'). */
8647 return build_call_expr_loc (loc
, fn
, 2, s1
, s2
);
8651 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
8652 to the call, and TYPE is its return type.
8654 Return NULL_TREE if no simplification was possible, otherwise return the
8655 simplified form of the call as a tree.
8657 The simplified form may be a constant or other expression which
8658 computes the same value, but in a more efficient manner (including
8659 calls to other builtin functions).
8661 The call may contain arguments which need to be evaluated, but
8662 which are not useful to determine the result of the call. In
8663 this case we return a chain of COMPOUND_EXPRs. The LHS of each
8664 COMPOUND_EXPR will be an argument which must be evaluated.
8665 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
8666 COMPOUND_EXPR in the chain will contain the tree for the simplified
8667 form of the builtin function call. */
8670 fold_builtin_strpbrk (location_t loc
, tree s1
, tree s2
, tree type
)
8672 if (!validate_arg (s1
, POINTER_TYPE
)
8673 || !validate_arg (s2
, POINTER_TYPE
))
8678 const char *p1
, *p2
;
8687 const char *r
= strpbrk (p1
, p2
);
8691 return build_int_cst (TREE_TYPE (s1
), 0);
8693 /* Return an offset into the constant string argument. */
8694 tem
= fold_build_pointer_plus_hwi_loc (loc
, s1
, r
- p1
);
8695 return fold_convert_loc (loc
, type
, tem
);
8699 /* strpbrk(x, "") == NULL.
8700 Evaluate and ignore s1 in case it had side-effects. */
8701 return omit_one_operand_loc (loc
, TREE_TYPE (s1
), integer_zero_node
, s1
);
8704 return NULL_TREE
; /* Really call strpbrk. */
8706 fn
= builtin_decl_implicit (BUILT_IN_STRCHR
);
8710 /* New argument list transforming strpbrk(s1, s2) to
8711 strchr(s1, s2[0]). */
8712 return build_call_expr_loc (loc
, fn
, 2, s1
,
8713 build_int_cst (integer_type_node
, p2
[0]));
8717 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
8720 Return NULL_TREE if no simplification was possible, otherwise return the
8721 simplified form of the call as a tree.
8723 The simplified form may be a constant or other expression which
8724 computes the same value, but in a more efficient manner (including
8725 calls to other builtin functions).
8727 The call may contain arguments which need to be evaluated, but
8728 which are not useful to determine the result of the call. In
8729 this case we return a chain of COMPOUND_EXPRs. The LHS of each
8730 COMPOUND_EXPR will be an argument which must be evaluated.
8731 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
8732 COMPOUND_EXPR in the chain will contain the tree for the simplified
8733 form of the builtin function call. */
8736 fold_builtin_strspn (location_t loc
, tree s1
, tree s2
)
8738 if (!validate_arg (s1
, POINTER_TYPE
)
8739 || !validate_arg (s2
, POINTER_TYPE
))
8743 const char *p1
= c_getstr (s1
), *p2
= c_getstr (s2
);
8745 /* If either argument is "", return NULL_TREE. */
8746 if ((p1
&& *p1
== '\0') || (p2
&& *p2
== '\0'))
8747 /* Evaluate and ignore both arguments in case either one has
8749 return omit_two_operands_loc (loc
, size_type_node
, size_zero_node
,
8755 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
8758 Return NULL_TREE if no simplification was possible, otherwise return the
8759 simplified form of the call as a tree.
8761 The simplified form may be a constant or other expression which
8762 computes the same value, but in a more efficient manner (including
8763 calls to other builtin functions).
8765 The call may contain arguments which need to be evaluated, but
8766 which are not useful to determine the result of the call. In
8767 this case we return a chain of COMPOUND_EXPRs. The LHS of each
8768 COMPOUND_EXPR will be an argument which must be evaluated.
8769 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
8770 COMPOUND_EXPR in the chain will contain the tree for the simplified
8771 form of the builtin function call. */
8774 fold_builtin_strcspn (location_t loc
, tree s1
, tree s2
)
8776 if (!validate_arg (s1
, POINTER_TYPE
)
8777 || !validate_arg (s2
, POINTER_TYPE
))
8781 /* If the first argument is "", return NULL_TREE. */
8782 const char *p1
= c_getstr (s1
);
8783 if (p1
&& *p1
== '\0')
8785 /* Evaluate and ignore argument s2 in case it has
8787 return omit_one_operand_loc (loc
, size_type_node
,
8788 size_zero_node
, s2
);
8791 /* If the second argument is "", return __builtin_strlen(s1). */
8792 const char *p2
= c_getstr (s2
);
8793 if (p2
&& *p2
== '\0')
8795 tree fn
= builtin_decl_implicit (BUILT_IN_STRLEN
);
8797 /* If the replacement _DECL isn't initialized, don't do the
8802 return build_call_expr_loc (loc
, fn
, 1, s1
);
8808 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
8809 produced. False otherwise. This is done so that we don't output the error
8810 or warning twice or three times. */
8813 fold_builtin_next_arg (tree exp
, bool va_start_p
)
8815 tree fntype
= TREE_TYPE (current_function_decl
);
8816 int nargs
= call_expr_nargs (exp
);
8818 /* There is good chance the current input_location points inside the
8819 definition of the va_start macro (perhaps on the token for
8820 builtin) in a system header, so warnings will not be emitted.
8821 Use the location in real source code. */
8822 source_location current_location
=
8823 linemap_unwind_to_first_non_reserved_loc (line_table
, input_location
,
8826 if (!stdarg_p (fntype
))
8828 error ("%<va_start%> used in function with fixed args");
8834 if (va_start_p
&& (nargs
!= 2))
8836 error ("wrong number of arguments to function %<va_start%>");
8839 arg
= CALL_EXPR_ARG (exp
, 1);
8841 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
8842 when we checked the arguments and if needed issued a warning. */
8847 /* Evidently an out of date version of <stdarg.h>; can't validate
8848 va_start's second argument, but can still work as intended. */
8849 warning_at (current_location
,
8851 "%<__builtin_next_arg%> called without an argument");
8856 error ("wrong number of arguments to function %<__builtin_next_arg%>");
8859 arg
= CALL_EXPR_ARG (exp
, 0);
8862 if (TREE_CODE (arg
) == SSA_NAME
)
8863 arg
= SSA_NAME_VAR (arg
);
8865 /* We destructively modify the call to be __builtin_va_start (ap, 0)
8866 or __builtin_next_arg (0) the first time we see it, after checking
8867 the arguments and if needed issuing a warning. */
8868 if (!integer_zerop (arg
))
8870 tree last_parm
= tree_last (DECL_ARGUMENTS (current_function_decl
));
8872 /* Strip off all nops for the sake of the comparison. This
8873 is not quite the same as STRIP_NOPS. It does more.
8874 We must also strip off INDIRECT_EXPR for C++ reference
8876 while (CONVERT_EXPR_P (arg
)
8877 || TREE_CODE (arg
) == INDIRECT_REF
)
8878 arg
= TREE_OPERAND (arg
, 0);
8879 if (arg
!= last_parm
)
8881 /* FIXME: Sometimes with the tree optimizers we can get the
8882 not the last argument even though the user used the last
8883 argument. We just warn and set the arg to be the last
8884 argument so that we will get wrong-code because of
8886 warning_at (current_location
,
8888 "second parameter of %<va_start%> not last named argument");
8891 /* Undefined by C99 7.15.1.4p4 (va_start):
8892 "If the parameter parmN is declared with the register storage
8893 class, with a function or array type, or with a type that is
8894 not compatible with the type that results after application of
8895 the default argument promotions, the behavior is undefined."
8897 else if (DECL_REGISTER (arg
))
8899 warning_at (current_location
,
8901 "undefined behaviour when second parameter of "
8902 "%<va_start%> is declared with %<register%> storage");
8905 /* We want to verify the second parameter just once before the tree
8906 optimizers are run and then avoid keeping it in the tree,
8907 as otherwise we could warn even for correct code like:
8908 void foo (int i, ...)
8909 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
8911 CALL_EXPR_ARG (exp
, 1) = integer_zero_node
;
8913 CALL_EXPR_ARG (exp
, 0) = integer_zero_node
;
8919 /* Expand a call EXP to __builtin_object_size. */
8922 expand_builtin_object_size (tree exp
)
8925 int object_size_type
;
8926 tree fndecl
= get_callee_fndecl (exp
);
8928 if (!validate_arglist (exp
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
8930 error ("%Kfirst argument of %D must be a pointer, second integer constant",
8932 expand_builtin_trap ();
8936 ost
= CALL_EXPR_ARG (exp
, 1);
8939 if (TREE_CODE (ost
) != INTEGER_CST
8940 || tree_int_cst_sgn (ost
) < 0
8941 || compare_tree_int (ost
, 3) > 0)
8943 error ("%Klast argument of %D is not integer constant between 0 and 3",
8945 expand_builtin_trap ();
8949 object_size_type
= tree_to_shwi (ost
);
8951 return object_size_type
< 2 ? constm1_rtx
: const0_rtx
;
8954 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
8955 FCODE is the BUILT_IN_* to use.
8956 Return NULL_RTX if we failed; the caller should emit a normal call,
8957 otherwise try to get the result in TARGET, if convenient (and in
8958 mode MODE if that's convenient). */
8961 expand_builtin_memory_chk (tree exp
, rtx target
, machine_mode mode
,
8962 enum built_in_function fcode
)
8964 tree dest
, src
, len
, size
;
8966 if (!validate_arglist (exp
,
8968 fcode
== BUILT_IN_MEMSET_CHK
8969 ? INTEGER_TYPE
: POINTER_TYPE
,
8970 INTEGER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
8973 dest
= CALL_EXPR_ARG (exp
, 0);
8974 src
= CALL_EXPR_ARG (exp
, 1);
8975 len
= CALL_EXPR_ARG (exp
, 2);
8976 size
= CALL_EXPR_ARG (exp
, 3);
8978 if (! tree_fits_uhwi_p (size
))
8981 if (tree_fits_uhwi_p (len
) || integer_all_onesp (size
))
8985 if (! integer_all_onesp (size
) && tree_int_cst_lt (size
, len
))
8987 warning_at (tree_nonartificial_location (exp
),
8988 0, "%Kcall to %D will always overflow destination buffer",
8989 exp
, get_callee_fndecl (exp
));
8994 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
8995 mem{cpy,pcpy,move,set} is available. */
8998 case BUILT_IN_MEMCPY_CHK
:
8999 fn
= builtin_decl_explicit (BUILT_IN_MEMCPY
);
9001 case BUILT_IN_MEMPCPY_CHK
:
9002 fn
= builtin_decl_explicit (BUILT_IN_MEMPCPY
);
9004 case BUILT_IN_MEMMOVE_CHK
:
9005 fn
= builtin_decl_explicit (BUILT_IN_MEMMOVE
);
9007 case BUILT_IN_MEMSET_CHK
:
9008 fn
= builtin_decl_explicit (BUILT_IN_MEMSET
);
9017 fn
= build_call_nofold_loc (EXPR_LOCATION (exp
), fn
, 3, dest
, src
, len
);
9018 gcc_assert (TREE_CODE (fn
) == CALL_EXPR
);
9019 CALL_EXPR_TAILCALL (fn
) = CALL_EXPR_TAILCALL (exp
);
9020 return expand_expr (fn
, target
, mode
, EXPAND_NORMAL
);
9022 else if (fcode
== BUILT_IN_MEMSET_CHK
)
9026 unsigned int dest_align
= get_pointer_alignment (dest
);
9028 /* If DEST is not a pointer type, call the normal function. */
9029 if (dest_align
== 0)
9032 /* If SRC and DEST are the same (and not volatile), do nothing. */
9033 if (operand_equal_p (src
, dest
, 0))
9037 if (fcode
!= BUILT_IN_MEMPCPY_CHK
)
9039 /* Evaluate and ignore LEN in case it has side-effects. */
9040 expand_expr (len
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
9041 return expand_expr (dest
, target
, mode
, EXPAND_NORMAL
);
9044 expr
= fold_build_pointer_plus (dest
, len
);
9045 return expand_expr (expr
, target
, mode
, EXPAND_NORMAL
);
9048 /* __memmove_chk special case. */
9049 if (fcode
== BUILT_IN_MEMMOVE_CHK
)
9051 unsigned int src_align
= get_pointer_alignment (src
);
9056 /* If src is categorized for a readonly section we can use
9057 normal __memcpy_chk. */
9058 if (readonly_data_expr (src
))
9060 tree fn
= builtin_decl_explicit (BUILT_IN_MEMCPY_CHK
);
9063 fn
= build_call_nofold_loc (EXPR_LOCATION (exp
), fn
, 4,
9064 dest
, src
, len
, size
);
9065 gcc_assert (TREE_CODE (fn
) == CALL_EXPR
);
9066 CALL_EXPR_TAILCALL (fn
) = CALL_EXPR_TAILCALL (exp
);
9067 return expand_expr (fn
, target
, mode
, EXPAND_NORMAL
);
9074 /* Emit warning if a buffer overflow is detected at compile time. */
9077 maybe_emit_chk_warning (tree exp
, enum built_in_function fcode
)
9081 location_t loc
= tree_nonartificial_location (exp
);
9085 case BUILT_IN_STRCPY_CHK
:
9086 case BUILT_IN_STPCPY_CHK
:
9087 /* For __strcat_chk the warning will be emitted only if overflowing
9088 by at least strlen (dest) + 1 bytes. */
9089 case BUILT_IN_STRCAT_CHK
:
9090 len
= CALL_EXPR_ARG (exp
, 1);
9091 size
= CALL_EXPR_ARG (exp
, 2);
9094 case BUILT_IN_STRNCAT_CHK
:
9095 case BUILT_IN_STRNCPY_CHK
:
9096 case BUILT_IN_STPNCPY_CHK
:
9097 len
= CALL_EXPR_ARG (exp
, 2);
9098 size
= CALL_EXPR_ARG (exp
, 3);
9100 case BUILT_IN_SNPRINTF_CHK
:
9101 case BUILT_IN_VSNPRINTF_CHK
:
9102 len
= CALL_EXPR_ARG (exp
, 1);
9103 size
= CALL_EXPR_ARG (exp
, 3);
9112 if (! tree_fits_uhwi_p (size
) || integer_all_onesp (size
))
9117 len
= c_strlen (len
, 1);
9118 if (! len
|| ! tree_fits_uhwi_p (len
) || tree_int_cst_lt (len
, size
))
9121 else if (fcode
== BUILT_IN_STRNCAT_CHK
)
9123 tree src
= CALL_EXPR_ARG (exp
, 1);
9124 if (! src
|| ! tree_fits_uhwi_p (len
) || tree_int_cst_lt (len
, size
))
9126 src
= c_strlen (src
, 1);
9127 if (! src
|| ! tree_fits_uhwi_p (src
))
9129 warning_at (loc
, 0, "%Kcall to %D might overflow destination buffer",
9130 exp
, get_callee_fndecl (exp
));
9133 else if (tree_int_cst_lt (src
, size
))
9136 else if (! tree_fits_uhwi_p (len
) || ! tree_int_cst_lt (size
, len
))
9139 warning_at (loc
, 0, "%Kcall to %D will always overflow destination buffer",
9140 exp
, get_callee_fndecl (exp
));
9143 /* Emit warning if a buffer overflow is detected at compile time
9144 in __sprintf_chk/__vsprintf_chk calls. */
9147 maybe_emit_sprintf_chk_warning (tree exp
, enum built_in_function fcode
)
9149 tree size
, len
, fmt
;
9150 const char *fmt_str
;
9151 int nargs
= call_expr_nargs (exp
);
9153 /* Verify the required arguments in the original call. */
9157 size
= CALL_EXPR_ARG (exp
, 2);
9158 fmt
= CALL_EXPR_ARG (exp
, 3);
9160 if (! tree_fits_uhwi_p (size
) || integer_all_onesp (size
))
9163 /* Check whether the format is a literal string constant. */
9164 fmt_str
= c_getstr (fmt
);
9165 if (fmt_str
== NULL
)
9168 if (!init_target_chars ())
9171 /* If the format doesn't contain % args or %%, we know its size. */
9172 if (strchr (fmt_str
, target_percent
) == 0)
9173 len
= build_int_cstu (size_type_node
, strlen (fmt_str
));
9174 /* If the format is "%s" and first ... argument is a string literal,
9176 else if (fcode
== BUILT_IN_SPRINTF_CHK
9177 && strcmp (fmt_str
, target_percent_s
) == 0)
9183 arg
= CALL_EXPR_ARG (exp
, 4);
9184 if (! POINTER_TYPE_P (TREE_TYPE (arg
)))
9187 len
= c_strlen (arg
, 1);
9188 if (!len
|| ! tree_fits_uhwi_p (len
))
9194 if (! tree_int_cst_lt (len
, size
))
9195 warning_at (tree_nonartificial_location (exp
),
9196 0, "%Kcall to %D will always overflow destination buffer",
9197 exp
, get_callee_fndecl (exp
));
9200 /* Emit warning if a free is called with address of a variable. */
9203 maybe_emit_free_warning (tree exp
)
9205 tree arg
= CALL_EXPR_ARG (exp
, 0);
9208 if (TREE_CODE (arg
) != ADDR_EXPR
)
9211 arg
= get_base_address (TREE_OPERAND (arg
, 0));
9212 if (arg
== NULL
|| INDIRECT_REF_P (arg
) || TREE_CODE (arg
) == MEM_REF
)
9215 if (SSA_VAR_P (arg
))
9216 warning_at (tree_nonartificial_location (exp
), OPT_Wfree_nonheap_object
,
9217 "%Kattempt to free a non-heap object %qD", exp
, arg
);
9219 warning_at (tree_nonartificial_location (exp
), OPT_Wfree_nonheap_object
,
9220 "%Kattempt to free a non-heap object", exp
);
9223 /* Fold a call to __builtin_object_size with arguments PTR and OST,
9227 fold_builtin_object_size (tree ptr
, tree ost
)
9229 unsigned HOST_WIDE_INT bytes
;
9230 int object_size_type
;
9232 if (!validate_arg (ptr
, POINTER_TYPE
)
9233 || !validate_arg (ost
, INTEGER_TYPE
))
9238 if (TREE_CODE (ost
) != INTEGER_CST
9239 || tree_int_cst_sgn (ost
) < 0
9240 || compare_tree_int (ost
, 3) > 0)
9243 object_size_type
= tree_to_shwi (ost
);
9245 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
9246 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
9247 and (size_t) 0 for types 2 and 3. */
9248 if (TREE_SIDE_EFFECTS (ptr
))
9249 return build_int_cst_type (size_type_node
, object_size_type
< 2 ? -1 : 0);
9251 if (TREE_CODE (ptr
) == ADDR_EXPR
)
9253 bytes
= compute_builtin_object_size (ptr
, object_size_type
);
9254 if (wi::fits_to_tree_p (bytes
, size_type_node
))
9255 return build_int_cstu (size_type_node
, bytes
);
9257 else if (TREE_CODE (ptr
) == SSA_NAME
)
9259 /* If object size is not known yet, delay folding until
9260 later. Maybe subsequent passes will help determining
9262 bytes
= compute_builtin_object_size (ptr
, object_size_type
);
9263 if (bytes
!= (unsigned HOST_WIDE_INT
) (object_size_type
< 2 ? -1 : 0)
9264 && wi::fits_to_tree_p (bytes
, size_type_node
))
9265 return build_int_cstu (size_type_node
, bytes
);
9271 /* Builtins with folding operations that operate on "..." arguments
9272 need special handling; we need to store the arguments in a convenient
9273 data structure before attempting any folding. Fortunately there are
9274 only a few builtins that fall into this category. FNDECL is the
9275 function, EXP is the CALL_EXPR for the call. */
9278 fold_builtin_varargs (location_t loc
, tree fndecl
, tree
*args
, int nargs
)
9280 enum built_in_function fcode
= DECL_FUNCTION_CODE (fndecl
);
9281 tree ret
= NULL_TREE
;
9285 case BUILT_IN_FPCLASSIFY
:
9286 ret
= fold_builtin_fpclassify (loc
, args
, nargs
);
9294 ret
= build1 (NOP_EXPR
, TREE_TYPE (ret
), ret
);
9295 SET_EXPR_LOCATION (ret
, loc
);
9296 TREE_NO_WARNING (ret
) = 1;
9302 /* Initialize format string characters in the target charset. */
9305 init_target_chars (void)
9310 target_newline
= lang_hooks
.to_target_charset ('\n');
9311 target_percent
= lang_hooks
.to_target_charset ('%');
9312 target_c
= lang_hooks
.to_target_charset ('c');
9313 target_s
= lang_hooks
.to_target_charset ('s');
9314 if (target_newline
== 0 || target_percent
== 0 || target_c
== 0
9318 target_percent_c
[0] = target_percent
;
9319 target_percent_c
[1] = target_c
;
9320 target_percent_c
[2] = '\0';
9322 target_percent_s
[0] = target_percent
;
9323 target_percent_s
[1] = target_s
;
9324 target_percent_s
[2] = '\0';
9326 target_percent_s_newline
[0] = target_percent
;
9327 target_percent_s_newline
[1] = target_s
;
9328 target_percent_s_newline
[2] = target_newline
;
9329 target_percent_s_newline
[3] = '\0';
9336 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
9337 and no overflow/underflow occurred. INEXACT is true if M was not
9338 exactly calculated. TYPE is the tree type for the result. This
9339 function assumes that you cleared the MPFR flags and then
9340 calculated M to see if anything subsequently set a flag prior to
9341 entering this function. Return NULL_TREE if any checks fail. */
9344 do_mpfr_ckconv (mpfr_srcptr m
, tree type
, int inexact
)
9346 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
9347 overflow/underflow occurred. If -frounding-math, proceed iff the
9348 result of calling FUNC was exact. */
9349 if (mpfr_number_p (m
) && !mpfr_overflow_p () && !mpfr_underflow_p ()
9350 && (!flag_rounding_math
|| !inexact
))
9354 real_from_mpfr (&rr
, m
, type
, GMP_RNDN
);
9355 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
9356 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
9357 but the mpft_t is not, then we underflowed in the
9359 if (real_isfinite (&rr
)
9360 && (rr
.cl
== rvc_zero
) == (mpfr_zero_p (m
) != 0))
9362 REAL_VALUE_TYPE rmode
;
9364 real_convert (&rmode
, TYPE_MODE (type
), &rr
);
9365 /* Proceed iff the specified mode can hold the value. */
9366 if (real_identical (&rmode
, &rr
))
9367 return build_real (type
, rmode
);
9373 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
9374 number and no overflow/underflow occurred. INEXACT is true if M
9375 was not exactly calculated. TYPE is the tree type for the result.
9376 This function assumes that you cleared the MPFR flags and then
9377 calculated M to see if anything subsequently set a flag prior to
9378 entering this function. Return NULL_TREE if any checks fail, if
9379 FORCE_CONVERT is true, then bypass the checks. */
9382 do_mpc_ckconv (mpc_srcptr m
, tree type
, int inexact
, int force_convert
)
9384 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
9385 overflow/underflow occurred. If -frounding-math, proceed iff the
9386 result of calling FUNC was exact. */
9388 || (mpfr_number_p (mpc_realref (m
)) && mpfr_number_p (mpc_imagref (m
))
9389 && !mpfr_overflow_p () && !mpfr_underflow_p ()
9390 && (!flag_rounding_math
|| !inexact
)))
9392 REAL_VALUE_TYPE re
, im
;
9394 real_from_mpfr (&re
, mpc_realref (m
), TREE_TYPE (type
), GMP_RNDN
);
9395 real_from_mpfr (&im
, mpc_imagref (m
), TREE_TYPE (type
), GMP_RNDN
);
9396 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
9397 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
9398 but the mpft_t is not, then we underflowed in the
9401 || (real_isfinite (&re
) && real_isfinite (&im
)
9402 && (re
.cl
== rvc_zero
) == (mpfr_zero_p (mpc_realref (m
)) != 0)
9403 && (im
.cl
== rvc_zero
) == (mpfr_zero_p (mpc_imagref (m
)) != 0)))
9405 REAL_VALUE_TYPE re_mode
, im_mode
;
9407 real_convert (&re_mode
, TYPE_MODE (TREE_TYPE (type
)), &re
);
9408 real_convert (&im_mode
, TYPE_MODE (TREE_TYPE (type
)), &im
);
9409 /* Proceed iff the specified mode can hold the value. */
9411 || (real_identical (&re_mode
, &re
)
9412 && real_identical (&im_mode
, &im
)))
9413 return build_complex (type
, build_real (TREE_TYPE (type
), re_mode
),
9414 build_real (TREE_TYPE (type
), im_mode
));
9420 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
9421 the pointer *(ARG_QUO) and return the result. The type is taken
9422 from the type of ARG0 and is used for setting the precision of the
9423 calculation and results. */
9426 do_mpfr_remquo (tree arg0
, tree arg1
, tree arg_quo
)
9428 tree
const type
= TREE_TYPE (arg0
);
9429 tree result
= NULL_TREE
;
9434 /* To proceed, MPFR must exactly represent the target floating point
9435 format, which only happens when the target base equals two. */
9436 if (REAL_MODE_FORMAT (TYPE_MODE (type
))->b
== 2
9437 && TREE_CODE (arg0
) == REAL_CST
&& !TREE_OVERFLOW (arg0
)
9438 && TREE_CODE (arg1
) == REAL_CST
&& !TREE_OVERFLOW (arg1
))
9440 const REAL_VALUE_TYPE
*const ra0
= TREE_REAL_CST_PTR (arg0
);
9441 const REAL_VALUE_TYPE
*const ra1
= TREE_REAL_CST_PTR (arg1
);
9443 if (real_isfinite (ra0
) && real_isfinite (ra1
))
9445 const struct real_format
*fmt
= REAL_MODE_FORMAT (TYPE_MODE (type
));
9446 const int prec
= fmt
->p
;
9447 const mp_rnd_t rnd
= fmt
->round_towards_zero
? GMP_RNDZ
: GMP_RNDN
;
9452 mpfr_inits2 (prec
, m0
, m1
, NULL
);
9453 mpfr_from_real (m0
, ra0
, GMP_RNDN
);
9454 mpfr_from_real (m1
, ra1
, GMP_RNDN
);
9455 mpfr_clear_flags ();
9456 mpfr_remquo (m0
, &integer_quo
, m0
, m1
, rnd
);
9457 /* Remquo is independent of the rounding mode, so pass
9458 inexact=0 to do_mpfr_ckconv(). */
9459 result_rem
= do_mpfr_ckconv (m0
, type
, /*inexact=*/ 0);
9460 mpfr_clears (m0
, m1
, NULL
);
9463 /* MPFR calculates quo in the host's long so it may
9464 return more bits in quo than the target int can hold
9465 if sizeof(host long) > sizeof(target int). This can
9466 happen even for native compilers in LP64 mode. In
9467 these cases, modulo the quo value with the largest
9468 number that the target int can hold while leaving one
9469 bit for the sign. */
9470 if (sizeof (integer_quo
) * CHAR_BIT
> INT_TYPE_SIZE
)
9471 integer_quo
%= (long)(1UL << (INT_TYPE_SIZE
- 1));
9473 /* Dereference the quo pointer argument. */
9474 arg_quo
= build_fold_indirect_ref (arg_quo
);
9475 /* Proceed iff a valid pointer type was passed in. */
9476 if (TYPE_MAIN_VARIANT (TREE_TYPE (arg_quo
)) == integer_type_node
)
9478 /* Set the value. */
9480 = fold_build2 (MODIFY_EXPR
, TREE_TYPE (arg_quo
), arg_quo
,
9481 build_int_cst (TREE_TYPE (arg_quo
),
9483 TREE_SIDE_EFFECTS (result_quo
) = 1;
9484 /* Combine the quo assignment with the rem. */
9485 result
= non_lvalue (fold_build2 (COMPOUND_EXPR
, type
,
9486 result_quo
, result_rem
));
9494 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
9495 resulting value as a tree with type TYPE. The mpfr precision is
9496 set to the precision of TYPE. We assume that this mpfr function
9497 returns zero if the result could be calculated exactly within the
9498 requested precision. In addition, the integer pointer represented
9499 by ARG_SG will be dereferenced and set to the appropriate signgam
9503 do_mpfr_lgamma_r (tree arg
, tree arg_sg
, tree type
)
9505 tree result
= NULL_TREE
;
9509 /* To proceed, MPFR must exactly represent the target floating point
9510 format, which only happens when the target base equals two. Also
9511 verify ARG is a constant and that ARG_SG is an int pointer. */
9512 if (REAL_MODE_FORMAT (TYPE_MODE (type
))->b
== 2
9513 && TREE_CODE (arg
) == REAL_CST
&& !TREE_OVERFLOW (arg
)
9514 && TREE_CODE (TREE_TYPE (arg_sg
)) == POINTER_TYPE
9515 && TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (arg_sg
))) == integer_type_node
)
9517 const REAL_VALUE_TYPE
*const ra
= TREE_REAL_CST_PTR (arg
);
9519 /* In addition to NaN and Inf, the argument cannot be zero or a
9520 negative integer. */
9521 if (real_isfinite (ra
)
9522 && ra
->cl
!= rvc_zero
9523 && !(real_isneg (ra
) && real_isinteger (ra
, TYPE_MODE (type
))))
9525 const struct real_format
*fmt
= REAL_MODE_FORMAT (TYPE_MODE (type
));
9526 const int prec
= fmt
->p
;
9527 const mp_rnd_t rnd
= fmt
->round_towards_zero
? GMP_RNDZ
: GMP_RNDN
;
9532 mpfr_init2 (m
, prec
);
9533 mpfr_from_real (m
, ra
, GMP_RNDN
);
9534 mpfr_clear_flags ();
9535 inexact
= mpfr_lgamma (m
, &sg
, m
, rnd
);
9536 result_lg
= do_mpfr_ckconv (m
, type
, inexact
);
9542 /* Dereference the arg_sg pointer argument. */
9543 arg_sg
= build_fold_indirect_ref (arg_sg
);
9544 /* Assign the signgam value into *arg_sg. */
9545 result_sg
= fold_build2 (MODIFY_EXPR
,
9546 TREE_TYPE (arg_sg
), arg_sg
,
9547 build_int_cst (TREE_TYPE (arg_sg
), sg
));
9548 TREE_SIDE_EFFECTS (result_sg
) = 1;
9549 /* Combine the signgam assignment with the lgamma result. */
9550 result
= non_lvalue (fold_build2 (COMPOUND_EXPR
, type
,
9551 result_sg
, result_lg
));
9559 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
9560 mpc function FUNC on it and return the resulting value as a tree
9561 with type TYPE. The mpfr precision is set to the precision of
9562 TYPE. We assume that function FUNC returns zero if the result
9563 could be calculated exactly within the requested precision. If
9564 DO_NONFINITE is true, then fold expressions containing Inf or NaN
9565 in the arguments and/or results. */
9568 do_mpc_arg2 (tree arg0
, tree arg1
, tree type
, int do_nonfinite
,
9569 int (*func
)(mpc_ptr
, mpc_srcptr
, mpc_srcptr
, mpc_rnd_t
))
9571 tree result
= NULL_TREE
;
9576 /* To proceed, MPFR must exactly represent the target floating point
9577 format, which only happens when the target base equals two. */
9578 if (TREE_CODE (arg0
) == COMPLEX_CST
&& !TREE_OVERFLOW (arg0
)
9579 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0
))) == REAL_TYPE
9580 && TREE_CODE (arg1
) == COMPLEX_CST
&& !TREE_OVERFLOW (arg1
)
9581 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg1
))) == REAL_TYPE
9582 && REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (TREE_TYPE (arg0
))))->b
== 2)
9584 const REAL_VALUE_TYPE
*const re0
= TREE_REAL_CST_PTR (TREE_REALPART (arg0
));
9585 const REAL_VALUE_TYPE
*const im0
= TREE_REAL_CST_PTR (TREE_IMAGPART (arg0
));
9586 const REAL_VALUE_TYPE
*const re1
= TREE_REAL_CST_PTR (TREE_REALPART (arg1
));
9587 const REAL_VALUE_TYPE
*const im1
= TREE_REAL_CST_PTR (TREE_IMAGPART (arg1
));
9590 || (real_isfinite (re0
) && real_isfinite (im0
)
9591 && real_isfinite (re1
) && real_isfinite (im1
)))
9593 const struct real_format
*const fmt
=
9594 REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (type
)));
9595 const int prec
= fmt
->p
;
9596 const mp_rnd_t rnd
= fmt
->round_towards_zero
? GMP_RNDZ
: GMP_RNDN
;
9597 const mpc_rnd_t crnd
= fmt
->round_towards_zero
? MPC_RNDZZ
: MPC_RNDNN
;
9601 mpc_init2 (m0
, prec
);
9602 mpc_init2 (m1
, prec
);
9603 mpfr_from_real (mpc_realref (m0
), re0
, rnd
);
9604 mpfr_from_real (mpc_imagref (m0
), im0
, rnd
);
9605 mpfr_from_real (mpc_realref (m1
), re1
, rnd
);
9606 mpfr_from_real (mpc_imagref (m1
), im1
, rnd
);
9607 mpfr_clear_flags ();
9608 inexact
= func (m0
, m0
, m1
, crnd
);
9609 result
= do_mpc_ckconv (m0
, type
, inexact
, do_nonfinite
);
9618 /* A wrapper function for builtin folding that prevents warnings for
9619 "statement without effect" and the like, caused by removing the
9620 call node earlier than the warning is generated. */
9623 fold_call_stmt (gcall
*stmt
, bool ignore
)
9625 tree ret
= NULL_TREE
;
9626 tree fndecl
= gimple_call_fndecl (stmt
);
9627 location_t loc
= gimple_location (stmt
);
9629 && TREE_CODE (fndecl
) == FUNCTION_DECL
9630 && DECL_BUILT_IN (fndecl
)
9631 && !gimple_call_va_arg_pack_p (stmt
))
9633 int nargs
= gimple_call_num_args (stmt
);
9634 tree
*args
= (nargs
> 0
9635 ? gimple_call_arg_ptr (stmt
, 0)
9636 : &error_mark_node
);
9638 if (avoid_folding_inline_builtin (fndecl
))
9640 if (DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_MD
)
9642 return targetm
.fold_builtin (fndecl
, nargs
, args
, ignore
);
9646 ret
= fold_builtin_n (loc
, fndecl
, args
, nargs
, ignore
);
9649 /* Propagate location information from original call to
9650 expansion of builtin. Otherwise things like
9651 maybe_emit_chk_warning, that operate on the expansion
9652 of a builtin, will use the wrong location information. */
9653 if (gimple_has_location (stmt
))
9656 if (TREE_CODE (ret
) == NOP_EXPR
)
9657 realret
= TREE_OPERAND (ret
, 0);
9658 if (CAN_HAVE_LOCATION_P (realret
)
9659 && !EXPR_HAS_LOCATION (realret
))
9660 SET_EXPR_LOCATION (realret
, loc
);
9670 /* Look up the function in builtin_decl that corresponds to DECL
9671 and set ASMSPEC as its user assembler name. DECL must be a
9672 function decl that declares a builtin. */
9675 set_builtin_user_assembler_name (tree decl
, const char *asmspec
)
9678 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
9679 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
9682 builtin
= builtin_decl_explicit (DECL_FUNCTION_CODE (decl
));
9683 set_user_assembler_name (builtin
, asmspec
);
9684 switch (DECL_FUNCTION_CODE (decl
))
9686 case BUILT_IN_MEMCPY
:
9687 init_block_move_fn (asmspec
);
9688 memcpy_libfunc
= set_user_assembler_libfunc ("memcpy", asmspec
);
9690 case BUILT_IN_MEMSET
:
9691 init_block_clear_fn (asmspec
);
9692 memset_libfunc
= set_user_assembler_libfunc ("memset", asmspec
);
9694 case BUILT_IN_MEMMOVE
:
9695 memmove_libfunc
= set_user_assembler_libfunc ("memmove", asmspec
);
9697 case BUILT_IN_MEMCMP
:
9698 memcmp_libfunc
= set_user_assembler_libfunc ("memcmp", asmspec
);
9700 case BUILT_IN_ABORT
:
9701 abort_libfunc
= set_user_assembler_libfunc ("abort", asmspec
);
9704 if (INT_TYPE_SIZE
< BITS_PER_WORD
)
9706 set_user_assembler_libfunc ("ffs", asmspec
);
9707 set_optab_libfunc (ffs_optab
, mode_for_size (INT_TYPE_SIZE
,
9708 MODE_INT
, 0), "ffs");
9716 /* Return true if DECL is a builtin that expands to a constant or similarly
9719 is_simple_builtin (tree decl
)
9721 if (decl
&& DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
)
9722 switch (DECL_FUNCTION_CODE (decl
))
9724 /* Builtins that expand to constants. */
9725 case BUILT_IN_CONSTANT_P
:
9726 case BUILT_IN_EXPECT
:
9727 case BUILT_IN_OBJECT_SIZE
:
9728 case BUILT_IN_UNREACHABLE
:
9729 /* Simple register moves or loads from stack. */
9730 case BUILT_IN_ASSUME_ALIGNED
:
9731 case BUILT_IN_RETURN_ADDRESS
:
9732 case BUILT_IN_EXTRACT_RETURN_ADDR
:
9733 case BUILT_IN_FROB_RETURN_ADDR
:
9734 case BUILT_IN_RETURN
:
9735 case BUILT_IN_AGGREGATE_INCOMING_ADDRESS
:
9736 case BUILT_IN_FRAME_ADDRESS
:
9737 case BUILT_IN_VA_END
:
9738 case BUILT_IN_STACK_SAVE
:
9739 case BUILT_IN_STACK_RESTORE
:
9740 /* Exception state returns or moves registers around. */
9741 case BUILT_IN_EH_FILTER
:
9742 case BUILT_IN_EH_POINTER
:
9743 case BUILT_IN_EH_COPY_VALUES
:
9753 /* Return true if DECL is a builtin that is not expensive, i.e., they are
9754 most probably expanded inline into reasonably simple code. This is a
9755 superset of is_simple_builtin. */
9757 is_inexpensive_builtin (tree decl
)
9761 else if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_MD
)
9763 else if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
)
9764 switch (DECL_FUNCTION_CODE (decl
))
9767 case BUILT_IN_ALLOCA
:
9768 case BUILT_IN_ALLOCA_WITH_ALIGN
:
9769 case BUILT_IN_BSWAP16
:
9770 case BUILT_IN_BSWAP32
:
9771 case BUILT_IN_BSWAP64
:
9773 case BUILT_IN_CLZIMAX
:
9775 case BUILT_IN_CLZLL
:
9777 case BUILT_IN_CTZIMAX
:
9779 case BUILT_IN_CTZLL
:
9781 case BUILT_IN_FFSIMAX
:
9783 case BUILT_IN_FFSLL
:
9784 case BUILT_IN_IMAXABS
:
9785 case BUILT_IN_FINITE
:
9786 case BUILT_IN_FINITEF
:
9787 case BUILT_IN_FINITEL
:
9788 case BUILT_IN_FINITED32
:
9789 case BUILT_IN_FINITED64
:
9790 case BUILT_IN_FINITED128
:
9791 case BUILT_IN_FPCLASSIFY
:
9792 case BUILT_IN_ISFINITE
:
9793 case BUILT_IN_ISINF_SIGN
:
9794 case BUILT_IN_ISINF
:
9795 case BUILT_IN_ISINFF
:
9796 case BUILT_IN_ISINFL
:
9797 case BUILT_IN_ISINFD32
:
9798 case BUILT_IN_ISINFD64
:
9799 case BUILT_IN_ISINFD128
:
9800 case BUILT_IN_ISNAN
:
9801 case BUILT_IN_ISNANF
:
9802 case BUILT_IN_ISNANL
:
9803 case BUILT_IN_ISNAND32
:
9804 case BUILT_IN_ISNAND64
:
9805 case BUILT_IN_ISNAND128
:
9806 case BUILT_IN_ISNORMAL
:
9807 case BUILT_IN_ISGREATER
:
9808 case BUILT_IN_ISGREATEREQUAL
:
9809 case BUILT_IN_ISLESS
:
9810 case BUILT_IN_ISLESSEQUAL
:
9811 case BUILT_IN_ISLESSGREATER
:
9812 case BUILT_IN_ISUNORDERED
:
9813 case BUILT_IN_VA_ARG_PACK
:
9814 case BUILT_IN_VA_ARG_PACK_LEN
:
9815 case BUILT_IN_VA_COPY
:
9817 case BUILT_IN_SAVEREGS
:
9818 case BUILT_IN_POPCOUNTL
:
9819 case BUILT_IN_POPCOUNTLL
:
9820 case BUILT_IN_POPCOUNTIMAX
:
9821 case BUILT_IN_POPCOUNT
:
9822 case BUILT_IN_PARITYL
:
9823 case BUILT_IN_PARITYLL
:
9824 case BUILT_IN_PARITYIMAX
:
9825 case BUILT_IN_PARITY
:
9827 case BUILT_IN_LLABS
:
9828 case BUILT_IN_PREFETCH
:
9829 case BUILT_IN_ACC_ON_DEVICE
:
9833 return is_simple_builtin (decl
);