1 /* Expand builtin functions.
2 Copyright (C) 1988-2017 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"
35 #include "stringpool.h"
37 #include "tree-ssanames.h"
42 #include "diagnostic-core.h"
44 #include "fold-const.h"
45 #include "fold-const-call.h"
46 #include "stor-layout.h"
49 #include "tree-object-size.h"
59 #include "typeclass.h"
60 #include "langhooks.h"
61 #include "value-prof.h"
65 #include "tree-chkp.h"
67 #include "internal-fn.h"
68 #include "case-cfn-macros.h"
69 #include "gimple-fold.h"
72 struct target_builtins default_target_builtins
;
74 struct target_builtins
*this_target_builtins
= &default_target_builtins
;
77 /* Define the names of the builtin function types and codes. */
78 const char *const built_in_class_names
[BUILT_IN_LAST
]
79 = {"NOT_BUILT_IN", "BUILT_IN_FRONTEND", "BUILT_IN_MD", "BUILT_IN_NORMAL"};
81 #define DEF_BUILTIN(X, N, C, T, LT, B, F, NA, AT, IM, COND) #X,
82 const char * built_in_names
[(int) END_BUILTINS
] =
84 #include "builtins.def"
87 /* Setup an array of builtin_info_type, make sure each element decl is
88 initialized to NULL_TREE. */
89 builtin_info_type builtin_info
[(int)END_BUILTINS
];
91 /* Non-zero if __builtin_constant_p should be folded right away. */
92 bool force_folding_builtin_constant_p
;
94 static rtx
c_readstr (const char *, machine_mode
);
95 static int target_char_cast (tree
, char *);
96 static rtx
get_memory_rtx (tree
, tree
);
97 static int apply_args_size (void);
98 static int apply_result_size (void);
99 static rtx
result_vector (int, rtx
);
100 static void expand_builtin_prefetch (tree
);
101 static rtx
expand_builtin_apply_args (void);
102 static rtx
expand_builtin_apply_args_1 (void);
103 static rtx
expand_builtin_apply (rtx
, rtx
, rtx
);
104 static void expand_builtin_return (rtx
);
105 static enum type_class
type_to_class (tree
);
106 static rtx
expand_builtin_classify_type (tree
);
107 static rtx
expand_builtin_mathfn_3 (tree
, rtx
, rtx
);
108 static rtx
expand_builtin_mathfn_ternary (tree
, rtx
, rtx
);
109 static rtx
expand_builtin_interclass_mathfn (tree
, rtx
);
110 static rtx
expand_builtin_sincos (tree
);
111 static rtx
expand_builtin_cexpi (tree
, rtx
);
112 static rtx
expand_builtin_int_roundingfn (tree
, rtx
);
113 static rtx
expand_builtin_int_roundingfn_2 (tree
, rtx
);
114 static rtx
expand_builtin_next_arg (void);
115 static rtx
expand_builtin_va_start (tree
);
116 static rtx
expand_builtin_va_end (tree
);
117 static rtx
expand_builtin_va_copy (tree
);
118 static rtx
expand_builtin_strcmp (tree
, rtx
);
119 static rtx
expand_builtin_strncmp (tree
, rtx
, machine_mode
);
120 static rtx
builtin_memcpy_read_str (void *, HOST_WIDE_INT
, machine_mode
);
121 static rtx
expand_builtin_memchr (tree
, rtx
);
122 static rtx
expand_builtin_memcpy (tree
, rtx
);
123 static rtx
expand_builtin_memcpy_with_bounds (tree
, rtx
);
124 static rtx
expand_builtin_memory_copy_args (tree dest
, tree src
, tree len
,
125 rtx target
, tree exp
, int endp
);
126 static rtx
expand_builtin_memmove (tree
, rtx
);
127 static rtx
expand_builtin_mempcpy (tree
, rtx
);
128 static rtx
expand_builtin_mempcpy_with_bounds (tree
, rtx
);
129 static rtx
expand_builtin_mempcpy_args (tree
, tree
, tree
, rtx
, tree
, int);
130 static rtx
expand_builtin_strcat (tree
, rtx
);
131 static rtx
expand_builtin_strcpy (tree
, rtx
);
132 static rtx
expand_builtin_strcpy_args (tree
, tree
, rtx
);
133 static rtx
expand_builtin_stpcpy (tree
, rtx
, machine_mode
);
134 static rtx
expand_builtin_stpncpy (tree
, rtx
);
135 static rtx
expand_builtin_strncat (tree
, rtx
);
136 static rtx
expand_builtin_strncpy (tree
, rtx
);
137 static rtx
builtin_memset_gen_str (void *, HOST_WIDE_INT
, machine_mode
);
138 static rtx
expand_builtin_memset (tree
, rtx
, machine_mode
);
139 static rtx
expand_builtin_memset_with_bounds (tree
, rtx
, machine_mode
);
140 static rtx
expand_builtin_memset_args (tree
, tree
, tree
, rtx
, machine_mode
, tree
);
141 static rtx
expand_builtin_bzero (tree
);
142 static rtx
expand_builtin_strlen (tree
, rtx
, machine_mode
);
143 static rtx
expand_builtin_alloca (tree
);
144 static rtx
expand_builtin_unop (machine_mode
, tree
, rtx
, rtx
, optab
);
145 static rtx
expand_builtin_frame_address (tree
, tree
);
146 static tree
stabilize_va_list_loc (location_t
, tree
, int);
147 static rtx
expand_builtin_expect (tree
, rtx
);
148 static tree
fold_builtin_constant_p (tree
);
149 static tree
fold_builtin_classify_type (tree
);
150 static tree
fold_builtin_strlen (location_t
, tree
, tree
);
151 static tree
fold_builtin_inf (location_t
, tree
, int);
152 static tree
rewrite_call_expr (location_t
, tree
, int, tree
, int, ...);
153 static bool validate_arg (const_tree
, enum tree_code code
);
154 static rtx
expand_builtin_fabs (tree
, rtx
, rtx
);
155 static rtx
expand_builtin_signbit (tree
, rtx
);
156 static tree
fold_builtin_memcmp (location_t
, tree
, tree
, tree
);
157 static tree
fold_builtin_isascii (location_t
, tree
);
158 static tree
fold_builtin_toascii (location_t
, tree
);
159 static tree
fold_builtin_isdigit (location_t
, tree
);
160 static tree
fold_builtin_fabs (location_t
, tree
, tree
);
161 static tree
fold_builtin_abs (location_t
, tree
, tree
);
162 static tree
fold_builtin_unordered_cmp (location_t
, tree
, tree
, tree
, enum tree_code
,
164 static tree
fold_builtin_0 (location_t
, tree
);
165 static tree
fold_builtin_1 (location_t
, tree
, tree
);
166 static tree
fold_builtin_2 (location_t
, tree
, tree
, tree
);
167 static tree
fold_builtin_3 (location_t
, tree
, tree
, tree
, tree
);
168 static tree
fold_builtin_varargs (location_t
, tree
, tree
*, int);
170 static tree
fold_builtin_strpbrk (location_t
, tree
, tree
, tree
);
171 static tree
fold_builtin_strspn (location_t
, tree
, tree
);
172 static tree
fold_builtin_strcspn (location_t
, tree
, tree
);
174 static rtx
expand_builtin_object_size (tree
);
175 static rtx
expand_builtin_memory_chk (tree
, rtx
, machine_mode
,
176 enum built_in_function
);
177 static void maybe_emit_chk_warning (tree
, enum built_in_function
);
178 static void maybe_emit_sprintf_chk_warning (tree
, enum built_in_function
);
179 static void maybe_emit_free_warning (tree
);
180 static tree
fold_builtin_object_size (tree
, tree
);
182 unsigned HOST_WIDE_INT target_newline
;
183 unsigned HOST_WIDE_INT target_percent
;
184 static unsigned HOST_WIDE_INT target_c
;
185 static unsigned HOST_WIDE_INT target_s
;
186 char target_percent_c
[3];
187 char target_percent_s
[3];
188 char target_percent_s_newline
[4];
189 static tree
do_mpfr_remquo (tree
, tree
, tree
);
190 static tree
do_mpfr_lgamma_r (tree
, tree
, tree
);
191 static void expand_builtin_sync_synchronize (void);
193 /* Return true if NAME starts with __builtin_ or __sync_. */
196 is_builtin_name (const char *name
)
198 if (strncmp (name
, "__builtin_", 10) == 0)
200 if (strncmp (name
, "__sync_", 7) == 0)
202 if (strncmp (name
, "__atomic_", 9) == 0)
205 && (!strcmp (name
, "__cilkrts_detach")
206 || !strcmp (name
, "__cilkrts_pop_frame")))
212 /* Return true if DECL is a function symbol representing a built-in. */
215 is_builtin_fn (tree decl
)
217 return TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_BUILT_IN (decl
);
220 /* Return true if NODE should be considered for inline expansion regardless
221 of the optimization level. This means whenever a function is invoked with
222 its "internal" name, which normally contains the prefix "__builtin". */
225 called_as_built_in (tree node
)
227 /* Note that we must use DECL_NAME, not DECL_ASSEMBLER_NAME_SET_P since
228 we want the name used to call the function, not the name it
230 const char *name
= IDENTIFIER_POINTER (DECL_NAME (node
));
231 return is_builtin_name (name
);
234 /* Compute values M and N such that M divides (address of EXP - N) and such
235 that N < M. If these numbers can be determined, store M in alignp and N in
236 *BITPOSP and return true. Otherwise return false and store BITS_PER_UNIT to
237 *alignp and any bit-offset to *bitposp.
239 Note that the address (and thus the alignment) computed here is based
240 on the address to which a symbol resolves, whereas DECL_ALIGN is based
241 on the address at which an object is actually located. These two
242 addresses are not always the same. For example, on ARM targets,
243 the address &foo of a Thumb function foo() has the lowest bit set,
244 whereas foo() itself starts on an even address.
246 If ADDR_P is true we are taking the address of the memory reference EXP
247 and thus cannot rely on the access taking place. */
250 get_object_alignment_2 (tree exp
, unsigned int *alignp
,
251 unsigned HOST_WIDE_INT
*bitposp
, bool addr_p
)
253 HOST_WIDE_INT bitsize
, bitpos
;
256 int unsignedp
, reversep
, volatilep
;
257 unsigned int align
= BITS_PER_UNIT
;
258 bool known_alignment
= false;
260 /* Get the innermost object and the constant (bitpos) and possibly
261 variable (offset) offset of the access. */
262 exp
= get_inner_reference (exp
, &bitsize
, &bitpos
, &offset
, &mode
,
263 &unsignedp
, &reversep
, &volatilep
);
265 /* Extract alignment information from the innermost object and
266 possibly adjust bitpos and offset. */
267 if (TREE_CODE (exp
) == FUNCTION_DECL
)
269 /* Function addresses can encode extra information besides their
270 alignment. However, if TARGET_PTRMEMFUNC_VBIT_LOCATION
271 allows the low bit to be used as a virtual bit, we know
272 that the address itself must be at least 2-byte aligned. */
273 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_pfn
)
274 align
= 2 * BITS_PER_UNIT
;
276 else if (TREE_CODE (exp
) == LABEL_DECL
)
278 else if (TREE_CODE (exp
) == CONST_DECL
)
280 /* The alignment of a CONST_DECL is determined by its initializer. */
281 exp
= DECL_INITIAL (exp
);
282 align
= TYPE_ALIGN (TREE_TYPE (exp
));
283 if (CONSTANT_CLASS_P (exp
))
284 align
= (unsigned) CONSTANT_ALIGNMENT (exp
, align
);
286 known_alignment
= true;
288 else if (DECL_P (exp
))
290 align
= DECL_ALIGN (exp
);
291 known_alignment
= true;
293 else if (TREE_CODE (exp
) == INDIRECT_REF
294 || TREE_CODE (exp
) == MEM_REF
295 || TREE_CODE (exp
) == TARGET_MEM_REF
)
297 tree addr
= TREE_OPERAND (exp
, 0);
299 unsigned HOST_WIDE_INT ptr_bitpos
;
300 unsigned HOST_WIDE_INT ptr_bitmask
= ~0;
302 /* If the address is explicitely aligned, handle that. */
303 if (TREE_CODE (addr
) == BIT_AND_EXPR
304 && TREE_CODE (TREE_OPERAND (addr
, 1)) == INTEGER_CST
)
306 ptr_bitmask
= TREE_INT_CST_LOW (TREE_OPERAND (addr
, 1));
307 ptr_bitmask
*= BITS_PER_UNIT
;
308 align
= least_bit_hwi (ptr_bitmask
);
309 addr
= TREE_OPERAND (addr
, 0);
313 = get_pointer_alignment_1 (addr
, &ptr_align
, &ptr_bitpos
);
314 align
= MAX (ptr_align
, align
);
316 /* Re-apply explicit alignment to the bitpos. */
317 ptr_bitpos
&= ptr_bitmask
;
319 /* The alignment of the pointer operand in a TARGET_MEM_REF
320 has to take the variable offset parts into account. */
321 if (TREE_CODE (exp
) == TARGET_MEM_REF
)
325 unsigned HOST_WIDE_INT step
= 1;
327 step
= TREE_INT_CST_LOW (TMR_STEP (exp
));
328 align
= MIN (align
, least_bit_hwi (step
) * BITS_PER_UNIT
);
330 if (TMR_INDEX2 (exp
))
331 align
= BITS_PER_UNIT
;
332 known_alignment
= false;
335 /* When EXP is an actual memory reference then we can use
336 TYPE_ALIGN of a pointer indirection to derive alignment.
337 Do so only if get_pointer_alignment_1 did not reveal absolute
338 alignment knowledge and if using that alignment would
339 improve the situation. */
341 if (!addr_p
&& !known_alignment
342 && (talign
= min_align_of_type (TREE_TYPE (exp
)) * BITS_PER_UNIT
)
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
= least_bit_hwi (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
= least_bit_hwi (bitpos
);
512 /* Return the number of non-zero elements in the sequence
513 [ PTR, PTR + MAXELTS ) where each element's size is ELTSIZE bytes.
514 ELTSIZE must be a power of 2 less than 8. Used by c_strlen. */
517 string_length (const void *ptr
, unsigned eltsize
, unsigned maxelts
)
519 gcc_checking_assert (eltsize
== 1 || eltsize
== 2 || eltsize
== 4);
525 /* Optimize the common case of plain char. */
526 for (n
= 0; n
< maxelts
; n
++)
528 const char *elt
= (const char*) ptr
+ n
;
535 for (n
= 0; n
< maxelts
; n
++)
537 const char *elt
= (const char*) ptr
+ n
* eltsize
;
538 if (!memcmp (elt
, "\0\0\0\0", eltsize
))
545 /* Compute the length of a null-terminated character string or wide
546 character string handling character sizes of 1, 2, and 4 bytes.
547 TREE_STRING_LENGTH is not the right way because it evaluates to
548 the size of the character array in bytes (as opposed to characters)
549 and because it can contain a zero byte in the middle.
551 ONLY_VALUE should be nonzero if the result is not going to be emitted
552 into the instruction stream and zero if it is going to be expanded.
553 E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3
554 is returned, otherwise NULL, since
555 len = c_strlen (src, 1); if (len) expand_expr (len, ...); would not
556 evaluate the side-effects.
558 If ONLY_VALUE is two then we do not emit warnings about out-of-bound
559 accesses. Note that this implies the result is not going to be emitted
560 into the instruction stream.
562 The value returned is of type `ssizetype'.
564 Unfortunately, string_constant can't access the values of const char
565 arrays with initializers, so neither can we do so here. */
568 c_strlen (tree src
, int only_value
)
571 if (TREE_CODE (src
) == COND_EXPR
572 && (only_value
|| !TREE_SIDE_EFFECTS (TREE_OPERAND (src
, 0))))
576 len1
= c_strlen (TREE_OPERAND (src
, 1), only_value
);
577 len2
= c_strlen (TREE_OPERAND (src
, 2), only_value
);
578 if (tree_int_cst_equal (len1
, len2
))
582 if (TREE_CODE (src
) == COMPOUND_EXPR
583 && (only_value
|| !TREE_SIDE_EFFECTS (TREE_OPERAND (src
, 0))))
584 return c_strlen (TREE_OPERAND (src
, 1), only_value
);
586 location_t loc
= EXPR_LOC_OR_LOC (src
, input_location
);
588 /* Offset from the beginning of the string in bytes. */
590 src
= string_constant (src
, &byteoff
);
594 /* Determine the size of the string element. */
596 = tree_to_uhwi (TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (src
))));
598 /* Set MAXELTS to sizeof (SRC) / sizeof (*SRC) - 1, the maximum possible
600 unsigned maxelts
= TREE_STRING_LENGTH (src
) / eltsize
- 1;
602 /* PTR can point to the byte representation of any string type, including
603 char* and wchar_t*. */
604 const char *ptr
= TREE_STRING_POINTER (src
);
606 if (byteoff
&& TREE_CODE (byteoff
) != INTEGER_CST
)
608 /* If the string has an internal zero byte (e.g., "foo\0bar"), we can't
609 compute the offset to the following null if we don't know where to
610 start searching for it. */
611 if (string_length (ptr
, eltsize
, maxelts
) < maxelts
)
613 /* Return when an embedded null character is found. */
617 /* We don't know the starting offset, but we do know that the string
618 has no internal zero bytes. We can assume that the offset falls
619 within the bounds of the string; otherwise, the programmer deserves
620 what he gets. Subtract the offset from the length of the string,
621 and return that. This would perhaps not be valid if we were dealing
622 with named arrays in addition to literal string constants. */
624 return size_diffop_loc (loc
, size_int (maxelts
* eltsize
), byteoff
);
627 /* Offset from the beginning of the string in elements. */
628 HOST_WIDE_INT eltoff
;
630 /* We have a known offset into the string. Start searching there for
631 a null character if we can represent it as a single HOST_WIDE_INT. */
634 else if (! tree_fits_shwi_p (byteoff
))
637 eltoff
= tree_to_shwi (byteoff
) / eltsize
;
639 /* If the offset is known to be out of bounds, warn, and call strlen at
641 if (eltoff
< 0 || eltoff
> maxelts
)
643 /* Suppress multiple warnings for propagated constant strings. */
645 && !TREE_NO_WARNING (src
))
647 warning_at (loc
, 0, "offset %qwi outside bounds of constant string",
649 TREE_NO_WARNING (src
) = 1;
654 /* Use strlen to search for the first zero byte. Since any strings
655 constructed with build_string will have nulls appended, we win even
656 if we get handed something like (char[4])"abcd".
658 Since ELTOFF is our starting index into the string, no further
659 calculation is needed. */
660 unsigned len
= string_length (ptr
+ eltoff
* eltsize
, eltsize
,
663 return ssize_int (len
);
666 /* Return a constant integer corresponding to target reading
667 GET_MODE_BITSIZE (MODE) bits from string constant STR. */
670 c_readstr (const char *str
, machine_mode mode
)
674 HOST_WIDE_INT tmp
[MAX_BITSIZE_MODE_ANY_INT
/ HOST_BITS_PER_WIDE_INT
];
676 gcc_assert (GET_MODE_CLASS (mode
) == MODE_INT
);
677 unsigned int len
= (GET_MODE_PRECISION (mode
) + HOST_BITS_PER_WIDE_INT
- 1)
678 / HOST_BITS_PER_WIDE_INT
;
680 gcc_assert (len
<= MAX_BITSIZE_MODE_ANY_INT
/ HOST_BITS_PER_WIDE_INT
);
681 for (i
= 0; i
< len
; i
++)
685 for (i
= 0; i
< GET_MODE_SIZE (mode
); i
++)
688 if (WORDS_BIG_ENDIAN
)
689 j
= GET_MODE_SIZE (mode
) - i
- 1;
690 if (BYTES_BIG_ENDIAN
!= WORDS_BIG_ENDIAN
691 && GET_MODE_SIZE (mode
) >= UNITS_PER_WORD
)
692 j
= j
+ UNITS_PER_WORD
- 2 * (j
% UNITS_PER_WORD
) - 1;
696 ch
= (unsigned char) str
[i
];
697 tmp
[j
/ HOST_BITS_PER_WIDE_INT
] |= ch
<< (j
% HOST_BITS_PER_WIDE_INT
);
700 wide_int c
= wide_int::from_array (tmp
, len
, GET_MODE_PRECISION (mode
));
701 return immed_wide_int_const (c
, mode
);
704 /* Cast a target constant CST to target CHAR and if that value fits into
705 host char type, return zero and put that value into variable pointed to by
709 target_char_cast (tree cst
, char *p
)
711 unsigned HOST_WIDE_INT val
, hostval
;
713 if (TREE_CODE (cst
) != INTEGER_CST
714 || CHAR_TYPE_SIZE
> HOST_BITS_PER_WIDE_INT
)
717 /* Do not care if it fits or not right here. */
718 val
= TREE_INT_CST_LOW (cst
);
720 if (CHAR_TYPE_SIZE
< HOST_BITS_PER_WIDE_INT
)
721 val
&= (HOST_WIDE_INT_1U
<< CHAR_TYPE_SIZE
) - 1;
724 if (HOST_BITS_PER_CHAR
< HOST_BITS_PER_WIDE_INT
)
725 hostval
&= (HOST_WIDE_INT_1U
<< HOST_BITS_PER_CHAR
) - 1;
734 /* Similar to save_expr, but assumes that arbitrary code is not executed
735 in between the multiple evaluations. In particular, we assume that a
736 non-addressable local variable will not be modified. */
739 builtin_save_expr (tree exp
)
741 if (TREE_CODE (exp
) == SSA_NAME
742 || (TREE_ADDRESSABLE (exp
) == 0
743 && (TREE_CODE (exp
) == PARM_DECL
744 || (VAR_P (exp
) && !TREE_STATIC (exp
)))))
747 return save_expr (exp
);
750 /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT
751 times to get the address of either a higher stack frame, or a return
752 address located within it (depending on FNDECL_CODE). */
755 expand_builtin_return_addr (enum built_in_function fndecl_code
, int count
)
758 rtx tem
= INITIAL_FRAME_ADDRESS_RTX
;
761 /* For a zero count with __builtin_return_address, we don't care what
762 frame address we return, because target-specific definitions will
763 override us. Therefore frame pointer elimination is OK, and using
764 the soft frame pointer is OK.
766 For a nonzero count, or a zero count with __builtin_frame_address,
767 we require a stable offset from the current frame pointer to the
768 previous one, so we must use the hard frame pointer, and
769 we must disable frame pointer elimination. */
770 if (count
== 0 && fndecl_code
== BUILT_IN_RETURN_ADDRESS
)
771 tem
= frame_pointer_rtx
;
774 tem
= hard_frame_pointer_rtx
;
776 /* Tell reload not to eliminate the frame pointer. */
777 crtl
->accesses_prior_frames
= 1;
782 SETUP_FRAME_ADDRESSES ();
784 /* On the SPARC, the return address is not in the frame, it is in a
785 register. There is no way to access it off of the current frame
786 pointer, but it can be accessed off the previous frame pointer by
787 reading the value from the register window save area. */
788 if (RETURN_ADDR_IN_PREVIOUS_FRAME
&& fndecl_code
== BUILT_IN_RETURN_ADDRESS
)
791 /* Scan back COUNT frames to the specified frame. */
792 for (i
= 0; i
< count
; i
++)
794 /* Assume the dynamic chain pointer is in the word that the
795 frame address points to, unless otherwise specified. */
796 tem
= DYNAMIC_CHAIN_ADDRESS (tem
);
797 tem
= memory_address (Pmode
, tem
);
798 tem
= gen_frame_mem (Pmode
, tem
);
799 tem
= copy_to_reg (tem
);
802 /* For __builtin_frame_address, return what we've got. But, on
803 the SPARC for example, we may have to add a bias. */
804 if (fndecl_code
== BUILT_IN_FRAME_ADDRESS
)
805 return FRAME_ADDR_RTX (tem
);
807 /* For __builtin_return_address, get the return address from that frame. */
808 #ifdef RETURN_ADDR_RTX
809 tem
= RETURN_ADDR_RTX (count
, tem
);
811 tem
= memory_address (Pmode
,
812 plus_constant (Pmode
, tem
, GET_MODE_SIZE (Pmode
)));
813 tem
= gen_frame_mem (Pmode
, tem
);
818 /* Alias set used for setjmp buffer. */
819 static alias_set_type setjmp_alias_set
= -1;
821 /* Construct the leading half of a __builtin_setjmp call. Control will
822 return to RECEIVER_LABEL. This is also called directly by the SJLJ
823 exception handling code. */
826 expand_builtin_setjmp_setup (rtx buf_addr
, rtx receiver_label
)
828 machine_mode sa_mode
= STACK_SAVEAREA_MODE (SAVE_NONLOCAL
);
832 if (setjmp_alias_set
== -1)
833 setjmp_alias_set
= new_alias_set ();
835 buf_addr
= convert_memory_address (Pmode
, buf_addr
);
837 buf_addr
= force_reg (Pmode
, force_operand (buf_addr
, NULL_RTX
));
839 /* We store the frame pointer and the address of receiver_label in
840 the buffer and use the rest of it for the stack save area, which
841 is machine-dependent. */
843 mem
= gen_rtx_MEM (Pmode
, buf_addr
);
844 set_mem_alias_set (mem
, setjmp_alias_set
);
845 emit_move_insn (mem
, targetm
.builtin_setjmp_frame_value ());
847 mem
= gen_rtx_MEM (Pmode
, plus_constant (Pmode
, buf_addr
,
848 GET_MODE_SIZE (Pmode
))),
849 set_mem_alias_set (mem
, setjmp_alias_set
);
851 emit_move_insn (validize_mem (mem
),
852 force_reg (Pmode
, gen_rtx_LABEL_REF (Pmode
, receiver_label
)));
854 stack_save
= gen_rtx_MEM (sa_mode
,
855 plus_constant (Pmode
, buf_addr
,
856 2 * GET_MODE_SIZE (Pmode
)));
857 set_mem_alias_set (stack_save
, setjmp_alias_set
);
858 emit_stack_save (SAVE_NONLOCAL
, &stack_save
);
860 /* If there is further processing to do, do it. */
861 if (targetm
.have_builtin_setjmp_setup ())
862 emit_insn (targetm
.gen_builtin_setjmp_setup (buf_addr
));
864 /* We have a nonlocal label. */
865 cfun
->has_nonlocal_label
= 1;
868 /* Construct the trailing part of a __builtin_setjmp call. This is
869 also called directly by the SJLJ exception handling code.
870 If RECEIVER_LABEL is NULL, instead contruct a nonlocal goto handler. */
873 expand_builtin_setjmp_receiver (rtx receiver_label
)
877 /* Mark the FP as used when we get here, so we have to make sure it's
878 marked as used by this function. */
879 emit_use (hard_frame_pointer_rtx
);
881 /* Mark the static chain as clobbered here so life information
882 doesn't get messed up for it. */
883 chain
= targetm
.calls
.static_chain (current_function_decl
, true);
884 if (chain
&& REG_P (chain
))
885 emit_clobber (chain
);
887 /* Now put in the code to restore the frame pointer, and argument
888 pointer, if needed. */
889 if (! targetm
.have_nonlocal_goto ())
891 /* First adjust our frame pointer to its actual value. It was
892 previously set to the start of the virtual area corresponding to
893 the stacked variables when we branched here and now needs to be
894 adjusted to the actual hardware fp value.
896 Assignments to virtual registers are converted by
897 instantiate_virtual_regs into the corresponding assignment
898 to the underlying register (fp in this case) that makes
899 the original assignment true.
900 So the following insn will actually be decrementing fp by
901 STARTING_FRAME_OFFSET. */
902 emit_move_insn (virtual_stack_vars_rtx
, hard_frame_pointer_rtx
);
904 /* Restoring the frame pointer also modifies the hard frame pointer.
905 Mark it used (so that the previous assignment remains live once
906 the frame pointer is eliminated) and clobbered (to represent the
907 implicit update from the assignment). */
908 emit_use (hard_frame_pointer_rtx
);
909 emit_clobber (hard_frame_pointer_rtx
);
912 if (!HARD_FRAME_POINTER_IS_ARG_POINTER
&& fixed_regs
[ARG_POINTER_REGNUM
])
914 /* If the argument pointer can be eliminated in favor of the
915 frame pointer, we don't need to restore it. We assume here
916 that if such an elimination is present, it can always be used.
917 This is the case on all known machines; if we don't make this
918 assumption, we do unnecessary saving on many machines. */
920 static const struct elims
{const int from
, to
;} elim_regs
[] = ELIMINABLE_REGS
;
922 for (i
= 0; i
< ARRAY_SIZE (elim_regs
); i
++)
923 if (elim_regs
[i
].from
== ARG_POINTER_REGNUM
924 && elim_regs
[i
].to
== HARD_FRAME_POINTER_REGNUM
)
927 if (i
== ARRAY_SIZE (elim_regs
))
929 /* Now restore our arg pointer from the address at which it
930 was saved in our stack frame. */
931 emit_move_insn (crtl
->args
.internal_arg_pointer
,
932 copy_to_reg (get_arg_pointer_save_area ()));
936 if (receiver_label
!= NULL
&& targetm
.have_builtin_setjmp_receiver ())
937 emit_insn (targetm
.gen_builtin_setjmp_receiver (receiver_label
));
938 else if (targetm
.have_nonlocal_goto_receiver ())
939 emit_insn (targetm
.gen_nonlocal_goto_receiver ());
943 /* We must not allow the code we just generated to be reordered by
944 scheduling. Specifically, the update of the frame pointer must
945 happen immediately, not later. */
946 emit_insn (gen_blockage ());
949 /* __builtin_longjmp is passed a pointer to an array of five words (not
950 all will be used on all machines). It operates similarly to the C
951 library function of the same name, but is more efficient. Much of
952 the code below is copied from the handling of non-local gotos. */
955 expand_builtin_longjmp (rtx buf_addr
, rtx value
)
958 rtx_insn
*insn
, *last
;
959 machine_mode sa_mode
= STACK_SAVEAREA_MODE (SAVE_NONLOCAL
);
961 /* DRAP is needed for stack realign if longjmp is expanded to current
963 if (SUPPORTS_STACK_ALIGNMENT
)
964 crtl
->need_drap
= true;
966 if (setjmp_alias_set
== -1)
967 setjmp_alias_set
= new_alias_set ();
969 buf_addr
= convert_memory_address (Pmode
, buf_addr
);
971 buf_addr
= force_reg (Pmode
, buf_addr
);
973 /* We require that the user must pass a second argument of 1, because
974 that is what builtin_setjmp will return. */
975 gcc_assert (value
== const1_rtx
);
977 last
= get_last_insn ();
978 if (targetm
.have_builtin_longjmp ())
979 emit_insn (targetm
.gen_builtin_longjmp (buf_addr
));
982 fp
= gen_rtx_MEM (Pmode
, buf_addr
);
983 lab
= gen_rtx_MEM (Pmode
, plus_constant (Pmode
, buf_addr
,
984 GET_MODE_SIZE (Pmode
)));
986 stack
= gen_rtx_MEM (sa_mode
, plus_constant (Pmode
, buf_addr
,
987 2 * GET_MODE_SIZE (Pmode
)));
988 set_mem_alias_set (fp
, setjmp_alias_set
);
989 set_mem_alias_set (lab
, setjmp_alias_set
);
990 set_mem_alias_set (stack
, setjmp_alias_set
);
992 /* Pick up FP, label, and SP from the block and jump. This code is
993 from expand_goto in stmt.c; see there for detailed comments. */
994 if (targetm
.have_nonlocal_goto ())
995 /* We have to pass a value to the nonlocal_goto pattern that will
996 get copied into the static_chain pointer, but it does not matter
997 what that value is, because builtin_setjmp does not use it. */
998 emit_insn (targetm
.gen_nonlocal_goto (value
, lab
, stack
, fp
));
1001 lab
= copy_to_reg (lab
);
1003 emit_clobber (gen_rtx_MEM (BLKmode
, gen_rtx_SCRATCH (VOIDmode
)));
1004 emit_clobber (gen_rtx_MEM (BLKmode
, hard_frame_pointer_rtx
));
1006 emit_move_insn (hard_frame_pointer_rtx
, fp
);
1007 emit_stack_restore (SAVE_NONLOCAL
, stack
);
1009 emit_use (hard_frame_pointer_rtx
);
1010 emit_use (stack_pointer_rtx
);
1011 emit_indirect_jump (lab
);
1015 /* Search backwards and mark the jump insn as a non-local goto.
1016 Note that this precludes the use of __builtin_longjmp to a
1017 __builtin_setjmp target in the same function. However, we've
1018 already cautioned the user that these functions are for
1019 internal exception handling use only. */
1020 for (insn
= get_last_insn (); insn
; insn
= PREV_INSN (insn
))
1022 gcc_assert (insn
!= last
);
1026 add_reg_note (insn
, REG_NON_LOCAL_GOTO
, const0_rtx
);
1029 else if (CALL_P (insn
))
1035 more_const_call_expr_args_p (const const_call_expr_arg_iterator
*iter
)
1037 return (iter
->i
< iter
->n
);
1040 /* This function validates the types of a function call argument list
1041 against a specified list of tree_codes. If the last specifier is a 0,
1042 that represents an ellipsis, otherwise the last specifier must be a
1046 validate_arglist (const_tree callexpr
, ...)
1048 enum tree_code code
;
1051 const_call_expr_arg_iterator iter
;
1054 va_start (ap
, callexpr
);
1055 init_const_call_expr_arg_iterator (callexpr
, &iter
);
1057 /* Get a bitmap of pointer argument numbers declared attribute nonnull. */
1058 tree fn
= CALL_EXPR_FN (callexpr
);
1059 bitmap argmap
= get_nonnull_args (TREE_TYPE (TREE_TYPE (fn
)));
1061 for (unsigned argno
= 1; ; ++argno
)
1063 code
= (enum tree_code
) va_arg (ap
, int);
1068 /* This signifies an ellipses, any further arguments are all ok. */
1072 /* This signifies an endlink, if no arguments remain, return
1073 true, otherwise return false. */
1074 res
= !more_const_call_expr_args_p (&iter
);
1077 /* The actual argument must be nonnull when either the whole
1078 called function has been declared nonnull, or when the formal
1079 argument corresponding to the actual argument has been. */
1081 && (bitmap_empty_p (argmap
) || bitmap_bit_p (argmap
, argno
)))
1083 arg
= next_const_call_expr_arg (&iter
);
1084 if (!validate_arg (arg
, code
) || integer_zerop (arg
))
1090 /* If no parameters remain or the parameter's code does not
1091 match the specified code, return false. Otherwise continue
1092 checking any remaining arguments. */
1093 arg
= next_const_call_expr_arg (&iter
);
1094 if (!validate_arg (arg
, code
))
1100 /* We need gotos here since we can only have one VA_CLOSE in a
1105 BITMAP_FREE (argmap
);
1110 /* Expand a call to __builtin_nonlocal_goto. We're passed the target label
1111 and the address of the save area. */
1114 expand_builtin_nonlocal_goto (tree exp
)
1116 tree t_label
, t_save_area
;
1117 rtx r_label
, r_save_area
, r_fp
, r_sp
;
1120 if (!validate_arglist (exp
, POINTER_TYPE
, POINTER_TYPE
, VOID_TYPE
))
1123 t_label
= CALL_EXPR_ARG (exp
, 0);
1124 t_save_area
= CALL_EXPR_ARG (exp
, 1);
1126 r_label
= expand_normal (t_label
);
1127 r_label
= convert_memory_address (Pmode
, r_label
);
1128 r_save_area
= expand_normal (t_save_area
);
1129 r_save_area
= convert_memory_address (Pmode
, r_save_area
);
1130 /* Copy the address of the save location to a register just in case it was
1131 based on the frame pointer. */
1132 r_save_area
= copy_to_reg (r_save_area
);
1133 r_fp
= gen_rtx_MEM (Pmode
, r_save_area
);
1134 r_sp
= gen_rtx_MEM (STACK_SAVEAREA_MODE (SAVE_NONLOCAL
),
1135 plus_constant (Pmode
, r_save_area
,
1136 GET_MODE_SIZE (Pmode
)));
1138 crtl
->has_nonlocal_goto
= 1;
1140 /* ??? We no longer need to pass the static chain value, afaik. */
1141 if (targetm
.have_nonlocal_goto ())
1142 emit_insn (targetm
.gen_nonlocal_goto (const0_rtx
, r_label
, r_sp
, r_fp
));
1145 r_label
= copy_to_reg (r_label
);
1147 emit_clobber (gen_rtx_MEM (BLKmode
, gen_rtx_SCRATCH (VOIDmode
)));
1148 emit_clobber (gen_rtx_MEM (BLKmode
, hard_frame_pointer_rtx
));
1150 /* Restore frame pointer for containing function. */
1151 emit_move_insn (hard_frame_pointer_rtx
, r_fp
);
1152 emit_stack_restore (SAVE_NONLOCAL
, r_sp
);
1154 /* USE of hard_frame_pointer_rtx added for consistency;
1155 not clear if really needed. */
1156 emit_use (hard_frame_pointer_rtx
);
1157 emit_use (stack_pointer_rtx
);
1159 /* If the architecture is using a GP register, we must
1160 conservatively assume that the target function makes use of it.
1161 The prologue of functions with nonlocal gotos must therefore
1162 initialize the GP register to the appropriate value, and we
1163 must then make sure that this value is live at the point
1164 of the jump. (Note that this doesn't necessarily apply
1165 to targets with a nonlocal_goto pattern; they are free
1166 to implement it in their own way. Note also that this is
1167 a no-op if the GP register is a global invariant.) */
1168 unsigned regnum
= PIC_OFFSET_TABLE_REGNUM
;
1169 if (regnum
!= INVALID_REGNUM
&& fixed_regs
[regnum
])
1170 emit_use (pic_offset_table_rtx
);
1172 emit_indirect_jump (r_label
);
1175 /* Search backwards to the jump insn and mark it as a
1177 for (insn
= get_last_insn (); insn
; insn
= PREV_INSN (insn
))
1181 add_reg_note (insn
, REG_NON_LOCAL_GOTO
, const0_rtx
);
1184 else if (CALL_P (insn
))
1191 /* __builtin_update_setjmp_buf is passed a pointer to an array of five words
1192 (not all will be used on all machines) that was passed to __builtin_setjmp.
1193 It updates the stack pointer in that block to the current value. This is
1194 also called directly by the SJLJ exception handling code. */
1197 expand_builtin_update_setjmp_buf (rtx buf_addr
)
1199 machine_mode sa_mode
= STACK_SAVEAREA_MODE (SAVE_NONLOCAL
);
1201 = gen_rtx_MEM (sa_mode
,
1204 plus_constant (Pmode
, buf_addr
,
1205 2 * GET_MODE_SIZE (Pmode
))));
1207 emit_stack_save (SAVE_NONLOCAL
, &stack_save
);
1210 /* Expand a call to __builtin_prefetch. For a target that does not support
1211 data prefetch, evaluate the memory address argument in case it has side
1215 expand_builtin_prefetch (tree exp
)
1217 tree arg0
, arg1
, arg2
;
1221 if (!validate_arglist (exp
, POINTER_TYPE
, 0))
1224 arg0
= CALL_EXPR_ARG (exp
, 0);
1226 /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
1227 zero (read) and argument 2 (locality) defaults to 3 (high degree of
1229 nargs
= call_expr_nargs (exp
);
1231 arg1
= CALL_EXPR_ARG (exp
, 1);
1233 arg1
= integer_zero_node
;
1235 arg2
= CALL_EXPR_ARG (exp
, 2);
1237 arg2
= integer_three_node
;
1239 /* Argument 0 is an address. */
1240 op0
= expand_expr (arg0
, NULL_RTX
, Pmode
, EXPAND_NORMAL
);
1242 /* Argument 1 (read/write flag) must be a compile-time constant int. */
1243 if (TREE_CODE (arg1
) != INTEGER_CST
)
1245 error ("second argument to %<__builtin_prefetch%> must be a constant");
1246 arg1
= integer_zero_node
;
1248 op1
= expand_normal (arg1
);
1249 /* Argument 1 must be either zero or one. */
1250 if (INTVAL (op1
) != 0 && INTVAL (op1
) != 1)
1252 warning (0, "invalid second argument to %<__builtin_prefetch%>;"
1257 /* Argument 2 (locality) must be a compile-time constant int. */
1258 if (TREE_CODE (arg2
) != INTEGER_CST
)
1260 error ("third argument to %<__builtin_prefetch%> must be a constant");
1261 arg2
= integer_zero_node
;
1263 op2
= expand_normal (arg2
);
1264 /* Argument 2 must be 0, 1, 2, or 3. */
1265 if (INTVAL (op2
) < 0 || INTVAL (op2
) > 3)
1267 warning (0, "invalid third argument to %<__builtin_prefetch%>; using zero");
1271 if (targetm
.have_prefetch ())
1273 struct expand_operand ops
[3];
1275 create_address_operand (&ops
[0], op0
);
1276 create_integer_operand (&ops
[1], INTVAL (op1
));
1277 create_integer_operand (&ops
[2], INTVAL (op2
));
1278 if (maybe_expand_insn (targetm
.code_for_prefetch
, 3, ops
))
1282 /* Don't do anything with direct references to volatile memory, but
1283 generate code to handle other side effects. */
1284 if (!MEM_P (op0
) && side_effects_p (op0
))
1288 /* Get a MEM rtx for expression EXP which is the address of an operand
1289 to be used in a string instruction (cmpstrsi, movmemsi, ..). LEN is
1290 the maximum length of the block of memory that might be accessed or
1294 get_memory_rtx (tree exp
, tree len
)
1296 tree orig_exp
= exp
;
1299 /* When EXP is not resolved SAVE_EXPR, MEM_ATTRS can be still derived
1300 from its expression, for expr->a.b only <variable>.a.b is recorded. */
1301 if (TREE_CODE (exp
) == SAVE_EXPR
&& !SAVE_EXPR_RESOLVED_P (exp
))
1302 exp
= TREE_OPERAND (exp
, 0);
1304 addr
= expand_expr (orig_exp
, NULL_RTX
, ptr_mode
, EXPAND_NORMAL
);
1305 mem
= gen_rtx_MEM (BLKmode
, memory_address (BLKmode
, addr
));
1307 /* Get an expression we can use to find the attributes to assign to MEM.
1308 First remove any nops. */
1309 while (CONVERT_EXPR_P (exp
)
1310 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (exp
, 0))))
1311 exp
= TREE_OPERAND (exp
, 0);
1313 /* Build a MEM_REF representing the whole accessed area as a byte blob,
1314 (as builtin stringops may alias with anything). */
1315 exp
= fold_build2 (MEM_REF
,
1316 build_array_type (char_type_node
,
1317 build_range_type (sizetype
,
1318 size_one_node
, len
)),
1319 exp
, build_int_cst (ptr_type_node
, 0));
1321 /* If the MEM_REF has no acceptable address, try to get the base object
1322 from the original address we got, and build an all-aliasing
1323 unknown-sized access to that one. */
1324 if (is_gimple_mem_ref_addr (TREE_OPERAND (exp
, 0)))
1325 set_mem_attributes (mem
, exp
, 0);
1326 else if (TREE_CODE (TREE_OPERAND (exp
, 0)) == ADDR_EXPR
1327 && (exp
= get_base_address (TREE_OPERAND (TREE_OPERAND (exp
, 0),
1330 exp
= build_fold_addr_expr (exp
);
1331 exp
= fold_build2 (MEM_REF
,
1332 build_array_type (char_type_node
,
1333 build_range_type (sizetype
,
1336 exp
, build_int_cst (ptr_type_node
, 0));
1337 set_mem_attributes (mem
, exp
, 0);
1339 set_mem_alias_set (mem
, 0);
1343 /* Built-in functions to perform an untyped call and return. */
1345 #define apply_args_mode \
1346 (this_target_builtins->x_apply_args_mode)
1347 #define apply_result_mode \
1348 (this_target_builtins->x_apply_result_mode)
1350 /* Return the size required for the block returned by __builtin_apply_args,
1351 and initialize apply_args_mode. */
1354 apply_args_size (void)
1356 static int size
= -1;
1361 /* The values computed by this function never change. */
1364 /* The first value is the incoming arg-pointer. */
1365 size
= GET_MODE_SIZE (Pmode
);
1367 /* The second value is the structure value address unless this is
1368 passed as an "invisible" first argument. */
1369 if (targetm
.calls
.struct_value_rtx (cfun
? TREE_TYPE (cfun
->decl
) : 0, 0))
1370 size
+= GET_MODE_SIZE (Pmode
);
1372 for (regno
= 0; regno
< FIRST_PSEUDO_REGISTER
; regno
++)
1373 if (FUNCTION_ARG_REGNO_P (regno
))
1375 mode
= targetm
.calls
.get_raw_arg_mode (regno
);
1377 gcc_assert (mode
!= VOIDmode
);
1379 align
= GET_MODE_ALIGNMENT (mode
) / BITS_PER_UNIT
;
1380 if (size
% align
!= 0)
1381 size
= CEIL (size
, align
) * align
;
1382 size
+= GET_MODE_SIZE (mode
);
1383 apply_args_mode
[regno
] = mode
;
1387 apply_args_mode
[regno
] = VOIDmode
;
1393 /* Return the size required for the block returned by __builtin_apply,
1394 and initialize apply_result_mode. */
1397 apply_result_size (void)
1399 static int size
= -1;
1403 /* The values computed by this function never change. */
1408 for (regno
= 0; regno
< FIRST_PSEUDO_REGISTER
; regno
++)
1409 if (targetm
.calls
.function_value_regno_p (regno
))
1411 mode
= targetm
.calls
.get_raw_result_mode (regno
);
1413 gcc_assert (mode
!= VOIDmode
);
1415 align
= GET_MODE_ALIGNMENT (mode
) / BITS_PER_UNIT
;
1416 if (size
% align
!= 0)
1417 size
= CEIL (size
, align
) * align
;
1418 size
+= GET_MODE_SIZE (mode
);
1419 apply_result_mode
[regno
] = mode
;
1422 apply_result_mode
[regno
] = VOIDmode
;
1424 /* Allow targets that use untyped_call and untyped_return to override
1425 the size so that machine-specific information can be stored here. */
1426 #ifdef APPLY_RESULT_SIZE
1427 size
= APPLY_RESULT_SIZE
;
1433 /* Create a vector describing the result block RESULT. If SAVEP is true,
1434 the result block is used to save the values; otherwise it is used to
1435 restore the values. */
1438 result_vector (int savep
, rtx result
)
1440 int regno
, size
, align
, nelts
;
1443 rtx
*savevec
= XALLOCAVEC (rtx
, FIRST_PSEUDO_REGISTER
);
1446 for (regno
= 0; regno
< FIRST_PSEUDO_REGISTER
; regno
++)
1447 if ((mode
= apply_result_mode
[regno
]) != VOIDmode
)
1449 align
= GET_MODE_ALIGNMENT (mode
) / BITS_PER_UNIT
;
1450 if (size
% align
!= 0)
1451 size
= CEIL (size
, align
) * align
;
1452 reg
= gen_rtx_REG (mode
, savep
? regno
: INCOMING_REGNO (regno
));
1453 mem
= adjust_address (result
, mode
, size
);
1454 savevec
[nelts
++] = (savep
1455 ? gen_rtx_SET (mem
, reg
)
1456 : gen_rtx_SET (reg
, mem
));
1457 size
+= GET_MODE_SIZE (mode
);
1459 return gen_rtx_PARALLEL (VOIDmode
, gen_rtvec_v (nelts
, savevec
));
1462 /* Save the state required to perform an untyped call with the same
1463 arguments as were passed to the current function. */
1466 expand_builtin_apply_args_1 (void)
1469 int size
, align
, regno
;
1471 rtx struct_incoming_value
= targetm
.calls
.struct_value_rtx (cfun
? TREE_TYPE (cfun
->decl
) : 0, 1);
1473 /* Create a block where the arg-pointer, structure value address,
1474 and argument registers can be saved. */
1475 registers
= assign_stack_local (BLKmode
, apply_args_size (), -1);
1477 /* Walk past the arg-pointer and structure value address. */
1478 size
= GET_MODE_SIZE (Pmode
);
1479 if (targetm
.calls
.struct_value_rtx (cfun
? TREE_TYPE (cfun
->decl
) : 0, 0))
1480 size
+= GET_MODE_SIZE (Pmode
);
1482 /* Save each register used in calling a function to the block. */
1483 for (regno
= 0; regno
< FIRST_PSEUDO_REGISTER
; regno
++)
1484 if ((mode
= apply_args_mode
[regno
]) != VOIDmode
)
1486 align
= GET_MODE_ALIGNMENT (mode
) / BITS_PER_UNIT
;
1487 if (size
% align
!= 0)
1488 size
= CEIL (size
, align
) * align
;
1490 tem
= gen_rtx_REG (mode
, INCOMING_REGNO (regno
));
1492 emit_move_insn (adjust_address (registers
, mode
, size
), tem
);
1493 size
+= GET_MODE_SIZE (mode
);
1496 /* Save the arg pointer to the block. */
1497 tem
= copy_to_reg (crtl
->args
.internal_arg_pointer
);
1498 /* We need the pointer as the caller actually passed them to us, not
1499 as we might have pretended they were passed. Make sure it's a valid
1500 operand, as emit_move_insn isn't expected to handle a PLUS. */
1501 if (STACK_GROWS_DOWNWARD
)
1503 = force_operand (plus_constant (Pmode
, tem
,
1504 crtl
->args
.pretend_args_size
),
1506 emit_move_insn (adjust_address (registers
, Pmode
, 0), tem
);
1508 size
= GET_MODE_SIZE (Pmode
);
1510 /* Save the structure value address unless this is passed as an
1511 "invisible" first argument. */
1512 if (struct_incoming_value
)
1514 emit_move_insn (adjust_address (registers
, Pmode
, size
),
1515 copy_to_reg (struct_incoming_value
));
1516 size
+= GET_MODE_SIZE (Pmode
);
1519 /* Return the address of the block. */
1520 return copy_addr_to_reg (XEXP (registers
, 0));
1523 /* __builtin_apply_args returns block of memory allocated on
1524 the stack into which is stored the arg pointer, structure
1525 value address, static chain, and all the registers that might
1526 possibly be used in performing a function call. The code is
1527 moved to the start of the function so the incoming values are
1531 expand_builtin_apply_args (void)
1533 /* Don't do __builtin_apply_args more than once in a function.
1534 Save the result of the first call and reuse it. */
1535 if (apply_args_value
!= 0)
1536 return apply_args_value
;
1538 /* When this function is called, it means that registers must be
1539 saved on entry to this function. So we migrate the
1540 call to the first insn of this function. */
1544 temp
= expand_builtin_apply_args_1 ();
1545 rtx_insn
*seq
= get_insns ();
1548 apply_args_value
= temp
;
1550 /* Put the insns after the NOTE that starts the function.
1551 If this is inside a start_sequence, make the outer-level insn
1552 chain current, so the code is placed at the start of the
1553 function. If internal_arg_pointer is a non-virtual pseudo,
1554 it needs to be placed after the function that initializes
1556 push_topmost_sequence ();
1557 if (REG_P (crtl
->args
.internal_arg_pointer
)
1558 && REGNO (crtl
->args
.internal_arg_pointer
) > LAST_VIRTUAL_REGISTER
)
1559 emit_insn_before (seq
, parm_birth_insn
);
1561 emit_insn_before (seq
, NEXT_INSN (entry_of_function ()));
1562 pop_topmost_sequence ();
1567 /* Perform an untyped call and save the state required to perform an
1568 untyped return of whatever value was returned by the given function. */
1571 expand_builtin_apply (rtx function
, rtx arguments
, rtx argsize
)
1573 int size
, align
, regno
;
1575 rtx incoming_args
, result
, reg
, dest
, src
;
1576 rtx_call_insn
*call_insn
;
1577 rtx old_stack_level
= 0;
1578 rtx call_fusage
= 0;
1579 rtx struct_value
= targetm
.calls
.struct_value_rtx (cfun
? TREE_TYPE (cfun
->decl
) : 0, 0);
1581 arguments
= convert_memory_address (Pmode
, arguments
);
1583 /* Create a block where the return registers can be saved. */
1584 result
= assign_stack_local (BLKmode
, apply_result_size (), -1);
1586 /* Fetch the arg pointer from the ARGUMENTS block. */
1587 incoming_args
= gen_reg_rtx (Pmode
);
1588 emit_move_insn (incoming_args
, gen_rtx_MEM (Pmode
, arguments
));
1589 if (!STACK_GROWS_DOWNWARD
)
1590 incoming_args
= expand_simple_binop (Pmode
, MINUS
, incoming_args
, argsize
,
1591 incoming_args
, 0, OPTAB_LIB_WIDEN
);
1593 /* Push a new argument block and copy the arguments. Do not allow
1594 the (potential) memcpy call below to interfere with our stack
1596 do_pending_stack_adjust ();
1599 /* Save the stack with nonlocal if available. */
1600 if (targetm
.have_save_stack_nonlocal ())
1601 emit_stack_save (SAVE_NONLOCAL
, &old_stack_level
);
1603 emit_stack_save (SAVE_BLOCK
, &old_stack_level
);
1605 /* Allocate a block of memory onto the stack and copy the memory
1606 arguments to the outgoing arguments address. We can pass TRUE
1607 as the 4th argument because we just saved the stack pointer
1608 and will restore it right after the call. */
1609 allocate_dynamic_stack_space (argsize
, 0, BIGGEST_ALIGNMENT
, true);
1611 /* Set DRAP flag to true, even though allocate_dynamic_stack_space
1612 may have already set current_function_calls_alloca to true.
1613 current_function_calls_alloca won't be set if argsize is zero,
1614 so we have to guarantee need_drap is true here. */
1615 if (SUPPORTS_STACK_ALIGNMENT
)
1616 crtl
->need_drap
= true;
1618 dest
= virtual_outgoing_args_rtx
;
1619 if (!STACK_GROWS_DOWNWARD
)
1621 if (CONST_INT_P (argsize
))
1622 dest
= plus_constant (Pmode
, dest
, -INTVAL (argsize
));
1624 dest
= gen_rtx_PLUS (Pmode
, dest
, negate_rtx (Pmode
, argsize
));
1626 dest
= gen_rtx_MEM (BLKmode
, dest
);
1627 set_mem_align (dest
, PARM_BOUNDARY
);
1628 src
= gen_rtx_MEM (BLKmode
, incoming_args
);
1629 set_mem_align (src
, PARM_BOUNDARY
);
1630 emit_block_move (dest
, src
, argsize
, BLOCK_OP_NORMAL
);
1632 /* Refer to the argument block. */
1634 arguments
= gen_rtx_MEM (BLKmode
, arguments
);
1635 set_mem_align (arguments
, PARM_BOUNDARY
);
1637 /* Walk past the arg-pointer and structure value address. */
1638 size
= GET_MODE_SIZE (Pmode
);
1640 size
+= GET_MODE_SIZE (Pmode
);
1642 /* Restore each of the registers previously saved. Make USE insns
1643 for each of these registers for use in making the call. */
1644 for (regno
= 0; regno
< FIRST_PSEUDO_REGISTER
; regno
++)
1645 if ((mode
= apply_args_mode
[regno
]) != VOIDmode
)
1647 align
= GET_MODE_ALIGNMENT (mode
) / BITS_PER_UNIT
;
1648 if (size
% align
!= 0)
1649 size
= CEIL (size
, align
) * align
;
1650 reg
= gen_rtx_REG (mode
, regno
);
1651 emit_move_insn (reg
, adjust_address (arguments
, mode
, size
));
1652 use_reg (&call_fusage
, reg
);
1653 size
+= GET_MODE_SIZE (mode
);
1656 /* Restore the structure value address unless this is passed as an
1657 "invisible" first argument. */
1658 size
= GET_MODE_SIZE (Pmode
);
1661 rtx value
= gen_reg_rtx (Pmode
);
1662 emit_move_insn (value
, adjust_address (arguments
, Pmode
, size
));
1663 emit_move_insn (struct_value
, value
);
1664 if (REG_P (struct_value
))
1665 use_reg (&call_fusage
, struct_value
);
1666 size
+= GET_MODE_SIZE (Pmode
);
1669 /* All arguments and registers used for the call are set up by now! */
1670 function
= prepare_call_address (NULL
, function
, NULL
, &call_fusage
, 0, 0);
1672 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1673 and we don't want to load it into a register as an optimization,
1674 because prepare_call_address already did it if it should be done. */
1675 if (GET_CODE (function
) != SYMBOL_REF
)
1676 function
= memory_address (FUNCTION_MODE
, function
);
1678 /* Generate the actual call instruction and save the return value. */
1679 if (targetm
.have_untyped_call ())
1681 rtx mem
= gen_rtx_MEM (FUNCTION_MODE
, function
);
1682 emit_call_insn (targetm
.gen_untyped_call (mem
, result
,
1683 result_vector (1, result
)));
1685 else if (targetm
.have_call_value ())
1689 /* Locate the unique return register. It is not possible to
1690 express a call that sets more than one return register using
1691 call_value; use untyped_call for that. In fact, untyped_call
1692 only needs to save the return registers in the given block. */
1693 for (regno
= 0; regno
< FIRST_PSEUDO_REGISTER
; regno
++)
1694 if ((mode
= apply_result_mode
[regno
]) != VOIDmode
)
1696 gcc_assert (!valreg
); /* have_untyped_call required. */
1698 valreg
= gen_rtx_REG (mode
, regno
);
1701 emit_insn (targetm
.gen_call_value (valreg
,
1702 gen_rtx_MEM (FUNCTION_MODE
, function
),
1703 const0_rtx
, NULL_RTX
, const0_rtx
));
1705 emit_move_insn (adjust_address (result
, GET_MODE (valreg
), 0), valreg
);
1710 /* Find the CALL insn we just emitted, and attach the register usage
1712 call_insn
= last_call_insn ();
1713 add_function_usage_to (call_insn
, call_fusage
);
1715 /* Restore the stack. */
1716 if (targetm
.have_save_stack_nonlocal ())
1717 emit_stack_restore (SAVE_NONLOCAL
, old_stack_level
);
1719 emit_stack_restore (SAVE_BLOCK
, old_stack_level
);
1720 fixup_args_size_notes (call_insn
, get_last_insn (), 0);
1724 /* Return the address of the result block. */
1725 result
= copy_addr_to_reg (XEXP (result
, 0));
1726 return convert_memory_address (ptr_mode
, result
);
1729 /* Perform an untyped return. */
1732 expand_builtin_return (rtx result
)
1734 int size
, align
, regno
;
1737 rtx_insn
*call_fusage
= 0;
1739 result
= convert_memory_address (Pmode
, result
);
1741 apply_result_size ();
1742 result
= gen_rtx_MEM (BLKmode
, result
);
1744 if (targetm
.have_untyped_return ())
1746 rtx vector
= result_vector (0, result
);
1747 emit_jump_insn (targetm
.gen_untyped_return (result
, vector
));
1752 /* Restore the return value and note that each value is used. */
1754 for (regno
= 0; regno
< FIRST_PSEUDO_REGISTER
; regno
++)
1755 if ((mode
= apply_result_mode
[regno
]) != VOIDmode
)
1757 align
= GET_MODE_ALIGNMENT (mode
) / BITS_PER_UNIT
;
1758 if (size
% align
!= 0)
1759 size
= CEIL (size
, align
) * align
;
1760 reg
= gen_rtx_REG (mode
, INCOMING_REGNO (regno
));
1761 emit_move_insn (reg
, adjust_address (result
, mode
, size
));
1763 push_to_sequence (call_fusage
);
1765 call_fusage
= get_insns ();
1767 size
+= GET_MODE_SIZE (mode
);
1770 /* Put the USE insns before the return. */
1771 emit_insn (call_fusage
);
1773 /* Return whatever values was restored by jumping directly to the end
1775 expand_naked_return ();
1778 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1780 static enum type_class
1781 type_to_class (tree type
)
1783 switch (TREE_CODE (type
))
1785 case VOID_TYPE
: return void_type_class
;
1786 case INTEGER_TYPE
: return integer_type_class
;
1787 case ENUMERAL_TYPE
: return enumeral_type_class
;
1788 case BOOLEAN_TYPE
: return boolean_type_class
;
1789 case POINTER_TYPE
: return pointer_type_class
;
1790 case REFERENCE_TYPE
: return reference_type_class
;
1791 case OFFSET_TYPE
: return offset_type_class
;
1792 case REAL_TYPE
: return real_type_class
;
1793 case COMPLEX_TYPE
: return complex_type_class
;
1794 case FUNCTION_TYPE
: return function_type_class
;
1795 case METHOD_TYPE
: return method_type_class
;
1796 case RECORD_TYPE
: return record_type_class
;
1798 case QUAL_UNION_TYPE
: return union_type_class
;
1799 case ARRAY_TYPE
: return (TYPE_STRING_FLAG (type
)
1800 ? string_type_class
: array_type_class
);
1801 case LANG_TYPE
: return lang_type_class
;
1802 default: return no_type_class
;
1806 /* Expand a call EXP to __builtin_classify_type. */
1809 expand_builtin_classify_type (tree exp
)
1811 if (call_expr_nargs (exp
))
1812 return GEN_INT (type_to_class (TREE_TYPE (CALL_EXPR_ARG (exp
, 0))));
1813 return GEN_INT (no_type_class
);
1816 /* This helper macro, meant to be used in mathfn_built_in below,
1817 determines which among a set of three builtin math functions is
1818 appropriate for a given type mode. The `F' and `L' cases are
1819 automatically generated from the `double' case. */
1820 #define CASE_MATHFN(MATHFN) \
1821 CASE_CFN_##MATHFN: \
1822 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1823 fcodel = BUILT_IN_##MATHFN##L ; break;
1824 /* Similar to above, but appends _R after any F/L suffix. */
1825 #define CASE_MATHFN_REENT(MATHFN) \
1826 case CFN_BUILT_IN_##MATHFN##_R: \
1827 case CFN_BUILT_IN_##MATHFN##F_R: \
1828 case CFN_BUILT_IN_##MATHFN##L_R: \
1829 fcode = BUILT_IN_##MATHFN##_R; fcodef = BUILT_IN_##MATHFN##F_R ; \
1830 fcodel = BUILT_IN_##MATHFN##L_R ; break;
1832 /* Return a function equivalent to FN but operating on floating-point
1833 values of type TYPE, or END_BUILTINS if no such function exists.
1834 This is purely an operation on function codes; it does not guarantee
1835 that the target actually has an implementation of the function. */
1837 static built_in_function
1838 mathfn_built_in_2 (tree type
, combined_fn fn
)
1840 built_in_function fcode
, fcodef
, fcodel
;
1854 CASE_MATHFN (COPYSIGN
)
1873 CASE_MATHFN_REENT (GAMMA
) /* GAMMA_R */
1874 CASE_MATHFN (HUGE_VAL
)
1878 CASE_MATHFN (IFLOOR
)
1881 CASE_MATHFN (IROUND
)
1888 CASE_MATHFN (LFLOOR
)
1889 CASE_MATHFN (LGAMMA
)
1890 CASE_MATHFN_REENT (LGAMMA
) /* LGAMMA_R */
1891 CASE_MATHFN (LLCEIL
)
1892 CASE_MATHFN (LLFLOOR
)
1893 CASE_MATHFN (LLRINT
)
1894 CASE_MATHFN (LLROUND
)
1901 CASE_MATHFN (LROUND
)
1905 CASE_MATHFN (NEARBYINT
)
1906 CASE_MATHFN (NEXTAFTER
)
1907 CASE_MATHFN (NEXTTOWARD
)
1911 CASE_MATHFN (REMAINDER
)
1912 CASE_MATHFN (REMQUO
)
1916 CASE_MATHFN (SCALBLN
)
1917 CASE_MATHFN (SCALBN
)
1918 CASE_MATHFN (SIGNBIT
)
1919 CASE_MATHFN (SIGNIFICAND
)
1921 CASE_MATHFN (SINCOS
)
1926 CASE_MATHFN (TGAMMA
)
1933 return END_BUILTINS
;
1936 if (TYPE_MAIN_VARIANT (type
) == double_type_node
)
1938 else if (TYPE_MAIN_VARIANT (type
) == float_type_node
)
1940 else if (TYPE_MAIN_VARIANT (type
) == long_double_type_node
)
1943 return END_BUILTINS
;
1946 /* Return mathematic function equivalent to FN but operating directly on TYPE,
1947 if available. If IMPLICIT_P is true use the implicit builtin declaration,
1948 otherwise use the explicit declaration. If we can't do the conversion,
1952 mathfn_built_in_1 (tree type
, combined_fn fn
, bool implicit_p
)
1954 built_in_function fcode2
= mathfn_built_in_2 (type
, fn
);
1955 if (fcode2
== END_BUILTINS
)
1958 if (implicit_p
&& !builtin_decl_implicit_p (fcode2
))
1961 return builtin_decl_explicit (fcode2
);
1964 /* Like mathfn_built_in_1, but always use the implicit array. */
1967 mathfn_built_in (tree type
, combined_fn fn
)
1969 return mathfn_built_in_1 (type
, fn
, /*implicit=*/ 1);
1972 /* Like mathfn_built_in_1, but take a built_in_function and
1973 always use the implicit array. */
1976 mathfn_built_in (tree type
, enum built_in_function fn
)
1978 return mathfn_built_in_1 (type
, as_combined_fn (fn
), /*implicit=*/ 1);
1981 /* If BUILT_IN_NORMAL function FNDECL has an associated internal function,
1982 return its code, otherwise return IFN_LAST. Note that this function
1983 only tests whether the function is defined in internals.def, not whether
1984 it is actually available on the target. */
1987 associated_internal_fn (tree fndecl
)
1989 gcc_checking_assert (DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
);
1990 tree return_type
= TREE_TYPE (TREE_TYPE (fndecl
));
1991 switch (DECL_FUNCTION_CODE (fndecl
))
1993 #define DEF_INTERNAL_FLT_FN(NAME, FLAGS, OPTAB, TYPE) \
1994 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME;
1995 #define DEF_INTERNAL_INT_FN(NAME, FLAGS, OPTAB, TYPE) \
1996 CASE_INT_FN (BUILT_IN_##NAME): return IFN_##NAME;
1997 #include "internal-fn.def"
1999 CASE_FLT_FN (BUILT_IN_POW10
):
2002 CASE_FLT_FN (BUILT_IN_DREM
):
2003 return IFN_REMAINDER
;
2005 CASE_FLT_FN (BUILT_IN_SCALBN
):
2006 CASE_FLT_FN (BUILT_IN_SCALBLN
):
2007 if (REAL_MODE_FORMAT (TYPE_MODE (return_type
))->b
== 2)
2016 /* If CALL is a call to a BUILT_IN_NORMAL function that could be replaced
2017 on the current target by a call to an internal function, return the
2018 code of that internal function, otherwise return IFN_LAST. The caller
2019 is responsible for ensuring that any side-effects of the built-in
2020 call are dealt with correctly. E.g. if CALL sets errno, the caller
2021 must decide that the errno result isn't needed or make it available
2022 in some other way. */
2025 replacement_internal_fn (gcall
*call
)
2027 if (gimple_call_builtin_p (call
, BUILT_IN_NORMAL
))
2029 internal_fn ifn
= associated_internal_fn (gimple_call_fndecl (call
));
2030 if (ifn
!= IFN_LAST
)
2032 tree_pair types
= direct_internal_fn_types (ifn
, call
);
2033 optimization_type opt_type
= bb_optimization_type (gimple_bb (call
));
2034 if (direct_internal_fn_supported_p (ifn
, types
, opt_type
))
2041 /* Expand a call to the builtin trinary math functions (fma).
2042 Return NULL_RTX if a normal call should be emitted rather than expanding the
2043 function in-line. EXP is the expression that is a call to the builtin
2044 function; if convenient, the result should be placed in TARGET.
2045 SUBTARGET may be used as the target for computing one of EXP's
2049 expand_builtin_mathfn_ternary (tree exp
, rtx target
, rtx subtarget
)
2051 optab builtin_optab
;
2052 rtx op0
, op1
, op2
, result
;
2054 tree fndecl
= get_callee_fndecl (exp
);
2055 tree arg0
, arg1
, arg2
;
2058 if (!validate_arglist (exp
, REAL_TYPE
, REAL_TYPE
, REAL_TYPE
, VOID_TYPE
))
2061 arg0
= CALL_EXPR_ARG (exp
, 0);
2062 arg1
= CALL_EXPR_ARG (exp
, 1);
2063 arg2
= CALL_EXPR_ARG (exp
, 2);
2065 switch (DECL_FUNCTION_CODE (fndecl
))
2067 CASE_FLT_FN (BUILT_IN_FMA
):
2068 builtin_optab
= fma_optab
; break;
2073 /* Make a suitable register to place result in. */
2074 mode
= TYPE_MODE (TREE_TYPE (exp
));
2076 /* Before working hard, check whether the instruction is available. */
2077 if (optab_handler (builtin_optab
, mode
) == CODE_FOR_nothing
)
2080 result
= gen_reg_rtx (mode
);
2082 /* Always stabilize the argument list. */
2083 CALL_EXPR_ARG (exp
, 0) = arg0
= builtin_save_expr (arg0
);
2084 CALL_EXPR_ARG (exp
, 1) = arg1
= builtin_save_expr (arg1
);
2085 CALL_EXPR_ARG (exp
, 2) = arg2
= builtin_save_expr (arg2
);
2087 op0
= expand_expr (arg0
, subtarget
, VOIDmode
, EXPAND_NORMAL
);
2088 op1
= expand_normal (arg1
);
2089 op2
= expand_normal (arg2
);
2093 /* Compute into RESULT.
2094 Set RESULT to wherever the result comes back. */
2095 result
= expand_ternary_op (mode
, builtin_optab
, op0
, op1
, op2
,
2098 /* If we were unable to expand via the builtin, stop the sequence
2099 (without outputting the insns) and call to the library function
2100 with the stabilized argument list. */
2104 return expand_call (exp
, target
, target
== const0_rtx
);
2107 /* Output the entire sequence. */
2108 insns
= get_insns ();
2115 /* Expand a call to the builtin sin and cos math functions.
2116 Return NULL_RTX if a normal call should be emitted rather than expanding the
2117 function in-line. EXP is the expression that is a call to the builtin
2118 function; if convenient, the result should be placed in TARGET.
2119 SUBTARGET may be used as the target for computing one of EXP's
2123 expand_builtin_mathfn_3 (tree exp
, rtx target
, rtx subtarget
)
2125 optab builtin_optab
;
2128 tree fndecl
= get_callee_fndecl (exp
);
2132 if (!validate_arglist (exp
, REAL_TYPE
, VOID_TYPE
))
2135 arg
= CALL_EXPR_ARG (exp
, 0);
2137 switch (DECL_FUNCTION_CODE (fndecl
))
2139 CASE_FLT_FN (BUILT_IN_SIN
):
2140 CASE_FLT_FN (BUILT_IN_COS
):
2141 builtin_optab
= sincos_optab
; break;
2146 /* Make a suitable register to place result in. */
2147 mode
= TYPE_MODE (TREE_TYPE (exp
));
2149 /* Check if sincos insn is available, otherwise fallback
2150 to sin or cos insn. */
2151 if (optab_handler (builtin_optab
, mode
) == CODE_FOR_nothing
)
2152 switch (DECL_FUNCTION_CODE (fndecl
))
2154 CASE_FLT_FN (BUILT_IN_SIN
):
2155 builtin_optab
= sin_optab
; break;
2156 CASE_FLT_FN (BUILT_IN_COS
):
2157 builtin_optab
= cos_optab
; break;
2162 /* Before working hard, check whether the instruction is available. */
2163 if (optab_handler (builtin_optab
, mode
) != CODE_FOR_nothing
)
2165 rtx result
= gen_reg_rtx (mode
);
2167 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2168 need to expand the argument again. This way, we will not perform
2169 side-effects more the once. */
2170 CALL_EXPR_ARG (exp
, 0) = arg
= builtin_save_expr (arg
);
2172 op0
= expand_expr (arg
, subtarget
, VOIDmode
, EXPAND_NORMAL
);
2176 /* Compute into RESULT.
2177 Set RESULT to wherever the result comes back. */
2178 if (builtin_optab
== sincos_optab
)
2182 switch (DECL_FUNCTION_CODE (fndecl
))
2184 CASE_FLT_FN (BUILT_IN_SIN
):
2185 ok
= expand_twoval_unop (builtin_optab
, op0
, 0, result
, 0);
2187 CASE_FLT_FN (BUILT_IN_COS
):
2188 ok
= expand_twoval_unop (builtin_optab
, op0
, result
, 0, 0);
2196 result
= expand_unop (mode
, builtin_optab
, op0
, result
, 0);
2200 /* Output the entire sequence. */
2201 insns
= get_insns ();
2207 /* If we were unable to expand via the builtin, stop the sequence
2208 (without outputting the insns) and call to the library function
2209 with the stabilized argument list. */
2213 return expand_call (exp
, target
, target
== const0_rtx
);
2216 /* Given an interclass math builtin decl FNDECL and it's argument ARG
2217 return an RTL instruction code that implements the functionality.
2218 If that isn't possible or available return CODE_FOR_nothing. */
2220 static enum insn_code
2221 interclass_mathfn_icode (tree arg
, tree fndecl
)
2223 bool errno_set
= false;
2224 optab builtin_optab
= unknown_optab
;
2227 switch (DECL_FUNCTION_CODE (fndecl
))
2229 CASE_FLT_FN (BUILT_IN_ILOGB
):
2230 errno_set
= true; builtin_optab
= ilogb_optab
; break;
2231 CASE_FLT_FN (BUILT_IN_ISINF
):
2232 builtin_optab
= isinf_optab
; break;
2233 case BUILT_IN_ISNORMAL
:
2234 case BUILT_IN_ISFINITE
:
2235 CASE_FLT_FN (BUILT_IN_FINITE
):
2236 case BUILT_IN_FINITED32
:
2237 case BUILT_IN_FINITED64
:
2238 case BUILT_IN_FINITED128
:
2239 case BUILT_IN_ISINFD32
:
2240 case BUILT_IN_ISINFD64
:
2241 case BUILT_IN_ISINFD128
:
2242 /* These builtins have no optabs (yet). */
2248 /* There's no easy way to detect the case we need to set EDOM. */
2249 if (flag_errno_math
&& errno_set
)
2250 return CODE_FOR_nothing
;
2252 /* Optab mode depends on the mode of the input argument. */
2253 mode
= TYPE_MODE (TREE_TYPE (arg
));
2256 return optab_handler (builtin_optab
, mode
);
2257 return CODE_FOR_nothing
;
2260 /* Expand a call to one of the builtin math functions that operate on
2261 floating point argument and output an integer result (ilogb, isinf,
2263 Return 0 if a normal call should be emitted rather than expanding the
2264 function in-line. EXP is the expression that is a call to the builtin
2265 function; if convenient, the result should be placed in TARGET. */
2268 expand_builtin_interclass_mathfn (tree exp
, rtx target
)
2270 enum insn_code icode
= CODE_FOR_nothing
;
2272 tree fndecl
= get_callee_fndecl (exp
);
2276 if (!validate_arglist (exp
, REAL_TYPE
, VOID_TYPE
))
2279 arg
= CALL_EXPR_ARG (exp
, 0);
2280 icode
= interclass_mathfn_icode (arg
, fndecl
);
2281 mode
= TYPE_MODE (TREE_TYPE (arg
));
2283 if (icode
!= CODE_FOR_nothing
)
2285 struct expand_operand ops
[1];
2286 rtx_insn
*last
= get_last_insn ();
2287 tree orig_arg
= arg
;
2289 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2290 need to expand the argument again. This way, we will not perform
2291 side-effects more the once. */
2292 CALL_EXPR_ARG (exp
, 0) = arg
= builtin_save_expr (arg
);
2294 op0
= expand_expr (arg
, NULL_RTX
, VOIDmode
, EXPAND_NORMAL
);
2296 if (mode
!= GET_MODE (op0
))
2297 op0
= convert_to_mode (mode
, op0
, 0);
2299 create_output_operand (&ops
[0], target
, TYPE_MODE (TREE_TYPE (exp
)));
2300 if (maybe_legitimize_operands (icode
, 0, 1, ops
)
2301 && maybe_emit_unop_insn (icode
, ops
[0].value
, op0
, UNKNOWN
))
2302 return ops
[0].value
;
2304 delete_insns_since (last
);
2305 CALL_EXPR_ARG (exp
, 0) = orig_arg
;
2311 /* Expand a call to the builtin sincos math function.
2312 Return NULL_RTX if a normal call should be emitted rather than expanding the
2313 function in-line. EXP is the expression that is a call to the builtin
2317 expand_builtin_sincos (tree exp
)
2319 rtx op0
, op1
, op2
, target1
, target2
;
2321 tree arg
, sinp
, cosp
;
2323 location_t loc
= EXPR_LOCATION (exp
);
2324 tree alias_type
, alias_off
;
2326 if (!validate_arglist (exp
, REAL_TYPE
,
2327 POINTER_TYPE
, POINTER_TYPE
, VOID_TYPE
))
2330 arg
= CALL_EXPR_ARG (exp
, 0);
2331 sinp
= CALL_EXPR_ARG (exp
, 1);
2332 cosp
= CALL_EXPR_ARG (exp
, 2);
2334 /* Make a suitable register to place result in. */
2335 mode
= TYPE_MODE (TREE_TYPE (arg
));
2337 /* Check if sincos insn is available, otherwise emit the call. */
2338 if (optab_handler (sincos_optab
, mode
) == CODE_FOR_nothing
)
2341 target1
= gen_reg_rtx (mode
);
2342 target2
= gen_reg_rtx (mode
);
2344 op0
= expand_normal (arg
);
2345 alias_type
= build_pointer_type_for_mode (TREE_TYPE (arg
), ptr_mode
, true);
2346 alias_off
= build_int_cst (alias_type
, 0);
2347 op1
= expand_normal (fold_build2_loc (loc
, MEM_REF
, TREE_TYPE (arg
),
2349 op2
= expand_normal (fold_build2_loc (loc
, MEM_REF
, TREE_TYPE (arg
),
2352 /* Compute into target1 and target2.
2353 Set TARGET to wherever the result comes back. */
2354 result
= expand_twoval_unop (sincos_optab
, op0
, target2
, target1
, 0);
2355 gcc_assert (result
);
2357 /* Move target1 and target2 to the memory locations indicated
2359 emit_move_insn (op1
, target1
);
2360 emit_move_insn (op2
, target2
);
2365 /* Expand a call to the internal cexpi builtin to the sincos math function.
2366 EXP is the expression that is a call to the builtin function; if convenient,
2367 the result should be placed in TARGET. */
2370 expand_builtin_cexpi (tree exp
, rtx target
)
2372 tree fndecl
= get_callee_fndecl (exp
);
2376 location_t loc
= EXPR_LOCATION (exp
);
2378 if (!validate_arglist (exp
, REAL_TYPE
, VOID_TYPE
))
2381 arg
= CALL_EXPR_ARG (exp
, 0);
2382 type
= TREE_TYPE (arg
);
2383 mode
= TYPE_MODE (TREE_TYPE (arg
));
2385 /* Try expanding via a sincos optab, fall back to emitting a libcall
2386 to sincos or cexp. We are sure we have sincos or cexp because cexpi
2387 is only generated from sincos, cexp or if we have either of them. */
2388 if (optab_handler (sincos_optab
, mode
) != CODE_FOR_nothing
)
2390 op1
= gen_reg_rtx (mode
);
2391 op2
= gen_reg_rtx (mode
);
2393 op0
= expand_expr (arg
, NULL_RTX
, VOIDmode
, EXPAND_NORMAL
);
2395 /* Compute into op1 and op2. */
2396 expand_twoval_unop (sincos_optab
, op0
, op2
, op1
, 0);
2398 else if (targetm
.libc_has_function (function_sincos
))
2400 tree call
, fn
= NULL_TREE
;
2404 if (DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CEXPIF
)
2405 fn
= builtin_decl_explicit (BUILT_IN_SINCOSF
);
2406 else if (DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CEXPI
)
2407 fn
= builtin_decl_explicit (BUILT_IN_SINCOS
);
2408 else if (DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CEXPIL
)
2409 fn
= builtin_decl_explicit (BUILT_IN_SINCOSL
);
2413 op1
= assign_temp (TREE_TYPE (arg
), 1, 1);
2414 op2
= assign_temp (TREE_TYPE (arg
), 1, 1);
2415 op1a
= copy_addr_to_reg (XEXP (op1
, 0));
2416 op2a
= copy_addr_to_reg (XEXP (op2
, 0));
2417 top1
= make_tree (build_pointer_type (TREE_TYPE (arg
)), op1a
);
2418 top2
= make_tree (build_pointer_type (TREE_TYPE (arg
)), op2a
);
2420 /* Make sure not to fold the sincos call again. */
2421 call
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (fn
)), fn
);
2422 expand_normal (build_call_nary (TREE_TYPE (TREE_TYPE (fn
)),
2423 call
, 3, arg
, top1
, top2
));
2427 tree call
, fn
= NULL_TREE
, narg
;
2428 tree ctype
= build_complex_type (type
);
2430 if (DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CEXPIF
)
2431 fn
= builtin_decl_explicit (BUILT_IN_CEXPF
);
2432 else if (DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CEXPI
)
2433 fn
= builtin_decl_explicit (BUILT_IN_CEXP
);
2434 else if (DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CEXPIL
)
2435 fn
= builtin_decl_explicit (BUILT_IN_CEXPL
);
2439 /* If we don't have a decl for cexp create one. This is the
2440 friendliest fallback if the user calls __builtin_cexpi
2441 without full target C99 function support. */
2442 if (fn
== NULL_TREE
)
2445 const char *name
= NULL
;
2447 if (DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CEXPIF
)
2449 else if (DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CEXPI
)
2451 else if (DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CEXPIL
)
2454 fntype
= build_function_type_list (ctype
, ctype
, NULL_TREE
);
2455 fn
= build_fn_decl (name
, fntype
);
2458 narg
= fold_build2_loc (loc
, COMPLEX_EXPR
, ctype
,
2459 build_real (type
, dconst0
), arg
);
2461 /* Make sure not to fold the cexp call again. */
2462 call
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (fn
)), fn
);
2463 return expand_expr (build_call_nary (ctype
, call
, 1, narg
),
2464 target
, VOIDmode
, EXPAND_NORMAL
);
2467 /* Now build the proper return type. */
2468 return expand_expr (build2 (COMPLEX_EXPR
, build_complex_type (type
),
2469 make_tree (TREE_TYPE (arg
), op2
),
2470 make_tree (TREE_TYPE (arg
), op1
)),
2471 target
, VOIDmode
, EXPAND_NORMAL
);
2474 /* Conveniently construct a function call expression. FNDECL names the
2475 function to be called, N is the number of arguments, and the "..."
2476 parameters are the argument expressions. Unlike build_call_exr
2477 this doesn't fold the call, hence it will always return a CALL_EXPR. */
2480 build_call_nofold_loc (location_t loc
, tree fndecl
, int n
, ...)
2483 tree fntype
= TREE_TYPE (fndecl
);
2484 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
2487 fn
= build_call_valist (TREE_TYPE (fntype
), fn
, n
, ap
);
2489 SET_EXPR_LOCATION (fn
, loc
);
2493 /* Expand a call to one of the builtin rounding functions gcc defines
2494 as an extension (lfloor and lceil). As these are gcc extensions we
2495 do not need to worry about setting errno to EDOM.
2496 If expanding via optab fails, lower expression to (int)(floor(x)).
2497 EXP is the expression that is a call to the builtin function;
2498 if convenient, the result should be placed in TARGET. */
2501 expand_builtin_int_roundingfn (tree exp
, rtx target
)
2503 convert_optab builtin_optab
;
2506 tree fndecl
= get_callee_fndecl (exp
);
2507 enum built_in_function fallback_fn
;
2508 tree fallback_fndecl
;
2512 if (!validate_arglist (exp
, REAL_TYPE
, VOID_TYPE
))
2515 arg
= CALL_EXPR_ARG (exp
, 0);
2517 switch (DECL_FUNCTION_CODE (fndecl
))
2519 CASE_FLT_FN (BUILT_IN_ICEIL
):
2520 CASE_FLT_FN (BUILT_IN_LCEIL
):
2521 CASE_FLT_FN (BUILT_IN_LLCEIL
):
2522 builtin_optab
= lceil_optab
;
2523 fallback_fn
= BUILT_IN_CEIL
;
2526 CASE_FLT_FN (BUILT_IN_IFLOOR
):
2527 CASE_FLT_FN (BUILT_IN_LFLOOR
):
2528 CASE_FLT_FN (BUILT_IN_LLFLOOR
):
2529 builtin_optab
= lfloor_optab
;
2530 fallback_fn
= BUILT_IN_FLOOR
;
2537 /* Make a suitable register to place result in. */
2538 mode
= TYPE_MODE (TREE_TYPE (exp
));
2540 target
= gen_reg_rtx (mode
);
2542 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2543 need to expand the argument again. This way, we will not perform
2544 side-effects more the once. */
2545 CALL_EXPR_ARG (exp
, 0) = arg
= builtin_save_expr (arg
);
2547 op0
= expand_expr (arg
, NULL
, VOIDmode
, EXPAND_NORMAL
);
2551 /* Compute into TARGET. */
2552 if (expand_sfix_optab (target
, op0
, builtin_optab
))
2554 /* Output the entire sequence. */
2555 insns
= get_insns ();
2561 /* If we were unable to expand via the builtin, stop the sequence
2562 (without outputting the insns). */
2565 /* Fall back to floating point rounding optab. */
2566 fallback_fndecl
= mathfn_built_in (TREE_TYPE (arg
), fallback_fn
);
2568 /* For non-C99 targets we may end up without a fallback fndecl here
2569 if the user called __builtin_lfloor directly. In this case emit
2570 a call to the floor/ceil variants nevertheless. This should result
2571 in the best user experience for not full C99 targets. */
2572 if (fallback_fndecl
== NULL_TREE
)
2575 const char *name
= NULL
;
2577 switch (DECL_FUNCTION_CODE (fndecl
))
2579 case BUILT_IN_ICEIL
:
2580 case BUILT_IN_LCEIL
:
2581 case BUILT_IN_LLCEIL
:
2584 case BUILT_IN_ICEILF
:
2585 case BUILT_IN_LCEILF
:
2586 case BUILT_IN_LLCEILF
:
2589 case BUILT_IN_ICEILL
:
2590 case BUILT_IN_LCEILL
:
2591 case BUILT_IN_LLCEILL
:
2594 case BUILT_IN_IFLOOR
:
2595 case BUILT_IN_LFLOOR
:
2596 case BUILT_IN_LLFLOOR
:
2599 case BUILT_IN_IFLOORF
:
2600 case BUILT_IN_LFLOORF
:
2601 case BUILT_IN_LLFLOORF
:
2604 case BUILT_IN_IFLOORL
:
2605 case BUILT_IN_LFLOORL
:
2606 case BUILT_IN_LLFLOORL
:
2613 fntype
= build_function_type_list (TREE_TYPE (arg
),
2614 TREE_TYPE (arg
), NULL_TREE
);
2615 fallback_fndecl
= build_fn_decl (name
, fntype
);
2618 exp
= build_call_nofold_loc (EXPR_LOCATION (exp
), fallback_fndecl
, 1, arg
);
2620 tmp
= expand_normal (exp
);
2621 tmp
= maybe_emit_group_store (tmp
, TREE_TYPE (exp
));
2623 /* Truncate the result of floating point optab to integer
2624 via expand_fix (). */
2625 target
= gen_reg_rtx (mode
);
2626 expand_fix (target
, tmp
, 0);
2631 /* Expand a call to one of the builtin math functions doing integer
2633 Return 0 if a normal call should be emitted rather than expanding the
2634 function in-line. EXP is the expression that is a call to the builtin
2635 function; if convenient, the result should be placed in TARGET. */
2638 expand_builtin_int_roundingfn_2 (tree exp
, rtx target
)
2640 convert_optab builtin_optab
;
2643 tree fndecl
= get_callee_fndecl (exp
);
2646 enum built_in_function fallback_fn
= BUILT_IN_NONE
;
2648 if (!validate_arglist (exp
, REAL_TYPE
, VOID_TYPE
))
2651 arg
= CALL_EXPR_ARG (exp
, 0);
2653 switch (DECL_FUNCTION_CODE (fndecl
))
2655 CASE_FLT_FN (BUILT_IN_IRINT
):
2656 fallback_fn
= BUILT_IN_LRINT
;
2658 CASE_FLT_FN (BUILT_IN_LRINT
):
2659 CASE_FLT_FN (BUILT_IN_LLRINT
):
2660 builtin_optab
= lrint_optab
;
2663 CASE_FLT_FN (BUILT_IN_IROUND
):
2664 fallback_fn
= BUILT_IN_LROUND
;
2666 CASE_FLT_FN (BUILT_IN_LROUND
):
2667 CASE_FLT_FN (BUILT_IN_LLROUND
):
2668 builtin_optab
= lround_optab
;
2675 /* There's no easy way to detect the case we need to set EDOM. */
2676 if (flag_errno_math
&& fallback_fn
== BUILT_IN_NONE
)
2679 /* Make a suitable register to place result in. */
2680 mode
= TYPE_MODE (TREE_TYPE (exp
));
2682 /* There's no easy way to detect the case we need to set EDOM. */
2683 if (!flag_errno_math
)
2685 rtx result
= gen_reg_rtx (mode
);
2687 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2688 need to expand the argument again. This way, we will not perform
2689 side-effects more the once. */
2690 CALL_EXPR_ARG (exp
, 0) = arg
= builtin_save_expr (arg
);
2692 op0
= expand_expr (arg
, NULL
, VOIDmode
, EXPAND_NORMAL
);
2696 if (expand_sfix_optab (result
, op0
, builtin_optab
))
2698 /* Output the entire sequence. */
2699 insns
= get_insns ();
2705 /* If we were unable to expand via the builtin, stop the sequence
2706 (without outputting the insns) and call to the library function
2707 with the stabilized argument list. */
2711 if (fallback_fn
!= BUILT_IN_NONE
)
2713 /* Fall back to rounding to long int. Use implicit_p 0 - for non-C99
2714 targets, (int) round (x) should never be transformed into
2715 BUILT_IN_IROUND and if __builtin_iround is called directly, emit
2716 a call to lround in the hope that the target provides at least some
2717 C99 functions. This should result in the best user experience for
2718 not full C99 targets. */
2719 tree fallback_fndecl
= mathfn_built_in_1
2720 (TREE_TYPE (arg
), as_combined_fn (fallback_fn
), 0);
2722 exp
= build_call_nofold_loc (EXPR_LOCATION (exp
),
2723 fallback_fndecl
, 1, arg
);
2725 target
= expand_call (exp
, NULL_RTX
, target
== const0_rtx
);
2726 target
= maybe_emit_group_store (target
, TREE_TYPE (exp
));
2727 return convert_to_mode (mode
, target
, 0);
2730 return expand_call (exp
, target
, target
== const0_rtx
);
2733 /* Expand a call to the powi built-in mathematical function. Return NULL_RTX if
2734 a normal call should be emitted rather than expanding the function
2735 in-line. EXP is the expression that is a call to the builtin
2736 function; if convenient, the result should be placed in TARGET. */
2739 expand_builtin_powi (tree exp
, rtx target
)
2746 if (! validate_arglist (exp
, REAL_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
2749 arg0
= CALL_EXPR_ARG (exp
, 0);
2750 arg1
= CALL_EXPR_ARG (exp
, 1);
2751 mode
= TYPE_MODE (TREE_TYPE (exp
));
2753 /* Emit a libcall to libgcc. */
2755 /* Mode of the 2nd argument must match that of an int. */
2756 mode2
= mode_for_size (INT_TYPE_SIZE
, MODE_INT
, 0);
2758 if (target
== NULL_RTX
)
2759 target
= gen_reg_rtx (mode
);
2761 op0
= expand_expr (arg0
, NULL_RTX
, mode
, EXPAND_NORMAL
);
2762 if (GET_MODE (op0
) != mode
)
2763 op0
= convert_to_mode (mode
, op0
, 0);
2764 op1
= expand_expr (arg1
, NULL_RTX
, mode2
, EXPAND_NORMAL
);
2765 if (GET_MODE (op1
) != mode2
)
2766 op1
= convert_to_mode (mode2
, op1
, 0);
2768 target
= emit_library_call_value (optab_libfunc (powi_optab
, mode
),
2769 target
, LCT_CONST
, mode
, 2,
2770 op0
, mode
, op1
, mode2
);
2775 /* Expand expression EXP which is a call to the strlen builtin. Return
2776 NULL_RTX if we failed the caller should emit a normal call, otherwise
2777 try to get the result in TARGET, if convenient. */
2780 expand_builtin_strlen (tree exp
, rtx target
,
2781 machine_mode target_mode
)
2783 if (!validate_arglist (exp
, POINTER_TYPE
, VOID_TYPE
))
2787 struct expand_operand ops
[4];
2790 tree src
= CALL_EXPR_ARG (exp
, 0);
2792 rtx_insn
*before_strlen
;
2793 machine_mode insn_mode
= target_mode
;
2794 enum insn_code icode
= CODE_FOR_nothing
;
2797 /* If the length can be computed at compile-time, return it. */
2798 len
= c_strlen (src
, 0);
2800 return expand_expr (len
, target
, target_mode
, EXPAND_NORMAL
);
2802 /* If the length can be computed at compile-time and is constant
2803 integer, but there are side-effects in src, evaluate
2804 src for side-effects, then return len.
2805 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
2806 can be optimized into: i++; x = 3; */
2807 len
= c_strlen (src
, 1);
2808 if (len
&& TREE_CODE (len
) == INTEGER_CST
)
2810 expand_expr (src
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
2811 return expand_expr (len
, target
, target_mode
, EXPAND_NORMAL
);
2814 align
= get_pointer_alignment (src
) / BITS_PER_UNIT
;
2816 /* If SRC is not a pointer type, don't do this operation inline. */
2820 /* Bail out if we can't compute strlen in the right mode. */
2821 while (insn_mode
!= VOIDmode
)
2823 icode
= optab_handler (strlen_optab
, insn_mode
);
2824 if (icode
!= CODE_FOR_nothing
)
2827 insn_mode
= GET_MODE_WIDER_MODE (insn_mode
);
2829 if (insn_mode
== VOIDmode
)
2832 /* Make a place to hold the source address. We will not expand
2833 the actual source until we are sure that the expansion will
2834 not fail -- there are trees that cannot be expanded twice. */
2835 src_reg
= gen_reg_rtx (Pmode
);
2837 /* Mark the beginning of the strlen sequence so we can emit the
2838 source operand later. */
2839 before_strlen
= get_last_insn ();
2841 create_output_operand (&ops
[0], target
, insn_mode
);
2842 create_fixed_operand (&ops
[1], gen_rtx_MEM (BLKmode
, src_reg
));
2843 create_integer_operand (&ops
[2], 0);
2844 create_integer_operand (&ops
[3], align
);
2845 if (!maybe_expand_insn (icode
, 4, ops
))
2848 /* Now that we are assured of success, expand the source. */
2850 pat
= expand_expr (src
, src_reg
, Pmode
, EXPAND_NORMAL
);
2853 #ifdef POINTERS_EXTEND_UNSIGNED
2854 if (GET_MODE (pat
) != Pmode
)
2855 pat
= convert_to_mode (Pmode
, pat
,
2856 POINTERS_EXTEND_UNSIGNED
);
2858 emit_move_insn (src_reg
, pat
);
2864 emit_insn_after (pat
, before_strlen
);
2866 emit_insn_before (pat
, get_insns ());
2868 /* Return the value in the proper mode for this function. */
2869 if (GET_MODE (ops
[0].value
) == target_mode
)
2870 target
= ops
[0].value
;
2871 else if (target
!= 0)
2872 convert_move (target
, ops
[0].value
, 0);
2874 target
= convert_to_mode (target_mode
, ops
[0].value
, 0);
2880 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
2881 bytes from constant string DATA + OFFSET and return it as target
2885 builtin_memcpy_read_str (void *data
, HOST_WIDE_INT offset
,
2888 const char *str
= (const char *) data
;
2890 gcc_assert (offset
>= 0
2891 && ((unsigned HOST_WIDE_INT
) offset
+ GET_MODE_SIZE (mode
)
2892 <= strlen (str
) + 1));
2894 return c_readstr (str
+ offset
, mode
);
2897 /* LEN specify length of the block of memcpy/memset operation.
2898 Figure out its range and put it into MIN_SIZE/MAX_SIZE.
2899 In some cases we can make very likely guess on max size, then we
2900 set it into PROBABLE_MAX_SIZE. */
2903 determine_block_size (tree len
, rtx len_rtx
,
2904 unsigned HOST_WIDE_INT
*min_size
,
2905 unsigned HOST_WIDE_INT
*max_size
,
2906 unsigned HOST_WIDE_INT
*probable_max_size
)
2908 if (CONST_INT_P (len_rtx
))
2910 *min_size
= *max_size
= *probable_max_size
= UINTVAL (len_rtx
);
2916 enum value_range_type range_type
= VR_UNDEFINED
;
2918 /* Determine bounds from the type. */
2919 if (tree_fits_uhwi_p (TYPE_MIN_VALUE (TREE_TYPE (len
))))
2920 *min_size
= tree_to_uhwi (TYPE_MIN_VALUE (TREE_TYPE (len
)));
2923 if (tree_fits_uhwi_p (TYPE_MAX_VALUE (TREE_TYPE (len
))))
2924 *probable_max_size
= *max_size
2925 = tree_to_uhwi (TYPE_MAX_VALUE (TREE_TYPE (len
)));
2927 *probable_max_size
= *max_size
= GET_MODE_MASK (GET_MODE (len_rtx
));
2929 if (TREE_CODE (len
) == SSA_NAME
)
2930 range_type
= get_range_info (len
, &min
, &max
);
2931 if (range_type
== VR_RANGE
)
2933 if (wi::fits_uhwi_p (min
) && *min_size
< min
.to_uhwi ())
2934 *min_size
= min
.to_uhwi ();
2935 if (wi::fits_uhwi_p (max
) && *max_size
> max
.to_uhwi ())
2936 *probable_max_size
= *max_size
= max
.to_uhwi ();
2938 else if (range_type
== VR_ANTI_RANGE
)
2940 /* Anti range 0...N lets us to determine minimal size to N+1. */
2943 if (wi::fits_uhwi_p (max
) && max
.to_uhwi () + 1 != 0)
2944 *min_size
= max
.to_uhwi () + 1;
2952 Produce anti range allowing negative values of N. We still
2953 can use the information and make a guess that N is not negative.
2955 else if (!wi::leu_p (max
, 1 << 30) && wi::fits_uhwi_p (min
))
2956 *probable_max_size
= min
.to_uhwi () - 1;
2959 gcc_checking_assert (*max_size
<=
2960 (unsigned HOST_WIDE_INT
)
2961 GET_MODE_MASK (GET_MODE (len_rtx
)));
2964 /* Try to verify that the sizes and lengths of the arguments to a string
2965 manipulation function given by EXP are within valid bounds and that
2966 the operation does not lead to buffer overflow. Arguments other than
2967 EXP may be null. When non-null, the arguments have the following
2969 SIZE is the user-supplied size argument to the function (such as in
2970 memcpy(d, s, SIZE) or strncpy(d, s, SIZE). It specifies the exact
2971 number of bytes to write.
2972 MAXLEN is the user-supplied bound on the length of the source sequence
2973 (such as in strncat(d, s, N). It specifies the upper limit on the number
2975 SRC is the source string (such as in strcpy(d, s)) when the expression
2976 EXP is a string function call (as opposed to a memory call like memcpy).
2977 As an exception, SRC can also be an integer denoting the precomputed
2978 size of the source string or object (for functions like memcpy).
2979 OBJSIZE is the size of the destination object specified by the last
2980 argument to the _chk builtins, typically resulting from the expansion
2981 of __builtin_object_size (such as in __builtin___strcpy_chk(d, s,
2984 When SIZE is null LEN is checked to verify that it doesn't exceed
2987 If the call is successfully verified as safe from buffer overflow
2988 the function returns true, otherwise false.. */
2991 check_sizes (int opt
, tree exp
, tree size
, tree maxlen
, tree src
, tree objsize
)
2993 /* The size of the largest object is half the address space, or
2994 SSIZE_MAX. (This is way too permissive.) */
2995 tree maxobjsize
= TYPE_MAX_VALUE (ssizetype
);
2997 tree slen
= NULL_TREE
;
2999 tree range
[2] = { NULL_TREE
, NULL_TREE
};
3001 /* Set to true when the exact number of bytes written by a string
3002 function like strcpy is not known and the only thing that is
3003 known is that it must be at least one (for the terminating nul). */
3004 bool at_least_one
= false;
3007 /* SRC is normally a pointer to string but as a special case
3008 it can be an integer denoting the length of a string. */
3009 if (POINTER_TYPE_P (TREE_TYPE (src
)))
3011 /* Try to determine the range of lengths the source string
3012 refers to. If it can be determined and is less than
3013 the upper bound given by MAXLEN add one to it for
3014 the terminating nul. Otherwise, set it to one for
3015 the same reason, or to MAXLEN as appropriate. */
3016 get_range_strlen (src
, range
);
3017 if (range
[0] && (!maxlen
|| TREE_CODE (maxlen
) == INTEGER_CST
))
3019 if (maxlen
&& tree_int_cst_le (maxlen
, range
[0]))
3020 range
[0] = range
[1] = maxlen
;
3022 range
[0] = fold_build2 (PLUS_EXPR
, size_type_node
,
3023 range
[0], size_one_node
);
3025 if (maxlen
&& tree_int_cst_le (maxlen
, range
[1]))
3027 else if (!integer_all_onesp (range
[1]))
3028 range
[1] = fold_build2 (PLUS_EXPR
, size_type_node
,
3029 range
[1], size_one_node
);
3035 at_least_one
= true;
3036 slen
= size_one_node
;
3043 if (!size
&& !maxlen
)
3045 /* When the only available piece of data is the object size
3046 there is nothing to do. */
3050 /* Otherwise, when the length of the source sequence is known
3051 (as with with strlen), set SIZE to it. */
3057 objsize
= maxobjsize
;
3059 /* The SIZE is exact if it's non-null, constant, and in range of
3060 unsigned HOST_WIDE_INT. */
3061 bool exactsize
= size
&& tree_fits_uhwi_p (size
);
3064 get_size_range (size
, range
);
3066 /* First check the number of bytes to be written against the maximum
3068 if (range
[0] && tree_int_cst_lt (maxobjsize
, range
[0]))
3070 location_t loc
= tree_nonartificial_location (exp
);
3071 loc
= expansion_point_location_if_in_system_header (loc
);
3073 if (range
[0] == range
[1])
3074 warning_at (loc
, opt
,
3075 "%K%qD specified size %E "
3076 "exceeds maximum object size %E",
3077 exp
, get_callee_fndecl (exp
), range
[0], maxobjsize
);
3079 warning_at (loc
, opt
,
3080 "%K%qD specified size between %E and %E "
3081 "exceeds maximum object size %E",
3082 exp
, get_callee_fndecl (exp
),
3083 range
[0], range
[1], maxobjsize
);
3087 /* Next check the number of bytes to be written against the destination
3089 if (range
[0] || !exactsize
|| integer_all_onesp (size
))
3092 && ((tree_fits_uhwi_p (objsize
)
3093 && tree_int_cst_lt (objsize
, range
[0]))
3094 || (tree_fits_uhwi_p (size
)
3095 && tree_int_cst_lt (size
, range
[0]))))
3097 location_t loc
= tree_nonartificial_location (exp
);
3098 loc
= expansion_point_location_if_in_system_header (loc
);
3100 if (size
== slen
&& at_least_one
)
3102 /* This is a call to strcpy with a destination of 0 size
3103 and a source of unknown length. The call will write
3104 at least one byte past the end of the destination. */
3105 warning_at (loc
, opt
,
3106 "%K%qD writing %E or more bytes into a region "
3107 "of size %E overflows the destination",
3108 exp
, get_callee_fndecl (exp
), range
[0], objsize
);
3110 else if (tree_int_cst_equal (range
[0], range
[1]))
3111 warning_at (loc
, opt
,
3112 (integer_onep (range
[0])
3113 ? G_("%K%qD writing %E byte into a region "
3114 "of size %E overflows the destination")
3115 : G_("%K%qD writing %E bytes into a region "
3116 "of size %E overflows the destination")),
3117 exp
, get_callee_fndecl (exp
), range
[0], objsize
);
3118 else if (tree_int_cst_sign_bit (range
[1]))
3120 /* Avoid printing the upper bound if it's invalid. */
3121 warning_at (loc
, opt
,
3122 "%K%qD writing %E or more bytes into a region "
3123 "of size %E overflows the destination",
3124 exp
, get_callee_fndecl (exp
), range
[0], objsize
);
3127 warning_at (loc
, opt
,
3128 "%K%qD writing between %E and %E bytes into "
3129 "a region of size %E overflows the destination",
3130 exp
, get_callee_fndecl (exp
), range
[0], range
[1],
3133 /* Return error when an overflow has been detected. */
3138 /* Check the maximum length of the source sequence against the size
3139 of the destination object if known, or against the maximum size
3143 get_size_range (maxlen
, range
);
3145 if (range
[0] && objsize
&& tree_fits_uhwi_p (objsize
))
3147 location_t loc
= tree_nonartificial_location (exp
);
3148 loc
= expansion_point_location_if_in_system_header (loc
);
3150 if (tree_int_cst_lt (maxobjsize
, range
[0]))
3152 /* Warn about crazy big sizes first since that's more
3153 likely to be meaningful than saying that the bound
3154 is greater than the object size if both are big. */
3155 if (range
[0] == range
[1])
3156 warning_at (loc
, opt
,
3157 "%K%qD specified bound %E "
3158 "exceeds maximum object size %E",
3159 exp
, get_callee_fndecl (exp
),
3160 range
[0], maxobjsize
);
3162 warning_at (loc
, opt
,
3163 "%K%qD specified bound between %E and %E "
3164 "exceeds maximum object size %E",
3165 exp
, get_callee_fndecl (exp
),
3166 range
[0], range
[1], maxobjsize
);
3171 if (objsize
!= maxobjsize
&& tree_int_cst_lt (objsize
, range
[0]))
3173 if (tree_int_cst_equal (range
[0], range
[1]))
3174 warning_at (loc
, opt
,
3175 "%K%qD specified bound %E "
3176 "exceeds destination size %E",
3177 exp
, get_callee_fndecl (exp
),
3180 warning_at (loc
, opt
,
3181 "%K%qD specified bound between %E and %E "
3182 "exceeds destination size %E",
3183 exp
, get_callee_fndecl (exp
),
3184 range
[0], range
[1], objsize
);
3193 && tree_int_cst_lt (slen
, range
[0]))
3195 location_t loc
= tree_nonartificial_location (exp
);
3197 if (tree_int_cst_equal (range
[0], range
[1]))
3198 warning_at (loc
, opt
,
3199 (tree_int_cst_equal (range
[0], integer_one_node
)
3200 ? G_("%K%qD reading %E byte from a region of size %E")
3201 : G_("%K%qD reading %E bytes from a region of size %E")),
3202 exp
, get_callee_fndecl (exp
), range
[0], slen
);
3203 else if (tree_int_cst_sign_bit (range
[1]))
3205 /* Avoid printing the upper bound if it's invalid. */
3206 warning_at (loc
, opt
,
3207 "%K%qD reading %E or more bytes from a region "
3209 exp
, get_callee_fndecl (exp
), range
[0], slen
);
3212 warning_at (loc
, opt
,
3213 "%K%qD reading between %E and %E bytes from a region "
3215 exp
, get_callee_fndecl (exp
), range
[0], range
[1], slen
);
3222 /* Helper to compute the size of the object referenced by the DEST
3223 expression which must of of pointer type, using Object Size type
3224 OSTYPE (only the least significant 2 bits are used). Return
3225 the size of the object if successful or NULL when the size cannot
3229 compute_objsize (tree dest
, int ostype
)
3231 unsigned HOST_WIDE_INT size
;
3232 if (compute_builtin_object_size (dest
, ostype
& 3, &size
))
3233 return build_int_cst (sizetype
, size
);
3238 /* Helper to determine and check the sizes of the source and the destination
3239 of calls to __builtin_{bzero,memcpy,mempcpy,memset} calls. EXP is the
3240 call expression, DEST is the destination argument, SRC is the source
3241 argument or null, and LEN is the number of bytes. Use Object Size type-0
3242 regardless of the OPT_Wstringop_overflow_ setting. Return true on success
3243 (no overflow or invalid sizes), false otherwise. */
3246 check_memop_sizes (tree exp
, tree dest
, tree src
, tree size
)
3248 if (!warn_stringop_overflow
)
3251 /* For functions like memset and memcpy that operate on raw memory
3252 try to determine the size of the largest source and destination
3253 object using type-0 Object Size regardless of the object size
3254 type specified by the option. */
3255 tree srcsize
= src
? compute_objsize (src
, 0) : NULL_TREE
;
3256 tree dstsize
= compute_objsize (dest
, 0);
3258 return check_sizes (OPT_Wstringop_overflow_
, exp
,
3259 size
, /*maxlen=*/NULL_TREE
, srcsize
, dstsize
);
3262 /* Validate memchr arguments without performing any expansion.
3266 expand_builtin_memchr (tree exp
, rtx
)
3268 if (!validate_arglist (exp
,
3269 POINTER_TYPE
, INTEGER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
3272 tree arg1
= CALL_EXPR_ARG (exp
, 0);
3273 tree len
= CALL_EXPR_ARG (exp
, 2);
3275 /* Diagnose calls where the specified length exceeds the size
3277 if (warn_stringop_overflow
)
3279 tree size
= compute_objsize (arg1
, 0);
3280 check_sizes (OPT_Wstringop_overflow_
,
3281 exp
, len
, /*maxlen=*/NULL_TREE
,
3282 size
, /*objsize=*/NULL_TREE
);
3288 /* Expand a call EXP to the memcpy builtin.
3289 Return NULL_RTX if we failed, the caller should emit a normal call,
3290 otherwise try to get the result in TARGET, if convenient (and in
3291 mode MODE if that's convenient). */
3294 expand_builtin_memcpy (tree exp
, rtx target
)
3296 if (!validate_arglist (exp
,
3297 POINTER_TYPE
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
3300 tree dest
= CALL_EXPR_ARG (exp
, 0);
3301 tree src
= CALL_EXPR_ARG (exp
, 1);
3302 tree len
= CALL_EXPR_ARG (exp
, 2);
3304 check_memop_sizes (exp
, dest
, src
, len
);
3306 return expand_builtin_memory_copy_args (dest
, src
, len
, target
, exp
,
3310 /* Check a call EXP to the memmove built-in for validity.
3311 Return NULL_RTX on both success and failure. */
3314 expand_builtin_memmove (tree exp
, rtx
)
3316 if (!validate_arglist (exp
,
3317 POINTER_TYPE
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
3320 tree dest
= CALL_EXPR_ARG (exp
, 0);
3321 tree src
= CALL_EXPR_ARG (exp
, 1);
3322 tree len
= CALL_EXPR_ARG (exp
, 2);
3324 check_memop_sizes (exp
, dest
, src
, len
);
3329 /* Expand an instrumented call EXP to the memcpy builtin.
3330 Return NULL_RTX if we failed, the caller should emit a normal call,
3331 otherwise try to get the result in TARGET, if convenient (and in
3332 mode MODE if that's convenient). */
3335 expand_builtin_memcpy_with_bounds (tree exp
, rtx target
)
3337 if (!validate_arglist (exp
,
3338 POINTER_TYPE
, POINTER_BOUNDS_TYPE
,
3339 POINTER_TYPE
, POINTER_BOUNDS_TYPE
,
3340 INTEGER_TYPE
, VOID_TYPE
))
3344 tree dest
= CALL_EXPR_ARG (exp
, 0);
3345 tree src
= CALL_EXPR_ARG (exp
, 2);
3346 tree len
= CALL_EXPR_ARG (exp
, 4);
3347 rtx res
= expand_builtin_memory_copy_args (dest
, src
, len
, target
, exp
,
3350 /* Return src bounds with the result. */
3353 rtx bnd
= force_reg (targetm
.chkp_bound_mode (),
3354 expand_normal (CALL_EXPR_ARG (exp
, 1)));
3355 res
= chkp_join_splitted_slot (res
, bnd
);
3361 /* Expand a call EXP to the mempcpy builtin.
3362 Return NULL_RTX if we failed; the caller should emit a normal call,
3363 otherwise try to get the result in TARGET, if convenient (and in
3364 mode MODE if that's convenient). If ENDP is 0 return the
3365 destination pointer, if ENDP is 1 return the end pointer ala
3366 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3370 expand_builtin_mempcpy (tree exp
, rtx target
)
3372 if (!validate_arglist (exp
,
3373 POINTER_TYPE
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
3376 tree dest
= CALL_EXPR_ARG (exp
, 0);
3377 tree src
= CALL_EXPR_ARG (exp
, 1);
3378 tree len
= CALL_EXPR_ARG (exp
, 2);
3380 /* Avoid expanding mempcpy into memcpy when the call is determined
3381 to overflow the buffer. This also prevents the same overflow
3382 from being diagnosed again when expanding memcpy. */
3383 if (!check_memop_sizes (exp
, dest
, src
, len
))
3386 return expand_builtin_mempcpy_args (dest
, src
, len
,
3387 target
, exp
, /*endp=*/ 1);
3390 /* Expand an instrumented call EXP to the mempcpy builtin.
3391 Return NULL_RTX if we failed, the caller should emit a normal call,
3392 otherwise try to get the result in TARGET, if convenient (and in
3393 mode MODE if that's convenient). */
3396 expand_builtin_mempcpy_with_bounds (tree exp
, rtx target
)
3398 if (!validate_arglist (exp
,
3399 POINTER_TYPE
, POINTER_BOUNDS_TYPE
,
3400 POINTER_TYPE
, POINTER_BOUNDS_TYPE
,
3401 INTEGER_TYPE
, VOID_TYPE
))
3405 tree dest
= CALL_EXPR_ARG (exp
, 0);
3406 tree src
= CALL_EXPR_ARG (exp
, 2);
3407 tree len
= CALL_EXPR_ARG (exp
, 4);
3408 rtx res
= expand_builtin_mempcpy_args (dest
, src
, len
, target
,
3411 /* Return src bounds with the result. */
3414 rtx bnd
= force_reg (targetm
.chkp_bound_mode (),
3415 expand_normal (CALL_EXPR_ARG (exp
, 1)));
3416 res
= chkp_join_splitted_slot (res
, bnd
);
3422 /* Helper function to do the actual work for expand of memory copy family
3423 functions (memcpy, mempcpy, stpcpy). Expansing should assign LEN bytes
3424 of memory from SRC to DEST and assign to TARGET if convenient.
3425 If ENDP is 0 return the
3426 destination pointer, if ENDP is 1 return the end pointer ala
3427 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3431 expand_builtin_memory_copy_args (tree dest
, tree src
, tree len
,
3432 rtx target
, tree exp
, int endp
)
3434 const char *src_str
;
3435 unsigned int src_align
= get_pointer_alignment (src
);
3436 unsigned int dest_align
= get_pointer_alignment (dest
);
3437 rtx dest_mem
, src_mem
, dest_addr
, len_rtx
;
3438 HOST_WIDE_INT expected_size
= -1;
3439 unsigned int expected_align
= 0;
3440 unsigned HOST_WIDE_INT min_size
;
3441 unsigned HOST_WIDE_INT max_size
;
3442 unsigned HOST_WIDE_INT probable_max_size
;
3444 /* If DEST is not a pointer type, call the normal function. */
3445 if (dest_align
== 0)
3448 /* If either SRC is not a pointer type, don't do this
3449 operation in-line. */
3453 if (currently_expanding_gimple_stmt
)
3454 stringop_block_profile (currently_expanding_gimple_stmt
,
3455 &expected_align
, &expected_size
);
3457 if (expected_align
< dest_align
)
3458 expected_align
= dest_align
;
3459 dest_mem
= get_memory_rtx (dest
, len
);
3460 set_mem_align (dest_mem
, dest_align
);
3461 len_rtx
= expand_normal (len
);
3462 determine_block_size (len
, len_rtx
, &min_size
, &max_size
,
3463 &probable_max_size
);
3464 src_str
= c_getstr (src
);
3466 /* If SRC is a string constant and block move would be done
3467 by pieces, we can avoid loading the string from memory
3468 and only stored the computed constants. */
3470 && CONST_INT_P (len_rtx
)
3471 && (unsigned HOST_WIDE_INT
) INTVAL (len_rtx
) <= strlen (src_str
) + 1
3472 && can_store_by_pieces (INTVAL (len_rtx
), builtin_memcpy_read_str
,
3473 CONST_CAST (char *, src_str
),
3476 dest_mem
= store_by_pieces (dest_mem
, INTVAL (len_rtx
),
3477 builtin_memcpy_read_str
,
3478 CONST_CAST (char *, src_str
),
3479 dest_align
, false, endp
);
3480 dest_mem
= force_operand (XEXP (dest_mem
, 0), target
);
3481 dest_mem
= convert_memory_address (ptr_mode
, dest_mem
);
3485 src_mem
= get_memory_rtx (src
, len
);
3486 set_mem_align (src_mem
, src_align
);
3488 /* Copy word part most expediently. */
3489 dest_addr
= emit_block_move_hints (dest_mem
, src_mem
, len_rtx
,
3490 CALL_EXPR_TAILCALL (exp
)
3491 && (endp
== 0 || target
== const0_rtx
)
3492 ? BLOCK_OP_TAILCALL
: BLOCK_OP_NORMAL
,
3493 expected_align
, expected_size
,
3494 min_size
, max_size
, probable_max_size
);
3498 dest_addr
= force_operand (XEXP (dest_mem
, 0), target
);
3499 dest_addr
= convert_memory_address (ptr_mode
, dest_addr
);
3502 if (endp
&& target
!= const0_rtx
)
3504 dest_addr
= gen_rtx_PLUS (ptr_mode
, dest_addr
, len_rtx
);
3505 /* stpcpy pointer to last byte. */
3507 dest_addr
= gen_rtx_MINUS (ptr_mode
, dest_addr
, const1_rtx
);
3514 expand_builtin_mempcpy_args (tree dest
, tree src
, tree len
,
3515 rtx target
, tree orig_exp
, int endp
)
3517 return expand_builtin_memory_copy_args (dest
, src
, len
, target
, orig_exp
,
3521 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
3522 we failed, the caller should emit a normal call, otherwise try to
3523 get the result in TARGET, if convenient. If ENDP is 0 return the
3524 destination pointer, if ENDP is 1 return the end pointer ala
3525 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3529 expand_movstr (tree dest
, tree src
, rtx target
, int endp
)
3531 struct expand_operand ops
[3];
3535 if (!targetm
.have_movstr ())
3538 dest_mem
= get_memory_rtx (dest
, NULL
);
3539 src_mem
= get_memory_rtx (src
, NULL
);
3542 target
= force_reg (Pmode
, XEXP (dest_mem
, 0));
3543 dest_mem
= replace_equiv_address (dest_mem
, target
);
3546 create_output_operand (&ops
[0], endp
? target
: NULL_RTX
, Pmode
);
3547 create_fixed_operand (&ops
[1], dest_mem
);
3548 create_fixed_operand (&ops
[2], src_mem
);
3549 if (!maybe_expand_insn (targetm
.code_for_movstr
, 3, ops
))
3552 if (endp
&& target
!= const0_rtx
)
3554 target
= ops
[0].value
;
3555 /* movstr is supposed to set end to the address of the NUL
3556 terminator. If the caller requested a mempcpy-like return value,
3560 rtx tem
= plus_constant (GET_MODE (target
),
3561 gen_lowpart (GET_MODE (target
), target
), 1);
3562 emit_move_insn (target
, force_operand (tem
, NULL_RTX
));
3568 /* Do some very basic size validation of a call to the strcpy builtin
3569 given by EXP. Return NULL_RTX to have the built-in expand to a call
3570 to the library function. */
3573 expand_builtin_strcat (tree exp
, rtx
)
3575 if (!validate_arglist (exp
, POINTER_TYPE
, POINTER_TYPE
, VOID_TYPE
)
3576 || !warn_stringop_overflow
)
3579 tree dest
= CALL_EXPR_ARG (exp
, 0);
3580 tree src
= CALL_EXPR_ARG (exp
, 1);
3582 /* There is no way here to determine the length of the string in
3583 the destination to which the SRC string is being appended so
3584 just diagnose cases when the souce string is longer than
3585 the destination object. */
3587 tree destsize
= compute_objsize (dest
, warn_stringop_overflow
- 1);
3589 check_sizes (OPT_Wstringop_overflow_
,
3590 exp
, /*size=*/NULL_TREE
, /*maxlen=*/NULL_TREE
, src
, destsize
);
3595 /* Expand expression EXP, which is a call to the strcpy builtin. Return
3596 NULL_RTX if we failed the caller should emit a normal call, otherwise
3597 try to get the result in TARGET, if convenient (and in mode MODE if that's
3601 expand_builtin_strcpy (tree exp
, rtx target
)
3603 if (!validate_arglist (exp
, POINTER_TYPE
, POINTER_TYPE
, VOID_TYPE
))
3606 tree dest
= CALL_EXPR_ARG (exp
, 0);
3607 tree src
= CALL_EXPR_ARG (exp
, 1);
3609 if (warn_stringop_overflow
)
3611 tree destsize
= compute_objsize (dest
, warn_stringop_overflow
- 1);
3612 check_sizes (OPT_Wstringop_overflow_
,
3613 exp
, /*size=*/NULL_TREE
, /*maxlen=*/NULL_TREE
, src
, destsize
);
3616 return expand_builtin_strcpy_args (dest
, src
, target
);
3619 /* Helper function to do the actual work for expand_builtin_strcpy. The
3620 arguments to the builtin_strcpy call DEST and SRC are broken out
3621 so that this can also be called without constructing an actual CALL_EXPR.
3622 The other arguments and return value are the same as for
3623 expand_builtin_strcpy. */
3626 expand_builtin_strcpy_args (tree dest
, tree src
, rtx target
)
3628 return expand_movstr (dest
, src
, target
, /*endp=*/0);
3631 /* Expand a call EXP to the stpcpy builtin.
3632 Return NULL_RTX if we failed the caller should emit a normal call,
3633 otherwise try to get the result in TARGET, if convenient (and in
3634 mode MODE if that's convenient). */
3637 expand_builtin_stpcpy (tree exp
, rtx target
, machine_mode mode
)
3640 location_t loc
= EXPR_LOCATION (exp
);
3642 if (!validate_arglist (exp
, POINTER_TYPE
, POINTER_TYPE
, VOID_TYPE
))
3645 dst
= CALL_EXPR_ARG (exp
, 0);
3646 src
= CALL_EXPR_ARG (exp
, 1);
3648 if (warn_stringop_overflow
)
3650 tree destsize
= compute_objsize (dst
, warn_stringop_overflow
- 1);
3651 check_sizes (OPT_Wstringop_overflow_
,
3652 exp
, /*size=*/NULL_TREE
, /*maxlen=*/NULL_TREE
, src
, destsize
);
3655 /* If return value is ignored, transform stpcpy into strcpy. */
3656 if (target
== const0_rtx
&& builtin_decl_implicit (BUILT_IN_STRCPY
))
3658 tree fn
= builtin_decl_implicit (BUILT_IN_STRCPY
);
3659 tree result
= build_call_nofold_loc (loc
, fn
, 2, dst
, src
);
3660 return expand_expr (result
, target
, mode
, EXPAND_NORMAL
);
3667 /* Ensure we get an actual string whose length can be evaluated at
3668 compile-time, not an expression containing a string. This is
3669 because the latter will potentially produce pessimized code
3670 when used to produce the return value. */
3671 if (! c_getstr (src
) || ! (len
= c_strlen (src
, 0)))
3672 return expand_movstr (dst
, src
, target
, /*endp=*/2);
3674 lenp1
= size_binop_loc (loc
, PLUS_EXPR
, len
, ssize_int (1));
3675 ret
= expand_builtin_mempcpy_args (dst
, src
, lenp1
,
3676 target
, exp
, /*endp=*/2);
3681 if (TREE_CODE (len
) == INTEGER_CST
)
3683 rtx len_rtx
= expand_normal (len
);
3685 if (CONST_INT_P (len_rtx
))
3687 ret
= expand_builtin_strcpy_args (dst
, src
, target
);
3693 if (mode
!= VOIDmode
)
3694 target
= gen_reg_rtx (mode
);
3696 target
= gen_reg_rtx (GET_MODE (ret
));
3698 if (GET_MODE (target
) != GET_MODE (ret
))
3699 ret
= gen_lowpart (GET_MODE (target
), ret
);
3701 ret
= plus_constant (GET_MODE (ret
), ret
, INTVAL (len_rtx
));
3702 ret
= emit_move_insn (target
, force_operand (ret
, NULL_RTX
));
3710 return expand_movstr (dst
, src
, target
, /*endp=*/2);
3714 /* Check a call EXP to the stpncpy built-in for validity.
3715 Return NULL_RTX on both success and failure. */
3718 expand_builtin_stpncpy (tree exp
, rtx
)
3720 if (!validate_arglist (exp
,
3721 POINTER_TYPE
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
)
3722 || !warn_stringop_overflow
)
3725 /* The source and destination of the call. */
3726 tree dest
= CALL_EXPR_ARG (exp
, 0);
3727 tree src
= CALL_EXPR_ARG (exp
, 1);
3729 /* The exact number of bytes to write (not the maximum). */
3730 tree len
= CALL_EXPR_ARG (exp
, 2);
3732 /* The size of the destination object. */
3733 tree destsize
= compute_objsize (dest
, warn_stringop_overflow
- 1);
3735 check_sizes (OPT_Wstringop_overflow_
,
3736 exp
, len
, /*maxlen=*/NULL_TREE
, src
, destsize
);
3741 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3742 bytes from constant string DATA + OFFSET and return it as target
3746 builtin_strncpy_read_str (void *data
, HOST_WIDE_INT offset
,
3749 const char *str
= (const char *) data
;
3751 if ((unsigned HOST_WIDE_INT
) offset
> strlen (str
))
3754 return c_readstr (str
+ offset
, mode
);
3757 /* Helper to check the sizes of sequences and the destination of calls
3758 to __builtin_strncat and __builtin___strncat_chk. Returns true on
3759 success (no overflow or invalid sizes), false otherwise. */
3762 check_strncat_sizes (tree exp
, tree objsize
)
3764 tree dest
= CALL_EXPR_ARG (exp
, 0);
3765 tree src
= CALL_EXPR_ARG (exp
, 1);
3766 tree maxlen
= CALL_EXPR_ARG (exp
, 2);
3768 /* Try to determine the range of lengths that the source expression
3771 get_range_strlen (src
, lenrange
);
3773 /* Try to verify that the destination is big enough for the shortest
3776 if (!objsize
&& warn_stringop_overflow
)
3778 /* If it hasn't been provided by __strncat_chk, try to determine
3779 the size of the destination object into which the source is
3781 objsize
= compute_objsize (dest
, warn_stringop_overflow
- 1);
3784 /* Add one for the terminating nul. */
3785 tree srclen
= (lenrange
[0]
3786 ? fold_build2 (PLUS_EXPR
, size_type_node
, lenrange
[0],
3790 /* Strncat copies at most MAXLEN bytes and always appends the terminating
3791 nul so the specified upper bound should never be equal to (or greater
3792 than) the size of the destination. */
3793 if (tree_fits_uhwi_p (maxlen
) && tree_fits_uhwi_p (objsize
)
3794 && tree_int_cst_equal (objsize
, maxlen
))
3796 location_t loc
= tree_nonartificial_location (exp
);
3797 loc
= expansion_point_location_if_in_system_header (loc
);
3799 warning_at (loc
, OPT_Wstringop_overflow_
,
3800 "%K%qD specified bound %E equals destination size",
3801 exp
, get_callee_fndecl (exp
), maxlen
);
3807 || (maxlen
&& tree_fits_uhwi_p (maxlen
)
3808 && tree_fits_uhwi_p (srclen
)
3809 && tree_int_cst_lt (maxlen
, srclen
)))
3812 /* The number of bytes to write is LEN but check_sizes will also
3813 check SRCLEN if LEN's value isn't known. */
3814 return check_sizes (OPT_Wstringop_overflow_
,
3815 exp
, /*size=*/NULL_TREE
, maxlen
, srclen
, objsize
);
3818 /* Similar to expand_builtin_strcat, do some very basic size validation
3819 of a call to the strcpy builtin given by EXP. Return NULL_RTX to have
3820 the built-in expand to a call to the library function. */
3823 expand_builtin_strncat (tree exp
, rtx
)
3825 if (!validate_arglist (exp
,
3826 POINTER_TYPE
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
)
3827 || !warn_stringop_overflow
)
3830 tree dest
= CALL_EXPR_ARG (exp
, 0);
3831 tree src
= CALL_EXPR_ARG (exp
, 1);
3832 /* The upper bound on the number of bytes to write. */
3833 tree maxlen
= CALL_EXPR_ARG (exp
, 2);
3834 /* The length of the source sequence. */
3835 tree slen
= c_strlen (src
, 1);
3837 /* Try to determine the range of lengths that the source expression
3841 lenrange
[0] = lenrange
[1] = slen
;
3843 get_range_strlen (src
, lenrange
);
3845 /* Try to verify that the destination is big enough for the shortest
3846 string. First try to determine the size of the destination object
3847 into which the source is being copied. */
3848 tree destsize
= compute_objsize (dest
, warn_stringop_overflow
- 1);
3850 /* Add one for the terminating nul. */
3851 tree srclen
= (lenrange
[0]
3852 ? fold_build2 (PLUS_EXPR
, size_type_node
, lenrange
[0],
3856 /* Strncat copies at most MAXLEN bytes and always appends the terminating
3857 nul so the specified upper bound should never be equal to (or greater
3858 than) the size of the destination. */
3859 if (tree_fits_uhwi_p (maxlen
) && tree_fits_uhwi_p (destsize
)
3860 && tree_int_cst_equal (destsize
, maxlen
))
3862 location_t loc
= tree_nonartificial_location (exp
);
3863 loc
= expansion_point_location_if_in_system_header (loc
);
3865 warning_at (loc
, OPT_Wstringop_overflow_
,
3866 "%K%qD specified bound %E equals destination size",
3867 exp
, get_callee_fndecl (exp
), maxlen
);
3873 || (maxlen
&& tree_fits_uhwi_p (maxlen
)
3874 && tree_fits_uhwi_p (srclen
)
3875 && tree_int_cst_lt (maxlen
, srclen
)))
3878 /* The number of bytes to write is LEN but check_sizes will also
3879 check SRCLEN if LEN's value isn't known. */
3880 check_sizes (OPT_Wstringop_overflow_
,
3881 exp
, /*size=*/NULL_TREE
, maxlen
, srclen
, destsize
);
3886 /* Expand expression EXP, which is a call to the strncpy builtin. Return
3887 NULL_RTX if we failed the caller should emit a normal call. */
3890 expand_builtin_strncpy (tree exp
, rtx target
)
3892 location_t loc
= EXPR_LOCATION (exp
);
3894 if (validate_arglist (exp
,
3895 POINTER_TYPE
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
3897 tree dest
= CALL_EXPR_ARG (exp
, 0);
3898 tree src
= CALL_EXPR_ARG (exp
, 1);
3899 /* The number of bytes to write (not the maximum). */
3900 tree len
= CALL_EXPR_ARG (exp
, 2);
3901 /* The length of the source sequence. */
3902 tree slen
= c_strlen (src
, 1);
3904 if (warn_stringop_overflow
)
3906 tree destsize
= compute_objsize (dest
,
3907 warn_stringop_overflow
- 1);
3909 /* The number of bytes to write is LEN but check_sizes will also
3910 check SLEN if LEN's value isn't known. */
3911 check_sizes (OPT_Wstringop_overflow_
,
3912 exp
, len
, /*maxlen=*/NULL_TREE
, src
, destsize
);
3915 /* We must be passed a constant len and src parameter. */
3916 if (!tree_fits_uhwi_p (len
) || !slen
|| !tree_fits_uhwi_p (slen
))
3919 slen
= size_binop_loc (loc
, PLUS_EXPR
, slen
, ssize_int (1));
3921 /* We're required to pad with trailing zeros if the requested
3922 len is greater than strlen(s2)+1. In that case try to
3923 use store_by_pieces, if it fails, punt. */
3924 if (tree_int_cst_lt (slen
, len
))
3926 unsigned int dest_align
= get_pointer_alignment (dest
);
3927 const char *p
= c_getstr (src
);
3930 if (!p
|| dest_align
== 0 || !tree_fits_uhwi_p (len
)
3931 || !can_store_by_pieces (tree_to_uhwi (len
),
3932 builtin_strncpy_read_str
,
3933 CONST_CAST (char *, p
),
3937 dest_mem
= get_memory_rtx (dest
, len
);
3938 store_by_pieces (dest_mem
, tree_to_uhwi (len
),
3939 builtin_strncpy_read_str
,
3940 CONST_CAST (char *, p
), dest_align
, false, 0);
3941 dest_mem
= force_operand (XEXP (dest_mem
, 0), target
);
3942 dest_mem
= convert_memory_address (ptr_mode
, dest_mem
);
3949 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3950 bytes from constant string DATA + OFFSET and return it as target
3954 builtin_memset_read_str (void *data
, HOST_WIDE_INT offset ATTRIBUTE_UNUSED
,
3957 const char *c
= (const char *) data
;
3958 char *p
= XALLOCAVEC (char, GET_MODE_SIZE (mode
));
3960 memset (p
, *c
, GET_MODE_SIZE (mode
));
3962 return c_readstr (p
, mode
);
3965 /* Callback routine for store_by_pieces. Return the RTL of a register
3966 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
3967 char value given in the RTL register data. For example, if mode is
3968 4 bytes wide, return the RTL for 0x01010101*data. */
3971 builtin_memset_gen_str (void *data
, HOST_WIDE_INT offset ATTRIBUTE_UNUSED
,
3978 size
= GET_MODE_SIZE (mode
);
3982 p
= XALLOCAVEC (char, size
);
3983 memset (p
, 1, size
);
3984 coeff
= c_readstr (p
, mode
);
3986 target
= convert_to_mode (mode
, (rtx
) data
, 1);
3987 target
= expand_mult (mode
, target
, coeff
, NULL_RTX
, 1);
3988 return force_reg (mode
, target
);
3991 /* Expand expression EXP, which is a call to the memset builtin. Return
3992 NULL_RTX if we failed the caller should emit a normal call, otherwise
3993 try to get the result in TARGET, if convenient (and in mode MODE if that's
3997 expand_builtin_memset (tree exp
, rtx target
, machine_mode mode
)
3999 if (!validate_arglist (exp
,
4000 POINTER_TYPE
, INTEGER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
4003 tree dest
= CALL_EXPR_ARG (exp
, 0);
4004 tree val
= CALL_EXPR_ARG (exp
, 1);
4005 tree len
= CALL_EXPR_ARG (exp
, 2);
4007 check_memop_sizes (exp
, dest
, NULL_TREE
, len
);
4009 return expand_builtin_memset_args (dest
, val
, len
, target
, mode
, exp
);
4012 /* Expand expression EXP, which is an instrumented call to the memset builtin.
4013 Return NULL_RTX if we failed the caller should emit a normal call, otherwise
4014 try to get the result in TARGET, if convenient (and in mode MODE if that's
4018 expand_builtin_memset_with_bounds (tree exp
, rtx target
, machine_mode mode
)
4020 if (!validate_arglist (exp
,
4021 POINTER_TYPE
, POINTER_BOUNDS_TYPE
,
4022 INTEGER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
4026 tree dest
= CALL_EXPR_ARG (exp
, 0);
4027 tree val
= CALL_EXPR_ARG (exp
, 2);
4028 tree len
= CALL_EXPR_ARG (exp
, 3);
4029 rtx res
= expand_builtin_memset_args (dest
, val
, len
, target
, mode
, exp
);
4031 /* Return src bounds with the result. */
4034 rtx bnd
= force_reg (targetm
.chkp_bound_mode (),
4035 expand_normal (CALL_EXPR_ARG (exp
, 1)));
4036 res
= chkp_join_splitted_slot (res
, bnd
);
4042 /* Helper function to do the actual work for expand_builtin_memset. The
4043 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
4044 so that this can also be called without constructing an actual CALL_EXPR.
4045 The other arguments and return value are the same as for
4046 expand_builtin_memset. */
4049 expand_builtin_memset_args (tree dest
, tree val
, tree len
,
4050 rtx target
, machine_mode mode
, tree orig_exp
)
4053 enum built_in_function fcode
;
4054 machine_mode val_mode
;
4056 unsigned int dest_align
;
4057 rtx dest_mem
, dest_addr
, len_rtx
;
4058 HOST_WIDE_INT expected_size
= -1;
4059 unsigned int expected_align
= 0;
4060 unsigned HOST_WIDE_INT min_size
;
4061 unsigned HOST_WIDE_INT max_size
;
4062 unsigned HOST_WIDE_INT probable_max_size
;
4064 dest_align
= get_pointer_alignment (dest
);
4066 /* If DEST is not a pointer type, don't do this operation in-line. */
4067 if (dest_align
== 0)
4070 if (currently_expanding_gimple_stmt
)
4071 stringop_block_profile (currently_expanding_gimple_stmt
,
4072 &expected_align
, &expected_size
);
4074 if (expected_align
< dest_align
)
4075 expected_align
= dest_align
;
4077 /* If the LEN parameter is zero, return DEST. */
4078 if (integer_zerop (len
))
4080 /* Evaluate and ignore VAL in case it has side-effects. */
4081 expand_expr (val
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
4082 return expand_expr (dest
, target
, mode
, EXPAND_NORMAL
);
4085 /* Stabilize the arguments in case we fail. */
4086 dest
= builtin_save_expr (dest
);
4087 val
= builtin_save_expr (val
);
4088 len
= builtin_save_expr (len
);
4090 len_rtx
= expand_normal (len
);
4091 determine_block_size (len
, len_rtx
, &min_size
, &max_size
,
4092 &probable_max_size
);
4093 dest_mem
= get_memory_rtx (dest
, len
);
4094 val_mode
= TYPE_MODE (unsigned_char_type_node
);
4096 if (TREE_CODE (val
) != INTEGER_CST
)
4100 val_rtx
= expand_normal (val
);
4101 val_rtx
= convert_to_mode (val_mode
, val_rtx
, 0);
4103 /* Assume that we can memset by pieces if we can store
4104 * the coefficients by pieces (in the required modes).
4105 * We can't pass builtin_memset_gen_str as that emits RTL. */
4107 if (tree_fits_uhwi_p (len
)
4108 && can_store_by_pieces (tree_to_uhwi (len
),
4109 builtin_memset_read_str
, &c
, dest_align
,
4112 val_rtx
= force_reg (val_mode
, val_rtx
);
4113 store_by_pieces (dest_mem
, tree_to_uhwi (len
),
4114 builtin_memset_gen_str
, val_rtx
, dest_align
,
4117 else if (!set_storage_via_setmem (dest_mem
, len_rtx
, val_rtx
,
4118 dest_align
, expected_align
,
4119 expected_size
, min_size
, max_size
,
4123 dest_mem
= force_operand (XEXP (dest_mem
, 0), NULL_RTX
);
4124 dest_mem
= convert_memory_address (ptr_mode
, dest_mem
);
4128 if (target_char_cast (val
, &c
))
4133 if (tree_fits_uhwi_p (len
)
4134 && can_store_by_pieces (tree_to_uhwi (len
),
4135 builtin_memset_read_str
, &c
, dest_align
,
4137 store_by_pieces (dest_mem
, tree_to_uhwi (len
),
4138 builtin_memset_read_str
, &c
, dest_align
, true, 0);
4139 else if (!set_storage_via_setmem (dest_mem
, len_rtx
,
4140 gen_int_mode (c
, val_mode
),
4141 dest_align
, expected_align
,
4142 expected_size
, min_size
, max_size
,
4146 dest_mem
= force_operand (XEXP (dest_mem
, 0), NULL_RTX
);
4147 dest_mem
= convert_memory_address (ptr_mode
, dest_mem
);
4151 set_mem_align (dest_mem
, dest_align
);
4152 dest_addr
= clear_storage_hints (dest_mem
, len_rtx
,
4153 CALL_EXPR_TAILCALL (orig_exp
)
4154 ? BLOCK_OP_TAILCALL
: BLOCK_OP_NORMAL
,
4155 expected_align
, expected_size
,
4161 dest_addr
= force_operand (XEXP (dest_mem
, 0), NULL_RTX
);
4162 dest_addr
= convert_memory_address (ptr_mode
, dest_addr
);
4168 fndecl
= get_callee_fndecl (orig_exp
);
4169 fcode
= DECL_FUNCTION_CODE (fndecl
);
4170 if (fcode
== BUILT_IN_MEMSET
4171 || fcode
== BUILT_IN_CHKP_MEMSET_NOBND_NOCHK_CHKP
)
4172 fn
= build_call_nofold_loc (EXPR_LOCATION (orig_exp
), fndecl
, 3,
4174 else if (fcode
== BUILT_IN_BZERO
)
4175 fn
= build_call_nofold_loc (EXPR_LOCATION (orig_exp
), fndecl
, 2,
4179 gcc_assert (TREE_CODE (fn
) == CALL_EXPR
);
4180 CALL_EXPR_TAILCALL (fn
) = CALL_EXPR_TAILCALL (orig_exp
);
4181 return expand_call (fn
, target
, target
== const0_rtx
);
4184 /* Expand expression EXP, which is a call to the bzero builtin. Return
4185 NULL_RTX if we failed the caller should emit a normal call. */
4188 expand_builtin_bzero (tree exp
)
4190 if (!validate_arglist (exp
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
4193 tree dest
= CALL_EXPR_ARG (exp
, 0);
4194 tree size
= CALL_EXPR_ARG (exp
, 1);
4196 check_memop_sizes (exp
, dest
, NULL_TREE
, size
);
4198 /* New argument list transforming bzero(ptr x, int y) to
4199 memset(ptr x, int 0, size_t y). This is done this way
4200 so that if it isn't expanded inline, we fallback to
4201 calling bzero instead of memset. */
4203 location_t loc
= EXPR_LOCATION (exp
);
4205 return expand_builtin_memset_args (dest
, integer_zero_node
,
4206 fold_convert_loc (loc
,
4207 size_type_node
, size
),
4208 const0_rtx
, VOIDmode
, exp
);
4211 /* Try to expand cmpstr operation ICODE with the given operands.
4212 Return the result rtx on success, otherwise return null. */
4215 expand_cmpstr (insn_code icode
, rtx target
, rtx arg1_rtx
, rtx arg2_rtx
,
4216 HOST_WIDE_INT align
)
4218 machine_mode insn_mode
= insn_data
[icode
].operand
[0].mode
;
4220 if (target
&& (!REG_P (target
) || HARD_REGISTER_P (target
)))
4223 struct expand_operand ops
[4];
4224 create_output_operand (&ops
[0], target
, insn_mode
);
4225 create_fixed_operand (&ops
[1], arg1_rtx
);
4226 create_fixed_operand (&ops
[2], arg2_rtx
);
4227 create_integer_operand (&ops
[3], align
);
4228 if (maybe_expand_insn (icode
, 4, ops
))
4229 return ops
[0].value
;
4233 /* Expand expression EXP, which is a call to the memcmp built-in function.
4234 Return NULL_RTX if we failed and the caller should emit a normal call,
4235 otherwise try to get the result in TARGET, if convenient.
4236 RESULT_EQ is true if we can relax the returned value to be either zero
4237 or nonzero, without caring about the sign. */
4240 expand_builtin_memcmp (tree exp
, rtx target
, bool result_eq
)
4242 if (!validate_arglist (exp
,
4243 POINTER_TYPE
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
4246 tree arg1
= CALL_EXPR_ARG (exp
, 0);
4247 tree arg2
= CALL_EXPR_ARG (exp
, 1);
4248 tree len
= CALL_EXPR_ARG (exp
, 2);
4250 /* Diagnose calls where the specified length exceeds the size of either
4252 if (warn_stringop_overflow
)
4254 tree size
= compute_objsize (arg1
, 0);
4255 if (check_sizes (OPT_Wstringop_overflow_
,
4256 exp
, len
, /*maxlen=*/NULL_TREE
,
4257 size
, /*objsize=*/NULL_TREE
))
4259 size
= compute_objsize (arg2
, 0);
4260 check_sizes (OPT_Wstringop_overflow_
,
4261 exp
, len
, /*maxlen=*/NULL_TREE
,
4262 size
, /*objsize=*/NULL_TREE
);
4266 machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
4267 location_t loc
= EXPR_LOCATION (exp
);
4269 unsigned int arg1_align
= get_pointer_alignment (arg1
) / BITS_PER_UNIT
;
4270 unsigned int arg2_align
= get_pointer_alignment (arg2
) / BITS_PER_UNIT
;
4272 /* If we don't have POINTER_TYPE, call the function. */
4273 if (arg1_align
== 0 || arg2_align
== 0)
4276 rtx arg1_rtx
= get_memory_rtx (arg1
, len
);
4277 rtx arg2_rtx
= get_memory_rtx (arg2
, len
);
4278 rtx len_rtx
= expand_normal (fold_convert_loc (loc
, sizetype
, len
));
4280 /* Set MEM_SIZE as appropriate. */
4281 if (CONST_INT_P (len_rtx
))
4283 set_mem_size (arg1_rtx
, INTVAL (len_rtx
));
4284 set_mem_size (arg2_rtx
, INTVAL (len_rtx
));
4287 by_pieces_constfn constfn
= NULL
;
4289 const char *src_str
= c_getstr (arg2
);
4290 if (result_eq
&& src_str
== NULL
)
4292 src_str
= c_getstr (arg1
);
4293 if (src_str
!= NULL
)
4294 std::swap (arg1_rtx
, arg2_rtx
);
4297 /* If SRC is a string constant and block move would be done
4298 by pieces, we can avoid loading the string from memory
4299 and only stored the computed constants. */
4301 && CONST_INT_P (len_rtx
)
4302 && (unsigned HOST_WIDE_INT
) INTVAL (len_rtx
) <= strlen (src_str
) + 1)
4303 constfn
= builtin_memcpy_read_str
;
4305 rtx result
= emit_block_cmp_hints (arg1_rtx
, arg2_rtx
, len_rtx
,
4306 TREE_TYPE (len
), target
,
4308 CONST_CAST (char *, src_str
));
4312 /* Return the value in the proper mode for this function. */
4313 if (GET_MODE (result
) == mode
)
4318 convert_move (target
, result
, 0);
4322 return convert_to_mode (mode
, result
, 0);
4328 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
4329 if we failed the caller should emit a normal call, otherwise try to get
4330 the result in TARGET, if convenient. */
4333 expand_builtin_strcmp (tree exp
, ATTRIBUTE_UNUSED rtx target
)
4335 if (!validate_arglist (exp
, POINTER_TYPE
, POINTER_TYPE
, VOID_TYPE
))
4338 insn_code cmpstr_icode
= direct_optab_handler (cmpstr_optab
, SImode
);
4339 insn_code cmpstrn_icode
= direct_optab_handler (cmpstrn_optab
, SImode
);
4340 if (cmpstr_icode
!= CODE_FOR_nothing
|| cmpstrn_icode
!= CODE_FOR_nothing
)
4342 rtx arg1_rtx
, arg2_rtx
;
4344 tree arg1
= CALL_EXPR_ARG (exp
, 0);
4345 tree arg2
= CALL_EXPR_ARG (exp
, 1);
4346 rtx result
= NULL_RTX
;
4348 unsigned int arg1_align
= get_pointer_alignment (arg1
) / BITS_PER_UNIT
;
4349 unsigned int arg2_align
= get_pointer_alignment (arg2
) / BITS_PER_UNIT
;
4351 /* If we don't have POINTER_TYPE, call the function. */
4352 if (arg1_align
== 0 || arg2_align
== 0)
4355 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
4356 arg1
= builtin_save_expr (arg1
);
4357 arg2
= builtin_save_expr (arg2
);
4359 arg1_rtx
= get_memory_rtx (arg1
, NULL
);
4360 arg2_rtx
= get_memory_rtx (arg2
, NULL
);
4362 /* Try to call cmpstrsi. */
4363 if (cmpstr_icode
!= CODE_FOR_nothing
)
4364 result
= expand_cmpstr (cmpstr_icode
, target
, arg1_rtx
, arg2_rtx
,
4365 MIN (arg1_align
, arg2_align
));
4367 /* Try to determine at least one length and call cmpstrnsi. */
4368 if (!result
&& cmpstrn_icode
!= CODE_FOR_nothing
)
4373 tree len1
= c_strlen (arg1
, 1);
4374 tree len2
= c_strlen (arg2
, 1);
4377 len1
= size_binop (PLUS_EXPR
, ssize_int (1), len1
);
4379 len2
= size_binop (PLUS_EXPR
, ssize_int (1), len2
);
4381 /* If we don't have a constant length for the first, use the length
4382 of the second, if we know it. We don't require a constant for
4383 this case; some cost analysis could be done if both are available
4384 but neither is constant. For now, assume they're equally cheap,
4385 unless one has side effects. If both strings have constant lengths,
4392 else if (TREE_SIDE_EFFECTS (len1
))
4394 else if (TREE_SIDE_EFFECTS (len2
))
4396 else if (TREE_CODE (len1
) != INTEGER_CST
)
4398 else if (TREE_CODE (len2
) != INTEGER_CST
)
4400 else if (tree_int_cst_lt (len1
, len2
))
4405 /* If both arguments have side effects, we cannot optimize. */
4406 if (len
&& !TREE_SIDE_EFFECTS (len
))
4408 arg3_rtx
= expand_normal (len
);
4409 result
= expand_cmpstrn_or_cmpmem
4410 (cmpstrn_icode
, target
, arg1_rtx
, arg2_rtx
, TREE_TYPE (len
),
4411 arg3_rtx
, MIN (arg1_align
, arg2_align
));
4417 /* Return the value in the proper mode for this function. */
4418 machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
4419 if (GET_MODE (result
) == mode
)
4422 return convert_to_mode (mode
, result
, 0);
4423 convert_move (target
, result
, 0);
4427 /* Expand the library call ourselves using a stabilized argument
4428 list to avoid re-evaluating the function's arguments twice. */
4429 fndecl
= get_callee_fndecl (exp
);
4430 fn
= build_call_nofold_loc (EXPR_LOCATION (exp
), fndecl
, 2, arg1
, arg2
);
4431 gcc_assert (TREE_CODE (fn
) == CALL_EXPR
);
4432 CALL_EXPR_TAILCALL (fn
) = CALL_EXPR_TAILCALL (exp
);
4433 return expand_call (fn
, target
, target
== const0_rtx
);
4438 /* Expand expression EXP, which is a call to the strncmp builtin. Return
4439 NULL_RTX if we failed the caller should emit a normal call, otherwise try to get
4440 the result in TARGET, if convenient. */
4443 expand_builtin_strncmp (tree exp
, ATTRIBUTE_UNUSED rtx target
,
4444 ATTRIBUTE_UNUSED machine_mode mode
)
4446 location_t loc ATTRIBUTE_UNUSED
= EXPR_LOCATION (exp
);
4448 if (!validate_arglist (exp
,
4449 POINTER_TYPE
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
4452 /* If c_strlen can determine an expression for one of the string
4453 lengths, and it doesn't have side effects, then emit cmpstrnsi
4454 using length MIN(strlen(string)+1, arg3). */
4455 insn_code cmpstrn_icode
= direct_optab_handler (cmpstrn_optab
, SImode
);
4456 if (cmpstrn_icode
!= CODE_FOR_nothing
)
4458 tree len
, len1
, len2
, len3
;
4459 rtx arg1_rtx
, arg2_rtx
, arg3_rtx
;
4462 tree arg1
= CALL_EXPR_ARG (exp
, 0);
4463 tree arg2
= CALL_EXPR_ARG (exp
, 1);
4464 tree arg3
= CALL_EXPR_ARG (exp
, 2);
4466 unsigned int arg1_align
= get_pointer_alignment (arg1
) / BITS_PER_UNIT
;
4467 unsigned int arg2_align
= get_pointer_alignment (arg2
) / BITS_PER_UNIT
;
4469 len1
= c_strlen (arg1
, 1);
4470 len2
= c_strlen (arg2
, 1);
4473 len1
= size_binop_loc (loc
, PLUS_EXPR
, ssize_int (1), len1
);
4475 len2
= size_binop_loc (loc
, PLUS_EXPR
, ssize_int (1), len2
);
4477 len3
= fold_convert_loc (loc
, sizetype
, arg3
);
4479 /* If we don't have a constant length for the first, use the length
4480 of the second, if we know it. If neither string is constant length,
4481 use the given length argument. We don't require a constant for
4482 this case; some cost analysis could be done if both are available
4483 but neither is constant. For now, assume they're equally cheap,
4484 unless one has side effects. If both strings have constant lengths,
4493 else if (TREE_SIDE_EFFECTS (len1
))
4495 else if (TREE_SIDE_EFFECTS (len2
))
4497 else if (TREE_CODE (len1
) != INTEGER_CST
)
4499 else if (TREE_CODE (len2
) != INTEGER_CST
)
4501 else if (tree_int_cst_lt (len1
, len2
))
4506 /* If we are not using the given length, we must incorporate it here.
4507 The actual new length parameter will be MIN(len,arg3) in this case. */
4509 len
= fold_build2_loc (loc
, MIN_EXPR
, TREE_TYPE (len
), len
, len3
);
4510 arg1_rtx
= get_memory_rtx (arg1
, len
);
4511 arg2_rtx
= get_memory_rtx (arg2
, len
);
4512 arg3_rtx
= expand_normal (len
);
4513 result
= expand_cmpstrn_or_cmpmem (cmpstrn_icode
, target
, arg1_rtx
,
4514 arg2_rtx
, TREE_TYPE (len
), arg3_rtx
,
4515 MIN (arg1_align
, arg2_align
));
4518 /* Return the value in the proper mode for this function. */
4519 mode
= TYPE_MODE (TREE_TYPE (exp
));
4520 if (GET_MODE (result
) == mode
)
4523 return convert_to_mode (mode
, result
, 0);
4524 convert_move (target
, result
, 0);
4528 /* Expand the library call ourselves using a stabilized argument
4529 list to avoid re-evaluating the function's arguments twice. */
4530 fndecl
= get_callee_fndecl (exp
);
4531 fn
= build_call_nofold_loc (EXPR_LOCATION (exp
), fndecl
, 3,
4533 gcc_assert (TREE_CODE (fn
) == CALL_EXPR
);
4534 CALL_EXPR_TAILCALL (fn
) = CALL_EXPR_TAILCALL (exp
);
4535 return expand_call (fn
, target
, target
== const0_rtx
);
4540 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
4541 if that's convenient. */
4544 expand_builtin_saveregs (void)
4549 /* Don't do __builtin_saveregs more than once in a function.
4550 Save the result of the first call and reuse it. */
4551 if (saveregs_value
!= 0)
4552 return saveregs_value
;
4554 /* When this function is called, it means that registers must be
4555 saved on entry to this function. So we migrate the call to the
4556 first insn of this function. */
4560 /* Do whatever the machine needs done in this case. */
4561 val
= targetm
.calls
.expand_builtin_saveregs ();
4566 saveregs_value
= val
;
4568 /* Put the insns after the NOTE that starts the function. If this
4569 is inside a start_sequence, make the outer-level insn chain current, so
4570 the code is placed at the start of the function. */
4571 push_topmost_sequence ();
4572 emit_insn_after (seq
, entry_of_function ());
4573 pop_topmost_sequence ();
4578 /* Expand a call to __builtin_next_arg. */
4581 expand_builtin_next_arg (void)
4583 /* Checking arguments is already done in fold_builtin_next_arg
4584 that must be called before this function. */
4585 return expand_binop (ptr_mode
, add_optab
,
4586 crtl
->args
.internal_arg_pointer
,
4587 crtl
->args
.arg_offset_rtx
,
4588 NULL_RTX
, 0, OPTAB_LIB_WIDEN
);
4591 /* Make it easier for the backends by protecting the valist argument
4592 from multiple evaluations. */
4595 stabilize_va_list_loc (location_t loc
, tree valist
, int needs_lvalue
)
4597 tree vatype
= targetm
.canonical_va_list_type (TREE_TYPE (valist
));
4599 /* The current way of determining the type of valist is completely
4600 bogus. We should have the information on the va builtin instead. */
4602 vatype
= targetm
.fn_abi_va_list (cfun
->decl
);
4604 if (TREE_CODE (vatype
) == ARRAY_TYPE
)
4606 if (TREE_SIDE_EFFECTS (valist
))
4607 valist
= save_expr (valist
);
4609 /* For this case, the backends will be expecting a pointer to
4610 vatype, but it's possible we've actually been given an array
4611 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
4613 if (TREE_CODE (TREE_TYPE (valist
)) == ARRAY_TYPE
)
4615 tree p1
= build_pointer_type (TREE_TYPE (vatype
));
4616 valist
= build_fold_addr_expr_with_type_loc (loc
, valist
, p1
);
4621 tree pt
= build_pointer_type (vatype
);
4625 if (! TREE_SIDE_EFFECTS (valist
))
4628 valist
= fold_build1_loc (loc
, ADDR_EXPR
, pt
, valist
);
4629 TREE_SIDE_EFFECTS (valist
) = 1;
4632 if (TREE_SIDE_EFFECTS (valist
))
4633 valist
= save_expr (valist
);
4634 valist
= fold_build2_loc (loc
, MEM_REF
,
4635 vatype
, valist
, build_int_cst (pt
, 0));
4641 /* The "standard" definition of va_list is void*. */
4644 std_build_builtin_va_list (void)
4646 return ptr_type_node
;
4649 /* The "standard" abi va_list is va_list_type_node. */
4652 std_fn_abi_va_list (tree fndecl ATTRIBUTE_UNUSED
)
4654 return va_list_type_node
;
4657 /* The "standard" type of va_list is va_list_type_node. */
4660 std_canonical_va_list_type (tree type
)
4664 wtype
= va_list_type_node
;
4667 if (TREE_CODE (wtype
) == ARRAY_TYPE
)
4669 /* If va_list is an array type, the argument may have decayed
4670 to a pointer type, e.g. by being passed to another function.
4671 In that case, unwrap both types so that we can compare the
4672 underlying records. */
4673 if (TREE_CODE (htype
) == ARRAY_TYPE
4674 || POINTER_TYPE_P (htype
))
4676 wtype
= TREE_TYPE (wtype
);
4677 htype
= TREE_TYPE (htype
);
4680 if (TYPE_MAIN_VARIANT (wtype
) == TYPE_MAIN_VARIANT (htype
))
4681 return va_list_type_node
;
4686 /* The "standard" implementation of va_start: just assign `nextarg' to
4690 std_expand_builtin_va_start (tree valist
, rtx nextarg
)
4692 rtx va_r
= expand_expr (valist
, NULL_RTX
, VOIDmode
, EXPAND_WRITE
);
4693 convert_move (va_r
, nextarg
, 0);
4695 /* We do not have any valid bounds for the pointer, so
4696 just store zero bounds for it. */
4697 if (chkp_function_instrumented_p (current_function_decl
))
4698 chkp_expand_bounds_reset_for_mem (valist
,
4699 make_tree (TREE_TYPE (valist
),
4703 /* Expand EXP, a call to __builtin_va_start. */
4706 expand_builtin_va_start (tree exp
)
4710 location_t loc
= EXPR_LOCATION (exp
);
4712 if (call_expr_nargs (exp
) < 2)
4714 error_at (loc
, "too few arguments to function %<va_start%>");
4718 if (fold_builtin_next_arg (exp
, true))
4721 nextarg
= expand_builtin_next_arg ();
4722 valist
= stabilize_va_list_loc (loc
, CALL_EXPR_ARG (exp
, 0), 1);
4724 if (targetm
.expand_builtin_va_start
)
4725 targetm
.expand_builtin_va_start (valist
, nextarg
);
4727 std_expand_builtin_va_start (valist
, nextarg
);
4732 /* Expand EXP, a call to __builtin_va_end. */
4735 expand_builtin_va_end (tree exp
)
4737 tree valist
= CALL_EXPR_ARG (exp
, 0);
4739 /* Evaluate for side effects, if needed. I hate macros that don't
4741 if (TREE_SIDE_EFFECTS (valist
))
4742 expand_expr (valist
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
4747 /* Expand EXP, a call to __builtin_va_copy. We do this as a
4748 builtin rather than just as an assignment in stdarg.h because of the
4749 nastiness of array-type va_list types. */
4752 expand_builtin_va_copy (tree exp
)
4755 location_t loc
= EXPR_LOCATION (exp
);
4757 dst
= CALL_EXPR_ARG (exp
, 0);
4758 src
= CALL_EXPR_ARG (exp
, 1);
4760 dst
= stabilize_va_list_loc (loc
, dst
, 1);
4761 src
= stabilize_va_list_loc (loc
, src
, 0);
4763 gcc_assert (cfun
!= NULL
&& cfun
->decl
!= NULL_TREE
);
4765 if (TREE_CODE (targetm
.fn_abi_va_list (cfun
->decl
)) != ARRAY_TYPE
)
4767 t
= build2 (MODIFY_EXPR
, targetm
.fn_abi_va_list (cfun
->decl
), dst
, src
);
4768 TREE_SIDE_EFFECTS (t
) = 1;
4769 expand_expr (t
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
4773 rtx dstb
, srcb
, size
;
4775 /* Evaluate to pointers. */
4776 dstb
= expand_expr (dst
, NULL_RTX
, Pmode
, EXPAND_NORMAL
);
4777 srcb
= expand_expr (src
, NULL_RTX
, Pmode
, EXPAND_NORMAL
);
4778 size
= expand_expr (TYPE_SIZE_UNIT (targetm
.fn_abi_va_list (cfun
->decl
)),
4779 NULL_RTX
, VOIDmode
, EXPAND_NORMAL
);
4781 dstb
= convert_memory_address (Pmode
, dstb
);
4782 srcb
= convert_memory_address (Pmode
, srcb
);
4784 /* "Dereference" to BLKmode memories. */
4785 dstb
= gen_rtx_MEM (BLKmode
, dstb
);
4786 set_mem_alias_set (dstb
, get_alias_set (TREE_TYPE (TREE_TYPE (dst
))));
4787 set_mem_align (dstb
, TYPE_ALIGN (targetm
.fn_abi_va_list (cfun
->decl
)));
4788 srcb
= gen_rtx_MEM (BLKmode
, srcb
);
4789 set_mem_alias_set (srcb
, get_alias_set (TREE_TYPE (TREE_TYPE (src
))));
4790 set_mem_align (srcb
, TYPE_ALIGN (targetm
.fn_abi_va_list (cfun
->decl
)));
4793 emit_block_move (dstb
, srcb
, size
, BLOCK_OP_NORMAL
);
4799 /* Expand a call to one of the builtin functions __builtin_frame_address or
4800 __builtin_return_address. */
4803 expand_builtin_frame_address (tree fndecl
, tree exp
)
4805 /* The argument must be a nonnegative integer constant.
4806 It counts the number of frames to scan up the stack.
4807 The value is either the frame pointer value or the return
4808 address saved in that frame. */
4809 if (call_expr_nargs (exp
) == 0)
4810 /* Warning about missing arg was already issued. */
4812 else if (! tree_fits_uhwi_p (CALL_EXPR_ARG (exp
, 0)))
4814 error ("invalid argument to %qD", fndecl
);
4819 /* Number of frames to scan up the stack. */
4820 unsigned HOST_WIDE_INT count
= tree_to_uhwi (CALL_EXPR_ARG (exp
, 0));
4822 rtx tem
= expand_builtin_return_addr (DECL_FUNCTION_CODE (fndecl
), count
);
4824 /* Some ports cannot access arbitrary stack frames. */
4827 warning (0, "unsupported argument to %qD", fndecl
);
4833 /* Warn since no effort is made to ensure that any frame
4834 beyond the current one exists or can be safely reached. */
4835 warning (OPT_Wframe_address
, "calling %qD with "
4836 "a nonzero argument is unsafe", fndecl
);
4839 /* For __builtin_frame_address, return what we've got. */
4840 if (DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_FRAME_ADDRESS
)
4844 && ! CONSTANT_P (tem
))
4845 tem
= copy_addr_to_reg (tem
);
4850 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we
4851 failed and the caller should emit a normal call. */
4854 expand_builtin_alloca (tree exp
)
4859 tree fndecl
= get_callee_fndecl (exp
);
4860 bool alloca_with_align
= (DECL_FUNCTION_CODE (fndecl
)
4861 == BUILT_IN_ALLOCA_WITH_ALIGN
);
4862 bool alloca_for_var
= CALL_ALLOCA_FOR_VAR_P (exp
);
4864 = (alloca_with_align
4865 ? validate_arglist (exp
, INTEGER_TYPE
, INTEGER_TYPE
, VOID_TYPE
)
4866 : validate_arglist (exp
, INTEGER_TYPE
, VOID_TYPE
));
4871 if ((alloca_with_align
&& !warn_vla_limit
)
4872 || (!alloca_with_align
&& !warn_alloca_limit
))
4874 /* -Walloca-larger-than and -Wvla-larger-than settings override
4875 the more general -Walloc-size-larger-than so unless either of
4876 the former options is specified check the alloca arguments for
4878 tree args
[] = { CALL_EXPR_ARG (exp
, 0), NULL_TREE
};
4879 int idx
[] = { 0, -1 };
4880 maybe_warn_alloc_args_overflow (fndecl
, exp
, args
, idx
);
4883 /* Compute the argument. */
4884 op0
= expand_normal (CALL_EXPR_ARG (exp
, 0));
4886 /* Compute the alignment. */
4887 align
= (alloca_with_align
4888 ? TREE_INT_CST_LOW (CALL_EXPR_ARG (exp
, 1))
4889 : BIGGEST_ALIGNMENT
);
4891 /* Allocate the desired space. If the allocation stems from the declaration
4892 of a variable-sized object, it cannot accumulate. */
4893 result
= allocate_dynamic_stack_space (op0
, 0, align
, alloca_for_var
);
4894 result
= convert_memory_address (ptr_mode
, result
);
4899 /* Emit a call to __asan_allocas_unpoison call in EXP. Replace second argument
4900 of the call with virtual_stack_dynamic_rtx because in asan pass we emit a
4901 dummy value into second parameter relying on this function to perform the
4902 change. See motivation for this in comment to handle_builtin_stack_restore
4906 expand_asan_emit_allocas_unpoison (tree exp
)
4908 tree arg0
= CALL_EXPR_ARG (exp
, 0);
4909 rtx top
= expand_expr (arg0
, NULL_RTX
, ptr_mode
, EXPAND_NORMAL
);
4910 rtx bot
= convert_memory_address (ptr_mode
, virtual_stack_dynamic_rtx
);
4911 rtx ret
= init_one_libfunc ("__asan_allocas_unpoison");
4912 ret
= emit_library_call_value (ret
, NULL_RTX
, LCT_NORMAL
, ptr_mode
, 2, top
,
4913 ptr_mode
, bot
, ptr_mode
);
4917 /* Expand a call to bswap builtin in EXP.
4918 Return NULL_RTX if a normal call should be emitted rather than expanding the
4919 function in-line. If convenient, the result should be placed in TARGET.
4920 SUBTARGET may be used as the target for computing one of EXP's operands. */
4923 expand_builtin_bswap (machine_mode target_mode
, tree exp
, rtx target
,
4929 if (!validate_arglist (exp
, INTEGER_TYPE
, VOID_TYPE
))
4932 arg
= CALL_EXPR_ARG (exp
, 0);
4933 op0
= expand_expr (arg
,
4934 subtarget
&& GET_MODE (subtarget
) == target_mode
4935 ? subtarget
: NULL_RTX
,
4936 target_mode
, EXPAND_NORMAL
);
4937 if (GET_MODE (op0
) != target_mode
)
4938 op0
= convert_to_mode (target_mode
, op0
, 1);
4940 target
= expand_unop (target_mode
, bswap_optab
, op0
, target
, 1);
4942 gcc_assert (target
);
4944 return convert_to_mode (target_mode
, target
, 1);
4947 /* Expand a call to a unary builtin in EXP.
4948 Return NULL_RTX if a normal call should be emitted rather than expanding the
4949 function in-line. If convenient, the result should be placed in TARGET.
4950 SUBTARGET may be used as the target for computing one of EXP's operands. */
4953 expand_builtin_unop (machine_mode target_mode
, tree exp
, rtx target
,
4954 rtx subtarget
, optab op_optab
)
4958 if (!validate_arglist (exp
, INTEGER_TYPE
, VOID_TYPE
))
4961 /* Compute the argument. */
4962 op0
= expand_expr (CALL_EXPR_ARG (exp
, 0),
4964 && (TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp
, 0)))
4965 == GET_MODE (subtarget
))) ? subtarget
: NULL_RTX
,
4966 VOIDmode
, EXPAND_NORMAL
);
4967 /* Compute op, into TARGET if possible.
4968 Set TARGET to wherever the result comes back. */
4969 target
= expand_unop (TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp
, 0))),
4970 op_optab
, op0
, target
, op_optab
!= clrsb_optab
);
4971 gcc_assert (target
);
4973 return convert_to_mode (target_mode
, target
, 0);
4976 /* Expand a call to __builtin_expect. We just return our argument
4977 as the builtin_expect semantic should've been already executed by
4978 tree branch prediction pass. */
4981 expand_builtin_expect (tree exp
, rtx target
)
4985 if (call_expr_nargs (exp
) < 2)
4987 arg
= CALL_EXPR_ARG (exp
, 0);
4989 target
= expand_expr (arg
, target
, VOIDmode
, EXPAND_NORMAL
);
4990 /* When guessing was done, the hints should be already stripped away. */
4991 gcc_assert (!flag_guess_branch_prob
4992 || optimize
== 0 || seen_error ());
4996 /* Expand a call to __builtin_assume_aligned. We just return our first
4997 argument as the builtin_assume_aligned semantic should've been already
5001 expand_builtin_assume_aligned (tree exp
, rtx target
)
5003 if (call_expr_nargs (exp
) < 2)
5005 target
= expand_expr (CALL_EXPR_ARG (exp
, 0), target
, VOIDmode
,
5007 gcc_assert (!TREE_SIDE_EFFECTS (CALL_EXPR_ARG (exp
, 1))
5008 && (call_expr_nargs (exp
) < 3
5009 || !TREE_SIDE_EFFECTS (CALL_EXPR_ARG (exp
, 2))));
5014 expand_builtin_trap (void)
5016 if (targetm
.have_trap ())
5018 rtx_insn
*insn
= emit_insn (targetm
.gen_trap ());
5019 /* For trap insns when not accumulating outgoing args force
5020 REG_ARGS_SIZE note to prevent crossjumping of calls with
5021 different args sizes. */
5022 if (!ACCUMULATE_OUTGOING_ARGS
)
5023 add_reg_note (insn
, REG_ARGS_SIZE
, GEN_INT (stack_pointer_delta
));
5027 tree fn
= builtin_decl_implicit (BUILT_IN_ABORT
);
5028 tree call_expr
= build_call_expr (fn
, 0);
5029 expand_call (call_expr
, NULL_RTX
, false);
5035 /* Expand a call to __builtin_unreachable. We do nothing except emit
5036 a barrier saying that control flow will not pass here.
5038 It is the responsibility of the program being compiled to ensure
5039 that control flow does never reach __builtin_unreachable. */
5041 expand_builtin_unreachable (void)
5046 /* Expand EXP, a call to fabs, fabsf or fabsl.
5047 Return NULL_RTX if a normal call should be emitted rather than expanding
5048 the function inline. If convenient, the result should be placed
5049 in TARGET. SUBTARGET may be used as the target for computing
5053 expand_builtin_fabs (tree exp
, rtx target
, rtx subtarget
)
5059 if (!validate_arglist (exp
, REAL_TYPE
, VOID_TYPE
))
5062 arg
= CALL_EXPR_ARG (exp
, 0);
5063 CALL_EXPR_ARG (exp
, 0) = arg
= builtin_save_expr (arg
);
5064 mode
= TYPE_MODE (TREE_TYPE (arg
));
5065 op0
= expand_expr (arg
, subtarget
, VOIDmode
, EXPAND_NORMAL
);
5066 return expand_abs (mode
, op0
, target
, 0, safe_from_p (target
, arg
, 1));
5069 /* Expand EXP, a call to copysign, copysignf, or copysignl.
5070 Return NULL is a normal call should be emitted rather than expanding the
5071 function inline. If convenient, the result should be placed in TARGET.
5072 SUBTARGET may be used as the target for computing the operand. */
5075 expand_builtin_copysign (tree exp
, rtx target
, rtx subtarget
)
5080 if (!validate_arglist (exp
, REAL_TYPE
, REAL_TYPE
, VOID_TYPE
))
5083 arg
= CALL_EXPR_ARG (exp
, 0);
5084 op0
= expand_expr (arg
, subtarget
, VOIDmode
, EXPAND_NORMAL
);
5086 arg
= CALL_EXPR_ARG (exp
, 1);
5087 op1
= expand_normal (arg
);
5089 return expand_copysign (op0
, op1
, target
);
5092 /* Expand a call to __builtin___clear_cache. */
5095 expand_builtin___clear_cache (tree exp
)
5097 if (!targetm
.code_for_clear_cache
)
5099 #ifdef CLEAR_INSN_CACHE
5100 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5101 does something. Just do the default expansion to a call to
5105 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5106 does nothing. There is no need to call it. Do nothing. */
5108 #endif /* CLEAR_INSN_CACHE */
5111 /* We have a "clear_cache" insn, and it will handle everything. */
5113 rtx begin_rtx
, end_rtx
;
5115 /* We must not expand to a library call. If we did, any
5116 fallback library function in libgcc that might contain a call to
5117 __builtin___clear_cache() would recurse infinitely. */
5118 if (!validate_arglist (exp
, POINTER_TYPE
, POINTER_TYPE
, VOID_TYPE
))
5120 error ("both arguments to %<__builtin___clear_cache%> must be pointers");
5124 if (targetm
.have_clear_cache ())
5126 struct expand_operand ops
[2];
5128 begin
= CALL_EXPR_ARG (exp
, 0);
5129 begin_rtx
= expand_expr (begin
, NULL_RTX
, Pmode
, EXPAND_NORMAL
);
5131 end
= CALL_EXPR_ARG (exp
, 1);
5132 end_rtx
= expand_expr (end
, NULL_RTX
, Pmode
, EXPAND_NORMAL
);
5134 create_address_operand (&ops
[0], begin_rtx
);
5135 create_address_operand (&ops
[1], end_rtx
);
5136 if (maybe_expand_insn (targetm
.code_for_clear_cache
, 2, ops
))
5142 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
5145 round_trampoline_addr (rtx tramp
)
5147 rtx temp
, addend
, mask
;
5149 /* If we don't need too much alignment, we'll have been guaranteed
5150 proper alignment by get_trampoline_type. */
5151 if (TRAMPOLINE_ALIGNMENT
<= STACK_BOUNDARY
)
5154 /* Round address up to desired boundary. */
5155 temp
= gen_reg_rtx (Pmode
);
5156 addend
= gen_int_mode (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
- 1, Pmode
);
5157 mask
= gen_int_mode (-TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
, Pmode
);
5159 temp
= expand_simple_binop (Pmode
, PLUS
, tramp
, addend
,
5160 temp
, 0, OPTAB_LIB_WIDEN
);
5161 tramp
= expand_simple_binop (Pmode
, AND
, temp
, mask
,
5162 temp
, 0, OPTAB_LIB_WIDEN
);
5168 expand_builtin_init_trampoline (tree exp
, bool onstack
)
5170 tree t_tramp
, t_func
, t_chain
;
5171 rtx m_tramp
, r_tramp
, r_chain
, tmp
;
5173 if (!validate_arglist (exp
, POINTER_TYPE
, POINTER_TYPE
,
5174 POINTER_TYPE
, VOID_TYPE
))
5177 t_tramp
= CALL_EXPR_ARG (exp
, 0);
5178 t_func
= CALL_EXPR_ARG (exp
, 1);
5179 t_chain
= CALL_EXPR_ARG (exp
, 2);
5181 r_tramp
= expand_normal (t_tramp
);
5182 m_tramp
= gen_rtx_MEM (BLKmode
, r_tramp
);
5183 MEM_NOTRAP_P (m_tramp
) = 1;
5185 /* If ONSTACK, the TRAMP argument should be the address of a field
5186 within the local function's FRAME decl. Either way, let's see if
5187 we can fill in the MEM_ATTRs for this memory. */
5188 if (TREE_CODE (t_tramp
) == ADDR_EXPR
)
5189 set_mem_attributes (m_tramp
, TREE_OPERAND (t_tramp
, 0), true);
5191 /* Creator of a heap trampoline is responsible for making sure the
5192 address is aligned to at least STACK_BOUNDARY. Normally malloc
5193 will ensure this anyhow. */
5194 tmp
= round_trampoline_addr (r_tramp
);
5197 m_tramp
= change_address (m_tramp
, BLKmode
, tmp
);
5198 set_mem_align (m_tramp
, TRAMPOLINE_ALIGNMENT
);
5199 set_mem_size (m_tramp
, TRAMPOLINE_SIZE
);
5202 /* The FUNC argument should be the address of the nested function.
5203 Extract the actual function decl to pass to the hook. */
5204 gcc_assert (TREE_CODE (t_func
) == ADDR_EXPR
);
5205 t_func
= TREE_OPERAND (t_func
, 0);
5206 gcc_assert (TREE_CODE (t_func
) == FUNCTION_DECL
);
5208 r_chain
= expand_normal (t_chain
);
5210 /* Generate insns to initialize the trampoline. */
5211 targetm
.calls
.trampoline_init (m_tramp
, t_func
, r_chain
);
5215 trampolines_created
= 1;
5217 if (targetm
.calls
.custom_function_descriptors
!= 0)
5218 warning_at (DECL_SOURCE_LOCATION (t_func
), OPT_Wtrampolines
,
5219 "trampoline generated for nested function %qD", t_func
);
5226 expand_builtin_adjust_trampoline (tree exp
)
5230 if (!validate_arglist (exp
, POINTER_TYPE
, VOID_TYPE
))
5233 tramp
= expand_normal (CALL_EXPR_ARG (exp
, 0));
5234 tramp
= round_trampoline_addr (tramp
);
5235 if (targetm
.calls
.trampoline_adjust_address
)
5236 tramp
= targetm
.calls
.trampoline_adjust_address (tramp
);
5241 /* Expand a call to the builtin descriptor initialization routine.
5242 A descriptor is made up of a couple of pointers to the static
5243 chain and the code entry in this order. */
5246 expand_builtin_init_descriptor (tree exp
)
5248 tree t_descr
, t_func
, t_chain
;
5249 rtx m_descr
, r_descr
, r_func
, r_chain
;
5251 if (!validate_arglist (exp
, POINTER_TYPE
, POINTER_TYPE
, POINTER_TYPE
,
5255 t_descr
= CALL_EXPR_ARG (exp
, 0);
5256 t_func
= CALL_EXPR_ARG (exp
, 1);
5257 t_chain
= CALL_EXPR_ARG (exp
, 2);
5259 r_descr
= expand_normal (t_descr
);
5260 m_descr
= gen_rtx_MEM (BLKmode
, r_descr
);
5261 MEM_NOTRAP_P (m_descr
) = 1;
5263 r_func
= expand_normal (t_func
);
5264 r_chain
= expand_normal (t_chain
);
5266 /* Generate insns to initialize the descriptor. */
5267 emit_move_insn (adjust_address_nv (m_descr
, ptr_mode
, 0), r_chain
);
5268 emit_move_insn (adjust_address_nv (m_descr
, ptr_mode
,
5269 POINTER_SIZE
/ BITS_PER_UNIT
), r_func
);
5274 /* Expand a call to the builtin descriptor adjustment routine. */
5277 expand_builtin_adjust_descriptor (tree exp
)
5281 if (!validate_arglist (exp
, POINTER_TYPE
, VOID_TYPE
))
5284 tramp
= expand_normal (CALL_EXPR_ARG (exp
, 0));
5286 /* Unalign the descriptor to allow runtime identification. */
5287 tramp
= plus_constant (ptr_mode
, tramp
,
5288 targetm
.calls
.custom_function_descriptors
);
5290 return force_operand (tramp
, NULL_RTX
);
5293 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
5294 function. The function first checks whether the back end provides
5295 an insn to implement signbit for the respective mode. If not, it
5296 checks whether the floating point format of the value is such that
5297 the sign bit can be extracted. If that is not the case, error out.
5298 EXP is the expression that is a call to the builtin function; if
5299 convenient, the result should be placed in TARGET. */
5301 expand_builtin_signbit (tree exp
, rtx target
)
5303 const struct real_format
*fmt
;
5304 machine_mode fmode
, imode
, rmode
;
5307 enum insn_code icode
;
5309 location_t loc
= EXPR_LOCATION (exp
);
5311 if (!validate_arglist (exp
, REAL_TYPE
, VOID_TYPE
))
5314 arg
= CALL_EXPR_ARG (exp
, 0);
5315 fmode
= TYPE_MODE (TREE_TYPE (arg
));
5316 rmode
= TYPE_MODE (TREE_TYPE (exp
));
5317 fmt
= REAL_MODE_FORMAT (fmode
);
5319 arg
= builtin_save_expr (arg
);
5321 /* Expand the argument yielding a RTX expression. */
5322 temp
= expand_normal (arg
);
5324 /* Check if the back end provides an insn that handles signbit for the
5326 icode
= optab_handler (signbit_optab
, fmode
);
5327 if (icode
!= CODE_FOR_nothing
)
5329 rtx_insn
*last
= get_last_insn ();
5330 target
= gen_reg_rtx (TYPE_MODE (TREE_TYPE (exp
)));
5331 if (maybe_emit_unop_insn (icode
, target
, temp
, UNKNOWN
))
5333 delete_insns_since (last
);
5336 /* For floating point formats without a sign bit, implement signbit
5338 bitpos
= fmt
->signbit_ro
;
5341 /* But we can't do this if the format supports signed zero. */
5342 gcc_assert (!fmt
->has_signed_zero
|| !HONOR_SIGNED_ZEROS (fmode
));
5344 arg
= fold_build2_loc (loc
, LT_EXPR
, TREE_TYPE (exp
), arg
,
5345 build_real (TREE_TYPE (arg
), dconst0
));
5346 return expand_expr (arg
, target
, VOIDmode
, EXPAND_NORMAL
);
5349 if (GET_MODE_SIZE (fmode
) <= UNITS_PER_WORD
)
5351 imode
= int_mode_for_mode (fmode
);
5352 gcc_assert (imode
!= BLKmode
);
5353 temp
= gen_lowpart (imode
, temp
);
5358 /* Handle targets with different FP word orders. */
5359 if (FLOAT_WORDS_BIG_ENDIAN
)
5360 word
= (GET_MODE_BITSIZE (fmode
) - bitpos
) / BITS_PER_WORD
;
5362 word
= bitpos
/ BITS_PER_WORD
;
5363 temp
= operand_subword_force (temp
, word
, fmode
);
5364 bitpos
= bitpos
% BITS_PER_WORD
;
5367 /* Force the intermediate word_mode (or narrower) result into a
5368 register. This avoids attempting to create paradoxical SUBREGs
5369 of floating point modes below. */
5370 temp
= force_reg (imode
, temp
);
5372 /* If the bitpos is within the "result mode" lowpart, the operation
5373 can be implement with a single bitwise AND. Otherwise, we need
5374 a right shift and an AND. */
5376 if (bitpos
< GET_MODE_BITSIZE (rmode
))
5378 wide_int mask
= wi::set_bit_in_zero (bitpos
, GET_MODE_PRECISION (rmode
));
5380 if (GET_MODE_SIZE (imode
) > GET_MODE_SIZE (rmode
))
5381 temp
= gen_lowpart (rmode
, temp
);
5382 temp
= expand_binop (rmode
, and_optab
, temp
,
5383 immed_wide_int_const (mask
, rmode
),
5384 NULL_RTX
, 1, OPTAB_LIB_WIDEN
);
5388 /* Perform a logical right shift to place the signbit in the least
5389 significant bit, then truncate the result to the desired mode
5390 and mask just this bit. */
5391 temp
= expand_shift (RSHIFT_EXPR
, imode
, temp
, bitpos
, NULL_RTX
, 1);
5392 temp
= gen_lowpart (rmode
, temp
);
5393 temp
= expand_binop (rmode
, and_optab
, temp
, const1_rtx
,
5394 NULL_RTX
, 1, OPTAB_LIB_WIDEN
);
5400 /* Expand fork or exec calls. TARGET is the desired target of the
5401 call. EXP is the call. FN is the
5402 identificator of the actual function. IGNORE is nonzero if the
5403 value is to be ignored. */
5406 expand_builtin_fork_or_exec (tree fn
, tree exp
, rtx target
, int ignore
)
5411 /* If we are not profiling, just call the function. */
5412 if (!profile_arc_flag
)
5415 /* Otherwise call the wrapper. This should be equivalent for the rest of
5416 compiler, so the code does not diverge, and the wrapper may run the
5417 code necessary for keeping the profiling sane. */
5419 switch (DECL_FUNCTION_CODE (fn
))
5422 id
= get_identifier ("__gcov_fork");
5425 case BUILT_IN_EXECL
:
5426 id
= get_identifier ("__gcov_execl");
5429 case BUILT_IN_EXECV
:
5430 id
= get_identifier ("__gcov_execv");
5433 case BUILT_IN_EXECLP
:
5434 id
= get_identifier ("__gcov_execlp");
5437 case BUILT_IN_EXECLE
:
5438 id
= get_identifier ("__gcov_execle");
5441 case BUILT_IN_EXECVP
:
5442 id
= get_identifier ("__gcov_execvp");
5445 case BUILT_IN_EXECVE
:
5446 id
= get_identifier ("__gcov_execve");
5453 decl
= build_decl (DECL_SOURCE_LOCATION (fn
),
5454 FUNCTION_DECL
, id
, TREE_TYPE (fn
));
5455 DECL_EXTERNAL (decl
) = 1;
5456 TREE_PUBLIC (decl
) = 1;
5457 DECL_ARTIFICIAL (decl
) = 1;
5458 TREE_NOTHROW (decl
) = 1;
5459 DECL_VISIBILITY (decl
) = VISIBILITY_DEFAULT
;
5460 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
5461 call
= rewrite_call_expr (EXPR_LOCATION (exp
), exp
, 0, decl
, 0);
5462 return expand_call (call
, target
, ignore
);
5467 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
5468 the pointer in these functions is void*, the tree optimizers may remove
5469 casts. The mode computed in expand_builtin isn't reliable either, due
5470 to __sync_bool_compare_and_swap.
5472 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
5473 group of builtins. This gives us log2 of the mode size. */
5475 static inline machine_mode
5476 get_builtin_sync_mode (int fcode_diff
)
5478 /* The size is not negotiable, so ask not to get BLKmode in return
5479 if the target indicates that a smaller size would be better. */
5480 return mode_for_size (BITS_PER_UNIT
<< fcode_diff
, MODE_INT
, 0);
5483 /* Expand the memory expression LOC and return the appropriate memory operand
5484 for the builtin_sync operations. */
5487 get_builtin_sync_mem (tree loc
, machine_mode mode
)
5491 addr
= expand_expr (loc
, NULL_RTX
, ptr_mode
, EXPAND_SUM
);
5492 addr
= convert_memory_address (Pmode
, addr
);
5494 /* Note that we explicitly do not want any alias information for this
5495 memory, so that we kill all other live memories. Otherwise we don't
5496 satisfy the full barrier semantics of the intrinsic. */
5497 mem
= validize_mem (gen_rtx_MEM (mode
, addr
));
5499 /* The alignment needs to be at least according to that of the mode. */
5500 set_mem_align (mem
, MAX (GET_MODE_ALIGNMENT (mode
),
5501 get_pointer_alignment (loc
)));
5502 set_mem_alias_set (mem
, ALIAS_SET_MEMORY_BARRIER
);
5503 MEM_VOLATILE_P (mem
) = 1;
5508 /* Make sure an argument is in the right mode.
5509 EXP is the tree argument.
5510 MODE is the mode it should be in. */
5513 expand_expr_force_mode (tree exp
, machine_mode mode
)
5516 machine_mode old_mode
;
5518 val
= expand_expr (exp
, NULL_RTX
, mode
, EXPAND_NORMAL
);
5519 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5520 of CONST_INTs, where we know the old_mode only from the call argument. */
5522 old_mode
= GET_MODE (val
);
5523 if (old_mode
== VOIDmode
)
5524 old_mode
= TYPE_MODE (TREE_TYPE (exp
));
5525 val
= convert_modes (mode
, old_mode
, val
, 1);
5530 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
5531 EXP is the CALL_EXPR. CODE is the rtx code
5532 that corresponds to the arithmetic or logical operation from the name;
5533 an exception here is that NOT actually means NAND. TARGET is an optional
5534 place for us to store the results; AFTER is true if this is the
5535 fetch_and_xxx form. */
5538 expand_builtin_sync_operation (machine_mode mode
, tree exp
,
5539 enum rtx_code code
, bool after
,
5543 location_t loc
= EXPR_LOCATION (exp
);
5545 if (code
== NOT
&& warn_sync_nand
)
5547 tree fndecl
= get_callee_fndecl (exp
);
5548 enum built_in_function fcode
= DECL_FUNCTION_CODE (fndecl
);
5550 static bool warned_f_a_n
, warned_n_a_f
;
5554 case BUILT_IN_SYNC_FETCH_AND_NAND_1
:
5555 case BUILT_IN_SYNC_FETCH_AND_NAND_2
:
5556 case BUILT_IN_SYNC_FETCH_AND_NAND_4
:
5557 case BUILT_IN_SYNC_FETCH_AND_NAND_8
:
5558 case BUILT_IN_SYNC_FETCH_AND_NAND_16
:
5562 fndecl
= builtin_decl_implicit (BUILT_IN_SYNC_FETCH_AND_NAND_N
);
5563 inform (loc
, "%qD changed semantics in GCC 4.4", fndecl
);
5564 warned_f_a_n
= true;
5567 case BUILT_IN_SYNC_NAND_AND_FETCH_1
:
5568 case BUILT_IN_SYNC_NAND_AND_FETCH_2
:
5569 case BUILT_IN_SYNC_NAND_AND_FETCH_4
:
5570 case BUILT_IN_SYNC_NAND_AND_FETCH_8
:
5571 case BUILT_IN_SYNC_NAND_AND_FETCH_16
:
5575 fndecl
= builtin_decl_implicit (BUILT_IN_SYNC_NAND_AND_FETCH_N
);
5576 inform (loc
, "%qD changed semantics in GCC 4.4", fndecl
);
5577 warned_n_a_f
= true;
5585 /* Expand the operands. */
5586 mem
= get_builtin_sync_mem (CALL_EXPR_ARG (exp
, 0), mode
);
5587 val
= expand_expr_force_mode (CALL_EXPR_ARG (exp
, 1), mode
);
5589 return expand_atomic_fetch_op (target
, mem
, val
, code
, MEMMODEL_SYNC_SEQ_CST
,
5593 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
5594 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
5595 true if this is the boolean form. TARGET is a place for us to store the
5596 results; this is NOT optional if IS_BOOL is true. */
5599 expand_builtin_compare_and_swap (machine_mode mode
, tree exp
,
5600 bool is_bool
, rtx target
)
5602 rtx old_val
, new_val
, mem
;
5605 /* Expand the operands. */
5606 mem
= get_builtin_sync_mem (CALL_EXPR_ARG (exp
, 0), mode
);
5607 old_val
= expand_expr_force_mode (CALL_EXPR_ARG (exp
, 1), mode
);
5608 new_val
= expand_expr_force_mode (CALL_EXPR_ARG (exp
, 2), mode
);
5610 pbool
= poval
= NULL
;
5611 if (target
!= const0_rtx
)
5618 if (!expand_atomic_compare_and_swap (pbool
, poval
, mem
, old_val
, new_val
,
5619 false, MEMMODEL_SYNC_SEQ_CST
,
5620 MEMMODEL_SYNC_SEQ_CST
))
5626 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
5627 general form is actually an atomic exchange, and some targets only
5628 support a reduced form with the second argument being a constant 1.
5629 EXP is the CALL_EXPR; TARGET is an optional place for us to store
5633 expand_builtin_sync_lock_test_and_set (machine_mode mode
, tree exp
,
5638 /* Expand the operands. */
5639 mem
= get_builtin_sync_mem (CALL_EXPR_ARG (exp
, 0), mode
);
5640 val
= expand_expr_force_mode (CALL_EXPR_ARG (exp
, 1), mode
);
5642 return expand_sync_lock_test_and_set (target
, mem
, val
);
5645 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
5648 expand_builtin_sync_lock_release (machine_mode mode
, tree exp
)
5652 /* Expand the operands. */
5653 mem
= get_builtin_sync_mem (CALL_EXPR_ARG (exp
, 0), mode
);
5655 expand_atomic_store (mem
, const0_rtx
, MEMMODEL_SYNC_RELEASE
, true);
5658 /* Given an integer representing an ``enum memmodel'', verify its
5659 correctness and return the memory model enum. */
5661 static enum memmodel
5662 get_memmodel (tree exp
)
5665 unsigned HOST_WIDE_INT val
;
5667 = expansion_point_location_if_in_system_header (input_location
);
5669 /* If the parameter is not a constant, it's a run time value so we'll just
5670 convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking. */
5671 if (TREE_CODE (exp
) != INTEGER_CST
)
5672 return MEMMODEL_SEQ_CST
;
5674 op
= expand_normal (exp
);
5677 if (targetm
.memmodel_check
)
5678 val
= targetm
.memmodel_check (val
);
5679 else if (val
& ~MEMMODEL_MASK
)
5681 warning_at (loc
, OPT_Winvalid_memory_model
,
5682 "unknown architecture specifier in memory model to builtin");
5683 return MEMMODEL_SEQ_CST
;
5686 /* Should never see a user explicit SYNC memodel model, so >= LAST works. */
5687 if (memmodel_base (val
) >= MEMMODEL_LAST
)
5689 warning_at (loc
, OPT_Winvalid_memory_model
,
5690 "invalid memory model argument to builtin");
5691 return MEMMODEL_SEQ_CST
;
5694 /* Workaround for Bugzilla 59448. GCC doesn't track consume properly, so
5695 be conservative and promote consume to acquire. */
5696 if (val
== MEMMODEL_CONSUME
)
5697 val
= MEMMODEL_ACQUIRE
;
5699 return (enum memmodel
) val
;
5702 /* Expand the __atomic_exchange intrinsic:
5703 TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel)
5704 EXP is the CALL_EXPR.
5705 TARGET is an optional place for us to store the results. */
5708 expand_builtin_atomic_exchange (machine_mode mode
, tree exp
, rtx target
)
5711 enum memmodel model
;
5713 model
= get_memmodel (CALL_EXPR_ARG (exp
, 2));
5715 if (!flag_inline_atomics
)
5718 /* Expand the operands. */
5719 mem
= get_builtin_sync_mem (CALL_EXPR_ARG (exp
, 0), mode
);
5720 val
= expand_expr_force_mode (CALL_EXPR_ARG (exp
, 1), mode
);
5722 return expand_atomic_exchange (target
, mem
, val
, model
);
5725 /* Expand the __atomic_compare_exchange intrinsic:
5726 bool __atomic_compare_exchange (TYPE *object, TYPE *expect,
5727 TYPE desired, BOOL weak,
5728 enum memmodel success,
5729 enum memmodel failure)
5730 EXP is the CALL_EXPR.
5731 TARGET is an optional place for us to store the results. */
5734 expand_builtin_atomic_compare_exchange (machine_mode mode
, tree exp
,
5737 rtx expect
, desired
, mem
, oldval
;
5738 rtx_code_label
*label
;
5739 enum memmodel success
, failure
;
5743 = expansion_point_location_if_in_system_header (input_location
);
5745 success
= get_memmodel (CALL_EXPR_ARG (exp
, 4));
5746 failure
= get_memmodel (CALL_EXPR_ARG (exp
, 5));
5748 if (failure
> success
)
5750 warning_at (loc
, OPT_Winvalid_memory_model
,
5751 "failure memory model cannot be stronger than success "
5752 "memory model for %<__atomic_compare_exchange%>");
5753 success
= MEMMODEL_SEQ_CST
;
5756 if (is_mm_release (failure
) || is_mm_acq_rel (failure
))
5758 warning_at (loc
, OPT_Winvalid_memory_model
,
5759 "invalid failure memory model for "
5760 "%<__atomic_compare_exchange%>");
5761 failure
= MEMMODEL_SEQ_CST
;
5762 success
= MEMMODEL_SEQ_CST
;
5766 if (!flag_inline_atomics
)
5769 /* Expand the operands. */
5770 mem
= get_builtin_sync_mem (CALL_EXPR_ARG (exp
, 0), mode
);
5772 expect
= expand_normal (CALL_EXPR_ARG (exp
, 1));
5773 expect
= convert_memory_address (Pmode
, expect
);
5774 expect
= gen_rtx_MEM (mode
, expect
);
5775 desired
= expand_expr_force_mode (CALL_EXPR_ARG (exp
, 2), mode
);
5777 weak
= CALL_EXPR_ARG (exp
, 3);
5779 if (tree_fits_shwi_p (weak
) && tree_to_shwi (weak
) != 0)
5782 if (target
== const0_rtx
)
5785 /* Lest the rtl backend create a race condition with an imporoper store
5786 to memory, always create a new pseudo for OLDVAL. */
5789 if (!expand_atomic_compare_and_swap (&target
, &oldval
, mem
, expect
, desired
,
5790 is_weak
, success
, failure
))
5793 /* Conditionally store back to EXPECT, lest we create a race condition
5794 with an improper store to memory. */
5795 /* ??? With a rearrangement of atomics at the gimple level, we can handle
5796 the normal case where EXPECT is totally private, i.e. a register. At
5797 which point the store can be unconditional. */
5798 label
= gen_label_rtx ();
5799 emit_cmp_and_jump_insns (target
, const0_rtx
, NE
, NULL
,
5800 GET_MODE (target
), 1, label
);
5801 emit_move_insn (expect
, oldval
);
5807 /* Helper function for expand_ifn_atomic_compare_exchange - expand
5808 internal ATOMIC_COMPARE_EXCHANGE call into __atomic_compare_exchange_N
5809 call. The weak parameter must be dropped to match the expected parameter
5810 list and the expected argument changed from value to pointer to memory
5814 expand_ifn_atomic_compare_exchange_into_call (gcall
*call
, machine_mode mode
)
5817 vec
<tree
, va_gc
> *vec
;
5820 vec
->quick_push (gimple_call_arg (call
, 0));
5821 tree expected
= gimple_call_arg (call
, 1);
5822 rtx x
= assign_stack_temp_for_type (mode
, GET_MODE_SIZE (mode
),
5823 TREE_TYPE (expected
));
5824 rtx expd
= expand_expr (expected
, x
, mode
, EXPAND_NORMAL
);
5826 emit_move_insn (x
, expd
);
5827 tree v
= make_tree (TREE_TYPE (expected
), x
);
5828 vec
->quick_push (build1 (ADDR_EXPR
,
5829 build_pointer_type (TREE_TYPE (expected
)), v
));
5830 vec
->quick_push (gimple_call_arg (call
, 2));
5831 /* Skip the boolean weak parameter. */
5832 for (z
= 4; z
< 6; z
++)
5833 vec
->quick_push (gimple_call_arg (call
, z
));
5834 built_in_function fncode
5835 = (built_in_function
) ((int) BUILT_IN_ATOMIC_COMPARE_EXCHANGE_1
5836 + exact_log2 (GET_MODE_SIZE (mode
)));
5837 tree fndecl
= builtin_decl_explicit (fncode
);
5838 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (fndecl
)),
5840 tree exp
= build_call_vec (boolean_type_node
, fn
, vec
);
5841 tree lhs
= gimple_call_lhs (call
);
5842 rtx boolret
= expand_call (exp
, NULL_RTX
, lhs
== NULL_TREE
);
5845 rtx target
= expand_expr (lhs
, NULL_RTX
, VOIDmode
, EXPAND_WRITE
);
5846 if (GET_MODE (boolret
) != mode
)
5847 boolret
= convert_modes (mode
, GET_MODE (boolret
), boolret
, 1);
5848 x
= force_reg (mode
, x
);
5849 write_complex_part (target
, boolret
, true);
5850 write_complex_part (target
, x
, false);
5854 /* Expand IFN_ATOMIC_COMPARE_EXCHANGE internal function. */
5857 expand_ifn_atomic_compare_exchange (gcall
*call
)
5859 int size
= tree_to_shwi (gimple_call_arg (call
, 3)) & 255;
5860 gcc_assert (size
== 1 || size
== 2 || size
== 4 || size
== 8 || size
== 16);
5861 machine_mode mode
= mode_for_size (BITS_PER_UNIT
* size
, MODE_INT
, 0);
5862 rtx expect
, desired
, mem
, oldval
, boolret
;
5863 enum memmodel success
, failure
;
5867 = expansion_point_location_if_in_system_header (gimple_location (call
));
5869 success
= get_memmodel (gimple_call_arg (call
, 4));
5870 failure
= get_memmodel (gimple_call_arg (call
, 5));
5872 if (failure
> success
)
5874 warning_at (loc
, OPT_Winvalid_memory_model
,
5875 "failure memory model cannot be stronger than success "
5876 "memory model for %<__atomic_compare_exchange%>");
5877 success
= MEMMODEL_SEQ_CST
;
5880 if (is_mm_release (failure
) || is_mm_acq_rel (failure
))
5882 warning_at (loc
, OPT_Winvalid_memory_model
,
5883 "invalid failure memory model for "
5884 "%<__atomic_compare_exchange%>");
5885 failure
= MEMMODEL_SEQ_CST
;
5886 success
= MEMMODEL_SEQ_CST
;
5889 if (!flag_inline_atomics
)
5891 expand_ifn_atomic_compare_exchange_into_call (call
, mode
);
5895 /* Expand the operands. */
5896 mem
= get_builtin_sync_mem (gimple_call_arg (call
, 0), mode
);
5898 expect
= expand_expr_force_mode (gimple_call_arg (call
, 1), mode
);
5899 desired
= expand_expr_force_mode (gimple_call_arg (call
, 2), mode
);
5901 is_weak
= (tree_to_shwi (gimple_call_arg (call
, 3)) & 256) != 0;
5906 if (!expand_atomic_compare_and_swap (&boolret
, &oldval
, mem
, expect
, desired
,
5907 is_weak
, success
, failure
))
5909 expand_ifn_atomic_compare_exchange_into_call (call
, mode
);
5913 lhs
= gimple_call_lhs (call
);
5916 rtx target
= expand_expr (lhs
, NULL_RTX
, VOIDmode
, EXPAND_WRITE
);
5917 if (GET_MODE (boolret
) != mode
)
5918 boolret
= convert_modes (mode
, GET_MODE (boolret
), boolret
, 1);
5919 write_complex_part (target
, boolret
, true);
5920 write_complex_part (target
, oldval
, false);
5924 /* Expand the __atomic_load intrinsic:
5925 TYPE __atomic_load (TYPE *object, enum memmodel)
5926 EXP is the CALL_EXPR.
5927 TARGET is an optional place for us to store the results. */
5930 expand_builtin_atomic_load (machine_mode mode
, tree exp
, rtx target
)
5933 enum memmodel model
;
5935 model
= get_memmodel (CALL_EXPR_ARG (exp
, 1));
5936 if (is_mm_release (model
) || is_mm_acq_rel (model
))
5939 = expansion_point_location_if_in_system_header (input_location
);
5940 warning_at (loc
, OPT_Winvalid_memory_model
,
5941 "invalid memory model for %<__atomic_load%>");
5942 model
= MEMMODEL_SEQ_CST
;
5945 if (!flag_inline_atomics
)
5948 /* Expand the operand. */
5949 mem
= get_builtin_sync_mem (CALL_EXPR_ARG (exp
, 0), mode
);
5951 return expand_atomic_load (target
, mem
, model
);
5955 /* Expand the __atomic_store intrinsic:
5956 void __atomic_store (TYPE *object, TYPE desired, enum memmodel)
5957 EXP is the CALL_EXPR.
5958 TARGET is an optional place for us to store the results. */
5961 expand_builtin_atomic_store (machine_mode mode
, tree exp
)
5964 enum memmodel model
;
5966 model
= get_memmodel (CALL_EXPR_ARG (exp
, 2));
5967 if (!(is_mm_relaxed (model
) || is_mm_seq_cst (model
)
5968 || is_mm_release (model
)))
5971 = expansion_point_location_if_in_system_header (input_location
);
5972 warning_at (loc
, OPT_Winvalid_memory_model
,
5973 "invalid memory model for %<__atomic_store%>");
5974 model
= MEMMODEL_SEQ_CST
;
5977 if (!flag_inline_atomics
)
5980 /* Expand the operands. */
5981 mem
= get_builtin_sync_mem (CALL_EXPR_ARG (exp
, 0), mode
);
5982 val
= expand_expr_force_mode (CALL_EXPR_ARG (exp
, 1), mode
);
5984 return expand_atomic_store (mem
, val
, model
, false);
5987 /* Expand the __atomic_fetch_XXX intrinsic:
5988 TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel)
5989 EXP is the CALL_EXPR.
5990 TARGET is an optional place for us to store the results.
5991 CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR.
5992 FETCH_AFTER is true if returning the result of the operation.
5993 FETCH_AFTER is false if returning the value before the operation.
5994 IGNORE is true if the result is not used.
5995 EXT_CALL is the correct builtin for an external call if this cannot be
5996 resolved to an instruction sequence. */
5999 expand_builtin_atomic_fetch_op (machine_mode mode
, tree exp
, rtx target
,
6000 enum rtx_code code
, bool fetch_after
,
6001 bool ignore
, enum built_in_function ext_call
)
6004 enum memmodel model
;
6008 model
= get_memmodel (CALL_EXPR_ARG (exp
, 2));
6010 /* Expand the operands. */
6011 mem
= get_builtin_sync_mem (CALL_EXPR_ARG (exp
, 0), mode
);
6012 val
= expand_expr_force_mode (CALL_EXPR_ARG (exp
, 1), mode
);
6014 /* Only try generating instructions if inlining is turned on. */
6015 if (flag_inline_atomics
)
6017 ret
= expand_atomic_fetch_op (target
, mem
, val
, code
, model
, fetch_after
);
6022 /* Return if a different routine isn't needed for the library call. */
6023 if (ext_call
== BUILT_IN_NONE
)
6026 /* Change the call to the specified function. */
6027 fndecl
= get_callee_fndecl (exp
);
6028 addr
= CALL_EXPR_FN (exp
);
6031 gcc_assert (TREE_OPERAND (addr
, 0) == fndecl
);
6032 TREE_OPERAND (addr
, 0) = builtin_decl_explicit (ext_call
);
6034 /* If we will emit code after the call, the call can not be a tail call.
6035 If it is emitted as a tail call, a barrier is emitted after it, and
6036 then all trailing code is removed. */
6038 CALL_EXPR_TAILCALL (exp
) = 0;
6040 /* Expand the call here so we can emit trailing code. */
6041 ret
= expand_call (exp
, target
, ignore
);
6043 /* Replace the original function just in case it matters. */
6044 TREE_OPERAND (addr
, 0) = fndecl
;
6046 /* Then issue the arithmetic correction to return the right result. */
6051 ret
= expand_simple_binop (mode
, AND
, ret
, val
, NULL_RTX
, true,
6053 ret
= expand_simple_unop (mode
, NOT
, ret
, target
, true);
6056 ret
= expand_simple_binop (mode
, code
, ret
, val
, target
, true,
6062 /* Expand IFN_ATOMIC_BIT_TEST_AND_* internal function. */
6065 expand_ifn_atomic_bit_test_and (gcall
*call
)
6067 tree ptr
= gimple_call_arg (call
, 0);
6068 tree bit
= gimple_call_arg (call
, 1);
6069 tree flag
= gimple_call_arg (call
, 2);
6070 tree lhs
= gimple_call_lhs (call
);
6071 enum memmodel model
= MEMMODEL_SYNC_SEQ_CST
;
6072 machine_mode mode
= TYPE_MODE (TREE_TYPE (flag
));
6075 struct expand_operand ops
[5];
6077 gcc_assert (flag_inline_atomics
);
6079 if (gimple_call_num_args (call
) == 4)
6080 model
= get_memmodel (gimple_call_arg (call
, 3));
6082 rtx mem
= get_builtin_sync_mem (ptr
, mode
);
6083 rtx val
= expand_expr_force_mode (bit
, mode
);
6085 switch (gimple_call_internal_fn (call
))
6087 case IFN_ATOMIC_BIT_TEST_AND_SET
:
6089 optab
= atomic_bit_test_and_set_optab
;
6091 case IFN_ATOMIC_BIT_TEST_AND_COMPLEMENT
:
6093 optab
= atomic_bit_test_and_complement_optab
;
6095 case IFN_ATOMIC_BIT_TEST_AND_RESET
:
6097 optab
= atomic_bit_test_and_reset_optab
;
6103 if (lhs
== NULL_TREE
)
6105 val
= expand_simple_binop (mode
, ASHIFT
, const1_rtx
,
6106 val
, NULL_RTX
, true, OPTAB_DIRECT
);
6108 val
= expand_simple_unop (mode
, NOT
, val
, NULL_RTX
, true);
6109 expand_atomic_fetch_op (const0_rtx
, mem
, val
, code
, model
, false);
6113 rtx target
= expand_expr (lhs
, NULL_RTX
, VOIDmode
, EXPAND_WRITE
);
6114 enum insn_code icode
= direct_optab_handler (optab
, mode
);
6115 gcc_assert (icode
!= CODE_FOR_nothing
);
6116 create_output_operand (&ops
[0], target
, mode
);
6117 create_fixed_operand (&ops
[1], mem
);
6118 create_convert_operand_to (&ops
[2], val
, mode
, true);
6119 create_integer_operand (&ops
[3], model
);
6120 create_integer_operand (&ops
[4], integer_onep (flag
));
6121 if (maybe_expand_insn (icode
, 5, ops
))
6125 val
= expand_simple_binop (mode
, ASHIFT
, const1_rtx
,
6126 val
, NULL_RTX
, true, OPTAB_DIRECT
);
6129 val
= expand_simple_unop (mode
, NOT
, val
, NULL_RTX
, true);
6130 rtx result
= expand_atomic_fetch_op (gen_reg_rtx (mode
), mem
, val
,
6131 code
, model
, false);
6132 if (integer_onep (flag
))
6134 result
= expand_simple_binop (mode
, ASHIFTRT
, result
, bitval
,
6135 NULL_RTX
, true, OPTAB_DIRECT
);
6136 result
= expand_simple_binop (mode
, AND
, result
, const1_rtx
, target
,
6137 true, OPTAB_DIRECT
);
6140 result
= expand_simple_binop (mode
, AND
, result
, maskval
, target
, true,
6142 if (result
!= target
)
6143 emit_move_insn (target
, result
);
6146 /* Expand an atomic clear operation.
6147 void _atomic_clear (BOOL *obj, enum memmodel)
6148 EXP is the call expression. */
6151 expand_builtin_atomic_clear (tree exp
)
6155 enum memmodel model
;
6157 mode
= mode_for_size (BOOL_TYPE_SIZE
, MODE_INT
, 0);
6158 mem
= get_builtin_sync_mem (CALL_EXPR_ARG (exp
, 0), mode
);
6159 model
= get_memmodel (CALL_EXPR_ARG (exp
, 1));
6161 if (is_mm_consume (model
) || is_mm_acquire (model
) || is_mm_acq_rel (model
))
6164 = expansion_point_location_if_in_system_header (input_location
);
6165 warning_at (loc
, OPT_Winvalid_memory_model
,
6166 "invalid memory model for %<__atomic_store%>");
6167 model
= MEMMODEL_SEQ_CST
;
6170 /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
6171 Failing that, a store is issued by __atomic_store. The only way this can
6172 fail is if the bool type is larger than a word size. Unlikely, but
6173 handle it anyway for completeness. Assume a single threaded model since
6174 there is no atomic support in this case, and no barriers are required. */
6175 ret
= expand_atomic_store (mem
, const0_rtx
, model
, true);
6177 emit_move_insn (mem
, const0_rtx
);
6181 /* Expand an atomic test_and_set operation.
6182 bool _atomic_test_and_set (BOOL *obj, enum memmodel)
6183 EXP is the call expression. */
6186 expand_builtin_atomic_test_and_set (tree exp
, rtx target
)
6189 enum memmodel model
;
6192 mode
= mode_for_size (BOOL_TYPE_SIZE
, MODE_INT
, 0);
6193 mem
= get_builtin_sync_mem (CALL_EXPR_ARG (exp
, 0), mode
);
6194 model
= get_memmodel (CALL_EXPR_ARG (exp
, 1));
6196 return expand_atomic_test_and_set (target
, mem
, model
);
6200 /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
6201 this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */
6204 fold_builtin_atomic_always_lock_free (tree arg0
, tree arg1
)
6208 unsigned int mode_align
, type_align
;
6210 if (TREE_CODE (arg0
) != INTEGER_CST
)
6213 size
= INTVAL (expand_normal (arg0
)) * BITS_PER_UNIT
;
6214 mode
= mode_for_size (size
, MODE_INT
, 0);
6215 mode_align
= GET_MODE_ALIGNMENT (mode
);
6217 if (TREE_CODE (arg1
) == INTEGER_CST
)
6219 unsigned HOST_WIDE_INT val
= UINTVAL (expand_normal (arg1
));
6221 /* Either this argument is null, or it's a fake pointer encoding
6222 the alignment of the object. */
6223 val
= least_bit_hwi (val
);
6224 val
*= BITS_PER_UNIT
;
6226 if (val
== 0 || mode_align
< val
)
6227 type_align
= mode_align
;
6233 tree ttype
= TREE_TYPE (arg1
);
6235 /* This function is usually invoked and folded immediately by the front
6236 end before anything else has a chance to look at it. The pointer
6237 parameter at this point is usually cast to a void *, so check for that
6238 and look past the cast. */
6239 if (CONVERT_EXPR_P (arg1
)
6240 && POINTER_TYPE_P (ttype
)
6241 && VOID_TYPE_P (TREE_TYPE (ttype
))
6242 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (arg1
, 0))))
6243 arg1
= TREE_OPERAND (arg1
, 0);
6245 ttype
= TREE_TYPE (arg1
);
6246 gcc_assert (POINTER_TYPE_P (ttype
));
6248 /* Get the underlying type of the object. */
6249 ttype
= TREE_TYPE (ttype
);
6250 type_align
= TYPE_ALIGN (ttype
);
6253 /* If the object has smaller alignment, the lock free routines cannot
6255 if (type_align
< mode_align
)
6256 return boolean_false_node
;
6258 /* Check if a compare_and_swap pattern exists for the mode which represents
6259 the required size. The pattern is not allowed to fail, so the existence
6260 of the pattern indicates support is present. Also require that an
6261 atomic load exists for the required size. */
6262 if (can_compare_and_swap_p (mode
, true) && can_atomic_load_p (mode
))
6263 return boolean_true_node
;
6265 return boolean_false_node
;
6268 /* Return true if the parameters to call EXP represent an object which will
6269 always generate lock free instructions. The first argument represents the
6270 size of the object, and the second parameter is a pointer to the object
6271 itself. If NULL is passed for the object, then the result is based on
6272 typical alignment for an object of the specified size. Otherwise return
6276 expand_builtin_atomic_always_lock_free (tree exp
)
6279 tree arg0
= CALL_EXPR_ARG (exp
, 0);
6280 tree arg1
= CALL_EXPR_ARG (exp
, 1);
6282 if (TREE_CODE (arg0
) != INTEGER_CST
)
6284 error ("non-constant argument 1 to __atomic_always_lock_free");
6288 size
= fold_builtin_atomic_always_lock_free (arg0
, arg1
);
6289 if (size
== boolean_true_node
)
6294 /* Return a one or zero if it can be determined that object ARG1 of size ARG
6295 is lock free on this architecture. */
6298 fold_builtin_atomic_is_lock_free (tree arg0
, tree arg1
)
6300 if (!flag_inline_atomics
)
6303 /* If it isn't always lock free, don't generate a result. */
6304 if (fold_builtin_atomic_always_lock_free (arg0
, arg1
) == boolean_true_node
)
6305 return boolean_true_node
;
6310 /* Return true if the parameters to call EXP represent an object which will
6311 always generate lock free instructions. The first argument represents the
6312 size of the object, and the second parameter is a pointer to the object
6313 itself. If NULL is passed for the object, then the result is based on
6314 typical alignment for an object of the specified size. Otherwise return
6318 expand_builtin_atomic_is_lock_free (tree exp
)
6321 tree arg0
= CALL_EXPR_ARG (exp
, 0);
6322 tree arg1
= CALL_EXPR_ARG (exp
, 1);
6324 if (!INTEGRAL_TYPE_P (TREE_TYPE (arg0
)))
6326 error ("non-integer argument 1 to __atomic_is_lock_free");
6330 if (!flag_inline_atomics
)
6333 /* If the value is known at compile time, return the RTX for it. */
6334 size
= fold_builtin_atomic_is_lock_free (arg0
, arg1
);
6335 if (size
== boolean_true_node
)
6341 /* Expand the __atomic_thread_fence intrinsic:
6342 void __atomic_thread_fence (enum memmodel)
6343 EXP is the CALL_EXPR. */
6346 expand_builtin_atomic_thread_fence (tree exp
)
6348 enum memmodel model
= get_memmodel (CALL_EXPR_ARG (exp
, 0));
6349 expand_mem_thread_fence (model
);
6352 /* Expand the __atomic_signal_fence intrinsic:
6353 void __atomic_signal_fence (enum memmodel)
6354 EXP is the CALL_EXPR. */
6357 expand_builtin_atomic_signal_fence (tree exp
)
6359 enum memmodel model
= get_memmodel (CALL_EXPR_ARG (exp
, 0));
6360 expand_mem_signal_fence (model
);
6363 /* Expand the __sync_synchronize intrinsic. */
6366 expand_builtin_sync_synchronize (void)
6368 expand_mem_thread_fence (MEMMODEL_SYNC_SEQ_CST
);
6372 expand_builtin_thread_pointer (tree exp
, rtx target
)
6374 enum insn_code icode
;
6375 if (!validate_arglist (exp
, VOID_TYPE
))
6377 icode
= direct_optab_handler (get_thread_pointer_optab
, Pmode
);
6378 if (icode
!= CODE_FOR_nothing
)
6380 struct expand_operand op
;
6381 /* If the target is not sutitable then create a new target. */
6382 if (target
== NULL_RTX
6384 || GET_MODE (target
) != Pmode
)
6385 target
= gen_reg_rtx (Pmode
);
6386 create_output_operand (&op
, target
, Pmode
);
6387 expand_insn (icode
, 1, &op
);
6390 error ("__builtin_thread_pointer is not supported on this target");
6395 expand_builtin_set_thread_pointer (tree exp
)
6397 enum insn_code icode
;
6398 if (!validate_arglist (exp
, POINTER_TYPE
, VOID_TYPE
))
6400 icode
= direct_optab_handler (set_thread_pointer_optab
, Pmode
);
6401 if (icode
!= CODE_FOR_nothing
)
6403 struct expand_operand op
;
6404 rtx val
= expand_expr (CALL_EXPR_ARG (exp
, 0), NULL_RTX
,
6405 Pmode
, EXPAND_NORMAL
);
6406 create_input_operand (&op
, val
, Pmode
);
6407 expand_insn (icode
, 1, &op
);
6410 error ("__builtin_set_thread_pointer is not supported on this target");
6414 /* Emit code to restore the current value of stack. */
6417 expand_stack_restore (tree var
)
6420 rtx sa
= expand_normal (var
);
6422 sa
= convert_memory_address (Pmode
, sa
);
6424 prev
= get_last_insn ();
6425 emit_stack_restore (SAVE_BLOCK
, sa
);
6427 record_new_stack_level ();
6429 fixup_args_size_notes (prev
, get_last_insn (), 0);
6432 /* Emit code to save the current value of stack. */
6435 expand_stack_save (void)
6439 emit_stack_save (SAVE_BLOCK
, &ret
);
6444 /* Expand an expression EXP that calls a built-in function,
6445 with result going to TARGET if that's convenient
6446 (and in mode MODE if that's convenient).
6447 SUBTARGET may be used as the target for computing one of EXP's operands.
6448 IGNORE is nonzero if the value is to be ignored. */
6451 expand_builtin (tree exp
, rtx target
, rtx subtarget
, machine_mode mode
,
6454 tree fndecl
= get_callee_fndecl (exp
);
6455 enum built_in_function fcode
= DECL_FUNCTION_CODE (fndecl
);
6456 machine_mode target_mode
= TYPE_MODE (TREE_TYPE (exp
));
6459 if (DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_MD
)
6460 return targetm
.expand_builtin (exp
, target
, subtarget
, mode
, ignore
);
6462 /* When ASan is enabled, we don't want to expand some memory/string
6463 builtins and rely on libsanitizer's hooks. This allows us to avoid
6464 redundant checks and be sure, that possible overflow will be detected
6467 if ((flag_sanitize
& SANITIZE_ADDRESS
) && asan_intercepted_p (fcode
))
6468 return expand_call (exp
, target
, ignore
);
6470 /* When not optimizing, generate calls to library functions for a certain
6473 && !called_as_built_in (fndecl
)
6474 && fcode
!= BUILT_IN_FORK
6475 && fcode
!= BUILT_IN_EXECL
6476 && fcode
!= BUILT_IN_EXECV
6477 && fcode
!= BUILT_IN_EXECLP
6478 && fcode
!= BUILT_IN_EXECLE
6479 && fcode
!= BUILT_IN_EXECVP
6480 && fcode
!= BUILT_IN_EXECVE
6481 && fcode
!= BUILT_IN_ALLOCA
6482 && fcode
!= BUILT_IN_ALLOCA_WITH_ALIGN
6483 && fcode
!= BUILT_IN_FREE
6484 && fcode
!= BUILT_IN_CHKP_SET_PTR_BOUNDS
6485 && fcode
!= BUILT_IN_CHKP_INIT_PTR_BOUNDS
6486 && fcode
!= BUILT_IN_CHKP_NULL_PTR_BOUNDS
6487 && fcode
!= BUILT_IN_CHKP_COPY_PTR_BOUNDS
6488 && fcode
!= BUILT_IN_CHKP_NARROW_PTR_BOUNDS
6489 && fcode
!= BUILT_IN_CHKP_STORE_PTR_BOUNDS
6490 && fcode
!= BUILT_IN_CHKP_CHECK_PTR_LBOUNDS
6491 && fcode
!= BUILT_IN_CHKP_CHECK_PTR_UBOUNDS
6492 && fcode
!= BUILT_IN_CHKP_CHECK_PTR_BOUNDS
6493 && fcode
!= BUILT_IN_CHKP_GET_PTR_LBOUND
6494 && fcode
!= BUILT_IN_CHKP_GET_PTR_UBOUND
6495 && fcode
!= BUILT_IN_CHKP_BNDRET
)
6496 return expand_call (exp
, target
, ignore
);
6498 /* The built-in function expanders test for target == const0_rtx
6499 to determine whether the function's result will be ignored. */
6501 target
= const0_rtx
;
6503 /* If the result of a pure or const built-in function is ignored, and
6504 none of its arguments are volatile, we can avoid expanding the
6505 built-in call and just evaluate the arguments for side-effects. */
6506 if (target
== const0_rtx
6507 && ((flags
= flags_from_decl_or_type (fndecl
)) & (ECF_CONST
| ECF_PURE
))
6508 && !(flags
& ECF_LOOPING_CONST_OR_PURE
))
6510 bool volatilep
= false;
6512 call_expr_arg_iterator iter
;
6514 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, exp
)
6515 if (TREE_THIS_VOLATILE (arg
))
6523 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, exp
)
6524 expand_expr (arg
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
6529 /* expand_builtin_with_bounds is supposed to be used for
6530 instrumented builtin calls. */
6531 gcc_assert (!CALL_WITH_BOUNDS_P (exp
));
6535 CASE_FLT_FN (BUILT_IN_FABS
):
6536 CASE_FLT_FN_FLOATN_NX (BUILT_IN_FABS
):
6537 case BUILT_IN_FABSD32
:
6538 case BUILT_IN_FABSD64
:
6539 case BUILT_IN_FABSD128
:
6540 target
= expand_builtin_fabs (exp
, target
, subtarget
);
6545 CASE_FLT_FN (BUILT_IN_COPYSIGN
):
6546 CASE_FLT_FN_FLOATN_NX (BUILT_IN_COPYSIGN
):
6547 target
= expand_builtin_copysign (exp
, target
, subtarget
);
6552 /* Just do a normal library call if we were unable to fold
6554 CASE_FLT_FN (BUILT_IN_CABS
):
6557 CASE_FLT_FN (BUILT_IN_FMA
):
6558 target
= expand_builtin_mathfn_ternary (exp
, target
, subtarget
);
6563 CASE_FLT_FN (BUILT_IN_ILOGB
):
6564 if (! flag_unsafe_math_optimizations
)
6567 CASE_FLT_FN (BUILT_IN_ISINF
):
6568 CASE_FLT_FN (BUILT_IN_FINITE
):
6569 case BUILT_IN_ISFINITE
:
6570 case BUILT_IN_ISNORMAL
:
6571 target
= expand_builtin_interclass_mathfn (exp
, target
);
6576 CASE_FLT_FN (BUILT_IN_ICEIL
):
6577 CASE_FLT_FN (BUILT_IN_LCEIL
):
6578 CASE_FLT_FN (BUILT_IN_LLCEIL
):
6579 CASE_FLT_FN (BUILT_IN_LFLOOR
):
6580 CASE_FLT_FN (BUILT_IN_IFLOOR
):
6581 CASE_FLT_FN (BUILT_IN_LLFLOOR
):
6582 target
= expand_builtin_int_roundingfn (exp
, target
);
6587 CASE_FLT_FN (BUILT_IN_IRINT
):
6588 CASE_FLT_FN (BUILT_IN_LRINT
):
6589 CASE_FLT_FN (BUILT_IN_LLRINT
):
6590 CASE_FLT_FN (BUILT_IN_IROUND
):
6591 CASE_FLT_FN (BUILT_IN_LROUND
):
6592 CASE_FLT_FN (BUILT_IN_LLROUND
):
6593 target
= expand_builtin_int_roundingfn_2 (exp
, target
);
6598 CASE_FLT_FN (BUILT_IN_POWI
):
6599 target
= expand_builtin_powi (exp
, target
);
6604 CASE_FLT_FN (BUILT_IN_CEXPI
):
6605 target
= expand_builtin_cexpi (exp
, target
);
6606 gcc_assert (target
);
6609 CASE_FLT_FN (BUILT_IN_SIN
):
6610 CASE_FLT_FN (BUILT_IN_COS
):
6611 if (! flag_unsafe_math_optimizations
)
6613 target
= expand_builtin_mathfn_3 (exp
, target
, subtarget
);
6618 CASE_FLT_FN (BUILT_IN_SINCOS
):
6619 if (! flag_unsafe_math_optimizations
)
6621 target
= expand_builtin_sincos (exp
);
6626 case BUILT_IN_APPLY_ARGS
:
6627 return expand_builtin_apply_args ();
6629 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
6630 FUNCTION with a copy of the parameters described by
6631 ARGUMENTS, and ARGSIZE. It returns a block of memory
6632 allocated on the stack into which is stored all the registers
6633 that might possibly be used for returning the result of a
6634 function. ARGUMENTS is the value returned by
6635 __builtin_apply_args. ARGSIZE is the number of bytes of
6636 arguments that must be copied. ??? How should this value be
6637 computed? We'll also need a safe worst case value for varargs
6639 case BUILT_IN_APPLY
:
6640 if (!validate_arglist (exp
, POINTER_TYPE
,
6641 POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
)
6642 && !validate_arglist (exp
, REFERENCE_TYPE
,
6643 POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
6649 ops
[0] = expand_normal (CALL_EXPR_ARG (exp
, 0));
6650 ops
[1] = expand_normal (CALL_EXPR_ARG (exp
, 1));
6651 ops
[2] = expand_normal (CALL_EXPR_ARG (exp
, 2));
6653 return expand_builtin_apply (ops
[0], ops
[1], ops
[2]);
6656 /* __builtin_return (RESULT) causes the function to return the
6657 value described by RESULT. RESULT is address of the block of
6658 memory returned by __builtin_apply. */
6659 case BUILT_IN_RETURN
:
6660 if (validate_arglist (exp
, POINTER_TYPE
, VOID_TYPE
))
6661 expand_builtin_return (expand_normal (CALL_EXPR_ARG (exp
, 0)));
6664 case BUILT_IN_SAVEREGS
:
6665 return expand_builtin_saveregs ();
6667 case BUILT_IN_VA_ARG_PACK
:
6668 /* All valid uses of __builtin_va_arg_pack () are removed during
6670 error ("%Kinvalid use of %<__builtin_va_arg_pack ()%>", exp
);
6673 case BUILT_IN_VA_ARG_PACK_LEN
:
6674 /* All valid uses of __builtin_va_arg_pack_len () are removed during
6676 error ("%Kinvalid use of %<__builtin_va_arg_pack_len ()%>", exp
);
6679 /* Return the address of the first anonymous stack arg. */
6680 case BUILT_IN_NEXT_ARG
:
6681 if (fold_builtin_next_arg (exp
, false))
6683 return expand_builtin_next_arg ();
6685 case BUILT_IN_CLEAR_CACHE
:
6686 target
= expand_builtin___clear_cache (exp
);
6691 case BUILT_IN_CLASSIFY_TYPE
:
6692 return expand_builtin_classify_type (exp
);
6694 case BUILT_IN_CONSTANT_P
:
6697 case BUILT_IN_FRAME_ADDRESS
:
6698 case BUILT_IN_RETURN_ADDRESS
:
6699 return expand_builtin_frame_address (fndecl
, exp
);
6701 /* Returns the address of the area where the structure is returned.
6703 case BUILT_IN_AGGREGATE_INCOMING_ADDRESS
:
6704 if (call_expr_nargs (exp
) != 0
6705 || ! AGGREGATE_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
)))
6706 || !MEM_P (DECL_RTL (DECL_RESULT (current_function_decl
))))
6709 return XEXP (DECL_RTL (DECL_RESULT (current_function_decl
)), 0);
6711 case BUILT_IN_ALLOCA
:
6712 case BUILT_IN_ALLOCA_WITH_ALIGN
:
6713 target
= expand_builtin_alloca (exp
);
6718 case BUILT_IN_ASAN_ALLOCAS_UNPOISON
:
6719 return expand_asan_emit_allocas_unpoison (exp
);
6721 case BUILT_IN_STACK_SAVE
:
6722 return expand_stack_save ();
6724 case BUILT_IN_STACK_RESTORE
:
6725 expand_stack_restore (CALL_EXPR_ARG (exp
, 0));
6728 case BUILT_IN_BSWAP16
:
6729 case BUILT_IN_BSWAP32
:
6730 case BUILT_IN_BSWAP64
:
6731 target
= expand_builtin_bswap (target_mode
, exp
, target
, subtarget
);
6736 CASE_INT_FN (BUILT_IN_FFS
):
6737 target
= expand_builtin_unop (target_mode
, exp
, target
,
6738 subtarget
, ffs_optab
);
6743 CASE_INT_FN (BUILT_IN_CLZ
):
6744 target
= expand_builtin_unop (target_mode
, exp
, target
,
6745 subtarget
, clz_optab
);
6750 CASE_INT_FN (BUILT_IN_CTZ
):
6751 target
= expand_builtin_unop (target_mode
, exp
, target
,
6752 subtarget
, ctz_optab
);
6757 CASE_INT_FN (BUILT_IN_CLRSB
):
6758 target
= expand_builtin_unop (target_mode
, exp
, target
,
6759 subtarget
, clrsb_optab
);
6764 CASE_INT_FN (BUILT_IN_POPCOUNT
):
6765 target
= expand_builtin_unop (target_mode
, exp
, target
,
6766 subtarget
, popcount_optab
);
6771 CASE_INT_FN (BUILT_IN_PARITY
):
6772 target
= expand_builtin_unop (target_mode
, exp
, target
,
6773 subtarget
, parity_optab
);
6778 case BUILT_IN_STRLEN
:
6779 target
= expand_builtin_strlen (exp
, target
, target_mode
);
6784 case BUILT_IN_STRCAT
:
6785 target
= expand_builtin_strcat (exp
, target
);
6790 case BUILT_IN_STRCPY
:
6791 target
= expand_builtin_strcpy (exp
, target
);
6796 case BUILT_IN_STRNCAT
:
6797 target
= expand_builtin_strncat (exp
, target
);
6802 case BUILT_IN_STRNCPY
:
6803 target
= expand_builtin_strncpy (exp
, target
);
6808 case BUILT_IN_STPCPY
:
6809 target
= expand_builtin_stpcpy (exp
, target
, mode
);
6814 case BUILT_IN_STPNCPY
:
6815 target
= expand_builtin_stpncpy (exp
, target
);
6820 case BUILT_IN_MEMCHR
:
6821 target
= expand_builtin_memchr (exp
, target
);
6826 case BUILT_IN_MEMCPY
:
6827 target
= expand_builtin_memcpy (exp
, target
);
6832 case BUILT_IN_MEMMOVE
:
6833 target
= expand_builtin_memmove (exp
, target
);
6838 case BUILT_IN_MEMPCPY
:
6839 target
= expand_builtin_mempcpy (exp
, target
);
6844 case BUILT_IN_MEMSET
:
6845 target
= expand_builtin_memset (exp
, target
, mode
);
6850 case BUILT_IN_BZERO
:
6851 target
= expand_builtin_bzero (exp
);
6856 case BUILT_IN_STRCMP
:
6857 target
= expand_builtin_strcmp (exp
, target
);
6862 case BUILT_IN_STRNCMP
:
6863 target
= expand_builtin_strncmp (exp
, target
, mode
);
6869 case BUILT_IN_MEMCMP
:
6870 case BUILT_IN_MEMCMP_EQ
:
6871 target
= expand_builtin_memcmp (exp
, target
, fcode
== BUILT_IN_MEMCMP_EQ
);
6874 if (fcode
== BUILT_IN_MEMCMP_EQ
)
6876 tree newdecl
= builtin_decl_explicit (BUILT_IN_MEMCMP
);
6877 TREE_OPERAND (exp
, 1) = build_fold_addr_expr (newdecl
);
6881 case BUILT_IN_SETJMP
:
6882 /* This should have been lowered to the builtins below. */
6885 case BUILT_IN_SETJMP_SETUP
:
6886 /* __builtin_setjmp_setup is passed a pointer to an array of five words
6887 and the receiver label. */
6888 if (validate_arglist (exp
, POINTER_TYPE
, POINTER_TYPE
, VOID_TYPE
))
6890 rtx buf_addr
= expand_expr (CALL_EXPR_ARG (exp
, 0), subtarget
,
6891 VOIDmode
, EXPAND_NORMAL
);
6892 tree label
= TREE_OPERAND (CALL_EXPR_ARG (exp
, 1), 0);
6893 rtx_insn
*label_r
= label_rtx (label
);
6895 /* This is copied from the handling of non-local gotos. */
6896 expand_builtin_setjmp_setup (buf_addr
, label_r
);
6897 nonlocal_goto_handler_labels
6898 = gen_rtx_INSN_LIST (VOIDmode
, label_r
,
6899 nonlocal_goto_handler_labels
);
6900 /* ??? Do not let expand_label treat us as such since we would
6901 not want to be both on the list of non-local labels and on
6902 the list of forced labels. */
6903 FORCED_LABEL (label
) = 0;
6908 case BUILT_IN_SETJMP_RECEIVER
:
6909 /* __builtin_setjmp_receiver is passed the receiver label. */
6910 if (validate_arglist (exp
, POINTER_TYPE
, VOID_TYPE
))
6912 tree label
= TREE_OPERAND (CALL_EXPR_ARG (exp
, 0), 0);
6913 rtx_insn
*label_r
= label_rtx (label
);
6915 expand_builtin_setjmp_receiver (label_r
);
6920 /* __builtin_longjmp is passed a pointer to an array of five words.
6921 It's similar to the C library longjmp function but works with
6922 __builtin_setjmp above. */
6923 case BUILT_IN_LONGJMP
:
6924 if (validate_arglist (exp
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
6926 rtx buf_addr
= expand_expr (CALL_EXPR_ARG (exp
, 0), subtarget
,
6927 VOIDmode
, EXPAND_NORMAL
);
6928 rtx value
= expand_normal (CALL_EXPR_ARG (exp
, 1));
6930 if (value
!= const1_rtx
)
6932 error ("%<__builtin_longjmp%> second argument must be 1");
6936 expand_builtin_longjmp (buf_addr
, value
);
6941 case BUILT_IN_NONLOCAL_GOTO
:
6942 target
= expand_builtin_nonlocal_goto (exp
);
6947 /* This updates the setjmp buffer that is its argument with the value
6948 of the current stack pointer. */
6949 case BUILT_IN_UPDATE_SETJMP_BUF
:
6950 if (validate_arglist (exp
, POINTER_TYPE
, VOID_TYPE
))
6953 = expand_normal (CALL_EXPR_ARG (exp
, 0));
6955 expand_builtin_update_setjmp_buf (buf_addr
);
6961 expand_builtin_trap ();
6964 case BUILT_IN_UNREACHABLE
:
6965 expand_builtin_unreachable ();
6968 CASE_FLT_FN (BUILT_IN_SIGNBIT
):
6969 case BUILT_IN_SIGNBITD32
:
6970 case BUILT_IN_SIGNBITD64
:
6971 case BUILT_IN_SIGNBITD128
:
6972 target
= expand_builtin_signbit (exp
, target
);
6977 /* Various hooks for the DWARF 2 __throw routine. */
6978 case BUILT_IN_UNWIND_INIT
:
6979 expand_builtin_unwind_init ();
6981 case BUILT_IN_DWARF_CFA
:
6982 return virtual_cfa_rtx
;
6983 #ifdef DWARF2_UNWIND_INFO
6984 case BUILT_IN_DWARF_SP_COLUMN
:
6985 return expand_builtin_dwarf_sp_column ();
6986 case BUILT_IN_INIT_DWARF_REG_SIZES
:
6987 expand_builtin_init_dwarf_reg_sizes (CALL_EXPR_ARG (exp
, 0));
6990 case BUILT_IN_FROB_RETURN_ADDR
:
6991 return expand_builtin_frob_return_addr (CALL_EXPR_ARG (exp
, 0));
6992 case BUILT_IN_EXTRACT_RETURN_ADDR
:
6993 return expand_builtin_extract_return_addr (CALL_EXPR_ARG (exp
, 0));
6994 case BUILT_IN_EH_RETURN
:
6995 expand_builtin_eh_return (CALL_EXPR_ARG (exp
, 0),
6996 CALL_EXPR_ARG (exp
, 1));
6998 case BUILT_IN_EH_RETURN_DATA_REGNO
:
6999 return expand_builtin_eh_return_data_regno (exp
);
7000 case BUILT_IN_EXTEND_POINTER
:
7001 return expand_builtin_extend_pointer (CALL_EXPR_ARG (exp
, 0));
7002 case BUILT_IN_EH_POINTER
:
7003 return expand_builtin_eh_pointer (exp
);
7004 case BUILT_IN_EH_FILTER
:
7005 return expand_builtin_eh_filter (exp
);
7006 case BUILT_IN_EH_COPY_VALUES
:
7007 return expand_builtin_eh_copy_values (exp
);
7009 case BUILT_IN_VA_START
:
7010 return expand_builtin_va_start (exp
);
7011 case BUILT_IN_VA_END
:
7012 return expand_builtin_va_end (exp
);
7013 case BUILT_IN_VA_COPY
:
7014 return expand_builtin_va_copy (exp
);
7015 case BUILT_IN_EXPECT
:
7016 return expand_builtin_expect (exp
, target
);
7017 case BUILT_IN_ASSUME_ALIGNED
:
7018 return expand_builtin_assume_aligned (exp
, target
);
7019 case BUILT_IN_PREFETCH
:
7020 expand_builtin_prefetch (exp
);
7023 case BUILT_IN_INIT_TRAMPOLINE
:
7024 return expand_builtin_init_trampoline (exp
, true);
7025 case BUILT_IN_INIT_HEAP_TRAMPOLINE
:
7026 return expand_builtin_init_trampoline (exp
, false);
7027 case BUILT_IN_ADJUST_TRAMPOLINE
:
7028 return expand_builtin_adjust_trampoline (exp
);
7030 case BUILT_IN_INIT_DESCRIPTOR
:
7031 return expand_builtin_init_descriptor (exp
);
7032 case BUILT_IN_ADJUST_DESCRIPTOR
:
7033 return expand_builtin_adjust_descriptor (exp
);
7036 case BUILT_IN_EXECL
:
7037 case BUILT_IN_EXECV
:
7038 case BUILT_IN_EXECLP
:
7039 case BUILT_IN_EXECLE
:
7040 case BUILT_IN_EXECVP
:
7041 case BUILT_IN_EXECVE
:
7042 target
= expand_builtin_fork_or_exec (fndecl
, exp
, target
, ignore
);
7047 case BUILT_IN_SYNC_FETCH_AND_ADD_1
:
7048 case BUILT_IN_SYNC_FETCH_AND_ADD_2
:
7049 case BUILT_IN_SYNC_FETCH_AND_ADD_4
:
7050 case BUILT_IN_SYNC_FETCH_AND_ADD_8
:
7051 case BUILT_IN_SYNC_FETCH_AND_ADD_16
:
7052 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_SYNC_FETCH_AND_ADD_1
);
7053 target
= expand_builtin_sync_operation (mode
, exp
, PLUS
, false, target
);
7058 case BUILT_IN_SYNC_FETCH_AND_SUB_1
:
7059 case BUILT_IN_SYNC_FETCH_AND_SUB_2
:
7060 case BUILT_IN_SYNC_FETCH_AND_SUB_4
:
7061 case BUILT_IN_SYNC_FETCH_AND_SUB_8
:
7062 case BUILT_IN_SYNC_FETCH_AND_SUB_16
:
7063 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_SYNC_FETCH_AND_SUB_1
);
7064 target
= expand_builtin_sync_operation (mode
, exp
, MINUS
, false, target
);
7069 case BUILT_IN_SYNC_FETCH_AND_OR_1
:
7070 case BUILT_IN_SYNC_FETCH_AND_OR_2
:
7071 case BUILT_IN_SYNC_FETCH_AND_OR_4
:
7072 case BUILT_IN_SYNC_FETCH_AND_OR_8
:
7073 case BUILT_IN_SYNC_FETCH_AND_OR_16
:
7074 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_SYNC_FETCH_AND_OR_1
);
7075 target
= expand_builtin_sync_operation (mode
, exp
, IOR
, false, target
);
7080 case BUILT_IN_SYNC_FETCH_AND_AND_1
:
7081 case BUILT_IN_SYNC_FETCH_AND_AND_2
:
7082 case BUILT_IN_SYNC_FETCH_AND_AND_4
:
7083 case BUILT_IN_SYNC_FETCH_AND_AND_8
:
7084 case BUILT_IN_SYNC_FETCH_AND_AND_16
:
7085 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_SYNC_FETCH_AND_AND_1
);
7086 target
= expand_builtin_sync_operation (mode
, exp
, AND
, false, target
);
7091 case BUILT_IN_SYNC_FETCH_AND_XOR_1
:
7092 case BUILT_IN_SYNC_FETCH_AND_XOR_2
:
7093 case BUILT_IN_SYNC_FETCH_AND_XOR_4
:
7094 case BUILT_IN_SYNC_FETCH_AND_XOR_8
:
7095 case BUILT_IN_SYNC_FETCH_AND_XOR_16
:
7096 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_SYNC_FETCH_AND_XOR_1
);
7097 target
= expand_builtin_sync_operation (mode
, exp
, XOR
, false, target
);
7102 case BUILT_IN_SYNC_FETCH_AND_NAND_1
:
7103 case BUILT_IN_SYNC_FETCH_AND_NAND_2
:
7104 case BUILT_IN_SYNC_FETCH_AND_NAND_4
:
7105 case BUILT_IN_SYNC_FETCH_AND_NAND_8
:
7106 case BUILT_IN_SYNC_FETCH_AND_NAND_16
:
7107 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_SYNC_FETCH_AND_NAND_1
);
7108 target
= expand_builtin_sync_operation (mode
, exp
, NOT
, false, target
);
7113 case BUILT_IN_SYNC_ADD_AND_FETCH_1
:
7114 case BUILT_IN_SYNC_ADD_AND_FETCH_2
:
7115 case BUILT_IN_SYNC_ADD_AND_FETCH_4
:
7116 case BUILT_IN_SYNC_ADD_AND_FETCH_8
:
7117 case BUILT_IN_SYNC_ADD_AND_FETCH_16
:
7118 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_SYNC_ADD_AND_FETCH_1
);
7119 target
= expand_builtin_sync_operation (mode
, exp
, PLUS
, true, target
);
7124 case BUILT_IN_SYNC_SUB_AND_FETCH_1
:
7125 case BUILT_IN_SYNC_SUB_AND_FETCH_2
:
7126 case BUILT_IN_SYNC_SUB_AND_FETCH_4
:
7127 case BUILT_IN_SYNC_SUB_AND_FETCH_8
:
7128 case BUILT_IN_SYNC_SUB_AND_FETCH_16
:
7129 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_SYNC_SUB_AND_FETCH_1
);
7130 target
= expand_builtin_sync_operation (mode
, exp
, MINUS
, true, target
);
7135 case BUILT_IN_SYNC_OR_AND_FETCH_1
:
7136 case BUILT_IN_SYNC_OR_AND_FETCH_2
:
7137 case BUILT_IN_SYNC_OR_AND_FETCH_4
:
7138 case BUILT_IN_SYNC_OR_AND_FETCH_8
:
7139 case BUILT_IN_SYNC_OR_AND_FETCH_16
:
7140 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_SYNC_OR_AND_FETCH_1
);
7141 target
= expand_builtin_sync_operation (mode
, exp
, IOR
, true, target
);
7146 case BUILT_IN_SYNC_AND_AND_FETCH_1
:
7147 case BUILT_IN_SYNC_AND_AND_FETCH_2
:
7148 case BUILT_IN_SYNC_AND_AND_FETCH_4
:
7149 case BUILT_IN_SYNC_AND_AND_FETCH_8
:
7150 case BUILT_IN_SYNC_AND_AND_FETCH_16
:
7151 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_SYNC_AND_AND_FETCH_1
);
7152 target
= expand_builtin_sync_operation (mode
, exp
, AND
, true, target
);
7157 case BUILT_IN_SYNC_XOR_AND_FETCH_1
:
7158 case BUILT_IN_SYNC_XOR_AND_FETCH_2
:
7159 case BUILT_IN_SYNC_XOR_AND_FETCH_4
:
7160 case BUILT_IN_SYNC_XOR_AND_FETCH_8
:
7161 case BUILT_IN_SYNC_XOR_AND_FETCH_16
:
7162 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_SYNC_XOR_AND_FETCH_1
);
7163 target
= expand_builtin_sync_operation (mode
, exp
, XOR
, true, target
);
7168 case BUILT_IN_SYNC_NAND_AND_FETCH_1
:
7169 case BUILT_IN_SYNC_NAND_AND_FETCH_2
:
7170 case BUILT_IN_SYNC_NAND_AND_FETCH_4
:
7171 case BUILT_IN_SYNC_NAND_AND_FETCH_8
:
7172 case BUILT_IN_SYNC_NAND_AND_FETCH_16
:
7173 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_SYNC_NAND_AND_FETCH_1
);
7174 target
= expand_builtin_sync_operation (mode
, exp
, NOT
, true, target
);
7179 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_1
:
7180 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_2
:
7181 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_4
:
7182 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_8
:
7183 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_16
:
7184 if (mode
== VOIDmode
)
7185 mode
= TYPE_MODE (boolean_type_node
);
7186 if (!target
|| !register_operand (target
, mode
))
7187 target
= gen_reg_rtx (mode
);
7189 mode
= get_builtin_sync_mode
7190 (fcode
- BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_1
);
7191 target
= expand_builtin_compare_and_swap (mode
, exp
, true, target
);
7196 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_1
:
7197 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_2
:
7198 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_4
:
7199 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_8
:
7200 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_16
:
7201 mode
= get_builtin_sync_mode
7202 (fcode
- BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_1
);
7203 target
= expand_builtin_compare_and_swap (mode
, exp
, false, target
);
7208 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_1
:
7209 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_2
:
7210 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_4
:
7211 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_8
:
7212 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_16
:
7213 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_SYNC_LOCK_TEST_AND_SET_1
);
7214 target
= expand_builtin_sync_lock_test_and_set (mode
, exp
, target
);
7219 case BUILT_IN_SYNC_LOCK_RELEASE_1
:
7220 case BUILT_IN_SYNC_LOCK_RELEASE_2
:
7221 case BUILT_IN_SYNC_LOCK_RELEASE_4
:
7222 case BUILT_IN_SYNC_LOCK_RELEASE_8
:
7223 case BUILT_IN_SYNC_LOCK_RELEASE_16
:
7224 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_SYNC_LOCK_RELEASE_1
);
7225 expand_builtin_sync_lock_release (mode
, exp
);
7228 case BUILT_IN_SYNC_SYNCHRONIZE
:
7229 expand_builtin_sync_synchronize ();
7232 case BUILT_IN_ATOMIC_EXCHANGE_1
:
7233 case BUILT_IN_ATOMIC_EXCHANGE_2
:
7234 case BUILT_IN_ATOMIC_EXCHANGE_4
:
7235 case BUILT_IN_ATOMIC_EXCHANGE_8
:
7236 case BUILT_IN_ATOMIC_EXCHANGE_16
:
7237 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_ATOMIC_EXCHANGE_1
);
7238 target
= expand_builtin_atomic_exchange (mode
, exp
, target
);
7243 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_1
:
7244 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_2
:
7245 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_4
:
7246 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_8
:
7247 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_16
:
7249 unsigned int nargs
, z
;
7250 vec
<tree
, va_gc
> *vec
;
7253 get_builtin_sync_mode (fcode
- BUILT_IN_ATOMIC_COMPARE_EXCHANGE_1
);
7254 target
= expand_builtin_atomic_compare_exchange (mode
, exp
, target
);
7258 /* If this is turned into an external library call, the weak parameter
7259 must be dropped to match the expected parameter list. */
7260 nargs
= call_expr_nargs (exp
);
7261 vec_alloc (vec
, nargs
- 1);
7262 for (z
= 0; z
< 3; z
++)
7263 vec
->quick_push (CALL_EXPR_ARG (exp
, z
));
7264 /* Skip the boolean weak parameter. */
7265 for (z
= 4; z
< 6; z
++)
7266 vec
->quick_push (CALL_EXPR_ARG (exp
, z
));
7267 exp
= build_call_vec (TREE_TYPE (exp
), CALL_EXPR_FN (exp
), vec
);
7271 case BUILT_IN_ATOMIC_LOAD_1
:
7272 case BUILT_IN_ATOMIC_LOAD_2
:
7273 case BUILT_IN_ATOMIC_LOAD_4
:
7274 case BUILT_IN_ATOMIC_LOAD_8
:
7275 case BUILT_IN_ATOMIC_LOAD_16
:
7276 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_ATOMIC_LOAD_1
);
7277 target
= expand_builtin_atomic_load (mode
, exp
, target
);
7282 case BUILT_IN_ATOMIC_STORE_1
:
7283 case BUILT_IN_ATOMIC_STORE_2
:
7284 case BUILT_IN_ATOMIC_STORE_4
:
7285 case BUILT_IN_ATOMIC_STORE_8
:
7286 case BUILT_IN_ATOMIC_STORE_16
:
7287 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_ATOMIC_STORE_1
);
7288 target
= expand_builtin_atomic_store (mode
, exp
);
7293 case BUILT_IN_ATOMIC_ADD_FETCH_1
:
7294 case BUILT_IN_ATOMIC_ADD_FETCH_2
:
7295 case BUILT_IN_ATOMIC_ADD_FETCH_4
:
7296 case BUILT_IN_ATOMIC_ADD_FETCH_8
:
7297 case BUILT_IN_ATOMIC_ADD_FETCH_16
:
7299 enum built_in_function lib
;
7300 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_ATOMIC_ADD_FETCH_1
);
7301 lib
= (enum built_in_function
)((int)BUILT_IN_ATOMIC_FETCH_ADD_1
+
7302 (fcode
- BUILT_IN_ATOMIC_ADD_FETCH_1
));
7303 target
= expand_builtin_atomic_fetch_op (mode
, exp
, target
, PLUS
, true,
7309 case BUILT_IN_ATOMIC_SUB_FETCH_1
:
7310 case BUILT_IN_ATOMIC_SUB_FETCH_2
:
7311 case BUILT_IN_ATOMIC_SUB_FETCH_4
:
7312 case BUILT_IN_ATOMIC_SUB_FETCH_8
:
7313 case BUILT_IN_ATOMIC_SUB_FETCH_16
:
7315 enum built_in_function lib
;
7316 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_ATOMIC_SUB_FETCH_1
);
7317 lib
= (enum built_in_function
)((int)BUILT_IN_ATOMIC_FETCH_SUB_1
+
7318 (fcode
- BUILT_IN_ATOMIC_SUB_FETCH_1
));
7319 target
= expand_builtin_atomic_fetch_op (mode
, exp
, target
, MINUS
, true,
7325 case BUILT_IN_ATOMIC_AND_FETCH_1
:
7326 case BUILT_IN_ATOMIC_AND_FETCH_2
:
7327 case BUILT_IN_ATOMIC_AND_FETCH_4
:
7328 case BUILT_IN_ATOMIC_AND_FETCH_8
:
7329 case BUILT_IN_ATOMIC_AND_FETCH_16
:
7331 enum built_in_function lib
;
7332 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_ATOMIC_AND_FETCH_1
);
7333 lib
= (enum built_in_function
)((int)BUILT_IN_ATOMIC_FETCH_AND_1
+
7334 (fcode
- BUILT_IN_ATOMIC_AND_FETCH_1
));
7335 target
= expand_builtin_atomic_fetch_op (mode
, exp
, target
, AND
, true,
7341 case BUILT_IN_ATOMIC_NAND_FETCH_1
:
7342 case BUILT_IN_ATOMIC_NAND_FETCH_2
:
7343 case BUILT_IN_ATOMIC_NAND_FETCH_4
:
7344 case BUILT_IN_ATOMIC_NAND_FETCH_8
:
7345 case BUILT_IN_ATOMIC_NAND_FETCH_16
:
7347 enum built_in_function lib
;
7348 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_ATOMIC_NAND_FETCH_1
);
7349 lib
= (enum built_in_function
)((int)BUILT_IN_ATOMIC_FETCH_NAND_1
+
7350 (fcode
- BUILT_IN_ATOMIC_NAND_FETCH_1
));
7351 target
= expand_builtin_atomic_fetch_op (mode
, exp
, target
, NOT
, true,
7357 case BUILT_IN_ATOMIC_XOR_FETCH_1
:
7358 case BUILT_IN_ATOMIC_XOR_FETCH_2
:
7359 case BUILT_IN_ATOMIC_XOR_FETCH_4
:
7360 case BUILT_IN_ATOMIC_XOR_FETCH_8
:
7361 case BUILT_IN_ATOMIC_XOR_FETCH_16
:
7363 enum built_in_function lib
;
7364 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_ATOMIC_XOR_FETCH_1
);
7365 lib
= (enum built_in_function
)((int)BUILT_IN_ATOMIC_FETCH_XOR_1
+
7366 (fcode
- BUILT_IN_ATOMIC_XOR_FETCH_1
));
7367 target
= expand_builtin_atomic_fetch_op (mode
, exp
, target
, XOR
, true,
7373 case BUILT_IN_ATOMIC_OR_FETCH_1
:
7374 case BUILT_IN_ATOMIC_OR_FETCH_2
:
7375 case BUILT_IN_ATOMIC_OR_FETCH_4
:
7376 case BUILT_IN_ATOMIC_OR_FETCH_8
:
7377 case BUILT_IN_ATOMIC_OR_FETCH_16
:
7379 enum built_in_function lib
;
7380 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_ATOMIC_OR_FETCH_1
);
7381 lib
= (enum built_in_function
)((int)BUILT_IN_ATOMIC_FETCH_OR_1
+
7382 (fcode
- BUILT_IN_ATOMIC_OR_FETCH_1
));
7383 target
= expand_builtin_atomic_fetch_op (mode
, exp
, target
, IOR
, true,
7389 case BUILT_IN_ATOMIC_FETCH_ADD_1
:
7390 case BUILT_IN_ATOMIC_FETCH_ADD_2
:
7391 case BUILT_IN_ATOMIC_FETCH_ADD_4
:
7392 case BUILT_IN_ATOMIC_FETCH_ADD_8
:
7393 case BUILT_IN_ATOMIC_FETCH_ADD_16
:
7394 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_ATOMIC_FETCH_ADD_1
);
7395 target
= expand_builtin_atomic_fetch_op (mode
, exp
, target
, PLUS
, false,
7396 ignore
, BUILT_IN_NONE
);
7401 case BUILT_IN_ATOMIC_FETCH_SUB_1
:
7402 case BUILT_IN_ATOMIC_FETCH_SUB_2
:
7403 case BUILT_IN_ATOMIC_FETCH_SUB_4
:
7404 case BUILT_IN_ATOMIC_FETCH_SUB_8
:
7405 case BUILT_IN_ATOMIC_FETCH_SUB_16
:
7406 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_ATOMIC_FETCH_SUB_1
);
7407 target
= expand_builtin_atomic_fetch_op (mode
, exp
, target
, MINUS
, false,
7408 ignore
, BUILT_IN_NONE
);
7413 case BUILT_IN_ATOMIC_FETCH_AND_1
:
7414 case BUILT_IN_ATOMIC_FETCH_AND_2
:
7415 case BUILT_IN_ATOMIC_FETCH_AND_4
:
7416 case BUILT_IN_ATOMIC_FETCH_AND_8
:
7417 case BUILT_IN_ATOMIC_FETCH_AND_16
:
7418 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_ATOMIC_FETCH_AND_1
);
7419 target
= expand_builtin_atomic_fetch_op (mode
, exp
, target
, AND
, false,
7420 ignore
, BUILT_IN_NONE
);
7425 case BUILT_IN_ATOMIC_FETCH_NAND_1
:
7426 case BUILT_IN_ATOMIC_FETCH_NAND_2
:
7427 case BUILT_IN_ATOMIC_FETCH_NAND_4
:
7428 case BUILT_IN_ATOMIC_FETCH_NAND_8
:
7429 case BUILT_IN_ATOMIC_FETCH_NAND_16
:
7430 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_ATOMIC_FETCH_NAND_1
);
7431 target
= expand_builtin_atomic_fetch_op (mode
, exp
, target
, NOT
, false,
7432 ignore
, BUILT_IN_NONE
);
7437 case BUILT_IN_ATOMIC_FETCH_XOR_1
:
7438 case BUILT_IN_ATOMIC_FETCH_XOR_2
:
7439 case BUILT_IN_ATOMIC_FETCH_XOR_4
:
7440 case BUILT_IN_ATOMIC_FETCH_XOR_8
:
7441 case BUILT_IN_ATOMIC_FETCH_XOR_16
:
7442 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_ATOMIC_FETCH_XOR_1
);
7443 target
= expand_builtin_atomic_fetch_op (mode
, exp
, target
, XOR
, false,
7444 ignore
, BUILT_IN_NONE
);
7449 case BUILT_IN_ATOMIC_FETCH_OR_1
:
7450 case BUILT_IN_ATOMIC_FETCH_OR_2
:
7451 case BUILT_IN_ATOMIC_FETCH_OR_4
:
7452 case BUILT_IN_ATOMIC_FETCH_OR_8
:
7453 case BUILT_IN_ATOMIC_FETCH_OR_16
:
7454 mode
= get_builtin_sync_mode (fcode
- BUILT_IN_ATOMIC_FETCH_OR_1
);
7455 target
= expand_builtin_atomic_fetch_op (mode
, exp
, target
, IOR
, false,
7456 ignore
, BUILT_IN_NONE
);
7461 case BUILT_IN_ATOMIC_TEST_AND_SET
:
7462 return expand_builtin_atomic_test_and_set (exp
, target
);
7464 case BUILT_IN_ATOMIC_CLEAR
:
7465 return expand_builtin_atomic_clear (exp
);
7467 case BUILT_IN_ATOMIC_ALWAYS_LOCK_FREE
:
7468 return expand_builtin_atomic_always_lock_free (exp
);
7470 case BUILT_IN_ATOMIC_IS_LOCK_FREE
:
7471 target
= expand_builtin_atomic_is_lock_free (exp
);
7476 case BUILT_IN_ATOMIC_THREAD_FENCE
:
7477 expand_builtin_atomic_thread_fence (exp
);
7480 case BUILT_IN_ATOMIC_SIGNAL_FENCE
:
7481 expand_builtin_atomic_signal_fence (exp
);
7484 case BUILT_IN_OBJECT_SIZE
:
7485 return expand_builtin_object_size (exp
);
7487 case BUILT_IN_MEMCPY_CHK
:
7488 case BUILT_IN_MEMPCPY_CHK
:
7489 case BUILT_IN_MEMMOVE_CHK
:
7490 case BUILT_IN_MEMSET_CHK
:
7491 target
= expand_builtin_memory_chk (exp
, target
, mode
, fcode
);
7496 case BUILT_IN_STRCPY_CHK
:
7497 case BUILT_IN_STPCPY_CHK
:
7498 case BUILT_IN_STRNCPY_CHK
:
7499 case BUILT_IN_STPNCPY_CHK
:
7500 case BUILT_IN_STRCAT_CHK
:
7501 case BUILT_IN_STRNCAT_CHK
:
7502 case BUILT_IN_SNPRINTF_CHK
:
7503 case BUILT_IN_VSNPRINTF_CHK
:
7504 maybe_emit_chk_warning (exp
, fcode
);
7507 case BUILT_IN_SPRINTF_CHK
:
7508 case BUILT_IN_VSPRINTF_CHK
:
7509 maybe_emit_sprintf_chk_warning (exp
, fcode
);
7513 if (warn_free_nonheap_object
)
7514 maybe_emit_free_warning (exp
);
7517 case BUILT_IN_THREAD_POINTER
:
7518 return expand_builtin_thread_pointer (exp
, target
);
7520 case BUILT_IN_SET_THREAD_POINTER
:
7521 expand_builtin_set_thread_pointer (exp
);
7524 case BUILT_IN_CILK_DETACH
:
7525 expand_builtin_cilk_detach (exp
);
7528 case BUILT_IN_CILK_POP_FRAME
:
7529 expand_builtin_cilk_pop_frame (exp
);
7532 case BUILT_IN_CHKP_INIT_PTR_BOUNDS
:
7533 case BUILT_IN_CHKP_NULL_PTR_BOUNDS
:
7534 case BUILT_IN_CHKP_COPY_PTR_BOUNDS
:
7535 case BUILT_IN_CHKP_CHECK_PTR_LBOUNDS
:
7536 case BUILT_IN_CHKP_CHECK_PTR_UBOUNDS
:
7537 case BUILT_IN_CHKP_CHECK_PTR_BOUNDS
:
7538 case BUILT_IN_CHKP_SET_PTR_BOUNDS
:
7539 case BUILT_IN_CHKP_NARROW_PTR_BOUNDS
:
7540 case BUILT_IN_CHKP_STORE_PTR_BOUNDS
:
7541 case BUILT_IN_CHKP_GET_PTR_LBOUND
:
7542 case BUILT_IN_CHKP_GET_PTR_UBOUND
:
7543 /* We allow user CHKP builtins if Pointer Bounds
7545 if (!chkp_function_instrumented_p (current_function_decl
))
7547 if (fcode
== BUILT_IN_CHKP_SET_PTR_BOUNDS
7548 || fcode
== BUILT_IN_CHKP_NARROW_PTR_BOUNDS
7549 || fcode
== BUILT_IN_CHKP_INIT_PTR_BOUNDS
7550 || fcode
== BUILT_IN_CHKP_NULL_PTR_BOUNDS
7551 || fcode
== BUILT_IN_CHKP_COPY_PTR_BOUNDS
)
7552 return expand_normal (CALL_EXPR_ARG (exp
, 0));
7553 else if (fcode
== BUILT_IN_CHKP_GET_PTR_LBOUND
)
7554 return expand_normal (size_zero_node
);
7555 else if (fcode
== BUILT_IN_CHKP_GET_PTR_UBOUND
)
7556 return expand_normal (size_int (-1));
7562 case BUILT_IN_CHKP_BNDMK
:
7563 case BUILT_IN_CHKP_BNDSTX
:
7564 case BUILT_IN_CHKP_BNDCL
:
7565 case BUILT_IN_CHKP_BNDCU
:
7566 case BUILT_IN_CHKP_BNDLDX
:
7567 case BUILT_IN_CHKP_BNDRET
:
7568 case BUILT_IN_CHKP_INTERSECT
:
7569 case BUILT_IN_CHKP_NARROW
:
7570 case BUILT_IN_CHKP_EXTRACT_LOWER
:
7571 case BUILT_IN_CHKP_EXTRACT_UPPER
:
7572 /* Software implementation of Pointer Bounds Checker is NYI.
7573 Target support is required. */
7574 error ("Your target platform does not support -fcheck-pointer-bounds");
7577 case BUILT_IN_ACC_ON_DEVICE
:
7578 /* Do library call, if we failed to expand the builtin when
7582 default: /* just do library call, if unknown builtin */
7586 /* The switch statement above can drop through to cause the function
7587 to be called normally. */
7588 return expand_call (exp
, target
, ignore
);
7591 /* Similar to expand_builtin but is used for instrumented calls. */
7594 expand_builtin_with_bounds (tree exp
, rtx target
,
7595 rtx subtarget ATTRIBUTE_UNUSED
,
7596 machine_mode mode
, int ignore
)
7598 tree fndecl
= get_callee_fndecl (exp
);
7599 enum built_in_function fcode
= DECL_FUNCTION_CODE (fndecl
);
7601 gcc_assert (CALL_WITH_BOUNDS_P (exp
));
7603 if (DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_MD
)
7604 return targetm
.expand_builtin (exp
, target
, subtarget
, mode
, ignore
);
7606 gcc_assert (fcode
> BEGIN_CHKP_BUILTINS
7607 && fcode
< END_CHKP_BUILTINS
);
7611 case BUILT_IN_CHKP_MEMCPY_NOBND_NOCHK_CHKP
:
7612 target
= expand_builtin_memcpy_with_bounds (exp
, target
);
7617 case BUILT_IN_CHKP_MEMPCPY_NOBND_NOCHK_CHKP
:
7618 target
= expand_builtin_mempcpy_with_bounds (exp
, target
);
7623 case BUILT_IN_CHKP_MEMSET_NOBND_NOCHK_CHKP
:
7624 target
= expand_builtin_memset_with_bounds (exp
, target
, mode
);
7633 /* The switch statement above can drop through to cause the function
7634 to be called normally. */
7635 return expand_call (exp
, target
, ignore
);
7638 /* Determine whether a tree node represents a call to a built-in
7639 function. If the tree T is a call to a built-in function with
7640 the right number of arguments of the appropriate types, return
7641 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
7642 Otherwise the return value is END_BUILTINS. */
7644 enum built_in_function
7645 builtin_mathfn_code (const_tree t
)
7647 const_tree fndecl
, arg
, parmlist
;
7648 const_tree argtype
, parmtype
;
7649 const_call_expr_arg_iterator iter
;
7651 if (TREE_CODE (t
) != CALL_EXPR
7652 || TREE_CODE (CALL_EXPR_FN (t
)) != ADDR_EXPR
)
7653 return END_BUILTINS
;
7655 fndecl
= get_callee_fndecl (t
);
7656 if (fndecl
== NULL_TREE
7657 || TREE_CODE (fndecl
) != FUNCTION_DECL
7658 || ! DECL_BUILT_IN (fndecl
)
7659 || DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_MD
)
7660 return END_BUILTINS
;
7662 parmlist
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
7663 init_const_call_expr_arg_iterator (t
, &iter
);
7664 for (; parmlist
; parmlist
= TREE_CHAIN (parmlist
))
7666 /* If a function doesn't take a variable number of arguments,
7667 the last element in the list will have type `void'. */
7668 parmtype
= TREE_VALUE (parmlist
);
7669 if (VOID_TYPE_P (parmtype
))
7671 if (more_const_call_expr_args_p (&iter
))
7672 return END_BUILTINS
;
7673 return DECL_FUNCTION_CODE (fndecl
);
7676 if (! more_const_call_expr_args_p (&iter
))
7677 return END_BUILTINS
;
7679 arg
= next_const_call_expr_arg (&iter
);
7680 argtype
= TREE_TYPE (arg
);
7682 if (SCALAR_FLOAT_TYPE_P (parmtype
))
7684 if (! SCALAR_FLOAT_TYPE_P (argtype
))
7685 return END_BUILTINS
;
7687 else if (COMPLEX_FLOAT_TYPE_P (parmtype
))
7689 if (! COMPLEX_FLOAT_TYPE_P (argtype
))
7690 return END_BUILTINS
;
7692 else if (POINTER_TYPE_P (parmtype
))
7694 if (! POINTER_TYPE_P (argtype
))
7695 return END_BUILTINS
;
7697 else if (INTEGRAL_TYPE_P (parmtype
))
7699 if (! INTEGRAL_TYPE_P (argtype
))
7700 return END_BUILTINS
;
7703 return END_BUILTINS
;
7706 /* Variable-length argument list. */
7707 return DECL_FUNCTION_CODE (fndecl
);
7710 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
7711 evaluate to a constant. */
7714 fold_builtin_constant_p (tree arg
)
7716 /* We return 1 for a numeric type that's known to be a constant
7717 value at compile-time or for an aggregate type that's a
7718 literal constant. */
7721 /* If we know this is a constant, emit the constant of one. */
7722 if (CONSTANT_CLASS_P (arg
)
7723 || (TREE_CODE (arg
) == CONSTRUCTOR
7724 && TREE_CONSTANT (arg
)))
7725 return integer_one_node
;
7726 if (TREE_CODE (arg
) == ADDR_EXPR
)
7728 tree op
= TREE_OPERAND (arg
, 0);
7729 if (TREE_CODE (op
) == STRING_CST
7730 || (TREE_CODE (op
) == ARRAY_REF
7731 && integer_zerop (TREE_OPERAND (op
, 1))
7732 && TREE_CODE (TREE_OPERAND (op
, 0)) == STRING_CST
))
7733 return integer_one_node
;
7736 /* If this expression has side effects, show we don't know it to be a
7737 constant. Likewise if it's a pointer or aggregate type since in
7738 those case we only want literals, since those are only optimized
7739 when generating RTL, not later.
7740 And finally, if we are compiling an initializer, not code, we
7741 need to return a definite result now; there's not going to be any
7742 more optimization done. */
7743 if (TREE_SIDE_EFFECTS (arg
)
7744 || AGGREGATE_TYPE_P (TREE_TYPE (arg
))
7745 || POINTER_TYPE_P (TREE_TYPE (arg
))
7747 || folding_initializer
7748 || force_folding_builtin_constant_p
)
7749 return integer_zero_node
;
7754 /* Create builtin_expect with PRED and EXPECTED as its arguments and
7755 return it as a truthvalue. */
7758 build_builtin_expect_predicate (location_t loc
, tree pred
, tree expected
,
7761 tree fn
, arg_types
, pred_type
, expected_type
, call_expr
, ret_type
;
7763 fn
= builtin_decl_explicit (BUILT_IN_EXPECT
);
7764 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
7765 ret_type
= TREE_TYPE (TREE_TYPE (fn
));
7766 pred_type
= TREE_VALUE (arg_types
);
7767 expected_type
= TREE_VALUE (TREE_CHAIN (arg_types
));
7769 pred
= fold_convert_loc (loc
, pred_type
, pred
);
7770 expected
= fold_convert_loc (loc
, expected_type
, expected
);
7771 call_expr
= build_call_expr_loc (loc
, fn
, predictor
? 3 : 2, pred
, expected
,
7774 return build2 (NE_EXPR
, TREE_TYPE (pred
), call_expr
,
7775 build_int_cst (ret_type
, 0));
7778 /* Fold a call to builtin_expect with arguments ARG0 and ARG1. Return
7779 NULL_TREE if no simplification is possible. */
7782 fold_builtin_expect (location_t loc
, tree arg0
, tree arg1
, tree arg2
)
7784 tree inner
, fndecl
, inner_arg0
;
7785 enum tree_code code
;
7787 /* Distribute the expected value over short-circuiting operators.
7788 See through the cast from truthvalue_type_node to long. */
7790 while (CONVERT_EXPR_P (inner_arg0
)
7791 && INTEGRAL_TYPE_P (TREE_TYPE (inner_arg0
))
7792 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (inner_arg0
, 0))))
7793 inner_arg0
= TREE_OPERAND (inner_arg0
, 0);
7795 /* If this is a builtin_expect within a builtin_expect keep the
7796 inner one. See through a comparison against a constant. It
7797 might have been added to create a thruthvalue. */
7800 if (COMPARISON_CLASS_P (inner
)
7801 && TREE_CODE (TREE_OPERAND (inner
, 1)) == INTEGER_CST
)
7802 inner
= TREE_OPERAND (inner
, 0);
7804 if (TREE_CODE (inner
) == CALL_EXPR
7805 && (fndecl
= get_callee_fndecl (inner
))
7806 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
7807 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_EXPECT
)
7811 code
= TREE_CODE (inner
);
7812 if (code
== TRUTH_ANDIF_EXPR
|| code
== TRUTH_ORIF_EXPR
)
7814 tree op0
= TREE_OPERAND (inner
, 0);
7815 tree op1
= TREE_OPERAND (inner
, 1);
7817 op0
= build_builtin_expect_predicate (loc
, op0
, arg1
, arg2
);
7818 op1
= build_builtin_expect_predicate (loc
, op1
, arg1
, arg2
);
7819 inner
= build2 (code
, TREE_TYPE (inner
), op0
, op1
);
7821 return fold_convert_loc (loc
, TREE_TYPE (arg0
), inner
);
7824 /* If the argument isn't invariant then there's nothing else we can do. */
7825 if (!TREE_CONSTANT (inner_arg0
))
7828 /* If we expect that a comparison against the argument will fold to
7829 a constant return the constant. In practice, this means a true
7830 constant or the address of a non-weak symbol. */
7833 if (TREE_CODE (inner
) == ADDR_EXPR
)
7837 inner
= TREE_OPERAND (inner
, 0);
7839 while (TREE_CODE (inner
) == COMPONENT_REF
7840 || TREE_CODE (inner
) == ARRAY_REF
);
7841 if (VAR_OR_FUNCTION_DECL_P (inner
) && DECL_WEAK (inner
))
7845 /* Otherwise, ARG0 already has the proper type for the return value. */
7849 /* Fold a call to __builtin_classify_type with argument ARG. */
7852 fold_builtin_classify_type (tree arg
)
7855 return build_int_cst (integer_type_node
, no_type_class
);
7857 return build_int_cst (integer_type_node
, type_to_class (TREE_TYPE (arg
)));
7860 /* Fold a call to __builtin_strlen with argument ARG. */
7863 fold_builtin_strlen (location_t loc
, tree type
, tree arg
)
7865 if (!validate_arg (arg
, POINTER_TYPE
))
7869 tree len
= c_strlen (arg
, 0);
7872 return fold_convert_loc (loc
, type
, len
);
7878 /* Fold a call to __builtin_inf or __builtin_huge_val. */
7881 fold_builtin_inf (location_t loc
, tree type
, int warn
)
7883 REAL_VALUE_TYPE real
;
7885 /* __builtin_inff is intended to be usable to define INFINITY on all
7886 targets. If an infinity is not available, INFINITY expands "to a
7887 positive constant of type float that overflows at translation
7888 time", footnote "In this case, using INFINITY will violate the
7889 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
7890 Thus we pedwarn to ensure this constraint violation is
7892 if (!MODE_HAS_INFINITIES (TYPE_MODE (type
)) && warn
)
7893 pedwarn (loc
, 0, "target format does not support infinity");
7896 return build_real (type
, real
);
7899 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
7900 NULL_TREE if no simplification can be made. */
7903 fold_builtin_sincos (location_t loc
,
7904 tree arg0
, tree arg1
, tree arg2
)
7907 tree fndecl
, call
= NULL_TREE
;
7909 if (!validate_arg (arg0
, REAL_TYPE
)
7910 || !validate_arg (arg1
, POINTER_TYPE
)
7911 || !validate_arg (arg2
, POINTER_TYPE
))
7914 type
= TREE_TYPE (arg0
);
7916 /* Calculate the result when the argument is a constant. */
7917 built_in_function fn
= mathfn_built_in_2 (type
, CFN_BUILT_IN_CEXPI
);
7918 if (fn
== END_BUILTINS
)
7921 /* Canonicalize sincos to cexpi. */
7922 if (TREE_CODE (arg0
) == REAL_CST
)
7924 tree complex_type
= build_complex_type (type
);
7925 call
= fold_const_call (as_combined_fn (fn
), complex_type
, arg0
);
7929 if (!targetm
.libc_has_function (function_c99_math_complex
)
7930 || !builtin_decl_implicit_p (fn
))
7932 fndecl
= builtin_decl_explicit (fn
);
7933 call
= build_call_expr_loc (loc
, fndecl
, 1, arg0
);
7934 call
= builtin_save_expr (call
);
7937 return build2 (COMPOUND_EXPR
, void_type_node
,
7938 build2 (MODIFY_EXPR
, void_type_node
,
7939 build_fold_indirect_ref_loc (loc
, arg1
),
7940 fold_build1_loc (loc
, IMAGPART_EXPR
, type
, call
)),
7941 build2 (MODIFY_EXPR
, void_type_node
,
7942 build_fold_indirect_ref_loc (loc
, arg2
),
7943 fold_build1_loc (loc
, REALPART_EXPR
, type
, call
)));
7946 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
7947 Return NULL_TREE if no simplification can be made. */
7950 fold_builtin_memcmp (location_t loc
, tree arg1
, tree arg2
, tree len
)
7952 if (!validate_arg (arg1
, POINTER_TYPE
)
7953 || !validate_arg (arg2
, POINTER_TYPE
)
7954 || !validate_arg (len
, INTEGER_TYPE
))
7957 /* If the LEN parameter is zero, return zero. */
7958 if (integer_zerop (len
))
7959 return omit_two_operands_loc (loc
, integer_type_node
, integer_zero_node
,
7962 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
7963 if (operand_equal_p (arg1
, arg2
, 0))
7964 return omit_one_operand_loc (loc
, integer_type_node
, integer_zero_node
, len
);
7966 /* If len parameter is one, return an expression corresponding to
7967 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
7968 if (tree_fits_uhwi_p (len
) && tree_to_uhwi (len
) == 1)
7970 tree cst_uchar_node
= build_type_variant (unsigned_char_type_node
, 1, 0);
7971 tree cst_uchar_ptr_node
7972 = build_pointer_type_for_mode (cst_uchar_node
, ptr_mode
, true);
7975 = fold_convert_loc (loc
, integer_type_node
,
7976 build1 (INDIRECT_REF
, cst_uchar_node
,
7977 fold_convert_loc (loc
,
7981 = fold_convert_loc (loc
, integer_type_node
,
7982 build1 (INDIRECT_REF
, cst_uchar_node
,
7983 fold_convert_loc (loc
,
7986 return fold_build2_loc (loc
, MINUS_EXPR
, integer_type_node
, ind1
, ind2
);
7992 /* Fold a call to builtin isascii with argument ARG. */
7995 fold_builtin_isascii (location_t loc
, tree arg
)
7997 if (!validate_arg (arg
, INTEGER_TYPE
))
8001 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
8002 arg
= fold_build2 (BIT_AND_EXPR
, integer_type_node
, arg
,
8003 build_int_cst (integer_type_node
,
8004 ~ (unsigned HOST_WIDE_INT
) 0x7f));
8005 return fold_build2_loc (loc
, EQ_EXPR
, integer_type_node
,
8006 arg
, integer_zero_node
);
8010 /* Fold a call to builtin toascii with argument ARG. */
8013 fold_builtin_toascii (location_t loc
, tree arg
)
8015 if (!validate_arg (arg
, INTEGER_TYPE
))
8018 /* Transform toascii(c) -> (c & 0x7f). */
8019 return fold_build2_loc (loc
, BIT_AND_EXPR
, integer_type_node
, arg
,
8020 build_int_cst (integer_type_node
, 0x7f));
8023 /* Fold a call to builtin isdigit with argument ARG. */
8026 fold_builtin_isdigit (location_t loc
, tree arg
)
8028 if (!validate_arg (arg
, INTEGER_TYPE
))
8032 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
8033 /* According to the C standard, isdigit is unaffected by locale.
8034 However, it definitely is affected by the target character set. */
8035 unsigned HOST_WIDE_INT target_digit0
8036 = lang_hooks
.to_target_charset ('0');
8038 if (target_digit0
== 0)
8041 arg
= fold_convert_loc (loc
, unsigned_type_node
, arg
);
8042 arg
= fold_build2 (MINUS_EXPR
, unsigned_type_node
, arg
,
8043 build_int_cst (unsigned_type_node
, target_digit0
));
8044 return fold_build2_loc (loc
, LE_EXPR
, integer_type_node
, arg
,
8045 build_int_cst (unsigned_type_node
, 9));
8049 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
8052 fold_builtin_fabs (location_t loc
, tree arg
, tree type
)
8054 if (!validate_arg (arg
, REAL_TYPE
))
8057 arg
= fold_convert_loc (loc
, type
, arg
);
8058 return fold_build1_loc (loc
, ABS_EXPR
, type
, arg
);
8061 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
8064 fold_builtin_abs (location_t loc
, tree arg
, tree type
)
8066 if (!validate_arg (arg
, INTEGER_TYPE
))
8069 arg
= fold_convert_loc (loc
, type
, arg
);
8070 return fold_build1_loc (loc
, ABS_EXPR
, type
, arg
);
8073 /* Fold a call to fma, fmaf, or fmal with arguments ARG[012]. */
8076 fold_builtin_fma (location_t loc
, tree arg0
, tree arg1
, tree arg2
, tree type
)
8078 /* ??? Only expand to FMA_EXPR if it's directly supported. */
8079 if (validate_arg (arg0
, REAL_TYPE
)
8080 && validate_arg (arg1
, REAL_TYPE
)
8081 && validate_arg (arg2
, REAL_TYPE
)
8082 && optab_handler (fma_optab
, TYPE_MODE (type
)) != CODE_FOR_nothing
)
8083 return fold_build3_loc (loc
, FMA_EXPR
, type
, arg0
, arg1
, arg2
);
8088 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
8091 fold_builtin_carg (location_t loc
, tree arg
, tree type
)
8093 if (validate_arg (arg
, COMPLEX_TYPE
)
8094 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg
))) == REAL_TYPE
)
8096 tree atan2_fn
= mathfn_built_in (type
, BUILT_IN_ATAN2
);
8100 tree new_arg
= builtin_save_expr (arg
);
8101 tree r_arg
= fold_build1_loc (loc
, REALPART_EXPR
, type
, new_arg
);
8102 tree i_arg
= fold_build1_loc (loc
, IMAGPART_EXPR
, type
, new_arg
);
8103 return build_call_expr_loc (loc
, atan2_fn
, 2, i_arg
, r_arg
);
8110 /* Fold a call to builtin frexp, we can assume the base is 2. */
8113 fold_builtin_frexp (location_t loc
, tree arg0
, tree arg1
, tree rettype
)
8115 if (! validate_arg (arg0
, REAL_TYPE
) || ! validate_arg (arg1
, POINTER_TYPE
))
8120 if (!(TREE_CODE (arg0
) == REAL_CST
&& ! TREE_OVERFLOW (arg0
)))
8123 arg1
= build_fold_indirect_ref_loc (loc
, arg1
);
8125 /* Proceed if a valid pointer type was passed in. */
8126 if (TYPE_MAIN_VARIANT (TREE_TYPE (arg1
)) == integer_type_node
)
8128 const REAL_VALUE_TYPE
*const value
= TREE_REAL_CST_PTR (arg0
);
8134 /* For +-0, return (*exp = 0, +-0). */
8135 exp
= integer_zero_node
;
8140 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
8141 return omit_one_operand_loc (loc
, rettype
, arg0
, arg1
);
8144 /* Since the frexp function always expects base 2, and in
8145 GCC normalized significands are already in the range
8146 [0.5, 1.0), we have exactly what frexp wants. */
8147 REAL_VALUE_TYPE frac_rvt
= *value
;
8148 SET_REAL_EXP (&frac_rvt
, 0);
8149 frac
= build_real (rettype
, frac_rvt
);
8150 exp
= build_int_cst (integer_type_node
, REAL_EXP (value
));
8157 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8158 arg1
= fold_build2_loc (loc
, MODIFY_EXPR
, rettype
, arg1
, exp
);
8159 TREE_SIDE_EFFECTS (arg1
) = 1;
8160 return fold_build2_loc (loc
, COMPOUND_EXPR
, rettype
, arg1
, frac
);
8166 /* Fold a call to builtin modf. */
8169 fold_builtin_modf (location_t loc
, tree arg0
, tree arg1
, tree rettype
)
8171 if (! validate_arg (arg0
, REAL_TYPE
) || ! validate_arg (arg1
, POINTER_TYPE
))
8176 if (!(TREE_CODE (arg0
) == REAL_CST
&& ! TREE_OVERFLOW (arg0
)))
8179 arg1
= build_fold_indirect_ref_loc (loc
, arg1
);
8181 /* Proceed if a valid pointer type was passed in. */
8182 if (TYPE_MAIN_VARIANT (TREE_TYPE (arg1
)) == TYPE_MAIN_VARIANT (rettype
))
8184 const REAL_VALUE_TYPE
*const value
= TREE_REAL_CST_PTR (arg0
);
8185 REAL_VALUE_TYPE trunc
, frac
;
8191 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
8192 trunc
= frac
= *value
;
8195 /* For +-Inf, return (*arg1 = arg0, +-0). */
8197 frac
.sign
= value
->sign
;
8201 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
8202 real_trunc (&trunc
, VOIDmode
, value
);
8203 real_arithmetic (&frac
, MINUS_EXPR
, value
, &trunc
);
8204 /* If the original number was negative and already
8205 integral, then the fractional part is -0.0. */
8206 if (value
->sign
&& frac
.cl
== rvc_zero
)
8207 frac
.sign
= value
->sign
;
8211 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8212 arg1
= fold_build2_loc (loc
, MODIFY_EXPR
, rettype
, arg1
,
8213 build_real (rettype
, trunc
));
8214 TREE_SIDE_EFFECTS (arg1
) = 1;
8215 return fold_build2_loc (loc
, COMPOUND_EXPR
, rettype
, arg1
,
8216 build_real (rettype
, frac
));
8222 /* Given a location LOC, an interclass builtin function decl FNDECL
8223 and its single argument ARG, return an folded expression computing
8224 the same, or NULL_TREE if we either couldn't or didn't want to fold
8225 (the latter happen if there's an RTL instruction available). */
8228 fold_builtin_interclass_mathfn (location_t loc
, tree fndecl
, tree arg
)
8232 if (!validate_arg (arg
, REAL_TYPE
))
8235 if (interclass_mathfn_icode (arg
, fndecl
) != CODE_FOR_nothing
)
8238 mode
= TYPE_MODE (TREE_TYPE (arg
));
8240 bool is_ibm_extended
= MODE_COMPOSITE_P (mode
);
8242 /* If there is no optab, try generic code. */
8243 switch (DECL_FUNCTION_CODE (fndecl
))
8247 CASE_FLT_FN (BUILT_IN_ISINF
):
8249 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
8250 tree
const isgr_fn
= builtin_decl_explicit (BUILT_IN_ISGREATER
);
8251 tree type
= TREE_TYPE (arg
);
8255 if (is_ibm_extended
)
8257 /* NaN and Inf are encoded in the high-order double value
8258 only. The low-order value is not significant. */
8259 type
= double_type_node
;
8261 arg
= fold_build1_loc (loc
, NOP_EXPR
, type
, arg
);
8263 get_max_float (REAL_MODE_FORMAT (mode
), buf
, sizeof (buf
));
8264 real_from_string (&r
, buf
);
8265 result
= build_call_expr (isgr_fn
, 2,
8266 fold_build1_loc (loc
, ABS_EXPR
, type
, arg
),
8267 build_real (type
, r
));
8270 CASE_FLT_FN (BUILT_IN_FINITE
):
8271 case BUILT_IN_ISFINITE
:
8273 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
8274 tree
const isle_fn
= builtin_decl_explicit (BUILT_IN_ISLESSEQUAL
);
8275 tree type
= TREE_TYPE (arg
);
8279 if (is_ibm_extended
)
8281 /* NaN and Inf are encoded in the high-order double value
8282 only. The low-order value is not significant. */
8283 type
= double_type_node
;
8285 arg
= fold_build1_loc (loc
, NOP_EXPR
, type
, arg
);
8287 get_max_float (REAL_MODE_FORMAT (mode
), buf
, sizeof (buf
));
8288 real_from_string (&r
, buf
);
8289 result
= build_call_expr (isle_fn
, 2,
8290 fold_build1_loc (loc
, ABS_EXPR
, type
, arg
),
8291 build_real (type
, r
));
8292 /*result = fold_build2_loc (loc, UNGT_EXPR,
8293 TREE_TYPE (TREE_TYPE (fndecl)),
8294 fold_build1_loc (loc, ABS_EXPR, type, arg),
8295 build_real (type, r));
8296 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
8297 TREE_TYPE (TREE_TYPE (fndecl)),
8301 case BUILT_IN_ISNORMAL
:
8303 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
8304 islessequal(fabs(x),DBL_MAX). */
8305 tree
const isle_fn
= builtin_decl_explicit (BUILT_IN_ISLESSEQUAL
);
8306 tree type
= TREE_TYPE (arg
);
8307 tree orig_arg
, max_exp
, min_exp
;
8308 machine_mode orig_mode
= mode
;
8309 REAL_VALUE_TYPE rmax
, rmin
;
8312 orig_arg
= arg
= builtin_save_expr (arg
);
8313 if (is_ibm_extended
)
8315 /* Use double to test the normal range of IBM extended
8316 precision. Emin for IBM extended precision is
8317 different to emin for IEEE double, being 53 higher
8318 since the low double exponent is at least 53 lower
8319 than the high double exponent. */
8320 type
= double_type_node
;
8322 arg
= fold_build1_loc (loc
, NOP_EXPR
, type
, arg
);
8324 arg
= fold_build1_loc (loc
, ABS_EXPR
, type
, arg
);
8326 get_max_float (REAL_MODE_FORMAT (mode
), buf
, sizeof (buf
));
8327 real_from_string (&rmax
, buf
);
8328 sprintf (buf
, "0x1p%d", REAL_MODE_FORMAT (orig_mode
)->emin
- 1);
8329 real_from_string (&rmin
, buf
);
8330 max_exp
= build_real (type
, rmax
);
8331 min_exp
= build_real (type
, rmin
);
8333 max_exp
= build_call_expr (isle_fn
, 2, arg
, max_exp
);
8334 if (is_ibm_extended
)
8336 /* Testing the high end of the range is done just using
8337 the high double, using the same test as isfinite().
8338 For the subnormal end of the range we first test the
8339 high double, then if its magnitude is equal to the
8340 limit of 0x1p-969, we test whether the low double is
8341 non-zero and opposite sign to the high double. */
8342 tree
const islt_fn
= builtin_decl_explicit (BUILT_IN_ISLESS
);
8343 tree
const isgt_fn
= builtin_decl_explicit (BUILT_IN_ISGREATER
);
8344 tree gt_min
= build_call_expr (isgt_fn
, 2, arg
, min_exp
);
8345 tree eq_min
= fold_build2 (EQ_EXPR
, integer_type_node
,
8347 tree as_complex
= build1 (VIEW_CONVERT_EXPR
,
8348 complex_double_type_node
, orig_arg
);
8349 tree hi_dbl
= build1 (REALPART_EXPR
, type
, as_complex
);
8350 tree lo_dbl
= build1 (IMAGPART_EXPR
, type
, as_complex
);
8351 tree zero
= build_real (type
, dconst0
);
8352 tree hilt
= build_call_expr (islt_fn
, 2, hi_dbl
, zero
);
8353 tree lolt
= build_call_expr (islt_fn
, 2, lo_dbl
, zero
);
8354 tree logt
= build_call_expr (isgt_fn
, 2, lo_dbl
, zero
);
8355 tree ok_lo
= fold_build1 (TRUTH_NOT_EXPR
, integer_type_node
,
8356 fold_build3 (COND_EXPR
,
8359 eq_min
= fold_build2 (TRUTH_ANDIF_EXPR
, integer_type_node
,
8361 min_exp
= fold_build2 (TRUTH_ORIF_EXPR
, integer_type_node
,
8367 = builtin_decl_explicit (BUILT_IN_ISGREATEREQUAL
);
8368 min_exp
= build_call_expr (isge_fn
, 2, arg
, min_exp
);
8370 result
= fold_build2 (BIT_AND_EXPR
, integer_type_node
,
8381 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
8382 ARG is the argument for the call. */
8385 fold_builtin_classify (location_t loc
, tree fndecl
, tree arg
, int builtin_index
)
8387 tree type
= TREE_TYPE (TREE_TYPE (fndecl
));
8389 if (!validate_arg (arg
, REAL_TYPE
))
8392 switch (builtin_index
)
8394 case BUILT_IN_ISINF
:
8395 if (!HONOR_INFINITIES (arg
))
8396 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg
);
8400 case BUILT_IN_ISINF_SIGN
:
8402 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
8403 /* In a boolean context, GCC will fold the inner COND_EXPR to
8404 1. So e.g. "if (isinf_sign(x))" would be folded to just
8405 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
8406 tree signbit_fn
= builtin_decl_explicit (BUILT_IN_SIGNBIT
);
8407 tree isinf_fn
= builtin_decl_explicit (BUILT_IN_ISINF
);
8408 tree tmp
= NULL_TREE
;
8410 arg
= builtin_save_expr (arg
);
8412 if (signbit_fn
&& isinf_fn
)
8414 tree signbit_call
= build_call_expr_loc (loc
, signbit_fn
, 1, arg
);
8415 tree isinf_call
= build_call_expr_loc (loc
, isinf_fn
, 1, arg
);
8417 signbit_call
= fold_build2_loc (loc
, NE_EXPR
, integer_type_node
,
8418 signbit_call
, integer_zero_node
);
8419 isinf_call
= fold_build2_loc (loc
, NE_EXPR
, integer_type_node
,
8420 isinf_call
, integer_zero_node
);
8422 tmp
= fold_build3_loc (loc
, COND_EXPR
, integer_type_node
, signbit_call
,
8423 integer_minus_one_node
, integer_one_node
);
8424 tmp
= fold_build3_loc (loc
, COND_EXPR
, integer_type_node
,
8432 case BUILT_IN_ISFINITE
:
8433 if (!HONOR_NANS (arg
)
8434 && !HONOR_INFINITIES (arg
))
8435 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg
);
8439 case BUILT_IN_ISNAN
:
8440 if (!HONOR_NANS (arg
))
8441 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg
);
8444 bool is_ibm_extended
= MODE_COMPOSITE_P (TYPE_MODE (TREE_TYPE (arg
)));
8445 if (is_ibm_extended
)
8447 /* NaN and Inf are encoded in the high-order double value
8448 only. The low-order value is not significant. */
8449 arg
= fold_build1_loc (loc
, NOP_EXPR
, double_type_node
, arg
);
8452 arg
= builtin_save_expr (arg
);
8453 return fold_build2_loc (loc
, UNORDERED_EXPR
, type
, arg
, arg
);
8460 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
8461 This builtin will generate code to return the appropriate floating
8462 point classification depending on the value of the floating point
8463 number passed in. The possible return values must be supplied as
8464 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
8465 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
8466 one floating point argument which is "type generic". */
8469 fold_builtin_fpclassify (location_t loc
, tree
*args
, int nargs
)
8471 tree fp_nan
, fp_infinite
, fp_normal
, fp_subnormal
, fp_zero
,
8472 arg
, type
, res
, tmp
;
8477 /* Verify the required arguments in the original call. */
8479 || !validate_arg (args
[0], INTEGER_TYPE
)
8480 || !validate_arg (args
[1], INTEGER_TYPE
)
8481 || !validate_arg (args
[2], INTEGER_TYPE
)
8482 || !validate_arg (args
[3], INTEGER_TYPE
)
8483 || !validate_arg (args
[4], INTEGER_TYPE
)
8484 || !validate_arg (args
[5], REAL_TYPE
))
8488 fp_infinite
= args
[1];
8489 fp_normal
= args
[2];
8490 fp_subnormal
= args
[3];
8493 type
= TREE_TYPE (arg
);
8494 mode
= TYPE_MODE (type
);
8495 arg
= builtin_save_expr (fold_build1_loc (loc
, ABS_EXPR
, type
, arg
));
8499 (fabs(x) == Inf ? FP_INFINITE :
8500 (fabs(x) >= DBL_MIN ? FP_NORMAL :
8501 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
8503 tmp
= fold_build2_loc (loc
, EQ_EXPR
, integer_type_node
, arg
,
8504 build_real (type
, dconst0
));
8505 res
= fold_build3_loc (loc
, COND_EXPR
, integer_type_node
,
8506 tmp
, fp_zero
, fp_subnormal
);
8508 sprintf (buf
, "0x1p%d", REAL_MODE_FORMAT (mode
)->emin
- 1);
8509 real_from_string (&r
, buf
);
8510 tmp
= fold_build2_loc (loc
, GE_EXPR
, integer_type_node
,
8511 arg
, build_real (type
, r
));
8512 res
= fold_build3_loc (loc
, COND_EXPR
, integer_type_node
, tmp
, fp_normal
, res
);
8514 if (HONOR_INFINITIES (mode
))
8517 tmp
= fold_build2_loc (loc
, EQ_EXPR
, integer_type_node
, arg
,
8518 build_real (type
, r
));
8519 res
= fold_build3_loc (loc
, COND_EXPR
, integer_type_node
, tmp
,
8523 if (HONOR_NANS (mode
))
8525 tmp
= fold_build2_loc (loc
, ORDERED_EXPR
, integer_type_node
, arg
, arg
);
8526 res
= fold_build3_loc (loc
, COND_EXPR
, integer_type_node
, tmp
, res
, fp_nan
);
8532 /* Fold a call to an unordered comparison function such as
8533 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
8534 being called and ARG0 and ARG1 are the arguments for the call.
8535 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
8536 the opposite of the desired result. UNORDERED_CODE is used
8537 for modes that can hold NaNs and ORDERED_CODE is used for
8541 fold_builtin_unordered_cmp (location_t loc
, tree fndecl
, tree arg0
, tree arg1
,
8542 enum tree_code unordered_code
,
8543 enum tree_code ordered_code
)
8545 tree type
= TREE_TYPE (TREE_TYPE (fndecl
));
8546 enum tree_code code
;
8548 enum tree_code code0
, code1
;
8549 tree cmp_type
= NULL_TREE
;
8551 type0
= TREE_TYPE (arg0
);
8552 type1
= TREE_TYPE (arg1
);
8554 code0
= TREE_CODE (type0
);
8555 code1
= TREE_CODE (type1
);
8557 if (code0
== REAL_TYPE
&& code1
== REAL_TYPE
)
8558 /* Choose the wider of two real types. */
8559 cmp_type
= TYPE_PRECISION (type0
) >= TYPE_PRECISION (type1
)
8561 else if (code0
== REAL_TYPE
&& code1
== INTEGER_TYPE
)
8563 else if (code0
== INTEGER_TYPE
&& code1
== REAL_TYPE
)
8566 arg0
= fold_convert_loc (loc
, cmp_type
, arg0
);
8567 arg1
= fold_convert_loc (loc
, cmp_type
, arg1
);
8569 if (unordered_code
== UNORDERED_EXPR
)
8571 if (!HONOR_NANS (arg0
))
8572 return omit_two_operands_loc (loc
, type
, integer_zero_node
, arg0
, arg1
);
8573 return fold_build2_loc (loc
, UNORDERED_EXPR
, type
, arg0
, arg1
);
8576 code
= HONOR_NANS (arg0
) ? unordered_code
: ordered_code
;
8577 return fold_build1_loc (loc
, TRUTH_NOT_EXPR
, type
,
8578 fold_build2_loc (loc
, code
, type
, arg0
, arg1
));
8581 /* Fold __builtin_{,s,u}{add,sub,mul}{,l,ll}_overflow, either into normal
8582 arithmetics if it can never overflow, or into internal functions that
8583 return both result of arithmetics and overflowed boolean flag in
8584 a complex integer result, or some other check for overflow.
8585 Similarly fold __builtin_{add,sub,mul}_overflow_p to just the overflow
8586 checking part of that. */
8589 fold_builtin_arith_overflow (location_t loc
, enum built_in_function fcode
,
8590 tree arg0
, tree arg1
, tree arg2
)
8592 enum internal_fn ifn
= IFN_LAST
;
8593 /* The code of the expression corresponding to the type-generic
8594 built-in, or ERROR_MARK for the type-specific ones. */
8595 enum tree_code opcode
= ERROR_MARK
;
8596 bool ovf_only
= false;
8600 case BUILT_IN_ADD_OVERFLOW_P
:
8603 case BUILT_IN_ADD_OVERFLOW
:
8606 case BUILT_IN_SADD_OVERFLOW
:
8607 case BUILT_IN_SADDL_OVERFLOW
:
8608 case BUILT_IN_SADDLL_OVERFLOW
:
8609 case BUILT_IN_UADD_OVERFLOW
:
8610 case BUILT_IN_UADDL_OVERFLOW
:
8611 case BUILT_IN_UADDLL_OVERFLOW
:
8612 ifn
= IFN_ADD_OVERFLOW
;
8614 case BUILT_IN_SUB_OVERFLOW_P
:
8617 case BUILT_IN_SUB_OVERFLOW
:
8618 opcode
= MINUS_EXPR
;
8620 case BUILT_IN_SSUB_OVERFLOW
:
8621 case BUILT_IN_SSUBL_OVERFLOW
:
8622 case BUILT_IN_SSUBLL_OVERFLOW
:
8623 case BUILT_IN_USUB_OVERFLOW
:
8624 case BUILT_IN_USUBL_OVERFLOW
:
8625 case BUILT_IN_USUBLL_OVERFLOW
:
8626 ifn
= IFN_SUB_OVERFLOW
;
8628 case BUILT_IN_MUL_OVERFLOW_P
:
8631 case BUILT_IN_MUL_OVERFLOW
:
8634 case BUILT_IN_SMUL_OVERFLOW
:
8635 case BUILT_IN_SMULL_OVERFLOW
:
8636 case BUILT_IN_SMULLL_OVERFLOW
:
8637 case BUILT_IN_UMUL_OVERFLOW
:
8638 case BUILT_IN_UMULL_OVERFLOW
:
8639 case BUILT_IN_UMULLL_OVERFLOW
:
8640 ifn
= IFN_MUL_OVERFLOW
;
8646 /* For the "generic" overloads, the first two arguments can have different
8647 types and the last argument determines the target type to use to check
8648 for overflow. The arguments of the other overloads all have the same
8650 tree type
= ovf_only
? TREE_TYPE (arg2
) : TREE_TYPE (TREE_TYPE (arg2
));
8652 /* For the __builtin_{add,sub,mul}_overflow_p builtins, when the first two
8653 arguments are constant, attempt to fold the built-in call into a constant
8654 expression indicating whether or not it detected an overflow. */
8656 && TREE_CODE (arg0
) == INTEGER_CST
8657 && TREE_CODE (arg1
) == INTEGER_CST
)
8658 /* Perform the computation in the target type and check for overflow. */
8659 return omit_one_operand_loc (loc
, boolean_type_node
,
8660 arith_overflowed_p (opcode
, type
, arg0
, arg1
)
8661 ? boolean_true_node
: boolean_false_node
,
8664 tree ctype
= build_complex_type (type
);
8665 tree call
= build_call_expr_internal_loc (loc
, ifn
, ctype
,
8667 tree tgt
= save_expr (call
);
8668 tree intres
= build1_loc (loc
, REALPART_EXPR
, type
, tgt
);
8669 tree ovfres
= build1_loc (loc
, IMAGPART_EXPR
, type
, tgt
);
8670 ovfres
= fold_convert_loc (loc
, boolean_type_node
, ovfres
);
8673 return omit_one_operand_loc (loc
, boolean_type_node
, ovfres
, arg2
);
8675 tree mem_arg2
= build_fold_indirect_ref_loc (loc
, arg2
);
8677 = fold_build2_loc (loc
, MODIFY_EXPR
, void_type_node
, mem_arg2
, intres
);
8678 return build2_loc (loc
, COMPOUND_EXPR
, boolean_type_node
, store
, ovfres
);
8681 /* Fold a call to __builtin_FILE to a constant string. */
8684 fold_builtin_FILE (location_t loc
)
8686 if (const char *fname
= LOCATION_FILE (loc
))
8687 return build_string_literal (strlen (fname
) + 1, fname
);
8689 return build_string_literal (1, "");
8692 /* Fold a call to __builtin_FUNCTION to a constant string. */
8695 fold_builtin_FUNCTION ()
8697 const char *name
= "";
8699 if (current_function_decl
)
8700 name
= lang_hooks
.decl_printable_name (current_function_decl
, 0);
8702 return build_string_literal (strlen (name
) + 1, name
);
8705 /* Fold a call to __builtin_LINE to an integer constant. */
8708 fold_builtin_LINE (location_t loc
, tree type
)
8710 return build_int_cst (type
, LOCATION_LINE (loc
));
8713 /* Fold a call to built-in function FNDECL with 0 arguments.
8714 This function returns NULL_TREE if no simplification was possible. */
8717 fold_builtin_0 (location_t loc
, tree fndecl
)
8719 tree type
= TREE_TYPE (TREE_TYPE (fndecl
));
8720 enum built_in_function fcode
= DECL_FUNCTION_CODE (fndecl
);
8724 return fold_builtin_FILE (loc
);
8726 case BUILT_IN_FUNCTION
:
8727 return fold_builtin_FUNCTION ();
8730 return fold_builtin_LINE (loc
, type
);
8732 CASE_FLT_FN (BUILT_IN_INF
):
8733 CASE_FLT_FN_FLOATN_NX (BUILT_IN_INF
):
8734 case BUILT_IN_INFD32
:
8735 case BUILT_IN_INFD64
:
8736 case BUILT_IN_INFD128
:
8737 return fold_builtin_inf (loc
, type
, true);
8739 CASE_FLT_FN (BUILT_IN_HUGE_VAL
):
8740 CASE_FLT_FN_FLOATN_NX (BUILT_IN_HUGE_VAL
):
8741 return fold_builtin_inf (loc
, type
, false);
8743 case BUILT_IN_CLASSIFY_TYPE
:
8744 return fold_builtin_classify_type (NULL_TREE
);
8752 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
8753 This function returns NULL_TREE if no simplification was possible. */
8756 fold_builtin_1 (location_t loc
, tree fndecl
, tree arg0
)
8758 tree type
= TREE_TYPE (TREE_TYPE (fndecl
));
8759 enum built_in_function fcode
= DECL_FUNCTION_CODE (fndecl
);
8761 if (TREE_CODE (arg0
) == ERROR_MARK
)
8764 if (tree ret
= fold_const_call (as_combined_fn (fcode
), type
, arg0
))
8769 case BUILT_IN_CONSTANT_P
:
8771 tree val
= fold_builtin_constant_p (arg0
);
8773 /* Gimplification will pull the CALL_EXPR for the builtin out of
8774 an if condition. When not optimizing, we'll not CSE it back.
8775 To avoid link error types of regressions, return false now. */
8776 if (!val
&& !optimize
)
8777 val
= integer_zero_node
;
8782 case BUILT_IN_CLASSIFY_TYPE
:
8783 return fold_builtin_classify_type (arg0
);
8785 case BUILT_IN_STRLEN
:
8786 return fold_builtin_strlen (loc
, type
, arg0
);
8788 CASE_FLT_FN (BUILT_IN_FABS
):
8789 CASE_FLT_FN_FLOATN_NX (BUILT_IN_FABS
):
8790 case BUILT_IN_FABSD32
:
8791 case BUILT_IN_FABSD64
:
8792 case BUILT_IN_FABSD128
:
8793 return fold_builtin_fabs (loc
, arg0
, type
);
8797 case BUILT_IN_LLABS
:
8798 case BUILT_IN_IMAXABS
:
8799 return fold_builtin_abs (loc
, arg0
, type
);
8801 CASE_FLT_FN (BUILT_IN_CONJ
):
8802 if (validate_arg (arg0
, COMPLEX_TYPE
)
8803 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0
))) == REAL_TYPE
)
8804 return fold_build1_loc (loc
, CONJ_EXPR
, type
, arg0
);
8807 CASE_FLT_FN (BUILT_IN_CREAL
):
8808 if (validate_arg (arg0
, COMPLEX_TYPE
)
8809 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0
))) == REAL_TYPE
)
8810 return non_lvalue_loc (loc
, fold_build1_loc (loc
, REALPART_EXPR
, type
, arg0
));
8813 CASE_FLT_FN (BUILT_IN_CIMAG
):
8814 if (validate_arg (arg0
, COMPLEX_TYPE
)
8815 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0
))) == REAL_TYPE
)
8816 return non_lvalue_loc (loc
, fold_build1_loc (loc
, IMAGPART_EXPR
, type
, arg0
));
8819 CASE_FLT_FN (BUILT_IN_CARG
):
8820 return fold_builtin_carg (loc
, arg0
, type
);
8822 case BUILT_IN_ISASCII
:
8823 return fold_builtin_isascii (loc
, arg0
);
8825 case BUILT_IN_TOASCII
:
8826 return fold_builtin_toascii (loc
, arg0
);
8828 case BUILT_IN_ISDIGIT
:
8829 return fold_builtin_isdigit (loc
, arg0
);
8831 CASE_FLT_FN (BUILT_IN_FINITE
):
8832 case BUILT_IN_FINITED32
:
8833 case BUILT_IN_FINITED64
:
8834 case BUILT_IN_FINITED128
:
8835 case BUILT_IN_ISFINITE
:
8837 tree ret
= fold_builtin_classify (loc
, fndecl
, arg0
, BUILT_IN_ISFINITE
);
8840 return fold_builtin_interclass_mathfn (loc
, fndecl
, arg0
);
8843 CASE_FLT_FN (BUILT_IN_ISINF
):
8844 case BUILT_IN_ISINFD32
:
8845 case BUILT_IN_ISINFD64
:
8846 case BUILT_IN_ISINFD128
:
8848 tree ret
= fold_builtin_classify (loc
, fndecl
, arg0
, BUILT_IN_ISINF
);
8851 return fold_builtin_interclass_mathfn (loc
, fndecl
, arg0
);
8854 case BUILT_IN_ISNORMAL
:
8855 return fold_builtin_interclass_mathfn (loc
, fndecl
, arg0
);
8857 case BUILT_IN_ISINF_SIGN
:
8858 return fold_builtin_classify (loc
, fndecl
, arg0
, BUILT_IN_ISINF_SIGN
);
8860 CASE_FLT_FN (BUILT_IN_ISNAN
):
8861 case BUILT_IN_ISNAND32
:
8862 case BUILT_IN_ISNAND64
:
8863 case BUILT_IN_ISNAND128
:
8864 return fold_builtin_classify (loc
, fndecl
, arg0
, BUILT_IN_ISNAN
);
8867 if (integer_zerop (arg0
))
8868 return build_empty_stmt (loc
);
8879 /* Fold a call to built-in function FNDECL with 2 arguments, ARG0 and ARG1.
8880 This function returns NULL_TREE if no simplification was possible. */
8883 fold_builtin_2 (location_t loc
, tree fndecl
, tree arg0
, tree arg1
)
8885 tree type
= TREE_TYPE (TREE_TYPE (fndecl
));
8886 enum built_in_function fcode
= DECL_FUNCTION_CODE (fndecl
);
8888 if (TREE_CODE (arg0
) == ERROR_MARK
8889 || TREE_CODE (arg1
) == ERROR_MARK
)
8892 if (tree ret
= fold_const_call (as_combined_fn (fcode
), type
, arg0
, arg1
))
8897 CASE_FLT_FN_REENT (BUILT_IN_GAMMA
): /* GAMMA_R */
8898 CASE_FLT_FN_REENT (BUILT_IN_LGAMMA
): /* LGAMMA_R */
8899 if (validate_arg (arg0
, REAL_TYPE
)
8900 && validate_arg (arg1
, POINTER_TYPE
))
8901 return do_mpfr_lgamma_r (arg0
, arg1
, type
);
8904 CASE_FLT_FN (BUILT_IN_FREXP
):
8905 return fold_builtin_frexp (loc
, arg0
, arg1
, type
);
8907 CASE_FLT_FN (BUILT_IN_MODF
):
8908 return fold_builtin_modf (loc
, arg0
, arg1
, type
);
8910 case BUILT_IN_STRSPN
:
8911 return fold_builtin_strspn (loc
, arg0
, arg1
);
8913 case BUILT_IN_STRCSPN
:
8914 return fold_builtin_strcspn (loc
, arg0
, arg1
);
8916 case BUILT_IN_STRPBRK
:
8917 return fold_builtin_strpbrk (loc
, arg0
, arg1
, type
);
8919 case BUILT_IN_EXPECT
:
8920 return fold_builtin_expect (loc
, arg0
, arg1
, NULL_TREE
);
8922 case BUILT_IN_ISGREATER
:
8923 return fold_builtin_unordered_cmp (loc
, fndecl
,
8924 arg0
, arg1
, UNLE_EXPR
, LE_EXPR
);
8925 case BUILT_IN_ISGREATEREQUAL
:
8926 return fold_builtin_unordered_cmp (loc
, fndecl
,
8927 arg0
, arg1
, UNLT_EXPR
, LT_EXPR
);
8928 case BUILT_IN_ISLESS
:
8929 return fold_builtin_unordered_cmp (loc
, fndecl
,
8930 arg0
, arg1
, UNGE_EXPR
, GE_EXPR
);
8931 case BUILT_IN_ISLESSEQUAL
:
8932 return fold_builtin_unordered_cmp (loc
, fndecl
,
8933 arg0
, arg1
, UNGT_EXPR
, GT_EXPR
);
8934 case BUILT_IN_ISLESSGREATER
:
8935 return fold_builtin_unordered_cmp (loc
, fndecl
,
8936 arg0
, arg1
, UNEQ_EXPR
, EQ_EXPR
);
8937 case BUILT_IN_ISUNORDERED
:
8938 return fold_builtin_unordered_cmp (loc
, fndecl
,
8939 arg0
, arg1
, UNORDERED_EXPR
,
8942 /* We do the folding for va_start in the expander. */
8943 case BUILT_IN_VA_START
:
8946 case BUILT_IN_OBJECT_SIZE
:
8947 return fold_builtin_object_size (arg0
, arg1
);
8949 case BUILT_IN_ATOMIC_ALWAYS_LOCK_FREE
:
8950 return fold_builtin_atomic_always_lock_free (arg0
, arg1
);
8952 case BUILT_IN_ATOMIC_IS_LOCK_FREE
:
8953 return fold_builtin_atomic_is_lock_free (arg0
, arg1
);
8961 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
8963 This function returns NULL_TREE if no simplification was possible. */
8966 fold_builtin_3 (location_t loc
, tree fndecl
,
8967 tree arg0
, tree arg1
, tree arg2
)
8969 tree type
= TREE_TYPE (TREE_TYPE (fndecl
));
8970 enum built_in_function fcode
= DECL_FUNCTION_CODE (fndecl
);
8972 if (TREE_CODE (arg0
) == ERROR_MARK
8973 || TREE_CODE (arg1
) == ERROR_MARK
8974 || TREE_CODE (arg2
) == ERROR_MARK
)
8977 if (tree ret
= fold_const_call (as_combined_fn (fcode
), type
,
8984 CASE_FLT_FN (BUILT_IN_SINCOS
):
8985 return fold_builtin_sincos (loc
, arg0
, arg1
, arg2
);
8987 CASE_FLT_FN (BUILT_IN_FMA
):
8988 return fold_builtin_fma (loc
, arg0
, arg1
, arg2
, type
);
8990 CASE_FLT_FN (BUILT_IN_REMQUO
):
8991 if (validate_arg (arg0
, REAL_TYPE
)
8992 && validate_arg (arg1
, REAL_TYPE
)
8993 && validate_arg (arg2
, POINTER_TYPE
))
8994 return do_mpfr_remquo (arg0
, arg1
, arg2
);
8997 case BUILT_IN_MEMCMP
:
8998 return fold_builtin_memcmp (loc
, arg0
, arg1
, arg2
);;
9000 case BUILT_IN_EXPECT
:
9001 return fold_builtin_expect (loc
, arg0
, arg1
, arg2
);
9003 case BUILT_IN_ADD_OVERFLOW
:
9004 case BUILT_IN_SUB_OVERFLOW
:
9005 case BUILT_IN_MUL_OVERFLOW
:
9006 case BUILT_IN_ADD_OVERFLOW_P
:
9007 case BUILT_IN_SUB_OVERFLOW_P
:
9008 case BUILT_IN_MUL_OVERFLOW_P
:
9009 case BUILT_IN_SADD_OVERFLOW
:
9010 case BUILT_IN_SADDL_OVERFLOW
:
9011 case BUILT_IN_SADDLL_OVERFLOW
:
9012 case BUILT_IN_SSUB_OVERFLOW
:
9013 case BUILT_IN_SSUBL_OVERFLOW
:
9014 case BUILT_IN_SSUBLL_OVERFLOW
:
9015 case BUILT_IN_SMUL_OVERFLOW
:
9016 case BUILT_IN_SMULL_OVERFLOW
:
9017 case BUILT_IN_SMULLL_OVERFLOW
:
9018 case BUILT_IN_UADD_OVERFLOW
:
9019 case BUILT_IN_UADDL_OVERFLOW
:
9020 case BUILT_IN_UADDLL_OVERFLOW
:
9021 case BUILT_IN_USUB_OVERFLOW
:
9022 case BUILT_IN_USUBL_OVERFLOW
:
9023 case BUILT_IN_USUBLL_OVERFLOW
:
9024 case BUILT_IN_UMUL_OVERFLOW
:
9025 case BUILT_IN_UMULL_OVERFLOW
:
9026 case BUILT_IN_UMULLL_OVERFLOW
:
9027 return fold_builtin_arith_overflow (loc
, fcode
, arg0
, arg1
, arg2
);
9035 /* Fold a call to built-in function FNDECL. ARGS is an array of NARGS
9036 arguments. IGNORE is true if the result of the
9037 function call is ignored. This function returns NULL_TREE if no
9038 simplification was possible. */
9041 fold_builtin_n (location_t loc
, tree fndecl
, tree
*args
, int nargs
, bool)
9043 tree ret
= NULL_TREE
;
9048 ret
= fold_builtin_0 (loc
, fndecl
);
9051 ret
= fold_builtin_1 (loc
, fndecl
, args
[0]);
9054 ret
= fold_builtin_2 (loc
, fndecl
, args
[0], args
[1]);
9057 ret
= fold_builtin_3 (loc
, fndecl
, args
[0], args
[1], args
[2]);
9060 ret
= fold_builtin_varargs (loc
, fndecl
, args
, nargs
);
9065 ret
= build1 (NOP_EXPR
, TREE_TYPE (ret
), ret
);
9066 SET_EXPR_LOCATION (ret
, loc
);
9067 TREE_NO_WARNING (ret
) = 1;
9073 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
9074 list ARGS along with N new arguments in NEWARGS. SKIP is the number
9075 of arguments in ARGS to be omitted. OLDNARGS is the number of
9076 elements in ARGS. */
9079 rewrite_call_expr_valist (location_t loc
, int oldnargs
, tree
*args
,
9080 int skip
, tree fndecl
, int n
, va_list newargs
)
9082 int nargs
= oldnargs
- skip
+ n
;
9089 buffer
= XALLOCAVEC (tree
, nargs
);
9090 for (i
= 0; i
< n
; i
++)
9091 buffer
[i
] = va_arg (newargs
, tree
);
9092 for (j
= skip
; j
< oldnargs
; j
++, i
++)
9093 buffer
[i
] = args
[j
];
9096 buffer
= args
+ skip
;
9098 return build_call_expr_loc_array (loc
, fndecl
, nargs
, buffer
);
9101 /* Return true if FNDECL shouldn't be folded right now.
9102 If a built-in function has an inline attribute always_inline
9103 wrapper, defer folding it after always_inline functions have
9104 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
9105 might not be performed. */
9108 avoid_folding_inline_builtin (tree fndecl
)
9110 return (DECL_DECLARED_INLINE_P (fndecl
)
9111 && DECL_DISREGARD_INLINE_LIMITS (fndecl
)
9113 && !cfun
->always_inline_functions_inlined
9114 && lookup_attribute ("always_inline", DECL_ATTRIBUTES (fndecl
)));
9117 /* A wrapper function for builtin folding that prevents warnings for
9118 "statement without effect" and the like, caused by removing the
9119 call node earlier than the warning is generated. */
9122 fold_call_expr (location_t loc
, tree exp
, bool ignore
)
9124 tree ret
= NULL_TREE
;
9125 tree fndecl
= get_callee_fndecl (exp
);
9127 && TREE_CODE (fndecl
) == FUNCTION_DECL
9128 && DECL_BUILT_IN (fndecl
)
9129 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
9130 yet. Defer folding until we see all the arguments
9131 (after inlining). */
9132 && !CALL_EXPR_VA_ARG_PACK (exp
))
9134 int nargs
= call_expr_nargs (exp
);
9136 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
9137 instead last argument is __builtin_va_arg_pack (). Defer folding
9138 even in that case, until arguments are finalized. */
9139 if (nargs
&& TREE_CODE (CALL_EXPR_ARG (exp
, nargs
- 1)) == CALL_EXPR
)
9141 tree fndecl2
= get_callee_fndecl (CALL_EXPR_ARG (exp
, nargs
- 1));
9143 && TREE_CODE (fndecl2
) == FUNCTION_DECL
9144 && DECL_BUILT_IN_CLASS (fndecl2
) == BUILT_IN_NORMAL
9145 && DECL_FUNCTION_CODE (fndecl2
) == BUILT_IN_VA_ARG_PACK
)
9149 if (avoid_folding_inline_builtin (fndecl
))
9152 if (DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_MD
)
9153 return targetm
.fold_builtin (fndecl
, call_expr_nargs (exp
),
9154 CALL_EXPR_ARGP (exp
), ignore
);
9157 tree
*args
= CALL_EXPR_ARGP (exp
);
9158 ret
= fold_builtin_n (loc
, fndecl
, args
, nargs
, ignore
);
9166 /* Fold a CALL_EXPR with type TYPE with FN as the function expression.
9167 N arguments are passed in the array ARGARRAY. Return a folded
9168 expression or NULL_TREE if no simplification was possible. */
9171 fold_builtin_call_array (location_t loc
, tree
,
9176 if (TREE_CODE (fn
) != ADDR_EXPR
)
9179 tree fndecl
= TREE_OPERAND (fn
, 0);
9180 if (TREE_CODE (fndecl
) == FUNCTION_DECL
9181 && DECL_BUILT_IN (fndecl
))
9183 /* If last argument is __builtin_va_arg_pack (), arguments to this
9184 function are not finalized yet. Defer folding until they are. */
9185 if (n
&& TREE_CODE (argarray
[n
- 1]) == CALL_EXPR
)
9187 tree fndecl2
= get_callee_fndecl (argarray
[n
- 1]);
9189 && TREE_CODE (fndecl2
) == FUNCTION_DECL
9190 && DECL_BUILT_IN_CLASS (fndecl2
) == BUILT_IN_NORMAL
9191 && DECL_FUNCTION_CODE (fndecl2
) == BUILT_IN_VA_ARG_PACK
)
9194 if (avoid_folding_inline_builtin (fndecl
))
9196 if (DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_MD
)
9197 return targetm
.fold_builtin (fndecl
, n
, argarray
, false);
9199 return fold_builtin_n (loc
, fndecl
, argarray
, n
, false);
9205 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
9206 along with N new arguments specified as the "..." parameters. SKIP
9207 is the number of arguments in EXP to be omitted. This function is used
9208 to do varargs-to-varargs transformations. */
9211 rewrite_call_expr (location_t loc
, tree exp
, int skip
, tree fndecl
, int n
, ...)
9217 t
= rewrite_call_expr_valist (loc
, call_expr_nargs (exp
),
9218 CALL_EXPR_ARGP (exp
), skip
, fndecl
, n
, ap
);
9224 /* Validate a single argument ARG against a tree code CODE representing
9225 a type. Return true when argument is valid. */
9228 validate_arg (const_tree arg
, enum tree_code code
)
9232 else if (code
== POINTER_TYPE
)
9233 return POINTER_TYPE_P (TREE_TYPE (arg
));
9234 else if (code
== INTEGER_TYPE
)
9235 return INTEGRAL_TYPE_P (TREE_TYPE (arg
));
9236 return code
== TREE_CODE (TREE_TYPE (arg
));
9239 /* This function validates the types of a function call argument list
9240 against a specified list of tree_codes. If the last specifier is a 0,
9241 that represents an ellipses, otherwise the last specifier must be a
9244 This is the GIMPLE version of validate_arglist. Eventually we want to
9245 completely convert builtins.c to work from GIMPLEs and the tree based
9246 validate_arglist will then be removed. */
9249 validate_gimple_arglist (const gcall
*call
, ...)
9251 enum tree_code code
;
9257 va_start (ap
, call
);
9262 code
= (enum tree_code
) va_arg (ap
, int);
9266 /* This signifies an ellipses, any further arguments are all ok. */
9270 /* This signifies an endlink, if no arguments remain, return
9271 true, otherwise return false. */
9272 res
= (i
== gimple_call_num_args (call
));
9275 /* If no parameters remain or the parameter's code does not
9276 match the specified code, return false. Otherwise continue
9277 checking any remaining arguments. */
9278 arg
= gimple_call_arg (call
, i
++);
9279 if (!validate_arg (arg
, code
))
9286 /* We need gotos here since we can only have one VA_CLOSE in a
9294 /* Default target-specific builtin expander that does nothing. */
9297 default_expand_builtin (tree exp ATTRIBUTE_UNUSED
,
9298 rtx target ATTRIBUTE_UNUSED
,
9299 rtx subtarget ATTRIBUTE_UNUSED
,
9300 machine_mode mode ATTRIBUTE_UNUSED
,
9301 int ignore ATTRIBUTE_UNUSED
)
9306 /* Returns true is EXP represents data that would potentially reside
9307 in a readonly section. */
9310 readonly_data_expr (tree exp
)
9314 if (TREE_CODE (exp
) != ADDR_EXPR
)
9317 exp
= get_base_address (TREE_OPERAND (exp
, 0));
9321 /* Make sure we call decl_readonly_section only for trees it
9322 can handle (since it returns true for everything it doesn't
9324 if (TREE_CODE (exp
) == STRING_CST
9325 || TREE_CODE (exp
) == CONSTRUCTOR
9326 || (VAR_P (exp
) && TREE_STATIC (exp
)))
9327 return decl_readonly_section (exp
, 0);
9332 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
9333 to the call, and TYPE is its return type.
9335 Return NULL_TREE if no simplification was possible, otherwise return the
9336 simplified form of the call as a tree.
9338 The simplified form may be a constant or other expression which
9339 computes the same value, but in a more efficient manner (including
9340 calls to other builtin functions).
9342 The call may contain arguments which need to be evaluated, but
9343 which are not useful to determine the result of the call. In
9344 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9345 COMPOUND_EXPR will be an argument which must be evaluated.
9346 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9347 COMPOUND_EXPR in the chain will contain the tree for the simplified
9348 form of the builtin function call. */
9351 fold_builtin_strpbrk (location_t loc
, tree s1
, tree s2
, tree type
)
9353 if (!validate_arg (s1
, POINTER_TYPE
)
9354 || !validate_arg (s2
, POINTER_TYPE
))
9359 const char *p1
, *p2
;
9368 const char *r
= strpbrk (p1
, p2
);
9372 return build_int_cst (TREE_TYPE (s1
), 0);
9374 /* Return an offset into the constant string argument. */
9375 tem
= fold_build_pointer_plus_hwi_loc (loc
, s1
, r
- p1
);
9376 return fold_convert_loc (loc
, type
, tem
);
9380 /* strpbrk(x, "") == NULL.
9381 Evaluate and ignore s1 in case it had side-effects. */
9382 return omit_one_operand_loc (loc
, TREE_TYPE (s1
), integer_zero_node
, s1
);
9385 return NULL_TREE
; /* Really call strpbrk. */
9387 fn
= builtin_decl_implicit (BUILT_IN_STRCHR
);
9391 /* New argument list transforming strpbrk(s1, s2) to
9392 strchr(s1, s2[0]). */
9393 return build_call_expr_loc (loc
, fn
, 2, s1
,
9394 build_int_cst (integer_type_node
, p2
[0]));
9398 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
9401 Return NULL_TREE if no simplification was possible, otherwise return the
9402 simplified form of the call as a tree.
9404 The simplified form may be a constant or other expression which
9405 computes the same value, but in a more efficient manner (including
9406 calls to other builtin functions).
9408 The call may contain arguments which need to be evaluated, but
9409 which are not useful to determine the result of the call. In
9410 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9411 COMPOUND_EXPR will be an argument which must be evaluated.
9412 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9413 COMPOUND_EXPR in the chain will contain the tree for the simplified
9414 form of the builtin function call. */
9417 fold_builtin_strspn (location_t loc
, tree s1
, tree s2
)
9419 if (!validate_arg (s1
, POINTER_TYPE
)
9420 || !validate_arg (s2
, POINTER_TYPE
))
9424 const char *p1
= c_getstr (s1
), *p2
= c_getstr (s2
);
9426 /* If either argument is "", return NULL_TREE. */
9427 if ((p1
&& *p1
== '\0') || (p2
&& *p2
== '\0'))
9428 /* Evaluate and ignore both arguments in case either one has
9430 return omit_two_operands_loc (loc
, size_type_node
, size_zero_node
,
9436 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
9439 Return NULL_TREE if no simplification was possible, otherwise return the
9440 simplified form of the call as a tree.
9442 The simplified form may be a constant or other expression which
9443 computes the same value, but in a more efficient manner (including
9444 calls to other builtin functions).
9446 The call may contain arguments which need to be evaluated, but
9447 which are not useful to determine the result of the call. In
9448 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9449 COMPOUND_EXPR will be an argument which must be evaluated.
9450 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9451 COMPOUND_EXPR in the chain will contain the tree for the simplified
9452 form of the builtin function call. */
9455 fold_builtin_strcspn (location_t loc
, tree s1
, tree s2
)
9457 if (!validate_arg (s1
, POINTER_TYPE
)
9458 || !validate_arg (s2
, POINTER_TYPE
))
9462 /* If the first argument is "", return NULL_TREE. */
9463 const char *p1
= c_getstr (s1
);
9464 if (p1
&& *p1
== '\0')
9466 /* Evaluate and ignore argument s2 in case it has
9468 return omit_one_operand_loc (loc
, size_type_node
,
9469 size_zero_node
, s2
);
9472 /* If the second argument is "", return __builtin_strlen(s1). */
9473 const char *p2
= c_getstr (s2
);
9474 if (p2
&& *p2
== '\0')
9476 tree fn
= builtin_decl_implicit (BUILT_IN_STRLEN
);
9478 /* If the replacement _DECL isn't initialized, don't do the
9483 return build_call_expr_loc (loc
, fn
, 1, s1
);
9489 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
9490 produced. False otherwise. This is done so that we don't output the error
9491 or warning twice or three times. */
9494 fold_builtin_next_arg (tree exp
, bool va_start_p
)
9496 tree fntype
= TREE_TYPE (current_function_decl
);
9497 int nargs
= call_expr_nargs (exp
);
9499 /* There is good chance the current input_location points inside the
9500 definition of the va_start macro (perhaps on the token for
9501 builtin) in a system header, so warnings will not be emitted.
9502 Use the location in real source code. */
9503 source_location current_location
=
9504 linemap_unwind_to_first_non_reserved_loc (line_table
, input_location
,
9507 if (!stdarg_p (fntype
))
9509 error ("%<va_start%> used in function with fixed args");
9515 if (va_start_p
&& (nargs
!= 2))
9517 error ("wrong number of arguments to function %<va_start%>");
9520 arg
= CALL_EXPR_ARG (exp
, 1);
9522 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
9523 when we checked the arguments and if needed issued a warning. */
9528 /* Evidently an out of date version of <stdarg.h>; can't validate
9529 va_start's second argument, but can still work as intended. */
9530 warning_at (current_location
,
9532 "%<__builtin_next_arg%> called without an argument");
9537 error ("wrong number of arguments to function %<__builtin_next_arg%>");
9540 arg
= CALL_EXPR_ARG (exp
, 0);
9543 if (TREE_CODE (arg
) == SSA_NAME
)
9544 arg
= SSA_NAME_VAR (arg
);
9546 /* We destructively modify the call to be __builtin_va_start (ap, 0)
9547 or __builtin_next_arg (0) the first time we see it, after checking
9548 the arguments and if needed issuing a warning. */
9549 if (!integer_zerop (arg
))
9551 tree last_parm
= tree_last (DECL_ARGUMENTS (current_function_decl
));
9553 /* Strip off all nops for the sake of the comparison. This
9554 is not quite the same as STRIP_NOPS. It does more.
9555 We must also strip off INDIRECT_EXPR for C++ reference
9557 while (CONVERT_EXPR_P (arg
)
9558 || TREE_CODE (arg
) == INDIRECT_REF
)
9559 arg
= TREE_OPERAND (arg
, 0);
9560 if (arg
!= last_parm
)
9562 /* FIXME: Sometimes with the tree optimizers we can get the
9563 not the last argument even though the user used the last
9564 argument. We just warn and set the arg to be the last
9565 argument so that we will get wrong-code because of
9567 warning_at (current_location
,
9569 "second parameter of %<va_start%> not last named argument");
9572 /* Undefined by C99 7.15.1.4p4 (va_start):
9573 "If the parameter parmN is declared with the register storage
9574 class, with a function or array type, or with a type that is
9575 not compatible with the type that results after application of
9576 the default argument promotions, the behavior is undefined."
9578 else if (DECL_REGISTER (arg
))
9580 warning_at (current_location
,
9582 "undefined behavior when second parameter of "
9583 "%<va_start%> is declared with %<register%> storage");
9586 /* We want to verify the second parameter just once before the tree
9587 optimizers are run and then avoid keeping it in the tree,
9588 as otherwise we could warn even for correct code like:
9589 void foo (int i, ...)
9590 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
9592 CALL_EXPR_ARG (exp
, 1) = integer_zero_node
;
9594 CALL_EXPR_ARG (exp
, 0) = integer_zero_node
;
9600 /* Expand a call EXP to __builtin_object_size. */
9603 expand_builtin_object_size (tree exp
)
9606 int object_size_type
;
9607 tree fndecl
= get_callee_fndecl (exp
);
9609 if (!validate_arglist (exp
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
9611 error ("%Kfirst argument of %qD must be a pointer, second integer constant",
9613 expand_builtin_trap ();
9617 ost
= CALL_EXPR_ARG (exp
, 1);
9620 if (TREE_CODE (ost
) != INTEGER_CST
9621 || tree_int_cst_sgn (ost
) < 0
9622 || compare_tree_int (ost
, 3) > 0)
9624 error ("%Klast argument of %qD is not integer constant between 0 and 3",
9626 expand_builtin_trap ();
9630 object_size_type
= tree_to_shwi (ost
);
9632 return object_size_type
< 2 ? constm1_rtx
: const0_rtx
;
9635 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
9636 FCODE is the BUILT_IN_* to use.
9637 Return NULL_RTX if we failed; the caller should emit a normal call,
9638 otherwise try to get the result in TARGET, if convenient (and in
9639 mode MODE if that's convenient). */
9642 expand_builtin_memory_chk (tree exp
, rtx target
, machine_mode mode
,
9643 enum built_in_function fcode
)
9645 tree dest
, src
, len
, size
;
9647 if (!validate_arglist (exp
,
9649 fcode
== BUILT_IN_MEMSET_CHK
9650 ? INTEGER_TYPE
: POINTER_TYPE
,
9651 INTEGER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
9654 dest
= CALL_EXPR_ARG (exp
, 0);
9655 src
= CALL_EXPR_ARG (exp
, 1);
9656 len
= CALL_EXPR_ARG (exp
, 2);
9657 size
= CALL_EXPR_ARG (exp
, 3);
9659 bool sizes_ok
= check_sizes (OPT_Wstringop_overflow_
,
9660 exp
, len
, /*maxlen=*/NULL_TREE
,
9661 /*str=*/NULL_TREE
, size
);
9663 if (!tree_fits_uhwi_p (size
))
9666 if (tree_fits_uhwi_p (len
) || integer_all_onesp (size
))
9668 /* Avoid transforming the checking call to an ordinary one when
9669 an overflow has been detected or when the call couldn't be
9670 validated because the size is not constant. */
9671 if (!sizes_ok
&& !integer_all_onesp (size
) && tree_int_cst_lt (size
, len
))
9674 tree fn
= NULL_TREE
;
9675 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
9676 mem{cpy,pcpy,move,set} is available. */
9679 case BUILT_IN_MEMCPY_CHK
:
9680 fn
= builtin_decl_explicit (BUILT_IN_MEMCPY
);
9682 case BUILT_IN_MEMPCPY_CHK
:
9683 fn
= builtin_decl_explicit (BUILT_IN_MEMPCPY
);
9685 case BUILT_IN_MEMMOVE_CHK
:
9686 fn
= builtin_decl_explicit (BUILT_IN_MEMMOVE
);
9688 case BUILT_IN_MEMSET_CHK
:
9689 fn
= builtin_decl_explicit (BUILT_IN_MEMSET
);
9698 fn
= build_call_nofold_loc (EXPR_LOCATION (exp
), fn
, 3, dest
, src
, len
);
9699 gcc_assert (TREE_CODE (fn
) == CALL_EXPR
);
9700 CALL_EXPR_TAILCALL (fn
) = CALL_EXPR_TAILCALL (exp
);
9701 return expand_expr (fn
, target
, mode
, EXPAND_NORMAL
);
9703 else if (fcode
== BUILT_IN_MEMSET_CHK
)
9707 unsigned int dest_align
= get_pointer_alignment (dest
);
9709 /* If DEST is not a pointer type, call the normal function. */
9710 if (dest_align
== 0)
9713 /* If SRC and DEST are the same (and not volatile), do nothing. */
9714 if (operand_equal_p (src
, dest
, 0))
9718 if (fcode
!= BUILT_IN_MEMPCPY_CHK
)
9720 /* Evaluate and ignore LEN in case it has side-effects. */
9721 expand_expr (len
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
9722 return expand_expr (dest
, target
, mode
, EXPAND_NORMAL
);
9725 expr
= fold_build_pointer_plus (dest
, len
);
9726 return expand_expr (expr
, target
, mode
, EXPAND_NORMAL
);
9729 /* __memmove_chk special case. */
9730 if (fcode
== BUILT_IN_MEMMOVE_CHK
)
9732 unsigned int src_align
= get_pointer_alignment (src
);
9737 /* If src is categorized for a readonly section we can use
9738 normal __memcpy_chk. */
9739 if (readonly_data_expr (src
))
9741 tree fn
= builtin_decl_explicit (BUILT_IN_MEMCPY_CHK
);
9744 fn
= build_call_nofold_loc (EXPR_LOCATION (exp
), fn
, 4,
9745 dest
, src
, len
, size
);
9746 gcc_assert (TREE_CODE (fn
) == CALL_EXPR
);
9747 CALL_EXPR_TAILCALL (fn
) = CALL_EXPR_TAILCALL (exp
);
9748 return expand_expr (fn
, target
, mode
, EXPAND_NORMAL
);
9755 /* Emit warning if a buffer overflow is detected at compile time. */
9758 maybe_emit_chk_warning (tree exp
, enum built_in_function fcode
)
9760 /* The source string. */
9761 tree srcstr
= NULL_TREE
;
9762 /* The size of the destination object. */
9763 tree objsize
= NULL_TREE
;
9764 /* The string that is being concatenated with (as in __strcat_chk)
9765 or null if it isn't. */
9766 tree catstr
= NULL_TREE
;
9767 /* The maximum length of the source sequence in a bounded operation
9768 (such as __strncat_chk) or null if the operation isn't bounded
9769 (such as __strcat_chk). */
9770 tree maxlen
= NULL_TREE
;
9774 case BUILT_IN_STRCPY_CHK
:
9775 case BUILT_IN_STPCPY_CHK
:
9776 srcstr
= CALL_EXPR_ARG (exp
, 1);
9777 objsize
= CALL_EXPR_ARG (exp
, 2);
9780 case BUILT_IN_STRCAT_CHK
:
9781 /* For __strcat_chk the warning will be emitted only if overflowing
9782 by at least strlen (dest) + 1 bytes. */
9783 catstr
= CALL_EXPR_ARG (exp
, 0);
9784 srcstr
= CALL_EXPR_ARG (exp
, 1);
9785 objsize
= CALL_EXPR_ARG (exp
, 2);
9788 case BUILT_IN_STRNCAT_CHK
:
9789 catstr
= CALL_EXPR_ARG (exp
, 0);
9790 srcstr
= CALL_EXPR_ARG (exp
, 1);
9791 maxlen
= CALL_EXPR_ARG (exp
, 2);
9792 objsize
= CALL_EXPR_ARG (exp
, 3);
9795 case BUILT_IN_STRNCPY_CHK
:
9796 case BUILT_IN_STPNCPY_CHK
:
9797 srcstr
= CALL_EXPR_ARG (exp
, 1);
9798 maxlen
= CALL_EXPR_ARG (exp
, 2);
9799 objsize
= CALL_EXPR_ARG (exp
, 3);
9802 case BUILT_IN_SNPRINTF_CHK
:
9803 case BUILT_IN_VSNPRINTF_CHK
:
9804 maxlen
= CALL_EXPR_ARG (exp
, 1);
9805 objsize
= CALL_EXPR_ARG (exp
, 3);
9811 if (catstr
&& maxlen
)
9813 /* Check __strncat_chk. There is no way to determine the length
9814 of the string to which the source string is being appended so
9815 just warn when the length of the source string is not known. */
9816 check_strncat_sizes (exp
, objsize
);
9820 check_sizes (OPT_Wstringop_overflow_
, exp
,
9821 /*size=*/NULL_TREE
, maxlen
, srcstr
, objsize
);
9824 /* Emit warning if a buffer overflow is detected at compile time
9825 in __sprintf_chk/__vsprintf_chk calls. */
9828 maybe_emit_sprintf_chk_warning (tree exp
, enum built_in_function fcode
)
9830 tree size
, len
, fmt
;
9831 const char *fmt_str
;
9832 int nargs
= call_expr_nargs (exp
);
9834 /* Verify the required arguments in the original call. */
9838 size
= CALL_EXPR_ARG (exp
, 2);
9839 fmt
= CALL_EXPR_ARG (exp
, 3);
9841 if (! tree_fits_uhwi_p (size
) || integer_all_onesp (size
))
9844 /* Check whether the format is a literal string constant. */
9845 fmt_str
= c_getstr (fmt
);
9846 if (fmt_str
== NULL
)
9849 if (!init_target_chars ())
9852 /* If the format doesn't contain % args or %%, we know its size. */
9853 if (strchr (fmt_str
, target_percent
) == 0)
9854 len
= build_int_cstu (size_type_node
, strlen (fmt_str
));
9855 /* If the format is "%s" and first ... argument is a string literal,
9857 else if (fcode
== BUILT_IN_SPRINTF_CHK
9858 && strcmp (fmt_str
, target_percent_s
) == 0)
9864 arg
= CALL_EXPR_ARG (exp
, 4);
9865 if (! POINTER_TYPE_P (TREE_TYPE (arg
)))
9868 len
= c_strlen (arg
, 1);
9869 if (!len
|| ! tree_fits_uhwi_p (len
))
9875 /* Add one for the terminating nul. */
9876 len
= fold_build2 (PLUS_EXPR
, TREE_TYPE (len
), len
, size_one_node
);
9877 check_sizes (OPT_Wstringop_overflow_
,
9878 exp
, /*size=*/NULL_TREE
, /*maxlen=*/NULL_TREE
, len
, size
);
9881 /* Emit warning if a free is called with address of a variable. */
9884 maybe_emit_free_warning (tree exp
)
9886 tree arg
= CALL_EXPR_ARG (exp
, 0);
9889 if (TREE_CODE (arg
) != ADDR_EXPR
)
9892 arg
= get_base_address (TREE_OPERAND (arg
, 0));
9893 if (arg
== NULL
|| INDIRECT_REF_P (arg
) || TREE_CODE (arg
) == MEM_REF
)
9896 if (SSA_VAR_P (arg
))
9897 warning_at (tree_nonartificial_location (exp
), OPT_Wfree_nonheap_object
,
9898 "%Kattempt to free a non-heap object %qD", exp
, arg
);
9900 warning_at (tree_nonartificial_location (exp
), OPT_Wfree_nonheap_object
,
9901 "%Kattempt to free a non-heap object", exp
);
9904 /* Fold a call to __builtin_object_size with arguments PTR and OST,
9908 fold_builtin_object_size (tree ptr
, tree ost
)
9910 unsigned HOST_WIDE_INT bytes
;
9911 int object_size_type
;
9913 if (!validate_arg (ptr
, POINTER_TYPE
)
9914 || !validate_arg (ost
, INTEGER_TYPE
))
9919 if (TREE_CODE (ost
) != INTEGER_CST
9920 || tree_int_cst_sgn (ost
) < 0
9921 || compare_tree_int (ost
, 3) > 0)
9924 object_size_type
= tree_to_shwi (ost
);
9926 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
9927 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
9928 and (size_t) 0 for types 2 and 3. */
9929 if (TREE_SIDE_EFFECTS (ptr
))
9930 return build_int_cst_type (size_type_node
, object_size_type
< 2 ? -1 : 0);
9932 if (TREE_CODE (ptr
) == ADDR_EXPR
)
9934 compute_builtin_object_size (ptr
, object_size_type
, &bytes
);
9935 if (wi::fits_to_tree_p (bytes
, size_type_node
))
9936 return build_int_cstu (size_type_node
, bytes
);
9938 else if (TREE_CODE (ptr
) == SSA_NAME
)
9940 /* If object size is not known yet, delay folding until
9941 later. Maybe subsequent passes will help determining
9943 if (compute_builtin_object_size (ptr
, object_size_type
, &bytes
)
9944 && wi::fits_to_tree_p (bytes
, size_type_node
))
9945 return build_int_cstu (size_type_node
, bytes
);
9951 /* Builtins with folding operations that operate on "..." arguments
9952 need special handling; we need to store the arguments in a convenient
9953 data structure before attempting any folding. Fortunately there are
9954 only a few builtins that fall into this category. FNDECL is the
9955 function, EXP is the CALL_EXPR for the call. */
9958 fold_builtin_varargs (location_t loc
, tree fndecl
, tree
*args
, int nargs
)
9960 enum built_in_function fcode
= DECL_FUNCTION_CODE (fndecl
);
9961 tree ret
= NULL_TREE
;
9965 case BUILT_IN_FPCLASSIFY
:
9966 ret
= fold_builtin_fpclassify (loc
, args
, nargs
);
9974 ret
= build1 (NOP_EXPR
, TREE_TYPE (ret
), ret
);
9975 SET_EXPR_LOCATION (ret
, loc
);
9976 TREE_NO_WARNING (ret
) = 1;
9982 /* Initialize format string characters in the target charset. */
9985 init_target_chars (void)
9990 target_newline
= lang_hooks
.to_target_charset ('\n');
9991 target_percent
= lang_hooks
.to_target_charset ('%');
9992 target_c
= lang_hooks
.to_target_charset ('c');
9993 target_s
= lang_hooks
.to_target_charset ('s');
9994 if (target_newline
== 0 || target_percent
== 0 || target_c
== 0
9998 target_percent_c
[0] = target_percent
;
9999 target_percent_c
[1] = target_c
;
10000 target_percent_c
[2] = '\0';
10002 target_percent_s
[0] = target_percent
;
10003 target_percent_s
[1] = target_s
;
10004 target_percent_s
[2] = '\0';
10006 target_percent_s_newline
[0] = target_percent
;
10007 target_percent_s_newline
[1] = target_s
;
10008 target_percent_s_newline
[2] = target_newline
;
10009 target_percent_s_newline
[3] = '\0';
10016 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
10017 and no overflow/underflow occurred. INEXACT is true if M was not
10018 exactly calculated. TYPE is the tree type for the result. This
10019 function assumes that you cleared the MPFR flags and then
10020 calculated M to see if anything subsequently set a flag prior to
10021 entering this function. Return NULL_TREE if any checks fail. */
10024 do_mpfr_ckconv (mpfr_srcptr m
, tree type
, int inexact
)
10026 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10027 overflow/underflow occurred. If -frounding-math, proceed iff the
10028 result of calling FUNC was exact. */
10029 if (mpfr_number_p (m
) && !mpfr_overflow_p () && !mpfr_underflow_p ()
10030 && (!flag_rounding_math
|| !inexact
))
10032 REAL_VALUE_TYPE rr
;
10034 real_from_mpfr (&rr
, m
, type
, GMP_RNDN
);
10035 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
10036 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10037 but the mpft_t is not, then we underflowed in the
10039 if (real_isfinite (&rr
)
10040 && (rr
.cl
== rvc_zero
) == (mpfr_zero_p (m
) != 0))
10042 REAL_VALUE_TYPE rmode
;
10044 real_convert (&rmode
, TYPE_MODE (type
), &rr
);
10045 /* Proceed iff the specified mode can hold the value. */
10046 if (real_identical (&rmode
, &rr
))
10047 return build_real (type
, rmode
);
10053 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
10054 number and no overflow/underflow occurred. INEXACT is true if M
10055 was not exactly calculated. TYPE is the tree type for the result.
10056 This function assumes that you cleared the MPFR flags and then
10057 calculated M to see if anything subsequently set a flag prior to
10058 entering this function. Return NULL_TREE if any checks fail, if
10059 FORCE_CONVERT is true, then bypass the checks. */
10062 do_mpc_ckconv (mpc_srcptr m
, tree type
, int inexact
, int force_convert
)
10064 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10065 overflow/underflow occurred. If -frounding-math, proceed iff the
10066 result of calling FUNC was exact. */
10068 || (mpfr_number_p (mpc_realref (m
)) && mpfr_number_p (mpc_imagref (m
))
10069 && !mpfr_overflow_p () && !mpfr_underflow_p ()
10070 && (!flag_rounding_math
|| !inexact
)))
10072 REAL_VALUE_TYPE re
, im
;
10074 real_from_mpfr (&re
, mpc_realref (m
), TREE_TYPE (type
), GMP_RNDN
);
10075 real_from_mpfr (&im
, mpc_imagref (m
), TREE_TYPE (type
), GMP_RNDN
);
10076 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
10077 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10078 but the mpft_t is not, then we underflowed in the
10081 || (real_isfinite (&re
) && real_isfinite (&im
)
10082 && (re
.cl
== rvc_zero
) == (mpfr_zero_p (mpc_realref (m
)) != 0)
10083 && (im
.cl
== rvc_zero
) == (mpfr_zero_p (mpc_imagref (m
)) != 0)))
10085 REAL_VALUE_TYPE re_mode
, im_mode
;
10087 real_convert (&re_mode
, TYPE_MODE (TREE_TYPE (type
)), &re
);
10088 real_convert (&im_mode
, TYPE_MODE (TREE_TYPE (type
)), &im
);
10089 /* Proceed iff the specified mode can hold the value. */
10091 || (real_identical (&re_mode
, &re
)
10092 && real_identical (&im_mode
, &im
)))
10093 return build_complex (type
, build_real (TREE_TYPE (type
), re_mode
),
10094 build_real (TREE_TYPE (type
), im_mode
));
10100 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
10101 the pointer *(ARG_QUO) and return the result. The type is taken
10102 from the type of ARG0 and is used for setting the precision of the
10103 calculation and results. */
10106 do_mpfr_remquo (tree arg0
, tree arg1
, tree arg_quo
)
10108 tree
const type
= TREE_TYPE (arg0
);
10109 tree result
= NULL_TREE
;
10114 /* To proceed, MPFR must exactly represent the target floating point
10115 format, which only happens when the target base equals two. */
10116 if (REAL_MODE_FORMAT (TYPE_MODE (type
))->b
== 2
10117 && TREE_CODE (arg0
) == REAL_CST
&& !TREE_OVERFLOW (arg0
)
10118 && TREE_CODE (arg1
) == REAL_CST
&& !TREE_OVERFLOW (arg1
))
10120 const REAL_VALUE_TYPE
*const ra0
= TREE_REAL_CST_PTR (arg0
);
10121 const REAL_VALUE_TYPE
*const ra1
= TREE_REAL_CST_PTR (arg1
);
10123 if (real_isfinite (ra0
) && real_isfinite (ra1
))
10125 const struct real_format
*fmt
= REAL_MODE_FORMAT (TYPE_MODE (type
));
10126 const int prec
= fmt
->p
;
10127 const mp_rnd_t rnd
= fmt
->round_towards_zero
? GMP_RNDZ
: GMP_RNDN
;
10132 mpfr_inits2 (prec
, m0
, m1
, NULL
);
10133 mpfr_from_real (m0
, ra0
, GMP_RNDN
);
10134 mpfr_from_real (m1
, ra1
, GMP_RNDN
);
10135 mpfr_clear_flags ();
10136 mpfr_remquo (m0
, &integer_quo
, m0
, m1
, rnd
);
10137 /* Remquo is independent of the rounding mode, so pass
10138 inexact=0 to do_mpfr_ckconv(). */
10139 result_rem
= do_mpfr_ckconv (m0
, type
, /*inexact=*/ 0);
10140 mpfr_clears (m0
, m1
, NULL
);
10143 /* MPFR calculates quo in the host's long so it may
10144 return more bits in quo than the target int can hold
10145 if sizeof(host long) > sizeof(target int). This can
10146 happen even for native compilers in LP64 mode. In
10147 these cases, modulo the quo value with the largest
10148 number that the target int can hold while leaving one
10149 bit for the sign. */
10150 if (sizeof (integer_quo
) * CHAR_BIT
> INT_TYPE_SIZE
)
10151 integer_quo
%= (long)(1UL << (INT_TYPE_SIZE
- 1));
10153 /* Dereference the quo pointer argument. */
10154 arg_quo
= build_fold_indirect_ref (arg_quo
);
10155 /* Proceed iff a valid pointer type was passed in. */
10156 if (TYPE_MAIN_VARIANT (TREE_TYPE (arg_quo
)) == integer_type_node
)
10158 /* Set the value. */
10160 = fold_build2 (MODIFY_EXPR
, TREE_TYPE (arg_quo
), arg_quo
,
10161 build_int_cst (TREE_TYPE (arg_quo
),
10163 TREE_SIDE_EFFECTS (result_quo
) = 1;
10164 /* Combine the quo assignment with the rem. */
10165 result
= non_lvalue (fold_build2 (COMPOUND_EXPR
, type
,
10166 result_quo
, result_rem
));
10174 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
10175 resulting value as a tree with type TYPE. The mpfr precision is
10176 set to the precision of TYPE. We assume that this mpfr function
10177 returns zero if the result could be calculated exactly within the
10178 requested precision. In addition, the integer pointer represented
10179 by ARG_SG will be dereferenced and set to the appropriate signgam
10183 do_mpfr_lgamma_r (tree arg
, tree arg_sg
, tree type
)
10185 tree result
= NULL_TREE
;
10189 /* To proceed, MPFR must exactly represent the target floating point
10190 format, which only happens when the target base equals two. Also
10191 verify ARG is a constant and that ARG_SG is an int pointer. */
10192 if (REAL_MODE_FORMAT (TYPE_MODE (type
))->b
== 2
10193 && TREE_CODE (arg
) == REAL_CST
&& !TREE_OVERFLOW (arg
)
10194 && TREE_CODE (TREE_TYPE (arg_sg
)) == POINTER_TYPE
10195 && TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (arg_sg
))) == integer_type_node
)
10197 const REAL_VALUE_TYPE
*const ra
= TREE_REAL_CST_PTR (arg
);
10199 /* In addition to NaN and Inf, the argument cannot be zero or a
10200 negative integer. */
10201 if (real_isfinite (ra
)
10202 && ra
->cl
!= rvc_zero
10203 && !(real_isneg (ra
) && real_isinteger (ra
, TYPE_MODE (type
))))
10205 const struct real_format
*fmt
= REAL_MODE_FORMAT (TYPE_MODE (type
));
10206 const int prec
= fmt
->p
;
10207 const mp_rnd_t rnd
= fmt
->round_towards_zero
? GMP_RNDZ
: GMP_RNDN
;
10212 mpfr_init2 (m
, prec
);
10213 mpfr_from_real (m
, ra
, GMP_RNDN
);
10214 mpfr_clear_flags ();
10215 inexact
= mpfr_lgamma (m
, &sg
, m
, rnd
);
10216 result_lg
= do_mpfr_ckconv (m
, type
, inexact
);
10222 /* Dereference the arg_sg pointer argument. */
10223 arg_sg
= build_fold_indirect_ref (arg_sg
);
10224 /* Assign the signgam value into *arg_sg. */
10225 result_sg
= fold_build2 (MODIFY_EXPR
,
10226 TREE_TYPE (arg_sg
), arg_sg
,
10227 build_int_cst (TREE_TYPE (arg_sg
), sg
));
10228 TREE_SIDE_EFFECTS (result_sg
) = 1;
10229 /* Combine the signgam assignment with the lgamma result. */
10230 result
= non_lvalue (fold_build2 (COMPOUND_EXPR
, type
,
10231 result_sg
, result_lg
));
10239 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
10240 mpc function FUNC on it and return the resulting value as a tree
10241 with type TYPE. The mpfr precision is set to the precision of
10242 TYPE. We assume that function FUNC returns zero if the result
10243 could be calculated exactly within the requested precision. If
10244 DO_NONFINITE is true, then fold expressions containing Inf or NaN
10245 in the arguments and/or results. */
10248 do_mpc_arg2 (tree arg0
, tree arg1
, tree type
, int do_nonfinite
,
10249 int (*func
)(mpc_ptr
, mpc_srcptr
, mpc_srcptr
, mpc_rnd_t
))
10251 tree result
= NULL_TREE
;
10256 /* To proceed, MPFR must exactly represent the target floating point
10257 format, which only happens when the target base equals two. */
10258 if (TREE_CODE (arg0
) == COMPLEX_CST
&& !TREE_OVERFLOW (arg0
)
10259 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0
))) == REAL_TYPE
10260 && TREE_CODE (arg1
) == COMPLEX_CST
&& !TREE_OVERFLOW (arg1
)
10261 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg1
))) == REAL_TYPE
10262 && REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (TREE_TYPE (arg0
))))->b
== 2)
10264 const REAL_VALUE_TYPE
*const re0
= TREE_REAL_CST_PTR (TREE_REALPART (arg0
));
10265 const REAL_VALUE_TYPE
*const im0
= TREE_REAL_CST_PTR (TREE_IMAGPART (arg0
));
10266 const REAL_VALUE_TYPE
*const re1
= TREE_REAL_CST_PTR (TREE_REALPART (arg1
));
10267 const REAL_VALUE_TYPE
*const im1
= TREE_REAL_CST_PTR (TREE_IMAGPART (arg1
));
10270 || (real_isfinite (re0
) && real_isfinite (im0
)
10271 && real_isfinite (re1
) && real_isfinite (im1
)))
10273 const struct real_format
*const fmt
=
10274 REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (type
)));
10275 const int prec
= fmt
->p
;
10276 const mp_rnd_t rnd
= fmt
->round_towards_zero
? GMP_RNDZ
: GMP_RNDN
;
10277 const mpc_rnd_t crnd
= fmt
->round_towards_zero
? MPC_RNDZZ
: MPC_RNDNN
;
10281 mpc_init2 (m0
, prec
);
10282 mpc_init2 (m1
, prec
);
10283 mpfr_from_real (mpc_realref (m0
), re0
, rnd
);
10284 mpfr_from_real (mpc_imagref (m0
), im0
, rnd
);
10285 mpfr_from_real (mpc_realref (m1
), re1
, rnd
);
10286 mpfr_from_real (mpc_imagref (m1
), im1
, rnd
);
10287 mpfr_clear_flags ();
10288 inexact
= func (m0
, m0
, m1
, crnd
);
10289 result
= do_mpc_ckconv (m0
, type
, inexact
, do_nonfinite
);
10298 /* A wrapper function for builtin folding that prevents warnings for
10299 "statement without effect" and the like, caused by removing the
10300 call node earlier than the warning is generated. */
10303 fold_call_stmt (gcall
*stmt
, bool ignore
)
10305 tree ret
= NULL_TREE
;
10306 tree fndecl
= gimple_call_fndecl (stmt
);
10307 location_t loc
= gimple_location (stmt
);
10309 && TREE_CODE (fndecl
) == FUNCTION_DECL
10310 && DECL_BUILT_IN (fndecl
)
10311 && !gimple_call_va_arg_pack_p (stmt
))
10313 int nargs
= gimple_call_num_args (stmt
);
10314 tree
*args
= (nargs
> 0
10315 ? gimple_call_arg_ptr (stmt
, 0)
10316 : &error_mark_node
);
10318 if (avoid_folding_inline_builtin (fndecl
))
10320 if (DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_MD
)
10322 return targetm
.fold_builtin (fndecl
, nargs
, args
, ignore
);
10326 ret
= fold_builtin_n (loc
, fndecl
, args
, nargs
, ignore
);
10329 /* Propagate location information from original call to
10330 expansion of builtin. Otherwise things like
10331 maybe_emit_chk_warning, that operate on the expansion
10332 of a builtin, will use the wrong location information. */
10333 if (gimple_has_location (stmt
))
10335 tree realret
= ret
;
10336 if (TREE_CODE (ret
) == NOP_EXPR
)
10337 realret
= TREE_OPERAND (ret
, 0);
10338 if (CAN_HAVE_LOCATION_P (realret
)
10339 && !EXPR_HAS_LOCATION (realret
))
10340 SET_EXPR_LOCATION (realret
, loc
);
10350 /* Look up the function in builtin_decl that corresponds to DECL
10351 and set ASMSPEC as its user assembler name. DECL must be a
10352 function decl that declares a builtin. */
10355 set_builtin_user_assembler_name (tree decl
, const char *asmspec
)
10357 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
10358 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
10361 tree builtin
= builtin_decl_explicit (DECL_FUNCTION_CODE (decl
));
10362 set_user_assembler_name (builtin
, asmspec
);
10364 if (DECL_FUNCTION_CODE (decl
) == BUILT_IN_FFS
10365 && INT_TYPE_SIZE
< BITS_PER_WORD
)
10367 set_user_assembler_libfunc ("ffs", asmspec
);
10368 set_optab_libfunc (ffs_optab
, mode_for_size (INT_TYPE_SIZE
, MODE_INT
, 0),
10373 /* Return true if DECL is a builtin that expands to a constant or similarly
10376 is_simple_builtin (tree decl
)
10378 if (decl
&& DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
)
10379 switch (DECL_FUNCTION_CODE (decl
))
10381 /* Builtins that expand to constants. */
10382 case BUILT_IN_CONSTANT_P
:
10383 case BUILT_IN_EXPECT
:
10384 case BUILT_IN_OBJECT_SIZE
:
10385 case BUILT_IN_UNREACHABLE
:
10386 /* Simple register moves or loads from stack. */
10387 case BUILT_IN_ASSUME_ALIGNED
:
10388 case BUILT_IN_RETURN_ADDRESS
:
10389 case BUILT_IN_EXTRACT_RETURN_ADDR
:
10390 case BUILT_IN_FROB_RETURN_ADDR
:
10391 case BUILT_IN_RETURN
:
10392 case BUILT_IN_AGGREGATE_INCOMING_ADDRESS
:
10393 case BUILT_IN_FRAME_ADDRESS
:
10394 case BUILT_IN_VA_END
:
10395 case BUILT_IN_STACK_SAVE
:
10396 case BUILT_IN_STACK_RESTORE
:
10397 /* Exception state returns or moves registers around. */
10398 case BUILT_IN_EH_FILTER
:
10399 case BUILT_IN_EH_POINTER
:
10400 case BUILT_IN_EH_COPY_VALUES
:
10410 /* Return true if DECL is a builtin that is not expensive, i.e., they are
10411 most probably expanded inline into reasonably simple code. This is a
10412 superset of is_simple_builtin. */
10414 is_inexpensive_builtin (tree decl
)
10418 else if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_MD
)
10420 else if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
)
10421 switch (DECL_FUNCTION_CODE (decl
))
10424 case BUILT_IN_ALLOCA
:
10425 case BUILT_IN_ALLOCA_WITH_ALIGN
:
10426 case BUILT_IN_BSWAP16
:
10427 case BUILT_IN_BSWAP32
:
10428 case BUILT_IN_BSWAP64
:
10430 case BUILT_IN_CLZIMAX
:
10431 case BUILT_IN_CLZL
:
10432 case BUILT_IN_CLZLL
:
10434 case BUILT_IN_CTZIMAX
:
10435 case BUILT_IN_CTZL
:
10436 case BUILT_IN_CTZLL
:
10438 case BUILT_IN_FFSIMAX
:
10439 case BUILT_IN_FFSL
:
10440 case BUILT_IN_FFSLL
:
10441 case BUILT_IN_IMAXABS
:
10442 case BUILT_IN_FINITE
:
10443 case BUILT_IN_FINITEF
:
10444 case BUILT_IN_FINITEL
:
10445 case BUILT_IN_FINITED32
:
10446 case BUILT_IN_FINITED64
:
10447 case BUILT_IN_FINITED128
:
10448 case BUILT_IN_FPCLASSIFY
:
10449 case BUILT_IN_ISFINITE
:
10450 case BUILT_IN_ISINF_SIGN
:
10451 case BUILT_IN_ISINF
:
10452 case BUILT_IN_ISINFF
:
10453 case BUILT_IN_ISINFL
:
10454 case BUILT_IN_ISINFD32
:
10455 case BUILT_IN_ISINFD64
:
10456 case BUILT_IN_ISINFD128
:
10457 case BUILT_IN_ISNAN
:
10458 case BUILT_IN_ISNANF
:
10459 case BUILT_IN_ISNANL
:
10460 case BUILT_IN_ISNAND32
:
10461 case BUILT_IN_ISNAND64
:
10462 case BUILT_IN_ISNAND128
:
10463 case BUILT_IN_ISNORMAL
:
10464 case BUILT_IN_ISGREATER
:
10465 case BUILT_IN_ISGREATEREQUAL
:
10466 case BUILT_IN_ISLESS
:
10467 case BUILT_IN_ISLESSEQUAL
:
10468 case BUILT_IN_ISLESSGREATER
:
10469 case BUILT_IN_ISUNORDERED
:
10470 case BUILT_IN_VA_ARG_PACK
:
10471 case BUILT_IN_VA_ARG_PACK_LEN
:
10472 case BUILT_IN_VA_COPY
:
10473 case BUILT_IN_TRAP
:
10474 case BUILT_IN_SAVEREGS
:
10475 case BUILT_IN_POPCOUNTL
:
10476 case BUILT_IN_POPCOUNTLL
:
10477 case BUILT_IN_POPCOUNTIMAX
:
10478 case BUILT_IN_POPCOUNT
:
10479 case BUILT_IN_PARITYL
:
10480 case BUILT_IN_PARITYLL
:
10481 case BUILT_IN_PARITYIMAX
:
10482 case BUILT_IN_PARITY
:
10483 case BUILT_IN_LABS
:
10484 case BUILT_IN_LLABS
:
10485 case BUILT_IN_PREFETCH
:
10486 case BUILT_IN_ACC_ON_DEVICE
:
10490 return is_simple_builtin (decl
);
10496 /* Return true if T is a constant and the value cast to a target char
10497 can be represented by a host char.
10498 Store the casted char constant in *P if so. */
10501 target_char_cst_p (tree t
, char *p
)
10503 if (!tree_fits_uhwi_p (t
) || CHAR_TYPE_SIZE
!= HOST_BITS_PER_CHAR
)
10506 *p
= (char)tree_to_uhwi (t
);