1 /* Expand builtin functions.
2 Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
3 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011,
4 2012 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
24 #include "coretypes.h"
33 #include "hard-reg-set.h"
36 #include "insn-config.h"
42 #include "typeclass.h"
46 #include "langhooks.h"
47 #include "basic-block.h"
48 #include "tree-mudflap.h"
49 #include "tree-flow.h"
50 #include "value-prof.h"
51 #include "diagnostic-core.h"
55 #ifndef PAD_VARARGS_DOWN
56 #define PAD_VARARGS_DOWN BYTES_BIG_ENDIAN
58 static tree do_mpc_arg1 (tree, tree, int (*)(mpc_ptr, mpc_srcptr, mpc_rnd_t));
60 struct target_builtins default_target_builtins;
62 struct target_builtins *this_target_builtins = &default_target_builtins;
65 /* Define the names of the builtin function types and codes. */
66 const char *const built_in_class_names[4]
67 = {"NOT_BUILT_IN", "BUILT_IN_FRONTEND", "BUILT_IN_MD", "BUILT_IN_NORMAL"};
69 #define DEF_BUILTIN(X, N, C, T, LT, B, F, NA, AT, IM, COND) #X,
70 const char * built_in_names[(int) END_BUILTINS] =
72 #include "builtins.def"
76 /* Setup an array of _DECL trees, make sure each element is
77 initialized to NULL_TREE. */
78 builtin_info_type builtin_info;
80 static const char *c_getstr (tree);
81 static rtx c_readstr (const char *, enum machine_mode);
82 static int target_char_cast (tree, char *);
83 static rtx get_memory_rtx (tree, tree);
84 static int apply_args_size (void);
85 static int apply_result_size (void);
86 #if defined (HAVE_untyped_call) || defined (HAVE_untyped_return)
87 static rtx result_vector (int, rtx);
89 static void expand_builtin_update_setjmp_buf (rtx);
90 static void expand_builtin_prefetch (tree);
91 static rtx expand_builtin_apply_args (void);
92 static rtx expand_builtin_apply_args_1 (void);
93 static rtx expand_builtin_apply (rtx, rtx, rtx);
94 static void expand_builtin_return (rtx);
95 static enum type_class type_to_class (tree);
96 static rtx expand_builtin_classify_type (tree);
97 static void expand_errno_check (tree, rtx);
98 static rtx expand_builtin_mathfn (tree, rtx, rtx);
99 static rtx expand_builtin_mathfn_2 (tree, rtx, rtx);
100 static rtx expand_builtin_mathfn_3 (tree, rtx, rtx);
101 static rtx expand_builtin_mathfn_ternary (tree, rtx, rtx);
102 static rtx expand_builtin_interclass_mathfn (tree, rtx);
103 static rtx expand_builtin_sincos (tree);
104 static rtx expand_builtin_cexpi (tree, rtx);
105 static rtx expand_builtin_int_roundingfn (tree, rtx);
106 static rtx expand_builtin_int_roundingfn_2 (tree, rtx);
107 static rtx expand_builtin_next_arg (void);
108 static rtx expand_builtin_va_start (tree);
109 static rtx expand_builtin_va_end (tree);
110 static rtx expand_builtin_va_copy (tree);
111 static rtx expand_builtin_memcmp (tree, rtx, enum machine_mode);
112 static rtx expand_builtin_strcmp (tree, rtx);
113 static rtx expand_builtin_strncmp (tree, rtx, enum machine_mode);
114 static rtx builtin_memcpy_read_str (void *, HOST_WIDE_INT, enum machine_mode);
115 static rtx expand_builtin_memcpy (tree, rtx);
116 static rtx expand_builtin_mempcpy (tree, rtx, enum machine_mode);
117 static rtx expand_builtin_mempcpy_args (tree, tree, tree, rtx,
118 enum machine_mode, int);
119 static rtx expand_builtin_strcpy (tree, rtx);
120 static rtx expand_builtin_strcpy_args (tree, tree, rtx);
121 static rtx expand_builtin_stpcpy (tree, rtx, enum machine_mode);
122 static rtx expand_builtin_strncpy (tree, rtx);
123 static rtx builtin_memset_gen_str (void *, HOST_WIDE_INT, enum machine_mode);
124 static rtx expand_builtin_memset (tree, rtx, enum machine_mode);
125 static rtx expand_builtin_memset_args (tree, tree, tree, rtx, enum machine_mode, tree);
126 static rtx expand_builtin_bzero (tree);
127 static rtx expand_builtin_strlen (tree, rtx, enum machine_mode);
128 static rtx expand_builtin_alloca (tree, bool);
129 static rtx expand_builtin_unop (enum machine_mode, tree, rtx, rtx, optab);
130 static rtx expand_builtin_frame_address (tree, tree);
131 static tree stabilize_va_list_loc (location_t, tree, int);
132 static rtx expand_builtin_expect (tree, rtx);
133 static tree fold_builtin_constant_p (tree);
134 static tree fold_builtin_expect (location_t, tree, tree);
135 static tree fold_builtin_classify_type (tree);
136 static tree fold_builtin_strlen (location_t, tree, tree);
137 static tree fold_builtin_inf (location_t, tree, int);
138 static tree fold_builtin_nan (tree, tree, int);
139 static tree rewrite_call_expr (location_t, tree, int, tree, int, ...);
140 static bool validate_arg (const_tree, enum tree_code code);
141 static bool integer_valued_real_p (tree);
142 static tree fold_trunc_transparent_mathfn (location_t, tree, tree);
143 static bool readonly_data_expr (tree);
144 static rtx expand_builtin_fabs (tree, rtx, rtx);
145 static rtx expand_builtin_signbit (tree, rtx);
146 static tree fold_builtin_sqrt (location_t, tree, tree);
147 static tree fold_builtin_cbrt (location_t, tree, tree);
148 static tree fold_builtin_pow (location_t, tree, tree, tree, tree);
149 static tree fold_builtin_powi (location_t, tree, tree, tree, tree);
150 static tree fold_builtin_cos (location_t, tree, tree, tree);
151 static tree fold_builtin_cosh (location_t, tree, tree, tree);
152 static tree fold_builtin_tan (tree, tree);
153 static tree fold_builtin_trunc (location_t, tree, tree);
154 static tree fold_builtin_floor (location_t, tree, tree);
155 static tree fold_builtin_ceil (location_t, tree, tree);
156 static tree fold_builtin_round (location_t, tree, tree);
157 static tree fold_builtin_int_roundingfn (location_t, tree, tree);
158 static tree fold_builtin_bitop (tree, tree);
159 static tree fold_builtin_memory_op (location_t, tree, tree, tree, tree, bool, int);
160 static tree fold_builtin_strchr (location_t, tree, tree, tree);
161 static tree fold_builtin_memchr (location_t, tree, tree, tree, tree);
162 static tree fold_builtin_memcmp (location_t, tree, tree, tree);
163 static tree fold_builtin_strcmp (location_t, tree, tree);
164 static tree fold_builtin_strncmp (location_t, tree, tree, tree);
165 static tree fold_builtin_signbit (location_t, tree, tree);
166 static tree fold_builtin_copysign (location_t, tree, tree, tree, tree);
167 static tree fold_builtin_isascii (location_t, tree);
168 static tree fold_builtin_toascii (location_t, tree);
169 static tree fold_builtin_isdigit (location_t, tree);
170 static tree fold_builtin_fabs (location_t, tree, tree);
171 static tree fold_builtin_abs (location_t, tree, tree);
172 static tree fold_builtin_unordered_cmp (location_t, tree, tree, tree, enum tree_code,
174 static tree fold_builtin_n (location_t, tree, tree *, int, bool);
175 static tree fold_builtin_0 (location_t, tree, bool);
176 static tree fold_builtin_1 (location_t, tree, tree, bool);
177 static tree fold_builtin_2 (location_t, tree, tree, tree, bool);
178 static tree fold_builtin_3 (location_t, tree, tree, tree, tree, bool);
179 static tree fold_builtin_4 (location_t, tree, tree, tree, tree, tree, bool);
180 static tree fold_builtin_varargs (location_t, tree, tree, bool);
182 static tree fold_builtin_strpbrk (location_t, tree, tree, tree);
183 static tree fold_builtin_strstr (location_t, tree, tree, tree);
184 static tree fold_builtin_strrchr (location_t, tree, tree, tree);
185 static tree fold_builtin_strcat (location_t, tree, tree);
186 static tree fold_builtin_strncat (location_t, tree, tree, tree);
187 static tree fold_builtin_strspn (location_t, tree, tree);
188 static tree fold_builtin_strcspn (location_t, tree, tree);
189 static tree fold_builtin_sprintf (location_t, tree, tree, tree, int);
190 static tree fold_builtin_snprintf (location_t, tree, tree, tree, tree, int);
192 static rtx expand_builtin_object_size (tree);
193 static rtx expand_builtin_memory_chk (tree, rtx, enum machine_mode,
194 enum built_in_function);
195 static void maybe_emit_chk_warning (tree, enum built_in_function);
196 static void maybe_emit_sprintf_chk_warning (tree, enum built_in_function);
197 static void maybe_emit_free_warning (tree);
198 static tree fold_builtin_object_size (tree, tree);
199 static tree fold_builtin_strcat_chk (location_t, tree, tree, tree, tree);
200 static tree fold_builtin_strncat_chk (location_t, tree, tree, tree, tree, tree);
201 static tree fold_builtin_sprintf_chk (location_t, tree, enum built_in_function);
202 static tree fold_builtin_printf (location_t, tree, tree, tree, bool, enum built_in_function);
203 static tree fold_builtin_fprintf (location_t, tree, tree, tree, tree, bool,
204 enum built_in_function);
205 static bool init_target_chars (void);
207 static unsigned HOST_WIDE_INT target_newline;
208 static unsigned HOST_WIDE_INT target_percent;
209 static unsigned HOST_WIDE_INT target_c;
210 static unsigned HOST_WIDE_INT target_s;
211 static char target_percent_c[3];
212 static char target_percent_s[3];
213 static char target_percent_s_newline[4];
214 static tree do_mpfr_arg1 (tree, tree, int (*)(mpfr_ptr, mpfr_srcptr, mp_rnd_t),
215 const REAL_VALUE_TYPE *, const REAL_VALUE_TYPE *, bool);
216 static tree do_mpfr_arg2 (tree, tree, tree,
217 int (*)(mpfr_ptr, mpfr_srcptr, mpfr_srcptr, mp_rnd_t));
218 static tree do_mpfr_arg3 (tree, tree, tree, tree,
219 int (*)(mpfr_ptr, mpfr_srcptr, mpfr_srcptr, mpfr_srcptr, mp_rnd_t));
220 static tree do_mpfr_sincos (tree, tree, tree);
221 static tree do_mpfr_bessel_n (tree, tree, tree,
222 int (*)(mpfr_ptr, long, mpfr_srcptr, mp_rnd_t),
223 const REAL_VALUE_TYPE *, bool);
224 static tree do_mpfr_remquo (tree, tree, tree);
225 static tree do_mpfr_lgamma_r (tree, tree, tree);
226 static void expand_builtin_sync_synchronize (void);
228 /* Return true if NAME starts with __builtin_ or __sync_. */
231 is_builtin_name (const char *name)
233 if (strncmp (name, "__builtin_", 10) == 0)
235 if (strncmp (name, "__sync_", 7) == 0)
237 if (strncmp (name, "__atomic_", 9) == 0)
243 /* Return true if DECL is a function symbol representing a built-in. */
246 is_builtin_fn (tree decl)
248 return TREE_CODE (decl) == FUNCTION_DECL && DECL_BUILT_IN (decl);
252 /* Return true if NODE should be considered for inline expansion regardless
253 of the optimization level. This means whenever a function is invoked with
254 its "internal" name, which normally contains the prefix "__builtin". */
257 called_as_built_in (tree node)
259 /* Note that we must use DECL_NAME, not DECL_ASSEMBLER_NAME_SET_P since
260 we want the name used to call the function, not the name it
262 const char *name = IDENTIFIER_POINTER (DECL_NAME (node));
263 return is_builtin_name (name);
266 /* Compute values M and N such that M divides (address of EXP - N) and
267 such that N < M. Store N in *BITPOSP and return M.
269 Note that the address (and thus the alignment) computed here is based
270 on the address to which a symbol resolves, whereas DECL_ALIGN is based
271 on the address at which an object is actually located. These two
272 addresses are not always the same. For example, on ARM targets,
273 the address &foo of a Thumb function foo() has the lowest bit set,
274 whereas foo() itself starts on an even address. */
277 get_object_alignment_1 (tree exp, unsigned HOST_WIDE_INT *bitposp)
279 HOST_WIDE_INT bitsize, bitpos;
281 enum machine_mode mode;
282 int unsignedp, volatilep;
283 unsigned int align, inner;
285 /* Get the innermost object and the constant (bitpos) and possibly
286 variable (offset) offset of the access. */
287 exp = get_inner_reference (exp, &bitsize, &bitpos, &offset,
288 &mode, &unsignedp, &volatilep, true);
290 /* Extract alignment information from the innermost object and
291 possibly adjust bitpos and offset. */
292 if (TREE_CODE (exp) == CONST_DECL)
293 exp = DECL_INITIAL (exp);
295 && TREE_CODE (exp) != LABEL_DECL)
297 if (TREE_CODE (exp) == FUNCTION_DECL)
299 /* Function addresses can encode extra information besides their
300 alignment. However, if TARGET_PTRMEMFUNC_VBIT_LOCATION
301 allows the low bit to be used as a virtual bit, we know
302 that the address itself must be 2-byte aligned. */
303 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn)
304 align = 2 * BITS_PER_UNIT;
306 align = BITS_PER_UNIT;
309 align = DECL_ALIGN (exp);
311 else if (CONSTANT_CLASS_P (exp))
313 align = TYPE_ALIGN (TREE_TYPE (exp));
314 #ifdef CONSTANT_ALIGNMENT
315 align = (unsigned)CONSTANT_ALIGNMENT (exp, align);
318 else if (TREE_CODE (exp) == VIEW_CONVERT_EXPR)
319 align = TYPE_ALIGN (TREE_TYPE (exp));
320 else if (TREE_CODE (exp) == INDIRECT_REF)
321 align = TYPE_ALIGN (TREE_TYPE (exp));
322 else if (TREE_CODE (exp) == MEM_REF)
324 tree addr = TREE_OPERAND (exp, 0);
325 struct ptr_info_def *pi;
326 if (TREE_CODE (addr) == BIT_AND_EXPR
327 && TREE_CODE (TREE_OPERAND (addr, 1)) == INTEGER_CST)
329 align = (TREE_INT_CST_LOW (TREE_OPERAND (addr, 1))
330 & -TREE_INT_CST_LOW (TREE_OPERAND (addr, 1)));
331 align *= BITS_PER_UNIT;
332 addr = TREE_OPERAND (addr, 0);
335 align = BITS_PER_UNIT;
336 if (TREE_CODE (addr) == SSA_NAME
337 && (pi = SSA_NAME_PTR_INFO (addr)))
339 bitpos += (pi->misalign * BITS_PER_UNIT) & ~(align - 1);
340 align = MAX (pi->align * BITS_PER_UNIT, align);
342 else if (TREE_CODE (addr) == ADDR_EXPR)
343 align = MAX (align, get_object_alignment (TREE_OPERAND (addr, 0)));
344 bitpos += mem_ref_offset (exp).low * BITS_PER_UNIT;
346 else if (TREE_CODE (exp) == TARGET_MEM_REF)
348 struct ptr_info_def *pi;
349 tree addr = TMR_BASE (exp);
350 if (TREE_CODE (addr) == BIT_AND_EXPR
351 && TREE_CODE (TREE_OPERAND (addr, 1)) == INTEGER_CST)
353 align = (TREE_INT_CST_LOW (TREE_OPERAND (addr, 1))
354 & -TREE_INT_CST_LOW (TREE_OPERAND (addr, 1)));
355 align *= BITS_PER_UNIT;
356 addr = TREE_OPERAND (addr, 0);
359 align = BITS_PER_UNIT;
360 if (TREE_CODE (addr) == SSA_NAME
361 && (pi = SSA_NAME_PTR_INFO (addr)))
363 bitpos += (pi->misalign * BITS_PER_UNIT) & ~(align - 1);
364 align = MAX (pi->align * BITS_PER_UNIT, align);
366 else if (TREE_CODE (addr) == ADDR_EXPR)
367 align = MAX (align, get_object_alignment (TREE_OPERAND (addr, 0)));
368 if (TMR_OFFSET (exp))
369 bitpos += TREE_INT_CST_LOW (TMR_OFFSET (exp)) * BITS_PER_UNIT;
370 if (TMR_INDEX (exp) && TMR_STEP (exp))
372 unsigned HOST_WIDE_INT step = TREE_INT_CST_LOW (TMR_STEP (exp));
373 align = MIN (align, (step & -step) * BITS_PER_UNIT);
375 else if (TMR_INDEX (exp))
376 align = BITS_PER_UNIT;
377 if (TMR_INDEX2 (exp))
378 align = BITS_PER_UNIT;
381 align = BITS_PER_UNIT;
383 /* If there is a non-constant offset part extract the maximum
384 alignment that can prevail. */
390 if (TREE_CODE (offset) == PLUS_EXPR)
392 next_offset = TREE_OPERAND (offset, 0);
393 offset = TREE_OPERAND (offset, 1);
397 if (host_integerp (offset, 1))
399 /* Any overflow in calculating offset_bits won't change
402 = ((unsigned) tree_low_cst (offset, 1) * BITS_PER_UNIT);
405 inner = MIN (inner, (offset_bits & -offset_bits));
407 else if (TREE_CODE (offset) == MULT_EXPR
408 && host_integerp (TREE_OPERAND (offset, 1), 1))
410 /* Any overflow in calculating offset_factor won't change
412 unsigned offset_factor
413 = ((unsigned) tree_low_cst (TREE_OPERAND (offset, 1), 1)
417 inner = MIN (inner, (offset_factor & -offset_factor));
421 inner = MIN (inner, BITS_PER_UNIT);
424 offset = next_offset;
427 /* Alignment is innermost object alignment adjusted by the constant
428 and non-constant offset parts. */
429 align = MIN (align, inner);
430 bitpos = bitpos & (align - 1);
436 /* Return the alignment in bits of EXP, an object. */
439 get_object_alignment (tree exp)
441 unsigned HOST_WIDE_INT bitpos = 0;
444 align = get_object_alignment_1 (exp, &bitpos);
446 /* align and bitpos now specify known low bits of the pointer.
447 ptr & (align - 1) == bitpos. */
450 align = (bitpos & -bitpos);
455 /* Return the alignment of object EXP, also considering its type when we do
456 not know of explicit misalignment. Only handle MEM_REF and TARGET_MEM_REF.
458 ??? Note that, in the general case, the type of an expression is not kept
459 consistent with misalignment information by the front-end, for example when
460 taking the address of a member of a packed structure. However, in most of
461 the cases, expressions have the alignment of their type so we optimistically
462 fall back to this alignment when we cannot compute a misalignment. */
465 get_object_or_type_alignment (tree exp)
467 unsigned HOST_WIDE_INT misalign;
468 unsigned int align = get_object_alignment_1 (exp, &misalign);
470 gcc_assert (TREE_CODE (exp) == MEM_REF || TREE_CODE (exp) == TARGET_MEM_REF);
473 align = (misalign & -misalign);
475 align = MAX (TYPE_ALIGN (TREE_TYPE (exp)), align);
480 /* For a pointer valued expression EXP compute values M and N such that
481 M divides (EXP - N) and such that N < M. Store N in *BITPOSP and return M.
483 If EXP is not a pointer, 0 is returned. */
486 get_pointer_alignment_1 (tree exp, unsigned HOST_WIDE_INT *bitposp)
490 if (TREE_CODE (exp) == ADDR_EXPR)
491 return get_object_alignment_1 (TREE_OPERAND (exp, 0), bitposp);
492 else if (TREE_CODE (exp) == SSA_NAME
493 && POINTER_TYPE_P (TREE_TYPE (exp)))
495 struct ptr_info_def *pi = SSA_NAME_PTR_INFO (exp);
499 return BITS_PER_UNIT;
501 *bitposp = pi->misalign * BITS_PER_UNIT;
502 return pi->align * BITS_PER_UNIT;
506 return POINTER_TYPE_P (TREE_TYPE (exp)) ? BITS_PER_UNIT : 0;
509 /* Return the alignment in bits of EXP, a pointer valued expression.
510 The alignment returned is, by default, the alignment of the thing that
511 EXP points to. If it is not a POINTER_TYPE, 0 is returned.
513 Otherwise, look at the expression to see if we can do better, i.e., if the
514 expression is actually pointing at an object whose alignment is tighter. */
517 get_pointer_alignment (tree exp)
519 unsigned HOST_WIDE_INT bitpos = 0;
522 align = get_pointer_alignment_1 (exp, &bitpos);
524 /* align and bitpos now specify known low bits of the pointer.
525 ptr & (align - 1) == bitpos. */
528 align = (bitpos & -bitpos);
533 /* Compute the length of a C string. TREE_STRING_LENGTH is not the right
534 way, because it could contain a zero byte in the middle.
535 TREE_STRING_LENGTH is the size of the character array, not the string.
537 ONLY_VALUE should be nonzero if the result is not going to be emitted
538 into the instruction stream and zero if it is going to be expanded.
539 E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3
540 is returned, otherwise NULL, since
541 len = c_strlen (src, 1); if (len) expand_expr (len, ...); would not
542 evaluate the side-effects.
544 The value returned is of type `ssizetype'.
546 Unfortunately, string_constant can't access the values of const char
547 arrays with initializers, so neither can we do so here. */
550 c_strlen (tree src, int only_value)
553 HOST_WIDE_INT offset;
559 if (TREE_CODE (src) == COND_EXPR
560 && (only_value || !TREE_SIDE_EFFECTS (TREE_OPERAND (src, 0))))
564 len1 = c_strlen (TREE_OPERAND (src, 1), only_value);
565 len2 = c_strlen (TREE_OPERAND (src, 2), only_value);
566 if (tree_int_cst_equal (len1, len2))
570 if (TREE_CODE (src) == COMPOUND_EXPR
571 && (only_value || !TREE_SIDE_EFFECTS (TREE_OPERAND (src, 0))))
572 return c_strlen (TREE_OPERAND (src, 1), only_value);
574 loc = EXPR_LOC_OR_HERE (src);
576 src = string_constant (src, &offset_node);
580 max = TREE_STRING_LENGTH (src) - 1;
581 ptr = TREE_STRING_POINTER (src);
583 if (offset_node && TREE_CODE (offset_node) != INTEGER_CST)
585 /* If the string has an internal zero byte (e.g., "foo\0bar"), we can't
586 compute the offset to the following null if we don't know where to
587 start searching for it. */
590 for (i = 0; i < max; i++)
594 /* We don't know the starting offset, but we do know that the string
595 has no internal zero bytes. We can assume that the offset falls
596 within the bounds of the string; otherwise, the programmer deserves
597 what he gets. Subtract the offset from the length of the string,
598 and return that. This would perhaps not be valid if we were dealing
599 with named arrays in addition to literal string constants. */
601 return size_diffop_loc (loc, size_int (max), offset_node);
604 /* We have a known offset into the string. Start searching there for
605 a null character if we can represent it as a single HOST_WIDE_INT. */
606 if (offset_node == 0)
608 else if (! host_integerp (offset_node, 0))
611 offset = tree_low_cst (offset_node, 0);
613 /* If the offset is known to be out of bounds, warn, and call strlen at
615 if (offset < 0 || offset > max)
617 /* Suppress multiple warnings for propagated constant strings. */
618 if (! TREE_NO_WARNING (src))
620 warning_at (loc, 0, "offset outside bounds of constant string");
621 TREE_NO_WARNING (src) = 1;
626 /* Use strlen to search for the first zero byte. Since any strings
627 constructed with build_string will have nulls appended, we win even
628 if we get handed something like (char[4])"abcd".
630 Since OFFSET is our starting index into the string, no further
631 calculation is needed. */
632 return ssize_int (strlen (ptr + offset));
635 /* Return a char pointer for a C string if it is a string constant
636 or sum of string constant and integer constant. */
643 src = string_constant (src, &offset_node);
647 if (offset_node == 0)
648 return TREE_STRING_POINTER (src);
649 else if (!host_integerp (offset_node, 1)
650 || compare_tree_int (offset_node, TREE_STRING_LENGTH (src) - 1) > 0)
653 return TREE_STRING_POINTER (src) + tree_low_cst (offset_node, 1);
656 /* Return a CONST_INT or CONST_DOUBLE corresponding to target reading
657 GET_MODE_BITSIZE (MODE) bits from string constant STR. */
660 c_readstr (const char *str, enum machine_mode mode)
666 gcc_assert (GET_MODE_CLASS (mode) == MODE_INT);
671 for (i = 0; i < GET_MODE_SIZE (mode); i++)
674 if (WORDS_BIG_ENDIAN)
675 j = GET_MODE_SIZE (mode) - i - 1;
676 if (BYTES_BIG_ENDIAN != WORDS_BIG_ENDIAN
677 && GET_MODE_SIZE (mode) >= UNITS_PER_WORD)
678 j = j + UNITS_PER_WORD - 2 * (j % UNITS_PER_WORD) - 1;
680 gcc_assert (j < 2 * HOST_BITS_PER_WIDE_INT);
683 ch = (unsigned char) str[i];
684 c[j / HOST_BITS_PER_WIDE_INT] |= ch << (j % HOST_BITS_PER_WIDE_INT);
686 return immed_double_const (c[0], c[1], mode);
689 /* Cast a target constant CST to target CHAR and if that value fits into
690 host char type, return zero and put that value into variable pointed to by
694 target_char_cast (tree cst, char *p)
696 unsigned HOST_WIDE_INT val, hostval;
698 if (TREE_CODE (cst) != INTEGER_CST
699 || CHAR_TYPE_SIZE > HOST_BITS_PER_WIDE_INT)
702 val = TREE_INT_CST_LOW (cst);
703 if (CHAR_TYPE_SIZE < HOST_BITS_PER_WIDE_INT)
704 val &= (((unsigned HOST_WIDE_INT) 1) << CHAR_TYPE_SIZE) - 1;
707 if (HOST_BITS_PER_CHAR < HOST_BITS_PER_WIDE_INT)
708 hostval &= (((unsigned HOST_WIDE_INT) 1) << HOST_BITS_PER_CHAR) - 1;
717 /* Similar to save_expr, but assumes that arbitrary code is not executed
718 in between the multiple evaluations. In particular, we assume that a
719 non-addressable local variable will not be modified. */
722 builtin_save_expr (tree exp)
724 if (TREE_CODE (exp) == SSA_NAME
725 || (TREE_ADDRESSABLE (exp) == 0
726 && (TREE_CODE (exp) == PARM_DECL
727 || (TREE_CODE (exp) == VAR_DECL && !TREE_STATIC (exp)))))
730 return save_expr (exp);
733 /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT
734 times to get the address of either a higher stack frame, or a return
735 address located within it (depending on FNDECL_CODE). */
738 expand_builtin_return_addr (enum built_in_function fndecl_code, int count)
742 #ifdef INITIAL_FRAME_ADDRESS_RTX
743 rtx tem = INITIAL_FRAME_ADDRESS_RTX;
747 /* For a zero count with __builtin_return_address, we don't care what
748 frame address we return, because target-specific definitions will
749 override us. Therefore frame pointer elimination is OK, and using
750 the soft frame pointer is OK.
752 For a nonzero count, or a zero count with __builtin_frame_address,
753 we require a stable offset from the current frame pointer to the
754 previous one, so we must use the hard frame pointer, and
755 we must disable frame pointer elimination. */
756 if (count == 0 && fndecl_code == BUILT_IN_RETURN_ADDRESS)
757 tem = frame_pointer_rtx;
760 tem = hard_frame_pointer_rtx;
762 /* Tell reload not to eliminate the frame pointer. */
763 crtl->accesses_prior_frames = 1;
767 /* Some machines need special handling before we can access
768 arbitrary frames. For example, on the SPARC, we must first flush
769 all register windows to the stack. */
770 #ifdef SETUP_FRAME_ADDRESSES
772 SETUP_FRAME_ADDRESSES ();
775 /* On the SPARC, the return address is not in the frame, it is in a
776 register. There is no way to access it off of the current frame
777 pointer, but it can be accessed off the previous frame pointer by
778 reading the value from the register window save area. */
779 #ifdef RETURN_ADDR_IN_PREVIOUS_FRAME
780 if (fndecl_code == BUILT_IN_RETURN_ADDRESS)
784 /* Scan back COUNT frames to the specified frame. */
785 for (i = 0; i < count; i++)
787 /* Assume the dynamic chain pointer is in the word that the
788 frame address points to, unless otherwise specified. */
789 #ifdef DYNAMIC_CHAIN_ADDRESS
790 tem = DYNAMIC_CHAIN_ADDRESS (tem);
792 tem = memory_address (Pmode, tem);
793 tem = gen_frame_mem (Pmode, tem);
794 tem = copy_to_reg (tem);
797 /* For __builtin_frame_address, return what we've got. But, on
798 the SPARC for example, we may have to add a bias. */
799 if (fndecl_code == BUILT_IN_FRAME_ADDRESS)
800 #ifdef FRAME_ADDR_RTX
801 return FRAME_ADDR_RTX (tem);
806 /* For __builtin_return_address, get the return address from that frame. */
807 #ifdef RETURN_ADDR_RTX
808 tem = RETURN_ADDR_RTX (count, tem);
810 tem = memory_address (Pmode,
811 plus_constant (tem, GET_MODE_SIZE (Pmode)));
812 tem = gen_frame_mem (Pmode, tem);
817 /* Alias set used for setjmp buffer. */
818 static alias_set_type setjmp_alias_set = -1;
820 /* Construct the leading half of a __builtin_setjmp call. Control will
821 return to RECEIVER_LABEL. This is also called directly by the SJLJ
822 exception handling code. */
825 expand_builtin_setjmp_setup (rtx buf_addr, rtx receiver_label)
827 enum machine_mode sa_mode = STACK_SAVEAREA_MODE (SAVE_NONLOCAL);
831 if (setjmp_alias_set == -1)
832 setjmp_alias_set = new_alias_set ();
834 buf_addr = convert_memory_address (Pmode, buf_addr);
836 buf_addr = force_reg (Pmode, force_operand (buf_addr, NULL_RTX));
838 /* We store the frame pointer and the address of receiver_label in
839 the buffer and use the rest of it for the stack save area, which
840 is machine-dependent. */
842 mem = gen_rtx_MEM (Pmode, buf_addr);
843 set_mem_alias_set (mem, setjmp_alias_set);
844 emit_move_insn (mem, targetm.builtin_setjmp_frame_value ());
846 mem = gen_rtx_MEM (Pmode, plus_constant (buf_addr, GET_MODE_SIZE (Pmode))),
847 set_mem_alias_set (mem, setjmp_alias_set);
849 emit_move_insn (validize_mem (mem),
850 force_reg (Pmode, gen_rtx_LABEL_REF (Pmode, receiver_label)));
852 stack_save = gen_rtx_MEM (sa_mode,
853 plus_constant (buf_addr,
854 2 * GET_MODE_SIZE (Pmode)));
855 set_mem_alias_set (stack_save, setjmp_alias_set);
856 emit_stack_save (SAVE_NONLOCAL, &stack_save);
858 /* If there is further processing to do, do it. */
859 #ifdef HAVE_builtin_setjmp_setup
860 if (HAVE_builtin_setjmp_setup)
861 emit_insn (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. */
872 expand_builtin_setjmp_receiver (rtx receiver_label ATTRIBUTE_UNUSED)
876 /* Clobber the FP when we get here, so we have to make sure it's
877 marked as used by this function. */
878 emit_use (hard_frame_pointer_rtx);
880 /* Mark the static chain as clobbered here so life information
881 doesn't get messed up for it. */
882 chain = targetm.calls.static_chain (current_function_decl, true);
883 if (chain && REG_P (chain))
884 emit_clobber (chain);
886 /* Now put in the code to restore the frame pointer, and argument
887 pointer, if needed. */
888 #ifdef HAVE_nonlocal_goto
889 if (! HAVE_nonlocal_goto)
892 emit_move_insn (virtual_stack_vars_rtx, hard_frame_pointer_rtx);
893 /* This might change the hard frame pointer in ways that aren't
894 apparent to early optimization passes, so force a clobber. */
895 emit_clobber (hard_frame_pointer_rtx);
898 #if !HARD_FRAME_POINTER_IS_ARG_POINTER
899 if (fixed_regs[ARG_POINTER_REGNUM])
901 #ifdef ELIMINABLE_REGS
903 static const struct elims {const int from, to;} elim_regs[] = ELIMINABLE_REGS;
905 for (i = 0; i < ARRAY_SIZE (elim_regs); i++)
906 if (elim_regs[i].from == ARG_POINTER_REGNUM
907 && elim_regs[i].to == HARD_FRAME_POINTER_REGNUM)
910 if (i == ARRAY_SIZE (elim_regs))
913 /* Now restore our arg pointer from the address at which it
914 was saved in our stack frame. */
915 emit_move_insn (crtl->args.internal_arg_pointer,
916 copy_to_reg (get_arg_pointer_save_area ()));
921 #ifdef HAVE_builtin_setjmp_receiver
922 if (HAVE_builtin_setjmp_receiver)
923 emit_insn (gen_builtin_setjmp_receiver (receiver_label));
926 #ifdef HAVE_nonlocal_goto_receiver
927 if (HAVE_nonlocal_goto_receiver)
928 emit_insn (gen_nonlocal_goto_receiver ());
933 /* We must not allow the code we just generated to be reordered by
934 scheduling. Specifically, the update of the frame pointer must
935 happen immediately, not later. */
936 emit_insn (gen_blockage ());
939 /* __builtin_longjmp is passed a pointer to an array of five words (not
940 all will be used on all machines). It operates similarly to the C
941 library function of the same name, but is more efficient. Much of
942 the code below is copied from the handling of non-local gotos. */
945 expand_builtin_longjmp (rtx buf_addr, rtx value)
947 rtx fp, lab, stack, insn, last;
948 enum machine_mode sa_mode = STACK_SAVEAREA_MODE (SAVE_NONLOCAL);
950 /* DRAP is needed for stack realign if longjmp is expanded to current
952 if (SUPPORTS_STACK_ALIGNMENT)
953 crtl->need_drap = true;
955 if (setjmp_alias_set == -1)
956 setjmp_alias_set = new_alias_set ();
958 buf_addr = convert_memory_address (Pmode, buf_addr);
960 buf_addr = force_reg (Pmode, buf_addr);
962 /* We require that the user must pass a second argument of 1, because
963 that is what builtin_setjmp will return. */
964 gcc_assert (value == const1_rtx);
966 last = get_last_insn ();
967 #ifdef HAVE_builtin_longjmp
968 if (HAVE_builtin_longjmp)
969 emit_insn (gen_builtin_longjmp (buf_addr));
973 fp = gen_rtx_MEM (Pmode, buf_addr);
974 lab = gen_rtx_MEM (Pmode, plus_constant (buf_addr,
975 GET_MODE_SIZE (Pmode)));
977 stack = gen_rtx_MEM (sa_mode, plus_constant (buf_addr,
978 2 * GET_MODE_SIZE (Pmode)));
979 set_mem_alias_set (fp, setjmp_alias_set);
980 set_mem_alias_set (lab, setjmp_alias_set);
981 set_mem_alias_set (stack, setjmp_alias_set);
983 /* Pick up FP, label, and SP from the block and jump. This code is
984 from expand_goto in stmt.c; see there for detailed comments. */
985 #ifdef HAVE_nonlocal_goto
986 if (HAVE_nonlocal_goto)
987 /* We have to pass a value to the nonlocal_goto pattern that will
988 get copied into the static_chain pointer, but it does not matter
989 what that value is, because builtin_setjmp does not use it. */
990 emit_insn (gen_nonlocal_goto (value, lab, stack, fp));
994 lab = copy_to_reg (lab);
996 emit_clobber (gen_rtx_MEM (BLKmode, gen_rtx_SCRATCH (VOIDmode)));
997 emit_clobber (gen_rtx_MEM (BLKmode, hard_frame_pointer_rtx));
999 emit_move_insn (hard_frame_pointer_rtx, fp);
1000 emit_stack_restore (SAVE_NONLOCAL, stack);
1002 emit_use (hard_frame_pointer_rtx);
1003 emit_use (stack_pointer_rtx);
1004 emit_indirect_jump (lab);
1008 /* Search backwards and mark the jump insn as a non-local goto.
1009 Note that this precludes the use of __builtin_longjmp to a
1010 __builtin_setjmp target in the same function. However, we've
1011 already cautioned the user that these functions are for
1012 internal exception handling use only. */
1013 for (insn = get_last_insn (); insn; insn = PREV_INSN (insn))
1015 gcc_assert (insn != last);
1019 add_reg_note (insn, REG_NON_LOCAL_GOTO, const0_rtx);
1022 else if (CALL_P (insn))
1027 /* Expand a call to __builtin_nonlocal_goto. We're passed the target label
1028 and the address of the save area. */
1031 expand_builtin_nonlocal_goto (tree exp)
1033 tree t_label, t_save_area;
1034 rtx r_label, r_save_area, r_fp, r_sp, insn;
1036 if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
1039 t_label = CALL_EXPR_ARG (exp, 0);
1040 t_save_area = CALL_EXPR_ARG (exp, 1);
1042 r_label = expand_normal (t_label);
1043 r_label = convert_memory_address (Pmode, r_label);
1044 r_save_area = expand_normal (t_save_area);
1045 r_save_area = convert_memory_address (Pmode, r_save_area);
1046 /* Copy the address of the save location to a register just in case it was
1047 based on the frame pointer. */
1048 r_save_area = copy_to_reg (r_save_area);
1049 r_fp = gen_rtx_MEM (Pmode, r_save_area);
1050 r_sp = gen_rtx_MEM (STACK_SAVEAREA_MODE (SAVE_NONLOCAL),
1051 plus_constant (r_save_area, GET_MODE_SIZE (Pmode)));
1053 crtl->has_nonlocal_goto = 1;
1055 #ifdef HAVE_nonlocal_goto
1056 /* ??? We no longer need to pass the static chain value, afaik. */
1057 if (HAVE_nonlocal_goto)
1058 emit_insn (gen_nonlocal_goto (const0_rtx, r_label, r_sp, r_fp));
1062 r_label = copy_to_reg (r_label);
1064 emit_clobber (gen_rtx_MEM (BLKmode, gen_rtx_SCRATCH (VOIDmode)));
1065 emit_clobber (gen_rtx_MEM (BLKmode, hard_frame_pointer_rtx));
1067 /* Restore frame pointer for containing function. */
1068 emit_move_insn (hard_frame_pointer_rtx, r_fp);
1069 emit_stack_restore (SAVE_NONLOCAL, r_sp);
1071 /* USE of hard_frame_pointer_rtx added for consistency;
1072 not clear if really needed. */
1073 emit_use (hard_frame_pointer_rtx);
1074 emit_use (stack_pointer_rtx);
1076 /* If the architecture is using a GP register, we must
1077 conservatively assume that the target function makes use of it.
1078 The prologue of functions with nonlocal gotos must therefore
1079 initialize the GP register to the appropriate value, and we
1080 must then make sure that this value is live at the point
1081 of the jump. (Note that this doesn't necessarily apply
1082 to targets with a nonlocal_goto pattern; they are free
1083 to implement it in their own way. Note also that this is
1084 a no-op if the GP register is a global invariant.) */
1085 if ((unsigned) PIC_OFFSET_TABLE_REGNUM != INVALID_REGNUM
1086 && fixed_regs[PIC_OFFSET_TABLE_REGNUM])
1087 emit_use (pic_offset_table_rtx);
1089 emit_indirect_jump (r_label);
1092 /* Search backwards to the jump insn and mark it as a
1094 for (insn = get_last_insn (); insn; insn = PREV_INSN (insn))
1098 add_reg_note (insn, REG_NON_LOCAL_GOTO, const0_rtx);
1101 else if (CALL_P (insn))
1108 /* __builtin_update_setjmp_buf is passed a pointer to an array of five words
1109 (not all will be used on all machines) that was passed to __builtin_setjmp.
1110 It updates the stack pointer in that block to correspond to the current
1114 expand_builtin_update_setjmp_buf (rtx buf_addr)
1116 enum machine_mode sa_mode = STACK_SAVEAREA_MODE (SAVE_NONLOCAL);
1118 = gen_rtx_MEM (sa_mode,
1121 plus_constant (buf_addr, 2 * GET_MODE_SIZE (Pmode))));
1123 emit_stack_save (SAVE_NONLOCAL, &stack_save);
1126 /* Expand a call to __builtin_prefetch. For a target that does not support
1127 data prefetch, evaluate the memory address argument in case it has side
1131 expand_builtin_prefetch (tree exp)
1133 tree arg0, arg1, arg2;
1137 if (!validate_arglist (exp, POINTER_TYPE, 0))
1140 arg0 = CALL_EXPR_ARG (exp, 0);
1142 /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
1143 zero (read) and argument 2 (locality) defaults to 3 (high degree of
1145 nargs = call_expr_nargs (exp);
1147 arg1 = CALL_EXPR_ARG (exp, 1);
1149 arg1 = integer_zero_node;
1151 arg2 = CALL_EXPR_ARG (exp, 2);
1153 arg2 = integer_three_node;
1155 /* Argument 0 is an address. */
1156 op0 = expand_expr (arg0, NULL_RTX, Pmode, EXPAND_NORMAL);
1158 /* Argument 1 (read/write flag) must be a compile-time constant int. */
1159 if (TREE_CODE (arg1) != INTEGER_CST)
1161 error ("second argument to %<__builtin_prefetch%> must be a constant");
1162 arg1 = integer_zero_node;
1164 op1 = expand_normal (arg1);
1165 /* Argument 1 must be either zero or one. */
1166 if (INTVAL (op1) != 0 && INTVAL (op1) != 1)
1168 warning (0, "invalid second argument to %<__builtin_prefetch%>;"
1173 /* Argument 2 (locality) must be a compile-time constant int. */
1174 if (TREE_CODE (arg2) != INTEGER_CST)
1176 error ("third argument to %<__builtin_prefetch%> must be a constant");
1177 arg2 = integer_zero_node;
1179 op2 = expand_normal (arg2);
1180 /* Argument 2 must be 0, 1, 2, or 3. */
1181 if (INTVAL (op2) < 0 || INTVAL (op2) > 3)
1183 warning (0, "invalid third argument to %<__builtin_prefetch%>; using zero");
1187 #ifdef HAVE_prefetch
1190 struct expand_operand ops[3];
1192 create_address_operand (&ops[0], op0);
1193 create_integer_operand (&ops[1], INTVAL (op1));
1194 create_integer_operand (&ops[2], INTVAL (op2));
1195 if (maybe_expand_insn (CODE_FOR_prefetch, 3, ops))
1200 /* Don't do anything with direct references to volatile memory, but
1201 generate code to handle other side effects. */
1202 if (!MEM_P (op0) && side_effects_p (op0))
1206 /* Get a MEM rtx for expression EXP which is the address of an operand
1207 to be used in a string instruction (cmpstrsi, movmemsi, ..). LEN is
1208 the maximum length of the block of memory that might be accessed or
1212 get_memory_rtx (tree exp, tree len)
1214 tree orig_exp = exp;
1218 /* When EXP is not resolved SAVE_EXPR, MEM_ATTRS can be still derived
1219 from its expression, for expr->a.b only <variable>.a.b is recorded. */
1220 if (TREE_CODE (exp) == SAVE_EXPR && !SAVE_EXPR_RESOLVED_P (exp))
1221 exp = TREE_OPERAND (exp, 0);
1223 addr = expand_expr (orig_exp, NULL_RTX, ptr_mode, EXPAND_NORMAL);
1224 mem = gen_rtx_MEM (BLKmode, memory_address (BLKmode, addr));
1226 /* Get an expression we can use to find the attributes to assign to MEM.
1227 If it is an ADDR_EXPR, use the operand. Otherwise, dereference it if
1228 we can. First remove any nops. */
1229 while (CONVERT_EXPR_P (exp)
1230 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (exp, 0))))
1231 exp = TREE_OPERAND (exp, 0);
1234 if (TREE_CODE (exp) == POINTER_PLUS_EXPR
1235 && TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
1236 && host_integerp (TREE_OPERAND (exp, 1), 0)
1237 && (off = tree_low_cst (TREE_OPERAND (exp, 1), 0)) > 0)
1238 exp = TREE_OPERAND (TREE_OPERAND (exp, 0), 0);
1239 else if (TREE_CODE (exp) == ADDR_EXPR)
1240 exp = TREE_OPERAND (exp, 0);
1241 else if (POINTER_TYPE_P (TREE_TYPE (exp)))
1242 exp = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (exp)), exp);
1246 /* Honor attributes derived from exp, except for the alias set
1247 (as builtin stringops may alias with anything) and the size
1248 (as stringops may access multiple array elements). */
1251 set_mem_attributes (mem, exp, 0);
1254 mem = adjust_automodify_address_nv (mem, BLKmode, NULL, off);
1256 /* Allow the string and memory builtins to overflow from one
1257 field into another, see http://gcc.gnu.org/PR23561.
1258 Thus avoid COMPONENT_REFs in MEM_EXPR unless we know the whole
1259 memory accessed by the string or memory builtin will fit
1260 within the field. */
1261 if (MEM_EXPR (mem) && TREE_CODE (MEM_EXPR (mem)) == COMPONENT_REF)
1263 tree mem_expr = MEM_EXPR (mem);
1264 HOST_WIDE_INT offset = -1, length = -1;
1267 while (TREE_CODE (inner) == ARRAY_REF
1268 || CONVERT_EXPR_P (inner)
1269 || TREE_CODE (inner) == VIEW_CONVERT_EXPR
1270 || TREE_CODE (inner) == SAVE_EXPR)
1271 inner = TREE_OPERAND (inner, 0);
1273 gcc_assert (TREE_CODE (inner) == COMPONENT_REF);
1275 if (MEM_OFFSET_KNOWN_P (mem))
1276 offset = MEM_OFFSET (mem);
1278 if (offset >= 0 && len && host_integerp (len, 0))
1279 length = tree_low_cst (len, 0);
1281 while (TREE_CODE (inner) == COMPONENT_REF)
1283 tree field = TREE_OPERAND (inner, 1);
1284 gcc_assert (TREE_CODE (mem_expr) == COMPONENT_REF);
1285 gcc_assert (field == TREE_OPERAND (mem_expr, 1));
1287 /* Bitfields are generally not byte-addressable. */
1288 gcc_assert (!DECL_BIT_FIELD (field)
1289 || ((tree_low_cst (DECL_FIELD_BIT_OFFSET (field), 1)
1290 % BITS_PER_UNIT) == 0
1291 && host_integerp (DECL_SIZE (field), 0)
1292 && (TREE_INT_CST_LOW (DECL_SIZE (field))
1293 % BITS_PER_UNIT) == 0));
1295 /* If we can prove that the memory starting at XEXP (mem, 0) and
1296 ending at XEXP (mem, 0) + LENGTH will fit into this field, we
1297 can keep the COMPONENT_REF in MEM_EXPR. But be careful with
1298 fields without DECL_SIZE_UNIT like flexible array members. */
1300 && DECL_SIZE_UNIT (field)
1301 && host_integerp (DECL_SIZE_UNIT (field), 0))
1304 = TREE_INT_CST_LOW (DECL_SIZE_UNIT (field));
1307 && offset + length <= size)
1312 && host_integerp (DECL_FIELD_OFFSET (field), 0))
1313 offset += TREE_INT_CST_LOW (DECL_FIELD_OFFSET (field))
1314 + tree_low_cst (DECL_FIELD_BIT_OFFSET (field), 1)
1322 mem_expr = TREE_OPERAND (mem_expr, 0);
1323 inner = TREE_OPERAND (inner, 0);
1326 if (mem_expr == NULL)
1328 if (mem_expr != MEM_EXPR (mem))
1330 set_mem_expr (mem, mem_expr);
1332 set_mem_offset (mem, offset);
1334 clear_mem_offset (mem);
1337 set_mem_alias_set (mem, 0);
1338 clear_mem_size (mem);
1344 /* Built-in functions to perform an untyped call and return. */
1346 #define apply_args_mode \
1347 (this_target_builtins->x_apply_args_mode)
1348 #define apply_result_mode \
1349 (this_target_builtins->x_apply_result_mode)
1351 /* Return the size required for the block returned by __builtin_apply_args,
1352 and initialize apply_args_mode. */
1355 apply_args_size (void)
1357 static int size = -1;
1360 enum machine_mode mode;
1362 /* The values computed by this function never change. */
1365 /* The first value is the incoming arg-pointer. */
1366 size = GET_MODE_SIZE (Pmode);
1368 /* The second value is the structure value address unless this is
1369 passed as an "invisible" first argument. */
1370 if (targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0))
1371 size += GET_MODE_SIZE (Pmode);
1373 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1374 if (FUNCTION_ARG_REGNO_P (regno))
1376 mode = targetm.calls.get_raw_arg_mode (regno);
1378 gcc_assert (mode != VOIDmode);
1380 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1381 if (size % align != 0)
1382 size = CEIL (size, align) * align;
1383 size += GET_MODE_SIZE (mode);
1384 apply_args_mode[regno] = mode;
1388 apply_args_mode[regno] = VOIDmode;
1394 /* Return the size required for the block returned by __builtin_apply,
1395 and initialize apply_result_mode. */
1398 apply_result_size (void)
1400 static int size = -1;
1402 enum machine_mode mode;
1404 /* The values computed by this function never change. */
1409 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1410 if (targetm.calls.function_value_regno_p (regno))
1412 mode = targetm.calls.get_raw_result_mode (regno);
1414 gcc_assert (mode != VOIDmode);
1416 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1417 if (size % align != 0)
1418 size = CEIL (size, align) * align;
1419 size += GET_MODE_SIZE (mode);
1420 apply_result_mode[regno] = mode;
1423 apply_result_mode[regno] = VOIDmode;
1425 /* Allow targets that use untyped_call and untyped_return to override
1426 the size so that machine-specific information can be stored here. */
1427 #ifdef APPLY_RESULT_SIZE
1428 size = APPLY_RESULT_SIZE;
1434 #if defined (HAVE_untyped_call) || defined (HAVE_untyped_return)
1435 /* Create a vector describing the result block RESULT. If SAVEP is true,
1436 the result block is used to save the values; otherwise it is used to
1437 restore the values. */
1440 result_vector (int savep, rtx result)
1442 int regno, size, align, nelts;
1443 enum machine_mode mode;
1445 rtx *savevec = XALLOCAVEC (rtx, FIRST_PSEUDO_REGISTER);
1448 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1449 if ((mode = apply_result_mode[regno]) != VOIDmode)
1451 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1452 if (size % align != 0)
1453 size = CEIL (size, align) * align;
1454 reg = gen_rtx_REG (mode, savep ? regno : INCOMING_REGNO (regno));
1455 mem = adjust_address (result, mode, size);
1456 savevec[nelts++] = (savep
1457 ? gen_rtx_SET (VOIDmode, mem, reg)
1458 : gen_rtx_SET (VOIDmode, reg, mem));
1459 size += GET_MODE_SIZE (mode);
1461 return gen_rtx_PARALLEL (VOIDmode, gen_rtvec_v (nelts, savevec));
1463 #endif /* HAVE_untyped_call or HAVE_untyped_return */
1465 /* Save the state required to perform an untyped call with the same
1466 arguments as were passed to the current function. */
1469 expand_builtin_apply_args_1 (void)
1472 int size, align, regno;
1473 enum machine_mode mode;
1474 rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1476 /* Create a block where the arg-pointer, structure value address,
1477 and argument registers can be saved. */
1478 registers = assign_stack_local (BLKmode, apply_args_size (), -1);
1480 /* Walk past the arg-pointer and structure value address. */
1481 size = GET_MODE_SIZE (Pmode);
1482 if (targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0))
1483 size += GET_MODE_SIZE (Pmode);
1485 /* Save each register used in calling a function to the block. */
1486 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1487 if ((mode = apply_args_mode[regno]) != VOIDmode)
1489 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1490 if (size % align != 0)
1491 size = CEIL (size, align) * align;
1493 tem = gen_rtx_REG (mode, INCOMING_REGNO (regno));
1495 emit_move_insn (adjust_address (registers, mode, size), tem);
1496 size += GET_MODE_SIZE (mode);
1499 /* Save the arg pointer to the block. */
1500 tem = copy_to_reg (crtl->args.internal_arg_pointer);
1501 #ifdef STACK_GROWS_DOWNWARD
1502 /* We need the pointer as the caller actually passed them to us, not
1503 as we might have pretended they were passed. Make sure it's a valid
1504 operand, as emit_move_insn isn't expected to handle a PLUS. */
1506 = force_operand (plus_constant (tem, crtl->args.pretend_args_size),
1509 emit_move_insn (adjust_address (registers, Pmode, 0), tem);
1511 size = GET_MODE_SIZE (Pmode);
1513 /* Save the structure value address unless this is passed as an
1514 "invisible" first argument. */
1515 if (struct_incoming_value)
1517 emit_move_insn (adjust_address (registers, Pmode, size),
1518 copy_to_reg (struct_incoming_value));
1519 size += GET_MODE_SIZE (Pmode);
1522 /* Return the address of the block. */
1523 return copy_addr_to_reg (XEXP (registers, 0));
1526 /* __builtin_apply_args returns block of memory allocated on
1527 the stack into which is stored the arg pointer, structure
1528 value address, static chain, and all the registers that might
1529 possibly be used in performing a function call. The code is
1530 moved to the start of the function so the incoming values are
1534 expand_builtin_apply_args (void)
1536 /* Don't do __builtin_apply_args more than once in a function.
1537 Save the result of the first call and reuse it. */
1538 if (apply_args_value != 0)
1539 return apply_args_value;
1541 /* When this function is called, it means that registers must be
1542 saved on entry to this function. So we migrate the
1543 call to the first insn of this function. */
1548 temp = expand_builtin_apply_args_1 ();
1552 apply_args_value = temp;
1554 /* Put the insns after the NOTE that starts the function.
1555 If this is inside a start_sequence, make the outer-level insn
1556 chain current, so the code is placed at the start of the
1557 function. If internal_arg_pointer is a non-virtual pseudo,
1558 it needs to be placed after the function that initializes
1560 push_topmost_sequence ();
1561 if (REG_P (crtl->args.internal_arg_pointer)
1562 && REGNO (crtl->args.internal_arg_pointer) > LAST_VIRTUAL_REGISTER)
1563 emit_insn_before (seq, parm_birth_insn);
1565 emit_insn_before (seq, NEXT_INSN (entry_of_function ()));
1566 pop_topmost_sequence ();
1571 /* Perform an untyped call and save the state required to perform an
1572 untyped return of whatever value was returned by the given function. */
1575 expand_builtin_apply (rtx function, rtx arguments, rtx argsize)
1577 int size, align, regno;
1578 enum machine_mode mode;
1579 rtx incoming_args, result, reg, dest, src, call_insn;
1580 rtx old_stack_level = 0;
1581 rtx call_fusage = 0;
1582 rtx struct_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0);
1584 arguments = convert_memory_address (Pmode, arguments);
1586 /* Create a block where the return registers can be saved. */
1587 result = assign_stack_local (BLKmode, apply_result_size (), -1);
1589 /* Fetch the arg pointer from the ARGUMENTS block. */
1590 incoming_args = gen_reg_rtx (Pmode);
1591 emit_move_insn (incoming_args, gen_rtx_MEM (Pmode, arguments));
1592 #ifndef STACK_GROWS_DOWNWARD
1593 incoming_args = expand_simple_binop (Pmode, MINUS, incoming_args, argsize,
1594 incoming_args, 0, OPTAB_LIB_WIDEN);
1597 /* Push a new argument block and copy the arguments. Do not allow
1598 the (potential) memcpy call below to interfere with our stack
1600 do_pending_stack_adjust ();
1603 /* Save the stack with nonlocal if available. */
1604 #ifdef HAVE_save_stack_nonlocal
1605 if (HAVE_save_stack_nonlocal)
1606 emit_stack_save (SAVE_NONLOCAL, &old_stack_level);
1609 emit_stack_save (SAVE_BLOCK, &old_stack_level);
1611 /* Allocate a block of memory onto the stack and copy the memory
1612 arguments to the outgoing arguments address. We can pass TRUE
1613 as the 4th argument because we just saved the stack pointer
1614 and will restore it right after the call. */
1615 allocate_dynamic_stack_space (argsize, 0, BIGGEST_ALIGNMENT, true);
1617 /* Set DRAP flag to true, even though allocate_dynamic_stack_space
1618 may have already set current_function_calls_alloca to true.
1619 current_function_calls_alloca won't be set if argsize is zero,
1620 so we have to guarantee need_drap is true here. */
1621 if (SUPPORTS_STACK_ALIGNMENT)
1622 crtl->need_drap = true;
1624 dest = virtual_outgoing_args_rtx;
1625 #ifndef STACK_GROWS_DOWNWARD
1626 if (CONST_INT_P (argsize))
1627 dest = plus_constant (dest, -INTVAL (argsize));
1629 dest = gen_rtx_PLUS (Pmode, dest, negate_rtx (Pmode, argsize));
1631 dest = gen_rtx_MEM (BLKmode, dest);
1632 set_mem_align (dest, PARM_BOUNDARY);
1633 src = gen_rtx_MEM (BLKmode, incoming_args);
1634 set_mem_align (src, PARM_BOUNDARY);
1635 emit_block_move (dest, src, argsize, BLOCK_OP_NORMAL);
1637 /* Refer to the argument block. */
1639 arguments = gen_rtx_MEM (BLKmode, arguments);
1640 set_mem_align (arguments, PARM_BOUNDARY);
1642 /* Walk past the arg-pointer and structure value address. */
1643 size = GET_MODE_SIZE (Pmode);
1645 size += GET_MODE_SIZE (Pmode);
1647 /* Restore each of the registers previously saved. Make USE insns
1648 for each of these registers for use in making the call. */
1649 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1650 if ((mode = apply_args_mode[regno]) != VOIDmode)
1652 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1653 if (size % align != 0)
1654 size = CEIL (size, align) * align;
1655 reg = gen_rtx_REG (mode, regno);
1656 emit_move_insn (reg, adjust_address (arguments, mode, size));
1657 use_reg (&call_fusage, reg);
1658 size += GET_MODE_SIZE (mode);
1661 /* Restore the structure value address unless this is passed as an
1662 "invisible" first argument. */
1663 size = GET_MODE_SIZE (Pmode);
1666 rtx value = gen_reg_rtx (Pmode);
1667 emit_move_insn (value, adjust_address (arguments, Pmode, size));
1668 emit_move_insn (struct_value, value);
1669 if (REG_P (struct_value))
1670 use_reg (&call_fusage, struct_value);
1671 size += GET_MODE_SIZE (Pmode);
1674 /* All arguments and registers used for the call are set up by now! */
1675 function = prepare_call_address (NULL, function, NULL, &call_fusage, 0, 0);
1677 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1678 and we don't want to load it into a register as an optimization,
1679 because prepare_call_address already did it if it should be done. */
1680 if (GET_CODE (function) != SYMBOL_REF)
1681 function = memory_address (FUNCTION_MODE, function);
1683 /* Generate the actual call instruction and save the return value. */
1684 #ifdef HAVE_untyped_call
1685 if (HAVE_untyped_call)
1686 emit_call_insn (gen_untyped_call (gen_rtx_MEM (FUNCTION_MODE, function),
1687 result, result_vector (1, result)));
1690 #ifdef HAVE_call_value
1691 if (HAVE_call_value)
1695 /* Locate the unique return register. It is not possible to
1696 express a call that sets more than one return register using
1697 call_value; use untyped_call for that. In fact, untyped_call
1698 only needs to save the return registers in the given block. */
1699 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1700 if ((mode = apply_result_mode[regno]) != VOIDmode)
1702 gcc_assert (!valreg); /* HAVE_untyped_call required. */
1704 valreg = gen_rtx_REG (mode, regno);
1707 emit_call_insn (GEN_CALL_VALUE (valreg,
1708 gen_rtx_MEM (FUNCTION_MODE, function),
1709 const0_rtx, NULL_RTX, const0_rtx));
1711 emit_move_insn (adjust_address (result, GET_MODE (valreg), 0), valreg);
1717 /* Find the CALL insn we just emitted, and attach the register usage
1719 call_insn = last_call_insn ();
1720 add_function_usage_to (call_insn, call_fusage);
1722 /* Restore the stack. */
1723 #ifdef HAVE_save_stack_nonlocal
1724 if (HAVE_save_stack_nonlocal)
1725 emit_stack_restore (SAVE_NONLOCAL, old_stack_level);
1728 emit_stack_restore (SAVE_BLOCK, old_stack_level);
1729 fixup_args_size_notes (call_insn, get_last_insn(), 0);
1733 /* Return the address of the result block. */
1734 result = copy_addr_to_reg (XEXP (result, 0));
1735 return convert_memory_address (ptr_mode, result);
1738 /* Perform an untyped return. */
1741 expand_builtin_return (rtx result)
1743 int size, align, regno;
1744 enum machine_mode mode;
1746 rtx call_fusage = 0;
1748 result = convert_memory_address (Pmode, result);
1750 apply_result_size ();
1751 result = gen_rtx_MEM (BLKmode, result);
1753 #ifdef HAVE_untyped_return
1754 if (HAVE_untyped_return)
1756 emit_jump_insn (gen_untyped_return (result, result_vector (0, result)));
1762 /* Restore the return value and note that each value is used. */
1764 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1765 if ((mode = apply_result_mode[regno]) != VOIDmode)
1767 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1768 if (size % align != 0)
1769 size = CEIL (size, align) * align;
1770 reg = gen_rtx_REG (mode, INCOMING_REGNO (regno));
1771 emit_move_insn (reg, adjust_address (result, mode, size));
1773 push_to_sequence (call_fusage);
1775 call_fusage = get_insns ();
1777 size += GET_MODE_SIZE (mode);
1780 /* Put the USE insns before the return. */
1781 emit_insn (call_fusage);
1783 /* Return whatever values was restored by jumping directly to the end
1785 expand_naked_return ();
1788 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1790 static enum type_class
1791 type_to_class (tree type)
1793 switch (TREE_CODE (type))
1795 case VOID_TYPE: return void_type_class;
1796 case INTEGER_TYPE: return integer_type_class;
1797 case ENUMERAL_TYPE: return enumeral_type_class;
1798 case BOOLEAN_TYPE: return boolean_type_class;
1799 case POINTER_TYPE: return pointer_type_class;
1800 case REFERENCE_TYPE: return reference_type_class;
1801 case OFFSET_TYPE: return offset_type_class;
1802 case REAL_TYPE: return real_type_class;
1803 case COMPLEX_TYPE: return complex_type_class;
1804 case FUNCTION_TYPE: return function_type_class;
1805 case METHOD_TYPE: return method_type_class;
1806 case RECORD_TYPE: return record_type_class;
1808 case QUAL_UNION_TYPE: return union_type_class;
1809 case ARRAY_TYPE: return (TYPE_STRING_FLAG (type)
1810 ? string_type_class : array_type_class);
1811 case LANG_TYPE: return lang_type_class;
1812 default: return no_type_class;
1816 /* Expand a call EXP to __builtin_classify_type. */
1819 expand_builtin_classify_type (tree exp)
1821 if (call_expr_nargs (exp))
1822 return GEN_INT (type_to_class (TREE_TYPE (CALL_EXPR_ARG (exp, 0))));
1823 return GEN_INT (no_type_class);
1826 /* This helper macro, meant to be used in mathfn_built_in below,
1827 determines which among a set of three builtin math functions is
1828 appropriate for a given type mode. The `F' and `L' cases are
1829 automatically generated from the `double' case. */
1830 #define CASE_MATHFN(BUILT_IN_MATHFN) \
1831 case BUILT_IN_MATHFN: case BUILT_IN_MATHFN##F: case BUILT_IN_MATHFN##L: \
1832 fcode = BUILT_IN_MATHFN; fcodef = BUILT_IN_MATHFN##F ; \
1833 fcodel = BUILT_IN_MATHFN##L ; break;
1834 /* Similar to above, but appends _R after any F/L suffix. */
1835 #define CASE_MATHFN_REENT(BUILT_IN_MATHFN) \
1836 case BUILT_IN_MATHFN##_R: case BUILT_IN_MATHFN##F_R: case BUILT_IN_MATHFN##L_R: \
1837 fcode = BUILT_IN_MATHFN##_R; fcodef = BUILT_IN_MATHFN##F_R ; \
1838 fcodel = BUILT_IN_MATHFN##L_R ; break;
1840 /* Return mathematic function equivalent to FN but operating directly on TYPE,
1841 if available. If IMPLICIT is true use the implicit builtin declaration,
1842 otherwise use the explicit declaration. If we can't do the conversion,
1846 mathfn_built_in_1 (tree type, enum built_in_function fn, bool implicit_p)
1848 enum built_in_function fcode, fcodef, fcodel, fcode2;
1852 CASE_MATHFN (BUILT_IN_ACOS)
1853 CASE_MATHFN (BUILT_IN_ACOSH)
1854 CASE_MATHFN (BUILT_IN_ASIN)
1855 CASE_MATHFN (BUILT_IN_ASINH)
1856 CASE_MATHFN (BUILT_IN_ATAN)
1857 CASE_MATHFN (BUILT_IN_ATAN2)
1858 CASE_MATHFN (BUILT_IN_ATANH)
1859 CASE_MATHFN (BUILT_IN_CBRT)
1860 CASE_MATHFN (BUILT_IN_CEIL)
1861 CASE_MATHFN (BUILT_IN_CEXPI)
1862 CASE_MATHFN (BUILT_IN_COPYSIGN)
1863 CASE_MATHFN (BUILT_IN_COS)
1864 CASE_MATHFN (BUILT_IN_COSH)
1865 CASE_MATHFN (BUILT_IN_DREM)
1866 CASE_MATHFN (BUILT_IN_ERF)
1867 CASE_MATHFN (BUILT_IN_ERFC)
1868 CASE_MATHFN (BUILT_IN_EXP)
1869 CASE_MATHFN (BUILT_IN_EXP10)
1870 CASE_MATHFN (BUILT_IN_EXP2)
1871 CASE_MATHFN (BUILT_IN_EXPM1)
1872 CASE_MATHFN (BUILT_IN_FABS)
1873 CASE_MATHFN (BUILT_IN_FDIM)
1874 CASE_MATHFN (BUILT_IN_FLOOR)
1875 CASE_MATHFN (BUILT_IN_FMA)
1876 CASE_MATHFN (BUILT_IN_FMAX)
1877 CASE_MATHFN (BUILT_IN_FMIN)
1878 CASE_MATHFN (BUILT_IN_FMOD)
1879 CASE_MATHFN (BUILT_IN_FREXP)
1880 CASE_MATHFN (BUILT_IN_GAMMA)
1881 CASE_MATHFN_REENT (BUILT_IN_GAMMA) /* GAMMA_R */
1882 CASE_MATHFN (BUILT_IN_HUGE_VAL)
1883 CASE_MATHFN (BUILT_IN_HYPOT)
1884 CASE_MATHFN (BUILT_IN_ILOGB)
1885 CASE_MATHFN (BUILT_IN_ICEIL)
1886 CASE_MATHFN (BUILT_IN_IFLOOR)
1887 CASE_MATHFN (BUILT_IN_INF)
1888 CASE_MATHFN (BUILT_IN_IRINT)
1889 CASE_MATHFN (BUILT_IN_IROUND)
1890 CASE_MATHFN (BUILT_IN_ISINF)
1891 CASE_MATHFN (BUILT_IN_J0)
1892 CASE_MATHFN (BUILT_IN_J1)
1893 CASE_MATHFN (BUILT_IN_JN)
1894 CASE_MATHFN (BUILT_IN_LCEIL)
1895 CASE_MATHFN (BUILT_IN_LDEXP)
1896 CASE_MATHFN (BUILT_IN_LFLOOR)
1897 CASE_MATHFN (BUILT_IN_LGAMMA)
1898 CASE_MATHFN_REENT (BUILT_IN_LGAMMA) /* LGAMMA_R */
1899 CASE_MATHFN (BUILT_IN_LLCEIL)
1900 CASE_MATHFN (BUILT_IN_LLFLOOR)
1901 CASE_MATHFN (BUILT_IN_LLRINT)
1902 CASE_MATHFN (BUILT_IN_LLROUND)
1903 CASE_MATHFN (BUILT_IN_LOG)
1904 CASE_MATHFN (BUILT_IN_LOG10)
1905 CASE_MATHFN (BUILT_IN_LOG1P)
1906 CASE_MATHFN (BUILT_IN_LOG2)
1907 CASE_MATHFN (BUILT_IN_LOGB)
1908 CASE_MATHFN (BUILT_IN_LRINT)
1909 CASE_MATHFN (BUILT_IN_LROUND)
1910 CASE_MATHFN (BUILT_IN_MODF)
1911 CASE_MATHFN (BUILT_IN_NAN)
1912 CASE_MATHFN (BUILT_IN_NANS)
1913 CASE_MATHFN (BUILT_IN_NEARBYINT)
1914 CASE_MATHFN (BUILT_IN_NEXTAFTER)
1915 CASE_MATHFN (BUILT_IN_NEXTTOWARD)
1916 CASE_MATHFN (BUILT_IN_POW)
1917 CASE_MATHFN (BUILT_IN_POWI)
1918 CASE_MATHFN (BUILT_IN_POW10)
1919 CASE_MATHFN (BUILT_IN_REMAINDER)
1920 CASE_MATHFN (BUILT_IN_REMQUO)
1921 CASE_MATHFN (BUILT_IN_RINT)
1922 CASE_MATHFN (BUILT_IN_ROUND)
1923 CASE_MATHFN (BUILT_IN_SCALB)
1924 CASE_MATHFN (BUILT_IN_SCALBLN)
1925 CASE_MATHFN (BUILT_IN_SCALBN)
1926 CASE_MATHFN (BUILT_IN_SIGNBIT)
1927 CASE_MATHFN (BUILT_IN_SIGNIFICAND)
1928 CASE_MATHFN (BUILT_IN_SIN)
1929 CASE_MATHFN (BUILT_IN_SINCOS)
1930 CASE_MATHFN (BUILT_IN_SINH)
1931 CASE_MATHFN (BUILT_IN_SQRT)
1932 CASE_MATHFN (BUILT_IN_TAN)
1933 CASE_MATHFN (BUILT_IN_TANH)
1934 CASE_MATHFN (BUILT_IN_TGAMMA)
1935 CASE_MATHFN (BUILT_IN_TRUNC)
1936 CASE_MATHFN (BUILT_IN_Y0)
1937 CASE_MATHFN (BUILT_IN_Y1)
1938 CASE_MATHFN (BUILT_IN_YN)
1944 if (TYPE_MAIN_VARIANT (type) == double_type_node)
1946 else if (TYPE_MAIN_VARIANT (type) == float_type_node)
1948 else if (TYPE_MAIN_VARIANT (type) == long_double_type_node)
1953 if (implicit_p && !builtin_decl_implicit_p (fcode2))
1956 return builtin_decl_explicit (fcode2);
1959 /* Like mathfn_built_in_1(), but always use the implicit array. */
1962 mathfn_built_in (tree type, enum built_in_function fn)
1964 return mathfn_built_in_1 (type, fn, /*implicit=*/ 1);
1967 /* If errno must be maintained, expand the RTL to check if the result,
1968 TARGET, of a built-in function call, EXP, is NaN, and if so set
1972 expand_errno_check (tree exp, rtx target)
1974 rtx lab = gen_label_rtx ();
1976 /* Test the result; if it is NaN, set errno=EDOM because
1977 the argument was not in the domain. */
1978 do_compare_rtx_and_jump (target, target, EQ, 0, GET_MODE (target),
1979 NULL_RTX, NULL_RTX, lab,
1980 /* The jump is very likely. */
1981 REG_BR_PROB_BASE - (REG_BR_PROB_BASE / 2000 - 1));
1984 /* If this built-in doesn't throw an exception, set errno directly. */
1985 if (TREE_NOTHROW (TREE_OPERAND (CALL_EXPR_FN (exp), 0)))
1987 #ifdef GEN_ERRNO_RTX
1988 rtx errno_rtx = GEN_ERRNO_RTX;
1991 = gen_rtx_MEM (word_mode, gen_rtx_SYMBOL_REF (Pmode, "errno"));
1993 emit_move_insn (errno_rtx, GEN_INT (TARGET_EDOM));
1999 /* Make sure the library call isn't expanded as a tail call. */
2000 CALL_EXPR_TAILCALL (exp) = 0;
2002 /* We can't set errno=EDOM directly; let the library call do it.
2003 Pop the arguments right away in case the call gets deleted. */
2005 expand_call (exp, target, 0);
2010 /* Expand a call to one of the builtin math functions (sqrt, exp, or log).
2011 Return NULL_RTX if a normal call should be emitted rather than expanding
2012 the function in-line. EXP is the expression that is a call to the builtin
2013 function; if convenient, the result should be placed in TARGET.
2014 SUBTARGET may be used as the target for computing one of EXP's operands. */
2017 expand_builtin_mathfn (tree exp, rtx target, rtx subtarget)
2019 optab builtin_optab;
2021 tree fndecl = get_callee_fndecl (exp);
2022 enum machine_mode mode;
2023 bool errno_set = false;
2026 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2029 arg = CALL_EXPR_ARG (exp, 0);
2031 switch (DECL_FUNCTION_CODE (fndecl))
2033 CASE_FLT_FN (BUILT_IN_SQRT):
2034 errno_set = ! tree_expr_nonnegative_p (arg);
2035 builtin_optab = sqrt_optab;
2037 CASE_FLT_FN (BUILT_IN_EXP):
2038 errno_set = true; builtin_optab = exp_optab; break;
2039 CASE_FLT_FN (BUILT_IN_EXP10):
2040 CASE_FLT_FN (BUILT_IN_POW10):
2041 errno_set = true; builtin_optab = exp10_optab; break;
2042 CASE_FLT_FN (BUILT_IN_EXP2):
2043 errno_set = true; builtin_optab = exp2_optab; break;
2044 CASE_FLT_FN (BUILT_IN_EXPM1):
2045 errno_set = true; builtin_optab = expm1_optab; break;
2046 CASE_FLT_FN (BUILT_IN_LOGB):
2047 errno_set = true; builtin_optab = logb_optab; break;
2048 CASE_FLT_FN (BUILT_IN_LOG):
2049 errno_set = true; builtin_optab = log_optab; break;
2050 CASE_FLT_FN (BUILT_IN_LOG10):
2051 errno_set = true; builtin_optab = log10_optab; break;
2052 CASE_FLT_FN (BUILT_IN_LOG2):
2053 errno_set = true; builtin_optab = log2_optab; break;
2054 CASE_FLT_FN (BUILT_IN_LOG1P):
2055 errno_set = true; builtin_optab = log1p_optab; break;
2056 CASE_FLT_FN (BUILT_IN_ASIN):
2057 builtin_optab = asin_optab; break;
2058 CASE_FLT_FN (BUILT_IN_ACOS):
2059 builtin_optab = acos_optab; break;
2060 CASE_FLT_FN (BUILT_IN_TAN):
2061 builtin_optab = tan_optab; break;
2062 CASE_FLT_FN (BUILT_IN_ATAN):
2063 builtin_optab = atan_optab; break;
2064 CASE_FLT_FN (BUILT_IN_FLOOR):
2065 builtin_optab = floor_optab; break;
2066 CASE_FLT_FN (BUILT_IN_CEIL):
2067 builtin_optab = ceil_optab; break;
2068 CASE_FLT_FN (BUILT_IN_TRUNC):
2069 builtin_optab = btrunc_optab; break;
2070 CASE_FLT_FN (BUILT_IN_ROUND):
2071 builtin_optab = round_optab; break;
2072 CASE_FLT_FN (BUILT_IN_NEARBYINT):
2073 builtin_optab = nearbyint_optab;
2074 if (flag_trapping_math)
2076 /* Else fallthrough and expand as rint. */
2077 CASE_FLT_FN (BUILT_IN_RINT):
2078 builtin_optab = rint_optab; break;
2079 CASE_FLT_FN (BUILT_IN_SIGNIFICAND):
2080 builtin_optab = significand_optab; break;
2085 /* Make a suitable register to place result in. */
2086 mode = TYPE_MODE (TREE_TYPE (exp));
2088 if (! flag_errno_math || ! HONOR_NANS (mode))
2091 /* Before working hard, check whether the instruction is available. */
2092 if (optab_handler (builtin_optab, mode) != CODE_FOR_nothing
2093 && (!errno_set || !optimize_insn_for_size_p ()))
2095 target = gen_reg_rtx (mode);
2097 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2098 need to expand the argument again. This way, we will not perform
2099 side-effects more the once. */
2100 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2102 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
2106 /* Compute into TARGET.
2107 Set TARGET to wherever the result comes back. */
2108 target = expand_unop (mode, builtin_optab, op0, target, 0);
2113 expand_errno_check (exp, target);
2115 /* Output the entire sequence. */
2116 insns = get_insns ();
2122 /* If we were unable to expand via the builtin, stop the sequence
2123 (without outputting the insns) and call to the library function
2124 with the stabilized argument list. */
2128 return expand_call (exp, target, target == const0_rtx);
2131 /* Expand a call to the builtin binary math functions (pow and atan2).
2132 Return NULL_RTX if a normal call should be emitted rather than expanding the
2133 function in-line. EXP is the expression that is a call to the builtin
2134 function; if convenient, the result should be placed in TARGET.
2135 SUBTARGET may be used as the target for computing one of EXP's
2139 expand_builtin_mathfn_2 (tree exp, rtx target, rtx subtarget)
2141 optab builtin_optab;
2142 rtx op0, op1, insns;
2143 int op1_type = REAL_TYPE;
2144 tree fndecl = get_callee_fndecl (exp);
2146 enum machine_mode mode;
2147 bool errno_set = true;
2149 switch (DECL_FUNCTION_CODE (fndecl))
2151 CASE_FLT_FN (BUILT_IN_SCALBN):
2152 CASE_FLT_FN (BUILT_IN_SCALBLN):
2153 CASE_FLT_FN (BUILT_IN_LDEXP):
2154 op1_type = INTEGER_TYPE;
2159 if (!validate_arglist (exp, REAL_TYPE, op1_type, VOID_TYPE))
2162 arg0 = CALL_EXPR_ARG (exp, 0);
2163 arg1 = CALL_EXPR_ARG (exp, 1);
2165 switch (DECL_FUNCTION_CODE (fndecl))
2167 CASE_FLT_FN (BUILT_IN_POW):
2168 builtin_optab = pow_optab; break;
2169 CASE_FLT_FN (BUILT_IN_ATAN2):
2170 builtin_optab = atan2_optab; break;
2171 CASE_FLT_FN (BUILT_IN_SCALB):
2172 if (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (exp)))->b != 2)
2174 builtin_optab = scalb_optab; break;
2175 CASE_FLT_FN (BUILT_IN_SCALBN):
2176 CASE_FLT_FN (BUILT_IN_SCALBLN):
2177 if (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (exp)))->b != 2)
2179 /* Fall through... */
2180 CASE_FLT_FN (BUILT_IN_LDEXP):
2181 builtin_optab = ldexp_optab; break;
2182 CASE_FLT_FN (BUILT_IN_FMOD):
2183 builtin_optab = fmod_optab; break;
2184 CASE_FLT_FN (BUILT_IN_REMAINDER):
2185 CASE_FLT_FN (BUILT_IN_DREM):
2186 builtin_optab = remainder_optab; break;
2191 /* Make a suitable register to place result in. */
2192 mode = TYPE_MODE (TREE_TYPE (exp));
2194 /* Before working hard, check whether the instruction is available. */
2195 if (optab_handler (builtin_optab, mode) == CODE_FOR_nothing)
2198 target = gen_reg_rtx (mode);
2200 if (! flag_errno_math || ! HONOR_NANS (mode))
2203 if (errno_set && optimize_insn_for_size_p ())
2206 /* Always stabilize the argument list. */
2207 CALL_EXPR_ARG (exp, 0) = arg0 = builtin_save_expr (arg0);
2208 CALL_EXPR_ARG (exp, 1) = arg1 = builtin_save_expr (arg1);
2210 op0 = expand_expr (arg0, subtarget, VOIDmode, EXPAND_NORMAL);
2211 op1 = expand_normal (arg1);
2215 /* Compute into TARGET.
2216 Set TARGET to wherever the result comes back. */
2217 target = expand_binop (mode, builtin_optab, op0, op1,
2218 target, 0, OPTAB_DIRECT);
2220 /* If we were unable to expand via the builtin, stop the sequence
2221 (without outputting the insns) and call to the library function
2222 with the stabilized argument list. */
2226 return expand_call (exp, target, target == const0_rtx);
2230 expand_errno_check (exp, target);
2232 /* Output the entire sequence. */
2233 insns = get_insns ();
2240 /* Expand a call to the builtin trinary math functions (fma).
2241 Return NULL_RTX if a normal call should be emitted rather than expanding the
2242 function in-line. EXP is the expression that is a call to the builtin
2243 function; if convenient, the result should be placed in TARGET.
2244 SUBTARGET may be used as the target for computing one of EXP's
2248 expand_builtin_mathfn_ternary (tree exp, rtx target, rtx subtarget)
2250 optab builtin_optab;
2251 rtx op0, op1, op2, insns;
2252 tree fndecl = get_callee_fndecl (exp);
2253 tree arg0, arg1, arg2;
2254 enum machine_mode mode;
2256 if (!validate_arglist (exp, REAL_TYPE, REAL_TYPE, REAL_TYPE, VOID_TYPE))
2259 arg0 = CALL_EXPR_ARG (exp, 0);
2260 arg1 = CALL_EXPR_ARG (exp, 1);
2261 arg2 = CALL_EXPR_ARG (exp, 2);
2263 switch (DECL_FUNCTION_CODE (fndecl))
2265 CASE_FLT_FN (BUILT_IN_FMA):
2266 builtin_optab = fma_optab; break;
2271 /* Make a suitable register to place result in. */
2272 mode = TYPE_MODE (TREE_TYPE (exp));
2274 /* Before working hard, check whether the instruction is available. */
2275 if (optab_handler (builtin_optab, mode) == CODE_FOR_nothing)
2278 target = gen_reg_rtx (mode);
2280 /* Always stabilize the argument list. */
2281 CALL_EXPR_ARG (exp, 0) = arg0 = builtin_save_expr (arg0);
2282 CALL_EXPR_ARG (exp, 1) = arg1 = builtin_save_expr (arg1);
2283 CALL_EXPR_ARG (exp, 2) = arg2 = builtin_save_expr (arg2);
2285 op0 = expand_expr (arg0, subtarget, VOIDmode, EXPAND_NORMAL);
2286 op1 = expand_normal (arg1);
2287 op2 = expand_normal (arg2);
2291 /* Compute into TARGET.
2292 Set TARGET to wherever the result comes back. */
2293 target = expand_ternary_op (mode, builtin_optab, op0, op1, op2,
2296 /* If we were unable to expand via the builtin, stop the sequence
2297 (without outputting the insns) and call to the library function
2298 with the stabilized argument list. */
2302 return expand_call (exp, target, target == const0_rtx);
2305 /* Output the entire sequence. */
2306 insns = get_insns ();
2313 /* Expand a call to the builtin sin and cos math functions.
2314 Return NULL_RTX if a normal call should be emitted rather than expanding the
2315 function in-line. EXP is the expression that is a call to the builtin
2316 function; if convenient, the result should be placed in TARGET.
2317 SUBTARGET may be used as the target for computing one of EXP's
2321 expand_builtin_mathfn_3 (tree exp, rtx target, rtx subtarget)
2323 optab builtin_optab;
2325 tree fndecl = get_callee_fndecl (exp);
2326 enum machine_mode mode;
2329 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2332 arg = CALL_EXPR_ARG (exp, 0);
2334 switch (DECL_FUNCTION_CODE (fndecl))
2336 CASE_FLT_FN (BUILT_IN_SIN):
2337 CASE_FLT_FN (BUILT_IN_COS):
2338 builtin_optab = sincos_optab; break;
2343 /* Make a suitable register to place result in. */
2344 mode = TYPE_MODE (TREE_TYPE (exp));
2346 /* Check if sincos insn is available, otherwise fallback
2347 to sin or cos insn. */
2348 if (optab_handler (builtin_optab, mode) == CODE_FOR_nothing)
2349 switch (DECL_FUNCTION_CODE (fndecl))
2351 CASE_FLT_FN (BUILT_IN_SIN):
2352 builtin_optab = sin_optab; break;
2353 CASE_FLT_FN (BUILT_IN_COS):
2354 builtin_optab = cos_optab; break;
2359 /* Before working hard, check whether the instruction is available. */
2360 if (optab_handler (builtin_optab, mode) != CODE_FOR_nothing)
2362 target = gen_reg_rtx (mode);
2364 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2365 need to expand the argument again. This way, we will not perform
2366 side-effects more the once. */
2367 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2369 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
2373 /* Compute into TARGET.
2374 Set TARGET to wherever the result comes back. */
2375 if (builtin_optab == sincos_optab)
2379 switch (DECL_FUNCTION_CODE (fndecl))
2381 CASE_FLT_FN (BUILT_IN_SIN):
2382 result = expand_twoval_unop (builtin_optab, op0, 0, target, 0);
2384 CASE_FLT_FN (BUILT_IN_COS):
2385 result = expand_twoval_unop (builtin_optab, op0, target, 0, 0);
2390 gcc_assert (result);
2394 target = expand_unop (mode, builtin_optab, op0, target, 0);
2399 /* Output the entire sequence. */
2400 insns = get_insns ();
2406 /* If we were unable to expand via the builtin, stop the sequence
2407 (without outputting the insns) and call to the library function
2408 with the stabilized argument list. */
2412 target = expand_call (exp, target, target == const0_rtx);
2417 /* Given an interclass math builtin decl FNDECL and it's argument ARG
2418 return an RTL instruction code that implements the functionality.
2419 If that isn't possible or available return CODE_FOR_nothing. */
2421 static enum insn_code
2422 interclass_mathfn_icode (tree arg, tree fndecl)
2424 bool errno_set = false;
2425 optab builtin_optab = 0;
2426 enum machine_mode mode;
2428 switch (DECL_FUNCTION_CODE (fndecl))
2430 CASE_FLT_FN (BUILT_IN_ILOGB):
2431 errno_set = true; builtin_optab = ilogb_optab; break;
2432 CASE_FLT_FN (BUILT_IN_ISINF):
2433 builtin_optab = isinf_optab; break;
2434 case BUILT_IN_ISNORMAL:
2435 case BUILT_IN_ISFINITE:
2436 CASE_FLT_FN (BUILT_IN_FINITE):
2437 case BUILT_IN_FINITED32:
2438 case BUILT_IN_FINITED64:
2439 case BUILT_IN_FINITED128:
2440 case BUILT_IN_ISINFD32:
2441 case BUILT_IN_ISINFD64:
2442 case BUILT_IN_ISINFD128:
2443 /* These builtins have no optabs (yet). */
2449 /* There's no easy way to detect the case we need to set EDOM. */
2450 if (flag_errno_math && errno_set)
2451 return CODE_FOR_nothing;
2453 /* Optab mode depends on the mode of the input argument. */
2454 mode = TYPE_MODE (TREE_TYPE (arg));
2457 return optab_handler (builtin_optab, mode);
2458 return CODE_FOR_nothing;
2461 /* Expand a call to one of the builtin math functions that operate on
2462 floating point argument and output an integer result (ilogb, isinf,
2464 Return 0 if a normal call should be emitted rather than expanding the
2465 function in-line. EXP is the expression that is a call to the builtin
2466 function; if convenient, the result should be placed in TARGET. */
2469 expand_builtin_interclass_mathfn (tree exp, rtx target)
2471 enum insn_code icode = CODE_FOR_nothing;
2473 tree fndecl = get_callee_fndecl (exp);
2474 enum machine_mode mode;
2477 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2480 arg = CALL_EXPR_ARG (exp, 0);
2481 icode = interclass_mathfn_icode (arg, fndecl);
2482 mode = TYPE_MODE (TREE_TYPE (arg));
2484 if (icode != CODE_FOR_nothing)
2486 struct expand_operand ops[1];
2487 rtx last = get_last_insn ();
2488 tree orig_arg = arg;
2490 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2491 need to expand the argument again. This way, we will not perform
2492 side-effects more the once. */
2493 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2495 op0 = expand_expr (arg, NULL_RTX, VOIDmode, EXPAND_NORMAL);
2497 if (mode != GET_MODE (op0))
2498 op0 = convert_to_mode (mode, op0, 0);
2500 create_output_operand (&ops[0], target, TYPE_MODE (TREE_TYPE (exp)));
2501 if (maybe_legitimize_operands (icode, 0, 1, ops)
2502 && maybe_emit_unop_insn (icode, ops[0].value, op0, UNKNOWN))
2503 return ops[0].value;
2505 delete_insns_since (last);
2506 CALL_EXPR_ARG (exp, 0) = orig_arg;
2512 /* Expand a call to the builtin sincos math function.
2513 Return NULL_RTX if a normal call should be emitted rather than expanding the
2514 function in-line. EXP is the expression that is a call to the builtin
2518 expand_builtin_sincos (tree exp)
2520 rtx op0, op1, op2, target1, target2;
2521 enum machine_mode mode;
2522 tree arg, sinp, cosp;
2524 location_t loc = EXPR_LOCATION (exp);
2525 tree alias_type, alias_off;
2527 if (!validate_arglist (exp, REAL_TYPE,
2528 POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
2531 arg = CALL_EXPR_ARG (exp, 0);
2532 sinp = CALL_EXPR_ARG (exp, 1);
2533 cosp = CALL_EXPR_ARG (exp, 2);
2535 /* Make a suitable register to place result in. */
2536 mode = TYPE_MODE (TREE_TYPE (arg));
2538 /* Check if sincos insn is available, otherwise emit the call. */
2539 if (optab_handler (sincos_optab, mode) == CODE_FOR_nothing)
2542 target1 = gen_reg_rtx (mode);
2543 target2 = gen_reg_rtx (mode);
2545 op0 = expand_normal (arg);
2546 alias_type = build_pointer_type_for_mode (TREE_TYPE (arg), ptr_mode, true);
2547 alias_off = build_int_cst (alias_type, 0);
2548 op1 = expand_normal (fold_build2_loc (loc, MEM_REF, TREE_TYPE (arg),
2550 op2 = expand_normal (fold_build2_loc (loc, MEM_REF, TREE_TYPE (arg),
2553 /* Compute into target1 and target2.
2554 Set TARGET to wherever the result comes back. */
2555 result = expand_twoval_unop (sincos_optab, op0, target2, target1, 0);
2556 gcc_assert (result);
2558 /* Move target1 and target2 to the memory locations indicated
2560 emit_move_insn (op1, target1);
2561 emit_move_insn (op2, target2);
2566 /* Expand a call to the internal cexpi builtin to the sincos math function.
2567 EXP is the expression that is a call to the builtin function; if convenient,
2568 the result should be placed in TARGET. */
2571 expand_builtin_cexpi (tree exp, rtx target)
2573 tree fndecl = get_callee_fndecl (exp);
2575 enum machine_mode mode;
2577 location_t loc = EXPR_LOCATION (exp);
2579 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2582 arg = CALL_EXPR_ARG (exp, 0);
2583 type = TREE_TYPE (arg);
2584 mode = TYPE_MODE (TREE_TYPE (arg));
2586 /* Try expanding via a sincos optab, fall back to emitting a libcall
2587 to sincos or cexp. We are sure we have sincos or cexp because cexpi
2588 is only generated from sincos, cexp or if we have either of them. */
2589 if (optab_handler (sincos_optab, mode) != CODE_FOR_nothing)
2591 op1 = gen_reg_rtx (mode);
2592 op2 = gen_reg_rtx (mode);
2594 op0 = expand_expr (arg, NULL_RTX, VOIDmode, EXPAND_NORMAL);
2596 /* Compute into op1 and op2. */
2597 expand_twoval_unop (sincos_optab, op0, op2, op1, 0);
2599 else if (TARGET_HAS_SINCOS)
2601 tree call, fn = NULL_TREE;
2605 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIF)
2606 fn = builtin_decl_explicit (BUILT_IN_SINCOSF);
2607 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPI)
2608 fn = builtin_decl_explicit (BUILT_IN_SINCOS);
2609 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIL)
2610 fn = builtin_decl_explicit (BUILT_IN_SINCOSL);
2614 op1 = assign_temp (TREE_TYPE (arg), 0, 1, 1);
2615 op2 = assign_temp (TREE_TYPE (arg), 0, 1, 1);
2616 op1a = copy_to_mode_reg (Pmode, XEXP (op1, 0));
2617 op2a = copy_to_mode_reg (Pmode, XEXP (op2, 0));
2618 top1 = make_tree (build_pointer_type (TREE_TYPE (arg)), op1a);
2619 top2 = make_tree (build_pointer_type (TREE_TYPE (arg)), op2a);
2621 /* Make sure not to fold the sincos call again. */
2622 call = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn);
2623 expand_normal (build_call_nary (TREE_TYPE (TREE_TYPE (fn)),
2624 call, 3, arg, top1, top2));
2628 tree call, fn = NULL_TREE, narg;
2629 tree ctype = build_complex_type (type);
2631 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIF)
2632 fn = builtin_decl_explicit (BUILT_IN_CEXPF);
2633 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPI)
2634 fn = builtin_decl_explicit (BUILT_IN_CEXP);
2635 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIL)
2636 fn = builtin_decl_explicit (BUILT_IN_CEXPL);
2640 /* If we don't have a decl for cexp create one. This is the
2641 friendliest fallback if the user calls __builtin_cexpi
2642 without full target C99 function support. */
2643 if (fn == NULL_TREE)
2646 const char *name = NULL;
2648 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIF)
2650 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPI)
2652 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIL)
2655 fntype = build_function_type_list (ctype, ctype, NULL_TREE);
2656 fn = build_fn_decl (name, fntype);
2659 narg = fold_build2_loc (loc, COMPLEX_EXPR, ctype,
2660 build_real (type, dconst0), arg);
2662 /* Make sure not to fold the cexp call again. */
2663 call = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn);
2664 return expand_expr (build_call_nary (ctype, call, 1, narg),
2665 target, VOIDmode, EXPAND_NORMAL);
2668 /* Now build the proper return type. */
2669 return expand_expr (build2 (COMPLEX_EXPR, build_complex_type (type),
2670 make_tree (TREE_TYPE (arg), op2),
2671 make_tree (TREE_TYPE (arg), op1)),
2672 target, VOIDmode, EXPAND_NORMAL);
2675 /* Conveniently construct a function call expression. FNDECL names the
2676 function to be called, N is the number of arguments, and the "..."
2677 parameters are the argument expressions. Unlike build_call_exr
2678 this doesn't fold the call, hence it will always return a CALL_EXPR. */
2681 build_call_nofold_loc (location_t loc, tree fndecl, int n, ...)
2684 tree fntype = TREE_TYPE (fndecl);
2685 tree fn = build1 (ADDR_EXPR, build_pointer_type (fntype), fndecl);
2688 fn = build_call_valist (TREE_TYPE (fntype), fn, n, ap);
2690 SET_EXPR_LOCATION (fn, loc);
2694 /* Expand a call to one of the builtin rounding functions gcc defines
2695 as an extension (lfloor and lceil). As these are gcc extensions we
2696 do not need to worry about setting errno to EDOM.
2697 If expanding via optab fails, lower expression to (int)(floor(x)).
2698 EXP is the expression that is a call to the builtin function;
2699 if convenient, the result should be placed in TARGET. */
2702 expand_builtin_int_roundingfn (tree exp, rtx target)
2704 convert_optab builtin_optab;
2705 rtx op0, insns, tmp;
2706 tree fndecl = get_callee_fndecl (exp);
2707 enum built_in_function fallback_fn;
2708 tree fallback_fndecl;
2709 enum machine_mode mode;
2712 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2715 arg = CALL_EXPR_ARG (exp, 0);
2717 switch (DECL_FUNCTION_CODE (fndecl))
2719 CASE_FLT_FN (BUILT_IN_ICEIL):
2720 CASE_FLT_FN (BUILT_IN_LCEIL):
2721 CASE_FLT_FN (BUILT_IN_LLCEIL):
2722 builtin_optab = lceil_optab;
2723 fallback_fn = BUILT_IN_CEIL;
2726 CASE_FLT_FN (BUILT_IN_IFLOOR):
2727 CASE_FLT_FN (BUILT_IN_LFLOOR):
2728 CASE_FLT_FN (BUILT_IN_LLFLOOR):
2729 builtin_optab = lfloor_optab;
2730 fallback_fn = BUILT_IN_FLOOR;
2737 /* Make a suitable register to place result in. */
2738 mode = TYPE_MODE (TREE_TYPE (exp));
2740 target = gen_reg_rtx (mode);
2742 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2743 need to expand the argument again. This way, we will not perform
2744 side-effects more the once. */
2745 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2747 op0 = expand_expr (arg, NULL, VOIDmode, EXPAND_NORMAL);
2751 /* Compute into TARGET. */
2752 if (expand_sfix_optab (target, op0, builtin_optab))
2754 /* Output the entire sequence. */
2755 insns = get_insns ();
2761 /* If we were unable to expand via the builtin, stop the sequence
2762 (without outputting the insns). */
2765 /* Fall back to floating point rounding optab. */
2766 fallback_fndecl = mathfn_built_in (TREE_TYPE (arg), fallback_fn);
2768 /* For non-C99 targets we may end up without a fallback fndecl here
2769 if the user called __builtin_lfloor directly. In this case emit
2770 a call to the floor/ceil variants nevertheless. This should result
2771 in the best user experience for not full C99 targets. */
2772 if (fallback_fndecl == NULL_TREE)
2775 const char *name = NULL;
2777 switch (DECL_FUNCTION_CODE (fndecl))
2779 case BUILT_IN_ICEIL:
2780 case BUILT_IN_LCEIL:
2781 case BUILT_IN_LLCEIL:
2784 case BUILT_IN_ICEILF:
2785 case BUILT_IN_LCEILF:
2786 case BUILT_IN_LLCEILF:
2789 case BUILT_IN_ICEILL:
2790 case BUILT_IN_LCEILL:
2791 case BUILT_IN_LLCEILL:
2794 case BUILT_IN_IFLOOR:
2795 case BUILT_IN_LFLOOR:
2796 case BUILT_IN_LLFLOOR:
2799 case BUILT_IN_IFLOORF:
2800 case BUILT_IN_LFLOORF:
2801 case BUILT_IN_LLFLOORF:
2804 case BUILT_IN_IFLOORL:
2805 case BUILT_IN_LFLOORL:
2806 case BUILT_IN_LLFLOORL:
2813 fntype = build_function_type_list (TREE_TYPE (arg),
2814 TREE_TYPE (arg), NULL_TREE);
2815 fallback_fndecl = build_fn_decl (name, fntype);
2818 exp = build_call_nofold_loc (EXPR_LOCATION (exp), fallback_fndecl, 1, arg);
2820 tmp = expand_normal (exp);
2822 /* Truncate the result of floating point optab to integer
2823 via expand_fix (). */
2824 target = gen_reg_rtx (mode);
2825 expand_fix (target, tmp, 0);
2830 /* Expand a call to one of the builtin math functions doing integer
2832 Return 0 if a normal call should be emitted rather than expanding the
2833 function in-line. EXP is the expression that is a call to the builtin
2834 function; if convenient, the result should be placed in TARGET. */
2837 expand_builtin_int_roundingfn_2 (tree exp, rtx target)
2839 convert_optab builtin_optab;
2841 tree fndecl = get_callee_fndecl (exp);
2843 enum machine_mode mode;
2844 enum built_in_function fallback_fn = BUILT_IN_NONE;
2846 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2849 arg = CALL_EXPR_ARG (exp, 0);
2851 switch (DECL_FUNCTION_CODE (fndecl))
2853 CASE_FLT_FN (BUILT_IN_IRINT):
2854 fallback_fn = BUILT_IN_LRINT;
2856 CASE_FLT_FN (BUILT_IN_LRINT):
2857 CASE_FLT_FN (BUILT_IN_LLRINT):
2858 builtin_optab = lrint_optab;
2861 CASE_FLT_FN (BUILT_IN_IROUND):
2862 fallback_fn = BUILT_IN_LROUND;
2864 CASE_FLT_FN (BUILT_IN_LROUND):
2865 CASE_FLT_FN (BUILT_IN_LLROUND):
2866 builtin_optab = lround_optab;
2873 /* There's no easy way to detect the case we need to set EDOM. */
2874 if (flag_errno_math && fallback_fn == BUILT_IN_NONE)
2877 /* Make a suitable register to place result in. */
2878 mode = TYPE_MODE (TREE_TYPE (exp));
2880 /* There's no easy way to detect the case we need to set EDOM. */
2881 if (!flag_errno_math)
2883 target = gen_reg_rtx (mode);
2885 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2886 need to expand the argument again. This way, we will not perform
2887 side-effects more the once. */
2888 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2890 op0 = expand_expr (arg, NULL, VOIDmode, EXPAND_NORMAL);
2894 if (expand_sfix_optab (target, op0, builtin_optab))
2896 /* Output the entire sequence. */
2897 insns = get_insns ();
2903 /* If we were unable to expand via the builtin, stop the sequence
2904 (without outputting the insns) and call to the library function
2905 with the stabilized argument list. */
2909 if (fallback_fn != BUILT_IN_NONE)
2911 /* Fall back to rounding to long int. Use implicit_p 0 - for non-C99
2912 targets, (int) round (x) should never be transformed into
2913 BUILT_IN_IROUND and if __builtin_iround is called directly, emit
2914 a call to lround in the hope that the target provides at least some
2915 C99 functions. This should result in the best user experience for
2916 not full C99 targets. */
2917 tree fallback_fndecl = mathfn_built_in_1 (TREE_TYPE (arg),
2920 exp = build_call_nofold_loc (EXPR_LOCATION (exp),
2921 fallback_fndecl, 1, arg);
2923 target = expand_call (exp, NULL_RTX, target == const0_rtx);
2924 return convert_to_mode (mode, target, 0);
2927 target = expand_call (exp, target, target == const0_rtx);
2932 /* Expand a call to the powi built-in mathematical function. Return NULL_RTX if
2933 a normal call should be emitted rather than expanding the function
2934 in-line. EXP is the expression that is a call to the builtin
2935 function; if convenient, the result should be placed in TARGET. */
2938 expand_builtin_powi (tree exp, rtx target)
2942 enum machine_mode mode;
2943 enum machine_mode mode2;
2945 if (! validate_arglist (exp, REAL_TYPE, INTEGER_TYPE, VOID_TYPE))
2948 arg0 = CALL_EXPR_ARG (exp, 0);
2949 arg1 = CALL_EXPR_ARG (exp, 1);
2950 mode = TYPE_MODE (TREE_TYPE (exp));
2952 /* Emit a libcall to libgcc. */
2954 /* Mode of the 2nd argument must match that of an int. */
2955 mode2 = mode_for_size (INT_TYPE_SIZE, MODE_INT, 0);
2957 if (target == NULL_RTX)
2958 target = gen_reg_rtx (mode);
2960 op0 = expand_expr (arg0, NULL_RTX, mode, EXPAND_NORMAL);
2961 if (GET_MODE (op0) != mode)
2962 op0 = convert_to_mode (mode, op0, 0);
2963 op1 = expand_expr (arg1, NULL_RTX, mode2, EXPAND_NORMAL);
2964 if (GET_MODE (op1) != mode2)
2965 op1 = convert_to_mode (mode2, op1, 0);
2967 target = emit_library_call_value (optab_libfunc (powi_optab, mode),
2968 target, LCT_CONST, mode, 2,
2969 op0, mode, op1, mode2);
2974 /* Expand expression EXP which is a call to the strlen builtin. Return
2975 NULL_RTX if we failed the caller should emit a normal call, otherwise
2976 try to get the result in TARGET, if convenient. */
2979 expand_builtin_strlen (tree exp, rtx target,
2980 enum machine_mode target_mode)
2982 if (!validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
2986 struct expand_operand ops[4];
2989 tree src = CALL_EXPR_ARG (exp, 0);
2990 rtx src_reg, before_strlen;
2991 enum machine_mode insn_mode = target_mode;
2992 enum insn_code icode = CODE_FOR_nothing;
2995 /* If the length can be computed at compile-time, return it. */
2996 len = c_strlen (src, 0);
2998 return expand_expr (len, target, target_mode, EXPAND_NORMAL);
3000 /* If the length can be computed at compile-time and is constant
3001 integer, but there are side-effects in src, evaluate
3002 src for side-effects, then return len.
3003 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
3004 can be optimized into: i++; x = 3; */
3005 len = c_strlen (src, 1);
3006 if (len && TREE_CODE (len) == INTEGER_CST)
3008 expand_expr (src, const0_rtx, VOIDmode, EXPAND_NORMAL);
3009 return expand_expr (len, target, target_mode, EXPAND_NORMAL);
3012 align = get_pointer_alignment (src) / BITS_PER_UNIT;
3014 /* If SRC is not a pointer type, don't do this operation inline. */
3018 /* Bail out if we can't compute strlen in the right mode. */
3019 while (insn_mode != VOIDmode)
3021 icode = optab_handler (strlen_optab, insn_mode);
3022 if (icode != CODE_FOR_nothing)
3025 insn_mode = GET_MODE_WIDER_MODE (insn_mode);
3027 if (insn_mode == VOIDmode)
3030 /* Make a place to hold the source address. We will not expand
3031 the actual source until we are sure that the expansion will
3032 not fail -- there are trees that cannot be expanded twice. */
3033 src_reg = gen_reg_rtx (Pmode);
3035 /* Mark the beginning of the strlen sequence so we can emit the
3036 source operand later. */
3037 before_strlen = get_last_insn ();
3039 create_output_operand (&ops[0], target, insn_mode);
3040 create_fixed_operand (&ops[1], gen_rtx_MEM (BLKmode, src_reg));
3041 create_integer_operand (&ops[2], 0);
3042 create_integer_operand (&ops[3], align);
3043 if (!maybe_expand_insn (icode, 4, ops))
3046 /* Now that we are assured of success, expand the source. */
3048 pat = expand_expr (src, src_reg, Pmode, EXPAND_NORMAL);
3051 #ifdef POINTERS_EXTEND_UNSIGNED
3052 if (GET_MODE (pat) != Pmode)
3053 pat = convert_to_mode (Pmode, pat,
3054 POINTERS_EXTEND_UNSIGNED);
3056 emit_move_insn (src_reg, pat);
3062 emit_insn_after (pat, before_strlen);
3064 emit_insn_before (pat, get_insns ());
3066 /* Return the value in the proper mode for this function. */
3067 if (GET_MODE (ops[0].value) == target_mode)
3068 target = ops[0].value;
3069 else if (target != 0)
3070 convert_move (target, ops[0].value, 0);
3072 target = convert_to_mode (target_mode, ops[0].value, 0);
3078 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3079 bytes from constant string DATA + OFFSET and return it as target
3083 builtin_memcpy_read_str (void *data, HOST_WIDE_INT offset,
3084 enum machine_mode mode)
3086 const char *str = (const char *) data;
3088 gcc_assert (offset >= 0
3089 && ((unsigned HOST_WIDE_INT) offset + GET_MODE_SIZE (mode)
3090 <= strlen (str) + 1));
3092 return c_readstr (str + offset, mode);
3095 /* Expand a call EXP to the memcpy builtin.
3096 Return NULL_RTX if we failed, the caller should emit a normal call,
3097 otherwise try to get the result in TARGET, if convenient (and in
3098 mode MODE if that's convenient). */
3101 expand_builtin_memcpy (tree exp, rtx target)
3103 if (!validate_arglist (exp,
3104 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3108 tree dest = CALL_EXPR_ARG (exp, 0);
3109 tree src = CALL_EXPR_ARG (exp, 1);
3110 tree len = CALL_EXPR_ARG (exp, 2);
3111 const char *src_str;
3112 unsigned int src_align = get_pointer_alignment (src);
3113 unsigned int dest_align = get_pointer_alignment (dest);
3114 rtx dest_mem, src_mem, dest_addr, len_rtx;
3115 HOST_WIDE_INT expected_size = -1;
3116 unsigned int expected_align = 0;
3118 /* If DEST is not a pointer type, call the normal function. */
3119 if (dest_align == 0)
3122 /* If either SRC is not a pointer type, don't do this
3123 operation in-line. */
3127 if (currently_expanding_gimple_stmt)
3128 stringop_block_profile (currently_expanding_gimple_stmt,
3129 &expected_align, &expected_size);
3131 if (expected_align < dest_align)
3132 expected_align = dest_align;
3133 dest_mem = get_memory_rtx (dest, len);
3134 set_mem_align (dest_mem, dest_align);
3135 len_rtx = expand_normal (len);
3136 src_str = c_getstr (src);
3138 /* If SRC is a string constant and block move would be done
3139 by pieces, we can avoid loading the string from memory
3140 and only stored the computed constants. */
3142 && CONST_INT_P (len_rtx)
3143 && (unsigned HOST_WIDE_INT) INTVAL (len_rtx) <= strlen (src_str) + 1
3144 && can_store_by_pieces (INTVAL (len_rtx), builtin_memcpy_read_str,
3145 CONST_CAST (char *, src_str),
3148 dest_mem = store_by_pieces (dest_mem, INTVAL (len_rtx),
3149 builtin_memcpy_read_str,
3150 CONST_CAST (char *, src_str),
3151 dest_align, false, 0);
3152 dest_mem = force_operand (XEXP (dest_mem, 0), target);
3153 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3157 src_mem = get_memory_rtx (src, len);
3158 set_mem_align (src_mem, src_align);
3160 /* Copy word part most expediently. */
3161 dest_addr = emit_block_move_hints (dest_mem, src_mem, len_rtx,
3162 CALL_EXPR_TAILCALL (exp)
3163 ? BLOCK_OP_TAILCALL : BLOCK_OP_NORMAL,
3164 expected_align, expected_size);
3168 dest_addr = force_operand (XEXP (dest_mem, 0), target);
3169 dest_addr = convert_memory_address (ptr_mode, dest_addr);
3175 /* Expand a call EXP to the mempcpy builtin.
3176 Return NULL_RTX if we failed; the caller should emit a normal call,
3177 otherwise try to get the result in TARGET, if convenient (and in
3178 mode MODE if that's convenient). If ENDP is 0 return the
3179 destination pointer, if ENDP is 1 return the end pointer ala
3180 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3184 expand_builtin_mempcpy (tree exp, rtx target, enum machine_mode mode)
3186 if (!validate_arglist (exp,
3187 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3191 tree dest = CALL_EXPR_ARG (exp, 0);
3192 tree src = CALL_EXPR_ARG (exp, 1);
3193 tree len = CALL_EXPR_ARG (exp, 2);
3194 return expand_builtin_mempcpy_args (dest, src, len,
3195 target, mode, /*endp=*/ 1);
3199 /* Helper function to do the actual work for expand_builtin_mempcpy. The
3200 arguments to the builtin_mempcpy call DEST, SRC, and LEN are broken out
3201 so that this can also be called without constructing an actual CALL_EXPR.
3202 The other arguments and return value are the same as for
3203 expand_builtin_mempcpy. */
3206 expand_builtin_mempcpy_args (tree dest, tree src, tree len,
3207 rtx target, enum machine_mode mode, int endp)
3209 /* If return value is ignored, transform mempcpy into memcpy. */
3210 if (target == const0_rtx && builtin_decl_implicit_p (BUILT_IN_MEMCPY))
3212 tree fn = builtin_decl_implicit (BUILT_IN_MEMCPY);
3213 tree result = build_call_nofold_loc (UNKNOWN_LOCATION, fn, 3,
3215 return expand_expr (result, target, mode, EXPAND_NORMAL);
3219 const char *src_str;
3220 unsigned int src_align = get_pointer_alignment (src);
3221 unsigned int dest_align = get_pointer_alignment (dest);
3222 rtx dest_mem, src_mem, len_rtx;
3224 /* If either SRC or DEST is not a pointer type, don't do this
3225 operation in-line. */
3226 if (dest_align == 0 || src_align == 0)
3229 /* If LEN is not constant, call the normal function. */
3230 if (! host_integerp (len, 1))
3233 len_rtx = expand_normal (len);
3234 src_str = c_getstr (src);
3236 /* If SRC is a string constant and block move would be done
3237 by pieces, we can avoid loading the string from memory
3238 and only stored the computed constants. */
3240 && CONST_INT_P (len_rtx)
3241 && (unsigned HOST_WIDE_INT) INTVAL (len_rtx) <= strlen (src_str) + 1
3242 && can_store_by_pieces (INTVAL (len_rtx), builtin_memcpy_read_str,
3243 CONST_CAST (char *, src_str),
3246 dest_mem = get_memory_rtx (dest, len);
3247 set_mem_align (dest_mem, dest_align);
3248 dest_mem = store_by_pieces (dest_mem, INTVAL (len_rtx),
3249 builtin_memcpy_read_str,
3250 CONST_CAST (char *, src_str),
3251 dest_align, false, endp);
3252 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3253 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3257 if (CONST_INT_P (len_rtx)
3258 && can_move_by_pieces (INTVAL (len_rtx),
3259 MIN (dest_align, src_align)))
3261 dest_mem = get_memory_rtx (dest, len);
3262 set_mem_align (dest_mem, dest_align);
3263 src_mem = get_memory_rtx (src, len);
3264 set_mem_align (src_mem, src_align);
3265 dest_mem = move_by_pieces (dest_mem, src_mem, INTVAL (len_rtx),
3266 MIN (dest_align, src_align), endp);
3267 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3268 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3277 # define HAVE_movstr 0
3278 # define CODE_FOR_movstr CODE_FOR_nothing
3281 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
3282 we failed, the caller should emit a normal call, otherwise try to
3283 get the result in TARGET, if convenient. If ENDP is 0 return the
3284 destination pointer, if ENDP is 1 return the end pointer ala
3285 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3289 expand_movstr (tree dest, tree src, rtx target, int endp)
3291 struct expand_operand ops[3];
3298 dest_mem = get_memory_rtx (dest, NULL);
3299 src_mem = get_memory_rtx (src, NULL);
3302 target = force_reg (Pmode, XEXP (dest_mem, 0));
3303 dest_mem = replace_equiv_address (dest_mem, target);
3306 create_output_operand (&ops[0], endp ? target : NULL_RTX, Pmode);
3307 create_fixed_operand (&ops[1], dest_mem);
3308 create_fixed_operand (&ops[2], src_mem);
3309 expand_insn (CODE_FOR_movstr, 3, ops);
3311 if (endp && target != const0_rtx)
3313 target = ops[0].value;
3314 /* movstr is supposed to set end to the address of the NUL
3315 terminator. If the caller requested a mempcpy-like return value,
3319 rtx tem = plus_constant (gen_lowpart (GET_MODE (target), target), 1);
3320 emit_move_insn (target, force_operand (tem, NULL_RTX));
3326 /* Expand expression EXP, which is a call to the strcpy builtin. Return
3327 NULL_RTX if we failed the caller should emit a normal call, otherwise
3328 try to get the result in TARGET, if convenient (and in mode MODE if that's
3332 expand_builtin_strcpy (tree exp, rtx target)
3334 if (validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3336 tree dest = CALL_EXPR_ARG (exp, 0);
3337 tree src = CALL_EXPR_ARG (exp, 1);
3338 return expand_builtin_strcpy_args (dest, src, target);
3343 /* Helper function to do the actual work for expand_builtin_strcpy. The
3344 arguments to the builtin_strcpy call DEST and SRC are broken out
3345 so that this can also be called without constructing an actual CALL_EXPR.
3346 The other arguments and return value are the same as for
3347 expand_builtin_strcpy. */
3350 expand_builtin_strcpy_args (tree dest, tree src, rtx target)
3352 return expand_movstr (dest, src, target, /*endp=*/0);
3355 /* Expand a call EXP to the stpcpy builtin.
3356 Return NULL_RTX if we failed the caller should emit a normal call,
3357 otherwise try to get the result in TARGET, if convenient (and in
3358 mode MODE if that's convenient). */
3361 expand_builtin_stpcpy (tree exp, rtx target, enum machine_mode mode)
3364 location_t loc = EXPR_LOCATION (exp);
3366 if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3369 dst = CALL_EXPR_ARG (exp, 0);
3370 src = CALL_EXPR_ARG (exp, 1);
3372 /* If return value is ignored, transform stpcpy into strcpy. */
3373 if (target == const0_rtx && builtin_decl_implicit (BUILT_IN_STRCPY))
3375 tree fn = builtin_decl_implicit (BUILT_IN_STRCPY);
3376 tree result = build_call_nofold_loc (loc, fn, 2, dst, src);
3377 return expand_expr (result, target, mode, EXPAND_NORMAL);
3384 /* Ensure we get an actual string whose length can be evaluated at
3385 compile-time, not an expression containing a string. This is
3386 because the latter will potentially produce pessimized code
3387 when used to produce the return value. */
3388 if (! c_getstr (src) || ! (len = c_strlen (src, 0)))
3389 return expand_movstr (dst, src, target, /*endp=*/2);
3391 lenp1 = size_binop_loc (loc, PLUS_EXPR, len, ssize_int (1));
3392 ret = expand_builtin_mempcpy_args (dst, src, lenp1,
3393 target, mode, /*endp=*/2);
3398 if (TREE_CODE (len) == INTEGER_CST)
3400 rtx len_rtx = expand_normal (len);
3402 if (CONST_INT_P (len_rtx))
3404 ret = expand_builtin_strcpy_args (dst, src, target);
3410 if (mode != VOIDmode)
3411 target = gen_reg_rtx (mode);
3413 target = gen_reg_rtx (GET_MODE (ret));
3415 if (GET_MODE (target) != GET_MODE (ret))
3416 ret = gen_lowpart (GET_MODE (target), ret);
3418 ret = plus_constant (ret, INTVAL (len_rtx));
3419 ret = emit_move_insn (target, force_operand (ret, NULL_RTX));
3427 return expand_movstr (dst, src, target, /*endp=*/2);
3431 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3432 bytes from constant string DATA + OFFSET and return it as target
3436 builtin_strncpy_read_str (void *data, HOST_WIDE_INT offset,
3437 enum machine_mode mode)
3439 const char *str = (const char *) data;
3441 if ((unsigned HOST_WIDE_INT) offset > strlen (str))
3444 return c_readstr (str + offset, mode);
3447 /* Expand expression EXP, which is a call to the strncpy builtin. Return
3448 NULL_RTX if we failed the caller should emit a normal call. */
3451 expand_builtin_strncpy (tree exp, rtx target)
3453 location_t loc = EXPR_LOCATION (exp);
3455 if (validate_arglist (exp,
3456 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3458 tree dest = CALL_EXPR_ARG (exp, 0);
3459 tree src = CALL_EXPR_ARG (exp, 1);
3460 tree len = CALL_EXPR_ARG (exp, 2);
3461 tree slen = c_strlen (src, 1);
3463 /* We must be passed a constant len and src parameter. */
3464 if (!host_integerp (len, 1) || !slen || !host_integerp (slen, 1))
3467 slen = size_binop_loc (loc, PLUS_EXPR, slen, ssize_int (1));
3469 /* We're required to pad with trailing zeros if the requested
3470 len is greater than strlen(s2)+1. In that case try to
3471 use store_by_pieces, if it fails, punt. */
3472 if (tree_int_cst_lt (slen, len))
3474 unsigned int dest_align = get_pointer_alignment (dest);
3475 const char *p = c_getstr (src);
3478 if (!p || dest_align == 0 || !host_integerp (len, 1)
3479 || !can_store_by_pieces (tree_low_cst (len, 1),
3480 builtin_strncpy_read_str,
3481 CONST_CAST (char *, p),
3485 dest_mem = get_memory_rtx (dest, len);
3486 store_by_pieces (dest_mem, tree_low_cst (len, 1),
3487 builtin_strncpy_read_str,
3488 CONST_CAST (char *, p), dest_align, false, 0);
3489 dest_mem = force_operand (XEXP (dest_mem, 0), target);
3490 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3497 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3498 bytes from constant string DATA + OFFSET and return it as target
3502 builtin_memset_read_str (void *data, HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
3503 enum machine_mode mode)
3505 const char *c = (const char *) data;
3506 char *p = XALLOCAVEC (char, GET_MODE_SIZE (mode));
3508 memset (p, *c, GET_MODE_SIZE (mode));
3510 return c_readstr (p, mode);
3513 /* Callback routine for store_by_pieces. Return the RTL of a register
3514 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
3515 char value given in the RTL register data. For example, if mode is
3516 4 bytes wide, return the RTL for 0x01010101*data. */
3519 builtin_memset_gen_str (void *data, HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
3520 enum machine_mode mode)
3526 size = GET_MODE_SIZE (mode);
3530 p = XALLOCAVEC (char, size);
3531 memset (p, 1, size);
3532 coeff = c_readstr (p, mode);
3534 target = convert_to_mode (mode, (rtx) data, 1);
3535 target = expand_mult (mode, target, coeff, NULL_RTX, 1);
3536 return force_reg (mode, target);
3539 /* Expand expression EXP, which is a call to the memset builtin. Return
3540 NULL_RTX if we failed the caller should emit a normal call, otherwise
3541 try to get the result in TARGET, if convenient (and in mode MODE if that's
3545 expand_builtin_memset (tree exp, rtx target, enum machine_mode mode)
3547 if (!validate_arglist (exp,
3548 POINTER_TYPE, INTEGER_TYPE, INTEGER_TYPE, VOID_TYPE))
3552 tree dest = CALL_EXPR_ARG (exp, 0);
3553 tree val = CALL_EXPR_ARG (exp, 1);
3554 tree len = CALL_EXPR_ARG (exp, 2);
3555 return expand_builtin_memset_args (dest, val, len, target, mode, exp);
3559 /* Helper function to do the actual work for expand_builtin_memset. The
3560 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
3561 so that this can also be called without constructing an actual CALL_EXPR.
3562 The other arguments and return value are the same as for
3563 expand_builtin_memset. */
3566 expand_builtin_memset_args (tree dest, tree val, tree len,
3567 rtx target, enum machine_mode mode, tree orig_exp)
3570 enum built_in_function fcode;
3571 enum machine_mode val_mode;
3573 unsigned int dest_align;
3574 rtx dest_mem, dest_addr, len_rtx;
3575 HOST_WIDE_INT expected_size = -1;
3576 unsigned int expected_align = 0;
3578 dest_align = get_pointer_alignment (dest);
3580 /* If DEST is not a pointer type, don't do this operation in-line. */
3581 if (dest_align == 0)
3584 if (currently_expanding_gimple_stmt)
3585 stringop_block_profile (currently_expanding_gimple_stmt,
3586 &expected_align, &expected_size);
3588 if (expected_align < dest_align)
3589 expected_align = dest_align;
3591 /* If the LEN parameter is zero, return DEST. */
3592 if (integer_zerop (len))
3594 /* Evaluate and ignore VAL in case it has side-effects. */
3595 expand_expr (val, const0_rtx, VOIDmode, EXPAND_NORMAL);
3596 return expand_expr (dest, target, mode, EXPAND_NORMAL);
3599 /* Stabilize the arguments in case we fail. */
3600 dest = builtin_save_expr (dest);
3601 val = builtin_save_expr (val);
3602 len = builtin_save_expr (len);
3604 len_rtx = expand_normal (len);
3605 dest_mem = get_memory_rtx (dest, len);
3606 val_mode = TYPE_MODE (unsigned_char_type_node);
3608 if (TREE_CODE (val) != INTEGER_CST)
3612 val_rtx = expand_normal (val);
3613 val_rtx = convert_to_mode (val_mode, val_rtx, 0);
3615 /* Assume that we can memset by pieces if we can store
3616 * the coefficients by pieces (in the required modes).
3617 * We can't pass builtin_memset_gen_str as that emits RTL. */
3619 if (host_integerp (len, 1)
3620 && can_store_by_pieces (tree_low_cst (len, 1),
3621 builtin_memset_read_str, &c, dest_align,
3624 val_rtx = force_reg (val_mode, val_rtx);
3625 store_by_pieces (dest_mem, tree_low_cst (len, 1),
3626 builtin_memset_gen_str, val_rtx, dest_align,
3629 else if (!set_storage_via_setmem (dest_mem, len_rtx, val_rtx,
3630 dest_align, expected_align,
3634 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3635 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3639 if (target_char_cast (val, &c))
3644 if (host_integerp (len, 1)
3645 && can_store_by_pieces (tree_low_cst (len, 1),
3646 builtin_memset_read_str, &c, dest_align,
3648 store_by_pieces (dest_mem, tree_low_cst (len, 1),
3649 builtin_memset_read_str, &c, dest_align, true, 0);
3650 else if (!set_storage_via_setmem (dest_mem, len_rtx,
3651 gen_int_mode (c, val_mode),
3652 dest_align, expected_align,
3656 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3657 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3661 set_mem_align (dest_mem, dest_align);
3662 dest_addr = clear_storage_hints (dest_mem, len_rtx,
3663 CALL_EXPR_TAILCALL (orig_exp)
3664 ? BLOCK_OP_TAILCALL : BLOCK_OP_NORMAL,
3665 expected_align, expected_size);
3669 dest_addr = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3670 dest_addr = convert_memory_address (ptr_mode, dest_addr);
3676 fndecl = get_callee_fndecl (orig_exp);
3677 fcode = DECL_FUNCTION_CODE (fndecl);
3678 if (fcode == BUILT_IN_MEMSET)
3679 fn = build_call_nofold_loc (EXPR_LOCATION (orig_exp), fndecl, 3,
3681 else if (fcode == BUILT_IN_BZERO)
3682 fn = build_call_nofold_loc (EXPR_LOCATION (orig_exp), fndecl, 2,
3686 gcc_assert (TREE_CODE (fn) == CALL_EXPR);
3687 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (orig_exp);
3688 return expand_call (fn, target, target == const0_rtx);
3691 /* Expand expression EXP, which is a call to the bzero builtin. Return
3692 NULL_RTX if we failed the caller should emit a normal call. */
3695 expand_builtin_bzero (tree exp)
3698 location_t loc = EXPR_LOCATION (exp);
3700 if (!validate_arglist (exp, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3703 dest = CALL_EXPR_ARG (exp, 0);
3704 size = CALL_EXPR_ARG (exp, 1);
3706 /* New argument list transforming bzero(ptr x, int y) to
3707 memset(ptr x, int 0, size_t y). This is done this way
3708 so that if it isn't expanded inline, we fallback to
3709 calling bzero instead of memset. */
3711 return expand_builtin_memset_args (dest, integer_zero_node,
3712 fold_convert_loc (loc,
3713 size_type_node, size),
3714 const0_rtx, VOIDmode, exp);
3717 /* Expand expression EXP, which is a call to the memcmp built-in function.
3718 Return NULL_RTX if we failed and the caller should emit a normal call,
3719 otherwise try to get the result in TARGET, if convenient (and in mode
3720 MODE, if that's convenient). */
3723 expand_builtin_memcmp (tree exp, ATTRIBUTE_UNUSED rtx target,
3724 ATTRIBUTE_UNUSED enum machine_mode mode)
3726 location_t loc ATTRIBUTE_UNUSED = EXPR_LOCATION (exp);
3728 if (!validate_arglist (exp,
3729 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3732 /* Note: The cmpstrnsi pattern, if it exists, is not suitable for
3733 implementing memcmp because it will stop if it encounters two
3735 #if defined HAVE_cmpmemsi
3737 rtx arg1_rtx, arg2_rtx, arg3_rtx;
3740 tree arg1 = CALL_EXPR_ARG (exp, 0);
3741 tree arg2 = CALL_EXPR_ARG (exp, 1);
3742 tree len = CALL_EXPR_ARG (exp, 2);
3744 unsigned int arg1_align = get_pointer_alignment (arg1) / BITS_PER_UNIT;
3745 unsigned int arg2_align = get_pointer_alignment (arg2) / BITS_PER_UNIT;
3746 enum machine_mode insn_mode;
3749 insn_mode = insn_data[(int) CODE_FOR_cmpmemsi].operand[0].mode;
3753 /* If we don't have POINTER_TYPE, call the function. */
3754 if (arg1_align == 0 || arg2_align == 0)
3757 /* Make a place to write the result of the instruction. */
3760 && REG_P (result) && GET_MODE (result) == insn_mode
3761 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
3762 result = gen_reg_rtx (insn_mode);
3764 arg1_rtx = get_memory_rtx (arg1, len);
3765 arg2_rtx = get_memory_rtx (arg2, len);
3766 arg3_rtx = expand_normal (fold_convert_loc (loc, sizetype, len));
3768 /* Set MEM_SIZE as appropriate. */
3769 if (CONST_INT_P (arg3_rtx))
3771 set_mem_size (arg1_rtx, INTVAL (arg3_rtx));
3772 set_mem_size (arg2_rtx, INTVAL (arg3_rtx));
3776 insn = gen_cmpmemsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
3777 GEN_INT (MIN (arg1_align, arg2_align)));
3784 emit_library_call_value (memcmp_libfunc, result, LCT_PURE,
3785 TYPE_MODE (integer_type_node), 3,
3786 XEXP (arg1_rtx, 0), Pmode,
3787 XEXP (arg2_rtx, 0), Pmode,
3788 convert_to_mode (TYPE_MODE (sizetype), arg3_rtx,
3789 TYPE_UNSIGNED (sizetype)),
3790 TYPE_MODE (sizetype));
3792 /* Return the value in the proper mode for this function. */
3793 mode = TYPE_MODE (TREE_TYPE (exp));
3794 if (GET_MODE (result) == mode)
3796 else if (target != 0)
3798 convert_move (target, result, 0);
3802 return convert_to_mode (mode, result, 0);
3804 #endif /* HAVE_cmpmemsi. */
3809 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
3810 if we failed the caller should emit a normal call, otherwise try to get
3811 the result in TARGET, if convenient. */
3814 expand_builtin_strcmp (tree exp, ATTRIBUTE_UNUSED rtx target)
3816 if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3819 #if defined HAVE_cmpstrsi || defined HAVE_cmpstrnsi
3820 if (direct_optab_handler (cmpstr_optab, SImode) != CODE_FOR_nothing
3821 || direct_optab_handler (cmpstrn_optab, SImode) != CODE_FOR_nothing)
3823 rtx arg1_rtx, arg2_rtx;
3824 rtx result, insn = NULL_RTX;
3826 tree arg1 = CALL_EXPR_ARG (exp, 0);
3827 tree arg2 = CALL_EXPR_ARG (exp, 1);
3829 unsigned int arg1_align = get_pointer_alignment (arg1) / BITS_PER_UNIT;
3830 unsigned int arg2_align = get_pointer_alignment (arg2) / BITS_PER_UNIT;
3832 /* If we don't have POINTER_TYPE, call the function. */
3833 if (arg1_align == 0 || arg2_align == 0)
3836 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
3837 arg1 = builtin_save_expr (arg1);
3838 arg2 = builtin_save_expr (arg2);
3840 arg1_rtx = get_memory_rtx (arg1, NULL);
3841 arg2_rtx = get_memory_rtx (arg2, NULL);
3843 #ifdef HAVE_cmpstrsi
3844 /* Try to call cmpstrsi. */
3847 enum machine_mode insn_mode
3848 = insn_data[(int) CODE_FOR_cmpstrsi].operand[0].mode;
3850 /* Make a place to write the result of the instruction. */
3853 && REG_P (result) && GET_MODE (result) == insn_mode
3854 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
3855 result = gen_reg_rtx (insn_mode);
3857 insn = gen_cmpstrsi (result, arg1_rtx, arg2_rtx,
3858 GEN_INT (MIN (arg1_align, arg2_align)));
3861 #ifdef HAVE_cmpstrnsi
3862 /* Try to determine at least one length and call cmpstrnsi. */
3863 if (!insn && HAVE_cmpstrnsi)
3868 enum machine_mode insn_mode
3869 = insn_data[(int) CODE_FOR_cmpstrnsi].operand[0].mode;
3870 tree len1 = c_strlen (arg1, 1);
3871 tree len2 = c_strlen (arg2, 1);
3874 len1 = size_binop (PLUS_EXPR, ssize_int (1), len1);
3876 len2 = size_binop (PLUS_EXPR, ssize_int (1), len2);
3878 /* If we don't have a constant length for the first, use the length
3879 of the second, if we know it. We don't require a constant for
3880 this case; some cost analysis could be done if both are available
3881 but neither is constant. For now, assume they're equally cheap,
3882 unless one has side effects. If both strings have constant lengths,
3889 else if (TREE_SIDE_EFFECTS (len1))
3891 else if (TREE_SIDE_EFFECTS (len2))
3893 else if (TREE_CODE (len1) != INTEGER_CST)
3895 else if (TREE_CODE (len2) != INTEGER_CST)
3897 else if (tree_int_cst_lt (len1, len2))
3902 /* If both arguments have side effects, we cannot optimize. */
3903 if (!len || TREE_SIDE_EFFECTS (len))
3906 arg3_rtx = expand_normal (len);
3908 /* Make a place to write the result of the instruction. */
3911 && REG_P (result) && GET_MODE (result) == insn_mode
3912 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
3913 result = gen_reg_rtx (insn_mode);
3915 insn = gen_cmpstrnsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
3916 GEN_INT (MIN (arg1_align, arg2_align)));
3922 enum machine_mode mode;
3925 /* Return the value in the proper mode for this function. */
3926 mode = TYPE_MODE (TREE_TYPE (exp));
3927 if (GET_MODE (result) == mode)
3930 return convert_to_mode (mode, result, 0);
3931 convert_move (target, result, 0);
3935 /* Expand the library call ourselves using a stabilized argument
3936 list to avoid re-evaluating the function's arguments twice. */
3937 #ifdef HAVE_cmpstrnsi
3940 fndecl = get_callee_fndecl (exp);
3941 fn = build_call_nofold_loc (EXPR_LOCATION (exp), fndecl, 2, arg1, arg2);
3942 gcc_assert (TREE_CODE (fn) == CALL_EXPR);
3943 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
3944 return expand_call (fn, target, target == const0_rtx);
3950 /* Expand expression EXP, which is a call to the strncmp builtin. Return
3951 NULL_RTX if we failed the caller should emit a normal call, otherwise try to get
3952 the result in TARGET, if convenient. */
3955 expand_builtin_strncmp (tree exp, ATTRIBUTE_UNUSED rtx target,
3956 ATTRIBUTE_UNUSED enum machine_mode mode)
3958 location_t loc ATTRIBUTE_UNUSED = EXPR_LOCATION (exp);
3960 if (!validate_arglist (exp,
3961 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3964 /* If c_strlen can determine an expression for one of the string
3965 lengths, and it doesn't have side effects, then emit cmpstrnsi
3966 using length MIN(strlen(string)+1, arg3). */
3967 #ifdef HAVE_cmpstrnsi
3970 tree len, len1, len2;
3971 rtx arg1_rtx, arg2_rtx, arg3_rtx;
3974 tree arg1 = CALL_EXPR_ARG (exp, 0);
3975 tree arg2 = CALL_EXPR_ARG (exp, 1);
3976 tree arg3 = CALL_EXPR_ARG (exp, 2);
3978 unsigned int arg1_align = get_pointer_alignment (arg1) / BITS_PER_UNIT;
3979 unsigned int arg2_align = get_pointer_alignment (arg2) / BITS_PER_UNIT;
3980 enum machine_mode insn_mode
3981 = insn_data[(int) CODE_FOR_cmpstrnsi].operand[0].mode;
3983 len1 = c_strlen (arg1, 1);
3984 len2 = c_strlen (arg2, 1);
3987 len1 = size_binop_loc (loc, PLUS_EXPR, ssize_int (1), len1);
3989 len2 = size_binop_loc (loc, PLUS_EXPR, ssize_int (1), len2);
3991 /* If we don't have a constant length for the first, use the length
3992 of the second, if we know it. We don't require a constant for
3993 this case; some cost analysis could be done if both are available
3994 but neither is constant. For now, assume they're equally cheap,
3995 unless one has side effects. If both strings have constant lengths,
4002 else if (TREE_SIDE_EFFECTS (len1))
4004 else if (TREE_SIDE_EFFECTS (len2))
4006 else if (TREE_CODE (len1) != INTEGER_CST)
4008 else if (TREE_CODE (len2) != INTEGER_CST)
4010 else if (tree_int_cst_lt (len1, len2))
4015 /* If both arguments have side effects, we cannot optimize. */
4016 if (!len || TREE_SIDE_EFFECTS (len))
4019 /* The actual new length parameter is MIN(len,arg3). */
4020 len = fold_build2_loc (loc, MIN_EXPR, TREE_TYPE (len), len,
4021 fold_convert_loc (loc, TREE_TYPE (len), arg3));
4023 /* If we don't have POINTER_TYPE, call the function. */
4024 if (arg1_align == 0 || arg2_align == 0)
4027 /* Make a place to write the result of the instruction. */
4030 && REG_P (result) && GET_MODE (result) == insn_mode
4031 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
4032 result = gen_reg_rtx (insn_mode);
4034 /* Stabilize the arguments in case gen_cmpstrnsi fails. */
4035 arg1 = builtin_save_expr (arg1);
4036 arg2 = builtin_save_expr (arg2);
4037 len = builtin_save_expr (len);
4039 arg1_rtx = get_memory_rtx (arg1, len);
4040 arg2_rtx = get_memory_rtx (arg2, len);
4041 arg3_rtx = expand_normal (len);
4042 insn = gen_cmpstrnsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
4043 GEN_INT (MIN (arg1_align, arg2_align)));
4048 /* Return the value in the proper mode for this function. */
4049 mode = TYPE_MODE (TREE_TYPE (exp));
4050 if (GET_MODE (result) == mode)
4053 return convert_to_mode (mode, result, 0);
4054 convert_move (target, result, 0);
4058 /* Expand the library call ourselves using a stabilized argument
4059 list to avoid re-evaluating the function's arguments twice. */
4060 fndecl = get_callee_fndecl (exp);
4061 fn = build_call_nofold_loc (EXPR_LOCATION (exp), fndecl, 3,
4063 gcc_assert (TREE_CODE (fn) == CALL_EXPR);
4064 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
4065 return expand_call (fn, target, target == const0_rtx);
4071 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
4072 if that's convenient. */
4075 expand_builtin_saveregs (void)
4079 /* Don't do __builtin_saveregs more than once in a function.
4080 Save the result of the first call and reuse it. */
4081 if (saveregs_value != 0)
4082 return saveregs_value;
4084 /* When this function is called, it means that registers must be
4085 saved on entry to this function. So we migrate the call to the
4086 first insn of this function. */
4090 /* Do whatever the machine needs done in this case. */
4091 val = targetm.calls.expand_builtin_saveregs ();
4096 saveregs_value = val;
4098 /* Put the insns after the NOTE that starts the function. If this
4099 is inside a start_sequence, make the outer-level insn chain current, so
4100 the code is placed at the start of the function. */
4101 push_topmost_sequence ();
4102 emit_insn_after (seq, entry_of_function ());
4103 pop_topmost_sequence ();
4108 /* Expand a call to __builtin_next_arg. */
4111 expand_builtin_next_arg (void)
4113 /* Checking arguments is already done in fold_builtin_next_arg
4114 that must be called before this function. */
4115 return expand_binop (ptr_mode, add_optab,
4116 crtl->args.internal_arg_pointer,
4117 crtl->args.arg_offset_rtx,
4118 NULL_RTX, 0, OPTAB_LIB_WIDEN);
4121 /* Make it easier for the backends by protecting the valist argument
4122 from multiple evaluations. */
4125 stabilize_va_list_loc (location_t loc, tree valist, int needs_lvalue)
4127 tree vatype = targetm.canonical_va_list_type (TREE_TYPE (valist));
4129 /* The current way of determining the type of valist is completely
4130 bogus. We should have the information on the va builtin instead. */
4132 vatype = targetm.fn_abi_va_list (cfun->decl);
4134 if (TREE_CODE (vatype) == ARRAY_TYPE)
4136 if (TREE_SIDE_EFFECTS (valist))
4137 valist = save_expr (valist);
4139 /* For this case, the backends will be expecting a pointer to
4140 vatype, but it's possible we've actually been given an array
4141 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
4143 if (TREE_CODE (TREE_TYPE (valist)) == ARRAY_TYPE)
4145 tree p1 = build_pointer_type (TREE_TYPE (vatype));
4146 valist = build_fold_addr_expr_with_type_loc (loc, valist, p1);
4151 tree pt = build_pointer_type (vatype);
4155 if (! TREE_SIDE_EFFECTS (valist))
4158 valist = fold_build1_loc (loc, ADDR_EXPR, pt, valist);
4159 TREE_SIDE_EFFECTS (valist) = 1;
4162 if (TREE_SIDE_EFFECTS (valist))
4163 valist = save_expr (valist);
4164 valist = fold_build2_loc (loc, MEM_REF,
4165 vatype, valist, build_int_cst (pt, 0));
4171 /* The "standard" definition of va_list is void*. */
4174 std_build_builtin_va_list (void)
4176 return ptr_type_node;
4179 /* The "standard" abi va_list is va_list_type_node. */
4182 std_fn_abi_va_list (tree fndecl ATTRIBUTE_UNUSED)
4184 return va_list_type_node;
4187 /* The "standard" type of va_list is va_list_type_node. */
4190 std_canonical_va_list_type (tree type)
4194 if (INDIRECT_REF_P (type))
4195 type = TREE_TYPE (type);
4196 else if (POINTER_TYPE_P (type) && POINTER_TYPE_P (TREE_TYPE(type)))
4197 type = TREE_TYPE (type);
4198 wtype = va_list_type_node;
4200 /* Treat structure va_list types. */
4201 if (TREE_CODE (wtype) == RECORD_TYPE && POINTER_TYPE_P (htype))
4202 htype = TREE_TYPE (htype);
4203 else if (TREE_CODE (wtype) == ARRAY_TYPE)
4205 /* If va_list is an array type, the argument may have decayed
4206 to a pointer type, e.g. by being passed to another function.
4207 In that case, unwrap both types so that we can compare the
4208 underlying records. */
4209 if (TREE_CODE (htype) == ARRAY_TYPE
4210 || POINTER_TYPE_P (htype))
4212 wtype = TREE_TYPE (wtype);
4213 htype = TREE_TYPE (htype);
4216 if (TYPE_MAIN_VARIANT (wtype) == TYPE_MAIN_VARIANT (htype))
4217 return va_list_type_node;
4222 /* The "standard" implementation of va_start: just assign `nextarg' to
4226 std_expand_builtin_va_start (tree valist, rtx nextarg)
4228 rtx va_r = expand_expr (valist, NULL_RTX, VOIDmode, EXPAND_WRITE);
4229 convert_move (va_r, nextarg, 0);
4232 /* Expand EXP, a call to __builtin_va_start. */
4235 expand_builtin_va_start (tree exp)
4239 location_t loc = EXPR_LOCATION (exp);
4241 if (call_expr_nargs (exp) < 2)
4243 error_at (loc, "too few arguments to function %<va_start%>");
4247 if (fold_builtin_next_arg (exp, true))
4250 nextarg = expand_builtin_next_arg ();
4251 valist = stabilize_va_list_loc (loc, CALL_EXPR_ARG (exp, 0), 1);
4253 if (targetm.expand_builtin_va_start)
4254 targetm.expand_builtin_va_start (valist, nextarg);
4256 std_expand_builtin_va_start (valist, nextarg);
4261 /* The "standard" implementation of va_arg: read the value from the
4262 current (padded) address and increment by the (padded) size. */
4265 std_gimplify_va_arg_expr (tree valist, tree type, gimple_seq *pre_p,
4268 tree addr, t, type_size, rounded_size, valist_tmp;
4269 unsigned HOST_WIDE_INT align, boundary;
4272 #ifdef ARGS_GROW_DOWNWARD
4273 /* All of the alignment and movement below is for args-grow-up machines.
4274 As of 2004, there are only 3 ARGS_GROW_DOWNWARD targets, and they all
4275 implement their own specialized gimplify_va_arg_expr routines. */
4279 indirect = pass_by_reference (NULL, TYPE_MODE (type), type, false);
4281 type = build_pointer_type (type);
4283 align = PARM_BOUNDARY / BITS_PER_UNIT;
4284 boundary = targetm.calls.function_arg_boundary (TYPE_MODE (type), type);
4286 /* When we align parameter on stack for caller, if the parameter
4287 alignment is beyond MAX_SUPPORTED_STACK_ALIGNMENT, it will be
4288 aligned at MAX_SUPPORTED_STACK_ALIGNMENT. We will match callee
4289 here with caller. */
4290 if (boundary > MAX_SUPPORTED_STACK_ALIGNMENT)
4291 boundary = MAX_SUPPORTED_STACK_ALIGNMENT;
4293 boundary /= BITS_PER_UNIT;
4295 /* Hoist the valist value into a temporary for the moment. */
4296 valist_tmp = get_initialized_tmp_var (valist, pre_p, NULL);
4298 /* va_list pointer is aligned to PARM_BOUNDARY. If argument actually
4299 requires greater alignment, we must perform dynamic alignment. */
4300 if (boundary > align
4301 && !integer_zerop (TYPE_SIZE (type)))
4303 t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist_tmp,
4304 fold_build_pointer_plus_hwi (valist_tmp, boundary - 1));
4305 gimplify_and_add (t, pre_p);
4307 t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist_tmp,
4308 fold_build2 (BIT_AND_EXPR, TREE_TYPE (valist),
4310 build_int_cst (TREE_TYPE (valist), -boundary)));
4311 gimplify_and_add (t, pre_p);
4316 /* If the actual alignment is less than the alignment of the type,
4317 adjust the type accordingly so that we don't assume strict alignment
4318 when dereferencing the pointer. */
4319 boundary *= BITS_PER_UNIT;
4320 if (boundary < TYPE_ALIGN (type))
4322 type = build_variant_type_copy (type);
4323 TYPE_ALIGN (type) = boundary;
4326 /* Compute the rounded size of the type. */
4327 type_size = size_in_bytes (type);
4328 rounded_size = round_up (type_size, align);
4330 /* Reduce rounded_size so it's sharable with the postqueue. */
4331 gimplify_expr (&rounded_size, pre_p, post_p, is_gimple_val, fb_rvalue);
4335 if (PAD_VARARGS_DOWN && !integer_zerop (rounded_size))
4337 /* Small args are padded downward. */
4338 t = fold_build2_loc (input_location, GT_EXPR, sizetype,
4339 rounded_size, size_int (align));
4340 t = fold_build3 (COND_EXPR, sizetype, t, size_zero_node,
4341 size_binop (MINUS_EXPR, rounded_size, type_size));
4342 addr = fold_build_pointer_plus (addr, t);
4345 /* Compute new value for AP. */
4346 t = fold_build_pointer_plus (valist_tmp, rounded_size);
4347 t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist, t);
4348 gimplify_and_add (t, pre_p);
4350 addr = fold_convert (build_pointer_type (type), addr);
4353 addr = build_va_arg_indirect_ref (addr);
4355 return build_va_arg_indirect_ref (addr);
4358 /* Build an indirect-ref expression over the given TREE, which represents a
4359 piece of a va_arg() expansion. */
4361 build_va_arg_indirect_ref (tree addr)
4363 addr = build_simple_mem_ref_loc (EXPR_LOCATION (addr), addr);
4365 if (flag_mudflap) /* Don't instrument va_arg INDIRECT_REF. */
4371 /* Return a dummy expression of type TYPE in order to keep going after an
4375 dummy_object (tree type)
4377 tree t = build_int_cst (build_pointer_type (type), 0);
4378 return build2 (MEM_REF, type, t, t);
4381 /* Gimplify __builtin_va_arg, aka VA_ARG_EXPR, which is not really a
4382 builtin function, but a very special sort of operator. */
4384 enum gimplify_status
4385 gimplify_va_arg_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4387 tree promoted_type, have_va_type;
4388 tree valist = TREE_OPERAND (*expr_p, 0);
4389 tree type = TREE_TYPE (*expr_p);
4391 location_t loc = EXPR_LOCATION (*expr_p);
4393 /* Verify that valist is of the proper type. */
4394 have_va_type = TREE_TYPE (valist);
4395 if (have_va_type == error_mark_node)
4397 have_va_type = targetm.canonical_va_list_type (have_va_type);
4399 if (have_va_type == NULL_TREE)
4401 error_at (loc, "first argument to %<va_arg%> not of type %<va_list%>");
4405 /* Generate a diagnostic for requesting data of a type that cannot
4406 be passed through `...' due to type promotion at the call site. */
4407 if ((promoted_type = lang_hooks.types.type_promotes_to (type))
4410 static bool gave_help;
4413 /* Unfortunately, this is merely undefined, rather than a constraint
4414 violation, so we cannot make this an error. If this call is never
4415 executed, the program is still strictly conforming. */
4416 warned = warning_at (loc, 0,
4417 "%qT is promoted to %qT when passed through %<...%>",
4418 type, promoted_type);
4419 if (!gave_help && warned)
4422 inform (loc, "(so you should pass %qT not %qT to %<va_arg%>)",
4423 promoted_type, type);
4426 /* We can, however, treat "undefined" any way we please.
4427 Call abort to encourage the user to fix the program. */
4429 inform (loc, "if this code is reached, the program will abort");
4430 /* Before the abort, allow the evaluation of the va_list
4431 expression to exit or longjmp. */
4432 gimplify_and_add (valist, pre_p);
4433 t = build_call_expr_loc (loc,
4434 builtin_decl_implicit (BUILT_IN_TRAP), 0);
4435 gimplify_and_add (t, pre_p);
4437 /* This is dead code, but go ahead and finish so that the
4438 mode of the result comes out right. */
4439 *expr_p = dummy_object (type);
4444 /* Make it easier for the backends by protecting the valist argument
4445 from multiple evaluations. */
4446 if (TREE_CODE (have_va_type) == ARRAY_TYPE)
4448 /* For this case, the backends will be expecting a pointer to
4449 TREE_TYPE (abi), but it's possible we've
4450 actually been given an array (an actual TARGET_FN_ABI_VA_LIST).
4452 if (TREE_CODE (TREE_TYPE (valist)) == ARRAY_TYPE)
4454 tree p1 = build_pointer_type (TREE_TYPE (have_va_type));
4455 valist = fold_convert_loc (loc, p1,
4456 build_fold_addr_expr_loc (loc, valist));
4459 gimplify_expr (&valist, pre_p, post_p, is_gimple_val, fb_rvalue);
4462 gimplify_expr (&valist, pre_p, post_p, is_gimple_min_lval, fb_lvalue);
4464 if (!targetm.gimplify_va_arg_expr)
4465 /* FIXME: Once most targets are converted we should merely
4466 assert this is non-null. */
4469 *expr_p = targetm.gimplify_va_arg_expr (valist, type, pre_p, post_p);
4474 /* Expand EXP, a call to __builtin_va_end. */
4477 expand_builtin_va_end (tree exp)
4479 tree valist = CALL_EXPR_ARG (exp, 0);
4481 /* Evaluate for side effects, if needed. I hate macros that don't
4483 if (TREE_SIDE_EFFECTS (valist))
4484 expand_expr (valist, const0_rtx, VOIDmode, EXPAND_NORMAL);
4489 /* Expand EXP, a call to __builtin_va_copy. We do this as a
4490 builtin rather than just as an assignment in stdarg.h because of the
4491 nastiness of array-type va_list types. */
4494 expand_builtin_va_copy (tree exp)
4497 location_t loc = EXPR_LOCATION (exp);
4499 dst = CALL_EXPR_ARG (exp, 0);
4500 src = CALL_EXPR_ARG (exp, 1);
4502 dst = stabilize_va_list_loc (loc, dst, 1);
4503 src = stabilize_va_list_loc (loc, src, 0);
4505 gcc_assert (cfun != NULL && cfun->decl != NULL_TREE);
4507 if (TREE_CODE (targetm.fn_abi_va_list (cfun->decl)) != ARRAY_TYPE)
4509 t = build2 (MODIFY_EXPR, targetm.fn_abi_va_list (cfun->decl), dst, src);
4510 TREE_SIDE_EFFECTS (t) = 1;
4511 expand_expr (t, const0_rtx, VOIDmode, EXPAND_NORMAL);
4515 rtx dstb, srcb, size;
4517 /* Evaluate to pointers. */
4518 dstb = expand_expr (dst, NULL_RTX, Pmode, EXPAND_NORMAL);
4519 srcb = expand_expr (src, NULL_RTX, Pmode, EXPAND_NORMAL);
4520 size = expand_expr (TYPE_SIZE_UNIT (targetm.fn_abi_va_list (cfun->decl)),
4521 NULL_RTX, VOIDmode, EXPAND_NORMAL);
4523 dstb = convert_memory_address (Pmode, dstb);
4524 srcb = convert_memory_address (Pmode, srcb);
4526 /* "Dereference" to BLKmode memories. */
4527 dstb = gen_rtx_MEM (BLKmode, dstb);
4528 set_mem_alias_set (dstb, get_alias_set (TREE_TYPE (TREE_TYPE (dst))));
4529 set_mem_align (dstb, TYPE_ALIGN (targetm.fn_abi_va_list (cfun->decl)));
4530 srcb = gen_rtx_MEM (BLKmode, srcb);
4531 set_mem_alias_set (srcb, get_alias_set (TREE_TYPE (TREE_TYPE (src))));
4532 set_mem_align (srcb, TYPE_ALIGN (targetm.fn_abi_va_list (cfun->decl)));
4535 emit_block_move (dstb, srcb, size, BLOCK_OP_NORMAL);
4541 /* Expand a call to one of the builtin functions __builtin_frame_address or
4542 __builtin_return_address. */
4545 expand_builtin_frame_address (tree fndecl, tree exp)
4547 /* The argument must be a nonnegative integer constant.
4548 It counts the number of frames to scan up the stack.
4549 The value is the return address saved in that frame. */
4550 if (call_expr_nargs (exp) == 0)
4551 /* Warning about missing arg was already issued. */
4553 else if (! host_integerp (CALL_EXPR_ARG (exp, 0), 1))
4555 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS)
4556 error ("invalid argument to %<__builtin_frame_address%>");
4558 error ("invalid argument to %<__builtin_return_address%>");
4564 = expand_builtin_return_addr (DECL_FUNCTION_CODE (fndecl),
4565 tree_low_cst (CALL_EXPR_ARG (exp, 0), 1));
4567 /* Some ports cannot access arbitrary stack frames. */
4570 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS)
4571 warning (0, "unsupported argument to %<__builtin_frame_address%>");
4573 warning (0, "unsupported argument to %<__builtin_return_address%>");
4577 /* For __builtin_frame_address, return what we've got. */
4578 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS)
4582 && ! CONSTANT_P (tem))
4583 tem = copy_to_mode_reg (Pmode, tem);
4588 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we
4589 failed and the caller should emit a normal call. CANNOT_ACCUMULATE
4590 is the same as for allocate_dynamic_stack_space. */
4593 expand_builtin_alloca (tree exp, bool cannot_accumulate)
4599 bool alloca_with_align = (DECL_FUNCTION_CODE (get_callee_fndecl (exp))
4600 == BUILT_IN_ALLOCA_WITH_ALIGN);
4602 /* Emit normal call if we use mudflap. */
4607 = (alloca_with_align
4608 ? validate_arglist (exp, INTEGER_TYPE, INTEGER_TYPE, VOID_TYPE)
4609 : validate_arglist (exp, INTEGER_TYPE, VOID_TYPE));
4614 /* Compute the argument. */
4615 op0 = expand_normal (CALL_EXPR_ARG (exp, 0));
4617 /* Compute the alignment. */
4618 align = (alloca_with_align
4619 ? TREE_INT_CST_LOW (CALL_EXPR_ARG (exp, 1))
4620 : BIGGEST_ALIGNMENT);
4622 /* Allocate the desired space. */
4623 result = allocate_dynamic_stack_space (op0, 0, align, cannot_accumulate);
4624 result = convert_memory_address (ptr_mode, result);
4629 /* Expand a call to a bswap builtin with argument ARG0. MODE
4630 is the mode to expand with. */
4633 expand_builtin_bswap (tree exp, rtx target, rtx subtarget)
4635 enum machine_mode mode;
4639 if (!validate_arglist (exp, INTEGER_TYPE, VOID_TYPE))
4642 arg = CALL_EXPR_ARG (exp, 0);
4643 mode = TYPE_MODE (TREE_TYPE (arg));
4644 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
4646 target = expand_unop (mode, bswap_optab, op0, target, 1);
4648 gcc_assert (target);
4650 return convert_to_mode (mode, target, 0);
4653 /* Expand a call to a unary builtin in EXP.
4654 Return NULL_RTX if a normal call should be emitted rather than expanding the
4655 function in-line. If convenient, the result should be placed in TARGET.
4656 SUBTARGET may be used as the target for computing one of EXP's operands. */
4659 expand_builtin_unop (enum machine_mode target_mode, tree exp, rtx target,
4660 rtx subtarget, optab op_optab)
4664 if (!validate_arglist (exp, INTEGER_TYPE, VOID_TYPE))
4667 /* Compute the argument. */
4668 op0 = expand_expr (CALL_EXPR_ARG (exp, 0),
4670 && (TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp, 0)))
4671 == GET_MODE (subtarget))) ? subtarget : NULL_RTX,
4672 VOIDmode, EXPAND_NORMAL);
4673 /* Compute op, into TARGET if possible.
4674 Set TARGET to wherever the result comes back. */
4675 target = expand_unop (TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp, 0))),
4676 op_optab, op0, target, op_optab != clrsb_optab);
4677 gcc_assert (target);
4679 return convert_to_mode (target_mode, target, 0);
4682 /* Expand a call to __builtin_expect. We just return our argument
4683 as the builtin_expect semantic should've been already executed by
4684 tree branch prediction pass. */
4687 expand_builtin_expect (tree exp, rtx target)
4691 if (call_expr_nargs (exp) < 2)
4693 arg = CALL_EXPR_ARG (exp, 0);
4695 target = expand_expr (arg, target, VOIDmode, EXPAND_NORMAL);
4696 /* When guessing was done, the hints should be already stripped away. */
4697 gcc_assert (!flag_guess_branch_prob
4698 || optimize == 0 || seen_error ());
4702 /* Expand a call to __builtin_assume_aligned. We just return our first
4703 argument as the builtin_assume_aligned semantic should've been already
4707 expand_builtin_assume_aligned (tree exp, rtx target)
4709 if (call_expr_nargs (exp) < 2)
4711 target = expand_expr (CALL_EXPR_ARG (exp, 0), target, VOIDmode,
4713 gcc_assert (!TREE_SIDE_EFFECTS (CALL_EXPR_ARG (exp, 1))
4714 && (call_expr_nargs (exp) < 3
4715 || !TREE_SIDE_EFFECTS (CALL_EXPR_ARG (exp, 2))));
4720 expand_builtin_trap (void)
4725 rtx insn = emit_insn (gen_trap ());
4726 /* For trap insns when not accumulating outgoing args force
4727 REG_ARGS_SIZE note to prevent crossjumping of calls with
4728 different args sizes. */
4729 if (!ACCUMULATE_OUTGOING_ARGS)
4730 add_reg_note (insn, REG_ARGS_SIZE, GEN_INT (stack_pointer_delta));
4734 emit_library_call (abort_libfunc, LCT_NORETURN, VOIDmode, 0);
4738 /* Expand a call to __builtin_unreachable. We do nothing except emit
4739 a barrier saying that control flow will not pass here.
4741 It is the responsibility of the program being compiled to ensure
4742 that control flow does never reach __builtin_unreachable. */
4744 expand_builtin_unreachable (void)
4749 /* Expand EXP, a call to fabs, fabsf or fabsl.
4750 Return NULL_RTX if a normal call should be emitted rather than expanding
4751 the function inline. If convenient, the result should be placed
4752 in TARGET. SUBTARGET may be used as the target for computing
4756 expand_builtin_fabs (tree exp, rtx target, rtx subtarget)
4758 enum machine_mode mode;
4762 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
4765 arg = CALL_EXPR_ARG (exp, 0);
4766 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
4767 mode = TYPE_MODE (TREE_TYPE (arg));
4768 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
4769 return expand_abs (mode, op0, target, 0, safe_from_p (target, arg, 1));
4772 /* Expand EXP, a call to copysign, copysignf, or copysignl.
4773 Return NULL is a normal call should be emitted rather than expanding the
4774 function inline. If convenient, the result should be placed in TARGET.
4775 SUBTARGET may be used as the target for computing the operand. */
4778 expand_builtin_copysign (tree exp, rtx target, rtx subtarget)
4783 if (!validate_arglist (exp, REAL_TYPE, REAL_TYPE, VOID_TYPE))
4786 arg = CALL_EXPR_ARG (exp, 0);
4787 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
4789 arg = CALL_EXPR_ARG (exp, 1);
4790 op1 = expand_normal (arg);
4792 return expand_copysign (op0, op1, target);
4795 /* Create a new constant string literal and return a char* pointer to it.
4796 The STRING_CST value is the LEN characters at STR. */
4798 build_string_literal (int len, const char *str)
4800 tree t, elem, index, type;
4802 t = build_string (len, str);
4803 elem = build_type_variant (char_type_node, 1, 0);
4804 index = build_index_type (size_int (len - 1));
4805 type = build_array_type (elem, index);
4806 TREE_TYPE (t) = type;
4807 TREE_CONSTANT (t) = 1;
4808 TREE_READONLY (t) = 1;
4809 TREE_STATIC (t) = 1;
4811 type = build_pointer_type (elem);
4812 t = build1 (ADDR_EXPR, type,
4813 build4 (ARRAY_REF, elem,
4814 t, integer_zero_node, NULL_TREE, NULL_TREE));
4818 /* Expand a call to __builtin___clear_cache. */
4821 expand_builtin___clear_cache (tree exp ATTRIBUTE_UNUSED)
4823 #ifndef HAVE_clear_cache
4824 #ifdef CLEAR_INSN_CACHE
4825 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
4826 does something. Just do the default expansion to a call to
4830 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
4831 does nothing. There is no need to call it. Do nothing. */
4833 #endif /* CLEAR_INSN_CACHE */
4835 /* We have a "clear_cache" insn, and it will handle everything. */
4837 rtx begin_rtx, end_rtx;
4839 /* We must not expand to a library call. If we did, any
4840 fallback library function in libgcc that might contain a call to
4841 __builtin___clear_cache() would recurse infinitely. */
4842 if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
4844 error ("both arguments to %<__builtin___clear_cache%> must be pointers");
4848 if (HAVE_clear_cache)
4850 struct expand_operand ops[2];
4852 begin = CALL_EXPR_ARG (exp, 0);
4853 begin_rtx = expand_expr (begin, NULL_RTX, Pmode, EXPAND_NORMAL);
4855 end = CALL_EXPR_ARG (exp, 1);
4856 end_rtx = expand_expr (end, NULL_RTX, Pmode, EXPAND_NORMAL);
4858 create_address_operand (&ops[0], begin_rtx);
4859 create_address_operand (&ops[1], end_rtx);
4860 if (maybe_expand_insn (CODE_FOR_clear_cache, 2, ops))
4864 #endif /* HAVE_clear_cache */
4867 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
4870 round_trampoline_addr (rtx tramp)
4872 rtx temp, addend, mask;
4874 /* If we don't need too much alignment, we'll have been guaranteed
4875 proper alignment by get_trampoline_type. */
4876 if (TRAMPOLINE_ALIGNMENT <= STACK_BOUNDARY)
4879 /* Round address up to desired boundary. */
4880 temp = gen_reg_rtx (Pmode);
4881 addend = GEN_INT (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT - 1);
4882 mask = GEN_INT (-TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT);
4884 temp = expand_simple_binop (Pmode, PLUS, tramp, addend,
4885 temp, 0, OPTAB_LIB_WIDEN);
4886 tramp = expand_simple_binop (Pmode, AND, temp, mask,
4887 temp, 0, OPTAB_LIB_WIDEN);
4893 expand_builtin_init_trampoline (tree exp, bool onstack)
4895 tree t_tramp, t_func, t_chain;
4896 rtx m_tramp, r_tramp, r_chain, tmp;
4898 if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE,
4899 POINTER_TYPE, VOID_TYPE))
4902 t_tramp = CALL_EXPR_ARG (exp, 0);
4903 t_func = CALL_EXPR_ARG (exp, 1);
4904 t_chain = CALL_EXPR_ARG (exp, 2);
4906 r_tramp = expand_normal (t_tramp);
4907 m_tramp = gen_rtx_MEM (BLKmode, r_tramp);
4908 MEM_NOTRAP_P (m_tramp) = 1;
4910 /* If ONSTACK, the TRAMP argument should be the address of a field
4911 within the local function's FRAME decl. Either way, let's see if
4912 we can fill in the MEM_ATTRs for this memory. */
4913 if (TREE_CODE (t_tramp) == ADDR_EXPR)
4914 set_mem_attributes_minus_bitpos (m_tramp, TREE_OPERAND (t_tramp, 0),
4917 /* Creator of a heap trampoline is responsible for making sure the
4918 address is aligned to at least STACK_BOUNDARY. Normally malloc
4919 will ensure this anyhow. */
4920 tmp = round_trampoline_addr (r_tramp);
4923 m_tramp = change_address (m_tramp, BLKmode, tmp);
4924 set_mem_align (m_tramp, TRAMPOLINE_ALIGNMENT);
4925 set_mem_size (m_tramp, TRAMPOLINE_SIZE);
4928 /* The FUNC argument should be the address of the nested function.
4929 Extract the actual function decl to pass to the hook. */
4930 gcc_assert (TREE_CODE (t_func) == ADDR_EXPR);
4931 t_func = TREE_OPERAND (t_func, 0);
4932 gcc_assert (TREE_CODE (t_func) == FUNCTION_DECL);
4934 r_chain = expand_normal (t_chain);
4936 /* Generate insns to initialize the trampoline. */
4937 targetm.calls.trampoline_init (m_tramp, t_func, r_chain);
4941 trampolines_created = 1;
4943 warning_at (DECL_SOURCE_LOCATION (t_func), OPT_Wtrampolines,
4944 "trampoline generated for nested function %qD", t_func);
4951 expand_builtin_adjust_trampoline (tree exp)
4955 if (!validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
4958 tramp = expand_normal (CALL_EXPR_ARG (exp, 0));
4959 tramp = round_trampoline_addr (tramp);
4960 if (targetm.calls.trampoline_adjust_address)
4961 tramp = targetm.calls.trampoline_adjust_address (tramp);
4966 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
4967 function. The function first checks whether the back end provides
4968 an insn to implement signbit for the respective mode. If not, it
4969 checks whether the floating point format of the value is such that
4970 the sign bit can be extracted. If that is not the case, the
4971 function returns NULL_RTX to indicate that a normal call should be
4972 emitted rather than expanding the function in-line. EXP is the
4973 expression that is a call to the builtin function; if convenient,
4974 the result should be placed in TARGET. */
4976 expand_builtin_signbit (tree exp, rtx target)
4978 const struct real_format *fmt;
4979 enum machine_mode fmode, imode, rmode;
4982 enum insn_code icode;
4984 location_t loc = EXPR_LOCATION (exp);
4986 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
4989 arg = CALL_EXPR_ARG (exp, 0);
4990 fmode = TYPE_MODE (TREE_TYPE (arg));
4991 rmode = TYPE_MODE (TREE_TYPE (exp));
4992 fmt = REAL_MODE_FORMAT (fmode);
4994 arg = builtin_save_expr (arg);
4996 /* Expand the argument yielding a RTX expression. */
4997 temp = expand_normal (arg);
4999 /* Check if the back end provides an insn that handles signbit for the
5001 icode = optab_handler (signbit_optab, fmode);
5002 if (icode != CODE_FOR_nothing)
5004 rtx last = get_last_insn ();
5005 target = gen_reg_rtx (TYPE_MODE (TREE_TYPE (exp)));
5006 if (maybe_emit_unop_insn (icode, target, temp, UNKNOWN))
5008 delete_insns_since (last);
5011 /* For floating point formats without a sign bit, implement signbit
5013 bitpos = fmt->signbit_ro;
5016 /* But we can't do this if the format supports signed zero. */
5017 if (fmt->has_signed_zero && HONOR_SIGNED_ZEROS (fmode))
5020 arg = fold_build2_loc (loc, LT_EXPR, TREE_TYPE (exp), arg,
5021 build_real (TREE_TYPE (arg), dconst0));
5022 return expand_expr (arg, target, VOIDmode, EXPAND_NORMAL);
5025 if (GET_MODE_SIZE (fmode) <= UNITS_PER_WORD)
5027 imode = int_mode_for_mode (fmode);
5028 if (imode == BLKmode)
5030 temp = gen_lowpart (imode, temp);
5035 /* Handle targets with different FP word orders. */
5036 if (FLOAT_WORDS_BIG_ENDIAN)
5037 word = (GET_MODE_BITSIZE (fmode) - bitpos) / BITS_PER_WORD;
5039 word = bitpos / BITS_PER_WORD;
5040 temp = operand_subword_force (temp, word, fmode);
5041 bitpos = bitpos % BITS_PER_WORD;
5044 /* Force the intermediate word_mode (or narrower) result into a
5045 register. This avoids attempting to create paradoxical SUBREGs
5046 of floating point modes below. */
5047 temp = force_reg (imode, temp);
5049 /* If the bitpos is within the "result mode" lowpart, the operation
5050 can be implement with a single bitwise AND. Otherwise, we need
5051 a right shift and an AND. */
5053 if (bitpos < GET_MODE_BITSIZE (rmode))
5055 double_int mask = double_int_setbit (double_int_zero, bitpos);
5057 if (GET_MODE_SIZE (imode) > GET_MODE_SIZE (rmode))
5058 temp = gen_lowpart (rmode, temp);
5059 temp = expand_binop (rmode, and_optab, temp,
5060 immed_double_int_const (mask, rmode),
5061 NULL_RTX, 1, OPTAB_LIB_WIDEN);
5065 /* Perform a logical right shift to place the signbit in the least
5066 significant bit, then truncate the result to the desired mode
5067 and mask just this bit. */
5068 temp = expand_shift (RSHIFT_EXPR, imode, temp, bitpos, NULL_RTX, 1);
5069 temp = gen_lowpart (rmode, temp);
5070 temp = expand_binop (rmode, and_optab, temp, const1_rtx,
5071 NULL_RTX, 1, OPTAB_LIB_WIDEN);
5077 /* Expand fork or exec calls. TARGET is the desired target of the
5078 call. EXP is the call. FN is the
5079 identificator of the actual function. IGNORE is nonzero if the
5080 value is to be ignored. */
5083 expand_builtin_fork_or_exec (tree fn, tree exp, rtx target, int ignore)
5088 /* If we are not profiling, just call the function. */
5089 if (!profile_arc_flag)
5092 /* Otherwise call the wrapper. This should be equivalent for the rest of
5093 compiler, so the code does not diverge, and the wrapper may run the
5094 code necessary for keeping the profiling sane. */
5096 switch (DECL_FUNCTION_CODE (fn))
5099 id = get_identifier ("__gcov_fork");
5102 case BUILT_IN_EXECL:
5103 id = get_identifier ("__gcov_execl");
5106 case BUILT_IN_EXECV:
5107 id = get_identifier ("__gcov_execv");
5110 case BUILT_IN_EXECLP:
5111 id = get_identifier ("__gcov_execlp");
5114 case BUILT_IN_EXECLE:
5115 id = get_identifier ("__gcov_execle");
5118 case BUILT_IN_EXECVP:
5119 id = get_identifier ("__gcov_execvp");
5122 case BUILT_IN_EXECVE:
5123 id = get_identifier ("__gcov_execve");
5130 decl = build_decl (DECL_SOURCE_LOCATION (fn),
5131 FUNCTION_DECL, id, TREE_TYPE (fn));
5132 DECL_EXTERNAL (decl) = 1;
5133 TREE_PUBLIC (decl) = 1;
5134 DECL_ARTIFICIAL (decl) = 1;
5135 TREE_NOTHROW (decl) = 1;
5136 DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT;
5137 DECL_VISIBILITY_SPECIFIED (decl) = 1;
5138 call = rewrite_call_expr (EXPR_LOCATION (exp), exp, 0, decl, 0);
5139 return expand_call (call, target, ignore);
5144 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
5145 the pointer in these functions is void*, the tree optimizers may remove
5146 casts. The mode computed in expand_builtin isn't reliable either, due
5147 to __sync_bool_compare_and_swap.
5149 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
5150 group of builtins. This gives us log2 of the mode size. */
5152 static inline enum machine_mode
5153 get_builtin_sync_mode (int fcode_diff)
5155 /* The size is not negotiable, so ask not to get BLKmode in return
5156 if the target indicates that a smaller size would be better. */
5157 return mode_for_size (BITS_PER_UNIT << fcode_diff, MODE_INT, 0);
5160 /* Expand the memory expression LOC and return the appropriate memory operand
5161 for the builtin_sync operations. */
5164 get_builtin_sync_mem (tree loc, enum machine_mode mode)
5168 addr = expand_expr (loc, NULL_RTX, ptr_mode, EXPAND_SUM);
5169 addr = convert_memory_address (Pmode, addr);
5171 /* Note that we explicitly do not want any alias information for this
5172 memory, so that we kill all other live memories. Otherwise we don't
5173 satisfy the full barrier semantics of the intrinsic. */
5174 mem = validize_mem (gen_rtx_MEM (mode, addr));
5176 /* The alignment needs to be at least according to that of the mode. */
5177 set_mem_align (mem, MAX (GET_MODE_ALIGNMENT (mode),
5178 get_pointer_alignment (loc)));
5179 set_mem_alias_set (mem, ALIAS_SET_MEMORY_BARRIER);
5180 MEM_VOLATILE_P (mem) = 1;
5185 /* Make sure an argument is in the right mode.
5186 EXP is the tree argument.
5187 MODE is the mode it should be in. */
5190 expand_expr_force_mode (tree exp, enum machine_mode mode)
5193 enum machine_mode old_mode;
5195 val = expand_expr (exp, NULL_RTX, mode, EXPAND_NORMAL);
5196 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5197 of CONST_INTs, where we know the old_mode only from the call argument. */
5199 old_mode = GET_MODE (val);
5200 if (old_mode == VOIDmode)
5201 old_mode = TYPE_MODE (TREE_TYPE (exp));
5202 val = convert_modes (mode, old_mode, val, 1);
5207 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
5208 EXP is the CALL_EXPR. CODE is the rtx code
5209 that corresponds to the arithmetic or logical operation from the name;
5210 an exception here is that NOT actually means NAND. TARGET is an optional
5211 place for us to store the results; AFTER is true if this is the
5212 fetch_and_xxx form. */
5215 expand_builtin_sync_operation (enum machine_mode mode, tree exp,
5216 enum rtx_code code, bool after,
5220 location_t loc = EXPR_LOCATION (exp);
5222 if (code == NOT && warn_sync_nand)
5224 tree fndecl = get_callee_fndecl (exp);
5225 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
5227 static bool warned_f_a_n, warned_n_a_f;
5231 case BUILT_IN_SYNC_FETCH_AND_NAND_1:
5232 case BUILT_IN_SYNC_FETCH_AND_NAND_2:
5233 case BUILT_IN_SYNC_FETCH_AND_NAND_4:
5234 case BUILT_IN_SYNC_FETCH_AND_NAND_8:
5235 case BUILT_IN_SYNC_FETCH_AND_NAND_16:
5239 fndecl = builtin_decl_implicit (BUILT_IN_SYNC_FETCH_AND_NAND_N);
5240 inform (loc, "%qD changed semantics in GCC 4.4", fndecl);
5241 warned_f_a_n = true;
5244 case BUILT_IN_SYNC_NAND_AND_FETCH_1:
5245 case BUILT_IN_SYNC_NAND_AND_FETCH_2:
5246 case BUILT_IN_SYNC_NAND_AND_FETCH_4:
5247 case BUILT_IN_SYNC_NAND_AND_FETCH_8:
5248 case BUILT_IN_SYNC_NAND_AND_FETCH_16:
5252 fndecl = builtin_decl_implicit (BUILT_IN_SYNC_NAND_AND_FETCH_N);
5253 inform (loc, "%qD changed semantics in GCC 4.4", fndecl);
5254 warned_n_a_f = true;
5262 /* Expand the operands. */
5263 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5264 val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 1), mode);
5266 return expand_atomic_fetch_op (target, mem, val, code, MEMMODEL_SEQ_CST,
5270 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
5271 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
5272 true if this is the boolean form. TARGET is a place for us to store the
5273 results; this is NOT optional if IS_BOOL is true. */
5276 expand_builtin_compare_and_swap (enum machine_mode mode, tree exp,
5277 bool is_bool, rtx target)
5279 rtx old_val, new_val, mem;
5282 /* Expand the operands. */
5283 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5284 old_val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 1), mode);
5285 new_val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 2), mode);
5287 pbool = poval = NULL;
5288 if (target != const0_rtx)
5295 if (!expand_atomic_compare_and_swap (pbool, poval, mem, old_val, new_val,
5296 false, MEMMODEL_SEQ_CST,
5303 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
5304 general form is actually an atomic exchange, and some targets only
5305 support a reduced form with the second argument being a constant 1.
5306 EXP is the CALL_EXPR; TARGET is an optional place for us to store
5310 expand_builtin_sync_lock_test_and_set (enum machine_mode mode, tree exp,
5315 /* Expand the operands. */
5316 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5317 val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 1), mode);
5319 return expand_sync_lock_test_and_set (target, mem, val);
5322 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
5325 expand_builtin_sync_lock_release (enum machine_mode mode, tree exp)
5329 /* Expand the operands. */
5330 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5332 expand_atomic_store (mem, const0_rtx, MEMMODEL_RELEASE, true);
5335 /* Given an integer representing an ``enum memmodel'', verify its
5336 correctness and return the memory model enum. */
5338 static enum memmodel
5339 get_memmodel (tree exp)
5343 /* If the parameter is not a constant, it's a run time value so we'll just
5344 convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking. */
5345 if (TREE_CODE (exp) != INTEGER_CST)
5346 return MEMMODEL_SEQ_CST;
5348 op = expand_normal (exp);
5349 if (INTVAL (op) < 0 || INTVAL (op) >= MEMMODEL_LAST)
5351 warning (OPT_Winvalid_memory_model,
5352 "invalid memory model argument to builtin");
5353 return MEMMODEL_SEQ_CST;
5355 return (enum memmodel) INTVAL (op);
5358 /* Expand the __atomic_exchange intrinsic:
5359 TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel)
5360 EXP is the CALL_EXPR.
5361 TARGET is an optional place for us to store the results. */
5364 expand_builtin_atomic_exchange (enum machine_mode mode, tree exp, rtx target)
5367 enum memmodel model;
5369 model = get_memmodel (CALL_EXPR_ARG (exp, 2));
5370 if (model == MEMMODEL_CONSUME)
5372 error ("invalid memory model for %<__atomic_exchange%>");
5376 if (!flag_inline_atomics)
5379 /* Expand the operands. */
5380 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5381 val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 1), mode);
5383 return expand_atomic_exchange (target, mem, val, model);
5386 /* Expand the __atomic_compare_exchange intrinsic:
5387 bool __atomic_compare_exchange (TYPE *object, TYPE *expect,
5388 TYPE desired, BOOL weak,
5389 enum memmodel success,
5390 enum memmodel failure)
5391 EXP is the CALL_EXPR.
5392 TARGET is an optional place for us to store the results. */
5395 expand_builtin_atomic_compare_exchange (enum machine_mode mode, tree exp,
5398 rtx expect, desired, mem, oldval;
5399 enum memmodel success, failure;
5403 success = get_memmodel (CALL_EXPR_ARG (exp, 4));
5404 failure = get_memmodel (CALL_EXPR_ARG (exp, 5));
5406 if (failure == MEMMODEL_RELEASE || failure == MEMMODEL_ACQ_REL)
5408 error ("invalid failure memory model for %<__atomic_compare_exchange%>");
5412 if (failure > success)
5414 error ("failure memory model cannot be stronger than success "
5415 "memory model for %<__atomic_compare_exchange%>");
5419 if (!flag_inline_atomics)
5422 /* Expand the operands. */
5423 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5425 expect = expand_normal (CALL_EXPR_ARG (exp, 1));
5426 expect = convert_memory_address (Pmode, expect);
5427 desired = expand_expr_force_mode (CALL_EXPR_ARG (exp, 2), mode);
5429 weak = CALL_EXPR_ARG (exp, 3);
5431 if (host_integerp (weak, 0) && tree_low_cst (weak, 0) != 0)
5434 oldval = copy_to_reg (gen_rtx_MEM (mode, expect));
5436 if (!expand_atomic_compare_and_swap ((target == const0_rtx ? NULL : &target),
5437 &oldval, mem, oldval, desired,
5438 is_weak, success, failure))
5441 emit_move_insn (gen_rtx_MEM (mode, expect), oldval);
5445 /* Expand the __atomic_load intrinsic:
5446 TYPE __atomic_load (TYPE *object, enum memmodel)
5447 EXP is the CALL_EXPR.
5448 TARGET is an optional place for us to store the results. */
5451 expand_builtin_atomic_load (enum machine_mode mode, tree exp, rtx target)
5454 enum memmodel model;
5456 model = get_memmodel (CALL_EXPR_ARG (exp, 1));
5457 if (model == MEMMODEL_RELEASE
5458 || model == MEMMODEL_ACQ_REL)
5460 error ("invalid memory model for %<__atomic_load%>");
5464 if (!flag_inline_atomics)
5467 /* Expand the operand. */
5468 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5470 return expand_atomic_load (target, mem, model);
5474 /* Expand the __atomic_store intrinsic:
5475 void __atomic_store (TYPE *object, TYPE desired, enum memmodel)
5476 EXP is the CALL_EXPR.
5477 TARGET is an optional place for us to store the results. */
5480 expand_builtin_atomic_store (enum machine_mode mode, tree exp)
5483 enum memmodel model;
5485 model = get_memmodel (CALL_EXPR_ARG (exp, 2));
5486 if (model != MEMMODEL_RELAXED
5487 && model != MEMMODEL_SEQ_CST
5488 && model != MEMMODEL_RELEASE)
5490 error ("invalid memory model for %<__atomic_store%>");
5494 if (!flag_inline_atomics)
5497 /* Expand the operands. */
5498 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5499 val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 1), mode);
5501 return expand_atomic_store (mem, val, model, false);
5504 /* Expand the __atomic_fetch_XXX intrinsic:
5505 TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel)
5506 EXP is the CALL_EXPR.
5507 TARGET is an optional place for us to store the results.
5508 CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR.
5509 FETCH_AFTER is true if returning the result of the operation.
5510 FETCH_AFTER is false if returning the value before the operation.
5511 IGNORE is true if the result is not used.
5512 EXT_CALL is the correct builtin for an external call if this cannot be
5513 resolved to an instruction sequence. */
5516 expand_builtin_atomic_fetch_op (enum machine_mode mode, tree exp, rtx target,
5517 enum rtx_code code, bool fetch_after,
5518 bool ignore, enum built_in_function ext_call)
5521 enum memmodel model;
5525 model = get_memmodel (CALL_EXPR_ARG (exp, 2));
5527 /* Expand the operands. */
5528 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5529 val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 1), mode);
5531 /* Only try generating instructions if inlining is turned on. */
5532 if (flag_inline_atomics)
5534 ret = expand_atomic_fetch_op (target, mem, val, code, model, fetch_after);
5539 /* Return if a different routine isn't needed for the library call. */
5540 if (ext_call == BUILT_IN_NONE)
5543 /* Change the call to the specified function. */
5544 fndecl = get_callee_fndecl (exp);
5545 addr = CALL_EXPR_FN (exp);
5548 gcc_assert (TREE_OPERAND (addr, 0) == fndecl);
5549 TREE_OPERAND (addr, 0) = builtin_decl_explicit(ext_call);
5551 /* Expand the call here so we can emit trailing code. */
5552 ret = expand_call (exp, target, ignore);
5554 /* Replace the original function just in case it matters. */
5555 TREE_OPERAND (addr, 0) = fndecl;
5557 /* Then issue the arithmetic correction to return the right result. */
5562 ret = expand_simple_binop (mode, AND, ret, val, NULL_RTX, true,
5564 ret = expand_simple_unop (mode, NOT, ret, target, true);
5567 ret = expand_simple_binop (mode, code, ret, val, target, true,
5574 #ifndef HAVE_atomic_clear
5575 # define HAVE_atomic_clear 0
5576 # define gen_atomic_clear(x,y) (gcc_unreachable (), NULL_RTX)
5579 /* Expand an atomic clear operation.
5580 void _atomic_clear (BOOL *obj, enum memmodel)
5581 EXP is the call expression. */
5584 expand_builtin_atomic_clear (tree exp)
5586 enum machine_mode mode;
5588 enum memmodel model;
5590 mode = mode_for_size (BOOL_TYPE_SIZE, MODE_INT, 0);
5591 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5592 model = get_memmodel (CALL_EXPR_ARG (exp, 1));
5594 if (model == MEMMODEL_ACQUIRE || model == MEMMODEL_ACQ_REL)
5596 error ("invalid memory model for %<__atomic_store%>");
5600 if (HAVE_atomic_clear)
5602 emit_insn (gen_atomic_clear (mem, model));
5606 /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
5607 Failing that, a store is issued by __atomic_store. The only way this can
5608 fail is if the bool type is larger than a word size. Unlikely, but
5609 handle it anyway for completeness. Assume a single threaded model since
5610 there is no atomic support in this case, and no barriers are required. */
5611 ret = expand_atomic_store (mem, const0_rtx, model, true);
5613 emit_move_insn (mem, const0_rtx);
5617 /* Expand an atomic test_and_set operation.
5618 bool _atomic_test_and_set (BOOL *obj, enum memmodel)
5619 EXP is the call expression. */
5622 expand_builtin_atomic_test_and_set (tree exp, rtx target)
5625 enum memmodel model;
5626 enum machine_mode mode;
5628 mode = mode_for_size (BOOL_TYPE_SIZE, MODE_INT, 0);
5629 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5630 model = get_memmodel (CALL_EXPR_ARG (exp, 1));
5632 return expand_atomic_test_and_set (target, mem, model);
5636 /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
5637 this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */
5640 fold_builtin_atomic_always_lock_free (tree arg0, tree arg1)
5643 enum machine_mode mode;
5644 unsigned int mode_align, type_align;
5646 if (TREE_CODE (arg0) != INTEGER_CST)
5649 size = INTVAL (expand_normal (arg0)) * BITS_PER_UNIT;
5650 mode = mode_for_size (size, MODE_INT, 0);
5651 mode_align = GET_MODE_ALIGNMENT (mode);
5653 if (TREE_CODE (arg1) == INTEGER_CST && INTVAL (expand_normal (arg1)) == 0)
5654 type_align = mode_align;
5657 tree ttype = TREE_TYPE (arg1);
5659 /* This function is usually invoked and folded immediately by the front
5660 end before anything else has a chance to look at it. The pointer
5661 parameter at this point is usually cast to a void *, so check for that
5662 and look past the cast. */
5663 if (TREE_CODE (arg1) == NOP_EXPR && POINTER_TYPE_P (ttype)
5664 && VOID_TYPE_P (TREE_TYPE (ttype)))
5665 arg1 = TREE_OPERAND (arg1, 0);
5667 ttype = TREE_TYPE (arg1);
5668 gcc_assert (POINTER_TYPE_P (ttype));
5670 /* Get the underlying type of the object. */
5671 ttype = TREE_TYPE (ttype);
5672 type_align = TYPE_ALIGN (ttype);
5675 /* If the object has smaller alignment, the the lock free routines cannot
5677 if (type_align < mode_align)
5678 return boolean_false_node;
5680 /* Check if a compare_and_swap pattern exists for the mode which represents
5681 the required size. The pattern is not allowed to fail, so the existence
5682 of the pattern indicates support is present. */
5683 if (can_compare_and_swap_p (mode, true))
5684 return boolean_true_node;
5686 return boolean_false_node;
5689 /* Return true if the parameters to call EXP represent an object which will
5690 always generate lock free instructions. The first argument represents the
5691 size of the object, and the second parameter is a pointer to the object
5692 itself. If NULL is passed for the object, then the result is based on
5693 typical alignment for an object of the specified size. Otherwise return
5697 expand_builtin_atomic_always_lock_free (tree exp)
5700 tree arg0 = CALL_EXPR_ARG (exp, 0);
5701 tree arg1 = CALL_EXPR_ARG (exp, 1);
5703 if (TREE_CODE (arg0) != INTEGER_CST)
5705 error ("non-constant argument 1 to __atomic_always_lock_free");
5709 size = fold_builtin_atomic_always_lock_free (arg0, arg1);
5710 if (size == boolean_true_node)
5715 /* Return a one or zero if it can be determined that object ARG1 of size ARG
5716 is lock free on this architecture. */
5719 fold_builtin_atomic_is_lock_free (tree arg0, tree arg1)
5721 if (!flag_inline_atomics)
5724 /* If it isn't always lock free, don't generate a result. */
5725 if (fold_builtin_atomic_always_lock_free (arg0, arg1) == boolean_true_node)
5726 return boolean_true_node;
5731 /* Return true if the parameters to call EXP represent an object which will
5732 always generate lock free instructions. The first argument represents the
5733 size of the object, and the second parameter is a pointer to the object
5734 itself. If NULL is passed for the object, then the result is based on
5735 typical alignment for an object of the specified size. Otherwise return
5739 expand_builtin_atomic_is_lock_free (tree exp)
5742 tree arg0 = CALL_EXPR_ARG (exp, 0);
5743 tree arg1 = CALL_EXPR_ARG (exp, 1);
5745 if (!INTEGRAL_TYPE_P (TREE_TYPE (arg0)))
5747 error ("non-integer argument 1 to __atomic_is_lock_free");
5751 if (!flag_inline_atomics)
5754 /* If the value is known at compile time, return the RTX for it. */
5755 size = fold_builtin_atomic_is_lock_free (arg0, arg1);
5756 if (size == boolean_true_node)
5762 /* Expand the __atomic_thread_fence intrinsic:
5763 void __atomic_thread_fence (enum memmodel)
5764 EXP is the CALL_EXPR. */
5767 expand_builtin_atomic_thread_fence (tree exp)
5769 enum memmodel model = get_memmodel (CALL_EXPR_ARG (exp, 0));
5770 expand_mem_thread_fence (model);
5773 /* Expand the __atomic_signal_fence intrinsic:
5774 void __atomic_signal_fence (enum memmodel)
5775 EXP is the CALL_EXPR. */
5778 expand_builtin_atomic_signal_fence (tree exp)
5780 enum memmodel model = get_memmodel (CALL_EXPR_ARG (exp, 0));
5781 expand_mem_signal_fence (model);
5784 /* Expand the __sync_synchronize intrinsic. */
5787 expand_builtin_sync_synchronize (void)
5789 expand_mem_thread_fence (MEMMODEL_SEQ_CST);
5793 /* Expand an expression EXP that calls a built-in function,
5794 with result going to TARGET if that's convenient
5795 (and in mode MODE if that's convenient).
5796 SUBTARGET may be used as the target for computing one of EXP's operands.
5797 IGNORE is nonzero if the value is to be ignored. */
5800 expand_builtin (tree exp, rtx target, rtx subtarget, enum machine_mode mode,
5803 tree fndecl = get_callee_fndecl (exp);
5804 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
5805 enum machine_mode target_mode = TYPE_MODE (TREE_TYPE (exp));
5808 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
5809 return targetm.expand_builtin (exp, target, subtarget, mode, ignore);
5811 /* When not optimizing, generate calls to library functions for a certain
5814 && !called_as_built_in (fndecl)
5815 && fcode != BUILT_IN_ALLOCA
5816 && fcode != BUILT_IN_ALLOCA_WITH_ALIGN
5817 && fcode != BUILT_IN_FREE)
5818 return expand_call (exp, target, ignore);
5820 /* The built-in function expanders test for target == const0_rtx
5821 to determine whether the function's result will be ignored. */
5823 target = const0_rtx;
5825 /* If the result of a pure or const built-in function is ignored, and
5826 none of its arguments are volatile, we can avoid expanding the
5827 built-in call and just evaluate the arguments for side-effects. */
5828 if (target == const0_rtx
5829 && ((flags = flags_from_decl_or_type (fndecl)) & (ECF_CONST | ECF_PURE))
5830 && !(flags & ECF_LOOPING_CONST_OR_PURE))
5832 bool volatilep = false;
5834 call_expr_arg_iterator iter;
5836 FOR_EACH_CALL_EXPR_ARG (arg, iter, exp)
5837 if (TREE_THIS_VOLATILE (arg))
5845 FOR_EACH_CALL_EXPR_ARG (arg, iter, exp)
5846 expand_expr (arg, const0_rtx, VOIDmode, EXPAND_NORMAL);
5853 CASE_FLT_FN (BUILT_IN_FABS):
5854 target = expand_builtin_fabs (exp, target, subtarget);
5859 CASE_FLT_FN (BUILT_IN_COPYSIGN):
5860 target = expand_builtin_copysign (exp, target, subtarget);
5865 /* Just do a normal library call if we were unable to fold
5867 CASE_FLT_FN (BUILT_IN_CABS):
5870 CASE_FLT_FN (BUILT_IN_EXP):
5871 CASE_FLT_FN (BUILT_IN_EXP10):
5872 CASE_FLT_FN (BUILT_IN_POW10):
5873 CASE_FLT_FN (BUILT_IN_EXP2):
5874 CASE_FLT_FN (BUILT_IN_EXPM1):
5875 CASE_FLT_FN (BUILT_IN_LOGB):
5876 CASE_FLT_FN (BUILT_IN_LOG):
5877 CASE_FLT_FN (BUILT_IN_LOG10):
5878 CASE_FLT_FN (BUILT_IN_LOG2):
5879 CASE_FLT_FN (BUILT_IN_LOG1P):
5880 CASE_FLT_FN (BUILT_IN_TAN):
5881 CASE_FLT_FN (BUILT_IN_ASIN):
5882 CASE_FLT_FN (BUILT_IN_ACOS):
5883 CASE_FLT_FN (BUILT_IN_ATAN):
5884 CASE_FLT_FN (BUILT_IN_SIGNIFICAND):
5885 /* Treat these like sqrt only if unsafe math optimizations are allowed,
5886 because of possible accuracy problems. */
5887 if (! flag_unsafe_math_optimizations)
5889 CASE_FLT_FN (BUILT_IN_SQRT):
5890 CASE_FLT_FN (BUILT_IN_FLOOR):
5891 CASE_FLT_FN (BUILT_IN_CEIL):
5892 CASE_FLT_FN (BUILT_IN_TRUNC):
5893 CASE_FLT_FN (BUILT_IN_ROUND):
5894 CASE_FLT_FN (BUILT_IN_NEARBYINT):
5895 CASE_FLT_FN (BUILT_IN_RINT):
5896 target = expand_builtin_mathfn (exp, target, subtarget);
5901 CASE_FLT_FN (BUILT_IN_FMA):
5902 target = expand_builtin_mathfn_ternary (exp, target, subtarget);
5907 CASE_FLT_FN (BUILT_IN_ILOGB):
5908 if (! flag_unsafe_math_optimizations)
5910 CASE_FLT_FN (BUILT_IN_ISINF):
5911 CASE_FLT_FN (BUILT_IN_FINITE):
5912 case BUILT_IN_ISFINITE:
5913 case BUILT_IN_ISNORMAL:
5914 target = expand_builtin_interclass_mathfn (exp, target);
5919 CASE_FLT_FN (BUILT_IN_ICEIL):
5920 CASE_FLT_FN (BUILT_IN_LCEIL):
5921 CASE_FLT_FN (BUILT_IN_LLCEIL):
5922 CASE_FLT_FN (BUILT_IN_LFLOOR):
5923 CASE_FLT_FN (BUILT_IN_IFLOOR):
5924 CASE_FLT_FN (BUILT_IN_LLFLOOR):
5925 target = expand_builtin_int_roundingfn (exp, target);
5930 CASE_FLT_FN (BUILT_IN_IRINT):
5931 CASE_FLT_FN (BUILT_IN_LRINT):
5932 CASE_FLT_FN (BUILT_IN_LLRINT):
5933 CASE_FLT_FN (BUILT_IN_IROUND):
5934 CASE_FLT_FN (BUILT_IN_LROUND):
5935 CASE_FLT_FN (BUILT_IN_LLROUND):
5936 target = expand_builtin_int_roundingfn_2 (exp, target);
5941 CASE_FLT_FN (BUILT_IN_POWI):
5942 target = expand_builtin_powi (exp, target);
5947 CASE_FLT_FN (BUILT_IN_ATAN2):
5948 CASE_FLT_FN (BUILT_IN_LDEXP):
5949 CASE_FLT_FN (BUILT_IN_SCALB):
5950 CASE_FLT_FN (BUILT_IN_SCALBN):
5951 CASE_FLT_FN (BUILT_IN_SCALBLN):
5952 if (! flag_unsafe_math_optimizations)
5955 CASE_FLT_FN (BUILT_IN_FMOD):
5956 CASE_FLT_FN (BUILT_IN_REMAINDER):
5957 CASE_FLT_FN (BUILT_IN_DREM):
5958 CASE_FLT_FN (BUILT_IN_POW):
5959 target = expand_builtin_mathfn_2 (exp, target, subtarget);
5964 CASE_FLT_FN (BUILT_IN_CEXPI):
5965 target = expand_builtin_cexpi (exp, target);
5966 gcc_assert (target);
5969 CASE_FLT_FN (BUILT_IN_SIN):
5970 CASE_FLT_FN (BUILT_IN_COS):
5971 if (! flag_unsafe_math_optimizations)
5973 target = expand_builtin_mathfn_3 (exp, target, subtarget);
5978 CASE_FLT_FN (BUILT_IN_SINCOS):
5979 if (! flag_unsafe_math_optimizations)
5981 target = expand_builtin_sincos (exp);
5986 case BUILT_IN_APPLY_ARGS:
5987 return expand_builtin_apply_args ();
5989 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
5990 FUNCTION with a copy of the parameters described by
5991 ARGUMENTS, and ARGSIZE. It returns a block of memory
5992 allocated on the stack into which is stored all the registers
5993 that might possibly be used for returning the result of a
5994 function. ARGUMENTS is the value returned by
5995 __builtin_apply_args. ARGSIZE is the number of bytes of
5996 arguments that must be copied. ??? How should this value be
5997 computed? We'll also need a safe worst case value for varargs
5999 case BUILT_IN_APPLY:
6000 if (!validate_arglist (exp, POINTER_TYPE,
6001 POINTER_TYPE, INTEGER_TYPE, VOID_TYPE)
6002 && !validate_arglist (exp, REFERENCE_TYPE,
6003 POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
6009 ops[0] = expand_normal (CALL_EXPR_ARG (exp, 0));
6010 ops[1] = expand_normal (CALL_EXPR_ARG (exp, 1));
6011 ops[2] = expand_normal (CALL_EXPR_ARG (exp, 2));
6013 return expand_builtin_apply (ops[0], ops[1], ops[2]);
6016 /* __builtin_return (RESULT) causes the function to return the
6017 value described by RESULT. RESULT is address of the block of
6018 memory returned by __builtin_apply. */
6019 case BUILT_IN_RETURN:
6020 if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
6021 expand_builtin_return (expand_normal (CALL_EXPR_ARG (exp, 0)));
6024 case BUILT_IN_SAVEREGS:
6025 return expand_builtin_saveregs ();
6027 case BUILT_IN_VA_ARG_PACK:
6028 /* All valid uses of __builtin_va_arg_pack () are removed during
6030 error ("%Kinvalid use of %<__builtin_va_arg_pack ()%>", exp);
6033 case BUILT_IN_VA_ARG_PACK_LEN:
6034 /* All valid uses of __builtin_va_arg_pack_len () are removed during
6036 error ("%Kinvalid use of %<__builtin_va_arg_pack_len ()%>", exp);
6039 /* Return the address of the first anonymous stack arg. */
6040 case BUILT_IN_NEXT_ARG:
6041 if (fold_builtin_next_arg (exp, false))
6043 return expand_builtin_next_arg ();
6045 case BUILT_IN_CLEAR_CACHE:
6046 target = expand_builtin___clear_cache (exp);
6051 case BUILT_IN_CLASSIFY_TYPE:
6052 return expand_builtin_classify_type (exp);
6054 case BUILT_IN_CONSTANT_P:
6057 case BUILT_IN_FRAME_ADDRESS:
6058 case BUILT_IN_RETURN_ADDRESS:
6059 return expand_builtin_frame_address (fndecl, exp);
6061 /* Returns the address of the area where the structure is returned.
6063 case BUILT_IN_AGGREGATE_INCOMING_ADDRESS:
6064 if (call_expr_nargs (exp) != 0
6065 || ! AGGREGATE_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl)))
6066 || !MEM_P (DECL_RTL (DECL_RESULT (current_function_decl))))
6069 return XEXP (DECL_RTL (DECL_RESULT (current_function_decl)), 0);
6071 case BUILT_IN_ALLOCA:
6072 case BUILT_IN_ALLOCA_WITH_ALIGN:
6073 /* If the allocation stems from the declaration of a variable-sized
6074 object, it cannot accumulate. */
6075 target = expand_builtin_alloca (exp, CALL_ALLOCA_FOR_VAR_P (exp));
6080 case BUILT_IN_STACK_SAVE:
6081 return expand_stack_save ();
6083 case BUILT_IN_STACK_RESTORE:
6084 expand_stack_restore (CALL_EXPR_ARG (exp, 0));
6087 case BUILT_IN_BSWAP32:
6088 case BUILT_IN_BSWAP64:
6089 target = expand_builtin_bswap (exp, target, subtarget);
6095 CASE_INT_FN (BUILT_IN_FFS):
6096 case BUILT_IN_FFSIMAX:
6097 target = expand_builtin_unop (target_mode, exp, target,
6098 subtarget, ffs_optab);
6103 CASE_INT_FN (BUILT_IN_CLZ):
6104 case BUILT_IN_CLZIMAX:
6105 target = expand_builtin_unop (target_mode, exp, target,
6106 subtarget, clz_optab);
6111 CASE_INT_FN (BUILT_IN_CTZ):
6112 case BUILT_IN_CTZIMAX:
6113 target = expand_builtin_unop (target_mode, exp, target,
6114 subtarget, ctz_optab);
6119 CASE_INT_FN (BUILT_IN_CLRSB):
6120 case BUILT_IN_CLRSBIMAX:
6121 target = expand_builtin_unop (target_mode, exp, target,
6122 subtarget, clrsb_optab);
6127 CASE_INT_FN (BUILT_IN_POPCOUNT):
6128 case BUILT_IN_POPCOUNTIMAX:
6129 target = expand_builtin_unop (target_mode, exp, target,
6130 subtarget, popcount_optab);
6135 CASE_INT_FN (BUILT_IN_PARITY):
6136 case BUILT_IN_PARITYIMAX:
6137 target = expand_builtin_unop (target_mode, exp, target,
6138 subtarget, parity_optab);
6143 case BUILT_IN_STRLEN:
6144 target = expand_builtin_strlen (exp, target, target_mode);
6149 case BUILT_IN_STRCPY:
6150 target = expand_builtin_strcpy (exp, target);
6155 case BUILT_IN_STRNCPY:
6156 target = expand_builtin_strncpy (exp, target);
6161 case BUILT_IN_STPCPY:
6162 target = expand_builtin_stpcpy (exp, target, mode);
6167 case BUILT_IN_MEMCPY:
6168 target = expand_builtin_memcpy (exp, target);
6173 case BUILT_IN_MEMPCPY:
6174 target = expand_builtin_mempcpy (exp, target, mode);
6179 case BUILT_IN_MEMSET:
6180 target = expand_builtin_memset (exp, target, mode);
6185 case BUILT_IN_BZERO:
6186 target = expand_builtin_bzero (exp);
6191 case BUILT_IN_STRCMP:
6192 target = expand_builtin_strcmp (exp, target);
6197 case BUILT_IN_STRNCMP:
6198 target = expand_builtin_strncmp (exp, target, mode);
6204 case BUILT_IN_MEMCMP:
6205 target = expand_builtin_memcmp (exp, target, mode);
6210 case BUILT_IN_SETJMP:
6211 /* This should have been lowered to the builtins below. */
6214 case BUILT_IN_SETJMP_SETUP:
6215 /* __builtin_setjmp_setup is passed a pointer to an array of five words
6216 and the receiver label. */
6217 if (validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
6219 rtx buf_addr = expand_expr (CALL_EXPR_ARG (exp, 0), subtarget,
6220 VOIDmode, EXPAND_NORMAL);
6221 tree label = TREE_OPERAND (CALL_EXPR_ARG (exp, 1), 0);
6222 rtx label_r = label_rtx (label);
6224 /* This is copied from the handling of non-local gotos. */
6225 expand_builtin_setjmp_setup (buf_addr, label_r);
6226 nonlocal_goto_handler_labels
6227 = gen_rtx_EXPR_LIST (VOIDmode, label_r,
6228 nonlocal_goto_handler_labels);
6229 /* ??? Do not let expand_label treat us as such since we would
6230 not want to be both on the list of non-local labels and on
6231 the list of forced labels. */
6232 FORCED_LABEL (label) = 0;
6237 case BUILT_IN_SETJMP_DISPATCHER:
6238 /* __builtin_setjmp_dispatcher is passed the dispatcher label. */
6239 if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
6241 tree label = TREE_OPERAND (CALL_EXPR_ARG (exp, 0), 0);
6242 rtx label_r = label_rtx (label);
6244 /* Remove the dispatcher label from the list of non-local labels
6245 since the receiver labels have been added to it above. */
6246 remove_node_from_expr_list (label_r, &nonlocal_goto_handler_labels);
6251 case BUILT_IN_SETJMP_RECEIVER:
6252 /* __builtin_setjmp_receiver is passed the receiver label. */
6253 if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
6255 tree label = TREE_OPERAND (CALL_EXPR_ARG (exp, 0), 0);
6256 rtx label_r = label_rtx (label);
6258 expand_builtin_setjmp_receiver (label_r);
6263 /* __builtin_longjmp is passed a pointer to an array of five words.
6264 It's similar to the C library longjmp function but works with
6265 __builtin_setjmp above. */
6266 case BUILT_IN_LONGJMP:
6267 if (validate_arglist (exp, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
6269 rtx buf_addr = expand_expr (CALL_EXPR_ARG (exp, 0), subtarget,
6270 VOIDmode, EXPAND_NORMAL);
6271 rtx value = expand_normal (CALL_EXPR_ARG (exp, 1));
6273 if (value != const1_rtx)
6275 error ("%<__builtin_longjmp%> second argument must be 1");
6279 expand_builtin_longjmp (buf_addr, value);
6284 case BUILT_IN_NONLOCAL_GOTO:
6285 target = expand_builtin_nonlocal_goto (exp);
6290 /* This updates the setjmp buffer that is its argument with the value
6291 of the current stack pointer. */
6292 case BUILT_IN_UPDATE_SETJMP_BUF:
6293 if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
6296 = expand_normal (CALL_EXPR_ARG (exp, 0));
6298 expand_builtin_update_setjmp_buf (buf_addr);
6304 expand_builtin_trap ();
6307 case BUILT_IN_UNREACHABLE:
6308 expand_builtin_unreachable ();
6311 CASE_FLT_FN (BUILT_IN_SIGNBIT):
6312 case BUILT_IN_SIGNBITD32:
6313 case BUILT_IN_SIGNBITD64:
6314 case BUILT_IN_SIGNBITD128:
6315 target = expand_builtin_signbit (exp, target);
6320 /* Various hooks for the DWARF 2 __throw routine. */
6321 case BUILT_IN_UNWIND_INIT:
6322 expand_builtin_unwind_init ();
6324 case BUILT_IN_DWARF_CFA:
6325 return virtual_cfa_rtx;
6326 #ifdef DWARF2_UNWIND_INFO
6327 case BUILT_IN_DWARF_SP_COLUMN:
6328 return expand_builtin_dwarf_sp_column ();
6329 case BUILT_IN_INIT_DWARF_REG_SIZES:
6330 expand_builtin_init_dwarf_reg_sizes (CALL_EXPR_ARG (exp, 0));
6333 case BUILT_IN_FROB_RETURN_ADDR:
6334 return expand_builtin_frob_return_addr (CALL_EXPR_ARG (exp, 0));
6335 case BUILT_IN_EXTRACT_RETURN_ADDR:
6336 return expand_builtin_extract_return_addr (CALL_EXPR_ARG (exp, 0));
6337 case BUILT_IN_EH_RETURN:
6338 expand_builtin_eh_return (CALL_EXPR_ARG (exp, 0),
6339 CALL_EXPR_ARG (exp, 1));
6341 #ifdef EH_RETURN_DATA_REGNO
6342 case BUILT_IN_EH_RETURN_DATA_REGNO:
6343 return expand_builtin_eh_return_data_regno (exp);
6345 case BUILT_IN_EXTEND_POINTER:
6346 return expand_builtin_extend_pointer (CALL_EXPR_ARG (exp, 0));
6347 case BUILT_IN_EH_POINTER:
6348 return expand_builtin_eh_pointer (exp);
6349 case BUILT_IN_EH_FILTER:
6350 return expand_builtin_eh_filter (exp);
6351 case BUILT_IN_EH_COPY_VALUES:
6352 return expand_builtin_eh_copy_values (exp);
6354 case BUILT_IN_VA_START:
6355 return expand_builtin_va_start (exp);
6356 case BUILT_IN_VA_END:
6357 return expand_builtin_va_end (exp);
6358 case BUILT_IN_VA_COPY:
6359 return expand_builtin_va_copy (exp);
6360 case BUILT_IN_EXPECT:
6361 return expand_builtin_expect (exp, target);
6362 case BUILT_IN_ASSUME_ALIGNED:
6363 return expand_builtin_assume_aligned (exp, target);
6364 case BUILT_IN_PREFETCH:
6365 expand_builtin_prefetch (exp);
6368 case BUILT_IN_INIT_TRAMPOLINE:
6369 return expand_builtin_init_trampoline (exp, true);
6370 case BUILT_IN_INIT_HEAP_TRAMPOLINE:
6371 return expand_builtin_init_trampoline (exp, false);
6372 case BUILT_IN_ADJUST_TRAMPOLINE:
6373 return expand_builtin_adjust_trampoline (exp);
6376 case BUILT_IN_EXECL:
6377 case BUILT_IN_EXECV:
6378 case BUILT_IN_EXECLP:
6379 case BUILT_IN_EXECLE:
6380 case BUILT_IN_EXECVP:
6381 case BUILT_IN_EXECVE:
6382 target = expand_builtin_fork_or_exec (fndecl, exp, target, ignore);
6387 case BUILT_IN_SYNC_FETCH_AND_ADD_1:
6388 case BUILT_IN_SYNC_FETCH_AND_ADD_2:
6389 case BUILT_IN_SYNC_FETCH_AND_ADD_4:
6390 case BUILT_IN_SYNC_FETCH_AND_ADD_8:
6391 case BUILT_IN_SYNC_FETCH_AND_ADD_16:
6392 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_ADD_1);
6393 target = expand_builtin_sync_operation (mode, exp, PLUS, false, target);
6398 case BUILT_IN_SYNC_FETCH_AND_SUB_1:
6399 case BUILT_IN_SYNC_FETCH_AND_SUB_2:
6400 case BUILT_IN_SYNC_FETCH_AND_SUB_4:
6401 case BUILT_IN_SYNC_FETCH_AND_SUB_8:
6402 case BUILT_IN_SYNC_FETCH_AND_SUB_16:
6403 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_SUB_1);
6404 target = expand_builtin_sync_operation (mode, exp, MINUS, false, target);
6409 case BUILT_IN_SYNC_FETCH_AND_OR_1:
6410 case BUILT_IN_SYNC_FETCH_AND_OR_2:
6411 case BUILT_IN_SYNC_FETCH_AND_OR_4:
6412 case BUILT_IN_SYNC_FETCH_AND_OR_8:
6413 case BUILT_IN_SYNC_FETCH_AND_OR_16:
6414 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_OR_1);
6415 target = expand_builtin_sync_operation (mode, exp, IOR, false, target);
6420 case BUILT_IN_SYNC_FETCH_AND_AND_1:
6421 case BUILT_IN_SYNC_FETCH_AND_AND_2:
6422 case BUILT_IN_SYNC_FETCH_AND_AND_4:
6423 case BUILT_IN_SYNC_FETCH_AND_AND_8:
6424 case BUILT_IN_SYNC_FETCH_AND_AND_16:
6425 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_AND_1);
6426 target = expand_builtin_sync_operation (mode, exp, AND, false, target);
6431 case BUILT_IN_SYNC_FETCH_AND_XOR_1:
6432 case BUILT_IN_SYNC_FETCH_AND_XOR_2:
6433 case BUILT_IN_SYNC_FETCH_AND_XOR_4:
6434 case BUILT_IN_SYNC_FETCH_AND_XOR_8:
6435 case BUILT_IN_SYNC_FETCH_AND_XOR_16:
6436 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_XOR_1);
6437 target = expand_builtin_sync_operation (mode, exp, XOR, false, target);
6442 case BUILT_IN_SYNC_FETCH_AND_NAND_1:
6443 case BUILT_IN_SYNC_FETCH_AND_NAND_2:
6444 case BUILT_IN_SYNC_FETCH_AND_NAND_4:
6445 case BUILT_IN_SYNC_FETCH_AND_NAND_8:
6446 case BUILT_IN_SYNC_FETCH_AND_NAND_16:
6447 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_NAND_1);
6448 target = expand_builtin_sync_operation (mode, exp, NOT, false, target);
6453 case BUILT_IN_SYNC_ADD_AND_FETCH_1:
6454 case BUILT_IN_SYNC_ADD_AND_FETCH_2:
6455 case BUILT_IN_SYNC_ADD_AND_FETCH_4:
6456 case BUILT_IN_SYNC_ADD_AND_FETCH_8:
6457 case BUILT_IN_SYNC_ADD_AND_FETCH_16:
6458 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_ADD_AND_FETCH_1);
6459 target = expand_builtin_sync_operation (mode, exp, PLUS, true, target);
6464 case BUILT_IN_SYNC_SUB_AND_FETCH_1:
6465 case BUILT_IN_SYNC_SUB_AND_FETCH_2:
6466 case BUILT_IN_SYNC_SUB_AND_FETCH_4:
6467 case BUILT_IN_SYNC_SUB_AND_FETCH_8:
6468 case BUILT_IN_SYNC_SUB_AND_FETCH_16:
6469 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_SUB_AND_FETCH_1);
6470 target = expand_builtin_sync_operation (mode, exp, MINUS, true, target);
6475 case BUILT_IN_SYNC_OR_AND_FETCH_1:
6476 case BUILT_IN_SYNC_OR_AND_FETCH_2:
6477 case BUILT_IN_SYNC_OR_AND_FETCH_4:
6478 case BUILT_IN_SYNC_OR_AND_FETCH_8:
6479 case BUILT_IN_SYNC_OR_AND_FETCH_16:
6480 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_OR_AND_FETCH_1);
6481 target = expand_builtin_sync_operation (mode, exp, IOR, true, target);
6486 case BUILT_IN_SYNC_AND_AND_FETCH_1:
6487 case BUILT_IN_SYNC_AND_AND_FETCH_2:
6488 case BUILT_IN_SYNC_AND_AND_FETCH_4:
6489 case BUILT_IN_SYNC_AND_AND_FETCH_8:
6490 case BUILT_IN_SYNC_AND_AND_FETCH_16:
6491 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_AND_AND_FETCH_1);
6492 target = expand_builtin_sync_operation (mode, exp, AND, true, target);
6497 case BUILT_IN_SYNC_XOR_AND_FETCH_1:
6498 case BUILT_IN_SYNC_XOR_AND_FETCH_2:
6499 case BUILT_IN_SYNC_XOR_AND_FETCH_4:
6500 case BUILT_IN_SYNC_XOR_AND_FETCH_8:
6501 case BUILT_IN_SYNC_XOR_AND_FETCH_16:
6502 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_XOR_AND_FETCH_1);
6503 target = expand_builtin_sync_operation (mode, exp, XOR, true, target);
6508 case BUILT_IN_SYNC_NAND_AND_FETCH_1:
6509 case BUILT_IN_SYNC_NAND_AND_FETCH_2:
6510 case BUILT_IN_SYNC_NAND_AND_FETCH_4:
6511 case BUILT_IN_SYNC_NAND_AND_FETCH_8:
6512 case BUILT_IN_SYNC_NAND_AND_FETCH_16:
6513 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_NAND_AND_FETCH_1);
6514 target = expand_builtin_sync_operation (mode, exp, NOT, true, target);
6519 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_1:
6520 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_2:
6521 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_4:
6522 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_8:
6523 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_16:
6524 if (mode == VOIDmode)
6525 mode = TYPE_MODE (boolean_type_node);
6526 if (!target || !register_operand (target, mode))
6527 target = gen_reg_rtx (mode);
6529 mode = get_builtin_sync_mode
6530 (fcode - BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_1);
6531 target = expand_builtin_compare_and_swap (mode, exp, true, target);
6536 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_1:
6537 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_2:
6538 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_4:
6539 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_8:
6540 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_16:
6541 mode = get_builtin_sync_mode
6542 (fcode - BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_1);
6543 target = expand_builtin_compare_and_swap (mode, exp, false, target);
6548 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_1:
6549 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_2:
6550 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_4:
6551 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_8:
6552 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_16:
6553 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_LOCK_TEST_AND_SET_1);
6554 target = expand_builtin_sync_lock_test_and_set (mode, exp, target);
6559 case BUILT_IN_SYNC_LOCK_RELEASE_1:
6560 case BUILT_IN_SYNC_LOCK_RELEASE_2:
6561 case BUILT_IN_SYNC_LOCK_RELEASE_4:
6562 case BUILT_IN_SYNC_LOCK_RELEASE_8:
6563 case BUILT_IN_SYNC_LOCK_RELEASE_16:
6564 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_LOCK_RELEASE_1);
6565 expand_builtin_sync_lock_release (mode, exp);
6568 case BUILT_IN_SYNC_SYNCHRONIZE:
6569 expand_builtin_sync_synchronize ();
6572 case BUILT_IN_ATOMIC_EXCHANGE_1:
6573 case BUILT_IN_ATOMIC_EXCHANGE_2:
6574 case BUILT_IN_ATOMIC_EXCHANGE_4:
6575 case BUILT_IN_ATOMIC_EXCHANGE_8:
6576 case BUILT_IN_ATOMIC_EXCHANGE_16:
6577 mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_EXCHANGE_1);
6578 target = expand_builtin_atomic_exchange (mode, exp, target);
6583 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_1:
6584 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_2:
6585 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_4:
6586 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_8:
6587 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_16:
6589 unsigned int nargs, z;
6593 get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_COMPARE_EXCHANGE_1);
6594 target = expand_builtin_atomic_compare_exchange (mode, exp, target);
6598 /* If this is turned into an external library call, the weak parameter
6599 must be dropped to match the expected parameter list. */
6600 nargs = call_expr_nargs (exp);
6601 vec = VEC_alloc (tree, gc, nargs - 1);
6602 for (z = 0; z < 3; z++)
6603 VEC_quick_push (tree, vec, CALL_EXPR_ARG (exp, z));
6604 /* Skip the boolean weak parameter. */
6605 for (z = 4; z < 6; z++)
6606 VEC_quick_push (tree, vec, CALL_EXPR_ARG (exp, z));
6607 exp = build_call_vec (TREE_TYPE (exp), CALL_EXPR_FN (exp), vec);
6611 case BUILT_IN_ATOMIC_LOAD_1:
6612 case BUILT_IN_ATOMIC_LOAD_2:
6613 case BUILT_IN_ATOMIC_LOAD_4:
6614 case BUILT_IN_ATOMIC_LOAD_8:
6615 case BUILT_IN_ATOMIC_LOAD_16:
6616 mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_LOAD_1);
6617 target = expand_builtin_atomic_load (mode, exp, target);
6622 case BUILT_IN_ATOMIC_STORE_1:
6623 case BUILT_IN_ATOMIC_STORE_2:
6624 case BUILT_IN_ATOMIC_STORE_4:
6625 case BUILT_IN_ATOMIC_STORE_8:
6626 case BUILT_IN_ATOMIC_STORE_16:
6627 mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_STORE_1);
6628 target = expand_builtin_atomic_store (mode, exp);
6633 case BUILT_IN_ATOMIC_ADD_FETCH_1:
6634 case BUILT_IN_ATOMIC_ADD_FETCH_2:
6635 case BUILT_IN_ATOMIC_ADD_FETCH_4:
6636 case BUILT_IN_ATOMIC_ADD_FETCH_8:
6637 case BUILT_IN_ATOMIC_ADD_FETCH_16:
6639 enum built_in_function lib;
6640 mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_ADD_FETCH_1);
6641 lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_ADD_1 +
6642 (fcode - BUILT_IN_ATOMIC_ADD_FETCH_1));
6643 target = expand_builtin_atomic_fetch_op (mode, exp, target, PLUS, true,
6649 case BUILT_IN_ATOMIC_SUB_FETCH_1:
6650 case BUILT_IN_ATOMIC_SUB_FETCH_2:
6651 case BUILT_IN_ATOMIC_SUB_FETCH_4:
6652 case BUILT_IN_ATOMIC_SUB_FETCH_8:
6653 case BUILT_IN_ATOMIC_SUB_FETCH_16:
6655 enum built_in_function lib;
6656 mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_SUB_FETCH_1);
6657 lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_SUB_1 +
6658 (fcode - BUILT_IN_ATOMIC_SUB_FETCH_1));
6659 target = expand_builtin_atomic_fetch_op (mode, exp, target, MINUS, true,
6665 case BUILT_IN_ATOMIC_AND_FETCH_1:
6666 case BUILT_IN_ATOMIC_AND_FETCH_2:
6667 case BUILT_IN_ATOMIC_AND_FETCH_4:
6668 case BUILT_IN_ATOMIC_AND_FETCH_8:
6669 case BUILT_IN_ATOMIC_AND_FETCH_16:
6671 enum built_in_function lib;
6672 mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_AND_FETCH_1);
6673 lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_AND_1 +
6674 (fcode - BUILT_IN_ATOMIC_AND_FETCH_1));
6675 target = expand_builtin_atomic_fetch_op (mode, exp, target, AND, true,
6681 case BUILT_IN_ATOMIC_NAND_FETCH_1:
6682 case BUILT_IN_ATOMIC_NAND_FETCH_2:
6683 case BUILT_IN_ATOMIC_NAND_FETCH_4:
6684 case BUILT_IN_ATOMIC_NAND_FETCH_8:
6685 case BUILT_IN_ATOMIC_NAND_FETCH_16:
6687 enum built_in_function lib;
6688 mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_NAND_FETCH_1);
6689 lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_NAND_1 +
6690 (fcode - BUILT_IN_ATOMIC_NAND_FETCH_1));
6691 target = expand_builtin_atomic_fetch_op (mode, exp, target, NOT, true,
6697 case BUILT_IN_ATOMIC_XOR_FETCH_1:
6698 case BUILT_IN_ATOMIC_XOR_FETCH_2:
6699 case BUILT_IN_ATOMIC_XOR_FETCH_4:
6700 case BUILT_IN_ATOMIC_XOR_FETCH_8:
6701 case BUILT_IN_ATOMIC_XOR_FETCH_16:
6703 enum built_in_function lib;
6704 mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_XOR_FETCH_1);
6705 lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_XOR_1 +
6706 (fcode - BUILT_IN_ATOMIC_XOR_FETCH_1));
6707 target = expand_builtin_atomic_fetch_op (mode, exp, target, XOR, true,
6713 case BUILT_IN_ATOMIC_OR_FETCH_1:
6714 case BUILT_IN_ATOMIC_OR_FETCH_2:
6715 case BUILT_IN_ATOMIC_OR_FETCH_4:
6716 case BUILT_IN_ATOMIC_OR_FETCH_8:
6717 case BUILT_IN_ATOMIC_OR_FETCH_16:
6719 enum built_in_function lib;
6720 mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_OR_FETCH_1);
6721 lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_OR_1 +
6722 (fcode - BUILT_IN_ATOMIC_OR_FETCH_1));
6723 target = expand_builtin_atomic_fetch_op (mode, exp, target, IOR, true,
6729 case BUILT_IN_ATOMIC_FETCH_ADD_1:
6730 case BUILT_IN_ATOMIC_FETCH_ADD_2:
6731 case BUILT_IN_ATOMIC_FETCH_ADD_4:
6732 case BUILT_IN_ATOMIC_FETCH_ADD_8:
6733 case BUILT_IN_ATOMIC_FETCH_ADD_16:
6734 mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_ADD_1);
6735 target = expand_builtin_atomic_fetch_op (mode, exp, target, PLUS, false,
6736 ignore, BUILT_IN_NONE);
6741 case BUILT_IN_ATOMIC_FETCH_SUB_1:
6742 case BUILT_IN_ATOMIC_FETCH_SUB_2:
6743 case BUILT_IN_ATOMIC_FETCH_SUB_4:
6744 case BUILT_IN_ATOMIC_FETCH_SUB_8:
6745 case BUILT_IN_ATOMIC_FETCH_SUB_16:
6746 mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_SUB_1);
6747 target = expand_builtin_atomic_fetch_op (mode, exp, target, MINUS, false,
6748 ignore, BUILT_IN_NONE);
6753 case BUILT_IN_ATOMIC_FETCH_AND_1:
6754 case BUILT_IN_ATOMIC_FETCH_AND_2:
6755 case BUILT_IN_ATOMIC_FETCH_AND_4:
6756 case BUILT_IN_ATOMIC_FETCH_AND_8:
6757 case BUILT_IN_ATOMIC_FETCH_AND_16:
6758 mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_AND_1);
6759 target = expand_builtin_atomic_fetch_op (mode, exp, target, AND, false,
6760 ignore, BUILT_IN_NONE);
6765 case BUILT_IN_ATOMIC_FETCH_NAND_1:
6766 case BUILT_IN_ATOMIC_FETCH_NAND_2:
6767 case BUILT_IN_ATOMIC_FETCH_NAND_4:
6768 case BUILT_IN_ATOMIC_FETCH_NAND_8:
6769 case BUILT_IN_ATOMIC_FETCH_NAND_16:
6770 mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_NAND_1);
6771 target = expand_builtin_atomic_fetch_op (mode, exp, target, NOT, false,
6772 ignore, BUILT_IN_NONE);
6777 case BUILT_IN_ATOMIC_FETCH_XOR_1:
6778 case BUILT_IN_ATOMIC_FETCH_XOR_2:
6779 case BUILT_IN_ATOMIC_FETCH_XOR_4:
6780 case BUILT_IN_ATOMIC_FETCH_XOR_8:
6781 case BUILT_IN_ATOMIC_FETCH_XOR_16:
6782 mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_XOR_1);
6783 target = expand_builtin_atomic_fetch_op (mode, exp, target, XOR, false,
6784 ignore, BUILT_IN_NONE);
6789 case BUILT_IN_ATOMIC_FETCH_OR_1:
6790 case BUILT_IN_ATOMIC_FETCH_OR_2:
6791 case BUILT_IN_ATOMIC_FETCH_OR_4:
6792 case BUILT_IN_ATOMIC_FETCH_OR_8:
6793 case BUILT_IN_ATOMIC_FETCH_OR_16:
6794 mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_OR_1);
6795 target = expand_builtin_atomic_fetch_op (mode, exp, target, IOR, false,
6796 ignore, BUILT_IN_NONE);
6801 case BUILT_IN_ATOMIC_TEST_AND_SET:
6802 return expand_builtin_atomic_test_and_set (exp, target);
6804 case BUILT_IN_ATOMIC_CLEAR:
6805 return expand_builtin_atomic_clear (exp);
6807 case BUILT_IN_ATOMIC_ALWAYS_LOCK_FREE:
6808 return expand_builtin_atomic_always_lock_free (exp);
6810 case BUILT_IN_ATOMIC_IS_LOCK_FREE:
6811 target = expand_builtin_atomic_is_lock_free (exp);
6816 case BUILT_IN_ATOMIC_THREAD_FENCE:
6817 expand_builtin_atomic_thread_fence (exp);
6820 case BUILT_IN_ATOMIC_SIGNAL_FENCE:
6821 expand_builtin_atomic_signal_fence (exp);
6824 case BUILT_IN_OBJECT_SIZE:
6825 return expand_builtin_object_size (exp);
6827 case BUILT_IN_MEMCPY_CHK:
6828 case BUILT_IN_MEMPCPY_CHK:
6829 case BUILT_IN_MEMMOVE_CHK:
6830 case BUILT_IN_MEMSET_CHK:
6831 target = expand_builtin_memory_chk (exp, target, mode, fcode);
6836 case BUILT_IN_STRCPY_CHK:
6837 case BUILT_IN_STPCPY_CHK:
6838 case BUILT_IN_STRNCPY_CHK:
6839 case BUILT_IN_STPNCPY_CHK:
6840 case BUILT_IN_STRCAT_CHK:
6841 case BUILT_IN_STRNCAT_CHK:
6842 case BUILT_IN_SNPRINTF_CHK:
6843 case BUILT_IN_VSNPRINTF_CHK:
6844 maybe_emit_chk_warning (exp, fcode);
6847 case BUILT_IN_SPRINTF_CHK:
6848 case BUILT_IN_VSPRINTF_CHK:
6849 maybe_emit_sprintf_chk_warning (exp, fcode);
6853 if (warn_free_nonheap_object)
6854 maybe_emit_free_warning (exp);
6857 default: /* just do library call, if unknown builtin */
6861 /* The switch statement above can drop through to cause the function
6862 to be called normally. */
6863 return expand_call (exp, target, ignore);
6866 /* Determine whether a tree node represents a call to a built-in
6867 function. If the tree T is a call to a built-in function with
6868 the right number of arguments of the appropriate types, return
6869 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
6870 Otherwise the return value is END_BUILTINS. */
6872 enum built_in_function
6873 builtin_mathfn_code (const_tree t)
6875 const_tree fndecl, arg, parmlist;
6876 const_tree argtype, parmtype;
6877 const_call_expr_arg_iterator iter;
6879 if (TREE_CODE (t) != CALL_EXPR
6880 || TREE_CODE (CALL_EXPR_FN (t)) != ADDR_EXPR)
6881 return END_BUILTINS;
6883 fndecl = get_callee_fndecl (t);
6884 if (fndecl == NULL_TREE
6885 || TREE_CODE (fndecl) != FUNCTION_DECL
6886 || ! DECL_BUILT_IN (fndecl)
6887 || DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
6888 return END_BUILTINS;
6890 parmlist = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
6891 init_const_call_expr_arg_iterator (t, &iter);
6892 for (; parmlist; parmlist = TREE_CHAIN (parmlist))
6894 /* If a function doesn't take a variable number of arguments,
6895 the last element in the list will have type `void'. */
6896 parmtype = TREE_VALUE (parmlist);
6897 if (VOID_TYPE_P (parmtype))
6899 if (more_const_call_expr_args_p (&iter))
6900 return END_BUILTINS;
6901 return DECL_FUNCTION_CODE (fndecl);
6904 if (! more_const_call_expr_args_p (&iter))
6905 return END_BUILTINS;
6907 arg = next_const_call_expr_arg (&iter);
6908 argtype = TREE_TYPE (arg);
6910 if (SCALAR_FLOAT_TYPE_P (parmtype))
6912 if (! SCALAR_FLOAT_TYPE_P (argtype))
6913 return END_BUILTINS;
6915 else if (COMPLEX_FLOAT_TYPE_P (parmtype))
6917 if (! COMPLEX_FLOAT_TYPE_P (argtype))
6918 return END_BUILTINS;
6920 else if (POINTER_TYPE_P (parmtype))
6922 if (! POINTER_TYPE_P (argtype))
6923 return END_BUILTINS;
6925 else if (INTEGRAL_TYPE_P (parmtype))
6927 if (! INTEGRAL_TYPE_P (argtype))
6928 return END_BUILTINS;
6931 return END_BUILTINS;
6934 /* Variable-length argument list. */
6935 return DECL_FUNCTION_CODE (fndecl);
6938 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
6939 evaluate to a constant. */
6942 fold_builtin_constant_p (tree arg)
6944 /* We return 1 for a numeric type that's known to be a constant
6945 value at compile-time or for an aggregate type that's a
6946 literal constant. */
6949 /* If we know this is a constant, emit the constant of one. */
6950 if (CONSTANT_CLASS_P (arg)
6951 || (TREE_CODE (arg) == CONSTRUCTOR
6952 && TREE_CONSTANT (arg)))
6953 return integer_one_node;
6954 if (TREE_CODE (arg) == ADDR_EXPR)
6956 tree op = TREE_OPERAND (arg, 0);
6957 if (TREE_CODE (op) == STRING_CST
6958 || (TREE_CODE (op) == ARRAY_REF
6959 && integer_zerop (TREE_OPERAND (op, 1))
6960 && TREE_CODE (TREE_OPERAND (op, 0)) == STRING_CST))
6961 return integer_one_node;
6964 /* If this expression has side effects, show we don't know it to be a
6965 constant. Likewise if it's a pointer or aggregate type since in
6966 those case we only want literals, since those are only optimized
6967 when generating RTL, not later.
6968 And finally, if we are compiling an initializer, not code, we
6969 need to return a definite result now; there's not going to be any
6970 more optimization done. */
6971 if (TREE_SIDE_EFFECTS (arg)
6972 || AGGREGATE_TYPE_P (TREE_TYPE (arg))
6973 || POINTER_TYPE_P (TREE_TYPE (arg))
6975 || folding_initializer)
6976 return integer_zero_node;
6981 /* Create builtin_expect with PRED and EXPECTED as its arguments and
6982 return it as a truthvalue. */
6985 build_builtin_expect_predicate (location_t loc, tree pred, tree expected)
6987 tree fn, arg_types, pred_type, expected_type, call_expr, ret_type;
6989 fn = builtin_decl_explicit (BUILT_IN_EXPECT);
6990 arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn));
6991 ret_type = TREE_TYPE (TREE_TYPE (fn));
6992 pred_type = TREE_VALUE (arg_types);
6993 expected_type = TREE_VALUE (TREE_CHAIN (arg_types));
6995 pred = fold_convert_loc (loc, pred_type, pred);
6996 expected = fold_convert_loc (loc, expected_type, expected);
6997 call_expr = build_call_expr_loc (loc, fn, 2, pred, expected);
6999 return build2 (NE_EXPR, TREE_TYPE (pred), call_expr,
7000 build_int_cst (ret_type, 0));
7003 /* Fold a call to builtin_expect with arguments ARG0 and ARG1. Return
7004 NULL_TREE if no simplification is possible. */
7007 fold_builtin_expect (location_t loc, tree arg0, tree arg1)
7009 tree inner, fndecl, inner_arg0;
7010 enum tree_code code;
7012 /* Distribute the expected value over short-circuiting operators.
7013 See through the cast from truthvalue_type_node to long. */
7015 while (TREE_CODE (inner_arg0) == NOP_EXPR
7016 && INTEGRAL_TYPE_P (TREE_TYPE (inner_arg0))
7017 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (inner_arg0, 0))))
7018 inner_arg0 = TREE_OPERAND (inner_arg0, 0);
7020 /* If this is a builtin_expect within a builtin_expect keep the
7021 inner one. See through a comparison against a constant. It
7022 might have been added to create a thruthvalue. */
7025 if (COMPARISON_CLASS_P (inner)
7026 && TREE_CODE (TREE_OPERAND (inner, 1)) == INTEGER_CST)
7027 inner = TREE_OPERAND (inner, 0);
7029 if (TREE_CODE (inner) == CALL_EXPR
7030 && (fndecl = get_callee_fndecl (inner))
7031 && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
7032 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_EXPECT)
7036 code = TREE_CODE (inner);
7037 if (code == TRUTH_ANDIF_EXPR || code == TRUTH_ORIF_EXPR)
7039 tree op0 = TREE_OPERAND (inner, 0);
7040 tree op1 = TREE_OPERAND (inner, 1);
7042 op0 = build_builtin_expect_predicate (loc, op0, arg1);
7043 op1 = build_builtin_expect_predicate (loc, op1, arg1);
7044 inner = build2 (code, TREE_TYPE (inner), op0, op1);
7046 return fold_convert_loc (loc, TREE_TYPE (arg0), inner);
7049 /* If the argument isn't invariant then there's nothing else we can do. */
7050 if (!TREE_CONSTANT (inner_arg0))
7053 /* If we expect that a comparison against the argument will fold to
7054 a constant return the constant. In practice, this means a true
7055 constant or the address of a non-weak symbol. */
7058 if (TREE_CODE (inner) == ADDR_EXPR)
7062 inner = TREE_OPERAND (inner, 0);
7064 while (TREE_CODE (inner) == COMPONENT_REF
7065 || TREE_CODE (inner) == ARRAY_REF);
7066 if ((TREE_CODE (inner) == VAR_DECL
7067 || TREE_CODE (inner) == FUNCTION_DECL)
7068 && DECL_WEAK (inner))
7072 /* Otherwise, ARG0 already has the proper type for the return value. */
7076 /* Fold a call to __builtin_classify_type with argument ARG. */
7079 fold_builtin_classify_type (tree arg)
7082 return build_int_cst (integer_type_node, no_type_class);
7084 return build_int_cst (integer_type_node, type_to_class (TREE_TYPE (arg)));
7087 /* Fold a call to __builtin_strlen with argument ARG. */
7090 fold_builtin_strlen (location_t loc, tree type, tree arg)
7092 if (!validate_arg (arg, POINTER_TYPE))
7096 tree len = c_strlen (arg, 0);
7099 return fold_convert_loc (loc, type, len);
7105 /* Fold a call to __builtin_inf or __builtin_huge_val. */
7108 fold_builtin_inf (location_t loc, tree type, int warn)
7110 REAL_VALUE_TYPE real;
7112 /* __builtin_inff is intended to be usable to define INFINITY on all
7113 targets. If an infinity is not available, INFINITY expands "to a
7114 positive constant of type float that overflows at translation
7115 time", footnote "In this case, using INFINITY will violate the
7116 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
7117 Thus we pedwarn to ensure this constraint violation is
7119 if (!MODE_HAS_INFINITIES (TYPE_MODE (type)) && warn)
7120 pedwarn (loc, 0, "target format does not support infinity");
7123 return build_real (type, real);
7126 /* Fold a call to __builtin_nan or __builtin_nans with argument ARG. */
7129 fold_builtin_nan (tree arg, tree type, int quiet)
7131 REAL_VALUE_TYPE real;
7134 if (!validate_arg (arg, POINTER_TYPE))
7136 str = c_getstr (arg);
7140 if (!real_nan (&real, str, quiet, TYPE_MODE (type)))
7143 return build_real (type, real);
7146 /* Return true if the floating point expression T has an integer value.
7147 We also allow +Inf, -Inf and NaN to be considered integer values. */
7150 integer_valued_real_p (tree t)
7152 switch (TREE_CODE (t))
7159 return integer_valued_real_p (TREE_OPERAND (t, 0));
7164 return integer_valued_real_p (TREE_OPERAND (t, 1));
7171 return integer_valued_real_p (TREE_OPERAND (t, 0))
7172 && integer_valued_real_p (TREE_OPERAND (t, 1));
7175 return integer_valued_real_p (TREE_OPERAND (t, 1))
7176 && integer_valued_real_p (TREE_OPERAND (t, 2));
7179 return real_isinteger (TREE_REAL_CST_PTR (t), TYPE_MODE (TREE_TYPE (t)));
7183 tree type = TREE_TYPE (TREE_OPERAND (t, 0));
7184 if (TREE_CODE (type) == INTEGER_TYPE)
7186 if (TREE_CODE (type) == REAL_TYPE)
7187 return integer_valued_real_p (TREE_OPERAND (t, 0));
7192 switch (builtin_mathfn_code (t))
7194 CASE_FLT_FN (BUILT_IN_CEIL):
7195 CASE_FLT_FN (BUILT_IN_FLOOR):
7196 CASE_FLT_FN (BUILT_IN_NEARBYINT):
7197 CASE_FLT_FN (BUILT_IN_RINT):
7198 CASE_FLT_FN (BUILT_IN_ROUND):
7199 CASE_FLT_FN (BUILT_IN_TRUNC):
7202 CASE_FLT_FN (BUILT_IN_FMIN):
7203 CASE_FLT_FN (BUILT_IN_FMAX):
7204 return integer_valued_real_p (CALL_EXPR_ARG (t, 0))
7205 && integer_valued_real_p (CALL_EXPR_ARG (t, 1));
7218 /* FNDECL is assumed to be a builtin where truncation can be propagated
7219 across (for instance floor((double)f) == (double)floorf (f).
7220 Do the transformation for a call with argument ARG. */
7223 fold_trunc_transparent_mathfn (location_t loc, tree fndecl, tree arg)
7225 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
7227 if (!validate_arg (arg, REAL_TYPE))
7230 /* Integer rounding functions are idempotent. */
7231 if (fcode == builtin_mathfn_code (arg))
7234 /* If argument is already integer valued, and we don't need to worry
7235 about setting errno, there's no need to perform rounding. */
7236 if (! flag_errno_math && integer_valued_real_p (arg))
7241 tree arg0 = strip_float_extensions (arg);
7242 tree ftype = TREE_TYPE (TREE_TYPE (fndecl));
7243 tree newtype = TREE_TYPE (arg0);
7246 if (TYPE_PRECISION (newtype) < TYPE_PRECISION (ftype)
7247 && (decl = mathfn_built_in (newtype, fcode)))
7248 return fold_convert_loc (loc, ftype,
7249 build_call_expr_loc (loc, decl, 1,
7250 fold_convert_loc (loc,
7257 /* FNDECL is assumed to be builtin which can narrow the FP type of
7258 the argument, for instance lround((double)f) -> lroundf (f).
7259 Do the transformation for a call with argument ARG. */
7262 fold_fixed_mathfn (location_t loc, tree fndecl, tree arg)
7264 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
7266 if (!validate_arg (arg, REAL_TYPE))
7269 /* If argument is already integer valued, and we don't need to worry
7270 about setting errno, there's no need to perform rounding. */
7271 if (! flag_errno_math && integer_valued_real_p (arg))
7272 return fold_build1_loc (loc, FIX_TRUNC_EXPR,
7273 TREE_TYPE (TREE_TYPE (fndecl)), arg);
7277 tree ftype = TREE_TYPE (arg);
7278 tree arg0 = strip_float_extensions (arg);
7279 tree newtype = TREE_TYPE (arg0);
7282 if (TYPE_PRECISION (newtype) < TYPE_PRECISION (ftype)
7283 && (decl = mathfn_built_in (newtype, fcode)))
7284 return build_call_expr_loc (loc, decl, 1,
7285 fold_convert_loc (loc, newtype, arg0));
7288 /* Canonicalize iround (x) to lround (x) on ILP32 targets where
7289 sizeof (int) == sizeof (long). */
7290 if (TYPE_PRECISION (integer_type_node)
7291 == TYPE_PRECISION (long_integer_type_node))
7293 tree newfn = NULL_TREE;
7296 CASE_FLT_FN (BUILT_IN_ICEIL):
7297 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LCEIL);
7300 CASE_FLT_FN (BUILT_IN_IFLOOR):
7301 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LFLOOR);
7304 CASE_FLT_FN (BUILT_IN_IROUND):
7305 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LROUND);
7308 CASE_FLT_FN (BUILT_IN_IRINT):
7309 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LRINT);
7318 tree newcall = build_call_expr_loc (loc, newfn, 1, arg);
7319 return fold_convert_loc (loc,
7320 TREE_TYPE (TREE_TYPE (fndecl)), newcall);
7324 /* Canonicalize llround (x) to lround (x) on LP64 targets where
7325 sizeof (long long) == sizeof (long). */
7326 if (TYPE_PRECISION (long_long_integer_type_node)
7327 == TYPE_PRECISION (long_integer_type_node))
7329 tree newfn = NULL_TREE;
7332 CASE_FLT_FN (BUILT_IN_LLCEIL):
7333 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LCEIL);
7336 CASE_FLT_FN (BUILT_IN_LLFLOOR):
7337 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LFLOOR);
7340 CASE_FLT_FN (BUILT_IN_LLROUND):
7341 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LROUND);
7344 CASE_FLT_FN (BUILT_IN_LLRINT):
7345 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LRINT);
7354 tree newcall = build_call_expr_loc (loc, newfn, 1, arg);
7355 return fold_convert_loc (loc,
7356 TREE_TYPE (TREE_TYPE (fndecl)), newcall);
7363 /* Fold call to builtin cabs, cabsf or cabsl with argument ARG. TYPE is the
7364 return type. Return NULL_TREE if no simplification can be made. */
7367 fold_builtin_cabs (location_t loc, tree arg, tree type, tree fndecl)
7371 if (!validate_arg (arg, COMPLEX_TYPE)
7372 || TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) != REAL_TYPE)
7375 /* Calculate the result when the argument is a constant. */
7376 if (TREE_CODE (arg) == COMPLEX_CST
7377 && (res = do_mpfr_arg2 (TREE_REALPART (arg), TREE_IMAGPART (arg),
7381 if (TREE_CODE (arg) == COMPLEX_EXPR)
7383 tree real = TREE_OPERAND (arg, 0);
7384 tree imag = TREE_OPERAND (arg, 1);
7386 /* If either part is zero, cabs is fabs of the other. */
7387 if (real_zerop (real))
7388 return fold_build1_loc (loc, ABS_EXPR, type, imag);
7389 if (real_zerop (imag))
7390 return fold_build1_loc (loc, ABS_EXPR, type, real);
7392 /* cabs(x+xi) -> fabs(x)*sqrt(2). */
7393 if (flag_unsafe_math_optimizations
7394 && operand_equal_p (real, imag, OEP_PURE_SAME))
7396 const REAL_VALUE_TYPE sqrt2_trunc
7397 = real_value_truncate (TYPE_MODE (type), dconst_sqrt2 ());
7399 return fold_build2_loc (loc, MULT_EXPR, type,
7400 fold_build1_loc (loc, ABS_EXPR, type, real),
7401 build_real (type, sqrt2_trunc));
7405 /* Optimize cabs(-z) and cabs(conj(z)) as cabs(z). */
7406 if (TREE_CODE (arg) == NEGATE_EXPR
7407 || TREE_CODE (arg) == CONJ_EXPR)
7408 return build_call_expr_loc (loc, fndecl, 1, TREE_OPERAND (arg, 0));
7410 /* Don't do this when optimizing for size. */
7411 if (flag_unsafe_math_optimizations
7412 && optimize && optimize_function_for_speed_p (cfun))
7414 tree sqrtfn = mathfn_built_in (type, BUILT_IN_SQRT);
7416 if (sqrtfn != NULL_TREE)
7418 tree rpart, ipart, result;
7420 arg = builtin_save_expr (arg);
7422 rpart = fold_build1_loc (loc, REALPART_EXPR, type, arg);
7423 ipart = fold_build1_loc (loc, IMAGPART_EXPR, type, arg);
7425 rpart = builtin_save_expr (rpart);
7426 ipart = builtin_save_expr (ipart);
7428 result = fold_build2_loc (loc, PLUS_EXPR, type,
7429 fold_build2_loc (loc, MULT_EXPR, type,
7431 fold_build2_loc (loc, MULT_EXPR, type,
7434 return build_call_expr_loc (loc, sqrtfn, 1, result);
7441 /* Build a complex (inf +- 0i) for the result of cproj. TYPE is the
7442 complex tree type of the result. If NEG is true, the imaginary
7443 zero is negative. */
7446 build_complex_cproj (tree type, bool neg)
7448 REAL_VALUE_TYPE rinf, rzero = dconst0;
7452 return build_complex (type, build_real (TREE_TYPE (type), rinf),
7453 build_real (TREE_TYPE (type), rzero));
7456 /* Fold call to builtin cproj, cprojf or cprojl with argument ARG. TYPE is the
7457 return type. Return NULL_TREE if no simplification can be made. */
7460 fold_builtin_cproj (location_t loc, tree arg, tree type)
7462 if (!validate_arg (arg, COMPLEX_TYPE)
7463 || TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) != REAL_TYPE)
7466 /* If there are no infinities, return arg. */
7467 if (! HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (type))))
7468 return non_lvalue_loc (loc, arg);
7470 /* Calculate the result when the argument is a constant. */
7471 if (TREE_CODE (arg) == COMPLEX_CST)
7473 const REAL_VALUE_TYPE *real = TREE_REAL_CST_PTR (TREE_REALPART (arg));
7474 const REAL_VALUE_TYPE *imag = TREE_REAL_CST_PTR (TREE_IMAGPART (arg));
7476 if (real_isinf (real) || real_isinf (imag))
7477 return build_complex_cproj (type, imag->sign);
7481 else if (TREE_CODE (arg) == COMPLEX_EXPR)
7483 tree real = TREE_OPERAND (arg, 0);
7484 tree imag = TREE_OPERAND (arg, 1);
7489 /* If the real part is inf and the imag part is known to be
7490 nonnegative, return (inf + 0i). Remember side-effects are
7491 possible in the imag part. */
7492 if (TREE_CODE (real) == REAL_CST
7493 && real_isinf (TREE_REAL_CST_PTR (real))
7494 && tree_expr_nonnegative_p (imag))
7495 return omit_one_operand_loc (loc, type,
7496 build_complex_cproj (type, false),
7499 /* If the imag part is inf, return (inf+I*copysign(0,imag)).
7500 Remember side-effects are possible in the real part. */
7501 if (TREE_CODE (imag) == REAL_CST
7502 && real_isinf (TREE_REAL_CST_PTR (imag)))
7504 omit_one_operand_loc (loc, type,
7505 build_complex_cproj (type, TREE_REAL_CST_PTR
7506 (imag)->sign), arg);
7512 /* Fold a builtin function call to sqrt, sqrtf, or sqrtl with argument ARG.
7513 Return NULL_TREE if no simplification can be made. */
7516 fold_builtin_sqrt (location_t loc, tree arg, tree type)
7519 enum built_in_function fcode;
7522 if (!validate_arg (arg, REAL_TYPE))
7525 /* Calculate the result when the argument is a constant. */
7526 if ((res = do_mpfr_arg1 (arg, type, mpfr_sqrt, &dconst0, NULL, true)))
7529 /* Optimize sqrt(expN(x)) = expN(x*0.5). */
7530 fcode = builtin_mathfn_code (arg);
7531 if (flag_unsafe_math_optimizations && BUILTIN_EXPONENT_P (fcode))
7533 tree expfn = TREE_OPERAND (CALL_EXPR_FN (arg), 0);
7534 arg = fold_build2_loc (loc, MULT_EXPR, type,
7535 CALL_EXPR_ARG (arg, 0),
7536 build_real (type, dconsthalf));
7537 return build_call_expr_loc (loc, expfn, 1, arg);
7540 /* Optimize sqrt(Nroot(x)) -> pow(x,1/(2*N)). */
7541 if (flag_unsafe_math_optimizations && BUILTIN_ROOT_P (fcode))
7543 tree powfn = mathfn_built_in (type, BUILT_IN_POW);
7547 tree arg0 = CALL_EXPR_ARG (arg, 0);
7549 /* The inner root was either sqrt or cbrt. */
7550 /* This was a conditional expression but it triggered a bug
7552 REAL_VALUE_TYPE dconstroot;
7553 if (BUILTIN_SQRT_P (fcode))
7554 dconstroot = dconsthalf;
7556 dconstroot = dconst_third ();
7558 /* Adjust for the outer root. */
7559 SET_REAL_EXP (&dconstroot, REAL_EXP (&dconstroot) - 1);
7560 dconstroot = real_value_truncate (TYPE_MODE (type), dconstroot);
7561 tree_root = build_real (type, dconstroot);
7562 return build_call_expr_loc (loc, powfn, 2, arg0, tree_root);
7566 /* Optimize sqrt(pow(x,y)) = pow(|x|,y*0.5). */
7567 if (flag_unsafe_math_optimizations
7568 && (fcode == BUILT_IN_POW
7569 || fcode == BUILT_IN_POWF
7570 || fcode == BUILT_IN_POWL))
7572 tree powfn = TREE_OPERAND (CALL_EXPR_FN (arg), 0);
7573 tree arg0 = CALL_EXPR_ARG (arg, 0);
7574 tree arg1 = CALL_EXPR_ARG (arg, 1);
7576 if (!tree_expr_nonnegative_p (arg0))
7577 arg0 = build1 (ABS_EXPR, type, arg0);
7578 narg1 = fold_build2_loc (loc, MULT_EXPR, type, arg1,
7579 build_real (type, dconsthalf));
7580 return build_call_expr_loc (loc, powfn, 2, arg0, narg1);
7586 /* Fold a builtin function call to cbrt, cbrtf, or cbrtl with argument ARG.
7587 Return NULL_TREE if no simplification can be made. */
7590 fold_builtin_cbrt (location_t loc, tree arg, tree type)
7592 const enum built_in_function fcode = builtin_mathfn_code (arg);
7595 if (!validate_arg (arg, REAL_TYPE))
7598 /* Calculate the result when the argument is a constant. */
7599 if ((res = do_mpfr_arg1 (arg, type, mpfr_cbrt, NULL, NULL, 0)))
7602 if (flag_unsafe_math_optimizations)
7604 /* Optimize cbrt(expN(x)) -> expN(x/3). */
7605 if (BUILTIN_EXPONENT_P (fcode))
7607 tree expfn = TREE_OPERAND (CALL_EXPR_FN (arg), 0);
7608 const REAL_VALUE_TYPE third_trunc =
7609 real_value_truncate (TYPE_MODE (type), dconst_third ());
7610 arg = fold_build2_loc (loc, MULT_EXPR, type,
7611 CALL_EXPR_ARG (arg, 0),
7612 build_real (type, third_trunc));
7613 return build_call_expr_loc (loc, expfn, 1, arg);
7616 /* Optimize cbrt(sqrt(x)) -> pow(x,1/6). */
7617 if (BUILTIN_SQRT_P (fcode))
7619 tree powfn = mathfn_built_in (type, BUILT_IN_POW);
7623 tree arg0 = CALL_EXPR_ARG (arg, 0);
7625 REAL_VALUE_TYPE dconstroot = dconst_third ();
7627 SET_REAL_EXP (&dconstroot, REAL_EXP (&dconstroot) - 1);
7628 dconstroot = real_value_truncate (TYPE_MODE (type), dconstroot);
7629 tree_root = build_real (type, dconstroot);
7630 return build_call_expr_loc (loc, powfn, 2, arg0, tree_root);
7634 /* Optimize cbrt(cbrt(x)) -> pow(x,1/9) iff x is nonnegative. */
7635 if (BUILTIN_CBRT_P (fcode))
7637 tree arg0 = CALL_EXPR_ARG (arg, 0);
7638 if (tree_expr_nonnegative_p (arg0))
7640 tree powfn = mathfn_built_in (type, BUILT_IN_POW);
7645 REAL_VALUE_TYPE dconstroot;
7647 real_arithmetic (&dconstroot, MULT_EXPR,
7648 dconst_third_ptr (), dconst_third_ptr ());
7649 dconstroot = real_value_truncate (TYPE_MODE (type), dconstroot);
7650 tree_root = build_real (type, dconstroot);
7651 return build_call_expr_loc (loc, powfn, 2, arg0, tree_root);
7656 /* Optimize cbrt(pow(x,y)) -> pow(x,y/3) iff x is nonnegative. */
7657 if (fcode == BUILT_IN_POW
7658 || fcode == BUILT_IN_POWF
7659 || fcode == BUILT_IN_POWL)
7661 tree arg00 = CALL_EXPR_ARG (arg, 0);
7662 tree arg01 = CALL_EXPR_ARG (arg, 1);
7663 if (tree_expr_nonnegative_p (arg00))
7665 tree powfn = TREE_OPERAND (CALL_EXPR_FN (arg), 0);
7666 const REAL_VALUE_TYPE dconstroot
7667 = real_value_truncate (TYPE_MODE (type), dconst_third ());
7668 tree narg01 = fold_build2_loc (loc, MULT_EXPR, type, arg01,
7669 build_real (type, dconstroot));
7670 return build_call_expr_loc (loc, powfn, 2, arg00, narg01);
7677 /* Fold function call to builtin cos, cosf, or cosl with argument ARG.
7678 TYPE is the type of the return value. Return NULL_TREE if no
7679 simplification can be made. */
7682 fold_builtin_cos (location_t loc,
7683 tree arg, tree type, tree fndecl)
7687 if (!validate_arg (arg, REAL_TYPE))
7690 /* Calculate the result when the argument is a constant. */
7691 if ((res = do_mpfr_arg1 (arg, type, mpfr_cos, NULL, NULL, 0)))
7694 /* Optimize cos(-x) into cos (x). */
7695 if ((narg = fold_strip_sign_ops (arg)))
7696 return build_call_expr_loc (loc, fndecl, 1, narg);
7701 /* Fold function call to builtin cosh, coshf, or coshl with argument ARG.
7702 Return NULL_TREE if no simplification can be made. */
7705 fold_builtin_cosh (location_t loc, tree arg, tree type, tree fndecl)
7707 if (validate_arg (arg, REAL_TYPE))
7711 /* Calculate the result when the argument is a constant. */
7712 if ((res = do_mpfr_arg1 (arg, type, mpfr_cosh, NULL, NULL, 0)))
7715 /* Optimize cosh(-x) into cosh (x). */
7716 if ((narg = fold_strip_sign_ops (arg)))
7717 return build_call_expr_loc (loc, fndecl, 1, narg);
7723 /* Fold function call to builtin ccos (or ccosh if HYPER is TRUE) with
7724 argument ARG. TYPE is the type of the return value. Return
7725 NULL_TREE if no simplification can be made. */
7728 fold_builtin_ccos (location_t loc, tree arg, tree type, tree fndecl,
7731 if (validate_arg (arg, COMPLEX_TYPE)
7732 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) == REAL_TYPE)
7736 /* Calculate the result when the argument is a constant. */
7737 if ((tmp = do_mpc_arg1 (arg, type, (hyper ? mpc_cosh : mpc_cos))))
7740 /* Optimize fn(-x) into fn(x). */
7741 if ((tmp = fold_strip_sign_ops (arg)))
7742 return build_call_expr_loc (loc, fndecl, 1, tmp);
7748 /* Fold function call to builtin tan, tanf, or tanl with argument ARG.
7749 Return NULL_TREE if no simplification can be made. */
7752 fold_builtin_tan (tree arg, tree type)
7754 enum built_in_function fcode;
7757 if (!validate_arg (arg, REAL_TYPE))
7760 /* Calculate the result when the argument is a constant. */
7761 if ((res = do_mpfr_arg1 (arg, type, mpfr_tan, NULL, NULL, 0)))
7764 /* Optimize tan(atan(x)) = x. */
7765 fcode = builtin_mathfn_code (arg);
7766 if (flag_unsafe_math_optimizations
7767 && (fcode == BUILT_IN_ATAN
7768 || fcode == BUILT_IN_ATANF
7769 || fcode == BUILT_IN_ATANL))
7770 return CALL_EXPR_ARG (arg, 0);
7775 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
7776 NULL_TREE if no simplification can be made. */
7779 fold_builtin_sincos (location_t loc,
7780 tree arg0, tree arg1, tree arg2)
7785 if (!validate_arg (arg0, REAL_TYPE)
7786 || !validate_arg (arg1, POINTER_TYPE)
7787 || !validate_arg (arg2, POINTER_TYPE))
7790 type = TREE_TYPE (arg0);
7792 /* Calculate the result when the argument is a constant. */
7793 if ((res = do_mpfr_sincos (arg0, arg1, arg2)))
7796 /* Canonicalize sincos to cexpi. */
7797 if (!TARGET_C99_FUNCTIONS)
7799 fn = mathfn_built_in (type, BUILT_IN_CEXPI);
7803 call = build_call_expr_loc (loc, fn, 1, arg0);
7804 call = builtin_save_expr (call);
7806 return build2 (COMPOUND_EXPR, void_type_node,
7807 build2 (MODIFY_EXPR, void_type_node,
7808 build_fold_indirect_ref_loc (loc, arg1),
7809 build1 (IMAGPART_EXPR, type, call)),
7810 build2 (MODIFY_EXPR, void_type_node,
7811 build_fold_indirect_ref_loc (loc, arg2),
7812 build1 (REALPART_EXPR, type, call)));
7815 /* Fold function call to builtin cexp, cexpf, or cexpl. Return
7816 NULL_TREE if no simplification can be made. */
7819 fold_builtin_cexp (location_t loc, tree arg0, tree type)
7822 tree realp, imagp, ifn;
7825 if (!validate_arg (arg0, COMPLEX_TYPE)
7826 || TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) != REAL_TYPE)
7829 /* Calculate the result when the argument is a constant. */
7830 if ((res = do_mpc_arg1 (arg0, type, mpc_exp)))
7833 rtype = TREE_TYPE (TREE_TYPE (arg0));
7835 /* In case we can figure out the real part of arg0 and it is constant zero
7837 if (!TARGET_C99_FUNCTIONS)
7839 ifn = mathfn_built_in (rtype, BUILT_IN_CEXPI);
7843 if ((realp = fold_unary_loc (loc, REALPART_EXPR, rtype, arg0))
7844 && real_zerop (realp))
7846 tree narg = fold_build1_loc (loc, IMAGPART_EXPR, rtype, arg0);
7847 return build_call_expr_loc (loc, ifn, 1, narg);
7850 /* In case we can easily decompose real and imaginary parts split cexp
7851 to exp (r) * cexpi (i). */
7852 if (flag_unsafe_math_optimizations
7855 tree rfn, rcall, icall;
7857 rfn = mathfn_built_in (rtype, BUILT_IN_EXP);
7861 imagp = fold_unary_loc (loc, IMAGPART_EXPR, rtype, arg0);
7865 icall = build_call_expr_loc (loc, ifn, 1, imagp);
7866 icall = builtin_save_expr (icall);
7867 rcall = build_call_expr_loc (loc, rfn, 1, realp);
7868 rcall = builtin_save_expr (rcall);
7869 return fold_build2_loc (loc, COMPLEX_EXPR, type,
7870 fold_build2_loc (loc, MULT_EXPR, rtype,
7872 fold_build1_loc (loc, REALPART_EXPR,
7874 fold_build2_loc (loc, MULT_EXPR, rtype,
7876 fold_build1_loc (loc, IMAGPART_EXPR,
7883 /* Fold function call to builtin trunc, truncf or truncl with argument ARG.
7884 Return NULL_TREE if no simplification can be made. */
7887 fold_builtin_trunc (location_t loc, tree fndecl, tree arg)
7889 if (!validate_arg (arg, REAL_TYPE))
7892 /* Optimize trunc of constant value. */
7893 if (TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
7895 REAL_VALUE_TYPE r, x;
7896 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7898 x = TREE_REAL_CST (arg);
7899 real_trunc (&r, TYPE_MODE (type), &x);
7900 return build_real (type, r);
7903 return fold_trunc_transparent_mathfn (loc, fndecl, arg);
7906 /* Fold function call to builtin floor, floorf or floorl with argument ARG.
7907 Return NULL_TREE if no simplification can be made. */
7910 fold_builtin_floor (location_t loc, tree fndecl, tree arg)
7912 if (!validate_arg (arg, REAL_TYPE))
7915 /* Optimize floor of constant value. */
7916 if (TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
7920 x = TREE_REAL_CST (arg);
7921 if (! REAL_VALUE_ISNAN (x) || ! flag_errno_math)
7923 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7926 real_floor (&r, TYPE_MODE (type), &x);
7927 return build_real (type, r);
7931 /* Fold floor (x) where x is nonnegative to trunc (x). */
7932 if (tree_expr_nonnegative_p (arg))
7934 tree truncfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_TRUNC);
7936 return build_call_expr_loc (loc, truncfn, 1, arg);
7939 return fold_trunc_transparent_mathfn (loc, fndecl, arg);
7942 /* Fold function call to builtin ceil, ceilf or ceill with argument ARG.
7943 Return NULL_TREE if no simplification can be made. */
7946 fold_builtin_ceil (location_t loc, tree fndecl, tree arg)
7948 if (!validate_arg (arg, REAL_TYPE))
7951 /* Optimize ceil of constant value. */
7952 if (TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
7956 x = TREE_REAL_CST (arg);
7957 if (! REAL_VALUE_ISNAN (x) || ! flag_errno_math)
7959 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7962 real_ceil (&r, TYPE_MODE (type), &x);
7963 return build_real (type, r);
7967 return fold_trunc_transparent_mathfn (loc, fndecl, arg);
7970 /* Fold function call to builtin round, roundf or roundl with argument ARG.
7971 Return NULL_TREE if no simplification can be made. */
7974 fold_builtin_round (location_t loc, tree fndecl, tree arg)
7976 if (!validate_arg (arg, REAL_TYPE))
7979 /* Optimize round of constant value. */
7980 if (TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
7984 x = TREE_REAL_CST (arg);
7985 if (! REAL_VALUE_ISNAN (x) || ! flag_errno_math)
7987 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7990 real_round (&r, TYPE_MODE (type), &x);
7991 return build_real (type, r);
7995 return fold_trunc_transparent_mathfn (loc, fndecl, arg);
7998 /* Fold function call to builtin lround, lroundf or lroundl (or the
7999 corresponding long long versions) and other rounding functions. ARG
8000 is the argument to the call. Return NULL_TREE if no simplification
8004 fold_builtin_int_roundingfn (location_t loc, tree fndecl, tree arg)
8006 if (!validate_arg (arg, REAL_TYPE))
8009 /* Optimize lround of constant value. */
8010 if (TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
8012 const REAL_VALUE_TYPE x = TREE_REAL_CST (arg);
8014 if (real_isfinite (&x))
8016 tree itype = TREE_TYPE (TREE_TYPE (fndecl));
8017 tree ftype = TREE_TYPE (arg);
8021 switch (DECL_FUNCTION_CODE (fndecl))
8023 CASE_FLT_FN (BUILT_IN_IFLOOR):
8024 CASE_FLT_FN (BUILT_IN_LFLOOR):
8025 CASE_FLT_FN (BUILT_IN_LLFLOOR):
8026 real_floor (&r, TYPE_MODE (ftype), &x);
8029 CASE_FLT_FN (BUILT_IN_ICEIL):
8030 CASE_FLT_FN (BUILT_IN_LCEIL):
8031 CASE_FLT_FN (BUILT_IN_LLCEIL):
8032 real_ceil (&r, TYPE_MODE (ftype), &x);
8035 CASE_FLT_FN (BUILT_IN_IROUND):
8036 CASE_FLT_FN (BUILT_IN_LROUND):
8037 CASE_FLT_FN (BUILT_IN_LLROUND):
8038 real_round (&r, TYPE_MODE (ftype), &x);
8045 real_to_integer2 ((HOST_WIDE_INT *)&val.low, &val.high, &r);
8046 if (double_int_fits_to_tree_p (itype, val))
8047 return double_int_to_tree (itype, val);
8051 switch (DECL_FUNCTION_CODE (fndecl))
8053 CASE_FLT_FN (BUILT_IN_LFLOOR):
8054 CASE_FLT_FN (BUILT_IN_LLFLOOR):
8055 /* Fold lfloor (x) where x is nonnegative to FIX_TRUNC (x). */
8056 if (tree_expr_nonnegative_p (arg))
8057 return fold_build1_loc (loc, FIX_TRUNC_EXPR,
8058 TREE_TYPE (TREE_TYPE (fndecl)), arg);
8063 return fold_fixed_mathfn (loc, fndecl, arg);
8066 /* Fold function call to builtin ffs, clz, ctz, popcount and parity
8067 and their long and long long variants (i.e. ffsl and ffsll). ARG is
8068 the argument to the call. Return NULL_TREE if no simplification can
8072 fold_builtin_bitop (tree fndecl, tree arg)
8074 if (!validate_arg (arg, INTEGER_TYPE))
8077 /* Optimize for constant argument. */
8078 if (TREE_CODE (arg) == INTEGER_CST && !TREE_OVERFLOW (arg))
8080 HOST_WIDE_INT hi, width, result;
8081 unsigned HOST_WIDE_INT lo;
8084 type = TREE_TYPE (arg);
8085 width = TYPE_PRECISION (type);
8086 lo = TREE_INT_CST_LOW (arg);
8088 /* Clear all the bits that are beyond the type's precision. */
8089 if (width > HOST_BITS_PER_WIDE_INT)
8091 hi = TREE_INT_CST_HIGH (arg);
8092 if (width < 2 * HOST_BITS_PER_WIDE_INT)
8093 hi &= ~((unsigned HOST_WIDE_INT) (-1)
8094 << (width - HOST_BITS_PER_WIDE_INT));
8099 if (width < HOST_BITS_PER_WIDE_INT)
8100 lo &= ~((unsigned HOST_WIDE_INT) (-1) << width);
8103 switch (DECL_FUNCTION_CODE (fndecl))
8105 CASE_INT_FN (BUILT_IN_FFS):
8107 result = ffs_hwi (lo);
8109 result = HOST_BITS_PER_WIDE_INT + ffs_hwi (hi);
8114 CASE_INT_FN (BUILT_IN_CLZ):
8116 result = width - floor_log2 (hi) - 1 - HOST_BITS_PER_WIDE_INT;
8118 result = width - floor_log2 (lo) - 1;
8119 else if (! CLZ_DEFINED_VALUE_AT_ZERO (TYPE_MODE (type), result))
8123 CASE_INT_FN (BUILT_IN_CTZ):
8125 result = ctz_hwi (lo);
8127 result = HOST_BITS_PER_WIDE_INT + ctz_hwi (hi);
8128 else if (! CTZ_DEFINED_VALUE_AT_ZERO (TYPE_MODE (type), result))
8132 CASE_INT_FN (BUILT_IN_CLRSB):
8133 if (width > HOST_BITS_PER_WIDE_INT
8134 && (hi & ((unsigned HOST_WIDE_INT) 1
8135 << (width - HOST_BITS_PER_WIDE_INT - 1))) != 0)
8137 hi = ~hi & ~((unsigned HOST_WIDE_INT) (-1)
8138 << (width - HOST_BITS_PER_WIDE_INT - 1));
8141 else if (width <= HOST_BITS_PER_WIDE_INT
8142 && (lo & ((unsigned HOST_WIDE_INT) 1 << (width - 1))) != 0)
8143 lo = ~lo & ~((unsigned HOST_WIDE_INT) (-1) << (width - 1));
8145 result = width - floor_log2 (hi) - 2 - HOST_BITS_PER_WIDE_INT;
8147 result = width - floor_log2 (lo) - 2;
8152 CASE_INT_FN (BUILT_IN_POPCOUNT):
8155 result++, lo &= lo - 1;
8157 result++, hi &= (unsigned HOST_WIDE_INT) hi - 1;
8160 CASE_INT_FN (BUILT_IN_PARITY):
8163 result++, lo &= lo - 1;
8165 result++, hi &= (unsigned HOST_WIDE_INT) hi - 1;
8173 return build_int_cst (TREE_TYPE (TREE_TYPE (fndecl)), result);
8179 /* Fold function call to builtin_bswap and the long and long long
8180 variants. Return NULL_TREE if no simplification can be made. */
8182 fold_builtin_bswap (tree fndecl, tree arg)
8184 if (! validate_arg (arg, INTEGER_TYPE))
8187 /* Optimize constant value. */
8188 if (TREE_CODE (arg) == INTEGER_CST && !TREE_OVERFLOW (arg))
8190 HOST_WIDE_INT hi, width, r_hi = 0;
8191 unsigned HOST_WIDE_INT lo, r_lo = 0;
8194 type = TREE_TYPE (arg);
8195 width = TYPE_PRECISION (type);
8196 lo = TREE_INT_CST_LOW (arg);
8197 hi = TREE_INT_CST_HIGH (arg);
8199 switch (DECL_FUNCTION_CODE (fndecl))
8201 case BUILT_IN_BSWAP32:
8202 case BUILT_IN_BSWAP64:
8206 for (s = 0; s < width; s += 8)
8208 int d = width - s - 8;
8209 unsigned HOST_WIDE_INT byte;
8211 if (s < HOST_BITS_PER_WIDE_INT)
8212 byte = (lo >> s) & 0xff;
8214 byte = (hi >> (s - HOST_BITS_PER_WIDE_INT)) & 0xff;
8216 if (d < HOST_BITS_PER_WIDE_INT)
8219 r_hi |= byte << (d - HOST_BITS_PER_WIDE_INT);
8229 if (width < HOST_BITS_PER_WIDE_INT)
8230 return build_int_cst (TREE_TYPE (TREE_TYPE (fndecl)), r_lo);
8232 return build_int_cst_wide (TREE_TYPE (TREE_TYPE (fndecl)), r_lo, r_hi);
8238 /* A subroutine of fold_builtin to fold the various logarithmic
8239 functions. Return NULL_TREE if no simplification can me made.
8240 FUNC is the corresponding MPFR logarithm function. */
8243 fold_builtin_logarithm (location_t loc, tree fndecl, tree arg,
8244 int (*func)(mpfr_ptr, mpfr_srcptr, mp_rnd_t))
8246 if (validate_arg (arg, REAL_TYPE))
8248 tree type = TREE_TYPE (TREE_TYPE (fndecl));
8250 const enum built_in_function fcode = builtin_mathfn_code (arg);
8252 /* Calculate the result when the argument is a constant. */
8253 if ((res = do_mpfr_arg1 (arg, type, func, &dconst0, NULL, false)))
8256 /* Special case, optimize logN(expN(x)) = x. */
8257 if (flag_unsafe_math_optimizations
8258 && ((func == mpfr_log
8259 && (fcode == BUILT_IN_EXP
8260 || fcode == BUILT_IN_EXPF
8261 || fcode == BUILT_IN_EXPL))
8262 || (func == mpfr_log2
8263 && (fcode == BUILT_IN_EXP2
8264 || fcode == BUILT_IN_EXP2F
8265 || fcode == BUILT_IN_EXP2L))
8266 || (func == mpfr_log10 && (BUILTIN_EXP10_P (fcode)))))
8267 return fold_convert_loc (loc, type, CALL_EXPR_ARG (arg, 0));
8269 /* Optimize logN(func()) for various exponential functions. We
8270 want to determine the value "x" and the power "exponent" in
8271 order to transform logN(x**exponent) into exponent*logN(x). */
8272 if (flag_unsafe_math_optimizations)
8274 tree exponent = 0, x = 0;
8278 CASE_FLT_FN (BUILT_IN_EXP):
8279 /* Prepare to do logN(exp(exponent) -> exponent*logN(e). */
8280 x = build_real (type, real_value_truncate (TYPE_MODE (type),
8282 exponent = CALL_EXPR_ARG (arg, 0);
8284 CASE_FLT_FN (BUILT_IN_EXP2):
8285 /* Prepare to do logN(exp2(exponent) -> exponent*logN(2). */
8286 x = build_real (type, dconst2);
8287 exponent = CALL_EXPR_ARG (arg, 0);
8289 CASE_FLT_FN (BUILT_IN_EXP10):
8290 CASE_FLT_FN (BUILT_IN_POW10):
8291 /* Prepare to do logN(exp10(exponent) -> exponent*logN(10). */
8293 REAL_VALUE_TYPE dconst10;
8294 real_from_integer (&dconst10, VOIDmode, 10, 0, 0);
8295 x = build_real (type, dconst10);
8297 exponent = CALL_EXPR_ARG (arg, 0);
8299 CASE_FLT_FN (BUILT_IN_SQRT):
8300 /* Prepare to do logN(sqrt(x) -> 0.5*logN(x). */
8301 x = CALL_EXPR_ARG (arg, 0);
8302 exponent = build_real (type, dconsthalf);
8304 CASE_FLT_FN (BUILT_IN_CBRT):
8305 /* Prepare to do logN(cbrt(x) -> (1/3)*logN(x). */
8306 x = CALL_EXPR_ARG (arg, 0);
8307 exponent = build_real (type, real_value_truncate (TYPE_MODE (type),
8310 CASE_FLT_FN (BUILT_IN_POW):
8311 /* Prepare to do logN(pow(x,exponent) -> exponent*logN(x). */
8312 x = CALL_EXPR_ARG (arg, 0);
8313 exponent = CALL_EXPR_ARG (arg, 1);
8319 /* Now perform the optimization. */
8322 tree logfn = build_call_expr_loc (loc, fndecl, 1, x);
8323 return fold_build2_loc (loc, MULT_EXPR, type, exponent, logfn);
8331 /* Fold a builtin function call to hypot, hypotf, or hypotl. Return
8332 NULL_TREE if no simplification can be made. */
8335 fold_builtin_hypot (location_t loc, tree fndecl,
8336 tree arg0, tree arg1, tree type)
8338 tree res, narg0, narg1;
8340 if (!validate_arg (arg0, REAL_TYPE)
8341 || !validate_arg (arg1, REAL_TYPE))
8344 /* Calculate the result when the argument is a constant. */
8345 if ((res = do_mpfr_arg2 (arg0, arg1, type, mpfr_hypot)))
8348 /* If either argument to hypot has a negate or abs, strip that off.
8349 E.g. hypot(-x,fabs(y)) -> hypot(x,y). */
8350 narg0 = fold_strip_sign_ops (arg0);
8351 narg1 = fold_strip_sign_ops (arg1);
8354 return build_call_expr_loc (loc, fndecl, 2, narg0 ? narg0 : arg0,
8355 narg1 ? narg1 : arg1);
8358 /* If either argument is zero, hypot is fabs of the other. */
8359 if (real_zerop (arg0))
8360 return fold_build1_loc (loc, ABS_EXPR, type, arg1);
8361 else if (real_zerop (arg1))
8362 return fold_build1_loc (loc, ABS_EXPR, type, arg0);
8364 /* hypot(x,x) -> fabs(x)*sqrt(2). */
8365 if (flag_unsafe_math_optimizations
8366 && operand_equal_p (arg0, arg1, OEP_PURE_SAME))
8368 const REAL_VALUE_TYPE sqrt2_trunc
8369 = real_value_truncate (TYPE_MODE (type), dconst_sqrt2 ());
8370 return fold_build2_loc (loc, MULT_EXPR, type,
8371 fold_build1_loc (loc, ABS_EXPR, type, arg0),
8372 build_real (type, sqrt2_trunc));
8379 /* Fold a builtin function call to pow, powf, or powl. Return
8380 NULL_TREE if no simplification can be made. */
8382 fold_builtin_pow (location_t loc, tree fndecl, tree arg0, tree arg1, tree type)
8386 if (!validate_arg (arg0, REAL_TYPE)
8387 || !validate_arg (arg1, REAL_TYPE))
8390 /* Calculate the result when the argument is a constant. */
8391 if ((res = do_mpfr_arg2 (arg0, arg1, type, mpfr_pow)))
8394 /* Optimize pow(1.0,y) = 1.0. */
8395 if (real_onep (arg0))
8396 return omit_one_operand_loc (loc, type, build_real (type, dconst1), arg1);
8398 if (TREE_CODE (arg1) == REAL_CST
8399 && !TREE_OVERFLOW (arg1))
8401 REAL_VALUE_TYPE cint;
8405 c = TREE_REAL_CST (arg1);
8407 /* Optimize pow(x,0.0) = 1.0. */
8408 if (REAL_VALUES_EQUAL (c, dconst0))
8409 return omit_one_operand_loc (loc, type, build_real (type, dconst1),
8412 /* Optimize pow(x,1.0) = x. */
8413 if (REAL_VALUES_EQUAL (c, dconst1))
8416 /* Optimize pow(x,-1.0) = 1.0/x. */
8417 if (REAL_VALUES_EQUAL (c, dconstm1))
8418 return fold_build2_loc (loc, RDIV_EXPR, type,
8419 build_real (type, dconst1), arg0);
8421 /* Optimize pow(x,0.5) = sqrt(x). */
8422 if (flag_unsafe_math_optimizations
8423 && REAL_VALUES_EQUAL (c, dconsthalf))
8425 tree sqrtfn = mathfn_built_in (type, BUILT_IN_SQRT);
8427 if (sqrtfn != NULL_TREE)
8428 return build_call_expr_loc (loc, sqrtfn, 1, arg0);
8431 /* Optimize pow(x,1.0/3.0) = cbrt(x). */
8432 if (flag_unsafe_math_optimizations)
8434 const REAL_VALUE_TYPE dconstroot
8435 = real_value_truncate (TYPE_MODE (type), dconst_third ());
8437 if (REAL_VALUES_EQUAL (c, dconstroot))
8439 tree cbrtfn = mathfn_built_in (type, BUILT_IN_CBRT);
8440 if (cbrtfn != NULL_TREE)
8441 return build_call_expr_loc (loc, cbrtfn, 1, arg0);
8445 /* Check for an integer exponent. */
8446 n = real_to_integer (&c);
8447 real_from_integer (&cint, VOIDmode, n, n < 0 ? -1 : 0, 0);
8448 if (real_identical (&c, &cint))
8450 /* Attempt to evaluate pow at compile-time, unless this should
8451 raise an exception. */
8452 if (TREE_CODE (arg0) == REAL_CST
8453 && !TREE_OVERFLOW (arg0)
8455 || (!flag_trapping_math && !flag_errno_math)
8456 || !REAL_VALUES_EQUAL (TREE_REAL_CST (arg0), dconst0)))
8461 x = TREE_REAL_CST (arg0);
8462 inexact = real_powi (&x, TYPE_MODE (type), &x, n);
8463 if (flag_unsafe_math_optimizations || !inexact)
8464 return build_real (type, x);
8467 /* Strip sign ops from even integer powers. */
8468 if ((n & 1) == 0 && flag_unsafe_math_optimizations)
8470 tree narg0 = fold_strip_sign_ops (arg0);
8472 return build_call_expr_loc (loc, fndecl, 2, narg0, arg1);
8477 if (flag_unsafe_math_optimizations)
8479 const enum built_in_function fcode = builtin_mathfn_code (arg0);
8481 /* Optimize pow(expN(x),y) = expN(x*y). */
8482 if (BUILTIN_EXPONENT_P (fcode))
8484 tree expfn = TREE_OPERAND (CALL_EXPR_FN (arg0), 0);
8485 tree arg = CALL_EXPR_ARG (arg0, 0);
8486 arg = fold_build2_loc (loc, MULT_EXPR, type, arg, arg1);
8487 return build_call_expr_loc (loc, expfn, 1, arg);
8490 /* Optimize pow(sqrt(x),y) = pow(x,y*0.5). */
8491 if (BUILTIN_SQRT_P (fcode))
8493 tree narg0 = CALL_EXPR_ARG (arg0, 0);
8494 tree narg1 = fold_build2_loc (loc, MULT_EXPR, type, arg1,
8495 build_real (type, dconsthalf));
8496 return build_call_expr_loc (loc, fndecl, 2, narg0, narg1);
8499 /* Optimize pow(cbrt(x),y) = pow(x,y/3) iff x is nonnegative. */
8500 if (BUILTIN_CBRT_P (fcode))
8502 tree arg = CALL_EXPR_ARG (arg0, 0);
8503 if (tree_expr_nonnegative_p (arg))
8505 const REAL_VALUE_TYPE dconstroot
8506 = real_value_truncate (TYPE_MODE (type), dconst_third ());
8507 tree narg1 = fold_build2_loc (loc, MULT_EXPR, type, arg1,
8508 build_real (type, dconstroot));
8509 return build_call_expr_loc (loc, fndecl, 2, arg, narg1);
8513 /* Optimize pow(pow(x,y),z) = pow(x,y*z) iff x is nonnegative. */
8514 if (fcode == BUILT_IN_POW
8515 || fcode == BUILT_IN_POWF
8516 || fcode == BUILT_IN_POWL)
8518 tree arg00 = CALL_EXPR_ARG (arg0, 0);
8519 if (tree_expr_nonnegative_p (arg00))
8521 tree arg01 = CALL_EXPR_ARG (arg0, 1);
8522 tree narg1 = fold_build2_loc (loc, MULT_EXPR, type, arg01, arg1);
8523 return build_call_expr_loc (loc, fndecl, 2, arg00, narg1);
8531 /* Fold a builtin function call to powi, powif, or powil with argument ARG.
8532 Return NULL_TREE if no simplification can be made. */
8534 fold_builtin_powi (location_t loc, tree fndecl ATTRIBUTE_UNUSED,
8535 tree arg0, tree arg1, tree type)
8537 if (!validate_arg (arg0, REAL_TYPE)
8538 || !validate_arg (arg1, INTEGER_TYPE))
8541 /* Optimize pow(1.0,y) = 1.0. */
8542 if (real_onep (arg0))
8543 return omit_one_operand_loc (loc, type, build_real (type, dconst1), arg1);
8545 if (host_integerp (arg1, 0))
8547 HOST_WIDE_INT c = TREE_INT_CST_LOW (arg1);
8549 /* Evaluate powi at compile-time. */
8550 if (TREE_CODE (arg0) == REAL_CST
8551 && !TREE_OVERFLOW (arg0))
8554 x = TREE_REAL_CST (arg0);
8555 real_powi (&x, TYPE_MODE (type), &x, c);
8556 return build_real (type, x);
8559 /* Optimize pow(x,0) = 1.0. */
8561 return omit_one_operand_loc (loc, type, build_real (type, dconst1),
8564 /* Optimize pow(x,1) = x. */
8568 /* Optimize pow(x,-1) = 1.0/x. */
8570 return fold_build2_loc (loc, RDIV_EXPR, type,
8571 build_real (type, dconst1), arg0);
8577 /* A subroutine of fold_builtin to fold the various exponent
8578 functions. Return NULL_TREE if no simplification can be made.
8579 FUNC is the corresponding MPFR exponent function. */
8582 fold_builtin_exponent (location_t loc, tree fndecl, tree arg,
8583 int (*func)(mpfr_ptr, mpfr_srcptr, mp_rnd_t))
8585 if (validate_arg (arg, REAL_TYPE))
8587 tree type = TREE_TYPE (TREE_TYPE (fndecl));
8590 /* Calculate the result when the argument is a constant. */
8591 if ((res = do_mpfr_arg1 (arg, type, func, NULL, NULL, 0)))
8594 /* Optimize expN(logN(x)) = x. */
8595 if (flag_unsafe_math_optimizations)
8597 const enum built_in_function fcode = builtin_mathfn_code (arg);
8599 if ((func == mpfr_exp
8600 && (fcode == BUILT_IN_LOG
8601 || fcode == BUILT_IN_LOGF
8602 || fcode == BUILT_IN_LOGL))
8603 || (func == mpfr_exp2
8604 && (fcode == BUILT_IN_LOG2
8605 || fcode == BUILT_IN_LOG2F
8606 || fcode == BUILT_IN_LOG2L))
8607 || (func == mpfr_exp10
8608 && (fcode == BUILT_IN_LOG10
8609 || fcode == BUILT_IN_LOG10F
8610 || fcode == BUILT_IN_LOG10L)))
8611 return fold_convert_loc (loc, type, CALL_EXPR_ARG (arg, 0));
8618 /* Return true if VAR is a VAR_DECL or a component thereof. */
8621 var_decl_component_p (tree var)
8624 while (handled_component_p (inner))
8625 inner = TREE_OPERAND (inner, 0);
8626 return SSA_VAR_P (inner);
8629 /* Fold function call to builtin memset. Return
8630 NULL_TREE if no simplification can be made. */
8633 fold_builtin_memset (location_t loc, tree dest, tree c, tree len,
8634 tree type, bool ignore)
8636 tree var, ret, etype;
8637 unsigned HOST_WIDE_INT length, cval;
8639 if (! validate_arg (dest, POINTER_TYPE)
8640 || ! validate_arg (c, INTEGER_TYPE)
8641 || ! validate_arg (len, INTEGER_TYPE))
8644 if (! host_integerp (len, 1))
8647 /* If the LEN parameter is zero, return DEST. */
8648 if (integer_zerop (len))
8649 return omit_one_operand_loc (loc, type, dest, c);
8651 if (TREE_CODE (c) != INTEGER_CST || TREE_SIDE_EFFECTS (dest))
8656 if (TREE_CODE (var) != ADDR_EXPR)
8659 var = TREE_OPERAND (var, 0);
8660 if (TREE_THIS_VOLATILE (var))
8663 etype = TREE_TYPE (var);
8664 if (TREE_CODE (etype) == ARRAY_TYPE)
8665 etype = TREE_TYPE (etype);
8667 if (!INTEGRAL_TYPE_P (etype)
8668 && !POINTER_TYPE_P (etype))
8671 if (! var_decl_component_p (var))
8674 length = tree_low_cst (len, 1);
8675 if (GET_MODE_SIZE (TYPE_MODE (etype)) != length
8676 || get_pointer_alignment (dest) / BITS_PER_UNIT < length)
8679 if (length > HOST_BITS_PER_WIDE_INT / BITS_PER_UNIT)
8682 if (integer_zerop (c))
8686 if (CHAR_BIT != 8 || BITS_PER_UNIT != 8 || HOST_BITS_PER_WIDE_INT > 64)
8689 cval = TREE_INT_CST_LOW (c);
8693 cval |= (cval << 31) << 1;
8696 ret = build_int_cst_type (etype, cval);
8697 var = build_fold_indirect_ref_loc (loc,
8698 fold_convert_loc (loc,
8699 build_pointer_type (etype),
8701 ret = build2 (MODIFY_EXPR, etype, var, ret);
8705 return omit_one_operand_loc (loc, type, dest, ret);
8708 /* Fold function call to builtin memset. Return
8709 NULL_TREE if no simplification can be made. */
8712 fold_builtin_bzero (location_t loc, tree dest, tree size, bool ignore)
8714 if (! validate_arg (dest, POINTER_TYPE)
8715 || ! validate_arg (size, INTEGER_TYPE))
8721 /* New argument list transforming bzero(ptr x, int y) to
8722 memset(ptr x, int 0, size_t y). This is done this way
8723 so that if it isn't expanded inline, we fallback to
8724 calling bzero instead of memset. */
8726 return fold_builtin_memset (loc, dest, integer_zero_node,
8727 fold_convert_loc (loc, size_type_node, size),
8728 void_type_node, ignore);
8731 /* Fold function call to builtin mem{{,p}cpy,move}. Return
8732 NULL_TREE if no simplification can be made.
8733 If ENDP is 0, return DEST (like memcpy).
8734 If ENDP is 1, return DEST+LEN (like mempcpy).
8735 If ENDP is 2, return DEST+LEN-1 (like stpcpy).
8736 If ENDP is 3, return DEST, additionally *SRC and *DEST may overlap
8740 fold_builtin_memory_op (location_t loc, tree dest, tree src,
8741 tree len, tree type, bool ignore, int endp)
8743 tree destvar, srcvar, expr;
8745 if (! validate_arg (dest, POINTER_TYPE)
8746 || ! validate_arg (src, POINTER_TYPE)
8747 || ! validate_arg (len, INTEGER_TYPE))
8750 /* If the LEN parameter is zero, return DEST. */
8751 if (integer_zerop (len))
8752 return omit_one_operand_loc (loc, type, dest, src);
8754 /* If SRC and DEST are the same (and not volatile), return
8755 DEST{,+LEN,+LEN-1}. */
8756 if (operand_equal_p (src, dest, 0))
8760 tree srctype, desttype;
8761 unsigned int src_align, dest_align;
8766 src_align = get_pointer_alignment (src);
8767 dest_align = get_pointer_alignment (dest);
8769 /* Both DEST and SRC must be pointer types.
8770 ??? This is what old code did. Is the testing for pointer types
8773 If either SRC is readonly or length is 1, we can use memcpy. */
8774 if (!dest_align || !src_align)
8776 if (readonly_data_expr (src)
8777 || (host_integerp (len, 1)
8778 && (MIN (src_align, dest_align) / BITS_PER_UNIT
8779 >= (unsigned HOST_WIDE_INT) tree_low_cst (len, 1))))
8781 tree fn = builtin_decl_implicit (BUILT_IN_MEMCPY);
8784 return build_call_expr_loc (loc, fn, 3, dest, src, len);
8787 /* If *src and *dest can't overlap, optimize into memcpy as well. */
8788 if (TREE_CODE (src) == ADDR_EXPR
8789 && TREE_CODE (dest) == ADDR_EXPR)
8791 tree src_base, dest_base, fn;
8792 HOST_WIDE_INT src_offset = 0, dest_offset = 0;
8793 HOST_WIDE_INT size = -1;
8794 HOST_WIDE_INT maxsize = -1;
8796 srcvar = TREE_OPERAND (src, 0);
8797 src_base = get_ref_base_and_extent (srcvar, &src_offset,
8799 destvar = TREE_OPERAND (dest, 0);
8800 dest_base = get_ref_base_and_extent (destvar, &dest_offset,
8802 if (host_integerp (len, 1))
8803 maxsize = tree_low_cst (len, 1);
8806 src_offset /= BITS_PER_UNIT;
8807 dest_offset /= BITS_PER_UNIT;
8808 if (SSA_VAR_P (src_base)
8809 && SSA_VAR_P (dest_base))
8811 if (operand_equal_p (src_base, dest_base, 0)
8812 && ranges_overlap_p (src_offset, maxsize,
8813 dest_offset, maxsize))
8816 else if (TREE_CODE (src_base) == MEM_REF
8817 && TREE_CODE (dest_base) == MEM_REF)
8820 if (! operand_equal_p (TREE_OPERAND (src_base, 0),
8821 TREE_OPERAND (dest_base, 0), 0))
8823 off = double_int_add (mem_ref_offset (src_base),
8824 shwi_to_double_int (src_offset));
8825 if (!double_int_fits_in_shwi_p (off))
8827 src_offset = off.low;
8828 off = double_int_add (mem_ref_offset (dest_base),
8829 shwi_to_double_int (dest_offset));
8830 if (!double_int_fits_in_shwi_p (off))
8832 dest_offset = off.low;
8833 if (ranges_overlap_p (src_offset, maxsize,
8834 dest_offset, maxsize))
8840 fn = builtin_decl_implicit (BUILT_IN_MEMCPY);
8843 return build_call_expr_loc (loc, fn, 3, dest, src, len);
8846 /* If the destination and source do not alias optimize into
8848 if ((is_gimple_min_invariant (dest)
8849 || TREE_CODE (dest) == SSA_NAME)
8850 && (is_gimple_min_invariant (src)
8851 || TREE_CODE (src) == SSA_NAME))
8854 ao_ref_init_from_ptr_and_size (&destr, dest, len);
8855 ao_ref_init_from_ptr_and_size (&srcr, src, len);
8856 if (!refs_may_alias_p_1 (&destr, &srcr, false))
8859 fn = builtin_decl_implicit (BUILT_IN_MEMCPY);
8862 return build_call_expr_loc (loc, fn, 3, dest, src, len);
8869 if (!host_integerp (len, 0))
8872 This logic lose for arguments like (type *)malloc (sizeof (type)),
8873 since we strip the casts of up to VOID return value from malloc.
8874 Perhaps we ought to inherit type from non-VOID argument here? */
8877 if (!POINTER_TYPE_P (TREE_TYPE (src))
8878 || !POINTER_TYPE_P (TREE_TYPE (dest)))
8880 /* As we fold (void *)(p + CST) to (void *)p + CST undo this here. */
8881 if (TREE_CODE (src) == POINTER_PLUS_EXPR)
8883 tree tem = TREE_OPERAND (src, 0);
8885 if (tem != TREE_OPERAND (src, 0))
8886 src = build1 (NOP_EXPR, TREE_TYPE (tem), src);
8888 if (TREE_CODE (dest) == POINTER_PLUS_EXPR)
8890 tree tem = TREE_OPERAND (dest, 0);
8892 if (tem != TREE_OPERAND (dest, 0))
8893 dest = build1 (NOP_EXPR, TREE_TYPE (tem), dest);
8895 srctype = TREE_TYPE (TREE_TYPE (src));
8896 if (TREE_CODE (srctype) == ARRAY_TYPE
8897 && !tree_int_cst_equal (TYPE_SIZE_UNIT (srctype), len))
8899 srctype = TREE_TYPE (srctype);
8901 src = build1 (NOP_EXPR, build_pointer_type (srctype), src);
8903 desttype = TREE_TYPE (TREE_TYPE (dest));
8904 if (TREE_CODE (desttype) == ARRAY_TYPE
8905 && !tree_int_cst_equal (TYPE_SIZE_UNIT (desttype), len))
8907 desttype = TREE_TYPE (desttype);
8909 dest = build1 (NOP_EXPR, build_pointer_type (desttype), dest);
8911 if (TREE_ADDRESSABLE (srctype)
8912 || TREE_ADDRESSABLE (desttype))
8915 src_align = get_pointer_alignment (src);
8916 dest_align = get_pointer_alignment (dest);
8917 if (dest_align < TYPE_ALIGN (desttype)
8918 || src_align < TYPE_ALIGN (srctype))
8922 dest = builtin_save_expr (dest);
8924 /* Build accesses at offset zero with a ref-all character type. */
8925 off0 = build_int_cst (build_pointer_type_for_mode (char_type_node,
8926 ptr_mode, true), 0);
8929 STRIP_NOPS (destvar);
8930 if (TREE_CODE (destvar) == ADDR_EXPR
8931 && var_decl_component_p (TREE_OPERAND (destvar, 0))
8932 && tree_int_cst_equal (TYPE_SIZE_UNIT (desttype), len))
8933 destvar = fold_build2 (MEM_REF, desttype, destvar, off0);
8935 destvar = NULL_TREE;
8938 STRIP_NOPS (srcvar);
8939 if (TREE_CODE (srcvar) == ADDR_EXPR
8940 && var_decl_component_p (TREE_OPERAND (srcvar, 0))
8941 && tree_int_cst_equal (TYPE_SIZE_UNIT (srctype), len))
8944 || src_align >= TYPE_ALIGN (desttype))
8945 srcvar = fold_build2 (MEM_REF, destvar ? desttype : srctype,
8947 else if (!STRICT_ALIGNMENT)
8949 srctype = build_aligned_type (TYPE_MAIN_VARIANT (desttype),
8951 srcvar = fold_build2 (MEM_REF, srctype, srcvar, off0);
8959 if (srcvar == NULL_TREE && destvar == NULL_TREE)
8962 if (srcvar == NULL_TREE)
8965 if (src_align >= TYPE_ALIGN (desttype))
8966 srcvar = fold_build2 (MEM_REF, desttype, src, off0);
8969 if (STRICT_ALIGNMENT)
8971 srctype = build_aligned_type (TYPE_MAIN_VARIANT (desttype),
8973 srcvar = fold_build2 (MEM_REF, srctype, src, off0);
8976 else if (destvar == NULL_TREE)
8979 if (dest_align >= TYPE_ALIGN (srctype))
8980 destvar = fold_build2 (MEM_REF, srctype, dest, off0);
8983 if (STRICT_ALIGNMENT)
8985 desttype = build_aligned_type (TYPE_MAIN_VARIANT (srctype),
8987 destvar = fold_build2 (MEM_REF, desttype, dest, off0);
8991 expr = build2 (MODIFY_EXPR, TREE_TYPE (destvar), destvar, srcvar);
8997 if (endp == 0 || endp == 3)
8998 return omit_one_operand_loc (loc, type, dest, expr);
9004 len = fold_build2_loc (loc, MINUS_EXPR, TREE_TYPE (len), len,
9007 dest = fold_build_pointer_plus_loc (loc, dest, len);
9008 dest = fold_convert_loc (loc, type, dest);
9010 dest = omit_one_operand_loc (loc, type, dest, expr);
9014 /* Fold function call to builtin strcpy with arguments DEST and SRC.
9015 If LEN is not NULL, it represents the length of the string to be
9016 copied. Return NULL_TREE if no simplification can be made. */
9019 fold_builtin_strcpy (location_t loc, tree fndecl, tree dest, tree src, tree len)
9023 if (!validate_arg (dest, POINTER_TYPE)
9024 || !validate_arg (src, POINTER_TYPE))
9027 /* If SRC and DEST are the same (and not volatile), return DEST. */
9028 if (operand_equal_p (src, dest, 0))
9029 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest);
9031 if (optimize_function_for_size_p (cfun))
9034 fn = builtin_decl_implicit (BUILT_IN_MEMCPY);
9040 len = c_strlen (src, 1);
9041 if (! len || TREE_SIDE_EFFECTS (len))
9045 len = fold_convert_loc (loc, size_type_node, len);
9046 len = size_binop_loc (loc, PLUS_EXPR, len, build_int_cst (size_type_node, 1));
9047 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)),
9048 build_call_expr_loc (loc, fn, 3, dest, src, len));
9051 /* Fold function call to builtin stpcpy with arguments DEST and SRC.
9052 Return NULL_TREE if no simplification can be made. */
9055 fold_builtin_stpcpy (location_t loc, tree fndecl, tree dest, tree src)
9057 tree fn, len, lenp1, call, type;
9059 if (!validate_arg (dest, POINTER_TYPE)
9060 || !validate_arg (src, POINTER_TYPE))
9063 len = c_strlen (src, 1);
9065 || TREE_CODE (len) != INTEGER_CST)
9068 if (optimize_function_for_size_p (cfun)
9069 /* If length is zero it's small enough. */
9070 && !integer_zerop (len))
9073 fn = builtin_decl_implicit (BUILT_IN_MEMCPY);
9077 lenp1 = size_binop_loc (loc, PLUS_EXPR,
9078 fold_convert_loc (loc, size_type_node, len),
9079 build_int_cst (size_type_node, 1));
9080 /* We use dest twice in building our expression. Save it from
9081 multiple expansions. */
9082 dest = builtin_save_expr (dest);
9083 call = build_call_expr_loc (loc, fn, 3, dest, src, lenp1);
9085 type = TREE_TYPE (TREE_TYPE (fndecl));
9086 dest = fold_build_pointer_plus_loc (loc, dest, len);
9087 dest = fold_convert_loc (loc, type, dest);
9088 dest = omit_one_operand_loc (loc, type, dest, call);
9092 /* Fold function call to builtin strncpy with arguments DEST, SRC, and LEN.
9093 If SLEN is not NULL, it represents the length of the source string.
9094 Return NULL_TREE if no simplification can be made. */
9097 fold_builtin_strncpy (location_t loc, tree fndecl, tree dest,
9098 tree src, tree len, tree slen)
9102 if (!validate_arg (dest, POINTER_TYPE)
9103 || !validate_arg (src, POINTER_TYPE)
9104 || !validate_arg (len, INTEGER_TYPE))
9107 /* If the LEN parameter is zero, return DEST. */
9108 if (integer_zerop (len))
9109 return omit_one_operand_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest, src);
9111 /* We can't compare slen with len as constants below if len is not a
9113 if (len == 0 || TREE_CODE (len) != INTEGER_CST)
9117 slen = c_strlen (src, 1);
9119 /* Now, we must be passed a constant src ptr parameter. */
9120 if (slen == 0 || TREE_CODE (slen) != INTEGER_CST)
9123 slen = size_binop_loc (loc, PLUS_EXPR, slen, ssize_int (1));
9125 /* We do not support simplification of this case, though we do
9126 support it when expanding trees into RTL. */
9127 /* FIXME: generate a call to __builtin_memset. */
9128 if (tree_int_cst_lt (slen, len))
9131 /* OK transform into builtin memcpy. */
9132 fn = builtin_decl_implicit (BUILT_IN_MEMCPY);
9136 len = fold_convert_loc (loc, size_type_node, len);
9137 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)),
9138 build_call_expr_loc (loc, fn, 3, dest, src, len));
9141 /* Fold function call to builtin memchr. ARG1, ARG2 and LEN are the
9142 arguments to the call, and TYPE is its return type.
9143 Return NULL_TREE if no simplification can be made. */
9146 fold_builtin_memchr (location_t loc, tree arg1, tree arg2, tree len, tree type)
9148 if (!validate_arg (arg1, POINTER_TYPE)
9149 || !validate_arg (arg2, INTEGER_TYPE)
9150 || !validate_arg (len, INTEGER_TYPE))
9156 if (TREE_CODE (arg2) != INTEGER_CST
9157 || !host_integerp (len, 1))
9160 p1 = c_getstr (arg1);
9161 if (p1 && compare_tree_int (len, strlen (p1) + 1) <= 0)
9167 if (target_char_cast (arg2, &c))
9170 r = (const char *) memchr (p1, c, tree_low_cst (len, 1));
9173 return build_int_cst (TREE_TYPE (arg1), 0);
9175 tem = fold_build_pointer_plus_hwi_loc (loc, arg1, r - p1);
9176 return fold_convert_loc (loc, type, tem);
9182 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
9183 Return NULL_TREE if no simplification can be made. */
9186 fold_builtin_memcmp (location_t loc, tree arg1, tree arg2, tree len)
9188 const char *p1, *p2;
9190 if (!validate_arg (arg1, POINTER_TYPE)
9191 || !validate_arg (arg2, POINTER_TYPE)
9192 || !validate_arg (len, INTEGER_TYPE))
9195 /* If the LEN parameter is zero, return zero. */
9196 if (integer_zerop (len))
9197 return omit_two_operands_loc (loc, integer_type_node, integer_zero_node,
9200 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
9201 if (operand_equal_p (arg1, arg2, 0))
9202 return omit_one_operand_loc (loc, integer_type_node, integer_zero_node, len);
9204 p1 = c_getstr (arg1);
9205 p2 = c_getstr (arg2);
9207 /* If all arguments are constant, and the value of len is not greater
9208 than the lengths of arg1 and arg2, evaluate at compile-time. */
9209 if (host_integerp (len, 1) && p1 && p2
9210 && compare_tree_int (len, strlen (p1) + 1) <= 0
9211 && compare_tree_int (len, strlen (p2) + 1) <= 0)
9213 const int r = memcmp (p1, p2, tree_low_cst (len, 1));
9216 return integer_one_node;
9218 return integer_minus_one_node;
9220 return integer_zero_node;
9223 /* If len parameter is one, return an expression corresponding to
9224 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
9225 if (host_integerp (len, 1) && tree_low_cst (len, 1) == 1)
9227 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
9228 tree cst_uchar_ptr_node
9229 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
9232 = fold_convert_loc (loc, integer_type_node,
9233 build1 (INDIRECT_REF, cst_uchar_node,
9234 fold_convert_loc (loc,
9238 = fold_convert_loc (loc, integer_type_node,
9239 build1 (INDIRECT_REF, cst_uchar_node,
9240 fold_convert_loc (loc,
9243 return fold_build2_loc (loc, MINUS_EXPR, integer_type_node, ind1, ind2);
9249 /* Fold function call to builtin strcmp with arguments ARG1 and ARG2.
9250 Return NULL_TREE if no simplification can be made. */
9253 fold_builtin_strcmp (location_t loc, tree arg1, tree arg2)
9255 const char *p1, *p2;
9257 if (!validate_arg (arg1, POINTER_TYPE)
9258 || !validate_arg (arg2, POINTER_TYPE))
9261 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
9262 if (operand_equal_p (arg1, arg2, 0))
9263 return integer_zero_node;
9265 p1 = c_getstr (arg1);
9266 p2 = c_getstr (arg2);
9270 const int i = strcmp (p1, p2);
9272 return integer_minus_one_node;
9274 return integer_one_node;
9276 return integer_zero_node;
9279 /* If the second arg is "", return *(const unsigned char*)arg1. */
9280 if (p2 && *p2 == '\0')
9282 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
9283 tree cst_uchar_ptr_node
9284 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
9286 return fold_convert_loc (loc, integer_type_node,
9287 build1 (INDIRECT_REF, cst_uchar_node,
9288 fold_convert_loc (loc,
9293 /* If the first arg is "", return -*(const unsigned char*)arg2. */
9294 if (p1 && *p1 == '\0')
9296 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
9297 tree cst_uchar_ptr_node
9298 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
9301 = fold_convert_loc (loc, integer_type_node,
9302 build1 (INDIRECT_REF, cst_uchar_node,
9303 fold_convert_loc (loc,
9306 return fold_build1_loc (loc, NEGATE_EXPR, integer_type_node, temp);
9312 /* Fold function call to builtin strncmp with arguments ARG1, ARG2, and LEN.
9313 Return NULL_TREE if no simplification can be made. */
9316 fold_builtin_strncmp (location_t loc, tree arg1, tree arg2, tree len)
9318 const char *p1, *p2;
9320 if (!validate_arg (arg1, POINTER_TYPE)
9321 || !validate_arg (arg2, POINTER_TYPE)
9322 || !validate_arg (len, INTEGER_TYPE))
9325 /* If the LEN parameter is zero, return zero. */
9326 if (integer_zerop (len))
9327 return omit_two_operands_loc (loc, integer_type_node, integer_zero_node,
9330 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
9331 if (operand_equal_p (arg1, arg2, 0))
9332 return omit_one_operand_loc (loc, integer_type_node, integer_zero_node, len);
9334 p1 = c_getstr (arg1);
9335 p2 = c_getstr (arg2);
9337 if (host_integerp (len, 1) && p1 && p2)
9339 const int i = strncmp (p1, p2, tree_low_cst (len, 1));
9341 return integer_one_node;
9343 return integer_minus_one_node;
9345 return integer_zero_node;
9348 /* If the second arg is "", and the length is greater than zero,
9349 return *(const unsigned char*)arg1. */
9350 if (p2 && *p2 == '\0'
9351 && TREE_CODE (len) == INTEGER_CST
9352 && tree_int_cst_sgn (len) == 1)
9354 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
9355 tree cst_uchar_ptr_node
9356 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
9358 return fold_convert_loc (loc, integer_type_node,
9359 build1 (INDIRECT_REF, cst_uchar_node,
9360 fold_convert_loc (loc,
9365 /* If the first arg is "", and the length is greater than zero,
9366 return -*(const unsigned char*)arg2. */
9367 if (p1 && *p1 == '\0'
9368 && TREE_CODE (len) == INTEGER_CST
9369 && tree_int_cst_sgn (len) == 1)
9371 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
9372 tree cst_uchar_ptr_node
9373 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
9375 tree temp = fold_convert_loc (loc, integer_type_node,
9376 build1 (INDIRECT_REF, cst_uchar_node,
9377 fold_convert_loc (loc,
9380 return fold_build1_loc (loc, NEGATE_EXPR, integer_type_node, temp);
9383 /* If len parameter is one, return an expression corresponding to
9384 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
9385 if (host_integerp (len, 1) && tree_low_cst (len, 1) == 1)
9387 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
9388 tree cst_uchar_ptr_node
9389 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
9391 tree ind1 = fold_convert_loc (loc, integer_type_node,
9392 build1 (INDIRECT_REF, cst_uchar_node,
9393 fold_convert_loc (loc,
9396 tree ind2 = fold_convert_loc (loc, integer_type_node,
9397 build1 (INDIRECT_REF, cst_uchar_node,
9398 fold_convert_loc (loc,
9401 return fold_build2_loc (loc, MINUS_EXPR, integer_type_node, ind1, ind2);
9407 /* Fold function call to builtin signbit, signbitf or signbitl with argument
9408 ARG. Return NULL_TREE if no simplification can be made. */
9411 fold_builtin_signbit (location_t loc, tree arg, tree type)
9413 if (!validate_arg (arg, REAL_TYPE))
9416 /* If ARG is a compile-time constant, determine the result. */
9417 if (TREE_CODE (arg) == REAL_CST
9418 && !TREE_OVERFLOW (arg))
9422 c = TREE_REAL_CST (arg);
9423 return (REAL_VALUE_NEGATIVE (c)
9424 ? build_one_cst (type)
9425 : build_zero_cst (type));
9428 /* If ARG is non-negative, the result is always zero. */
9429 if (tree_expr_nonnegative_p (arg))
9430 return omit_one_operand_loc (loc, type, integer_zero_node, arg);
9432 /* If ARG's format doesn't have signed zeros, return "arg < 0.0". */
9433 if (!HONOR_SIGNED_ZEROS (TYPE_MODE (TREE_TYPE (arg))))
9434 return fold_convert (type,
9435 fold_build2_loc (loc, LT_EXPR, boolean_type_node, arg,
9436 build_real (TREE_TYPE (arg), dconst0)));
9441 /* Fold function call to builtin copysign, copysignf or copysignl with
9442 arguments ARG1 and ARG2. Return NULL_TREE if no simplification can
9446 fold_builtin_copysign (location_t loc, tree fndecl,
9447 tree arg1, tree arg2, tree type)
9451 if (!validate_arg (arg1, REAL_TYPE)
9452 || !validate_arg (arg2, REAL_TYPE))
9455 /* copysign(X,X) is X. */
9456 if (operand_equal_p (arg1, arg2, 0))
9457 return fold_convert_loc (loc, type, arg1);
9459 /* If ARG1 and ARG2 are compile-time constants, determine the result. */
9460 if (TREE_CODE (arg1) == REAL_CST
9461 && TREE_CODE (arg2) == REAL_CST
9462 && !TREE_OVERFLOW (arg1)
9463 && !TREE_OVERFLOW (arg2))
9465 REAL_VALUE_TYPE c1, c2;
9467 c1 = TREE_REAL_CST (arg1);
9468 c2 = TREE_REAL_CST (arg2);
9469 /* c1.sign := c2.sign. */
9470 real_copysign (&c1, &c2);
9471 return build_real (type, c1);
9474 /* copysign(X, Y) is fabs(X) when Y is always non-negative.
9475 Remember to evaluate Y for side-effects. */
9476 if (tree_expr_nonnegative_p (arg2))
9477 return omit_one_operand_loc (loc, type,
9478 fold_build1_loc (loc, ABS_EXPR, type, arg1),
9481 /* Strip sign changing operations for the first argument. */
9482 tem = fold_strip_sign_ops (arg1);
9484 return build_call_expr_loc (loc, fndecl, 2, tem, arg2);
9489 /* Fold a call to builtin isascii with argument ARG. */
9492 fold_builtin_isascii (location_t loc, tree arg)
9494 if (!validate_arg (arg, INTEGER_TYPE))
9498 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
9499 arg = fold_build2 (BIT_AND_EXPR, integer_type_node, arg,
9500 build_int_cst (integer_type_node,
9501 ~ (unsigned HOST_WIDE_INT) 0x7f));
9502 return fold_build2_loc (loc, EQ_EXPR, integer_type_node,
9503 arg, integer_zero_node);
9507 /* Fold a call to builtin toascii with argument ARG. */
9510 fold_builtin_toascii (location_t loc, tree arg)
9512 if (!validate_arg (arg, INTEGER_TYPE))
9515 /* Transform toascii(c) -> (c & 0x7f). */
9516 return fold_build2_loc (loc, BIT_AND_EXPR, integer_type_node, arg,
9517 build_int_cst (integer_type_node, 0x7f));
9520 /* Fold a call to builtin isdigit with argument ARG. */
9523 fold_builtin_isdigit (location_t loc, tree arg)
9525 if (!validate_arg (arg, INTEGER_TYPE))
9529 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
9530 /* According to the C standard, isdigit is unaffected by locale.
9531 However, it definitely is affected by the target character set. */
9532 unsigned HOST_WIDE_INT target_digit0
9533 = lang_hooks.to_target_charset ('0');
9535 if (target_digit0 == 0)
9538 arg = fold_convert_loc (loc, unsigned_type_node, arg);
9539 arg = fold_build2 (MINUS_EXPR, unsigned_type_node, arg,
9540 build_int_cst (unsigned_type_node, target_digit0));
9541 return fold_build2_loc (loc, LE_EXPR, integer_type_node, arg,
9542 build_int_cst (unsigned_type_node, 9));
9546 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
9549 fold_builtin_fabs (location_t loc, tree arg, tree type)
9551 if (!validate_arg (arg, REAL_TYPE))
9554 arg = fold_convert_loc (loc, type, arg);
9555 if (TREE_CODE (arg) == REAL_CST)
9556 return fold_abs_const (arg, type);
9557 return fold_build1_loc (loc, ABS_EXPR, type, arg);
9560 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
9563 fold_builtin_abs (location_t loc, tree arg, tree type)
9565 if (!validate_arg (arg, INTEGER_TYPE))
9568 arg = fold_convert_loc (loc, type, arg);
9569 if (TREE_CODE (arg) == INTEGER_CST)
9570 return fold_abs_const (arg, type);
9571 return fold_build1_loc (loc, ABS_EXPR, type, arg);
9574 /* Fold a fma operation with arguments ARG[012]. */
9577 fold_fma (location_t loc ATTRIBUTE_UNUSED,
9578 tree type, tree arg0, tree arg1, tree arg2)
9580 if (TREE_CODE (arg0) == REAL_CST
9581 && TREE_CODE (arg1) == REAL_CST
9582 && TREE_CODE (arg2) == REAL_CST)
9583 return do_mpfr_arg3 (arg0, arg1, arg2, type, mpfr_fma);
9588 /* Fold a call to fma, fmaf, or fmal with arguments ARG[012]. */
9591 fold_builtin_fma (location_t loc, tree arg0, tree arg1, tree arg2, tree type)
9593 if (validate_arg (arg0, REAL_TYPE)
9594 && validate_arg(arg1, REAL_TYPE)
9595 && validate_arg(arg2, REAL_TYPE))
9597 tree tem = fold_fma (loc, type, arg0, arg1, arg2);
9601 /* ??? Only expand to FMA_EXPR if it's directly supported. */
9602 if (optab_handler (fma_optab, TYPE_MODE (type)) != CODE_FOR_nothing)
9603 return fold_build3_loc (loc, FMA_EXPR, type, arg0, arg1, arg2);
9608 /* Fold a call to builtin fmin or fmax. */
9611 fold_builtin_fmin_fmax (location_t loc, tree arg0, tree arg1,
9612 tree type, bool max)
9614 if (validate_arg (arg0, REAL_TYPE) && validate_arg (arg1, REAL_TYPE))
9616 /* Calculate the result when the argument is a constant. */
9617 tree res = do_mpfr_arg2 (arg0, arg1, type, (max ? mpfr_max : mpfr_min));
9622 /* If either argument is NaN, return the other one. Avoid the
9623 transformation if we get (and honor) a signalling NaN. Using
9624 omit_one_operand() ensures we create a non-lvalue. */
9625 if (TREE_CODE (arg0) == REAL_CST
9626 && real_isnan (&TREE_REAL_CST (arg0))
9627 && (! HONOR_SNANS (TYPE_MODE (TREE_TYPE (arg0)))
9628 || ! TREE_REAL_CST (arg0).signalling))
9629 return omit_one_operand_loc (loc, type, arg1, arg0);
9630 if (TREE_CODE (arg1) == REAL_CST
9631 && real_isnan (&TREE_REAL_CST (arg1))
9632 && (! HONOR_SNANS (TYPE_MODE (TREE_TYPE (arg1)))
9633 || ! TREE_REAL_CST (arg1).signalling))
9634 return omit_one_operand_loc (loc, type, arg0, arg1);
9636 /* Transform fmin/fmax(x,x) -> x. */
9637 if (operand_equal_p (arg0, arg1, OEP_PURE_SAME))
9638 return omit_one_operand_loc (loc, type, arg0, arg1);
9640 /* Convert fmin/fmax to MIN_EXPR/MAX_EXPR. C99 requires these
9641 functions to return the numeric arg if the other one is NaN.
9642 These tree codes don't honor that, so only transform if
9643 -ffinite-math-only is set. C99 doesn't require -0.0 to be
9644 handled, so we don't have to worry about it either. */
9645 if (flag_finite_math_only)
9646 return fold_build2_loc (loc, (max ? MAX_EXPR : MIN_EXPR), type,
9647 fold_convert_loc (loc, type, arg0),
9648 fold_convert_loc (loc, type, arg1));
9653 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
9656 fold_builtin_carg (location_t loc, tree arg, tree type)
9658 if (validate_arg (arg, COMPLEX_TYPE)
9659 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) == REAL_TYPE)
9661 tree atan2_fn = mathfn_built_in (type, BUILT_IN_ATAN2);
9665 tree new_arg = builtin_save_expr (arg);
9666 tree r_arg = fold_build1_loc (loc, REALPART_EXPR, type, new_arg);
9667 tree i_arg = fold_build1_loc (loc, IMAGPART_EXPR, type, new_arg);
9668 return build_call_expr_loc (loc, atan2_fn, 2, i_arg, r_arg);
9675 /* Fold a call to builtin logb/ilogb. */
9678 fold_builtin_logb (location_t loc, tree arg, tree rettype)
9680 if (! validate_arg (arg, REAL_TYPE))
9685 if (TREE_CODE (arg) == REAL_CST && ! TREE_OVERFLOW (arg))
9687 const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (arg);
9693 /* If arg is Inf or NaN and we're logb, return it. */
9694 if (TREE_CODE (rettype) == REAL_TYPE)
9695 return fold_convert_loc (loc, rettype, arg);
9696 /* Fall through... */
9698 /* Zero may set errno and/or raise an exception for logb, also
9699 for ilogb we don't know FP_ILOGB0. */
9702 /* For normal numbers, proceed iff radix == 2. In GCC,
9703 normalized significands are in the range [0.5, 1.0). We
9704 want the exponent as if they were [1.0, 2.0) so get the
9705 exponent and subtract 1. */
9706 if (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (arg)))->b == 2)
9707 return fold_convert_loc (loc, rettype,
9708 build_int_cst (integer_type_node,
9709 REAL_EXP (value)-1));
9717 /* Fold a call to builtin significand, if radix == 2. */
9720 fold_builtin_significand (location_t loc, tree arg, tree rettype)
9722 if (! validate_arg (arg, REAL_TYPE))
9727 if (TREE_CODE (arg) == REAL_CST && ! TREE_OVERFLOW (arg))
9729 const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (arg);
9736 /* If arg is +-0, +-Inf or +-NaN, then return it. */
9737 return fold_convert_loc (loc, rettype, arg);
9739 /* For normal numbers, proceed iff radix == 2. */
9740 if (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (arg)))->b == 2)
9742 REAL_VALUE_TYPE result = *value;
9743 /* In GCC, normalized significands are in the range [0.5,
9744 1.0). We want them to be [1.0, 2.0) so set the
9746 SET_REAL_EXP (&result, 1);
9747 return build_real (rettype, result);
9756 /* Fold a call to builtin frexp, we can assume the base is 2. */
9759 fold_builtin_frexp (location_t loc, tree arg0, tree arg1, tree rettype)
9761 if (! validate_arg (arg0, REAL_TYPE) || ! validate_arg (arg1, POINTER_TYPE))
9766 if (!(TREE_CODE (arg0) == REAL_CST && ! TREE_OVERFLOW (arg0)))
9769 arg1 = build_fold_indirect_ref_loc (loc, arg1);
9771 /* Proceed if a valid pointer type was passed in. */
9772 if (TYPE_MAIN_VARIANT (TREE_TYPE (arg1)) == integer_type_node)
9774 const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (arg0);
9780 /* For +-0, return (*exp = 0, +-0). */
9781 exp = integer_zero_node;
9786 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
9787 return omit_one_operand_loc (loc, rettype, arg0, arg1);
9790 /* Since the frexp function always expects base 2, and in
9791 GCC normalized significands are already in the range
9792 [0.5, 1.0), we have exactly what frexp wants. */
9793 REAL_VALUE_TYPE frac_rvt = *value;
9794 SET_REAL_EXP (&frac_rvt, 0);
9795 frac = build_real (rettype, frac_rvt);
9796 exp = build_int_cst (integer_type_node, REAL_EXP (value));
9803 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
9804 arg1 = fold_build2_loc (loc, MODIFY_EXPR, rettype, arg1, exp);
9805 TREE_SIDE_EFFECTS (arg1) = 1;
9806 return fold_build2_loc (loc, COMPOUND_EXPR, rettype, arg1, frac);
9812 /* Fold a call to builtin ldexp or scalbn/scalbln. If LDEXP is true
9813 then we can assume the base is two. If it's false, then we have to
9814 check the mode of the TYPE parameter in certain cases. */
9817 fold_builtin_load_exponent (location_t loc, tree arg0, tree arg1,
9818 tree type, bool ldexp)
9820 if (validate_arg (arg0, REAL_TYPE) && validate_arg (arg1, INTEGER_TYPE))
9825 /* If arg0 is 0, Inf or NaN, or if arg1 is 0, then return arg0. */
9826 if (real_zerop (arg0) || integer_zerop (arg1)
9827 || (TREE_CODE (arg0) == REAL_CST
9828 && !real_isfinite (&TREE_REAL_CST (arg0))))
9829 return omit_one_operand_loc (loc, type, arg0, arg1);
9831 /* If both arguments are constant, then try to evaluate it. */
9832 if ((ldexp || REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2)
9833 && TREE_CODE (arg0) == REAL_CST && !TREE_OVERFLOW (arg0)
9834 && host_integerp (arg1, 0))
9836 /* Bound the maximum adjustment to twice the range of the
9837 mode's valid exponents. Use abs to ensure the range is
9838 positive as a sanity check. */
9839 const long max_exp_adj = 2 *
9840 labs (REAL_MODE_FORMAT (TYPE_MODE (type))->emax
9841 - REAL_MODE_FORMAT (TYPE_MODE (type))->emin);
9843 /* Get the user-requested adjustment. */
9844 const HOST_WIDE_INT req_exp_adj = tree_low_cst (arg1, 0);
9846 /* The requested adjustment must be inside this range. This
9847 is a preliminary cap to avoid things like overflow, we
9848 may still fail to compute the result for other reasons. */
9849 if (-max_exp_adj < req_exp_adj && req_exp_adj < max_exp_adj)
9851 REAL_VALUE_TYPE initial_result;
9853 real_ldexp (&initial_result, &TREE_REAL_CST (arg0), req_exp_adj);
9855 /* Ensure we didn't overflow. */
9856 if (! real_isinf (&initial_result))
9858 const REAL_VALUE_TYPE trunc_result
9859 = real_value_truncate (TYPE_MODE (type), initial_result);
9861 /* Only proceed if the target mode can hold the
9863 if (REAL_VALUES_EQUAL (initial_result, trunc_result))
9864 return build_real (type, trunc_result);
9873 /* Fold a call to builtin modf. */
9876 fold_builtin_modf (location_t loc, tree arg0, tree arg1, tree rettype)
9878 if (! validate_arg (arg0, REAL_TYPE) || ! validate_arg (arg1, POINTER_TYPE))
9883 if (!(TREE_CODE (arg0) == REAL_CST && ! TREE_OVERFLOW (arg0)))
9886 arg1 = build_fold_indirect_ref_loc (loc, arg1);
9888 /* Proceed if a valid pointer type was passed in. */
9889 if (TYPE_MAIN_VARIANT (TREE_TYPE (arg1)) == TYPE_MAIN_VARIANT (rettype))
9891 const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (arg0);
9892 REAL_VALUE_TYPE trunc, frac;
9898 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
9899 trunc = frac = *value;
9902 /* For +-Inf, return (*arg1 = arg0, +-0). */
9904 frac.sign = value->sign;
9908 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
9909 real_trunc (&trunc, VOIDmode, value);
9910 real_arithmetic (&frac, MINUS_EXPR, value, &trunc);
9911 /* If the original number was negative and already
9912 integral, then the fractional part is -0.0. */
9913 if (value->sign && frac.cl == rvc_zero)
9914 frac.sign = value->sign;
9918 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
9919 arg1 = fold_build2_loc (loc, MODIFY_EXPR, rettype, arg1,
9920 build_real (rettype, trunc));
9921 TREE_SIDE_EFFECTS (arg1) = 1;
9922 return fold_build2_loc (loc, COMPOUND_EXPR, rettype, arg1,
9923 build_real (rettype, frac));
9929 /* Given a location LOC, an interclass builtin function decl FNDECL
9930 and its single argument ARG, return an folded expression computing
9931 the same, or NULL_TREE if we either couldn't or didn't want to fold
9932 (the latter happen if there's an RTL instruction available). */
9935 fold_builtin_interclass_mathfn (location_t loc, tree fndecl, tree arg)
9937 enum machine_mode mode;
9939 if (!validate_arg (arg, REAL_TYPE))
9942 if (interclass_mathfn_icode (arg, fndecl) != CODE_FOR_nothing)
9945 mode = TYPE_MODE (TREE_TYPE (arg));
9947 /* If there is no optab, try generic code. */
9948 switch (DECL_FUNCTION_CODE (fndecl))
9952 CASE_FLT_FN (BUILT_IN_ISINF):
9954 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
9955 tree const isgr_fn = builtin_decl_explicit (BUILT_IN_ISGREATER);
9956 tree const type = TREE_TYPE (arg);
9960 get_max_float (REAL_MODE_FORMAT (mode), buf, sizeof (buf));
9961 real_from_string (&r, buf);
9962 result = build_call_expr (isgr_fn, 2,
9963 fold_build1_loc (loc, ABS_EXPR, type, arg),
9964 build_real (type, r));
9967 CASE_FLT_FN (BUILT_IN_FINITE):
9968 case BUILT_IN_ISFINITE:
9970 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
9971 tree const isle_fn = builtin_decl_explicit (BUILT_IN_ISLESSEQUAL);
9972 tree const type = TREE_TYPE (arg);
9976 get_max_float (REAL_MODE_FORMAT (mode), buf, sizeof (buf));
9977 real_from_string (&r, buf);
9978 result = build_call_expr (isle_fn, 2,
9979 fold_build1_loc (loc, ABS_EXPR, type, arg),
9980 build_real (type, r));
9981 /*result = fold_build2_loc (loc, UNGT_EXPR,
9982 TREE_TYPE (TREE_TYPE (fndecl)),
9983 fold_build1_loc (loc, ABS_EXPR, type, arg),
9984 build_real (type, r));
9985 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
9986 TREE_TYPE (TREE_TYPE (fndecl)),
9990 case BUILT_IN_ISNORMAL:
9992 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
9993 islessequal(fabs(x),DBL_MAX). */
9994 tree const isle_fn = builtin_decl_explicit (BUILT_IN_ISLESSEQUAL);
9995 tree const isge_fn = builtin_decl_explicit (BUILT_IN_ISGREATEREQUAL);
9996 tree const type = TREE_TYPE (arg);
9997 REAL_VALUE_TYPE rmax, rmin;
10000 get_max_float (REAL_MODE_FORMAT (mode), buf, sizeof (buf));
10001 real_from_string (&rmax, buf);
10002 sprintf (buf, "0x1p%d", REAL_MODE_FORMAT (mode)->emin - 1);
10003 real_from_string (&rmin, buf);
10004 arg = builtin_save_expr (fold_build1_loc (loc, ABS_EXPR, type, arg));
10005 result = build_call_expr (isle_fn, 2, arg,
10006 build_real (type, rmax));
10007 result = fold_build2 (BIT_AND_EXPR, integer_type_node, result,
10008 build_call_expr (isge_fn, 2, arg,
10009 build_real (type, rmin)));
10019 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
10020 ARG is the argument for the call. */
10023 fold_builtin_classify (location_t loc, tree fndecl, tree arg, int builtin_index)
10025 tree type = TREE_TYPE (TREE_TYPE (fndecl));
10028 if (!validate_arg (arg, REAL_TYPE))
10031 switch (builtin_index)
10033 case BUILT_IN_ISINF:
10034 if (!HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (arg))))
10035 return omit_one_operand_loc (loc, type, integer_zero_node, arg);
10037 if (TREE_CODE (arg) == REAL_CST)
10039 r = TREE_REAL_CST (arg);
10040 if (real_isinf (&r))
10041 return real_compare (GT_EXPR, &r, &dconst0)
10042 ? integer_one_node : integer_minus_one_node;
10044 return integer_zero_node;
10049 case BUILT_IN_ISINF_SIGN:
10051 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
10052 /* In a boolean context, GCC will fold the inner COND_EXPR to
10053 1. So e.g. "if (isinf_sign(x))" would be folded to just
10054 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
10055 tree signbit_fn = mathfn_built_in_1 (TREE_TYPE (arg), BUILT_IN_SIGNBIT, 0);
10056 tree isinf_fn = builtin_decl_explicit (BUILT_IN_ISINF);
10057 tree tmp = NULL_TREE;
10059 arg = builtin_save_expr (arg);
10061 if (signbit_fn && isinf_fn)
10063 tree signbit_call = build_call_expr_loc (loc, signbit_fn, 1, arg);
10064 tree isinf_call = build_call_expr_loc (loc, isinf_fn, 1, arg);
10066 signbit_call = fold_build2_loc (loc, NE_EXPR, integer_type_node,
10067 signbit_call, integer_zero_node);
10068 isinf_call = fold_build2_loc (loc, NE_EXPR, integer_type_node,
10069 isinf_call, integer_zero_node);
10071 tmp = fold_build3_loc (loc, COND_EXPR, integer_type_node, signbit_call,
10072 integer_minus_one_node, integer_one_node);
10073 tmp = fold_build3_loc (loc, COND_EXPR, integer_type_node,
10075 integer_zero_node);
10081 case BUILT_IN_ISFINITE:
10082 if (!HONOR_NANS (TYPE_MODE (TREE_TYPE (arg)))
10083 && !HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (arg))))
10084 return omit_one_operand_loc (loc, type, integer_one_node, arg);
10086 if (TREE_CODE (arg) == REAL_CST)
10088 r = TREE_REAL_CST (arg);
10089 return real_isfinite (&r) ? integer_one_node : integer_zero_node;
10094 case BUILT_IN_ISNAN:
10095 if (!HONOR_NANS (TYPE_MODE (TREE_TYPE (arg))))
10096 return omit_one_operand_loc (loc, type, integer_zero_node, arg);
10098 if (TREE_CODE (arg) == REAL_CST)
10100 r = TREE_REAL_CST (arg);
10101 return real_isnan (&r) ? integer_one_node : integer_zero_node;
10104 arg = builtin_save_expr (arg);
10105 return fold_build2_loc (loc, UNORDERED_EXPR, type, arg, arg);
10108 gcc_unreachable ();
10112 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
10113 This builtin will generate code to return the appropriate floating
10114 point classification depending on the value of the floating point
10115 number passed in. The possible return values must be supplied as
10116 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
10117 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
10118 one floating point argument which is "type generic". */
10121 fold_builtin_fpclassify (location_t loc, tree exp)
10123 tree fp_nan, fp_infinite, fp_normal, fp_subnormal, fp_zero,
10124 arg, type, res, tmp;
10125 enum machine_mode mode;
10129 /* Verify the required arguments in the original call. */
10130 if (!validate_arglist (exp, INTEGER_TYPE, INTEGER_TYPE,
10131 INTEGER_TYPE, INTEGER_TYPE,
10132 INTEGER_TYPE, REAL_TYPE, VOID_TYPE))
10135 fp_nan = CALL_EXPR_ARG (exp, 0);
10136 fp_infinite = CALL_EXPR_ARG (exp, 1);
10137 fp_normal = CALL_EXPR_ARG (exp, 2);
10138 fp_subnormal = CALL_EXPR_ARG (exp, 3);
10139 fp_zero = CALL_EXPR_ARG (exp, 4);
10140 arg = CALL_EXPR_ARG (exp, 5);
10141 type = TREE_TYPE (arg);
10142 mode = TYPE_MODE (type);
10143 arg = builtin_save_expr (fold_build1_loc (loc, ABS_EXPR, type, arg));
10145 /* fpclassify(x) ->
10146 isnan(x) ? FP_NAN :
10147 (fabs(x) == Inf ? FP_INFINITE :
10148 (fabs(x) >= DBL_MIN ? FP_NORMAL :
10149 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
10151 tmp = fold_build2_loc (loc, EQ_EXPR, integer_type_node, arg,
10152 build_real (type, dconst0));
10153 res = fold_build3_loc (loc, COND_EXPR, integer_type_node,
10154 tmp, fp_zero, fp_subnormal);
10156 sprintf (buf, "0x1p%d", REAL_MODE_FORMAT (mode)->emin - 1);
10157 real_from_string (&r, buf);
10158 tmp = fold_build2_loc (loc, GE_EXPR, integer_type_node,
10159 arg, build_real (type, r));
10160 res = fold_build3_loc (loc, COND_EXPR, integer_type_node, tmp, fp_normal, res);
10162 if (HONOR_INFINITIES (mode))
10165 tmp = fold_build2_loc (loc, EQ_EXPR, integer_type_node, arg,
10166 build_real (type, r));
10167 res = fold_build3_loc (loc, COND_EXPR, integer_type_node, tmp,
10171 if (HONOR_NANS (mode))
10173 tmp = fold_build2_loc (loc, ORDERED_EXPR, integer_type_node, arg, arg);
10174 res = fold_build3_loc (loc, COND_EXPR, integer_type_node, tmp, res, fp_nan);
10180 /* Fold a call to an unordered comparison function such as
10181 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
10182 being called and ARG0 and ARG1 are the arguments for the call.
10183 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
10184 the opposite of the desired result. UNORDERED_CODE is used
10185 for modes that can hold NaNs and ORDERED_CODE is used for
10189 fold_builtin_unordered_cmp (location_t loc, tree fndecl, tree arg0, tree arg1,
10190 enum tree_code unordered_code,
10191 enum tree_code ordered_code)
10193 tree type = TREE_TYPE (TREE_TYPE (fndecl));
10194 enum tree_code code;
10196 enum tree_code code0, code1;
10197 tree cmp_type = NULL_TREE;
10199 type0 = TREE_TYPE (arg0);
10200 type1 = TREE_TYPE (arg1);
10202 code0 = TREE_CODE (type0);
10203 code1 = TREE_CODE (type1);
10205 if (code0 == REAL_TYPE && code1 == REAL_TYPE)
10206 /* Choose the wider of two real types. */
10207 cmp_type = TYPE_PRECISION (type0) >= TYPE_PRECISION (type1)
10209 else if (code0 == REAL_TYPE && code1 == INTEGER_TYPE)
10211 else if (code0 == INTEGER_TYPE && code1 == REAL_TYPE)
10214 arg0 = fold_convert_loc (loc, cmp_type, arg0);
10215 arg1 = fold_convert_loc (loc, cmp_type, arg1);
10217 if (unordered_code == UNORDERED_EXPR)
10219 if (!HONOR_NANS (TYPE_MODE (TREE_TYPE (arg0))))
10220 return omit_two_operands_loc (loc, type, integer_zero_node, arg0, arg1);
10221 return fold_build2_loc (loc, UNORDERED_EXPR, type, arg0, arg1);
10224 code = HONOR_NANS (TYPE_MODE (TREE_TYPE (arg0))) ? unordered_code
10226 return fold_build1_loc (loc, TRUTH_NOT_EXPR, type,
10227 fold_build2_loc (loc, code, type, arg0, arg1));
10230 /* Fold a call to built-in function FNDECL with 0 arguments.
10231 IGNORE is true if the result of the function call is ignored. This
10232 function returns NULL_TREE if no simplification was possible. */
10235 fold_builtin_0 (location_t loc, tree fndecl, bool ignore ATTRIBUTE_UNUSED)
10237 tree type = TREE_TYPE (TREE_TYPE (fndecl));
10238 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
10241 CASE_FLT_FN (BUILT_IN_INF):
10242 case BUILT_IN_INFD32:
10243 case BUILT_IN_INFD64:
10244 case BUILT_IN_INFD128:
10245 return fold_builtin_inf (loc, type, true);
10247 CASE_FLT_FN (BUILT_IN_HUGE_VAL):
10248 return fold_builtin_inf (loc, type, false);
10250 case BUILT_IN_CLASSIFY_TYPE:
10251 return fold_builtin_classify_type (NULL_TREE);
10259 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
10260 IGNORE is true if the result of the function call is ignored. This
10261 function returns NULL_TREE if no simplification was possible. */
10264 fold_builtin_1 (location_t loc, tree fndecl, tree arg0, bool ignore)
10266 tree type = TREE_TYPE (TREE_TYPE (fndecl));
10267 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
10270 case BUILT_IN_CONSTANT_P:
10272 tree val = fold_builtin_constant_p (arg0);
10274 /* Gimplification will pull the CALL_EXPR for the builtin out of
10275 an if condition. When not optimizing, we'll not CSE it back.
10276 To avoid link error types of regressions, return false now. */
10277 if (!val && !optimize)
10278 val = integer_zero_node;
10283 case BUILT_IN_CLASSIFY_TYPE:
10284 return fold_builtin_classify_type (arg0);
10286 case BUILT_IN_STRLEN:
10287 return fold_builtin_strlen (loc, type, arg0);
10289 CASE_FLT_FN (BUILT_IN_FABS):
10290 return fold_builtin_fabs (loc, arg0, type);
10293 case BUILT_IN_LABS:
10294 case BUILT_IN_LLABS:
10295 case BUILT_IN_IMAXABS:
10296 return fold_builtin_abs (loc, arg0, type);
10298 CASE_FLT_FN (BUILT_IN_CONJ):
10299 if (validate_arg (arg0, COMPLEX_TYPE)
10300 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10301 return fold_build1_loc (loc, CONJ_EXPR, type, arg0);
10304 CASE_FLT_FN (BUILT_IN_CREAL):
10305 if (validate_arg (arg0, COMPLEX_TYPE)
10306 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10307 return non_lvalue_loc (loc, fold_build1_loc (loc, REALPART_EXPR, type, arg0));;
10310 CASE_FLT_FN (BUILT_IN_CIMAG):
10311 if (validate_arg (arg0, COMPLEX_TYPE)
10312 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10313 return non_lvalue_loc (loc, fold_build1_loc (loc, IMAGPART_EXPR, type, arg0));
10316 CASE_FLT_FN (BUILT_IN_CCOS):
10317 return fold_builtin_ccos(loc, arg0, type, fndecl, /*hyper=*/ false);
10319 CASE_FLT_FN (BUILT_IN_CCOSH):
10320 return fold_builtin_ccos(loc, arg0, type, fndecl, /*hyper=*/ true);
10322 CASE_FLT_FN (BUILT_IN_CPROJ):
10323 return fold_builtin_cproj(loc, arg0, type);
10325 CASE_FLT_FN (BUILT_IN_CSIN):
10326 if (validate_arg (arg0, COMPLEX_TYPE)
10327 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10328 return do_mpc_arg1 (arg0, type, mpc_sin);
10331 CASE_FLT_FN (BUILT_IN_CSINH):
10332 if (validate_arg (arg0, COMPLEX_TYPE)
10333 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10334 return do_mpc_arg1 (arg0, type, mpc_sinh);
10337 CASE_FLT_FN (BUILT_IN_CTAN):
10338 if (validate_arg (arg0, COMPLEX_TYPE)
10339 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10340 return do_mpc_arg1 (arg0, type, mpc_tan);
10343 CASE_FLT_FN (BUILT_IN_CTANH):
10344 if (validate_arg (arg0, COMPLEX_TYPE)
10345 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10346 return do_mpc_arg1 (arg0, type, mpc_tanh);
10349 CASE_FLT_FN (BUILT_IN_CLOG):
10350 if (validate_arg (arg0, COMPLEX_TYPE)
10351 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10352 return do_mpc_arg1 (arg0, type, mpc_log);
10355 CASE_FLT_FN (BUILT_IN_CSQRT):
10356 if (validate_arg (arg0, COMPLEX_TYPE)
10357 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10358 return do_mpc_arg1 (arg0, type, mpc_sqrt);
10361 CASE_FLT_FN (BUILT_IN_CASIN):
10362 if (validate_arg (arg0, COMPLEX_TYPE)
10363 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10364 return do_mpc_arg1 (arg0, type, mpc_asin);
10367 CASE_FLT_FN (BUILT_IN_CACOS):
10368 if (validate_arg (arg0, COMPLEX_TYPE)
10369 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10370 return do_mpc_arg1 (arg0, type, mpc_acos);
10373 CASE_FLT_FN (BUILT_IN_CATAN):
10374 if (validate_arg (arg0, COMPLEX_TYPE)
10375 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10376 return do_mpc_arg1 (arg0, type, mpc_atan);
10379 CASE_FLT_FN (BUILT_IN_CASINH):
10380 if (validate_arg (arg0, COMPLEX_TYPE)
10381 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10382 return do_mpc_arg1 (arg0, type, mpc_asinh);
10385 CASE_FLT_FN (BUILT_IN_CACOSH):
10386 if (validate_arg (arg0, COMPLEX_TYPE)
10387 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10388 return do_mpc_arg1 (arg0, type, mpc_acosh);
10391 CASE_FLT_FN (BUILT_IN_CATANH):
10392 if (validate_arg (arg0, COMPLEX_TYPE)
10393 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10394 return do_mpc_arg1 (arg0, type, mpc_atanh);
10397 CASE_FLT_FN (BUILT_IN_CABS):
10398 return fold_builtin_cabs (loc, arg0, type, fndecl);
10400 CASE_FLT_FN (BUILT_IN_CARG):
10401 return fold_builtin_carg (loc, arg0, type);
10403 CASE_FLT_FN (BUILT_IN_SQRT):
10404 return fold_builtin_sqrt (loc, arg0, type);
10406 CASE_FLT_FN (BUILT_IN_CBRT):
10407 return fold_builtin_cbrt (loc, arg0, type);
10409 CASE_FLT_FN (BUILT_IN_ASIN):
10410 if (validate_arg (arg0, REAL_TYPE))
10411 return do_mpfr_arg1 (arg0, type, mpfr_asin,
10412 &dconstm1, &dconst1, true);
10415 CASE_FLT_FN (BUILT_IN_ACOS):
10416 if (validate_arg (arg0, REAL_TYPE))
10417 return do_mpfr_arg1 (arg0, type, mpfr_acos,
10418 &dconstm1, &dconst1, true);
10421 CASE_FLT_FN (BUILT_IN_ATAN):
10422 if (validate_arg (arg0, REAL_TYPE))
10423 return do_mpfr_arg1 (arg0, type, mpfr_atan, NULL, NULL, 0);
10426 CASE_FLT_FN (BUILT_IN_ASINH):
10427 if (validate_arg (arg0, REAL_TYPE))
10428 return do_mpfr_arg1 (arg0, type, mpfr_asinh, NULL, NULL, 0);
10431 CASE_FLT_FN (BUILT_IN_ACOSH):
10432 if (validate_arg (arg0, REAL_TYPE))
10433 return do_mpfr_arg1 (arg0, type, mpfr_acosh,
10434 &dconst1, NULL, true);
10437 CASE_FLT_FN (BUILT_IN_ATANH):
10438 if (validate_arg (arg0, REAL_TYPE))
10439 return do_mpfr_arg1 (arg0, type, mpfr_atanh,
10440 &dconstm1, &dconst1, false);
10443 CASE_FLT_FN (BUILT_IN_SIN):
10444 if (validate_arg (arg0, REAL_TYPE))
10445 return do_mpfr_arg1 (arg0, type, mpfr_sin, NULL, NULL, 0);
10448 CASE_FLT_FN (BUILT_IN_COS):
10449 return fold_builtin_cos (loc, arg0, type, fndecl);
10451 CASE_FLT_FN (BUILT_IN_TAN):
10452 return fold_builtin_tan (arg0, type);
10454 CASE_FLT_FN (BUILT_IN_CEXP):
10455 return fold_builtin_cexp (loc, arg0, type);
10457 CASE_FLT_FN (BUILT_IN_CEXPI):
10458 if (validate_arg (arg0, REAL_TYPE))
10459 return do_mpfr_sincos (arg0, NULL_TREE, NULL_TREE);
10462 CASE_FLT_FN (BUILT_IN_SINH):
10463 if (validate_arg (arg0, REAL_TYPE))
10464 return do_mpfr_arg1 (arg0, type, mpfr_sinh, NULL, NULL, 0);
10467 CASE_FLT_FN (BUILT_IN_COSH):
10468 return fold_builtin_cosh (loc, arg0, type, fndecl);
10470 CASE_FLT_FN (BUILT_IN_TANH):
10471 if (validate_arg (arg0, REAL_TYPE))
10472 return do_mpfr_arg1 (arg0, type, mpfr_tanh, NULL, NULL, 0);
10475 CASE_FLT_FN (BUILT_IN_ERF):
10476 if (validate_arg (arg0, REAL_TYPE))
10477 return do_mpfr_arg1 (arg0, type, mpfr_erf, NULL, NULL, 0);
10480 CASE_FLT_FN (BUILT_IN_ERFC):
10481 if (validate_arg (arg0, REAL_TYPE))
10482 return do_mpfr_arg1 (arg0, type, mpfr_erfc, NULL, NULL, 0);
10485 CASE_FLT_FN (BUILT_IN_TGAMMA):
10486 if (validate_arg (arg0, REAL_TYPE))
10487 return do_mpfr_arg1 (arg0, type, mpfr_gamma, NULL, NULL, 0);
10490 CASE_FLT_FN (BUILT_IN_EXP):
10491 return fold_builtin_exponent (loc, fndecl, arg0, mpfr_exp);
10493 CASE_FLT_FN (BUILT_IN_EXP2):
10494 return fold_builtin_exponent (loc, fndecl, arg0, mpfr_exp2);
10496 CASE_FLT_FN (BUILT_IN_EXP10):
10497 CASE_FLT_FN (BUILT_IN_POW10):
10498 return fold_builtin_exponent (loc, fndecl, arg0, mpfr_exp10);
10500 CASE_FLT_FN (BUILT_IN_EXPM1):
10501 if (validate_arg (arg0, REAL_TYPE))
10502 return do_mpfr_arg1 (arg0, type, mpfr_expm1, NULL, NULL, 0);
10505 CASE_FLT_FN (BUILT_IN_LOG):
10506 return fold_builtin_logarithm (loc, fndecl, arg0, mpfr_log);
10508 CASE_FLT_FN (BUILT_IN_LOG2):
10509 return fold_builtin_logarithm (loc, fndecl, arg0, mpfr_log2);
10511 CASE_FLT_FN (BUILT_IN_LOG10):
10512 return fold_builtin_logarithm (loc, fndecl, arg0, mpfr_log10);
10514 CASE_FLT_FN (BUILT_IN_LOG1P):
10515 if (validate_arg (arg0, REAL_TYPE))
10516 return do_mpfr_arg1 (arg0, type, mpfr_log1p,
10517 &dconstm1, NULL, false);
10520 CASE_FLT_FN (BUILT_IN_J0):
10521 if (validate_arg (arg0, REAL_TYPE))
10522 return do_mpfr_arg1 (arg0, type, mpfr_j0,
10526 CASE_FLT_FN (BUILT_IN_J1):
10527 if (validate_arg (arg0, REAL_TYPE))
10528 return do_mpfr_arg1 (arg0, type, mpfr_j1,
10532 CASE_FLT_FN (BUILT_IN_Y0):
10533 if (validate_arg (arg0, REAL_TYPE))
10534 return do_mpfr_arg1 (arg0, type, mpfr_y0,
10535 &dconst0, NULL, false);
10538 CASE_FLT_FN (BUILT_IN_Y1):
10539 if (validate_arg (arg0, REAL_TYPE))
10540 return do_mpfr_arg1 (arg0, type, mpfr_y1,
10541 &dconst0, NULL, false);
10544 CASE_FLT_FN (BUILT_IN_NAN):
10545 case BUILT_IN_NAND32:
10546 case BUILT_IN_NAND64:
10547 case BUILT_IN_NAND128:
10548 return fold_builtin_nan (arg0, type, true);
10550 CASE_FLT_FN (BUILT_IN_NANS):
10551 return fold_builtin_nan (arg0, type, false);
10553 CASE_FLT_FN (BUILT_IN_FLOOR):
10554 return fold_builtin_floor (loc, fndecl, arg0);
10556 CASE_FLT_FN (BUILT_IN_CEIL):
10557 return fold_builtin_ceil (loc, fndecl, arg0);
10559 CASE_FLT_FN (BUILT_IN_TRUNC):
10560 return fold_builtin_trunc (loc, fndecl, arg0);
10562 CASE_FLT_FN (BUILT_IN_ROUND):
10563 return fold_builtin_round (loc, fndecl, arg0);
10565 CASE_FLT_FN (BUILT_IN_NEARBYINT):
10566 CASE_FLT_FN (BUILT_IN_RINT):
10567 return fold_trunc_transparent_mathfn (loc, fndecl, arg0);
10569 CASE_FLT_FN (BUILT_IN_ICEIL):
10570 CASE_FLT_FN (BUILT_IN_LCEIL):
10571 CASE_FLT_FN (BUILT_IN_LLCEIL):
10572 CASE_FLT_FN (BUILT_IN_LFLOOR):
10573 CASE_FLT_FN (BUILT_IN_IFLOOR):
10574 CASE_FLT_FN (BUILT_IN_LLFLOOR):
10575 CASE_FLT_FN (BUILT_IN_IROUND):
10576 CASE_FLT_FN (BUILT_IN_LROUND):
10577 CASE_FLT_FN (BUILT_IN_LLROUND):
10578 return fold_builtin_int_roundingfn (loc, fndecl, arg0);
10580 CASE_FLT_FN (BUILT_IN_IRINT):
10581 CASE_FLT_FN (BUILT_IN_LRINT):
10582 CASE_FLT_FN (BUILT_IN_LLRINT):
10583 return fold_fixed_mathfn (loc, fndecl, arg0);
10585 case BUILT_IN_BSWAP32:
10586 case BUILT_IN_BSWAP64:
10587 return fold_builtin_bswap (fndecl, arg0);
10589 CASE_INT_FN (BUILT_IN_FFS):
10590 CASE_INT_FN (BUILT_IN_CLZ):
10591 CASE_INT_FN (BUILT_IN_CTZ):
10592 CASE_INT_FN (BUILT_IN_CLRSB):
10593 CASE_INT_FN (BUILT_IN_POPCOUNT):
10594 CASE_INT_FN (BUILT_IN_PARITY):
10595 return fold_builtin_bitop (fndecl, arg0);
10597 CASE_FLT_FN (BUILT_IN_SIGNBIT):
10598 return fold_builtin_signbit (loc, arg0, type);
10600 CASE_FLT_FN (BUILT_IN_SIGNIFICAND):
10601 return fold_builtin_significand (loc, arg0, type);
10603 CASE_FLT_FN (BUILT_IN_ILOGB):
10604 CASE_FLT_FN (BUILT_IN_LOGB):
10605 return fold_builtin_logb (loc, arg0, type);
10607 case BUILT_IN_ISASCII:
10608 return fold_builtin_isascii (loc, arg0);
10610 case BUILT_IN_TOASCII:
10611 return fold_builtin_toascii (loc, arg0);
10613 case BUILT_IN_ISDIGIT:
10614 return fold_builtin_isdigit (loc, arg0);
10616 CASE_FLT_FN (BUILT_IN_FINITE):
10617 case BUILT_IN_FINITED32:
10618 case BUILT_IN_FINITED64:
10619 case BUILT_IN_FINITED128:
10620 case BUILT_IN_ISFINITE:
10622 tree ret = fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISFINITE);
10625 return fold_builtin_interclass_mathfn (loc, fndecl, arg0);
10628 CASE_FLT_FN (BUILT_IN_ISINF):
10629 case BUILT_IN_ISINFD32:
10630 case BUILT_IN_ISINFD64:
10631 case BUILT_IN_ISINFD128:
10633 tree ret = fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISINF);
10636 return fold_builtin_interclass_mathfn (loc, fndecl, arg0);
10639 case BUILT_IN_ISNORMAL:
10640 return fold_builtin_interclass_mathfn (loc, fndecl, arg0);
10642 case BUILT_IN_ISINF_SIGN:
10643 return fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISINF_SIGN);
10645 CASE_FLT_FN (BUILT_IN_ISNAN):
10646 case BUILT_IN_ISNAND32:
10647 case BUILT_IN_ISNAND64:
10648 case BUILT_IN_ISNAND128:
10649 return fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISNAN);
10651 case BUILT_IN_PRINTF:
10652 case BUILT_IN_PRINTF_UNLOCKED:
10653 case BUILT_IN_VPRINTF:
10654 return fold_builtin_printf (loc, fndecl, arg0, NULL_TREE, ignore, fcode);
10656 case BUILT_IN_FREE:
10657 if (integer_zerop (arg0))
10658 return build_empty_stmt (loc);
10669 /* Fold a call to built-in function FNDECL with 2 arguments, ARG0 and ARG1.
10670 IGNORE is true if the result of the function call is ignored. This
10671 function returns NULL_TREE if no simplification was possible. */
10674 fold_builtin_2 (location_t loc, tree fndecl, tree arg0, tree arg1, bool ignore)
10676 tree type = TREE_TYPE (TREE_TYPE (fndecl));
10677 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
10681 CASE_FLT_FN (BUILT_IN_JN):
10682 if (validate_arg (arg0, INTEGER_TYPE)
10683 && validate_arg (arg1, REAL_TYPE))
10684 return do_mpfr_bessel_n (arg0, arg1, type, mpfr_jn, NULL, 0);
10687 CASE_FLT_FN (BUILT_IN_YN):
10688 if (validate_arg (arg0, INTEGER_TYPE)
10689 && validate_arg (arg1, REAL_TYPE))
10690 return do_mpfr_bessel_n (arg0, arg1, type, mpfr_yn,
10694 CASE_FLT_FN (BUILT_IN_DREM):
10695 CASE_FLT_FN (BUILT_IN_REMAINDER):
10696 if (validate_arg (arg0, REAL_TYPE)
10697 && validate_arg(arg1, REAL_TYPE))
10698 return do_mpfr_arg2 (arg0, arg1, type, mpfr_remainder);
10701 CASE_FLT_FN_REENT (BUILT_IN_GAMMA): /* GAMMA_R */
10702 CASE_FLT_FN_REENT (BUILT_IN_LGAMMA): /* LGAMMA_R */
10703 if (validate_arg (arg0, REAL_TYPE)
10704 && validate_arg(arg1, POINTER_TYPE))
10705 return do_mpfr_lgamma_r (arg0, arg1, type);
10708 CASE_FLT_FN (BUILT_IN_ATAN2):
10709 if (validate_arg (arg0, REAL_TYPE)
10710 && validate_arg(arg1, REAL_TYPE))
10711 return do_mpfr_arg2 (arg0, arg1, type, mpfr_atan2);
10714 CASE_FLT_FN (BUILT_IN_FDIM):
10715 if (validate_arg (arg0, REAL_TYPE)
10716 && validate_arg(arg1, REAL_TYPE))
10717 return do_mpfr_arg2 (arg0, arg1, type, mpfr_dim);
10720 CASE_FLT_FN (BUILT_IN_HYPOT):
10721 return fold_builtin_hypot (loc, fndecl, arg0, arg1, type);
10723 CASE_FLT_FN (BUILT_IN_CPOW):
10724 if (validate_arg (arg0, COMPLEX_TYPE)
10725 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE
10726 && validate_arg (arg1, COMPLEX_TYPE)
10727 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg1))) == REAL_TYPE)
10728 return do_mpc_arg2 (arg0, arg1, type, /*do_nonfinite=*/ 0, mpc_pow);
10731 CASE_FLT_FN (BUILT_IN_LDEXP):
10732 return fold_builtin_load_exponent (loc, arg0, arg1, type, /*ldexp=*/true);
10733 CASE_FLT_FN (BUILT_IN_SCALBN):
10734 CASE_FLT_FN (BUILT_IN_SCALBLN):
10735 return fold_builtin_load_exponent (loc, arg0, arg1,
10736 type, /*ldexp=*/false);
10738 CASE_FLT_FN (BUILT_IN_FREXP):
10739 return fold_builtin_frexp (loc, arg0, arg1, type);
10741 CASE_FLT_FN (BUILT_IN_MODF):
10742 return fold_builtin_modf (loc, arg0, arg1, type);
10744 case BUILT_IN_BZERO:
10745 return fold_builtin_bzero (loc, arg0, arg1, ignore);
10747 case BUILT_IN_FPUTS:
10748 return fold_builtin_fputs (loc, arg0, arg1, ignore, false, NULL_TREE);
10750 case BUILT_IN_FPUTS_UNLOCKED:
10751 return fold_builtin_fputs (loc, arg0, arg1, ignore, true, NULL_TREE);
10753 case BUILT_IN_STRSTR:
10754 return fold_builtin_strstr (loc, arg0, arg1, type);
10756 case BUILT_IN_STRCAT:
10757 return fold_builtin_strcat (loc, arg0, arg1);
10759 case BUILT_IN_STRSPN:
10760 return fold_builtin_strspn (loc, arg0, arg1);
10762 case BUILT_IN_STRCSPN:
10763 return fold_builtin_strcspn (loc, arg0, arg1);
10765 case BUILT_IN_STRCHR:
10766 case BUILT_IN_INDEX:
10767 return fold_builtin_strchr (loc, arg0, arg1, type);
10769 case BUILT_IN_STRRCHR:
10770 case BUILT_IN_RINDEX:
10771 return fold_builtin_strrchr (loc, arg0, arg1, type);
10773 case BUILT_IN_STRCPY:
10774 return fold_builtin_strcpy (loc, fndecl, arg0, arg1, NULL_TREE);
10776 case BUILT_IN_STPCPY:
10779 tree fn = builtin_decl_implicit (BUILT_IN_STRCPY);
10783 return build_call_expr_loc (loc, fn, 2, arg0, arg1);
10786 return fold_builtin_stpcpy (loc, fndecl, arg0, arg1);
10789 case BUILT_IN_STRCMP:
10790 return fold_builtin_strcmp (loc, arg0, arg1);
10792 case BUILT_IN_STRPBRK:
10793 return fold_builtin_strpbrk (loc, arg0, arg1, type);
10795 case BUILT_IN_EXPECT:
10796 return fold_builtin_expect (loc, arg0, arg1);
10798 CASE_FLT_FN (BUILT_IN_POW):
10799 return fold_builtin_pow (loc, fndecl, arg0, arg1, type);
10801 CASE_FLT_FN (BUILT_IN_POWI):
10802 return fold_builtin_powi (loc, fndecl, arg0, arg1, type);
10804 CASE_FLT_FN (BUILT_IN_COPYSIGN):
10805 return fold_builtin_copysign (loc, fndecl, arg0, arg1, type);
10807 CASE_FLT_FN (BUILT_IN_FMIN):
10808 return fold_builtin_fmin_fmax (loc, arg0, arg1, type, /*max=*/false);
10810 CASE_FLT_FN (BUILT_IN_FMAX):
10811 return fold_builtin_fmin_fmax (loc, arg0, arg1, type, /*max=*/true);
10813 case BUILT_IN_ISGREATER:
10814 return fold_builtin_unordered_cmp (loc, fndecl,
10815 arg0, arg1, UNLE_EXPR, LE_EXPR);
10816 case BUILT_IN_ISGREATEREQUAL:
10817 return fold_builtin_unordered_cmp (loc, fndecl,
10818 arg0, arg1, UNLT_EXPR, LT_EXPR);
10819 case BUILT_IN_ISLESS:
10820 return fold_builtin_unordered_cmp (loc, fndecl,
10821 arg0, arg1, UNGE_EXPR, GE_EXPR);
10822 case BUILT_IN_ISLESSEQUAL:
10823 return fold_builtin_unordered_cmp (loc, fndecl,
10824 arg0, arg1, UNGT_EXPR, GT_EXPR);
10825 case BUILT_IN_ISLESSGREATER:
10826 return fold_builtin_unordered_cmp (loc, fndecl,
10827 arg0, arg1, UNEQ_EXPR, EQ_EXPR);
10828 case BUILT_IN_ISUNORDERED:
10829 return fold_builtin_unordered_cmp (loc, fndecl,
10830 arg0, arg1, UNORDERED_EXPR,
10833 /* We do the folding for va_start in the expander. */
10834 case BUILT_IN_VA_START:
10837 case BUILT_IN_SPRINTF:
10838 return fold_builtin_sprintf (loc, arg0, arg1, NULL_TREE, ignore);
10840 case BUILT_IN_OBJECT_SIZE:
10841 return fold_builtin_object_size (arg0, arg1);
10843 case BUILT_IN_PRINTF:
10844 case BUILT_IN_PRINTF_UNLOCKED:
10845 case BUILT_IN_VPRINTF:
10846 return fold_builtin_printf (loc, fndecl, arg0, arg1, ignore, fcode);
10848 case BUILT_IN_PRINTF_CHK:
10849 case BUILT_IN_VPRINTF_CHK:
10850 if (!validate_arg (arg0, INTEGER_TYPE)
10851 || TREE_SIDE_EFFECTS (arg0))
10854 return fold_builtin_printf (loc, fndecl,
10855 arg1, NULL_TREE, ignore, fcode);
10858 case BUILT_IN_FPRINTF:
10859 case BUILT_IN_FPRINTF_UNLOCKED:
10860 case BUILT_IN_VFPRINTF:
10861 return fold_builtin_fprintf (loc, fndecl, arg0, arg1, NULL_TREE,
10864 case BUILT_IN_ATOMIC_ALWAYS_LOCK_FREE:
10865 return fold_builtin_atomic_always_lock_free (arg0, arg1);
10867 case BUILT_IN_ATOMIC_IS_LOCK_FREE:
10868 return fold_builtin_atomic_is_lock_free (arg0, arg1);
10876 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
10877 and ARG2. IGNORE is true if the result of the function call is ignored.
10878 This function returns NULL_TREE if no simplification was possible. */
10881 fold_builtin_3 (location_t loc, tree fndecl,
10882 tree arg0, tree arg1, tree arg2, bool ignore)
10884 tree type = TREE_TYPE (TREE_TYPE (fndecl));
10885 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
10889 CASE_FLT_FN (BUILT_IN_SINCOS):
10890 return fold_builtin_sincos (loc, arg0, arg1, arg2);
10892 CASE_FLT_FN (BUILT_IN_FMA):
10893 return fold_builtin_fma (loc, arg0, arg1, arg2, type);
10896 CASE_FLT_FN (BUILT_IN_REMQUO):
10897 if (validate_arg (arg0, REAL_TYPE)
10898 && validate_arg(arg1, REAL_TYPE)
10899 && validate_arg(arg2, POINTER_TYPE))
10900 return do_mpfr_remquo (arg0, arg1, arg2);
10903 case BUILT_IN_MEMSET:
10904 return fold_builtin_memset (loc, arg0, arg1, arg2, type, ignore);
10906 case BUILT_IN_BCOPY:
10907 return fold_builtin_memory_op (loc, arg1, arg0, arg2,
10908 void_type_node, true, /*endp=*/3);
10910 case BUILT_IN_MEMCPY:
10911 return fold_builtin_memory_op (loc, arg0, arg1, arg2,
10912 type, ignore, /*endp=*/0);
10914 case BUILT_IN_MEMPCPY:
10915 return fold_builtin_memory_op (loc, arg0, arg1, arg2,
10916 type, ignore, /*endp=*/1);
10918 case BUILT_IN_MEMMOVE:
10919 return fold_builtin_memory_op (loc, arg0, arg1, arg2,
10920 type, ignore, /*endp=*/3);
10922 case BUILT_IN_STRNCAT:
10923 return fold_builtin_strncat (loc, arg0, arg1, arg2);
10925 case BUILT_IN_STRNCPY:
10926 return fold_builtin_strncpy (loc, fndecl, arg0, arg1, arg2, NULL_TREE);
10928 case BUILT_IN_STRNCMP:
10929 return fold_builtin_strncmp (loc, arg0, arg1, arg2);
10931 case BUILT_IN_MEMCHR:
10932 return fold_builtin_memchr (loc, arg0, arg1, arg2, type);
10934 case BUILT_IN_BCMP:
10935 case BUILT_IN_MEMCMP:
10936 return fold_builtin_memcmp (loc, arg0, arg1, arg2);;
10938 case BUILT_IN_SPRINTF:
10939 return fold_builtin_sprintf (loc, arg0, arg1, arg2, ignore);
10941 case BUILT_IN_SNPRINTF:
10942 return fold_builtin_snprintf (loc, arg0, arg1, arg2, NULL_TREE, ignore);
10944 case BUILT_IN_STRCPY_CHK:
10945 case BUILT_IN_STPCPY_CHK:
10946 return fold_builtin_stxcpy_chk (loc, fndecl, arg0, arg1, arg2, NULL_TREE,
10949 case BUILT_IN_STRCAT_CHK:
10950 return fold_builtin_strcat_chk (loc, fndecl, arg0, arg1, arg2);
10952 case BUILT_IN_PRINTF_CHK:
10953 case BUILT_IN_VPRINTF_CHK:
10954 if (!validate_arg (arg0, INTEGER_TYPE)
10955 || TREE_SIDE_EFFECTS (arg0))
10958 return fold_builtin_printf (loc, fndecl, arg1, arg2, ignore, fcode);
10961 case BUILT_IN_FPRINTF:
10962 case BUILT_IN_FPRINTF_UNLOCKED:
10963 case BUILT_IN_VFPRINTF:
10964 return fold_builtin_fprintf (loc, fndecl, arg0, arg1, arg2,
10967 case BUILT_IN_FPRINTF_CHK:
10968 case BUILT_IN_VFPRINTF_CHK:
10969 if (!validate_arg (arg1, INTEGER_TYPE)
10970 || TREE_SIDE_EFFECTS (arg1))
10973 return fold_builtin_fprintf (loc, fndecl, arg0, arg2, NULL_TREE,
10982 /* Fold a call to built-in function FNDECL with 4 arguments, ARG0, ARG1,
10983 ARG2, and ARG3. IGNORE is true if the result of the function call is
10984 ignored. This function returns NULL_TREE if no simplification was
10988 fold_builtin_4 (location_t loc, tree fndecl,
10989 tree arg0, tree arg1, tree arg2, tree arg3, bool ignore)
10991 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
10995 case BUILT_IN_MEMCPY_CHK:
10996 case BUILT_IN_MEMPCPY_CHK:
10997 case BUILT_IN_MEMMOVE_CHK:
10998 case BUILT_IN_MEMSET_CHK:
10999 return fold_builtin_memory_chk (loc, fndecl, arg0, arg1, arg2, arg3,
11001 DECL_FUNCTION_CODE (fndecl));
11003 case BUILT_IN_STRNCPY_CHK:
11004 case BUILT_IN_STPNCPY_CHK:
11005 return fold_builtin_stxncpy_chk (loc, arg0, arg1, arg2, arg3, NULL_TREE,
11008 case BUILT_IN_STRNCAT_CHK:
11009 return fold_builtin_strncat_chk (loc, fndecl, arg0, arg1, arg2, arg3);
11011 case BUILT_IN_SNPRINTF:
11012 return fold_builtin_snprintf (loc, arg0, arg1, arg2, arg3, ignore);
11014 case BUILT_IN_FPRINTF_CHK:
11015 case BUILT_IN_VFPRINTF_CHK:
11016 if (!validate_arg (arg1, INTEGER_TYPE)
11017 || TREE_SIDE_EFFECTS (arg1))
11020 return fold_builtin_fprintf (loc, fndecl, arg0, arg2, arg3,
11030 /* Fold a call to built-in function FNDECL. ARGS is an array of NARGS
11031 arguments, where NARGS <= 4. IGNORE is true if the result of the
11032 function call is ignored. This function returns NULL_TREE if no
11033 simplification was possible. Note that this only folds builtins with
11034 fixed argument patterns. Foldings that do varargs-to-varargs
11035 transformations, or that match calls with more than 4 arguments,
11036 need to be handled with fold_builtin_varargs instead. */
11038 #define MAX_ARGS_TO_FOLD_BUILTIN 4
11041 fold_builtin_n (location_t loc, tree fndecl, tree *args, int nargs, bool ignore)
11043 tree ret = NULL_TREE;
11048 ret = fold_builtin_0 (loc, fndecl, ignore);
11051 ret = fold_builtin_1 (loc, fndecl, args[0], ignore);
11054 ret = fold_builtin_2 (loc, fndecl, args[0], args[1], ignore);
11057 ret = fold_builtin_3 (loc, fndecl, args[0], args[1], args[2], ignore);
11060 ret = fold_builtin_4 (loc, fndecl, args[0], args[1], args[2], args[3],
11068 ret = build1 (NOP_EXPR, TREE_TYPE (ret), ret);
11069 SET_EXPR_LOCATION (ret, loc);
11070 TREE_NO_WARNING (ret) = 1;
11076 /* Builtins with folding operations that operate on "..." arguments
11077 need special handling; we need to store the arguments in a convenient
11078 data structure before attempting any folding. Fortunately there are
11079 only a few builtins that fall into this category. FNDECL is the
11080 function, EXP is the CALL_EXPR for the call, and IGNORE is true if the
11081 result of the function call is ignored. */
11084 fold_builtin_varargs (location_t loc, tree fndecl, tree exp,
11085 bool ignore ATTRIBUTE_UNUSED)
11087 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
11088 tree ret = NULL_TREE;
11092 case BUILT_IN_SPRINTF_CHK:
11093 case BUILT_IN_VSPRINTF_CHK:
11094 ret = fold_builtin_sprintf_chk (loc, exp, fcode);
11097 case BUILT_IN_SNPRINTF_CHK:
11098 case BUILT_IN_VSNPRINTF_CHK:
11099 ret = fold_builtin_snprintf_chk (loc, exp, NULL_TREE, fcode);
11102 case BUILT_IN_FPCLASSIFY:
11103 ret = fold_builtin_fpclassify (loc, exp);
11111 ret = build1 (NOP_EXPR, TREE_TYPE (ret), ret);
11112 SET_EXPR_LOCATION (ret, loc);
11113 TREE_NO_WARNING (ret) = 1;
11119 /* Return true if FNDECL shouldn't be folded right now.
11120 If a built-in function has an inline attribute always_inline
11121 wrapper, defer folding it after always_inline functions have
11122 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
11123 might not be performed. */
11126 avoid_folding_inline_builtin (tree fndecl)
11128 return (DECL_DECLARED_INLINE_P (fndecl)
11129 && DECL_DISREGARD_INLINE_LIMITS (fndecl)
11131 && !cfun->always_inline_functions_inlined
11132 && lookup_attribute ("always_inline", DECL_ATTRIBUTES (fndecl)));
11135 /* A wrapper function for builtin folding that prevents warnings for
11136 "statement without effect" and the like, caused by removing the
11137 call node earlier than the warning is generated. */
11140 fold_call_expr (location_t loc, tree exp, bool ignore)
11142 tree ret = NULL_TREE;
11143 tree fndecl = get_callee_fndecl (exp);
11145 && TREE_CODE (fndecl) == FUNCTION_DECL
11146 && DECL_BUILT_IN (fndecl)
11147 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
11148 yet. Defer folding until we see all the arguments
11149 (after inlining). */
11150 && !CALL_EXPR_VA_ARG_PACK (exp))
11152 int nargs = call_expr_nargs (exp);
11154 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
11155 instead last argument is __builtin_va_arg_pack (). Defer folding
11156 even in that case, until arguments are finalized. */
11157 if (nargs && TREE_CODE (CALL_EXPR_ARG (exp, nargs - 1)) == CALL_EXPR)
11159 tree fndecl2 = get_callee_fndecl (CALL_EXPR_ARG (exp, nargs - 1));
11161 && TREE_CODE (fndecl2) == FUNCTION_DECL
11162 && DECL_BUILT_IN_CLASS (fndecl2) == BUILT_IN_NORMAL
11163 && DECL_FUNCTION_CODE (fndecl2) == BUILT_IN_VA_ARG_PACK)
11167 if (avoid_folding_inline_builtin (fndecl))
11170 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
11171 return targetm.fold_builtin (fndecl, call_expr_nargs (exp),
11172 CALL_EXPR_ARGP (exp), ignore);
11175 if (nargs <= MAX_ARGS_TO_FOLD_BUILTIN)
11177 tree *args = CALL_EXPR_ARGP (exp);
11178 ret = fold_builtin_n (loc, fndecl, args, nargs, ignore);
11181 ret = fold_builtin_varargs (loc, fndecl, exp, ignore);
11189 /* Conveniently construct a function call expression. FNDECL names the
11190 function to be called and N arguments are passed in the array
11194 build_call_expr_loc_array (location_t loc, tree fndecl, int n, tree *argarray)
11196 tree fntype = TREE_TYPE (fndecl);
11197 tree fn = build1 (ADDR_EXPR, build_pointer_type (fntype), fndecl);
11199 return fold_builtin_call_array (loc, TREE_TYPE (fntype), fn, n, argarray);
11202 /* Conveniently construct a function call expression. FNDECL names the
11203 function to be called and the arguments are passed in the vector
11207 build_call_expr_loc_vec (location_t loc, tree fndecl, VEC(tree,gc) *vec)
11209 return build_call_expr_loc_array (loc, fndecl, VEC_length (tree, vec),
11210 VEC_address (tree, vec));
11214 /* Conveniently construct a function call expression. FNDECL names the
11215 function to be called, N is the number of arguments, and the "..."
11216 parameters are the argument expressions. */
11219 build_call_expr_loc (location_t loc, tree fndecl, int n, ...)
11222 tree *argarray = XALLOCAVEC (tree, n);
11226 for (i = 0; i < n; i++)
11227 argarray[i] = va_arg (ap, tree);
11229 return build_call_expr_loc_array (loc, fndecl, n, argarray);
11232 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
11233 varargs macros aren't supported by all bootstrap compilers. */
11236 build_call_expr (tree fndecl, int n, ...)
11239 tree *argarray = XALLOCAVEC (tree, n);
11243 for (i = 0; i < n; i++)
11244 argarray[i] = va_arg (ap, tree);
11246 return build_call_expr_loc_array (UNKNOWN_LOCATION, fndecl, n, argarray);
11249 /* Construct a CALL_EXPR with type TYPE with FN as the function expression.
11250 N arguments are passed in the array ARGARRAY. */
11253 fold_builtin_call_array (location_t loc, tree type,
11258 tree ret = NULL_TREE;
11261 if (TREE_CODE (fn) == ADDR_EXPR)
11263 tree fndecl = TREE_OPERAND (fn, 0);
11264 if (TREE_CODE (fndecl) == FUNCTION_DECL
11265 && DECL_BUILT_IN (fndecl))
11267 /* If last argument is __builtin_va_arg_pack (), arguments to this
11268 function are not finalized yet. Defer folding until they are. */
11269 if (n && TREE_CODE (argarray[n - 1]) == CALL_EXPR)
11271 tree fndecl2 = get_callee_fndecl (argarray[n - 1]);
11273 && TREE_CODE (fndecl2) == FUNCTION_DECL
11274 && DECL_BUILT_IN_CLASS (fndecl2) == BUILT_IN_NORMAL
11275 && DECL_FUNCTION_CODE (fndecl2) == BUILT_IN_VA_ARG_PACK)
11276 return build_call_array_loc (loc, type, fn, n, argarray);
11278 if (avoid_folding_inline_builtin (fndecl))
11279 return build_call_array_loc (loc, type, fn, n, argarray);
11280 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
11282 ret = targetm.fold_builtin (fndecl, n, argarray, false);
11286 return build_call_array_loc (loc, type, fn, n, argarray);
11288 else if (n <= MAX_ARGS_TO_FOLD_BUILTIN)
11290 /* First try the transformations that don't require consing up
11292 ret = fold_builtin_n (loc, fndecl, argarray, n, false);
11297 /* If we got this far, we need to build an exp. */
11298 exp = build_call_array_loc (loc, type, fn, n, argarray);
11299 ret = fold_builtin_varargs (loc, fndecl, exp, false);
11300 return ret ? ret : exp;
11304 return build_call_array_loc (loc, type, fn, n, argarray);
11307 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
11308 list ARGS along with N new arguments in NEWARGS. SKIP is the number
11309 of arguments in ARGS to be omitted. OLDNARGS is the number of
11310 elements in ARGS. */
11313 rewrite_call_expr_valist (location_t loc, int oldnargs, tree *args,
11314 int skip, tree fndecl, int n, va_list newargs)
11316 int nargs = oldnargs - skip + n;
11323 buffer = XALLOCAVEC (tree, nargs);
11324 for (i = 0; i < n; i++)
11325 buffer[i] = va_arg (newargs, tree);
11326 for (j = skip; j < oldnargs; j++, i++)
11327 buffer[i] = args[j];
11330 buffer = args + skip;
11332 return build_call_expr_loc_array (loc, fndecl, nargs, buffer);
11335 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
11336 list ARGS along with N new arguments specified as the "..."
11337 parameters. SKIP is the number of arguments in ARGS to be omitted.
11338 OLDNARGS is the number of elements in ARGS. */
11341 rewrite_call_expr_array (location_t loc, int oldnargs, tree *args,
11342 int skip, tree fndecl, int n, ...)
11348 t = rewrite_call_expr_valist (loc, oldnargs, args, skip, fndecl, n, ap);
11354 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
11355 along with N new arguments specified as the "..." parameters. SKIP
11356 is the number of arguments in EXP to be omitted. This function is used
11357 to do varargs-to-varargs transformations. */
11360 rewrite_call_expr (location_t loc, tree exp, int skip, tree fndecl, int n, ...)
11366 t = rewrite_call_expr_valist (loc, call_expr_nargs (exp),
11367 CALL_EXPR_ARGP (exp), skip, fndecl, n, ap);
11373 /* Validate a single argument ARG against a tree code CODE representing
11377 validate_arg (const_tree arg, enum tree_code code)
11381 else if (code == POINTER_TYPE)
11382 return POINTER_TYPE_P (TREE_TYPE (arg));
11383 else if (code == INTEGER_TYPE)
11384 return INTEGRAL_TYPE_P (TREE_TYPE (arg));
11385 return code == TREE_CODE (TREE_TYPE (arg));
11388 /* This function validates the types of a function call argument list
11389 against a specified list of tree_codes. If the last specifier is a 0,
11390 that represents an ellipses, otherwise the last specifier must be a
11393 This is the GIMPLE version of validate_arglist. Eventually we want to
11394 completely convert builtins.c to work from GIMPLEs and the tree based
11395 validate_arglist will then be removed. */
11398 validate_gimple_arglist (const_gimple call, ...)
11400 enum tree_code code;
11406 va_start (ap, call);
11411 code = (enum tree_code) va_arg (ap, int);
11415 /* This signifies an ellipses, any further arguments are all ok. */
11419 /* This signifies an endlink, if no arguments remain, return
11420 true, otherwise return false. */
11421 res = (i == gimple_call_num_args (call));
11424 /* If no parameters remain or the parameter's code does not
11425 match the specified code, return false. Otherwise continue
11426 checking any remaining arguments. */
11427 arg = gimple_call_arg (call, i++);
11428 if (!validate_arg (arg, code))
11435 /* We need gotos here since we can only have one VA_CLOSE in a
11443 /* This function validates the types of a function call argument list
11444 against a specified list of tree_codes. If the last specifier is a 0,
11445 that represents an ellipses, otherwise the last specifier must be a
11449 validate_arglist (const_tree callexpr, ...)
11451 enum tree_code code;
11454 const_call_expr_arg_iterator iter;
11457 va_start (ap, callexpr);
11458 init_const_call_expr_arg_iterator (callexpr, &iter);
11462 code = (enum tree_code) va_arg (ap, int);
11466 /* This signifies an ellipses, any further arguments are all ok. */
11470 /* This signifies an endlink, if no arguments remain, return
11471 true, otherwise return false. */
11472 res = !more_const_call_expr_args_p (&iter);
11475 /* If no parameters remain or the parameter's code does not
11476 match the specified code, return false. Otherwise continue
11477 checking any remaining arguments. */
11478 arg = next_const_call_expr_arg (&iter);
11479 if (!validate_arg (arg, code))
11486 /* We need gotos here since we can only have one VA_CLOSE in a
11494 /* Default target-specific builtin expander that does nothing. */
11497 default_expand_builtin (tree exp ATTRIBUTE_UNUSED,
11498 rtx target ATTRIBUTE_UNUSED,
11499 rtx subtarget ATTRIBUTE_UNUSED,
11500 enum machine_mode mode ATTRIBUTE_UNUSED,
11501 int ignore ATTRIBUTE_UNUSED)
11506 /* Returns true is EXP represents data that would potentially reside
11507 in a readonly section. */
11510 readonly_data_expr (tree exp)
11514 if (TREE_CODE (exp) != ADDR_EXPR)
11517 exp = get_base_address (TREE_OPERAND (exp, 0));
11521 /* Make sure we call decl_readonly_section only for trees it
11522 can handle (since it returns true for everything it doesn't
11524 if (TREE_CODE (exp) == STRING_CST
11525 || TREE_CODE (exp) == CONSTRUCTOR
11526 || (TREE_CODE (exp) == VAR_DECL && TREE_STATIC (exp)))
11527 return decl_readonly_section (exp, 0);
11532 /* Simplify a call to the strstr builtin. S1 and S2 are the arguments
11533 to the call, and TYPE is its return type.
11535 Return NULL_TREE if no simplification was possible, otherwise return the
11536 simplified form of the call as a tree.
11538 The simplified form may be a constant or other expression which
11539 computes the same value, but in a more efficient manner (including
11540 calls to other builtin functions).
11542 The call may contain arguments which need to be evaluated, but
11543 which are not useful to determine the result of the call. In
11544 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11545 COMPOUND_EXPR will be an argument which must be evaluated.
11546 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11547 COMPOUND_EXPR in the chain will contain the tree for the simplified
11548 form of the builtin function call. */
11551 fold_builtin_strstr (location_t loc, tree s1, tree s2, tree type)
11553 if (!validate_arg (s1, POINTER_TYPE)
11554 || !validate_arg (s2, POINTER_TYPE))
11559 const char *p1, *p2;
11561 p2 = c_getstr (s2);
11565 p1 = c_getstr (s1);
11568 const char *r = strstr (p1, p2);
11572 return build_int_cst (TREE_TYPE (s1), 0);
11574 /* Return an offset into the constant string argument. */
11575 tem = fold_build_pointer_plus_hwi_loc (loc, s1, r - p1);
11576 return fold_convert_loc (loc, type, tem);
11579 /* The argument is const char *, and the result is char *, so we need
11580 a type conversion here to avoid a warning. */
11582 return fold_convert_loc (loc, type, s1);
11587 fn = builtin_decl_implicit (BUILT_IN_STRCHR);
11591 /* New argument list transforming strstr(s1, s2) to
11592 strchr(s1, s2[0]). */
11593 return build_call_expr_loc (loc, fn, 2, s1,
11594 build_int_cst (integer_type_node, p2[0]));
11598 /* Simplify a call to the strchr builtin. S1 and S2 are the arguments to
11599 the call, and TYPE is its return type.
11601 Return NULL_TREE if no simplification was possible, otherwise return the
11602 simplified form of the call as a tree.
11604 The simplified form may be a constant or other expression which
11605 computes the same value, but in a more efficient manner (including
11606 calls to other builtin functions).
11608 The call may contain arguments which need to be evaluated, but
11609 which are not useful to determine the result of the call. In
11610 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11611 COMPOUND_EXPR will be an argument which must be evaluated.
11612 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11613 COMPOUND_EXPR in the chain will contain the tree for the simplified
11614 form of the builtin function call. */
11617 fold_builtin_strchr (location_t loc, tree s1, tree s2, tree type)
11619 if (!validate_arg (s1, POINTER_TYPE)
11620 || !validate_arg (s2, INTEGER_TYPE))
11626 if (TREE_CODE (s2) != INTEGER_CST)
11629 p1 = c_getstr (s1);
11636 if (target_char_cast (s2, &c))
11639 r = strchr (p1, c);
11642 return build_int_cst (TREE_TYPE (s1), 0);
11644 /* Return an offset into the constant string argument. */
11645 tem = fold_build_pointer_plus_hwi_loc (loc, s1, r - p1);
11646 return fold_convert_loc (loc, type, tem);
11652 /* Simplify a call to the strrchr builtin. S1 and S2 are the arguments to
11653 the call, and TYPE is its return type.
11655 Return NULL_TREE if no simplification was possible, otherwise return the
11656 simplified form of the call as a tree.
11658 The simplified form may be a constant or other expression which
11659 computes the same value, but in a more efficient manner (including
11660 calls to other builtin functions).
11662 The call may contain arguments which need to be evaluated, but
11663 which are not useful to determine the result of the call. In
11664 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11665 COMPOUND_EXPR will be an argument which must be evaluated.
11666 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11667 COMPOUND_EXPR in the chain will contain the tree for the simplified
11668 form of the builtin function call. */
11671 fold_builtin_strrchr (location_t loc, tree s1, tree s2, tree type)
11673 if (!validate_arg (s1, POINTER_TYPE)
11674 || !validate_arg (s2, INTEGER_TYPE))
11681 if (TREE_CODE (s2) != INTEGER_CST)
11684 p1 = c_getstr (s1);
11691 if (target_char_cast (s2, &c))
11694 r = strrchr (p1, c);
11697 return build_int_cst (TREE_TYPE (s1), 0);
11699 /* Return an offset into the constant string argument. */
11700 tem = fold_build_pointer_plus_hwi_loc (loc, s1, r - p1);
11701 return fold_convert_loc (loc, type, tem);
11704 if (! integer_zerop (s2))
11707 fn = builtin_decl_implicit (BUILT_IN_STRCHR);
11711 /* Transform strrchr(s1, '\0') to strchr(s1, '\0'). */
11712 return build_call_expr_loc (loc, fn, 2, s1, s2);
11716 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
11717 to the call, and TYPE is its return type.
11719 Return NULL_TREE if no simplification was possible, otherwise return the
11720 simplified form of the call as a tree.
11722 The simplified form may be a constant or other expression which
11723 computes the same value, but in a more efficient manner (including
11724 calls to other builtin functions).
11726 The call may contain arguments which need to be evaluated, but
11727 which are not useful to determine the result of the call. In
11728 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11729 COMPOUND_EXPR will be an argument which must be evaluated.
11730 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11731 COMPOUND_EXPR in the chain will contain the tree for the simplified
11732 form of the builtin function call. */
11735 fold_builtin_strpbrk (location_t loc, tree s1, tree s2, tree type)
11737 if (!validate_arg (s1, POINTER_TYPE)
11738 || !validate_arg (s2, POINTER_TYPE))
11743 const char *p1, *p2;
11745 p2 = c_getstr (s2);
11749 p1 = c_getstr (s1);
11752 const char *r = strpbrk (p1, p2);
11756 return build_int_cst (TREE_TYPE (s1), 0);
11758 /* Return an offset into the constant string argument. */
11759 tem = fold_build_pointer_plus_hwi_loc (loc, s1, r - p1);
11760 return fold_convert_loc (loc, type, tem);
11764 /* strpbrk(x, "") == NULL.
11765 Evaluate and ignore s1 in case it had side-effects. */
11766 return omit_one_operand_loc (loc, TREE_TYPE (s1), integer_zero_node, s1);
11769 return NULL_TREE; /* Really call strpbrk. */
11771 fn = builtin_decl_implicit (BUILT_IN_STRCHR);
11775 /* New argument list transforming strpbrk(s1, s2) to
11776 strchr(s1, s2[0]). */
11777 return build_call_expr_loc (loc, fn, 2, s1,
11778 build_int_cst (integer_type_node, p2[0]));
11782 /* Simplify a call to the strcat builtin. DST and SRC are the arguments
11785 Return NULL_TREE if no simplification was possible, otherwise return the
11786 simplified form of the call as a tree.
11788 The simplified form may be a constant or other expression which
11789 computes the same value, but in a more efficient manner (including
11790 calls to other builtin functions).
11792 The call may contain arguments which need to be evaluated, but
11793 which are not useful to determine the result of the call. In
11794 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11795 COMPOUND_EXPR will be an argument which must be evaluated.
11796 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11797 COMPOUND_EXPR in the chain will contain the tree for the simplified
11798 form of the builtin function call. */
11801 fold_builtin_strcat (location_t loc ATTRIBUTE_UNUSED, tree dst, tree src)
11803 if (!validate_arg (dst, POINTER_TYPE)
11804 || !validate_arg (src, POINTER_TYPE))
11808 const char *p = c_getstr (src);
11810 /* If the string length is zero, return the dst parameter. */
11811 if (p && *p == '\0')
11814 if (optimize_insn_for_speed_p ())
11816 /* See if we can store by pieces into (dst + strlen(dst)). */
11818 tree strlen_fn = builtin_decl_implicit (BUILT_IN_STRLEN);
11819 tree strcpy_fn = builtin_decl_implicit (BUILT_IN_STRCPY);
11821 if (!strlen_fn || !strcpy_fn)
11824 /* If we don't have a movstr we don't want to emit an strcpy
11825 call. We have to do that if the length of the source string
11826 isn't computable (in that case we can use memcpy probably
11827 later expanding to a sequence of mov instructions). If we
11828 have movstr instructions we can emit strcpy calls. */
11831 tree len = c_strlen (src, 1);
11832 if (! len || TREE_SIDE_EFFECTS (len))
11836 /* Stabilize the argument list. */
11837 dst = builtin_save_expr (dst);
11839 /* Create strlen (dst). */
11840 newdst = build_call_expr_loc (loc, strlen_fn, 1, dst);
11841 /* Create (dst p+ strlen (dst)). */
11843 newdst = fold_build_pointer_plus_loc (loc, dst, newdst);
11844 newdst = builtin_save_expr (newdst);
11846 call = build_call_expr_loc (loc, strcpy_fn, 2, newdst, src);
11847 return build2 (COMPOUND_EXPR, TREE_TYPE (dst), call, dst);
11853 /* Simplify a call to the strncat builtin. DST, SRC, and LEN are the
11854 arguments to the call.
11856 Return NULL_TREE if no simplification was possible, otherwise return the
11857 simplified form of the call as a tree.
11859 The simplified form may be a constant or other expression which
11860 computes the same value, but in a more efficient manner (including
11861 calls to other builtin functions).
11863 The call may contain arguments which need to be evaluated, but
11864 which are not useful to determine the result of the call. In
11865 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11866 COMPOUND_EXPR will be an argument which must be evaluated.
11867 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11868 COMPOUND_EXPR in the chain will contain the tree for the simplified
11869 form of the builtin function call. */
11872 fold_builtin_strncat (location_t loc, tree dst, tree src, tree len)
11874 if (!validate_arg (dst, POINTER_TYPE)
11875 || !validate_arg (src, POINTER_TYPE)
11876 || !validate_arg (len, INTEGER_TYPE))
11880 const char *p = c_getstr (src);
11882 /* If the requested length is zero, or the src parameter string
11883 length is zero, return the dst parameter. */
11884 if (integer_zerop (len) || (p && *p == '\0'))
11885 return omit_two_operands_loc (loc, TREE_TYPE (dst), dst, src, len);
11887 /* If the requested len is greater than or equal to the string
11888 length, call strcat. */
11889 if (TREE_CODE (len) == INTEGER_CST && p
11890 && compare_tree_int (len, strlen (p)) >= 0)
11892 tree fn = builtin_decl_implicit (BUILT_IN_STRCAT);
11894 /* If the replacement _DECL isn't initialized, don't do the
11899 return build_call_expr_loc (loc, fn, 2, dst, src);
11905 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
11908 Return NULL_TREE if no simplification was possible, otherwise return the
11909 simplified form of the call as a tree.
11911 The simplified form may be a constant or other expression which
11912 computes the same value, but in a more efficient manner (including
11913 calls to other builtin functions).
11915 The call may contain arguments which need to be evaluated, but
11916 which are not useful to determine the result of the call. In
11917 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11918 COMPOUND_EXPR will be an argument which must be evaluated.
11919 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11920 COMPOUND_EXPR in the chain will contain the tree for the simplified
11921 form of the builtin function call. */
11924 fold_builtin_strspn (location_t loc, tree s1, tree s2)
11926 if (!validate_arg (s1, POINTER_TYPE)
11927 || !validate_arg (s2, POINTER_TYPE))
11931 const char *p1 = c_getstr (s1), *p2 = c_getstr (s2);
11933 /* If both arguments are constants, evaluate at compile-time. */
11936 const size_t r = strspn (p1, p2);
11937 return build_int_cst (size_type_node, r);
11940 /* If either argument is "", return NULL_TREE. */
11941 if ((p1 && *p1 == '\0') || (p2 && *p2 == '\0'))
11942 /* Evaluate and ignore both arguments in case either one has
11944 return omit_two_operands_loc (loc, size_type_node, size_zero_node,
11950 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
11953 Return NULL_TREE if no simplification was possible, otherwise return the
11954 simplified form of the call as a tree.
11956 The simplified form may be a constant or other expression which
11957 computes the same value, but in a more efficient manner (including
11958 calls to other builtin functions).
11960 The call may contain arguments which need to be evaluated, but
11961 which are not useful to determine the result of the call. In
11962 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11963 COMPOUND_EXPR will be an argument which must be evaluated.
11964 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11965 COMPOUND_EXPR in the chain will contain the tree for the simplified
11966 form of the builtin function call. */
11969 fold_builtin_strcspn (location_t loc, tree s1, tree s2)
11971 if (!validate_arg (s1, POINTER_TYPE)
11972 || !validate_arg (s2, POINTER_TYPE))
11976 const char *p1 = c_getstr (s1), *p2 = c_getstr (s2);
11978 /* If both arguments are constants, evaluate at compile-time. */
11981 const size_t r = strcspn (p1, p2);
11982 return build_int_cst (size_type_node, r);
11985 /* If the first argument is "", return NULL_TREE. */
11986 if (p1 && *p1 == '\0')
11988 /* Evaluate and ignore argument s2 in case it has
11990 return omit_one_operand_loc (loc, size_type_node,
11991 size_zero_node, s2);
11994 /* If the second argument is "", return __builtin_strlen(s1). */
11995 if (p2 && *p2 == '\0')
11997 tree fn = builtin_decl_implicit (BUILT_IN_STRLEN);
11999 /* If the replacement _DECL isn't initialized, don't do the
12004 return build_call_expr_loc (loc, fn, 1, s1);
12010 /* Fold a call to the fputs builtin. ARG0 and ARG1 are the arguments
12011 to the call. IGNORE is true if the value returned
12012 by the builtin will be ignored. UNLOCKED is true is true if this
12013 actually a call to fputs_unlocked. If LEN in non-NULL, it represents
12014 the known length of the string. Return NULL_TREE if no simplification
12018 fold_builtin_fputs (location_t loc, tree arg0, tree arg1,
12019 bool ignore, bool unlocked, tree len)
12021 /* If we're using an unlocked function, assume the other unlocked
12022 functions exist explicitly. */
12023 tree const fn_fputc = (unlocked
12024 ? builtin_decl_explicit (BUILT_IN_FPUTC_UNLOCKED)
12025 : builtin_decl_implicit (BUILT_IN_FPUTC));
12026 tree const fn_fwrite = (unlocked
12027 ? builtin_decl_explicit (BUILT_IN_FWRITE_UNLOCKED)
12028 : builtin_decl_implicit (BUILT_IN_FWRITE));
12030 /* If the return value is used, don't do the transformation. */
12034 /* Verify the arguments in the original call. */
12035 if (!validate_arg (arg0, POINTER_TYPE)
12036 || !validate_arg (arg1, POINTER_TYPE))
12040 len = c_strlen (arg0, 0);
12042 /* Get the length of the string passed to fputs. If the length
12043 can't be determined, punt. */
12045 || TREE_CODE (len) != INTEGER_CST)
12048 switch (compare_tree_int (len, 1))
12050 case -1: /* length is 0, delete the call entirely . */
12051 return omit_one_operand_loc (loc, integer_type_node,
12052 integer_zero_node, arg1);;
12054 case 0: /* length is 1, call fputc. */
12056 const char *p = c_getstr (arg0);
12061 return build_call_expr_loc (loc, fn_fputc, 2,
12063 (integer_type_node, p[0]), arg1);
12069 case 1: /* length is greater than 1, call fwrite. */
12071 /* If optimizing for size keep fputs. */
12072 if (optimize_function_for_size_p (cfun))
12074 /* New argument list transforming fputs(string, stream) to
12075 fwrite(string, 1, len, stream). */
12077 return build_call_expr_loc (loc, fn_fwrite, 4, arg0,
12078 size_one_node, len, arg1);
12083 gcc_unreachable ();
12088 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
12089 produced. False otherwise. This is done so that we don't output the error
12090 or warning twice or three times. */
12093 fold_builtin_next_arg (tree exp, bool va_start_p)
12095 tree fntype = TREE_TYPE (current_function_decl);
12096 int nargs = call_expr_nargs (exp);
12099 if (!stdarg_p (fntype))
12101 error ("%<va_start%> used in function with fixed args");
12107 if (va_start_p && (nargs != 2))
12109 error ("wrong number of arguments to function %<va_start%>");
12112 arg = CALL_EXPR_ARG (exp, 1);
12114 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
12115 when we checked the arguments and if needed issued a warning. */
12120 /* Evidently an out of date version of <stdarg.h>; can't validate
12121 va_start's second argument, but can still work as intended. */
12122 warning (0, "%<__builtin_next_arg%> called without an argument");
12125 else if (nargs > 1)
12127 error ("wrong number of arguments to function %<__builtin_next_arg%>");
12130 arg = CALL_EXPR_ARG (exp, 0);
12133 if (TREE_CODE (arg) == SSA_NAME)
12134 arg = SSA_NAME_VAR (arg);
12136 /* We destructively modify the call to be __builtin_va_start (ap, 0)
12137 or __builtin_next_arg (0) the first time we see it, after checking
12138 the arguments and if needed issuing a warning. */
12139 if (!integer_zerop (arg))
12141 tree last_parm = tree_last (DECL_ARGUMENTS (current_function_decl));
12143 /* Strip off all nops for the sake of the comparison. This
12144 is not quite the same as STRIP_NOPS. It does more.
12145 We must also strip off INDIRECT_EXPR for C++ reference
12147 while (CONVERT_EXPR_P (arg)
12148 || TREE_CODE (arg) == INDIRECT_REF)
12149 arg = TREE_OPERAND (arg, 0);
12150 if (arg != last_parm)
12152 /* FIXME: Sometimes with the tree optimizers we can get the
12153 not the last argument even though the user used the last
12154 argument. We just warn and set the arg to be the last
12155 argument so that we will get wrong-code because of
12157 warning (0, "second parameter of %<va_start%> not last named argument");
12160 /* Undefined by C99 7.15.1.4p4 (va_start):
12161 "If the parameter parmN is declared with the register storage
12162 class, with a function or array type, or with a type that is
12163 not compatible with the type that results after application of
12164 the default argument promotions, the behavior is undefined."
12166 else if (DECL_REGISTER (arg))
12167 warning (0, "undefined behaviour when second parameter of "
12168 "%<va_start%> is declared with %<register%> storage");
12170 /* We want to verify the second parameter just once before the tree
12171 optimizers are run and then avoid keeping it in the tree,
12172 as otherwise we could warn even for correct code like:
12173 void foo (int i, ...)
12174 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
12176 CALL_EXPR_ARG (exp, 1) = integer_zero_node;
12178 CALL_EXPR_ARG (exp, 0) = integer_zero_node;
12184 /* Simplify a call to the sprintf builtin with arguments DEST, FMT, and ORIG.
12185 ORIG may be null if this is a 2-argument call. We don't attempt to
12186 simplify calls with more than 3 arguments.
12188 Return NULL_TREE if no simplification was possible, otherwise return the
12189 simplified form of the call as a tree. If IGNORED is true, it means that
12190 the caller does not use the returned value of the function. */
12193 fold_builtin_sprintf (location_t loc, tree dest, tree fmt,
12194 tree orig, int ignored)
12197 const char *fmt_str = NULL;
12199 /* Verify the required arguments in the original call. We deal with two
12200 types of sprintf() calls: 'sprintf (str, fmt)' and
12201 'sprintf (dest, "%s", orig)'. */
12202 if (!validate_arg (dest, POINTER_TYPE)
12203 || !validate_arg (fmt, POINTER_TYPE))
12205 if (orig && !validate_arg (orig, POINTER_TYPE))
12208 /* Check whether the format is a literal string constant. */
12209 fmt_str = c_getstr (fmt);
12210 if (fmt_str == NULL)
12214 retval = NULL_TREE;
12216 if (!init_target_chars ())
12219 /* If the format doesn't contain % args or %%, use strcpy. */
12220 if (strchr (fmt_str, target_percent) == NULL)
12222 tree fn = builtin_decl_implicit (BUILT_IN_STRCPY);
12227 /* Don't optimize sprintf (buf, "abc", ptr++). */
12231 /* Convert sprintf (str, fmt) into strcpy (str, fmt) when
12232 'format' is known to contain no % formats. */
12233 call = build_call_expr_loc (loc, fn, 2, dest, fmt);
12235 retval = build_int_cst (integer_type_node, strlen (fmt_str));
12238 /* If the format is "%s", use strcpy if the result isn't used. */
12239 else if (fmt_str && strcmp (fmt_str, target_percent_s) == 0)
12242 fn = builtin_decl_implicit (BUILT_IN_STRCPY);
12247 /* Don't crash on sprintf (str1, "%s"). */
12251 /* Convert sprintf (str1, "%s", str2) into strcpy (str1, str2). */
12254 retval = c_strlen (orig, 1);
12255 if (!retval || TREE_CODE (retval) != INTEGER_CST)
12258 call = build_call_expr_loc (loc, fn, 2, dest, orig);
12261 if (call && retval)
12263 retval = fold_convert_loc
12264 (loc, TREE_TYPE (TREE_TYPE (builtin_decl_implicit (BUILT_IN_SPRINTF))),
12266 return build2 (COMPOUND_EXPR, TREE_TYPE (retval), call, retval);
12272 /* Simplify a call to the snprintf builtin with arguments DEST, DESTSIZE,
12273 FMT, and ORIG. ORIG may be null if this is a 3-argument call. We don't
12274 attempt to simplify calls with more than 4 arguments.
12276 Return NULL_TREE if no simplification was possible, otherwise return the
12277 simplified form of the call as a tree. If IGNORED is true, it means that
12278 the caller does not use the returned value of the function. */
12281 fold_builtin_snprintf (location_t loc, tree dest, tree destsize, tree fmt,
12282 tree orig, int ignored)
12285 const char *fmt_str = NULL;
12286 unsigned HOST_WIDE_INT destlen;
12288 /* Verify the required arguments in the original call. We deal with two
12289 types of snprintf() calls: 'snprintf (str, cst, fmt)' and
12290 'snprintf (dest, cst, "%s", orig)'. */
12291 if (!validate_arg (dest, POINTER_TYPE)
12292 || !validate_arg (destsize, INTEGER_TYPE)
12293 || !validate_arg (fmt, POINTER_TYPE))
12295 if (orig && !validate_arg (orig, POINTER_TYPE))
12298 if (!host_integerp (destsize, 1))
12301 /* Check whether the format is a literal string constant. */
12302 fmt_str = c_getstr (fmt);
12303 if (fmt_str == NULL)
12307 retval = NULL_TREE;
12309 if (!init_target_chars ())
12312 destlen = tree_low_cst (destsize, 1);
12314 /* If the format doesn't contain % args or %%, use strcpy. */
12315 if (strchr (fmt_str, target_percent) == NULL)
12317 tree fn = builtin_decl_implicit (BUILT_IN_STRCPY);
12318 size_t len = strlen (fmt_str);
12320 /* Don't optimize snprintf (buf, 4, "abc", ptr++). */
12324 /* We could expand this as
12325 memcpy (str, fmt, cst - 1); str[cst - 1] = '\0';
12327 memcpy (str, fmt_with_nul_at_cstm1, cst);
12328 but in the former case that might increase code size
12329 and in the latter case grow .rodata section too much.
12330 So punt for now. */
12331 if (len >= destlen)
12337 /* Convert snprintf (str, cst, fmt) into strcpy (str, fmt) when
12338 'format' is known to contain no % formats and
12339 strlen (fmt) < cst. */
12340 call = build_call_expr_loc (loc, fn, 2, dest, fmt);
12343 retval = build_int_cst (integer_type_node, strlen (fmt_str));
12346 /* If the format is "%s", use strcpy if the result isn't used. */
12347 else if (fmt_str && strcmp (fmt_str, target_percent_s) == 0)
12349 tree fn = builtin_decl_implicit (BUILT_IN_STRCPY);
12350 unsigned HOST_WIDE_INT origlen;
12352 /* Don't crash on snprintf (str1, cst, "%s"). */
12356 retval = c_strlen (orig, 1);
12357 if (!retval || !host_integerp (retval, 1))
12360 origlen = tree_low_cst (retval, 1);
12361 /* We could expand this as
12362 memcpy (str1, str2, cst - 1); str1[cst - 1] = '\0';
12364 memcpy (str1, str2_with_nul_at_cstm1, cst);
12365 but in the former case that might increase code size
12366 and in the latter case grow .rodata section too much.
12367 So punt for now. */
12368 if (origlen >= destlen)
12371 /* Convert snprintf (str1, cst, "%s", str2) into
12372 strcpy (str1, str2) if strlen (str2) < cst. */
12376 call = build_call_expr_loc (loc, fn, 2, dest, orig);
12379 retval = NULL_TREE;
12382 if (call && retval)
12384 tree fn = builtin_decl_explicit (BUILT_IN_SNPRINTF);
12385 retval = fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fn)), retval);
12386 return build2 (COMPOUND_EXPR, TREE_TYPE (retval), call, retval);
12392 /* Expand a call EXP to __builtin_object_size. */
12395 expand_builtin_object_size (tree exp)
12398 int object_size_type;
12399 tree fndecl = get_callee_fndecl (exp);
12401 if (!validate_arglist (exp, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
12403 error ("%Kfirst argument of %D must be a pointer, second integer constant",
12405 expand_builtin_trap ();
12409 ost = CALL_EXPR_ARG (exp, 1);
12412 if (TREE_CODE (ost) != INTEGER_CST
12413 || tree_int_cst_sgn (ost) < 0
12414 || compare_tree_int (ost, 3) > 0)
12416 error ("%Klast argument of %D is not integer constant between 0 and 3",
12418 expand_builtin_trap ();
12422 object_size_type = tree_low_cst (ost, 0);
12424 return object_size_type < 2 ? constm1_rtx : const0_rtx;
12427 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
12428 FCODE is the BUILT_IN_* to use.
12429 Return NULL_RTX if we failed; the caller should emit a normal call,
12430 otherwise try to get the result in TARGET, if convenient (and in
12431 mode MODE if that's convenient). */
12434 expand_builtin_memory_chk (tree exp, rtx target, enum machine_mode mode,
12435 enum built_in_function fcode)
12437 tree dest, src, len, size;
12439 if (!validate_arglist (exp,
12441 fcode == BUILT_IN_MEMSET_CHK
12442 ? INTEGER_TYPE : POINTER_TYPE,
12443 INTEGER_TYPE, INTEGER_TYPE, VOID_TYPE))
12446 dest = CALL_EXPR_ARG (exp, 0);
12447 src = CALL_EXPR_ARG (exp, 1);
12448 len = CALL_EXPR_ARG (exp, 2);
12449 size = CALL_EXPR_ARG (exp, 3);
12451 if (! host_integerp (size, 1))
12454 if (host_integerp (len, 1) || integer_all_onesp (size))
12458 if (! integer_all_onesp (size) && tree_int_cst_lt (size, len))
12460 warning_at (tree_nonartificial_location (exp),
12461 0, "%Kcall to %D will always overflow destination buffer",
12462 exp, get_callee_fndecl (exp));
12467 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
12468 mem{cpy,pcpy,move,set} is available. */
12471 case BUILT_IN_MEMCPY_CHK:
12472 fn = builtin_decl_explicit (BUILT_IN_MEMCPY);
12474 case BUILT_IN_MEMPCPY_CHK:
12475 fn = builtin_decl_explicit (BUILT_IN_MEMPCPY);
12477 case BUILT_IN_MEMMOVE_CHK:
12478 fn = builtin_decl_explicit (BUILT_IN_MEMMOVE);
12480 case BUILT_IN_MEMSET_CHK:
12481 fn = builtin_decl_explicit (BUILT_IN_MEMSET);
12490 fn = build_call_nofold_loc (EXPR_LOCATION (exp), fn, 3, dest, src, len);
12491 gcc_assert (TREE_CODE (fn) == CALL_EXPR);
12492 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
12493 return expand_expr (fn, target, mode, EXPAND_NORMAL);
12495 else if (fcode == BUILT_IN_MEMSET_CHK)
12499 unsigned int dest_align = get_pointer_alignment (dest);
12501 /* If DEST is not a pointer type, call the normal function. */
12502 if (dest_align == 0)
12505 /* If SRC and DEST are the same (and not volatile), do nothing. */
12506 if (operand_equal_p (src, dest, 0))
12510 if (fcode != BUILT_IN_MEMPCPY_CHK)
12512 /* Evaluate and ignore LEN in case it has side-effects. */
12513 expand_expr (len, const0_rtx, VOIDmode, EXPAND_NORMAL);
12514 return expand_expr (dest, target, mode, EXPAND_NORMAL);
12517 expr = fold_build_pointer_plus (dest, len);
12518 return expand_expr (expr, target, mode, EXPAND_NORMAL);
12521 /* __memmove_chk special case. */
12522 if (fcode == BUILT_IN_MEMMOVE_CHK)
12524 unsigned int src_align = get_pointer_alignment (src);
12526 if (src_align == 0)
12529 /* If src is categorized for a readonly section we can use
12530 normal __memcpy_chk. */
12531 if (readonly_data_expr (src))
12533 tree fn = builtin_decl_explicit (BUILT_IN_MEMCPY_CHK);
12536 fn = build_call_nofold_loc (EXPR_LOCATION (exp), fn, 4,
12537 dest, src, len, size);
12538 gcc_assert (TREE_CODE (fn) == CALL_EXPR);
12539 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
12540 return expand_expr (fn, target, mode, EXPAND_NORMAL);
12547 /* Emit warning if a buffer overflow is detected at compile time. */
12550 maybe_emit_chk_warning (tree exp, enum built_in_function fcode)
12554 location_t loc = tree_nonartificial_location (exp);
12558 case BUILT_IN_STRCPY_CHK:
12559 case BUILT_IN_STPCPY_CHK:
12560 /* For __strcat_chk the warning will be emitted only if overflowing
12561 by at least strlen (dest) + 1 bytes. */
12562 case BUILT_IN_STRCAT_CHK:
12563 len = CALL_EXPR_ARG (exp, 1);
12564 size = CALL_EXPR_ARG (exp, 2);
12567 case BUILT_IN_STRNCAT_CHK:
12568 case BUILT_IN_STRNCPY_CHK:
12569 case BUILT_IN_STPNCPY_CHK:
12570 len = CALL_EXPR_ARG (exp, 2);
12571 size = CALL_EXPR_ARG (exp, 3);
12573 case BUILT_IN_SNPRINTF_CHK:
12574 case BUILT_IN_VSNPRINTF_CHK:
12575 len = CALL_EXPR_ARG (exp, 1);
12576 size = CALL_EXPR_ARG (exp, 3);
12579 gcc_unreachable ();
12585 if (! host_integerp (size, 1) || integer_all_onesp (size))
12590 len = c_strlen (len, 1);
12591 if (! len || ! host_integerp (len, 1) || tree_int_cst_lt (len, size))
12594 else if (fcode == BUILT_IN_STRNCAT_CHK)
12596 tree src = CALL_EXPR_ARG (exp, 1);
12597 if (! src || ! host_integerp (len, 1) || tree_int_cst_lt (len, size))
12599 src = c_strlen (src, 1);
12600 if (! src || ! host_integerp (src, 1))
12602 warning_at (loc, 0, "%Kcall to %D might overflow destination buffer",
12603 exp, get_callee_fndecl (exp));
12606 else if (tree_int_cst_lt (src, size))
12609 else if (! host_integerp (len, 1) || ! tree_int_cst_lt (size, len))
12612 warning_at (loc, 0, "%Kcall to %D will always overflow destination buffer",
12613 exp, get_callee_fndecl (exp));
12616 /* Emit warning if a buffer overflow is detected at compile time
12617 in __sprintf_chk/__vsprintf_chk calls. */
12620 maybe_emit_sprintf_chk_warning (tree exp, enum built_in_function fcode)
12622 tree size, len, fmt;
12623 const char *fmt_str;
12624 int nargs = call_expr_nargs (exp);
12626 /* Verify the required arguments in the original call. */
12630 size = CALL_EXPR_ARG (exp, 2);
12631 fmt = CALL_EXPR_ARG (exp, 3);
12633 if (! host_integerp (size, 1) || integer_all_onesp (size))
12636 /* Check whether the format is a literal string constant. */
12637 fmt_str = c_getstr (fmt);
12638 if (fmt_str == NULL)
12641 if (!init_target_chars ())
12644 /* If the format doesn't contain % args or %%, we know its size. */
12645 if (strchr (fmt_str, target_percent) == 0)
12646 len = build_int_cstu (size_type_node, strlen (fmt_str));
12647 /* If the format is "%s" and first ... argument is a string literal,
12649 else if (fcode == BUILT_IN_SPRINTF_CHK
12650 && strcmp (fmt_str, target_percent_s) == 0)
12656 arg = CALL_EXPR_ARG (exp, 4);
12657 if (! POINTER_TYPE_P (TREE_TYPE (arg)))
12660 len = c_strlen (arg, 1);
12661 if (!len || ! host_integerp (len, 1))
12667 if (! tree_int_cst_lt (len, size))
12668 warning_at (tree_nonartificial_location (exp),
12669 0, "%Kcall to %D will always overflow destination buffer",
12670 exp, get_callee_fndecl (exp));
12673 /* Emit warning if a free is called with address of a variable. */
12676 maybe_emit_free_warning (tree exp)
12678 tree arg = CALL_EXPR_ARG (exp, 0);
12681 if (TREE_CODE (arg) != ADDR_EXPR)
12684 arg = get_base_address (TREE_OPERAND (arg, 0));
12685 if (arg == NULL || INDIRECT_REF_P (arg) || TREE_CODE (arg) == MEM_REF)
12688 if (SSA_VAR_P (arg))
12689 warning_at (tree_nonartificial_location (exp), OPT_Wfree_nonheap_object,
12690 "%Kattempt to free a non-heap object %qD", exp, arg);
12692 warning_at (tree_nonartificial_location (exp), OPT_Wfree_nonheap_object,
12693 "%Kattempt to free a non-heap object", exp);
12696 /* Fold a call to __builtin_object_size with arguments PTR and OST,
12700 fold_builtin_object_size (tree ptr, tree ost)
12702 unsigned HOST_WIDE_INT bytes;
12703 int object_size_type;
12705 if (!validate_arg (ptr, POINTER_TYPE)
12706 || !validate_arg (ost, INTEGER_TYPE))
12711 if (TREE_CODE (ost) != INTEGER_CST
12712 || tree_int_cst_sgn (ost) < 0
12713 || compare_tree_int (ost, 3) > 0)
12716 object_size_type = tree_low_cst (ost, 0);
12718 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
12719 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
12720 and (size_t) 0 for types 2 and 3. */
12721 if (TREE_SIDE_EFFECTS (ptr))
12722 return build_int_cst_type (size_type_node, object_size_type < 2 ? -1 : 0);
12724 if (TREE_CODE (ptr) == ADDR_EXPR)
12726 bytes = compute_builtin_object_size (ptr, object_size_type);
12727 if (double_int_fits_to_tree_p (size_type_node,
12728 uhwi_to_double_int (bytes)))
12729 return build_int_cstu (size_type_node, bytes);
12731 else if (TREE_CODE (ptr) == SSA_NAME)
12733 /* If object size is not known yet, delay folding until
12734 later. Maybe subsequent passes will help determining
12736 bytes = compute_builtin_object_size (ptr, object_size_type);
12737 if (bytes != (unsigned HOST_WIDE_INT) (object_size_type < 2 ? -1 : 0)
12738 && double_int_fits_to_tree_p (size_type_node,
12739 uhwi_to_double_int (bytes)))
12740 return build_int_cstu (size_type_node, bytes);
12746 /* Fold a call to the __mem{cpy,pcpy,move,set}_chk builtin.
12747 DEST, SRC, LEN, and SIZE are the arguments to the call.
12748 IGNORE is true, if return value can be ignored. FCODE is the BUILT_IN_*
12749 code of the builtin. If MAXLEN is not NULL, it is maximum length
12750 passed as third argument. */
12753 fold_builtin_memory_chk (location_t loc, tree fndecl,
12754 tree dest, tree src, tree len, tree size,
12755 tree maxlen, bool ignore,
12756 enum built_in_function fcode)
12760 if (!validate_arg (dest, POINTER_TYPE)
12761 || !validate_arg (src,
12762 (fcode == BUILT_IN_MEMSET_CHK
12763 ? INTEGER_TYPE : POINTER_TYPE))
12764 || !validate_arg (len, INTEGER_TYPE)
12765 || !validate_arg (size, INTEGER_TYPE))
12768 /* If SRC and DEST are the same (and not volatile), return DEST
12769 (resp. DEST+LEN for __mempcpy_chk). */
12770 if (fcode != BUILT_IN_MEMSET_CHK && operand_equal_p (src, dest, 0))
12772 if (fcode != BUILT_IN_MEMPCPY_CHK)
12773 return omit_one_operand_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)),
12777 tree temp = fold_build_pointer_plus_loc (loc, dest, len);
12778 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), temp);
12782 if (! host_integerp (size, 1))
12785 if (! integer_all_onesp (size))
12787 if (! host_integerp (len, 1))
12789 /* If LEN is not constant, try MAXLEN too.
12790 For MAXLEN only allow optimizing into non-_ocs function
12791 if SIZE is >= MAXLEN, never convert to __ocs_fail (). */
12792 if (maxlen == NULL_TREE || ! host_integerp (maxlen, 1))
12794 if (fcode == BUILT_IN_MEMPCPY_CHK && ignore)
12796 /* (void) __mempcpy_chk () can be optimized into
12797 (void) __memcpy_chk (). */
12798 fn = builtin_decl_explicit (BUILT_IN_MEMCPY_CHK);
12802 return build_call_expr_loc (loc, fn, 4, dest, src, len, size);
12810 if (tree_int_cst_lt (size, maxlen))
12815 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
12816 mem{cpy,pcpy,move,set} is available. */
12819 case BUILT_IN_MEMCPY_CHK:
12820 fn = builtin_decl_explicit (BUILT_IN_MEMCPY);
12822 case BUILT_IN_MEMPCPY_CHK:
12823 fn = builtin_decl_explicit (BUILT_IN_MEMPCPY);
12825 case BUILT_IN_MEMMOVE_CHK:
12826 fn = builtin_decl_explicit (BUILT_IN_MEMMOVE);
12828 case BUILT_IN_MEMSET_CHK:
12829 fn = builtin_decl_explicit (BUILT_IN_MEMSET);
12838 return build_call_expr_loc (loc, fn, 3, dest, src, len);
12841 /* Fold a call to the __st[rp]cpy_chk builtin.
12842 DEST, SRC, and SIZE are the arguments to the call.
12843 IGNORE is true if return value can be ignored. FCODE is the BUILT_IN_*
12844 code of the builtin. If MAXLEN is not NULL, it is maximum length of
12845 strings passed as second argument. */
12848 fold_builtin_stxcpy_chk (location_t loc, tree fndecl, tree dest,
12849 tree src, tree size,
12850 tree maxlen, bool ignore,
12851 enum built_in_function fcode)
12855 if (!validate_arg (dest, POINTER_TYPE)
12856 || !validate_arg (src, POINTER_TYPE)
12857 || !validate_arg (size, INTEGER_TYPE))
12860 /* If SRC and DEST are the same (and not volatile), return DEST. */
12861 if (fcode == BUILT_IN_STRCPY_CHK && operand_equal_p (src, dest, 0))
12862 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest);
12864 if (! host_integerp (size, 1))
12867 if (! integer_all_onesp (size))
12869 len = c_strlen (src, 1);
12870 if (! len || ! host_integerp (len, 1))
12872 /* If LEN is not constant, try MAXLEN too.
12873 For MAXLEN only allow optimizing into non-_ocs function
12874 if SIZE is >= MAXLEN, never convert to __ocs_fail (). */
12875 if (maxlen == NULL_TREE || ! host_integerp (maxlen, 1))
12877 if (fcode == BUILT_IN_STPCPY_CHK)
12882 /* If return value of __stpcpy_chk is ignored,
12883 optimize into __strcpy_chk. */
12884 fn = builtin_decl_explicit (BUILT_IN_STRCPY_CHK);
12888 return build_call_expr_loc (loc, fn, 3, dest, src, size);
12891 if (! len || TREE_SIDE_EFFECTS (len))
12894 /* If c_strlen returned something, but not a constant,
12895 transform __strcpy_chk into __memcpy_chk. */
12896 fn = builtin_decl_explicit (BUILT_IN_MEMCPY_CHK);
12900 len = fold_convert_loc (loc, size_type_node, len);
12901 len = size_binop_loc (loc, PLUS_EXPR, len,
12902 build_int_cst (size_type_node, 1));
12903 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)),
12904 build_call_expr_loc (loc, fn, 4,
12905 dest, src, len, size));
12911 if (! tree_int_cst_lt (maxlen, size))
12915 /* If __builtin_st{r,p}cpy_chk is used, assume st{r,p}cpy is available. */
12916 fn = builtin_decl_explicit (fcode == BUILT_IN_STPCPY_CHK
12917 ? BUILT_IN_STPCPY : BUILT_IN_STRCPY);
12921 return build_call_expr_loc (loc, fn, 2, dest, src);
12924 /* Fold a call to the __st{r,p}ncpy_chk builtin. DEST, SRC, LEN, and SIZE
12925 are the arguments to the call. If MAXLEN is not NULL, it is maximum
12926 length passed as third argument. IGNORE is true if return value can be
12927 ignored. FCODE is the BUILT_IN_* code of the builtin. */
12930 fold_builtin_stxncpy_chk (location_t loc, tree dest, tree src,
12931 tree len, tree size, tree maxlen, bool ignore,
12932 enum built_in_function fcode)
12936 if (!validate_arg (dest, POINTER_TYPE)
12937 || !validate_arg (src, POINTER_TYPE)
12938 || !validate_arg (len, INTEGER_TYPE)
12939 || !validate_arg (size, INTEGER_TYPE))
12942 if (fcode == BUILT_IN_STPNCPY_CHK && ignore)
12944 /* If return value of __stpncpy_chk is ignored,
12945 optimize into __strncpy_chk. */
12946 fn = builtin_decl_explicit (BUILT_IN_STRNCPY_CHK);
12948 return build_call_expr_loc (loc, fn, 4, dest, src, len, size);
12951 if (! host_integerp (size, 1))
12954 if (! integer_all_onesp (size))
12956 if (! host_integerp (len, 1))
12958 /* If LEN is not constant, try MAXLEN too.
12959 For MAXLEN only allow optimizing into non-_ocs function
12960 if SIZE is >= MAXLEN, never convert to __ocs_fail (). */
12961 if (maxlen == NULL_TREE || ! host_integerp (maxlen, 1))
12967 if (tree_int_cst_lt (size, maxlen))
12971 /* If __builtin_st{r,p}ncpy_chk is used, assume st{r,p}ncpy is available. */
12972 fn = builtin_decl_explicit (fcode == BUILT_IN_STPNCPY_CHK
12973 ? BUILT_IN_STPNCPY : BUILT_IN_STRNCPY);
12977 return build_call_expr_loc (loc, fn, 3, dest, src, len);
12980 /* Fold a call to the __strcat_chk builtin FNDECL. DEST, SRC, and SIZE
12981 are the arguments to the call. */
12984 fold_builtin_strcat_chk (location_t loc, tree fndecl, tree dest,
12985 tree src, tree size)
12990 if (!validate_arg (dest, POINTER_TYPE)
12991 || !validate_arg (src, POINTER_TYPE)
12992 || !validate_arg (size, INTEGER_TYPE))
12995 p = c_getstr (src);
12996 /* If the SRC parameter is "", return DEST. */
12997 if (p && *p == '\0')
12998 return omit_one_operand_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest, src);
13000 if (! host_integerp (size, 1) || ! integer_all_onesp (size))
13003 /* If __builtin_strcat_chk is used, assume strcat is available. */
13004 fn = builtin_decl_explicit (BUILT_IN_STRCAT);
13008 return build_call_expr_loc (loc, fn, 2, dest, src);
13011 /* Fold a call to the __strncat_chk builtin with arguments DEST, SRC,
13015 fold_builtin_strncat_chk (location_t loc, tree fndecl,
13016 tree dest, tree src, tree len, tree size)
13021 if (!validate_arg (dest, POINTER_TYPE)
13022 || !validate_arg (src, POINTER_TYPE)
13023 || !validate_arg (size, INTEGER_TYPE)
13024 || !validate_arg (size, INTEGER_TYPE))
13027 p = c_getstr (src);
13028 /* If the SRC parameter is "" or if LEN is 0, return DEST. */
13029 if (p && *p == '\0')
13030 return omit_one_operand_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest, len);
13031 else if (integer_zerop (len))
13032 return omit_one_operand_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest, src);
13034 if (! host_integerp (size, 1))
13037 if (! integer_all_onesp (size))
13039 tree src_len = c_strlen (src, 1);
13041 && host_integerp (src_len, 1)
13042 && host_integerp (len, 1)
13043 && ! tree_int_cst_lt (len, src_len))
13045 /* If LEN >= strlen (SRC), optimize into __strcat_chk. */
13046 fn = builtin_decl_explicit (BUILT_IN_STRCAT_CHK);
13050 return build_call_expr_loc (loc, fn, 3, dest, src, size);
13055 /* If __builtin_strncat_chk is used, assume strncat is available. */
13056 fn = builtin_decl_explicit (BUILT_IN_STRNCAT);
13060 return build_call_expr_loc (loc, fn, 3, dest, src, len);
13063 /* Fold a call EXP to __{,v}sprintf_chk having NARGS passed as ARGS.
13064 Return NULL_TREE if a normal call should be emitted rather than
13065 expanding the function inline. FCODE is either BUILT_IN_SPRINTF_CHK
13066 or BUILT_IN_VSPRINTF_CHK. */
13069 fold_builtin_sprintf_chk_1 (location_t loc, int nargs, tree *args,
13070 enum built_in_function fcode)
13072 tree dest, size, len, fn, fmt, flag;
13073 const char *fmt_str;
13075 /* Verify the required arguments in the original call. */
13079 if (!validate_arg (dest, POINTER_TYPE))
13082 if (!validate_arg (flag, INTEGER_TYPE))
13085 if (!validate_arg (size, INTEGER_TYPE))
13088 if (!validate_arg (fmt, POINTER_TYPE))
13091 if (! host_integerp (size, 1))
13096 if (!init_target_chars ())
13099 /* Check whether the format is a literal string constant. */
13100 fmt_str = c_getstr (fmt);
13101 if (fmt_str != NULL)
13103 /* If the format doesn't contain % args or %%, we know the size. */
13104 if (strchr (fmt_str, target_percent) == 0)
13106 if (fcode != BUILT_IN_SPRINTF_CHK || nargs == 4)
13107 len = build_int_cstu (size_type_node, strlen (fmt_str));
13109 /* If the format is "%s" and first ... argument is a string literal,
13110 we know the size too. */
13111 else if (fcode == BUILT_IN_SPRINTF_CHK
13112 && strcmp (fmt_str, target_percent_s) == 0)
13119 if (validate_arg (arg, POINTER_TYPE))
13121 len = c_strlen (arg, 1);
13122 if (! len || ! host_integerp (len, 1))
13129 if (! integer_all_onesp (size))
13131 if (! len || ! tree_int_cst_lt (len, size))
13135 /* Only convert __{,v}sprintf_chk to {,v}sprintf if flag is 0
13136 or if format doesn't contain % chars or is "%s". */
13137 if (! integer_zerop (flag))
13139 if (fmt_str == NULL)
13141 if (strchr (fmt_str, target_percent) != NULL
13142 && strcmp (fmt_str, target_percent_s))
13146 /* If __builtin_{,v}sprintf_chk is used, assume {,v}sprintf is available. */
13147 fn = builtin_decl_explicit (fcode == BUILT_IN_VSPRINTF_CHK
13148 ? BUILT_IN_VSPRINTF : BUILT_IN_SPRINTF);
13152 return rewrite_call_expr_array (loc, nargs, args, 4, fn, 2, dest, fmt);
13155 /* Fold a call EXP to __{,v}sprintf_chk. Return NULL_TREE if
13156 a normal call should be emitted rather than expanding the function
13157 inline. FCODE is either BUILT_IN_SPRINTF_CHK or BUILT_IN_VSPRINTF_CHK. */
13160 fold_builtin_sprintf_chk (location_t loc, tree exp,
13161 enum built_in_function fcode)
13163 return fold_builtin_sprintf_chk_1 (loc, call_expr_nargs (exp),
13164 CALL_EXPR_ARGP (exp), fcode);
13167 /* Fold a call EXP to {,v}snprintf having NARGS passed as ARGS. Return
13168 NULL_TREE if a normal call should be emitted rather than expanding
13169 the function inline. FCODE is either BUILT_IN_SNPRINTF_CHK or
13170 BUILT_IN_VSNPRINTF_CHK. If MAXLEN is not NULL, it is maximum length
13171 passed as second argument. */
13174 fold_builtin_snprintf_chk_1 (location_t loc, int nargs, tree *args,
13175 tree maxlen, enum built_in_function fcode)
13177 tree dest, size, len, fn, fmt, flag;
13178 const char *fmt_str;
13180 /* Verify the required arguments in the original call. */
13184 if (!validate_arg (dest, POINTER_TYPE))
13187 if (!validate_arg (len, INTEGER_TYPE))
13190 if (!validate_arg (flag, INTEGER_TYPE))
13193 if (!validate_arg (size, INTEGER_TYPE))
13196 if (!validate_arg (fmt, POINTER_TYPE))
13199 if (! host_integerp (size, 1))
13202 if (! integer_all_onesp (size))
13204 if (! host_integerp (len, 1))
13206 /* If LEN is not constant, try MAXLEN too.
13207 For MAXLEN only allow optimizing into non-_ocs function
13208 if SIZE is >= MAXLEN, never convert to __ocs_fail (). */
13209 if (maxlen == NULL_TREE || ! host_integerp (maxlen, 1))
13215 if (tree_int_cst_lt (size, maxlen))
13219 if (!init_target_chars ())
13222 /* Only convert __{,v}snprintf_chk to {,v}snprintf if flag is 0
13223 or if format doesn't contain % chars or is "%s". */
13224 if (! integer_zerop (flag))
13226 fmt_str = c_getstr (fmt);
13227 if (fmt_str == NULL)
13229 if (strchr (fmt_str, target_percent) != NULL
13230 && strcmp (fmt_str, target_percent_s))
13234 /* If __builtin_{,v}snprintf_chk is used, assume {,v}snprintf is
13236 fn = builtin_decl_explicit (fcode == BUILT_IN_VSNPRINTF_CHK
13237 ? BUILT_IN_VSNPRINTF : BUILT_IN_SNPRINTF);
13241 return rewrite_call_expr_array (loc, nargs, args, 5, fn, 3, dest, len, fmt);
13244 /* Fold a call EXP to {,v}snprintf. Return NULL_TREE if
13245 a normal call should be emitted rather than expanding the function
13246 inline. FCODE is either BUILT_IN_SNPRINTF_CHK or
13247 BUILT_IN_VSNPRINTF_CHK. If MAXLEN is not NULL, it is maximum length
13248 passed as second argument. */
13251 fold_builtin_snprintf_chk (location_t loc, tree exp, tree maxlen,
13252 enum built_in_function fcode)
13254 return fold_builtin_snprintf_chk_1 (loc, call_expr_nargs (exp),
13255 CALL_EXPR_ARGP (exp), maxlen, fcode);
13258 /* Fold a call to the {,v}printf{,_unlocked} and __{,v}printf_chk builtins.
13259 FMT and ARG are the arguments to the call; we don't fold cases with
13260 more than 2 arguments, and ARG may be null if this is a 1-argument case.
13262 Return NULL_TREE if no simplification was possible, otherwise return the
13263 simplified form of the call as a tree. FCODE is the BUILT_IN_*
13264 code of the function to be simplified. */
13267 fold_builtin_printf (location_t loc, tree fndecl, tree fmt,
13268 tree arg, bool ignore,
13269 enum built_in_function fcode)
13271 tree fn_putchar, fn_puts, newarg, call = NULL_TREE;
13272 const char *fmt_str = NULL;
13274 /* If the return value is used, don't do the transformation. */
13278 /* Verify the required arguments in the original call. */
13279 if (!validate_arg (fmt, POINTER_TYPE))
13282 /* Check whether the format is a literal string constant. */
13283 fmt_str = c_getstr (fmt);
13284 if (fmt_str == NULL)
13287 if (fcode == BUILT_IN_PRINTF_UNLOCKED)
13289 /* If we're using an unlocked function, assume the other
13290 unlocked functions exist explicitly. */
13291 fn_putchar = builtin_decl_explicit (BUILT_IN_PUTCHAR_UNLOCKED);
13292 fn_puts = builtin_decl_explicit (BUILT_IN_PUTS_UNLOCKED);
13296 fn_putchar = builtin_decl_implicit (BUILT_IN_PUTCHAR);
13297 fn_puts = builtin_decl_implicit (BUILT_IN_PUTS);
13300 if (!init_target_chars ())
13303 if (strcmp (fmt_str, target_percent_s) == 0
13304 || strchr (fmt_str, target_percent) == NULL)
13308 if (strcmp (fmt_str, target_percent_s) == 0)
13310 if (fcode == BUILT_IN_VPRINTF || fcode == BUILT_IN_VPRINTF_CHK)
13313 if (!arg || !validate_arg (arg, POINTER_TYPE))
13316 str = c_getstr (arg);
13322 /* The format specifier doesn't contain any '%' characters. */
13323 if (fcode != BUILT_IN_VPRINTF && fcode != BUILT_IN_VPRINTF_CHK
13329 /* If the string was "", printf does nothing. */
13330 if (str[0] == '\0')
13331 return build_int_cst (TREE_TYPE (TREE_TYPE (fndecl)), 0);
13333 /* If the string has length of 1, call putchar. */
13334 if (str[1] == '\0')
13336 /* Given printf("c"), (where c is any one character,)
13337 convert "c"[0] to an int and pass that to the replacement
13339 newarg = build_int_cst (integer_type_node, str[0]);
13341 call = build_call_expr_loc (loc, fn_putchar, 1, newarg);
13345 /* If the string was "string\n", call puts("string"). */
13346 size_t len = strlen (str);
13347 if ((unsigned char)str[len - 1] == target_newline
13348 && (size_t) (int) len == len
13352 tree offset_node, string_cst;
13354 /* Create a NUL-terminated string that's one char shorter
13355 than the original, stripping off the trailing '\n'. */
13356 newarg = build_string_literal (len, str);
13357 string_cst = string_constant (newarg, &offset_node);
13358 gcc_checking_assert (string_cst
13359 && (TREE_STRING_LENGTH (string_cst)
13361 && integer_zerop (offset_node)
13363 TREE_STRING_POINTER (string_cst)[len - 1]
13364 == target_newline);
13365 /* build_string_literal creates a new STRING_CST,
13366 modify it in place to avoid double copying. */
13367 newstr = CONST_CAST (char *, TREE_STRING_POINTER (string_cst));
13368 newstr[len - 1] = '\0';
13370 call = build_call_expr_loc (loc, fn_puts, 1, newarg);
13373 /* We'd like to arrange to call fputs(string,stdout) here,
13374 but we need stdout and don't have a way to get it yet. */
13379 /* The other optimizations can be done only on the non-va_list variants. */
13380 else if (fcode == BUILT_IN_VPRINTF || fcode == BUILT_IN_VPRINTF_CHK)
13383 /* If the format specifier was "%s\n", call __builtin_puts(arg). */
13384 else if (strcmp (fmt_str, target_percent_s_newline) == 0)
13386 if (!arg || !validate_arg (arg, POINTER_TYPE))
13389 call = build_call_expr_loc (loc, fn_puts, 1, arg);
13392 /* If the format specifier was "%c", call __builtin_putchar(arg). */
13393 else if (strcmp (fmt_str, target_percent_c) == 0)
13395 if (!arg || !validate_arg (arg, INTEGER_TYPE))
13398 call = build_call_expr_loc (loc, fn_putchar, 1, arg);
13404 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), call);
13407 /* Fold a call to the {,v}fprintf{,_unlocked} and __{,v}printf_chk builtins.
13408 FP, FMT, and ARG are the arguments to the call. We don't fold calls with
13409 more than 3 arguments, and ARG may be null in the 2-argument case.
13411 Return NULL_TREE if no simplification was possible, otherwise return the
13412 simplified form of the call as a tree. FCODE is the BUILT_IN_*
13413 code of the function to be simplified. */
13416 fold_builtin_fprintf (location_t loc, tree fndecl, tree fp,
13417 tree fmt, tree arg, bool ignore,
13418 enum built_in_function fcode)
13420 tree fn_fputc, fn_fputs, call = NULL_TREE;
13421 const char *fmt_str = NULL;
13423 /* If the return value is used, don't do the transformation. */
13427 /* Verify the required arguments in the original call. */
13428 if (!validate_arg (fp, POINTER_TYPE))
13430 if (!validate_arg (fmt, POINTER_TYPE))
13433 /* Check whether the format is a literal string constant. */
13434 fmt_str = c_getstr (fmt);
13435 if (fmt_str == NULL)
13438 if (fcode == BUILT_IN_FPRINTF_UNLOCKED)
13440 /* If we're using an unlocked function, assume the other
13441 unlocked functions exist explicitly. */
13442 fn_fputc = builtin_decl_explicit (BUILT_IN_FPUTC_UNLOCKED);
13443 fn_fputs = builtin_decl_explicit (BUILT_IN_FPUTS_UNLOCKED);
13447 fn_fputc = builtin_decl_implicit (BUILT_IN_FPUTC);
13448 fn_fputs = builtin_decl_implicit (BUILT_IN_FPUTS);
13451 if (!init_target_chars ())
13454 /* If the format doesn't contain % args or %%, use strcpy. */
13455 if (strchr (fmt_str, target_percent) == NULL)
13457 if (fcode != BUILT_IN_VFPRINTF && fcode != BUILT_IN_VFPRINTF_CHK
13461 /* If the format specifier was "", fprintf does nothing. */
13462 if (fmt_str[0] == '\0')
13464 /* If FP has side-effects, just wait until gimplification is
13466 if (TREE_SIDE_EFFECTS (fp))
13469 return build_int_cst (TREE_TYPE (TREE_TYPE (fndecl)), 0);
13472 /* When "string" doesn't contain %, replace all cases of
13473 fprintf (fp, string) with fputs (string, fp). The fputs
13474 builtin will take care of special cases like length == 1. */
13476 call = build_call_expr_loc (loc, fn_fputs, 2, fmt, fp);
13479 /* The other optimizations can be done only on the non-va_list variants. */
13480 else if (fcode == BUILT_IN_VFPRINTF || fcode == BUILT_IN_VFPRINTF_CHK)
13483 /* If the format specifier was "%s", call __builtin_fputs (arg, fp). */
13484 else if (strcmp (fmt_str, target_percent_s) == 0)
13486 if (!arg || !validate_arg (arg, POINTER_TYPE))
13489 call = build_call_expr_loc (loc, fn_fputs, 2, arg, fp);
13492 /* If the format specifier was "%c", call __builtin_fputc (arg, fp). */
13493 else if (strcmp (fmt_str, target_percent_c) == 0)
13495 if (!arg || !validate_arg (arg, INTEGER_TYPE))
13498 call = build_call_expr_loc (loc, fn_fputc, 2, arg, fp);
13503 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), call);
13506 /* Initialize format string characters in the target charset. */
13509 init_target_chars (void)
13514 target_newline = lang_hooks.to_target_charset ('\n');
13515 target_percent = lang_hooks.to_target_charset ('%');
13516 target_c = lang_hooks.to_target_charset ('c');
13517 target_s = lang_hooks.to_target_charset ('s');
13518 if (target_newline == 0 || target_percent == 0 || target_c == 0
13522 target_percent_c[0] = target_percent;
13523 target_percent_c[1] = target_c;
13524 target_percent_c[2] = '\0';
13526 target_percent_s[0] = target_percent;
13527 target_percent_s[1] = target_s;
13528 target_percent_s[2] = '\0';
13530 target_percent_s_newline[0] = target_percent;
13531 target_percent_s_newline[1] = target_s;
13532 target_percent_s_newline[2] = target_newline;
13533 target_percent_s_newline[3] = '\0';
13540 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
13541 and no overflow/underflow occurred. INEXACT is true if M was not
13542 exactly calculated. TYPE is the tree type for the result. This
13543 function assumes that you cleared the MPFR flags and then
13544 calculated M to see if anything subsequently set a flag prior to
13545 entering this function. Return NULL_TREE if any checks fail. */
13548 do_mpfr_ckconv (mpfr_srcptr m, tree type, int inexact)
13550 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
13551 overflow/underflow occurred. If -frounding-math, proceed iff the
13552 result of calling FUNC was exact. */
13553 if (mpfr_number_p (m) && !mpfr_overflow_p () && !mpfr_underflow_p ()
13554 && (!flag_rounding_math || !inexact))
13556 REAL_VALUE_TYPE rr;
13558 real_from_mpfr (&rr, m, type, GMP_RNDN);
13559 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
13560 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
13561 but the mpft_t is not, then we underflowed in the
13563 if (real_isfinite (&rr)
13564 && (rr.cl == rvc_zero) == (mpfr_zero_p (m) != 0))
13566 REAL_VALUE_TYPE rmode;
13568 real_convert (&rmode, TYPE_MODE (type), &rr);
13569 /* Proceed iff the specified mode can hold the value. */
13570 if (real_identical (&rmode, &rr))
13571 return build_real (type, rmode);
13577 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
13578 number and no overflow/underflow occurred. INEXACT is true if M
13579 was not exactly calculated. TYPE is the tree type for the result.
13580 This function assumes that you cleared the MPFR flags and then
13581 calculated M to see if anything subsequently set a flag prior to
13582 entering this function. Return NULL_TREE if any checks fail, if
13583 FORCE_CONVERT is true, then bypass the checks. */
13586 do_mpc_ckconv (mpc_srcptr m, tree type, int inexact, int force_convert)
13588 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
13589 overflow/underflow occurred. If -frounding-math, proceed iff the
13590 result of calling FUNC was exact. */
13592 || (mpfr_number_p (mpc_realref (m)) && mpfr_number_p (mpc_imagref (m))
13593 && !mpfr_overflow_p () && !mpfr_underflow_p ()
13594 && (!flag_rounding_math || !inexact)))
13596 REAL_VALUE_TYPE re, im;
13598 real_from_mpfr (&re, mpc_realref (m), TREE_TYPE (type), GMP_RNDN);
13599 real_from_mpfr (&im, mpc_imagref (m), TREE_TYPE (type), GMP_RNDN);
13600 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
13601 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
13602 but the mpft_t is not, then we underflowed in the
13605 || (real_isfinite (&re) && real_isfinite (&im)
13606 && (re.cl == rvc_zero) == (mpfr_zero_p (mpc_realref (m)) != 0)
13607 && (im.cl == rvc_zero) == (mpfr_zero_p (mpc_imagref (m)) != 0)))
13609 REAL_VALUE_TYPE re_mode, im_mode;
13611 real_convert (&re_mode, TYPE_MODE (TREE_TYPE (type)), &re);
13612 real_convert (&im_mode, TYPE_MODE (TREE_TYPE (type)), &im);
13613 /* Proceed iff the specified mode can hold the value. */
13615 || (real_identical (&re_mode, &re)
13616 && real_identical (&im_mode, &im)))
13617 return build_complex (type, build_real (TREE_TYPE (type), re_mode),
13618 build_real (TREE_TYPE (type), im_mode));
13624 /* If argument ARG is a REAL_CST, call the one-argument mpfr function
13625 FUNC on it and return the resulting value as a tree with type TYPE.
13626 If MIN and/or MAX are not NULL, then the supplied ARG must be
13627 within those bounds. If INCLUSIVE is true, then MIN/MAX are
13628 acceptable values, otherwise they are not. The mpfr precision is
13629 set to the precision of TYPE. We assume that function FUNC returns
13630 zero if the result could be calculated exactly within the requested
13634 do_mpfr_arg1 (tree arg, tree type, int (*func)(mpfr_ptr, mpfr_srcptr, mp_rnd_t),
13635 const REAL_VALUE_TYPE *min, const REAL_VALUE_TYPE *max,
13638 tree result = NULL_TREE;
13642 /* To proceed, MPFR must exactly represent the target floating point
13643 format, which only happens when the target base equals two. */
13644 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
13645 && TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
13647 const REAL_VALUE_TYPE *const ra = &TREE_REAL_CST (arg);
13649 if (real_isfinite (ra)
13650 && (!min || real_compare (inclusive ? GE_EXPR: GT_EXPR , ra, min))
13651 && (!max || real_compare (inclusive ? LE_EXPR: LT_EXPR , ra, max)))
13653 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
13654 const int prec = fmt->p;
13655 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
13659 mpfr_init2 (m, prec);
13660 mpfr_from_real (m, ra, GMP_RNDN);
13661 mpfr_clear_flags ();
13662 inexact = func (m, m, rnd);
13663 result = do_mpfr_ckconv (m, type, inexact);
13671 /* If argument ARG is a REAL_CST, call the two-argument mpfr function
13672 FUNC on it and return the resulting value as a tree with type TYPE.
13673 The mpfr precision is set to the precision of TYPE. We assume that
13674 function FUNC returns zero if the result could be calculated
13675 exactly within the requested precision. */
13678 do_mpfr_arg2 (tree arg1, tree arg2, tree type,
13679 int (*func)(mpfr_ptr, mpfr_srcptr, mpfr_srcptr, mp_rnd_t))
13681 tree result = NULL_TREE;
13686 /* To proceed, MPFR must exactly represent the target floating point
13687 format, which only happens when the target base equals two. */
13688 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
13689 && TREE_CODE (arg1) == REAL_CST && !TREE_OVERFLOW (arg1)
13690 && TREE_CODE (arg2) == REAL_CST && !TREE_OVERFLOW (arg2))
13692 const REAL_VALUE_TYPE *const ra1 = &TREE_REAL_CST (arg1);
13693 const REAL_VALUE_TYPE *const ra2 = &TREE_REAL_CST (arg2);
13695 if (real_isfinite (ra1) && real_isfinite (ra2))
13697 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
13698 const int prec = fmt->p;
13699 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
13703 mpfr_inits2 (prec, m1, m2, NULL);
13704 mpfr_from_real (m1, ra1, GMP_RNDN);
13705 mpfr_from_real (m2, ra2, GMP_RNDN);
13706 mpfr_clear_flags ();
13707 inexact = func (m1, m1, m2, rnd);
13708 result = do_mpfr_ckconv (m1, type, inexact);
13709 mpfr_clears (m1, m2, NULL);
13716 /* If argument ARG is a REAL_CST, call the three-argument mpfr function
13717 FUNC on it and return the resulting value as a tree with type TYPE.
13718 The mpfr precision is set to the precision of TYPE. We assume that
13719 function FUNC returns zero if the result could be calculated
13720 exactly within the requested precision. */
13723 do_mpfr_arg3 (tree arg1, tree arg2, tree arg3, tree type,
13724 int (*func)(mpfr_ptr, mpfr_srcptr, mpfr_srcptr, mpfr_srcptr, mp_rnd_t))
13726 tree result = NULL_TREE;
13732 /* To proceed, MPFR must exactly represent the target floating point
13733 format, which only happens when the target base equals two. */
13734 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
13735 && TREE_CODE (arg1) == REAL_CST && !TREE_OVERFLOW (arg1)
13736 && TREE_CODE (arg2) == REAL_CST && !TREE_OVERFLOW (arg2)
13737 && TREE_CODE (arg3) == REAL_CST && !TREE_OVERFLOW (arg3))
13739 const REAL_VALUE_TYPE *const ra1 = &TREE_REAL_CST (arg1);
13740 const REAL_VALUE_TYPE *const ra2 = &TREE_REAL_CST (arg2);
13741 const REAL_VALUE_TYPE *const ra3 = &TREE_REAL_CST (arg3);
13743 if (real_isfinite (ra1) && real_isfinite (ra2) && real_isfinite (ra3))
13745 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
13746 const int prec = fmt->p;
13747 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
13751 mpfr_inits2 (prec, m1, m2, m3, NULL);
13752 mpfr_from_real (m1, ra1, GMP_RNDN);
13753 mpfr_from_real (m2, ra2, GMP_RNDN);
13754 mpfr_from_real (m3, ra3, GMP_RNDN);
13755 mpfr_clear_flags ();
13756 inexact = func (m1, m1, m2, m3, rnd);
13757 result = do_mpfr_ckconv (m1, type, inexact);
13758 mpfr_clears (m1, m2, m3, NULL);
13765 /* If argument ARG is a REAL_CST, call mpfr_sin_cos() on it and set
13766 the pointers *(ARG_SINP) and *(ARG_COSP) to the resulting values.
13767 If ARG_SINP and ARG_COSP are NULL then the result is returned
13768 as a complex value.
13769 The type is taken from the type of ARG and is used for setting the
13770 precision of the calculation and results. */
13773 do_mpfr_sincos (tree arg, tree arg_sinp, tree arg_cosp)
13775 tree const type = TREE_TYPE (arg);
13776 tree result = NULL_TREE;
13780 /* To proceed, MPFR must exactly represent the target floating point
13781 format, which only happens when the target base equals two. */
13782 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
13783 && TREE_CODE (arg) == REAL_CST
13784 && !TREE_OVERFLOW (arg))
13786 const REAL_VALUE_TYPE *const ra = &TREE_REAL_CST (arg);
13788 if (real_isfinite (ra))
13790 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
13791 const int prec = fmt->p;
13792 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
13793 tree result_s, result_c;
13797 mpfr_inits2 (prec, m, ms, mc, NULL);
13798 mpfr_from_real (m, ra, GMP_RNDN);
13799 mpfr_clear_flags ();
13800 inexact = mpfr_sin_cos (ms, mc, m, rnd);
13801 result_s = do_mpfr_ckconv (ms, type, inexact);
13802 result_c = do_mpfr_ckconv (mc, type, inexact);
13803 mpfr_clears (m, ms, mc, NULL);
13804 if (result_s && result_c)
13806 /* If we are to return in a complex value do so. */
13807 if (!arg_sinp && !arg_cosp)
13808 return build_complex (build_complex_type (type),
13809 result_c, result_s);
13811 /* Dereference the sin/cos pointer arguments. */
13812 arg_sinp = build_fold_indirect_ref (arg_sinp);
13813 arg_cosp = build_fold_indirect_ref (arg_cosp);
13814 /* Proceed if valid pointer type were passed in. */
13815 if (TYPE_MAIN_VARIANT (TREE_TYPE (arg_sinp)) == TYPE_MAIN_VARIANT (type)
13816 && TYPE_MAIN_VARIANT (TREE_TYPE (arg_cosp)) == TYPE_MAIN_VARIANT (type))
13818 /* Set the values. */
13819 result_s = fold_build2 (MODIFY_EXPR, type, arg_sinp,
13821 TREE_SIDE_EFFECTS (result_s) = 1;
13822 result_c = fold_build2 (MODIFY_EXPR, type, arg_cosp,
13824 TREE_SIDE_EFFECTS (result_c) = 1;
13825 /* Combine the assignments into a compound expr. */
13826 result = non_lvalue (fold_build2 (COMPOUND_EXPR, type,
13827 result_s, result_c));
13835 /* If argument ARG1 is an INTEGER_CST and ARG2 is a REAL_CST, call the
13836 two-argument mpfr order N Bessel function FUNC on them and return
13837 the resulting value as a tree with type TYPE. The mpfr precision
13838 is set to the precision of TYPE. We assume that function FUNC
13839 returns zero if the result could be calculated exactly within the
13840 requested precision. */
13842 do_mpfr_bessel_n (tree arg1, tree arg2, tree type,
13843 int (*func)(mpfr_ptr, long, mpfr_srcptr, mp_rnd_t),
13844 const REAL_VALUE_TYPE *min, bool inclusive)
13846 tree result = NULL_TREE;
13851 /* To proceed, MPFR must exactly represent the target floating point
13852 format, which only happens when the target base equals two. */
13853 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
13854 && host_integerp (arg1, 0)
13855 && TREE_CODE (arg2) == REAL_CST && !TREE_OVERFLOW (arg2))
13857 const HOST_WIDE_INT n = tree_low_cst(arg1, 0);
13858 const REAL_VALUE_TYPE *const ra = &TREE_REAL_CST (arg2);
13861 && real_isfinite (ra)
13862 && (!min || real_compare (inclusive ? GE_EXPR: GT_EXPR , ra, min)))
13864 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
13865 const int prec = fmt->p;
13866 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
13870 mpfr_init2 (m, prec);
13871 mpfr_from_real (m, ra, GMP_RNDN);
13872 mpfr_clear_flags ();
13873 inexact = func (m, n, m, rnd);
13874 result = do_mpfr_ckconv (m, type, inexact);
13882 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
13883 the pointer *(ARG_QUO) and return the result. The type is taken
13884 from the type of ARG0 and is used for setting the precision of the
13885 calculation and results. */
13888 do_mpfr_remquo (tree arg0, tree arg1, tree arg_quo)
13890 tree const type = TREE_TYPE (arg0);
13891 tree result = NULL_TREE;
13896 /* To proceed, MPFR must exactly represent the target floating point
13897 format, which only happens when the target base equals two. */
13898 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
13899 && TREE_CODE (arg0) == REAL_CST && !TREE_OVERFLOW (arg0)
13900 && TREE_CODE (arg1) == REAL_CST && !TREE_OVERFLOW (arg1))
13902 const REAL_VALUE_TYPE *const ra0 = TREE_REAL_CST_PTR (arg0);
13903 const REAL_VALUE_TYPE *const ra1 = TREE_REAL_CST_PTR (arg1);
13905 if (real_isfinite (ra0) && real_isfinite (ra1))
13907 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
13908 const int prec = fmt->p;
13909 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
13914 mpfr_inits2 (prec, m0, m1, NULL);
13915 mpfr_from_real (m0, ra0, GMP_RNDN);
13916 mpfr_from_real (m1, ra1, GMP_RNDN);
13917 mpfr_clear_flags ();
13918 mpfr_remquo (m0, &integer_quo, m0, m1, rnd);
13919 /* Remquo is independent of the rounding mode, so pass
13920 inexact=0 to do_mpfr_ckconv(). */
13921 result_rem = do_mpfr_ckconv (m0, type, /*inexact=*/ 0);
13922 mpfr_clears (m0, m1, NULL);
13925 /* MPFR calculates quo in the host's long so it may
13926 return more bits in quo than the target int can hold
13927 if sizeof(host long) > sizeof(target int). This can
13928 happen even for native compilers in LP64 mode. In
13929 these cases, modulo the quo value with the largest
13930 number that the target int can hold while leaving one
13931 bit for the sign. */
13932 if (sizeof (integer_quo) * CHAR_BIT > INT_TYPE_SIZE)
13933 integer_quo %= (long)(1UL << (INT_TYPE_SIZE - 1));
13935 /* Dereference the quo pointer argument. */
13936 arg_quo = build_fold_indirect_ref (arg_quo);
13937 /* Proceed iff a valid pointer type was passed in. */
13938 if (TYPE_MAIN_VARIANT (TREE_TYPE (arg_quo)) == integer_type_node)
13940 /* Set the value. */
13942 = fold_build2 (MODIFY_EXPR, TREE_TYPE (arg_quo), arg_quo,
13943 build_int_cst (TREE_TYPE (arg_quo),
13945 TREE_SIDE_EFFECTS (result_quo) = 1;
13946 /* Combine the quo assignment with the rem. */
13947 result = non_lvalue (fold_build2 (COMPOUND_EXPR, type,
13948 result_quo, result_rem));
13956 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
13957 resulting value as a tree with type TYPE. The mpfr precision is
13958 set to the precision of TYPE. We assume that this mpfr function
13959 returns zero if the result could be calculated exactly within the
13960 requested precision. In addition, the integer pointer represented
13961 by ARG_SG will be dereferenced and set to the appropriate signgam
13965 do_mpfr_lgamma_r (tree arg, tree arg_sg, tree type)
13967 tree result = NULL_TREE;
13971 /* To proceed, MPFR must exactly represent the target floating point
13972 format, which only happens when the target base equals two. Also
13973 verify ARG is a constant and that ARG_SG is an int pointer. */
13974 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
13975 && TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg)
13976 && TREE_CODE (TREE_TYPE (arg_sg)) == POINTER_TYPE
13977 && TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (arg_sg))) == integer_type_node)
13979 const REAL_VALUE_TYPE *const ra = TREE_REAL_CST_PTR (arg);
13981 /* In addition to NaN and Inf, the argument cannot be zero or a
13982 negative integer. */
13983 if (real_isfinite (ra)
13984 && ra->cl != rvc_zero
13985 && !(real_isneg(ra) && real_isinteger(ra, TYPE_MODE (type))))
13987 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
13988 const int prec = fmt->p;
13989 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
13994 mpfr_init2 (m, prec);
13995 mpfr_from_real (m, ra, GMP_RNDN);
13996 mpfr_clear_flags ();
13997 inexact = mpfr_lgamma (m, &sg, m, rnd);
13998 result_lg = do_mpfr_ckconv (m, type, inexact);
14004 /* Dereference the arg_sg pointer argument. */
14005 arg_sg = build_fold_indirect_ref (arg_sg);
14006 /* Assign the signgam value into *arg_sg. */
14007 result_sg = fold_build2 (MODIFY_EXPR,
14008 TREE_TYPE (arg_sg), arg_sg,
14009 build_int_cst (TREE_TYPE (arg_sg), sg));
14010 TREE_SIDE_EFFECTS (result_sg) = 1;
14011 /* Combine the signgam assignment with the lgamma result. */
14012 result = non_lvalue (fold_build2 (COMPOUND_EXPR, type,
14013 result_sg, result_lg));
14021 /* If argument ARG is a COMPLEX_CST, call the one-argument mpc
14022 function FUNC on it and return the resulting value as a tree with
14023 type TYPE. The mpfr precision is set to the precision of TYPE. We
14024 assume that function FUNC returns zero if the result could be
14025 calculated exactly within the requested precision. */
14028 do_mpc_arg1 (tree arg, tree type, int (*func)(mpc_ptr, mpc_srcptr, mpc_rnd_t))
14030 tree result = NULL_TREE;
14034 /* To proceed, MPFR must exactly represent the target floating point
14035 format, which only happens when the target base equals two. */
14036 if (TREE_CODE (arg) == COMPLEX_CST && !TREE_OVERFLOW (arg)
14037 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) == REAL_TYPE
14038 && REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (TREE_TYPE (arg))))->b == 2)
14040 const REAL_VALUE_TYPE *const re = TREE_REAL_CST_PTR (TREE_REALPART (arg));
14041 const REAL_VALUE_TYPE *const im = TREE_REAL_CST_PTR (TREE_IMAGPART (arg));
14043 if (real_isfinite (re) && real_isfinite (im))
14045 const struct real_format *const fmt =
14046 REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (type)));
14047 const int prec = fmt->p;
14048 const mp_rnd_t rnd = fmt->round_towards_zero ? GMP_RNDZ : GMP_RNDN;
14049 const mpc_rnd_t crnd = fmt->round_towards_zero ? MPC_RNDZZ : MPC_RNDNN;
14053 mpc_init2 (m, prec);
14054 mpfr_from_real (mpc_realref(m), re, rnd);
14055 mpfr_from_real (mpc_imagref(m), im, rnd);
14056 mpfr_clear_flags ();
14057 inexact = func (m, m, crnd);
14058 result = do_mpc_ckconv (m, type, inexact, /*force_convert=*/ 0);
14066 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
14067 mpc function FUNC on it and return the resulting value as a tree
14068 with type TYPE. The mpfr precision is set to the precision of
14069 TYPE. We assume that function FUNC returns zero if the result
14070 could be calculated exactly within the requested precision. If
14071 DO_NONFINITE is true, then fold expressions containing Inf or NaN
14072 in the arguments and/or results. */
14075 do_mpc_arg2 (tree arg0, tree arg1, tree type, int do_nonfinite,
14076 int (*func)(mpc_ptr, mpc_srcptr, mpc_srcptr, mpc_rnd_t))
14078 tree result = NULL_TREE;
14083 /* To proceed, MPFR must exactly represent the target floating point
14084 format, which only happens when the target base equals two. */
14085 if (TREE_CODE (arg0) == COMPLEX_CST && !TREE_OVERFLOW (arg0)
14086 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE
14087 && TREE_CODE (arg1) == COMPLEX_CST && !TREE_OVERFLOW (arg1)
14088 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg1))) == REAL_TYPE
14089 && REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (TREE_TYPE (arg0))))->b == 2)
14091 const REAL_VALUE_TYPE *const re0 = TREE_REAL_CST_PTR (TREE_REALPART (arg0));
14092 const REAL_VALUE_TYPE *const im0 = TREE_REAL_CST_PTR (TREE_IMAGPART (arg0));
14093 const REAL_VALUE_TYPE *const re1 = TREE_REAL_CST_PTR (TREE_REALPART (arg1));
14094 const REAL_VALUE_TYPE *const im1 = TREE_REAL_CST_PTR (TREE_IMAGPART (arg1));
14097 || (real_isfinite (re0) && real_isfinite (im0)
14098 && real_isfinite (re1) && real_isfinite (im1)))
14100 const struct real_format *const fmt =
14101 REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (type)));
14102 const int prec = fmt->p;
14103 const mp_rnd_t rnd = fmt->round_towards_zero ? GMP_RNDZ : GMP_RNDN;
14104 const mpc_rnd_t crnd = fmt->round_towards_zero ? MPC_RNDZZ : MPC_RNDNN;
14108 mpc_init2 (m0, prec);
14109 mpc_init2 (m1, prec);
14110 mpfr_from_real (mpc_realref(m0), re0, rnd);
14111 mpfr_from_real (mpc_imagref(m0), im0, rnd);
14112 mpfr_from_real (mpc_realref(m1), re1, rnd);
14113 mpfr_from_real (mpc_imagref(m1), im1, rnd);
14114 mpfr_clear_flags ();
14115 inexact = func (m0, m0, m1, crnd);
14116 result = do_mpc_ckconv (m0, type, inexact, do_nonfinite);
14125 /* Fold a call STMT to __{,v}sprintf_chk. Return NULL_TREE if
14126 a normal call should be emitted rather than expanding the function
14127 inline. FCODE is either BUILT_IN_SPRINTF_CHK or BUILT_IN_VSPRINTF_CHK. */
14130 gimple_fold_builtin_sprintf_chk (gimple stmt, enum built_in_function fcode)
14132 int nargs = gimple_call_num_args (stmt);
14134 return fold_builtin_sprintf_chk_1 (gimple_location (stmt), nargs,
14136 ? gimple_call_arg_ptr (stmt, 0)
14137 : &error_mark_node), fcode);
14140 /* Fold a call STMT to {,v}snprintf. Return NULL_TREE if
14141 a normal call should be emitted rather than expanding the function
14142 inline. FCODE is either BUILT_IN_SNPRINTF_CHK or
14143 BUILT_IN_VSNPRINTF_CHK. If MAXLEN is not NULL, it is maximum length
14144 passed as second argument. */
14147 gimple_fold_builtin_snprintf_chk (gimple stmt, tree maxlen,
14148 enum built_in_function fcode)
14150 int nargs = gimple_call_num_args (stmt);
14152 return fold_builtin_snprintf_chk_1 (gimple_location (stmt), nargs,
14154 ? gimple_call_arg_ptr (stmt, 0)
14155 : &error_mark_node), maxlen, fcode);
14158 /* Builtins with folding operations that operate on "..." arguments
14159 need special handling; we need to store the arguments in a convenient
14160 data structure before attempting any folding. Fortunately there are
14161 only a few builtins that fall into this category. FNDECL is the
14162 function, EXP is the CALL_EXPR for the call, and IGNORE is true if the
14163 result of the function call is ignored. */
14166 gimple_fold_builtin_varargs (tree fndecl, gimple stmt,
14167 bool ignore ATTRIBUTE_UNUSED)
14169 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
14170 tree ret = NULL_TREE;
14174 case BUILT_IN_SPRINTF_CHK:
14175 case BUILT_IN_VSPRINTF_CHK:
14176 ret = gimple_fold_builtin_sprintf_chk (stmt, fcode);
14179 case BUILT_IN_SNPRINTF_CHK:
14180 case BUILT_IN_VSNPRINTF_CHK:
14181 ret = gimple_fold_builtin_snprintf_chk (stmt, NULL_TREE, fcode);
14188 ret = build1 (NOP_EXPR, TREE_TYPE (ret), ret);
14189 TREE_NO_WARNING (ret) = 1;
14195 /* A wrapper function for builtin folding that prevents warnings for
14196 "statement without effect" and the like, caused by removing the
14197 call node earlier than the warning is generated. */
14200 fold_call_stmt (gimple stmt, bool ignore)
14202 tree ret = NULL_TREE;
14203 tree fndecl = gimple_call_fndecl (stmt);
14204 location_t loc = gimple_location (stmt);
14206 && TREE_CODE (fndecl) == FUNCTION_DECL
14207 && DECL_BUILT_IN (fndecl)
14208 && !gimple_call_va_arg_pack_p (stmt))
14210 int nargs = gimple_call_num_args (stmt);
14211 tree *args = (nargs > 0
14212 ? gimple_call_arg_ptr (stmt, 0)
14213 : &error_mark_node);
14215 if (avoid_folding_inline_builtin (fndecl))
14217 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
14219 return targetm.fold_builtin (fndecl, nargs, args, ignore);
14223 if (nargs <= MAX_ARGS_TO_FOLD_BUILTIN)
14224 ret = fold_builtin_n (loc, fndecl, args, nargs, ignore);
14226 ret = gimple_fold_builtin_varargs (fndecl, stmt, ignore);
14229 /* Propagate location information from original call to
14230 expansion of builtin. Otherwise things like
14231 maybe_emit_chk_warning, that operate on the expansion
14232 of a builtin, will use the wrong location information. */
14233 if (gimple_has_location (stmt))
14235 tree realret = ret;
14236 if (TREE_CODE (ret) == NOP_EXPR)
14237 realret = TREE_OPERAND (ret, 0);
14238 if (CAN_HAVE_LOCATION_P (realret)
14239 && !EXPR_HAS_LOCATION (realret))
14240 SET_EXPR_LOCATION (realret, loc);
14250 /* Look up the function in builtin_decl that corresponds to DECL
14251 and set ASMSPEC as its user assembler name. DECL must be a
14252 function decl that declares a builtin. */
14255 set_builtin_user_assembler_name (tree decl, const char *asmspec)
14258 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL
14259 && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
14262 builtin = builtin_decl_explicit (DECL_FUNCTION_CODE (decl));
14263 set_user_assembler_name (builtin, asmspec);
14264 switch (DECL_FUNCTION_CODE (decl))
14266 case BUILT_IN_MEMCPY:
14267 init_block_move_fn (asmspec);
14268 memcpy_libfunc = set_user_assembler_libfunc ("memcpy", asmspec);
14270 case BUILT_IN_MEMSET:
14271 init_block_clear_fn (asmspec);
14272 memset_libfunc = set_user_assembler_libfunc ("memset", asmspec);
14274 case BUILT_IN_MEMMOVE:
14275 memmove_libfunc = set_user_assembler_libfunc ("memmove", asmspec);
14277 case BUILT_IN_MEMCMP:
14278 memcmp_libfunc = set_user_assembler_libfunc ("memcmp", asmspec);
14280 case BUILT_IN_ABORT:
14281 abort_libfunc = set_user_assembler_libfunc ("abort", asmspec);
14284 if (INT_TYPE_SIZE < BITS_PER_WORD)
14286 set_user_assembler_libfunc ("ffs", asmspec);
14287 set_optab_libfunc (ffs_optab, mode_for_size (INT_TYPE_SIZE,
14288 MODE_INT, 0), "ffs");
14296 /* Return true if DECL is a builtin that expands to a constant or similarly
14299 is_simple_builtin (tree decl)
14301 if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL)
14302 switch (DECL_FUNCTION_CODE (decl))
14304 /* Builtins that expand to constants. */
14305 case BUILT_IN_CONSTANT_P:
14306 case BUILT_IN_EXPECT:
14307 case BUILT_IN_OBJECT_SIZE:
14308 case BUILT_IN_UNREACHABLE:
14309 /* Simple register moves or loads from stack. */
14310 case BUILT_IN_ASSUME_ALIGNED:
14311 case BUILT_IN_RETURN_ADDRESS:
14312 case BUILT_IN_EXTRACT_RETURN_ADDR:
14313 case BUILT_IN_FROB_RETURN_ADDR:
14314 case BUILT_IN_RETURN:
14315 case BUILT_IN_AGGREGATE_INCOMING_ADDRESS:
14316 case BUILT_IN_FRAME_ADDRESS:
14317 case BUILT_IN_VA_END:
14318 case BUILT_IN_STACK_SAVE:
14319 case BUILT_IN_STACK_RESTORE:
14320 /* Exception state returns or moves registers around. */
14321 case BUILT_IN_EH_FILTER:
14322 case BUILT_IN_EH_POINTER:
14323 case BUILT_IN_EH_COPY_VALUES:
14333 /* Return true if DECL is a builtin that is not expensive, i.e., they are
14334 most probably expanded inline into reasonably simple code. This is a
14335 superset of is_simple_builtin. */
14337 is_inexpensive_builtin (tree decl)
14341 else if (DECL_BUILT_IN_CLASS (decl) == BUILT_IN_MD)
14343 else if (DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL)
14344 switch (DECL_FUNCTION_CODE (decl))
14347 case BUILT_IN_ALLOCA:
14348 case BUILT_IN_ALLOCA_WITH_ALIGN:
14349 case BUILT_IN_BSWAP32:
14350 case BUILT_IN_BSWAP64:
14352 case BUILT_IN_CLZIMAX:
14353 case BUILT_IN_CLZL:
14354 case BUILT_IN_CLZLL:
14356 case BUILT_IN_CTZIMAX:
14357 case BUILT_IN_CTZL:
14358 case BUILT_IN_CTZLL:
14360 case BUILT_IN_FFSIMAX:
14361 case BUILT_IN_FFSL:
14362 case BUILT_IN_FFSLL:
14363 case BUILT_IN_IMAXABS:
14364 case BUILT_IN_FINITE:
14365 case BUILT_IN_FINITEF:
14366 case BUILT_IN_FINITEL:
14367 case BUILT_IN_FINITED32:
14368 case BUILT_IN_FINITED64:
14369 case BUILT_IN_FINITED128:
14370 case BUILT_IN_FPCLASSIFY:
14371 case BUILT_IN_ISFINITE:
14372 case BUILT_IN_ISINF_SIGN:
14373 case BUILT_IN_ISINF:
14374 case BUILT_IN_ISINFF:
14375 case BUILT_IN_ISINFL:
14376 case BUILT_IN_ISINFD32:
14377 case BUILT_IN_ISINFD64:
14378 case BUILT_IN_ISINFD128:
14379 case BUILT_IN_ISNAN:
14380 case BUILT_IN_ISNANF:
14381 case BUILT_IN_ISNANL:
14382 case BUILT_IN_ISNAND32:
14383 case BUILT_IN_ISNAND64:
14384 case BUILT_IN_ISNAND128:
14385 case BUILT_IN_ISNORMAL:
14386 case BUILT_IN_ISGREATER:
14387 case BUILT_IN_ISGREATEREQUAL:
14388 case BUILT_IN_ISLESS:
14389 case BUILT_IN_ISLESSEQUAL:
14390 case BUILT_IN_ISLESSGREATER:
14391 case BUILT_IN_ISUNORDERED:
14392 case BUILT_IN_VA_ARG_PACK:
14393 case BUILT_IN_VA_ARG_PACK_LEN:
14394 case BUILT_IN_VA_COPY:
14395 case BUILT_IN_TRAP:
14396 case BUILT_IN_SAVEREGS:
14397 case BUILT_IN_POPCOUNTL:
14398 case BUILT_IN_POPCOUNTLL:
14399 case BUILT_IN_POPCOUNTIMAX:
14400 case BUILT_IN_POPCOUNT:
14401 case BUILT_IN_PARITYL:
14402 case BUILT_IN_PARITYLL:
14403 case BUILT_IN_PARITYIMAX:
14404 case BUILT_IN_PARITY:
14405 case BUILT_IN_LABS:
14406 case BUILT_IN_LLABS:
14407 case BUILT_IN_PREFETCH:
14411 return is_simple_builtin (decl);