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 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 in bits of EXP, a pointer valued expression.
456 The alignment returned is, by default, the alignment of the thing that
457 EXP points to. If it is not a POINTER_TYPE, 0 is returned.
459 Otherwise, look at the expression to see if we can do better, i.e., if the
460 expression is actually pointing at an object whose alignment is tighter. */
463 get_pointer_alignment (tree exp)
467 if (TREE_CODE (exp) == ADDR_EXPR)
468 return get_object_alignment (TREE_OPERAND (exp, 0));
469 else if (TREE_CODE (exp) == SSA_NAME
470 && POINTER_TYPE_P (TREE_TYPE (exp)))
472 struct ptr_info_def *pi = SSA_NAME_PTR_INFO (exp);
475 return BITS_PER_UNIT;
476 if (pi->misalign != 0)
477 align = (pi->misalign & -pi->misalign);
480 return align * BITS_PER_UNIT;
483 return POINTER_TYPE_P (TREE_TYPE (exp)) ? BITS_PER_UNIT : 0;
486 /* Compute the length of a C string. TREE_STRING_LENGTH is not the right
487 way, because it could contain a zero byte in the middle.
488 TREE_STRING_LENGTH is the size of the character array, not the string.
490 ONLY_VALUE should be nonzero if the result is not going to be emitted
491 into the instruction stream and zero if it is going to be expanded.
492 E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3
493 is returned, otherwise NULL, since
494 len = c_strlen (src, 1); if (len) expand_expr (len, ...); would not
495 evaluate the side-effects.
497 The value returned is of type `ssizetype'.
499 Unfortunately, string_constant can't access the values of const char
500 arrays with initializers, so neither can we do so here. */
503 c_strlen (tree src, int only_value)
506 HOST_WIDE_INT offset;
512 if (TREE_CODE (src) == COND_EXPR
513 && (only_value || !TREE_SIDE_EFFECTS (TREE_OPERAND (src, 0))))
517 len1 = c_strlen (TREE_OPERAND (src, 1), only_value);
518 len2 = c_strlen (TREE_OPERAND (src, 2), only_value);
519 if (tree_int_cst_equal (len1, len2))
523 if (TREE_CODE (src) == COMPOUND_EXPR
524 && (only_value || !TREE_SIDE_EFFECTS (TREE_OPERAND (src, 0))))
525 return c_strlen (TREE_OPERAND (src, 1), only_value);
527 loc = EXPR_LOC_OR_HERE (src);
529 src = string_constant (src, &offset_node);
533 max = TREE_STRING_LENGTH (src) - 1;
534 ptr = TREE_STRING_POINTER (src);
536 if (offset_node && TREE_CODE (offset_node) != INTEGER_CST)
538 /* If the string has an internal zero byte (e.g., "foo\0bar"), we can't
539 compute the offset to the following null if we don't know where to
540 start searching for it. */
543 for (i = 0; i < max; i++)
547 /* We don't know the starting offset, but we do know that the string
548 has no internal zero bytes. We can assume that the offset falls
549 within the bounds of the string; otherwise, the programmer deserves
550 what he gets. Subtract the offset from the length of the string,
551 and return that. This would perhaps not be valid if we were dealing
552 with named arrays in addition to literal string constants. */
554 return size_diffop_loc (loc, size_int (max), offset_node);
557 /* We have a known offset into the string. Start searching there for
558 a null character if we can represent it as a single HOST_WIDE_INT. */
559 if (offset_node == 0)
561 else if (! host_integerp (offset_node, 0))
564 offset = tree_low_cst (offset_node, 0);
566 /* If the offset is known to be out of bounds, warn, and call strlen at
568 if (offset < 0 || offset > max)
570 /* Suppress multiple warnings for propagated constant strings. */
571 if (! TREE_NO_WARNING (src))
573 warning_at (loc, 0, "offset outside bounds of constant string");
574 TREE_NO_WARNING (src) = 1;
579 /* Use strlen to search for the first zero byte. Since any strings
580 constructed with build_string will have nulls appended, we win even
581 if we get handed something like (char[4])"abcd".
583 Since OFFSET is our starting index into the string, no further
584 calculation is needed. */
585 return ssize_int (strlen (ptr + offset));
588 /* Return a char pointer for a C string if it is a string constant
589 or sum of string constant and integer constant. */
596 src = string_constant (src, &offset_node);
600 if (offset_node == 0)
601 return TREE_STRING_POINTER (src);
602 else if (!host_integerp (offset_node, 1)
603 || compare_tree_int (offset_node, TREE_STRING_LENGTH (src) - 1) > 0)
606 return TREE_STRING_POINTER (src) + tree_low_cst (offset_node, 1);
609 /* Return a CONST_INT or CONST_DOUBLE corresponding to target reading
610 GET_MODE_BITSIZE (MODE) bits from string constant STR. */
613 c_readstr (const char *str, enum machine_mode mode)
619 gcc_assert (GET_MODE_CLASS (mode) == MODE_INT);
624 for (i = 0; i < GET_MODE_SIZE (mode); i++)
627 if (WORDS_BIG_ENDIAN)
628 j = GET_MODE_SIZE (mode) - i - 1;
629 if (BYTES_BIG_ENDIAN != WORDS_BIG_ENDIAN
630 && GET_MODE_SIZE (mode) >= UNITS_PER_WORD)
631 j = j + UNITS_PER_WORD - 2 * (j % UNITS_PER_WORD) - 1;
633 gcc_assert (j < 2 * HOST_BITS_PER_WIDE_INT);
636 ch = (unsigned char) str[i];
637 c[j / HOST_BITS_PER_WIDE_INT] |= ch << (j % HOST_BITS_PER_WIDE_INT);
639 return immed_double_const (c[0], c[1], mode);
642 /* Cast a target constant CST to target CHAR and if that value fits into
643 host char type, return zero and put that value into variable pointed to by
647 target_char_cast (tree cst, char *p)
649 unsigned HOST_WIDE_INT val, hostval;
651 if (TREE_CODE (cst) != INTEGER_CST
652 || CHAR_TYPE_SIZE > HOST_BITS_PER_WIDE_INT)
655 val = TREE_INT_CST_LOW (cst);
656 if (CHAR_TYPE_SIZE < HOST_BITS_PER_WIDE_INT)
657 val &= (((unsigned HOST_WIDE_INT) 1) << CHAR_TYPE_SIZE) - 1;
660 if (HOST_BITS_PER_CHAR < HOST_BITS_PER_WIDE_INT)
661 hostval &= (((unsigned HOST_WIDE_INT) 1) << HOST_BITS_PER_CHAR) - 1;
670 /* Similar to save_expr, but assumes that arbitrary code is not executed
671 in between the multiple evaluations. In particular, we assume that a
672 non-addressable local variable will not be modified. */
675 builtin_save_expr (tree exp)
677 if (TREE_CODE (exp) == SSA_NAME
678 || (TREE_ADDRESSABLE (exp) == 0
679 && (TREE_CODE (exp) == PARM_DECL
680 || (TREE_CODE (exp) == VAR_DECL && !TREE_STATIC (exp)))))
683 return save_expr (exp);
686 /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT
687 times to get the address of either a higher stack frame, or a return
688 address located within it (depending on FNDECL_CODE). */
691 expand_builtin_return_addr (enum built_in_function fndecl_code, int count)
695 #ifdef INITIAL_FRAME_ADDRESS_RTX
696 rtx tem = INITIAL_FRAME_ADDRESS_RTX;
700 /* For a zero count with __builtin_return_address, we don't care what
701 frame address we return, because target-specific definitions will
702 override us. Therefore frame pointer elimination is OK, and using
703 the soft frame pointer is OK.
705 For a nonzero count, or a zero count with __builtin_frame_address,
706 we require a stable offset from the current frame pointer to the
707 previous one, so we must use the hard frame pointer, and
708 we must disable frame pointer elimination. */
709 if (count == 0 && fndecl_code == BUILT_IN_RETURN_ADDRESS)
710 tem = frame_pointer_rtx;
713 tem = hard_frame_pointer_rtx;
715 /* Tell reload not to eliminate the frame pointer. */
716 crtl->accesses_prior_frames = 1;
720 /* Some machines need special handling before we can access
721 arbitrary frames. For example, on the SPARC, we must first flush
722 all register windows to the stack. */
723 #ifdef SETUP_FRAME_ADDRESSES
725 SETUP_FRAME_ADDRESSES ();
728 /* On the SPARC, the return address is not in the frame, it is in a
729 register. There is no way to access it off of the current frame
730 pointer, but it can be accessed off the previous frame pointer by
731 reading the value from the register window save area. */
732 #ifdef RETURN_ADDR_IN_PREVIOUS_FRAME
733 if (fndecl_code == BUILT_IN_RETURN_ADDRESS)
737 /* Scan back COUNT frames to the specified frame. */
738 for (i = 0; i < count; i++)
740 /* Assume the dynamic chain pointer is in the word that the
741 frame address points to, unless otherwise specified. */
742 #ifdef DYNAMIC_CHAIN_ADDRESS
743 tem = DYNAMIC_CHAIN_ADDRESS (tem);
745 tem = memory_address (Pmode, tem);
746 tem = gen_frame_mem (Pmode, tem);
747 tem = copy_to_reg (tem);
750 /* For __builtin_frame_address, return what we've got. But, on
751 the SPARC for example, we may have to add a bias. */
752 if (fndecl_code == BUILT_IN_FRAME_ADDRESS)
753 #ifdef FRAME_ADDR_RTX
754 return FRAME_ADDR_RTX (tem);
759 /* For __builtin_return_address, get the return address from that frame. */
760 #ifdef RETURN_ADDR_RTX
761 tem = RETURN_ADDR_RTX (count, tem);
763 tem = memory_address (Pmode,
764 plus_constant (tem, GET_MODE_SIZE (Pmode)));
765 tem = gen_frame_mem (Pmode, tem);
770 /* Alias set used for setjmp buffer. */
771 static alias_set_type setjmp_alias_set = -1;
773 /* Construct the leading half of a __builtin_setjmp call. Control will
774 return to RECEIVER_LABEL. This is also called directly by the SJLJ
775 exception handling code. */
778 expand_builtin_setjmp_setup (rtx buf_addr, rtx receiver_label)
780 enum machine_mode sa_mode = STACK_SAVEAREA_MODE (SAVE_NONLOCAL);
784 if (setjmp_alias_set == -1)
785 setjmp_alias_set = new_alias_set ();
787 buf_addr = convert_memory_address (Pmode, buf_addr);
789 buf_addr = force_reg (Pmode, force_operand (buf_addr, NULL_RTX));
791 /* We store the frame pointer and the address of receiver_label in
792 the buffer and use the rest of it for the stack save area, which
793 is machine-dependent. */
795 mem = gen_rtx_MEM (Pmode, buf_addr);
796 set_mem_alias_set (mem, setjmp_alias_set);
797 emit_move_insn (mem, targetm.builtin_setjmp_frame_value ());
799 mem = gen_rtx_MEM (Pmode, plus_constant (buf_addr, GET_MODE_SIZE (Pmode))),
800 set_mem_alias_set (mem, setjmp_alias_set);
802 emit_move_insn (validize_mem (mem),
803 force_reg (Pmode, gen_rtx_LABEL_REF (Pmode, receiver_label)));
805 stack_save = gen_rtx_MEM (sa_mode,
806 plus_constant (buf_addr,
807 2 * GET_MODE_SIZE (Pmode)));
808 set_mem_alias_set (stack_save, setjmp_alias_set);
809 emit_stack_save (SAVE_NONLOCAL, &stack_save);
811 /* If there is further processing to do, do it. */
812 #ifdef HAVE_builtin_setjmp_setup
813 if (HAVE_builtin_setjmp_setup)
814 emit_insn (gen_builtin_setjmp_setup (buf_addr));
817 /* We have a nonlocal label. */
818 cfun->has_nonlocal_label = 1;
821 /* Construct the trailing part of a __builtin_setjmp call. This is
822 also called directly by the SJLJ exception handling code. */
825 expand_builtin_setjmp_receiver (rtx receiver_label ATTRIBUTE_UNUSED)
829 /* Clobber the FP when we get here, so we have to make sure it's
830 marked as used by this function. */
831 emit_use (hard_frame_pointer_rtx);
833 /* Mark the static chain as clobbered here so life information
834 doesn't get messed up for it. */
835 chain = targetm.calls.static_chain (current_function_decl, true);
836 if (chain && REG_P (chain))
837 emit_clobber (chain);
839 /* Now put in the code to restore the frame pointer, and argument
840 pointer, if needed. */
841 #ifdef HAVE_nonlocal_goto
842 if (! HAVE_nonlocal_goto)
845 emit_move_insn (virtual_stack_vars_rtx, hard_frame_pointer_rtx);
846 /* This might change the hard frame pointer in ways that aren't
847 apparent to early optimization passes, so force a clobber. */
848 emit_clobber (hard_frame_pointer_rtx);
851 #if !HARD_FRAME_POINTER_IS_ARG_POINTER
852 if (fixed_regs[ARG_POINTER_REGNUM])
854 #ifdef ELIMINABLE_REGS
856 static const struct elims {const int from, to;} elim_regs[] = ELIMINABLE_REGS;
858 for (i = 0; i < ARRAY_SIZE (elim_regs); i++)
859 if (elim_regs[i].from == ARG_POINTER_REGNUM
860 && elim_regs[i].to == HARD_FRAME_POINTER_REGNUM)
863 if (i == ARRAY_SIZE (elim_regs))
866 /* Now restore our arg pointer from the address at which it
867 was saved in our stack frame. */
868 emit_move_insn (crtl->args.internal_arg_pointer,
869 copy_to_reg (get_arg_pointer_save_area ()));
874 #ifdef HAVE_builtin_setjmp_receiver
875 if (HAVE_builtin_setjmp_receiver)
876 emit_insn (gen_builtin_setjmp_receiver (receiver_label));
879 #ifdef HAVE_nonlocal_goto_receiver
880 if (HAVE_nonlocal_goto_receiver)
881 emit_insn (gen_nonlocal_goto_receiver ());
886 /* We must not allow the code we just generated to be reordered by
887 scheduling. Specifically, the update of the frame pointer must
888 happen immediately, not later. */
889 emit_insn (gen_blockage ());
892 /* __builtin_longjmp is passed a pointer to an array of five words (not
893 all will be used on all machines). It operates similarly to the C
894 library function of the same name, but is more efficient. Much of
895 the code below is copied from the handling of non-local gotos. */
898 expand_builtin_longjmp (rtx buf_addr, rtx value)
900 rtx fp, lab, stack, insn, last;
901 enum machine_mode sa_mode = STACK_SAVEAREA_MODE (SAVE_NONLOCAL);
903 /* DRAP is needed for stack realign if longjmp is expanded to current
905 if (SUPPORTS_STACK_ALIGNMENT)
906 crtl->need_drap = true;
908 if (setjmp_alias_set == -1)
909 setjmp_alias_set = new_alias_set ();
911 buf_addr = convert_memory_address (Pmode, buf_addr);
913 buf_addr = force_reg (Pmode, buf_addr);
915 /* We require that the user must pass a second argument of 1, because
916 that is what builtin_setjmp will return. */
917 gcc_assert (value == const1_rtx);
919 last = get_last_insn ();
920 #ifdef HAVE_builtin_longjmp
921 if (HAVE_builtin_longjmp)
922 emit_insn (gen_builtin_longjmp (buf_addr));
926 fp = gen_rtx_MEM (Pmode, buf_addr);
927 lab = gen_rtx_MEM (Pmode, plus_constant (buf_addr,
928 GET_MODE_SIZE (Pmode)));
930 stack = gen_rtx_MEM (sa_mode, plus_constant (buf_addr,
931 2 * GET_MODE_SIZE (Pmode)));
932 set_mem_alias_set (fp, setjmp_alias_set);
933 set_mem_alias_set (lab, setjmp_alias_set);
934 set_mem_alias_set (stack, setjmp_alias_set);
936 /* Pick up FP, label, and SP from the block and jump. This code is
937 from expand_goto in stmt.c; see there for detailed comments. */
938 #ifdef HAVE_nonlocal_goto
939 if (HAVE_nonlocal_goto)
940 /* We have to pass a value to the nonlocal_goto pattern that will
941 get copied into the static_chain pointer, but it does not matter
942 what that value is, because builtin_setjmp does not use it. */
943 emit_insn (gen_nonlocal_goto (value, lab, stack, fp));
947 lab = copy_to_reg (lab);
949 emit_clobber (gen_rtx_MEM (BLKmode, gen_rtx_SCRATCH (VOIDmode)));
950 emit_clobber (gen_rtx_MEM (BLKmode, hard_frame_pointer_rtx));
952 emit_move_insn (hard_frame_pointer_rtx, fp);
953 emit_stack_restore (SAVE_NONLOCAL, stack);
955 emit_use (hard_frame_pointer_rtx);
956 emit_use (stack_pointer_rtx);
957 emit_indirect_jump (lab);
961 /* Search backwards and mark the jump insn as a non-local goto.
962 Note that this precludes the use of __builtin_longjmp to a
963 __builtin_setjmp target in the same function. However, we've
964 already cautioned the user that these functions are for
965 internal exception handling use only. */
966 for (insn = get_last_insn (); insn; insn = PREV_INSN (insn))
968 gcc_assert (insn != last);
972 add_reg_note (insn, REG_NON_LOCAL_GOTO, const0_rtx);
975 else if (CALL_P (insn))
980 /* Expand a call to __builtin_nonlocal_goto. We're passed the target label
981 and the address of the save area. */
984 expand_builtin_nonlocal_goto (tree exp)
986 tree t_label, t_save_area;
987 rtx r_label, r_save_area, r_fp, r_sp, insn;
989 if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
992 t_label = CALL_EXPR_ARG (exp, 0);
993 t_save_area = CALL_EXPR_ARG (exp, 1);
995 r_label = expand_normal (t_label);
996 r_label = convert_memory_address (Pmode, r_label);
997 r_save_area = expand_normal (t_save_area);
998 r_save_area = convert_memory_address (Pmode, r_save_area);
999 /* Copy the address of the save location to a register just in case it was
1000 based on the frame pointer. */
1001 r_save_area = copy_to_reg (r_save_area);
1002 r_fp = gen_rtx_MEM (Pmode, r_save_area);
1003 r_sp = gen_rtx_MEM (STACK_SAVEAREA_MODE (SAVE_NONLOCAL),
1004 plus_constant (r_save_area, GET_MODE_SIZE (Pmode)));
1006 crtl->has_nonlocal_goto = 1;
1008 #ifdef HAVE_nonlocal_goto
1009 /* ??? We no longer need to pass the static chain value, afaik. */
1010 if (HAVE_nonlocal_goto)
1011 emit_insn (gen_nonlocal_goto (const0_rtx, r_label, r_sp, r_fp));
1015 r_label = copy_to_reg (r_label);
1017 emit_clobber (gen_rtx_MEM (BLKmode, gen_rtx_SCRATCH (VOIDmode)));
1018 emit_clobber (gen_rtx_MEM (BLKmode, hard_frame_pointer_rtx));
1020 /* Restore frame pointer for containing function. */
1021 emit_move_insn (hard_frame_pointer_rtx, r_fp);
1022 emit_stack_restore (SAVE_NONLOCAL, r_sp);
1024 /* USE of hard_frame_pointer_rtx added for consistency;
1025 not clear if really needed. */
1026 emit_use (hard_frame_pointer_rtx);
1027 emit_use (stack_pointer_rtx);
1029 /* If the architecture is using a GP register, we must
1030 conservatively assume that the target function makes use of it.
1031 The prologue of functions with nonlocal gotos must therefore
1032 initialize the GP register to the appropriate value, and we
1033 must then make sure that this value is live at the point
1034 of the jump. (Note that this doesn't necessarily apply
1035 to targets with a nonlocal_goto pattern; they are free
1036 to implement it in their own way. Note also that this is
1037 a no-op if the GP register is a global invariant.) */
1038 if ((unsigned) PIC_OFFSET_TABLE_REGNUM != INVALID_REGNUM
1039 && fixed_regs[PIC_OFFSET_TABLE_REGNUM])
1040 emit_use (pic_offset_table_rtx);
1042 emit_indirect_jump (r_label);
1045 /* Search backwards to the jump insn and mark it as a
1047 for (insn = get_last_insn (); insn; insn = PREV_INSN (insn))
1051 add_reg_note (insn, REG_NON_LOCAL_GOTO, const0_rtx);
1054 else if (CALL_P (insn))
1061 /* __builtin_update_setjmp_buf is passed a pointer to an array of five words
1062 (not all will be used on all machines) that was passed to __builtin_setjmp.
1063 It updates the stack pointer in that block to correspond to the current
1067 expand_builtin_update_setjmp_buf (rtx buf_addr)
1069 enum machine_mode sa_mode = STACK_SAVEAREA_MODE (SAVE_NONLOCAL);
1071 = gen_rtx_MEM (sa_mode,
1074 plus_constant (buf_addr, 2 * GET_MODE_SIZE (Pmode))));
1076 emit_stack_save (SAVE_NONLOCAL, &stack_save);
1079 /* Expand a call to __builtin_prefetch. For a target that does not support
1080 data prefetch, evaluate the memory address argument in case it has side
1084 expand_builtin_prefetch (tree exp)
1086 tree arg0, arg1, arg2;
1090 if (!validate_arglist (exp, POINTER_TYPE, 0))
1093 arg0 = CALL_EXPR_ARG (exp, 0);
1095 /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
1096 zero (read) and argument 2 (locality) defaults to 3 (high degree of
1098 nargs = call_expr_nargs (exp);
1100 arg1 = CALL_EXPR_ARG (exp, 1);
1102 arg1 = integer_zero_node;
1104 arg2 = CALL_EXPR_ARG (exp, 2);
1106 arg2 = integer_three_node;
1108 /* Argument 0 is an address. */
1109 op0 = expand_expr (arg0, NULL_RTX, Pmode, EXPAND_NORMAL);
1111 /* Argument 1 (read/write flag) must be a compile-time constant int. */
1112 if (TREE_CODE (arg1) != INTEGER_CST)
1114 error ("second argument to %<__builtin_prefetch%> must be a constant");
1115 arg1 = integer_zero_node;
1117 op1 = expand_normal (arg1);
1118 /* Argument 1 must be either zero or one. */
1119 if (INTVAL (op1) != 0 && INTVAL (op1) != 1)
1121 warning (0, "invalid second argument to %<__builtin_prefetch%>;"
1126 /* Argument 2 (locality) must be a compile-time constant int. */
1127 if (TREE_CODE (arg2) != INTEGER_CST)
1129 error ("third argument to %<__builtin_prefetch%> must be a constant");
1130 arg2 = integer_zero_node;
1132 op2 = expand_normal (arg2);
1133 /* Argument 2 must be 0, 1, 2, or 3. */
1134 if (INTVAL (op2) < 0 || INTVAL (op2) > 3)
1136 warning (0, "invalid third argument to %<__builtin_prefetch%>; using zero");
1140 #ifdef HAVE_prefetch
1143 struct expand_operand ops[3];
1145 create_address_operand (&ops[0], op0);
1146 create_integer_operand (&ops[1], INTVAL (op1));
1147 create_integer_operand (&ops[2], INTVAL (op2));
1148 if (maybe_expand_insn (CODE_FOR_prefetch, 3, ops))
1153 /* Don't do anything with direct references to volatile memory, but
1154 generate code to handle other side effects. */
1155 if (!MEM_P (op0) && side_effects_p (op0))
1159 /* Get a MEM rtx for expression EXP which is the address of an operand
1160 to be used in a string instruction (cmpstrsi, movmemsi, ..). LEN is
1161 the maximum length of the block of memory that might be accessed or
1165 get_memory_rtx (tree exp, tree len)
1167 tree orig_exp = exp;
1171 /* When EXP is not resolved SAVE_EXPR, MEM_ATTRS can be still derived
1172 from its expression, for expr->a.b only <variable>.a.b is recorded. */
1173 if (TREE_CODE (exp) == SAVE_EXPR && !SAVE_EXPR_RESOLVED_P (exp))
1174 exp = TREE_OPERAND (exp, 0);
1176 addr = expand_expr (orig_exp, NULL_RTX, ptr_mode, EXPAND_NORMAL);
1177 mem = gen_rtx_MEM (BLKmode, memory_address (BLKmode, addr));
1179 /* Get an expression we can use to find the attributes to assign to MEM.
1180 If it is an ADDR_EXPR, use the operand. Otherwise, dereference it if
1181 we can. First remove any nops. */
1182 while (CONVERT_EXPR_P (exp)
1183 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (exp, 0))))
1184 exp = TREE_OPERAND (exp, 0);
1187 if (TREE_CODE (exp) == POINTER_PLUS_EXPR
1188 && TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
1189 && host_integerp (TREE_OPERAND (exp, 1), 0)
1190 && (off = tree_low_cst (TREE_OPERAND (exp, 1), 0)) > 0)
1191 exp = TREE_OPERAND (TREE_OPERAND (exp, 0), 0);
1192 else if (TREE_CODE (exp) == ADDR_EXPR)
1193 exp = TREE_OPERAND (exp, 0);
1194 else if (POINTER_TYPE_P (TREE_TYPE (exp)))
1195 exp = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (exp)), exp);
1199 /* Honor attributes derived from exp, except for the alias set
1200 (as builtin stringops may alias with anything) and the size
1201 (as stringops may access multiple array elements). */
1204 set_mem_attributes (mem, exp, 0);
1207 mem = adjust_automodify_address_nv (mem, BLKmode, NULL, off);
1209 /* Allow the string and memory builtins to overflow from one
1210 field into another, see http://gcc.gnu.org/PR23561.
1211 Thus avoid COMPONENT_REFs in MEM_EXPR unless we know the whole
1212 memory accessed by the string or memory builtin will fit
1213 within the field. */
1214 if (MEM_EXPR (mem) && TREE_CODE (MEM_EXPR (mem)) == COMPONENT_REF)
1216 tree mem_expr = MEM_EXPR (mem);
1217 HOST_WIDE_INT offset = -1, length = -1;
1220 while (TREE_CODE (inner) == ARRAY_REF
1221 || CONVERT_EXPR_P (inner)
1222 || TREE_CODE (inner) == VIEW_CONVERT_EXPR
1223 || TREE_CODE (inner) == SAVE_EXPR)
1224 inner = TREE_OPERAND (inner, 0);
1226 gcc_assert (TREE_CODE (inner) == COMPONENT_REF);
1228 if (MEM_OFFSET_KNOWN_P (mem))
1229 offset = MEM_OFFSET (mem);
1231 if (offset >= 0 && len && host_integerp (len, 0))
1232 length = tree_low_cst (len, 0);
1234 while (TREE_CODE (inner) == COMPONENT_REF)
1236 tree field = TREE_OPERAND (inner, 1);
1237 gcc_assert (TREE_CODE (mem_expr) == COMPONENT_REF);
1238 gcc_assert (field == TREE_OPERAND (mem_expr, 1));
1240 /* Bitfields are generally not byte-addressable. */
1241 gcc_assert (!DECL_BIT_FIELD (field)
1242 || ((tree_low_cst (DECL_FIELD_BIT_OFFSET (field), 1)
1243 % BITS_PER_UNIT) == 0
1244 && host_integerp (DECL_SIZE (field), 0)
1245 && (TREE_INT_CST_LOW (DECL_SIZE (field))
1246 % BITS_PER_UNIT) == 0));
1248 /* If we can prove that the memory starting at XEXP (mem, 0) and
1249 ending at XEXP (mem, 0) + LENGTH will fit into this field, we
1250 can keep the COMPONENT_REF in MEM_EXPR. But be careful with
1251 fields without DECL_SIZE_UNIT like flexible array members. */
1253 && DECL_SIZE_UNIT (field)
1254 && host_integerp (DECL_SIZE_UNIT (field), 0))
1257 = TREE_INT_CST_LOW (DECL_SIZE_UNIT (field));
1260 && offset + length <= size)
1265 && host_integerp (DECL_FIELD_OFFSET (field), 0))
1266 offset += TREE_INT_CST_LOW (DECL_FIELD_OFFSET (field))
1267 + tree_low_cst (DECL_FIELD_BIT_OFFSET (field), 1)
1275 mem_expr = TREE_OPERAND (mem_expr, 0);
1276 inner = TREE_OPERAND (inner, 0);
1279 if (mem_expr == NULL)
1281 if (mem_expr != MEM_EXPR (mem))
1283 set_mem_expr (mem, mem_expr);
1285 set_mem_offset (mem, offset);
1287 clear_mem_offset (mem);
1290 set_mem_alias_set (mem, 0);
1291 clear_mem_size (mem);
1297 /* Built-in functions to perform an untyped call and return. */
1299 #define apply_args_mode \
1300 (this_target_builtins->x_apply_args_mode)
1301 #define apply_result_mode \
1302 (this_target_builtins->x_apply_result_mode)
1304 /* Return the size required for the block returned by __builtin_apply_args,
1305 and initialize apply_args_mode. */
1308 apply_args_size (void)
1310 static int size = -1;
1313 enum machine_mode mode;
1315 /* The values computed by this function never change. */
1318 /* The first value is the incoming arg-pointer. */
1319 size = GET_MODE_SIZE (Pmode);
1321 /* The second value is the structure value address unless this is
1322 passed as an "invisible" first argument. */
1323 if (targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0))
1324 size += GET_MODE_SIZE (Pmode);
1326 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1327 if (FUNCTION_ARG_REGNO_P (regno))
1329 mode = targetm.calls.get_raw_arg_mode (regno);
1331 gcc_assert (mode != VOIDmode);
1333 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1334 if (size % align != 0)
1335 size = CEIL (size, align) * align;
1336 size += GET_MODE_SIZE (mode);
1337 apply_args_mode[regno] = mode;
1341 apply_args_mode[regno] = VOIDmode;
1347 /* Return the size required for the block returned by __builtin_apply,
1348 and initialize apply_result_mode. */
1351 apply_result_size (void)
1353 static int size = -1;
1355 enum machine_mode mode;
1357 /* The values computed by this function never change. */
1362 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1363 if (targetm.calls.function_value_regno_p (regno))
1365 mode = targetm.calls.get_raw_result_mode (regno);
1367 gcc_assert (mode != VOIDmode);
1369 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1370 if (size % align != 0)
1371 size = CEIL (size, align) * align;
1372 size += GET_MODE_SIZE (mode);
1373 apply_result_mode[regno] = mode;
1376 apply_result_mode[regno] = VOIDmode;
1378 /* Allow targets that use untyped_call and untyped_return to override
1379 the size so that machine-specific information can be stored here. */
1380 #ifdef APPLY_RESULT_SIZE
1381 size = APPLY_RESULT_SIZE;
1387 #if defined (HAVE_untyped_call) || defined (HAVE_untyped_return)
1388 /* Create a vector describing the result block RESULT. If SAVEP is true,
1389 the result block is used to save the values; otherwise it is used to
1390 restore the values. */
1393 result_vector (int savep, rtx result)
1395 int regno, size, align, nelts;
1396 enum machine_mode mode;
1398 rtx *savevec = XALLOCAVEC (rtx, FIRST_PSEUDO_REGISTER);
1401 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1402 if ((mode = apply_result_mode[regno]) != VOIDmode)
1404 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1405 if (size % align != 0)
1406 size = CEIL (size, align) * align;
1407 reg = gen_rtx_REG (mode, savep ? regno : INCOMING_REGNO (regno));
1408 mem = adjust_address (result, mode, size);
1409 savevec[nelts++] = (savep
1410 ? gen_rtx_SET (VOIDmode, mem, reg)
1411 : gen_rtx_SET (VOIDmode, reg, mem));
1412 size += GET_MODE_SIZE (mode);
1414 return gen_rtx_PARALLEL (VOIDmode, gen_rtvec_v (nelts, savevec));
1416 #endif /* HAVE_untyped_call or HAVE_untyped_return */
1418 /* Save the state required to perform an untyped call with the same
1419 arguments as were passed to the current function. */
1422 expand_builtin_apply_args_1 (void)
1425 int size, align, regno;
1426 enum machine_mode mode;
1427 rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1429 /* Create a block where the arg-pointer, structure value address,
1430 and argument registers can be saved. */
1431 registers = assign_stack_local (BLKmode, apply_args_size (), -1);
1433 /* Walk past the arg-pointer and structure value address. */
1434 size = GET_MODE_SIZE (Pmode);
1435 if (targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0))
1436 size += GET_MODE_SIZE (Pmode);
1438 /* Save each register used in calling a function to the block. */
1439 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1440 if ((mode = apply_args_mode[regno]) != VOIDmode)
1442 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1443 if (size % align != 0)
1444 size = CEIL (size, align) * align;
1446 tem = gen_rtx_REG (mode, INCOMING_REGNO (regno));
1448 emit_move_insn (adjust_address (registers, mode, size), tem);
1449 size += GET_MODE_SIZE (mode);
1452 /* Save the arg pointer to the block. */
1453 tem = copy_to_reg (crtl->args.internal_arg_pointer);
1454 #ifdef STACK_GROWS_DOWNWARD
1455 /* We need the pointer as the caller actually passed them to us, not
1456 as we might have pretended they were passed. Make sure it's a valid
1457 operand, as emit_move_insn isn't expected to handle a PLUS. */
1459 = force_operand (plus_constant (tem, crtl->args.pretend_args_size),
1462 emit_move_insn (adjust_address (registers, Pmode, 0), tem);
1464 size = GET_MODE_SIZE (Pmode);
1466 /* Save the structure value address unless this is passed as an
1467 "invisible" first argument. */
1468 if (struct_incoming_value)
1470 emit_move_insn (adjust_address (registers, Pmode, size),
1471 copy_to_reg (struct_incoming_value));
1472 size += GET_MODE_SIZE (Pmode);
1475 /* Return the address of the block. */
1476 return copy_addr_to_reg (XEXP (registers, 0));
1479 /* __builtin_apply_args returns block of memory allocated on
1480 the stack into which is stored the arg pointer, structure
1481 value address, static chain, and all the registers that might
1482 possibly be used in performing a function call. The code is
1483 moved to the start of the function so the incoming values are
1487 expand_builtin_apply_args (void)
1489 /* Don't do __builtin_apply_args more than once in a function.
1490 Save the result of the first call and reuse it. */
1491 if (apply_args_value != 0)
1492 return apply_args_value;
1494 /* When this function is called, it means that registers must be
1495 saved on entry to this function. So we migrate the
1496 call to the first insn of this function. */
1501 temp = expand_builtin_apply_args_1 ();
1505 apply_args_value = temp;
1507 /* Put the insns after the NOTE that starts the function.
1508 If this is inside a start_sequence, make the outer-level insn
1509 chain current, so the code is placed at the start of the
1510 function. If internal_arg_pointer is a non-virtual pseudo,
1511 it needs to be placed after the function that initializes
1513 push_topmost_sequence ();
1514 if (REG_P (crtl->args.internal_arg_pointer)
1515 && REGNO (crtl->args.internal_arg_pointer) > LAST_VIRTUAL_REGISTER)
1516 emit_insn_before (seq, parm_birth_insn);
1518 emit_insn_before (seq, NEXT_INSN (entry_of_function ()));
1519 pop_topmost_sequence ();
1524 /* Perform an untyped call and save the state required to perform an
1525 untyped return of whatever value was returned by the given function. */
1528 expand_builtin_apply (rtx function, rtx arguments, rtx argsize)
1530 int size, align, regno;
1531 enum machine_mode mode;
1532 rtx incoming_args, result, reg, dest, src, call_insn;
1533 rtx old_stack_level = 0;
1534 rtx call_fusage = 0;
1535 rtx struct_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0);
1537 arguments = convert_memory_address (Pmode, arguments);
1539 /* Create a block where the return registers can be saved. */
1540 result = assign_stack_local (BLKmode, apply_result_size (), -1);
1542 /* Fetch the arg pointer from the ARGUMENTS block. */
1543 incoming_args = gen_reg_rtx (Pmode);
1544 emit_move_insn (incoming_args, gen_rtx_MEM (Pmode, arguments));
1545 #ifndef STACK_GROWS_DOWNWARD
1546 incoming_args = expand_simple_binop (Pmode, MINUS, incoming_args, argsize,
1547 incoming_args, 0, OPTAB_LIB_WIDEN);
1550 /* Push a new argument block and copy the arguments. Do not allow
1551 the (potential) memcpy call below to interfere with our stack
1553 do_pending_stack_adjust ();
1556 /* Save the stack with nonlocal if available. */
1557 #ifdef HAVE_save_stack_nonlocal
1558 if (HAVE_save_stack_nonlocal)
1559 emit_stack_save (SAVE_NONLOCAL, &old_stack_level);
1562 emit_stack_save (SAVE_BLOCK, &old_stack_level);
1564 /* Allocate a block of memory onto the stack and copy the memory
1565 arguments to the outgoing arguments address. We can pass TRUE
1566 as the 4th argument because we just saved the stack pointer
1567 and will restore it right after the call. */
1568 allocate_dynamic_stack_space (argsize, 0, BIGGEST_ALIGNMENT, true);
1570 /* Set DRAP flag to true, even though allocate_dynamic_stack_space
1571 may have already set current_function_calls_alloca to true.
1572 current_function_calls_alloca won't be set if argsize is zero,
1573 so we have to guarantee need_drap is true here. */
1574 if (SUPPORTS_STACK_ALIGNMENT)
1575 crtl->need_drap = true;
1577 dest = virtual_outgoing_args_rtx;
1578 #ifndef STACK_GROWS_DOWNWARD
1579 if (CONST_INT_P (argsize))
1580 dest = plus_constant (dest, -INTVAL (argsize));
1582 dest = gen_rtx_PLUS (Pmode, dest, negate_rtx (Pmode, argsize));
1584 dest = gen_rtx_MEM (BLKmode, dest);
1585 set_mem_align (dest, PARM_BOUNDARY);
1586 src = gen_rtx_MEM (BLKmode, incoming_args);
1587 set_mem_align (src, PARM_BOUNDARY);
1588 emit_block_move (dest, src, argsize, BLOCK_OP_NORMAL);
1590 /* Refer to the argument block. */
1592 arguments = gen_rtx_MEM (BLKmode, arguments);
1593 set_mem_align (arguments, PARM_BOUNDARY);
1595 /* Walk past the arg-pointer and structure value address. */
1596 size = GET_MODE_SIZE (Pmode);
1598 size += GET_MODE_SIZE (Pmode);
1600 /* Restore each of the registers previously saved. Make USE insns
1601 for each of these registers for use in making the call. */
1602 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1603 if ((mode = apply_args_mode[regno]) != VOIDmode)
1605 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1606 if (size % align != 0)
1607 size = CEIL (size, align) * align;
1608 reg = gen_rtx_REG (mode, regno);
1609 emit_move_insn (reg, adjust_address (arguments, mode, size));
1610 use_reg (&call_fusage, reg);
1611 size += GET_MODE_SIZE (mode);
1614 /* Restore the structure value address unless this is passed as an
1615 "invisible" first argument. */
1616 size = GET_MODE_SIZE (Pmode);
1619 rtx value = gen_reg_rtx (Pmode);
1620 emit_move_insn (value, adjust_address (arguments, Pmode, size));
1621 emit_move_insn (struct_value, value);
1622 if (REG_P (struct_value))
1623 use_reg (&call_fusage, struct_value);
1624 size += GET_MODE_SIZE (Pmode);
1627 /* All arguments and registers used for the call are set up by now! */
1628 function = prepare_call_address (NULL, function, NULL, &call_fusage, 0, 0);
1630 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1631 and we don't want to load it into a register as an optimization,
1632 because prepare_call_address already did it if it should be done. */
1633 if (GET_CODE (function) != SYMBOL_REF)
1634 function = memory_address (FUNCTION_MODE, function);
1636 /* Generate the actual call instruction and save the return value. */
1637 #ifdef HAVE_untyped_call
1638 if (HAVE_untyped_call)
1639 emit_call_insn (gen_untyped_call (gen_rtx_MEM (FUNCTION_MODE, function),
1640 result, result_vector (1, result)));
1643 #ifdef HAVE_call_value
1644 if (HAVE_call_value)
1648 /* Locate the unique return register. It is not possible to
1649 express a call that sets more than one return register using
1650 call_value; use untyped_call for that. In fact, untyped_call
1651 only needs to save the return registers in the given block. */
1652 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1653 if ((mode = apply_result_mode[regno]) != VOIDmode)
1655 gcc_assert (!valreg); /* HAVE_untyped_call required. */
1657 valreg = gen_rtx_REG (mode, regno);
1660 emit_call_insn (GEN_CALL_VALUE (valreg,
1661 gen_rtx_MEM (FUNCTION_MODE, function),
1662 const0_rtx, NULL_RTX, const0_rtx));
1664 emit_move_insn (adjust_address (result, GET_MODE (valreg), 0), valreg);
1670 /* Find the CALL insn we just emitted, and attach the register usage
1672 call_insn = last_call_insn ();
1673 add_function_usage_to (call_insn, call_fusage);
1675 /* Restore the stack. */
1676 #ifdef HAVE_save_stack_nonlocal
1677 if (HAVE_save_stack_nonlocal)
1678 emit_stack_restore (SAVE_NONLOCAL, old_stack_level);
1681 emit_stack_restore (SAVE_BLOCK, old_stack_level);
1682 fixup_args_size_notes (call_insn, get_last_insn(), 0);
1686 /* Return the address of the result block. */
1687 result = copy_addr_to_reg (XEXP (result, 0));
1688 return convert_memory_address (ptr_mode, result);
1691 /* Perform an untyped return. */
1694 expand_builtin_return (rtx result)
1696 int size, align, regno;
1697 enum machine_mode mode;
1699 rtx call_fusage = 0;
1701 result = convert_memory_address (Pmode, result);
1703 apply_result_size ();
1704 result = gen_rtx_MEM (BLKmode, result);
1706 #ifdef HAVE_untyped_return
1707 if (HAVE_untyped_return)
1709 emit_jump_insn (gen_untyped_return (result, result_vector (0, result)));
1715 /* Restore the return value and note that each value is used. */
1717 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1718 if ((mode = apply_result_mode[regno]) != VOIDmode)
1720 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1721 if (size % align != 0)
1722 size = CEIL (size, align) * align;
1723 reg = gen_rtx_REG (mode, INCOMING_REGNO (regno));
1724 emit_move_insn (reg, adjust_address (result, mode, size));
1726 push_to_sequence (call_fusage);
1728 call_fusage = get_insns ();
1730 size += GET_MODE_SIZE (mode);
1733 /* Put the USE insns before the return. */
1734 emit_insn (call_fusage);
1736 /* Return whatever values was restored by jumping directly to the end
1738 expand_naked_return ();
1741 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1743 static enum type_class
1744 type_to_class (tree type)
1746 switch (TREE_CODE (type))
1748 case VOID_TYPE: return void_type_class;
1749 case INTEGER_TYPE: return integer_type_class;
1750 case ENUMERAL_TYPE: return enumeral_type_class;
1751 case BOOLEAN_TYPE: return boolean_type_class;
1752 case POINTER_TYPE: return pointer_type_class;
1753 case REFERENCE_TYPE: return reference_type_class;
1754 case OFFSET_TYPE: return offset_type_class;
1755 case REAL_TYPE: return real_type_class;
1756 case COMPLEX_TYPE: return complex_type_class;
1757 case FUNCTION_TYPE: return function_type_class;
1758 case METHOD_TYPE: return method_type_class;
1759 case RECORD_TYPE: return record_type_class;
1761 case QUAL_UNION_TYPE: return union_type_class;
1762 case ARRAY_TYPE: return (TYPE_STRING_FLAG (type)
1763 ? string_type_class : array_type_class);
1764 case LANG_TYPE: return lang_type_class;
1765 default: return no_type_class;
1769 /* Expand a call EXP to __builtin_classify_type. */
1772 expand_builtin_classify_type (tree exp)
1774 if (call_expr_nargs (exp))
1775 return GEN_INT (type_to_class (TREE_TYPE (CALL_EXPR_ARG (exp, 0))));
1776 return GEN_INT (no_type_class);
1779 /* This helper macro, meant to be used in mathfn_built_in below,
1780 determines which among a set of three builtin math functions is
1781 appropriate for a given type mode. The `F' and `L' cases are
1782 automatically generated from the `double' case. */
1783 #define CASE_MATHFN(BUILT_IN_MATHFN) \
1784 case BUILT_IN_MATHFN: case BUILT_IN_MATHFN##F: case BUILT_IN_MATHFN##L: \
1785 fcode = BUILT_IN_MATHFN; fcodef = BUILT_IN_MATHFN##F ; \
1786 fcodel = BUILT_IN_MATHFN##L ; break;
1787 /* Similar to above, but appends _R after any F/L suffix. */
1788 #define CASE_MATHFN_REENT(BUILT_IN_MATHFN) \
1789 case BUILT_IN_MATHFN##_R: case BUILT_IN_MATHFN##F_R: case BUILT_IN_MATHFN##L_R: \
1790 fcode = BUILT_IN_MATHFN##_R; fcodef = BUILT_IN_MATHFN##F_R ; \
1791 fcodel = BUILT_IN_MATHFN##L_R ; break;
1793 /* Return mathematic function equivalent to FN but operating directly on TYPE,
1794 if available. If IMPLICIT is true use the implicit builtin declaration,
1795 otherwise use the explicit declaration. If we can't do the conversion,
1799 mathfn_built_in_1 (tree type, enum built_in_function fn, bool implicit_p)
1801 enum built_in_function fcode, fcodef, fcodel, fcode2;
1805 CASE_MATHFN (BUILT_IN_ACOS)
1806 CASE_MATHFN (BUILT_IN_ACOSH)
1807 CASE_MATHFN (BUILT_IN_ASIN)
1808 CASE_MATHFN (BUILT_IN_ASINH)
1809 CASE_MATHFN (BUILT_IN_ATAN)
1810 CASE_MATHFN (BUILT_IN_ATAN2)
1811 CASE_MATHFN (BUILT_IN_ATANH)
1812 CASE_MATHFN (BUILT_IN_CBRT)
1813 CASE_MATHFN (BUILT_IN_CEIL)
1814 CASE_MATHFN (BUILT_IN_CEXPI)
1815 CASE_MATHFN (BUILT_IN_COPYSIGN)
1816 CASE_MATHFN (BUILT_IN_COS)
1817 CASE_MATHFN (BUILT_IN_COSH)
1818 CASE_MATHFN (BUILT_IN_DREM)
1819 CASE_MATHFN (BUILT_IN_ERF)
1820 CASE_MATHFN (BUILT_IN_ERFC)
1821 CASE_MATHFN (BUILT_IN_EXP)
1822 CASE_MATHFN (BUILT_IN_EXP10)
1823 CASE_MATHFN (BUILT_IN_EXP2)
1824 CASE_MATHFN (BUILT_IN_EXPM1)
1825 CASE_MATHFN (BUILT_IN_FABS)
1826 CASE_MATHFN (BUILT_IN_FDIM)
1827 CASE_MATHFN (BUILT_IN_FLOOR)
1828 CASE_MATHFN (BUILT_IN_FMA)
1829 CASE_MATHFN (BUILT_IN_FMAX)
1830 CASE_MATHFN (BUILT_IN_FMIN)
1831 CASE_MATHFN (BUILT_IN_FMOD)
1832 CASE_MATHFN (BUILT_IN_FREXP)
1833 CASE_MATHFN (BUILT_IN_GAMMA)
1834 CASE_MATHFN_REENT (BUILT_IN_GAMMA) /* GAMMA_R */
1835 CASE_MATHFN (BUILT_IN_HUGE_VAL)
1836 CASE_MATHFN (BUILT_IN_HYPOT)
1837 CASE_MATHFN (BUILT_IN_ILOGB)
1838 CASE_MATHFN (BUILT_IN_ICEIL)
1839 CASE_MATHFN (BUILT_IN_IFLOOR)
1840 CASE_MATHFN (BUILT_IN_INF)
1841 CASE_MATHFN (BUILT_IN_IRINT)
1842 CASE_MATHFN (BUILT_IN_IROUND)
1843 CASE_MATHFN (BUILT_IN_ISINF)
1844 CASE_MATHFN (BUILT_IN_J0)
1845 CASE_MATHFN (BUILT_IN_J1)
1846 CASE_MATHFN (BUILT_IN_JN)
1847 CASE_MATHFN (BUILT_IN_LCEIL)
1848 CASE_MATHFN (BUILT_IN_LDEXP)
1849 CASE_MATHFN (BUILT_IN_LFLOOR)
1850 CASE_MATHFN (BUILT_IN_LGAMMA)
1851 CASE_MATHFN_REENT (BUILT_IN_LGAMMA) /* LGAMMA_R */
1852 CASE_MATHFN (BUILT_IN_LLCEIL)
1853 CASE_MATHFN (BUILT_IN_LLFLOOR)
1854 CASE_MATHFN (BUILT_IN_LLRINT)
1855 CASE_MATHFN (BUILT_IN_LLROUND)
1856 CASE_MATHFN (BUILT_IN_LOG)
1857 CASE_MATHFN (BUILT_IN_LOG10)
1858 CASE_MATHFN (BUILT_IN_LOG1P)
1859 CASE_MATHFN (BUILT_IN_LOG2)
1860 CASE_MATHFN (BUILT_IN_LOGB)
1861 CASE_MATHFN (BUILT_IN_LRINT)
1862 CASE_MATHFN (BUILT_IN_LROUND)
1863 CASE_MATHFN (BUILT_IN_MODF)
1864 CASE_MATHFN (BUILT_IN_NAN)
1865 CASE_MATHFN (BUILT_IN_NANS)
1866 CASE_MATHFN (BUILT_IN_NEARBYINT)
1867 CASE_MATHFN (BUILT_IN_NEXTAFTER)
1868 CASE_MATHFN (BUILT_IN_NEXTTOWARD)
1869 CASE_MATHFN (BUILT_IN_POW)
1870 CASE_MATHFN (BUILT_IN_POWI)
1871 CASE_MATHFN (BUILT_IN_POW10)
1872 CASE_MATHFN (BUILT_IN_REMAINDER)
1873 CASE_MATHFN (BUILT_IN_REMQUO)
1874 CASE_MATHFN (BUILT_IN_RINT)
1875 CASE_MATHFN (BUILT_IN_ROUND)
1876 CASE_MATHFN (BUILT_IN_SCALB)
1877 CASE_MATHFN (BUILT_IN_SCALBLN)
1878 CASE_MATHFN (BUILT_IN_SCALBN)
1879 CASE_MATHFN (BUILT_IN_SIGNBIT)
1880 CASE_MATHFN (BUILT_IN_SIGNIFICAND)
1881 CASE_MATHFN (BUILT_IN_SIN)
1882 CASE_MATHFN (BUILT_IN_SINCOS)
1883 CASE_MATHFN (BUILT_IN_SINH)
1884 CASE_MATHFN (BUILT_IN_SQRT)
1885 CASE_MATHFN (BUILT_IN_TAN)
1886 CASE_MATHFN (BUILT_IN_TANH)
1887 CASE_MATHFN (BUILT_IN_TGAMMA)
1888 CASE_MATHFN (BUILT_IN_TRUNC)
1889 CASE_MATHFN (BUILT_IN_Y0)
1890 CASE_MATHFN (BUILT_IN_Y1)
1891 CASE_MATHFN (BUILT_IN_YN)
1897 if (TYPE_MAIN_VARIANT (type) == double_type_node)
1899 else if (TYPE_MAIN_VARIANT (type) == float_type_node)
1901 else if (TYPE_MAIN_VARIANT (type) == long_double_type_node)
1906 if (implicit_p && !builtin_decl_implicit_p (fcode2))
1909 return builtin_decl_explicit (fcode2);
1912 /* Like mathfn_built_in_1(), but always use the implicit array. */
1915 mathfn_built_in (tree type, enum built_in_function fn)
1917 return mathfn_built_in_1 (type, fn, /*implicit=*/ 1);
1920 /* If errno must be maintained, expand the RTL to check if the result,
1921 TARGET, of a built-in function call, EXP, is NaN, and if so set
1925 expand_errno_check (tree exp, rtx target)
1927 rtx lab = gen_label_rtx ();
1929 /* Test the result; if it is NaN, set errno=EDOM because
1930 the argument was not in the domain. */
1931 do_compare_rtx_and_jump (target, target, EQ, 0, GET_MODE (target),
1932 NULL_RTX, NULL_RTX, lab,
1933 /* The jump is very likely. */
1934 REG_BR_PROB_BASE - (REG_BR_PROB_BASE / 2000 - 1));
1937 /* If this built-in doesn't throw an exception, set errno directly. */
1938 if (TREE_NOTHROW (TREE_OPERAND (CALL_EXPR_FN (exp), 0)))
1940 #ifdef GEN_ERRNO_RTX
1941 rtx errno_rtx = GEN_ERRNO_RTX;
1944 = gen_rtx_MEM (word_mode, gen_rtx_SYMBOL_REF (Pmode, "errno"));
1946 emit_move_insn (errno_rtx, GEN_INT (TARGET_EDOM));
1952 /* Make sure the library call isn't expanded as a tail call. */
1953 CALL_EXPR_TAILCALL (exp) = 0;
1955 /* We can't set errno=EDOM directly; let the library call do it.
1956 Pop the arguments right away in case the call gets deleted. */
1958 expand_call (exp, target, 0);
1963 /* Expand a call to one of the builtin math functions (sqrt, exp, or log).
1964 Return NULL_RTX if a normal call should be emitted rather than expanding
1965 the function in-line. EXP is the expression that is a call to the builtin
1966 function; if convenient, the result should be placed in TARGET.
1967 SUBTARGET may be used as the target for computing one of EXP's operands. */
1970 expand_builtin_mathfn (tree exp, rtx target, rtx subtarget)
1972 optab builtin_optab;
1974 tree fndecl = get_callee_fndecl (exp);
1975 enum machine_mode mode;
1976 bool errno_set = false;
1979 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
1982 arg = CALL_EXPR_ARG (exp, 0);
1984 switch (DECL_FUNCTION_CODE (fndecl))
1986 CASE_FLT_FN (BUILT_IN_SQRT):
1987 errno_set = ! tree_expr_nonnegative_p (arg);
1988 builtin_optab = sqrt_optab;
1990 CASE_FLT_FN (BUILT_IN_EXP):
1991 errno_set = true; builtin_optab = exp_optab; break;
1992 CASE_FLT_FN (BUILT_IN_EXP10):
1993 CASE_FLT_FN (BUILT_IN_POW10):
1994 errno_set = true; builtin_optab = exp10_optab; break;
1995 CASE_FLT_FN (BUILT_IN_EXP2):
1996 errno_set = true; builtin_optab = exp2_optab; break;
1997 CASE_FLT_FN (BUILT_IN_EXPM1):
1998 errno_set = true; builtin_optab = expm1_optab; break;
1999 CASE_FLT_FN (BUILT_IN_LOGB):
2000 errno_set = true; builtin_optab = logb_optab; break;
2001 CASE_FLT_FN (BUILT_IN_LOG):
2002 errno_set = true; builtin_optab = log_optab; break;
2003 CASE_FLT_FN (BUILT_IN_LOG10):
2004 errno_set = true; builtin_optab = log10_optab; break;
2005 CASE_FLT_FN (BUILT_IN_LOG2):
2006 errno_set = true; builtin_optab = log2_optab; break;
2007 CASE_FLT_FN (BUILT_IN_LOG1P):
2008 errno_set = true; builtin_optab = log1p_optab; break;
2009 CASE_FLT_FN (BUILT_IN_ASIN):
2010 builtin_optab = asin_optab; break;
2011 CASE_FLT_FN (BUILT_IN_ACOS):
2012 builtin_optab = acos_optab; break;
2013 CASE_FLT_FN (BUILT_IN_TAN):
2014 builtin_optab = tan_optab; break;
2015 CASE_FLT_FN (BUILT_IN_ATAN):
2016 builtin_optab = atan_optab; break;
2017 CASE_FLT_FN (BUILT_IN_FLOOR):
2018 builtin_optab = floor_optab; break;
2019 CASE_FLT_FN (BUILT_IN_CEIL):
2020 builtin_optab = ceil_optab; break;
2021 CASE_FLT_FN (BUILT_IN_TRUNC):
2022 builtin_optab = btrunc_optab; break;
2023 CASE_FLT_FN (BUILT_IN_ROUND):
2024 builtin_optab = round_optab; break;
2025 CASE_FLT_FN (BUILT_IN_NEARBYINT):
2026 builtin_optab = nearbyint_optab;
2027 if (flag_trapping_math)
2029 /* Else fallthrough and expand as rint. */
2030 CASE_FLT_FN (BUILT_IN_RINT):
2031 builtin_optab = rint_optab; break;
2032 CASE_FLT_FN (BUILT_IN_SIGNIFICAND):
2033 builtin_optab = significand_optab; break;
2038 /* Make a suitable register to place result in. */
2039 mode = TYPE_MODE (TREE_TYPE (exp));
2041 if (! flag_errno_math || ! HONOR_NANS (mode))
2044 /* Before working hard, check whether the instruction is available. */
2045 if (optab_handler (builtin_optab, mode) != CODE_FOR_nothing
2046 && (!errno_set || !optimize_insn_for_size_p ()))
2048 target = gen_reg_rtx (mode);
2050 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2051 need to expand the argument again. This way, we will not perform
2052 side-effects more the once. */
2053 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2055 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
2059 /* Compute into TARGET.
2060 Set TARGET to wherever the result comes back. */
2061 target = expand_unop (mode, builtin_optab, op0, target, 0);
2066 expand_errno_check (exp, target);
2068 /* Output the entire sequence. */
2069 insns = get_insns ();
2075 /* If we were unable to expand via the builtin, stop the sequence
2076 (without outputting the insns) and call to the library function
2077 with the stabilized argument list. */
2081 return expand_call (exp, target, target == const0_rtx);
2084 /* Expand a call to the builtin binary math functions (pow and atan2).
2085 Return NULL_RTX if a normal call should be emitted rather than expanding the
2086 function in-line. EXP is the expression that is a call to the builtin
2087 function; if convenient, the result should be placed in TARGET.
2088 SUBTARGET may be used as the target for computing one of EXP's
2092 expand_builtin_mathfn_2 (tree exp, rtx target, rtx subtarget)
2094 optab builtin_optab;
2095 rtx op0, op1, insns;
2096 int op1_type = REAL_TYPE;
2097 tree fndecl = get_callee_fndecl (exp);
2099 enum machine_mode mode;
2100 bool errno_set = true;
2102 switch (DECL_FUNCTION_CODE (fndecl))
2104 CASE_FLT_FN (BUILT_IN_SCALBN):
2105 CASE_FLT_FN (BUILT_IN_SCALBLN):
2106 CASE_FLT_FN (BUILT_IN_LDEXP):
2107 op1_type = INTEGER_TYPE;
2112 if (!validate_arglist (exp, REAL_TYPE, op1_type, VOID_TYPE))
2115 arg0 = CALL_EXPR_ARG (exp, 0);
2116 arg1 = CALL_EXPR_ARG (exp, 1);
2118 switch (DECL_FUNCTION_CODE (fndecl))
2120 CASE_FLT_FN (BUILT_IN_POW):
2121 builtin_optab = pow_optab; break;
2122 CASE_FLT_FN (BUILT_IN_ATAN2):
2123 builtin_optab = atan2_optab; break;
2124 CASE_FLT_FN (BUILT_IN_SCALB):
2125 if (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (exp)))->b != 2)
2127 builtin_optab = scalb_optab; break;
2128 CASE_FLT_FN (BUILT_IN_SCALBN):
2129 CASE_FLT_FN (BUILT_IN_SCALBLN):
2130 if (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (exp)))->b != 2)
2132 /* Fall through... */
2133 CASE_FLT_FN (BUILT_IN_LDEXP):
2134 builtin_optab = ldexp_optab; break;
2135 CASE_FLT_FN (BUILT_IN_FMOD):
2136 builtin_optab = fmod_optab; break;
2137 CASE_FLT_FN (BUILT_IN_REMAINDER):
2138 CASE_FLT_FN (BUILT_IN_DREM):
2139 builtin_optab = remainder_optab; break;
2144 /* Make a suitable register to place result in. */
2145 mode = TYPE_MODE (TREE_TYPE (exp));
2147 /* Before working hard, check whether the instruction is available. */
2148 if (optab_handler (builtin_optab, mode) == CODE_FOR_nothing)
2151 target = gen_reg_rtx (mode);
2153 if (! flag_errno_math || ! HONOR_NANS (mode))
2156 if (errno_set && optimize_insn_for_size_p ())
2159 /* Always stabilize the argument list. */
2160 CALL_EXPR_ARG (exp, 0) = arg0 = builtin_save_expr (arg0);
2161 CALL_EXPR_ARG (exp, 1) = arg1 = builtin_save_expr (arg1);
2163 op0 = expand_expr (arg0, subtarget, VOIDmode, EXPAND_NORMAL);
2164 op1 = expand_normal (arg1);
2168 /* Compute into TARGET.
2169 Set TARGET to wherever the result comes back. */
2170 target = expand_binop (mode, builtin_optab, op0, op1,
2171 target, 0, OPTAB_DIRECT);
2173 /* If we were unable to expand via the builtin, stop the sequence
2174 (without outputting the insns) and call to the library function
2175 with the stabilized argument list. */
2179 return expand_call (exp, target, target == const0_rtx);
2183 expand_errno_check (exp, target);
2185 /* Output the entire sequence. */
2186 insns = get_insns ();
2193 /* Expand a call to the builtin trinary math functions (fma).
2194 Return NULL_RTX if a normal call should be emitted rather than expanding the
2195 function in-line. EXP is the expression that is a call to the builtin
2196 function; if convenient, the result should be placed in TARGET.
2197 SUBTARGET may be used as the target for computing one of EXP's
2201 expand_builtin_mathfn_ternary (tree exp, rtx target, rtx subtarget)
2203 optab builtin_optab;
2204 rtx op0, op1, op2, insns;
2205 tree fndecl = get_callee_fndecl (exp);
2206 tree arg0, arg1, arg2;
2207 enum machine_mode mode;
2209 if (!validate_arglist (exp, REAL_TYPE, REAL_TYPE, REAL_TYPE, VOID_TYPE))
2212 arg0 = CALL_EXPR_ARG (exp, 0);
2213 arg1 = CALL_EXPR_ARG (exp, 1);
2214 arg2 = CALL_EXPR_ARG (exp, 2);
2216 switch (DECL_FUNCTION_CODE (fndecl))
2218 CASE_FLT_FN (BUILT_IN_FMA):
2219 builtin_optab = fma_optab; break;
2224 /* Make a suitable register to place result in. */
2225 mode = TYPE_MODE (TREE_TYPE (exp));
2227 /* Before working hard, check whether the instruction is available. */
2228 if (optab_handler (builtin_optab, mode) == CODE_FOR_nothing)
2231 target = gen_reg_rtx (mode);
2233 /* Always stabilize the argument list. */
2234 CALL_EXPR_ARG (exp, 0) = arg0 = builtin_save_expr (arg0);
2235 CALL_EXPR_ARG (exp, 1) = arg1 = builtin_save_expr (arg1);
2236 CALL_EXPR_ARG (exp, 2) = arg2 = builtin_save_expr (arg2);
2238 op0 = expand_expr (arg0, subtarget, VOIDmode, EXPAND_NORMAL);
2239 op1 = expand_normal (arg1);
2240 op2 = expand_normal (arg2);
2244 /* Compute into TARGET.
2245 Set TARGET to wherever the result comes back. */
2246 target = expand_ternary_op (mode, builtin_optab, op0, op1, op2,
2249 /* If we were unable to expand via the builtin, stop the sequence
2250 (without outputting the insns) and call to the library function
2251 with the stabilized argument list. */
2255 return expand_call (exp, target, target == const0_rtx);
2258 /* Output the entire sequence. */
2259 insns = get_insns ();
2266 /* Expand a call to the builtin sin and cos math functions.
2267 Return NULL_RTX if a normal call should be emitted rather than expanding the
2268 function in-line. EXP is the expression that is a call to the builtin
2269 function; if convenient, the result should be placed in TARGET.
2270 SUBTARGET may be used as the target for computing one of EXP's
2274 expand_builtin_mathfn_3 (tree exp, rtx target, rtx subtarget)
2276 optab builtin_optab;
2278 tree fndecl = get_callee_fndecl (exp);
2279 enum machine_mode mode;
2282 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2285 arg = CALL_EXPR_ARG (exp, 0);
2287 switch (DECL_FUNCTION_CODE (fndecl))
2289 CASE_FLT_FN (BUILT_IN_SIN):
2290 CASE_FLT_FN (BUILT_IN_COS):
2291 builtin_optab = sincos_optab; break;
2296 /* Make a suitable register to place result in. */
2297 mode = TYPE_MODE (TREE_TYPE (exp));
2299 /* Check if sincos insn is available, otherwise fallback
2300 to sin or cos insn. */
2301 if (optab_handler (builtin_optab, mode) == CODE_FOR_nothing)
2302 switch (DECL_FUNCTION_CODE (fndecl))
2304 CASE_FLT_FN (BUILT_IN_SIN):
2305 builtin_optab = sin_optab; break;
2306 CASE_FLT_FN (BUILT_IN_COS):
2307 builtin_optab = cos_optab; break;
2312 /* Before working hard, check whether the instruction is available. */
2313 if (optab_handler (builtin_optab, mode) != CODE_FOR_nothing)
2315 target = gen_reg_rtx (mode);
2317 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2318 need to expand the argument again. This way, we will not perform
2319 side-effects more the once. */
2320 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2322 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
2326 /* Compute into TARGET.
2327 Set TARGET to wherever the result comes back. */
2328 if (builtin_optab == sincos_optab)
2332 switch (DECL_FUNCTION_CODE (fndecl))
2334 CASE_FLT_FN (BUILT_IN_SIN):
2335 result = expand_twoval_unop (builtin_optab, op0, 0, target, 0);
2337 CASE_FLT_FN (BUILT_IN_COS):
2338 result = expand_twoval_unop (builtin_optab, op0, target, 0, 0);
2343 gcc_assert (result);
2347 target = expand_unop (mode, builtin_optab, op0, target, 0);
2352 /* Output the entire sequence. */
2353 insns = get_insns ();
2359 /* If we were unable to expand via the builtin, stop the sequence
2360 (without outputting the insns) and call to the library function
2361 with the stabilized argument list. */
2365 target = expand_call (exp, target, target == const0_rtx);
2370 /* Given an interclass math builtin decl FNDECL and it's argument ARG
2371 return an RTL instruction code that implements the functionality.
2372 If that isn't possible or available return CODE_FOR_nothing. */
2374 static enum insn_code
2375 interclass_mathfn_icode (tree arg, tree fndecl)
2377 bool errno_set = false;
2378 optab builtin_optab = 0;
2379 enum machine_mode mode;
2381 switch (DECL_FUNCTION_CODE (fndecl))
2383 CASE_FLT_FN (BUILT_IN_ILOGB):
2384 errno_set = true; builtin_optab = ilogb_optab; break;
2385 CASE_FLT_FN (BUILT_IN_ISINF):
2386 builtin_optab = isinf_optab; break;
2387 case BUILT_IN_ISNORMAL:
2388 case BUILT_IN_ISFINITE:
2389 CASE_FLT_FN (BUILT_IN_FINITE):
2390 case BUILT_IN_FINITED32:
2391 case BUILT_IN_FINITED64:
2392 case BUILT_IN_FINITED128:
2393 case BUILT_IN_ISINFD32:
2394 case BUILT_IN_ISINFD64:
2395 case BUILT_IN_ISINFD128:
2396 /* These builtins have no optabs (yet). */
2402 /* There's no easy way to detect the case we need to set EDOM. */
2403 if (flag_errno_math && errno_set)
2404 return CODE_FOR_nothing;
2406 /* Optab mode depends on the mode of the input argument. */
2407 mode = TYPE_MODE (TREE_TYPE (arg));
2410 return optab_handler (builtin_optab, mode);
2411 return CODE_FOR_nothing;
2414 /* Expand a call to one of the builtin math functions that operate on
2415 floating point argument and output an integer result (ilogb, isinf,
2417 Return 0 if a normal call should be emitted rather than expanding the
2418 function in-line. EXP is the expression that is a call to the builtin
2419 function; if convenient, the result should be placed in TARGET. */
2422 expand_builtin_interclass_mathfn (tree exp, rtx target)
2424 enum insn_code icode = CODE_FOR_nothing;
2426 tree fndecl = get_callee_fndecl (exp);
2427 enum machine_mode mode;
2430 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2433 arg = CALL_EXPR_ARG (exp, 0);
2434 icode = interclass_mathfn_icode (arg, fndecl);
2435 mode = TYPE_MODE (TREE_TYPE (arg));
2437 if (icode != CODE_FOR_nothing)
2439 struct expand_operand ops[1];
2440 rtx last = get_last_insn ();
2441 tree orig_arg = arg;
2443 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2444 need to expand the argument again. This way, we will not perform
2445 side-effects more the once. */
2446 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2448 op0 = expand_expr (arg, NULL_RTX, VOIDmode, EXPAND_NORMAL);
2450 if (mode != GET_MODE (op0))
2451 op0 = convert_to_mode (mode, op0, 0);
2453 create_output_operand (&ops[0], target, TYPE_MODE (TREE_TYPE (exp)));
2454 if (maybe_legitimize_operands (icode, 0, 1, ops)
2455 && maybe_emit_unop_insn (icode, ops[0].value, op0, UNKNOWN))
2456 return ops[0].value;
2458 delete_insns_since (last);
2459 CALL_EXPR_ARG (exp, 0) = orig_arg;
2465 /* Expand a call to the builtin sincos math function.
2466 Return NULL_RTX if a normal call should be emitted rather than expanding the
2467 function in-line. EXP is the expression that is a call to the builtin
2471 expand_builtin_sincos (tree exp)
2473 rtx op0, op1, op2, target1, target2;
2474 enum machine_mode mode;
2475 tree arg, sinp, cosp;
2477 location_t loc = EXPR_LOCATION (exp);
2478 tree alias_type, alias_off;
2480 if (!validate_arglist (exp, REAL_TYPE,
2481 POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
2484 arg = CALL_EXPR_ARG (exp, 0);
2485 sinp = CALL_EXPR_ARG (exp, 1);
2486 cosp = CALL_EXPR_ARG (exp, 2);
2488 /* Make a suitable register to place result in. */
2489 mode = TYPE_MODE (TREE_TYPE (arg));
2491 /* Check if sincos insn is available, otherwise emit the call. */
2492 if (optab_handler (sincos_optab, mode) == CODE_FOR_nothing)
2495 target1 = gen_reg_rtx (mode);
2496 target2 = gen_reg_rtx (mode);
2498 op0 = expand_normal (arg);
2499 alias_type = build_pointer_type_for_mode (TREE_TYPE (arg), ptr_mode, true);
2500 alias_off = build_int_cst (alias_type, 0);
2501 op1 = expand_normal (fold_build2_loc (loc, MEM_REF, TREE_TYPE (arg),
2503 op2 = expand_normal (fold_build2_loc (loc, MEM_REF, TREE_TYPE (arg),
2506 /* Compute into target1 and target2.
2507 Set TARGET to wherever the result comes back. */
2508 result = expand_twoval_unop (sincos_optab, op0, target2, target1, 0);
2509 gcc_assert (result);
2511 /* Move target1 and target2 to the memory locations indicated
2513 emit_move_insn (op1, target1);
2514 emit_move_insn (op2, target2);
2519 /* Expand a call to the internal cexpi builtin to the sincos math function.
2520 EXP is the expression that is a call to the builtin function; if convenient,
2521 the result should be placed in TARGET. */
2524 expand_builtin_cexpi (tree exp, rtx target)
2526 tree fndecl = get_callee_fndecl (exp);
2528 enum machine_mode mode;
2530 location_t loc = EXPR_LOCATION (exp);
2532 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2535 arg = CALL_EXPR_ARG (exp, 0);
2536 type = TREE_TYPE (arg);
2537 mode = TYPE_MODE (TREE_TYPE (arg));
2539 /* Try expanding via a sincos optab, fall back to emitting a libcall
2540 to sincos or cexp. We are sure we have sincos or cexp because cexpi
2541 is only generated from sincos, cexp or if we have either of them. */
2542 if (optab_handler (sincos_optab, mode) != CODE_FOR_nothing)
2544 op1 = gen_reg_rtx (mode);
2545 op2 = gen_reg_rtx (mode);
2547 op0 = expand_expr (arg, NULL_RTX, VOIDmode, EXPAND_NORMAL);
2549 /* Compute into op1 and op2. */
2550 expand_twoval_unop (sincos_optab, op0, op2, op1, 0);
2552 else if (TARGET_HAS_SINCOS)
2554 tree call, fn = NULL_TREE;
2558 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIF)
2559 fn = builtin_decl_explicit (BUILT_IN_SINCOSF);
2560 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPI)
2561 fn = builtin_decl_explicit (BUILT_IN_SINCOS);
2562 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIL)
2563 fn = builtin_decl_explicit (BUILT_IN_SINCOSL);
2567 op1 = assign_temp (TREE_TYPE (arg), 0, 1, 1);
2568 op2 = assign_temp (TREE_TYPE (arg), 0, 1, 1);
2569 op1a = copy_to_mode_reg (Pmode, XEXP (op1, 0));
2570 op2a = copy_to_mode_reg (Pmode, XEXP (op2, 0));
2571 top1 = make_tree (build_pointer_type (TREE_TYPE (arg)), op1a);
2572 top2 = make_tree (build_pointer_type (TREE_TYPE (arg)), op2a);
2574 /* Make sure not to fold the sincos call again. */
2575 call = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn);
2576 expand_normal (build_call_nary (TREE_TYPE (TREE_TYPE (fn)),
2577 call, 3, arg, top1, top2));
2581 tree call, fn = NULL_TREE, narg;
2582 tree ctype = build_complex_type (type);
2584 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIF)
2585 fn = builtin_decl_explicit (BUILT_IN_CEXPF);
2586 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPI)
2587 fn = builtin_decl_explicit (BUILT_IN_CEXP);
2588 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIL)
2589 fn = builtin_decl_explicit (BUILT_IN_CEXPL);
2593 /* If we don't have a decl for cexp create one. This is the
2594 friendliest fallback if the user calls __builtin_cexpi
2595 without full target C99 function support. */
2596 if (fn == NULL_TREE)
2599 const char *name = NULL;
2601 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIF)
2603 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPI)
2605 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIL)
2608 fntype = build_function_type_list (ctype, ctype, NULL_TREE);
2609 fn = build_fn_decl (name, fntype);
2612 narg = fold_build2_loc (loc, COMPLEX_EXPR, ctype,
2613 build_real (type, dconst0), arg);
2615 /* Make sure not to fold the cexp call again. */
2616 call = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn);
2617 return expand_expr (build_call_nary (ctype, call, 1, narg),
2618 target, VOIDmode, EXPAND_NORMAL);
2621 /* Now build the proper return type. */
2622 return expand_expr (build2 (COMPLEX_EXPR, build_complex_type (type),
2623 make_tree (TREE_TYPE (arg), op2),
2624 make_tree (TREE_TYPE (arg), op1)),
2625 target, VOIDmode, EXPAND_NORMAL);
2628 /* Conveniently construct a function call expression. FNDECL names the
2629 function to be called, N is the number of arguments, and the "..."
2630 parameters are the argument expressions. Unlike build_call_exr
2631 this doesn't fold the call, hence it will always return a CALL_EXPR. */
2634 build_call_nofold_loc (location_t loc, tree fndecl, int n, ...)
2637 tree fntype = TREE_TYPE (fndecl);
2638 tree fn = build1 (ADDR_EXPR, build_pointer_type (fntype), fndecl);
2641 fn = build_call_valist (TREE_TYPE (fntype), fn, n, ap);
2643 SET_EXPR_LOCATION (fn, loc);
2647 /* Expand a call to one of the builtin rounding functions gcc defines
2648 as an extension (lfloor and lceil). As these are gcc extensions we
2649 do not need to worry about setting errno to EDOM.
2650 If expanding via optab fails, lower expression to (int)(floor(x)).
2651 EXP is the expression that is a call to the builtin function;
2652 if convenient, the result should be placed in TARGET. */
2655 expand_builtin_int_roundingfn (tree exp, rtx target)
2657 convert_optab builtin_optab;
2658 rtx op0, insns, tmp;
2659 tree fndecl = get_callee_fndecl (exp);
2660 enum built_in_function fallback_fn;
2661 tree fallback_fndecl;
2662 enum machine_mode mode;
2665 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2668 arg = CALL_EXPR_ARG (exp, 0);
2670 switch (DECL_FUNCTION_CODE (fndecl))
2672 CASE_FLT_FN (BUILT_IN_ICEIL):
2673 CASE_FLT_FN (BUILT_IN_LCEIL):
2674 CASE_FLT_FN (BUILT_IN_LLCEIL):
2675 builtin_optab = lceil_optab;
2676 fallback_fn = BUILT_IN_CEIL;
2679 CASE_FLT_FN (BUILT_IN_IFLOOR):
2680 CASE_FLT_FN (BUILT_IN_LFLOOR):
2681 CASE_FLT_FN (BUILT_IN_LLFLOOR):
2682 builtin_optab = lfloor_optab;
2683 fallback_fn = BUILT_IN_FLOOR;
2690 /* Make a suitable register to place result in. */
2691 mode = TYPE_MODE (TREE_TYPE (exp));
2693 target = gen_reg_rtx (mode);
2695 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2696 need to expand the argument again. This way, we will not perform
2697 side-effects more the once. */
2698 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2700 op0 = expand_expr (arg, NULL, VOIDmode, EXPAND_NORMAL);
2704 /* Compute into TARGET. */
2705 if (expand_sfix_optab (target, op0, builtin_optab))
2707 /* Output the entire sequence. */
2708 insns = get_insns ();
2714 /* If we were unable to expand via the builtin, stop the sequence
2715 (without outputting the insns). */
2718 /* Fall back to floating point rounding optab. */
2719 fallback_fndecl = mathfn_built_in (TREE_TYPE (arg), fallback_fn);
2721 /* For non-C99 targets we may end up without a fallback fndecl here
2722 if the user called __builtin_lfloor directly. In this case emit
2723 a call to the floor/ceil variants nevertheless. This should result
2724 in the best user experience for not full C99 targets. */
2725 if (fallback_fndecl == NULL_TREE)
2728 const char *name = NULL;
2730 switch (DECL_FUNCTION_CODE (fndecl))
2732 case BUILT_IN_ICEIL:
2733 case BUILT_IN_LCEIL:
2734 case BUILT_IN_LLCEIL:
2737 case BUILT_IN_ICEILF:
2738 case BUILT_IN_LCEILF:
2739 case BUILT_IN_LLCEILF:
2742 case BUILT_IN_ICEILL:
2743 case BUILT_IN_LCEILL:
2744 case BUILT_IN_LLCEILL:
2747 case BUILT_IN_IFLOOR:
2748 case BUILT_IN_LFLOOR:
2749 case BUILT_IN_LLFLOOR:
2752 case BUILT_IN_IFLOORF:
2753 case BUILT_IN_LFLOORF:
2754 case BUILT_IN_LLFLOORF:
2757 case BUILT_IN_IFLOORL:
2758 case BUILT_IN_LFLOORL:
2759 case BUILT_IN_LLFLOORL:
2766 fntype = build_function_type_list (TREE_TYPE (arg),
2767 TREE_TYPE (arg), NULL_TREE);
2768 fallback_fndecl = build_fn_decl (name, fntype);
2771 exp = build_call_nofold_loc (EXPR_LOCATION (exp), fallback_fndecl, 1, arg);
2773 tmp = expand_normal (exp);
2775 /* Truncate the result of floating point optab to integer
2776 via expand_fix (). */
2777 target = gen_reg_rtx (mode);
2778 expand_fix (target, tmp, 0);
2783 /* Expand a call to one of the builtin math functions doing integer
2785 Return 0 if a normal call should be emitted rather than expanding the
2786 function in-line. EXP is the expression that is a call to the builtin
2787 function; if convenient, the result should be placed in TARGET. */
2790 expand_builtin_int_roundingfn_2 (tree exp, rtx target)
2792 convert_optab builtin_optab;
2794 tree fndecl = get_callee_fndecl (exp);
2796 enum machine_mode mode;
2798 /* There's no easy way to detect the case we need to set EDOM. */
2799 if (flag_errno_math)
2802 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2805 arg = CALL_EXPR_ARG (exp, 0);
2807 switch (DECL_FUNCTION_CODE (fndecl))
2809 CASE_FLT_FN (BUILT_IN_IRINT):
2810 CASE_FLT_FN (BUILT_IN_LRINT):
2811 CASE_FLT_FN (BUILT_IN_LLRINT):
2812 builtin_optab = lrint_optab; break;
2814 CASE_FLT_FN (BUILT_IN_IROUND):
2815 CASE_FLT_FN (BUILT_IN_LROUND):
2816 CASE_FLT_FN (BUILT_IN_LLROUND):
2817 builtin_optab = lround_optab; break;
2823 /* Make a suitable register to place result in. */
2824 mode = TYPE_MODE (TREE_TYPE (exp));
2826 target = gen_reg_rtx (mode);
2828 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2829 need to expand the argument again. This way, we will not perform
2830 side-effects more the once. */
2831 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2833 op0 = expand_expr (arg, NULL, VOIDmode, EXPAND_NORMAL);
2837 if (expand_sfix_optab (target, op0, builtin_optab))
2839 /* Output the entire sequence. */
2840 insns = get_insns ();
2846 /* If we were unable to expand via the builtin, stop the sequence
2847 (without outputting the insns) and call to the library function
2848 with the stabilized argument list. */
2851 target = expand_call (exp, target, target == const0_rtx);
2856 /* Expand a call to the powi built-in mathematical function. Return NULL_RTX if
2857 a normal call should be emitted rather than expanding the function
2858 in-line. EXP is the expression that is a call to the builtin
2859 function; if convenient, the result should be placed in TARGET. */
2862 expand_builtin_powi (tree exp, rtx target)
2866 enum machine_mode mode;
2867 enum machine_mode mode2;
2869 if (! validate_arglist (exp, REAL_TYPE, INTEGER_TYPE, VOID_TYPE))
2872 arg0 = CALL_EXPR_ARG (exp, 0);
2873 arg1 = CALL_EXPR_ARG (exp, 1);
2874 mode = TYPE_MODE (TREE_TYPE (exp));
2876 /* Emit a libcall to libgcc. */
2878 /* Mode of the 2nd argument must match that of an int. */
2879 mode2 = mode_for_size (INT_TYPE_SIZE, MODE_INT, 0);
2881 if (target == NULL_RTX)
2882 target = gen_reg_rtx (mode);
2884 op0 = expand_expr (arg0, NULL_RTX, mode, EXPAND_NORMAL);
2885 if (GET_MODE (op0) != mode)
2886 op0 = convert_to_mode (mode, op0, 0);
2887 op1 = expand_expr (arg1, NULL_RTX, mode2, EXPAND_NORMAL);
2888 if (GET_MODE (op1) != mode2)
2889 op1 = convert_to_mode (mode2, op1, 0);
2891 target = emit_library_call_value (optab_libfunc (powi_optab, mode),
2892 target, LCT_CONST, mode, 2,
2893 op0, mode, op1, mode2);
2898 /* Expand expression EXP which is a call to the strlen builtin. Return
2899 NULL_RTX if we failed the caller should emit a normal call, otherwise
2900 try to get the result in TARGET, if convenient. */
2903 expand_builtin_strlen (tree exp, rtx target,
2904 enum machine_mode target_mode)
2906 if (!validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
2910 struct expand_operand ops[4];
2913 tree src = CALL_EXPR_ARG (exp, 0);
2914 rtx src_reg, before_strlen;
2915 enum machine_mode insn_mode = target_mode;
2916 enum insn_code icode = CODE_FOR_nothing;
2919 /* If the length can be computed at compile-time, return it. */
2920 len = c_strlen (src, 0);
2922 return expand_expr (len, target, target_mode, EXPAND_NORMAL);
2924 /* If the length can be computed at compile-time and is constant
2925 integer, but there are side-effects in src, evaluate
2926 src for side-effects, then return len.
2927 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
2928 can be optimized into: i++; x = 3; */
2929 len = c_strlen (src, 1);
2930 if (len && TREE_CODE (len) == INTEGER_CST)
2932 expand_expr (src, const0_rtx, VOIDmode, EXPAND_NORMAL);
2933 return expand_expr (len, target, target_mode, EXPAND_NORMAL);
2936 align = get_pointer_alignment (src) / BITS_PER_UNIT;
2938 /* If SRC is not a pointer type, don't do this operation inline. */
2942 /* Bail out if we can't compute strlen in the right mode. */
2943 while (insn_mode != VOIDmode)
2945 icode = optab_handler (strlen_optab, insn_mode);
2946 if (icode != CODE_FOR_nothing)
2949 insn_mode = GET_MODE_WIDER_MODE (insn_mode);
2951 if (insn_mode == VOIDmode)
2954 /* Make a place to hold the source address. We will not expand
2955 the actual source until we are sure that the expansion will
2956 not fail -- there are trees that cannot be expanded twice. */
2957 src_reg = gen_reg_rtx (Pmode);
2959 /* Mark the beginning of the strlen sequence so we can emit the
2960 source operand later. */
2961 before_strlen = get_last_insn ();
2963 create_output_operand (&ops[0], target, insn_mode);
2964 create_fixed_operand (&ops[1], gen_rtx_MEM (BLKmode, src_reg));
2965 create_integer_operand (&ops[2], 0);
2966 create_integer_operand (&ops[3], align);
2967 if (!maybe_expand_insn (icode, 4, ops))
2970 /* Now that we are assured of success, expand the source. */
2972 pat = expand_expr (src, src_reg, Pmode, EXPAND_NORMAL);
2975 #ifdef POINTERS_EXTEND_UNSIGNED
2976 if (GET_MODE (pat) != Pmode)
2977 pat = convert_to_mode (Pmode, pat,
2978 POINTERS_EXTEND_UNSIGNED);
2980 emit_move_insn (src_reg, pat);
2986 emit_insn_after (pat, before_strlen);
2988 emit_insn_before (pat, get_insns ());
2990 /* Return the value in the proper mode for this function. */
2991 if (GET_MODE (ops[0].value) == target_mode)
2992 target = ops[0].value;
2993 else if (target != 0)
2994 convert_move (target, ops[0].value, 0);
2996 target = convert_to_mode (target_mode, ops[0].value, 0);
3002 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3003 bytes from constant string DATA + OFFSET and return it as target
3007 builtin_memcpy_read_str (void *data, HOST_WIDE_INT offset,
3008 enum machine_mode mode)
3010 const char *str = (const char *) data;
3012 gcc_assert (offset >= 0
3013 && ((unsigned HOST_WIDE_INT) offset + GET_MODE_SIZE (mode)
3014 <= strlen (str) + 1));
3016 return c_readstr (str + offset, mode);
3019 /* Expand a call EXP to the memcpy builtin.
3020 Return NULL_RTX if we failed, the caller should emit a normal call,
3021 otherwise try to get the result in TARGET, if convenient (and in
3022 mode MODE if that's convenient). */
3025 expand_builtin_memcpy (tree exp, rtx target)
3027 if (!validate_arglist (exp,
3028 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3032 tree dest = CALL_EXPR_ARG (exp, 0);
3033 tree src = CALL_EXPR_ARG (exp, 1);
3034 tree len = CALL_EXPR_ARG (exp, 2);
3035 const char *src_str;
3036 unsigned int src_align = get_pointer_alignment (src);
3037 unsigned int dest_align = get_pointer_alignment (dest);
3038 rtx dest_mem, src_mem, dest_addr, len_rtx;
3039 HOST_WIDE_INT expected_size = -1;
3040 unsigned int expected_align = 0;
3042 /* If DEST is not a pointer type, call the normal function. */
3043 if (dest_align == 0)
3046 /* If either SRC is not a pointer type, don't do this
3047 operation in-line. */
3051 if (currently_expanding_gimple_stmt)
3052 stringop_block_profile (currently_expanding_gimple_stmt,
3053 &expected_align, &expected_size);
3055 if (expected_align < dest_align)
3056 expected_align = dest_align;
3057 dest_mem = get_memory_rtx (dest, len);
3058 set_mem_align (dest_mem, dest_align);
3059 len_rtx = expand_normal (len);
3060 src_str = c_getstr (src);
3062 /* If SRC is a string constant and block move would be done
3063 by pieces, we can avoid loading the string from memory
3064 and only stored the computed constants. */
3066 && CONST_INT_P (len_rtx)
3067 && (unsigned HOST_WIDE_INT) INTVAL (len_rtx) <= strlen (src_str) + 1
3068 && can_store_by_pieces (INTVAL (len_rtx), builtin_memcpy_read_str,
3069 CONST_CAST (char *, src_str),
3072 dest_mem = store_by_pieces (dest_mem, INTVAL (len_rtx),
3073 builtin_memcpy_read_str,
3074 CONST_CAST (char *, src_str),
3075 dest_align, false, 0);
3076 dest_mem = force_operand (XEXP (dest_mem, 0), target);
3077 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3081 src_mem = get_memory_rtx (src, len);
3082 set_mem_align (src_mem, src_align);
3084 /* Copy word part most expediently. */
3085 dest_addr = emit_block_move_hints (dest_mem, src_mem, len_rtx,
3086 CALL_EXPR_TAILCALL (exp)
3087 ? BLOCK_OP_TAILCALL : BLOCK_OP_NORMAL,
3088 expected_align, expected_size);
3092 dest_addr = force_operand (XEXP (dest_mem, 0), target);
3093 dest_addr = convert_memory_address (ptr_mode, dest_addr);
3099 /* Expand a call EXP to the mempcpy builtin.
3100 Return NULL_RTX if we failed; the caller should emit a normal call,
3101 otherwise try to get the result in TARGET, if convenient (and in
3102 mode MODE if that's convenient). If ENDP is 0 return the
3103 destination pointer, if ENDP is 1 return the end pointer ala
3104 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3108 expand_builtin_mempcpy (tree exp, rtx target, enum machine_mode mode)
3110 if (!validate_arglist (exp,
3111 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3115 tree dest = CALL_EXPR_ARG (exp, 0);
3116 tree src = CALL_EXPR_ARG (exp, 1);
3117 tree len = CALL_EXPR_ARG (exp, 2);
3118 return expand_builtin_mempcpy_args (dest, src, len,
3119 target, mode, /*endp=*/ 1);
3123 /* Helper function to do the actual work for expand_builtin_mempcpy. The
3124 arguments to the builtin_mempcpy call DEST, SRC, and LEN are broken out
3125 so that this can also be called without constructing an actual CALL_EXPR.
3126 The other arguments and return value are the same as for
3127 expand_builtin_mempcpy. */
3130 expand_builtin_mempcpy_args (tree dest, tree src, tree len,
3131 rtx target, enum machine_mode mode, int endp)
3133 /* If return value is ignored, transform mempcpy into memcpy. */
3134 if (target == const0_rtx && builtin_decl_implicit_p (BUILT_IN_MEMCPY))
3136 tree fn = builtin_decl_implicit (BUILT_IN_MEMCPY);
3137 tree result = build_call_nofold_loc (UNKNOWN_LOCATION, fn, 3,
3139 return expand_expr (result, target, mode, EXPAND_NORMAL);
3143 const char *src_str;
3144 unsigned int src_align = get_pointer_alignment (src);
3145 unsigned int dest_align = get_pointer_alignment (dest);
3146 rtx dest_mem, src_mem, len_rtx;
3148 /* If either SRC or DEST is not a pointer type, don't do this
3149 operation in-line. */
3150 if (dest_align == 0 || src_align == 0)
3153 /* If LEN is not constant, call the normal function. */
3154 if (! host_integerp (len, 1))
3157 len_rtx = expand_normal (len);
3158 src_str = c_getstr (src);
3160 /* If SRC is a string constant and block move would be done
3161 by pieces, we can avoid loading the string from memory
3162 and only stored the computed constants. */
3164 && CONST_INT_P (len_rtx)
3165 && (unsigned HOST_WIDE_INT) INTVAL (len_rtx) <= strlen (src_str) + 1
3166 && can_store_by_pieces (INTVAL (len_rtx), builtin_memcpy_read_str,
3167 CONST_CAST (char *, src_str),
3170 dest_mem = get_memory_rtx (dest, len);
3171 set_mem_align (dest_mem, dest_align);
3172 dest_mem = store_by_pieces (dest_mem, INTVAL (len_rtx),
3173 builtin_memcpy_read_str,
3174 CONST_CAST (char *, src_str),
3175 dest_align, false, endp);
3176 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3177 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3181 if (CONST_INT_P (len_rtx)
3182 && can_move_by_pieces (INTVAL (len_rtx),
3183 MIN (dest_align, src_align)))
3185 dest_mem = get_memory_rtx (dest, len);
3186 set_mem_align (dest_mem, dest_align);
3187 src_mem = get_memory_rtx (src, len);
3188 set_mem_align (src_mem, src_align);
3189 dest_mem = move_by_pieces (dest_mem, src_mem, INTVAL (len_rtx),
3190 MIN (dest_align, src_align), endp);
3191 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3192 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3201 # define HAVE_movstr 0
3202 # define CODE_FOR_movstr CODE_FOR_nothing
3205 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
3206 we failed, the caller should emit a normal call, otherwise try to
3207 get the result in TARGET, if convenient. If ENDP is 0 return the
3208 destination pointer, if ENDP is 1 return the end pointer ala
3209 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3213 expand_movstr (tree dest, tree src, rtx target, int endp)
3215 struct expand_operand ops[3];
3222 dest_mem = get_memory_rtx (dest, NULL);
3223 src_mem = get_memory_rtx (src, NULL);
3226 target = force_reg (Pmode, XEXP (dest_mem, 0));
3227 dest_mem = replace_equiv_address (dest_mem, target);
3230 create_output_operand (&ops[0], endp ? target : NULL_RTX, Pmode);
3231 create_fixed_operand (&ops[1], dest_mem);
3232 create_fixed_operand (&ops[2], src_mem);
3233 expand_insn (CODE_FOR_movstr, 3, ops);
3235 if (endp && target != const0_rtx)
3237 target = ops[0].value;
3238 /* movstr is supposed to set end to the address of the NUL
3239 terminator. If the caller requested a mempcpy-like return value,
3243 rtx tem = plus_constant (gen_lowpart (GET_MODE (target), target), 1);
3244 emit_move_insn (target, force_operand (tem, NULL_RTX));
3250 /* Expand expression EXP, which is a call to the strcpy builtin. Return
3251 NULL_RTX if we failed the caller should emit a normal call, otherwise
3252 try to get the result in TARGET, if convenient (and in mode MODE if that's
3256 expand_builtin_strcpy (tree exp, rtx target)
3258 if (validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3260 tree dest = CALL_EXPR_ARG (exp, 0);
3261 tree src = CALL_EXPR_ARG (exp, 1);
3262 return expand_builtin_strcpy_args (dest, src, target);
3267 /* Helper function to do the actual work for expand_builtin_strcpy. The
3268 arguments to the builtin_strcpy call DEST and SRC are broken out
3269 so that this can also be called without constructing an actual CALL_EXPR.
3270 The other arguments and return value are the same as for
3271 expand_builtin_strcpy. */
3274 expand_builtin_strcpy_args (tree dest, tree src, rtx target)
3276 return expand_movstr (dest, src, target, /*endp=*/0);
3279 /* Expand a call EXP to the stpcpy builtin.
3280 Return NULL_RTX if we failed the caller should emit a normal call,
3281 otherwise try to get the result in TARGET, if convenient (and in
3282 mode MODE if that's convenient). */
3285 expand_builtin_stpcpy (tree exp, rtx target, enum machine_mode mode)
3288 location_t loc = EXPR_LOCATION (exp);
3290 if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3293 dst = CALL_EXPR_ARG (exp, 0);
3294 src = CALL_EXPR_ARG (exp, 1);
3296 /* If return value is ignored, transform stpcpy into strcpy. */
3297 if (target == const0_rtx && builtin_decl_implicit (BUILT_IN_STRCPY))
3299 tree fn = builtin_decl_implicit (BUILT_IN_STRCPY);
3300 tree result = build_call_nofold_loc (loc, fn, 2, dst, src);
3301 return expand_expr (result, target, mode, EXPAND_NORMAL);
3308 /* Ensure we get an actual string whose length can be evaluated at
3309 compile-time, not an expression containing a string. This is
3310 because the latter will potentially produce pessimized code
3311 when used to produce the return value. */
3312 if (! c_getstr (src) || ! (len = c_strlen (src, 0)))
3313 return expand_movstr (dst, src, target, /*endp=*/2);
3315 lenp1 = size_binop_loc (loc, PLUS_EXPR, len, ssize_int (1));
3316 ret = expand_builtin_mempcpy_args (dst, src, lenp1,
3317 target, mode, /*endp=*/2);
3322 if (TREE_CODE (len) == INTEGER_CST)
3324 rtx len_rtx = expand_normal (len);
3326 if (CONST_INT_P (len_rtx))
3328 ret = expand_builtin_strcpy_args (dst, src, target);
3334 if (mode != VOIDmode)
3335 target = gen_reg_rtx (mode);
3337 target = gen_reg_rtx (GET_MODE (ret));
3339 if (GET_MODE (target) != GET_MODE (ret))
3340 ret = gen_lowpart (GET_MODE (target), ret);
3342 ret = plus_constant (ret, INTVAL (len_rtx));
3343 ret = emit_move_insn (target, force_operand (ret, NULL_RTX));
3351 return expand_movstr (dst, src, target, /*endp=*/2);
3355 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3356 bytes from constant string DATA + OFFSET and return it as target
3360 builtin_strncpy_read_str (void *data, HOST_WIDE_INT offset,
3361 enum machine_mode mode)
3363 const char *str = (const char *) data;
3365 if ((unsigned HOST_WIDE_INT) offset > strlen (str))
3368 return c_readstr (str + offset, mode);
3371 /* Expand expression EXP, which is a call to the strncpy builtin. Return
3372 NULL_RTX if we failed the caller should emit a normal call. */
3375 expand_builtin_strncpy (tree exp, rtx target)
3377 location_t loc = EXPR_LOCATION (exp);
3379 if (validate_arglist (exp,
3380 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3382 tree dest = CALL_EXPR_ARG (exp, 0);
3383 tree src = CALL_EXPR_ARG (exp, 1);
3384 tree len = CALL_EXPR_ARG (exp, 2);
3385 tree slen = c_strlen (src, 1);
3387 /* We must be passed a constant len and src parameter. */
3388 if (!host_integerp (len, 1) || !slen || !host_integerp (slen, 1))
3391 slen = size_binop_loc (loc, PLUS_EXPR, slen, ssize_int (1));
3393 /* We're required to pad with trailing zeros if the requested
3394 len is greater than strlen(s2)+1. In that case try to
3395 use store_by_pieces, if it fails, punt. */
3396 if (tree_int_cst_lt (slen, len))
3398 unsigned int dest_align = get_pointer_alignment (dest);
3399 const char *p = c_getstr (src);
3402 if (!p || dest_align == 0 || !host_integerp (len, 1)
3403 || !can_store_by_pieces (tree_low_cst (len, 1),
3404 builtin_strncpy_read_str,
3405 CONST_CAST (char *, p),
3409 dest_mem = get_memory_rtx (dest, len);
3410 store_by_pieces (dest_mem, tree_low_cst (len, 1),
3411 builtin_strncpy_read_str,
3412 CONST_CAST (char *, p), dest_align, false, 0);
3413 dest_mem = force_operand (XEXP (dest_mem, 0), target);
3414 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3421 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3422 bytes from constant string DATA + OFFSET and return it as target
3426 builtin_memset_read_str (void *data, HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
3427 enum machine_mode mode)
3429 const char *c = (const char *) data;
3430 char *p = XALLOCAVEC (char, GET_MODE_SIZE (mode));
3432 memset (p, *c, GET_MODE_SIZE (mode));
3434 return c_readstr (p, mode);
3437 /* Callback routine for store_by_pieces. Return the RTL of a register
3438 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
3439 char value given in the RTL register data. For example, if mode is
3440 4 bytes wide, return the RTL for 0x01010101*data. */
3443 builtin_memset_gen_str (void *data, HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
3444 enum machine_mode mode)
3450 size = GET_MODE_SIZE (mode);
3454 p = XALLOCAVEC (char, size);
3455 memset (p, 1, size);
3456 coeff = c_readstr (p, mode);
3458 target = convert_to_mode (mode, (rtx) data, 1);
3459 target = expand_mult (mode, target, coeff, NULL_RTX, 1);
3460 return force_reg (mode, target);
3463 /* Expand expression EXP, which is a call to the memset builtin. Return
3464 NULL_RTX if we failed the caller should emit a normal call, otherwise
3465 try to get the result in TARGET, if convenient (and in mode MODE if that's
3469 expand_builtin_memset (tree exp, rtx target, enum machine_mode mode)
3471 if (!validate_arglist (exp,
3472 POINTER_TYPE, INTEGER_TYPE, INTEGER_TYPE, VOID_TYPE))
3476 tree dest = CALL_EXPR_ARG (exp, 0);
3477 tree val = CALL_EXPR_ARG (exp, 1);
3478 tree len = CALL_EXPR_ARG (exp, 2);
3479 return expand_builtin_memset_args (dest, val, len, target, mode, exp);
3483 /* Helper function to do the actual work for expand_builtin_memset. The
3484 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
3485 so that this can also be called without constructing an actual CALL_EXPR.
3486 The other arguments and return value are the same as for
3487 expand_builtin_memset. */
3490 expand_builtin_memset_args (tree dest, tree val, tree len,
3491 rtx target, enum machine_mode mode, tree orig_exp)
3494 enum built_in_function fcode;
3495 enum machine_mode val_mode;
3497 unsigned int dest_align;
3498 rtx dest_mem, dest_addr, len_rtx;
3499 HOST_WIDE_INT expected_size = -1;
3500 unsigned int expected_align = 0;
3502 dest_align = get_pointer_alignment (dest);
3504 /* If DEST is not a pointer type, don't do this operation in-line. */
3505 if (dest_align == 0)
3508 if (currently_expanding_gimple_stmt)
3509 stringop_block_profile (currently_expanding_gimple_stmt,
3510 &expected_align, &expected_size);
3512 if (expected_align < dest_align)
3513 expected_align = dest_align;
3515 /* If the LEN parameter is zero, return DEST. */
3516 if (integer_zerop (len))
3518 /* Evaluate and ignore VAL in case it has side-effects. */
3519 expand_expr (val, const0_rtx, VOIDmode, EXPAND_NORMAL);
3520 return expand_expr (dest, target, mode, EXPAND_NORMAL);
3523 /* Stabilize the arguments in case we fail. */
3524 dest = builtin_save_expr (dest);
3525 val = builtin_save_expr (val);
3526 len = builtin_save_expr (len);
3528 len_rtx = expand_normal (len);
3529 dest_mem = get_memory_rtx (dest, len);
3530 val_mode = TYPE_MODE (unsigned_char_type_node);
3532 if (TREE_CODE (val) != INTEGER_CST)
3536 val_rtx = expand_normal (val);
3537 val_rtx = convert_to_mode (val_mode, val_rtx, 0);
3539 /* Assume that we can memset by pieces if we can store
3540 * the coefficients by pieces (in the required modes).
3541 * We can't pass builtin_memset_gen_str as that emits RTL. */
3543 if (host_integerp (len, 1)
3544 && can_store_by_pieces (tree_low_cst (len, 1),
3545 builtin_memset_read_str, &c, dest_align,
3548 val_rtx = force_reg (val_mode, val_rtx);
3549 store_by_pieces (dest_mem, tree_low_cst (len, 1),
3550 builtin_memset_gen_str, val_rtx, dest_align,
3553 else if (!set_storage_via_setmem (dest_mem, len_rtx, val_rtx,
3554 dest_align, expected_align,
3558 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3559 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3563 if (target_char_cast (val, &c))
3568 if (host_integerp (len, 1)
3569 && can_store_by_pieces (tree_low_cst (len, 1),
3570 builtin_memset_read_str, &c, dest_align,
3572 store_by_pieces (dest_mem, tree_low_cst (len, 1),
3573 builtin_memset_read_str, &c, dest_align, true, 0);
3574 else if (!set_storage_via_setmem (dest_mem, len_rtx,
3575 gen_int_mode (c, val_mode),
3576 dest_align, expected_align,
3580 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3581 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3585 set_mem_align (dest_mem, dest_align);
3586 dest_addr = clear_storage_hints (dest_mem, len_rtx,
3587 CALL_EXPR_TAILCALL (orig_exp)
3588 ? BLOCK_OP_TAILCALL : BLOCK_OP_NORMAL,
3589 expected_align, expected_size);
3593 dest_addr = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3594 dest_addr = convert_memory_address (ptr_mode, dest_addr);
3600 fndecl = get_callee_fndecl (orig_exp);
3601 fcode = DECL_FUNCTION_CODE (fndecl);
3602 if (fcode == BUILT_IN_MEMSET)
3603 fn = build_call_nofold_loc (EXPR_LOCATION (orig_exp), fndecl, 3,
3605 else if (fcode == BUILT_IN_BZERO)
3606 fn = build_call_nofold_loc (EXPR_LOCATION (orig_exp), fndecl, 2,
3610 gcc_assert (TREE_CODE (fn) == CALL_EXPR);
3611 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (orig_exp);
3612 return expand_call (fn, target, target == const0_rtx);
3615 /* Expand expression EXP, which is a call to the bzero builtin. Return
3616 NULL_RTX if we failed the caller should emit a normal call. */
3619 expand_builtin_bzero (tree exp)
3622 location_t loc = EXPR_LOCATION (exp);
3624 if (!validate_arglist (exp, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3627 dest = CALL_EXPR_ARG (exp, 0);
3628 size = CALL_EXPR_ARG (exp, 1);
3630 /* New argument list transforming bzero(ptr x, int y) to
3631 memset(ptr x, int 0, size_t y). This is done this way
3632 so that if it isn't expanded inline, we fallback to
3633 calling bzero instead of memset. */
3635 return expand_builtin_memset_args (dest, integer_zero_node,
3636 fold_convert_loc (loc,
3637 size_type_node, size),
3638 const0_rtx, VOIDmode, exp);
3641 /* Expand expression EXP, which is a call to the memcmp built-in function.
3642 Return NULL_RTX if we failed and the caller should emit a normal call,
3643 otherwise try to get the result in TARGET, if convenient (and in mode
3644 MODE, if that's convenient). */
3647 expand_builtin_memcmp (tree exp, ATTRIBUTE_UNUSED rtx target,
3648 ATTRIBUTE_UNUSED enum machine_mode mode)
3650 location_t loc ATTRIBUTE_UNUSED = EXPR_LOCATION (exp);
3652 if (!validate_arglist (exp,
3653 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3656 /* Note: The cmpstrnsi pattern, if it exists, is not suitable for
3657 implementing memcmp because it will stop if it encounters two
3659 #if defined HAVE_cmpmemsi
3661 rtx arg1_rtx, arg2_rtx, arg3_rtx;
3664 tree arg1 = CALL_EXPR_ARG (exp, 0);
3665 tree arg2 = CALL_EXPR_ARG (exp, 1);
3666 tree len = CALL_EXPR_ARG (exp, 2);
3668 unsigned int arg1_align = get_pointer_alignment (arg1) / BITS_PER_UNIT;
3669 unsigned int arg2_align = get_pointer_alignment (arg2) / BITS_PER_UNIT;
3670 enum machine_mode insn_mode;
3673 insn_mode = insn_data[(int) CODE_FOR_cmpmemsi].operand[0].mode;
3677 /* If we don't have POINTER_TYPE, call the function. */
3678 if (arg1_align == 0 || arg2_align == 0)
3681 /* Make a place to write the result of the instruction. */
3684 && REG_P (result) && GET_MODE (result) == insn_mode
3685 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
3686 result = gen_reg_rtx (insn_mode);
3688 arg1_rtx = get_memory_rtx (arg1, len);
3689 arg2_rtx = get_memory_rtx (arg2, len);
3690 arg3_rtx = expand_normal (fold_convert_loc (loc, sizetype, len));
3692 /* Set MEM_SIZE as appropriate. */
3693 if (CONST_INT_P (arg3_rtx))
3695 set_mem_size (arg1_rtx, INTVAL (arg3_rtx));
3696 set_mem_size (arg2_rtx, INTVAL (arg3_rtx));
3700 insn = gen_cmpmemsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
3701 GEN_INT (MIN (arg1_align, arg2_align)));
3708 emit_library_call_value (memcmp_libfunc, result, LCT_PURE,
3709 TYPE_MODE (integer_type_node), 3,
3710 XEXP (arg1_rtx, 0), Pmode,
3711 XEXP (arg2_rtx, 0), Pmode,
3712 convert_to_mode (TYPE_MODE (sizetype), arg3_rtx,
3713 TYPE_UNSIGNED (sizetype)),
3714 TYPE_MODE (sizetype));
3716 /* Return the value in the proper mode for this function. */
3717 mode = TYPE_MODE (TREE_TYPE (exp));
3718 if (GET_MODE (result) == mode)
3720 else if (target != 0)
3722 convert_move (target, result, 0);
3726 return convert_to_mode (mode, result, 0);
3728 #endif /* HAVE_cmpmemsi. */
3733 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
3734 if we failed the caller should emit a normal call, otherwise try to get
3735 the result in TARGET, if convenient. */
3738 expand_builtin_strcmp (tree exp, ATTRIBUTE_UNUSED rtx target)
3740 if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3743 #if defined HAVE_cmpstrsi || defined HAVE_cmpstrnsi
3744 if (direct_optab_handler (cmpstr_optab, SImode) != CODE_FOR_nothing
3745 || direct_optab_handler (cmpstrn_optab, SImode) != CODE_FOR_nothing)
3747 rtx arg1_rtx, arg2_rtx;
3748 rtx result, insn = NULL_RTX;
3750 tree arg1 = CALL_EXPR_ARG (exp, 0);
3751 tree arg2 = CALL_EXPR_ARG (exp, 1);
3753 unsigned int arg1_align = get_pointer_alignment (arg1) / BITS_PER_UNIT;
3754 unsigned int arg2_align = get_pointer_alignment (arg2) / BITS_PER_UNIT;
3756 /* If we don't have POINTER_TYPE, call the function. */
3757 if (arg1_align == 0 || arg2_align == 0)
3760 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
3761 arg1 = builtin_save_expr (arg1);
3762 arg2 = builtin_save_expr (arg2);
3764 arg1_rtx = get_memory_rtx (arg1, NULL);
3765 arg2_rtx = get_memory_rtx (arg2, NULL);
3767 #ifdef HAVE_cmpstrsi
3768 /* Try to call cmpstrsi. */
3771 enum machine_mode insn_mode
3772 = insn_data[(int) CODE_FOR_cmpstrsi].operand[0].mode;
3774 /* Make a place to write the result of the instruction. */
3777 && REG_P (result) && GET_MODE (result) == insn_mode
3778 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
3779 result = gen_reg_rtx (insn_mode);
3781 insn = gen_cmpstrsi (result, arg1_rtx, arg2_rtx,
3782 GEN_INT (MIN (arg1_align, arg2_align)));
3785 #ifdef HAVE_cmpstrnsi
3786 /* Try to determine at least one length and call cmpstrnsi. */
3787 if (!insn && HAVE_cmpstrnsi)
3792 enum machine_mode insn_mode
3793 = insn_data[(int) CODE_FOR_cmpstrnsi].operand[0].mode;
3794 tree len1 = c_strlen (arg1, 1);
3795 tree len2 = c_strlen (arg2, 1);
3798 len1 = size_binop (PLUS_EXPR, ssize_int (1), len1);
3800 len2 = size_binop (PLUS_EXPR, ssize_int (1), len2);
3802 /* If we don't have a constant length for the first, use the length
3803 of the second, if we know it. We don't require a constant for
3804 this case; some cost analysis could be done if both are available
3805 but neither is constant. For now, assume they're equally cheap,
3806 unless one has side effects. If both strings have constant lengths,
3813 else if (TREE_SIDE_EFFECTS (len1))
3815 else if (TREE_SIDE_EFFECTS (len2))
3817 else if (TREE_CODE (len1) != INTEGER_CST)
3819 else if (TREE_CODE (len2) != INTEGER_CST)
3821 else if (tree_int_cst_lt (len1, len2))
3826 /* If both arguments have side effects, we cannot optimize. */
3827 if (!len || TREE_SIDE_EFFECTS (len))
3830 arg3_rtx = expand_normal (len);
3832 /* Make a place to write the result of the instruction. */
3835 && REG_P (result) && GET_MODE (result) == insn_mode
3836 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
3837 result = gen_reg_rtx (insn_mode);
3839 insn = gen_cmpstrnsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
3840 GEN_INT (MIN (arg1_align, arg2_align)));
3846 enum machine_mode mode;
3849 /* Return the value in the proper mode for this function. */
3850 mode = TYPE_MODE (TREE_TYPE (exp));
3851 if (GET_MODE (result) == mode)
3854 return convert_to_mode (mode, result, 0);
3855 convert_move (target, result, 0);
3859 /* Expand the library call ourselves using a stabilized argument
3860 list to avoid re-evaluating the function's arguments twice. */
3861 #ifdef HAVE_cmpstrnsi
3864 fndecl = get_callee_fndecl (exp);
3865 fn = build_call_nofold_loc (EXPR_LOCATION (exp), fndecl, 2, arg1, arg2);
3866 gcc_assert (TREE_CODE (fn) == CALL_EXPR);
3867 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
3868 return expand_call (fn, target, target == const0_rtx);
3874 /* Expand expression EXP, which is a call to the strncmp builtin. Return
3875 NULL_RTX if we failed the caller should emit a normal call, otherwise try to get
3876 the result in TARGET, if convenient. */
3879 expand_builtin_strncmp (tree exp, ATTRIBUTE_UNUSED rtx target,
3880 ATTRIBUTE_UNUSED enum machine_mode mode)
3882 location_t loc ATTRIBUTE_UNUSED = EXPR_LOCATION (exp);
3884 if (!validate_arglist (exp,
3885 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3888 /* If c_strlen can determine an expression for one of the string
3889 lengths, and it doesn't have side effects, then emit cmpstrnsi
3890 using length MIN(strlen(string)+1, arg3). */
3891 #ifdef HAVE_cmpstrnsi
3894 tree len, len1, len2;
3895 rtx arg1_rtx, arg2_rtx, arg3_rtx;
3898 tree arg1 = CALL_EXPR_ARG (exp, 0);
3899 tree arg2 = CALL_EXPR_ARG (exp, 1);
3900 tree arg3 = CALL_EXPR_ARG (exp, 2);
3902 unsigned int arg1_align = get_pointer_alignment (arg1) / BITS_PER_UNIT;
3903 unsigned int arg2_align = get_pointer_alignment (arg2) / BITS_PER_UNIT;
3904 enum machine_mode insn_mode
3905 = insn_data[(int) CODE_FOR_cmpstrnsi].operand[0].mode;
3907 len1 = c_strlen (arg1, 1);
3908 len2 = c_strlen (arg2, 1);
3911 len1 = size_binop_loc (loc, PLUS_EXPR, ssize_int (1), len1);
3913 len2 = size_binop_loc (loc, PLUS_EXPR, ssize_int (1), len2);
3915 /* If we don't have a constant length for the first, use the length
3916 of the second, if we know it. We don't require a constant for
3917 this case; some cost analysis could be done if both are available
3918 but neither is constant. For now, assume they're equally cheap,
3919 unless one has side effects. If both strings have constant lengths,
3926 else if (TREE_SIDE_EFFECTS (len1))
3928 else if (TREE_SIDE_EFFECTS (len2))
3930 else if (TREE_CODE (len1) != INTEGER_CST)
3932 else if (TREE_CODE (len2) != INTEGER_CST)
3934 else if (tree_int_cst_lt (len1, len2))
3939 /* If both arguments have side effects, we cannot optimize. */
3940 if (!len || TREE_SIDE_EFFECTS (len))
3943 /* The actual new length parameter is MIN(len,arg3). */
3944 len = fold_build2_loc (loc, MIN_EXPR, TREE_TYPE (len), len,
3945 fold_convert_loc (loc, TREE_TYPE (len), arg3));
3947 /* If we don't have POINTER_TYPE, call the function. */
3948 if (arg1_align == 0 || arg2_align == 0)
3951 /* Make a place to write the result of the instruction. */
3954 && REG_P (result) && GET_MODE (result) == insn_mode
3955 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
3956 result = gen_reg_rtx (insn_mode);
3958 /* Stabilize the arguments in case gen_cmpstrnsi fails. */
3959 arg1 = builtin_save_expr (arg1);
3960 arg2 = builtin_save_expr (arg2);
3961 len = builtin_save_expr (len);
3963 arg1_rtx = get_memory_rtx (arg1, len);
3964 arg2_rtx = get_memory_rtx (arg2, len);
3965 arg3_rtx = expand_normal (len);
3966 insn = gen_cmpstrnsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
3967 GEN_INT (MIN (arg1_align, arg2_align)));
3972 /* Return the value in the proper mode for this function. */
3973 mode = TYPE_MODE (TREE_TYPE (exp));
3974 if (GET_MODE (result) == mode)
3977 return convert_to_mode (mode, result, 0);
3978 convert_move (target, result, 0);
3982 /* Expand the library call ourselves using a stabilized argument
3983 list to avoid re-evaluating the function's arguments twice. */
3984 fndecl = get_callee_fndecl (exp);
3985 fn = build_call_nofold_loc (EXPR_LOCATION (exp), fndecl, 3,
3987 gcc_assert (TREE_CODE (fn) == CALL_EXPR);
3988 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
3989 return expand_call (fn, target, target == const0_rtx);
3995 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
3996 if that's convenient. */
3999 expand_builtin_saveregs (void)
4003 /* Don't do __builtin_saveregs more than once in a function.
4004 Save the result of the first call and reuse it. */
4005 if (saveregs_value != 0)
4006 return saveregs_value;
4008 /* When this function is called, it means that registers must be
4009 saved on entry to this function. So we migrate the call to the
4010 first insn of this function. */
4014 /* Do whatever the machine needs done in this case. */
4015 val = targetm.calls.expand_builtin_saveregs ();
4020 saveregs_value = val;
4022 /* Put the insns after the NOTE that starts the function. If this
4023 is inside a start_sequence, make the outer-level insn chain current, so
4024 the code is placed at the start of the function. */
4025 push_topmost_sequence ();
4026 emit_insn_after (seq, entry_of_function ());
4027 pop_topmost_sequence ();
4032 /* Expand a call to __builtin_next_arg. */
4035 expand_builtin_next_arg (void)
4037 /* Checking arguments is already done in fold_builtin_next_arg
4038 that must be called before this function. */
4039 return expand_binop (ptr_mode, add_optab,
4040 crtl->args.internal_arg_pointer,
4041 crtl->args.arg_offset_rtx,
4042 NULL_RTX, 0, OPTAB_LIB_WIDEN);
4045 /* Make it easier for the backends by protecting the valist argument
4046 from multiple evaluations. */
4049 stabilize_va_list_loc (location_t loc, tree valist, int needs_lvalue)
4051 tree vatype = targetm.canonical_va_list_type (TREE_TYPE (valist));
4053 /* The current way of determining the type of valist is completely
4054 bogus. We should have the information on the va builtin instead. */
4056 vatype = targetm.fn_abi_va_list (cfun->decl);
4058 if (TREE_CODE (vatype) == ARRAY_TYPE)
4060 if (TREE_SIDE_EFFECTS (valist))
4061 valist = save_expr (valist);
4063 /* For this case, the backends will be expecting a pointer to
4064 vatype, but it's possible we've actually been given an array
4065 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
4067 if (TREE_CODE (TREE_TYPE (valist)) == ARRAY_TYPE)
4069 tree p1 = build_pointer_type (TREE_TYPE (vatype));
4070 valist = build_fold_addr_expr_with_type_loc (loc, valist, p1);
4075 tree pt = build_pointer_type (vatype);
4079 if (! TREE_SIDE_EFFECTS (valist))
4082 valist = fold_build1_loc (loc, ADDR_EXPR, pt, valist);
4083 TREE_SIDE_EFFECTS (valist) = 1;
4086 if (TREE_SIDE_EFFECTS (valist))
4087 valist = save_expr (valist);
4088 valist = fold_build2_loc (loc, MEM_REF,
4089 vatype, valist, build_int_cst (pt, 0));
4095 /* The "standard" definition of va_list is void*. */
4098 std_build_builtin_va_list (void)
4100 return ptr_type_node;
4103 /* The "standard" abi va_list is va_list_type_node. */
4106 std_fn_abi_va_list (tree fndecl ATTRIBUTE_UNUSED)
4108 return va_list_type_node;
4111 /* The "standard" type of va_list is va_list_type_node. */
4114 std_canonical_va_list_type (tree type)
4118 if (INDIRECT_REF_P (type))
4119 type = TREE_TYPE (type);
4120 else if (POINTER_TYPE_P (type) && POINTER_TYPE_P (TREE_TYPE(type)))
4121 type = TREE_TYPE (type);
4122 wtype = va_list_type_node;
4124 /* Treat structure va_list types. */
4125 if (TREE_CODE (wtype) == RECORD_TYPE && POINTER_TYPE_P (htype))
4126 htype = TREE_TYPE (htype);
4127 else if (TREE_CODE (wtype) == ARRAY_TYPE)
4129 /* If va_list is an array type, the argument may have decayed
4130 to a pointer type, e.g. by being passed to another function.
4131 In that case, unwrap both types so that we can compare the
4132 underlying records. */
4133 if (TREE_CODE (htype) == ARRAY_TYPE
4134 || POINTER_TYPE_P (htype))
4136 wtype = TREE_TYPE (wtype);
4137 htype = TREE_TYPE (htype);
4140 if (TYPE_MAIN_VARIANT (wtype) == TYPE_MAIN_VARIANT (htype))
4141 return va_list_type_node;
4146 /* The "standard" implementation of va_start: just assign `nextarg' to
4150 std_expand_builtin_va_start (tree valist, rtx nextarg)
4152 rtx va_r = expand_expr (valist, NULL_RTX, VOIDmode, EXPAND_WRITE);
4153 convert_move (va_r, nextarg, 0);
4156 /* Expand EXP, a call to __builtin_va_start. */
4159 expand_builtin_va_start (tree exp)
4163 location_t loc = EXPR_LOCATION (exp);
4165 if (call_expr_nargs (exp) < 2)
4167 error_at (loc, "too few arguments to function %<va_start%>");
4171 if (fold_builtin_next_arg (exp, true))
4174 nextarg = expand_builtin_next_arg ();
4175 valist = stabilize_va_list_loc (loc, CALL_EXPR_ARG (exp, 0), 1);
4177 if (targetm.expand_builtin_va_start)
4178 targetm.expand_builtin_va_start (valist, nextarg);
4180 std_expand_builtin_va_start (valist, nextarg);
4185 /* The "standard" implementation of va_arg: read the value from the
4186 current (padded) address and increment by the (padded) size. */
4189 std_gimplify_va_arg_expr (tree valist, tree type, gimple_seq *pre_p,
4192 tree addr, t, type_size, rounded_size, valist_tmp;
4193 unsigned HOST_WIDE_INT align, boundary;
4196 #ifdef ARGS_GROW_DOWNWARD
4197 /* All of the alignment and movement below is for args-grow-up machines.
4198 As of 2004, there are only 3 ARGS_GROW_DOWNWARD targets, and they all
4199 implement their own specialized gimplify_va_arg_expr routines. */
4203 indirect = pass_by_reference (NULL, TYPE_MODE (type), type, false);
4205 type = build_pointer_type (type);
4207 align = PARM_BOUNDARY / BITS_PER_UNIT;
4208 boundary = targetm.calls.function_arg_boundary (TYPE_MODE (type), type);
4210 /* When we align parameter on stack for caller, if the parameter
4211 alignment is beyond MAX_SUPPORTED_STACK_ALIGNMENT, it will be
4212 aligned at MAX_SUPPORTED_STACK_ALIGNMENT. We will match callee
4213 here with caller. */
4214 if (boundary > MAX_SUPPORTED_STACK_ALIGNMENT)
4215 boundary = MAX_SUPPORTED_STACK_ALIGNMENT;
4217 boundary /= BITS_PER_UNIT;
4219 /* Hoist the valist value into a temporary for the moment. */
4220 valist_tmp = get_initialized_tmp_var (valist, pre_p, NULL);
4222 /* va_list pointer is aligned to PARM_BOUNDARY. If argument actually
4223 requires greater alignment, we must perform dynamic alignment. */
4224 if (boundary > align
4225 && !integer_zerop (TYPE_SIZE (type)))
4227 t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist_tmp,
4228 fold_build_pointer_plus_hwi (valist_tmp, boundary - 1));
4229 gimplify_and_add (t, pre_p);
4231 t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist_tmp,
4232 fold_build2 (BIT_AND_EXPR, TREE_TYPE (valist),
4234 build_int_cst (TREE_TYPE (valist), -boundary)));
4235 gimplify_and_add (t, pre_p);
4240 /* If the actual alignment is less than the alignment of the type,
4241 adjust the type accordingly so that we don't assume strict alignment
4242 when dereferencing the pointer. */
4243 boundary *= BITS_PER_UNIT;
4244 if (boundary < TYPE_ALIGN (type))
4246 type = build_variant_type_copy (type);
4247 TYPE_ALIGN (type) = boundary;
4250 /* Compute the rounded size of the type. */
4251 type_size = size_in_bytes (type);
4252 rounded_size = round_up (type_size, align);
4254 /* Reduce rounded_size so it's sharable with the postqueue. */
4255 gimplify_expr (&rounded_size, pre_p, post_p, is_gimple_val, fb_rvalue);
4259 if (PAD_VARARGS_DOWN && !integer_zerop (rounded_size))
4261 /* Small args are padded downward. */
4262 t = fold_build2_loc (input_location, GT_EXPR, sizetype,
4263 rounded_size, size_int (align));
4264 t = fold_build3 (COND_EXPR, sizetype, t, size_zero_node,
4265 size_binop (MINUS_EXPR, rounded_size, type_size));
4266 addr = fold_build_pointer_plus (addr, t);
4269 /* Compute new value for AP. */
4270 t = fold_build_pointer_plus (valist_tmp, rounded_size);
4271 t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist, t);
4272 gimplify_and_add (t, pre_p);
4274 addr = fold_convert (build_pointer_type (type), addr);
4277 addr = build_va_arg_indirect_ref (addr);
4279 return build_va_arg_indirect_ref (addr);
4282 /* Build an indirect-ref expression over the given TREE, which represents a
4283 piece of a va_arg() expansion. */
4285 build_va_arg_indirect_ref (tree addr)
4287 addr = build_simple_mem_ref_loc (EXPR_LOCATION (addr), addr);
4289 if (flag_mudflap) /* Don't instrument va_arg INDIRECT_REF. */
4295 /* Return a dummy expression of type TYPE in order to keep going after an
4299 dummy_object (tree type)
4301 tree t = build_int_cst (build_pointer_type (type), 0);
4302 return build2 (MEM_REF, type, t, t);
4305 /* Gimplify __builtin_va_arg, aka VA_ARG_EXPR, which is not really a
4306 builtin function, but a very special sort of operator. */
4308 enum gimplify_status
4309 gimplify_va_arg_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4311 tree promoted_type, have_va_type;
4312 tree valist = TREE_OPERAND (*expr_p, 0);
4313 tree type = TREE_TYPE (*expr_p);
4315 location_t loc = EXPR_LOCATION (*expr_p);
4317 /* Verify that valist is of the proper type. */
4318 have_va_type = TREE_TYPE (valist);
4319 if (have_va_type == error_mark_node)
4321 have_va_type = targetm.canonical_va_list_type (have_va_type);
4323 if (have_va_type == NULL_TREE)
4325 error_at (loc, "first argument to %<va_arg%> not of type %<va_list%>");
4329 /* Generate a diagnostic for requesting data of a type that cannot
4330 be passed through `...' due to type promotion at the call site. */
4331 if ((promoted_type = lang_hooks.types.type_promotes_to (type))
4334 static bool gave_help;
4337 /* Unfortunately, this is merely undefined, rather than a constraint
4338 violation, so we cannot make this an error. If this call is never
4339 executed, the program is still strictly conforming. */
4340 warned = warning_at (loc, 0,
4341 "%qT is promoted to %qT when passed through %<...%>",
4342 type, promoted_type);
4343 if (!gave_help && warned)
4346 inform (loc, "(so you should pass %qT not %qT to %<va_arg%>)",
4347 promoted_type, type);
4350 /* We can, however, treat "undefined" any way we please.
4351 Call abort to encourage the user to fix the program. */
4353 inform (loc, "if this code is reached, the program will abort");
4354 /* Before the abort, allow the evaluation of the va_list
4355 expression to exit or longjmp. */
4356 gimplify_and_add (valist, pre_p);
4357 t = build_call_expr_loc (loc,
4358 builtin_decl_implicit (BUILT_IN_TRAP), 0);
4359 gimplify_and_add (t, pre_p);
4361 /* This is dead code, but go ahead and finish so that the
4362 mode of the result comes out right. */
4363 *expr_p = dummy_object (type);
4368 /* Make it easier for the backends by protecting the valist argument
4369 from multiple evaluations. */
4370 if (TREE_CODE (have_va_type) == ARRAY_TYPE)
4372 /* For this case, the backends will be expecting a pointer to
4373 TREE_TYPE (abi), but it's possible we've
4374 actually been given an array (an actual TARGET_FN_ABI_VA_LIST).
4376 if (TREE_CODE (TREE_TYPE (valist)) == ARRAY_TYPE)
4378 tree p1 = build_pointer_type (TREE_TYPE (have_va_type));
4379 valist = fold_convert_loc (loc, p1,
4380 build_fold_addr_expr_loc (loc, valist));
4383 gimplify_expr (&valist, pre_p, post_p, is_gimple_val, fb_rvalue);
4386 gimplify_expr (&valist, pre_p, post_p, is_gimple_min_lval, fb_lvalue);
4388 if (!targetm.gimplify_va_arg_expr)
4389 /* FIXME: Once most targets are converted we should merely
4390 assert this is non-null. */
4393 *expr_p = targetm.gimplify_va_arg_expr (valist, type, pre_p, post_p);
4398 /* Expand EXP, a call to __builtin_va_end. */
4401 expand_builtin_va_end (tree exp)
4403 tree valist = CALL_EXPR_ARG (exp, 0);
4405 /* Evaluate for side effects, if needed. I hate macros that don't
4407 if (TREE_SIDE_EFFECTS (valist))
4408 expand_expr (valist, const0_rtx, VOIDmode, EXPAND_NORMAL);
4413 /* Expand EXP, a call to __builtin_va_copy. We do this as a
4414 builtin rather than just as an assignment in stdarg.h because of the
4415 nastiness of array-type va_list types. */
4418 expand_builtin_va_copy (tree exp)
4421 location_t loc = EXPR_LOCATION (exp);
4423 dst = CALL_EXPR_ARG (exp, 0);
4424 src = CALL_EXPR_ARG (exp, 1);
4426 dst = stabilize_va_list_loc (loc, dst, 1);
4427 src = stabilize_va_list_loc (loc, src, 0);
4429 gcc_assert (cfun != NULL && cfun->decl != NULL_TREE);
4431 if (TREE_CODE (targetm.fn_abi_va_list (cfun->decl)) != ARRAY_TYPE)
4433 t = build2 (MODIFY_EXPR, targetm.fn_abi_va_list (cfun->decl), dst, src);
4434 TREE_SIDE_EFFECTS (t) = 1;
4435 expand_expr (t, const0_rtx, VOIDmode, EXPAND_NORMAL);
4439 rtx dstb, srcb, size;
4441 /* Evaluate to pointers. */
4442 dstb = expand_expr (dst, NULL_RTX, Pmode, EXPAND_NORMAL);
4443 srcb = expand_expr (src, NULL_RTX, Pmode, EXPAND_NORMAL);
4444 size = expand_expr (TYPE_SIZE_UNIT (targetm.fn_abi_va_list (cfun->decl)),
4445 NULL_RTX, VOIDmode, EXPAND_NORMAL);
4447 dstb = convert_memory_address (Pmode, dstb);
4448 srcb = convert_memory_address (Pmode, srcb);
4450 /* "Dereference" to BLKmode memories. */
4451 dstb = gen_rtx_MEM (BLKmode, dstb);
4452 set_mem_alias_set (dstb, get_alias_set (TREE_TYPE (TREE_TYPE (dst))));
4453 set_mem_align (dstb, TYPE_ALIGN (targetm.fn_abi_va_list (cfun->decl)));
4454 srcb = gen_rtx_MEM (BLKmode, srcb);
4455 set_mem_alias_set (srcb, get_alias_set (TREE_TYPE (TREE_TYPE (src))));
4456 set_mem_align (srcb, TYPE_ALIGN (targetm.fn_abi_va_list (cfun->decl)));
4459 emit_block_move (dstb, srcb, size, BLOCK_OP_NORMAL);
4465 /* Expand a call to one of the builtin functions __builtin_frame_address or
4466 __builtin_return_address. */
4469 expand_builtin_frame_address (tree fndecl, tree exp)
4471 /* The argument must be a nonnegative integer constant.
4472 It counts the number of frames to scan up the stack.
4473 The value is the return address saved in that frame. */
4474 if (call_expr_nargs (exp) == 0)
4475 /* Warning about missing arg was already issued. */
4477 else if (! host_integerp (CALL_EXPR_ARG (exp, 0), 1))
4479 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS)
4480 error ("invalid argument to %<__builtin_frame_address%>");
4482 error ("invalid argument to %<__builtin_return_address%>");
4488 = expand_builtin_return_addr (DECL_FUNCTION_CODE (fndecl),
4489 tree_low_cst (CALL_EXPR_ARG (exp, 0), 1));
4491 /* Some ports cannot access arbitrary stack frames. */
4494 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS)
4495 warning (0, "unsupported argument to %<__builtin_frame_address%>");
4497 warning (0, "unsupported argument to %<__builtin_return_address%>");
4501 /* For __builtin_frame_address, return what we've got. */
4502 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS)
4506 && ! CONSTANT_P (tem))
4507 tem = copy_to_mode_reg (Pmode, tem);
4512 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we
4513 failed and the caller should emit a normal call. CANNOT_ACCUMULATE
4514 is the same as for allocate_dynamic_stack_space. */
4517 expand_builtin_alloca (tree exp, bool cannot_accumulate)
4523 bool alloca_with_align = (DECL_FUNCTION_CODE (get_callee_fndecl (exp))
4524 == BUILT_IN_ALLOCA_WITH_ALIGN);
4526 /* Emit normal call if marked not-inlineable. */
4527 if (CALL_CANNOT_INLINE_P (exp))
4531 = (alloca_with_align
4532 ? validate_arglist (exp, INTEGER_TYPE, INTEGER_TYPE, VOID_TYPE)
4533 : validate_arglist (exp, INTEGER_TYPE, VOID_TYPE));
4538 /* Compute the argument. */
4539 op0 = expand_normal (CALL_EXPR_ARG (exp, 0));
4541 /* Compute the alignment. */
4542 align = (alloca_with_align
4543 ? TREE_INT_CST_LOW (CALL_EXPR_ARG (exp, 1))
4544 : BIGGEST_ALIGNMENT);
4546 /* Allocate the desired space. */
4547 result = allocate_dynamic_stack_space (op0, 0, align, cannot_accumulate);
4548 result = convert_memory_address (ptr_mode, result);
4553 /* Expand a call to a bswap builtin with argument ARG0. MODE
4554 is the mode to expand with. */
4557 expand_builtin_bswap (tree exp, rtx target, rtx subtarget)
4559 enum machine_mode mode;
4563 if (!validate_arglist (exp, INTEGER_TYPE, VOID_TYPE))
4566 arg = CALL_EXPR_ARG (exp, 0);
4567 mode = TYPE_MODE (TREE_TYPE (arg));
4568 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
4570 target = expand_unop (mode, bswap_optab, op0, target, 1);
4572 gcc_assert (target);
4574 return convert_to_mode (mode, target, 0);
4577 /* Expand a call to a unary builtin in EXP.
4578 Return NULL_RTX if a normal call should be emitted rather than expanding the
4579 function in-line. If convenient, the result should be placed in TARGET.
4580 SUBTARGET may be used as the target for computing one of EXP's operands. */
4583 expand_builtin_unop (enum machine_mode target_mode, tree exp, rtx target,
4584 rtx subtarget, optab op_optab)
4588 if (!validate_arglist (exp, INTEGER_TYPE, VOID_TYPE))
4591 /* Compute the argument. */
4592 op0 = expand_expr (CALL_EXPR_ARG (exp, 0),
4594 && (TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp, 0)))
4595 == GET_MODE (subtarget))) ? subtarget : NULL_RTX,
4596 VOIDmode, EXPAND_NORMAL);
4597 /* Compute op, into TARGET if possible.
4598 Set TARGET to wherever the result comes back. */
4599 target = expand_unop (TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp, 0))),
4600 op_optab, op0, target, op_optab != clrsb_optab);
4601 gcc_assert (target);
4603 return convert_to_mode (target_mode, target, 0);
4606 /* Expand a call to __builtin_expect. We just return our argument
4607 as the builtin_expect semantic should've been already executed by
4608 tree branch prediction pass. */
4611 expand_builtin_expect (tree exp, rtx target)
4615 if (call_expr_nargs (exp) < 2)
4617 arg = CALL_EXPR_ARG (exp, 0);
4619 target = expand_expr (arg, target, VOIDmode, EXPAND_NORMAL);
4620 /* When guessing was done, the hints should be already stripped away. */
4621 gcc_assert (!flag_guess_branch_prob
4622 || optimize == 0 || seen_error ());
4626 /* Expand a call to __builtin_assume_aligned. We just return our first
4627 argument as the builtin_assume_aligned semantic should've been already
4631 expand_builtin_assume_aligned (tree exp, rtx target)
4633 if (call_expr_nargs (exp) < 2)
4635 target = expand_expr (CALL_EXPR_ARG (exp, 0), target, VOIDmode,
4637 gcc_assert (!TREE_SIDE_EFFECTS (CALL_EXPR_ARG (exp, 1))
4638 && (call_expr_nargs (exp) < 3
4639 || !TREE_SIDE_EFFECTS (CALL_EXPR_ARG (exp, 2))));
4644 expand_builtin_trap (void)
4648 emit_insn (gen_trap ());
4651 emit_library_call (abort_libfunc, LCT_NORETURN, VOIDmode, 0);
4655 /* Expand a call to __builtin_unreachable. We do nothing except emit
4656 a barrier saying that control flow will not pass here.
4658 It is the responsibility of the program being compiled to ensure
4659 that control flow does never reach __builtin_unreachable. */
4661 expand_builtin_unreachable (void)
4666 /* Expand EXP, a call to fabs, fabsf or fabsl.
4667 Return NULL_RTX if a normal call should be emitted rather than expanding
4668 the function inline. If convenient, the result should be placed
4669 in TARGET. SUBTARGET may be used as the target for computing
4673 expand_builtin_fabs (tree exp, rtx target, rtx subtarget)
4675 enum machine_mode mode;
4679 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
4682 arg = CALL_EXPR_ARG (exp, 0);
4683 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
4684 mode = TYPE_MODE (TREE_TYPE (arg));
4685 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
4686 return expand_abs (mode, op0, target, 0, safe_from_p (target, arg, 1));
4689 /* Expand EXP, a call to copysign, copysignf, or copysignl.
4690 Return NULL is a normal call should be emitted rather than expanding the
4691 function inline. If convenient, the result should be placed in TARGET.
4692 SUBTARGET may be used as the target for computing the operand. */
4695 expand_builtin_copysign (tree exp, rtx target, rtx subtarget)
4700 if (!validate_arglist (exp, REAL_TYPE, REAL_TYPE, VOID_TYPE))
4703 arg = CALL_EXPR_ARG (exp, 0);
4704 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
4706 arg = CALL_EXPR_ARG (exp, 1);
4707 op1 = expand_normal (arg);
4709 return expand_copysign (op0, op1, target);
4712 /* Create a new constant string literal and return a char* pointer to it.
4713 The STRING_CST value is the LEN characters at STR. */
4715 build_string_literal (int len, const char *str)
4717 tree t, elem, index, type;
4719 t = build_string (len, str);
4720 elem = build_type_variant (char_type_node, 1, 0);
4721 index = build_index_type (size_int (len - 1));
4722 type = build_array_type (elem, index);
4723 TREE_TYPE (t) = type;
4724 TREE_CONSTANT (t) = 1;
4725 TREE_READONLY (t) = 1;
4726 TREE_STATIC (t) = 1;
4728 type = build_pointer_type (elem);
4729 t = build1 (ADDR_EXPR, type,
4730 build4 (ARRAY_REF, elem,
4731 t, integer_zero_node, NULL_TREE, NULL_TREE));
4735 /* Expand a call to __builtin___clear_cache. */
4738 expand_builtin___clear_cache (tree exp ATTRIBUTE_UNUSED)
4740 #ifndef HAVE_clear_cache
4741 #ifdef CLEAR_INSN_CACHE
4742 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
4743 does something. Just do the default expansion to a call to
4747 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
4748 does nothing. There is no need to call it. Do nothing. */
4750 #endif /* CLEAR_INSN_CACHE */
4752 /* We have a "clear_cache" insn, and it will handle everything. */
4754 rtx begin_rtx, end_rtx;
4756 /* We must not expand to a library call. If we did, any
4757 fallback library function in libgcc that might contain a call to
4758 __builtin___clear_cache() would recurse infinitely. */
4759 if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
4761 error ("both arguments to %<__builtin___clear_cache%> must be pointers");
4765 if (HAVE_clear_cache)
4767 struct expand_operand ops[2];
4769 begin = CALL_EXPR_ARG (exp, 0);
4770 begin_rtx = expand_expr (begin, NULL_RTX, Pmode, EXPAND_NORMAL);
4772 end = CALL_EXPR_ARG (exp, 1);
4773 end_rtx = expand_expr (end, NULL_RTX, Pmode, EXPAND_NORMAL);
4775 create_address_operand (&ops[0], begin_rtx);
4776 create_address_operand (&ops[1], end_rtx);
4777 if (maybe_expand_insn (CODE_FOR_clear_cache, 2, ops))
4781 #endif /* HAVE_clear_cache */
4784 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
4787 round_trampoline_addr (rtx tramp)
4789 rtx temp, addend, mask;
4791 /* If we don't need too much alignment, we'll have been guaranteed
4792 proper alignment by get_trampoline_type. */
4793 if (TRAMPOLINE_ALIGNMENT <= STACK_BOUNDARY)
4796 /* Round address up to desired boundary. */
4797 temp = gen_reg_rtx (Pmode);
4798 addend = GEN_INT (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT - 1);
4799 mask = GEN_INT (-TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT);
4801 temp = expand_simple_binop (Pmode, PLUS, tramp, addend,
4802 temp, 0, OPTAB_LIB_WIDEN);
4803 tramp = expand_simple_binop (Pmode, AND, temp, mask,
4804 temp, 0, OPTAB_LIB_WIDEN);
4810 expand_builtin_init_trampoline (tree exp)
4812 tree t_tramp, t_func, t_chain;
4813 rtx m_tramp, r_tramp, r_chain, tmp;
4815 if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE,
4816 POINTER_TYPE, VOID_TYPE))
4819 t_tramp = CALL_EXPR_ARG (exp, 0);
4820 t_func = CALL_EXPR_ARG (exp, 1);
4821 t_chain = CALL_EXPR_ARG (exp, 2);
4823 r_tramp = expand_normal (t_tramp);
4824 m_tramp = gen_rtx_MEM (BLKmode, r_tramp);
4825 MEM_NOTRAP_P (m_tramp) = 1;
4827 /* The TRAMP argument should be the address of a field within the
4828 local function's FRAME decl. Let's see if we can fill in the
4829 to fill in the MEM_ATTRs for this memory. */
4830 if (TREE_CODE (t_tramp) == ADDR_EXPR)
4831 set_mem_attributes_minus_bitpos (m_tramp, TREE_OPERAND (t_tramp, 0),
4834 tmp = round_trampoline_addr (r_tramp);
4837 m_tramp = change_address (m_tramp, BLKmode, tmp);
4838 set_mem_align (m_tramp, TRAMPOLINE_ALIGNMENT);
4839 set_mem_size (m_tramp, TRAMPOLINE_SIZE);
4842 /* The FUNC argument should be the address of the nested function.
4843 Extract the actual function decl to pass to the hook. */
4844 gcc_assert (TREE_CODE (t_func) == ADDR_EXPR);
4845 t_func = TREE_OPERAND (t_func, 0);
4846 gcc_assert (TREE_CODE (t_func) == FUNCTION_DECL);
4848 r_chain = expand_normal (t_chain);
4850 /* Generate insns to initialize the trampoline. */
4851 targetm.calls.trampoline_init (m_tramp, t_func, r_chain);
4853 trampolines_created = 1;
4855 warning_at (DECL_SOURCE_LOCATION (t_func), OPT_Wtrampolines,
4856 "trampoline generated for nested function %qD", t_func);
4862 expand_builtin_adjust_trampoline (tree exp)
4866 if (!validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
4869 tramp = expand_normal (CALL_EXPR_ARG (exp, 0));
4870 tramp = round_trampoline_addr (tramp);
4871 if (targetm.calls.trampoline_adjust_address)
4872 tramp = targetm.calls.trampoline_adjust_address (tramp);
4877 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
4878 function. The function first checks whether the back end provides
4879 an insn to implement signbit for the respective mode. If not, it
4880 checks whether the floating point format of the value is such that
4881 the sign bit can be extracted. If that is not the case, the
4882 function returns NULL_RTX to indicate that a normal call should be
4883 emitted rather than expanding the function in-line. EXP is the
4884 expression that is a call to the builtin function; if convenient,
4885 the result should be placed in TARGET. */
4887 expand_builtin_signbit (tree exp, rtx target)
4889 const struct real_format *fmt;
4890 enum machine_mode fmode, imode, rmode;
4893 enum insn_code icode;
4895 location_t loc = EXPR_LOCATION (exp);
4897 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
4900 arg = CALL_EXPR_ARG (exp, 0);
4901 fmode = TYPE_MODE (TREE_TYPE (arg));
4902 rmode = TYPE_MODE (TREE_TYPE (exp));
4903 fmt = REAL_MODE_FORMAT (fmode);
4905 arg = builtin_save_expr (arg);
4907 /* Expand the argument yielding a RTX expression. */
4908 temp = expand_normal (arg);
4910 /* Check if the back end provides an insn that handles signbit for the
4912 icode = optab_handler (signbit_optab, fmode);
4913 if (icode != CODE_FOR_nothing)
4915 rtx last = get_last_insn ();
4916 target = gen_reg_rtx (TYPE_MODE (TREE_TYPE (exp)));
4917 if (maybe_emit_unop_insn (icode, target, temp, UNKNOWN))
4919 delete_insns_since (last);
4922 /* For floating point formats without a sign bit, implement signbit
4924 bitpos = fmt->signbit_ro;
4927 /* But we can't do this if the format supports signed zero. */
4928 if (fmt->has_signed_zero && HONOR_SIGNED_ZEROS (fmode))
4931 arg = fold_build2_loc (loc, LT_EXPR, TREE_TYPE (exp), arg,
4932 build_real (TREE_TYPE (arg), dconst0));
4933 return expand_expr (arg, target, VOIDmode, EXPAND_NORMAL);
4936 if (GET_MODE_SIZE (fmode) <= UNITS_PER_WORD)
4938 imode = int_mode_for_mode (fmode);
4939 if (imode == BLKmode)
4941 temp = gen_lowpart (imode, temp);
4946 /* Handle targets with different FP word orders. */
4947 if (FLOAT_WORDS_BIG_ENDIAN)
4948 word = (GET_MODE_BITSIZE (fmode) - bitpos) / BITS_PER_WORD;
4950 word = bitpos / BITS_PER_WORD;
4951 temp = operand_subword_force (temp, word, fmode);
4952 bitpos = bitpos % BITS_PER_WORD;
4955 /* Force the intermediate word_mode (or narrower) result into a
4956 register. This avoids attempting to create paradoxical SUBREGs
4957 of floating point modes below. */
4958 temp = force_reg (imode, temp);
4960 /* If the bitpos is within the "result mode" lowpart, the operation
4961 can be implement with a single bitwise AND. Otherwise, we need
4962 a right shift and an AND. */
4964 if (bitpos < GET_MODE_BITSIZE (rmode))
4966 double_int mask = double_int_setbit (double_int_zero, bitpos);
4968 if (GET_MODE_SIZE (imode) > GET_MODE_SIZE (rmode))
4969 temp = gen_lowpart (rmode, temp);
4970 temp = expand_binop (rmode, and_optab, temp,
4971 immed_double_int_const (mask, rmode),
4972 NULL_RTX, 1, OPTAB_LIB_WIDEN);
4976 /* Perform a logical right shift to place the signbit in the least
4977 significant bit, then truncate the result to the desired mode
4978 and mask just this bit. */
4979 temp = expand_shift (RSHIFT_EXPR, imode, temp, bitpos, NULL_RTX, 1);
4980 temp = gen_lowpart (rmode, temp);
4981 temp = expand_binop (rmode, and_optab, temp, const1_rtx,
4982 NULL_RTX, 1, OPTAB_LIB_WIDEN);
4988 /* Expand fork or exec calls. TARGET is the desired target of the
4989 call. EXP is the call. FN is the
4990 identificator of the actual function. IGNORE is nonzero if the
4991 value is to be ignored. */
4994 expand_builtin_fork_or_exec (tree fn, tree exp, rtx target, int ignore)
4999 /* If we are not profiling, just call the function. */
5000 if (!profile_arc_flag)
5003 /* Otherwise call the wrapper. This should be equivalent for the rest of
5004 compiler, so the code does not diverge, and the wrapper may run the
5005 code necessary for keeping the profiling sane. */
5007 switch (DECL_FUNCTION_CODE (fn))
5010 id = get_identifier ("__gcov_fork");
5013 case BUILT_IN_EXECL:
5014 id = get_identifier ("__gcov_execl");
5017 case BUILT_IN_EXECV:
5018 id = get_identifier ("__gcov_execv");
5021 case BUILT_IN_EXECLP:
5022 id = get_identifier ("__gcov_execlp");
5025 case BUILT_IN_EXECLE:
5026 id = get_identifier ("__gcov_execle");
5029 case BUILT_IN_EXECVP:
5030 id = get_identifier ("__gcov_execvp");
5033 case BUILT_IN_EXECVE:
5034 id = get_identifier ("__gcov_execve");
5041 decl = build_decl (DECL_SOURCE_LOCATION (fn),
5042 FUNCTION_DECL, id, TREE_TYPE (fn));
5043 DECL_EXTERNAL (decl) = 1;
5044 TREE_PUBLIC (decl) = 1;
5045 DECL_ARTIFICIAL (decl) = 1;
5046 TREE_NOTHROW (decl) = 1;
5047 DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT;
5048 DECL_VISIBILITY_SPECIFIED (decl) = 1;
5049 call = rewrite_call_expr (EXPR_LOCATION (exp), exp, 0, decl, 0);
5050 return expand_call (call, target, ignore);
5055 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
5056 the pointer in these functions is void*, the tree optimizers may remove
5057 casts. The mode computed in expand_builtin isn't reliable either, due
5058 to __sync_bool_compare_and_swap.
5060 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
5061 group of builtins. This gives us log2 of the mode size. */
5063 static inline enum machine_mode
5064 get_builtin_sync_mode (int fcode_diff)
5066 /* The size is not negotiable, so ask not to get BLKmode in return
5067 if the target indicates that a smaller size would be better. */
5068 return mode_for_size (BITS_PER_UNIT << fcode_diff, MODE_INT, 0);
5071 /* Expand the memory expression LOC and return the appropriate memory operand
5072 for the builtin_sync operations. */
5075 get_builtin_sync_mem (tree loc, enum machine_mode mode)
5079 addr = expand_expr (loc, NULL_RTX, ptr_mode, EXPAND_SUM);
5080 addr = convert_memory_address (Pmode, addr);
5082 /* Note that we explicitly do not want any alias information for this
5083 memory, so that we kill all other live memories. Otherwise we don't
5084 satisfy the full barrier semantics of the intrinsic. */
5085 mem = validize_mem (gen_rtx_MEM (mode, addr));
5087 /* The alignment needs to be at least according to that of the mode. */
5088 set_mem_align (mem, MAX (GET_MODE_ALIGNMENT (mode),
5089 get_pointer_alignment (loc)));
5090 set_mem_alias_set (mem, ALIAS_SET_MEMORY_BARRIER);
5091 MEM_VOLATILE_P (mem) = 1;
5096 /* Make sure an argument is in the right mode.
5097 EXP is the tree argument.
5098 MODE is the mode it should be in. */
5101 expand_expr_force_mode (tree exp, enum machine_mode mode)
5104 enum machine_mode old_mode;
5106 val = expand_expr (exp, NULL_RTX, mode, EXPAND_NORMAL);
5107 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5108 of CONST_INTs, where we know the old_mode only from the call argument. */
5110 old_mode = GET_MODE (val);
5111 if (old_mode == VOIDmode)
5112 old_mode = TYPE_MODE (TREE_TYPE (exp));
5113 val = convert_modes (mode, old_mode, val, 1);
5118 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
5119 EXP is the CALL_EXPR. CODE is the rtx code
5120 that corresponds to the arithmetic or logical operation from the name;
5121 an exception here is that NOT actually means NAND. TARGET is an optional
5122 place for us to store the results; AFTER is true if this is the
5123 fetch_and_xxx form. */
5126 expand_builtin_sync_operation (enum machine_mode mode, tree exp,
5127 enum rtx_code code, bool after,
5131 location_t loc = EXPR_LOCATION (exp);
5133 if (code == NOT && warn_sync_nand)
5135 tree fndecl = get_callee_fndecl (exp);
5136 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
5138 static bool warned_f_a_n, warned_n_a_f;
5142 case BUILT_IN_SYNC_FETCH_AND_NAND_1:
5143 case BUILT_IN_SYNC_FETCH_AND_NAND_2:
5144 case BUILT_IN_SYNC_FETCH_AND_NAND_4:
5145 case BUILT_IN_SYNC_FETCH_AND_NAND_8:
5146 case BUILT_IN_SYNC_FETCH_AND_NAND_16:
5150 fndecl = builtin_decl_implicit (BUILT_IN_SYNC_FETCH_AND_NAND_N);
5151 inform (loc, "%qD changed semantics in GCC 4.4", fndecl);
5152 warned_f_a_n = true;
5155 case BUILT_IN_SYNC_NAND_AND_FETCH_1:
5156 case BUILT_IN_SYNC_NAND_AND_FETCH_2:
5157 case BUILT_IN_SYNC_NAND_AND_FETCH_4:
5158 case BUILT_IN_SYNC_NAND_AND_FETCH_8:
5159 case BUILT_IN_SYNC_NAND_AND_FETCH_16:
5163 fndecl = builtin_decl_implicit (BUILT_IN_SYNC_NAND_AND_FETCH_N);
5164 inform (loc, "%qD changed semantics in GCC 4.4", fndecl);
5165 warned_n_a_f = true;
5173 /* Expand the operands. */
5174 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5175 val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 1), mode);
5177 return expand_atomic_fetch_op (target, mem, val, code, MEMMODEL_SEQ_CST,
5181 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
5182 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
5183 true if this is the boolean form. TARGET is a place for us to store the
5184 results; this is NOT optional if IS_BOOL is true. */
5187 expand_builtin_compare_and_swap (enum machine_mode mode, tree exp,
5188 bool is_bool, rtx target)
5190 rtx old_val, new_val, mem;
5193 /* Expand the operands. */
5194 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5195 old_val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 1), mode);
5196 new_val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 2), mode);
5198 pbool = poval = NULL;
5199 if (target != const0_rtx)
5206 if (!expand_atomic_compare_and_swap (pbool, poval, mem, old_val, new_val,
5207 false, MEMMODEL_SEQ_CST,
5214 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
5215 general form is actually an atomic exchange, and some targets only
5216 support a reduced form with the second argument being a constant 1.
5217 EXP is the CALL_EXPR; TARGET is an optional place for us to store
5221 expand_builtin_sync_lock_test_and_set (enum machine_mode mode, tree exp,
5226 /* Expand the operands. */
5227 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5228 val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 1), mode);
5230 return expand_atomic_exchange (target, mem, val, MEMMODEL_ACQUIRE, true);
5233 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
5236 expand_builtin_sync_lock_release (enum machine_mode mode, tree exp)
5240 /* Expand the operands. */
5241 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5243 expand_atomic_store (mem, const0_rtx, MEMMODEL_RELEASE, true);
5246 /* Given an integer representing an ``enum memmodel'', verify its
5247 correctness and return the memory model enum. */
5249 static enum memmodel
5250 get_memmodel (tree exp)
5254 /* If the parameter is not a constant, it's a run time value so we'll just
5255 convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking. */
5256 if (TREE_CODE (exp) != INTEGER_CST)
5257 return MEMMODEL_SEQ_CST;
5259 op = expand_normal (exp);
5260 if (INTVAL (op) < 0 || INTVAL (op) >= MEMMODEL_LAST)
5262 warning (OPT_Winvalid_memory_model,
5263 "invalid memory model argument to builtin");
5264 return MEMMODEL_SEQ_CST;
5266 return (enum memmodel) INTVAL (op);
5269 /* Expand the __atomic_exchange intrinsic:
5270 TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel)
5271 EXP is the CALL_EXPR.
5272 TARGET is an optional place for us to store the results. */
5275 expand_builtin_atomic_exchange (enum machine_mode mode, tree exp, rtx target)
5278 enum memmodel model;
5280 model = get_memmodel (CALL_EXPR_ARG (exp, 2));
5281 if (model == MEMMODEL_CONSUME)
5283 error ("invalid memory model for %<__atomic_exchange%>");
5287 if (!flag_inline_atomics)
5290 /* Expand the operands. */
5291 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5292 val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 1), mode);
5294 return expand_atomic_exchange (target, mem, val, model, false);
5297 /* Expand the __atomic_compare_exchange intrinsic:
5298 bool __atomic_compare_exchange (TYPE *object, TYPE *expect,
5299 TYPE desired, BOOL weak,
5300 enum memmodel success,
5301 enum memmodel failure)
5302 EXP is the CALL_EXPR.
5303 TARGET is an optional place for us to store the results. */
5306 expand_builtin_atomic_compare_exchange (enum machine_mode mode, tree exp,
5309 rtx expect, desired, mem, oldval;
5310 enum memmodel success, failure;
5314 success = get_memmodel (CALL_EXPR_ARG (exp, 4));
5315 failure = get_memmodel (CALL_EXPR_ARG (exp, 5));
5317 if (failure == MEMMODEL_RELEASE || failure == MEMMODEL_ACQ_REL)
5319 error ("invalid failure memory model for %<__atomic_compare_exchange%>");
5323 if (failure > success)
5325 error ("failure memory model cannot be stronger than success "
5326 "memory model for %<__atomic_compare_exchange%>");
5330 if (!flag_inline_atomics)
5333 /* Expand the operands. */
5334 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5336 expect = expand_normal (CALL_EXPR_ARG (exp, 1));
5337 expect = convert_memory_address (Pmode, expect);
5338 desired = expand_expr_force_mode (CALL_EXPR_ARG (exp, 2), mode);
5340 weak = CALL_EXPR_ARG (exp, 3);
5342 if (host_integerp (weak, 0) && tree_low_cst (weak, 0) != 0)
5345 oldval = copy_to_reg (gen_rtx_MEM (mode, expect));
5347 if (!expand_atomic_compare_and_swap ((target == const0_rtx ? NULL : &target),
5348 &oldval, mem, oldval, desired,
5349 is_weak, success, failure))
5352 emit_move_insn (gen_rtx_MEM (mode, expect), oldval);
5356 /* Expand the __atomic_load intrinsic:
5357 TYPE __atomic_load (TYPE *object, enum memmodel)
5358 EXP is the CALL_EXPR.
5359 TARGET is an optional place for us to store the results. */
5362 expand_builtin_atomic_load (enum machine_mode mode, tree exp, rtx target)
5365 enum memmodel model;
5367 model = get_memmodel (CALL_EXPR_ARG (exp, 1));
5368 if (model == MEMMODEL_RELEASE
5369 || model == MEMMODEL_ACQ_REL)
5371 error ("invalid memory model for %<__atomic_load%>");
5375 if (!flag_inline_atomics)
5378 /* Expand the operand. */
5379 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5381 return expand_atomic_load (target, mem, model);
5385 /* Expand the __atomic_store intrinsic:
5386 void __atomic_store (TYPE *object, TYPE desired, enum memmodel)
5387 EXP is the CALL_EXPR.
5388 TARGET is an optional place for us to store the results. */
5391 expand_builtin_atomic_store (enum machine_mode mode, tree exp)
5394 enum memmodel model;
5396 model = get_memmodel (CALL_EXPR_ARG (exp, 2));
5397 if (model != MEMMODEL_RELAXED
5398 && model != MEMMODEL_SEQ_CST
5399 && model != MEMMODEL_RELEASE)
5401 error ("invalid memory model for %<__atomic_store%>");
5405 if (!flag_inline_atomics)
5408 /* Expand the operands. */
5409 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5410 val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 1), mode);
5412 return expand_atomic_store (mem, val, model, false);
5415 /* Expand the __atomic_fetch_XXX intrinsic:
5416 TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel)
5417 EXP is the CALL_EXPR.
5418 TARGET is an optional place for us to store the results.
5419 CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR.
5420 FETCH_AFTER is true if returning the result of the operation.
5421 FETCH_AFTER is false if returning the value before the operation.
5422 IGNORE is true if the result is not used.
5423 EXT_CALL is the correct builtin for an external call if this cannot be
5424 resolved to an instruction sequence. */
5427 expand_builtin_atomic_fetch_op (enum machine_mode mode, tree exp, rtx target,
5428 enum rtx_code code, bool fetch_after,
5429 bool ignore, enum built_in_function ext_call)
5432 enum memmodel model;
5436 model = get_memmodel (CALL_EXPR_ARG (exp, 2));
5438 /* Expand the operands. */
5439 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5440 val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 1), mode);
5442 /* Only try generating instructions if inlining is turned on. */
5443 if (flag_inline_atomics)
5445 ret = expand_atomic_fetch_op (target, mem, val, code, model, fetch_after);
5450 /* Return if a different routine isn't needed for the library call. */
5451 if (ext_call == BUILT_IN_NONE)
5454 /* Change the call to the specified function. */
5455 fndecl = get_callee_fndecl (exp);
5456 addr = CALL_EXPR_FN (exp);
5459 gcc_assert (TREE_OPERAND (addr, 0) == fndecl);
5460 TREE_OPERAND (addr, 0) = builtin_decl_explicit(ext_call);
5462 /* Expand the call here so we can emit trailing code. */
5463 ret = expand_call (exp, target, ignore);
5465 /* Replace the original function just in case it matters. */
5466 TREE_OPERAND (addr, 0) = fndecl;
5468 /* Then issue the arithmetic correction to return the right result. */
5473 ret = expand_simple_binop (mode, AND, ret, val, NULL_RTX, true,
5475 ret = expand_simple_unop (mode, NOT, ret, target, true);
5478 ret = expand_simple_binop (mode, code, ret, val, target, true,
5485 /* Expand an atomic clear operation.
5486 void _atomic_clear (BOOL *obj, enum memmodel)
5487 EXP is the call expression. */
5490 expand_builtin_atomic_clear (tree exp)
5492 enum machine_mode mode;
5494 enum memmodel model;
5496 mode = mode_for_size (BOOL_TYPE_SIZE, MODE_INT, 0);
5497 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5498 model = get_memmodel (CALL_EXPR_ARG (exp, 1));
5500 if (model == MEMMODEL_ACQUIRE || model == MEMMODEL_ACQ_REL)
5502 error ("invalid memory model for %<__atomic_store%>");
5506 /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
5507 Failing that, a store is issued by __atomic_store. The only way this can
5508 fail is if the bool type is larger than a word size. Unlikely, but
5509 handle it anyway for completeness. Assume a single threaded model since
5510 there is no atomic support in this case, and no barriers are required. */
5511 ret = expand_atomic_store (mem, const0_rtx, model, true);
5513 emit_move_insn (mem, const0_rtx);
5517 /* Expand an atomic test_and_set operation.
5518 bool _atomic_test_and_set (BOOL *obj, enum memmodel)
5519 EXP is the call expression. */
5522 expand_builtin_atomic_test_and_set (tree exp)
5525 enum memmodel model;
5526 enum machine_mode mode;
5528 mode = mode_for_size (BOOL_TYPE_SIZE, MODE_INT, 0);
5529 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5530 model = get_memmodel (CALL_EXPR_ARG (exp, 1));
5532 /* Try issuing an exchange. If it is lock free, or if there is a limited
5533 functionality __sync_lock_test_and_set, this will utilize it. */
5534 ret = expand_atomic_exchange (NULL_RTX, mem, const1_rtx, model, true);
5538 /* Otherwise, there is no lock free support for test and set. Simply
5539 perform a load and a store. Since this presumes a non-atomic architecture,
5540 also assume single threadedness and don't issue barriers either. */
5542 ret = gen_reg_rtx (mode);
5543 emit_move_insn (ret, mem);
5544 emit_move_insn (mem, const1_rtx);
5549 /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
5550 this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */
5553 fold_builtin_atomic_always_lock_free (tree arg0, tree arg1)
5556 enum machine_mode mode;
5557 unsigned int mode_align, type_align;
5559 if (TREE_CODE (arg0) != INTEGER_CST)
5562 size = INTVAL (expand_normal (arg0)) * BITS_PER_UNIT;
5563 mode = mode_for_size (size, MODE_INT, 0);
5564 mode_align = GET_MODE_ALIGNMENT (mode);
5566 if (TREE_CODE (arg1) == INTEGER_CST && INTVAL (expand_normal (arg1)) == 0)
5567 type_align = mode_align;
5570 tree ttype = TREE_TYPE (arg1);
5572 /* This function is usually invoked and folded immediately by the front
5573 end before anything else has a chance to look at it. The pointer
5574 parameter at this point is usually cast to a void *, so check for that
5575 and look past the cast. */
5576 if (TREE_CODE (arg1) == NOP_EXPR && POINTER_TYPE_P (ttype)
5577 && VOID_TYPE_P (TREE_TYPE (ttype)))
5578 arg1 = TREE_OPERAND (arg1, 0);
5580 ttype = TREE_TYPE (arg1);
5581 gcc_assert (POINTER_TYPE_P (ttype));
5583 /* Get the underlying type of the object. */
5584 ttype = TREE_TYPE (ttype);
5585 type_align = TYPE_ALIGN (ttype);
5588 /* If the object has smaller alignment, the the lock free routines cannot
5590 if (type_align < mode_align)
5591 return integer_zero_node;
5593 /* Check if a compare_and_swap pattern exists for the mode which represents
5594 the required size. The pattern is not allowed to fail, so the existence
5595 of the pattern indicates support is present. */
5596 if (can_compare_and_swap_p (mode, true))
5597 return integer_one_node;
5599 return integer_zero_node;
5602 /* Return true if the parameters to call EXP represent an object which will
5603 always generate lock free instructions. The first argument represents the
5604 size of the object, and the second parameter is a pointer to the object
5605 itself. If NULL is passed for the object, then the result is based on
5606 typical alignment for an object of the specified size. Otherwise return
5610 expand_builtin_atomic_always_lock_free (tree exp)
5613 tree arg0 = CALL_EXPR_ARG (exp, 0);
5614 tree arg1 = CALL_EXPR_ARG (exp, 1);
5616 if (TREE_CODE (arg0) != INTEGER_CST)
5618 error ("non-constant argument 1 to __atomic_always_lock_free");
5622 size = fold_builtin_atomic_always_lock_free (arg0, arg1);
5623 if (size == integer_one_node)
5628 /* Return a one or zero if it can be determined that object ARG1 of size ARG
5629 is lock free on this architecture. */
5632 fold_builtin_atomic_is_lock_free (tree arg0, tree arg1)
5634 if (!flag_inline_atomics)
5637 /* If it isn't always lock free, don't generate a result. */
5638 if (fold_builtin_atomic_always_lock_free (arg0, arg1) == integer_one_node)
5639 return integer_one_node;
5644 /* Return true if the parameters to call EXP represent an object which will
5645 always generate lock free instructions. The first argument represents the
5646 size of the object, and the second parameter is a pointer to the object
5647 itself. If NULL is passed for the object, then the result is based on
5648 typical alignment for an object of the specified size. Otherwise return
5652 expand_builtin_atomic_is_lock_free (tree exp)
5655 tree arg0 = CALL_EXPR_ARG (exp, 0);
5656 tree arg1 = CALL_EXPR_ARG (exp, 1);
5658 if (!INTEGRAL_TYPE_P (TREE_TYPE (arg0)))
5660 error ("non-integer argument 1 to __atomic_is_lock_free");
5664 if (!flag_inline_atomics)
5667 /* If the value is known at compile time, return the RTX for it. */
5668 size = fold_builtin_atomic_is_lock_free (arg0, arg1);
5669 if (size == integer_one_node)
5675 /* Expand the __atomic_thread_fence intrinsic:
5676 void __atomic_thread_fence (enum memmodel)
5677 EXP is the CALL_EXPR. */
5680 expand_builtin_atomic_thread_fence (tree exp)
5682 enum memmodel model = get_memmodel (CALL_EXPR_ARG (exp, 0));
5683 expand_mem_thread_fence (model);
5686 /* Expand the __atomic_signal_fence intrinsic:
5687 void __atomic_signal_fence (enum memmodel)
5688 EXP is the CALL_EXPR. */
5691 expand_builtin_atomic_signal_fence (tree exp)
5693 enum memmodel model = get_memmodel (CALL_EXPR_ARG (exp, 0));
5694 expand_mem_signal_fence (model);
5697 /* Expand the __sync_synchronize intrinsic. */
5700 expand_builtin_sync_synchronize (void)
5702 expand_mem_thread_fence (MEMMODEL_SEQ_CST);
5706 /* Expand an expression EXP that calls a built-in function,
5707 with result going to TARGET if that's convenient
5708 (and in mode MODE if that's convenient).
5709 SUBTARGET may be used as the target for computing one of EXP's operands.
5710 IGNORE is nonzero if the value is to be ignored. */
5713 expand_builtin (tree exp, rtx target, rtx subtarget, enum machine_mode mode,
5716 tree fndecl = get_callee_fndecl (exp);
5717 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
5718 enum machine_mode target_mode = TYPE_MODE (TREE_TYPE (exp));
5721 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
5722 return targetm.expand_builtin (exp, target, subtarget, mode, ignore);
5724 /* When not optimizing, generate calls to library functions for a certain
5727 && !called_as_built_in (fndecl)
5728 && DECL_ASSEMBLER_NAME_SET_P (fndecl)
5729 && fcode != BUILT_IN_ALLOCA
5730 && fcode != BUILT_IN_ALLOCA_WITH_ALIGN
5731 && fcode != BUILT_IN_FREE)
5732 return expand_call (exp, target, ignore);
5734 /* The built-in function expanders test for target == const0_rtx
5735 to determine whether the function's result will be ignored. */
5737 target = const0_rtx;
5739 /* If the result of a pure or const built-in function is ignored, and
5740 none of its arguments are volatile, we can avoid expanding the
5741 built-in call and just evaluate the arguments for side-effects. */
5742 if (target == const0_rtx
5743 && ((flags = flags_from_decl_or_type (fndecl)) & (ECF_CONST | ECF_PURE))
5744 && !(flags & ECF_LOOPING_CONST_OR_PURE))
5746 bool volatilep = false;
5748 call_expr_arg_iterator iter;
5750 FOR_EACH_CALL_EXPR_ARG (arg, iter, exp)
5751 if (TREE_THIS_VOLATILE (arg))
5759 FOR_EACH_CALL_EXPR_ARG (arg, iter, exp)
5760 expand_expr (arg, const0_rtx, VOIDmode, EXPAND_NORMAL);
5767 CASE_FLT_FN (BUILT_IN_FABS):
5768 target = expand_builtin_fabs (exp, target, subtarget);
5773 CASE_FLT_FN (BUILT_IN_COPYSIGN):
5774 target = expand_builtin_copysign (exp, target, subtarget);
5779 /* Just do a normal library call if we were unable to fold
5781 CASE_FLT_FN (BUILT_IN_CABS):
5784 CASE_FLT_FN (BUILT_IN_EXP):
5785 CASE_FLT_FN (BUILT_IN_EXP10):
5786 CASE_FLT_FN (BUILT_IN_POW10):
5787 CASE_FLT_FN (BUILT_IN_EXP2):
5788 CASE_FLT_FN (BUILT_IN_EXPM1):
5789 CASE_FLT_FN (BUILT_IN_LOGB):
5790 CASE_FLT_FN (BUILT_IN_LOG):
5791 CASE_FLT_FN (BUILT_IN_LOG10):
5792 CASE_FLT_FN (BUILT_IN_LOG2):
5793 CASE_FLT_FN (BUILT_IN_LOG1P):
5794 CASE_FLT_FN (BUILT_IN_TAN):
5795 CASE_FLT_FN (BUILT_IN_ASIN):
5796 CASE_FLT_FN (BUILT_IN_ACOS):
5797 CASE_FLT_FN (BUILT_IN_ATAN):
5798 CASE_FLT_FN (BUILT_IN_SIGNIFICAND):
5799 /* Treat these like sqrt only if unsafe math optimizations are allowed,
5800 because of possible accuracy problems. */
5801 if (! flag_unsafe_math_optimizations)
5803 CASE_FLT_FN (BUILT_IN_SQRT):
5804 CASE_FLT_FN (BUILT_IN_FLOOR):
5805 CASE_FLT_FN (BUILT_IN_CEIL):
5806 CASE_FLT_FN (BUILT_IN_TRUNC):
5807 CASE_FLT_FN (BUILT_IN_ROUND):
5808 CASE_FLT_FN (BUILT_IN_NEARBYINT):
5809 CASE_FLT_FN (BUILT_IN_RINT):
5810 target = expand_builtin_mathfn (exp, target, subtarget);
5815 CASE_FLT_FN (BUILT_IN_FMA):
5816 target = expand_builtin_mathfn_ternary (exp, target, subtarget);
5821 CASE_FLT_FN (BUILT_IN_ILOGB):
5822 if (! flag_unsafe_math_optimizations)
5824 CASE_FLT_FN (BUILT_IN_ISINF):
5825 CASE_FLT_FN (BUILT_IN_FINITE):
5826 case BUILT_IN_ISFINITE:
5827 case BUILT_IN_ISNORMAL:
5828 target = expand_builtin_interclass_mathfn (exp, target);
5833 CASE_FLT_FN (BUILT_IN_ICEIL):
5834 CASE_FLT_FN (BUILT_IN_LCEIL):
5835 CASE_FLT_FN (BUILT_IN_LLCEIL):
5836 CASE_FLT_FN (BUILT_IN_LFLOOR):
5837 CASE_FLT_FN (BUILT_IN_IFLOOR):
5838 CASE_FLT_FN (BUILT_IN_LLFLOOR):
5839 target = expand_builtin_int_roundingfn (exp, target);
5844 CASE_FLT_FN (BUILT_IN_IRINT):
5845 CASE_FLT_FN (BUILT_IN_LRINT):
5846 CASE_FLT_FN (BUILT_IN_LLRINT):
5847 CASE_FLT_FN (BUILT_IN_IROUND):
5848 CASE_FLT_FN (BUILT_IN_LROUND):
5849 CASE_FLT_FN (BUILT_IN_LLROUND):
5850 target = expand_builtin_int_roundingfn_2 (exp, target);
5855 CASE_FLT_FN (BUILT_IN_POWI):
5856 target = expand_builtin_powi (exp, target);
5861 CASE_FLT_FN (BUILT_IN_ATAN2):
5862 CASE_FLT_FN (BUILT_IN_LDEXP):
5863 CASE_FLT_FN (BUILT_IN_SCALB):
5864 CASE_FLT_FN (BUILT_IN_SCALBN):
5865 CASE_FLT_FN (BUILT_IN_SCALBLN):
5866 if (! flag_unsafe_math_optimizations)
5869 CASE_FLT_FN (BUILT_IN_FMOD):
5870 CASE_FLT_FN (BUILT_IN_REMAINDER):
5871 CASE_FLT_FN (BUILT_IN_DREM):
5872 CASE_FLT_FN (BUILT_IN_POW):
5873 target = expand_builtin_mathfn_2 (exp, target, subtarget);
5878 CASE_FLT_FN (BUILT_IN_CEXPI):
5879 target = expand_builtin_cexpi (exp, target);
5880 gcc_assert (target);
5883 CASE_FLT_FN (BUILT_IN_SIN):
5884 CASE_FLT_FN (BUILT_IN_COS):
5885 if (! flag_unsafe_math_optimizations)
5887 target = expand_builtin_mathfn_3 (exp, target, subtarget);
5892 CASE_FLT_FN (BUILT_IN_SINCOS):
5893 if (! flag_unsafe_math_optimizations)
5895 target = expand_builtin_sincos (exp);
5900 case BUILT_IN_APPLY_ARGS:
5901 return expand_builtin_apply_args ();
5903 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
5904 FUNCTION with a copy of the parameters described by
5905 ARGUMENTS, and ARGSIZE. It returns a block of memory
5906 allocated on the stack into which is stored all the registers
5907 that might possibly be used for returning the result of a
5908 function. ARGUMENTS is the value returned by
5909 __builtin_apply_args. ARGSIZE is the number of bytes of
5910 arguments that must be copied. ??? How should this value be
5911 computed? We'll also need a safe worst case value for varargs
5913 case BUILT_IN_APPLY:
5914 if (!validate_arglist (exp, POINTER_TYPE,
5915 POINTER_TYPE, INTEGER_TYPE, VOID_TYPE)
5916 && !validate_arglist (exp, REFERENCE_TYPE,
5917 POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
5923 ops[0] = expand_normal (CALL_EXPR_ARG (exp, 0));
5924 ops[1] = expand_normal (CALL_EXPR_ARG (exp, 1));
5925 ops[2] = expand_normal (CALL_EXPR_ARG (exp, 2));
5927 return expand_builtin_apply (ops[0], ops[1], ops[2]);
5930 /* __builtin_return (RESULT) causes the function to return the
5931 value described by RESULT. RESULT is address of the block of
5932 memory returned by __builtin_apply. */
5933 case BUILT_IN_RETURN:
5934 if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
5935 expand_builtin_return (expand_normal (CALL_EXPR_ARG (exp, 0)));
5938 case BUILT_IN_SAVEREGS:
5939 return expand_builtin_saveregs ();
5941 case BUILT_IN_VA_ARG_PACK:
5942 /* All valid uses of __builtin_va_arg_pack () are removed during
5944 error ("%Kinvalid use of %<__builtin_va_arg_pack ()%>", exp);
5947 case BUILT_IN_VA_ARG_PACK_LEN:
5948 /* All valid uses of __builtin_va_arg_pack_len () are removed during
5950 error ("%Kinvalid use of %<__builtin_va_arg_pack_len ()%>", exp);
5953 /* Return the address of the first anonymous stack arg. */
5954 case BUILT_IN_NEXT_ARG:
5955 if (fold_builtin_next_arg (exp, false))
5957 return expand_builtin_next_arg ();
5959 case BUILT_IN_CLEAR_CACHE:
5960 target = expand_builtin___clear_cache (exp);
5965 case BUILT_IN_CLASSIFY_TYPE:
5966 return expand_builtin_classify_type (exp);
5968 case BUILT_IN_CONSTANT_P:
5971 case BUILT_IN_FRAME_ADDRESS:
5972 case BUILT_IN_RETURN_ADDRESS:
5973 return expand_builtin_frame_address (fndecl, exp);
5975 /* Returns the address of the area where the structure is returned.
5977 case BUILT_IN_AGGREGATE_INCOMING_ADDRESS:
5978 if (call_expr_nargs (exp) != 0
5979 || ! AGGREGATE_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl)))
5980 || !MEM_P (DECL_RTL (DECL_RESULT (current_function_decl))))
5983 return XEXP (DECL_RTL (DECL_RESULT (current_function_decl)), 0);
5985 case BUILT_IN_ALLOCA:
5986 case BUILT_IN_ALLOCA_WITH_ALIGN:
5987 /* If the allocation stems from the declaration of a variable-sized
5988 object, it cannot accumulate. */
5989 target = expand_builtin_alloca (exp, CALL_ALLOCA_FOR_VAR_P (exp));
5994 case BUILT_IN_STACK_SAVE:
5995 return expand_stack_save ();
5997 case BUILT_IN_STACK_RESTORE:
5998 expand_stack_restore (CALL_EXPR_ARG (exp, 0));
6001 case BUILT_IN_BSWAP32:
6002 case BUILT_IN_BSWAP64:
6003 target = expand_builtin_bswap (exp, target, subtarget);
6009 CASE_INT_FN (BUILT_IN_FFS):
6010 case BUILT_IN_FFSIMAX:
6011 target = expand_builtin_unop (target_mode, exp, target,
6012 subtarget, ffs_optab);
6017 CASE_INT_FN (BUILT_IN_CLZ):
6018 case BUILT_IN_CLZIMAX:
6019 target = expand_builtin_unop (target_mode, exp, target,
6020 subtarget, clz_optab);
6025 CASE_INT_FN (BUILT_IN_CTZ):
6026 case BUILT_IN_CTZIMAX:
6027 target = expand_builtin_unop (target_mode, exp, target,
6028 subtarget, ctz_optab);
6033 CASE_INT_FN (BUILT_IN_CLRSB):
6034 case BUILT_IN_CLRSBIMAX:
6035 target = expand_builtin_unop (target_mode, exp, target,
6036 subtarget, clrsb_optab);
6041 CASE_INT_FN (BUILT_IN_POPCOUNT):
6042 case BUILT_IN_POPCOUNTIMAX:
6043 target = expand_builtin_unop (target_mode, exp, target,
6044 subtarget, popcount_optab);
6049 CASE_INT_FN (BUILT_IN_PARITY):
6050 case BUILT_IN_PARITYIMAX:
6051 target = expand_builtin_unop (target_mode, exp, target,
6052 subtarget, parity_optab);
6057 case BUILT_IN_STRLEN:
6058 target = expand_builtin_strlen (exp, target, target_mode);
6063 case BUILT_IN_STRCPY:
6064 target = expand_builtin_strcpy (exp, target);
6069 case BUILT_IN_STRNCPY:
6070 target = expand_builtin_strncpy (exp, target);
6075 case BUILT_IN_STPCPY:
6076 target = expand_builtin_stpcpy (exp, target, mode);
6081 case BUILT_IN_MEMCPY:
6082 target = expand_builtin_memcpy (exp, target);
6087 case BUILT_IN_MEMPCPY:
6088 target = expand_builtin_mempcpy (exp, target, mode);
6093 case BUILT_IN_MEMSET:
6094 target = expand_builtin_memset (exp, target, mode);
6099 case BUILT_IN_BZERO:
6100 target = expand_builtin_bzero (exp);
6105 case BUILT_IN_STRCMP:
6106 target = expand_builtin_strcmp (exp, target);
6111 case BUILT_IN_STRNCMP:
6112 target = expand_builtin_strncmp (exp, target, mode);
6118 case BUILT_IN_MEMCMP:
6119 target = expand_builtin_memcmp (exp, target, mode);
6124 case BUILT_IN_SETJMP:
6125 /* This should have been lowered to the builtins below. */
6128 case BUILT_IN_SETJMP_SETUP:
6129 /* __builtin_setjmp_setup is passed a pointer to an array of five words
6130 and the receiver label. */
6131 if (validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
6133 rtx buf_addr = expand_expr (CALL_EXPR_ARG (exp, 0), subtarget,
6134 VOIDmode, EXPAND_NORMAL);
6135 tree label = TREE_OPERAND (CALL_EXPR_ARG (exp, 1), 0);
6136 rtx label_r = label_rtx (label);
6138 /* This is copied from the handling of non-local gotos. */
6139 expand_builtin_setjmp_setup (buf_addr, label_r);
6140 nonlocal_goto_handler_labels
6141 = gen_rtx_EXPR_LIST (VOIDmode, label_r,
6142 nonlocal_goto_handler_labels);
6143 /* ??? Do not let expand_label treat us as such since we would
6144 not want to be both on the list of non-local labels and on
6145 the list of forced labels. */
6146 FORCED_LABEL (label) = 0;
6151 case BUILT_IN_SETJMP_DISPATCHER:
6152 /* __builtin_setjmp_dispatcher is passed the dispatcher label. */
6153 if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
6155 tree label = TREE_OPERAND (CALL_EXPR_ARG (exp, 0), 0);
6156 rtx label_r = label_rtx (label);
6158 /* Remove the dispatcher label from the list of non-local labels
6159 since the receiver labels have been added to it above. */
6160 remove_node_from_expr_list (label_r, &nonlocal_goto_handler_labels);
6165 case BUILT_IN_SETJMP_RECEIVER:
6166 /* __builtin_setjmp_receiver is passed the receiver label. */
6167 if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
6169 tree label = TREE_OPERAND (CALL_EXPR_ARG (exp, 0), 0);
6170 rtx label_r = label_rtx (label);
6172 expand_builtin_setjmp_receiver (label_r);
6177 /* __builtin_longjmp is passed a pointer to an array of five words.
6178 It's similar to the C library longjmp function but works with
6179 __builtin_setjmp above. */
6180 case BUILT_IN_LONGJMP:
6181 if (validate_arglist (exp, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
6183 rtx buf_addr = expand_expr (CALL_EXPR_ARG (exp, 0), subtarget,
6184 VOIDmode, EXPAND_NORMAL);
6185 rtx value = expand_normal (CALL_EXPR_ARG (exp, 1));
6187 if (value != const1_rtx)
6189 error ("%<__builtin_longjmp%> second argument must be 1");
6193 expand_builtin_longjmp (buf_addr, value);
6198 case BUILT_IN_NONLOCAL_GOTO:
6199 target = expand_builtin_nonlocal_goto (exp);
6204 /* This updates the setjmp buffer that is its argument with the value
6205 of the current stack pointer. */
6206 case BUILT_IN_UPDATE_SETJMP_BUF:
6207 if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
6210 = expand_normal (CALL_EXPR_ARG (exp, 0));
6212 expand_builtin_update_setjmp_buf (buf_addr);
6218 expand_builtin_trap ();
6221 case BUILT_IN_UNREACHABLE:
6222 expand_builtin_unreachable ();
6225 CASE_FLT_FN (BUILT_IN_SIGNBIT):
6226 case BUILT_IN_SIGNBITD32:
6227 case BUILT_IN_SIGNBITD64:
6228 case BUILT_IN_SIGNBITD128:
6229 target = expand_builtin_signbit (exp, target);
6234 /* Various hooks for the DWARF 2 __throw routine. */
6235 case BUILT_IN_UNWIND_INIT:
6236 expand_builtin_unwind_init ();
6238 case BUILT_IN_DWARF_CFA:
6239 return virtual_cfa_rtx;
6240 #ifdef DWARF2_UNWIND_INFO
6241 case BUILT_IN_DWARF_SP_COLUMN:
6242 return expand_builtin_dwarf_sp_column ();
6243 case BUILT_IN_INIT_DWARF_REG_SIZES:
6244 expand_builtin_init_dwarf_reg_sizes (CALL_EXPR_ARG (exp, 0));
6247 case BUILT_IN_FROB_RETURN_ADDR:
6248 return expand_builtin_frob_return_addr (CALL_EXPR_ARG (exp, 0));
6249 case BUILT_IN_EXTRACT_RETURN_ADDR:
6250 return expand_builtin_extract_return_addr (CALL_EXPR_ARG (exp, 0));
6251 case BUILT_IN_EH_RETURN:
6252 expand_builtin_eh_return (CALL_EXPR_ARG (exp, 0),
6253 CALL_EXPR_ARG (exp, 1));
6255 #ifdef EH_RETURN_DATA_REGNO
6256 case BUILT_IN_EH_RETURN_DATA_REGNO:
6257 return expand_builtin_eh_return_data_regno (exp);
6259 case BUILT_IN_EXTEND_POINTER:
6260 return expand_builtin_extend_pointer (CALL_EXPR_ARG (exp, 0));
6261 case BUILT_IN_EH_POINTER:
6262 return expand_builtin_eh_pointer (exp);
6263 case BUILT_IN_EH_FILTER:
6264 return expand_builtin_eh_filter (exp);
6265 case BUILT_IN_EH_COPY_VALUES:
6266 return expand_builtin_eh_copy_values (exp);
6268 case BUILT_IN_VA_START:
6269 return expand_builtin_va_start (exp);
6270 case BUILT_IN_VA_END:
6271 return expand_builtin_va_end (exp);
6272 case BUILT_IN_VA_COPY:
6273 return expand_builtin_va_copy (exp);
6274 case BUILT_IN_EXPECT:
6275 return expand_builtin_expect (exp, target);
6276 case BUILT_IN_ASSUME_ALIGNED:
6277 return expand_builtin_assume_aligned (exp, target);
6278 case BUILT_IN_PREFETCH:
6279 expand_builtin_prefetch (exp);
6282 case BUILT_IN_INIT_TRAMPOLINE:
6283 return expand_builtin_init_trampoline (exp);
6284 case BUILT_IN_ADJUST_TRAMPOLINE:
6285 return expand_builtin_adjust_trampoline (exp);
6288 case BUILT_IN_EXECL:
6289 case BUILT_IN_EXECV:
6290 case BUILT_IN_EXECLP:
6291 case BUILT_IN_EXECLE:
6292 case BUILT_IN_EXECVP:
6293 case BUILT_IN_EXECVE:
6294 target = expand_builtin_fork_or_exec (fndecl, exp, target, ignore);
6299 case BUILT_IN_SYNC_FETCH_AND_ADD_1:
6300 case BUILT_IN_SYNC_FETCH_AND_ADD_2:
6301 case BUILT_IN_SYNC_FETCH_AND_ADD_4:
6302 case BUILT_IN_SYNC_FETCH_AND_ADD_8:
6303 case BUILT_IN_SYNC_FETCH_AND_ADD_16:
6304 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_ADD_1);
6305 target = expand_builtin_sync_operation (mode, exp, PLUS, false, target);
6310 case BUILT_IN_SYNC_FETCH_AND_SUB_1:
6311 case BUILT_IN_SYNC_FETCH_AND_SUB_2:
6312 case BUILT_IN_SYNC_FETCH_AND_SUB_4:
6313 case BUILT_IN_SYNC_FETCH_AND_SUB_8:
6314 case BUILT_IN_SYNC_FETCH_AND_SUB_16:
6315 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_SUB_1);
6316 target = expand_builtin_sync_operation (mode, exp, MINUS, false, target);
6321 case BUILT_IN_SYNC_FETCH_AND_OR_1:
6322 case BUILT_IN_SYNC_FETCH_AND_OR_2:
6323 case BUILT_IN_SYNC_FETCH_AND_OR_4:
6324 case BUILT_IN_SYNC_FETCH_AND_OR_8:
6325 case BUILT_IN_SYNC_FETCH_AND_OR_16:
6326 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_OR_1);
6327 target = expand_builtin_sync_operation (mode, exp, IOR, false, target);
6332 case BUILT_IN_SYNC_FETCH_AND_AND_1:
6333 case BUILT_IN_SYNC_FETCH_AND_AND_2:
6334 case BUILT_IN_SYNC_FETCH_AND_AND_4:
6335 case BUILT_IN_SYNC_FETCH_AND_AND_8:
6336 case BUILT_IN_SYNC_FETCH_AND_AND_16:
6337 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_AND_1);
6338 target = expand_builtin_sync_operation (mode, exp, AND, false, target);
6343 case BUILT_IN_SYNC_FETCH_AND_XOR_1:
6344 case BUILT_IN_SYNC_FETCH_AND_XOR_2:
6345 case BUILT_IN_SYNC_FETCH_AND_XOR_4:
6346 case BUILT_IN_SYNC_FETCH_AND_XOR_8:
6347 case BUILT_IN_SYNC_FETCH_AND_XOR_16:
6348 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_XOR_1);
6349 target = expand_builtin_sync_operation (mode, exp, XOR, false, target);
6354 case BUILT_IN_SYNC_FETCH_AND_NAND_1:
6355 case BUILT_IN_SYNC_FETCH_AND_NAND_2:
6356 case BUILT_IN_SYNC_FETCH_AND_NAND_4:
6357 case BUILT_IN_SYNC_FETCH_AND_NAND_8:
6358 case BUILT_IN_SYNC_FETCH_AND_NAND_16:
6359 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_NAND_1);
6360 target = expand_builtin_sync_operation (mode, exp, NOT, false, target);
6365 case BUILT_IN_SYNC_ADD_AND_FETCH_1:
6366 case BUILT_IN_SYNC_ADD_AND_FETCH_2:
6367 case BUILT_IN_SYNC_ADD_AND_FETCH_4:
6368 case BUILT_IN_SYNC_ADD_AND_FETCH_8:
6369 case BUILT_IN_SYNC_ADD_AND_FETCH_16:
6370 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_ADD_AND_FETCH_1);
6371 target = expand_builtin_sync_operation (mode, exp, PLUS, true, target);
6376 case BUILT_IN_SYNC_SUB_AND_FETCH_1:
6377 case BUILT_IN_SYNC_SUB_AND_FETCH_2:
6378 case BUILT_IN_SYNC_SUB_AND_FETCH_4:
6379 case BUILT_IN_SYNC_SUB_AND_FETCH_8:
6380 case BUILT_IN_SYNC_SUB_AND_FETCH_16:
6381 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_SUB_AND_FETCH_1);
6382 target = expand_builtin_sync_operation (mode, exp, MINUS, true, target);
6387 case BUILT_IN_SYNC_OR_AND_FETCH_1:
6388 case BUILT_IN_SYNC_OR_AND_FETCH_2:
6389 case BUILT_IN_SYNC_OR_AND_FETCH_4:
6390 case BUILT_IN_SYNC_OR_AND_FETCH_8:
6391 case BUILT_IN_SYNC_OR_AND_FETCH_16:
6392 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_OR_AND_FETCH_1);
6393 target = expand_builtin_sync_operation (mode, exp, IOR, true, target);
6398 case BUILT_IN_SYNC_AND_AND_FETCH_1:
6399 case BUILT_IN_SYNC_AND_AND_FETCH_2:
6400 case BUILT_IN_SYNC_AND_AND_FETCH_4:
6401 case BUILT_IN_SYNC_AND_AND_FETCH_8:
6402 case BUILT_IN_SYNC_AND_AND_FETCH_16:
6403 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_AND_AND_FETCH_1);
6404 target = expand_builtin_sync_operation (mode, exp, AND, true, target);
6409 case BUILT_IN_SYNC_XOR_AND_FETCH_1:
6410 case BUILT_IN_SYNC_XOR_AND_FETCH_2:
6411 case BUILT_IN_SYNC_XOR_AND_FETCH_4:
6412 case BUILT_IN_SYNC_XOR_AND_FETCH_8:
6413 case BUILT_IN_SYNC_XOR_AND_FETCH_16:
6414 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_XOR_AND_FETCH_1);
6415 target = expand_builtin_sync_operation (mode, exp, XOR, true, target);
6420 case BUILT_IN_SYNC_NAND_AND_FETCH_1:
6421 case BUILT_IN_SYNC_NAND_AND_FETCH_2:
6422 case BUILT_IN_SYNC_NAND_AND_FETCH_4:
6423 case BUILT_IN_SYNC_NAND_AND_FETCH_8:
6424 case BUILT_IN_SYNC_NAND_AND_FETCH_16:
6425 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_NAND_AND_FETCH_1);
6426 target = expand_builtin_sync_operation (mode, exp, NOT, true, target);
6431 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_1:
6432 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_2:
6433 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_4:
6434 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_8:
6435 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_16:
6436 if (mode == VOIDmode)
6437 mode = TYPE_MODE (boolean_type_node);
6438 if (!target || !register_operand (target, mode))
6439 target = gen_reg_rtx (mode);
6441 mode = get_builtin_sync_mode
6442 (fcode - BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_1);
6443 target = expand_builtin_compare_and_swap (mode, exp, true, target);
6448 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_1:
6449 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_2:
6450 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_4:
6451 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_8:
6452 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_16:
6453 mode = get_builtin_sync_mode
6454 (fcode - BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_1);
6455 target = expand_builtin_compare_and_swap (mode, exp, false, target);
6460 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_1:
6461 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_2:
6462 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_4:
6463 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_8:
6464 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_16:
6465 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_LOCK_TEST_AND_SET_1);
6466 target = expand_builtin_sync_lock_test_and_set (mode, exp, target);
6471 case BUILT_IN_SYNC_LOCK_RELEASE_1:
6472 case BUILT_IN_SYNC_LOCK_RELEASE_2:
6473 case BUILT_IN_SYNC_LOCK_RELEASE_4:
6474 case BUILT_IN_SYNC_LOCK_RELEASE_8:
6475 case BUILT_IN_SYNC_LOCK_RELEASE_16:
6476 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_LOCK_RELEASE_1);
6477 expand_builtin_sync_lock_release (mode, exp);
6480 case BUILT_IN_SYNC_SYNCHRONIZE:
6481 expand_builtin_sync_synchronize ();
6484 case BUILT_IN_ATOMIC_EXCHANGE_1:
6485 case BUILT_IN_ATOMIC_EXCHANGE_2:
6486 case BUILT_IN_ATOMIC_EXCHANGE_4:
6487 case BUILT_IN_ATOMIC_EXCHANGE_8:
6488 case BUILT_IN_ATOMIC_EXCHANGE_16:
6489 mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_EXCHANGE_1);
6490 target = expand_builtin_atomic_exchange (mode, exp, target);
6495 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_1:
6496 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_2:
6497 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_4:
6498 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_8:
6499 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_16:
6501 unsigned int nargs, z;
6505 get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_COMPARE_EXCHANGE_1);
6506 target = expand_builtin_atomic_compare_exchange (mode, exp, target);
6510 /* If this is turned into an external library call, the weak parameter
6511 must be dropped to match the expected parameter list. */
6512 nargs = call_expr_nargs (exp);
6513 vec = VEC_alloc (tree, gc, nargs - 1);
6514 for (z = 0; z < 3; z++)
6515 VEC_quick_push (tree, vec, CALL_EXPR_ARG (exp, z));
6516 /* Skip the boolean weak parameter. */
6517 for (z = 4; z < 6; z++)
6518 VEC_quick_push (tree, vec, CALL_EXPR_ARG (exp, z));
6519 exp = build_call_vec (TREE_TYPE (exp), CALL_EXPR_FN (exp), vec);
6523 case BUILT_IN_ATOMIC_LOAD_1:
6524 case BUILT_IN_ATOMIC_LOAD_2:
6525 case BUILT_IN_ATOMIC_LOAD_4:
6526 case BUILT_IN_ATOMIC_LOAD_8:
6527 case BUILT_IN_ATOMIC_LOAD_16:
6528 mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_LOAD_1);
6529 target = expand_builtin_atomic_load (mode, exp, target);
6534 case BUILT_IN_ATOMIC_STORE_1:
6535 case BUILT_IN_ATOMIC_STORE_2:
6536 case BUILT_IN_ATOMIC_STORE_4:
6537 case BUILT_IN_ATOMIC_STORE_8:
6538 case BUILT_IN_ATOMIC_STORE_16:
6539 mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_STORE_1);
6540 target = expand_builtin_atomic_store (mode, exp);
6545 case BUILT_IN_ATOMIC_ADD_FETCH_1:
6546 case BUILT_IN_ATOMIC_ADD_FETCH_2:
6547 case BUILT_IN_ATOMIC_ADD_FETCH_4:
6548 case BUILT_IN_ATOMIC_ADD_FETCH_8:
6549 case BUILT_IN_ATOMIC_ADD_FETCH_16:
6551 enum built_in_function lib;
6552 mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_ADD_FETCH_1);
6553 lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_ADD_1 +
6554 (fcode - BUILT_IN_ATOMIC_ADD_FETCH_1));
6555 target = expand_builtin_atomic_fetch_op (mode, exp, target, PLUS, true,
6561 case BUILT_IN_ATOMIC_SUB_FETCH_1:
6562 case BUILT_IN_ATOMIC_SUB_FETCH_2:
6563 case BUILT_IN_ATOMIC_SUB_FETCH_4:
6564 case BUILT_IN_ATOMIC_SUB_FETCH_8:
6565 case BUILT_IN_ATOMIC_SUB_FETCH_16:
6567 enum built_in_function lib;
6568 mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_SUB_FETCH_1);
6569 lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_SUB_1 +
6570 (fcode - BUILT_IN_ATOMIC_SUB_FETCH_1));
6571 target = expand_builtin_atomic_fetch_op (mode, exp, target, MINUS, true,
6577 case BUILT_IN_ATOMIC_AND_FETCH_1:
6578 case BUILT_IN_ATOMIC_AND_FETCH_2:
6579 case BUILT_IN_ATOMIC_AND_FETCH_4:
6580 case BUILT_IN_ATOMIC_AND_FETCH_8:
6581 case BUILT_IN_ATOMIC_AND_FETCH_16:
6583 enum built_in_function lib;
6584 mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_AND_FETCH_1);
6585 lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_AND_1 +
6586 (fcode - BUILT_IN_ATOMIC_AND_FETCH_1));
6587 target = expand_builtin_atomic_fetch_op (mode, exp, target, AND, true,
6593 case BUILT_IN_ATOMIC_NAND_FETCH_1:
6594 case BUILT_IN_ATOMIC_NAND_FETCH_2:
6595 case BUILT_IN_ATOMIC_NAND_FETCH_4:
6596 case BUILT_IN_ATOMIC_NAND_FETCH_8:
6597 case BUILT_IN_ATOMIC_NAND_FETCH_16:
6599 enum built_in_function lib;
6600 mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_NAND_FETCH_1);
6601 lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_NAND_1 +
6602 (fcode - BUILT_IN_ATOMIC_NAND_FETCH_1));
6603 target = expand_builtin_atomic_fetch_op (mode, exp, target, NOT, true,
6609 case BUILT_IN_ATOMIC_XOR_FETCH_1:
6610 case BUILT_IN_ATOMIC_XOR_FETCH_2:
6611 case BUILT_IN_ATOMIC_XOR_FETCH_4:
6612 case BUILT_IN_ATOMIC_XOR_FETCH_8:
6613 case BUILT_IN_ATOMIC_XOR_FETCH_16:
6615 enum built_in_function lib;
6616 mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_XOR_FETCH_1);
6617 lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_XOR_1 +
6618 (fcode - BUILT_IN_ATOMIC_XOR_FETCH_1));
6619 target = expand_builtin_atomic_fetch_op (mode, exp, target, XOR, true,
6625 case BUILT_IN_ATOMIC_OR_FETCH_1:
6626 case BUILT_IN_ATOMIC_OR_FETCH_2:
6627 case BUILT_IN_ATOMIC_OR_FETCH_4:
6628 case BUILT_IN_ATOMIC_OR_FETCH_8:
6629 case BUILT_IN_ATOMIC_OR_FETCH_16:
6631 enum built_in_function lib;
6632 mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_OR_FETCH_1);
6633 lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_OR_1 +
6634 (fcode - BUILT_IN_ATOMIC_OR_FETCH_1));
6635 target = expand_builtin_atomic_fetch_op (mode, exp, target, IOR, true,
6641 case BUILT_IN_ATOMIC_FETCH_ADD_1:
6642 case BUILT_IN_ATOMIC_FETCH_ADD_2:
6643 case BUILT_IN_ATOMIC_FETCH_ADD_4:
6644 case BUILT_IN_ATOMIC_FETCH_ADD_8:
6645 case BUILT_IN_ATOMIC_FETCH_ADD_16:
6646 mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_ADD_1);
6647 target = expand_builtin_atomic_fetch_op (mode, exp, target, PLUS, false,
6648 ignore, BUILT_IN_NONE);
6653 case BUILT_IN_ATOMIC_FETCH_SUB_1:
6654 case BUILT_IN_ATOMIC_FETCH_SUB_2:
6655 case BUILT_IN_ATOMIC_FETCH_SUB_4:
6656 case BUILT_IN_ATOMIC_FETCH_SUB_8:
6657 case BUILT_IN_ATOMIC_FETCH_SUB_16:
6658 mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_SUB_1);
6659 target = expand_builtin_atomic_fetch_op (mode, exp, target, MINUS, false,
6660 ignore, BUILT_IN_NONE);
6665 case BUILT_IN_ATOMIC_FETCH_AND_1:
6666 case BUILT_IN_ATOMIC_FETCH_AND_2:
6667 case BUILT_IN_ATOMIC_FETCH_AND_4:
6668 case BUILT_IN_ATOMIC_FETCH_AND_8:
6669 case BUILT_IN_ATOMIC_FETCH_AND_16:
6670 mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_AND_1);
6671 target = expand_builtin_atomic_fetch_op (mode, exp, target, AND, false,
6672 ignore, BUILT_IN_NONE);
6677 case BUILT_IN_ATOMIC_FETCH_NAND_1:
6678 case BUILT_IN_ATOMIC_FETCH_NAND_2:
6679 case BUILT_IN_ATOMIC_FETCH_NAND_4:
6680 case BUILT_IN_ATOMIC_FETCH_NAND_8:
6681 case BUILT_IN_ATOMIC_FETCH_NAND_16:
6682 mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_NAND_1);
6683 target = expand_builtin_atomic_fetch_op (mode, exp, target, NOT, false,
6684 ignore, BUILT_IN_NONE);
6689 case BUILT_IN_ATOMIC_FETCH_XOR_1:
6690 case BUILT_IN_ATOMIC_FETCH_XOR_2:
6691 case BUILT_IN_ATOMIC_FETCH_XOR_4:
6692 case BUILT_IN_ATOMIC_FETCH_XOR_8:
6693 case BUILT_IN_ATOMIC_FETCH_XOR_16:
6694 mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_XOR_1);
6695 target = expand_builtin_atomic_fetch_op (mode, exp, target, XOR, false,
6696 ignore, BUILT_IN_NONE);
6701 case BUILT_IN_ATOMIC_FETCH_OR_1:
6702 case BUILT_IN_ATOMIC_FETCH_OR_2:
6703 case BUILT_IN_ATOMIC_FETCH_OR_4:
6704 case BUILT_IN_ATOMIC_FETCH_OR_8:
6705 case BUILT_IN_ATOMIC_FETCH_OR_16:
6706 mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_OR_1);
6707 target = expand_builtin_atomic_fetch_op (mode, exp, target, IOR, false,
6708 ignore, BUILT_IN_NONE);
6713 case BUILT_IN_ATOMIC_TEST_AND_SET:
6714 return expand_builtin_atomic_test_and_set (exp);
6716 case BUILT_IN_ATOMIC_CLEAR:
6717 return expand_builtin_atomic_clear (exp);
6719 case BUILT_IN_ATOMIC_ALWAYS_LOCK_FREE:
6720 return expand_builtin_atomic_always_lock_free (exp);
6722 case BUILT_IN_ATOMIC_IS_LOCK_FREE:
6723 target = expand_builtin_atomic_is_lock_free (exp);
6728 case BUILT_IN_ATOMIC_THREAD_FENCE:
6729 expand_builtin_atomic_thread_fence (exp);
6732 case BUILT_IN_ATOMIC_SIGNAL_FENCE:
6733 expand_builtin_atomic_signal_fence (exp);
6736 case BUILT_IN_OBJECT_SIZE:
6737 return expand_builtin_object_size (exp);
6739 case BUILT_IN_MEMCPY_CHK:
6740 case BUILT_IN_MEMPCPY_CHK:
6741 case BUILT_IN_MEMMOVE_CHK:
6742 case BUILT_IN_MEMSET_CHK:
6743 target = expand_builtin_memory_chk (exp, target, mode, fcode);
6748 case BUILT_IN_STRCPY_CHK:
6749 case BUILT_IN_STPCPY_CHK:
6750 case BUILT_IN_STRNCPY_CHK:
6751 case BUILT_IN_STRCAT_CHK:
6752 case BUILT_IN_STRNCAT_CHK:
6753 case BUILT_IN_SNPRINTF_CHK:
6754 case BUILT_IN_VSNPRINTF_CHK:
6755 maybe_emit_chk_warning (exp, fcode);
6758 case BUILT_IN_SPRINTF_CHK:
6759 case BUILT_IN_VSPRINTF_CHK:
6760 maybe_emit_sprintf_chk_warning (exp, fcode);
6764 if (warn_free_nonheap_object)
6765 maybe_emit_free_warning (exp);
6768 default: /* just do library call, if unknown builtin */
6772 /* The switch statement above can drop through to cause the function
6773 to be called normally. */
6774 return expand_call (exp, target, ignore);
6777 /* Determine whether a tree node represents a call to a built-in
6778 function. If the tree T is a call to a built-in function with
6779 the right number of arguments of the appropriate types, return
6780 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
6781 Otherwise the return value is END_BUILTINS. */
6783 enum built_in_function
6784 builtin_mathfn_code (const_tree t)
6786 const_tree fndecl, arg, parmlist;
6787 const_tree argtype, parmtype;
6788 const_call_expr_arg_iterator iter;
6790 if (TREE_CODE (t) != CALL_EXPR
6791 || TREE_CODE (CALL_EXPR_FN (t)) != ADDR_EXPR)
6792 return END_BUILTINS;
6794 fndecl = get_callee_fndecl (t);
6795 if (fndecl == NULL_TREE
6796 || TREE_CODE (fndecl) != FUNCTION_DECL
6797 || ! DECL_BUILT_IN (fndecl)
6798 || DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
6799 return END_BUILTINS;
6801 parmlist = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
6802 init_const_call_expr_arg_iterator (t, &iter);
6803 for (; parmlist; parmlist = TREE_CHAIN (parmlist))
6805 /* If a function doesn't take a variable number of arguments,
6806 the last element in the list will have type `void'. */
6807 parmtype = TREE_VALUE (parmlist);
6808 if (VOID_TYPE_P (parmtype))
6810 if (more_const_call_expr_args_p (&iter))
6811 return END_BUILTINS;
6812 return DECL_FUNCTION_CODE (fndecl);
6815 if (! more_const_call_expr_args_p (&iter))
6816 return END_BUILTINS;
6818 arg = next_const_call_expr_arg (&iter);
6819 argtype = TREE_TYPE (arg);
6821 if (SCALAR_FLOAT_TYPE_P (parmtype))
6823 if (! SCALAR_FLOAT_TYPE_P (argtype))
6824 return END_BUILTINS;
6826 else if (COMPLEX_FLOAT_TYPE_P (parmtype))
6828 if (! COMPLEX_FLOAT_TYPE_P (argtype))
6829 return END_BUILTINS;
6831 else if (POINTER_TYPE_P (parmtype))
6833 if (! POINTER_TYPE_P (argtype))
6834 return END_BUILTINS;
6836 else if (INTEGRAL_TYPE_P (parmtype))
6838 if (! INTEGRAL_TYPE_P (argtype))
6839 return END_BUILTINS;
6842 return END_BUILTINS;
6845 /* Variable-length argument list. */
6846 return DECL_FUNCTION_CODE (fndecl);
6849 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
6850 evaluate to a constant. */
6853 fold_builtin_constant_p (tree arg)
6855 /* We return 1 for a numeric type that's known to be a constant
6856 value at compile-time or for an aggregate type that's a
6857 literal constant. */
6860 /* If we know this is a constant, emit the constant of one. */
6861 if (CONSTANT_CLASS_P (arg)
6862 || (TREE_CODE (arg) == CONSTRUCTOR
6863 && TREE_CONSTANT (arg)))
6864 return integer_one_node;
6865 if (TREE_CODE (arg) == ADDR_EXPR)
6867 tree op = TREE_OPERAND (arg, 0);
6868 if (TREE_CODE (op) == STRING_CST
6869 || (TREE_CODE (op) == ARRAY_REF
6870 && integer_zerop (TREE_OPERAND (op, 1))
6871 && TREE_CODE (TREE_OPERAND (op, 0)) == STRING_CST))
6872 return integer_one_node;
6875 /* If this expression has side effects, show we don't know it to be a
6876 constant. Likewise if it's a pointer or aggregate type since in
6877 those case we only want literals, since those are only optimized
6878 when generating RTL, not later.
6879 And finally, if we are compiling an initializer, not code, we
6880 need to return a definite result now; there's not going to be any
6881 more optimization done. */
6882 if (TREE_SIDE_EFFECTS (arg)
6883 || AGGREGATE_TYPE_P (TREE_TYPE (arg))
6884 || POINTER_TYPE_P (TREE_TYPE (arg))
6886 || folding_initializer)
6887 return integer_zero_node;
6892 /* Create builtin_expect with PRED and EXPECTED as its arguments and
6893 return it as a truthvalue. */
6896 build_builtin_expect_predicate (location_t loc, tree pred, tree expected)
6898 tree fn, arg_types, pred_type, expected_type, call_expr, ret_type;
6900 fn = builtin_decl_explicit (BUILT_IN_EXPECT);
6901 arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn));
6902 ret_type = TREE_TYPE (TREE_TYPE (fn));
6903 pred_type = TREE_VALUE (arg_types);
6904 expected_type = TREE_VALUE (TREE_CHAIN (arg_types));
6906 pred = fold_convert_loc (loc, pred_type, pred);
6907 expected = fold_convert_loc (loc, expected_type, expected);
6908 call_expr = build_call_expr_loc (loc, fn, 2, pred, expected);
6910 return build2 (NE_EXPR, TREE_TYPE (pred), call_expr,
6911 build_int_cst (ret_type, 0));
6914 /* Fold a call to builtin_expect with arguments ARG0 and ARG1. Return
6915 NULL_TREE if no simplification is possible. */
6918 fold_builtin_expect (location_t loc, tree arg0, tree arg1)
6920 tree inner, fndecl, inner_arg0;
6921 enum tree_code code;
6923 /* Distribute the expected value over short-circuiting operators.
6924 See through the cast from truthvalue_type_node to long. */
6926 while (TREE_CODE (inner_arg0) == NOP_EXPR
6927 && INTEGRAL_TYPE_P (TREE_TYPE (inner_arg0))
6928 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (inner_arg0, 0))))
6929 inner_arg0 = TREE_OPERAND (inner_arg0, 0);
6931 /* If this is a builtin_expect within a builtin_expect keep the
6932 inner one. See through a comparison against a constant. It
6933 might have been added to create a thruthvalue. */
6936 if (COMPARISON_CLASS_P (inner)
6937 && TREE_CODE (TREE_OPERAND (inner, 1)) == INTEGER_CST)
6938 inner = TREE_OPERAND (inner, 0);
6940 if (TREE_CODE (inner) == CALL_EXPR
6941 && (fndecl = get_callee_fndecl (inner))
6942 && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
6943 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_EXPECT)
6947 code = TREE_CODE (inner);
6948 if (code == TRUTH_ANDIF_EXPR || code == TRUTH_ORIF_EXPR)
6950 tree op0 = TREE_OPERAND (inner, 0);
6951 tree op1 = TREE_OPERAND (inner, 1);
6953 op0 = build_builtin_expect_predicate (loc, op0, arg1);
6954 op1 = build_builtin_expect_predicate (loc, op1, arg1);
6955 inner = build2 (code, TREE_TYPE (inner), op0, op1);
6957 return fold_convert_loc (loc, TREE_TYPE (arg0), inner);
6960 /* If the argument isn't invariant then there's nothing else we can do. */
6961 if (!TREE_CONSTANT (inner_arg0))
6964 /* If we expect that a comparison against the argument will fold to
6965 a constant return the constant. In practice, this means a true
6966 constant or the address of a non-weak symbol. */
6969 if (TREE_CODE (inner) == ADDR_EXPR)
6973 inner = TREE_OPERAND (inner, 0);
6975 while (TREE_CODE (inner) == COMPONENT_REF
6976 || TREE_CODE (inner) == ARRAY_REF);
6977 if ((TREE_CODE (inner) == VAR_DECL
6978 || TREE_CODE (inner) == FUNCTION_DECL)
6979 && DECL_WEAK (inner))
6983 /* Otherwise, ARG0 already has the proper type for the return value. */
6987 /* Fold a call to __builtin_classify_type with argument ARG. */
6990 fold_builtin_classify_type (tree arg)
6993 return build_int_cst (integer_type_node, no_type_class);
6995 return build_int_cst (integer_type_node, type_to_class (TREE_TYPE (arg)));
6998 /* Fold a call to __builtin_strlen with argument ARG. */
7001 fold_builtin_strlen (location_t loc, tree type, tree arg)
7003 if (!validate_arg (arg, POINTER_TYPE))
7007 tree len = c_strlen (arg, 0);
7010 return fold_convert_loc (loc, type, len);
7016 /* Fold a call to __builtin_inf or __builtin_huge_val. */
7019 fold_builtin_inf (location_t loc, tree type, int warn)
7021 REAL_VALUE_TYPE real;
7023 /* __builtin_inff is intended to be usable to define INFINITY on all
7024 targets. If an infinity is not available, INFINITY expands "to a
7025 positive constant of type float that overflows at translation
7026 time", footnote "In this case, using INFINITY will violate the
7027 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
7028 Thus we pedwarn to ensure this constraint violation is
7030 if (!MODE_HAS_INFINITIES (TYPE_MODE (type)) && warn)
7031 pedwarn (loc, 0, "target format does not support infinity");
7034 return build_real (type, real);
7037 /* Fold a call to __builtin_nan or __builtin_nans with argument ARG. */
7040 fold_builtin_nan (tree arg, tree type, int quiet)
7042 REAL_VALUE_TYPE real;
7045 if (!validate_arg (arg, POINTER_TYPE))
7047 str = c_getstr (arg);
7051 if (!real_nan (&real, str, quiet, TYPE_MODE (type)))
7054 return build_real (type, real);
7057 /* Return true if the floating point expression T has an integer value.
7058 We also allow +Inf, -Inf and NaN to be considered integer values. */
7061 integer_valued_real_p (tree t)
7063 switch (TREE_CODE (t))
7070 return integer_valued_real_p (TREE_OPERAND (t, 0));
7075 return integer_valued_real_p (TREE_OPERAND (t, 1));
7082 return integer_valued_real_p (TREE_OPERAND (t, 0))
7083 && integer_valued_real_p (TREE_OPERAND (t, 1));
7086 return integer_valued_real_p (TREE_OPERAND (t, 1))
7087 && integer_valued_real_p (TREE_OPERAND (t, 2));
7090 return real_isinteger (TREE_REAL_CST_PTR (t), TYPE_MODE (TREE_TYPE (t)));
7094 tree type = TREE_TYPE (TREE_OPERAND (t, 0));
7095 if (TREE_CODE (type) == INTEGER_TYPE)
7097 if (TREE_CODE (type) == REAL_TYPE)
7098 return integer_valued_real_p (TREE_OPERAND (t, 0));
7103 switch (builtin_mathfn_code (t))
7105 CASE_FLT_FN (BUILT_IN_CEIL):
7106 CASE_FLT_FN (BUILT_IN_FLOOR):
7107 CASE_FLT_FN (BUILT_IN_NEARBYINT):
7108 CASE_FLT_FN (BUILT_IN_RINT):
7109 CASE_FLT_FN (BUILT_IN_ROUND):
7110 CASE_FLT_FN (BUILT_IN_TRUNC):
7113 CASE_FLT_FN (BUILT_IN_FMIN):
7114 CASE_FLT_FN (BUILT_IN_FMAX):
7115 return integer_valued_real_p (CALL_EXPR_ARG (t, 0))
7116 && integer_valued_real_p (CALL_EXPR_ARG (t, 1));
7129 /* FNDECL is assumed to be a builtin where truncation can be propagated
7130 across (for instance floor((double)f) == (double)floorf (f).
7131 Do the transformation for a call with argument ARG. */
7134 fold_trunc_transparent_mathfn (location_t loc, tree fndecl, tree arg)
7136 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
7138 if (!validate_arg (arg, REAL_TYPE))
7141 /* Integer rounding functions are idempotent. */
7142 if (fcode == builtin_mathfn_code (arg))
7145 /* If argument is already integer valued, and we don't need to worry
7146 about setting errno, there's no need to perform rounding. */
7147 if (! flag_errno_math && integer_valued_real_p (arg))
7152 tree arg0 = strip_float_extensions (arg);
7153 tree ftype = TREE_TYPE (TREE_TYPE (fndecl));
7154 tree newtype = TREE_TYPE (arg0);
7157 if (TYPE_PRECISION (newtype) < TYPE_PRECISION (ftype)
7158 && (decl = mathfn_built_in (newtype, fcode)))
7159 return fold_convert_loc (loc, ftype,
7160 build_call_expr_loc (loc, decl, 1,
7161 fold_convert_loc (loc,
7168 /* FNDECL is assumed to be builtin which can narrow the FP type of
7169 the argument, for instance lround((double)f) -> lroundf (f).
7170 Do the transformation for a call with argument ARG. */
7173 fold_fixed_mathfn (location_t loc, tree fndecl, tree arg)
7175 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
7177 if (!validate_arg (arg, REAL_TYPE))
7180 /* If argument is already integer valued, and we don't need to worry
7181 about setting errno, there's no need to perform rounding. */
7182 if (! flag_errno_math && integer_valued_real_p (arg))
7183 return fold_build1_loc (loc, FIX_TRUNC_EXPR,
7184 TREE_TYPE (TREE_TYPE (fndecl)), arg);
7188 tree ftype = TREE_TYPE (arg);
7189 tree arg0 = strip_float_extensions (arg);
7190 tree newtype = TREE_TYPE (arg0);
7193 if (TYPE_PRECISION (newtype) < TYPE_PRECISION (ftype)
7194 && (decl = mathfn_built_in (newtype, fcode)))
7195 return build_call_expr_loc (loc, decl, 1,
7196 fold_convert_loc (loc, newtype, arg0));
7199 /* Canonicalize iround (x) to lround (x) on ILP32 targets where
7200 sizeof (int) == sizeof (long). */
7201 if (TYPE_PRECISION (integer_type_node)
7202 == TYPE_PRECISION (long_integer_type_node))
7204 tree newfn = NULL_TREE;
7207 CASE_FLT_FN (BUILT_IN_ICEIL):
7208 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LCEIL);
7211 CASE_FLT_FN (BUILT_IN_IFLOOR):
7212 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LFLOOR);
7215 CASE_FLT_FN (BUILT_IN_IROUND):
7216 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LROUND);
7219 CASE_FLT_FN (BUILT_IN_IRINT):
7220 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LRINT);
7229 tree newcall = build_call_expr_loc (loc, newfn, 1, arg);
7230 return fold_convert_loc (loc,
7231 TREE_TYPE (TREE_TYPE (fndecl)), newcall);
7235 /* Canonicalize llround (x) to lround (x) on LP64 targets where
7236 sizeof (long long) == sizeof (long). */
7237 if (TYPE_PRECISION (long_long_integer_type_node)
7238 == TYPE_PRECISION (long_integer_type_node))
7240 tree newfn = NULL_TREE;
7243 CASE_FLT_FN (BUILT_IN_LLCEIL):
7244 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LCEIL);
7247 CASE_FLT_FN (BUILT_IN_LLFLOOR):
7248 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LFLOOR);
7251 CASE_FLT_FN (BUILT_IN_LLROUND):
7252 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LROUND);
7255 CASE_FLT_FN (BUILT_IN_LLRINT):
7256 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LRINT);
7265 tree newcall = build_call_expr_loc (loc, newfn, 1, arg);
7266 return fold_convert_loc (loc,
7267 TREE_TYPE (TREE_TYPE (fndecl)), newcall);
7274 /* Fold call to builtin cabs, cabsf or cabsl with argument ARG. TYPE is the
7275 return type. Return NULL_TREE if no simplification can be made. */
7278 fold_builtin_cabs (location_t loc, tree arg, tree type, tree fndecl)
7282 if (!validate_arg (arg, COMPLEX_TYPE)
7283 || TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) != REAL_TYPE)
7286 /* Calculate the result when the argument is a constant. */
7287 if (TREE_CODE (arg) == COMPLEX_CST
7288 && (res = do_mpfr_arg2 (TREE_REALPART (arg), TREE_IMAGPART (arg),
7292 if (TREE_CODE (arg) == COMPLEX_EXPR)
7294 tree real = TREE_OPERAND (arg, 0);
7295 tree imag = TREE_OPERAND (arg, 1);
7297 /* If either part is zero, cabs is fabs of the other. */
7298 if (real_zerop (real))
7299 return fold_build1_loc (loc, ABS_EXPR, type, imag);
7300 if (real_zerop (imag))
7301 return fold_build1_loc (loc, ABS_EXPR, type, real);
7303 /* cabs(x+xi) -> fabs(x)*sqrt(2). */
7304 if (flag_unsafe_math_optimizations
7305 && operand_equal_p (real, imag, OEP_PURE_SAME))
7307 const REAL_VALUE_TYPE sqrt2_trunc
7308 = real_value_truncate (TYPE_MODE (type), dconst_sqrt2 ());
7310 return fold_build2_loc (loc, MULT_EXPR, type,
7311 fold_build1_loc (loc, ABS_EXPR, type, real),
7312 build_real (type, sqrt2_trunc));
7316 /* Optimize cabs(-z) and cabs(conj(z)) as cabs(z). */
7317 if (TREE_CODE (arg) == NEGATE_EXPR
7318 || TREE_CODE (arg) == CONJ_EXPR)
7319 return build_call_expr_loc (loc, fndecl, 1, TREE_OPERAND (arg, 0));
7321 /* Don't do this when optimizing for size. */
7322 if (flag_unsafe_math_optimizations
7323 && optimize && optimize_function_for_speed_p (cfun))
7325 tree sqrtfn = mathfn_built_in (type, BUILT_IN_SQRT);
7327 if (sqrtfn != NULL_TREE)
7329 tree rpart, ipart, result;
7331 arg = builtin_save_expr (arg);
7333 rpart = fold_build1_loc (loc, REALPART_EXPR, type, arg);
7334 ipart = fold_build1_loc (loc, IMAGPART_EXPR, type, arg);
7336 rpart = builtin_save_expr (rpart);
7337 ipart = builtin_save_expr (ipart);
7339 result = fold_build2_loc (loc, PLUS_EXPR, type,
7340 fold_build2_loc (loc, MULT_EXPR, type,
7342 fold_build2_loc (loc, MULT_EXPR, type,
7345 return build_call_expr_loc (loc, sqrtfn, 1, result);
7352 /* Build a complex (inf +- 0i) for the result of cproj. TYPE is the
7353 complex tree type of the result. If NEG is true, the imaginary
7354 zero is negative. */
7357 build_complex_cproj (tree type, bool neg)
7359 REAL_VALUE_TYPE rinf, rzero = dconst0;
7363 return build_complex (type, build_real (TREE_TYPE (type), rinf),
7364 build_real (TREE_TYPE (type), rzero));
7367 /* Fold call to builtin cproj, cprojf or cprojl with argument ARG. TYPE is the
7368 return type. Return NULL_TREE if no simplification can be made. */
7371 fold_builtin_cproj (location_t loc, tree arg, tree type)
7373 if (!validate_arg (arg, COMPLEX_TYPE)
7374 || TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) != REAL_TYPE)
7377 /* If there are no infinities, return arg. */
7378 if (! HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (type))))
7379 return non_lvalue_loc (loc, arg);
7381 /* Calculate the result when the argument is a constant. */
7382 if (TREE_CODE (arg) == COMPLEX_CST)
7384 const REAL_VALUE_TYPE *real = TREE_REAL_CST_PTR (TREE_REALPART (arg));
7385 const REAL_VALUE_TYPE *imag = TREE_REAL_CST_PTR (TREE_IMAGPART (arg));
7387 if (real_isinf (real) || real_isinf (imag))
7388 return build_complex_cproj (type, imag->sign);
7392 else if (TREE_CODE (arg) == COMPLEX_EXPR)
7394 tree real = TREE_OPERAND (arg, 0);
7395 tree imag = TREE_OPERAND (arg, 1);
7400 /* If the real part is inf and the imag part is known to be
7401 nonnegative, return (inf + 0i). Remember side-effects are
7402 possible in the imag part. */
7403 if (TREE_CODE (real) == REAL_CST
7404 && real_isinf (TREE_REAL_CST_PTR (real))
7405 && tree_expr_nonnegative_p (imag))
7406 return omit_one_operand_loc (loc, type,
7407 build_complex_cproj (type, false),
7410 /* If the imag part is inf, return (inf+I*copysign(0,imag)).
7411 Remember side-effects are possible in the real part. */
7412 if (TREE_CODE (imag) == REAL_CST
7413 && real_isinf (TREE_REAL_CST_PTR (imag)))
7415 omit_one_operand_loc (loc, type,
7416 build_complex_cproj (type, TREE_REAL_CST_PTR
7417 (imag)->sign), arg);
7423 /* Fold a builtin function call to sqrt, sqrtf, or sqrtl with argument ARG.
7424 Return NULL_TREE if no simplification can be made. */
7427 fold_builtin_sqrt (location_t loc, tree arg, tree type)
7430 enum built_in_function fcode;
7433 if (!validate_arg (arg, REAL_TYPE))
7436 /* Calculate the result when the argument is a constant. */
7437 if ((res = do_mpfr_arg1 (arg, type, mpfr_sqrt, &dconst0, NULL, true)))
7440 /* Optimize sqrt(expN(x)) = expN(x*0.5). */
7441 fcode = builtin_mathfn_code (arg);
7442 if (flag_unsafe_math_optimizations && BUILTIN_EXPONENT_P (fcode))
7444 tree expfn = TREE_OPERAND (CALL_EXPR_FN (arg), 0);
7445 arg = fold_build2_loc (loc, MULT_EXPR, type,
7446 CALL_EXPR_ARG (arg, 0),
7447 build_real (type, dconsthalf));
7448 return build_call_expr_loc (loc, expfn, 1, arg);
7451 /* Optimize sqrt(Nroot(x)) -> pow(x,1/(2*N)). */
7452 if (flag_unsafe_math_optimizations && BUILTIN_ROOT_P (fcode))
7454 tree powfn = mathfn_built_in (type, BUILT_IN_POW);
7458 tree arg0 = CALL_EXPR_ARG (arg, 0);
7460 /* The inner root was either sqrt or cbrt. */
7461 /* This was a conditional expression but it triggered a bug
7463 REAL_VALUE_TYPE dconstroot;
7464 if (BUILTIN_SQRT_P (fcode))
7465 dconstroot = dconsthalf;
7467 dconstroot = dconst_third ();
7469 /* Adjust for the outer root. */
7470 SET_REAL_EXP (&dconstroot, REAL_EXP (&dconstroot) - 1);
7471 dconstroot = real_value_truncate (TYPE_MODE (type), dconstroot);
7472 tree_root = build_real (type, dconstroot);
7473 return build_call_expr_loc (loc, powfn, 2, arg0, tree_root);
7477 /* Optimize sqrt(pow(x,y)) = pow(|x|,y*0.5). */
7478 if (flag_unsafe_math_optimizations
7479 && (fcode == BUILT_IN_POW
7480 || fcode == BUILT_IN_POWF
7481 || fcode == BUILT_IN_POWL))
7483 tree powfn = TREE_OPERAND (CALL_EXPR_FN (arg), 0);
7484 tree arg0 = CALL_EXPR_ARG (arg, 0);
7485 tree arg1 = CALL_EXPR_ARG (arg, 1);
7487 if (!tree_expr_nonnegative_p (arg0))
7488 arg0 = build1 (ABS_EXPR, type, arg0);
7489 narg1 = fold_build2_loc (loc, MULT_EXPR, type, arg1,
7490 build_real (type, dconsthalf));
7491 return build_call_expr_loc (loc, powfn, 2, arg0, narg1);
7497 /* Fold a builtin function call to cbrt, cbrtf, or cbrtl with argument ARG.
7498 Return NULL_TREE if no simplification can be made. */
7501 fold_builtin_cbrt (location_t loc, tree arg, tree type)
7503 const enum built_in_function fcode = builtin_mathfn_code (arg);
7506 if (!validate_arg (arg, REAL_TYPE))
7509 /* Calculate the result when the argument is a constant. */
7510 if ((res = do_mpfr_arg1 (arg, type, mpfr_cbrt, NULL, NULL, 0)))
7513 if (flag_unsafe_math_optimizations)
7515 /* Optimize cbrt(expN(x)) -> expN(x/3). */
7516 if (BUILTIN_EXPONENT_P (fcode))
7518 tree expfn = TREE_OPERAND (CALL_EXPR_FN (arg), 0);
7519 const REAL_VALUE_TYPE third_trunc =
7520 real_value_truncate (TYPE_MODE (type), dconst_third ());
7521 arg = fold_build2_loc (loc, MULT_EXPR, type,
7522 CALL_EXPR_ARG (arg, 0),
7523 build_real (type, third_trunc));
7524 return build_call_expr_loc (loc, expfn, 1, arg);
7527 /* Optimize cbrt(sqrt(x)) -> pow(x,1/6). */
7528 if (BUILTIN_SQRT_P (fcode))
7530 tree powfn = mathfn_built_in (type, BUILT_IN_POW);
7534 tree arg0 = CALL_EXPR_ARG (arg, 0);
7536 REAL_VALUE_TYPE dconstroot = dconst_third ();
7538 SET_REAL_EXP (&dconstroot, REAL_EXP (&dconstroot) - 1);
7539 dconstroot = real_value_truncate (TYPE_MODE (type), dconstroot);
7540 tree_root = build_real (type, dconstroot);
7541 return build_call_expr_loc (loc, powfn, 2, arg0, tree_root);
7545 /* Optimize cbrt(cbrt(x)) -> pow(x,1/9) iff x is nonnegative. */
7546 if (BUILTIN_CBRT_P (fcode))
7548 tree arg0 = CALL_EXPR_ARG (arg, 0);
7549 if (tree_expr_nonnegative_p (arg0))
7551 tree powfn = mathfn_built_in (type, BUILT_IN_POW);
7556 REAL_VALUE_TYPE dconstroot;
7558 real_arithmetic (&dconstroot, MULT_EXPR,
7559 dconst_third_ptr (), dconst_third_ptr ());
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);
7567 /* Optimize cbrt(pow(x,y)) -> pow(x,y/3) iff x is nonnegative. */
7568 if (fcode == BUILT_IN_POW
7569 || fcode == BUILT_IN_POWF
7570 || fcode == BUILT_IN_POWL)
7572 tree arg00 = CALL_EXPR_ARG (arg, 0);
7573 tree arg01 = CALL_EXPR_ARG (arg, 1);
7574 if (tree_expr_nonnegative_p (arg00))
7576 tree powfn = TREE_OPERAND (CALL_EXPR_FN (arg), 0);
7577 const REAL_VALUE_TYPE dconstroot
7578 = real_value_truncate (TYPE_MODE (type), dconst_third ());
7579 tree narg01 = fold_build2_loc (loc, MULT_EXPR, type, arg01,
7580 build_real (type, dconstroot));
7581 return build_call_expr_loc (loc, powfn, 2, arg00, narg01);
7588 /* Fold function call to builtin cos, cosf, or cosl with argument ARG.
7589 TYPE is the type of the return value. Return NULL_TREE if no
7590 simplification can be made. */
7593 fold_builtin_cos (location_t loc,
7594 tree arg, tree type, tree fndecl)
7598 if (!validate_arg (arg, REAL_TYPE))
7601 /* Calculate the result when the argument is a constant. */
7602 if ((res = do_mpfr_arg1 (arg, type, mpfr_cos, NULL, NULL, 0)))
7605 /* Optimize cos(-x) into cos (x). */
7606 if ((narg = fold_strip_sign_ops (arg)))
7607 return build_call_expr_loc (loc, fndecl, 1, narg);
7612 /* Fold function call to builtin cosh, coshf, or coshl with argument ARG.
7613 Return NULL_TREE if no simplification can be made. */
7616 fold_builtin_cosh (location_t loc, tree arg, tree type, tree fndecl)
7618 if (validate_arg (arg, REAL_TYPE))
7622 /* Calculate the result when the argument is a constant. */
7623 if ((res = do_mpfr_arg1 (arg, type, mpfr_cosh, NULL, NULL, 0)))
7626 /* Optimize cosh(-x) into cosh (x). */
7627 if ((narg = fold_strip_sign_ops (arg)))
7628 return build_call_expr_loc (loc, fndecl, 1, narg);
7634 /* Fold function call to builtin ccos (or ccosh if HYPER is TRUE) with
7635 argument ARG. TYPE is the type of the return value. Return
7636 NULL_TREE if no simplification can be made. */
7639 fold_builtin_ccos (location_t loc, tree arg, tree type, tree fndecl,
7642 if (validate_arg (arg, COMPLEX_TYPE)
7643 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) == REAL_TYPE)
7647 /* Calculate the result when the argument is a constant. */
7648 if ((tmp = do_mpc_arg1 (arg, type, (hyper ? mpc_cosh : mpc_cos))))
7651 /* Optimize fn(-x) into fn(x). */
7652 if ((tmp = fold_strip_sign_ops (arg)))
7653 return build_call_expr_loc (loc, fndecl, 1, tmp);
7659 /* Fold function call to builtin tan, tanf, or tanl with argument ARG.
7660 Return NULL_TREE if no simplification can be made. */
7663 fold_builtin_tan (tree arg, tree type)
7665 enum built_in_function fcode;
7668 if (!validate_arg (arg, REAL_TYPE))
7671 /* Calculate the result when the argument is a constant. */
7672 if ((res = do_mpfr_arg1 (arg, type, mpfr_tan, NULL, NULL, 0)))
7675 /* Optimize tan(atan(x)) = x. */
7676 fcode = builtin_mathfn_code (arg);
7677 if (flag_unsafe_math_optimizations
7678 && (fcode == BUILT_IN_ATAN
7679 || fcode == BUILT_IN_ATANF
7680 || fcode == BUILT_IN_ATANL))
7681 return CALL_EXPR_ARG (arg, 0);
7686 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
7687 NULL_TREE if no simplification can be made. */
7690 fold_builtin_sincos (location_t loc,
7691 tree arg0, tree arg1, tree arg2)
7696 if (!validate_arg (arg0, REAL_TYPE)
7697 || !validate_arg (arg1, POINTER_TYPE)
7698 || !validate_arg (arg2, POINTER_TYPE))
7701 type = TREE_TYPE (arg0);
7703 /* Calculate the result when the argument is a constant. */
7704 if ((res = do_mpfr_sincos (arg0, arg1, arg2)))
7707 /* Canonicalize sincos to cexpi. */
7708 if (!TARGET_C99_FUNCTIONS)
7710 fn = mathfn_built_in (type, BUILT_IN_CEXPI);
7714 call = build_call_expr_loc (loc, fn, 1, arg0);
7715 call = builtin_save_expr (call);
7717 return build2 (COMPOUND_EXPR, void_type_node,
7718 build2 (MODIFY_EXPR, void_type_node,
7719 build_fold_indirect_ref_loc (loc, arg1),
7720 build1 (IMAGPART_EXPR, type, call)),
7721 build2 (MODIFY_EXPR, void_type_node,
7722 build_fold_indirect_ref_loc (loc, arg2),
7723 build1 (REALPART_EXPR, type, call)));
7726 /* Fold function call to builtin cexp, cexpf, or cexpl. Return
7727 NULL_TREE if no simplification can be made. */
7730 fold_builtin_cexp (location_t loc, tree arg0, tree type)
7733 tree realp, imagp, ifn;
7736 if (!validate_arg (arg0, COMPLEX_TYPE)
7737 || TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) != REAL_TYPE)
7740 /* Calculate the result when the argument is a constant. */
7741 if ((res = do_mpc_arg1 (arg0, type, mpc_exp)))
7744 rtype = TREE_TYPE (TREE_TYPE (arg0));
7746 /* In case we can figure out the real part of arg0 and it is constant zero
7748 if (!TARGET_C99_FUNCTIONS)
7750 ifn = mathfn_built_in (rtype, BUILT_IN_CEXPI);
7754 if ((realp = fold_unary_loc (loc, REALPART_EXPR, rtype, arg0))
7755 && real_zerop (realp))
7757 tree narg = fold_build1_loc (loc, IMAGPART_EXPR, rtype, arg0);
7758 return build_call_expr_loc (loc, ifn, 1, narg);
7761 /* In case we can easily decompose real and imaginary parts split cexp
7762 to exp (r) * cexpi (i). */
7763 if (flag_unsafe_math_optimizations
7766 tree rfn, rcall, icall;
7768 rfn = mathfn_built_in (rtype, BUILT_IN_EXP);
7772 imagp = fold_unary_loc (loc, IMAGPART_EXPR, rtype, arg0);
7776 icall = build_call_expr_loc (loc, ifn, 1, imagp);
7777 icall = builtin_save_expr (icall);
7778 rcall = build_call_expr_loc (loc, rfn, 1, realp);
7779 rcall = builtin_save_expr (rcall);
7780 return fold_build2_loc (loc, COMPLEX_EXPR, type,
7781 fold_build2_loc (loc, MULT_EXPR, rtype,
7783 fold_build1_loc (loc, REALPART_EXPR,
7785 fold_build2_loc (loc, MULT_EXPR, rtype,
7787 fold_build1_loc (loc, IMAGPART_EXPR,
7794 /* Fold function call to builtin trunc, truncf or truncl with argument ARG.
7795 Return NULL_TREE if no simplification can be made. */
7798 fold_builtin_trunc (location_t loc, tree fndecl, tree arg)
7800 if (!validate_arg (arg, REAL_TYPE))
7803 /* Optimize trunc of constant value. */
7804 if (TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
7806 REAL_VALUE_TYPE r, x;
7807 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7809 x = TREE_REAL_CST (arg);
7810 real_trunc (&r, TYPE_MODE (type), &x);
7811 return build_real (type, r);
7814 return fold_trunc_transparent_mathfn (loc, fndecl, arg);
7817 /* Fold function call to builtin floor, floorf or floorl with argument ARG.
7818 Return NULL_TREE if no simplification can be made. */
7821 fold_builtin_floor (location_t loc, tree fndecl, tree arg)
7823 if (!validate_arg (arg, REAL_TYPE))
7826 /* Optimize floor of constant value. */
7827 if (TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
7831 x = TREE_REAL_CST (arg);
7832 if (! REAL_VALUE_ISNAN (x) || ! flag_errno_math)
7834 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7837 real_floor (&r, TYPE_MODE (type), &x);
7838 return build_real (type, r);
7842 /* Fold floor (x) where x is nonnegative to trunc (x). */
7843 if (tree_expr_nonnegative_p (arg))
7845 tree truncfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_TRUNC);
7847 return build_call_expr_loc (loc, truncfn, 1, arg);
7850 return fold_trunc_transparent_mathfn (loc, fndecl, arg);
7853 /* Fold function call to builtin ceil, ceilf or ceill with argument ARG.
7854 Return NULL_TREE if no simplification can be made. */
7857 fold_builtin_ceil (location_t loc, tree fndecl, tree arg)
7859 if (!validate_arg (arg, REAL_TYPE))
7862 /* Optimize ceil of constant value. */
7863 if (TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
7867 x = TREE_REAL_CST (arg);
7868 if (! REAL_VALUE_ISNAN (x) || ! flag_errno_math)
7870 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7873 real_ceil (&r, TYPE_MODE (type), &x);
7874 return build_real (type, r);
7878 return fold_trunc_transparent_mathfn (loc, fndecl, arg);
7881 /* Fold function call to builtin round, roundf or roundl with argument ARG.
7882 Return NULL_TREE if no simplification can be made. */
7885 fold_builtin_round (location_t loc, tree fndecl, tree arg)
7887 if (!validate_arg (arg, REAL_TYPE))
7890 /* Optimize round of constant value. */
7891 if (TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
7895 x = TREE_REAL_CST (arg);
7896 if (! REAL_VALUE_ISNAN (x) || ! flag_errno_math)
7898 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7901 real_round (&r, TYPE_MODE (type), &x);
7902 return build_real (type, r);
7906 return fold_trunc_transparent_mathfn (loc, fndecl, arg);
7909 /* Fold function call to builtin lround, lroundf or lroundl (or the
7910 corresponding long long versions) and other rounding functions. ARG
7911 is the argument to the call. Return NULL_TREE if no simplification
7915 fold_builtin_int_roundingfn (location_t loc, tree fndecl, tree arg)
7917 if (!validate_arg (arg, REAL_TYPE))
7920 /* Optimize lround of constant value. */
7921 if (TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
7923 const REAL_VALUE_TYPE x = TREE_REAL_CST (arg);
7925 if (real_isfinite (&x))
7927 tree itype = TREE_TYPE (TREE_TYPE (fndecl));
7928 tree ftype = TREE_TYPE (arg);
7932 switch (DECL_FUNCTION_CODE (fndecl))
7934 CASE_FLT_FN (BUILT_IN_IFLOOR):
7935 CASE_FLT_FN (BUILT_IN_LFLOOR):
7936 CASE_FLT_FN (BUILT_IN_LLFLOOR):
7937 real_floor (&r, TYPE_MODE (ftype), &x);
7940 CASE_FLT_FN (BUILT_IN_ICEIL):
7941 CASE_FLT_FN (BUILT_IN_LCEIL):
7942 CASE_FLT_FN (BUILT_IN_LLCEIL):
7943 real_ceil (&r, TYPE_MODE (ftype), &x);
7946 CASE_FLT_FN (BUILT_IN_IROUND):
7947 CASE_FLT_FN (BUILT_IN_LROUND):
7948 CASE_FLT_FN (BUILT_IN_LLROUND):
7949 real_round (&r, TYPE_MODE (ftype), &x);
7956 real_to_integer2 ((HOST_WIDE_INT *)&val.low, &val.high, &r);
7957 if (double_int_fits_to_tree_p (itype, val))
7958 return double_int_to_tree (itype, val);
7962 switch (DECL_FUNCTION_CODE (fndecl))
7964 CASE_FLT_FN (BUILT_IN_LFLOOR):
7965 CASE_FLT_FN (BUILT_IN_LLFLOOR):
7966 /* Fold lfloor (x) where x is nonnegative to FIX_TRUNC (x). */
7967 if (tree_expr_nonnegative_p (arg))
7968 return fold_build1_loc (loc, FIX_TRUNC_EXPR,
7969 TREE_TYPE (TREE_TYPE (fndecl)), arg);
7974 return fold_fixed_mathfn (loc, fndecl, arg);
7977 /* Fold function call to builtin ffs, clz, ctz, popcount and parity
7978 and their long and long long variants (i.e. ffsl and ffsll). ARG is
7979 the argument to the call. Return NULL_TREE if no simplification can
7983 fold_builtin_bitop (tree fndecl, tree arg)
7985 if (!validate_arg (arg, INTEGER_TYPE))
7988 /* Optimize for constant argument. */
7989 if (TREE_CODE (arg) == INTEGER_CST && !TREE_OVERFLOW (arg))
7991 HOST_WIDE_INT hi, width, result;
7992 unsigned HOST_WIDE_INT lo;
7995 type = TREE_TYPE (arg);
7996 width = TYPE_PRECISION (type);
7997 lo = TREE_INT_CST_LOW (arg);
7999 /* Clear all the bits that are beyond the type's precision. */
8000 if (width > HOST_BITS_PER_WIDE_INT)
8002 hi = TREE_INT_CST_HIGH (arg);
8003 if (width < 2 * HOST_BITS_PER_WIDE_INT)
8004 hi &= ~((unsigned HOST_WIDE_INT) (-1)
8005 << (width - HOST_BITS_PER_WIDE_INT));
8010 if (width < HOST_BITS_PER_WIDE_INT)
8011 lo &= ~((unsigned HOST_WIDE_INT) (-1) << width);
8014 switch (DECL_FUNCTION_CODE (fndecl))
8016 CASE_INT_FN (BUILT_IN_FFS):
8018 result = ffs_hwi (lo);
8020 result = HOST_BITS_PER_WIDE_INT + ffs_hwi (hi);
8025 CASE_INT_FN (BUILT_IN_CLZ):
8027 result = width - floor_log2 (hi) - 1 - HOST_BITS_PER_WIDE_INT;
8029 result = width - floor_log2 (lo) - 1;
8030 else if (! CLZ_DEFINED_VALUE_AT_ZERO (TYPE_MODE (type), result))
8034 CASE_INT_FN (BUILT_IN_CTZ):
8036 result = ctz_hwi (lo);
8038 result = HOST_BITS_PER_WIDE_INT + ctz_hwi (hi);
8039 else if (! CTZ_DEFINED_VALUE_AT_ZERO (TYPE_MODE (type), result))
8043 CASE_INT_FN (BUILT_IN_CLRSB):
8044 if (width > HOST_BITS_PER_WIDE_INT
8045 && (hi & ((unsigned HOST_WIDE_INT) 1
8046 << (width - HOST_BITS_PER_WIDE_INT - 1))) != 0)
8048 hi = ~hi & ~((unsigned HOST_WIDE_INT) (-1)
8049 << (width - HOST_BITS_PER_WIDE_INT - 1));
8052 else if (width <= HOST_BITS_PER_WIDE_INT
8053 && (lo & ((unsigned HOST_WIDE_INT) 1 << (width - 1))) != 0)
8054 lo = ~lo & ~((unsigned HOST_WIDE_INT) (-1) << (width - 1));
8056 result = width - floor_log2 (hi) - 2 - HOST_BITS_PER_WIDE_INT;
8058 result = width - floor_log2 (lo) - 2;
8063 CASE_INT_FN (BUILT_IN_POPCOUNT):
8066 result++, lo &= lo - 1;
8068 result++, hi &= (unsigned HOST_WIDE_INT) hi - 1;
8071 CASE_INT_FN (BUILT_IN_PARITY):
8074 result++, lo &= lo - 1;
8076 result++, hi &= (unsigned HOST_WIDE_INT) hi - 1;
8084 return build_int_cst (TREE_TYPE (TREE_TYPE (fndecl)), result);
8090 /* Fold function call to builtin_bswap and the long and long long
8091 variants. Return NULL_TREE if no simplification can be made. */
8093 fold_builtin_bswap (tree fndecl, tree arg)
8095 if (! validate_arg (arg, INTEGER_TYPE))
8098 /* Optimize constant value. */
8099 if (TREE_CODE (arg) == INTEGER_CST && !TREE_OVERFLOW (arg))
8101 HOST_WIDE_INT hi, width, r_hi = 0;
8102 unsigned HOST_WIDE_INT lo, r_lo = 0;
8105 type = TREE_TYPE (arg);
8106 width = TYPE_PRECISION (type);
8107 lo = TREE_INT_CST_LOW (arg);
8108 hi = TREE_INT_CST_HIGH (arg);
8110 switch (DECL_FUNCTION_CODE (fndecl))
8112 case BUILT_IN_BSWAP32:
8113 case BUILT_IN_BSWAP64:
8117 for (s = 0; s < width; s += 8)
8119 int d = width - s - 8;
8120 unsigned HOST_WIDE_INT byte;
8122 if (s < HOST_BITS_PER_WIDE_INT)
8123 byte = (lo >> s) & 0xff;
8125 byte = (hi >> (s - HOST_BITS_PER_WIDE_INT)) & 0xff;
8127 if (d < HOST_BITS_PER_WIDE_INT)
8130 r_hi |= byte << (d - HOST_BITS_PER_WIDE_INT);
8140 if (width < HOST_BITS_PER_WIDE_INT)
8141 return build_int_cst (TREE_TYPE (TREE_TYPE (fndecl)), r_lo);
8143 return build_int_cst_wide (TREE_TYPE (TREE_TYPE (fndecl)), r_lo, r_hi);
8149 /* A subroutine of fold_builtin to fold the various logarithmic
8150 functions. Return NULL_TREE if no simplification can me made.
8151 FUNC is the corresponding MPFR logarithm function. */
8154 fold_builtin_logarithm (location_t loc, tree fndecl, tree arg,
8155 int (*func)(mpfr_ptr, mpfr_srcptr, mp_rnd_t))
8157 if (validate_arg (arg, REAL_TYPE))
8159 tree type = TREE_TYPE (TREE_TYPE (fndecl));
8161 const enum built_in_function fcode = builtin_mathfn_code (arg);
8163 /* Calculate the result when the argument is a constant. */
8164 if ((res = do_mpfr_arg1 (arg, type, func, &dconst0, NULL, false)))
8167 /* Special case, optimize logN(expN(x)) = x. */
8168 if (flag_unsafe_math_optimizations
8169 && ((func == mpfr_log
8170 && (fcode == BUILT_IN_EXP
8171 || fcode == BUILT_IN_EXPF
8172 || fcode == BUILT_IN_EXPL))
8173 || (func == mpfr_log2
8174 && (fcode == BUILT_IN_EXP2
8175 || fcode == BUILT_IN_EXP2F
8176 || fcode == BUILT_IN_EXP2L))
8177 || (func == mpfr_log10 && (BUILTIN_EXP10_P (fcode)))))
8178 return fold_convert_loc (loc, type, CALL_EXPR_ARG (arg, 0));
8180 /* Optimize logN(func()) for various exponential functions. We
8181 want to determine the value "x" and the power "exponent" in
8182 order to transform logN(x**exponent) into exponent*logN(x). */
8183 if (flag_unsafe_math_optimizations)
8185 tree exponent = 0, x = 0;
8189 CASE_FLT_FN (BUILT_IN_EXP):
8190 /* Prepare to do logN(exp(exponent) -> exponent*logN(e). */
8191 x = build_real (type, real_value_truncate (TYPE_MODE (type),
8193 exponent = CALL_EXPR_ARG (arg, 0);
8195 CASE_FLT_FN (BUILT_IN_EXP2):
8196 /* Prepare to do logN(exp2(exponent) -> exponent*logN(2). */
8197 x = build_real (type, dconst2);
8198 exponent = CALL_EXPR_ARG (arg, 0);
8200 CASE_FLT_FN (BUILT_IN_EXP10):
8201 CASE_FLT_FN (BUILT_IN_POW10):
8202 /* Prepare to do logN(exp10(exponent) -> exponent*logN(10). */
8204 REAL_VALUE_TYPE dconst10;
8205 real_from_integer (&dconst10, VOIDmode, 10, 0, 0);
8206 x = build_real (type, dconst10);
8208 exponent = CALL_EXPR_ARG (arg, 0);
8210 CASE_FLT_FN (BUILT_IN_SQRT):
8211 /* Prepare to do logN(sqrt(x) -> 0.5*logN(x). */
8212 x = CALL_EXPR_ARG (arg, 0);
8213 exponent = build_real (type, dconsthalf);
8215 CASE_FLT_FN (BUILT_IN_CBRT):
8216 /* Prepare to do logN(cbrt(x) -> (1/3)*logN(x). */
8217 x = CALL_EXPR_ARG (arg, 0);
8218 exponent = build_real (type, real_value_truncate (TYPE_MODE (type),
8221 CASE_FLT_FN (BUILT_IN_POW):
8222 /* Prepare to do logN(pow(x,exponent) -> exponent*logN(x). */
8223 x = CALL_EXPR_ARG (arg, 0);
8224 exponent = CALL_EXPR_ARG (arg, 1);
8230 /* Now perform the optimization. */
8233 tree logfn = build_call_expr_loc (loc, fndecl, 1, x);
8234 return fold_build2_loc (loc, MULT_EXPR, type, exponent, logfn);
8242 /* Fold a builtin function call to hypot, hypotf, or hypotl. Return
8243 NULL_TREE if no simplification can be made. */
8246 fold_builtin_hypot (location_t loc, tree fndecl,
8247 tree arg0, tree arg1, tree type)
8249 tree res, narg0, narg1;
8251 if (!validate_arg (arg0, REAL_TYPE)
8252 || !validate_arg (arg1, REAL_TYPE))
8255 /* Calculate the result when the argument is a constant. */
8256 if ((res = do_mpfr_arg2 (arg0, arg1, type, mpfr_hypot)))
8259 /* If either argument to hypot has a negate or abs, strip that off.
8260 E.g. hypot(-x,fabs(y)) -> hypot(x,y). */
8261 narg0 = fold_strip_sign_ops (arg0);
8262 narg1 = fold_strip_sign_ops (arg1);
8265 return build_call_expr_loc (loc, fndecl, 2, narg0 ? narg0 : arg0,
8266 narg1 ? narg1 : arg1);
8269 /* If either argument is zero, hypot is fabs of the other. */
8270 if (real_zerop (arg0))
8271 return fold_build1_loc (loc, ABS_EXPR, type, arg1);
8272 else if (real_zerop (arg1))
8273 return fold_build1_loc (loc, ABS_EXPR, type, arg0);
8275 /* hypot(x,x) -> fabs(x)*sqrt(2). */
8276 if (flag_unsafe_math_optimizations
8277 && operand_equal_p (arg0, arg1, OEP_PURE_SAME))
8279 const REAL_VALUE_TYPE sqrt2_trunc
8280 = real_value_truncate (TYPE_MODE (type), dconst_sqrt2 ());
8281 return fold_build2_loc (loc, MULT_EXPR, type,
8282 fold_build1_loc (loc, ABS_EXPR, type, arg0),
8283 build_real (type, sqrt2_trunc));
8290 /* Fold a builtin function call to pow, powf, or powl. Return
8291 NULL_TREE if no simplification can be made. */
8293 fold_builtin_pow (location_t loc, tree fndecl, tree arg0, tree arg1, tree type)
8297 if (!validate_arg (arg0, REAL_TYPE)
8298 || !validate_arg (arg1, REAL_TYPE))
8301 /* Calculate the result when the argument is a constant. */
8302 if ((res = do_mpfr_arg2 (arg0, arg1, type, mpfr_pow)))
8305 /* Optimize pow(1.0,y) = 1.0. */
8306 if (real_onep (arg0))
8307 return omit_one_operand_loc (loc, type, build_real (type, dconst1), arg1);
8309 if (TREE_CODE (arg1) == REAL_CST
8310 && !TREE_OVERFLOW (arg1))
8312 REAL_VALUE_TYPE cint;
8316 c = TREE_REAL_CST (arg1);
8318 /* Optimize pow(x,0.0) = 1.0. */
8319 if (REAL_VALUES_EQUAL (c, dconst0))
8320 return omit_one_operand_loc (loc, type, build_real (type, dconst1),
8323 /* Optimize pow(x,1.0) = x. */
8324 if (REAL_VALUES_EQUAL (c, dconst1))
8327 /* Optimize pow(x,-1.0) = 1.0/x. */
8328 if (REAL_VALUES_EQUAL (c, dconstm1))
8329 return fold_build2_loc (loc, RDIV_EXPR, type,
8330 build_real (type, dconst1), arg0);
8332 /* Optimize pow(x,0.5) = sqrt(x). */
8333 if (flag_unsafe_math_optimizations
8334 && REAL_VALUES_EQUAL (c, dconsthalf))
8336 tree sqrtfn = mathfn_built_in (type, BUILT_IN_SQRT);
8338 if (sqrtfn != NULL_TREE)
8339 return build_call_expr_loc (loc, sqrtfn, 1, arg0);
8342 /* Optimize pow(x,1.0/3.0) = cbrt(x). */
8343 if (flag_unsafe_math_optimizations)
8345 const REAL_VALUE_TYPE dconstroot
8346 = real_value_truncate (TYPE_MODE (type), dconst_third ());
8348 if (REAL_VALUES_EQUAL (c, dconstroot))
8350 tree cbrtfn = mathfn_built_in (type, BUILT_IN_CBRT);
8351 if (cbrtfn != NULL_TREE)
8352 return build_call_expr_loc (loc, cbrtfn, 1, arg0);
8356 /* Check for an integer exponent. */
8357 n = real_to_integer (&c);
8358 real_from_integer (&cint, VOIDmode, n, n < 0 ? -1 : 0, 0);
8359 if (real_identical (&c, &cint))
8361 /* Attempt to evaluate pow at compile-time, unless this should
8362 raise an exception. */
8363 if (TREE_CODE (arg0) == REAL_CST
8364 && !TREE_OVERFLOW (arg0)
8366 || (!flag_trapping_math && !flag_errno_math)
8367 || !REAL_VALUES_EQUAL (TREE_REAL_CST (arg0), dconst0)))
8372 x = TREE_REAL_CST (arg0);
8373 inexact = real_powi (&x, TYPE_MODE (type), &x, n);
8374 if (flag_unsafe_math_optimizations || !inexact)
8375 return build_real (type, x);
8378 /* Strip sign ops from even integer powers. */
8379 if ((n & 1) == 0 && flag_unsafe_math_optimizations)
8381 tree narg0 = fold_strip_sign_ops (arg0);
8383 return build_call_expr_loc (loc, fndecl, 2, narg0, arg1);
8388 if (flag_unsafe_math_optimizations)
8390 const enum built_in_function fcode = builtin_mathfn_code (arg0);
8392 /* Optimize pow(expN(x),y) = expN(x*y). */
8393 if (BUILTIN_EXPONENT_P (fcode))
8395 tree expfn = TREE_OPERAND (CALL_EXPR_FN (arg0), 0);
8396 tree arg = CALL_EXPR_ARG (arg0, 0);
8397 arg = fold_build2_loc (loc, MULT_EXPR, type, arg, arg1);
8398 return build_call_expr_loc (loc, expfn, 1, arg);
8401 /* Optimize pow(sqrt(x),y) = pow(x,y*0.5). */
8402 if (BUILTIN_SQRT_P (fcode))
8404 tree narg0 = CALL_EXPR_ARG (arg0, 0);
8405 tree narg1 = fold_build2_loc (loc, MULT_EXPR, type, arg1,
8406 build_real (type, dconsthalf));
8407 return build_call_expr_loc (loc, fndecl, 2, narg0, narg1);
8410 /* Optimize pow(cbrt(x),y) = pow(x,y/3) iff x is nonnegative. */
8411 if (BUILTIN_CBRT_P (fcode))
8413 tree arg = CALL_EXPR_ARG (arg0, 0);
8414 if (tree_expr_nonnegative_p (arg))
8416 const REAL_VALUE_TYPE dconstroot
8417 = real_value_truncate (TYPE_MODE (type), dconst_third ());
8418 tree narg1 = fold_build2_loc (loc, MULT_EXPR, type, arg1,
8419 build_real (type, dconstroot));
8420 return build_call_expr_loc (loc, fndecl, 2, arg, narg1);
8424 /* Optimize pow(pow(x,y),z) = pow(x,y*z) iff x is nonnegative. */
8425 if (fcode == BUILT_IN_POW
8426 || fcode == BUILT_IN_POWF
8427 || fcode == BUILT_IN_POWL)
8429 tree arg00 = CALL_EXPR_ARG (arg0, 0);
8430 if (tree_expr_nonnegative_p (arg00))
8432 tree arg01 = CALL_EXPR_ARG (arg0, 1);
8433 tree narg1 = fold_build2_loc (loc, MULT_EXPR, type, arg01, arg1);
8434 return build_call_expr_loc (loc, fndecl, 2, arg00, narg1);
8442 /* Fold a builtin function call to powi, powif, or powil with argument ARG.
8443 Return NULL_TREE if no simplification can be made. */
8445 fold_builtin_powi (location_t loc, tree fndecl ATTRIBUTE_UNUSED,
8446 tree arg0, tree arg1, tree type)
8448 if (!validate_arg (arg0, REAL_TYPE)
8449 || !validate_arg (arg1, INTEGER_TYPE))
8452 /* Optimize pow(1.0,y) = 1.0. */
8453 if (real_onep (arg0))
8454 return omit_one_operand_loc (loc, type, build_real (type, dconst1), arg1);
8456 if (host_integerp (arg1, 0))
8458 HOST_WIDE_INT c = TREE_INT_CST_LOW (arg1);
8460 /* Evaluate powi at compile-time. */
8461 if (TREE_CODE (arg0) == REAL_CST
8462 && !TREE_OVERFLOW (arg0))
8465 x = TREE_REAL_CST (arg0);
8466 real_powi (&x, TYPE_MODE (type), &x, c);
8467 return build_real (type, x);
8470 /* Optimize pow(x,0) = 1.0. */
8472 return omit_one_operand_loc (loc, type, build_real (type, dconst1),
8475 /* Optimize pow(x,1) = x. */
8479 /* Optimize pow(x,-1) = 1.0/x. */
8481 return fold_build2_loc (loc, RDIV_EXPR, type,
8482 build_real (type, dconst1), arg0);
8488 /* A subroutine of fold_builtin to fold the various exponent
8489 functions. Return NULL_TREE if no simplification can be made.
8490 FUNC is the corresponding MPFR exponent function. */
8493 fold_builtin_exponent (location_t loc, tree fndecl, tree arg,
8494 int (*func)(mpfr_ptr, mpfr_srcptr, mp_rnd_t))
8496 if (validate_arg (arg, REAL_TYPE))
8498 tree type = TREE_TYPE (TREE_TYPE (fndecl));
8501 /* Calculate the result when the argument is a constant. */
8502 if ((res = do_mpfr_arg1 (arg, type, func, NULL, NULL, 0)))
8505 /* Optimize expN(logN(x)) = x. */
8506 if (flag_unsafe_math_optimizations)
8508 const enum built_in_function fcode = builtin_mathfn_code (arg);
8510 if ((func == mpfr_exp
8511 && (fcode == BUILT_IN_LOG
8512 || fcode == BUILT_IN_LOGF
8513 || fcode == BUILT_IN_LOGL))
8514 || (func == mpfr_exp2
8515 && (fcode == BUILT_IN_LOG2
8516 || fcode == BUILT_IN_LOG2F
8517 || fcode == BUILT_IN_LOG2L))
8518 || (func == mpfr_exp10
8519 && (fcode == BUILT_IN_LOG10
8520 || fcode == BUILT_IN_LOG10F
8521 || fcode == BUILT_IN_LOG10L)))
8522 return fold_convert_loc (loc, type, CALL_EXPR_ARG (arg, 0));
8529 /* Return true if VAR is a VAR_DECL or a component thereof. */
8532 var_decl_component_p (tree var)
8535 while (handled_component_p (inner))
8536 inner = TREE_OPERAND (inner, 0);
8537 return SSA_VAR_P (inner);
8540 /* Fold function call to builtin memset. Return
8541 NULL_TREE if no simplification can be made. */
8544 fold_builtin_memset (location_t loc, tree dest, tree c, tree len,
8545 tree type, bool ignore)
8547 tree var, ret, etype;
8548 unsigned HOST_WIDE_INT length, cval;
8550 if (! validate_arg (dest, POINTER_TYPE)
8551 || ! validate_arg (c, INTEGER_TYPE)
8552 || ! validate_arg (len, INTEGER_TYPE))
8555 if (! host_integerp (len, 1))
8558 /* If the LEN parameter is zero, return DEST. */
8559 if (integer_zerop (len))
8560 return omit_one_operand_loc (loc, type, dest, c);
8562 if (TREE_CODE (c) != INTEGER_CST || TREE_SIDE_EFFECTS (dest))
8567 if (TREE_CODE (var) != ADDR_EXPR)
8570 var = TREE_OPERAND (var, 0);
8571 if (TREE_THIS_VOLATILE (var))
8574 etype = TREE_TYPE (var);
8575 if (TREE_CODE (etype) == ARRAY_TYPE)
8576 etype = TREE_TYPE (etype);
8578 if (!INTEGRAL_TYPE_P (etype)
8579 && !POINTER_TYPE_P (etype))
8582 if (! var_decl_component_p (var))
8585 length = tree_low_cst (len, 1);
8586 if (GET_MODE_SIZE (TYPE_MODE (etype)) != length
8587 || get_pointer_alignment (dest) / BITS_PER_UNIT < length)
8590 if (length > HOST_BITS_PER_WIDE_INT / BITS_PER_UNIT)
8593 if (integer_zerop (c))
8597 if (CHAR_BIT != 8 || BITS_PER_UNIT != 8 || HOST_BITS_PER_WIDE_INT > 64)
8600 cval = TREE_INT_CST_LOW (c);
8604 cval |= (cval << 31) << 1;
8607 ret = build_int_cst_type (etype, cval);
8608 var = build_fold_indirect_ref_loc (loc,
8609 fold_convert_loc (loc,
8610 build_pointer_type (etype),
8612 ret = build2 (MODIFY_EXPR, etype, var, ret);
8616 return omit_one_operand_loc (loc, type, dest, ret);
8619 /* Fold function call to builtin memset. Return
8620 NULL_TREE if no simplification can be made. */
8623 fold_builtin_bzero (location_t loc, tree dest, tree size, bool ignore)
8625 if (! validate_arg (dest, POINTER_TYPE)
8626 || ! validate_arg (size, INTEGER_TYPE))
8632 /* New argument list transforming bzero(ptr x, int y) to
8633 memset(ptr x, int 0, size_t y). This is done this way
8634 so that if it isn't expanded inline, we fallback to
8635 calling bzero instead of memset. */
8637 return fold_builtin_memset (loc, dest, integer_zero_node,
8638 fold_convert_loc (loc, size_type_node, size),
8639 void_type_node, ignore);
8642 /* Fold function call to builtin mem{{,p}cpy,move}. Return
8643 NULL_TREE if no simplification can be made.
8644 If ENDP is 0, return DEST (like memcpy).
8645 If ENDP is 1, return DEST+LEN (like mempcpy).
8646 If ENDP is 2, return DEST+LEN-1 (like stpcpy).
8647 If ENDP is 3, return DEST, additionally *SRC and *DEST may overlap
8651 fold_builtin_memory_op (location_t loc, tree dest, tree src,
8652 tree len, tree type, bool ignore, int endp)
8654 tree destvar, srcvar, expr;
8656 if (! validate_arg (dest, POINTER_TYPE)
8657 || ! validate_arg (src, POINTER_TYPE)
8658 || ! validate_arg (len, INTEGER_TYPE))
8661 /* If the LEN parameter is zero, return DEST. */
8662 if (integer_zerop (len))
8663 return omit_one_operand_loc (loc, type, dest, src);
8665 /* If SRC and DEST are the same (and not volatile), return
8666 DEST{,+LEN,+LEN-1}. */
8667 if (operand_equal_p (src, dest, 0))
8671 tree srctype, desttype;
8672 unsigned int src_align, dest_align;
8677 src_align = get_pointer_alignment (src);
8678 dest_align = get_pointer_alignment (dest);
8680 /* Both DEST and SRC must be pointer types.
8681 ??? This is what old code did. Is the testing for pointer types
8684 If either SRC is readonly or length is 1, we can use memcpy. */
8685 if (!dest_align || !src_align)
8687 if (readonly_data_expr (src)
8688 || (host_integerp (len, 1)
8689 && (MIN (src_align, dest_align) / BITS_PER_UNIT
8690 >= (unsigned HOST_WIDE_INT) tree_low_cst (len, 1))))
8692 tree fn = builtin_decl_implicit (BUILT_IN_MEMCPY);
8695 return build_call_expr_loc (loc, fn, 3, dest, src, len);
8698 /* If *src and *dest can't overlap, optimize into memcpy as well. */
8699 if (TREE_CODE (src) == ADDR_EXPR
8700 && TREE_CODE (dest) == ADDR_EXPR)
8702 tree src_base, dest_base, fn;
8703 HOST_WIDE_INT src_offset = 0, dest_offset = 0;
8704 HOST_WIDE_INT size = -1;
8705 HOST_WIDE_INT maxsize = -1;
8707 srcvar = TREE_OPERAND (src, 0);
8708 src_base = get_ref_base_and_extent (srcvar, &src_offset,
8710 destvar = TREE_OPERAND (dest, 0);
8711 dest_base = get_ref_base_and_extent (destvar, &dest_offset,
8713 if (host_integerp (len, 1))
8714 maxsize = tree_low_cst (len, 1);
8717 src_offset /= BITS_PER_UNIT;
8718 dest_offset /= BITS_PER_UNIT;
8719 if (SSA_VAR_P (src_base)
8720 && SSA_VAR_P (dest_base))
8722 if (operand_equal_p (src_base, dest_base, 0)
8723 && ranges_overlap_p (src_offset, maxsize,
8724 dest_offset, maxsize))
8727 else if (TREE_CODE (src_base) == MEM_REF
8728 && TREE_CODE (dest_base) == MEM_REF)
8731 if (! operand_equal_p (TREE_OPERAND (src_base, 0),
8732 TREE_OPERAND (dest_base, 0), 0))
8734 off = double_int_add (mem_ref_offset (src_base),
8735 shwi_to_double_int (src_offset));
8736 if (!double_int_fits_in_shwi_p (off))
8738 src_offset = off.low;
8739 off = double_int_add (mem_ref_offset (dest_base),
8740 shwi_to_double_int (dest_offset));
8741 if (!double_int_fits_in_shwi_p (off))
8743 dest_offset = off.low;
8744 if (ranges_overlap_p (src_offset, maxsize,
8745 dest_offset, maxsize))
8751 fn = builtin_decl_implicit (BUILT_IN_MEMCPY);
8754 return build_call_expr_loc (loc, fn, 3, dest, src, len);
8757 /* If the destination and source do not alias optimize into
8759 if ((is_gimple_min_invariant (dest)
8760 || TREE_CODE (dest) == SSA_NAME)
8761 && (is_gimple_min_invariant (src)
8762 || TREE_CODE (src) == SSA_NAME))
8765 ao_ref_init_from_ptr_and_size (&destr, dest, len);
8766 ao_ref_init_from_ptr_and_size (&srcr, src, len);
8767 if (!refs_may_alias_p_1 (&destr, &srcr, false))
8770 fn = builtin_decl_implicit (BUILT_IN_MEMCPY);
8773 return build_call_expr_loc (loc, fn, 3, dest, src, len);
8780 if (!host_integerp (len, 0))
8783 This logic lose for arguments like (type *)malloc (sizeof (type)),
8784 since we strip the casts of up to VOID return value from malloc.
8785 Perhaps we ought to inherit type from non-VOID argument here? */
8788 if (!POINTER_TYPE_P (TREE_TYPE (src))
8789 || !POINTER_TYPE_P (TREE_TYPE (dest)))
8791 /* As we fold (void *)(p + CST) to (void *)p + CST undo this here. */
8792 if (TREE_CODE (src) == POINTER_PLUS_EXPR)
8794 tree tem = TREE_OPERAND (src, 0);
8796 if (tem != TREE_OPERAND (src, 0))
8797 src = build1 (NOP_EXPR, TREE_TYPE (tem), src);
8799 if (TREE_CODE (dest) == POINTER_PLUS_EXPR)
8801 tree tem = TREE_OPERAND (dest, 0);
8803 if (tem != TREE_OPERAND (dest, 0))
8804 dest = build1 (NOP_EXPR, TREE_TYPE (tem), dest);
8806 srctype = TREE_TYPE (TREE_TYPE (src));
8807 if (TREE_CODE (srctype) == ARRAY_TYPE
8808 && !tree_int_cst_equal (TYPE_SIZE_UNIT (srctype), len))
8810 srctype = TREE_TYPE (srctype);
8812 src = build1 (NOP_EXPR, build_pointer_type (srctype), src);
8814 desttype = TREE_TYPE (TREE_TYPE (dest));
8815 if (TREE_CODE (desttype) == ARRAY_TYPE
8816 && !tree_int_cst_equal (TYPE_SIZE_UNIT (desttype), len))
8818 desttype = TREE_TYPE (desttype);
8820 dest = build1 (NOP_EXPR, build_pointer_type (desttype), dest);
8822 if (TREE_ADDRESSABLE (srctype)
8823 || TREE_ADDRESSABLE (desttype))
8826 src_align = get_pointer_alignment (src);
8827 dest_align = get_pointer_alignment (dest);
8828 if (dest_align < TYPE_ALIGN (desttype)
8829 || src_align < TYPE_ALIGN (srctype))
8833 dest = builtin_save_expr (dest);
8835 /* Build accesses at offset zero with a ref-all character type. */
8836 off0 = build_int_cst (build_pointer_type_for_mode (char_type_node,
8837 ptr_mode, true), 0);
8840 STRIP_NOPS (destvar);
8841 if (TREE_CODE (destvar) == ADDR_EXPR
8842 && var_decl_component_p (TREE_OPERAND (destvar, 0))
8843 && tree_int_cst_equal (TYPE_SIZE_UNIT (desttype), len))
8844 destvar = fold_build2 (MEM_REF, desttype, destvar, off0);
8846 destvar = NULL_TREE;
8849 STRIP_NOPS (srcvar);
8850 if (TREE_CODE (srcvar) == ADDR_EXPR
8851 && var_decl_component_p (TREE_OPERAND (srcvar, 0))
8852 && tree_int_cst_equal (TYPE_SIZE_UNIT (srctype), len))
8855 || src_align >= TYPE_ALIGN (desttype))
8856 srcvar = fold_build2 (MEM_REF, destvar ? desttype : srctype,
8858 else if (!STRICT_ALIGNMENT)
8860 srctype = build_aligned_type (TYPE_MAIN_VARIANT (desttype),
8862 srcvar = fold_build2 (MEM_REF, srctype, srcvar, off0);
8870 if (srcvar == NULL_TREE && destvar == NULL_TREE)
8873 if (srcvar == NULL_TREE)
8876 if (src_align >= TYPE_ALIGN (desttype))
8877 srcvar = fold_build2 (MEM_REF, desttype, src, off0);
8880 if (STRICT_ALIGNMENT)
8882 srctype = build_aligned_type (TYPE_MAIN_VARIANT (desttype),
8884 srcvar = fold_build2 (MEM_REF, srctype, src, off0);
8887 else if (destvar == NULL_TREE)
8890 if (dest_align >= TYPE_ALIGN (srctype))
8891 destvar = fold_build2 (MEM_REF, srctype, dest, off0);
8894 if (STRICT_ALIGNMENT)
8896 desttype = build_aligned_type (TYPE_MAIN_VARIANT (srctype),
8898 destvar = fold_build2 (MEM_REF, desttype, dest, off0);
8902 expr = build2 (MODIFY_EXPR, TREE_TYPE (destvar), destvar, srcvar);
8908 if (endp == 0 || endp == 3)
8909 return omit_one_operand_loc (loc, type, dest, expr);
8915 len = fold_build2_loc (loc, MINUS_EXPR, TREE_TYPE (len), len,
8918 dest = fold_build_pointer_plus_loc (loc, dest, len);
8919 dest = fold_convert_loc (loc, type, dest);
8921 dest = omit_one_operand_loc (loc, type, dest, expr);
8925 /* Fold function call to builtin strcpy with arguments DEST and SRC.
8926 If LEN is not NULL, it represents the length of the string to be
8927 copied. Return NULL_TREE if no simplification can be made. */
8930 fold_builtin_strcpy (location_t loc, tree fndecl, tree dest, tree src, tree len)
8934 if (!validate_arg (dest, POINTER_TYPE)
8935 || !validate_arg (src, POINTER_TYPE))
8938 /* If SRC and DEST are the same (and not volatile), return DEST. */
8939 if (operand_equal_p (src, dest, 0))
8940 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest);
8942 if (optimize_function_for_size_p (cfun))
8945 fn = builtin_decl_implicit (BUILT_IN_MEMCPY);
8951 len = c_strlen (src, 1);
8952 if (! len || TREE_SIDE_EFFECTS (len))
8956 len = fold_convert_loc (loc, size_type_node, len);
8957 len = size_binop_loc (loc, PLUS_EXPR, len, build_int_cst (size_type_node, 1));
8958 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)),
8959 build_call_expr_loc (loc, fn, 3, dest, src, len));
8962 /* Fold function call to builtin stpcpy with arguments DEST and SRC.
8963 Return NULL_TREE if no simplification can be made. */
8966 fold_builtin_stpcpy (location_t loc, tree fndecl, tree dest, tree src)
8968 tree fn, len, lenp1, call, type;
8970 if (!validate_arg (dest, POINTER_TYPE)
8971 || !validate_arg (src, POINTER_TYPE))
8974 len = c_strlen (src, 1);
8976 || TREE_CODE (len) != INTEGER_CST)
8979 if (optimize_function_for_size_p (cfun)
8980 /* If length is zero it's small enough. */
8981 && !integer_zerop (len))
8984 fn = builtin_decl_implicit (BUILT_IN_MEMCPY);
8988 lenp1 = size_binop_loc (loc, PLUS_EXPR,
8989 fold_convert_loc (loc, size_type_node, len),
8990 build_int_cst (size_type_node, 1));
8991 /* We use dest twice in building our expression. Save it from
8992 multiple expansions. */
8993 dest = builtin_save_expr (dest);
8994 call = build_call_expr_loc (loc, fn, 3, dest, src, lenp1);
8996 type = TREE_TYPE (TREE_TYPE (fndecl));
8997 dest = fold_build_pointer_plus_loc (loc, dest, len);
8998 dest = fold_convert_loc (loc, type, dest);
8999 dest = omit_one_operand_loc (loc, type, dest, call);
9003 /* Fold function call to builtin strncpy with arguments DEST, SRC, and LEN.
9004 If SLEN is not NULL, it represents the length of the source string.
9005 Return NULL_TREE if no simplification can be made. */
9008 fold_builtin_strncpy (location_t loc, tree fndecl, tree dest,
9009 tree src, tree len, tree slen)
9013 if (!validate_arg (dest, POINTER_TYPE)
9014 || !validate_arg (src, POINTER_TYPE)
9015 || !validate_arg (len, INTEGER_TYPE))
9018 /* If the LEN parameter is zero, return DEST. */
9019 if (integer_zerop (len))
9020 return omit_one_operand_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest, src);
9022 /* We can't compare slen with len as constants below if len is not a
9024 if (len == 0 || TREE_CODE (len) != INTEGER_CST)
9028 slen = c_strlen (src, 1);
9030 /* Now, we must be passed a constant src ptr parameter. */
9031 if (slen == 0 || TREE_CODE (slen) != INTEGER_CST)
9034 slen = size_binop_loc (loc, PLUS_EXPR, slen, ssize_int (1));
9036 /* We do not support simplification of this case, though we do
9037 support it when expanding trees into RTL. */
9038 /* FIXME: generate a call to __builtin_memset. */
9039 if (tree_int_cst_lt (slen, len))
9042 /* OK transform into builtin memcpy. */
9043 fn = builtin_decl_implicit (BUILT_IN_MEMCPY);
9047 len = fold_convert_loc (loc, size_type_node, len);
9048 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)),
9049 build_call_expr_loc (loc, fn, 3, dest, src, len));
9052 /* Fold function call to builtin memchr. ARG1, ARG2 and LEN are the
9053 arguments to the call, and TYPE is its return type.
9054 Return NULL_TREE if no simplification can be made. */
9057 fold_builtin_memchr (location_t loc, tree arg1, tree arg2, tree len, tree type)
9059 if (!validate_arg (arg1, POINTER_TYPE)
9060 || !validate_arg (arg2, INTEGER_TYPE)
9061 || !validate_arg (len, INTEGER_TYPE))
9067 if (TREE_CODE (arg2) != INTEGER_CST
9068 || !host_integerp (len, 1))
9071 p1 = c_getstr (arg1);
9072 if (p1 && compare_tree_int (len, strlen (p1) + 1) <= 0)
9078 if (target_char_cast (arg2, &c))
9081 r = (const char *) memchr (p1, c, tree_low_cst (len, 1));
9084 return build_int_cst (TREE_TYPE (arg1), 0);
9086 tem = fold_build_pointer_plus_hwi_loc (loc, arg1, r - p1);
9087 return fold_convert_loc (loc, type, tem);
9093 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
9094 Return NULL_TREE if no simplification can be made. */
9097 fold_builtin_memcmp (location_t loc, tree arg1, tree arg2, tree len)
9099 const char *p1, *p2;
9101 if (!validate_arg (arg1, POINTER_TYPE)
9102 || !validate_arg (arg2, POINTER_TYPE)
9103 || !validate_arg (len, INTEGER_TYPE))
9106 /* If the LEN parameter is zero, return zero. */
9107 if (integer_zerop (len))
9108 return omit_two_operands_loc (loc, integer_type_node, integer_zero_node,
9111 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
9112 if (operand_equal_p (arg1, arg2, 0))
9113 return omit_one_operand_loc (loc, integer_type_node, integer_zero_node, len);
9115 p1 = c_getstr (arg1);
9116 p2 = c_getstr (arg2);
9118 /* If all arguments are constant, and the value of len is not greater
9119 than the lengths of arg1 and arg2, evaluate at compile-time. */
9120 if (host_integerp (len, 1) && p1 && p2
9121 && compare_tree_int (len, strlen (p1) + 1) <= 0
9122 && compare_tree_int (len, strlen (p2) + 1) <= 0)
9124 const int r = memcmp (p1, p2, tree_low_cst (len, 1));
9127 return integer_one_node;
9129 return integer_minus_one_node;
9131 return integer_zero_node;
9134 /* If len parameter is one, return an expression corresponding to
9135 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
9136 if (host_integerp (len, 1) && tree_low_cst (len, 1) == 1)
9138 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
9139 tree cst_uchar_ptr_node
9140 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
9143 = fold_convert_loc (loc, integer_type_node,
9144 build1 (INDIRECT_REF, cst_uchar_node,
9145 fold_convert_loc (loc,
9149 = fold_convert_loc (loc, integer_type_node,
9150 build1 (INDIRECT_REF, cst_uchar_node,
9151 fold_convert_loc (loc,
9154 return fold_build2_loc (loc, MINUS_EXPR, integer_type_node, ind1, ind2);
9160 /* Fold function call to builtin strcmp with arguments ARG1 and ARG2.
9161 Return NULL_TREE if no simplification can be made. */
9164 fold_builtin_strcmp (location_t loc, tree arg1, tree arg2)
9166 const char *p1, *p2;
9168 if (!validate_arg (arg1, POINTER_TYPE)
9169 || !validate_arg (arg2, POINTER_TYPE))
9172 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
9173 if (operand_equal_p (arg1, arg2, 0))
9174 return integer_zero_node;
9176 p1 = c_getstr (arg1);
9177 p2 = c_getstr (arg2);
9181 const int i = strcmp (p1, p2);
9183 return integer_minus_one_node;
9185 return integer_one_node;
9187 return integer_zero_node;
9190 /* If the second arg is "", return *(const unsigned char*)arg1. */
9191 if (p2 && *p2 == '\0')
9193 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
9194 tree cst_uchar_ptr_node
9195 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
9197 return fold_convert_loc (loc, integer_type_node,
9198 build1 (INDIRECT_REF, cst_uchar_node,
9199 fold_convert_loc (loc,
9204 /* If the first arg is "", return -*(const unsigned char*)arg2. */
9205 if (p1 && *p1 == '\0')
9207 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
9208 tree cst_uchar_ptr_node
9209 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
9212 = fold_convert_loc (loc, integer_type_node,
9213 build1 (INDIRECT_REF, cst_uchar_node,
9214 fold_convert_loc (loc,
9217 return fold_build1_loc (loc, NEGATE_EXPR, integer_type_node, temp);
9223 /* Fold function call to builtin strncmp with arguments ARG1, ARG2, and LEN.
9224 Return NULL_TREE if no simplification can be made. */
9227 fold_builtin_strncmp (location_t loc, tree arg1, tree arg2, tree len)
9229 const char *p1, *p2;
9231 if (!validate_arg (arg1, POINTER_TYPE)
9232 || !validate_arg (arg2, POINTER_TYPE)
9233 || !validate_arg (len, INTEGER_TYPE))
9236 /* If the LEN parameter is zero, return zero. */
9237 if (integer_zerop (len))
9238 return omit_two_operands_loc (loc, integer_type_node, integer_zero_node,
9241 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
9242 if (operand_equal_p (arg1, arg2, 0))
9243 return omit_one_operand_loc (loc, integer_type_node, integer_zero_node, len);
9245 p1 = c_getstr (arg1);
9246 p2 = c_getstr (arg2);
9248 if (host_integerp (len, 1) && p1 && p2)
9250 const int i = strncmp (p1, p2, tree_low_cst (len, 1));
9252 return integer_one_node;
9254 return integer_minus_one_node;
9256 return integer_zero_node;
9259 /* If the second arg is "", and the length is greater than zero,
9260 return *(const unsigned char*)arg1. */
9261 if (p2 && *p2 == '\0'
9262 && TREE_CODE (len) == INTEGER_CST
9263 && tree_int_cst_sgn (len) == 1)
9265 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
9266 tree cst_uchar_ptr_node
9267 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
9269 return fold_convert_loc (loc, integer_type_node,
9270 build1 (INDIRECT_REF, cst_uchar_node,
9271 fold_convert_loc (loc,
9276 /* If the first arg is "", and the length is greater than zero,
9277 return -*(const unsigned char*)arg2. */
9278 if (p1 && *p1 == '\0'
9279 && TREE_CODE (len) == INTEGER_CST
9280 && tree_int_cst_sgn (len) == 1)
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 tree temp = fold_convert_loc (loc, integer_type_node,
9287 build1 (INDIRECT_REF, cst_uchar_node,
9288 fold_convert_loc (loc,
9291 return fold_build1_loc (loc, NEGATE_EXPR, integer_type_node, temp);
9294 /* If len parameter is one, return an expression corresponding to
9295 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
9296 if (host_integerp (len, 1) && tree_low_cst (len, 1) == 1)
9298 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
9299 tree cst_uchar_ptr_node
9300 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
9302 tree ind1 = fold_convert_loc (loc, integer_type_node,
9303 build1 (INDIRECT_REF, cst_uchar_node,
9304 fold_convert_loc (loc,
9307 tree ind2 = fold_convert_loc (loc, integer_type_node,
9308 build1 (INDIRECT_REF, cst_uchar_node,
9309 fold_convert_loc (loc,
9312 return fold_build2_loc (loc, MINUS_EXPR, integer_type_node, ind1, ind2);
9318 /* Fold function call to builtin signbit, signbitf or signbitl with argument
9319 ARG. Return NULL_TREE if no simplification can be made. */
9322 fold_builtin_signbit (location_t loc, tree arg, tree type)
9324 if (!validate_arg (arg, REAL_TYPE))
9327 /* If ARG is a compile-time constant, determine the result. */
9328 if (TREE_CODE (arg) == REAL_CST
9329 && !TREE_OVERFLOW (arg))
9333 c = TREE_REAL_CST (arg);
9334 return (REAL_VALUE_NEGATIVE (c)
9335 ? build_one_cst (type)
9336 : build_zero_cst (type));
9339 /* If ARG is non-negative, the result is always zero. */
9340 if (tree_expr_nonnegative_p (arg))
9341 return omit_one_operand_loc (loc, type, integer_zero_node, arg);
9343 /* If ARG's format doesn't have signed zeros, return "arg < 0.0". */
9344 if (!HONOR_SIGNED_ZEROS (TYPE_MODE (TREE_TYPE (arg))))
9345 return fold_convert (type,
9346 fold_build2_loc (loc, LT_EXPR, boolean_type_node, arg,
9347 build_real (TREE_TYPE (arg), dconst0)));
9352 /* Fold function call to builtin copysign, copysignf or copysignl with
9353 arguments ARG1 and ARG2. Return NULL_TREE if no simplification can
9357 fold_builtin_copysign (location_t loc, tree fndecl,
9358 tree arg1, tree arg2, tree type)
9362 if (!validate_arg (arg1, REAL_TYPE)
9363 || !validate_arg (arg2, REAL_TYPE))
9366 /* copysign(X,X) is X. */
9367 if (operand_equal_p (arg1, arg2, 0))
9368 return fold_convert_loc (loc, type, arg1);
9370 /* If ARG1 and ARG2 are compile-time constants, determine the result. */
9371 if (TREE_CODE (arg1) == REAL_CST
9372 && TREE_CODE (arg2) == REAL_CST
9373 && !TREE_OVERFLOW (arg1)
9374 && !TREE_OVERFLOW (arg2))
9376 REAL_VALUE_TYPE c1, c2;
9378 c1 = TREE_REAL_CST (arg1);
9379 c2 = TREE_REAL_CST (arg2);
9380 /* c1.sign := c2.sign. */
9381 real_copysign (&c1, &c2);
9382 return build_real (type, c1);
9385 /* copysign(X, Y) is fabs(X) when Y is always non-negative.
9386 Remember to evaluate Y for side-effects. */
9387 if (tree_expr_nonnegative_p (arg2))
9388 return omit_one_operand_loc (loc, type,
9389 fold_build1_loc (loc, ABS_EXPR, type, arg1),
9392 /* Strip sign changing operations for the first argument. */
9393 tem = fold_strip_sign_ops (arg1);
9395 return build_call_expr_loc (loc, fndecl, 2, tem, arg2);
9400 /* Fold a call to builtin isascii with argument ARG. */
9403 fold_builtin_isascii (location_t loc, tree arg)
9405 if (!validate_arg (arg, INTEGER_TYPE))
9409 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
9410 arg = fold_build2 (BIT_AND_EXPR, integer_type_node, arg,
9411 build_int_cst (integer_type_node,
9412 ~ (unsigned HOST_WIDE_INT) 0x7f));
9413 return fold_build2_loc (loc, EQ_EXPR, integer_type_node,
9414 arg, integer_zero_node);
9418 /* Fold a call to builtin toascii with argument ARG. */
9421 fold_builtin_toascii (location_t loc, tree arg)
9423 if (!validate_arg (arg, INTEGER_TYPE))
9426 /* Transform toascii(c) -> (c & 0x7f). */
9427 return fold_build2_loc (loc, BIT_AND_EXPR, integer_type_node, arg,
9428 build_int_cst (integer_type_node, 0x7f));
9431 /* Fold a call to builtin isdigit with argument ARG. */
9434 fold_builtin_isdigit (location_t loc, tree arg)
9436 if (!validate_arg (arg, INTEGER_TYPE))
9440 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
9441 /* According to the C standard, isdigit is unaffected by locale.
9442 However, it definitely is affected by the target character set. */
9443 unsigned HOST_WIDE_INT target_digit0
9444 = lang_hooks.to_target_charset ('0');
9446 if (target_digit0 == 0)
9449 arg = fold_convert_loc (loc, unsigned_type_node, arg);
9450 arg = fold_build2 (MINUS_EXPR, unsigned_type_node, arg,
9451 build_int_cst (unsigned_type_node, target_digit0));
9452 return fold_build2_loc (loc, LE_EXPR, integer_type_node, arg,
9453 build_int_cst (unsigned_type_node, 9));
9457 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
9460 fold_builtin_fabs (location_t loc, tree arg, tree type)
9462 if (!validate_arg (arg, REAL_TYPE))
9465 arg = fold_convert_loc (loc, type, arg);
9466 if (TREE_CODE (arg) == REAL_CST)
9467 return fold_abs_const (arg, type);
9468 return fold_build1_loc (loc, ABS_EXPR, type, arg);
9471 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
9474 fold_builtin_abs (location_t loc, tree arg, tree type)
9476 if (!validate_arg (arg, INTEGER_TYPE))
9479 arg = fold_convert_loc (loc, type, arg);
9480 if (TREE_CODE (arg) == INTEGER_CST)
9481 return fold_abs_const (arg, type);
9482 return fold_build1_loc (loc, ABS_EXPR, type, arg);
9485 /* Fold a fma operation with arguments ARG[012]. */
9488 fold_fma (location_t loc ATTRIBUTE_UNUSED,
9489 tree type, tree arg0, tree arg1, tree arg2)
9491 if (TREE_CODE (arg0) == REAL_CST
9492 && TREE_CODE (arg1) == REAL_CST
9493 && TREE_CODE (arg2) == REAL_CST)
9494 return do_mpfr_arg3 (arg0, arg1, arg2, type, mpfr_fma);
9499 /* Fold a call to fma, fmaf, or fmal with arguments ARG[012]. */
9502 fold_builtin_fma (location_t loc, tree arg0, tree arg1, tree arg2, tree type)
9504 if (validate_arg (arg0, REAL_TYPE)
9505 && validate_arg(arg1, REAL_TYPE)
9506 && validate_arg(arg2, REAL_TYPE))
9508 tree tem = fold_fma (loc, type, arg0, arg1, arg2);
9512 /* ??? Only expand to FMA_EXPR if it's directly supported. */
9513 if (optab_handler (fma_optab, TYPE_MODE (type)) != CODE_FOR_nothing)
9514 return fold_build3_loc (loc, FMA_EXPR, type, arg0, arg1, arg2);
9519 /* Fold a call to builtin fmin or fmax. */
9522 fold_builtin_fmin_fmax (location_t loc, tree arg0, tree arg1,
9523 tree type, bool max)
9525 if (validate_arg (arg0, REAL_TYPE) && validate_arg (arg1, REAL_TYPE))
9527 /* Calculate the result when the argument is a constant. */
9528 tree res = do_mpfr_arg2 (arg0, arg1, type, (max ? mpfr_max : mpfr_min));
9533 /* If either argument is NaN, return the other one. Avoid the
9534 transformation if we get (and honor) a signalling NaN. Using
9535 omit_one_operand() ensures we create a non-lvalue. */
9536 if (TREE_CODE (arg0) == REAL_CST
9537 && real_isnan (&TREE_REAL_CST (arg0))
9538 && (! HONOR_SNANS (TYPE_MODE (TREE_TYPE (arg0)))
9539 || ! TREE_REAL_CST (arg0).signalling))
9540 return omit_one_operand_loc (loc, type, arg1, arg0);
9541 if (TREE_CODE (arg1) == REAL_CST
9542 && real_isnan (&TREE_REAL_CST (arg1))
9543 && (! HONOR_SNANS (TYPE_MODE (TREE_TYPE (arg1)))
9544 || ! TREE_REAL_CST (arg1).signalling))
9545 return omit_one_operand_loc (loc, type, arg0, arg1);
9547 /* Transform fmin/fmax(x,x) -> x. */
9548 if (operand_equal_p (arg0, arg1, OEP_PURE_SAME))
9549 return omit_one_operand_loc (loc, type, arg0, arg1);
9551 /* Convert fmin/fmax to MIN_EXPR/MAX_EXPR. C99 requires these
9552 functions to return the numeric arg if the other one is NaN.
9553 These tree codes don't honor that, so only transform if
9554 -ffinite-math-only is set. C99 doesn't require -0.0 to be
9555 handled, so we don't have to worry about it either. */
9556 if (flag_finite_math_only)
9557 return fold_build2_loc (loc, (max ? MAX_EXPR : MIN_EXPR), type,
9558 fold_convert_loc (loc, type, arg0),
9559 fold_convert_loc (loc, type, arg1));
9564 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
9567 fold_builtin_carg (location_t loc, tree arg, tree type)
9569 if (validate_arg (arg, COMPLEX_TYPE)
9570 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) == REAL_TYPE)
9572 tree atan2_fn = mathfn_built_in (type, BUILT_IN_ATAN2);
9576 tree new_arg = builtin_save_expr (arg);
9577 tree r_arg = fold_build1_loc (loc, REALPART_EXPR, type, new_arg);
9578 tree i_arg = fold_build1_loc (loc, IMAGPART_EXPR, type, new_arg);
9579 return build_call_expr_loc (loc, atan2_fn, 2, i_arg, r_arg);
9586 /* Fold a call to builtin logb/ilogb. */
9589 fold_builtin_logb (location_t loc, tree arg, tree rettype)
9591 if (! validate_arg (arg, REAL_TYPE))
9596 if (TREE_CODE (arg) == REAL_CST && ! TREE_OVERFLOW (arg))
9598 const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (arg);
9604 /* If arg is Inf or NaN and we're logb, return it. */
9605 if (TREE_CODE (rettype) == REAL_TYPE)
9606 return fold_convert_loc (loc, rettype, arg);
9607 /* Fall through... */
9609 /* Zero may set errno and/or raise an exception for logb, also
9610 for ilogb we don't know FP_ILOGB0. */
9613 /* For normal numbers, proceed iff radix == 2. In GCC,
9614 normalized significands are in the range [0.5, 1.0). We
9615 want the exponent as if they were [1.0, 2.0) so get the
9616 exponent and subtract 1. */
9617 if (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (arg)))->b == 2)
9618 return fold_convert_loc (loc, rettype,
9619 build_int_cst (integer_type_node,
9620 REAL_EXP (value)-1));
9628 /* Fold a call to builtin significand, if radix == 2. */
9631 fold_builtin_significand (location_t loc, tree arg, tree rettype)
9633 if (! validate_arg (arg, REAL_TYPE))
9638 if (TREE_CODE (arg) == REAL_CST && ! TREE_OVERFLOW (arg))
9640 const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (arg);
9647 /* If arg is +-0, +-Inf or +-NaN, then return it. */
9648 return fold_convert_loc (loc, rettype, arg);
9650 /* For normal numbers, proceed iff radix == 2. */
9651 if (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (arg)))->b == 2)
9653 REAL_VALUE_TYPE result = *value;
9654 /* In GCC, normalized significands are in the range [0.5,
9655 1.0). We want them to be [1.0, 2.0) so set the
9657 SET_REAL_EXP (&result, 1);
9658 return build_real (rettype, result);
9667 /* Fold a call to builtin frexp, we can assume the base is 2. */
9670 fold_builtin_frexp (location_t loc, tree arg0, tree arg1, tree rettype)
9672 if (! validate_arg (arg0, REAL_TYPE) || ! validate_arg (arg1, POINTER_TYPE))
9677 if (!(TREE_CODE (arg0) == REAL_CST && ! TREE_OVERFLOW (arg0)))
9680 arg1 = build_fold_indirect_ref_loc (loc, arg1);
9682 /* Proceed if a valid pointer type was passed in. */
9683 if (TYPE_MAIN_VARIANT (TREE_TYPE (arg1)) == integer_type_node)
9685 const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (arg0);
9691 /* For +-0, return (*exp = 0, +-0). */
9692 exp = integer_zero_node;
9697 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
9698 return omit_one_operand_loc (loc, rettype, arg0, arg1);
9701 /* Since the frexp function always expects base 2, and in
9702 GCC normalized significands are already in the range
9703 [0.5, 1.0), we have exactly what frexp wants. */
9704 REAL_VALUE_TYPE frac_rvt = *value;
9705 SET_REAL_EXP (&frac_rvt, 0);
9706 frac = build_real (rettype, frac_rvt);
9707 exp = build_int_cst (integer_type_node, REAL_EXP (value));
9714 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
9715 arg1 = fold_build2_loc (loc, MODIFY_EXPR, rettype, arg1, exp);
9716 TREE_SIDE_EFFECTS (arg1) = 1;
9717 return fold_build2_loc (loc, COMPOUND_EXPR, rettype, arg1, frac);
9723 /* Fold a call to builtin ldexp or scalbn/scalbln. If LDEXP is true
9724 then we can assume the base is two. If it's false, then we have to
9725 check the mode of the TYPE parameter in certain cases. */
9728 fold_builtin_load_exponent (location_t loc, tree arg0, tree arg1,
9729 tree type, bool ldexp)
9731 if (validate_arg (arg0, REAL_TYPE) && validate_arg (arg1, INTEGER_TYPE))
9736 /* If arg0 is 0, Inf or NaN, or if arg1 is 0, then return arg0. */
9737 if (real_zerop (arg0) || integer_zerop (arg1)
9738 || (TREE_CODE (arg0) == REAL_CST
9739 && !real_isfinite (&TREE_REAL_CST (arg0))))
9740 return omit_one_operand_loc (loc, type, arg0, arg1);
9742 /* If both arguments are constant, then try to evaluate it. */
9743 if ((ldexp || REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2)
9744 && TREE_CODE (arg0) == REAL_CST && !TREE_OVERFLOW (arg0)
9745 && host_integerp (arg1, 0))
9747 /* Bound the maximum adjustment to twice the range of the
9748 mode's valid exponents. Use abs to ensure the range is
9749 positive as a sanity check. */
9750 const long max_exp_adj = 2 *
9751 labs (REAL_MODE_FORMAT (TYPE_MODE (type))->emax
9752 - REAL_MODE_FORMAT (TYPE_MODE (type))->emin);
9754 /* Get the user-requested adjustment. */
9755 const HOST_WIDE_INT req_exp_adj = tree_low_cst (arg1, 0);
9757 /* The requested adjustment must be inside this range. This
9758 is a preliminary cap to avoid things like overflow, we
9759 may still fail to compute the result for other reasons. */
9760 if (-max_exp_adj < req_exp_adj && req_exp_adj < max_exp_adj)
9762 REAL_VALUE_TYPE initial_result;
9764 real_ldexp (&initial_result, &TREE_REAL_CST (arg0), req_exp_adj);
9766 /* Ensure we didn't overflow. */
9767 if (! real_isinf (&initial_result))
9769 const REAL_VALUE_TYPE trunc_result
9770 = real_value_truncate (TYPE_MODE (type), initial_result);
9772 /* Only proceed if the target mode can hold the
9774 if (REAL_VALUES_EQUAL (initial_result, trunc_result))
9775 return build_real (type, trunc_result);
9784 /* Fold a call to builtin modf. */
9787 fold_builtin_modf (location_t loc, tree arg0, tree arg1, tree rettype)
9789 if (! validate_arg (arg0, REAL_TYPE) || ! validate_arg (arg1, POINTER_TYPE))
9794 if (!(TREE_CODE (arg0) == REAL_CST && ! TREE_OVERFLOW (arg0)))
9797 arg1 = build_fold_indirect_ref_loc (loc, arg1);
9799 /* Proceed if a valid pointer type was passed in. */
9800 if (TYPE_MAIN_VARIANT (TREE_TYPE (arg1)) == TYPE_MAIN_VARIANT (rettype))
9802 const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (arg0);
9803 REAL_VALUE_TYPE trunc, frac;
9809 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
9810 trunc = frac = *value;
9813 /* For +-Inf, return (*arg1 = arg0, +-0). */
9815 frac.sign = value->sign;
9819 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
9820 real_trunc (&trunc, VOIDmode, value);
9821 real_arithmetic (&frac, MINUS_EXPR, value, &trunc);
9822 /* If the original number was negative and already
9823 integral, then the fractional part is -0.0. */
9824 if (value->sign && frac.cl == rvc_zero)
9825 frac.sign = value->sign;
9829 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
9830 arg1 = fold_build2_loc (loc, MODIFY_EXPR, rettype, arg1,
9831 build_real (rettype, trunc));
9832 TREE_SIDE_EFFECTS (arg1) = 1;
9833 return fold_build2_loc (loc, COMPOUND_EXPR, rettype, arg1,
9834 build_real (rettype, frac));
9840 /* Given a location LOC, an interclass builtin function decl FNDECL
9841 and its single argument ARG, return an folded expression computing
9842 the same, or NULL_TREE if we either couldn't or didn't want to fold
9843 (the latter happen if there's an RTL instruction available). */
9846 fold_builtin_interclass_mathfn (location_t loc, tree fndecl, tree arg)
9848 enum machine_mode mode;
9850 if (!validate_arg (arg, REAL_TYPE))
9853 if (interclass_mathfn_icode (arg, fndecl) != CODE_FOR_nothing)
9856 mode = TYPE_MODE (TREE_TYPE (arg));
9858 /* If there is no optab, try generic code. */
9859 switch (DECL_FUNCTION_CODE (fndecl))
9863 CASE_FLT_FN (BUILT_IN_ISINF):
9865 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
9866 tree const isgr_fn = builtin_decl_explicit (BUILT_IN_ISGREATER);
9867 tree const type = TREE_TYPE (arg);
9871 get_max_float (REAL_MODE_FORMAT (mode), buf, sizeof (buf));
9872 real_from_string (&r, buf);
9873 result = build_call_expr (isgr_fn, 2,
9874 fold_build1_loc (loc, ABS_EXPR, type, arg),
9875 build_real (type, r));
9878 CASE_FLT_FN (BUILT_IN_FINITE):
9879 case BUILT_IN_ISFINITE:
9881 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
9882 tree const isle_fn = builtin_decl_explicit (BUILT_IN_ISLESSEQUAL);
9883 tree const type = TREE_TYPE (arg);
9887 get_max_float (REAL_MODE_FORMAT (mode), buf, sizeof (buf));
9888 real_from_string (&r, buf);
9889 result = build_call_expr (isle_fn, 2,
9890 fold_build1_loc (loc, ABS_EXPR, type, arg),
9891 build_real (type, r));
9892 /*result = fold_build2_loc (loc, UNGT_EXPR,
9893 TREE_TYPE (TREE_TYPE (fndecl)),
9894 fold_build1_loc (loc, ABS_EXPR, type, arg),
9895 build_real (type, r));
9896 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
9897 TREE_TYPE (TREE_TYPE (fndecl)),
9901 case BUILT_IN_ISNORMAL:
9903 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
9904 islessequal(fabs(x),DBL_MAX). */
9905 tree const isle_fn = builtin_decl_explicit (BUILT_IN_ISLESSEQUAL);
9906 tree const isge_fn = builtin_decl_explicit (BUILT_IN_ISGREATEREQUAL);
9907 tree const type = TREE_TYPE (arg);
9908 REAL_VALUE_TYPE rmax, rmin;
9911 get_max_float (REAL_MODE_FORMAT (mode), buf, sizeof (buf));
9912 real_from_string (&rmax, buf);
9913 sprintf (buf, "0x1p%d", REAL_MODE_FORMAT (mode)->emin - 1);
9914 real_from_string (&rmin, buf);
9915 arg = builtin_save_expr (fold_build1_loc (loc, ABS_EXPR, type, arg));
9916 result = build_call_expr (isle_fn, 2, arg,
9917 build_real (type, rmax));
9918 result = fold_build2 (BIT_AND_EXPR, integer_type_node, result,
9919 build_call_expr (isge_fn, 2, arg,
9920 build_real (type, rmin)));
9930 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
9931 ARG is the argument for the call. */
9934 fold_builtin_classify (location_t loc, tree fndecl, tree arg, int builtin_index)
9936 tree type = TREE_TYPE (TREE_TYPE (fndecl));
9939 if (!validate_arg (arg, REAL_TYPE))
9942 switch (builtin_index)
9944 case BUILT_IN_ISINF:
9945 if (!HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (arg))))
9946 return omit_one_operand_loc (loc, type, integer_zero_node, arg);
9948 if (TREE_CODE (arg) == REAL_CST)
9950 r = TREE_REAL_CST (arg);
9951 if (real_isinf (&r))
9952 return real_compare (GT_EXPR, &r, &dconst0)
9953 ? integer_one_node : integer_minus_one_node;
9955 return integer_zero_node;
9960 case BUILT_IN_ISINF_SIGN:
9962 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
9963 /* In a boolean context, GCC will fold the inner COND_EXPR to
9964 1. So e.g. "if (isinf_sign(x))" would be folded to just
9965 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
9966 tree signbit_fn = mathfn_built_in_1 (TREE_TYPE (arg), BUILT_IN_SIGNBIT, 0);
9967 tree isinf_fn = builtin_decl_explicit (BUILT_IN_ISINF);
9968 tree tmp = NULL_TREE;
9970 arg = builtin_save_expr (arg);
9972 if (signbit_fn && isinf_fn)
9974 tree signbit_call = build_call_expr_loc (loc, signbit_fn, 1, arg);
9975 tree isinf_call = build_call_expr_loc (loc, isinf_fn, 1, arg);
9977 signbit_call = fold_build2_loc (loc, NE_EXPR, integer_type_node,
9978 signbit_call, integer_zero_node);
9979 isinf_call = fold_build2_loc (loc, NE_EXPR, integer_type_node,
9980 isinf_call, integer_zero_node);
9982 tmp = fold_build3_loc (loc, COND_EXPR, integer_type_node, signbit_call,
9983 integer_minus_one_node, integer_one_node);
9984 tmp = fold_build3_loc (loc, COND_EXPR, integer_type_node,
9992 case BUILT_IN_ISFINITE:
9993 if (!HONOR_NANS (TYPE_MODE (TREE_TYPE (arg)))
9994 && !HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (arg))))
9995 return omit_one_operand_loc (loc, type, integer_one_node, arg);
9997 if (TREE_CODE (arg) == REAL_CST)
9999 r = TREE_REAL_CST (arg);
10000 return real_isfinite (&r) ? integer_one_node : integer_zero_node;
10005 case BUILT_IN_ISNAN:
10006 if (!HONOR_NANS (TYPE_MODE (TREE_TYPE (arg))))
10007 return omit_one_operand_loc (loc, type, integer_zero_node, arg);
10009 if (TREE_CODE (arg) == REAL_CST)
10011 r = TREE_REAL_CST (arg);
10012 return real_isnan (&r) ? integer_one_node : integer_zero_node;
10015 arg = builtin_save_expr (arg);
10016 return fold_build2_loc (loc, UNORDERED_EXPR, type, arg, arg);
10019 gcc_unreachable ();
10023 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
10024 This builtin will generate code to return the appropriate floating
10025 point classification depending on the value of the floating point
10026 number passed in. The possible return values must be supplied as
10027 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
10028 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
10029 one floating point argument which is "type generic". */
10032 fold_builtin_fpclassify (location_t loc, tree exp)
10034 tree fp_nan, fp_infinite, fp_normal, fp_subnormal, fp_zero,
10035 arg, type, res, tmp;
10036 enum machine_mode mode;
10040 /* Verify the required arguments in the original call. */
10041 if (!validate_arglist (exp, INTEGER_TYPE, INTEGER_TYPE,
10042 INTEGER_TYPE, INTEGER_TYPE,
10043 INTEGER_TYPE, REAL_TYPE, VOID_TYPE))
10046 fp_nan = CALL_EXPR_ARG (exp, 0);
10047 fp_infinite = CALL_EXPR_ARG (exp, 1);
10048 fp_normal = CALL_EXPR_ARG (exp, 2);
10049 fp_subnormal = CALL_EXPR_ARG (exp, 3);
10050 fp_zero = CALL_EXPR_ARG (exp, 4);
10051 arg = CALL_EXPR_ARG (exp, 5);
10052 type = TREE_TYPE (arg);
10053 mode = TYPE_MODE (type);
10054 arg = builtin_save_expr (fold_build1_loc (loc, ABS_EXPR, type, arg));
10056 /* fpclassify(x) ->
10057 isnan(x) ? FP_NAN :
10058 (fabs(x) == Inf ? FP_INFINITE :
10059 (fabs(x) >= DBL_MIN ? FP_NORMAL :
10060 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
10062 tmp = fold_build2_loc (loc, EQ_EXPR, integer_type_node, arg,
10063 build_real (type, dconst0));
10064 res = fold_build3_loc (loc, COND_EXPR, integer_type_node,
10065 tmp, fp_zero, fp_subnormal);
10067 sprintf (buf, "0x1p%d", REAL_MODE_FORMAT (mode)->emin - 1);
10068 real_from_string (&r, buf);
10069 tmp = fold_build2_loc (loc, GE_EXPR, integer_type_node,
10070 arg, build_real (type, r));
10071 res = fold_build3_loc (loc, COND_EXPR, integer_type_node, tmp, fp_normal, res);
10073 if (HONOR_INFINITIES (mode))
10076 tmp = fold_build2_loc (loc, EQ_EXPR, integer_type_node, arg,
10077 build_real (type, r));
10078 res = fold_build3_loc (loc, COND_EXPR, integer_type_node, tmp,
10082 if (HONOR_NANS (mode))
10084 tmp = fold_build2_loc (loc, ORDERED_EXPR, integer_type_node, arg, arg);
10085 res = fold_build3_loc (loc, COND_EXPR, integer_type_node, tmp, res, fp_nan);
10091 /* Fold a call to an unordered comparison function such as
10092 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
10093 being called and ARG0 and ARG1 are the arguments for the call.
10094 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
10095 the opposite of the desired result. UNORDERED_CODE is used
10096 for modes that can hold NaNs and ORDERED_CODE is used for
10100 fold_builtin_unordered_cmp (location_t loc, tree fndecl, tree arg0, tree arg1,
10101 enum tree_code unordered_code,
10102 enum tree_code ordered_code)
10104 tree type = TREE_TYPE (TREE_TYPE (fndecl));
10105 enum tree_code code;
10107 enum tree_code code0, code1;
10108 tree cmp_type = NULL_TREE;
10110 type0 = TREE_TYPE (arg0);
10111 type1 = TREE_TYPE (arg1);
10113 code0 = TREE_CODE (type0);
10114 code1 = TREE_CODE (type1);
10116 if (code0 == REAL_TYPE && code1 == REAL_TYPE)
10117 /* Choose the wider of two real types. */
10118 cmp_type = TYPE_PRECISION (type0) >= TYPE_PRECISION (type1)
10120 else if (code0 == REAL_TYPE && code1 == INTEGER_TYPE)
10122 else if (code0 == INTEGER_TYPE && code1 == REAL_TYPE)
10125 arg0 = fold_convert_loc (loc, cmp_type, arg0);
10126 arg1 = fold_convert_loc (loc, cmp_type, arg1);
10128 if (unordered_code == UNORDERED_EXPR)
10130 if (!HONOR_NANS (TYPE_MODE (TREE_TYPE (arg0))))
10131 return omit_two_operands_loc (loc, type, integer_zero_node, arg0, arg1);
10132 return fold_build2_loc (loc, UNORDERED_EXPR, type, arg0, arg1);
10135 code = HONOR_NANS (TYPE_MODE (TREE_TYPE (arg0))) ? unordered_code
10137 return fold_build1_loc (loc, TRUTH_NOT_EXPR, type,
10138 fold_build2_loc (loc, code, type, arg0, arg1));
10141 /* Fold a call to built-in function FNDECL with 0 arguments.
10142 IGNORE is true if the result of the function call is ignored. This
10143 function returns NULL_TREE if no simplification was possible. */
10146 fold_builtin_0 (location_t loc, tree fndecl, bool ignore ATTRIBUTE_UNUSED)
10148 tree type = TREE_TYPE (TREE_TYPE (fndecl));
10149 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
10152 CASE_FLT_FN (BUILT_IN_INF):
10153 case BUILT_IN_INFD32:
10154 case BUILT_IN_INFD64:
10155 case BUILT_IN_INFD128:
10156 return fold_builtin_inf (loc, type, true);
10158 CASE_FLT_FN (BUILT_IN_HUGE_VAL):
10159 return fold_builtin_inf (loc, type, false);
10161 case BUILT_IN_CLASSIFY_TYPE:
10162 return fold_builtin_classify_type (NULL_TREE);
10170 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
10171 IGNORE is true if the result of the function call is ignored. This
10172 function returns NULL_TREE if no simplification was possible. */
10175 fold_builtin_1 (location_t loc, tree fndecl, tree arg0, bool ignore)
10177 tree type = TREE_TYPE (TREE_TYPE (fndecl));
10178 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
10181 case BUILT_IN_CONSTANT_P:
10183 tree val = fold_builtin_constant_p (arg0);
10185 /* Gimplification will pull the CALL_EXPR for the builtin out of
10186 an if condition. When not optimizing, we'll not CSE it back.
10187 To avoid link error types of regressions, return false now. */
10188 if (!val && !optimize)
10189 val = integer_zero_node;
10194 case BUILT_IN_CLASSIFY_TYPE:
10195 return fold_builtin_classify_type (arg0);
10197 case BUILT_IN_STRLEN:
10198 return fold_builtin_strlen (loc, type, arg0);
10200 CASE_FLT_FN (BUILT_IN_FABS):
10201 return fold_builtin_fabs (loc, arg0, type);
10204 case BUILT_IN_LABS:
10205 case BUILT_IN_LLABS:
10206 case BUILT_IN_IMAXABS:
10207 return fold_builtin_abs (loc, arg0, type);
10209 CASE_FLT_FN (BUILT_IN_CONJ):
10210 if (validate_arg (arg0, COMPLEX_TYPE)
10211 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10212 return fold_build1_loc (loc, CONJ_EXPR, type, arg0);
10215 CASE_FLT_FN (BUILT_IN_CREAL):
10216 if (validate_arg (arg0, COMPLEX_TYPE)
10217 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10218 return non_lvalue_loc (loc, fold_build1_loc (loc, REALPART_EXPR, type, arg0));;
10221 CASE_FLT_FN (BUILT_IN_CIMAG):
10222 if (validate_arg (arg0, COMPLEX_TYPE)
10223 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10224 return non_lvalue_loc (loc, fold_build1_loc (loc, IMAGPART_EXPR, type, arg0));
10227 CASE_FLT_FN (BUILT_IN_CCOS):
10228 return fold_builtin_ccos(loc, arg0, type, fndecl, /*hyper=*/ false);
10230 CASE_FLT_FN (BUILT_IN_CCOSH):
10231 return fold_builtin_ccos(loc, arg0, type, fndecl, /*hyper=*/ true);
10233 CASE_FLT_FN (BUILT_IN_CPROJ):
10234 return fold_builtin_cproj(loc, arg0, type);
10236 CASE_FLT_FN (BUILT_IN_CSIN):
10237 if (validate_arg (arg0, COMPLEX_TYPE)
10238 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10239 return do_mpc_arg1 (arg0, type, mpc_sin);
10242 CASE_FLT_FN (BUILT_IN_CSINH):
10243 if (validate_arg (arg0, COMPLEX_TYPE)
10244 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10245 return do_mpc_arg1 (arg0, type, mpc_sinh);
10248 CASE_FLT_FN (BUILT_IN_CTAN):
10249 if (validate_arg (arg0, COMPLEX_TYPE)
10250 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10251 return do_mpc_arg1 (arg0, type, mpc_tan);
10254 CASE_FLT_FN (BUILT_IN_CTANH):
10255 if (validate_arg (arg0, COMPLEX_TYPE)
10256 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10257 return do_mpc_arg1 (arg0, type, mpc_tanh);
10260 CASE_FLT_FN (BUILT_IN_CLOG):
10261 if (validate_arg (arg0, COMPLEX_TYPE)
10262 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10263 return do_mpc_arg1 (arg0, type, mpc_log);
10266 CASE_FLT_FN (BUILT_IN_CSQRT):
10267 if (validate_arg (arg0, COMPLEX_TYPE)
10268 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10269 return do_mpc_arg1 (arg0, type, mpc_sqrt);
10272 CASE_FLT_FN (BUILT_IN_CASIN):
10273 if (validate_arg (arg0, COMPLEX_TYPE)
10274 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10275 return do_mpc_arg1 (arg0, type, mpc_asin);
10278 CASE_FLT_FN (BUILT_IN_CACOS):
10279 if (validate_arg (arg0, COMPLEX_TYPE)
10280 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10281 return do_mpc_arg1 (arg0, type, mpc_acos);
10284 CASE_FLT_FN (BUILT_IN_CATAN):
10285 if (validate_arg (arg0, COMPLEX_TYPE)
10286 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10287 return do_mpc_arg1 (arg0, type, mpc_atan);
10290 CASE_FLT_FN (BUILT_IN_CASINH):
10291 if (validate_arg (arg0, COMPLEX_TYPE)
10292 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10293 return do_mpc_arg1 (arg0, type, mpc_asinh);
10296 CASE_FLT_FN (BUILT_IN_CACOSH):
10297 if (validate_arg (arg0, COMPLEX_TYPE)
10298 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10299 return do_mpc_arg1 (arg0, type, mpc_acosh);
10302 CASE_FLT_FN (BUILT_IN_CATANH):
10303 if (validate_arg (arg0, COMPLEX_TYPE)
10304 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10305 return do_mpc_arg1 (arg0, type, mpc_atanh);
10308 CASE_FLT_FN (BUILT_IN_CABS):
10309 return fold_builtin_cabs (loc, arg0, type, fndecl);
10311 CASE_FLT_FN (BUILT_IN_CARG):
10312 return fold_builtin_carg (loc, arg0, type);
10314 CASE_FLT_FN (BUILT_IN_SQRT):
10315 return fold_builtin_sqrt (loc, arg0, type);
10317 CASE_FLT_FN (BUILT_IN_CBRT):
10318 return fold_builtin_cbrt (loc, arg0, type);
10320 CASE_FLT_FN (BUILT_IN_ASIN):
10321 if (validate_arg (arg0, REAL_TYPE))
10322 return do_mpfr_arg1 (arg0, type, mpfr_asin,
10323 &dconstm1, &dconst1, true);
10326 CASE_FLT_FN (BUILT_IN_ACOS):
10327 if (validate_arg (arg0, REAL_TYPE))
10328 return do_mpfr_arg1 (arg0, type, mpfr_acos,
10329 &dconstm1, &dconst1, true);
10332 CASE_FLT_FN (BUILT_IN_ATAN):
10333 if (validate_arg (arg0, REAL_TYPE))
10334 return do_mpfr_arg1 (arg0, type, mpfr_atan, NULL, NULL, 0);
10337 CASE_FLT_FN (BUILT_IN_ASINH):
10338 if (validate_arg (arg0, REAL_TYPE))
10339 return do_mpfr_arg1 (arg0, type, mpfr_asinh, NULL, NULL, 0);
10342 CASE_FLT_FN (BUILT_IN_ACOSH):
10343 if (validate_arg (arg0, REAL_TYPE))
10344 return do_mpfr_arg1 (arg0, type, mpfr_acosh,
10345 &dconst1, NULL, true);
10348 CASE_FLT_FN (BUILT_IN_ATANH):
10349 if (validate_arg (arg0, REAL_TYPE))
10350 return do_mpfr_arg1 (arg0, type, mpfr_atanh,
10351 &dconstm1, &dconst1, false);
10354 CASE_FLT_FN (BUILT_IN_SIN):
10355 if (validate_arg (arg0, REAL_TYPE))
10356 return do_mpfr_arg1 (arg0, type, mpfr_sin, NULL, NULL, 0);
10359 CASE_FLT_FN (BUILT_IN_COS):
10360 return fold_builtin_cos (loc, arg0, type, fndecl);
10362 CASE_FLT_FN (BUILT_IN_TAN):
10363 return fold_builtin_tan (arg0, type);
10365 CASE_FLT_FN (BUILT_IN_CEXP):
10366 return fold_builtin_cexp (loc, arg0, type);
10368 CASE_FLT_FN (BUILT_IN_CEXPI):
10369 if (validate_arg (arg0, REAL_TYPE))
10370 return do_mpfr_sincos (arg0, NULL_TREE, NULL_TREE);
10373 CASE_FLT_FN (BUILT_IN_SINH):
10374 if (validate_arg (arg0, REAL_TYPE))
10375 return do_mpfr_arg1 (arg0, type, mpfr_sinh, NULL, NULL, 0);
10378 CASE_FLT_FN (BUILT_IN_COSH):
10379 return fold_builtin_cosh (loc, arg0, type, fndecl);
10381 CASE_FLT_FN (BUILT_IN_TANH):
10382 if (validate_arg (arg0, REAL_TYPE))
10383 return do_mpfr_arg1 (arg0, type, mpfr_tanh, NULL, NULL, 0);
10386 CASE_FLT_FN (BUILT_IN_ERF):
10387 if (validate_arg (arg0, REAL_TYPE))
10388 return do_mpfr_arg1 (arg0, type, mpfr_erf, NULL, NULL, 0);
10391 CASE_FLT_FN (BUILT_IN_ERFC):
10392 if (validate_arg (arg0, REAL_TYPE))
10393 return do_mpfr_arg1 (arg0, type, mpfr_erfc, NULL, NULL, 0);
10396 CASE_FLT_FN (BUILT_IN_TGAMMA):
10397 if (validate_arg (arg0, REAL_TYPE))
10398 return do_mpfr_arg1 (arg0, type, mpfr_gamma, NULL, NULL, 0);
10401 CASE_FLT_FN (BUILT_IN_EXP):
10402 return fold_builtin_exponent (loc, fndecl, arg0, mpfr_exp);
10404 CASE_FLT_FN (BUILT_IN_EXP2):
10405 return fold_builtin_exponent (loc, fndecl, arg0, mpfr_exp2);
10407 CASE_FLT_FN (BUILT_IN_EXP10):
10408 CASE_FLT_FN (BUILT_IN_POW10):
10409 return fold_builtin_exponent (loc, fndecl, arg0, mpfr_exp10);
10411 CASE_FLT_FN (BUILT_IN_EXPM1):
10412 if (validate_arg (arg0, REAL_TYPE))
10413 return do_mpfr_arg1 (arg0, type, mpfr_expm1, NULL, NULL, 0);
10416 CASE_FLT_FN (BUILT_IN_LOG):
10417 return fold_builtin_logarithm (loc, fndecl, arg0, mpfr_log);
10419 CASE_FLT_FN (BUILT_IN_LOG2):
10420 return fold_builtin_logarithm (loc, fndecl, arg0, mpfr_log2);
10422 CASE_FLT_FN (BUILT_IN_LOG10):
10423 return fold_builtin_logarithm (loc, fndecl, arg0, mpfr_log10);
10425 CASE_FLT_FN (BUILT_IN_LOG1P):
10426 if (validate_arg (arg0, REAL_TYPE))
10427 return do_mpfr_arg1 (arg0, type, mpfr_log1p,
10428 &dconstm1, NULL, false);
10431 CASE_FLT_FN (BUILT_IN_J0):
10432 if (validate_arg (arg0, REAL_TYPE))
10433 return do_mpfr_arg1 (arg0, type, mpfr_j0,
10437 CASE_FLT_FN (BUILT_IN_J1):
10438 if (validate_arg (arg0, REAL_TYPE))
10439 return do_mpfr_arg1 (arg0, type, mpfr_j1,
10443 CASE_FLT_FN (BUILT_IN_Y0):
10444 if (validate_arg (arg0, REAL_TYPE))
10445 return do_mpfr_arg1 (arg0, type, mpfr_y0,
10446 &dconst0, NULL, false);
10449 CASE_FLT_FN (BUILT_IN_Y1):
10450 if (validate_arg (arg0, REAL_TYPE))
10451 return do_mpfr_arg1 (arg0, type, mpfr_y1,
10452 &dconst0, NULL, false);
10455 CASE_FLT_FN (BUILT_IN_NAN):
10456 case BUILT_IN_NAND32:
10457 case BUILT_IN_NAND64:
10458 case BUILT_IN_NAND128:
10459 return fold_builtin_nan (arg0, type, true);
10461 CASE_FLT_FN (BUILT_IN_NANS):
10462 return fold_builtin_nan (arg0, type, false);
10464 CASE_FLT_FN (BUILT_IN_FLOOR):
10465 return fold_builtin_floor (loc, fndecl, arg0);
10467 CASE_FLT_FN (BUILT_IN_CEIL):
10468 return fold_builtin_ceil (loc, fndecl, arg0);
10470 CASE_FLT_FN (BUILT_IN_TRUNC):
10471 return fold_builtin_trunc (loc, fndecl, arg0);
10473 CASE_FLT_FN (BUILT_IN_ROUND):
10474 return fold_builtin_round (loc, fndecl, arg0);
10476 CASE_FLT_FN (BUILT_IN_NEARBYINT):
10477 CASE_FLT_FN (BUILT_IN_RINT):
10478 return fold_trunc_transparent_mathfn (loc, fndecl, arg0);
10480 CASE_FLT_FN (BUILT_IN_ICEIL):
10481 CASE_FLT_FN (BUILT_IN_LCEIL):
10482 CASE_FLT_FN (BUILT_IN_LLCEIL):
10483 CASE_FLT_FN (BUILT_IN_LFLOOR):
10484 CASE_FLT_FN (BUILT_IN_IFLOOR):
10485 CASE_FLT_FN (BUILT_IN_LLFLOOR):
10486 CASE_FLT_FN (BUILT_IN_IROUND):
10487 CASE_FLT_FN (BUILT_IN_LROUND):
10488 CASE_FLT_FN (BUILT_IN_LLROUND):
10489 return fold_builtin_int_roundingfn (loc, fndecl, arg0);
10491 CASE_FLT_FN (BUILT_IN_IRINT):
10492 CASE_FLT_FN (BUILT_IN_LRINT):
10493 CASE_FLT_FN (BUILT_IN_LLRINT):
10494 return fold_fixed_mathfn (loc, fndecl, arg0);
10496 case BUILT_IN_BSWAP32:
10497 case BUILT_IN_BSWAP64:
10498 return fold_builtin_bswap (fndecl, arg0);
10500 CASE_INT_FN (BUILT_IN_FFS):
10501 CASE_INT_FN (BUILT_IN_CLZ):
10502 CASE_INT_FN (BUILT_IN_CTZ):
10503 CASE_INT_FN (BUILT_IN_CLRSB):
10504 CASE_INT_FN (BUILT_IN_POPCOUNT):
10505 CASE_INT_FN (BUILT_IN_PARITY):
10506 return fold_builtin_bitop (fndecl, arg0);
10508 CASE_FLT_FN (BUILT_IN_SIGNBIT):
10509 return fold_builtin_signbit (loc, arg0, type);
10511 CASE_FLT_FN (BUILT_IN_SIGNIFICAND):
10512 return fold_builtin_significand (loc, arg0, type);
10514 CASE_FLT_FN (BUILT_IN_ILOGB):
10515 CASE_FLT_FN (BUILT_IN_LOGB):
10516 return fold_builtin_logb (loc, arg0, type);
10518 case BUILT_IN_ISASCII:
10519 return fold_builtin_isascii (loc, arg0);
10521 case BUILT_IN_TOASCII:
10522 return fold_builtin_toascii (loc, arg0);
10524 case BUILT_IN_ISDIGIT:
10525 return fold_builtin_isdigit (loc, arg0);
10527 CASE_FLT_FN (BUILT_IN_FINITE):
10528 case BUILT_IN_FINITED32:
10529 case BUILT_IN_FINITED64:
10530 case BUILT_IN_FINITED128:
10531 case BUILT_IN_ISFINITE:
10533 tree ret = fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISFINITE);
10536 return fold_builtin_interclass_mathfn (loc, fndecl, arg0);
10539 CASE_FLT_FN (BUILT_IN_ISINF):
10540 case BUILT_IN_ISINFD32:
10541 case BUILT_IN_ISINFD64:
10542 case BUILT_IN_ISINFD128:
10544 tree ret = fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISINF);
10547 return fold_builtin_interclass_mathfn (loc, fndecl, arg0);
10550 case BUILT_IN_ISNORMAL:
10551 return fold_builtin_interclass_mathfn (loc, fndecl, arg0);
10553 case BUILT_IN_ISINF_SIGN:
10554 return fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISINF_SIGN);
10556 CASE_FLT_FN (BUILT_IN_ISNAN):
10557 case BUILT_IN_ISNAND32:
10558 case BUILT_IN_ISNAND64:
10559 case BUILT_IN_ISNAND128:
10560 return fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISNAN);
10562 case BUILT_IN_PRINTF:
10563 case BUILT_IN_PRINTF_UNLOCKED:
10564 case BUILT_IN_VPRINTF:
10565 return fold_builtin_printf (loc, fndecl, arg0, NULL_TREE, ignore, fcode);
10567 case BUILT_IN_FREE:
10568 if (integer_zerop (arg0))
10569 return build_empty_stmt (loc);
10580 /* Fold a call to built-in function FNDECL with 2 arguments, ARG0 and ARG1.
10581 IGNORE is true if the result of the function call is ignored. This
10582 function returns NULL_TREE if no simplification was possible. */
10585 fold_builtin_2 (location_t loc, tree fndecl, tree arg0, tree arg1, bool ignore)
10587 tree type = TREE_TYPE (TREE_TYPE (fndecl));
10588 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
10592 CASE_FLT_FN (BUILT_IN_JN):
10593 if (validate_arg (arg0, INTEGER_TYPE)
10594 && validate_arg (arg1, REAL_TYPE))
10595 return do_mpfr_bessel_n (arg0, arg1, type, mpfr_jn, NULL, 0);
10598 CASE_FLT_FN (BUILT_IN_YN):
10599 if (validate_arg (arg0, INTEGER_TYPE)
10600 && validate_arg (arg1, REAL_TYPE))
10601 return do_mpfr_bessel_n (arg0, arg1, type, mpfr_yn,
10605 CASE_FLT_FN (BUILT_IN_DREM):
10606 CASE_FLT_FN (BUILT_IN_REMAINDER):
10607 if (validate_arg (arg0, REAL_TYPE)
10608 && validate_arg(arg1, REAL_TYPE))
10609 return do_mpfr_arg2 (arg0, arg1, type, mpfr_remainder);
10612 CASE_FLT_FN_REENT (BUILT_IN_GAMMA): /* GAMMA_R */
10613 CASE_FLT_FN_REENT (BUILT_IN_LGAMMA): /* LGAMMA_R */
10614 if (validate_arg (arg0, REAL_TYPE)
10615 && validate_arg(arg1, POINTER_TYPE))
10616 return do_mpfr_lgamma_r (arg0, arg1, type);
10619 CASE_FLT_FN (BUILT_IN_ATAN2):
10620 if (validate_arg (arg0, REAL_TYPE)
10621 && validate_arg(arg1, REAL_TYPE))
10622 return do_mpfr_arg2 (arg0, arg1, type, mpfr_atan2);
10625 CASE_FLT_FN (BUILT_IN_FDIM):
10626 if (validate_arg (arg0, REAL_TYPE)
10627 && validate_arg(arg1, REAL_TYPE))
10628 return do_mpfr_arg2 (arg0, arg1, type, mpfr_dim);
10631 CASE_FLT_FN (BUILT_IN_HYPOT):
10632 return fold_builtin_hypot (loc, fndecl, arg0, arg1, type);
10634 CASE_FLT_FN (BUILT_IN_CPOW):
10635 if (validate_arg (arg0, COMPLEX_TYPE)
10636 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE
10637 && validate_arg (arg1, COMPLEX_TYPE)
10638 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg1))) == REAL_TYPE)
10639 return do_mpc_arg2 (arg0, arg1, type, /*do_nonfinite=*/ 0, mpc_pow);
10642 CASE_FLT_FN (BUILT_IN_LDEXP):
10643 return fold_builtin_load_exponent (loc, arg0, arg1, type, /*ldexp=*/true);
10644 CASE_FLT_FN (BUILT_IN_SCALBN):
10645 CASE_FLT_FN (BUILT_IN_SCALBLN):
10646 return fold_builtin_load_exponent (loc, arg0, arg1,
10647 type, /*ldexp=*/false);
10649 CASE_FLT_FN (BUILT_IN_FREXP):
10650 return fold_builtin_frexp (loc, arg0, arg1, type);
10652 CASE_FLT_FN (BUILT_IN_MODF):
10653 return fold_builtin_modf (loc, arg0, arg1, type);
10655 case BUILT_IN_BZERO:
10656 return fold_builtin_bzero (loc, arg0, arg1, ignore);
10658 case BUILT_IN_FPUTS:
10659 return fold_builtin_fputs (loc, arg0, arg1, ignore, false, NULL_TREE);
10661 case BUILT_IN_FPUTS_UNLOCKED:
10662 return fold_builtin_fputs (loc, arg0, arg1, ignore, true, NULL_TREE);
10664 case BUILT_IN_STRSTR:
10665 return fold_builtin_strstr (loc, arg0, arg1, type);
10667 case BUILT_IN_STRCAT:
10668 return fold_builtin_strcat (loc, arg0, arg1);
10670 case BUILT_IN_STRSPN:
10671 return fold_builtin_strspn (loc, arg0, arg1);
10673 case BUILT_IN_STRCSPN:
10674 return fold_builtin_strcspn (loc, arg0, arg1);
10676 case BUILT_IN_STRCHR:
10677 case BUILT_IN_INDEX:
10678 return fold_builtin_strchr (loc, arg0, arg1, type);
10680 case BUILT_IN_STRRCHR:
10681 case BUILT_IN_RINDEX:
10682 return fold_builtin_strrchr (loc, arg0, arg1, type);
10684 case BUILT_IN_STRCPY:
10685 return fold_builtin_strcpy (loc, fndecl, arg0, arg1, NULL_TREE);
10687 case BUILT_IN_STPCPY:
10690 tree fn = builtin_decl_implicit (BUILT_IN_STRCPY);
10694 return build_call_expr_loc (loc, fn, 2, arg0, arg1);
10697 return fold_builtin_stpcpy (loc, fndecl, arg0, arg1);
10700 case BUILT_IN_STRCMP:
10701 return fold_builtin_strcmp (loc, arg0, arg1);
10703 case BUILT_IN_STRPBRK:
10704 return fold_builtin_strpbrk (loc, arg0, arg1, type);
10706 case BUILT_IN_EXPECT:
10707 return fold_builtin_expect (loc, arg0, arg1);
10709 CASE_FLT_FN (BUILT_IN_POW):
10710 return fold_builtin_pow (loc, fndecl, arg0, arg1, type);
10712 CASE_FLT_FN (BUILT_IN_POWI):
10713 return fold_builtin_powi (loc, fndecl, arg0, arg1, type);
10715 CASE_FLT_FN (BUILT_IN_COPYSIGN):
10716 return fold_builtin_copysign (loc, fndecl, arg0, arg1, type);
10718 CASE_FLT_FN (BUILT_IN_FMIN):
10719 return fold_builtin_fmin_fmax (loc, arg0, arg1, type, /*max=*/false);
10721 CASE_FLT_FN (BUILT_IN_FMAX):
10722 return fold_builtin_fmin_fmax (loc, arg0, arg1, type, /*max=*/true);
10724 case BUILT_IN_ISGREATER:
10725 return fold_builtin_unordered_cmp (loc, fndecl,
10726 arg0, arg1, UNLE_EXPR, LE_EXPR);
10727 case BUILT_IN_ISGREATEREQUAL:
10728 return fold_builtin_unordered_cmp (loc, fndecl,
10729 arg0, arg1, UNLT_EXPR, LT_EXPR);
10730 case BUILT_IN_ISLESS:
10731 return fold_builtin_unordered_cmp (loc, fndecl,
10732 arg0, arg1, UNGE_EXPR, GE_EXPR);
10733 case BUILT_IN_ISLESSEQUAL:
10734 return fold_builtin_unordered_cmp (loc, fndecl,
10735 arg0, arg1, UNGT_EXPR, GT_EXPR);
10736 case BUILT_IN_ISLESSGREATER:
10737 return fold_builtin_unordered_cmp (loc, fndecl,
10738 arg0, arg1, UNEQ_EXPR, EQ_EXPR);
10739 case BUILT_IN_ISUNORDERED:
10740 return fold_builtin_unordered_cmp (loc, fndecl,
10741 arg0, arg1, UNORDERED_EXPR,
10744 /* We do the folding for va_start in the expander. */
10745 case BUILT_IN_VA_START:
10748 case BUILT_IN_SPRINTF:
10749 return fold_builtin_sprintf (loc, arg0, arg1, NULL_TREE, ignore);
10751 case BUILT_IN_OBJECT_SIZE:
10752 return fold_builtin_object_size (arg0, arg1);
10754 case BUILT_IN_PRINTF:
10755 case BUILT_IN_PRINTF_UNLOCKED:
10756 case BUILT_IN_VPRINTF:
10757 return fold_builtin_printf (loc, fndecl, arg0, arg1, ignore, fcode);
10759 case BUILT_IN_PRINTF_CHK:
10760 case BUILT_IN_VPRINTF_CHK:
10761 if (!validate_arg (arg0, INTEGER_TYPE)
10762 || TREE_SIDE_EFFECTS (arg0))
10765 return fold_builtin_printf (loc, fndecl,
10766 arg1, NULL_TREE, ignore, fcode);
10769 case BUILT_IN_FPRINTF:
10770 case BUILT_IN_FPRINTF_UNLOCKED:
10771 case BUILT_IN_VFPRINTF:
10772 return fold_builtin_fprintf (loc, fndecl, arg0, arg1, NULL_TREE,
10775 case BUILT_IN_ATOMIC_ALWAYS_LOCK_FREE:
10776 return fold_builtin_atomic_always_lock_free (arg0, arg1);
10778 case BUILT_IN_ATOMIC_IS_LOCK_FREE:
10779 return fold_builtin_atomic_is_lock_free (arg0, arg1);
10787 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
10788 and ARG2. IGNORE is true if the result of the function call is ignored.
10789 This function returns NULL_TREE if no simplification was possible. */
10792 fold_builtin_3 (location_t loc, tree fndecl,
10793 tree arg0, tree arg1, tree arg2, bool ignore)
10795 tree type = TREE_TYPE (TREE_TYPE (fndecl));
10796 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
10800 CASE_FLT_FN (BUILT_IN_SINCOS):
10801 return fold_builtin_sincos (loc, arg0, arg1, arg2);
10803 CASE_FLT_FN (BUILT_IN_FMA):
10804 return fold_builtin_fma (loc, arg0, arg1, arg2, type);
10807 CASE_FLT_FN (BUILT_IN_REMQUO):
10808 if (validate_arg (arg0, REAL_TYPE)
10809 && validate_arg(arg1, REAL_TYPE)
10810 && validate_arg(arg2, POINTER_TYPE))
10811 return do_mpfr_remquo (arg0, arg1, arg2);
10814 case BUILT_IN_MEMSET:
10815 return fold_builtin_memset (loc, arg0, arg1, arg2, type, ignore);
10817 case BUILT_IN_BCOPY:
10818 return fold_builtin_memory_op (loc, arg1, arg0, arg2,
10819 void_type_node, true, /*endp=*/3);
10821 case BUILT_IN_MEMCPY:
10822 return fold_builtin_memory_op (loc, arg0, arg1, arg2,
10823 type, ignore, /*endp=*/0);
10825 case BUILT_IN_MEMPCPY:
10826 return fold_builtin_memory_op (loc, arg0, arg1, arg2,
10827 type, ignore, /*endp=*/1);
10829 case BUILT_IN_MEMMOVE:
10830 return fold_builtin_memory_op (loc, arg0, arg1, arg2,
10831 type, ignore, /*endp=*/3);
10833 case BUILT_IN_STRNCAT:
10834 return fold_builtin_strncat (loc, arg0, arg1, arg2);
10836 case BUILT_IN_STRNCPY:
10837 return fold_builtin_strncpy (loc, fndecl, arg0, arg1, arg2, NULL_TREE);
10839 case BUILT_IN_STRNCMP:
10840 return fold_builtin_strncmp (loc, arg0, arg1, arg2);
10842 case BUILT_IN_MEMCHR:
10843 return fold_builtin_memchr (loc, arg0, arg1, arg2, type);
10845 case BUILT_IN_BCMP:
10846 case BUILT_IN_MEMCMP:
10847 return fold_builtin_memcmp (loc, arg0, arg1, arg2);;
10849 case BUILT_IN_SPRINTF:
10850 return fold_builtin_sprintf (loc, arg0, arg1, arg2, ignore);
10852 case BUILT_IN_SNPRINTF:
10853 return fold_builtin_snprintf (loc, arg0, arg1, arg2, NULL_TREE, ignore);
10855 case BUILT_IN_STRCPY_CHK:
10856 case BUILT_IN_STPCPY_CHK:
10857 return fold_builtin_stxcpy_chk (loc, fndecl, arg0, arg1, arg2, NULL_TREE,
10860 case BUILT_IN_STRCAT_CHK:
10861 return fold_builtin_strcat_chk (loc, fndecl, arg0, arg1, arg2);
10863 case BUILT_IN_PRINTF_CHK:
10864 case BUILT_IN_VPRINTF_CHK:
10865 if (!validate_arg (arg0, INTEGER_TYPE)
10866 || TREE_SIDE_EFFECTS (arg0))
10869 return fold_builtin_printf (loc, fndecl, arg1, arg2, ignore, fcode);
10872 case BUILT_IN_FPRINTF:
10873 case BUILT_IN_FPRINTF_UNLOCKED:
10874 case BUILT_IN_VFPRINTF:
10875 return fold_builtin_fprintf (loc, fndecl, arg0, arg1, arg2,
10878 case BUILT_IN_FPRINTF_CHK:
10879 case BUILT_IN_VFPRINTF_CHK:
10880 if (!validate_arg (arg1, INTEGER_TYPE)
10881 || TREE_SIDE_EFFECTS (arg1))
10884 return fold_builtin_fprintf (loc, fndecl, arg0, arg2, NULL_TREE,
10893 /* Fold a call to built-in function FNDECL with 4 arguments, ARG0, ARG1,
10894 ARG2, and ARG3. IGNORE is true if the result of the function call is
10895 ignored. This function returns NULL_TREE if no simplification was
10899 fold_builtin_4 (location_t loc, tree fndecl,
10900 tree arg0, tree arg1, tree arg2, tree arg3, bool ignore)
10902 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
10906 case BUILT_IN_MEMCPY_CHK:
10907 case BUILT_IN_MEMPCPY_CHK:
10908 case BUILT_IN_MEMMOVE_CHK:
10909 case BUILT_IN_MEMSET_CHK:
10910 return fold_builtin_memory_chk (loc, fndecl, arg0, arg1, arg2, arg3,
10912 DECL_FUNCTION_CODE (fndecl));
10914 case BUILT_IN_STRNCPY_CHK:
10915 return fold_builtin_strncpy_chk (loc, arg0, arg1, arg2, arg3, NULL_TREE);
10917 case BUILT_IN_STRNCAT_CHK:
10918 return fold_builtin_strncat_chk (loc, fndecl, arg0, arg1, arg2, arg3);
10920 case BUILT_IN_SNPRINTF:
10921 return fold_builtin_snprintf (loc, arg0, arg1, arg2, arg3, ignore);
10923 case BUILT_IN_FPRINTF_CHK:
10924 case BUILT_IN_VFPRINTF_CHK:
10925 if (!validate_arg (arg1, INTEGER_TYPE)
10926 || TREE_SIDE_EFFECTS (arg1))
10929 return fold_builtin_fprintf (loc, fndecl, arg0, arg2, arg3,
10939 /* Fold a call to built-in function FNDECL. ARGS is an array of NARGS
10940 arguments, where NARGS <= 4. IGNORE is true if the result of the
10941 function call is ignored. This function returns NULL_TREE if no
10942 simplification was possible. Note that this only folds builtins with
10943 fixed argument patterns. Foldings that do varargs-to-varargs
10944 transformations, or that match calls with more than 4 arguments,
10945 need to be handled with fold_builtin_varargs instead. */
10947 #define MAX_ARGS_TO_FOLD_BUILTIN 4
10950 fold_builtin_n (location_t loc, tree fndecl, tree *args, int nargs, bool ignore)
10952 tree ret = NULL_TREE;
10957 ret = fold_builtin_0 (loc, fndecl, ignore);
10960 ret = fold_builtin_1 (loc, fndecl, args[0], ignore);
10963 ret = fold_builtin_2 (loc, fndecl, args[0], args[1], ignore);
10966 ret = fold_builtin_3 (loc, fndecl, args[0], args[1], args[2], ignore);
10969 ret = fold_builtin_4 (loc, fndecl, args[0], args[1], args[2], args[3],
10977 ret = build1 (NOP_EXPR, TREE_TYPE (ret), ret);
10978 SET_EXPR_LOCATION (ret, loc);
10979 TREE_NO_WARNING (ret) = 1;
10985 /* Builtins with folding operations that operate on "..." arguments
10986 need special handling; we need to store the arguments in a convenient
10987 data structure before attempting any folding. Fortunately there are
10988 only a few builtins that fall into this category. FNDECL is the
10989 function, EXP is the CALL_EXPR for the call, and IGNORE is true if the
10990 result of the function call is ignored. */
10993 fold_builtin_varargs (location_t loc, tree fndecl, tree exp,
10994 bool ignore ATTRIBUTE_UNUSED)
10996 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
10997 tree ret = NULL_TREE;
11001 case BUILT_IN_SPRINTF_CHK:
11002 case BUILT_IN_VSPRINTF_CHK:
11003 ret = fold_builtin_sprintf_chk (loc, exp, fcode);
11006 case BUILT_IN_SNPRINTF_CHK:
11007 case BUILT_IN_VSNPRINTF_CHK:
11008 ret = fold_builtin_snprintf_chk (loc, exp, NULL_TREE, fcode);
11011 case BUILT_IN_FPCLASSIFY:
11012 ret = fold_builtin_fpclassify (loc, exp);
11020 ret = build1 (NOP_EXPR, TREE_TYPE (ret), ret);
11021 SET_EXPR_LOCATION (ret, loc);
11022 TREE_NO_WARNING (ret) = 1;
11028 /* Return true if FNDECL shouldn't be folded right now.
11029 If a built-in function has an inline attribute always_inline
11030 wrapper, defer folding it after always_inline functions have
11031 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
11032 might not be performed. */
11035 avoid_folding_inline_builtin (tree fndecl)
11037 return (DECL_DECLARED_INLINE_P (fndecl)
11038 && DECL_DISREGARD_INLINE_LIMITS (fndecl)
11040 && !cfun->always_inline_functions_inlined
11041 && lookup_attribute ("always_inline", DECL_ATTRIBUTES (fndecl)));
11044 /* A wrapper function for builtin folding that prevents warnings for
11045 "statement without effect" and the like, caused by removing the
11046 call node earlier than the warning is generated. */
11049 fold_call_expr (location_t loc, tree exp, bool ignore)
11051 tree ret = NULL_TREE;
11052 tree fndecl = get_callee_fndecl (exp);
11054 && TREE_CODE (fndecl) == FUNCTION_DECL
11055 && DECL_BUILT_IN (fndecl)
11056 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
11057 yet. Defer folding until we see all the arguments
11058 (after inlining). */
11059 && !CALL_EXPR_VA_ARG_PACK (exp))
11061 int nargs = call_expr_nargs (exp);
11063 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
11064 instead last argument is __builtin_va_arg_pack (). Defer folding
11065 even in that case, until arguments are finalized. */
11066 if (nargs && TREE_CODE (CALL_EXPR_ARG (exp, nargs - 1)) == CALL_EXPR)
11068 tree fndecl2 = get_callee_fndecl (CALL_EXPR_ARG (exp, nargs - 1));
11070 && TREE_CODE (fndecl2) == FUNCTION_DECL
11071 && DECL_BUILT_IN_CLASS (fndecl2) == BUILT_IN_NORMAL
11072 && DECL_FUNCTION_CODE (fndecl2) == BUILT_IN_VA_ARG_PACK)
11076 if (avoid_folding_inline_builtin (fndecl))
11079 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
11080 return targetm.fold_builtin (fndecl, call_expr_nargs (exp),
11081 CALL_EXPR_ARGP (exp), ignore);
11084 if (nargs <= MAX_ARGS_TO_FOLD_BUILTIN)
11086 tree *args = CALL_EXPR_ARGP (exp);
11087 ret = fold_builtin_n (loc, fndecl, args, nargs, ignore);
11090 ret = fold_builtin_varargs (loc, fndecl, exp, ignore);
11098 /* Conveniently construct a function call expression. FNDECL names the
11099 function to be called and N arguments are passed in the array
11103 build_call_expr_loc_array (location_t loc, tree fndecl, int n, tree *argarray)
11105 tree fntype = TREE_TYPE (fndecl);
11106 tree fn = build1 (ADDR_EXPR, build_pointer_type (fntype), fndecl);
11108 return fold_builtin_call_array (loc, TREE_TYPE (fntype), fn, n, argarray);
11111 /* Conveniently construct a function call expression. FNDECL names the
11112 function to be called and the arguments are passed in the vector
11116 build_call_expr_loc_vec (location_t loc, tree fndecl, VEC(tree,gc) *vec)
11118 return build_call_expr_loc_array (loc, fndecl, VEC_length (tree, vec),
11119 VEC_address (tree, vec));
11123 /* Conveniently construct a function call expression. FNDECL names the
11124 function to be called, N is the number of arguments, and the "..."
11125 parameters are the argument expressions. */
11128 build_call_expr_loc (location_t loc, tree fndecl, int n, ...)
11131 tree *argarray = XALLOCAVEC (tree, n);
11135 for (i = 0; i < n; i++)
11136 argarray[i] = va_arg (ap, tree);
11138 return build_call_expr_loc_array (loc, fndecl, n, argarray);
11141 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
11142 varargs macros aren't supported by all bootstrap compilers. */
11145 build_call_expr (tree fndecl, int n, ...)
11148 tree *argarray = XALLOCAVEC (tree, n);
11152 for (i = 0; i < n; i++)
11153 argarray[i] = va_arg (ap, tree);
11155 return build_call_expr_loc_array (UNKNOWN_LOCATION, fndecl, n, argarray);
11158 /* Construct a CALL_EXPR with type TYPE with FN as the function expression.
11159 N arguments are passed in the array ARGARRAY. */
11162 fold_builtin_call_array (location_t loc, tree type,
11167 tree ret = NULL_TREE;
11170 if (TREE_CODE (fn) == ADDR_EXPR)
11172 tree fndecl = TREE_OPERAND (fn, 0);
11173 if (TREE_CODE (fndecl) == FUNCTION_DECL
11174 && DECL_BUILT_IN (fndecl))
11176 /* If last argument is __builtin_va_arg_pack (), arguments to this
11177 function are not finalized yet. Defer folding until they are. */
11178 if (n && TREE_CODE (argarray[n - 1]) == CALL_EXPR)
11180 tree fndecl2 = get_callee_fndecl (argarray[n - 1]);
11182 && TREE_CODE (fndecl2) == FUNCTION_DECL
11183 && DECL_BUILT_IN_CLASS (fndecl2) == BUILT_IN_NORMAL
11184 && DECL_FUNCTION_CODE (fndecl2) == BUILT_IN_VA_ARG_PACK)
11185 return build_call_array_loc (loc, type, fn, n, argarray);
11187 if (avoid_folding_inline_builtin (fndecl))
11188 return build_call_array_loc (loc, type, fn, n, argarray);
11189 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
11191 ret = targetm.fold_builtin (fndecl, n, argarray, false);
11195 return build_call_array_loc (loc, type, fn, n, argarray);
11197 else if (n <= MAX_ARGS_TO_FOLD_BUILTIN)
11199 /* First try the transformations that don't require consing up
11201 ret = fold_builtin_n (loc, fndecl, argarray, n, false);
11206 /* If we got this far, we need to build an exp. */
11207 exp = build_call_array_loc (loc, type, fn, n, argarray);
11208 ret = fold_builtin_varargs (loc, fndecl, exp, false);
11209 return ret ? ret : exp;
11213 return build_call_array_loc (loc, type, fn, n, argarray);
11216 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
11217 list ARGS along with N new arguments in NEWARGS. SKIP is the number
11218 of arguments in ARGS to be omitted. OLDNARGS is the number of
11219 elements in ARGS. */
11222 rewrite_call_expr_valist (location_t loc, int oldnargs, tree *args,
11223 int skip, tree fndecl, int n, va_list newargs)
11225 int nargs = oldnargs - skip + n;
11232 buffer = XALLOCAVEC (tree, nargs);
11233 for (i = 0; i < n; i++)
11234 buffer[i] = va_arg (newargs, tree);
11235 for (j = skip; j < oldnargs; j++, i++)
11236 buffer[i] = args[j];
11239 buffer = args + skip;
11241 return build_call_expr_loc_array (loc, fndecl, nargs, buffer);
11244 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
11245 list ARGS along with N new arguments specified as the "..."
11246 parameters. SKIP is the number of arguments in ARGS to be omitted.
11247 OLDNARGS is the number of elements in ARGS. */
11250 rewrite_call_expr_array (location_t loc, int oldnargs, tree *args,
11251 int skip, tree fndecl, int n, ...)
11257 t = rewrite_call_expr_valist (loc, oldnargs, args, skip, fndecl, n, ap);
11263 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
11264 along with N new arguments specified as the "..." parameters. SKIP
11265 is the number of arguments in EXP to be omitted. This function is used
11266 to do varargs-to-varargs transformations. */
11269 rewrite_call_expr (location_t loc, tree exp, int skip, tree fndecl, int n, ...)
11275 t = rewrite_call_expr_valist (loc, call_expr_nargs (exp),
11276 CALL_EXPR_ARGP (exp), skip, fndecl, n, ap);
11282 /* Validate a single argument ARG against a tree code CODE representing
11286 validate_arg (const_tree arg, enum tree_code code)
11290 else if (code == POINTER_TYPE)
11291 return POINTER_TYPE_P (TREE_TYPE (arg));
11292 else if (code == INTEGER_TYPE)
11293 return INTEGRAL_TYPE_P (TREE_TYPE (arg));
11294 return code == TREE_CODE (TREE_TYPE (arg));
11297 /* This function validates the types of a function call argument list
11298 against a specified list of tree_codes. If the last specifier is a 0,
11299 that represents an ellipses, otherwise the last specifier must be a
11302 This is the GIMPLE version of validate_arglist. Eventually we want to
11303 completely convert builtins.c to work from GIMPLEs and the tree based
11304 validate_arglist will then be removed. */
11307 validate_gimple_arglist (const_gimple call, ...)
11309 enum tree_code code;
11315 va_start (ap, call);
11320 code = (enum tree_code) va_arg (ap, int);
11324 /* This signifies an ellipses, any further arguments are all ok. */
11328 /* This signifies an endlink, if no arguments remain, return
11329 true, otherwise return false. */
11330 res = (i == gimple_call_num_args (call));
11333 /* If no parameters remain or the parameter's code does not
11334 match the specified code, return false. Otherwise continue
11335 checking any remaining arguments. */
11336 arg = gimple_call_arg (call, i++);
11337 if (!validate_arg (arg, code))
11344 /* We need gotos here since we can only have one VA_CLOSE in a
11352 /* This function validates the types of a function call argument list
11353 against a specified list of tree_codes. If the last specifier is a 0,
11354 that represents an ellipses, otherwise the last specifier must be a
11358 validate_arglist (const_tree callexpr, ...)
11360 enum tree_code code;
11363 const_call_expr_arg_iterator iter;
11366 va_start (ap, callexpr);
11367 init_const_call_expr_arg_iterator (callexpr, &iter);
11371 code = (enum tree_code) va_arg (ap, int);
11375 /* This signifies an ellipses, any further arguments are all ok. */
11379 /* This signifies an endlink, if no arguments remain, return
11380 true, otherwise return false. */
11381 res = !more_const_call_expr_args_p (&iter);
11384 /* If no parameters remain or the parameter's code does not
11385 match the specified code, return false. Otherwise continue
11386 checking any remaining arguments. */
11387 arg = next_const_call_expr_arg (&iter);
11388 if (!validate_arg (arg, code))
11395 /* We need gotos here since we can only have one VA_CLOSE in a
11403 /* Default target-specific builtin expander that does nothing. */
11406 default_expand_builtin (tree exp ATTRIBUTE_UNUSED,
11407 rtx target ATTRIBUTE_UNUSED,
11408 rtx subtarget ATTRIBUTE_UNUSED,
11409 enum machine_mode mode ATTRIBUTE_UNUSED,
11410 int ignore ATTRIBUTE_UNUSED)
11415 /* Returns true is EXP represents data that would potentially reside
11416 in a readonly section. */
11419 readonly_data_expr (tree exp)
11423 if (TREE_CODE (exp) != ADDR_EXPR)
11426 exp = get_base_address (TREE_OPERAND (exp, 0));
11430 /* Make sure we call decl_readonly_section only for trees it
11431 can handle (since it returns true for everything it doesn't
11433 if (TREE_CODE (exp) == STRING_CST
11434 || TREE_CODE (exp) == CONSTRUCTOR
11435 || (TREE_CODE (exp) == VAR_DECL && TREE_STATIC (exp)))
11436 return decl_readonly_section (exp, 0);
11441 /* Simplify a call to the strstr builtin. S1 and S2 are the arguments
11442 to the call, and TYPE is its return type.
11444 Return NULL_TREE if no simplification was possible, otherwise return the
11445 simplified form of the call as a tree.
11447 The simplified form may be a constant or other expression which
11448 computes the same value, but in a more efficient manner (including
11449 calls to other builtin functions).
11451 The call may contain arguments which need to be evaluated, but
11452 which are not useful to determine the result of the call. In
11453 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11454 COMPOUND_EXPR will be an argument which must be evaluated.
11455 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11456 COMPOUND_EXPR in the chain will contain the tree for the simplified
11457 form of the builtin function call. */
11460 fold_builtin_strstr (location_t loc, tree s1, tree s2, tree type)
11462 if (!validate_arg (s1, POINTER_TYPE)
11463 || !validate_arg (s2, POINTER_TYPE))
11468 const char *p1, *p2;
11470 p2 = c_getstr (s2);
11474 p1 = c_getstr (s1);
11477 const char *r = strstr (p1, p2);
11481 return build_int_cst (TREE_TYPE (s1), 0);
11483 /* Return an offset into the constant string argument. */
11484 tem = fold_build_pointer_plus_hwi_loc (loc, s1, r - p1);
11485 return fold_convert_loc (loc, type, tem);
11488 /* The argument is const char *, and the result is char *, so we need
11489 a type conversion here to avoid a warning. */
11491 return fold_convert_loc (loc, type, s1);
11496 fn = builtin_decl_implicit (BUILT_IN_STRCHR);
11500 /* New argument list transforming strstr(s1, s2) to
11501 strchr(s1, s2[0]). */
11502 return build_call_expr_loc (loc, fn, 2, s1,
11503 build_int_cst (integer_type_node, p2[0]));
11507 /* Simplify a call to the strchr builtin. S1 and S2 are the arguments to
11508 the call, and TYPE is its return type.
11510 Return NULL_TREE if no simplification was possible, otherwise return the
11511 simplified form of the call as a tree.
11513 The simplified form may be a constant or other expression which
11514 computes the same value, but in a more efficient manner (including
11515 calls to other builtin functions).
11517 The call may contain arguments which need to be evaluated, but
11518 which are not useful to determine the result of the call. In
11519 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11520 COMPOUND_EXPR will be an argument which must be evaluated.
11521 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11522 COMPOUND_EXPR in the chain will contain the tree for the simplified
11523 form of the builtin function call. */
11526 fold_builtin_strchr (location_t loc, tree s1, tree s2, tree type)
11528 if (!validate_arg (s1, POINTER_TYPE)
11529 || !validate_arg (s2, INTEGER_TYPE))
11535 if (TREE_CODE (s2) != INTEGER_CST)
11538 p1 = c_getstr (s1);
11545 if (target_char_cast (s2, &c))
11548 r = strchr (p1, c);
11551 return build_int_cst (TREE_TYPE (s1), 0);
11553 /* Return an offset into the constant string argument. */
11554 tem = fold_build_pointer_plus_hwi_loc (loc, s1, r - p1);
11555 return fold_convert_loc (loc, type, tem);
11561 /* Simplify a call to the strrchr builtin. S1 and S2 are the arguments to
11562 the call, and TYPE is its return type.
11564 Return NULL_TREE if no simplification was possible, otherwise return the
11565 simplified form of the call as a tree.
11567 The simplified form may be a constant or other expression which
11568 computes the same value, but in a more efficient manner (including
11569 calls to other builtin functions).
11571 The call may contain arguments which need to be evaluated, but
11572 which are not useful to determine the result of the call. In
11573 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11574 COMPOUND_EXPR will be an argument which must be evaluated.
11575 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11576 COMPOUND_EXPR in the chain will contain the tree for the simplified
11577 form of the builtin function call. */
11580 fold_builtin_strrchr (location_t loc, tree s1, tree s2, tree type)
11582 if (!validate_arg (s1, POINTER_TYPE)
11583 || !validate_arg (s2, INTEGER_TYPE))
11590 if (TREE_CODE (s2) != INTEGER_CST)
11593 p1 = c_getstr (s1);
11600 if (target_char_cast (s2, &c))
11603 r = strrchr (p1, c);
11606 return build_int_cst (TREE_TYPE (s1), 0);
11608 /* Return an offset into the constant string argument. */
11609 tem = fold_build_pointer_plus_hwi_loc (loc, s1, r - p1);
11610 return fold_convert_loc (loc, type, tem);
11613 if (! integer_zerop (s2))
11616 fn = builtin_decl_implicit (BUILT_IN_STRCHR);
11620 /* Transform strrchr(s1, '\0') to strchr(s1, '\0'). */
11621 return build_call_expr_loc (loc, fn, 2, s1, s2);
11625 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
11626 to the call, and TYPE is its return type.
11628 Return NULL_TREE if no simplification was possible, otherwise return the
11629 simplified form of the call as a tree.
11631 The simplified form may be a constant or other expression which
11632 computes the same value, but in a more efficient manner (including
11633 calls to other builtin functions).
11635 The call may contain arguments which need to be evaluated, but
11636 which are not useful to determine the result of the call. In
11637 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11638 COMPOUND_EXPR will be an argument which must be evaluated.
11639 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11640 COMPOUND_EXPR in the chain will contain the tree for the simplified
11641 form of the builtin function call. */
11644 fold_builtin_strpbrk (location_t loc, tree s1, tree s2, tree type)
11646 if (!validate_arg (s1, POINTER_TYPE)
11647 || !validate_arg (s2, POINTER_TYPE))
11652 const char *p1, *p2;
11654 p2 = c_getstr (s2);
11658 p1 = c_getstr (s1);
11661 const char *r = strpbrk (p1, p2);
11665 return build_int_cst (TREE_TYPE (s1), 0);
11667 /* Return an offset into the constant string argument. */
11668 tem = fold_build_pointer_plus_hwi_loc (loc, s1, r - p1);
11669 return fold_convert_loc (loc, type, tem);
11673 /* strpbrk(x, "") == NULL.
11674 Evaluate and ignore s1 in case it had side-effects. */
11675 return omit_one_operand_loc (loc, TREE_TYPE (s1), integer_zero_node, s1);
11678 return NULL_TREE; /* Really call strpbrk. */
11680 fn = builtin_decl_implicit (BUILT_IN_STRCHR);
11684 /* New argument list transforming strpbrk(s1, s2) to
11685 strchr(s1, s2[0]). */
11686 return build_call_expr_loc (loc, fn, 2, s1,
11687 build_int_cst (integer_type_node, p2[0]));
11691 /* Simplify a call to the strcat builtin. DST and SRC are the arguments
11694 Return NULL_TREE if no simplification was possible, otherwise return the
11695 simplified form of the call as a tree.
11697 The simplified form may be a constant or other expression which
11698 computes the same value, but in a more efficient manner (including
11699 calls to other builtin functions).
11701 The call may contain arguments which need to be evaluated, but
11702 which are not useful to determine the result of the call. In
11703 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11704 COMPOUND_EXPR will be an argument which must be evaluated.
11705 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11706 COMPOUND_EXPR in the chain will contain the tree for the simplified
11707 form of the builtin function call. */
11710 fold_builtin_strcat (location_t loc ATTRIBUTE_UNUSED, tree dst, tree src)
11712 if (!validate_arg (dst, POINTER_TYPE)
11713 || !validate_arg (src, POINTER_TYPE))
11717 const char *p = c_getstr (src);
11719 /* If the string length is zero, return the dst parameter. */
11720 if (p && *p == '\0')
11723 if (optimize_insn_for_speed_p ())
11725 /* See if we can store by pieces into (dst + strlen(dst)). */
11727 tree strlen_fn = builtin_decl_implicit (BUILT_IN_STRLEN);
11728 tree strcpy_fn = builtin_decl_implicit (BUILT_IN_STRCPY);
11730 if (!strlen_fn || !strcpy_fn)
11733 /* If we don't have a movstr we don't want to emit an strcpy
11734 call. We have to do that if the length of the source string
11735 isn't computable (in that case we can use memcpy probably
11736 later expanding to a sequence of mov instructions). If we
11737 have movstr instructions we can emit strcpy calls. */
11740 tree len = c_strlen (src, 1);
11741 if (! len || TREE_SIDE_EFFECTS (len))
11745 /* Stabilize the argument list. */
11746 dst = builtin_save_expr (dst);
11748 /* Create strlen (dst). */
11749 newdst = build_call_expr_loc (loc, strlen_fn, 1, dst);
11750 /* Create (dst p+ strlen (dst)). */
11752 newdst = fold_build_pointer_plus_loc (loc, dst, newdst);
11753 newdst = builtin_save_expr (newdst);
11755 call = build_call_expr_loc (loc, strcpy_fn, 2, newdst, src);
11756 return build2 (COMPOUND_EXPR, TREE_TYPE (dst), call, dst);
11762 /* Simplify a call to the strncat builtin. DST, SRC, and LEN are the
11763 arguments to the call.
11765 Return NULL_TREE if no simplification was possible, otherwise return the
11766 simplified form of the call as a tree.
11768 The simplified form may be a constant or other expression which
11769 computes the same value, but in a more efficient manner (including
11770 calls to other builtin functions).
11772 The call may contain arguments which need to be evaluated, but
11773 which are not useful to determine the result of the call. In
11774 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11775 COMPOUND_EXPR will be an argument which must be evaluated.
11776 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11777 COMPOUND_EXPR in the chain will contain the tree for the simplified
11778 form of the builtin function call. */
11781 fold_builtin_strncat (location_t loc, tree dst, tree src, tree len)
11783 if (!validate_arg (dst, POINTER_TYPE)
11784 || !validate_arg (src, POINTER_TYPE)
11785 || !validate_arg (len, INTEGER_TYPE))
11789 const char *p = c_getstr (src);
11791 /* If the requested length is zero, or the src parameter string
11792 length is zero, return the dst parameter. */
11793 if (integer_zerop (len) || (p && *p == '\0'))
11794 return omit_two_operands_loc (loc, TREE_TYPE (dst), dst, src, len);
11796 /* If the requested len is greater than or equal to the string
11797 length, call strcat. */
11798 if (TREE_CODE (len) == INTEGER_CST && p
11799 && compare_tree_int (len, strlen (p)) >= 0)
11801 tree fn = builtin_decl_implicit (BUILT_IN_STRCAT);
11803 /* If the replacement _DECL isn't initialized, don't do the
11808 return build_call_expr_loc (loc, fn, 2, dst, src);
11814 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
11817 Return NULL_TREE if no simplification was possible, otherwise return the
11818 simplified form of the call as a tree.
11820 The simplified form may be a constant or other expression which
11821 computes the same value, but in a more efficient manner (including
11822 calls to other builtin functions).
11824 The call may contain arguments which need to be evaluated, but
11825 which are not useful to determine the result of the call. In
11826 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11827 COMPOUND_EXPR will be an argument which must be evaluated.
11828 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11829 COMPOUND_EXPR in the chain will contain the tree for the simplified
11830 form of the builtin function call. */
11833 fold_builtin_strspn (location_t loc, tree s1, tree s2)
11835 if (!validate_arg (s1, POINTER_TYPE)
11836 || !validate_arg (s2, POINTER_TYPE))
11840 const char *p1 = c_getstr (s1), *p2 = c_getstr (s2);
11842 /* If both arguments are constants, evaluate at compile-time. */
11845 const size_t r = strspn (p1, p2);
11846 return size_int (r);
11849 /* If either argument is "", return NULL_TREE. */
11850 if ((p1 && *p1 == '\0') || (p2 && *p2 == '\0'))
11851 /* Evaluate and ignore both arguments in case either one has
11853 return omit_two_operands_loc (loc, size_type_node, size_zero_node,
11859 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
11862 Return NULL_TREE if no simplification was possible, otherwise return the
11863 simplified form of the call as a tree.
11865 The simplified form may be a constant or other expression which
11866 computes the same value, but in a more efficient manner (including
11867 calls to other builtin functions).
11869 The call may contain arguments which need to be evaluated, but
11870 which are not useful to determine the result of the call. In
11871 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11872 COMPOUND_EXPR will be an argument which must be evaluated.
11873 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11874 COMPOUND_EXPR in the chain will contain the tree for the simplified
11875 form of the builtin function call. */
11878 fold_builtin_strcspn (location_t loc, tree s1, tree s2)
11880 if (!validate_arg (s1, POINTER_TYPE)
11881 || !validate_arg (s2, POINTER_TYPE))
11885 const char *p1 = c_getstr (s1), *p2 = c_getstr (s2);
11887 /* If both arguments are constants, evaluate at compile-time. */
11890 const size_t r = strcspn (p1, p2);
11891 return size_int (r);
11894 /* If the first argument is "", return NULL_TREE. */
11895 if (p1 && *p1 == '\0')
11897 /* Evaluate and ignore argument s2 in case it has
11899 return omit_one_operand_loc (loc, size_type_node,
11900 size_zero_node, s2);
11903 /* If the second argument is "", return __builtin_strlen(s1). */
11904 if (p2 && *p2 == '\0')
11906 tree fn = builtin_decl_implicit (BUILT_IN_STRLEN);
11908 /* If the replacement _DECL isn't initialized, don't do the
11913 return build_call_expr_loc (loc, fn, 1, s1);
11919 /* Fold a call to the fputs builtin. ARG0 and ARG1 are the arguments
11920 to the call. IGNORE is true if the value returned
11921 by the builtin will be ignored. UNLOCKED is true is true if this
11922 actually a call to fputs_unlocked. If LEN in non-NULL, it represents
11923 the known length of the string. Return NULL_TREE if no simplification
11927 fold_builtin_fputs (location_t loc, tree arg0, tree arg1,
11928 bool ignore, bool unlocked, tree len)
11930 /* If we're using an unlocked function, assume the other unlocked
11931 functions exist explicitly. */
11932 tree const fn_fputc = (unlocked
11933 ? builtin_decl_explicit (BUILT_IN_FPUTC_UNLOCKED)
11934 : builtin_decl_implicit (BUILT_IN_FPUTC));
11935 tree const fn_fwrite = (unlocked
11936 ? builtin_decl_explicit (BUILT_IN_FWRITE_UNLOCKED)
11937 : builtin_decl_implicit (BUILT_IN_FWRITE));
11939 /* If the return value is used, don't do the transformation. */
11943 /* Verify the arguments in the original call. */
11944 if (!validate_arg (arg0, POINTER_TYPE)
11945 || !validate_arg (arg1, POINTER_TYPE))
11949 len = c_strlen (arg0, 0);
11951 /* Get the length of the string passed to fputs. If the length
11952 can't be determined, punt. */
11954 || TREE_CODE (len) != INTEGER_CST)
11957 switch (compare_tree_int (len, 1))
11959 case -1: /* length is 0, delete the call entirely . */
11960 return omit_one_operand_loc (loc, integer_type_node,
11961 integer_zero_node, arg1);;
11963 case 0: /* length is 1, call fputc. */
11965 const char *p = c_getstr (arg0);
11970 return build_call_expr_loc (loc, fn_fputc, 2,
11972 (integer_type_node, p[0]), arg1);
11978 case 1: /* length is greater than 1, call fwrite. */
11980 /* If optimizing for size keep fputs. */
11981 if (optimize_function_for_size_p (cfun))
11983 /* New argument list transforming fputs(string, stream) to
11984 fwrite(string, 1, len, stream). */
11986 return build_call_expr_loc (loc, fn_fwrite, 4, arg0,
11987 size_one_node, len, arg1);
11992 gcc_unreachable ();
11997 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
11998 produced. False otherwise. This is done so that we don't output the error
11999 or warning twice or three times. */
12002 fold_builtin_next_arg (tree exp, bool va_start_p)
12004 tree fntype = TREE_TYPE (current_function_decl);
12005 int nargs = call_expr_nargs (exp);
12008 if (!stdarg_p (fntype))
12010 error ("%<va_start%> used in function with fixed args");
12016 if (va_start_p && (nargs != 2))
12018 error ("wrong number of arguments to function %<va_start%>");
12021 arg = CALL_EXPR_ARG (exp, 1);
12023 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
12024 when we checked the arguments and if needed issued a warning. */
12029 /* Evidently an out of date version of <stdarg.h>; can't validate
12030 va_start's second argument, but can still work as intended. */
12031 warning (0, "%<__builtin_next_arg%> called without an argument");
12034 else if (nargs > 1)
12036 error ("wrong number of arguments to function %<__builtin_next_arg%>");
12039 arg = CALL_EXPR_ARG (exp, 0);
12042 if (TREE_CODE (arg) == SSA_NAME)
12043 arg = SSA_NAME_VAR (arg);
12045 /* We destructively modify the call to be __builtin_va_start (ap, 0)
12046 or __builtin_next_arg (0) the first time we see it, after checking
12047 the arguments and if needed issuing a warning. */
12048 if (!integer_zerop (arg))
12050 tree last_parm = tree_last (DECL_ARGUMENTS (current_function_decl));
12052 /* Strip off all nops for the sake of the comparison. This
12053 is not quite the same as STRIP_NOPS. It does more.
12054 We must also strip off INDIRECT_EXPR for C++ reference
12056 while (CONVERT_EXPR_P (arg)
12057 || TREE_CODE (arg) == INDIRECT_REF)
12058 arg = TREE_OPERAND (arg, 0);
12059 if (arg != last_parm)
12061 /* FIXME: Sometimes with the tree optimizers we can get the
12062 not the last argument even though the user used the last
12063 argument. We just warn and set the arg to be the last
12064 argument so that we will get wrong-code because of
12066 warning (0, "second parameter of %<va_start%> not last named argument");
12069 /* Undefined by C99 7.15.1.4p4 (va_start):
12070 "If the parameter parmN is declared with the register storage
12071 class, with a function or array type, or with a type that is
12072 not compatible with the type that results after application of
12073 the default argument promotions, the behavior is undefined."
12075 else if (DECL_REGISTER (arg))
12076 warning (0, "undefined behaviour when second parameter of "
12077 "%<va_start%> is declared with %<register%> storage");
12079 /* We want to verify the second parameter just once before the tree
12080 optimizers are run and then avoid keeping it in the tree,
12081 as otherwise we could warn even for correct code like:
12082 void foo (int i, ...)
12083 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
12085 CALL_EXPR_ARG (exp, 1) = integer_zero_node;
12087 CALL_EXPR_ARG (exp, 0) = integer_zero_node;
12093 /* Simplify a call to the sprintf builtin with arguments DEST, FMT, and ORIG.
12094 ORIG may be null if this is a 2-argument call. We don't attempt to
12095 simplify calls with more than 3 arguments.
12097 Return NULL_TREE if no simplification was possible, otherwise return the
12098 simplified form of the call as a tree. If IGNORED is true, it means that
12099 the caller does not use the returned value of the function. */
12102 fold_builtin_sprintf (location_t loc, tree dest, tree fmt,
12103 tree orig, int ignored)
12106 const char *fmt_str = NULL;
12108 /* Verify the required arguments in the original call. We deal with two
12109 types of sprintf() calls: 'sprintf (str, fmt)' and
12110 'sprintf (dest, "%s", orig)'. */
12111 if (!validate_arg (dest, POINTER_TYPE)
12112 || !validate_arg (fmt, POINTER_TYPE))
12114 if (orig && !validate_arg (orig, POINTER_TYPE))
12117 /* Check whether the format is a literal string constant. */
12118 fmt_str = c_getstr (fmt);
12119 if (fmt_str == NULL)
12123 retval = NULL_TREE;
12125 if (!init_target_chars ())
12128 /* If the format doesn't contain % args or %%, use strcpy. */
12129 if (strchr (fmt_str, target_percent) == NULL)
12131 tree fn = builtin_decl_implicit (BUILT_IN_STRCPY);
12136 /* Don't optimize sprintf (buf, "abc", ptr++). */
12140 /* Convert sprintf (str, fmt) into strcpy (str, fmt) when
12141 'format' is known to contain no % formats. */
12142 call = build_call_expr_loc (loc, fn, 2, dest, fmt);
12144 retval = build_int_cst (integer_type_node, strlen (fmt_str));
12147 /* If the format is "%s", use strcpy if the result isn't used. */
12148 else if (fmt_str && strcmp (fmt_str, target_percent_s) == 0)
12151 fn = builtin_decl_implicit (BUILT_IN_STRCPY);
12156 /* Don't crash on sprintf (str1, "%s"). */
12160 /* Convert sprintf (str1, "%s", str2) into strcpy (str1, str2). */
12163 retval = c_strlen (orig, 1);
12164 if (!retval || TREE_CODE (retval) != INTEGER_CST)
12167 call = build_call_expr_loc (loc, fn, 2, dest, orig);
12170 if (call && retval)
12172 retval = fold_convert_loc
12173 (loc, TREE_TYPE (TREE_TYPE (builtin_decl_implicit (BUILT_IN_SPRINTF))),
12175 return build2 (COMPOUND_EXPR, TREE_TYPE (retval), call, retval);
12181 /* Simplify a call to the snprintf builtin with arguments DEST, DESTSIZE,
12182 FMT, and ORIG. ORIG may be null if this is a 3-argument call. We don't
12183 attempt to simplify calls with more than 4 arguments.
12185 Return NULL_TREE if no simplification was possible, otherwise return the
12186 simplified form of the call as a tree. If IGNORED is true, it means that
12187 the caller does not use the returned value of the function. */
12190 fold_builtin_snprintf (location_t loc, tree dest, tree destsize, tree fmt,
12191 tree orig, int ignored)
12194 const char *fmt_str = NULL;
12195 unsigned HOST_WIDE_INT destlen;
12197 /* Verify the required arguments in the original call. We deal with two
12198 types of snprintf() calls: 'snprintf (str, cst, fmt)' and
12199 'snprintf (dest, cst, "%s", orig)'. */
12200 if (!validate_arg (dest, POINTER_TYPE)
12201 || !validate_arg (destsize, INTEGER_TYPE)
12202 || !validate_arg (fmt, POINTER_TYPE))
12204 if (orig && !validate_arg (orig, POINTER_TYPE))
12207 if (!host_integerp (destsize, 1))
12210 /* Check whether the format is a literal string constant. */
12211 fmt_str = c_getstr (fmt);
12212 if (fmt_str == NULL)
12216 retval = NULL_TREE;
12218 if (!init_target_chars ())
12221 destlen = tree_low_cst (destsize, 1);
12223 /* If the format doesn't contain % args or %%, use strcpy. */
12224 if (strchr (fmt_str, target_percent) == NULL)
12226 tree fn = builtin_decl_implicit (BUILT_IN_STRCPY);
12227 size_t len = strlen (fmt_str);
12229 /* Don't optimize snprintf (buf, 4, "abc", ptr++). */
12233 /* We could expand this as
12234 memcpy (str, fmt, cst - 1); str[cst - 1] = '\0';
12236 memcpy (str, fmt_with_nul_at_cstm1, cst);
12237 but in the former case that might increase code size
12238 and in the latter case grow .rodata section too much.
12239 So punt for now. */
12240 if (len >= destlen)
12246 /* Convert snprintf (str, cst, fmt) into strcpy (str, fmt) when
12247 'format' is known to contain no % formats and
12248 strlen (fmt) < cst. */
12249 call = build_call_expr_loc (loc, fn, 2, dest, fmt);
12252 retval = build_int_cst (integer_type_node, strlen (fmt_str));
12255 /* If the format is "%s", use strcpy if the result isn't used. */
12256 else if (fmt_str && strcmp (fmt_str, target_percent_s) == 0)
12258 tree fn = builtin_decl_implicit (BUILT_IN_STRCPY);
12259 unsigned HOST_WIDE_INT origlen;
12261 /* Don't crash on snprintf (str1, cst, "%s"). */
12265 retval = c_strlen (orig, 1);
12266 if (!retval || !host_integerp (retval, 1))
12269 origlen = tree_low_cst (retval, 1);
12270 /* We could expand this as
12271 memcpy (str1, str2, cst - 1); str1[cst - 1] = '\0';
12273 memcpy (str1, str2_with_nul_at_cstm1, cst);
12274 but in the former case that might increase code size
12275 and in the latter case grow .rodata section too much.
12276 So punt for now. */
12277 if (origlen >= destlen)
12280 /* Convert snprintf (str1, cst, "%s", str2) into
12281 strcpy (str1, str2) if strlen (str2) < cst. */
12285 call = build_call_expr_loc (loc, fn, 2, dest, orig);
12288 retval = NULL_TREE;
12291 if (call && retval)
12293 tree fn = builtin_decl_explicit (BUILT_IN_SNPRINTF);
12294 retval = fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fn)), retval);
12295 return build2 (COMPOUND_EXPR, TREE_TYPE (retval), call, retval);
12301 /* Expand a call EXP to __builtin_object_size. */
12304 expand_builtin_object_size (tree exp)
12307 int object_size_type;
12308 tree fndecl = get_callee_fndecl (exp);
12310 if (!validate_arglist (exp, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
12312 error ("%Kfirst argument of %D must be a pointer, second integer constant",
12314 expand_builtin_trap ();
12318 ost = CALL_EXPR_ARG (exp, 1);
12321 if (TREE_CODE (ost) != INTEGER_CST
12322 || tree_int_cst_sgn (ost) < 0
12323 || compare_tree_int (ost, 3) > 0)
12325 error ("%Klast argument of %D is not integer constant between 0 and 3",
12327 expand_builtin_trap ();
12331 object_size_type = tree_low_cst (ost, 0);
12333 return object_size_type < 2 ? constm1_rtx : const0_rtx;
12336 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
12337 FCODE is the BUILT_IN_* to use.
12338 Return NULL_RTX if we failed; the caller should emit a normal call,
12339 otherwise try to get the result in TARGET, if convenient (and in
12340 mode MODE if that's convenient). */
12343 expand_builtin_memory_chk (tree exp, rtx target, enum machine_mode mode,
12344 enum built_in_function fcode)
12346 tree dest, src, len, size;
12348 if (!validate_arglist (exp,
12350 fcode == BUILT_IN_MEMSET_CHK
12351 ? INTEGER_TYPE : POINTER_TYPE,
12352 INTEGER_TYPE, INTEGER_TYPE, VOID_TYPE))
12355 dest = CALL_EXPR_ARG (exp, 0);
12356 src = CALL_EXPR_ARG (exp, 1);
12357 len = CALL_EXPR_ARG (exp, 2);
12358 size = CALL_EXPR_ARG (exp, 3);
12360 if (! host_integerp (size, 1))
12363 if (host_integerp (len, 1) || integer_all_onesp (size))
12367 if (! integer_all_onesp (size) && tree_int_cst_lt (size, len))
12369 warning_at (tree_nonartificial_location (exp),
12370 0, "%Kcall to %D will always overflow destination buffer",
12371 exp, get_callee_fndecl (exp));
12376 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
12377 mem{cpy,pcpy,move,set} is available. */
12380 case BUILT_IN_MEMCPY_CHK:
12381 fn = builtin_decl_explicit (BUILT_IN_MEMCPY);
12383 case BUILT_IN_MEMPCPY_CHK:
12384 fn = builtin_decl_explicit (BUILT_IN_MEMPCPY);
12386 case BUILT_IN_MEMMOVE_CHK:
12387 fn = builtin_decl_explicit (BUILT_IN_MEMMOVE);
12389 case BUILT_IN_MEMSET_CHK:
12390 fn = builtin_decl_explicit (BUILT_IN_MEMSET);
12399 fn = build_call_nofold_loc (EXPR_LOCATION (exp), fn, 3, dest, src, len);
12400 gcc_assert (TREE_CODE (fn) == CALL_EXPR);
12401 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
12402 return expand_expr (fn, target, mode, EXPAND_NORMAL);
12404 else if (fcode == BUILT_IN_MEMSET_CHK)
12408 unsigned int dest_align = get_pointer_alignment (dest);
12410 /* If DEST is not a pointer type, call the normal function. */
12411 if (dest_align == 0)
12414 /* If SRC and DEST are the same (and not volatile), do nothing. */
12415 if (operand_equal_p (src, dest, 0))
12419 if (fcode != BUILT_IN_MEMPCPY_CHK)
12421 /* Evaluate and ignore LEN in case it has side-effects. */
12422 expand_expr (len, const0_rtx, VOIDmode, EXPAND_NORMAL);
12423 return expand_expr (dest, target, mode, EXPAND_NORMAL);
12426 expr = fold_build_pointer_plus (dest, len);
12427 return expand_expr (expr, target, mode, EXPAND_NORMAL);
12430 /* __memmove_chk special case. */
12431 if (fcode == BUILT_IN_MEMMOVE_CHK)
12433 unsigned int src_align = get_pointer_alignment (src);
12435 if (src_align == 0)
12438 /* If src is categorized for a readonly section we can use
12439 normal __memcpy_chk. */
12440 if (readonly_data_expr (src))
12442 tree fn = builtin_decl_explicit (BUILT_IN_MEMCPY_CHK);
12445 fn = build_call_nofold_loc (EXPR_LOCATION (exp), fn, 4,
12446 dest, src, len, size);
12447 gcc_assert (TREE_CODE (fn) == CALL_EXPR);
12448 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
12449 return expand_expr (fn, target, mode, EXPAND_NORMAL);
12456 /* Emit warning if a buffer overflow is detected at compile time. */
12459 maybe_emit_chk_warning (tree exp, enum built_in_function fcode)
12463 location_t loc = tree_nonartificial_location (exp);
12467 case BUILT_IN_STRCPY_CHK:
12468 case BUILT_IN_STPCPY_CHK:
12469 /* For __strcat_chk the warning will be emitted only if overflowing
12470 by at least strlen (dest) + 1 bytes. */
12471 case BUILT_IN_STRCAT_CHK:
12472 len = CALL_EXPR_ARG (exp, 1);
12473 size = CALL_EXPR_ARG (exp, 2);
12476 case BUILT_IN_STRNCAT_CHK:
12477 case BUILT_IN_STRNCPY_CHK:
12478 len = CALL_EXPR_ARG (exp, 2);
12479 size = CALL_EXPR_ARG (exp, 3);
12481 case BUILT_IN_SNPRINTF_CHK:
12482 case BUILT_IN_VSNPRINTF_CHK:
12483 len = CALL_EXPR_ARG (exp, 1);
12484 size = CALL_EXPR_ARG (exp, 3);
12487 gcc_unreachable ();
12493 if (! host_integerp (size, 1) || integer_all_onesp (size))
12498 len = c_strlen (len, 1);
12499 if (! len || ! host_integerp (len, 1) || tree_int_cst_lt (len, size))
12502 else if (fcode == BUILT_IN_STRNCAT_CHK)
12504 tree src = CALL_EXPR_ARG (exp, 1);
12505 if (! src || ! host_integerp (len, 1) || tree_int_cst_lt (len, size))
12507 src = c_strlen (src, 1);
12508 if (! src || ! host_integerp (src, 1))
12510 warning_at (loc, 0, "%Kcall to %D might overflow destination buffer",
12511 exp, get_callee_fndecl (exp));
12514 else if (tree_int_cst_lt (src, size))
12517 else if (! host_integerp (len, 1) || ! tree_int_cst_lt (size, len))
12520 warning_at (loc, 0, "%Kcall to %D will always overflow destination buffer",
12521 exp, get_callee_fndecl (exp));
12524 /* Emit warning if a buffer overflow is detected at compile time
12525 in __sprintf_chk/__vsprintf_chk calls. */
12528 maybe_emit_sprintf_chk_warning (tree exp, enum built_in_function fcode)
12530 tree size, len, fmt;
12531 const char *fmt_str;
12532 int nargs = call_expr_nargs (exp);
12534 /* Verify the required arguments in the original call. */
12538 size = CALL_EXPR_ARG (exp, 2);
12539 fmt = CALL_EXPR_ARG (exp, 3);
12541 if (! host_integerp (size, 1) || integer_all_onesp (size))
12544 /* Check whether the format is a literal string constant. */
12545 fmt_str = c_getstr (fmt);
12546 if (fmt_str == NULL)
12549 if (!init_target_chars ())
12552 /* If the format doesn't contain % args or %%, we know its size. */
12553 if (strchr (fmt_str, target_percent) == 0)
12554 len = build_int_cstu (size_type_node, strlen (fmt_str));
12555 /* If the format is "%s" and first ... argument is a string literal,
12557 else if (fcode == BUILT_IN_SPRINTF_CHK
12558 && strcmp (fmt_str, target_percent_s) == 0)
12564 arg = CALL_EXPR_ARG (exp, 4);
12565 if (! POINTER_TYPE_P (TREE_TYPE (arg)))
12568 len = c_strlen (arg, 1);
12569 if (!len || ! host_integerp (len, 1))
12575 if (! tree_int_cst_lt (len, size))
12576 warning_at (tree_nonartificial_location (exp),
12577 0, "%Kcall to %D will always overflow destination buffer",
12578 exp, get_callee_fndecl (exp));
12581 /* Emit warning if a free is called with address of a variable. */
12584 maybe_emit_free_warning (tree exp)
12586 tree arg = CALL_EXPR_ARG (exp, 0);
12589 if (TREE_CODE (arg) != ADDR_EXPR)
12592 arg = get_base_address (TREE_OPERAND (arg, 0));
12593 if (arg == NULL || INDIRECT_REF_P (arg) || TREE_CODE (arg) == MEM_REF)
12596 if (SSA_VAR_P (arg))
12597 warning_at (tree_nonartificial_location (exp), OPT_Wfree_nonheap_object,
12598 "%Kattempt to free a non-heap object %qD", exp, arg);
12600 warning_at (tree_nonartificial_location (exp), OPT_Wfree_nonheap_object,
12601 "%Kattempt to free a non-heap object", exp);
12604 /* Fold a call to __builtin_object_size with arguments PTR and OST,
12608 fold_builtin_object_size (tree ptr, tree ost)
12610 unsigned HOST_WIDE_INT bytes;
12611 int object_size_type;
12613 if (!validate_arg (ptr, POINTER_TYPE)
12614 || !validate_arg (ost, INTEGER_TYPE))
12619 if (TREE_CODE (ost) != INTEGER_CST
12620 || tree_int_cst_sgn (ost) < 0
12621 || compare_tree_int (ost, 3) > 0)
12624 object_size_type = tree_low_cst (ost, 0);
12626 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
12627 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
12628 and (size_t) 0 for types 2 and 3. */
12629 if (TREE_SIDE_EFFECTS (ptr))
12630 return build_int_cst_type (size_type_node, object_size_type < 2 ? -1 : 0);
12632 if (TREE_CODE (ptr) == ADDR_EXPR)
12634 bytes = compute_builtin_object_size (ptr, object_size_type);
12635 if (double_int_fits_to_tree_p (size_type_node,
12636 uhwi_to_double_int (bytes)))
12637 return build_int_cstu (size_type_node, bytes);
12639 else if (TREE_CODE (ptr) == SSA_NAME)
12641 /* If object size is not known yet, delay folding until
12642 later. Maybe subsequent passes will help determining
12644 bytes = compute_builtin_object_size (ptr, object_size_type);
12645 if (bytes != (unsigned HOST_WIDE_INT) (object_size_type < 2 ? -1 : 0)
12646 && double_int_fits_to_tree_p (size_type_node,
12647 uhwi_to_double_int (bytes)))
12648 return build_int_cstu (size_type_node, bytes);
12654 /* Fold a call to the __mem{cpy,pcpy,move,set}_chk builtin.
12655 DEST, SRC, LEN, and SIZE are the arguments to the call.
12656 IGNORE is true, if return value can be ignored. FCODE is the BUILT_IN_*
12657 code of the builtin. If MAXLEN is not NULL, it is maximum length
12658 passed as third argument. */
12661 fold_builtin_memory_chk (location_t loc, tree fndecl,
12662 tree dest, tree src, tree len, tree size,
12663 tree maxlen, bool ignore,
12664 enum built_in_function fcode)
12668 if (!validate_arg (dest, POINTER_TYPE)
12669 || !validate_arg (src,
12670 (fcode == BUILT_IN_MEMSET_CHK
12671 ? INTEGER_TYPE : POINTER_TYPE))
12672 || !validate_arg (len, INTEGER_TYPE)
12673 || !validate_arg (size, INTEGER_TYPE))
12676 /* If SRC and DEST are the same (and not volatile), return DEST
12677 (resp. DEST+LEN for __mempcpy_chk). */
12678 if (fcode != BUILT_IN_MEMSET_CHK && operand_equal_p (src, dest, 0))
12680 if (fcode != BUILT_IN_MEMPCPY_CHK)
12681 return omit_one_operand_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)),
12685 tree temp = fold_build_pointer_plus_loc (loc, dest, len);
12686 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), temp);
12690 if (! host_integerp (size, 1))
12693 if (! integer_all_onesp (size))
12695 if (! host_integerp (len, 1))
12697 /* If LEN is not constant, try MAXLEN too.
12698 For MAXLEN only allow optimizing into non-_ocs function
12699 if SIZE is >= MAXLEN, never convert to __ocs_fail (). */
12700 if (maxlen == NULL_TREE || ! host_integerp (maxlen, 1))
12702 if (fcode == BUILT_IN_MEMPCPY_CHK && ignore)
12704 /* (void) __mempcpy_chk () can be optimized into
12705 (void) __memcpy_chk (). */
12706 fn = builtin_decl_explicit (BUILT_IN_MEMCPY_CHK);
12710 return build_call_expr_loc (loc, fn, 4, dest, src, len, size);
12718 if (tree_int_cst_lt (size, maxlen))
12723 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
12724 mem{cpy,pcpy,move,set} is available. */
12727 case BUILT_IN_MEMCPY_CHK:
12728 fn = builtin_decl_explicit (BUILT_IN_MEMCPY);
12730 case BUILT_IN_MEMPCPY_CHK:
12731 fn = builtin_decl_explicit (BUILT_IN_MEMPCPY);
12733 case BUILT_IN_MEMMOVE_CHK:
12734 fn = builtin_decl_explicit (BUILT_IN_MEMMOVE);
12736 case BUILT_IN_MEMSET_CHK:
12737 fn = builtin_decl_explicit (BUILT_IN_MEMSET);
12746 return build_call_expr_loc (loc, fn, 3, dest, src, len);
12749 /* Fold a call to the __st[rp]cpy_chk builtin.
12750 DEST, SRC, and SIZE are the arguments to the call.
12751 IGNORE is true if return value can be ignored. FCODE is the BUILT_IN_*
12752 code of the builtin. If MAXLEN is not NULL, it is maximum length of
12753 strings passed as second argument. */
12756 fold_builtin_stxcpy_chk (location_t loc, tree fndecl, tree dest,
12757 tree src, tree size,
12758 tree maxlen, bool ignore,
12759 enum built_in_function fcode)
12763 if (!validate_arg (dest, POINTER_TYPE)
12764 || !validate_arg (src, POINTER_TYPE)
12765 || !validate_arg (size, INTEGER_TYPE))
12768 /* If SRC and DEST are the same (and not volatile), return DEST. */
12769 if (fcode == BUILT_IN_STRCPY_CHK && operand_equal_p (src, dest, 0))
12770 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest);
12772 if (! host_integerp (size, 1))
12775 if (! integer_all_onesp (size))
12777 len = c_strlen (src, 1);
12778 if (! len || ! host_integerp (len, 1))
12780 /* If LEN is not constant, try MAXLEN too.
12781 For MAXLEN only allow optimizing into non-_ocs function
12782 if SIZE is >= MAXLEN, never convert to __ocs_fail (). */
12783 if (maxlen == NULL_TREE || ! host_integerp (maxlen, 1))
12785 if (fcode == BUILT_IN_STPCPY_CHK)
12790 /* If return value of __stpcpy_chk is ignored,
12791 optimize into __strcpy_chk. */
12792 fn = builtin_decl_explicit (BUILT_IN_STRCPY_CHK);
12796 return build_call_expr_loc (loc, fn, 3, dest, src, size);
12799 if (! len || TREE_SIDE_EFFECTS (len))
12802 /* If c_strlen returned something, but not a constant,
12803 transform __strcpy_chk into __memcpy_chk. */
12804 fn = builtin_decl_explicit (BUILT_IN_MEMCPY_CHK);
12808 len = fold_convert_loc (loc, size_type_node, len);
12809 len = size_binop_loc (loc, PLUS_EXPR, len,
12810 build_int_cst (size_type_node, 1));
12811 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)),
12812 build_call_expr_loc (loc, fn, 4,
12813 dest, src, len, size));
12819 if (! tree_int_cst_lt (maxlen, size))
12823 /* If __builtin_st{r,p}cpy_chk is used, assume st{r,p}cpy is available. */
12824 fn = builtin_decl_explicit (fcode == BUILT_IN_STPCPY_CHK
12825 ? BUILT_IN_STPCPY : BUILT_IN_STRCPY);
12829 return build_call_expr_loc (loc, fn, 2, dest, src);
12832 /* Fold a call to the __strncpy_chk builtin. DEST, SRC, LEN, and SIZE
12833 are the arguments to the call. If MAXLEN is not NULL, it is maximum
12834 length passed as third argument. */
12837 fold_builtin_strncpy_chk (location_t loc, tree dest, tree src,
12838 tree len, tree size, tree maxlen)
12842 if (!validate_arg (dest, POINTER_TYPE)
12843 || !validate_arg (src, POINTER_TYPE)
12844 || !validate_arg (len, INTEGER_TYPE)
12845 || !validate_arg (size, INTEGER_TYPE))
12848 if (! host_integerp (size, 1))
12851 if (! integer_all_onesp (size))
12853 if (! host_integerp (len, 1))
12855 /* If LEN is not constant, try MAXLEN too.
12856 For MAXLEN only allow optimizing into non-_ocs function
12857 if SIZE is >= MAXLEN, never convert to __ocs_fail (). */
12858 if (maxlen == NULL_TREE || ! host_integerp (maxlen, 1))
12864 if (tree_int_cst_lt (size, maxlen))
12868 /* If __builtin_strncpy_chk is used, assume strncpy is available. */
12869 fn = builtin_decl_explicit (BUILT_IN_STRNCPY);
12873 return build_call_expr_loc (loc, fn, 3, dest, src, len);
12876 /* Fold a call to the __strcat_chk builtin FNDECL. DEST, SRC, and SIZE
12877 are the arguments to the call. */
12880 fold_builtin_strcat_chk (location_t loc, tree fndecl, tree dest,
12881 tree src, tree size)
12886 if (!validate_arg (dest, POINTER_TYPE)
12887 || !validate_arg (src, POINTER_TYPE)
12888 || !validate_arg (size, INTEGER_TYPE))
12891 p = c_getstr (src);
12892 /* If the SRC parameter is "", return DEST. */
12893 if (p && *p == '\0')
12894 return omit_one_operand_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest, src);
12896 if (! host_integerp (size, 1) || ! integer_all_onesp (size))
12899 /* If __builtin_strcat_chk is used, assume strcat is available. */
12900 fn = builtin_decl_explicit (BUILT_IN_STRCAT);
12904 return build_call_expr_loc (loc, fn, 2, dest, src);
12907 /* Fold a call to the __strncat_chk builtin with arguments DEST, SRC,
12911 fold_builtin_strncat_chk (location_t loc, tree fndecl,
12912 tree dest, tree src, tree len, tree size)
12917 if (!validate_arg (dest, POINTER_TYPE)
12918 || !validate_arg (src, POINTER_TYPE)
12919 || !validate_arg (size, INTEGER_TYPE)
12920 || !validate_arg (size, INTEGER_TYPE))
12923 p = c_getstr (src);
12924 /* If the SRC parameter is "" or if LEN is 0, return DEST. */
12925 if (p && *p == '\0')
12926 return omit_one_operand_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest, len);
12927 else if (integer_zerop (len))
12928 return omit_one_operand_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest, src);
12930 if (! host_integerp (size, 1))
12933 if (! integer_all_onesp (size))
12935 tree src_len = c_strlen (src, 1);
12937 && host_integerp (src_len, 1)
12938 && host_integerp (len, 1)
12939 && ! tree_int_cst_lt (len, src_len))
12941 /* If LEN >= strlen (SRC), optimize into __strcat_chk. */
12942 fn = builtin_decl_explicit (BUILT_IN_STRCAT_CHK);
12946 return build_call_expr_loc (loc, fn, 3, dest, src, size);
12951 /* If __builtin_strncat_chk is used, assume strncat is available. */
12952 fn = builtin_decl_explicit (BUILT_IN_STRNCAT);
12956 return build_call_expr_loc (loc, fn, 3, dest, src, len);
12959 /* Fold a call EXP to __{,v}sprintf_chk having NARGS passed as ARGS.
12960 Return NULL_TREE if a normal call should be emitted rather than
12961 expanding the function inline. FCODE is either BUILT_IN_SPRINTF_CHK
12962 or BUILT_IN_VSPRINTF_CHK. */
12965 fold_builtin_sprintf_chk_1 (location_t loc, int nargs, tree *args,
12966 enum built_in_function fcode)
12968 tree dest, size, len, fn, fmt, flag;
12969 const char *fmt_str;
12971 /* Verify the required arguments in the original call. */
12975 if (!validate_arg (dest, POINTER_TYPE))
12978 if (!validate_arg (flag, INTEGER_TYPE))
12981 if (!validate_arg (size, INTEGER_TYPE))
12984 if (!validate_arg (fmt, POINTER_TYPE))
12987 if (! host_integerp (size, 1))
12992 if (!init_target_chars ())
12995 /* Check whether the format is a literal string constant. */
12996 fmt_str = c_getstr (fmt);
12997 if (fmt_str != NULL)
12999 /* If the format doesn't contain % args or %%, we know the size. */
13000 if (strchr (fmt_str, target_percent) == 0)
13002 if (fcode != BUILT_IN_SPRINTF_CHK || nargs == 4)
13003 len = build_int_cstu (size_type_node, strlen (fmt_str));
13005 /* If the format is "%s" and first ... argument is a string literal,
13006 we know the size too. */
13007 else if (fcode == BUILT_IN_SPRINTF_CHK
13008 && strcmp (fmt_str, target_percent_s) == 0)
13015 if (validate_arg (arg, POINTER_TYPE))
13017 len = c_strlen (arg, 1);
13018 if (! len || ! host_integerp (len, 1))
13025 if (! integer_all_onesp (size))
13027 if (! len || ! tree_int_cst_lt (len, size))
13031 /* Only convert __{,v}sprintf_chk to {,v}sprintf if flag is 0
13032 or if format doesn't contain % chars or is "%s". */
13033 if (! integer_zerop (flag))
13035 if (fmt_str == NULL)
13037 if (strchr (fmt_str, target_percent) != NULL
13038 && strcmp (fmt_str, target_percent_s))
13042 /* If __builtin_{,v}sprintf_chk is used, assume {,v}sprintf is available. */
13043 fn = builtin_decl_explicit (fcode == BUILT_IN_VSPRINTF_CHK
13044 ? BUILT_IN_VSPRINTF : BUILT_IN_SPRINTF);
13048 return rewrite_call_expr_array (loc, nargs, args, 4, fn, 2, dest, fmt);
13051 /* Fold a call EXP to __{,v}sprintf_chk. Return NULL_TREE if
13052 a normal call should be emitted rather than expanding the function
13053 inline. FCODE is either BUILT_IN_SPRINTF_CHK or BUILT_IN_VSPRINTF_CHK. */
13056 fold_builtin_sprintf_chk (location_t loc, tree exp,
13057 enum built_in_function fcode)
13059 return fold_builtin_sprintf_chk_1 (loc, call_expr_nargs (exp),
13060 CALL_EXPR_ARGP (exp), fcode);
13063 /* Fold a call EXP to {,v}snprintf having NARGS passed as ARGS. Return
13064 NULL_TREE if a normal call should be emitted rather than expanding
13065 the function inline. FCODE is either BUILT_IN_SNPRINTF_CHK or
13066 BUILT_IN_VSNPRINTF_CHK. If MAXLEN is not NULL, it is maximum length
13067 passed as second argument. */
13070 fold_builtin_snprintf_chk_1 (location_t loc, int nargs, tree *args,
13071 tree maxlen, enum built_in_function fcode)
13073 tree dest, size, len, fn, fmt, flag;
13074 const char *fmt_str;
13076 /* Verify the required arguments in the original call. */
13080 if (!validate_arg (dest, POINTER_TYPE))
13083 if (!validate_arg (len, INTEGER_TYPE))
13086 if (!validate_arg (flag, INTEGER_TYPE))
13089 if (!validate_arg (size, INTEGER_TYPE))
13092 if (!validate_arg (fmt, POINTER_TYPE))
13095 if (! host_integerp (size, 1))
13098 if (! integer_all_onesp (size))
13100 if (! host_integerp (len, 1))
13102 /* If LEN is not constant, try MAXLEN too.
13103 For MAXLEN only allow optimizing into non-_ocs function
13104 if SIZE is >= MAXLEN, never convert to __ocs_fail (). */
13105 if (maxlen == NULL_TREE || ! host_integerp (maxlen, 1))
13111 if (tree_int_cst_lt (size, maxlen))
13115 if (!init_target_chars ())
13118 /* Only convert __{,v}snprintf_chk to {,v}snprintf if flag is 0
13119 or if format doesn't contain % chars or is "%s". */
13120 if (! integer_zerop (flag))
13122 fmt_str = c_getstr (fmt);
13123 if (fmt_str == NULL)
13125 if (strchr (fmt_str, target_percent) != NULL
13126 && strcmp (fmt_str, target_percent_s))
13130 /* If __builtin_{,v}snprintf_chk is used, assume {,v}snprintf is
13132 fn = builtin_decl_explicit (fcode == BUILT_IN_VSNPRINTF_CHK
13133 ? BUILT_IN_VSNPRINTF : BUILT_IN_SNPRINTF);
13137 return rewrite_call_expr_array (loc, nargs, args, 5, fn, 3, dest, len, fmt);
13140 /* Fold a call EXP to {,v}snprintf. Return NULL_TREE if
13141 a normal call should be emitted rather than expanding the function
13142 inline. FCODE is either BUILT_IN_SNPRINTF_CHK or
13143 BUILT_IN_VSNPRINTF_CHK. If MAXLEN is not NULL, it is maximum length
13144 passed as second argument. */
13147 fold_builtin_snprintf_chk (location_t loc, tree exp, tree maxlen,
13148 enum built_in_function fcode)
13150 return fold_builtin_snprintf_chk_1 (loc, call_expr_nargs (exp),
13151 CALL_EXPR_ARGP (exp), maxlen, fcode);
13154 /* Fold a call to the {,v}printf{,_unlocked} and __{,v}printf_chk builtins.
13155 FMT and ARG are the arguments to the call; we don't fold cases with
13156 more than 2 arguments, and ARG may be null if this is a 1-argument case.
13158 Return NULL_TREE if no simplification was possible, otherwise return the
13159 simplified form of the call as a tree. FCODE is the BUILT_IN_*
13160 code of the function to be simplified. */
13163 fold_builtin_printf (location_t loc, tree fndecl, tree fmt,
13164 tree arg, bool ignore,
13165 enum built_in_function fcode)
13167 tree fn_putchar, fn_puts, newarg, call = NULL_TREE;
13168 const char *fmt_str = NULL;
13170 /* If the return value is used, don't do the transformation. */
13174 /* Verify the required arguments in the original call. */
13175 if (!validate_arg (fmt, POINTER_TYPE))
13178 /* Check whether the format is a literal string constant. */
13179 fmt_str = c_getstr (fmt);
13180 if (fmt_str == NULL)
13183 if (fcode == BUILT_IN_PRINTF_UNLOCKED)
13185 /* If we're using an unlocked function, assume the other
13186 unlocked functions exist explicitly. */
13187 fn_putchar = builtin_decl_explicit (BUILT_IN_PUTCHAR_UNLOCKED);
13188 fn_puts = builtin_decl_explicit (BUILT_IN_PUTS_UNLOCKED);
13192 fn_putchar = builtin_decl_implicit (BUILT_IN_PUTCHAR);
13193 fn_puts = builtin_decl_implicit (BUILT_IN_PUTS);
13196 if (!init_target_chars ())
13199 if (strcmp (fmt_str, target_percent_s) == 0
13200 || strchr (fmt_str, target_percent) == NULL)
13204 if (strcmp (fmt_str, target_percent_s) == 0)
13206 if (fcode == BUILT_IN_VPRINTF || fcode == BUILT_IN_VPRINTF_CHK)
13209 if (!arg || !validate_arg (arg, POINTER_TYPE))
13212 str = c_getstr (arg);
13218 /* The format specifier doesn't contain any '%' characters. */
13219 if (fcode != BUILT_IN_VPRINTF && fcode != BUILT_IN_VPRINTF_CHK
13225 /* If the string was "", printf does nothing. */
13226 if (str[0] == '\0')
13227 return build_int_cst (TREE_TYPE (TREE_TYPE (fndecl)), 0);
13229 /* If the string has length of 1, call putchar. */
13230 if (str[1] == '\0')
13232 /* Given printf("c"), (where c is any one character,)
13233 convert "c"[0] to an int and pass that to the replacement
13235 newarg = build_int_cst (integer_type_node, str[0]);
13237 call = build_call_expr_loc (loc, fn_putchar, 1, newarg);
13241 /* If the string was "string\n", call puts("string"). */
13242 size_t len = strlen (str);
13243 if ((unsigned char)str[len - 1] == target_newline
13244 && (size_t) (int) len == len
13248 tree offset_node, string_cst;
13250 /* Create a NUL-terminated string that's one char shorter
13251 than the original, stripping off the trailing '\n'. */
13252 newarg = build_string_literal (len, str);
13253 string_cst = string_constant (newarg, &offset_node);
13254 gcc_checking_assert (string_cst
13255 && (TREE_STRING_LENGTH (string_cst)
13257 && integer_zerop (offset_node)
13259 TREE_STRING_POINTER (string_cst)[len - 1]
13260 == target_newline);
13261 /* build_string_literal creates a new STRING_CST,
13262 modify it in place to avoid double copying. */
13263 newstr = CONST_CAST (char *, TREE_STRING_POINTER (string_cst));
13264 newstr[len - 1] = '\0';
13266 call = build_call_expr_loc (loc, fn_puts, 1, newarg);
13269 /* We'd like to arrange to call fputs(string,stdout) here,
13270 but we need stdout and don't have a way to get it yet. */
13275 /* The other optimizations can be done only on the non-va_list variants. */
13276 else if (fcode == BUILT_IN_VPRINTF || fcode == BUILT_IN_VPRINTF_CHK)
13279 /* If the format specifier was "%s\n", call __builtin_puts(arg). */
13280 else if (strcmp (fmt_str, target_percent_s_newline) == 0)
13282 if (!arg || !validate_arg (arg, POINTER_TYPE))
13285 call = build_call_expr_loc (loc, fn_puts, 1, arg);
13288 /* If the format specifier was "%c", call __builtin_putchar(arg). */
13289 else if (strcmp (fmt_str, target_percent_c) == 0)
13291 if (!arg || !validate_arg (arg, INTEGER_TYPE))
13294 call = build_call_expr_loc (loc, fn_putchar, 1, arg);
13300 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), call);
13303 /* Fold a call to the {,v}fprintf{,_unlocked} and __{,v}printf_chk builtins.
13304 FP, FMT, and ARG are the arguments to the call. We don't fold calls with
13305 more than 3 arguments, and ARG may be null in the 2-argument case.
13307 Return NULL_TREE if no simplification was possible, otherwise return the
13308 simplified form of the call as a tree. FCODE is the BUILT_IN_*
13309 code of the function to be simplified. */
13312 fold_builtin_fprintf (location_t loc, tree fndecl, tree fp,
13313 tree fmt, tree arg, bool ignore,
13314 enum built_in_function fcode)
13316 tree fn_fputc, fn_fputs, call = NULL_TREE;
13317 const char *fmt_str = NULL;
13319 /* If the return value is used, don't do the transformation. */
13323 /* Verify the required arguments in the original call. */
13324 if (!validate_arg (fp, POINTER_TYPE))
13326 if (!validate_arg (fmt, POINTER_TYPE))
13329 /* Check whether the format is a literal string constant. */
13330 fmt_str = c_getstr (fmt);
13331 if (fmt_str == NULL)
13334 if (fcode == BUILT_IN_FPRINTF_UNLOCKED)
13336 /* If we're using an unlocked function, assume the other
13337 unlocked functions exist explicitly. */
13338 fn_fputc = builtin_decl_explicit (BUILT_IN_FPUTC_UNLOCKED);
13339 fn_fputs = builtin_decl_explicit (BUILT_IN_FPUTS_UNLOCKED);
13343 fn_fputc = builtin_decl_implicit (BUILT_IN_FPUTC);
13344 fn_fputs = builtin_decl_implicit (BUILT_IN_FPUTS);
13347 if (!init_target_chars ())
13350 /* If the format doesn't contain % args or %%, use strcpy. */
13351 if (strchr (fmt_str, target_percent) == NULL)
13353 if (fcode != BUILT_IN_VFPRINTF && fcode != BUILT_IN_VFPRINTF_CHK
13357 /* If the format specifier was "", fprintf does nothing. */
13358 if (fmt_str[0] == '\0')
13360 /* If FP has side-effects, just wait until gimplification is
13362 if (TREE_SIDE_EFFECTS (fp))
13365 return build_int_cst (TREE_TYPE (TREE_TYPE (fndecl)), 0);
13368 /* When "string" doesn't contain %, replace all cases of
13369 fprintf (fp, string) with fputs (string, fp). The fputs
13370 builtin will take care of special cases like length == 1. */
13372 call = build_call_expr_loc (loc, fn_fputs, 2, fmt, fp);
13375 /* The other optimizations can be done only on the non-va_list variants. */
13376 else if (fcode == BUILT_IN_VFPRINTF || fcode == BUILT_IN_VFPRINTF_CHK)
13379 /* If the format specifier was "%s", call __builtin_fputs (arg, fp). */
13380 else if (strcmp (fmt_str, target_percent_s) == 0)
13382 if (!arg || !validate_arg (arg, POINTER_TYPE))
13385 call = build_call_expr_loc (loc, fn_fputs, 2, arg, fp);
13388 /* If the format specifier was "%c", call __builtin_fputc (arg, fp). */
13389 else if (strcmp (fmt_str, target_percent_c) == 0)
13391 if (!arg || !validate_arg (arg, INTEGER_TYPE))
13394 call = build_call_expr_loc (loc, fn_fputc, 2, arg, fp);
13399 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), call);
13402 /* Initialize format string characters in the target charset. */
13405 init_target_chars (void)
13410 target_newline = lang_hooks.to_target_charset ('\n');
13411 target_percent = lang_hooks.to_target_charset ('%');
13412 target_c = lang_hooks.to_target_charset ('c');
13413 target_s = lang_hooks.to_target_charset ('s');
13414 if (target_newline == 0 || target_percent == 0 || target_c == 0
13418 target_percent_c[0] = target_percent;
13419 target_percent_c[1] = target_c;
13420 target_percent_c[2] = '\0';
13422 target_percent_s[0] = target_percent;
13423 target_percent_s[1] = target_s;
13424 target_percent_s[2] = '\0';
13426 target_percent_s_newline[0] = target_percent;
13427 target_percent_s_newline[1] = target_s;
13428 target_percent_s_newline[2] = target_newline;
13429 target_percent_s_newline[3] = '\0';
13436 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
13437 and no overflow/underflow occurred. INEXACT is true if M was not
13438 exactly calculated. TYPE is the tree type for the result. This
13439 function assumes that you cleared the MPFR flags and then
13440 calculated M to see if anything subsequently set a flag prior to
13441 entering this function. Return NULL_TREE if any checks fail. */
13444 do_mpfr_ckconv (mpfr_srcptr m, tree type, int inexact)
13446 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
13447 overflow/underflow occurred. If -frounding-math, proceed iff the
13448 result of calling FUNC was exact. */
13449 if (mpfr_number_p (m) && !mpfr_overflow_p () && !mpfr_underflow_p ()
13450 && (!flag_rounding_math || !inexact))
13452 REAL_VALUE_TYPE rr;
13454 real_from_mpfr (&rr, m, type, GMP_RNDN);
13455 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
13456 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
13457 but the mpft_t is not, then we underflowed in the
13459 if (real_isfinite (&rr)
13460 && (rr.cl == rvc_zero) == (mpfr_zero_p (m) != 0))
13462 REAL_VALUE_TYPE rmode;
13464 real_convert (&rmode, TYPE_MODE (type), &rr);
13465 /* Proceed iff the specified mode can hold the value. */
13466 if (real_identical (&rmode, &rr))
13467 return build_real (type, rmode);
13473 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
13474 number and no overflow/underflow occurred. INEXACT is true if M
13475 was not exactly calculated. TYPE is the tree type for the result.
13476 This function assumes that you cleared the MPFR flags and then
13477 calculated M to see if anything subsequently set a flag prior to
13478 entering this function. Return NULL_TREE if any checks fail, if
13479 FORCE_CONVERT is true, then bypass the checks. */
13482 do_mpc_ckconv (mpc_srcptr m, tree type, int inexact, int force_convert)
13484 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
13485 overflow/underflow occurred. If -frounding-math, proceed iff the
13486 result of calling FUNC was exact. */
13488 || (mpfr_number_p (mpc_realref (m)) && mpfr_number_p (mpc_imagref (m))
13489 && !mpfr_overflow_p () && !mpfr_underflow_p ()
13490 && (!flag_rounding_math || !inexact)))
13492 REAL_VALUE_TYPE re, im;
13494 real_from_mpfr (&re, mpc_realref (m), TREE_TYPE (type), GMP_RNDN);
13495 real_from_mpfr (&im, mpc_imagref (m), TREE_TYPE (type), GMP_RNDN);
13496 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
13497 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
13498 but the mpft_t is not, then we underflowed in the
13501 || (real_isfinite (&re) && real_isfinite (&im)
13502 && (re.cl == rvc_zero) == (mpfr_zero_p (mpc_realref (m)) != 0)
13503 && (im.cl == rvc_zero) == (mpfr_zero_p (mpc_imagref (m)) != 0)))
13505 REAL_VALUE_TYPE re_mode, im_mode;
13507 real_convert (&re_mode, TYPE_MODE (TREE_TYPE (type)), &re);
13508 real_convert (&im_mode, TYPE_MODE (TREE_TYPE (type)), &im);
13509 /* Proceed iff the specified mode can hold the value. */
13511 || (real_identical (&re_mode, &re)
13512 && real_identical (&im_mode, &im)))
13513 return build_complex (type, build_real (TREE_TYPE (type), re_mode),
13514 build_real (TREE_TYPE (type), im_mode));
13520 /* If argument ARG is a REAL_CST, call the one-argument mpfr function
13521 FUNC on it and return the resulting value as a tree with type TYPE.
13522 If MIN and/or MAX are not NULL, then the supplied ARG must be
13523 within those bounds. If INCLUSIVE is true, then MIN/MAX are
13524 acceptable values, otherwise they are not. The mpfr precision is
13525 set to the precision of TYPE. We assume that function FUNC returns
13526 zero if the result could be calculated exactly within the requested
13530 do_mpfr_arg1 (tree arg, tree type, int (*func)(mpfr_ptr, mpfr_srcptr, mp_rnd_t),
13531 const REAL_VALUE_TYPE *min, const REAL_VALUE_TYPE *max,
13534 tree result = NULL_TREE;
13538 /* To proceed, MPFR must exactly represent the target floating point
13539 format, which only happens when the target base equals two. */
13540 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
13541 && TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
13543 const REAL_VALUE_TYPE *const ra = &TREE_REAL_CST (arg);
13545 if (real_isfinite (ra)
13546 && (!min || real_compare (inclusive ? GE_EXPR: GT_EXPR , ra, min))
13547 && (!max || real_compare (inclusive ? LE_EXPR: LT_EXPR , ra, max)))
13549 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
13550 const int prec = fmt->p;
13551 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
13555 mpfr_init2 (m, prec);
13556 mpfr_from_real (m, ra, GMP_RNDN);
13557 mpfr_clear_flags ();
13558 inexact = func (m, m, rnd);
13559 result = do_mpfr_ckconv (m, type, inexact);
13567 /* If argument ARG is a REAL_CST, call the two-argument mpfr function
13568 FUNC on it and return the resulting value as a tree with type TYPE.
13569 The mpfr precision is set to the precision of TYPE. We assume that
13570 function FUNC returns zero if the result could be calculated
13571 exactly within the requested precision. */
13574 do_mpfr_arg2 (tree arg1, tree arg2, tree type,
13575 int (*func)(mpfr_ptr, mpfr_srcptr, mpfr_srcptr, mp_rnd_t))
13577 tree result = NULL_TREE;
13582 /* To proceed, MPFR must exactly represent the target floating point
13583 format, which only happens when the target base equals two. */
13584 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
13585 && TREE_CODE (arg1) == REAL_CST && !TREE_OVERFLOW (arg1)
13586 && TREE_CODE (arg2) == REAL_CST && !TREE_OVERFLOW (arg2))
13588 const REAL_VALUE_TYPE *const ra1 = &TREE_REAL_CST (arg1);
13589 const REAL_VALUE_TYPE *const ra2 = &TREE_REAL_CST (arg2);
13591 if (real_isfinite (ra1) && real_isfinite (ra2))
13593 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
13594 const int prec = fmt->p;
13595 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
13599 mpfr_inits2 (prec, m1, m2, NULL);
13600 mpfr_from_real (m1, ra1, GMP_RNDN);
13601 mpfr_from_real (m2, ra2, GMP_RNDN);
13602 mpfr_clear_flags ();
13603 inexact = func (m1, m1, m2, rnd);
13604 result = do_mpfr_ckconv (m1, type, inexact);
13605 mpfr_clears (m1, m2, NULL);
13612 /* If argument ARG is a REAL_CST, call the three-argument mpfr function
13613 FUNC on it and return the resulting value as a tree with type TYPE.
13614 The mpfr precision is set to the precision of TYPE. We assume that
13615 function FUNC returns zero if the result could be calculated
13616 exactly within the requested precision. */
13619 do_mpfr_arg3 (tree arg1, tree arg2, tree arg3, tree type,
13620 int (*func)(mpfr_ptr, mpfr_srcptr, mpfr_srcptr, mpfr_srcptr, mp_rnd_t))
13622 tree result = NULL_TREE;
13628 /* To proceed, MPFR must exactly represent the target floating point
13629 format, which only happens when the target base equals two. */
13630 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
13631 && TREE_CODE (arg1) == REAL_CST && !TREE_OVERFLOW (arg1)
13632 && TREE_CODE (arg2) == REAL_CST && !TREE_OVERFLOW (arg2)
13633 && TREE_CODE (arg3) == REAL_CST && !TREE_OVERFLOW (arg3))
13635 const REAL_VALUE_TYPE *const ra1 = &TREE_REAL_CST (arg1);
13636 const REAL_VALUE_TYPE *const ra2 = &TREE_REAL_CST (arg2);
13637 const REAL_VALUE_TYPE *const ra3 = &TREE_REAL_CST (arg3);
13639 if (real_isfinite (ra1) && real_isfinite (ra2) && real_isfinite (ra3))
13641 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
13642 const int prec = fmt->p;
13643 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
13647 mpfr_inits2 (prec, m1, m2, m3, NULL);
13648 mpfr_from_real (m1, ra1, GMP_RNDN);
13649 mpfr_from_real (m2, ra2, GMP_RNDN);
13650 mpfr_from_real (m3, ra3, GMP_RNDN);
13651 mpfr_clear_flags ();
13652 inexact = func (m1, m1, m2, m3, rnd);
13653 result = do_mpfr_ckconv (m1, type, inexact);
13654 mpfr_clears (m1, m2, m3, NULL);
13661 /* If argument ARG is a REAL_CST, call mpfr_sin_cos() on it and set
13662 the pointers *(ARG_SINP) and *(ARG_COSP) to the resulting values.
13663 If ARG_SINP and ARG_COSP are NULL then the result is returned
13664 as a complex value.
13665 The type is taken from the type of ARG and is used for setting the
13666 precision of the calculation and results. */
13669 do_mpfr_sincos (tree arg, tree arg_sinp, tree arg_cosp)
13671 tree const type = TREE_TYPE (arg);
13672 tree result = NULL_TREE;
13676 /* To proceed, MPFR must exactly represent the target floating point
13677 format, which only happens when the target base equals two. */
13678 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
13679 && TREE_CODE (arg) == REAL_CST
13680 && !TREE_OVERFLOW (arg))
13682 const REAL_VALUE_TYPE *const ra = &TREE_REAL_CST (arg);
13684 if (real_isfinite (ra))
13686 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
13687 const int prec = fmt->p;
13688 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
13689 tree result_s, result_c;
13693 mpfr_inits2 (prec, m, ms, mc, NULL);
13694 mpfr_from_real (m, ra, GMP_RNDN);
13695 mpfr_clear_flags ();
13696 inexact = mpfr_sin_cos (ms, mc, m, rnd);
13697 result_s = do_mpfr_ckconv (ms, type, inexact);
13698 result_c = do_mpfr_ckconv (mc, type, inexact);
13699 mpfr_clears (m, ms, mc, NULL);
13700 if (result_s && result_c)
13702 /* If we are to return in a complex value do so. */
13703 if (!arg_sinp && !arg_cosp)
13704 return build_complex (build_complex_type (type),
13705 result_c, result_s);
13707 /* Dereference the sin/cos pointer arguments. */
13708 arg_sinp = build_fold_indirect_ref (arg_sinp);
13709 arg_cosp = build_fold_indirect_ref (arg_cosp);
13710 /* Proceed if valid pointer type were passed in. */
13711 if (TYPE_MAIN_VARIANT (TREE_TYPE (arg_sinp)) == TYPE_MAIN_VARIANT (type)
13712 && TYPE_MAIN_VARIANT (TREE_TYPE (arg_cosp)) == TYPE_MAIN_VARIANT (type))
13714 /* Set the values. */
13715 result_s = fold_build2 (MODIFY_EXPR, type, arg_sinp,
13717 TREE_SIDE_EFFECTS (result_s) = 1;
13718 result_c = fold_build2 (MODIFY_EXPR, type, arg_cosp,
13720 TREE_SIDE_EFFECTS (result_c) = 1;
13721 /* Combine the assignments into a compound expr. */
13722 result = non_lvalue (fold_build2 (COMPOUND_EXPR, type,
13723 result_s, result_c));
13731 /* If argument ARG1 is an INTEGER_CST and ARG2 is a REAL_CST, call the
13732 two-argument mpfr order N Bessel function FUNC on them and return
13733 the resulting value as a tree with type TYPE. The mpfr precision
13734 is set to the precision of TYPE. We assume that function FUNC
13735 returns zero if the result could be calculated exactly within the
13736 requested precision. */
13738 do_mpfr_bessel_n (tree arg1, tree arg2, tree type,
13739 int (*func)(mpfr_ptr, long, mpfr_srcptr, mp_rnd_t),
13740 const REAL_VALUE_TYPE *min, bool inclusive)
13742 tree result = NULL_TREE;
13747 /* To proceed, MPFR must exactly represent the target floating point
13748 format, which only happens when the target base equals two. */
13749 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
13750 && host_integerp (arg1, 0)
13751 && TREE_CODE (arg2) == REAL_CST && !TREE_OVERFLOW (arg2))
13753 const HOST_WIDE_INT n = tree_low_cst(arg1, 0);
13754 const REAL_VALUE_TYPE *const ra = &TREE_REAL_CST (arg2);
13757 && real_isfinite (ra)
13758 && (!min || real_compare (inclusive ? GE_EXPR: GT_EXPR , ra, min)))
13760 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
13761 const int prec = fmt->p;
13762 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
13766 mpfr_init2 (m, prec);
13767 mpfr_from_real (m, ra, GMP_RNDN);
13768 mpfr_clear_flags ();
13769 inexact = func (m, n, m, rnd);
13770 result = do_mpfr_ckconv (m, type, inexact);
13778 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
13779 the pointer *(ARG_QUO) and return the result. The type is taken
13780 from the type of ARG0 and is used for setting the precision of the
13781 calculation and results. */
13784 do_mpfr_remquo (tree arg0, tree arg1, tree arg_quo)
13786 tree const type = TREE_TYPE (arg0);
13787 tree result = NULL_TREE;
13792 /* To proceed, MPFR must exactly represent the target floating point
13793 format, which only happens when the target base equals two. */
13794 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
13795 && TREE_CODE (arg0) == REAL_CST && !TREE_OVERFLOW (arg0)
13796 && TREE_CODE (arg1) == REAL_CST && !TREE_OVERFLOW (arg1))
13798 const REAL_VALUE_TYPE *const ra0 = TREE_REAL_CST_PTR (arg0);
13799 const REAL_VALUE_TYPE *const ra1 = TREE_REAL_CST_PTR (arg1);
13801 if (real_isfinite (ra0) && real_isfinite (ra1))
13803 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
13804 const int prec = fmt->p;
13805 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
13810 mpfr_inits2 (prec, m0, m1, NULL);
13811 mpfr_from_real (m0, ra0, GMP_RNDN);
13812 mpfr_from_real (m1, ra1, GMP_RNDN);
13813 mpfr_clear_flags ();
13814 mpfr_remquo (m0, &integer_quo, m0, m1, rnd);
13815 /* Remquo is independent of the rounding mode, so pass
13816 inexact=0 to do_mpfr_ckconv(). */
13817 result_rem = do_mpfr_ckconv (m0, type, /*inexact=*/ 0);
13818 mpfr_clears (m0, m1, NULL);
13821 /* MPFR calculates quo in the host's long so it may
13822 return more bits in quo than the target int can hold
13823 if sizeof(host long) > sizeof(target int). This can
13824 happen even for native compilers in LP64 mode. In
13825 these cases, modulo the quo value with the largest
13826 number that the target int can hold while leaving one
13827 bit for the sign. */
13828 if (sizeof (integer_quo) * CHAR_BIT > INT_TYPE_SIZE)
13829 integer_quo %= (long)(1UL << (INT_TYPE_SIZE - 1));
13831 /* Dereference the quo pointer argument. */
13832 arg_quo = build_fold_indirect_ref (arg_quo);
13833 /* Proceed iff a valid pointer type was passed in. */
13834 if (TYPE_MAIN_VARIANT (TREE_TYPE (arg_quo)) == integer_type_node)
13836 /* Set the value. */
13838 = fold_build2 (MODIFY_EXPR, TREE_TYPE (arg_quo), arg_quo,
13839 build_int_cst (TREE_TYPE (arg_quo),
13841 TREE_SIDE_EFFECTS (result_quo) = 1;
13842 /* Combine the quo assignment with the rem. */
13843 result = non_lvalue (fold_build2 (COMPOUND_EXPR, type,
13844 result_quo, result_rem));
13852 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
13853 resulting value as a tree with type TYPE. The mpfr precision is
13854 set to the precision of TYPE. We assume that this mpfr function
13855 returns zero if the result could be calculated exactly within the
13856 requested precision. In addition, the integer pointer represented
13857 by ARG_SG will be dereferenced and set to the appropriate signgam
13861 do_mpfr_lgamma_r (tree arg, tree arg_sg, tree type)
13863 tree result = NULL_TREE;
13867 /* To proceed, MPFR must exactly represent the target floating point
13868 format, which only happens when the target base equals two. Also
13869 verify ARG is a constant and that ARG_SG is an int pointer. */
13870 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
13871 && TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg)
13872 && TREE_CODE (TREE_TYPE (arg_sg)) == POINTER_TYPE
13873 && TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (arg_sg))) == integer_type_node)
13875 const REAL_VALUE_TYPE *const ra = TREE_REAL_CST_PTR (arg);
13877 /* In addition to NaN and Inf, the argument cannot be zero or a
13878 negative integer. */
13879 if (real_isfinite (ra)
13880 && ra->cl != rvc_zero
13881 && !(real_isneg(ra) && real_isinteger(ra, TYPE_MODE (type))))
13883 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
13884 const int prec = fmt->p;
13885 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
13890 mpfr_init2 (m, prec);
13891 mpfr_from_real (m, ra, GMP_RNDN);
13892 mpfr_clear_flags ();
13893 inexact = mpfr_lgamma (m, &sg, m, rnd);
13894 result_lg = do_mpfr_ckconv (m, type, inexact);
13900 /* Dereference the arg_sg pointer argument. */
13901 arg_sg = build_fold_indirect_ref (arg_sg);
13902 /* Assign the signgam value into *arg_sg. */
13903 result_sg = fold_build2 (MODIFY_EXPR,
13904 TREE_TYPE (arg_sg), arg_sg,
13905 build_int_cst (TREE_TYPE (arg_sg), sg));
13906 TREE_SIDE_EFFECTS (result_sg) = 1;
13907 /* Combine the signgam assignment with the lgamma result. */
13908 result = non_lvalue (fold_build2 (COMPOUND_EXPR, type,
13909 result_sg, result_lg));
13917 /* If argument ARG is a COMPLEX_CST, call the one-argument mpc
13918 function FUNC on it and return the resulting value as a tree with
13919 type TYPE. The mpfr precision is set to the precision of TYPE. We
13920 assume that function FUNC returns zero if the result could be
13921 calculated exactly within the requested precision. */
13924 do_mpc_arg1 (tree arg, tree type, int (*func)(mpc_ptr, mpc_srcptr, mpc_rnd_t))
13926 tree result = NULL_TREE;
13930 /* To proceed, MPFR must exactly represent the target floating point
13931 format, which only happens when the target base equals two. */
13932 if (TREE_CODE (arg) == COMPLEX_CST && !TREE_OVERFLOW (arg)
13933 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) == REAL_TYPE
13934 && REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (TREE_TYPE (arg))))->b == 2)
13936 const REAL_VALUE_TYPE *const re = TREE_REAL_CST_PTR (TREE_REALPART (arg));
13937 const REAL_VALUE_TYPE *const im = TREE_REAL_CST_PTR (TREE_IMAGPART (arg));
13939 if (real_isfinite (re) && real_isfinite (im))
13941 const struct real_format *const fmt =
13942 REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (type)));
13943 const int prec = fmt->p;
13944 const mp_rnd_t rnd = fmt->round_towards_zero ? GMP_RNDZ : GMP_RNDN;
13945 const mpc_rnd_t crnd = fmt->round_towards_zero ? MPC_RNDZZ : MPC_RNDNN;
13949 mpc_init2 (m, prec);
13950 mpfr_from_real (mpc_realref(m), re, rnd);
13951 mpfr_from_real (mpc_imagref(m), im, rnd);
13952 mpfr_clear_flags ();
13953 inexact = func (m, m, crnd);
13954 result = do_mpc_ckconv (m, type, inexact, /*force_convert=*/ 0);
13962 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
13963 mpc function FUNC on it and return the resulting value as a tree
13964 with type TYPE. The mpfr precision is set to the precision of
13965 TYPE. We assume that function FUNC returns zero if the result
13966 could be calculated exactly within the requested precision. If
13967 DO_NONFINITE is true, then fold expressions containing Inf or NaN
13968 in the arguments and/or results. */
13971 do_mpc_arg2 (tree arg0, tree arg1, tree type, int do_nonfinite,
13972 int (*func)(mpc_ptr, mpc_srcptr, mpc_srcptr, mpc_rnd_t))
13974 tree result = NULL_TREE;
13979 /* To proceed, MPFR must exactly represent the target floating point
13980 format, which only happens when the target base equals two. */
13981 if (TREE_CODE (arg0) == COMPLEX_CST && !TREE_OVERFLOW (arg0)
13982 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE
13983 && TREE_CODE (arg1) == COMPLEX_CST && !TREE_OVERFLOW (arg1)
13984 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg1))) == REAL_TYPE
13985 && REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (TREE_TYPE (arg0))))->b == 2)
13987 const REAL_VALUE_TYPE *const re0 = TREE_REAL_CST_PTR (TREE_REALPART (arg0));
13988 const REAL_VALUE_TYPE *const im0 = TREE_REAL_CST_PTR (TREE_IMAGPART (arg0));
13989 const REAL_VALUE_TYPE *const re1 = TREE_REAL_CST_PTR (TREE_REALPART (arg1));
13990 const REAL_VALUE_TYPE *const im1 = TREE_REAL_CST_PTR (TREE_IMAGPART (arg1));
13993 || (real_isfinite (re0) && real_isfinite (im0)
13994 && real_isfinite (re1) && real_isfinite (im1)))
13996 const struct real_format *const fmt =
13997 REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (type)));
13998 const int prec = fmt->p;
13999 const mp_rnd_t rnd = fmt->round_towards_zero ? GMP_RNDZ : GMP_RNDN;
14000 const mpc_rnd_t crnd = fmt->round_towards_zero ? MPC_RNDZZ : MPC_RNDNN;
14004 mpc_init2 (m0, prec);
14005 mpc_init2 (m1, prec);
14006 mpfr_from_real (mpc_realref(m0), re0, rnd);
14007 mpfr_from_real (mpc_imagref(m0), im0, rnd);
14008 mpfr_from_real (mpc_realref(m1), re1, rnd);
14009 mpfr_from_real (mpc_imagref(m1), im1, rnd);
14010 mpfr_clear_flags ();
14011 inexact = func (m0, m0, m1, crnd);
14012 result = do_mpc_ckconv (m0, type, inexact, do_nonfinite);
14021 /* Fold a call STMT to __{,v}sprintf_chk. Return NULL_TREE if
14022 a normal call should be emitted rather than expanding the function
14023 inline. FCODE is either BUILT_IN_SPRINTF_CHK or BUILT_IN_VSPRINTF_CHK. */
14026 gimple_fold_builtin_sprintf_chk (gimple stmt, enum built_in_function fcode)
14028 int nargs = gimple_call_num_args (stmt);
14030 return fold_builtin_sprintf_chk_1 (gimple_location (stmt), nargs,
14032 ? gimple_call_arg_ptr (stmt, 0)
14033 : &error_mark_node), fcode);
14036 /* Fold a call STMT to {,v}snprintf. Return NULL_TREE if
14037 a normal call should be emitted rather than expanding the function
14038 inline. FCODE is either BUILT_IN_SNPRINTF_CHK or
14039 BUILT_IN_VSNPRINTF_CHK. If MAXLEN is not NULL, it is maximum length
14040 passed as second argument. */
14043 gimple_fold_builtin_snprintf_chk (gimple stmt, tree maxlen,
14044 enum built_in_function fcode)
14046 int nargs = gimple_call_num_args (stmt);
14048 return fold_builtin_snprintf_chk_1 (gimple_location (stmt), nargs,
14050 ? gimple_call_arg_ptr (stmt, 0)
14051 : &error_mark_node), maxlen, fcode);
14054 /* Builtins with folding operations that operate on "..." arguments
14055 need special handling; we need to store the arguments in a convenient
14056 data structure before attempting any folding. Fortunately there are
14057 only a few builtins that fall into this category. FNDECL is the
14058 function, EXP is the CALL_EXPR for the call, and IGNORE is true if the
14059 result of the function call is ignored. */
14062 gimple_fold_builtin_varargs (tree fndecl, gimple stmt,
14063 bool ignore ATTRIBUTE_UNUSED)
14065 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
14066 tree ret = NULL_TREE;
14070 case BUILT_IN_SPRINTF_CHK:
14071 case BUILT_IN_VSPRINTF_CHK:
14072 ret = gimple_fold_builtin_sprintf_chk (stmt, fcode);
14075 case BUILT_IN_SNPRINTF_CHK:
14076 case BUILT_IN_VSNPRINTF_CHK:
14077 ret = gimple_fold_builtin_snprintf_chk (stmt, NULL_TREE, fcode);
14084 ret = build1 (NOP_EXPR, TREE_TYPE (ret), ret);
14085 TREE_NO_WARNING (ret) = 1;
14091 /* A wrapper function for builtin folding that prevents warnings for
14092 "statement without effect" and the like, caused by removing the
14093 call node earlier than the warning is generated. */
14096 fold_call_stmt (gimple stmt, bool ignore)
14098 tree ret = NULL_TREE;
14099 tree fndecl = gimple_call_fndecl (stmt);
14100 location_t loc = gimple_location (stmt);
14102 && TREE_CODE (fndecl) == FUNCTION_DECL
14103 && DECL_BUILT_IN (fndecl)
14104 && !gimple_call_va_arg_pack_p (stmt))
14106 int nargs = gimple_call_num_args (stmt);
14107 tree *args = (nargs > 0
14108 ? gimple_call_arg_ptr (stmt, 0)
14109 : &error_mark_node);
14111 if (avoid_folding_inline_builtin (fndecl))
14113 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
14115 return targetm.fold_builtin (fndecl, nargs, args, ignore);
14119 if (nargs <= MAX_ARGS_TO_FOLD_BUILTIN)
14120 ret = fold_builtin_n (loc, fndecl, args, nargs, ignore);
14122 ret = gimple_fold_builtin_varargs (fndecl, stmt, ignore);
14125 /* Propagate location information from original call to
14126 expansion of builtin. Otherwise things like
14127 maybe_emit_chk_warning, that operate on the expansion
14128 of a builtin, will use the wrong location information. */
14129 if (gimple_has_location (stmt))
14131 tree realret = ret;
14132 if (TREE_CODE (ret) == NOP_EXPR)
14133 realret = TREE_OPERAND (ret, 0);
14134 if (CAN_HAVE_LOCATION_P (realret)
14135 && !EXPR_HAS_LOCATION (realret))
14136 SET_EXPR_LOCATION (realret, loc);
14146 /* Look up the function in builtin_decl that corresponds to DECL
14147 and set ASMSPEC as its user assembler name. DECL must be a
14148 function decl that declares a builtin. */
14151 set_builtin_user_assembler_name (tree decl, const char *asmspec)
14154 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL
14155 && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
14158 builtin = builtin_decl_explicit (DECL_FUNCTION_CODE (decl));
14159 set_user_assembler_name (builtin, asmspec);
14160 switch (DECL_FUNCTION_CODE (decl))
14162 case BUILT_IN_MEMCPY:
14163 init_block_move_fn (asmspec);
14164 memcpy_libfunc = set_user_assembler_libfunc ("memcpy", asmspec);
14166 case BUILT_IN_MEMSET:
14167 init_block_clear_fn (asmspec);
14168 memset_libfunc = set_user_assembler_libfunc ("memset", asmspec);
14170 case BUILT_IN_MEMMOVE:
14171 memmove_libfunc = set_user_assembler_libfunc ("memmove", asmspec);
14173 case BUILT_IN_MEMCMP:
14174 memcmp_libfunc = set_user_assembler_libfunc ("memcmp", asmspec);
14176 case BUILT_IN_ABORT:
14177 abort_libfunc = set_user_assembler_libfunc ("abort", asmspec);
14180 if (INT_TYPE_SIZE < BITS_PER_WORD)
14182 set_user_assembler_libfunc ("ffs", asmspec);
14183 set_optab_libfunc (ffs_optab, mode_for_size (INT_TYPE_SIZE,
14184 MODE_INT, 0), "ffs");
14192 /* Return true if DECL is a builtin that expands to a constant or similarly
14195 is_simple_builtin (tree decl)
14197 if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL)
14198 switch (DECL_FUNCTION_CODE (decl))
14200 /* Builtins that expand to constants. */
14201 case BUILT_IN_CONSTANT_P:
14202 case BUILT_IN_EXPECT:
14203 case BUILT_IN_OBJECT_SIZE:
14204 case BUILT_IN_UNREACHABLE:
14205 /* Simple register moves or loads from stack. */
14206 case BUILT_IN_ASSUME_ALIGNED:
14207 case BUILT_IN_RETURN_ADDRESS:
14208 case BUILT_IN_EXTRACT_RETURN_ADDR:
14209 case BUILT_IN_FROB_RETURN_ADDR:
14210 case BUILT_IN_RETURN:
14211 case BUILT_IN_AGGREGATE_INCOMING_ADDRESS:
14212 case BUILT_IN_FRAME_ADDRESS:
14213 case BUILT_IN_VA_END:
14214 case BUILT_IN_STACK_SAVE:
14215 case BUILT_IN_STACK_RESTORE:
14216 /* Exception state returns or moves registers around. */
14217 case BUILT_IN_EH_FILTER:
14218 case BUILT_IN_EH_POINTER:
14219 case BUILT_IN_EH_COPY_VALUES:
14229 /* Return true if DECL is a builtin that is not expensive, i.e., they are
14230 most probably expanded inline into reasonably simple code. This is a
14231 superset of is_simple_builtin. */
14233 is_inexpensive_builtin (tree decl)
14237 else if (DECL_BUILT_IN_CLASS (decl) == BUILT_IN_MD)
14239 else if (DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL)
14240 switch (DECL_FUNCTION_CODE (decl))
14243 case BUILT_IN_ALLOCA:
14244 case BUILT_IN_ALLOCA_WITH_ALIGN:
14245 case BUILT_IN_BSWAP32:
14246 case BUILT_IN_BSWAP64:
14248 case BUILT_IN_CLZIMAX:
14249 case BUILT_IN_CLZL:
14250 case BUILT_IN_CLZLL:
14252 case BUILT_IN_CTZIMAX:
14253 case BUILT_IN_CTZL:
14254 case BUILT_IN_CTZLL:
14256 case BUILT_IN_FFSIMAX:
14257 case BUILT_IN_FFSL:
14258 case BUILT_IN_FFSLL:
14259 case BUILT_IN_IMAXABS:
14260 case BUILT_IN_FINITE:
14261 case BUILT_IN_FINITEF:
14262 case BUILT_IN_FINITEL:
14263 case BUILT_IN_FINITED32:
14264 case BUILT_IN_FINITED64:
14265 case BUILT_IN_FINITED128:
14266 case BUILT_IN_FPCLASSIFY:
14267 case BUILT_IN_ISFINITE:
14268 case BUILT_IN_ISINF_SIGN:
14269 case BUILT_IN_ISINF:
14270 case BUILT_IN_ISINFF:
14271 case BUILT_IN_ISINFL:
14272 case BUILT_IN_ISINFD32:
14273 case BUILT_IN_ISINFD64:
14274 case BUILT_IN_ISINFD128:
14275 case BUILT_IN_ISNAN:
14276 case BUILT_IN_ISNANF:
14277 case BUILT_IN_ISNANL:
14278 case BUILT_IN_ISNAND32:
14279 case BUILT_IN_ISNAND64:
14280 case BUILT_IN_ISNAND128:
14281 case BUILT_IN_ISNORMAL:
14282 case BUILT_IN_ISGREATER:
14283 case BUILT_IN_ISGREATEREQUAL:
14284 case BUILT_IN_ISLESS:
14285 case BUILT_IN_ISLESSEQUAL:
14286 case BUILT_IN_ISLESSGREATER:
14287 case BUILT_IN_ISUNORDERED:
14288 case BUILT_IN_VA_ARG_PACK:
14289 case BUILT_IN_VA_ARG_PACK_LEN:
14290 case BUILT_IN_VA_COPY:
14291 case BUILT_IN_TRAP:
14292 case BUILT_IN_SAVEREGS:
14293 case BUILT_IN_POPCOUNTL:
14294 case BUILT_IN_POPCOUNTLL:
14295 case BUILT_IN_POPCOUNTIMAX:
14296 case BUILT_IN_POPCOUNT:
14297 case BUILT_IN_PARITYL:
14298 case BUILT_IN_PARITYLL:
14299 case BUILT_IN_PARITYIMAX:
14300 case BUILT_IN_PARITY:
14301 case BUILT_IN_LABS:
14302 case BUILT_IN_LLABS:
14303 case BUILT_IN_PREFETCH:
14307 return is_simple_builtin (decl);