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 tree built_in_decls[(int) END_BUILTINS];
79 /* Declarations used when constructing the builtin implicitly in the compiler.
80 It may be NULL_TREE when this is invalid (for instance runtime is not
81 required to implement the function call in all cases). */
82 tree implicit_built_in_decls[(int) END_BUILTINS];
84 static const char *c_getstr (tree);
85 static rtx c_readstr (const char *, enum machine_mode);
86 static int target_char_cast (tree, char *);
87 static rtx get_memory_rtx (tree, tree);
88 static int apply_args_size (void);
89 static int apply_result_size (void);
90 #if defined (HAVE_untyped_call) || defined (HAVE_untyped_return)
91 static rtx result_vector (int, rtx);
93 static void expand_builtin_update_setjmp_buf (rtx);
94 static void expand_builtin_prefetch (tree);
95 static rtx expand_builtin_apply_args (void);
96 static rtx expand_builtin_apply_args_1 (void);
97 static rtx expand_builtin_apply (rtx, rtx, rtx);
98 static void expand_builtin_return (rtx);
99 static enum type_class type_to_class (tree);
100 static rtx expand_builtin_classify_type (tree);
101 static void expand_errno_check (tree, rtx);
102 static rtx expand_builtin_mathfn (tree, rtx, rtx);
103 static rtx expand_builtin_mathfn_2 (tree, rtx, rtx);
104 static rtx expand_builtin_mathfn_3 (tree, rtx, rtx);
105 static rtx expand_builtin_mathfn_ternary (tree, rtx, rtx);
106 static rtx expand_builtin_interclass_mathfn (tree, rtx);
107 static rtx expand_builtin_sincos (tree);
108 static rtx expand_builtin_cexpi (tree, rtx);
109 static rtx expand_builtin_int_roundingfn (tree, rtx);
110 static rtx expand_builtin_int_roundingfn_2 (tree, rtx);
111 static rtx expand_builtin_next_arg (void);
112 static rtx expand_builtin_va_start (tree);
113 static rtx expand_builtin_va_end (tree);
114 static rtx expand_builtin_va_copy (tree);
115 static rtx expand_builtin_memcmp (tree, rtx, enum machine_mode);
116 static rtx expand_builtin_strcmp (tree, rtx);
117 static rtx expand_builtin_strncmp (tree, rtx, enum machine_mode);
118 static rtx builtin_memcpy_read_str (void *, HOST_WIDE_INT, enum machine_mode);
119 static rtx expand_builtin_memcpy (tree, rtx);
120 static rtx expand_builtin_mempcpy (tree, rtx, enum machine_mode);
121 static rtx expand_builtin_mempcpy_args (tree, tree, tree, rtx,
122 enum machine_mode, int);
123 static rtx expand_builtin_strcpy (tree, rtx);
124 static rtx expand_builtin_strcpy_args (tree, tree, rtx);
125 static rtx expand_builtin_stpcpy (tree, rtx, enum machine_mode);
126 static rtx expand_builtin_strncpy (tree, rtx);
127 static rtx builtin_memset_gen_str (void *, HOST_WIDE_INT, enum machine_mode);
128 static rtx expand_builtin_memset (tree, rtx, enum machine_mode);
129 static rtx expand_builtin_memset_args (tree, tree, tree, rtx, enum machine_mode, tree);
130 static rtx expand_builtin_bzero (tree);
131 static rtx expand_builtin_strlen (tree, rtx, enum machine_mode);
132 static rtx expand_builtin_alloca (tree, bool);
133 static rtx expand_builtin_unop (enum machine_mode, tree, rtx, rtx, optab);
134 static rtx expand_builtin_frame_address (tree, tree);
135 static tree stabilize_va_list_loc (location_t, tree, int);
136 static rtx expand_builtin_expect (tree, rtx);
137 static tree fold_builtin_constant_p (tree);
138 static tree fold_builtin_expect (location_t, tree, tree);
139 static tree fold_builtin_classify_type (tree);
140 static tree fold_builtin_strlen (location_t, tree, tree);
141 static tree fold_builtin_inf (location_t, tree, int);
142 static tree fold_builtin_nan (tree, tree, int);
143 static tree rewrite_call_expr (location_t, tree, int, tree, int, ...);
144 static bool validate_arg (const_tree, enum tree_code code);
145 static bool integer_valued_real_p (tree);
146 static tree fold_trunc_transparent_mathfn (location_t, tree, tree);
147 static bool readonly_data_expr (tree);
148 static rtx expand_builtin_fabs (tree, rtx, rtx);
149 static rtx expand_builtin_signbit (tree, rtx);
150 static tree fold_builtin_sqrt (location_t, tree, tree);
151 static tree fold_builtin_cbrt (location_t, tree, tree);
152 static tree fold_builtin_pow (location_t, tree, tree, tree, tree);
153 static tree fold_builtin_powi (location_t, tree, tree, tree, tree);
154 static tree fold_builtin_cos (location_t, tree, tree, tree);
155 static tree fold_builtin_cosh (location_t, tree, tree, tree);
156 static tree fold_builtin_tan (tree, tree);
157 static tree fold_builtin_trunc (location_t, tree, tree);
158 static tree fold_builtin_floor (location_t, tree, tree);
159 static tree fold_builtin_ceil (location_t, tree, tree);
160 static tree fold_builtin_round (location_t, tree, tree);
161 static tree fold_builtin_int_roundingfn (location_t, tree, tree);
162 static tree fold_builtin_bitop (tree, tree);
163 static tree fold_builtin_memory_op (location_t, tree, tree, tree, tree, bool, int);
164 static tree fold_builtin_strchr (location_t, tree, tree, tree);
165 static tree fold_builtin_memchr (location_t, tree, tree, tree, tree);
166 static tree fold_builtin_memcmp (location_t, tree, tree, tree);
167 static tree fold_builtin_strcmp (location_t, tree, tree);
168 static tree fold_builtin_strncmp (location_t, tree, tree, tree);
169 static tree fold_builtin_signbit (location_t, tree, tree);
170 static tree fold_builtin_copysign (location_t, tree, tree, tree, tree);
171 static tree fold_builtin_isascii (location_t, tree);
172 static tree fold_builtin_toascii (location_t, tree);
173 static tree fold_builtin_isdigit (location_t, tree);
174 static tree fold_builtin_fabs (location_t, tree, tree);
175 static tree fold_builtin_abs (location_t, tree, tree);
176 static tree fold_builtin_unordered_cmp (location_t, tree, tree, tree, enum tree_code,
178 static tree fold_builtin_n (location_t, tree, tree *, int, bool);
179 static tree fold_builtin_0 (location_t, tree, bool);
180 static tree fold_builtin_1 (location_t, tree, tree, bool);
181 static tree fold_builtin_2 (location_t, tree, tree, tree, bool);
182 static tree fold_builtin_3 (location_t, tree, tree, tree, tree, bool);
183 static tree fold_builtin_4 (location_t, tree, tree, tree, tree, tree, bool);
184 static tree fold_builtin_varargs (location_t, tree, tree, bool);
186 static tree fold_builtin_strpbrk (location_t, tree, tree, tree);
187 static tree fold_builtin_strstr (location_t, tree, tree, tree);
188 static tree fold_builtin_strrchr (location_t, tree, tree, tree);
189 static tree fold_builtin_strcat (location_t, tree, tree);
190 static tree fold_builtin_strncat (location_t, tree, tree, tree);
191 static tree fold_builtin_strspn (location_t, tree, tree);
192 static tree fold_builtin_strcspn (location_t, tree, tree);
193 static tree fold_builtin_sprintf (location_t, tree, tree, tree, int);
194 static tree fold_builtin_snprintf (location_t, tree, tree, tree, tree, int);
196 static rtx expand_builtin_object_size (tree);
197 static rtx expand_builtin_memory_chk (tree, rtx, enum machine_mode,
198 enum built_in_function);
199 static void maybe_emit_chk_warning (tree, enum built_in_function);
200 static void maybe_emit_sprintf_chk_warning (tree, enum built_in_function);
201 static void maybe_emit_free_warning (tree);
202 static tree fold_builtin_object_size (tree, tree);
203 static tree fold_builtin_strcat_chk (location_t, tree, tree, tree, tree);
204 static tree fold_builtin_strncat_chk (location_t, tree, tree, tree, tree, tree);
205 static tree fold_builtin_sprintf_chk (location_t, tree, enum built_in_function);
206 static tree fold_builtin_printf (location_t, tree, tree, tree, bool, enum built_in_function);
207 static tree fold_builtin_fprintf (location_t, tree, tree, tree, tree, bool,
208 enum built_in_function);
209 static bool init_target_chars (void);
211 static unsigned HOST_WIDE_INT target_newline;
212 static unsigned HOST_WIDE_INT target_percent;
213 static unsigned HOST_WIDE_INT target_c;
214 static unsigned HOST_WIDE_INT target_s;
215 static char target_percent_c[3];
216 static char target_percent_s[3];
217 static char target_percent_s_newline[4];
218 static tree do_mpfr_arg1 (tree, tree, int (*)(mpfr_ptr, mpfr_srcptr, mp_rnd_t),
219 const REAL_VALUE_TYPE *, const REAL_VALUE_TYPE *, bool);
220 static tree do_mpfr_arg2 (tree, tree, tree,
221 int (*)(mpfr_ptr, mpfr_srcptr, mpfr_srcptr, mp_rnd_t));
222 static tree do_mpfr_arg3 (tree, tree, tree, tree,
223 int (*)(mpfr_ptr, mpfr_srcptr, mpfr_srcptr, mpfr_srcptr, mp_rnd_t));
224 static tree do_mpfr_sincos (tree, tree, tree);
225 static tree do_mpfr_bessel_n (tree, tree, tree,
226 int (*)(mpfr_ptr, long, mpfr_srcptr, mp_rnd_t),
227 const REAL_VALUE_TYPE *, bool);
228 static tree do_mpfr_remquo (tree, tree, tree);
229 static tree do_mpfr_lgamma_r (tree, tree, tree);
231 /* Return true if NAME starts with __builtin_ or __sync_. */
234 is_builtin_name (const char *name)
236 if (strncmp (name, "__builtin_", 10) == 0)
238 if (strncmp (name, "__sync_", 7) == 0)
244 /* Return true if DECL is a function symbol representing a built-in. */
247 is_builtin_fn (tree decl)
249 return TREE_CODE (decl) == FUNCTION_DECL && DECL_BUILT_IN (decl);
253 /* Return true if NODE should be considered for inline expansion regardless
254 of the optimization level. This means whenever a function is invoked with
255 its "internal" name, which normally contains the prefix "__builtin". */
258 called_as_built_in (tree node)
260 /* Note that we must use DECL_NAME, not DECL_ASSEMBLER_NAME_SET_P since
261 we want the name used to call the function, not the name it
263 const char *name = IDENTIFIER_POINTER (DECL_NAME (node));
264 return is_builtin_name (name);
267 /* Compute values M and N such that M divides (address of EXP - N) and
268 such that N < M. Store N in *BITPOSP and return M.
270 Note that the address (and thus the alignment) computed here is based
271 on the address to which a symbol resolves, whereas DECL_ALIGN is based
272 on the address at which an object is actually located. These two
273 addresses are not always the same. For example, on ARM targets,
274 the address &foo of a Thumb function foo() has the lowest bit set,
275 whereas foo() itself starts on an even address. */
278 get_object_alignment_1 (tree exp, unsigned HOST_WIDE_INT *bitposp)
280 HOST_WIDE_INT bitsize, bitpos;
282 enum machine_mode mode;
283 int unsignedp, volatilep;
284 unsigned int align, inner;
286 /* Get the innermost object and the constant (bitpos) and possibly
287 variable (offset) offset of the access. */
288 exp = get_inner_reference (exp, &bitsize, &bitpos, &offset,
289 &mode, &unsignedp, &volatilep, true);
291 /* Extract alignment information from the innermost object and
292 possibly adjust bitpos and offset. */
293 if (TREE_CODE (exp) == CONST_DECL)
294 exp = DECL_INITIAL (exp);
296 && TREE_CODE (exp) != LABEL_DECL)
298 if (TREE_CODE (exp) == FUNCTION_DECL)
300 /* Function addresses can encode extra information besides their
301 alignment. However, if TARGET_PTRMEMFUNC_VBIT_LOCATION
302 allows the low bit to be used as a virtual bit, we know
303 that the address itself must be 2-byte aligned. */
304 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn)
305 align = 2 * BITS_PER_UNIT;
307 align = BITS_PER_UNIT;
310 align = DECL_ALIGN (exp);
312 else if (CONSTANT_CLASS_P (exp))
314 align = TYPE_ALIGN (TREE_TYPE (exp));
315 #ifdef CONSTANT_ALIGNMENT
316 align = (unsigned)CONSTANT_ALIGNMENT (exp, align);
319 else if (TREE_CODE (exp) == VIEW_CONVERT_EXPR)
320 align = TYPE_ALIGN (TREE_TYPE (exp));
321 else if (TREE_CODE (exp) == INDIRECT_REF)
322 align = TYPE_ALIGN (TREE_TYPE (exp));
323 else if (TREE_CODE (exp) == MEM_REF)
325 tree addr = TREE_OPERAND (exp, 0);
326 struct ptr_info_def *pi;
327 if (TREE_CODE (addr) == BIT_AND_EXPR
328 && TREE_CODE (TREE_OPERAND (addr, 1)) == INTEGER_CST)
330 align = (TREE_INT_CST_LOW (TREE_OPERAND (addr, 1))
331 & -TREE_INT_CST_LOW (TREE_OPERAND (addr, 1)));
332 align *= BITS_PER_UNIT;
333 addr = TREE_OPERAND (addr, 0);
336 align = BITS_PER_UNIT;
337 if (TREE_CODE (addr) == SSA_NAME
338 && (pi = SSA_NAME_PTR_INFO (addr)))
340 bitpos += (pi->misalign * BITS_PER_UNIT) & ~(align - 1);
341 align = MAX (pi->align * BITS_PER_UNIT, align);
343 else if (TREE_CODE (addr) == ADDR_EXPR)
344 align = MAX (align, get_object_alignment (TREE_OPERAND (addr, 0), ~0U));
345 bitpos += mem_ref_offset (exp).low * BITS_PER_UNIT;
347 else if (TREE_CODE (exp) == TARGET_MEM_REF)
349 struct ptr_info_def *pi;
350 tree addr = TMR_BASE (exp);
351 if (TREE_CODE (addr) == BIT_AND_EXPR
352 && TREE_CODE (TREE_OPERAND (addr, 1)) == INTEGER_CST)
354 align = (TREE_INT_CST_LOW (TREE_OPERAND (addr, 1))
355 & -TREE_INT_CST_LOW (TREE_OPERAND (addr, 1)));
356 align *= BITS_PER_UNIT;
357 addr = TREE_OPERAND (addr, 0);
360 align = BITS_PER_UNIT;
361 if (TREE_CODE (addr) == SSA_NAME
362 && (pi = SSA_NAME_PTR_INFO (addr)))
364 bitpos += (pi->misalign * BITS_PER_UNIT) & ~(align - 1);
365 align = MAX (pi->align * BITS_PER_UNIT, align);
367 else if (TREE_CODE (addr) == ADDR_EXPR)
368 align = MAX (align, get_object_alignment (TREE_OPERAND (addr, 0), ~0U));
369 if (TMR_OFFSET (exp))
370 bitpos += TREE_INT_CST_LOW (TMR_OFFSET (exp)) * BITS_PER_UNIT;
371 if (TMR_INDEX (exp) && TMR_STEP (exp))
373 unsigned HOST_WIDE_INT step = TREE_INT_CST_LOW (TMR_STEP (exp));
374 align = MIN (align, (step & -step) * BITS_PER_UNIT);
376 else if (TMR_INDEX (exp))
377 align = BITS_PER_UNIT;
378 if (TMR_INDEX2 (exp))
379 align = BITS_PER_UNIT;
382 align = BITS_PER_UNIT;
384 /* If there is a non-constant offset part extract the maximum
385 alignment that can prevail. */
391 if (TREE_CODE (offset) == PLUS_EXPR)
393 next_offset = TREE_OPERAND (offset, 0);
394 offset = TREE_OPERAND (offset, 1);
398 if (host_integerp (offset, 1))
400 /* Any overflow in calculating offset_bits won't change
403 = ((unsigned) tree_low_cst (offset, 1) * BITS_PER_UNIT);
406 inner = MIN (inner, (offset_bits & -offset_bits));
408 else if (TREE_CODE (offset) == MULT_EXPR
409 && host_integerp (TREE_OPERAND (offset, 1), 1))
411 /* Any overflow in calculating offset_factor won't change
413 unsigned offset_factor
414 = ((unsigned) tree_low_cst (TREE_OPERAND (offset, 1), 1)
418 inner = MIN (inner, (offset_factor & -offset_factor));
422 inner = MIN (inner, BITS_PER_UNIT);
425 offset = next_offset;
428 /* Alignment is innermost object alignment adjusted by the constant
429 and non-constant offset parts. */
430 align = MIN (align, inner);
431 bitpos = bitpos & (align - 1);
437 /* Return the alignment in bits of EXP, an object.
438 Don't return more than MAX_ALIGN no matter what. */
441 get_object_alignment (tree exp, unsigned int max_align)
443 unsigned HOST_WIDE_INT bitpos = 0;
446 align = get_object_alignment_1 (exp, &bitpos);
448 /* align and bitpos now specify known low bits of the pointer.
449 ptr & (align - 1) == bitpos. */
452 align = (bitpos & -bitpos);
454 return MIN (align, max_align);
457 /* Returns true iff we can trust that alignment information has been
458 calculated properly. */
461 can_trust_pointer_alignment (void)
463 /* We rely on TER to compute accurate alignment information. */
464 return (optimize && flag_tree_ter);
467 /* Return the alignment in bits of EXP, a pointer valued expression.
468 But don't return more than MAX_ALIGN no matter what.
469 The alignment returned is, by default, the alignment of the thing that
470 EXP points to. If it is not a POINTER_TYPE, 0 is returned.
472 Otherwise, look at the expression to see if we can do better, i.e., if the
473 expression is actually pointing at an object whose alignment is tighter. */
476 get_pointer_alignment (tree exp, unsigned int max_align)
480 if (TREE_CODE (exp) == ADDR_EXPR)
481 return get_object_alignment (TREE_OPERAND (exp, 0), max_align);
482 else if (TREE_CODE (exp) == SSA_NAME
483 && POINTER_TYPE_P (TREE_TYPE (exp)))
485 struct ptr_info_def *pi = SSA_NAME_PTR_INFO (exp);
488 return BITS_PER_UNIT;
489 if (pi->misalign != 0)
490 align = (pi->misalign & -pi->misalign);
493 return MIN (max_align, align * BITS_PER_UNIT);
496 return POINTER_TYPE_P (TREE_TYPE (exp)) ? BITS_PER_UNIT : 0;
499 /* Compute the length of a C string. TREE_STRING_LENGTH is not the right
500 way, because it could contain a zero byte in the middle.
501 TREE_STRING_LENGTH is the size of the character array, not the string.
503 ONLY_VALUE should be nonzero if the result is not going to be emitted
504 into the instruction stream and zero if it is going to be expanded.
505 E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3
506 is returned, otherwise NULL, since
507 len = c_strlen (src, 1); if (len) expand_expr (len, ...); would not
508 evaluate the side-effects.
510 The value returned is of type `ssizetype'.
512 Unfortunately, string_constant can't access the values of const char
513 arrays with initializers, so neither can we do so here. */
516 c_strlen (tree src, int only_value)
519 HOST_WIDE_INT offset;
525 if (TREE_CODE (src) == COND_EXPR
526 && (only_value || !TREE_SIDE_EFFECTS (TREE_OPERAND (src, 0))))
530 len1 = c_strlen (TREE_OPERAND (src, 1), only_value);
531 len2 = c_strlen (TREE_OPERAND (src, 2), only_value);
532 if (tree_int_cst_equal (len1, len2))
536 if (TREE_CODE (src) == COMPOUND_EXPR
537 && (only_value || !TREE_SIDE_EFFECTS (TREE_OPERAND (src, 0))))
538 return c_strlen (TREE_OPERAND (src, 1), only_value);
540 loc = EXPR_LOC_OR_HERE (src);
542 src = string_constant (src, &offset_node);
546 max = TREE_STRING_LENGTH (src) - 1;
547 ptr = TREE_STRING_POINTER (src);
549 if (offset_node && TREE_CODE (offset_node) != INTEGER_CST)
551 /* If the string has an internal zero byte (e.g., "foo\0bar"), we can't
552 compute the offset to the following null if we don't know where to
553 start searching for it. */
556 for (i = 0; i < max; i++)
560 /* We don't know the starting offset, but we do know that the string
561 has no internal zero bytes. We can assume that the offset falls
562 within the bounds of the string; otherwise, the programmer deserves
563 what he gets. Subtract the offset from the length of the string,
564 and return that. This would perhaps not be valid if we were dealing
565 with named arrays in addition to literal string constants. */
567 return size_diffop_loc (loc, size_int (max), offset_node);
570 /* We have a known offset into the string. Start searching there for
571 a null character if we can represent it as a single HOST_WIDE_INT. */
572 if (offset_node == 0)
574 else if (! host_integerp (offset_node, 0))
577 offset = tree_low_cst (offset_node, 0);
579 /* If the offset is known to be out of bounds, warn, and call strlen at
581 if (offset < 0 || offset > max)
583 /* Suppress multiple warnings for propagated constant strings. */
584 if (! TREE_NO_WARNING (src))
586 warning_at (loc, 0, "offset outside bounds of constant string");
587 TREE_NO_WARNING (src) = 1;
592 /* Use strlen to search for the first zero byte. Since any strings
593 constructed with build_string will have nulls appended, we win even
594 if we get handed something like (char[4])"abcd".
596 Since OFFSET is our starting index into the string, no further
597 calculation is needed. */
598 return ssize_int (strlen (ptr + offset));
601 /* Return a char pointer for a C string if it is a string constant
602 or sum of string constant and integer constant. */
609 src = string_constant (src, &offset_node);
613 if (offset_node == 0)
614 return TREE_STRING_POINTER (src);
615 else if (!host_integerp (offset_node, 1)
616 || compare_tree_int (offset_node, TREE_STRING_LENGTH (src) - 1) > 0)
619 return TREE_STRING_POINTER (src) + tree_low_cst (offset_node, 1);
622 /* Return a CONST_INT or CONST_DOUBLE corresponding to target reading
623 GET_MODE_BITSIZE (MODE) bits from string constant STR. */
626 c_readstr (const char *str, enum machine_mode mode)
632 gcc_assert (GET_MODE_CLASS (mode) == MODE_INT);
637 for (i = 0; i < GET_MODE_SIZE (mode); i++)
640 if (WORDS_BIG_ENDIAN)
641 j = GET_MODE_SIZE (mode) - i - 1;
642 if (BYTES_BIG_ENDIAN != WORDS_BIG_ENDIAN
643 && GET_MODE_SIZE (mode) >= UNITS_PER_WORD)
644 j = j + UNITS_PER_WORD - 2 * (j % UNITS_PER_WORD) - 1;
646 gcc_assert (j < 2 * HOST_BITS_PER_WIDE_INT);
649 ch = (unsigned char) str[i];
650 c[j / HOST_BITS_PER_WIDE_INT] |= ch << (j % HOST_BITS_PER_WIDE_INT);
652 return immed_double_const (c[0], c[1], mode);
655 /* Cast a target constant CST to target CHAR and if that value fits into
656 host char type, return zero and put that value into variable pointed to by
660 target_char_cast (tree cst, char *p)
662 unsigned HOST_WIDE_INT val, hostval;
664 if (TREE_CODE (cst) != INTEGER_CST
665 || CHAR_TYPE_SIZE > HOST_BITS_PER_WIDE_INT)
668 val = TREE_INT_CST_LOW (cst);
669 if (CHAR_TYPE_SIZE < HOST_BITS_PER_WIDE_INT)
670 val &= (((unsigned HOST_WIDE_INT) 1) << CHAR_TYPE_SIZE) - 1;
673 if (HOST_BITS_PER_CHAR < HOST_BITS_PER_WIDE_INT)
674 hostval &= (((unsigned HOST_WIDE_INT) 1) << HOST_BITS_PER_CHAR) - 1;
683 /* Similar to save_expr, but assumes that arbitrary code is not executed
684 in between the multiple evaluations. In particular, we assume that a
685 non-addressable local variable will not be modified. */
688 builtin_save_expr (tree exp)
690 if (TREE_CODE (exp) == SSA_NAME
691 || (TREE_ADDRESSABLE (exp) == 0
692 && (TREE_CODE (exp) == PARM_DECL
693 || (TREE_CODE (exp) == VAR_DECL && !TREE_STATIC (exp)))))
696 return save_expr (exp);
699 /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT
700 times to get the address of either a higher stack frame, or a return
701 address located within it (depending on FNDECL_CODE). */
704 expand_builtin_return_addr (enum built_in_function fndecl_code, int count)
708 #ifdef INITIAL_FRAME_ADDRESS_RTX
709 rtx tem = INITIAL_FRAME_ADDRESS_RTX;
713 /* For a zero count with __builtin_return_address, we don't care what
714 frame address we return, because target-specific definitions will
715 override us. Therefore frame pointer elimination is OK, and using
716 the soft frame pointer is OK.
718 For a nonzero count, or a zero count with __builtin_frame_address,
719 we require a stable offset from the current frame pointer to the
720 previous one, so we must use the hard frame pointer, and
721 we must disable frame pointer elimination. */
722 if (count == 0 && fndecl_code == BUILT_IN_RETURN_ADDRESS)
723 tem = frame_pointer_rtx;
726 tem = hard_frame_pointer_rtx;
728 /* Tell reload not to eliminate the frame pointer. */
729 crtl->accesses_prior_frames = 1;
733 /* Some machines need special handling before we can access
734 arbitrary frames. For example, on the SPARC, we must first flush
735 all register windows to the stack. */
736 #ifdef SETUP_FRAME_ADDRESSES
738 SETUP_FRAME_ADDRESSES ();
741 /* On the SPARC, the return address is not in the frame, it is in a
742 register. There is no way to access it off of the current frame
743 pointer, but it can be accessed off the previous frame pointer by
744 reading the value from the register window save area. */
745 #ifdef RETURN_ADDR_IN_PREVIOUS_FRAME
746 if (fndecl_code == BUILT_IN_RETURN_ADDRESS)
750 /* Scan back COUNT frames to the specified frame. */
751 for (i = 0; i < count; i++)
753 /* Assume the dynamic chain pointer is in the word that the
754 frame address points to, unless otherwise specified. */
755 #ifdef DYNAMIC_CHAIN_ADDRESS
756 tem = DYNAMIC_CHAIN_ADDRESS (tem);
758 tem = memory_address (Pmode, tem);
759 tem = gen_frame_mem (Pmode, tem);
760 tem = copy_to_reg (tem);
763 /* For __builtin_frame_address, return what we've got. But, on
764 the SPARC for example, we may have to add a bias. */
765 if (fndecl_code == BUILT_IN_FRAME_ADDRESS)
766 #ifdef FRAME_ADDR_RTX
767 return FRAME_ADDR_RTX (tem);
772 /* For __builtin_return_address, get the return address from that frame. */
773 #ifdef RETURN_ADDR_RTX
774 tem = RETURN_ADDR_RTX (count, tem);
776 tem = memory_address (Pmode,
777 plus_constant (tem, GET_MODE_SIZE (Pmode)));
778 tem = gen_frame_mem (Pmode, tem);
783 /* Alias set used for setjmp buffer. */
784 static alias_set_type setjmp_alias_set = -1;
786 /* Construct the leading half of a __builtin_setjmp call. Control will
787 return to RECEIVER_LABEL. This is also called directly by the SJLJ
788 exception handling code. */
791 expand_builtin_setjmp_setup (rtx buf_addr, rtx receiver_label)
793 enum machine_mode sa_mode = STACK_SAVEAREA_MODE (SAVE_NONLOCAL);
797 if (setjmp_alias_set == -1)
798 setjmp_alias_set = new_alias_set ();
800 buf_addr = convert_memory_address (Pmode, buf_addr);
802 buf_addr = force_reg (Pmode, force_operand (buf_addr, NULL_RTX));
804 /* We store the frame pointer and the address of receiver_label in
805 the buffer and use the rest of it for the stack save area, which
806 is machine-dependent. */
808 mem = gen_rtx_MEM (Pmode, buf_addr);
809 set_mem_alias_set (mem, setjmp_alias_set);
810 emit_move_insn (mem, targetm.builtin_setjmp_frame_value ());
812 mem = gen_rtx_MEM (Pmode, plus_constant (buf_addr, GET_MODE_SIZE (Pmode))),
813 set_mem_alias_set (mem, setjmp_alias_set);
815 emit_move_insn (validize_mem (mem),
816 force_reg (Pmode, gen_rtx_LABEL_REF (Pmode, receiver_label)));
818 stack_save = gen_rtx_MEM (sa_mode,
819 plus_constant (buf_addr,
820 2 * GET_MODE_SIZE (Pmode)));
821 set_mem_alias_set (stack_save, setjmp_alias_set);
822 emit_stack_save (SAVE_NONLOCAL, &stack_save);
824 /* If there is further processing to do, do it. */
825 #ifdef HAVE_builtin_setjmp_setup
826 if (HAVE_builtin_setjmp_setup)
827 emit_insn (gen_builtin_setjmp_setup (buf_addr));
830 /* We have a nonlocal label. */
831 cfun->has_nonlocal_label = 1;
834 /* Construct the trailing part of a __builtin_setjmp call. This is
835 also called directly by the SJLJ exception handling code. */
838 expand_builtin_setjmp_receiver (rtx receiver_label ATTRIBUTE_UNUSED)
842 /* Clobber the FP when we get here, so we have to make sure it's
843 marked as used by this function. */
844 emit_use (hard_frame_pointer_rtx);
846 /* Mark the static chain as clobbered here so life information
847 doesn't get messed up for it. */
848 chain = targetm.calls.static_chain (current_function_decl, true);
849 if (chain && REG_P (chain))
850 emit_clobber (chain);
852 /* Now put in the code to restore the frame pointer, and argument
853 pointer, if needed. */
854 #ifdef HAVE_nonlocal_goto
855 if (! HAVE_nonlocal_goto)
858 emit_move_insn (virtual_stack_vars_rtx, hard_frame_pointer_rtx);
859 /* This might change the hard frame pointer in ways that aren't
860 apparent to early optimization passes, so force a clobber. */
861 emit_clobber (hard_frame_pointer_rtx);
864 #if !HARD_FRAME_POINTER_IS_ARG_POINTER
865 if (fixed_regs[ARG_POINTER_REGNUM])
867 #ifdef ELIMINABLE_REGS
869 static const struct elims {const int from, to;} elim_regs[] = ELIMINABLE_REGS;
871 for (i = 0; i < ARRAY_SIZE (elim_regs); i++)
872 if (elim_regs[i].from == ARG_POINTER_REGNUM
873 && elim_regs[i].to == HARD_FRAME_POINTER_REGNUM)
876 if (i == ARRAY_SIZE (elim_regs))
879 /* Now restore our arg pointer from the address at which it
880 was saved in our stack frame. */
881 emit_move_insn (crtl->args.internal_arg_pointer,
882 copy_to_reg (get_arg_pointer_save_area ()));
887 #ifdef HAVE_builtin_setjmp_receiver
888 if (HAVE_builtin_setjmp_receiver)
889 emit_insn (gen_builtin_setjmp_receiver (receiver_label));
892 #ifdef HAVE_nonlocal_goto_receiver
893 if (HAVE_nonlocal_goto_receiver)
894 emit_insn (gen_nonlocal_goto_receiver ());
899 /* We must not allow the code we just generated to be reordered by
900 scheduling. Specifically, the update of the frame pointer must
901 happen immediately, not later. */
902 emit_insn (gen_blockage ());
905 /* __builtin_longjmp is passed a pointer to an array of five words (not
906 all will be used on all machines). It operates similarly to the C
907 library function of the same name, but is more efficient. Much of
908 the code below is copied from the handling of non-local gotos. */
911 expand_builtin_longjmp (rtx buf_addr, rtx value)
913 rtx fp, lab, stack, insn, last;
914 enum machine_mode sa_mode = STACK_SAVEAREA_MODE (SAVE_NONLOCAL);
916 /* DRAP is needed for stack realign if longjmp is expanded to current
918 if (SUPPORTS_STACK_ALIGNMENT)
919 crtl->need_drap = true;
921 if (setjmp_alias_set == -1)
922 setjmp_alias_set = new_alias_set ();
924 buf_addr = convert_memory_address (Pmode, buf_addr);
926 buf_addr = force_reg (Pmode, buf_addr);
928 /* We require that the user must pass a second argument of 1, because
929 that is what builtin_setjmp will return. */
930 gcc_assert (value == const1_rtx);
932 last = get_last_insn ();
933 #ifdef HAVE_builtin_longjmp
934 if (HAVE_builtin_longjmp)
935 emit_insn (gen_builtin_longjmp (buf_addr));
939 fp = gen_rtx_MEM (Pmode, buf_addr);
940 lab = gen_rtx_MEM (Pmode, plus_constant (buf_addr,
941 GET_MODE_SIZE (Pmode)));
943 stack = gen_rtx_MEM (sa_mode, plus_constant (buf_addr,
944 2 * GET_MODE_SIZE (Pmode)));
945 set_mem_alias_set (fp, setjmp_alias_set);
946 set_mem_alias_set (lab, setjmp_alias_set);
947 set_mem_alias_set (stack, setjmp_alias_set);
949 /* Pick up FP, label, and SP from the block and jump. This code is
950 from expand_goto in stmt.c; see there for detailed comments. */
951 #ifdef HAVE_nonlocal_goto
952 if (HAVE_nonlocal_goto)
953 /* We have to pass a value to the nonlocal_goto pattern that will
954 get copied into the static_chain pointer, but it does not matter
955 what that value is, because builtin_setjmp does not use it. */
956 emit_insn (gen_nonlocal_goto (value, lab, stack, fp));
960 lab = copy_to_reg (lab);
962 emit_clobber (gen_rtx_MEM (BLKmode, gen_rtx_SCRATCH (VOIDmode)));
963 emit_clobber (gen_rtx_MEM (BLKmode, hard_frame_pointer_rtx));
965 emit_move_insn (hard_frame_pointer_rtx, fp);
966 emit_stack_restore (SAVE_NONLOCAL, stack);
968 emit_use (hard_frame_pointer_rtx);
969 emit_use (stack_pointer_rtx);
970 emit_indirect_jump (lab);
974 /* Search backwards and mark the jump insn as a non-local goto.
975 Note that this precludes the use of __builtin_longjmp to a
976 __builtin_setjmp target in the same function. However, we've
977 already cautioned the user that these functions are for
978 internal exception handling use only. */
979 for (insn = get_last_insn (); insn; insn = PREV_INSN (insn))
981 gcc_assert (insn != last);
985 add_reg_note (insn, REG_NON_LOCAL_GOTO, const0_rtx);
988 else if (CALL_P (insn))
993 /* Expand a call to __builtin_nonlocal_goto. We're passed the target label
994 and the address of the save area. */
997 expand_builtin_nonlocal_goto (tree exp)
999 tree t_label, t_save_area;
1000 rtx r_label, r_save_area, r_fp, r_sp, insn;
1002 if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
1005 t_label = CALL_EXPR_ARG (exp, 0);
1006 t_save_area = CALL_EXPR_ARG (exp, 1);
1008 r_label = expand_normal (t_label);
1009 r_label = convert_memory_address (Pmode, r_label);
1010 r_save_area = expand_normal (t_save_area);
1011 r_save_area = convert_memory_address (Pmode, r_save_area);
1012 /* Copy the address of the save location to a register just in case it was
1013 based on the frame pointer. */
1014 r_save_area = copy_to_reg (r_save_area);
1015 r_fp = gen_rtx_MEM (Pmode, r_save_area);
1016 r_sp = gen_rtx_MEM (STACK_SAVEAREA_MODE (SAVE_NONLOCAL),
1017 plus_constant (r_save_area, GET_MODE_SIZE (Pmode)));
1019 crtl->has_nonlocal_goto = 1;
1021 #ifdef HAVE_nonlocal_goto
1022 /* ??? We no longer need to pass the static chain value, afaik. */
1023 if (HAVE_nonlocal_goto)
1024 emit_insn (gen_nonlocal_goto (const0_rtx, r_label, r_sp, r_fp));
1028 r_label = copy_to_reg (r_label);
1030 emit_clobber (gen_rtx_MEM (BLKmode, gen_rtx_SCRATCH (VOIDmode)));
1031 emit_clobber (gen_rtx_MEM (BLKmode, hard_frame_pointer_rtx));
1033 /* Restore frame pointer for containing function. */
1034 emit_move_insn (hard_frame_pointer_rtx, r_fp);
1035 emit_stack_restore (SAVE_NONLOCAL, r_sp);
1037 /* USE of hard_frame_pointer_rtx added for consistency;
1038 not clear if really needed. */
1039 emit_use (hard_frame_pointer_rtx);
1040 emit_use (stack_pointer_rtx);
1042 /* If the architecture is using a GP register, we must
1043 conservatively assume that the target function makes use of it.
1044 The prologue of functions with nonlocal gotos must therefore
1045 initialize the GP register to the appropriate value, and we
1046 must then make sure that this value is live at the point
1047 of the jump. (Note that this doesn't necessarily apply
1048 to targets with a nonlocal_goto pattern; they are free
1049 to implement it in their own way. Note also that this is
1050 a no-op if the GP register is a global invariant.) */
1051 if ((unsigned) PIC_OFFSET_TABLE_REGNUM != INVALID_REGNUM
1052 && fixed_regs[PIC_OFFSET_TABLE_REGNUM])
1053 emit_use (pic_offset_table_rtx);
1055 emit_indirect_jump (r_label);
1058 /* Search backwards to the jump insn and mark it as a
1060 for (insn = get_last_insn (); insn; insn = PREV_INSN (insn))
1064 add_reg_note (insn, REG_NON_LOCAL_GOTO, const0_rtx);
1067 else if (CALL_P (insn))
1074 /* __builtin_update_setjmp_buf is passed a pointer to an array of five words
1075 (not all will be used on all machines) that was passed to __builtin_setjmp.
1076 It updates the stack pointer in that block to correspond to the current
1080 expand_builtin_update_setjmp_buf (rtx buf_addr)
1082 enum machine_mode sa_mode = STACK_SAVEAREA_MODE (SAVE_NONLOCAL);
1084 = gen_rtx_MEM (sa_mode,
1087 plus_constant (buf_addr, 2 * GET_MODE_SIZE (Pmode))));
1089 emit_stack_save (SAVE_NONLOCAL, &stack_save);
1092 /* Expand a call to __builtin_prefetch. For a target that does not support
1093 data prefetch, evaluate the memory address argument in case it has side
1097 expand_builtin_prefetch (tree exp)
1099 tree arg0, arg1, arg2;
1103 if (!validate_arglist (exp, POINTER_TYPE, 0))
1106 arg0 = CALL_EXPR_ARG (exp, 0);
1108 /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
1109 zero (read) and argument 2 (locality) defaults to 3 (high degree of
1111 nargs = call_expr_nargs (exp);
1113 arg1 = CALL_EXPR_ARG (exp, 1);
1115 arg1 = integer_zero_node;
1117 arg2 = CALL_EXPR_ARG (exp, 2);
1119 arg2 = integer_three_node;
1121 /* Argument 0 is an address. */
1122 op0 = expand_expr (arg0, NULL_RTX, Pmode, EXPAND_NORMAL);
1124 /* Argument 1 (read/write flag) must be a compile-time constant int. */
1125 if (TREE_CODE (arg1) != INTEGER_CST)
1127 error ("second argument to %<__builtin_prefetch%> must be a constant");
1128 arg1 = integer_zero_node;
1130 op1 = expand_normal (arg1);
1131 /* Argument 1 must be either zero or one. */
1132 if (INTVAL (op1) != 0 && INTVAL (op1) != 1)
1134 warning (0, "invalid second argument to %<__builtin_prefetch%>;"
1139 /* Argument 2 (locality) must be a compile-time constant int. */
1140 if (TREE_CODE (arg2) != INTEGER_CST)
1142 error ("third argument to %<__builtin_prefetch%> must be a constant");
1143 arg2 = integer_zero_node;
1145 op2 = expand_normal (arg2);
1146 /* Argument 2 must be 0, 1, 2, or 3. */
1147 if (INTVAL (op2) < 0 || INTVAL (op2) > 3)
1149 warning (0, "invalid third argument to %<__builtin_prefetch%>; using zero");
1153 #ifdef HAVE_prefetch
1156 struct expand_operand ops[3];
1158 create_address_operand (&ops[0], op0);
1159 create_integer_operand (&ops[1], INTVAL (op1));
1160 create_integer_operand (&ops[2], INTVAL (op2));
1161 if (maybe_expand_insn (CODE_FOR_prefetch, 3, ops))
1166 /* Don't do anything with direct references to volatile memory, but
1167 generate code to handle other side effects. */
1168 if (!MEM_P (op0) && side_effects_p (op0))
1172 /* Get a MEM rtx for expression EXP which is the address of an operand
1173 to be used in a string instruction (cmpstrsi, movmemsi, ..). LEN is
1174 the maximum length of the block of memory that might be accessed or
1178 get_memory_rtx (tree exp, tree len)
1180 tree orig_exp = exp;
1184 /* When EXP is not resolved SAVE_EXPR, MEM_ATTRS can be still derived
1185 from its expression, for expr->a.b only <variable>.a.b is recorded. */
1186 if (TREE_CODE (exp) == SAVE_EXPR && !SAVE_EXPR_RESOLVED_P (exp))
1187 exp = TREE_OPERAND (exp, 0);
1189 addr = expand_expr (orig_exp, NULL_RTX, ptr_mode, EXPAND_NORMAL);
1190 mem = gen_rtx_MEM (BLKmode, memory_address (BLKmode, addr));
1192 /* Get an expression we can use to find the attributes to assign to MEM.
1193 If it is an ADDR_EXPR, use the operand. Otherwise, dereference it if
1194 we can. First remove any nops. */
1195 while (CONVERT_EXPR_P (exp)
1196 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (exp, 0))))
1197 exp = TREE_OPERAND (exp, 0);
1200 if (TREE_CODE (exp) == POINTER_PLUS_EXPR
1201 && TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
1202 && host_integerp (TREE_OPERAND (exp, 1), 0)
1203 && (off = tree_low_cst (TREE_OPERAND (exp, 1), 0)) > 0)
1204 exp = TREE_OPERAND (TREE_OPERAND (exp, 0), 0);
1205 else if (TREE_CODE (exp) == ADDR_EXPR)
1206 exp = TREE_OPERAND (exp, 0);
1207 else if (POINTER_TYPE_P (TREE_TYPE (exp)))
1208 exp = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (exp)), exp);
1212 /* Honor attributes derived from exp, except for the alias set
1213 (as builtin stringops may alias with anything) and the size
1214 (as stringops may access multiple array elements). */
1217 set_mem_attributes (mem, exp, 0);
1220 mem = adjust_automodify_address_nv (mem, BLKmode, NULL, off);
1222 /* Allow the string and memory builtins to overflow from one
1223 field into another, see http://gcc.gnu.org/PR23561.
1224 Thus avoid COMPONENT_REFs in MEM_EXPR unless we know the whole
1225 memory accessed by the string or memory builtin will fit
1226 within the field. */
1227 if (MEM_EXPR (mem) && TREE_CODE (MEM_EXPR (mem)) == COMPONENT_REF)
1229 tree mem_expr = MEM_EXPR (mem);
1230 HOST_WIDE_INT offset = -1, length = -1;
1233 while (TREE_CODE (inner) == ARRAY_REF
1234 || CONVERT_EXPR_P (inner)
1235 || TREE_CODE (inner) == VIEW_CONVERT_EXPR
1236 || TREE_CODE (inner) == SAVE_EXPR)
1237 inner = TREE_OPERAND (inner, 0);
1239 gcc_assert (TREE_CODE (inner) == COMPONENT_REF);
1241 if (MEM_OFFSET (mem)
1242 && CONST_INT_P (MEM_OFFSET (mem)))
1243 offset = INTVAL (MEM_OFFSET (mem));
1245 if (offset >= 0 && len && host_integerp (len, 0))
1246 length = tree_low_cst (len, 0);
1248 while (TREE_CODE (inner) == COMPONENT_REF)
1250 tree field = TREE_OPERAND (inner, 1);
1251 gcc_assert (TREE_CODE (mem_expr) == COMPONENT_REF);
1252 gcc_assert (field == TREE_OPERAND (mem_expr, 1));
1254 /* Bitfields are generally not byte-addressable. */
1255 gcc_assert (!DECL_BIT_FIELD (field)
1256 || ((tree_low_cst (DECL_FIELD_BIT_OFFSET (field), 1)
1257 % BITS_PER_UNIT) == 0
1258 && host_integerp (DECL_SIZE (field), 0)
1259 && (TREE_INT_CST_LOW (DECL_SIZE (field))
1260 % BITS_PER_UNIT) == 0));
1262 /* If we can prove that the memory starting at XEXP (mem, 0) and
1263 ending at XEXP (mem, 0) + LENGTH will fit into this field, we
1264 can keep the COMPONENT_REF in MEM_EXPR. But be careful with
1265 fields without DECL_SIZE_UNIT like flexible array members. */
1267 && DECL_SIZE_UNIT (field)
1268 && host_integerp (DECL_SIZE_UNIT (field), 0))
1271 = TREE_INT_CST_LOW (DECL_SIZE_UNIT (field));
1274 && offset + length <= size)
1279 && host_integerp (DECL_FIELD_OFFSET (field), 0))
1280 offset += TREE_INT_CST_LOW (DECL_FIELD_OFFSET (field))
1281 + tree_low_cst (DECL_FIELD_BIT_OFFSET (field), 1)
1289 mem_expr = TREE_OPERAND (mem_expr, 0);
1290 inner = TREE_OPERAND (inner, 0);
1293 if (mem_expr == NULL)
1295 if (mem_expr != MEM_EXPR (mem))
1297 set_mem_expr (mem, mem_expr);
1298 set_mem_offset (mem, offset >= 0 ? GEN_INT (offset) : NULL_RTX);
1301 set_mem_alias_set (mem, 0);
1302 set_mem_size (mem, NULL_RTX);
1308 /* Built-in functions to perform an untyped call and return. */
1310 #define apply_args_mode \
1311 (this_target_builtins->x_apply_args_mode)
1312 #define apply_result_mode \
1313 (this_target_builtins->x_apply_result_mode)
1315 /* Return the size required for the block returned by __builtin_apply_args,
1316 and initialize apply_args_mode. */
1319 apply_args_size (void)
1321 static int size = -1;
1324 enum machine_mode mode;
1326 /* The values computed by this function never change. */
1329 /* The first value is the incoming arg-pointer. */
1330 size = GET_MODE_SIZE (Pmode);
1332 /* The second value is the structure value address unless this is
1333 passed as an "invisible" first argument. */
1334 if (targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0))
1335 size += GET_MODE_SIZE (Pmode);
1337 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1338 if (FUNCTION_ARG_REGNO_P (regno))
1340 mode = targetm.calls.get_raw_arg_mode (regno);
1342 gcc_assert (mode != VOIDmode);
1344 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1345 if (size % align != 0)
1346 size = CEIL (size, align) * align;
1347 size += GET_MODE_SIZE (mode);
1348 apply_args_mode[regno] = mode;
1352 apply_args_mode[regno] = VOIDmode;
1358 /* Return the size required for the block returned by __builtin_apply,
1359 and initialize apply_result_mode. */
1362 apply_result_size (void)
1364 static int size = -1;
1366 enum machine_mode mode;
1368 /* The values computed by this function never change. */
1373 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1374 if (targetm.calls.function_value_regno_p (regno))
1376 mode = targetm.calls.get_raw_result_mode (regno);
1378 gcc_assert (mode != VOIDmode);
1380 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1381 if (size % align != 0)
1382 size = CEIL (size, align) * align;
1383 size += GET_MODE_SIZE (mode);
1384 apply_result_mode[regno] = mode;
1387 apply_result_mode[regno] = VOIDmode;
1389 /* Allow targets that use untyped_call and untyped_return to override
1390 the size so that machine-specific information can be stored here. */
1391 #ifdef APPLY_RESULT_SIZE
1392 size = APPLY_RESULT_SIZE;
1398 #if defined (HAVE_untyped_call) || defined (HAVE_untyped_return)
1399 /* Create a vector describing the result block RESULT. If SAVEP is true,
1400 the result block is used to save the values; otherwise it is used to
1401 restore the values. */
1404 result_vector (int savep, rtx result)
1406 int regno, size, align, nelts;
1407 enum machine_mode mode;
1409 rtx *savevec = XALLOCAVEC (rtx, FIRST_PSEUDO_REGISTER);
1412 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1413 if ((mode = apply_result_mode[regno]) != VOIDmode)
1415 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1416 if (size % align != 0)
1417 size = CEIL (size, align) * align;
1418 reg = gen_rtx_REG (mode, savep ? regno : INCOMING_REGNO (regno));
1419 mem = adjust_address (result, mode, size);
1420 savevec[nelts++] = (savep
1421 ? gen_rtx_SET (VOIDmode, mem, reg)
1422 : gen_rtx_SET (VOIDmode, reg, mem));
1423 size += GET_MODE_SIZE (mode);
1425 return gen_rtx_PARALLEL (VOIDmode, gen_rtvec_v (nelts, savevec));
1427 #endif /* HAVE_untyped_call or HAVE_untyped_return */
1429 /* Save the state required to perform an untyped call with the same
1430 arguments as were passed to the current function. */
1433 expand_builtin_apply_args_1 (void)
1436 int size, align, regno;
1437 enum machine_mode mode;
1438 rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1440 /* Create a block where the arg-pointer, structure value address,
1441 and argument registers can be saved. */
1442 registers = assign_stack_local (BLKmode, apply_args_size (), -1);
1444 /* Walk past the arg-pointer and structure value address. */
1445 size = GET_MODE_SIZE (Pmode);
1446 if (targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0))
1447 size += GET_MODE_SIZE (Pmode);
1449 /* Save each register used in calling a function to the block. */
1450 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1451 if ((mode = apply_args_mode[regno]) != VOIDmode)
1453 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1454 if (size % align != 0)
1455 size = CEIL (size, align) * align;
1457 tem = gen_rtx_REG (mode, INCOMING_REGNO (regno));
1459 emit_move_insn (adjust_address (registers, mode, size), tem);
1460 size += GET_MODE_SIZE (mode);
1463 /* Save the arg pointer to the block. */
1464 tem = copy_to_reg (crtl->args.internal_arg_pointer);
1465 #ifdef STACK_GROWS_DOWNWARD
1466 /* We need the pointer as the caller actually passed them to us, not
1467 as we might have pretended they were passed. Make sure it's a valid
1468 operand, as emit_move_insn isn't expected to handle a PLUS. */
1470 = force_operand (plus_constant (tem, crtl->args.pretend_args_size),
1473 emit_move_insn (adjust_address (registers, Pmode, 0), tem);
1475 size = GET_MODE_SIZE (Pmode);
1477 /* Save the structure value address unless this is passed as an
1478 "invisible" first argument. */
1479 if (struct_incoming_value)
1481 emit_move_insn (adjust_address (registers, Pmode, size),
1482 copy_to_reg (struct_incoming_value));
1483 size += GET_MODE_SIZE (Pmode);
1486 /* Return the address of the block. */
1487 return copy_addr_to_reg (XEXP (registers, 0));
1490 /* __builtin_apply_args returns block of memory allocated on
1491 the stack into which is stored the arg pointer, structure
1492 value address, static chain, and all the registers that might
1493 possibly be used in performing a function call. The code is
1494 moved to the start of the function so the incoming values are
1498 expand_builtin_apply_args (void)
1500 /* Don't do __builtin_apply_args more than once in a function.
1501 Save the result of the first call and reuse it. */
1502 if (apply_args_value != 0)
1503 return apply_args_value;
1505 /* When this function is called, it means that registers must be
1506 saved on entry to this function. So we migrate the
1507 call to the first insn of this function. */
1512 temp = expand_builtin_apply_args_1 ();
1516 apply_args_value = temp;
1518 /* Put the insns after the NOTE that starts the function.
1519 If this is inside a start_sequence, make the outer-level insn
1520 chain current, so the code is placed at the start of the
1521 function. If internal_arg_pointer is a non-virtual pseudo,
1522 it needs to be placed after the function that initializes
1524 push_topmost_sequence ();
1525 if (REG_P (crtl->args.internal_arg_pointer)
1526 && REGNO (crtl->args.internal_arg_pointer) > LAST_VIRTUAL_REGISTER)
1527 emit_insn_before (seq, parm_birth_insn);
1529 emit_insn_before (seq, NEXT_INSN (entry_of_function ()));
1530 pop_topmost_sequence ();
1535 /* Perform an untyped call and save the state required to perform an
1536 untyped return of whatever value was returned by the given function. */
1539 expand_builtin_apply (rtx function, rtx arguments, rtx argsize)
1541 int size, align, regno;
1542 enum machine_mode mode;
1543 rtx incoming_args, result, reg, dest, src, call_insn;
1544 rtx old_stack_level = 0;
1545 rtx call_fusage = 0;
1546 rtx struct_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0);
1548 arguments = convert_memory_address (Pmode, arguments);
1550 /* Create a block where the return registers can be saved. */
1551 result = assign_stack_local (BLKmode, apply_result_size (), -1);
1553 /* Fetch the arg pointer from the ARGUMENTS block. */
1554 incoming_args = gen_reg_rtx (Pmode);
1555 emit_move_insn (incoming_args, gen_rtx_MEM (Pmode, arguments));
1556 #ifndef STACK_GROWS_DOWNWARD
1557 incoming_args = expand_simple_binop (Pmode, MINUS, incoming_args, argsize,
1558 incoming_args, 0, OPTAB_LIB_WIDEN);
1561 /* Push a new argument block and copy the arguments. Do not allow
1562 the (potential) memcpy call below to interfere with our stack
1564 do_pending_stack_adjust ();
1567 /* Save the stack with nonlocal if available. */
1568 #ifdef HAVE_save_stack_nonlocal
1569 if (HAVE_save_stack_nonlocal)
1570 emit_stack_save (SAVE_NONLOCAL, &old_stack_level);
1573 emit_stack_save (SAVE_BLOCK, &old_stack_level);
1575 /* Allocate a block of memory onto the stack and copy the memory
1576 arguments to the outgoing arguments address. We can pass TRUE
1577 as the 4th argument because we just saved the stack pointer
1578 and will restore it right after the call. */
1579 allocate_dynamic_stack_space (argsize, 0, BIGGEST_ALIGNMENT, true);
1581 /* Set DRAP flag to true, even though allocate_dynamic_stack_space
1582 may have already set current_function_calls_alloca to true.
1583 current_function_calls_alloca won't be set if argsize is zero,
1584 so we have to guarantee need_drap is true here. */
1585 if (SUPPORTS_STACK_ALIGNMENT)
1586 crtl->need_drap = true;
1588 dest = virtual_outgoing_args_rtx;
1589 #ifndef STACK_GROWS_DOWNWARD
1590 if (CONST_INT_P (argsize))
1591 dest = plus_constant (dest, -INTVAL (argsize));
1593 dest = gen_rtx_PLUS (Pmode, dest, negate_rtx (Pmode, argsize));
1595 dest = gen_rtx_MEM (BLKmode, dest);
1596 set_mem_align (dest, PARM_BOUNDARY);
1597 src = gen_rtx_MEM (BLKmode, incoming_args);
1598 set_mem_align (src, PARM_BOUNDARY);
1599 emit_block_move (dest, src, argsize, BLOCK_OP_NORMAL);
1601 /* Refer to the argument block. */
1603 arguments = gen_rtx_MEM (BLKmode, arguments);
1604 set_mem_align (arguments, PARM_BOUNDARY);
1606 /* Walk past the arg-pointer and structure value address. */
1607 size = GET_MODE_SIZE (Pmode);
1609 size += GET_MODE_SIZE (Pmode);
1611 /* Restore each of the registers previously saved. Make USE insns
1612 for each of these registers for use in making the call. */
1613 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1614 if ((mode = apply_args_mode[regno]) != VOIDmode)
1616 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1617 if (size % align != 0)
1618 size = CEIL (size, align) * align;
1619 reg = gen_rtx_REG (mode, regno);
1620 emit_move_insn (reg, adjust_address (arguments, mode, size));
1621 use_reg (&call_fusage, reg);
1622 size += GET_MODE_SIZE (mode);
1625 /* Restore the structure value address unless this is passed as an
1626 "invisible" first argument. */
1627 size = GET_MODE_SIZE (Pmode);
1630 rtx value = gen_reg_rtx (Pmode);
1631 emit_move_insn (value, adjust_address (arguments, Pmode, size));
1632 emit_move_insn (struct_value, value);
1633 if (REG_P (struct_value))
1634 use_reg (&call_fusage, struct_value);
1635 size += GET_MODE_SIZE (Pmode);
1638 /* All arguments and registers used for the call are set up by now! */
1639 function = prepare_call_address (NULL, function, NULL, &call_fusage, 0, 0);
1641 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1642 and we don't want to load it into a register as an optimization,
1643 because prepare_call_address already did it if it should be done. */
1644 if (GET_CODE (function) != SYMBOL_REF)
1645 function = memory_address (FUNCTION_MODE, function);
1647 /* Generate the actual call instruction and save the return value. */
1648 #ifdef HAVE_untyped_call
1649 if (HAVE_untyped_call)
1650 emit_call_insn (gen_untyped_call (gen_rtx_MEM (FUNCTION_MODE, function),
1651 result, result_vector (1, result)));
1654 #ifdef HAVE_call_value
1655 if (HAVE_call_value)
1659 /* Locate the unique return register. It is not possible to
1660 express a call that sets more than one return register using
1661 call_value; use untyped_call for that. In fact, untyped_call
1662 only needs to save the return registers in the given block. */
1663 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1664 if ((mode = apply_result_mode[regno]) != VOIDmode)
1666 gcc_assert (!valreg); /* HAVE_untyped_call required. */
1668 valreg = gen_rtx_REG (mode, regno);
1671 emit_call_insn (GEN_CALL_VALUE (valreg,
1672 gen_rtx_MEM (FUNCTION_MODE, function),
1673 const0_rtx, NULL_RTX, const0_rtx));
1675 emit_move_insn (adjust_address (result, GET_MODE (valreg), 0), valreg);
1681 /* Find the CALL insn we just emitted, and attach the register usage
1683 call_insn = last_call_insn ();
1684 add_function_usage_to (call_insn, call_fusage);
1686 /* Restore the stack. */
1687 #ifdef HAVE_save_stack_nonlocal
1688 if (HAVE_save_stack_nonlocal)
1689 emit_stack_restore (SAVE_NONLOCAL, old_stack_level);
1692 emit_stack_restore (SAVE_BLOCK, old_stack_level);
1696 /* Return the address of the result block. */
1697 result = copy_addr_to_reg (XEXP (result, 0));
1698 return convert_memory_address (ptr_mode, result);
1701 /* Perform an untyped return. */
1704 expand_builtin_return (rtx result)
1706 int size, align, regno;
1707 enum machine_mode mode;
1709 rtx call_fusage = 0;
1711 result = convert_memory_address (Pmode, result);
1713 apply_result_size ();
1714 result = gen_rtx_MEM (BLKmode, result);
1716 #ifdef HAVE_untyped_return
1717 if (HAVE_untyped_return)
1719 emit_jump_insn (gen_untyped_return (result, result_vector (0, result)));
1725 /* Restore the return value and note that each value is used. */
1727 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1728 if ((mode = apply_result_mode[regno]) != VOIDmode)
1730 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1731 if (size % align != 0)
1732 size = CEIL (size, align) * align;
1733 reg = gen_rtx_REG (mode, INCOMING_REGNO (regno));
1734 emit_move_insn (reg, adjust_address (result, mode, size));
1736 push_to_sequence (call_fusage);
1738 call_fusage = get_insns ();
1740 size += GET_MODE_SIZE (mode);
1743 /* Put the USE insns before the return. */
1744 emit_insn (call_fusage);
1746 /* Return whatever values was restored by jumping directly to the end
1748 expand_naked_return ();
1751 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1753 static enum type_class
1754 type_to_class (tree type)
1756 switch (TREE_CODE (type))
1758 case VOID_TYPE: return void_type_class;
1759 case INTEGER_TYPE: return integer_type_class;
1760 case ENUMERAL_TYPE: return enumeral_type_class;
1761 case BOOLEAN_TYPE: return boolean_type_class;
1762 case POINTER_TYPE: return pointer_type_class;
1763 case REFERENCE_TYPE: return reference_type_class;
1764 case OFFSET_TYPE: return offset_type_class;
1765 case REAL_TYPE: return real_type_class;
1766 case COMPLEX_TYPE: return complex_type_class;
1767 case FUNCTION_TYPE: return function_type_class;
1768 case METHOD_TYPE: return method_type_class;
1769 case RECORD_TYPE: return record_type_class;
1771 case QUAL_UNION_TYPE: return union_type_class;
1772 case ARRAY_TYPE: return (TYPE_STRING_FLAG (type)
1773 ? string_type_class : array_type_class);
1774 case LANG_TYPE: return lang_type_class;
1775 default: return no_type_class;
1779 /* Expand a call EXP to __builtin_classify_type. */
1782 expand_builtin_classify_type (tree exp)
1784 if (call_expr_nargs (exp))
1785 return GEN_INT (type_to_class (TREE_TYPE (CALL_EXPR_ARG (exp, 0))));
1786 return GEN_INT (no_type_class);
1789 /* This helper macro, meant to be used in mathfn_built_in below,
1790 determines which among a set of three builtin math functions is
1791 appropriate for a given type mode. The `F' and `L' cases are
1792 automatically generated from the `double' case. */
1793 #define CASE_MATHFN(BUILT_IN_MATHFN) \
1794 case BUILT_IN_MATHFN: case BUILT_IN_MATHFN##F: case BUILT_IN_MATHFN##L: \
1795 fcode = BUILT_IN_MATHFN; fcodef = BUILT_IN_MATHFN##F ; \
1796 fcodel = BUILT_IN_MATHFN##L ; break;
1797 /* Similar to above, but appends _R after any F/L suffix. */
1798 #define CASE_MATHFN_REENT(BUILT_IN_MATHFN) \
1799 case BUILT_IN_MATHFN##_R: case BUILT_IN_MATHFN##F_R: case BUILT_IN_MATHFN##L_R: \
1800 fcode = BUILT_IN_MATHFN##_R; fcodef = BUILT_IN_MATHFN##F_R ; \
1801 fcodel = BUILT_IN_MATHFN##L_R ; break;
1803 /* Return mathematic function equivalent to FN but operating directly
1804 on TYPE, if available. If IMPLICIT is true find the function in
1805 implicit_built_in_decls[], otherwise use built_in_decls[]. If we
1806 can't do the conversion, return zero. */
1809 mathfn_built_in_1 (tree type, enum built_in_function fn, bool implicit)
1811 tree const *const fn_arr
1812 = implicit ? implicit_built_in_decls : built_in_decls;
1813 enum built_in_function fcode, fcodef, fcodel;
1817 CASE_MATHFN (BUILT_IN_ACOS)
1818 CASE_MATHFN (BUILT_IN_ACOSH)
1819 CASE_MATHFN (BUILT_IN_ASIN)
1820 CASE_MATHFN (BUILT_IN_ASINH)
1821 CASE_MATHFN (BUILT_IN_ATAN)
1822 CASE_MATHFN (BUILT_IN_ATAN2)
1823 CASE_MATHFN (BUILT_IN_ATANH)
1824 CASE_MATHFN (BUILT_IN_CBRT)
1825 CASE_MATHFN (BUILT_IN_CEIL)
1826 CASE_MATHFN (BUILT_IN_CEXPI)
1827 CASE_MATHFN (BUILT_IN_COPYSIGN)
1828 CASE_MATHFN (BUILT_IN_COS)
1829 CASE_MATHFN (BUILT_IN_COSH)
1830 CASE_MATHFN (BUILT_IN_DREM)
1831 CASE_MATHFN (BUILT_IN_ERF)
1832 CASE_MATHFN (BUILT_IN_ERFC)
1833 CASE_MATHFN (BUILT_IN_EXP)
1834 CASE_MATHFN (BUILT_IN_EXP10)
1835 CASE_MATHFN (BUILT_IN_EXP2)
1836 CASE_MATHFN (BUILT_IN_EXPM1)
1837 CASE_MATHFN (BUILT_IN_FABS)
1838 CASE_MATHFN (BUILT_IN_FDIM)
1839 CASE_MATHFN (BUILT_IN_FLOOR)
1840 CASE_MATHFN (BUILT_IN_FMA)
1841 CASE_MATHFN (BUILT_IN_FMAX)
1842 CASE_MATHFN (BUILT_IN_FMIN)
1843 CASE_MATHFN (BUILT_IN_FMOD)
1844 CASE_MATHFN (BUILT_IN_FREXP)
1845 CASE_MATHFN (BUILT_IN_GAMMA)
1846 CASE_MATHFN_REENT (BUILT_IN_GAMMA) /* GAMMA_R */
1847 CASE_MATHFN (BUILT_IN_HUGE_VAL)
1848 CASE_MATHFN (BUILT_IN_HYPOT)
1849 CASE_MATHFN (BUILT_IN_ILOGB)
1850 CASE_MATHFN (BUILT_IN_INF)
1851 CASE_MATHFN (BUILT_IN_ISINF)
1852 CASE_MATHFN (BUILT_IN_J0)
1853 CASE_MATHFN (BUILT_IN_J1)
1854 CASE_MATHFN (BUILT_IN_JN)
1855 CASE_MATHFN (BUILT_IN_LCEIL)
1856 CASE_MATHFN (BUILT_IN_LDEXP)
1857 CASE_MATHFN (BUILT_IN_LFLOOR)
1858 CASE_MATHFN (BUILT_IN_LGAMMA)
1859 CASE_MATHFN_REENT (BUILT_IN_LGAMMA) /* LGAMMA_R */
1860 CASE_MATHFN (BUILT_IN_LLCEIL)
1861 CASE_MATHFN (BUILT_IN_LLFLOOR)
1862 CASE_MATHFN (BUILT_IN_LLRINT)
1863 CASE_MATHFN (BUILT_IN_LLROUND)
1864 CASE_MATHFN (BUILT_IN_LOG)
1865 CASE_MATHFN (BUILT_IN_LOG10)
1866 CASE_MATHFN (BUILT_IN_LOG1P)
1867 CASE_MATHFN (BUILT_IN_LOG2)
1868 CASE_MATHFN (BUILT_IN_LOGB)
1869 CASE_MATHFN (BUILT_IN_LRINT)
1870 CASE_MATHFN (BUILT_IN_LROUND)
1871 CASE_MATHFN (BUILT_IN_MODF)
1872 CASE_MATHFN (BUILT_IN_NAN)
1873 CASE_MATHFN (BUILT_IN_NANS)
1874 CASE_MATHFN (BUILT_IN_NEARBYINT)
1875 CASE_MATHFN (BUILT_IN_NEXTAFTER)
1876 CASE_MATHFN (BUILT_IN_NEXTTOWARD)
1877 CASE_MATHFN (BUILT_IN_POW)
1878 CASE_MATHFN (BUILT_IN_POWI)
1879 CASE_MATHFN (BUILT_IN_POW10)
1880 CASE_MATHFN (BUILT_IN_REMAINDER)
1881 CASE_MATHFN (BUILT_IN_REMQUO)
1882 CASE_MATHFN (BUILT_IN_RINT)
1883 CASE_MATHFN (BUILT_IN_ROUND)
1884 CASE_MATHFN (BUILT_IN_SCALB)
1885 CASE_MATHFN (BUILT_IN_SCALBLN)
1886 CASE_MATHFN (BUILT_IN_SCALBN)
1887 CASE_MATHFN (BUILT_IN_SIGNBIT)
1888 CASE_MATHFN (BUILT_IN_SIGNIFICAND)
1889 CASE_MATHFN (BUILT_IN_SIN)
1890 CASE_MATHFN (BUILT_IN_SINCOS)
1891 CASE_MATHFN (BUILT_IN_SINH)
1892 CASE_MATHFN (BUILT_IN_SQRT)
1893 CASE_MATHFN (BUILT_IN_TAN)
1894 CASE_MATHFN (BUILT_IN_TANH)
1895 CASE_MATHFN (BUILT_IN_TGAMMA)
1896 CASE_MATHFN (BUILT_IN_TRUNC)
1897 CASE_MATHFN (BUILT_IN_Y0)
1898 CASE_MATHFN (BUILT_IN_Y1)
1899 CASE_MATHFN (BUILT_IN_YN)
1905 if (TYPE_MAIN_VARIANT (type) == double_type_node)
1906 return fn_arr[fcode];
1907 else if (TYPE_MAIN_VARIANT (type) == float_type_node)
1908 return fn_arr[fcodef];
1909 else if (TYPE_MAIN_VARIANT (type) == long_double_type_node)
1910 return fn_arr[fcodel];
1915 /* Like mathfn_built_in_1(), but always use the implicit array. */
1918 mathfn_built_in (tree type, enum built_in_function fn)
1920 return mathfn_built_in_1 (type, fn, /*implicit=*/ 1);
1923 /* If errno must be maintained, expand the RTL to check if the result,
1924 TARGET, of a built-in function call, EXP, is NaN, and if so set
1928 expand_errno_check (tree exp, rtx target)
1930 rtx lab = gen_label_rtx ();
1932 /* Test the result; if it is NaN, set errno=EDOM because
1933 the argument was not in the domain. */
1934 do_compare_rtx_and_jump (target, target, EQ, 0, GET_MODE (target),
1935 NULL_RTX, NULL_RTX, lab,
1936 /* The jump is very likely. */
1937 REG_BR_PROB_BASE - (REG_BR_PROB_BASE / 2000 - 1));
1940 /* If this built-in doesn't throw an exception, set errno directly. */
1941 if (TREE_NOTHROW (TREE_OPERAND (CALL_EXPR_FN (exp), 0)))
1943 #ifdef GEN_ERRNO_RTX
1944 rtx errno_rtx = GEN_ERRNO_RTX;
1947 = gen_rtx_MEM (word_mode, gen_rtx_SYMBOL_REF (Pmode, "errno"));
1949 emit_move_insn (errno_rtx, GEN_INT (TARGET_EDOM));
1955 /* Make sure the library call isn't expanded as a tail call. */
1956 CALL_EXPR_TAILCALL (exp) = 0;
1958 /* We can't set errno=EDOM directly; let the library call do it.
1959 Pop the arguments right away in case the call gets deleted. */
1961 expand_call (exp, target, 0);
1966 /* Expand a call to one of the builtin math functions (sqrt, exp, or log).
1967 Return NULL_RTX if a normal call should be emitted rather than expanding
1968 the function in-line. EXP is the expression that is a call to the builtin
1969 function; if convenient, the result should be placed in TARGET.
1970 SUBTARGET may be used as the target for computing one of EXP's operands. */
1973 expand_builtin_mathfn (tree exp, rtx target, rtx subtarget)
1975 optab builtin_optab;
1977 tree fndecl = get_callee_fndecl (exp);
1978 enum machine_mode mode;
1979 bool errno_set = false;
1982 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
1985 arg = CALL_EXPR_ARG (exp, 0);
1987 switch (DECL_FUNCTION_CODE (fndecl))
1989 CASE_FLT_FN (BUILT_IN_SQRT):
1990 errno_set = ! tree_expr_nonnegative_p (arg);
1991 builtin_optab = sqrt_optab;
1993 CASE_FLT_FN (BUILT_IN_EXP):
1994 errno_set = true; builtin_optab = exp_optab; break;
1995 CASE_FLT_FN (BUILT_IN_EXP10):
1996 CASE_FLT_FN (BUILT_IN_POW10):
1997 errno_set = true; builtin_optab = exp10_optab; break;
1998 CASE_FLT_FN (BUILT_IN_EXP2):
1999 errno_set = true; builtin_optab = exp2_optab; break;
2000 CASE_FLT_FN (BUILT_IN_EXPM1):
2001 errno_set = true; builtin_optab = expm1_optab; break;
2002 CASE_FLT_FN (BUILT_IN_LOGB):
2003 errno_set = true; builtin_optab = logb_optab; break;
2004 CASE_FLT_FN (BUILT_IN_LOG):
2005 errno_set = true; builtin_optab = log_optab; break;
2006 CASE_FLT_FN (BUILT_IN_LOG10):
2007 errno_set = true; builtin_optab = log10_optab; break;
2008 CASE_FLT_FN (BUILT_IN_LOG2):
2009 errno_set = true; builtin_optab = log2_optab; break;
2010 CASE_FLT_FN (BUILT_IN_LOG1P):
2011 errno_set = true; builtin_optab = log1p_optab; break;
2012 CASE_FLT_FN (BUILT_IN_ASIN):
2013 builtin_optab = asin_optab; break;
2014 CASE_FLT_FN (BUILT_IN_ACOS):
2015 builtin_optab = acos_optab; break;
2016 CASE_FLT_FN (BUILT_IN_TAN):
2017 builtin_optab = tan_optab; break;
2018 CASE_FLT_FN (BUILT_IN_ATAN):
2019 builtin_optab = atan_optab; break;
2020 CASE_FLT_FN (BUILT_IN_FLOOR):
2021 builtin_optab = floor_optab; break;
2022 CASE_FLT_FN (BUILT_IN_CEIL):
2023 builtin_optab = ceil_optab; break;
2024 CASE_FLT_FN (BUILT_IN_TRUNC):
2025 builtin_optab = btrunc_optab; break;
2026 CASE_FLT_FN (BUILT_IN_ROUND):
2027 builtin_optab = round_optab; break;
2028 CASE_FLT_FN (BUILT_IN_NEARBYINT):
2029 builtin_optab = nearbyint_optab;
2030 if (flag_trapping_math)
2032 /* Else fallthrough and expand as rint. */
2033 CASE_FLT_FN (BUILT_IN_RINT):
2034 builtin_optab = rint_optab; break;
2035 CASE_FLT_FN (BUILT_IN_SIGNIFICAND):
2036 builtin_optab = significand_optab; break;
2041 /* Make a suitable register to place result in. */
2042 mode = TYPE_MODE (TREE_TYPE (exp));
2044 if (! flag_errno_math || ! HONOR_NANS (mode))
2047 /* Before working hard, check whether the instruction is available. */
2048 if (optab_handler (builtin_optab, mode) != CODE_FOR_nothing
2049 && (!errno_set || !optimize_insn_for_size_p ()))
2051 target = gen_reg_rtx (mode);
2053 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2054 need to expand the argument again. This way, we will not perform
2055 side-effects more the once. */
2056 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2058 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
2062 /* Compute into TARGET.
2063 Set TARGET to wherever the result comes back. */
2064 target = expand_unop (mode, builtin_optab, op0, target, 0);
2069 expand_errno_check (exp, target);
2071 /* Output the entire sequence. */
2072 insns = get_insns ();
2078 /* If we were unable to expand via the builtin, stop the sequence
2079 (without outputting the insns) and call to the library function
2080 with the stabilized argument list. */
2084 return expand_call (exp, target, target == const0_rtx);
2087 /* Expand a call to the builtin binary math functions (pow and atan2).
2088 Return NULL_RTX if a normal call should be emitted rather than expanding the
2089 function in-line. EXP is the expression that is a call to the builtin
2090 function; if convenient, the result should be placed in TARGET.
2091 SUBTARGET may be used as the target for computing one of EXP's
2095 expand_builtin_mathfn_2 (tree exp, rtx target, rtx subtarget)
2097 optab builtin_optab;
2098 rtx op0, op1, insns;
2099 int op1_type = REAL_TYPE;
2100 tree fndecl = get_callee_fndecl (exp);
2102 enum machine_mode mode;
2103 bool errno_set = true;
2105 switch (DECL_FUNCTION_CODE (fndecl))
2107 CASE_FLT_FN (BUILT_IN_SCALBN):
2108 CASE_FLT_FN (BUILT_IN_SCALBLN):
2109 CASE_FLT_FN (BUILT_IN_LDEXP):
2110 op1_type = INTEGER_TYPE;
2115 if (!validate_arglist (exp, REAL_TYPE, op1_type, VOID_TYPE))
2118 arg0 = CALL_EXPR_ARG (exp, 0);
2119 arg1 = CALL_EXPR_ARG (exp, 1);
2121 switch (DECL_FUNCTION_CODE (fndecl))
2123 CASE_FLT_FN (BUILT_IN_POW):
2124 builtin_optab = pow_optab; break;
2125 CASE_FLT_FN (BUILT_IN_ATAN2):
2126 builtin_optab = atan2_optab; break;
2127 CASE_FLT_FN (BUILT_IN_SCALB):
2128 if (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (exp)))->b != 2)
2130 builtin_optab = scalb_optab; break;
2131 CASE_FLT_FN (BUILT_IN_SCALBN):
2132 CASE_FLT_FN (BUILT_IN_SCALBLN):
2133 if (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (exp)))->b != 2)
2135 /* Fall through... */
2136 CASE_FLT_FN (BUILT_IN_LDEXP):
2137 builtin_optab = ldexp_optab; break;
2138 CASE_FLT_FN (BUILT_IN_FMOD):
2139 builtin_optab = fmod_optab; break;
2140 CASE_FLT_FN (BUILT_IN_REMAINDER):
2141 CASE_FLT_FN (BUILT_IN_DREM):
2142 builtin_optab = remainder_optab; break;
2147 /* Make a suitable register to place result in. */
2148 mode = TYPE_MODE (TREE_TYPE (exp));
2150 /* Before working hard, check whether the instruction is available. */
2151 if (optab_handler (builtin_optab, mode) == CODE_FOR_nothing)
2154 target = gen_reg_rtx (mode);
2156 if (! flag_errno_math || ! HONOR_NANS (mode))
2159 if (errno_set && optimize_insn_for_size_p ())
2162 /* Always stabilize the argument list. */
2163 CALL_EXPR_ARG (exp, 0) = arg0 = builtin_save_expr (arg0);
2164 CALL_EXPR_ARG (exp, 1) = arg1 = builtin_save_expr (arg1);
2166 op0 = expand_expr (arg0, subtarget, VOIDmode, EXPAND_NORMAL);
2167 op1 = expand_normal (arg1);
2171 /* Compute into TARGET.
2172 Set TARGET to wherever the result comes back. */
2173 target = expand_binop (mode, builtin_optab, op0, op1,
2174 target, 0, OPTAB_DIRECT);
2176 /* If we were unable to expand via the builtin, stop the sequence
2177 (without outputting the insns) and call to the library function
2178 with the stabilized argument list. */
2182 return expand_call (exp, target, target == const0_rtx);
2186 expand_errno_check (exp, target);
2188 /* Output the entire sequence. */
2189 insns = get_insns ();
2196 /* Expand a call to the builtin trinary math functions (fma).
2197 Return NULL_RTX if a normal call should be emitted rather than expanding the
2198 function in-line. EXP is the expression that is a call to the builtin
2199 function; if convenient, the result should be placed in TARGET.
2200 SUBTARGET may be used as the target for computing one of EXP's
2204 expand_builtin_mathfn_ternary (tree exp, rtx target, rtx subtarget)
2206 optab builtin_optab;
2207 rtx op0, op1, op2, insns;
2208 tree fndecl = get_callee_fndecl (exp);
2209 tree arg0, arg1, arg2;
2210 enum machine_mode mode;
2212 if (!validate_arglist (exp, REAL_TYPE, REAL_TYPE, REAL_TYPE, VOID_TYPE))
2215 arg0 = CALL_EXPR_ARG (exp, 0);
2216 arg1 = CALL_EXPR_ARG (exp, 1);
2217 arg2 = CALL_EXPR_ARG (exp, 2);
2219 switch (DECL_FUNCTION_CODE (fndecl))
2221 CASE_FLT_FN (BUILT_IN_FMA):
2222 builtin_optab = fma_optab; break;
2227 /* Make a suitable register to place result in. */
2228 mode = TYPE_MODE (TREE_TYPE (exp));
2230 /* Before working hard, check whether the instruction is available. */
2231 if (optab_handler (builtin_optab, mode) == CODE_FOR_nothing)
2234 target = gen_reg_rtx (mode);
2236 /* Always stabilize the argument list. */
2237 CALL_EXPR_ARG (exp, 0) = arg0 = builtin_save_expr (arg0);
2238 CALL_EXPR_ARG (exp, 1) = arg1 = builtin_save_expr (arg1);
2239 CALL_EXPR_ARG (exp, 2) = arg2 = builtin_save_expr (arg2);
2241 op0 = expand_expr (arg0, subtarget, VOIDmode, EXPAND_NORMAL);
2242 op1 = expand_normal (arg1);
2243 op2 = expand_normal (arg2);
2247 /* Compute into TARGET.
2248 Set TARGET to wherever the result comes back. */
2249 target = expand_ternary_op (mode, builtin_optab, op0, op1, op2,
2252 /* If we were unable to expand via the builtin, stop the sequence
2253 (without outputting the insns) and call to the library function
2254 with the stabilized argument list. */
2258 return expand_call (exp, target, target == const0_rtx);
2261 /* Output the entire sequence. */
2262 insns = get_insns ();
2269 /* Expand a call to the builtin sin and cos math functions.
2270 Return NULL_RTX if a normal call should be emitted rather than expanding the
2271 function in-line. EXP is the expression that is a call to the builtin
2272 function; if convenient, the result should be placed in TARGET.
2273 SUBTARGET may be used as the target for computing one of EXP's
2277 expand_builtin_mathfn_3 (tree exp, rtx target, rtx subtarget)
2279 optab builtin_optab;
2281 tree fndecl = get_callee_fndecl (exp);
2282 enum machine_mode mode;
2285 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2288 arg = CALL_EXPR_ARG (exp, 0);
2290 switch (DECL_FUNCTION_CODE (fndecl))
2292 CASE_FLT_FN (BUILT_IN_SIN):
2293 CASE_FLT_FN (BUILT_IN_COS):
2294 builtin_optab = sincos_optab; break;
2299 /* Make a suitable register to place result in. */
2300 mode = TYPE_MODE (TREE_TYPE (exp));
2302 /* Check if sincos insn is available, otherwise fallback
2303 to sin or cos insn. */
2304 if (optab_handler (builtin_optab, mode) == CODE_FOR_nothing)
2305 switch (DECL_FUNCTION_CODE (fndecl))
2307 CASE_FLT_FN (BUILT_IN_SIN):
2308 builtin_optab = sin_optab; break;
2309 CASE_FLT_FN (BUILT_IN_COS):
2310 builtin_optab = cos_optab; break;
2315 /* Before working hard, check whether the instruction is available. */
2316 if (optab_handler (builtin_optab, mode) != CODE_FOR_nothing)
2318 target = gen_reg_rtx (mode);
2320 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2321 need to expand the argument again. This way, we will not perform
2322 side-effects more the once. */
2323 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2325 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
2329 /* Compute into TARGET.
2330 Set TARGET to wherever the result comes back. */
2331 if (builtin_optab == sincos_optab)
2335 switch (DECL_FUNCTION_CODE (fndecl))
2337 CASE_FLT_FN (BUILT_IN_SIN):
2338 result = expand_twoval_unop (builtin_optab, op0, 0, target, 0);
2340 CASE_FLT_FN (BUILT_IN_COS):
2341 result = expand_twoval_unop (builtin_optab, op0, target, 0, 0);
2346 gcc_assert (result);
2350 target = expand_unop (mode, builtin_optab, op0, target, 0);
2355 /* Output the entire sequence. */
2356 insns = get_insns ();
2362 /* If we were unable to expand via the builtin, stop the sequence
2363 (without outputting the insns) and call to the library function
2364 with the stabilized argument list. */
2368 target = expand_call (exp, target, target == const0_rtx);
2373 /* Given an interclass math builtin decl FNDECL and it's argument ARG
2374 return an RTL instruction code that implements the functionality.
2375 If that isn't possible or available return CODE_FOR_nothing. */
2377 static enum insn_code
2378 interclass_mathfn_icode (tree arg, tree fndecl)
2380 bool errno_set = false;
2381 optab builtin_optab = 0;
2382 enum machine_mode mode;
2384 switch (DECL_FUNCTION_CODE (fndecl))
2386 CASE_FLT_FN (BUILT_IN_ILOGB):
2387 errno_set = true; builtin_optab = ilogb_optab; break;
2388 CASE_FLT_FN (BUILT_IN_ISINF):
2389 builtin_optab = isinf_optab; break;
2390 case BUILT_IN_ISNORMAL:
2391 case BUILT_IN_ISFINITE:
2392 CASE_FLT_FN (BUILT_IN_FINITE):
2393 case BUILT_IN_FINITED32:
2394 case BUILT_IN_FINITED64:
2395 case BUILT_IN_FINITED128:
2396 case BUILT_IN_ISINFD32:
2397 case BUILT_IN_ISINFD64:
2398 case BUILT_IN_ISINFD128:
2399 /* These builtins have no optabs (yet). */
2405 /* There's no easy way to detect the case we need to set EDOM. */
2406 if (flag_errno_math && errno_set)
2407 return CODE_FOR_nothing;
2409 /* Optab mode depends on the mode of the input argument. */
2410 mode = TYPE_MODE (TREE_TYPE (arg));
2413 return optab_handler (builtin_optab, mode);
2414 return CODE_FOR_nothing;
2417 /* Expand a call to one of the builtin math functions that operate on
2418 floating point argument and output an integer result (ilogb, isinf,
2420 Return 0 if a normal call should be emitted rather than expanding the
2421 function in-line. EXP is the expression that is a call to the builtin
2422 function; if convenient, the result should be placed in TARGET. */
2425 expand_builtin_interclass_mathfn (tree exp, rtx target)
2427 enum insn_code icode = CODE_FOR_nothing;
2429 tree fndecl = get_callee_fndecl (exp);
2430 enum machine_mode mode;
2433 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2436 arg = CALL_EXPR_ARG (exp, 0);
2437 icode = interclass_mathfn_icode (arg, fndecl);
2438 mode = TYPE_MODE (TREE_TYPE (arg));
2440 if (icode != CODE_FOR_nothing)
2442 struct expand_operand ops[1];
2443 rtx last = get_last_insn ();
2444 tree orig_arg = arg;
2446 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2447 need to expand the argument again. This way, we will not perform
2448 side-effects more the once. */
2449 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2451 op0 = expand_expr (arg, NULL_RTX, VOIDmode, EXPAND_NORMAL);
2453 if (mode != GET_MODE (op0))
2454 op0 = convert_to_mode (mode, op0, 0);
2456 create_output_operand (&ops[0], target, TYPE_MODE (TREE_TYPE (exp)));
2457 if (maybe_legitimize_operands (icode, 0, 1, ops)
2458 && maybe_emit_unop_insn (icode, ops[0].value, op0, UNKNOWN))
2459 return ops[0].value;
2461 delete_insns_since (last);
2462 CALL_EXPR_ARG (exp, 0) = orig_arg;
2468 /* Expand a call to the builtin sincos math function.
2469 Return NULL_RTX if a normal call should be emitted rather than expanding the
2470 function in-line. EXP is the expression that is a call to the builtin
2474 expand_builtin_sincos (tree exp)
2476 rtx op0, op1, op2, target1, target2;
2477 enum machine_mode mode;
2478 tree arg, sinp, cosp;
2480 location_t loc = EXPR_LOCATION (exp);
2481 tree alias_type, alias_off;
2483 if (!validate_arglist (exp, REAL_TYPE,
2484 POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
2487 arg = CALL_EXPR_ARG (exp, 0);
2488 sinp = CALL_EXPR_ARG (exp, 1);
2489 cosp = CALL_EXPR_ARG (exp, 2);
2491 /* Make a suitable register to place result in. */
2492 mode = TYPE_MODE (TREE_TYPE (arg));
2494 /* Check if sincos insn is available, otherwise emit the call. */
2495 if (optab_handler (sincos_optab, mode) == CODE_FOR_nothing)
2498 target1 = gen_reg_rtx (mode);
2499 target2 = gen_reg_rtx (mode);
2501 op0 = expand_normal (arg);
2502 alias_type = build_pointer_type_for_mode (TREE_TYPE (arg), ptr_mode, true);
2503 alias_off = build_int_cst (alias_type, 0);
2504 op1 = expand_normal (fold_build2_loc (loc, MEM_REF, TREE_TYPE (arg),
2506 op2 = expand_normal (fold_build2_loc (loc, MEM_REF, TREE_TYPE (arg),
2509 /* Compute into target1 and target2.
2510 Set TARGET to wherever the result comes back. */
2511 result = expand_twoval_unop (sincos_optab, op0, target2, target1, 0);
2512 gcc_assert (result);
2514 /* Move target1 and target2 to the memory locations indicated
2516 emit_move_insn (op1, target1);
2517 emit_move_insn (op2, target2);
2522 /* Expand a call to the internal cexpi builtin to the sincos math function.
2523 EXP is the expression that is a call to the builtin function; if convenient,
2524 the result should be placed in TARGET. */
2527 expand_builtin_cexpi (tree exp, rtx target)
2529 tree fndecl = get_callee_fndecl (exp);
2531 enum machine_mode mode;
2533 location_t loc = EXPR_LOCATION (exp);
2535 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2538 arg = CALL_EXPR_ARG (exp, 0);
2539 type = TREE_TYPE (arg);
2540 mode = TYPE_MODE (TREE_TYPE (arg));
2542 /* Try expanding via a sincos optab, fall back to emitting a libcall
2543 to sincos or cexp. We are sure we have sincos or cexp because cexpi
2544 is only generated from sincos, cexp or if we have either of them. */
2545 if (optab_handler (sincos_optab, mode) != CODE_FOR_nothing)
2547 op1 = gen_reg_rtx (mode);
2548 op2 = gen_reg_rtx (mode);
2550 op0 = expand_expr (arg, NULL_RTX, VOIDmode, EXPAND_NORMAL);
2552 /* Compute into op1 and op2. */
2553 expand_twoval_unop (sincos_optab, op0, op2, op1, 0);
2555 else if (TARGET_HAS_SINCOS)
2557 tree call, fn = NULL_TREE;
2561 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIF)
2562 fn = built_in_decls[BUILT_IN_SINCOSF];
2563 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPI)
2564 fn = built_in_decls[BUILT_IN_SINCOS];
2565 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIL)
2566 fn = built_in_decls[BUILT_IN_SINCOSL];
2570 op1 = assign_temp (TREE_TYPE (arg), 0, 1, 1);
2571 op2 = assign_temp (TREE_TYPE (arg), 0, 1, 1);
2572 op1a = copy_to_mode_reg (Pmode, XEXP (op1, 0));
2573 op2a = copy_to_mode_reg (Pmode, XEXP (op2, 0));
2574 top1 = make_tree (build_pointer_type (TREE_TYPE (arg)), op1a);
2575 top2 = make_tree (build_pointer_type (TREE_TYPE (arg)), op2a);
2577 /* Make sure not to fold the sincos call again. */
2578 call = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn);
2579 expand_normal (build_call_nary (TREE_TYPE (TREE_TYPE (fn)),
2580 call, 3, arg, top1, top2));
2584 tree call, fn = NULL_TREE, narg;
2585 tree ctype = build_complex_type (type);
2587 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIF)
2588 fn = built_in_decls[BUILT_IN_CEXPF];
2589 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPI)
2590 fn = built_in_decls[BUILT_IN_CEXP];
2591 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIL)
2592 fn = built_in_decls[BUILT_IN_CEXPL];
2596 /* If we don't have a decl for cexp create one. This is the
2597 friendliest fallback if the user calls __builtin_cexpi
2598 without full target C99 function support. */
2599 if (fn == NULL_TREE)
2602 const char *name = NULL;
2604 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIF)
2606 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPI)
2608 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIL)
2611 fntype = build_function_type_list (ctype, ctype, NULL_TREE);
2612 fn = build_fn_decl (name, fntype);
2615 narg = fold_build2_loc (loc, COMPLEX_EXPR, ctype,
2616 build_real (type, dconst0), arg);
2618 /* Make sure not to fold the cexp call again. */
2619 call = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn);
2620 return expand_expr (build_call_nary (ctype, call, 1, narg),
2621 target, VOIDmode, EXPAND_NORMAL);
2624 /* Now build the proper return type. */
2625 return expand_expr (build2 (COMPLEX_EXPR, build_complex_type (type),
2626 make_tree (TREE_TYPE (arg), op2),
2627 make_tree (TREE_TYPE (arg), op1)),
2628 target, VOIDmode, EXPAND_NORMAL);
2631 /* Conveniently construct a function call expression. FNDECL names the
2632 function to be called, N is the number of arguments, and the "..."
2633 parameters are the argument expressions. Unlike build_call_exr
2634 this doesn't fold the call, hence it will always return a CALL_EXPR. */
2637 build_call_nofold_loc (location_t loc, tree fndecl, int n, ...)
2640 tree fntype = TREE_TYPE (fndecl);
2641 tree fn = build1 (ADDR_EXPR, build_pointer_type (fntype), fndecl);
2644 fn = build_call_valist (TREE_TYPE (fntype), fn, n, ap);
2646 SET_EXPR_LOCATION (fn, loc);
2650 /* Expand a call to one of the builtin rounding functions gcc defines
2651 as an extension (lfloor and lceil). As these are gcc extensions we
2652 do not need to worry about setting errno to EDOM.
2653 If expanding via optab fails, lower expression to (int)(floor(x)).
2654 EXP is the expression that is a call to the builtin function;
2655 if convenient, the result should be placed in TARGET. */
2658 expand_builtin_int_roundingfn (tree exp, rtx target)
2660 convert_optab builtin_optab;
2661 rtx op0, insns, tmp;
2662 tree fndecl = get_callee_fndecl (exp);
2663 enum built_in_function fallback_fn;
2664 tree fallback_fndecl;
2665 enum machine_mode mode;
2668 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2671 arg = CALL_EXPR_ARG (exp, 0);
2673 switch (DECL_FUNCTION_CODE (fndecl))
2675 CASE_FLT_FN (BUILT_IN_LCEIL):
2676 CASE_FLT_FN (BUILT_IN_LLCEIL):
2677 builtin_optab = lceil_optab;
2678 fallback_fn = BUILT_IN_CEIL;
2681 CASE_FLT_FN (BUILT_IN_LFLOOR):
2682 CASE_FLT_FN (BUILT_IN_LLFLOOR):
2683 builtin_optab = lfloor_optab;
2684 fallback_fn = BUILT_IN_FLOOR;
2691 /* Make a suitable register to place result in. */
2692 mode = TYPE_MODE (TREE_TYPE (exp));
2694 target = gen_reg_rtx (mode);
2696 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2697 need to expand the argument again. This way, we will not perform
2698 side-effects more the once. */
2699 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2701 op0 = expand_expr (arg, NULL, VOIDmode, EXPAND_NORMAL);
2705 /* Compute into TARGET. */
2706 if (expand_sfix_optab (target, op0, builtin_optab))
2708 /* Output the entire sequence. */
2709 insns = get_insns ();
2715 /* If we were unable to expand via the builtin, stop the sequence
2716 (without outputting the insns). */
2719 /* Fall back to floating point rounding optab. */
2720 fallback_fndecl = mathfn_built_in (TREE_TYPE (arg), fallback_fn);
2722 /* For non-C99 targets we may end up without a fallback fndecl here
2723 if the user called __builtin_lfloor directly. In this case emit
2724 a call to the floor/ceil variants nevertheless. This should result
2725 in the best user experience for not full C99 targets. */
2726 if (fallback_fndecl == NULL_TREE)
2729 const char *name = NULL;
2731 switch (DECL_FUNCTION_CODE (fndecl))
2733 case BUILT_IN_LCEIL:
2734 case BUILT_IN_LLCEIL:
2737 case BUILT_IN_LCEILF:
2738 case BUILT_IN_LLCEILF:
2741 case BUILT_IN_LCEILL:
2742 case BUILT_IN_LLCEILL:
2745 case BUILT_IN_LFLOOR:
2746 case BUILT_IN_LLFLOOR:
2749 case BUILT_IN_LFLOORF:
2750 case BUILT_IN_LLFLOORF:
2753 case BUILT_IN_LFLOORL:
2754 case BUILT_IN_LLFLOORL:
2761 fntype = build_function_type_list (TREE_TYPE (arg),
2762 TREE_TYPE (arg), NULL_TREE);
2763 fallback_fndecl = build_fn_decl (name, fntype);
2766 exp = build_call_nofold_loc (EXPR_LOCATION (exp), fallback_fndecl, 1, arg);
2768 tmp = expand_normal (exp);
2770 /* Truncate the result of floating point optab to integer
2771 via expand_fix (). */
2772 target = gen_reg_rtx (mode);
2773 expand_fix (target, tmp, 0);
2778 /* Expand a call to one of the builtin math functions doing integer
2780 Return 0 if a normal call should be emitted rather than expanding the
2781 function in-line. EXP is the expression that is a call to the builtin
2782 function; if convenient, the result should be placed in TARGET. */
2785 expand_builtin_int_roundingfn_2 (tree exp, rtx target)
2787 convert_optab builtin_optab;
2789 tree fndecl = get_callee_fndecl (exp);
2791 enum machine_mode mode;
2793 /* There's no easy way to detect the case we need to set EDOM. */
2794 if (flag_errno_math)
2797 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2800 arg = CALL_EXPR_ARG (exp, 0);
2802 switch (DECL_FUNCTION_CODE (fndecl))
2804 CASE_FLT_FN (BUILT_IN_LRINT):
2805 CASE_FLT_FN (BUILT_IN_LLRINT):
2806 builtin_optab = lrint_optab; break;
2807 CASE_FLT_FN (BUILT_IN_LROUND):
2808 CASE_FLT_FN (BUILT_IN_LLROUND):
2809 builtin_optab = lround_optab; break;
2814 /* Make a suitable register to place result in. */
2815 mode = TYPE_MODE (TREE_TYPE (exp));
2817 target = gen_reg_rtx (mode);
2819 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2820 need to expand the argument again. This way, we will not perform
2821 side-effects more the once. */
2822 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2824 op0 = expand_expr (arg, NULL, VOIDmode, EXPAND_NORMAL);
2828 if (expand_sfix_optab (target, op0, builtin_optab))
2830 /* Output the entire sequence. */
2831 insns = get_insns ();
2837 /* If we were unable to expand via the builtin, stop the sequence
2838 (without outputting the insns) and call to the library function
2839 with the stabilized argument list. */
2842 target = expand_call (exp, target, target == const0_rtx);
2847 /* Expand a call to the powi built-in mathematical function. Return NULL_RTX if
2848 a normal call should be emitted rather than expanding the function
2849 in-line. EXP is the expression that is a call to the builtin
2850 function; if convenient, the result should be placed in TARGET. */
2853 expand_builtin_powi (tree exp, rtx target)
2857 enum machine_mode mode;
2858 enum machine_mode mode2;
2860 if (! validate_arglist (exp, REAL_TYPE, INTEGER_TYPE, VOID_TYPE))
2863 arg0 = CALL_EXPR_ARG (exp, 0);
2864 arg1 = CALL_EXPR_ARG (exp, 1);
2865 mode = TYPE_MODE (TREE_TYPE (exp));
2867 /* Emit a libcall to libgcc. */
2869 /* Mode of the 2nd argument must match that of an int. */
2870 mode2 = mode_for_size (INT_TYPE_SIZE, MODE_INT, 0);
2872 if (target == NULL_RTX)
2873 target = gen_reg_rtx (mode);
2875 op0 = expand_expr (arg0, NULL_RTX, mode, EXPAND_NORMAL);
2876 if (GET_MODE (op0) != mode)
2877 op0 = convert_to_mode (mode, op0, 0);
2878 op1 = expand_expr (arg1, NULL_RTX, mode2, EXPAND_NORMAL);
2879 if (GET_MODE (op1) != mode2)
2880 op1 = convert_to_mode (mode2, op1, 0);
2882 target = emit_library_call_value (optab_libfunc (powi_optab, mode),
2883 target, LCT_CONST, mode, 2,
2884 op0, mode, op1, mode2);
2889 /* Expand expression EXP which is a call to the strlen builtin. Return
2890 NULL_RTX if we failed the caller should emit a normal call, otherwise
2891 try to get the result in TARGET, if convenient. */
2894 expand_builtin_strlen (tree exp, rtx target,
2895 enum machine_mode target_mode)
2897 if (!validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
2901 struct expand_operand ops[4];
2904 tree src = CALL_EXPR_ARG (exp, 0);
2905 rtx src_reg, before_strlen;
2906 enum machine_mode insn_mode = target_mode;
2907 enum insn_code icode = CODE_FOR_nothing;
2910 /* If the length can be computed at compile-time, return it. */
2911 len = c_strlen (src, 0);
2913 return expand_expr (len, target, target_mode, EXPAND_NORMAL);
2915 /* If the length can be computed at compile-time and is constant
2916 integer, but there are side-effects in src, evaluate
2917 src for side-effects, then return len.
2918 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
2919 can be optimized into: i++; x = 3; */
2920 len = c_strlen (src, 1);
2921 if (len && TREE_CODE (len) == INTEGER_CST)
2923 expand_expr (src, const0_rtx, VOIDmode, EXPAND_NORMAL);
2924 return expand_expr (len, target, target_mode, EXPAND_NORMAL);
2927 align = get_pointer_alignment (src, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
2929 /* If SRC is not a pointer type, don't do this operation inline. */
2933 /* Bail out if we can't compute strlen in the right mode. */
2934 while (insn_mode != VOIDmode)
2936 icode = optab_handler (strlen_optab, insn_mode);
2937 if (icode != CODE_FOR_nothing)
2940 insn_mode = GET_MODE_WIDER_MODE (insn_mode);
2942 if (insn_mode == VOIDmode)
2945 /* Make a place to hold the source address. We will not expand
2946 the actual source until we are sure that the expansion will
2947 not fail -- there are trees that cannot be expanded twice. */
2948 src_reg = gen_reg_rtx (Pmode);
2950 /* Mark the beginning of the strlen sequence so we can emit the
2951 source operand later. */
2952 before_strlen = get_last_insn ();
2954 create_output_operand (&ops[0], target, insn_mode);
2955 create_fixed_operand (&ops[1], gen_rtx_MEM (BLKmode, src_reg));
2956 create_integer_operand (&ops[2], 0);
2957 create_integer_operand (&ops[3], align);
2958 if (!maybe_expand_insn (icode, 4, ops))
2961 /* Now that we are assured of success, expand the source. */
2963 pat = expand_expr (src, src_reg, Pmode, EXPAND_NORMAL);
2966 #ifdef POINTERS_EXTEND_UNSIGNED
2967 if (GET_MODE (pat) != Pmode)
2968 pat = convert_to_mode (Pmode, pat,
2969 POINTERS_EXTEND_UNSIGNED);
2971 emit_move_insn (src_reg, pat);
2977 emit_insn_after (pat, before_strlen);
2979 emit_insn_before (pat, get_insns ());
2981 /* Return the value in the proper mode for this function. */
2982 if (GET_MODE (ops[0].value) == target_mode)
2983 target = ops[0].value;
2984 else if (target != 0)
2985 convert_move (target, ops[0].value, 0);
2987 target = convert_to_mode (target_mode, ops[0].value, 0);
2993 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
2994 bytes from constant string DATA + OFFSET and return it as target
2998 builtin_memcpy_read_str (void *data, HOST_WIDE_INT offset,
2999 enum machine_mode mode)
3001 const char *str = (const char *) data;
3003 gcc_assert (offset >= 0
3004 && ((unsigned HOST_WIDE_INT) offset + GET_MODE_SIZE (mode)
3005 <= strlen (str) + 1));
3007 return c_readstr (str + offset, mode);
3010 /* Expand a call EXP to the memcpy builtin.
3011 Return NULL_RTX if we failed, the caller should emit a normal call,
3012 otherwise try to get the result in TARGET, if convenient (and in
3013 mode MODE if that's convenient). */
3016 expand_builtin_memcpy (tree exp, rtx target)
3018 if (!validate_arglist (exp,
3019 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3023 tree dest = CALL_EXPR_ARG (exp, 0);
3024 tree src = CALL_EXPR_ARG (exp, 1);
3025 tree len = CALL_EXPR_ARG (exp, 2);
3026 const char *src_str;
3027 unsigned int src_align = get_pointer_alignment (src, BIGGEST_ALIGNMENT);
3028 unsigned int dest_align
3029 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
3030 rtx dest_mem, src_mem, dest_addr, len_rtx;
3031 HOST_WIDE_INT expected_size = -1;
3032 unsigned int expected_align = 0;
3034 /* If DEST is not a pointer type, call the normal function. */
3035 if (dest_align == 0)
3038 /* If either SRC is not a pointer type, don't do this
3039 operation in-line. */
3043 if (currently_expanding_gimple_stmt)
3044 stringop_block_profile (currently_expanding_gimple_stmt,
3045 &expected_align, &expected_size);
3047 if (expected_align < dest_align)
3048 expected_align = dest_align;
3049 dest_mem = get_memory_rtx (dest, len);
3050 set_mem_align (dest_mem, dest_align);
3051 len_rtx = expand_normal (len);
3052 src_str = c_getstr (src);
3054 /* If SRC is a string constant and block move would be done
3055 by pieces, we can avoid loading the string from memory
3056 and only stored the computed constants. */
3058 && CONST_INT_P (len_rtx)
3059 && (unsigned HOST_WIDE_INT) INTVAL (len_rtx) <= strlen (src_str) + 1
3060 && can_store_by_pieces (INTVAL (len_rtx), builtin_memcpy_read_str,
3061 CONST_CAST (char *, src_str),
3064 dest_mem = store_by_pieces (dest_mem, INTVAL (len_rtx),
3065 builtin_memcpy_read_str,
3066 CONST_CAST (char *, src_str),
3067 dest_align, false, 0);
3068 dest_mem = force_operand (XEXP (dest_mem, 0), target);
3069 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3073 src_mem = get_memory_rtx (src, len);
3074 set_mem_align (src_mem, src_align);
3076 /* Copy word part most expediently. */
3077 dest_addr = emit_block_move_hints (dest_mem, src_mem, len_rtx,
3078 CALL_EXPR_TAILCALL (exp)
3079 ? BLOCK_OP_TAILCALL : BLOCK_OP_NORMAL,
3080 expected_align, expected_size);
3084 dest_addr = force_operand (XEXP (dest_mem, 0), target);
3085 dest_addr = convert_memory_address (ptr_mode, dest_addr);
3091 /* Expand a call EXP to the mempcpy builtin.
3092 Return NULL_RTX if we failed; the caller should emit a normal call,
3093 otherwise try to get the result in TARGET, if convenient (and in
3094 mode MODE if that's convenient). If ENDP is 0 return the
3095 destination pointer, if ENDP is 1 return the end pointer ala
3096 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3100 expand_builtin_mempcpy (tree exp, rtx target, enum machine_mode mode)
3102 if (!validate_arglist (exp,
3103 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3107 tree dest = CALL_EXPR_ARG (exp, 0);
3108 tree src = CALL_EXPR_ARG (exp, 1);
3109 tree len = CALL_EXPR_ARG (exp, 2);
3110 return expand_builtin_mempcpy_args (dest, src, len,
3111 target, mode, /*endp=*/ 1);
3115 /* Helper function to do the actual work for expand_builtin_mempcpy. The
3116 arguments to the builtin_mempcpy call DEST, SRC, and LEN are broken out
3117 so that this can also be called without constructing an actual CALL_EXPR.
3118 The other arguments and return value are the same as for
3119 expand_builtin_mempcpy. */
3122 expand_builtin_mempcpy_args (tree dest, tree src, tree len,
3123 rtx target, enum machine_mode mode, int endp)
3125 /* If return value is ignored, transform mempcpy into memcpy. */
3126 if (target == const0_rtx && implicit_built_in_decls[BUILT_IN_MEMCPY])
3128 tree fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
3129 tree result = build_call_nofold_loc (UNKNOWN_LOCATION, fn, 3,
3131 return expand_expr (result, target, mode, EXPAND_NORMAL);
3135 const char *src_str;
3136 unsigned int src_align = get_pointer_alignment (src, BIGGEST_ALIGNMENT);
3137 unsigned int dest_align
3138 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
3139 rtx dest_mem, src_mem, len_rtx;
3141 /* If either SRC or DEST is not a pointer type, don't do this
3142 operation in-line. */
3143 if (dest_align == 0 || src_align == 0)
3146 /* If LEN is not constant, call the normal function. */
3147 if (! host_integerp (len, 1))
3150 len_rtx = expand_normal (len);
3151 src_str = c_getstr (src);
3153 /* If SRC is a string constant and block move would be done
3154 by pieces, we can avoid loading the string from memory
3155 and only stored the computed constants. */
3157 && CONST_INT_P (len_rtx)
3158 && (unsigned HOST_WIDE_INT) INTVAL (len_rtx) <= strlen (src_str) + 1
3159 && can_store_by_pieces (INTVAL (len_rtx), builtin_memcpy_read_str,
3160 CONST_CAST (char *, src_str),
3163 dest_mem = get_memory_rtx (dest, len);
3164 set_mem_align (dest_mem, dest_align);
3165 dest_mem = store_by_pieces (dest_mem, INTVAL (len_rtx),
3166 builtin_memcpy_read_str,
3167 CONST_CAST (char *, src_str),
3168 dest_align, false, endp);
3169 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3170 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3174 if (CONST_INT_P (len_rtx)
3175 && can_move_by_pieces (INTVAL (len_rtx),
3176 MIN (dest_align, src_align)))
3178 dest_mem = get_memory_rtx (dest, len);
3179 set_mem_align (dest_mem, dest_align);
3180 src_mem = get_memory_rtx (src, len);
3181 set_mem_align (src_mem, src_align);
3182 dest_mem = move_by_pieces (dest_mem, src_mem, INTVAL (len_rtx),
3183 MIN (dest_align, src_align), endp);
3184 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3185 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3194 # define HAVE_movstr 0
3195 # define CODE_FOR_movstr CODE_FOR_nothing
3198 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
3199 we failed, the caller should emit a normal call, otherwise try to
3200 get the result in TARGET, if convenient. If ENDP is 0 return the
3201 destination pointer, if ENDP is 1 return the end pointer ala
3202 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3206 expand_movstr (tree dest, tree src, rtx target, int endp)
3208 struct expand_operand ops[3];
3215 dest_mem = get_memory_rtx (dest, NULL);
3216 src_mem = get_memory_rtx (src, NULL);
3219 target = force_reg (Pmode, XEXP (dest_mem, 0));
3220 dest_mem = replace_equiv_address (dest_mem, target);
3223 create_output_operand (&ops[0], endp ? target : NULL_RTX, Pmode);
3224 create_fixed_operand (&ops[1], dest_mem);
3225 create_fixed_operand (&ops[2], src_mem);
3226 expand_insn (CODE_FOR_movstr, 3, ops);
3228 if (endp && target != const0_rtx)
3230 target = ops[0].value;
3231 /* movstr is supposed to set end to the address of the NUL
3232 terminator. If the caller requested a mempcpy-like return value,
3236 rtx tem = plus_constant (gen_lowpart (GET_MODE (target), target), 1);
3237 emit_move_insn (target, force_operand (tem, NULL_RTX));
3243 /* Expand expression EXP, which is a call to the strcpy builtin. Return
3244 NULL_RTX if we failed the caller should emit a normal call, otherwise
3245 try to get the result in TARGET, if convenient (and in mode MODE if that's
3249 expand_builtin_strcpy (tree exp, rtx target)
3251 if (validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3253 tree dest = CALL_EXPR_ARG (exp, 0);
3254 tree src = CALL_EXPR_ARG (exp, 1);
3255 return expand_builtin_strcpy_args (dest, src, target);
3260 /* Helper function to do the actual work for expand_builtin_strcpy. The
3261 arguments to the builtin_strcpy call DEST and SRC are broken out
3262 so that this can also be called without constructing an actual CALL_EXPR.
3263 The other arguments and return value are the same as for
3264 expand_builtin_strcpy. */
3267 expand_builtin_strcpy_args (tree dest, tree src, rtx target)
3269 return expand_movstr (dest, src, target, /*endp=*/0);
3272 /* Expand a call EXP to the stpcpy builtin.
3273 Return NULL_RTX if we failed the caller should emit a normal call,
3274 otherwise try to get the result in TARGET, if convenient (and in
3275 mode MODE if that's convenient). */
3278 expand_builtin_stpcpy (tree exp, rtx target, enum machine_mode mode)
3281 location_t loc = EXPR_LOCATION (exp);
3283 if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3286 dst = CALL_EXPR_ARG (exp, 0);
3287 src = CALL_EXPR_ARG (exp, 1);
3289 /* If return value is ignored, transform stpcpy into strcpy. */
3290 if (target == const0_rtx && implicit_built_in_decls[BUILT_IN_STRCPY])
3292 tree fn = implicit_built_in_decls[BUILT_IN_STRCPY];
3293 tree result = build_call_nofold_loc (loc, fn, 2, dst, src);
3294 return expand_expr (result, target, mode, EXPAND_NORMAL);
3301 /* Ensure we get an actual string whose length can be evaluated at
3302 compile-time, not an expression containing a string. This is
3303 because the latter will potentially produce pessimized code
3304 when used to produce the return value. */
3305 if (! c_getstr (src) || ! (len = c_strlen (src, 0)))
3306 return expand_movstr (dst, src, target, /*endp=*/2);
3308 lenp1 = size_binop_loc (loc, PLUS_EXPR, len, ssize_int (1));
3309 ret = expand_builtin_mempcpy_args (dst, src, lenp1,
3310 target, mode, /*endp=*/2);
3315 if (TREE_CODE (len) == INTEGER_CST)
3317 rtx len_rtx = expand_normal (len);
3319 if (CONST_INT_P (len_rtx))
3321 ret = expand_builtin_strcpy_args (dst, src, target);
3327 if (mode != VOIDmode)
3328 target = gen_reg_rtx (mode);
3330 target = gen_reg_rtx (GET_MODE (ret));
3332 if (GET_MODE (target) != GET_MODE (ret))
3333 ret = gen_lowpart (GET_MODE (target), ret);
3335 ret = plus_constant (ret, INTVAL (len_rtx));
3336 ret = emit_move_insn (target, force_operand (ret, NULL_RTX));
3344 return expand_movstr (dst, src, target, /*endp=*/2);
3348 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3349 bytes from constant string DATA + OFFSET and return it as target
3353 builtin_strncpy_read_str (void *data, HOST_WIDE_INT offset,
3354 enum machine_mode mode)
3356 const char *str = (const char *) data;
3358 if ((unsigned HOST_WIDE_INT) offset > strlen (str))
3361 return c_readstr (str + offset, mode);
3364 /* Expand expression EXP, which is a call to the strncpy builtin. Return
3365 NULL_RTX if we failed the caller should emit a normal call. */
3368 expand_builtin_strncpy (tree exp, rtx target)
3370 location_t loc = EXPR_LOCATION (exp);
3372 if (validate_arglist (exp,
3373 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3375 tree dest = CALL_EXPR_ARG (exp, 0);
3376 tree src = CALL_EXPR_ARG (exp, 1);
3377 tree len = CALL_EXPR_ARG (exp, 2);
3378 tree slen = c_strlen (src, 1);
3380 /* We must be passed a constant len and src parameter. */
3381 if (!host_integerp (len, 1) || !slen || !host_integerp (slen, 1))
3384 slen = size_binop_loc (loc, PLUS_EXPR, slen, ssize_int (1));
3386 /* We're required to pad with trailing zeros if the requested
3387 len is greater than strlen(s2)+1. In that case try to
3388 use store_by_pieces, if it fails, punt. */
3389 if (tree_int_cst_lt (slen, len))
3391 unsigned int dest_align
3392 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
3393 const char *p = c_getstr (src);
3396 if (!p || dest_align == 0 || !host_integerp (len, 1)
3397 || !can_store_by_pieces (tree_low_cst (len, 1),
3398 builtin_strncpy_read_str,
3399 CONST_CAST (char *, p),
3403 dest_mem = get_memory_rtx (dest, len);
3404 store_by_pieces (dest_mem, tree_low_cst (len, 1),
3405 builtin_strncpy_read_str,
3406 CONST_CAST (char *, p), dest_align, false, 0);
3407 dest_mem = force_operand (XEXP (dest_mem, 0), target);
3408 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3415 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3416 bytes from constant string DATA + OFFSET and return it as target
3420 builtin_memset_read_str (void *data, HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
3421 enum machine_mode mode)
3423 const char *c = (const char *) data;
3424 char *p = XALLOCAVEC (char, GET_MODE_SIZE (mode));
3426 memset (p, *c, GET_MODE_SIZE (mode));
3428 return c_readstr (p, mode);
3431 /* Callback routine for store_by_pieces. Return the RTL of a register
3432 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
3433 char value given in the RTL register data. For example, if mode is
3434 4 bytes wide, return the RTL for 0x01010101*data. */
3437 builtin_memset_gen_str (void *data, HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
3438 enum machine_mode mode)
3444 size = GET_MODE_SIZE (mode);
3448 p = XALLOCAVEC (char, size);
3449 memset (p, 1, size);
3450 coeff = c_readstr (p, mode);
3452 target = convert_to_mode (mode, (rtx) data, 1);
3453 target = expand_mult (mode, target, coeff, NULL_RTX, 1);
3454 return force_reg (mode, target);
3457 /* Expand expression EXP, which is a call to the memset builtin. Return
3458 NULL_RTX if we failed the caller should emit a normal call, otherwise
3459 try to get the result in TARGET, if convenient (and in mode MODE if that's
3463 expand_builtin_memset (tree exp, rtx target, enum machine_mode mode)
3465 if (!validate_arglist (exp,
3466 POINTER_TYPE, INTEGER_TYPE, INTEGER_TYPE, VOID_TYPE))
3470 tree dest = CALL_EXPR_ARG (exp, 0);
3471 tree val = CALL_EXPR_ARG (exp, 1);
3472 tree len = CALL_EXPR_ARG (exp, 2);
3473 return expand_builtin_memset_args (dest, val, len, target, mode, exp);
3477 /* Helper function to do the actual work for expand_builtin_memset. The
3478 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
3479 so that this can also be called without constructing an actual CALL_EXPR.
3480 The other arguments and return value are the same as for
3481 expand_builtin_memset. */
3484 expand_builtin_memset_args (tree dest, tree val, tree len,
3485 rtx target, enum machine_mode mode, tree orig_exp)
3488 enum built_in_function fcode;
3489 enum machine_mode val_mode;
3491 unsigned int dest_align;
3492 rtx dest_mem, dest_addr, len_rtx;
3493 HOST_WIDE_INT expected_size = -1;
3494 unsigned int expected_align = 0;
3496 dest_align = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
3498 /* If DEST is not a pointer type, don't do this operation in-line. */
3499 if (dest_align == 0)
3502 if (currently_expanding_gimple_stmt)
3503 stringop_block_profile (currently_expanding_gimple_stmt,
3504 &expected_align, &expected_size);
3506 if (expected_align < dest_align)
3507 expected_align = dest_align;
3509 /* If the LEN parameter is zero, return DEST. */
3510 if (integer_zerop (len))
3512 /* Evaluate and ignore VAL in case it has side-effects. */
3513 expand_expr (val, const0_rtx, VOIDmode, EXPAND_NORMAL);
3514 return expand_expr (dest, target, mode, EXPAND_NORMAL);
3517 /* Stabilize the arguments in case we fail. */
3518 dest = builtin_save_expr (dest);
3519 val = builtin_save_expr (val);
3520 len = builtin_save_expr (len);
3522 len_rtx = expand_normal (len);
3523 dest_mem = get_memory_rtx (dest, len);
3524 val_mode = TYPE_MODE (unsigned_char_type_node);
3526 if (TREE_CODE (val) != INTEGER_CST)
3530 val_rtx = expand_normal (val);
3531 val_rtx = convert_to_mode (val_mode, val_rtx, 0);
3533 /* Assume that we can memset by pieces if we can store
3534 * the coefficients by pieces (in the required modes).
3535 * We can't pass builtin_memset_gen_str as that emits RTL. */
3537 if (host_integerp (len, 1)
3538 && can_store_by_pieces (tree_low_cst (len, 1),
3539 builtin_memset_read_str, &c, dest_align,
3542 val_rtx = force_reg (val_mode, val_rtx);
3543 store_by_pieces (dest_mem, tree_low_cst (len, 1),
3544 builtin_memset_gen_str, val_rtx, dest_align,
3547 else if (!set_storage_via_setmem (dest_mem, len_rtx, val_rtx,
3548 dest_align, expected_align,
3552 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3553 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3557 if (target_char_cast (val, &c))
3562 if (host_integerp (len, 1)
3563 && can_store_by_pieces (tree_low_cst (len, 1),
3564 builtin_memset_read_str, &c, dest_align,
3566 store_by_pieces (dest_mem, tree_low_cst (len, 1),
3567 builtin_memset_read_str, &c, dest_align, true, 0);
3568 else if (!set_storage_via_setmem (dest_mem, len_rtx,
3569 gen_int_mode (c, val_mode),
3570 dest_align, expected_align,
3574 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3575 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3579 set_mem_align (dest_mem, dest_align);
3580 dest_addr = clear_storage_hints (dest_mem, len_rtx,
3581 CALL_EXPR_TAILCALL (orig_exp)
3582 ? BLOCK_OP_TAILCALL : BLOCK_OP_NORMAL,
3583 expected_align, expected_size);
3587 dest_addr = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3588 dest_addr = convert_memory_address (ptr_mode, dest_addr);
3594 fndecl = get_callee_fndecl (orig_exp);
3595 fcode = DECL_FUNCTION_CODE (fndecl);
3596 if (fcode == BUILT_IN_MEMSET)
3597 fn = build_call_nofold_loc (EXPR_LOCATION (orig_exp), fndecl, 3,
3599 else if (fcode == BUILT_IN_BZERO)
3600 fn = build_call_nofold_loc (EXPR_LOCATION (orig_exp), fndecl, 2,
3604 gcc_assert (TREE_CODE (fn) == CALL_EXPR);
3605 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (orig_exp);
3606 return expand_call (fn, target, target == const0_rtx);
3609 /* Expand expression EXP, which is a call to the bzero builtin. Return
3610 NULL_RTX if we failed the caller should emit a normal call. */
3613 expand_builtin_bzero (tree exp)
3616 location_t loc = EXPR_LOCATION (exp);
3618 if (!validate_arglist (exp, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3621 dest = CALL_EXPR_ARG (exp, 0);
3622 size = CALL_EXPR_ARG (exp, 1);
3624 /* New argument list transforming bzero(ptr x, int y) to
3625 memset(ptr x, int 0, size_t y). This is done this way
3626 so that if it isn't expanded inline, we fallback to
3627 calling bzero instead of memset. */
3629 return expand_builtin_memset_args (dest, integer_zero_node,
3630 fold_convert_loc (loc, sizetype, size),
3631 const0_rtx, VOIDmode, exp);
3634 /* Expand expression EXP, which is a call to the memcmp built-in function.
3635 Return NULL_RTX if we failed and the
3636 caller should emit a normal call, otherwise try to get the result in
3637 TARGET, if convenient (and in mode MODE, if that's convenient). */
3640 expand_builtin_memcmp (tree exp, ATTRIBUTE_UNUSED rtx target,
3641 ATTRIBUTE_UNUSED enum machine_mode mode)
3643 location_t loc ATTRIBUTE_UNUSED = EXPR_LOCATION (exp);
3645 if (!validate_arglist (exp,
3646 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3649 #if defined HAVE_cmpmemsi || defined HAVE_cmpstrnsi
3651 rtx arg1_rtx, arg2_rtx, arg3_rtx;
3654 tree arg1 = CALL_EXPR_ARG (exp, 0);
3655 tree arg2 = CALL_EXPR_ARG (exp, 1);
3656 tree len = CALL_EXPR_ARG (exp, 2);
3658 unsigned int arg1_align
3659 = get_pointer_alignment (arg1, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3660 unsigned int arg2_align
3661 = get_pointer_alignment (arg2, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3662 enum machine_mode insn_mode;
3664 #ifdef HAVE_cmpmemsi
3666 insn_mode = insn_data[(int) CODE_FOR_cmpmemsi].operand[0].mode;
3669 #ifdef HAVE_cmpstrnsi
3671 insn_mode = insn_data[(int) CODE_FOR_cmpstrnsi].operand[0].mode;
3676 /* If we don't have POINTER_TYPE, call the function. */
3677 if (arg1_align == 0 || arg2_align == 0)
3680 /* Make a place to write the result of the instruction. */
3683 && REG_P (result) && GET_MODE (result) == insn_mode
3684 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
3685 result = gen_reg_rtx (insn_mode);
3687 arg1_rtx = get_memory_rtx (arg1, len);
3688 arg2_rtx = get_memory_rtx (arg2, len);
3689 arg3_rtx = expand_normal (fold_convert_loc (loc, sizetype, len));
3691 /* Set MEM_SIZE as appropriate. */
3692 if (CONST_INT_P (arg3_rtx))
3694 set_mem_size (arg1_rtx, arg3_rtx);
3695 set_mem_size (arg2_rtx, arg3_rtx);
3698 #ifdef HAVE_cmpmemsi
3700 insn = gen_cmpmemsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
3701 GEN_INT (MIN (arg1_align, arg2_align)));
3704 #ifdef HAVE_cmpstrnsi
3706 insn = gen_cmpstrnsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
3707 GEN_INT (MIN (arg1_align, arg2_align)));
3715 emit_library_call_value (memcmp_libfunc, result, LCT_PURE,
3716 TYPE_MODE (integer_type_node), 3,
3717 XEXP (arg1_rtx, 0), Pmode,
3718 XEXP (arg2_rtx, 0), Pmode,
3719 convert_to_mode (TYPE_MODE (sizetype), arg3_rtx,
3720 TYPE_UNSIGNED (sizetype)),
3721 TYPE_MODE (sizetype));
3723 /* Return the value in the proper mode for this function. */
3724 mode = TYPE_MODE (TREE_TYPE (exp));
3725 if (GET_MODE (result) == mode)
3727 else if (target != 0)
3729 convert_move (target, result, 0);
3733 return convert_to_mode (mode, result, 0);
3740 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
3741 if we failed the caller should emit a normal call, otherwise try to get
3742 the result in TARGET, if convenient. */
3745 expand_builtin_strcmp (tree exp, ATTRIBUTE_UNUSED rtx target)
3747 if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3750 #if defined HAVE_cmpstrsi || defined HAVE_cmpstrnsi
3751 if (direct_optab_handler (cmpstr_optab, SImode) != CODE_FOR_nothing
3752 || direct_optab_handler (cmpstrn_optab, SImode) != CODE_FOR_nothing)
3754 rtx arg1_rtx, arg2_rtx;
3755 rtx result, insn = NULL_RTX;
3757 tree arg1 = CALL_EXPR_ARG (exp, 0);
3758 tree arg2 = CALL_EXPR_ARG (exp, 1);
3760 unsigned int arg1_align
3761 = get_pointer_alignment (arg1, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3762 unsigned int arg2_align
3763 = get_pointer_alignment (arg2, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3765 /* If we don't have POINTER_TYPE, call the function. */
3766 if (arg1_align == 0 || arg2_align == 0)
3769 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
3770 arg1 = builtin_save_expr (arg1);
3771 arg2 = builtin_save_expr (arg2);
3773 arg1_rtx = get_memory_rtx (arg1, NULL);
3774 arg2_rtx = get_memory_rtx (arg2, NULL);
3776 #ifdef HAVE_cmpstrsi
3777 /* Try to call cmpstrsi. */
3780 enum machine_mode insn_mode
3781 = insn_data[(int) CODE_FOR_cmpstrsi].operand[0].mode;
3783 /* Make a place to write the result of the instruction. */
3786 && REG_P (result) && GET_MODE (result) == insn_mode
3787 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
3788 result = gen_reg_rtx (insn_mode);
3790 insn = gen_cmpstrsi (result, arg1_rtx, arg2_rtx,
3791 GEN_INT (MIN (arg1_align, arg2_align)));
3794 #ifdef HAVE_cmpstrnsi
3795 /* Try to determine at least one length and call cmpstrnsi. */
3796 if (!insn && HAVE_cmpstrnsi)
3801 enum machine_mode insn_mode
3802 = insn_data[(int) CODE_FOR_cmpstrnsi].operand[0].mode;
3803 tree len1 = c_strlen (arg1, 1);
3804 tree len2 = c_strlen (arg2, 1);
3807 len1 = size_binop (PLUS_EXPR, ssize_int (1), len1);
3809 len2 = size_binop (PLUS_EXPR, ssize_int (1), len2);
3811 /* If we don't have a constant length for the first, use the length
3812 of the second, if we know it. We don't require a constant for
3813 this case; some cost analysis could be done if both are available
3814 but neither is constant. For now, assume they're equally cheap,
3815 unless one has side effects. If both strings have constant lengths,
3822 else if (TREE_SIDE_EFFECTS (len1))
3824 else if (TREE_SIDE_EFFECTS (len2))
3826 else if (TREE_CODE (len1) != INTEGER_CST)
3828 else if (TREE_CODE (len2) != INTEGER_CST)
3830 else if (tree_int_cst_lt (len1, len2))
3835 /* If both arguments have side effects, we cannot optimize. */
3836 if (!len || TREE_SIDE_EFFECTS (len))
3839 arg3_rtx = expand_normal (len);
3841 /* Make a place to write the result of the instruction. */
3844 && REG_P (result) && GET_MODE (result) == insn_mode
3845 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
3846 result = gen_reg_rtx (insn_mode);
3848 insn = gen_cmpstrnsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
3849 GEN_INT (MIN (arg1_align, arg2_align)));
3855 enum machine_mode mode;
3858 /* Return the value in the proper mode for this function. */
3859 mode = TYPE_MODE (TREE_TYPE (exp));
3860 if (GET_MODE (result) == mode)
3863 return convert_to_mode (mode, result, 0);
3864 convert_move (target, result, 0);
3868 /* Expand the library call ourselves using a stabilized argument
3869 list to avoid re-evaluating the function's arguments twice. */
3870 #ifdef HAVE_cmpstrnsi
3873 fndecl = get_callee_fndecl (exp);
3874 fn = build_call_nofold_loc (EXPR_LOCATION (exp), fndecl, 2, arg1, arg2);
3875 gcc_assert (TREE_CODE (fn) == CALL_EXPR);
3876 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
3877 return expand_call (fn, target, target == const0_rtx);
3883 /* Expand expression EXP, which is a call to the strncmp builtin. Return
3884 NULL_RTX if we failed the caller should emit a normal call, otherwise try to get
3885 the result in TARGET, if convenient. */
3888 expand_builtin_strncmp (tree exp, ATTRIBUTE_UNUSED rtx target,
3889 ATTRIBUTE_UNUSED enum machine_mode mode)
3891 location_t loc ATTRIBUTE_UNUSED = EXPR_LOCATION (exp);
3893 if (!validate_arglist (exp,
3894 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3897 /* If c_strlen can determine an expression for one of the string
3898 lengths, and it doesn't have side effects, then emit cmpstrnsi
3899 using length MIN(strlen(string)+1, arg3). */
3900 #ifdef HAVE_cmpstrnsi
3903 tree len, len1, len2;
3904 rtx arg1_rtx, arg2_rtx, arg3_rtx;
3907 tree arg1 = CALL_EXPR_ARG (exp, 0);
3908 tree arg2 = CALL_EXPR_ARG (exp, 1);
3909 tree arg3 = CALL_EXPR_ARG (exp, 2);
3911 unsigned int arg1_align
3912 = get_pointer_alignment (arg1, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3913 unsigned int arg2_align
3914 = get_pointer_alignment (arg2, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3915 enum machine_mode insn_mode
3916 = insn_data[(int) CODE_FOR_cmpstrnsi].operand[0].mode;
3918 len1 = c_strlen (arg1, 1);
3919 len2 = c_strlen (arg2, 1);
3922 len1 = size_binop_loc (loc, PLUS_EXPR, ssize_int (1), len1);
3924 len2 = size_binop_loc (loc, PLUS_EXPR, ssize_int (1), len2);
3926 /* If we don't have a constant length for the first, use the length
3927 of the second, if we know it. We don't require a constant for
3928 this case; some cost analysis could be done if both are available
3929 but neither is constant. For now, assume they're equally cheap,
3930 unless one has side effects. If both strings have constant lengths,
3937 else if (TREE_SIDE_EFFECTS (len1))
3939 else if (TREE_SIDE_EFFECTS (len2))
3941 else if (TREE_CODE (len1) != INTEGER_CST)
3943 else if (TREE_CODE (len2) != INTEGER_CST)
3945 else if (tree_int_cst_lt (len1, len2))
3950 /* If both arguments have side effects, we cannot optimize. */
3951 if (!len || TREE_SIDE_EFFECTS (len))
3954 /* The actual new length parameter is MIN(len,arg3). */
3955 len = fold_build2_loc (loc, MIN_EXPR, TREE_TYPE (len), len,
3956 fold_convert_loc (loc, TREE_TYPE (len), arg3));
3958 /* If we don't have POINTER_TYPE, call the function. */
3959 if (arg1_align == 0 || arg2_align == 0)
3962 /* Make a place to write the result of the instruction. */
3965 && REG_P (result) && GET_MODE (result) == insn_mode
3966 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
3967 result = gen_reg_rtx (insn_mode);
3969 /* Stabilize the arguments in case gen_cmpstrnsi fails. */
3970 arg1 = builtin_save_expr (arg1);
3971 arg2 = builtin_save_expr (arg2);
3972 len = builtin_save_expr (len);
3974 arg1_rtx = get_memory_rtx (arg1, len);
3975 arg2_rtx = get_memory_rtx (arg2, len);
3976 arg3_rtx = expand_normal (len);
3977 insn = gen_cmpstrnsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
3978 GEN_INT (MIN (arg1_align, arg2_align)));
3983 /* Return the value in the proper mode for this function. */
3984 mode = TYPE_MODE (TREE_TYPE (exp));
3985 if (GET_MODE (result) == mode)
3988 return convert_to_mode (mode, result, 0);
3989 convert_move (target, result, 0);
3993 /* Expand the library call ourselves using a stabilized argument
3994 list to avoid re-evaluating the function's arguments twice. */
3995 fndecl = get_callee_fndecl (exp);
3996 fn = build_call_nofold_loc (EXPR_LOCATION (exp), fndecl, 3,
3998 gcc_assert (TREE_CODE (fn) == CALL_EXPR);
3999 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
4000 return expand_call (fn, target, target == const0_rtx);
4006 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
4007 if that's convenient. */
4010 expand_builtin_saveregs (void)
4014 /* Don't do __builtin_saveregs more than once in a function.
4015 Save the result of the first call and reuse it. */
4016 if (saveregs_value != 0)
4017 return saveregs_value;
4019 /* When this function is called, it means that registers must be
4020 saved on entry to this function. So we migrate the call to the
4021 first insn of this function. */
4025 /* Do whatever the machine needs done in this case. */
4026 val = targetm.calls.expand_builtin_saveregs ();
4031 saveregs_value = val;
4033 /* Put the insns after the NOTE that starts the function. If this
4034 is inside a start_sequence, make the outer-level insn chain current, so
4035 the code is placed at the start of the function. */
4036 push_topmost_sequence ();
4037 emit_insn_after (seq, entry_of_function ());
4038 pop_topmost_sequence ();
4043 /* Expand a call to __builtin_next_arg. */
4046 expand_builtin_next_arg (void)
4048 /* Checking arguments is already done in fold_builtin_next_arg
4049 that must be called before this function. */
4050 return expand_binop (ptr_mode, add_optab,
4051 crtl->args.internal_arg_pointer,
4052 crtl->args.arg_offset_rtx,
4053 NULL_RTX, 0, OPTAB_LIB_WIDEN);
4056 /* Make it easier for the backends by protecting the valist argument
4057 from multiple evaluations. */
4060 stabilize_va_list_loc (location_t loc, tree valist, int needs_lvalue)
4062 tree vatype = targetm.canonical_va_list_type (TREE_TYPE (valist));
4064 /* The current way of determining the type of valist is completely
4065 bogus. We should have the information on the va builtin instead. */
4067 vatype = targetm.fn_abi_va_list (cfun->decl);
4069 if (TREE_CODE (vatype) == ARRAY_TYPE)
4071 if (TREE_SIDE_EFFECTS (valist))
4072 valist = save_expr (valist);
4074 /* For this case, the backends will be expecting a pointer to
4075 vatype, but it's possible we've actually been given an array
4076 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
4078 if (TREE_CODE (TREE_TYPE (valist)) == ARRAY_TYPE)
4080 tree p1 = build_pointer_type (TREE_TYPE (vatype));
4081 valist = build_fold_addr_expr_with_type_loc (loc, valist, p1);
4086 tree pt = build_pointer_type (vatype);
4090 if (! TREE_SIDE_EFFECTS (valist))
4093 valist = fold_build1_loc (loc, ADDR_EXPR, pt, valist);
4094 TREE_SIDE_EFFECTS (valist) = 1;
4097 if (TREE_SIDE_EFFECTS (valist))
4098 valist = save_expr (valist);
4099 valist = fold_build2_loc (loc, MEM_REF,
4100 vatype, valist, build_int_cst (pt, 0));
4106 /* The "standard" definition of va_list is void*. */
4109 std_build_builtin_va_list (void)
4111 return ptr_type_node;
4114 /* The "standard" abi va_list is va_list_type_node. */
4117 std_fn_abi_va_list (tree fndecl ATTRIBUTE_UNUSED)
4119 return va_list_type_node;
4122 /* The "standard" type of va_list is va_list_type_node. */
4125 std_canonical_va_list_type (tree type)
4129 if (INDIRECT_REF_P (type))
4130 type = TREE_TYPE (type);
4131 else if (POINTER_TYPE_P (type) && POINTER_TYPE_P (TREE_TYPE(type)))
4132 type = TREE_TYPE (type);
4133 wtype = va_list_type_node;
4135 /* Treat structure va_list types. */
4136 if (TREE_CODE (wtype) == RECORD_TYPE && POINTER_TYPE_P (htype))
4137 htype = TREE_TYPE (htype);
4138 else if (TREE_CODE (wtype) == ARRAY_TYPE)
4140 /* If va_list is an array type, the argument may have decayed
4141 to a pointer type, e.g. by being passed to another function.
4142 In that case, unwrap both types so that we can compare the
4143 underlying records. */
4144 if (TREE_CODE (htype) == ARRAY_TYPE
4145 || POINTER_TYPE_P (htype))
4147 wtype = TREE_TYPE (wtype);
4148 htype = TREE_TYPE (htype);
4151 if (TYPE_MAIN_VARIANT (wtype) == TYPE_MAIN_VARIANT (htype))
4152 return va_list_type_node;
4157 /* The "standard" implementation of va_start: just assign `nextarg' to
4161 std_expand_builtin_va_start (tree valist, rtx nextarg)
4163 rtx va_r = expand_expr (valist, NULL_RTX, VOIDmode, EXPAND_WRITE);
4164 convert_move (va_r, nextarg, 0);
4167 /* Expand EXP, a call to __builtin_va_start. */
4170 expand_builtin_va_start (tree exp)
4174 location_t loc = EXPR_LOCATION (exp);
4176 if (call_expr_nargs (exp) < 2)
4178 error_at (loc, "too few arguments to function %<va_start%>");
4182 if (fold_builtin_next_arg (exp, true))
4185 nextarg = expand_builtin_next_arg ();
4186 valist = stabilize_va_list_loc (loc, CALL_EXPR_ARG (exp, 0), 1);
4188 if (targetm.expand_builtin_va_start)
4189 targetm.expand_builtin_va_start (valist, nextarg);
4191 std_expand_builtin_va_start (valist, nextarg);
4196 /* The "standard" implementation of va_arg: read the value from the
4197 current (padded) address and increment by the (padded) size. */
4200 std_gimplify_va_arg_expr (tree valist, tree type, gimple_seq *pre_p,
4203 tree addr, t, type_size, rounded_size, valist_tmp;
4204 unsigned HOST_WIDE_INT align, boundary;
4207 #ifdef ARGS_GROW_DOWNWARD
4208 /* All of the alignment and movement below is for args-grow-up machines.
4209 As of 2004, there are only 3 ARGS_GROW_DOWNWARD targets, and they all
4210 implement their own specialized gimplify_va_arg_expr routines. */
4214 indirect = pass_by_reference (NULL, TYPE_MODE (type), type, false);
4216 type = build_pointer_type (type);
4218 align = PARM_BOUNDARY / BITS_PER_UNIT;
4219 boundary = targetm.calls.function_arg_boundary (TYPE_MODE (type), type);
4221 /* When we align parameter on stack for caller, if the parameter
4222 alignment is beyond MAX_SUPPORTED_STACK_ALIGNMENT, it will be
4223 aligned at MAX_SUPPORTED_STACK_ALIGNMENT. We will match callee
4224 here with caller. */
4225 if (boundary > MAX_SUPPORTED_STACK_ALIGNMENT)
4226 boundary = MAX_SUPPORTED_STACK_ALIGNMENT;
4228 boundary /= BITS_PER_UNIT;
4230 /* Hoist the valist value into a temporary for the moment. */
4231 valist_tmp = get_initialized_tmp_var (valist, pre_p, NULL);
4233 /* va_list pointer is aligned to PARM_BOUNDARY. If argument actually
4234 requires greater alignment, we must perform dynamic alignment. */
4235 if (boundary > align
4236 && !integer_zerop (TYPE_SIZE (type)))
4238 t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist_tmp,
4239 fold_build_pointer_plus_hwi (valist_tmp, boundary - 1));
4240 gimplify_and_add (t, pre_p);
4242 t = fold_convert (sizetype, valist_tmp);
4243 t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist_tmp,
4244 fold_convert (TREE_TYPE (valist),
4245 fold_build2 (BIT_AND_EXPR, sizetype, t,
4246 size_int (-boundary))));
4247 gimplify_and_add (t, pre_p);
4252 /* If the actual alignment is less than the alignment of the type,
4253 adjust the type accordingly so that we don't assume strict alignment
4254 when dereferencing the pointer. */
4255 boundary *= BITS_PER_UNIT;
4256 if (boundary < TYPE_ALIGN (type))
4258 type = build_variant_type_copy (type);
4259 TYPE_ALIGN (type) = boundary;
4262 /* Compute the rounded size of the type. */
4263 type_size = size_in_bytes (type);
4264 rounded_size = round_up (type_size, align);
4266 /* Reduce rounded_size so it's sharable with the postqueue. */
4267 gimplify_expr (&rounded_size, pre_p, post_p, is_gimple_val, fb_rvalue);
4271 if (PAD_VARARGS_DOWN && !integer_zerop (rounded_size))
4273 /* Small args are padded downward. */
4274 t = fold_build2_loc (input_location, GT_EXPR, sizetype,
4275 rounded_size, size_int (align));
4276 t = fold_build3 (COND_EXPR, sizetype, t, size_zero_node,
4277 size_binop (MINUS_EXPR, rounded_size, type_size));
4278 addr = fold_build_pointer_plus (addr, t);
4281 /* Compute new value for AP. */
4282 t = fold_build_pointer_plus (valist_tmp, rounded_size);
4283 t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist, t);
4284 gimplify_and_add (t, pre_p);
4286 addr = fold_convert (build_pointer_type (type), addr);
4289 addr = build_va_arg_indirect_ref (addr);
4291 return build_va_arg_indirect_ref (addr);
4294 /* Build an indirect-ref expression over the given TREE, which represents a
4295 piece of a va_arg() expansion. */
4297 build_va_arg_indirect_ref (tree addr)
4299 addr = build_simple_mem_ref_loc (EXPR_LOCATION (addr), addr);
4301 if (flag_mudflap) /* Don't instrument va_arg INDIRECT_REF. */
4307 /* Return a dummy expression of type TYPE in order to keep going after an
4311 dummy_object (tree type)
4313 tree t = build_int_cst (build_pointer_type (type), 0);
4314 return build2 (MEM_REF, type, t, t);
4317 /* Gimplify __builtin_va_arg, aka VA_ARG_EXPR, which is not really a
4318 builtin function, but a very special sort of operator. */
4320 enum gimplify_status
4321 gimplify_va_arg_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4323 tree promoted_type, have_va_type;
4324 tree valist = TREE_OPERAND (*expr_p, 0);
4325 tree type = TREE_TYPE (*expr_p);
4327 location_t loc = EXPR_LOCATION (*expr_p);
4329 /* Verify that valist is of the proper type. */
4330 have_va_type = TREE_TYPE (valist);
4331 if (have_va_type == error_mark_node)
4333 have_va_type = targetm.canonical_va_list_type (have_va_type);
4335 if (have_va_type == NULL_TREE)
4337 error_at (loc, "first argument to %<va_arg%> not of type %<va_list%>");
4341 /* Generate a diagnostic for requesting data of a type that cannot
4342 be passed through `...' due to type promotion at the call site. */
4343 if ((promoted_type = lang_hooks.types.type_promotes_to (type))
4346 static bool gave_help;
4349 /* Unfortunately, this is merely undefined, rather than a constraint
4350 violation, so we cannot make this an error. If this call is never
4351 executed, the program is still strictly conforming. */
4352 warned = warning_at (loc, 0,
4353 "%qT is promoted to %qT when passed through %<...%>",
4354 type, promoted_type);
4355 if (!gave_help && warned)
4358 inform (loc, "(so you should pass %qT not %qT to %<va_arg%>)",
4359 promoted_type, type);
4362 /* We can, however, treat "undefined" any way we please.
4363 Call abort to encourage the user to fix the program. */
4365 inform (loc, "if this code is reached, the program will abort");
4366 /* Before the abort, allow the evaluation of the va_list
4367 expression to exit or longjmp. */
4368 gimplify_and_add (valist, pre_p);
4369 t = build_call_expr_loc (loc,
4370 implicit_built_in_decls[BUILT_IN_TRAP], 0);
4371 gimplify_and_add (t, pre_p);
4373 /* This is dead code, but go ahead and finish so that the
4374 mode of the result comes out right. */
4375 *expr_p = dummy_object (type);
4380 /* Make it easier for the backends by protecting the valist argument
4381 from multiple evaluations. */
4382 if (TREE_CODE (have_va_type) == ARRAY_TYPE)
4384 /* For this case, the backends will be expecting a pointer to
4385 TREE_TYPE (abi), but it's possible we've
4386 actually been given an array (an actual TARGET_FN_ABI_VA_LIST).
4388 if (TREE_CODE (TREE_TYPE (valist)) == ARRAY_TYPE)
4390 tree p1 = build_pointer_type (TREE_TYPE (have_va_type));
4391 valist = fold_convert_loc (loc, p1,
4392 build_fold_addr_expr_loc (loc, valist));
4395 gimplify_expr (&valist, pre_p, post_p, is_gimple_val, fb_rvalue);
4398 gimplify_expr (&valist, pre_p, post_p, is_gimple_min_lval, fb_lvalue);
4400 if (!targetm.gimplify_va_arg_expr)
4401 /* FIXME: Once most targets are converted we should merely
4402 assert this is non-null. */
4405 *expr_p = targetm.gimplify_va_arg_expr (valist, type, pre_p, post_p);
4410 /* Expand EXP, a call to __builtin_va_end. */
4413 expand_builtin_va_end (tree exp)
4415 tree valist = CALL_EXPR_ARG (exp, 0);
4417 /* Evaluate for side effects, if needed. I hate macros that don't
4419 if (TREE_SIDE_EFFECTS (valist))
4420 expand_expr (valist, const0_rtx, VOIDmode, EXPAND_NORMAL);
4425 /* Expand EXP, a call to __builtin_va_copy. We do this as a
4426 builtin rather than just as an assignment in stdarg.h because of the
4427 nastiness of array-type va_list types. */
4430 expand_builtin_va_copy (tree exp)
4433 location_t loc = EXPR_LOCATION (exp);
4435 dst = CALL_EXPR_ARG (exp, 0);
4436 src = CALL_EXPR_ARG (exp, 1);
4438 dst = stabilize_va_list_loc (loc, dst, 1);
4439 src = stabilize_va_list_loc (loc, src, 0);
4441 gcc_assert (cfun != NULL && cfun->decl != NULL_TREE);
4443 if (TREE_CODE (targetm.fn_abi_va_list (cfun->decl)) != ARRAY_TYPE)
4445 t = build2 (MODIFY_EXPR, targetm.fn_abi_va_list (cfun->decl), dst, src);
4446 TREE_SIDE_EFFECTS (t) = 1;
4447 expand_expr (t, const0_rtx, VOIDmode, EXPAND_NORMAL);
4451 rtx dstb, srcb, size;
4453 /* Evaluate to pointers. */
4454 dstb = expand_expr (dst, NULL_RTX, Pmode, EXPAND_NORMAL);
4455 srcb = expand_expr (src, NULL_RTX, Pmode, EXPAND_NORMAL);
4456 size = expand_expr (TYPE_SIZE_UNIT (targetm.fn_abi_va_list (cfun->decl)),
4457 NULL_RTX, VOIDmode, EXPAND_NORMAL);
4459 dstb = convert_memory_address (Pmode, dstb);
4460 srcb = convert_memory_address (Pmode, srcb);
4462 /* "Dereference" to BLKmode memories. */
4463 dstb = gen_rtx_MEM (BLKmode, dstb);
4464 set_mem_alias_set (dstb, get_alias_set (TREE_TYPE (TREE_TYPE (dst))));
4465 set_mem_align (dstb, TYPE_ALIGN (targetm.fn_abi_va_list (cfun->decl)));
4466 srcb = gen_rtx_MEM (BLKmode, srcb);
4467 set_mem_alias_set (srcb, get_alias_set (TREE_TYPE (TREE_TYPE (src))));
4468 set_mem_align (srcb, TYPE_ALIGN (targetm.fn_abi_va_list (cfun->decl)));
4471 emit_block_move (dstb, srcb, size, BLOCK_OP_NORMAL);
4477 /* Expand a call to one of the builtin functions __builtin_frame_address or
4478 __builtin_return_address. */
4481 expand_builtin_frame_address (tree fndecl, tree exp)
4483 /* The argument must be a nonnegative integer constant.
4484 It counts the number of frames to scan up the stack.
4485 The value is the return address saved in that frame. */
4486 if (call_expr_nargs (exp) == 0)
4487 /* Warning about missing arg was already issued. */
4489 else if (! host_integerp (CALL_EXPR_ARG (exp, 0), 1))
4491 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS)
4492 error ("invalid argument to %<__builtin_frame_address%>");
4494 error ("invalid argument to %<__builtin_return_address%>");
4500 = expand_builtin_return_addr (DECL_FUNCTION_CODE (fndecl),
4501 tree_low_cst (CALL_EXPR_ARG (exp, 0), 1));
4503 /* Some ports cannot access arbitrary stack frames. */
4506 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS)
4507 warning (0, "unsupported argument to %<__builtin_frame_address%>");
4509 warning (0, "unsupported argument to %<__builtin_return_address%>");
4513 /* For __builtin_frame_address, return what we've got. */
4514 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS)
4518 && ! CONSTANT_P (tem))
4519 tem = copy_to_mode_reg (Pmode, tem);
4524 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we
4525 failed and the caller should emit a normal call. CANNOT_ACCUMULATE
4526 is the same as for allocate_dynamic_stack_space. */
4529 expand_builtin_alloca (tree exp, bool cannot_accumulate)
4534 /* Emit normal call if marked not-inlineable. */
4535 if (CALL_CANNOT_INLINE_P (exp))
4538 if (!validate_arglist (exp, INTEGER_TYPE, VOID_TYPE))
4541 /* Compute the argument. */
4542 op0 = expand_normal (CALL_EXPR_ARG (exp, 0));
4544 /* Allocate the desired space. */
4545 result = allocate_dynamic_stack_space (op0, 0, BIGGEST_ALIGNMENT,
4547 result = convert_memory_address (ptr_mode, result);
4552 /* Expand a call to a bswap builtin with argument ARG0. MODE
4553 is the mode to expand with. */
4556 expand_builtin_bswap (tree exp, rtx target, rtx subtarget)
4558 enum machine_mode mode;
4562 if (!validate_arglist (exp, INTEGER_TYPE, VOID_TYPE))
4565 arg = CALL_EXPR_ARG (exp, 0);
4566 mode = TYPE_MODE (TREE_TYPE (arg));
4567 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
4569 target = expand_unop (mode, bswap_optab, op0, target, 1);
4571 gcc_assert (target);
4573 return convert_to_mode (mode, target, 0);
4576 /* Expand a call to a unary builtin in EXP.
4577 Return NULL_RTX if a normal call should be emitted rather than expanding the
4578 function in-line. If convenient, the result should be placed in TARGET.
4579 SUBTARGET may be used as the target for computing one of EXP's operands. */
4582 expand_builtin_unop (enum machine_mode target_mode, tree exp, rtx target,
4583 rtx subtarget, optab op_optab)
4587 if (!validate_arglist (exp, INTEGER_TYPE, VOID_TYPE))
4590 /* Compute the argument. */
4591 op0 = expand_expr (CALL_EXPR_ARG (exp, 0),
4593 && (TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp, 0)))
4594 == GET_MODE (subtarget))) ? subtarget : NULL_RTX,
4595 VOIDmode, EXPAND_NORMAL);
4596 /* Compute op, into TARGET if possible.
4597 Set TARGET to wherever the result comes back. */
4598 target = expand_unop (TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp, 0))),
4599 op_optab, op0, target, op_optab != clrsb_optab);
4600 gcc_assert (target);
4602 return convert_to_mode (target_mode, target, 0);
4605 /* Expand a call to __builtin_expect. We just return our argument
4606 as the builtin_expect semantic should've been already executed by
4607 tree branch prediction pass. */
4610 expand_builtin_expect (tree exp, rtx target)
4614 if (call_expr_nargs (exp) < 2)
4616 arg = CALL_EXPR_ARG (exp, 0);
4618 target = expand_expr (arg, target, VOIDmode, EXPAND_NORMAL);
4619 /* When guessing was done, the hints should be already stripped away. */
4620 gcc_assert (!flag_guess_branch_prob
4621 || optimize == 0 || seen_error ());
4625 /* Expand a call to __builtin_assume_aligned. We just return our first
4626 argument as the builtin_assume_aligned semantic should've been already
4630 expand_builtin_assume_aligned (tree exp, rtx target)
4632 if (call_expr_nargs (exp) < 2)
4634 target = expand_expr (CALL_EXPR_ARG (exp, 0), target, VOIDmode,
4636 gcc_assert (!TREE_SIDE_EFFECTS (CALL_EXPR_ARG (exp, 1))
4637 && (call_expr_nargs (exp) < 3
4638 || !TREE_SIDE_EFFECTS (CALL_EXPR_ARG (exp, 2))));
4643 expand_builtin_trap (void)
4647 emit_insn (gen_trap ());
4650 emit_library_call (abort_libfunc, LCT_NORETURN, VOIDmode, 0);
4654 /* Expand a call to __builtin_unreachable. We do nothing except emit
4655 a barrier saying that control flow will not pass here.
4657 It is the responsibility of the program being compiled to ensure
4658 that control flow does never reach __builtin_unreachable. */
4660 expand_builtin_unreachable (void)
4665 /* Expand EXP, a call to fabs, fabsf or fabsl.
4666 Return NULL_RTX if a normal call should be emitted rather than expanding
4667 the function inline. If convenient, the result should be placed
4668 in TARGET. SUBTARGET may be used as the target for computing
4672 expand_builtin_fabs (tree exp, rtx target, rtx subtarget)
4674 enum machine_mode mode;
4678 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
4681 arg = CALL_EXPR_ARG (exp, 0);
4682 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
4683 mode = TYPE_MODE (TREE_TYPE (arg));
4684 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
4685 return expand_abs (mode, op0, target, 0, safe_from_p (target, arg, 1));
4688 /* Expand EXP, a call to copysign, copysignf, or copysignl.
4689 Return NULL is a normal call should be emitted rather than expanding the
4690 function inline. If convenient, the result should be placed in TARGET.
4691 SUBTARGET may be used as the target for computing the operand. */
4694 expand_builtin_copysign (tree exp, rtx target, rtx subtarget)
4699 if (!validate_arglist (exp, REAL_TYPE, REAL_TYPE, VOID_TYPE))
4702 arg = CALL_EXPR_ARG (exp, 0);
4703 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
4705 arg = CALL_EXPR_ARG (exp, 1);
4706 op1 = expand_normal (arg);
4708 return expand_copysign (op0, op1, target);
4711 /* Create a new constant string literal and return a char* pointer to it.
4712 The STRING_CST value is the LEN characters at STR. */
4714 build_string_literal (int len, const char *str)
4716 tree t, elem, index, type;
4718 t = build_string (len, str);
4719 elem = build_type_variant (char_type_node, 1, 0);
4720 index = build_index_type (size_int (len - 1));
4721 type = build_array_type (elem, index);
4722 TREE_TYPE (t) = type;
4723 TREE_CONSTANT (t) = 1;
4724 TREE_READONLY (t) = 1;
4725 TREE_STATIC (t) = 1;
4727 type = build_pointer_type (elem);
4728 t = build1 (ADDR_EXPR, type,
4729 build4 (ARRAY_REF, elem,
4730 t, integer_zero_node, NULL_TREE, NULL_TREE));
4734 /* Expand a call to __builtin___clear_cache. */
4737 expand_builtin___clear_cache (tree exp ATTRIBUTE_UNUSED)
4739 #ifndef HAVE_clear_cache
4740 #ifdef CLEAR_INSN_CACHE
4741 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
4742 does something. Just do the default expansion to a call to
4746 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
4747 does nothing. There is no need to call it. Do nothing. */
4749 #endif /* CLEAR_INSN_CACHE */
4751 /* We have a "clear_cache" insn, and it will handle everything. */
4753 rtx begin_rtx, end_rtx;
4755 /* We must not expand to a library call. If we did, any
4756 fallback library function in libgcc that might contain a call to
4757 __builtin___clear_cache() would recurse infinitely. */
4758 if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
4760 error ("both arguments to %<__builtin___clear_cache%> must be pointers");
4764 if (HAVE_clear_cache)
4766 struct expand_operand ops[2];
4768 begin = CALL_EXPR_ARG (exp, 0);
4769 begin_rtx = expand_expr (begin, NULL_RTX, Pmode, EXPAND_NORMAL);
4771 end = CALL_EXPR_ARG (exp, 1);
4772 end_rtx = expand_expr (end, NULL_RTX, Pmode, EXPAND_NORMAL);
4774 create_address_operand (&ops[0], begin_rtx);
4775 create_address_operand (&ops[1], end_rtx);
4776 if (maybe_expand_insn (CODE_FOR_clear_cache, 2, ops))
4780 #endif /* HAVE_clear_cache */
4783 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
4786 round_trampoline_addr (rtx tramp)
4788 rtx temp, addend, mask;
4790 /* If we don't need too much alignment, we'll have been guaranteed
4791 proper alignment by get_trampoline_type. */
4792 if (TRAMPOLINE_ALIGNMENT <= STACK_BOUNDARY)
4795 /* Round address up to desired boundary. */
4796 temp = gen_reg_rtx (Pmode);
4797 addend = GEN_INT (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT - 1);
4798 mask = GEN_INT (-TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT);
4800 temp = expand_simple_binop (Pmode, PLUS, tramp, addend,
4801 temp, 0, OPTAB_LIB_WIDEN);
4802 tramp = expand_simple_binop (Pmode, AND, temp, mask,
4803 temp, 0, OPTAB_LIB_WIDEN);
4809 expand_builtin_init_trampoline (tree exp)
4811 tree t_tramp, t_func, t_chain;
4812 rtx m_tramp, r_tramp, r_chain, tmp;
4814 if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE,
4815 POINTER_TYPE, VOID_TYPE))
4818 t_tramp = CALL_EXPR_ARG (exp, 0);
4819 t_func = CALL_EXPR_ARG (exp, 1);
4820 t_chain = CALL_EXPR_ARG (exp, 2);
4822 r_tramp = expand_normal (t_tramp);
4823 m_tramp = gen_rtx_MEM (BLKmode, r_tramp);
4824 MEM_NOTRAP_P (m_tramp) = 1;
4826 /* The TRAMP argument should be the address of a field within the
4827 local function's FRAME decl. Let's see if we can fill in the
4828 to fill in the MEM_ATTRs for this memory. */
4829 if (TREE_CODE (t_tramp) == ADDR_EXPR)
4830 set_mem_attributes_minus_bitpos (m_tramp, TREE_OPERAND (t_tramp, 0),
4833 tmp = round_trampoline_addr (r_tramp);
4836 m_tramp = change_address (m_tramp, BLKmode, tmp);
4837 set_mem_align (m_tramp, TRAMPOLINE_ALIGNMENT);
4838 set_mem_size (m_tramp, GEN_INT (TRAMPOLINE_SIZE));
4841 /* The FUNC argument should be the address of the nested function.
4842 Extract the actual function decl to pass to the hook. */
4843 gcc_assert (TREE_CODE (t_func) == ADDR_EXPR);
4844 t_func = TREE_OPERAND (t_func, 0);
4845 gcc_assert (TREE_CODE (t_func) == FUNCTION_DECL);
4847 r_chain = expand_normal (t_chain);
4849 /* Generate insns to initialize the trampoline. */
4850 targetm.calls.trampoline_init (m_tramp, t_func, r_chain);
4852 trampolines_created = 1;
4854 warning_at (DECL_SOURCE_LOCATION (t_func), OPT_Wtrampolines,
4855 "trampoline generated for nested function %qD", t_func);
4861 expand_builtin_adjust_trampoline (tree exp)
4865 if (!validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
4868 tramp = expand_normal (CALL_EXPR_ARG (exp, 0));
4869 tramp = round_trampoline_addr (tramp);
4870 if (targetm.calls.trampoline_adjust_address)
4871 tramp = targetm.calls.trampoline_adjust_address (tramp);
4876 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
4877 function. The function first checks whether the back end provides
4878 an insn to implement signbit for the respective mode. If not, it
4879 checks whether the floating point format of the value is such that
4880 the sign bit can be extracted. If that is not the case, the
4881 function returns NULL_RTX to indicate that a normal call should be
4882 emitted rather than expanding the function in-line. EXP is the
4883 expression that is a call to the builtin function; if convenient,
4884 the result should be placed in TARGET. */
4886 expand_builtin_signbit (tree exp, rtx target)
4888 const struct real_format *fmt;
4889 enum machine_mode fmode, imode, rmode;
4892 enum insn_code icode;
4894 location_t loc = EXPR_LOCATION (exp);
4896 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
4899 arg = CALL_EXPR_ARG (exp, 0);
4900 fmode = TYPE_MODE (TREE_TYPE (arg));
4901 rmode = TYPE_MODE (TREE_TYPE (exp));
4902 fmt = REAL_MODE_FORMAT (fmode);
4904 arg = builtin_save_expr (arg);
4906 /* Expand the argument yielding a RTX expression. */
4907 temp = expand_normal (arg);
4909 /* Check if the back end provides an insn that handles signbit for the
4911 icode = optab_handler (signbit_optab, fmode);
4912 if (icode != CODE_FOR_nothing)
4914 rtx last = get_last_insn ();
4915 target = gen_reg_rtx (TYPE_MODE (TREE_TYPE (exp)));
4916 if (maybe_emit_unop_insn (icode, target, temp, UNKNOWN))
4918 delete_insns_since (last);
4921 /* For floating point formats without a sign bit, implement signbit
4923 bitpos = fmt->signbit_ro;
4926 /* But we can't do this if the format supports signed zero. */
4927 if (fmt->has_signed_zero && HONOR_SIGNED_ZEROS (fmode))
4930 arg = fold_build2_loc (loc, LT_EXPR, TREE_TYPE (exp), arg,
4931 build_real (TREE_TYPE (arg), dconst0));
4932 return expand_expr (arg, target, VOIDmode, EXPAND_NORMAL);
4935 if (GET_MODE_SIZE (fmode) <= UNITS_PER_WORD)
4937 imode = int_mode_for_mode (fmode);
4938 if (imode == BLKmode)
4940 temp = gen_lowpart (imode, temp);
4945 /* Handle targets with different FP word orders. */
4946 if (FLOAT_WORDS_BIG_ENDIAN)
4947 word = (GET_MODE_BITSIZE (fmode) - bitpos) / BITS_PER_WORD;
4949 word = bitpos / BITS_PER_WORD;
4950 temp = operand_subword_force (temp, word, fmode);
4951 bitpos = bitpos % BITS_PER_WORD;
4954 /* Force the intermediate word_mode (or narrower) result into a
4955 register. This avoids attempting to create paradoxical SUBREGs
4956 of floating point modes below. */
4957 temp = force_reg (imode, temp);
4959 /* If the bitpos is within the "result mode" lowpart, the operation
4960 can be implement with a single bitwise AND. Otherwise, we need
4961 a right shift and an AND. */
4963 if (bitpos < GET_MODE_BITSIZE (rmode))
4965 double_int mask = double_int_setbit (double_int_zero, bitpos);
4967 if (GET_MODE_SIZE (imode) > GET_MODE_SIZE (rmode))
4968 temp = gen_lowpart (rmode, temp);
4969 temp = expand_binop (rmode, and_optab, temp,
4970 immed_double_int_const (mask, rmode),
4971 NULL_RTX, 1, OPTAB_LIB_WIDEN);
4975 /* Perform a logical right shift to place the signbit in the least
4976 significant bit, then truncate the result to the desired mode
4977 and mask just this bit. */
4978 temp = expand_shift (RSHIFT_EXPR, imode, temp, bitpos, NULL_RTX, 1);
4979 temp = gen_lowpart (rmode, temp);
4980 temp = expand_binop (rmode, and_optab, temp, const1_rtx,
4981 NULL_RTX, 1, OPTAB_LIB_WIDEN);
4987 /* Expand fork or exec calls. TARGET is the desired target of the
4988 call. EXP is the call. FN is the
4989 identificator of the actual function. IGNORE is nonzero if the
4990 value is to be ignored. */
4993 expand_builtin_fork_or_exec (tree fn, tree exp, rtx target, int ignore)
4998 /* If we are not profiling, just call the function. */
4999 if (!profile_arc_flag)
5002 /* Otherwise call the wrapper. This should be equivalent for the rest of
5003 compiler, so the code does not diverge, and the wrapper may run the
5004 code necessary for keeping the profiling sane. */
5006 switch (DECL_FUNCTION_CODE (fn))
5009 id = get_identifier ("__gcov_fork");
5012 case BUILT_IN_EXECL:
5013 id = get_identifier ("__gcov_execl");
5016 case BUILT_IN_EXECV:
5017 id = get_identifier ("__gcov_execv");
5020 case BUILT_IN_EXECLP:
5021 id = get_identifier ("__gcov_execlp");
5024 case BUILT_IN_EXECLE:
5025 id = get_identifier ("__gcov_execle");
5028 case BUILT_IN_EXECVP:
5029 id = get_identifier ("__gcov_execvp");
5032 case BUILT_IN_EXECVE:
5033 id = get_identifier ("__gcov_execve");
5040 decl = build_decl (DECL_SOURCE_LOCATION (fn),
5041 FUNCTION_DECL, id, TREE_TYPE (fn));
5042 DECL_EXTERNAL (decl) = 1;
5043 TREE_PUBLIC (decl) = 1;
5044 DECL_ARTIFICIAL (decl) = 1;
5045 TREE_NOTHROW (decl) = 1;
5046 DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT;
5047 DECL_VISIBILITY_SPECIFIED (decl) = 1;
5048 call = rewrite_call_expr (EXPR_LOCATION (exp), exp, 0, decl, 0);
5049 return expand_call (call, target, ignore);
5054 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
5055 the pointer in these functions is void*, the tree optimizers may remove
5056 casts. The mode computed in expand_builtin isn't reliable either, due
5057 to __sync_bool_compare_and_swap.
5059 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
5060 group of builtins. This gives us log2 of the mode size. */
5062 static inline enum machine_mode
5063 get_builtin_sync_mode (int fcode_diff)
5065 /* The size is not negotiable, so ask not to get BLKmode in return
5066 if the target indicates that a smaller size would be better. */
5067 return mode_for_size (BITS_PER_UNIT << fcode_diff, MODE_INT, 0);
5070 /* Expand the memory expression LOC and return the appropriate memory operand
5071 for the builtin_sync operations. */
5074 get_builtin_sync_mem (tree loc, enum machine_mode mode)
5078 addr = expand_expr (loc, NULL_RTX, ptr_mode, EXPAND_SUM);
5079 addr = convert_memory_address (Pmode, addr);
5081 /* Note that we explicitly do not want any alias information for this
5082 memory, so that we kill all other live memories. Otherwise we don't
5083 satisfy the full barrier semantics of the intrinsic. */
5084 mem = validize_mem (gen_rtx_MEM (mode, addr));
5086 /* The alignment needs to be at least according to that of the mode. */
5087 set_mem_align (mem, MAX (GET_MODE_ALIGNMENT (mode),
5088 get_pointer_alignment (loc, BIGGEST_ALIGNMENT)));
5089 set_mem_alias_set (mem, ALIAS_SET_MEMORY_BARRIER);
5090 MEM_VOLATILE_P (mem) = 1;
5095 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
5096 EXP is the CALL_EXPR. CODE is the rtx code
5097 that corresponds to the arithmetic or logical operation from the name;
5098 an exception here is that NOT actually means NAND. TARGET is an optional
5099 place for us to store the results; AFTER is true if this is the
5100 fetch_and_xxx form. IGNORE is true if we don't actually care about
5101 the result of the operation at all. */
5104 expand_builtin_sync_operation (enum machine_mode mode, tree exp,
5105 enum rtx_code code, bool after,
5106 rtx target, bool ignore)
5109 enum machine_mode old_mode;
5110 location_t loc = EXPR_LOCATION (exp);
5112 if (code == NOT && warn_sync_nand)
5114 tree fndecl = get_callee_fndecl (exp);
5115 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
5117 static bool warned_f_a_n, warned_n_a_f;
5121 case BUILT_IN_SYNC_FETCH_AND_NAND_1:
5122 case BUILT_IN_SYNC_FETCH_AND_NAND_2:
5123 case BUILT_IN_SYNC_FETCH_AND_NAND_4:
5124 case BUILT_IN_SYNC_FETCH_AND_NAND_8:
5125 case BUILT_IN_SYNC_FETCH_AND_NAND_16:
5130 fndecl = implicit_built_in_decls[BUILT_IN_SYNC_FETCH_AND_NAND_N];
5131 inform (loc, "%qD changed semantics in GCC 4.4", fndecl);
5132 warned_f_a_n = true;
5135 case BUILT_IN_SYNC_NAND_AND_FETCH_1:
5136 case BUILT_IN_SYNC_NAND_AND_FETCH_2:
5137 case BUILT_IN_SYNC_NAND_AND_FETCH_4:
5138 case BUILT_IN_SYNC_NAND_AND_FETCH_8:
5139 case BUILT_IN_SYNC_NAND_AND_FETCH_16:
5144 fndecl = implicit_built_in_decls[BUILT_IN_SYNC_NAND_AND_FETCH_N];
5145 inform (loc, "%qD changed semantics in GCC 4.4", fndecl);
5146 warned_n_a_f = true;
5154 /* Expand the operands. */
5155 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5157 val = expand_expr (CALL_EXPR_ARG (exp, 1), NULL_RTX, mode, EXPAND_NORMAL);
5158 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5159 of CONST_INTs, where we know the old_mode only from the call argument. */
5160 old_mode = GET_MODE (val);
5161 if (old_mode == VOIDmode)
5162 old_mode = TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp, 1)));
5163 val = convert_modes (mode, old_mode, val, 1);
5166 return expand_sync_operation (mem, val, code);
5168 return expand_sync_fetch_operation (mem, val, code, after, target);
5171 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
5172 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
5173 true if this is the boolean form. TARGET is a place for us to store the
5174 results; this is NOT optional if IS_BOOL is true. */
5177 expand_builtin_compare_and_swap (enum machine_mode mode, tree exp,
5178 bool is_bool, rtx target)
5180 rtx old_val, new_val, mem;
5181 enum machine_mode old_mode;
5183 /* Expand the operands. */
5184 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5187 old_val = expand_expr (CALL_EXPR_ARG (exp, 1), NULL_RTX,
5188 mode, EXPAND_NORMAL);
5189 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5190 of CONST_INTs, where we know the old_mode only from the call argument. */
5191 old_mode = GET_MODE (old_val);
5192 if (old_mode == VOIDmode)
5193 old_mode = TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp, 1)));
5194 old_val = convert_modes (mode, old_mode, old_val, 1);
5196 new_val = expand_expr (CALL_EXPR_ARG (exp, 2), NULL_RTX,
5197 mode, EXPAND_NORMAL);
5198 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5199 of CONST_INTs, where we know the old_mode only from the call argument. */
5200 old_mode = GET_MODE (new_val);
5201 if (old_mode == VOIDmode)
5202 old_mode = TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp, 2)));
5203 new_val = convert_modes (mode, old_mode, new_val, 1);
5206 return expand_bool_compare_and_swap (mem, old_val, new_val, target);
5208 return expand_val_compare_and_swap (mem, old_val, new_val, target);
5211 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
5212 general form is actually an atomic exchange, and some targets only
5213 support a reduced form with the second argument being a constant 1.
5214 EXP is the CALL_EXPR; TARGET is an optional place for us to store
5218 expand_builtin_sync_lock_test_and_set (enum machine_mode mode, tree exp,
5222 enum machine_mode old_mode;
5224 /* Expand the operands. */
5225 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5226 val = expand_expr (CALL_EXPR_ARG (exp, 1), NULL_RTX, mode, EXPAND_NORMAL);
5227 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5228 of CONST_INTs, where we know the old_mode only from the call argument. */
5229 old_mode = GET_MODE (val);
5230 if (old_mode == VOIDmode)
5231 old_mode = TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp, 1)));
5232 val = convert_modes (mode, old_mode, val, 1);
5234 return expand_sync_lock_test_and_set (mem, val, target);
5237 /* Expand the __sync_synchronize intrinsic. */
5240 expand_builtin_sync_synchronize (void)
5243 VEC (tree, gc) *v_clobbers;
5245 #ifdef HAVE_memory_barrier
5246 if (HAVE_memory_barrier)
5248 emit_insn (gen_memory_barrier ());
5253 if (synchronize_libfunc != NULL_RTX)
5255 emit_library_call (synchronize_libfunc, LCT_NORMAL, VOIDmode, 0);
5259 /* If no explicit memory barrier instruction is available, create an
5260 empty asm stmt with a memory clobber. */
5261 v_clobbers = VEC_alloc (tree, gc, 1);
5262 VEC_quick_push (tree, v_clobbers,
5263 tree_cons (NULL, build_string (6, "memory"), NULL));
5264 x = gimple_build_asm_vec ("", NULL, NULL, v_clobbers, NULL);
5265 gimple_asm_set_volatile (x, true);
5266 expand_asm_stmt (x);
5269 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
5272 expand_builtin_sync_lock_release (enum machine_mode mode, tree exp)
5274 struct expand_operand ops[2];
5275 enum insn_code icode;
5278 /* Expand the operands. */
5279 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5281 /* If there is an explicit operation in the md file, use it. */
5282 icode = direct_optab_handler (sync_lock_release_optab, mode);
5283 if (icode != CODE_FOR_nothing)
5285 create_fixed_operand (&ops[0], mem);
5286 create_input_operand (&ops[1], const0_rtx, mode);
5287 if (maybe_expand_insn (icode, 2, ops))
5291 /* Otherwise we can implement this operation by emitting a barrier
5292 followed by a store of zero. */
5293 expand_builtin_sync_synchronize ();
5294 emit_move_insn (mem, const0_rtx);
5297 /* Expand an expression EXP that calls a built-in function,
5298 with result going to TARGET if that's convenient
5299 (and in mode MODE if that's convenient).
5300 SUBTARGET may be used as the target for computing one of EXP's operands.
5301 IGNORE is nonzero if the value is to be ignored. */
5304 expand_builtin (tree exp, rtx target, rtx subtarget, enum machine_mode mode,
5307 tree fndecl = get_callee_fndecl (exp);
5308 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
5309 enum machine_mode target_mode = TYPE_MODE (TREE_TYPE (exp));
5312 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
5313 return targetm.expand_builtin (exp, target, subtarget, mode, ignore);
5315 /* When not optimizing, generate calls to library functions for a certain
5318 && !called_as_built_in (fndecl)
5319 && DECL_ASSEMBLER_NAME_SET_P (fndecl)
5320 && fcode != BUILT_IN_ALLOCA
5321 && fcode != BUILT_IN_FREE)
5322 return expand_call (exp, target, ignore);
5324 /* The built-in function expanders test for target == const0_rtx
5325 to determine whether the function's result will be ignored. */
5327 target = const0_rtx;
5329 /* If the result of a pure or const built-in function is ignored, and
5330 none of its arguments are volatile, we can avoid expanding the
5331 built-in call and just evaluate the arguments for side-effects. */
5332 if (target == const0_rtx
5333 && ((flags = flags_from_decl_or_type (fndecl)) & (ECF_CONST | ECF_PURE))
5334 && !(flags & ECF_LOOPING_CONST_OR_PURE))
5336 bool volatilep = false;
5338 call_expr_arg_iterator iter;
5340 FOR_EACH_CALL_EXPR_ARG (arg, iter, exp)
5341 if (TREE_THIS_VOLATILE (arg))
5349 FOR_EACH_CALL_EXPR_ARG (arg, iter, exp)
5350 expand_expr (arg, const0_rtx, VOIDmode, EXPAND_NORMAL);
5357 CASE_FLT_FN (BUILT_IN_FABS):
5358 target = expand_builtin_fabs (exp, target, subtarget);
5363 CASE_FLT_FN (BUILT_IN_COPYSIGN):
5364 target = expand_builtin_copysign (exp, target, subtarget);
5369 /* Just do a normal library call if we were unable to fold
5371 CASE_FLT_FN (BUILT_IN_CABS):
5374 CASE_FLT_FN (BUILT_IN_EXP):
5375 CASE_FLT_FN (BUILT_IN_EXP10):
5376 CASE_FLT_FN (BUILT_IN_POW10):
5377 CASE_FLT_FN (BUILT_IN_EXP2):
5378 CASE_FLT_FN (BUILT_IN_EXPM1):
5379 CASE_FLT_FN (BUILT_IN_LOGB):
5380 CASE_FLT_FN (BUILT_IN_LOG):
5381 CASE_FLT_FN (BUILT_IN_LOG10):
5382 CASE_FLT_FN (BUILT_IN_LOG2):
5383 CASE_FLT_FN (BUILT_IN_LOG1P):
5384 CASE_FLT_FN (BUILT_IN_TAN):
5385 CASE_FLT_FN (BUILT_IN_ASIN):
5386 CASE_FLT_FN (BUILT_IN_ACOS):
5387 CASE_FLT_FN (BUILT_IN_ATAN):
5388 CASE_FLT_FN (BUILT_IN_SIGNIFICAND):
5389 /* Treat these like sqrt only if unsafe math optimizations are allowed,
5390 because of possible accuracy problems. */
5391 if (! flag_unsafe_math_optimizations)
5393 CASE_FLT_FN (BUILT_IN_SQRT):
5394 CASE_FLT_FN (BUILT_IN_FLOOR):
5395 CASE_FLT_FN (BUILT_IN_CEIL):
5396 CASE_FLT_FN (BUILT_IN_TRUNC):
5397 CASE_FLT_FN (BUILT_IN_ROUND):
5398 CASE_FLT_FN (BUILT_IN_NEARBYINT):
5399 CASE_FLT_FN (BUILT_IN_RINT):
5400 target = expand_builtin_mathfn (exp, target, subtarget);
5405 CASE_FLT_FN (BUILT_IN_FMA):
5406 target = expand_builtin_mathfn_ternary (exp, target, subtarget);
5411 CASE_FLT_FN (BUILT_IN_ILOGB):
5412 if (! flag_unsafe_math_optimizations)
5414 CASE_FLT_FN (BUILT_IN_ISINF):
5415 CASE_FLT_FN (BUILT_IN_FINITE):
5416 case BUILT_IN_ISFINITE:
5417 case BUILT_IN_ISNORMAL:
5418 target = expand_builtin_interclass_mathfn (exp, target);
5423 CASE_FLT_FN (BUILT_IN_LCEIL):
5424 CASE_FLT_FN (BUILT_IN_LLCEIL):
5425 CASE_FLT_FN (BUILT_IN_LFLOOR):
5426 CASE_FLT_FN (BUILT_IN_LLFLOOR):
5427 target = expand_builtin_int_roundingfn (exp, target);
5432 CASE_FLT_FN (BUILT_IN_LRINT):
5433 CASE_FLT_FN (BUILT_IN_LLRINT):
5434 CASE_FLT_FN (BUILT_IN_LROUND):
5435 CASE_FLT_FN (BUILT_IN_LLROUND):
5436 target = expand_builtin_int_roundingfn_2 (exp, target);
5441 CASE_FLT_FN (BUILT_IN_POWI):
5442 target = expand_builtin_powi (exp, target);
5447 CASE_FLT_FN (BUILT_IN_ATAN2):
5448 CASE_FLT_FN (BUILT_IN_LDEXP):
5449 CASE_FLT_FN (BUILT_IN_SCALB):
5450 CASE_FLT_FN (BUILT_IN_SCALBN):
5451 CASE_FLT_FN (BUILT_IN_SCALBLN):
5452 if (! flag_unsafe_math_optimizations)
5455 CASE_FLT_FN (BUILT_IN_FMOD):
5456 CASE_FLT_FN (BUILT_IN_REMAINDER):
5457 CASE_FLT_FN (BUILT_IN_DREM):
5458 CASE_FLT_FN (BUILT_IN_POW):
5459 target = expand_builtin_mathfn_2 (exp, target, subtarget);
5464 CASE_FLT_FN (BUILT_IN_CEXPI):
5465 target = expand_builtin_cexpi (exp, target);
5466 gcc_assert (target);
5469 CASE_FLT_FN (BUILT_IN_SIN):
5470 CASE_FLT_FN (BUILT_IN_COS):
5471 if (! flag_unsafe_math_optimizations)
5473 target = expand_builtin_mathfn_3 (exp, target, subtarget);
5478 CASE_FLT_FN (BUILT_IN_SINCOS):
5479 if (! flag_unsafe_math_optimizations)
5481 target = expand_builtin_sincos (exp);
5486 case BUILT_IN_APPLY_ARGS:
5487 return expand_builtin_apply_args ();
5489 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
5490 FUNCTION with a copy of the parameters described by
5491 ARGUMENTS, and ARGSIZE. It returns a block of memory
5492 allocated on the stack into which is stored all the registers
5493 that might possibly be used for returning the result of a
5494 function. ARGUMENTS is the value returned by
5495 __builtin_apply_args. ARGSIZE is the number of bytes of
5496 arguments that must be copied. ??? How should this value be
5497 computed? We'll also need a safe worst case value for varargs
5499 case BUILT_IN_APPLY:
5500 if (!validate_arglist (exp, POINTER_TYPE,
5501 POINTER_TYPE, INTEGER_TYPE, VOID_TYPE)
5502 && !validate_arglist (exp, REFERENCE_TYPE,
5503 POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
5509 ops[0] = expand_normal (CALL_EXPR_ARG (exp, 0));
5510 ops[1] = expand_normal (CALL_EXPR_ARG (exp, 1));
5511 ops[2] = expand_normal (CALL_EXPR_ARG (exp, 2));
5513 return expand_builtin_apply (ops[0], ops[1], ops[2]);
5516 /* __builtin_return (RESULT) causes the function to return the
5517 value described by RESULT. RESULT is address of the block of
5518 memory returned by __builtin_apply. */
5519 case BUILT_IN_RETURN:
5520 if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
5521 expand_builtin_return (expand_normal (CALL_EXPR_ARG (exp, 0)));
5524 case BUILT_IN_SAVEREGS:
5525 return expand_builtin_saveregs ();
5527 case BUILT_IN_VA_ARG_PACK:
5528 /* All valid uses of __builtin_va_arg_pack () are removed during
5530 error ("%Kinvalid use of %<__builtin_va_arg_pack ()%>", exp);
5533 case BUILT_IN_VA_ARG_PACK_LEN:
5534 /* All valid uses of __builtin_va_arg_pack_len () are removed during
5536 error ("%Kinvalid use of %<__builtin_va_arg_pack_len ()%>", exp);
5539 /* Return the address of the first anonymous stack arg. */
5540 case BUILT_IN_NEXT_ARG:
5541 if (fold_builtin_next_arg (exp, false))
5543 return expand_builtin_next_arg ();
5545 case BUILT_IN_CLEAR_CACHE:
5546 target = expand_builtin___clear_cache (exp);
5551 case BUILT_IN_CLASSIFY_TYPE:
5552 return expand_builtin_classify_type (exp);
5554 case BUILT_IN_CONSTANT_P:
5557 case BUILT_IN_FRAME_ADDRESS:
5558 case BUILT_IN_RETURN_ADDRESS:
5559 return expand_builtin_frame_address (fndecl, exp);
5561 /* Returns the address of the area where the structure is returned.
5563 case BUILT_IN_AGGREGATE_INCOMING_ADDRESS:
5564 if (call_expr_nargs (exp) != 0
5565 || ! AGGREGATE_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl)))
5566 || !MEM_P (DECL_RTL (DECL_RESULT (current_function_decl))))
5569 return XEXP (DECL_RTL (DECL_RESULT (current_function_decl)), 0);
5571 case BUILT_IN_ALLOCA:
5572 /* If the allocation stems from the declaration of a variable-sized
5573 object, it cannot accumulate. */
5574 target = expand_builtin_alloca (exp, CALL_ALLOCA_FOR_VAR_P (exp));
5579 case BUILT_IN_STACK_SAVE:
5580 return expand_stack_save ();
5582 case BUILT_IN_STACK_RESTORE:
5583 expand_stack_restore (CALL_EXPR_ARG (exp, 0));
5586 case BUILT_IN_BSWAP32:
5587 case BUILT_IN_BSWAP64:
5588 target = expand_builtin_bswap (exp, target, subtarget);
5594 CASE_INT_FN (BUILT_IN_FFS):
5595 case BUILT_IN_FFSIMAX:
5596 target = expand_builtin_unop (target_mode, exp, target,
5597 subtarget, ffs_optab);
5602 CASE_INT_FN (BUILT_IN_CLZ):
5603 case BUILT_IN_CLZIMAX:
5604 target = expand_builtin_unop (target_mode, exp, target,
5605 subtarget, clz_optab);
5610 CASE_INT_FN (BUILT_IN_CTZ):
5611 case BUILT_IN_CTZIMAX:
5612 target = expand_builtin_unop (target_mode, exp, target,
5613 subtarget, ctz_optab);
5618 CASE_INT_FN (BUILT_IN_CLRSB):
5619 case BUILT_IN_CLRSBIMAX:
5620 target = expand_builtin_unop (target_mode, exp, target,
5621 subtarget, clrsb_optab);
5626 CASE_INT_FN (BUILT_IN_POPCOUNT):
5627 case BUILT_IN_POPCOUNTIMAX:
5628 target = expand_builtin_unop (target_mode, exp, target,
5629 subtarget, popcount_optab);
5634 CASE_INT_FN (BUILT_IN_PARITY):
5635 case BUILT_IN_PARITYIMAX:
5636 target = expand_builtin_unop (target_mode, exp, target,
5637 subtarget, parity_optab);
5642 case BUILT_IN_STRLEN:
5643 target = expand_builtin_strlen (exp, target, target_mode);
5648 case BUILT_IN_STRCPY:
5649 target = expand_builtin_strcpy (exp, target);
5654 case BUILT_IN_STRNCPY:
5655 target = expand_builtin_strncpy (exp, target);
5660 case BUILT_IN_STPCPY:
5661 target = expand_builtin_stpcpy (exp, target, mode);
5666 case BUILT_IN_MEMCPY:
5667 target = expand_builtin_memcpy (exp, target);
5672 case BUILT_IN_MEMPCPY:
5673 target = expand_builtin_mempcpy (exp, target, mode);
5678 case BUILT_IN_MEMSET:
5679 target = expand_builtin_memset (exp, target, mode);
5684 case BUILT_IN_BZERO:
5685 target = expand_builtin_bzero (exp);
5690 case BUILT_IN_STRCMP:
5691 target = expand_builtin_strcmp (exp, target);
5696 case BUILT_IN_STRNCMP:
5697 target = expand_builtin_strncmp (exp, target, mode);
5703 case BUILT_IN_MEMCMP:
5704 target = expand_builtin_memcmp (exp, target, mode);
5709 case BUILT_IN_SETJMP:
5710 /* This should have been lowered to the builtins below. */
5713 case BUILT_IN_SETJMP_SETUP:
5714 /* __builtin_setjmp_setup is passed a pointer to an array of five words
5715 and the receiver label. */
5716 if (validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
5718 rtx buf_addr = expand_expr (CALL_EXPR_ARG (exp, 0), subtarget,
5719 VOIDmode, EXPAND_NORMAL);
5720 tree label = TREE_OPERAND (CALL_EXPR_ARG (exp, 1), 0);
5721 rtx label_r = label_rtx (label);
5723 /* This is copied from the handling of non-local gotos. */
5724 expand_builtin_setjmp_setup (buf_addr, label_r);
5725 nonlocal_goto_handler_labels
5726 = gen_rtx_EXPR_LIST (VOIDmode, label_r,
5727 nonlocal_goto_handler_labels);
5728 /* ??? Do not let expand_label treat us as such since we would
5729 not want to be both on the list of non-local labels and on
5730 the list of forced labels. */
5731 FORCED_LABEL (label) = 0;
5736 case BUILT_IN_SETJMP_DISPATCHER:
5737 /* __builtin_setjmp_dispatcher is passed the dispatcher label. */
5738 if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
5740 tree label = TREE_OPERAND (CALL_EXPR_ARG (exp, 0), 0);
5741 rtx label_r = label_rtx (label);
5743 /* Remove the dispatcher label from the list of non-local labels
5744 since the receiver labels have been added to it above. */
5745 remove_node_from_expr_list (label_r, &nonlocal_goto_handler_labels);
5750 case BUILT_IN_SETJMP_RECEIVER:
5751 /* __builtin_setjmp_receiver is passed the receiver label. */
5752 if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
5754 tree label = TREE_OPERAND (CALL_EXPR_ARG (exp, 0), 0);
5755 rtx label_r = label_rtx (label);
5757 expand_builtin_setjmp_receiver (label_r);
5762 /* __builtin_longjmp is passed a pointer to an array of five words.
5763 It's similar to the C library longjmp function but works with
5764 __builtin_setjmp above. */
5765 case BUILT_IN_LONGJMP:
5766 if (validate_arglist (exp, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
5768 rtx buf_addr = expand_expr (CALL_EXPR_ARG (exp, 0), subtarget,
5769 VOIDmode, EXPAND_NORMAL);
5770 rtx value = expand_normal (CALL_EXPR_ARG (exp, 1));
5772 if (value != const1_rtx)
5774 error ("%<__builtin_longjmp%> second argument must be 1");
5778 expand_builtin_longjmp (buf_addr, value);
5783 case BUILT_IN_NONLOCAL_GOTO:
5784 target = expand_builtin_nonlocal_goto (exp);
5789 /* This updates the setjmp buffer that is its argument with the value
5790 of the current stack pointer. */
5791 case BUILT_IN_UPDATE_SETJMP_BUF:
5792 if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
5795 = expand_normal (CALL_EXPR_ARG (exp, 0));
5797 expand_builtin_update_setjmp_buf (buf_addr);
5803 expand_builtin_trap ();
5806 case BUILT_IN_UNREACHABLE:
5807 expand_builtin_unreachable ();
5810 CASE_FLT_FN (BUILT_IN_SIGNBIT):
5811 case BUILT_IN_SIGNBITD32:
5812 case BUILT_IN_SIGNBITD64:
5813 case BUILT_IN_SIGNBITD128:
5814 target = expand_builtin_signbit (exp, target);
5819 /* Various hooks for the DWARF 2 __throw routine. */
5820 case BUILT_IN_UNWIND_INIT:
5821 expand_builtin_unwind_init ();
5823 case BUILT_IN_DWARF_CFA:
5824 return virtual_cfa_rtx;
5825 #ifdef DWARF2_UNWIND_INFO
5826 case BUILT_IN_DWARF_SP_COLUMN:
5827 return expand_builtin_dwarf_sp_column ();
5828 case BUILT_IN_INIT_DWARF_REG_SIZES:
5829 expand_builtin_init_dwarf_reg_sizes (CALL_EXPR_ARG (exp, 0));
5832 case BUILT_IN_FROB_RETURN_ADDR:
5833 return expand_builtin_frob_return_addr (CALL_EXPR_ARG (exp, 0));
5834 case BUILT_IN_EXTRACT_RETURN_ADDR:
5835 return expand_builtin_extract_return_addr (CALL_EXPR_ARG (exp, 0));
5836 case BUILT_IN_EH_RETURN:
5837 expand_builtin_eh_return (CALL_EXPR_ARG (exp, 0),
5838 CALL_EXPR_ARG (exp, 1));
5840 #ifdef EH_RETURN_DATA_REGNO
5841 case BUILT_IN_EH_RETURN_DATA_REGNO:
5842 return expand_builtin_eh_return_data_regno (exp);
5844 case BUILT_IN_EXTEND_POINTER:
5845 return expand_builtin_extend_pointer (CALL_EXPR_ARG (exp, 0));
5846 case BUILT_IN_EH_POINTER:
5847 return expand_builtin_eh_pointer (exp);
5848 case BUILT_IN_EH_FILTER:
5849 return expand_builtin_eh_filter (exp);
5850 case BUILT_IN_EH_COPY_VALUES:
5851 return expand_builtin_eh_copy_values (exp);
5853 case BUILT_IN_VA_START:
5854 return expand_builtin_va_start (exp);
5855 case BUILT_IN_VA_END:
5856 return expand_builtin_va_end (exp);
5857 case BUILT_IN_VA_COPY:
5858 return expand_builtin_va_copy (exp);
5859 case BUILT_IN_EXPECT:
5860 return expand_builtin_expect (exp, target);
5861 case BUILT_IN_ASSUME_ALIGNED:
5862 return expand_builtin_assume_aligned (exp, target);
5863 case BUILT_IN_PREFETCH:
5864 expand_builtin_prefetch (exp);
5867 case BUILT_IN_INIT_TRAMPOLINE:
5868 return expand_builtin_init_trampoline (exp);
5869 case BUILT_IN_ADJUST_TRAMPOLINE:
5870 return expand_builtin_adjust_trampoline (exp);
5873 case BUILT_IN_EXECL:
5874 case BUILT_IN_EXECV:
5875 case BUILT_IN_EXECLP:
5876 case BUILT_IN_EXECLE:
5877 case BUILT_IN_EXECVP:
5878 case BUILT_IN_EXECVE:
5879 target = expand_builtin_fork_or_exec (fndecl, exp, target, ignore);
5884 case BUILT_IN_SYNC_FETCH_AND_ADD_1:
5885 case BUILT_IN_SYNC_FETCH_AND_ADD_2:
5886 case BUILT_IN_SYNC_FETCH_AND_ADD_4:
5887 case BUILT_IN_SYNC_FETCH_AND_ADD_8:
5888 case BUILT_IN_SYNC_FETCH_AND_ADD_16:
5889 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_ADD_1);
5890 target = expand_builtin_sync_operation (mode, exp, PLUS,
5891 false, target, ignore);
5896 case BUILT_IN_SYNC_FETCH_AND_SUB_1:
5897 case BUILT_IN_SYNC_FETCH_AND_SUB_2:
5898 case BUILT_IN_SYNC_FETCH_AND_SUB_4:
5899 case BUILT_IN_SYNC_FETCH_AND_SUB_8:
5900 case BUILT_IN_SYNC_FETCH_AND_SUB_16:
5901 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_SUB_1);
5902 target = expand_builtin_sync_operation (mode, exp, MINUS,
5903 false, target, ignore);
5908 case BUILT_IN_SYNC_FETCH_AND_OR_1:
5909 case BUILT_IN_SYNC_FETCH_AND_OR_2:
5910 case BUILT_IN_SYNC_FETCH_AND_OR_4:
5911 case BUILT_IN_SYNC_FETCH_AND_OR_8:
5912 case BUILT_IN_SYNC_FETCH_AND_OR_16:
5913 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_OR_1);
5914 target = expand_builtin_sync_operation (mode, exp, IOR,
5915 false, target, ignore);
5920 case BUILT_IN_SYNC_FETCH_AND_AND_1:
5921 case BUILT_IN_SYNC_FETCH_AND_AND_2:
5922 case BUILT_IN_SYNC_FETCH_AND_AND_4:
5923 case BUILT_IN_SYNC_FETCH_AND_AND_8:
5924 case BUILT_IN_SYNC_FETCH_AND_AND_16:
5925 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_AND_1);
5926 target = expand_builtin_sync_operation (mode, exp, AND,
5927 false, target, ignore);
5932 case BUILT_IN_SYNC_FETCH_AND_XOR_1:
5933 case BUILT_IN_SYNC_FETCH_AND_XOR_2:
5934 case BUILT_IN_SYNC_FETCH_AND_XOR_4:
5935 case BUILT_IN_SYNC_FETCH_AND_XOR_8:
5936 case BUILT_IN_SYNC_FETCH_AND_XOR_16:
5937 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_XOR_1);
5938 target = expand_builtin_sync_operation (mode, exp, XOR,
5939 false, target, ignore);
5944 case BUILT_IN_SYNC_FETCH_AND_NAND_1:
5945 case BUILT_IN_SYNC_FETCH_AND_NAND_2:
5946 case BUILT_IN_SYNC_FETCH_AND_NAND_4:
5947 case BUILT_IN_SYNC_FETCH_AND_NAND_8:
5948 case BUILT_IN_SYNC_FETCH_AND_NAND_16:
5949 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_NAND_1);
5950 target = expand_builtin_sync_operation (mode, exp, NOT,
5951 false, target, ignore);
5956 case BUILT_IN_SYNC_ADD_AND_FETCH_1:
5957 case BUILT_IN_SYNC_ADD_AND_FETCH_2:
5958 case BUILT_IN_SYNC_ADD_AND_FETCH_4:
5959 case BUILT_IN_SYNC_ADD_AND_FETCH_8:
5960 case BUILT_IN_SYNC_ADD_AND_FETCH_16:
5961 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_ADD_AND_FETCH_1);
5962 target = expand_builtin_sync_operation (mode, exp, PLUS,
5963 true, target, ignore);
5968 case BUILT_IN_SYNC_SUB_AND_FETCH_1:
5969 case BUILT_IN_SYNC_SUB_AND_FETCH_2:
5970 case BUILT_IN_SYNC_SUB_AND_FETCH_4:
5971 case BUILT_IN_SYNC_SUB_AND_FETCH_8:
5972 case BUILT_IN_SYNC_SUB_AND_FETCH_16:
5973 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_SUB_AND_FETCH_1);
5974 target = expand_builtin_sync_operation (mode, exp, MINUS,
5975 true, target, ignore);
5980 case BUILT_IN_SYNC_OR_AND_FETCH_1:
5981 case BUILT_IN_SYNC_OR_AND_FETCH_2:
5982 case BUILT_IN_SYNC_OR_AND_FETCH_4:
5983 case BUILT_IN_SYNC_OR_AND_FETCH_8:
5984 case BUILT_IN_SYNC_OR_AND_FETCH_16:
5985 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_OR_AND_FETCH_1);
5986 target = expand_builtin_sync_operation (mode, exp, IOR,
5987 true, target, ignore);
5992 case BUILT_IN_SYNC_AND_AND_FETCH_1:
5993 case BUILT_IN_SYNC_AND_AND_FETCH_2:
5994 case BUILT_IN_SYNC_AND_AND_FETCH_4:
5995 case BUILT_IN_SYNC_AND_AND_FETCH_8:
5996 case BUILT_IN_SYNC_AND_AND_FETCH_16:
5997 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_AND_AND_FETCH_1);
5998 target = expand_builtin_sync_operation (mode, exp, AND,
5999 true, target, ignore);
6004 case BUILT_IN_SYNC_XOR_AND_FETCH_1:
6005 case BUILT_IN_SYNC_XOR_AND_FETCH_2:
6006 case BUILT_IN_SYNC_XOR_AND_FETCH_4:
6007 case BUILT_IN_SYNC_XOR_AND_FETCH_8:
6008 case BUILT_IN_SYNC_XOR_AND_FETCH_16:
6009 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_XOR_AND_FETCH_1);
6010 target = expand_builtin_sync_operation (mode, exp, XOR,
6011 true, target, ignore);
6016 case BUILT_IN_SYNC_NAND_AND_FETCH_1:
6017 case BUILT_IN_SYNC_NAND_AND_FETCH_2:
6018 case BUILT_IN_SYNC_NAND_AND_FETCH_4:
6019 case BUILT_IN_SYNC_NAND_AND_FETCH_8:
6020 case BUILT_IN_SYNC_NAND_AND_FETCH_16:
6021 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_NAND_AND_FETCH_1);
6022 target = expand_builtin_sync_operation (mode, exp, NOT,
6023 true, target, ignore);
6028 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_1:
6029 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_2:
6030 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_4:
6031 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_8:
6032 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_16:
6033 if (mode == VOIDmode)
6034 mode = TYPE_MODE (boolean_type_node);
6035 if (!target || !register_operand (target, mode))
6036 target = gen_reg_rtx (mode);
6038 mode = get_builtin_sync_mode
6039 (fcode - BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_1);
6040 target = expand_builtin_compare_and_swap (mode, exp, true, target);
6045 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_1:
6046 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_2:
6047 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_4:
6048 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_8:
6049 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_16:
6050 mode = get_builtin_sync_mode
6051 (fcode - BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_1);
6052 target = expand_builtin_compare_and_swap (mode, exp, false, target);
6057 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_1:
6058 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_2:
6059 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_4:
6060 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_8:
6061 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_16:
6062 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_LOCK_TEST_AND_SET_1);
6063 target = expand_builtin_sync_lock_test_and_set (mode, exp, target);
6068 case BUILT_IN_SYNC_LOCK_RELEASE_1:
6069 case BUILT_IN_SYNC_LOCK_RELEASE_2:
6070 case BUILT_IN_SYNC_LOCK_RELEASE_4:
6071 case BUILT_IN_SYNC_LOCK_RELEASE_8:
6072 case BUILT_IN_SYNC_LOCK_RELEASE_16:
6073 mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_LOCK_RELEASE_1);
6074 expand_builtin_sync_lock_release (mode, exp);
6077 case BUILT_IN_SYNC_SYNCHRONIZE:
6078 expand_builtin_sync_synchronize ();
6081 case BUILT_IN_OBJECT_SIZE:
6082 return expand_builtin_object_size (exp);
6084 case BUILT_IN_MEMCPY_CHK:
6085 case BUILT_IN_MEMPCPY_CHK:
6086 case BUILT_IN_MEMMOVE_CHK:
6087 case BUILT_IN_MEMSET_CHK:
6088 target = expand_builtin_memory_chk (exp, target, mode, fcode);
6093 case BUILT_IN_STRCPY_CHK:
6094 case BUILT_IN_STPCPY_CHK:
6095 case BUILT_IN_STRNCPY_CHK:
6096 case BUILT_IN_STRCAT_CHK:
6097 case BUILT_IN_STRNCAT_CHK:
6098 case BUILT_IN_SNPRINTF_CHK:
6099 case BUILT_IN_VSNPRINTF_CHK:
6100 maybe_emit_chk_warning (exp, fcode);
6103 case BUILT_IN_SPRINTF_CHK:
6104 case BUILT_IN_VSPRINTF_CHK:
6105 maybe_emit_sprintf_chk_warning (exp, fcode);
6109 maybe_emit_free_warning (exp);
6112 default: /* just do library call, if unknown builtin */
6116 /* The switch statement above can drop through to cause the function
6117 to be called normally. */
6118 return expand_call (exp, target, ignore);
6121 /* Determine whether a tree node represents a call to a built-in
6122 function. If the tree T is a call to a built-in function with
6123 the right number of arguments of the appropriate types, return
6124 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
6125 Otherwise the return value is END_BUILTINS. */
6127 enum built_in_function
6128 builtin_mathfn_code (const_tree t)
6130 const_tree fndecl, arg, parmlist;
6131 const_tree argtype, parmtype;
6132 const_call_expr_arg_iterator iter;
6134 if (TREE_CODE (t) != CALL_EXPR
6135 || TREE_CODE (CALL_EXPR_FN (t)) != ADDR_EXPR)
6136 return END_BUILTINS;
6138 fndecl = get_callee_fndecl (t);
6139 if (fndecl == NULL_TREE
6140 || TREE_CODE (fndecl) != FUNCTION_DECL
6141 || ! DECL_BUILT_IN (fndecl)
6142 || DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
6143 return END_BUILTINS;
6145 parmlist = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
6146 init_const_call_expr_arg_iterator (t, &iter);
6147 for (; parmlist; parmlist = TREE_CHAIN (parmlist))
6149 /* If a function doesn't take a variable number of arguments,
6150 the last element in the list will have type `void'. */
6151 parmtype = TREE_VALUE (parmlist);
6152 if (VOID_TYPE_P (parmtype))
6154 if (more_const_call_expr_args_p (&iter))
6155 return END_BUILTINS;
6156 return DECL_FUNCTION_CODE (fndecl);
6159 if (! more_const_call_expr_args_p (&iter))
6160 return END_BUILTINS;
6162 arg = next_const_call_expr_arg (&iter);
6163 argtype = TREE_TYPE (arg);
6165 if (SCALAR_FLOAT_TYPE_P (parmtype))
6167 if (! SCALAR_FLOAT_TYPE_P (argtype))
6168 return END_BUILTINS;
6170 else if (COMPLEX_FLOAT_TYPE_P (parmtype))
6172 if (! COMPLEX_FLOAT_TYPE_P (argtype))
6173 return END_BUILTINS;
6175 else if (POINTER_TYPE_P (parmtype))
6177 if (! POINTER_TYPE_P (argtype))
6178 return END_BUILTINS;
6180 else if (INTEGRAL_TYPE_P (parmtype))
6182 if (! INTEGRAL_TYPE_P (argtype))
6183 return END_BUILTINS;
6186 return END_BUILTINS;
6189 /* Variable-length argument list. */
6190 return DECL_FUNCTION_CODE (fndecl);
6193 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
6194 evaluate to a constant. */
6197 fold_builtin_constant_p (tree arg)
6199 /* We return 1 for a numeric type that's known to be a constant
6200 value at compile-time or for an aggregate type that's a
6201 literal constant. */
6204 /* If we know this is a constant, emit the constant of one. */
6205 if (CONSTANT_CLASS_P (arg)
6206 || (TREE_CODE (arg) == CONSTRUCTOR
6207 && TREE_CONSTANT (arg)))
6208 return integer_one_node;
6209 if (TREE_CODE (arg) == ADDR_EXPR)
6211 tree op = TREE_OPERAND (arg, 0);
6212 if (TREE_CODE (op) == STRING_CST
6213 || (TREE_CODE (op) == ARRAY_REF
6214 && integer_zerop (TREE_OPERAND (op, 1))
6215 && TREE_CODE (TREE_OPERAND (op, 0)) == STRING_CST))
6216 return integer_one_node;
6219 /* If this expression has side effects, show we don't know it to be a
6220 constant. Likewise if it's a pointer or aggregate type since in
6221 those case we only want literals, since those are only optimized
6222 when generating RTL, not later.
6223 And finally, if we are compiling an initializer, not code, we
6224 need to return a definite result now; there's not going to be any
6225 more optimization done. */
6226 if (TREE_SIDE_EFFECTS (arg)
6227 || AGGREGATE_TYPE_P (TREE_TYPE (arg))
6228 || POINTER_TYPE_P (TREE_TYPE (arg))
6230 || folding_initializer)
6231 return integer_zero_node;
6236 /* Create builtin_expect with PRED and EXPECTED as its arguments and
6237 return it as a truthvalue. */
6240 build_builtin_expect_predicate (location_t loc, tree pred, tree expected)
6242 tree fn, arg_types, pred_type, expected_type, call_expr, ret_type;
6244 fn = built_in_decls[BUILT_IN_EXPECT];
6245 arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn));
6246 ret_type = TREE_TYPE (TREE_TYPE (fn));
6247 pred_type = TREE_VALUE (arg_types);
6248 expected_type = TREE_VALUE (TREE_CHAIN (arg_types));
6250 pred = fold_convert_loc (loc, pred_type, pred);
6251 expected = fold_convert_loc (loc, expected_type, expected);
6252 call_expr = build_call_expr_loc (loc, fn, 2, pred, expected);
6254 return build2 (NE_EXPR, TREE_TYPE (pred), call_expr,
6255 build_int_cst (ret_type, 0));
6258 /* Fold a call to builtin_expect with arguments ARG0 and ARG1. Return
6259 NULL_TREE if no simplification is possible. */
6262 fold_builtin_expect (location_t loc, tree arg0, tree arg1)
6265 enum tree_code code;
6267 /* If this is a builtin_expect within a builtin_expect keep the
6268 inner one. See through a comparison against a constant. It
6269 might have been added to create a thruthvalue. */
6271 if (COMPARISON_CLASS_P (inner)
6272 && TREE_CODE (TREE_OPERAND (inner, 1)) == INTEGER_CST)
6273 inner = TREE_OPERAND (inner, 0);
6275 if (TREE_CODE (inner) == CALL_EXPR
6276 && (fndecl = get_callee_fndecl (inner))
6277 && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
6278 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_EXPECT)
6281 /* Distribute the expected value over short-circuiting operators.
6282 See through the cast from truthvalue_type_node to long. */
6284 while (TREE_CODE (inner) == NOP_EXPR
6285 && INTEGRAL_TYPE_P (TREE_TYPE (inner))
6286 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (inner, 0))))
6287 inner = TREE_OPERAND (inner, 0);
6289 code = TREE_CODE (inner);
6290 if (code == TRUTH_ANDIF_EXPR || code == TRUTH_ORIF_EXPR)
6292 tree op0 = TREE_OPERAND (inner, 0);
6293 tree op1 = TREE_OPERAND (inner, 1);
6295 op0 = build_builtin_expect_predicate (loc, op0, arg1);
6296 op1 = build_builtin_expect_predicate (loc, op1, arg1);
6297 inner = build2 (code, TREE_TYPE (inner), op0, op1);
6299 return fold_convert_loc (loc, TREE_TYPE (arg0), inner);
6302 /* If the argument isn't invariant then there's nothing else we can do. */
6303 if (!TREE_CONSTANT (arg0))
6306 /* If we expect that a comparison against the argument will fold to
6307 a constant return the constant. In practice, this means a true
6308 constant or the address of a non-weak symbol. */
6311 if (TREE_CODE (inner) == ADDR_EXPR)
6315 inner = TREE_OPERAND (inner, 0);
6317 while (TREE_CODE (inner) == COMPONENT_REF
6318 || TREE_CODE (inner) == ARRAY_REF);
6319 if ((TREE_CODE (inner) == VAR_DECL
6320 || TREE_CODE (inner) == FUNCTION_DECL)
6321 && DECL_WEAK (inner))
6325 /* Otherwise, ARG0 already has the proper type for the return value. */
6329 /* Fold a call to __builtin_classify_type with argument ARG. */
6332 fold_builtin_classify_type (tree arg)
6335 return build_int_cst (integer_type_node, no_type_class);
6337 return build_int_cst (integer_type_node, type_to_class (TREE_TYPE (arg)));
6340 /* Fold a call to __builtin_strlen with argument ARG. */
6343 fold_builtin_strlen (location_t loc, tree type, tree arg)
6345 if (!validate_arg (arg, POINTER_TYPE))
6349 tree len = c_strlen (arg, 0);
6352 return fold_convert_loc (loc, type, len);
6358 /* Fold a call to __builtin_inf or __builtin_huge_val. */
6361 fold_builtin_inf (location_t loc, tree type, int warn)
6363 REAL_VALUE_TYPE real;
6365 /* __builtin_inff is intended to be usable to define INFINITY on all
6366 targets. If an infinity is not available, INFINITY expands "to a
6367 positive constant of type float that overflows at translation
6368 time", footnote "In this case, using INFINITY will violate the
6369 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
6370 Thus we pedwarn to ensure this constraint violation is
6372 if (!MODE_HAS_INFINITIES (TYPE_MODE (type)) && warn)
6373 pedwarn (loc, 0, "target format does not support infinity");
6376 return build_real (type, real);
6379 /* Fold a call to __builtin_nan or __builtin_nans with argument ARG. */
6382 fold_builtin_nan (tree arg, tree type, int quiet)
6384 REAL_VALUE_TYPE real;
6387 if (!validate_arg (arg, POINTER_TYPE))
6389 str = c_getstr (arg);
6393 if (!real_nan (&real, str, quiet, TYPE_MODE (type)))
6396 return build_real (type, real);
6399 /* Return true if the floating point expression T has an integer value.
6400 We also allow +Inf, -Inf and NaN to be considered integer values. */
6403 integer_valued_real_p (tree t)
6405 switch (TREE_CODE (t))
6412 return integer_valued_real_p (TREE_OPERAND (t, 0));
6417 return integer_valued_real_p (TREE_OPERAND (t, 1));
6424 return integer_valued_real_p (TREE_OPERAND (t, 0))
6425 && integer_valued_real_p (TREE_OPERAND (t, 1));
6428 return integer_valued_real_p (TREE_OPERAND (t, 1))
6429 && integer_valued_real_p (TREE_OPERAND (t, 2));
6432 return real_isinteger (TREE_REAL_CST_PTR (t), TYPE_MODE (TREE_TYPE (t)));
6436 tree type = TREE_TYPE (TREE_OPERAND (t, 0));
6437 if (TREE_CODE (type) == INTEGER_TYPE)
6439 if (TREE_CODE (type) == REAL_TYPE)
6440 return integer_valued_real_p (TREE_OPERAND (t, 0));
6445 switch (builtin_mathfn_code (t))
6447 CASE_FLT_FN (BUILT_IN_CEIL):
6448 CASE_FLT_FN (BUILT_IN_FLOOR):
6449 CASE_FLT_FN (BUILT_IN_NEARBYINT):
6450 CASE_FLT_FN (BUILT_IN_RINT):
6451 CASE_FLT_FN (BUILT_IN_ROUND):
6452 CASE_FLT_FN (BUILT_IN_TRUNC):
6455 CASE_FLT_FN (BUILT_IN_FMIN):
6456 CASE_FLT_FN (BUILT_IN_FMAX):
6457 return integer_valued_real_p (CALL_EXPR_ARG (t, 0))
6458 && integer_valued_real_p (CALL_EXPR_ARG (t, 1));
6471 /* FNDECL is assumed to be a builtin where truncation can be propagated
6472 across (for instance floor((double)f) == (double)floorf (f).
6473 Do the transformation for a call with argument ARG. */
6476 fold_trunc_transparent_mathfn (location_t loc, tree fndecl, tree arg)
6478 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
6480 if (!validate_arg (arg, REAL_TYPE))
6483 /* Integer rounding functions are idempotent. */
6484 if (fcode == builtin_mathfn_code (arg))
6487 /* If argument is already integer valued, and we don't need to worry
6488 about setting errno, there's no need to perform rounding. */
6489 if (! flag_errno_math && integer_valued_real_p (arg))
6494 tree arg0 = strip_float_extensions (arg);
6495 tree ftype = TREE_TYPE (TREE_TYPE (fndecl));
6496 tree newtype = TREE_TYPE (arg0);
6499 if (TYPE_PRECISION (newtype) < TYPE_PRECISION (ftype)
6500 && (decl = mathfn_built_in (newtype, fcode)))
6501 return fold_convert_loc (loc, ftype,
6502 build_call_expr_loc (loc, decl, 1,
6503 fold_convert_loc (loc,
6510 /* FNDECL is assumed to be builtin which can narrow the FP type of
6511 the argument, for instance lround((double)f) -> lroundf (f).
6512 Do the transformation for a call with argument ARG. */
6515 fold_fixed_mathfn (location_t loc, tree fndecl, tree arg)
6517 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
6519 if (!validate_arg (arg, REAL_TYPE))
6522 /* If argument is already integer valued, and we don't need to worry
6523 about setting errno, there's no need to perform rounding. */
6524 if (! flag_errno_math && integer_valued_real_p (arg))
6525 return fold_build1_loc (loc, FIX_TRUNC_EXPR,
6526 TREE_TYPE (TREE_TYPE (fndecl)), arg);
6530 tree ftype = TREE_TYPE (arg);
6531 tree arg0 = strip_float_extensions (arg);
6532 tree newtype = TREE_TYPE (arg0);
6535 if (TYPE_PRECISION (newtype) < TYPE_PRECISION (ftype)
6536 && (decl = mathfn_built_in (newtype, fcode)))
6537 return build_call_expr_loc (loc, decl, 1,
6538 fold_convert_loc (loc, newtype, arg0));
6541 /* Canonicalize llround (x) to lround (x) on LP64 targets where
6542 sizeof (long long) == sizeof (long). */
6543 if (TYPE_PRECISION (long_long_integer_type_node)
6544 == TYPE_PRECISION (long_integer_type_node))
6546 tree newfn = NULL_TREE;
6549 CASE_FLT_FN (BUILT_IN_LLCEIL):
6550 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LCEIL);
6553 CASE_FLT_FN (BUILT_IN_LLFLOOR):
6554 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LFLOOR);
6557 CASE_FLT_FN (BUILT_IN_LLROUND):
6558 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LROUND);
6561 CASE_FLT_FN (BUILT_IN_LLRINT):
6562 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LRINT);
6571 tree newcall = build_call_expr_loc (loc, newfn, 1, arg);
6572 return fold_convert_loc (loc,
6573 TREE_TYPE (TREE_TYPE (fndecl)), newcall);
6580 /* Fold call to builtin cabs, cabsf or cabsl with argument ARG. TYPE is the
6581 return type. Return NULL_TREE if no simplification can be made. */
6584 fold_builtin_cabs (location_t loc, tree arg, tree type, tree fndecl)
6588 if (!validate_arg (arg, COMPLEX_TYPE)
6589 || TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) != REAL_TYPE)
6592 /* Calculate the result when the argument is a constant. */
6593 if (TREE_CODE (arg) == COMPLEX_CST
6594 && (res = do_mpfr_arg2 (TREE_REALPART (arg), TREE_IMAGPART (arg),
6598 if (TREE_CODE (arg) == COMPLEX_EXPR)
6600 tree real = TREE_OPERAND (arg, 0);
6601 tree imag = TREE_OPERAND (arg, 1);
6603 /* If either part is zero, cabs is fabs of the other. */
6604 if (real_zerop (real))
6605 return fold_build1_loc (loc, ABS_EXPR, type, imag);
6606 if (real_zerop (imag))
6607 return fold_build1_loc (loc, ABS_EXPR, type, real);
6609 /* cabs(x+xi) -> fabs(x)*sqrt(2). */
6610 if (flag_unsafe_math_optimizations
6611 && operand_equal_p (real, imag, OEP_PURE_SAME))
6613 const REAL_VALUE_TYPE sqrt2_trunc
6614 = real_value_truncate (TYPE_MODE (type), dconst_sqrt2 ());
6616 return fold_build2_loc (loc, MULT_EXPR, type,
6617 fold_build1_loc (loc, ABS_EXPR, type, real),
6618 build_real (type, sqrt2_trunc));
6622 /* Optimize cabs(-z) and cabs(conj(z)) as cabs(z). */
6623 if (TREE_CODE (arg) == NEGATE_EXPR
6624 || TREE_CODE (arg) == CONJ_EXPR)
6625 return build_call_expr_loc (loc, fndecl, 1, TREE_OPERAND (arg, 0));
6627 /* Don't do this when optimizing for size. */
6628 if (flag_unsafe_math_optimizations
6629 && optimize && optimize_function_for_speed_p (cfun))
6631 tree sqrtfn = mathfn_built_in (type, BUILT_IN_SQRT);
6633 if (sqrtfn != NULL_TREE)
6635 tree rpart, ipart, result;
6637 arg = builtin_save_expr (arg);
6639 rpart = fold_build1_loc (loc, REALPART_EXPR, type, arg);
6640 ipart = fold_build1_loc (loc, IMAGPART_EXPR, type, arg);
6642 rpart = builtin_save_expr (rpart);
6643 ipart = builtin_save_expr (ipart);
6645 result = fold_build2_loc (loc, PLUS_EXPR, type,
6646 fold_build2_loc (loc, MULT_EXPR, type,
6648 fold_build2_loc (loc, MULT_EXPR, type,
6651 return build_call_expr_loc (loc, sqrtfn, 1, result);
6658 /* Build a complex (inf +- 0i) for the result of cproj. TYPE is the
6659 complex tree type of the result. If NEG is true, the imaginary
6660 zero is negative. */
6663 build_complex_cproj (tree type, bool neg)
6665 REAL_VALUE_TYPE rinf, rzero = dconst0;
6669 return build_complex (type, build_real (TREE_TYPE (type), rinf),
6670 build_real (TREE_TYPE (type), rzero));
6673 /* Fold call to builtin cproj, cprojf or cprojl with argument ARG. TYPE is the
6674 return type. Return NULL_TREE if no simplification can be made. */
6677 fold_builtin_cproj (location_t loc, tree arg, tree type)
6679 if (!validate_arg (arg, COMPLEX_TYPE)
6680 || TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) != REAL_TYPE)
6683 /* If there are no infinities, return arg. */
6684 if (! HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (type))))
6685 return non_lvalue_loc (loc, arg);
6687 /* Calculate the result when the argument is a constant. */
6688 if (TREE_CODE (arg) == COMPLEX_CST)
6690 const REAL_VALUE_TYPE *real = TREE_REAL_CST_PTR (TREE_REALPART (arg));
6691 const REAL_VALUE_TYPE *imag = TREE_REAL_CST_PTR (TREE_IMAGPART (arg));
6693 if (real_isinf (real) || real_isinf (imag))
6694 return build_complex_cproj (type, imag->sign);
6698 else if (TREE_CODE (arg) == COMPLEX_EXPR)
6700 tree real = TREE_OPERAND (arg, 0);
6701 tree imag = TREE_OPERAND (arg, 1);
6706 /* If the real part is inf and the imag part is known to be
6707 nonnegative, return (inf + 0i). Remember side-effects are
6708 possible in the imag part. */
6709 if (TREE_CODE (real) == REAL_CST
6710 && real_isinf (TREE_REAL_CST_PTR (real))
6711 && tree_expr_nonnegative_p (imag))
6712 return omit_one_operand_loc (loc, type,
6713 build_complex_cproj (type, false),
6716 /* If the imag part is inf, return (inf+I*copysign(0,imag)).
6717 Remember side-effects are possible in the real part. */
6718 if (TREE_CODE (imag) == REAL_CST
6719 && real_isinf (TREE_REAL_CST_PTR (imag)))
6721 omit_one_operand_loc (loc, type,
6722 build_complex_cproj (type, TREE_REAL_CST_PTR
6723 (imag)->sign), arg);
6729 /* Fold a builtin function call to sqrt, sqrtf, or sqrtl with argument ARG.
6730 Return NULL_TREE if no simplification can be made. */
6733 fold_builtin_sqrt (location_t loc, tree arg, tree type)
6736 enum built_in_function fcode;
6739 if (!validate_arg (arg, REAL_TYPE))
6742 /* Calculate the result when the argument is a constant. */
6743 if ((res = do_mpfr_arg1 (arg, type, mpfr_sqrt, &dconst0, NULL, true)))
6746 /* Optimize sqrt(expN(x)) = expN(x*0.5). */
6747 fcode = builtin_mathfn_code (arg);
6748 if (flag_unsafe_math_optimizations && BUILTIN_EXPONENT_P (fcode))
6750 tree expfn = TREE_OPERAND (CALL_EXPR_FN (arg), 0);
6751 arg = fold_build2_loc (loc, MULT_EXPR, type,
6752 CALL_EXPR_ARG (arg, 0),
6753 build_real (type, dconsthalf));
6754 return build_call_expr_loc (loc, expfn, 1, arg);
6757 /* Optimize sqrt(Nroot(x)) -> pow(x,1/(2*N)). */
6758 if (flag_unsafe_math_optimizations && BUILTIN_ROOT_P (fcode))
6760 tree powfn = mathfn_built_in (type, BUILT_IN_POW);
6764 tree arg0 = CALL_EXPR_ARG (arg, 0);
6766 /* The inner root was either sqrt or cbrt. */
6767 /* This was a conditional expression but it triggered a bug
6769 REAL_VALUE_TYPE dconstroot;
6770 if (BUILTIN_SQRT_P (fcode))
6771 dconstroot = dconsthalf;
6773 dconstroot = dconst_third ();
6775 /* Adjust for the outer root. */
6776 SET_REAL_EXP (&dconstroot, REAL_EXP (&dconstroot) - 1);
6777 dconstroot = real_value_truncate (TYPE_MODE (type), dconstroot);
6778 tree_root = build_real (type, dconstroot);
6779 return build_call_expr_loc (loc, powfn, 2, arg0, tree_root);
6783 /* Optimize sqrt(pow(x,y)) = pow(|x|,y*0.5). */
6784 if (flag_unsafe_math_optimizations
6785 && (fcode == BUILT_IN_POW
6786 || fcode == BUILT_IN_POWF
6787 || fcode == BUILT_IN_POWL))
6789 tree powfn = TREE_OPERAND (CALL_EXPR_FN (arg), 0);
6790 tree arg0 = CALL_EXPR_ARG (arg, 0);
6791 tree arg1 = CALL_EXPR_ARG (arg, 1);
6793 if (!tree_expr_nonnegative_p (arg0))
6794 arg0 = build1 (ABS_EXPR, type, arg0);
6795 narg1 = fold_build2_loc (loc, MULT_EXPR, type, arg1,
6796 build_real (type, dconsthalf));
6797 return build_call_expr_loc (loc, powfn, 2, arg0, narg1);
6803 /* Fold a builtin function call to cbrt, cbrtf, or cbrtl with argument ARG.
6804 Return NULL_TREE if no simplification can be made. */
6807 fold_builtin_cbrt (location_t loc, tree arg, tree type)
6809 const enum built_in_function fcode = builtin_mathfn_code (arg);
6812 if (!validate_arg (arg, REAL_TYPE))
6815 /* Calculate the result when the argument is a constant. */
6816 if ((res = do_mpfr_arg1 (arg, type, mpfr_cbrt, NULL, NULL, 0)))
6819 if (flag_unsafe_math_optimizations)
6821 /* Optimize cbrt(expN(x)) -> expN(x/3). */
6822 if (BUILTIN_EXPONENT_P (fcode))
6824 tree expfn = TREE_OPERAND (CALL_EXPR_FN (arg), 0);
6825 const REAL_VALUE_TYPE third_trunc =
6826 real_value_truncate (TYPE_MODE (type), dconst_third ());
6827 arg = fold_build2_loc (loc, MULT_EXPR, type,
6828 CALL_EXPR_ARG (arg, 0),
6829 build_real (type, third_trunc));
6830 return build_call_expr_loc (loc, expfn, 1, arg);
6833 /* Optimize cbrt(sqrt(x)) -> pow(x,1/6). */
6834 if (BUILTIN_SQRT_P (fcode))
6836 tree powfn = mathfn_built_in (type, BUILT_IN_POW);
6840 tree arg0 = CALL_EXPR_ARG (arg, 0);
6842 REAL_VALUE_TYPE dconstroot = dconst_third ();
6844 SET_REAL_EXP (&dconstroot, REAL_EXP (&dconstroot) - 1);
6845 dconstroot = real_value_truncate (TYPE_MODE (type), dconstroot);
6846 tree_root = build_real (type, dconstroot);
6847 return build_call_expr_loc (loc, powfn, 2, arg0, tree_root);
6851 /* Optimize cbrt(cbrt(x)) -> pow(x,1/9) iff x is nonnegative. */
6852 if (BUILTIN_CBRT_P (fcode))
6854 tree arg0 = CALL_EXPR_ARG (arg, 0);
6855 if (tree_expr_nonnegative_p (arg0))
6857 tree powfn = mathfn_built_in (type, BUILT_IN_POW);
6862 REAL_VALUE_TYPE dconstroot;
6864 real_arithmetic (&dconstroot, MULT_EXPR,
6865 dconst_third_ptr (), dconst_third_ptr ());
6866 dconstroot = real_value_truncate (TYPE_MODE (type), dconstroot);
6867 tree_root = build_real (type, dconstroot);
6868 return build_call_expr_loc (loc, powfn, 2, arg0, tree_root);
6873 /* Optimize cbrt(pow(x,y)) -> pow(x,y/3) iff x is nonnegative. */
6874 if (fcode == BUILT_IN_POW
6875 || fcode == BUILT_IN_POWF
6876 || fcode == BUILT_IN_POWL)
6878 tree arg00 = CALL_EXPR_ARG (arg, 0);
6879 tree arg01 = CALL_EXPR_ARG (arg, 1);
6880 if (tree_expr_nonnegative_p (arg00))
6882 tree powfn = TREE_OPERAND (CALL_EXPR_FN (arg), 0);
6883 const REAL_VALUE_TYPE dconstroot
6884 = real_value_truncate (TYPE_MODE (type), dconst_third ());
6885 tree narg01 = fold_build2_loc (loc, MULT_EXPR, type, arg01,
6886 build_real (type, dconstroot));
6887 return build_call_expr_loc (loc, powfn, 2, arg00, narg01);
6894 /* Fold function call to builtin cos, cosf, or cosl with argument ARG.
6895 TYPE is the type of the return value. Return NULL_TREE if no
6896 simplification can be made. */
6899 fold_builtin_cos (location_t loc,
6900 tree arg, tree type, tree fndecl)
6904 if (!validate_arg (arg, REAL_TYPE))
6907 /* Calculate the result when the argument is a constant. */
6908 if ((res = do_mpfr_arg1 (arg, type, mpfr_cos, NULL, NULL, 0)))
6911 /* Optimize cos(-x) into cos (x). */
6912 if ((narg = fold_strip_sign_ops (arg)))
6913 return build_call_expr_loc (loc, fndecl, 1, narg);
6918 /* Fold function call to builtin cosh, coshf, or coshl with argument ARG.
6919 Return NULL_TREE if no simplification can be made. */
6922 fold_builtin_cosh (location_t loc, tree arg, tree type, tree fndecl)
6924 if (validate_arg (arg, REAL_TYPE))
6928 /* Calculate the result when the argument is a constant. */
6929 if ((res = do_mpfr_arg1 (arg, type, mpfr_cosh, NULL, NULL, 0)))
6932 /* Optimize cosh(-x) into cosh (x). */
6933 if ((narg = fold_strip_sign_ops (arg)))
6934 return build_call_expr_loc (loc, fndecl, 1, narg);
6940 /* Fold function call to builtin ccos (or ccosh if HYPER is TRUE) with
6941 argument ARG. TYPE is the type of the return value. Return
6942 NULL_TREE if no simplification can be made. */
6945 fold_builtin_ccos (location_t loc, tree arg, tree type, tree fndecl,
6948 if (validate_arg (arg, COMPLEX_TYPE)
6949 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) == REAL_TYPE)
6953 /* Calculate the result when the argument is a constant. */
6954 if ((tmp = do_mpc_arg1 (arg, type, (hyper ? mpc_cosh : mpc_cos))))
6957 /* Optimize fn(-x) into fn(x). */
6958 if ((tmp = fold_strip_sign_ops (arg)))
6959 return build_call_expr_loc (loc, fndecl, 1, tmp);
6965 /* Fold function call to builtin tan, tanf, or tanl with argument ARG.
6966 Return NULL_TREE if no simplification can be made. */
6969 fold_builtin_tan (tree arg, tree type)
6971 enum built_in_function fcode;
6974 if (!validate_arg (arg, REAL_TYPE))
6977 /* Calculate the result when the argument is a constant. */
6978 if ((res = do_mpfr_arg1 (arg, type, mpfr_tan, NULL, NULL, 0)))
6981 /* Optimize tan(atan(x)) = x. */
6982 fcode = builtin_mathfn_code (arg);
6983 if (flag_unsafe_math_optimizations
6984 && (fcode == BUILT_IN_ATAN
6985 || fcode == BUILT_IN_ATANF
6986 || fcode == BUILT_IN_ATANL))
6987 return CALL_EXPR_ARG (arg, 0);
6992 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
6993 NULL_TREE if no simplification can be made. */
6996 fold_builtin_sincos (location_t loc,
6997 tree arg0, tree arg1, tree arg2)
7002 if (!validate_arg (arg0, REAL_TYPE)
7003 || !validate_arg (arg1, POINTER_TYPE)
7004 || !validate_arg (arg2, POINTER_TYPE))
7007 type = TREE_TYPE (arg0);
7009 /* Calculate the result when the argument is a constant. */
7010 if ((res = do_mpfr_sincos (arg0, arg1, arg2)))
7013 /* Canonicalize sincos to cexpi. */
7014 if (!TARGET_C99_FUNCTIONS)
7016 fn = mathfn_built_in (type, BUILT_IN_CEXPI);
7020 call = build_call_expr_loc (loc, fn, 1, arg0);
7021 call = builtin_save_expr (call);
7023 return build2 (COMPOUND_EXPR, void_type_node,
7024 build2 (MODIFY_EXPR, void_type_node,
7025 build_fold_indirect_ref_loc (loc, arg1),
7026 build1 (IMAGPART_EXPR, type, call)),
7027 build2 (MODIFY_EXPR, void_type_node,
7028 build_fold_indirect_ref_loc (loc, arg2),
7029 build1 (REALPART_EXPR, type, call)));
7032 /* Fold function call to builtin cexp, cexpf, or cexpl. Return
7033 NULL_TREE if no simplification can be made. */
7036 fold_builtin_cexp (location_t loc, tree arg0, tree type)
7039 tree realp, imagp, ifn;
7042 if (!validate_arg (arg0, COMPLEX_TYPE)
7043 || TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) != REAL_TYPE)
7046 /* Calculate the result when the argument is a constant. */
7047 if ((res = do_mpc_arg1 (arg0, type, mpc_exp)))
7050 rtype = TREE_TYPE (TREE_TYPE (arg0));
7052 /* In case we can figure out the real part of arg0 and it is constant zero
7054 if (!TARGET_C99_FUNCTIONS)
7056 ifn = mathfn_built_in (rtype, BUILT_IN_CEXPI);
7060 if ((realp = fold_unary_loc (loc, REALPART_EXPR, rtype, arg0))
7061 && real_zerop (realp))
7063 tree narg = fold_build1_loc (loc, IMAGPART_EXPR, rtype, arg0);
7064 return build_call_expr_loc (loc, ifn, 1, narg);
7067 /* In case we can easily decompose real and imaginary parts split cexp
7068 to exp (r) * cexpi (i). */
7069 if (flag_unsafe_math_optimizations
7072 tree rfn, rcall, icall;
7074 rfn = mathfn_built_in (rtype, BUILT_IN_EXP);
7078 imagp = fold_unary_loc (loc, IMAGPART_EXPR, rtype, arg0);
7082 icall = build_call_expr_loc (loc, ifn, 1, imagp);
7083 icall = builtin_save_expr (icall);
7084 rcall = build_call_expr_loc (loc, rfn, 1, realp);
7085 rcall = builtin_save_expr (rcall);
7086 return fold_build2_loc (loc, COMPLEX_EXPR, type,
7087 fold_build2_loc (loc, MULT_EXPR, rtype,
7089 fold_build1_loc (loc, REALPART_EXPR,
7091 fold_build2_loc (loc, MULT_EXPR, rtype,
7093 fold_build1_loc (loc, IMAGPART_EXPR,
7100 /* Fold function call to builtin trunc, truncf or truncl with argument ARG.
7101 Return NULL_TREE if no simplification can be made. */
7104 fold_builtin_trunc (location_t loc, tree fndecl, tree arg)
7106 if (!validate_arg (arg, REAL_TYPE))
7109 /* Optimize trunc of constant value. */
7110 if (TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
7112 REAL_VALUE_TYPE r, x;
7113 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7115 x = TREE_REAL_CST (arg);
7116 real_trunc (&r, TYPE_MODE (type), &x);
7117 return build_real (type, r);
7120 return fold_trunc_transparent_mathfn (loc, fndecl, arg);
7123 /* Fold function call to builtin floor, floorf or floorl with argument ARG.
7124 Return NULL_TREE if no simplification can be made. */
7127 fold_builtin_floor (location_t loc, tree fndecl, tree arg)
7129 if (!validate_arg (arg, REAL_TYPE))
7132 /* Optimize floor of constant value. */
7133 if (TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
7137 x = TREE_REAL_CST (arg);
7138 if (! REAL_VALUE_ISNAN (x) || ! flag_errno_math)
7140 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7143 real_floor (&r, TYPE_MODE (type), &x);
7144 return build_real (type, r);
7148 /* Fold floor (x) where x is nonnegative to trunc (x). */
7149 if (tree_expr_nonnegative_p (arg))
7151 tree truncfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_TRUNC);
7153 return build_call_expr_loc (loc, truncfn, 1, arg);
7156 return fold_trunc_transparent_mathfn (loc, fndecl, arg);
7159 /* Fold function call to builtin ceil, ceilf or ceill with argument ARG.
7160 Return NULL_TREE if no simplification can be made. */
7163 fold_builtin_ceil (location_t loc, tree fndecl, tree arg)
7165 if (!validate_arg (arg, REAL_TYPE))
7168 /* Optimize ceil of constant value. */
7169 if (TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
7173 x = TREE_REAL_CST (arg);
7174 if (! REAL_VALUE_ISNAN (x) || ! flag_errno_math)
7176 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7179 real_ceil (&r, TYPE_MODE (type), &x);
7180 return build_real (type, r);
7184 return fold_trunc_transparent_mathfn (loc, fndecl, arg);
7187 /* Fold function call to builtin round, roundf or roundl with argument ARG.
7188 Return NULL_TREE if no simplification can be made. */
7191 fold_builtin_round (location_t loc, tree fndecl, tree arg)
7193 if (!validate_arg (arg, REAL_TYPE))
7196 /* Optimize round of constant value. */
7197 if (TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
7201 x = TREE_REAL_CST (arg);
7202 if (! REAL_VALUE_ISNAN (x) || ! flag_errno_math)
7204 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7207 real_round (&r, TYPE_MODE (type), &x);
7208 return build_real (type, r);
7212 return fold_trunc_transparent_mathfn (loc, fndecl, arg);
7215 /* Fold function call to builtin lround, lroundf or lroundl (or the
7216 corresponding long long versions) and other rounding functions. ARG
7217 is the argument to the call. Return NULL_TREE if no simplification
7221 fold_builtin_int_roundingfn (location_t loc, tree fndecl, tree arg)
7223 if (!validate_arg (arg, REAL_TYPE))
7226 /* Optimize lround of constant value. */
7227 if (TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
7229 const REAL_VALUE_TYPE x = TREE_REAL_CST (arg);
7231 if (real_isfinite (&x))
7233 tree itype = TREE_TYPE (TREE_TYPE (fndecl));
7234 tree ftype = TREE_TYPE (arg);
7238 switch (DECL_FUNCTION_CODE (fndecl))
7240 CASE_FLT_FN (BUILT_IN_LFLOOR):
7241 CASE_FLT_FN (BUILT_IN_LLFLOOR):
7242 real_floor (&r, TYPE_MODE (ftype), &x);
7245 CASE_FLT_FN (BUILT_IN_LCEIL):
7246 CASE_FLT_FN (BUILT_IN_LLCEIL):
7247 real_ceil (&r, TYPE_MODE (ftype), &x);
7250 CASE_FLT_FN (BUILT_IN_LROUND):
7251 CASE_FLT_FN (BUILT_IN_LLROUND):
7252 real_round (&r, TYPE_MODE (ftype), &x);
7259 real_to_integer2 ((HOST_WIDE_INT *)&val.low, &val.high, &r);
7260 if (double_int_fits_to_tree_p (itype, val))
7261 return double_int_to_tree (itype, val);
7265 switch (DECL_FUNCTION_CODE (fndecl))
7267 CASE_FLT_FN (BUILT_IN_LFLOOR):
7268 CASE_FLT_FN (BUILT_IN_LLFLOOR):
7269 /* Fold lfloor (x) where x is nonnegative to FIX_TRUNC (x). */
7270 if (tree_expr_nonnegative_p (arg))
7271 return fold_build1_loc (loc, FIX_TRUNC_EXPR,
7272 TREE_TYPE (TREE_TYPE (fndecl)), arg);
7277 return fold_fixed_mathfn (loc, fndecl, arg);
7280 /* Fold function call to builtin ffs, clz, ctz, popcount and parity
7281 and their long and long long variants (i.e. ffsl and ffsll). ARG is
7282 the argument to the call. Return NULL_TREE if no simplification can
7286 fold_builtin_bitop (tree fndecl, tree arg)
7288 if (!validate_arg (arg, INTEGER_TYPE))
7291 /* Optimize for constant argument. */
7292 if (TREE_CODE (arg) == INTEGER_CST && !TREE_OVERFLOW (arg))
7294 HOST_WIDE_INT hi, width, result;
7295 unsigned HOST_WIDE_INT lo;
7298 type = TREE_TYPE (arg);
7299 width = TYPE_PRECISION (type);
7300 lo = TREE_INT_CST_LOW (arg);
7302 /* Clear all the bits that are beyond the type's precision. */
7303 if (width > HOST_BITS_PER_WIDE_INT)
7305 hi = TREE_INT_CST_HIGH (arg);
7306 if (width < 2 * HOST_BITS_PER_WIDE_INT)
7307 hi &= ~((unsigned HOST_WIDE_INT) (-1)
7308 << (width - HOST_BITS_PER_WIDE_INT));
7313 if (width < HOST_BITS_PER_WIDE_INT)
7314 lo &= ~((unsigned HOST_WIDE_INT) (-1) << width);
7317 switch (DECL_FUNCTION_CODE (fndecl))
7319 CASE_INT_FN (BUILT_IN_FFS):
7321 result = ffs_hwi (lo);
7323 result = HOST_BITS_PER_WIDE_INT + ffs_hwi (hi);
7328 CASE_INT_FN (BUILT_IN_CLZ):
7330 result = width - floor_log2 (hi) - 1 - HOST_BITS_PER_WIDE_INT;
7332 result = width - floor_log2 (lo) - 1;
7333 else if (! CLZ_DEFINED_VALUE_AT_ZERO (TYPE_MODE (type), result))
7337 CASE_INT_FN (BUILT_IN_CTZ):
7339 result = ctz_hwi (lo);
7341 result = HOST_BITS_PER_WIDE_INT + ctz_hwi (hi);
7342 else if (! CTZ_DEFINED_VALUE_AT_ZERO (TYPE_MODE (type), result))
7346 CASE_INT_FN (BUILT_IN_CLRSB):
7347 if (width > HOST_BITS_PER_WIDE_INT
7348 && (hi & ((unsigned HOST_WIDE_INT) 1
7349 << (width - HOST_BITS_PER_WIDE_INT - 1))) != 0)
7351 hi = ~hi & ~((unsigned HOST_WIDE_INT) (-1)
7352 << (width - HOST_BITS_PER_WIDE_INT - 1));
7355 else if (width <= HOST_BITS_PER_WIDE_INT
7356 && (lo & ((unsigned HOST_WIDE_INT) 1 << (width - 1))) != 0)
7357 lo = ~lo & ~((unsigned HOST_WIDE_INT) (-1) << (width - 1));
7359 result = width - floor_log2 (hi) - 2 - HOST_BITS_PER_WIDE_INT;
7361 result = width - floor_log2 (lo) - 2;
7366 CASE_INT_FN (BUILT_IN_POPCOUNT):
7369 result++, lo &= lo - 1;
7371 result++, hi &= (unsigned HOST_WIDE_INT) hi - 1;
7374 CASE_INT_FN (BUILT_IN_PARITY):
7377 result++, lo &= lo - 1;
7379 result++, hi &= (unsigned HOST_WIDE_INT) hi - 1;
7387 return build_int_cst (TREE_TYPE (TREE_TYPE (fndecl)), result);
7393 /* Fold function call to builtin_bswap and the long and long long
7394 variants. Return NULL_TREE if no simplification can be made. */
7396 fold_builtin_bswap (tree fndecl, tree arg)
7398 if (! validate_arg (arg, INTEGER_TYPE))
7401 /* Optimize constant value. */
7402 if (TREE_CODE (arg) == INTEGER_CST && !TREE_OVERFLOW (arg))
7404 HOST_WIDE_INT hi, width, r_hi = 0;
7405 unsigned HOST_WIDE_INT lo, r_lo = 0;
7408 type = TREE_TYPE (arg);
7409 width = TYPE_PRECISION (type);
7410 lo = TREE_INT_CST_LOW (arg);
7411 hi = TREE_INT_CST_HIGH (arg);
7413 switch (DECL_FUNCTION_CODE (fndecl))
7415 case BUILT_IN_BSWAP32:
7416 case BUILT_IN_BSWAP64:
7420 for (s = 0; s < width; s += 8)
7422 int d = width - s - 8;
7423 unsigned HOST_WIDE_INT byte;
7425 if (s < HOST_BITS_PER_WIDE_INT)
7426 byte = (lo >> s) & 0xff;
7428 byte = (hi >> (s - HOST_BITS_PER_WIDE_INT)) & 0xff;
7430 if (d < HOST_BITS_PER_WIDE_INT)
7433 r_hi |= byte << (d - HOST_BITS_PER_WIDE_INT);
7443 if (width < HOST_BITS_PER_WIDE_INT)
7444 return build_int_cst (TREE_TYPE (TREE_TYPE (fndecl)), r_lo);
7446 return build_int_cst_wide (TREE_TYPE (TREE_TYPE (fndecl)), r_lo, r_hi);
7452 /* A subroutine of fold_builtin to fold the various logarithmic
7453 functions. Return NULL_TREE if no simplification can me made.
7454 FUNC is the corresponding MPFR logarithm function. */
7457 fold_builtin_logarithm (location_t loc, tree fndecl, tree arg,
7458 int (*func)(mpfr_ptr, mpfr_srcptr, mp_rnd_t))
7460 if (validate_arg (arg, REAL_TYPE))
7462 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7464 const enum built_in_function fcode = builtin_mathfn_code (arg);
7466 /* Calculate the result when the argument is a constant. */
7467 if ((res = do_mpfr_arg1 (arg, type, func, &dconst0, NULL, false)))
7470 /* Special case, optimize logN(expN(x)) = x. */
7471 if (flag_unsafe_math_optimizations
7472 && ((func == mpfr_log
7473 && (fcode == BUILT_IN_EXP
7474 || fcode == BUILT_IN_EXPF
7475 || fcode == BUILT_IN_EXPL))
7476 || (func == mpfr_log2
7477 && (fcode == BUILT_IN_EXP2
7478 || fcode == BUILT_IN_EXP2F
7479 || fcode == BUILT_IN_EXP2L))
7480 || (func == mpfr_log10 && (BUILTIN_EXP10_P (fcode)))))
7481 return fold_convert_loc (loc, type, CALL_EXPR_ARG (arg, 0));
7483 /* Optimize logN(func()) for various exponential functions. We
7484 want to determine the value "x" and the power "exponent" in
7485 order to transform logN(x**exponent) into exponent*logN(x). */
7486 if (flag_unsafe_math_optimizations)
7488 tree exponent = 0, x = 0;
7492 CASE_FLT_FN (BUILT_IN_EXP):
7493 /* Prepare to do logN(exp(exponent) -> exponent*logN(e). */
7494 x = build_real (type, real_value_truncate (TYPE_MODE (type),
7496 exponent = CALL_EXPR_ARG (arg, 0);
7498 CASE_FLT_FN (BUILT_IN_EXP2):
7499 /* Prepare to do logN(exp2(exponent) -> exponent*logN(2). */
7500 x = build_real (type, dconst2);
7501 exponent = CALL_EXPR_ARG (arg, 0);
7503 CASE_FLT_FN (BUILT_IN_EXP10):
7504 CASE_FLT_FN (BUILT_IN_POW10):
7505 /* Prepare to do logN(exp10(exponent) -> exponent*logN(10). */
7507 REAL_VALUE_TYPE dconst10;
7508 real_from_integer (&dconst10, VOIDmode, 10, 0, 0);
7509 x = build_real (type, dconst10);
7511 exponent = CALL_EXPR_ARG (arg, 0);
7513 CASE_FLT_FN (BUILT_IN_SQRT):
7514 /* Prepare to do logN(sqrt(x) -> 0.5*logN(x). */
7515 x = CALL_EXPR_ARG (arg, 0);
7516 exponent = build_real (type, dconsthalf);
7518 CASE_FLT_FN (BUILT_IN_CBRT):
7519 /* Prepare to do logN(cbrt(x) -> (1/3)*logN(x). */
7520 x = CALL_EXPR_ARG (arg, 0);
7521 exponent = build_real (type, real_value_truncate (TYPE_MODE (type),
7524 CASE_FLT_FN (BUILT_IN_POW):
7525 /* Prepare to do logN(pow(x,exponent) -> exponent*logN(x). */
7526 x = CALL_EXPR_ARG (arg, 0);
7527 exponent = CALL_EXPR_ARG (arg, 1);
7533 /* Now perform the optimization. */
7536 tree logfn = build_call_expr_loc (loc, fndecl, 1, x);
7537 return fold_build2_loc (loc, MULT_EXPR, type, exponent, logfn);
7545 /* Fold a builtin function call to hypot, hypotf, or hypotl. Return
7546 NULL_TREE if no simplification can be made. */
7549 fold_builtin_hypot (location_t loc, tree fndecl,
7550 tree arg0, tree arg1, tree type)
7552 tree res, narg0, narg1;
7554 if (!validate_arg (arg0, REAL_TYPE)
7555 || !validate_arg (arg1, REAL_TYPE))
7558 /* Calculate the result when the argument is a constant. */
7559 if ((res = do_mpfr_arg2 (arg0, arg1, type, mpfr_hypot)))
7562 /* If either argument to hypot has a negate or abs, strip that off.
7563 E.g. hypot(-x,fabs(y)) -> hypot(x,y). */
7564 narg0 = fold_strip_sign_ops (arg0);
7565 narg1 = fold_strip_sign_ops (arg1);
7568 return build_call_expr_loc (loc, fndecl, 2, narg0 ? narg0 : arg0,
7569 narg1 ? narg1 : arg1);
7572 /* If either argument is zero, hypot is fabs of the other. */
7573 if (real_zerop (arg0))
7574 return fold_build1_loc (loc, ABS_EXPR, type, arg1);
7575 else if (real_zerop (arg1))
7576 return fold_build1_loc (loc, ABS_EXPR, type, arg0);
7578 /* hypot(x,x) -> fabs(x)*sqrt(2). */
7579 if (flag_unsafe_math_optimizations
7580 && operand_equal_p (arg0, arg1, OEP_PURE_SAME))
7582 const REAL_VALUE_TYPE sqrt2_trunc
7583 = real_value_truncate (TYPE_MODE (type), dconst_sqrt2 ());
7584 return fold_build2_loc (loc, MULT_EXPR, type,
7585 fold_build1_loc (loc, ABS_EXPR, type, arg0),
7586 build_real (type, sqrt2_trunc));
7593 /* Fold a builtin function call to pow, powf, or powl. Return
7594 NULL_TREE if no simplification can be made. */
7596 fold_builtin_pow (location_t loc, tree fndecl, tree arg0, tree arg1, tree type)
7600 if (!validate_arg (arg0, REAL_TYPE)
7601 || !validate_arg (arg1, REAL_TYPE))
7604 /* Calculate the result when the argument is a constant. */
7605 if ((res = do_mpfr_arg2 (arg0, arg1, type, mpfr_pow)))
7608 /* Optimize pow(1.0,y) = 1.0. */
7609 if (real_onep (arg0))
7610 return omit_one_operand_loc (loc, type, build_real (type, dconst1), arg1);
7612 if (TREE_CODE (arg1) == REAL_CST
7613 && !TREE_OVERFLOW (arg1))
7615 REAL_VALUE_TYPE cint;
7619 c = TREE_REAL_CST (arg1);
7621 /* Optimize pow(x,0.0) = 1.0. */
7622 if (REAL_VALUES_EQUAL (c, dconst0))
7623 return omit_one_operand_loc (loc, type, build_real (type, dconst1),
7626 /* Optimize pow(x,1.0) = x. */
7627 if (REAL_VALUES_EQUAL (c, dconst1))
7630 /* Optimize pow(x,-1.0) = 1.0/x. */
7631 if (REAL_VALUES_EQUAL (c, dconstm1))
7632 return fold_build2_loc (loc, RDIV_EXPR, type,
7633 build_real (type, dconst1), arg0);
7635 /* Optimize pow(x,0.5) = sqrt(x). */
7636 if (flag_unsafe_math_optimizations
7637 && REAL_VALUES_EQUAL (c, dconsthalf))
7639 tree sqrtfn = mathfn_built_in (type, BUILT_IN_SQRT);
7641 if (sqrtfn != NULL_TREE)
7642 return build_call_expr_loc (loc, sqrtfn, 1, arg0);
7645 /* Optimize pow(x,1.0/3.0) = cbrt(x). */
7646 if (flag_unsafe_math_optimizations)
7648 const REAL_VALUE_TYPE dconstroot
7649 = real_value_truncate (TYPE_MODE (type), dconst_third ());
7651 if (REAL_VALUES_EQUAL (c, dconstroot))
7653 tree cbrtfn = mathfn_built_in (type, BUILT_IN_CBRT);
7654 if (cbrtfn != NULL_TREE)
7655 return build_call_expr_loc (loc, cbrtfn, 1, arg0);
7659 /* Check for an integer exponent. */
7660 n = real_to_integer (&c);
7661 real_from_integer (&cint, VOIDmode, n, n < 0 ? -1 : 0, 0);
7662 if (real_identical (&c, &cint))
7664 /* Attempt to evaluate pow at compile-time, unless this should
7665 raise an exception. */
7666 if (TREE_CODE (arg0) == REAL_CST
7667 && !TREE_OVERFLOW (arg0)
7669 || (!flag_trapping_math && !flag_errno_math)
7670 || !REAL_VALUES_EQUAL (TREE_REAL_CST (arg0), dconst0)))
7675 x = TREE_REAL_CST (arg0);
7676 inexact = real_powi (&x, TYPE_MODE (type), &x, n);
7677 if (flag_unsafe_math_optimizations || !inexact)
7678 return build_real (type, x);
7681 /* Strip sign ops from even integer powers. */
7682 if ((n & 1) == 0 && flag_unsafe_math_optimizations)
7684 tree narg0 = fold_strip_sign_ops (arg0);
7686 return build_call_expr_loc (loc, fndecl, 2, narg0, arg1);
7691 if (flag_unsafe_math_optimizations)
7693 const enum built_in_function fcode = builtin_mathfn_code (arg0);
7695 /* Optimize pow(expN(x),y) = expN(x*y). */
7696 if (BUILTIN_EXPONENT_P (fcode))
7698 tree expfn = TREE_OPERAND (CALL_EXPR_FN (arg0), 0);
7699 tree arg = CALL_EXPR_ARG (arg0, 0);
7700 arg = fold_build2_loc (loc, MULT_EXPR, type, arg, arg1);
7701 return build_call_expr_loc (loc, expfn, 1, arg);
7704 /* Optimize pow(sqrt(x),y) = pow(x,y*0.5). */
7705 if (BUILTIN_SQRT_P (fcode))
7707 tree narg0 = CALL_EXPR_ARG (arg0, 0);
7708 tree narg1 = fold_build2_loc (loc, MULT_EXPR, type, arg1,
7709 build_real (type, dconsthalf));
7710 return build_call_expr_loc (loc, fndecl, 2, narg0, narg1);
7713 /* Optimize pow(cbrt(x),y) = pow(x,y/3) iff x is nonnegative. */
7714 if (BUILTIN_CBRT_P (fcode))
7716 tree arg = CALL_EXPR_ARG (arg0, 0);
7717 if (tree_expr_nonnegative_p (arg))
7719 const REAL_VALUE_TYPE dconstroot
7720 = real_value_truncate (TYPE_MODE (type), dconst_third ());
7721 tree narg1 = fold_build2_loc (loc, MULT_EXPR, type, arg1,
7722 build_real (type, dconstroot));
7723 return build_call_expr_loc (loc, fndecl, 2, arg, narg1);
7727 /* Optimize pow(pow(x,y),z) = pow(x,y*z) iff x is nonnegative. */
7728 if (fcode == BUILT_IN_POW
7729 || fcode == BUILT_IN_POWF
7730 || fcode == BUILT_IN_POWL)
7732 tree arg00 = CALL_EXPR_ARG (arg0, 0);
7733 if (tree_expr_nonnegative_p (arg00))
7735 tree arg01 = CALL_EXPR_ARG (arg0, 1);
7736 tree narg1 = fold_build2_loc (loc, MULT_EXPR, type, arg01, arg1);
7737 return build_call_expr_loc (loc, fndecl, 2, arg00, narg1);
7745 /* Fold a builtin function call to powi, powif, or powil with argument ARG.
7746 Return NULL_TREE if no simplification can be made. */
7748 fold_builtin_powi (location_t loc, tree fndecl ATTRIBUTE_UNUSED,
7749 tree arg0, tree arg1, tree type)
7751 if (!validate_arg (arg0, REAL_TYPE)
7752 || !validate_arg (arg1, INTEGER_TYPE))
7755 /* Optimize pow(1.0,y) = 1.0. */
7756 if (real_onep (arg0))
7757 return omit_one_operand_loc (loc, type, build_real (type, dconst1), arg1);
7759 if (host_integerp (arg1, 0))
7761 HOST_WIDE_INT c = TREE_INT_CST_LOW (arg1);
7763 /* Evaluate powi at compile-time. */
7764 if (TREE_CODE (arg0) == REAL_CST
7765 && !TREE_OVERFLOW (arg0))
7768 x = TREE_REAL_CST (arg0);
7769 real_powi (&x, TYPE_MODE (type), &x, c);
7770 return build_real (type, x);
7773 /* Optimize pow(x,0) = 1.0. */
7775 return omit_one_operand_loc (loc, type, build_real (type, dconst1),
7778 /* Optimize pow(x,1) = x. */
7782 /* Optimize pow(x,-1) = 1.0/x. */
7784 return fold_build2_loc (loc, RDIV_EXPR, type,
7785 build_real (type, dconst1), arg0);
7791 /* A subroutine of fold_builtin to fold the various exponent
7792 functions. Return NULL_TREE if no simplification can be made.
7793 FUNC is the corresponding MPFR exponent function. */
7796 fold_builtin_exponent (location_t loc, tree fndecl, tree arg,
7797 int (*func)(mpfr_ptr, mpfr_srcptr, mp_rnd_t))
7799 if (validate_arg (arg, REAL_TYPE))
7801 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7804 /* Calculate the result when the argument is a constant. */
7805 if ((res = do_mpfr_arg1 (arg, type, func, NULL, NULL, 0)))
7808 /* Optimize expN(logN(x)) = x. */
7809 if (flag_unsafe_math_optimizations)
7811 const enum built_in_function fcode = builtin_mathfn_code (arg);
7813 if ((func == mpfr_exp
7814 && (fcode == BUILT_IN_LOG
7815 || fcode == BUILT_IN_LOGF
7816 || fcode == BUILT_IN_LOGL))
7817 || (func == mpfr_exp2
7818 && (fcode == BUILT_IN_LOG2
7819 || fcode == BUILT_IN_LOG2F
7820 || fcode == BUILT_IN_LOG2L))
7821 || (func == mpfr_exp10
7822 && (fcode == BUILT_IN_LOG10
7823 || fcode == BUILT_IN_LOG10F
7824 || fcode == BUILT_IN_LOG10L)))
7825 return fold_convert_loc (loc, type, CALL_EXPR_ARG (arg, 0));
7832 /* Return true if VAR is a VAR_DECL or a component thereof. */
7835 var_decl_component_p (tree var)
7838 while (handled_component_p (inner))
7839 inner = TREE_OPERAND (inner, 0);
7840 return SSA_VAR_P (inner);
7843 /* Fold function call to builtin memset. Return
7844 NULL_TREE if no simplification can be made. */
7847 fold_builtin_memset (location_t loc, tree dest, tree c, tree len,
7848 tree type, bool ignore)
7850 tree var, ret, etype;
7851 unsigned HOST_WIDE_INT length, cval;
7853 if (! validate_arg (dest, POINTER_TYPE)
7854 || ! validate_arg (c, INTEGER_TYPE)
7855 || ! validate_arg (len, INTEGER_TYPE))
7858 if (! host_integerp (len, 1))
7861 /* If the LEN parameter is zero, return DEST. */
7862 if (integer_zerop (len))
7863 return omit_one_operand_loc (loc, type, dest, c);
7865 if (TREE_CODE (c) != INTEGER_CST || TREE_SIDE_EFFECTS (dest))
7870 if (TREE_CODE (var) != ADDR_EXPR)
7873 var = TREE_OPERAND (var, 0);
7874 if (TREE_THIS_VOLATILE (var))
7877 etype = TREE_TYPE (var);
7878 if (TREE_CODE (etype) == ARRAY_TYPE)
7879 etype = TREE_TYPE (etype);
7881 if (!INTEGRAL_TYPE_P (etype)
7882 && !POINTER_TYPE_P (etype))
7885 if (! var_decl_component_p (var))
7888 length = tree_low_cst (len, 1);
7889 if (GET_MODE_SIZE (TYPE_MODE (etype)) != length
7890 || get_pointer_alignment (dest, BIGGEST_ALIGNMENT) / BITS_PER_UNIT
7894 if (length > HOST_BITS_PER_WIDE_INT / BITS_PER_UNIT)
7897 if (integer_zerop (c))
7901 if (CHAR_BIT != 8 || BITS_PER_UNIT != 8 || HOST_BITS_PER_WIDE_INT > 64)
7904 cval = TREE_INT_CST_LOW (c);
7908 cval |= (cval << 31) << 1;
7911 ret = build_int_cst_type (etype, cval);
7912 var = build_fold_indirect_ref_loc (loc,
7913 fold_convert_loc (loc,
7914 build_pointer_type (etype),
7916 ret = build2 (MODIFY_EXPR, etype, var, ret);
7920 return omit_one_operand_loc (loc, type, dest, ret);
7923 /* Fold function call to builtin memset. Return
7924 NULL_TREE if no simplification can be made. */
7927 fold_builtin_bzero (location_t loc, tree dest, tree size, bool ignore)
7929 if (! validate_arg (dest, POINTER_TYPE)
7930 || ! validate_arg (size, INTEGER_TYPE))
7936 /* New argument list transforming bzero(ptr x, int y) to
7937 memset(ptr x, int 0, size_t y). This is done this way
7938 so that if it isn't expanded inline, we fallback to
7939 calling bzero instead of memset. */
7941 return fold_builtin_memset (loc, dest, integer_zero_node,
7942 fold_convert_loc (loc, sizetype, size),
7943 void_type_node, ignore);
7946 /* Fold function call to builtin mem{{,p}cpy,move}. Return
7947 NULL_TREE if no simplification can be made.
7948 If ENDP is 0, return DEST (like memcpy).
7949 If ENDP is 1, return DEST+LEN (like mempcpy).
7950 If ENDP is 2, return DEST+LEN-1 (like stpcpy).
7951 If ENDP is 3, return DEST, additionally *SRC and *DEST may overlap
7955 fold_builtin_memory_op (location_t loc, tree dest, tree src,
7956 tree len, tree type, bool ignore, int endp)
7958 tree destvar, srcvar, expr;
7960 if (! validate_arg (dest, POINTER_TYPE)
7961 || ! validate_arg (src, POINTER_TYPE)
7962 || ! validate_arg (len, INTEGER_TYPE))
7965 /* If the LEN parameter is zero, return DEST. */
7966 if (integer_zerop (len))
7967 return omit_one_operand_loc (loc, type, dest, src);
7969 /* If SRC and DEST are the same (and not volatile), return
7970 DEST{,+LEN,+LEN-1}. */
7971 if (operand_equal_p (src, dest, 0))
7975 tree srctype, desttype;
7976 unsigned int src_align, dest_align;
7981 src_align = get_pointer_alignment (src, BIGGEST_ALIGNMENT);
7982 dest_align = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
7984 /* Both DEST and SRC must be pointer types.
7985 ??? This is what old code did. Is the testing for pointer types
7988 If either SRC is readonly or length is 1, we can use memcpy. */
7989 if (!dest_align || !src_align)
7991 if (readonly_data_expr (src)
7992 || (host_integerp (len, 1)
7993 && (MIN (src_align, dest_align) / BITS_PER_UNIT
7994 >= (unsigned HOST_WIDE_INT) tree_low_cst (len, 1))))
7996 tree fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
7999 return build_call_expr_loc (loc, fn, 3, dest, src, len);
8002 /* If *src and *dest can't overlap, optimize into memcpy as well. */
8003 if (TREE_CODE (src) == ADDR_EXPR
8004 && TREE_CODE (dest) == ADDR_EXPR)
8006 tree src_base, dest_base, fn;
8007 HOST_WIDE_INT src_offset = 0, dest_offset = 0;
8008 HOST_WIDE_INT size = -1;
8009 HOST_WIDE_INT maxsize = -1;
8011 srcvar = TREE_OPERAND (src, 0);
8012 src_base = get_ref_base_and_extent (srcvar, &src_offset,
8014 destvar = TREE_OPERAND (dest, 0);
8015 dest_base = get_ref_base_and_extent (destvar, &dest_offset,
8017 if (host_integerp (len, 1))
8018 maxsize = tree_low_cst (len, 1);
8021 src_offset /= BITS_PER_UNIT;
8022 dest_offset /= BITS_PER_UNIT;
8023 if (SSA_VAR_P (src_base)
8024 && SSA_VAR_P (dest_base))
8026 if (operand_equal_p (src_base, dest_base, 0)
8027 && ranges_overlap_p (src_offset, maxsize,
8028 dest_offset, maxsize))
8031 else if (TREE_CODE (src_base) == MEM_REF
8032 && TREE_CODE (dest_base) == MEM_REF)
8035 if (! operand_equal_p (TREE_OPERAND (src_base, 0),
8036 TREE_OPERAND (dest_base, 0), 0))
8038 off = double_int_add (mem_ref_offset (src_base),
8039 shwi_to_double_int (src_offset));
8040 if (!double_int_fits_in_shwi_p (off))
8042 src_offset = off.low;
8043 off = double_int_add (mem_ref_offset (dest_base),
8044 shwi_to_double_int (dest_offset));
8045 if (!double_int_fits_in_shwi_p (off))
8047 dest_offset = off.low;
8048 if (ranges_overlap_p (src_offset, maxsize,
8049 dest_offset, maxsize))
8055 fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
8058 return build_call_expr_loc (loc, fn, 3, dest, src, len);
8061 /* If the destination and source do not alias optimize into
8063 if ((is_gimple_min_invariant (dest)
8064 || TREE_CODE (dest) == SSA_NAME)
8065 && (is_gimple_min_invariant (src)
8066 || TREE_CODE (src) == SSA_NAME))
8069 ao_ref_init_from_ptr_and_size (&destr, dest, len);
8070 ao_ref_init_from_ptr_and_size (&srcr, src, len);
8071 if (!refs_may_alias_p_1 (&destr, &srcr, false))
8074 fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
8077 return build_call_expr_loc (loc, fn, 3, dest, src, len);
8084 if (!host_integerp (len, 0))
8087 This logic lose for arguments like (type *)malloc (sizeof (type)),
8088 since we strip the casts of up to VOID return value from malloc.
8089 Perhaps we ought to inherit type from non-VOID argument here? */
8092 if (!POINTER_TYPE_P (TREE_TYPE (src))
8093 || !POINTER_TYPE_P (TREE_TYPE (dest)))
8095 /* As we fold (void *)(p + CST) to (void *)p + CST undo this here. */
8096 if (TREE_CODE (src) == POINTER_PLUS_EXPR)
8098 tree tem = TREE_OPERAND (src, 0);
8100 if (tem != TREE_OPERAND (src, 0))
8101 src = build1 (NOP_EXPR, TREE_TYPE (tem), src);
8103 if (TREE_CODE (dest) == POINTER_PLUS_EXPR)
8105 tree tem = TREE_OPERAND (dest, 0);
8107 if (tem != TREE_OPERAND (dest, 0))
8108 dest = build1 (NOP_EXPR, TREE_TYPE (tem), dest);
8110 srctype = TREE_TYPE (TREE_TYPE (src));
8111 if (TREE_CODE (srctype) == ARRAY_TYPE
8112 && !tree_int_cst_equal (TYPE_SIZE_UNIT (srctype), len))
8114 srctype = TREE_TYPE (srctype);
8116 src = build1 (NOP_EXPR, build_pointer_type (srctype), src);
8118 desttype = TREE_TYPE (TREE_TYPE (dest));
8119 if (TREE_CODE (desttype) == ARRAY_TYPE
8120 && !tree_int_cst_equal (TYPE_SIZE_UNIT (desttype), len))
8122 desttype = TREE_TYPE (desttype);
8124 dest = build1 (NOP_EXPR, build_pointer_type (desttype), dest);
8126 if (TREE_ADDRESSABLE (srctype)
8127 || TREE_ADDRESSABLE (desttype))
8130 src_align = get_pointer_alignment (src, BIGGEST_ALIGNMENT);
8131 dest_align = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
8132 if (dest_align < TYPE_ALIGN (desttype)
8133 || src_align < TYPE_ALIGN (srctype))
8137 dest = builtin_save_expr (dest);
8139 /* Build accesses at offset zero with a ref-all character type. */
8140 off0 = build_int_cst (build_pointer_type_for_mode (char_type_node,
8141 ptr_mode, true), 0);
8144 STRIP_NOPS (destvar);
8145 if (TREE_CODE (destvar) == ADDR_EXPR
8146 && var_decl_component_p (TREE_OPERAND (destvar, 0))
8147 && tree_int_cst_equal (TYPE_SIZE_UNIT (desttype), len))
8148 destvar = fold_build2 (MEM_REF, desttype, destvar, off0);
8150 destvar = NULL_TREE;
8153 STRIP_NOPS (srcvar);
8154 if (TREE_CODE (srcvar) == ADDR_EXPR
8155 && var_decl_component_p (TREE_OPERAND (srcvar, 0))
8156 && tree_int_cst_equal (TYPE_SIZE_UNIT (srctype), len))
8159 || src_align >= TYPE_ALIGN (desttype))
8160 srcvar = fold_build2 (MEM_REF, destvar ? desttype : srctype,
8162 else if (!STRICT_ALIGNMENT)
8164 srctype = build_aligned_type (TYPE_MAIN_VARIANT (desttype),
8166 srcvar = fold_build2 (MEM_REF, srctype, srcvar, off0);
8174 if (srcvar == NULL_TREE && destvar == NULL_TREE)
8177 if (srcvar == NULL_TREE)
8180 if (src_align >= TYPE_ALIGN (desttype))
8181 srcvar = fold_build2 (MEM_REF, desttype, src, off0);
8184 if (STRICT_ALIGNMENT)
8186 srctype = build_aligned_type (TYPE_MAIN_VARIANT (desttype),
8188 srcvar = fold_build2 (MEM_REF, srctype, src, off0);
8191 else if (destvar == NULL_TREE)
8194 if (dest_align >= TYPE_ALIGN (srctype))
8195 destvar = fold_build2 (MEM_REF, srctype, dest, off0);
8198 if (STRICT_ALIGNMENT)
8200 desttype = build_aligned_type (TYPE_MAIN_VARIANT (srctype),
8202 destvar = fold_build2 (MEM_REF, desttype, dest, off0);
8206 expr = build2 (MODIFY_EXPR, TREE_TYPE (destvar), destvar, srcvar);
8212 if (endp == 0 || endp == 3)
8213 return omit_one_operand_loc (loc, type, dest, expr);
8219 len = fold_build2_loc (loc, MINUS_EXPR, TREE_TYPE (len), len,
8222 dest = fold_build_pointer_plus_loc (loc, dest, len);
8223 dest = fold_convert_loc (loc, type, dest);
8225 dest = omit_one_operand_loc (loc, type, dest, expr);
8229 /* Fold function call to builtin strcpy with arguments DEST and SRC.
8230 If LEN is not NULL, it represents the length of the string to be
8231 copied. Return NULL_TREE if no simplification can be made. */
8234 fold_builtin_strcpy (location_t loc, tree fndecl, tree dest, tree src, tree len)
8238 if (!validate_arg (dest, POINTER_TYPE)
8239 || !validate_arg (src, POINTER_TYPE))
8242 /* If SRC and DEST are the same (and not volatile), return DEST. */
8243 if (operand_equal_p (src, dest, 0))
8244 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest);
8246 if (optimize_function_for_size_p (cfun))
8249 fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
8255 len = c_strlen (src, 1);
8256 if (! len || TREE_SIDE_EFFECTS (len))
8260 len = size_binop_loc (loc, PLUS_EXPR, len, ssize_int (1));
8261 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)),
8262 build_call_expr_loc (loc, fn, 3, dest, src, len));
8265 /* Fold function call to builtin stpcpy with arguments DEST and SRC.
8266 Return NULL_TREE if no simplification can be made. */
8269 fold_builtin_stpcpy (location_t loc, tree fndecl, tree dest, tree src)
8271 tree fn, len, lenp1, call, type;
8273 if (!validate_arg (dest, POINTER_TYPE)
8274 || !validate_arg (src, POINTER_TYPE))
8277 len = c_strlen (src, 1);
8279 || TREE_CODE (len) != INTEGER_CST)
8282 if (optimize_function_for_size_p (cfun)
8283 /* If length is zero it's small enough. */
8284 && !integer_zerop (len))
8287 fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
8291 lenp1 = size_binop_loc (loc, PLUS_EXPR, len, ssize_int (1));
8292 /* We use dest twice in building our expression. Save it from
8293 multiple expansions. */
8294 dest = builtin_save_expr (dest);
8295 call = build_call_expr_loc (loc, fn, 3, dest, src, lenp1);
8297 type = TREE_TYPE (TREE_TYPE (fndecl));
8298 dest = fold_build_pointer_plus_loc (loc, dest, len);
8299 dest = fold_convert_loc (loc, type, dest);
8300 dest = omit_one_operand_loc (loc, type, dest, call);
8304 /* Fold function call to builtin strncpy with arguments DEST, SRC, and LEN.
8305 If SLEN is not NULL, it represents the length of the source string.
8306 Return NULL_TREE if no simplification can be made. */
8309 fold_builtin_strncpy (location_t loc, tree fndecl, tree dest,
8310 tree src, tree len, tree slen)
8314 if (!validate_arg (dest, POINTER_TYPE)
8315 || !validate_arg (src, POINTER_TYPE)
8316 || !validate_arg (len, INTEGER_TYPE))
8319 /* If the LEN parameter is zero, return DEST. */
8320 if (integer_zerop (len))
8321 return omit_one_operand_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest, src);
8323 /* We can't compare slen with len as constants below if len is not a
8325 if (len == 0 || TREE_CODE (len) != INTEGER_CST)
8329 slen = c_strlen (src, 1);
8331 /* Now, we must be passed a constant src ptr parameter. */
8332 if (slen == 0 || TREE_CODE (slen) != INTEGER_CST)
8335 slen = size_binop_loc (loc, PLUS_EXPR, slen, ssize_int (1));
8337 /* We do not support simplification of this case, though we do
8338 support it when expanding trees into RTL. */
8339 /* FIXME: generate a call to __builtin_memset. */
8340 if (tree_int_cst_lt (slen, len))
8343 /* OK transform into builtin memcpy. */
8344 fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
8347 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)),
8348 build_call_expr_loc (loc, fn, 3, dest, src, len));
8351 /* Fold function call to builtin memchr. ARG1, ARG2 and LEN are the
8352 arguments to the call, and TYPE is its return type.
8353 Return NULL_TREE if no simplification can be made. */
8356 fold_builtin_memchr (location_t loc, tree arg1, tree arg2, tree len, tree type)
8358 if (!validate_arg (arg1, POINTER_TYPE)
8359 || !validate_arg (arg2, INTEGER_TYPE)
8360 || !validate_arg (len, INTEGER_TYPE))
8366 if (TREE_CODE (arg2) != INTEGER_CST
8367 || !host_integerp (len, 1))
8370 p1 = c_getstr (arg1);
8371 if (p1 && compare_tree_int (len, strlen (p1) + 1) <= 0)
8377 if (target_char_cast (arg2, &c))
8380 r = (char *) memchr (p1, c, tree_low_cst (len, 1));
8383 return build_int_cst (TREE_TYPE (arg1), 0);
8385 tem = fold_build_pointer_plus_hwi_loc (loc, arg1, r - p1);
8386 return fold_convert_loc (loc, type, tem);
8392 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
8393 Return NULL_TREE if no simplification can be made. */
8396 fold_builtin_memcmp (location_t loc, tree arg1, tree arg2, tree len)
8398 const char *p1, *p2;
8400 if (!validate_arg (arg1, POINTER_TYPE)
8401 || !validate_arg (arg2, POINTER_TYPE)
8402 || !validate_arg (len, INTEGER_TYPE))
8405 /* If the LEN parameter is zero, return zero. */
8406 if (integer_zerop (len))
8407 return omit_two_operands_loc (loc, integer_type_node, integer_zero_node,
8410 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8411 if (operand_equal_p (arg1, arg2, 0))
8412 return omit_one_operand_loc (loc, integer_type_node, integer_zero_node, len);
8414 p1 = c_getstr (arg1);
8415 p2 = c_getstr (arg2);
8417 /* If all arguments are constant, and the value of len is not greater
8418 than the lengths of arg1 and arg2, evaluate at compile-time. */
8419 if (host_integerp (len, 1) && p1 && p2
8420 && compare_tree_int (len, strlen (p1) + 1) <= 0
8421 && compare_tree_int (len, strlen (p2) + 1) <= 0)
8423 const int r = memcmp (p1, p2, tree_low_cst (len, 1));
8426 return integer_one_node;
8428 return integer_minus_one_node;
8430 return integer_zero_node;
8433 /* If len parameter is one, return an expression corresponding to
8434 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
8435 if (host_integerp (len, 1) && tree_low_cst (len, 1) == 1)
8437 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
8438 tree cst_uchar_ptr_node
8439 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
8442 = fold_convert_loc (loc, integer_type_node,
8443 build1 (INDIRECT_REF, cst_uchar_node,
8444 fold_convert_loc (loc,
8448 = fold_convert_loc (loc, integer_type_node,
8449 build1 (INDIRECT_REF, cst_uchar_node,
8450 fold_convert_loc (loc,
8453 return fold_build2_loc (loc, MINUS_EXPR, integer_type_node, ind1, ind2);
8459 /* Fold function call to builtin strcmp with arguments ARG1 and ARG2.
8460 Return NULL_TREE if no simplification can be made. */
8463 fold_builtin_strcmp (location_t loc, tree arg1, tree arg2)
8465 const char *p1, *p2;
8467 if (!validate_arg (arg1, POINTER_TYPE)
8468 || !validate_arg (arg2, POINTER_TYPE))
8471 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8472 if (operand_equal_p (arg1, arg2, 0))
8473 return integer_zero_node;
8475 p1 = c_getstr (arg1);
8476 p2 = c_getstr (arg2);
8480 const int i = strcmp (p1, p2);
8482 return integer_minus_one_node;
8484 return integer_one_node;
8486 return integer_zero_node;
8489 /* If the second arg is "", return *(const unsigned char*)arg1. */
8490 if (p2 && *p2 == '\0')
8492 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
8493 tree cst_uchar_ptr_node
8494 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
8496 return fold_convert_loc (loc, integer_type_node,
8497 build1 (INDIRECT_REF, cst_uchar_node,
8498 fold_convert_loc (loc,
8503 /* If the first arg is "", return -*(const unsigned char*)arg2. */
8504 if (p1 && *p1 == '\0')
8506 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
8507 tree cst_uchar_ptr_node
8508 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
8511 = fold_convert_loc (loc, integer_type_node,
8512 build1 (INDIRECT_REF, cst_uchar_node,
8513 fold_convert_loc (loc,
8516 return fold_build1_loc (loc, NEGATE_EXPR, integer_type_node, temp);
8522 /* Fold function call to builtin strncmp with arguments ARG1, ARG2, and LEN.
8523 Return NULL_TREE if no simplification can be made. */
8526 fold_builtin_strncmp (location_t loc, tree arg1, tree arg2, tree len)
8528 const char *p1, *p2;
8530 if (!validate_arg (arg1, POINTER_TYPE)
8531 || !validate_arg (arg2, POINTER_TYPE)
8532 || !validate_arg (len, INTEGER_TYPE))
8535 /* If the LEN parameter is zero, return zero. */
8536 if (integer_zerop (len))
8537 return omit_two_operands_loc (loc, integer_type_node, integer_zero_node,
8540 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8541 if (operand_equal_p (arg1, arg2, 0))
8542 return omit_one_operand_loc (loc, integer_type_node, integer_zero_node, len);
8544 p1 = c_getstr (arg1);
8545 p2 = c_getstr (arg2);
8547 if (host_integerp (len, 1) && p1 && p2)
8549 const int i = strncmp (p1, p2, tree_low_cst (len, 1));
8551 return integer_one_node;
8553 return integer_minus_one_node;
8555 return integer_zero_node;
8558 /* If the second arg is "", and the length is greater than zero,
8559 return *(const unsigned char*)arg1. */
8560 if (p2 && *p2 == '\0'
8561 && TREE_CODE (len) == INTEGER_CST
8562 && tree_int_cst_sgn (len) == 1)
8564 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
8565 tree cst_uchar_ptr_node
8566 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
8568 return fold_convert_loc (loc, integer_type_node,
8569 build1 (INDIRECT_REF, cst_uchar_node,
8570 fold_convert_loc (loc,
8575 /* If the first arg is "", and the length is greater than zero,
8576 return -*(const unsigned char*)arg2. */
8577 if (p1 && *p1 == '\0'
8578 && TREE_CODE (len) == INTEGER_CST
8579 && tree_int_cst_sgn (len) == 1)
8581 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
8582 tree cst_uchar_ptr_node
8583 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
8585 tree temp = fold_convert_loc (loc, integer_type_node,
8586 build1 (INDIRECT_REF, cst_uchar_node,
8587 fold_convert_loc (loc,
8590 return fold_build1_loc (loc, NEGATE_EXPR, integer_type_node, temp);
8593 /* If len parameter is one, return an expression corresponding to
8594 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
8595 if (host_integerp (len, 1) && tree_low_cst (len, 1) == 1)
8597 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
8598 tree cst_uchar_ptr_node
8599 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
8601 tree ind1 = fold_convert_loc (loc, integer_type_node,
8602 build1 (INDIRECT_REF, cst_uchar_node,
8603 fold_convert_loc (loc,
8606 tree ind2 = fold_convert_loc (loc, integer_type_node,
8607 build1 (INDIRECT_REF, cst_uchar_node,
8608 fold_convert_loc (loc,
8611 return fold_build2_loc (loc, MINUS_EXPR, integer_type_node, ind1, ind2);
8617 /* Fold function call to builtin signbit, signbitf or signbitl with argument
8618 ARG. Return NULL_TREE if no simplification can be made. */
8621 fold_builtin_signbit (location_t loc, tree arg, tree type)
8623 if (!validate_arg (arg, REAL_TYPE))
8626 /* If ARG is a compile-time constant, determine the result. */
8627 if (TREE_CODE (arg) == REAL_CST
8628 && !TREE_OVERFLOW (arg))
8632 c = TREE_REAL_CST (arg);
8633 return (REAL_VALUE_NEGATIVE (c)
8634 ? build_one_cst (type)
8635 : build_zero_cst (type));
8638 /* If ARG is non-negative, the result is always zero. */
8639 if (tree_expr_nonnegative_p (arg))
8640 return omit_one_operand_loc (loc, type, integer_zero_node, arg);
8642 /* If ARG's format doesn't have signed zeros, return "arg < 0.0". */
8643 if (!HONOR_SIGNED_ZEROS (TYPE_MODE (TREE_TYPE (arg))))
8644 return fold_build2_loc (loc, LT_EXPR, type, arg,
8645 build_real (TREE_TYPE (arg), dconst0));
8650 /* Fold function call to builtin copysign, copysignf or copysignl with
8651 arguments ARG1 and ARG2. Return NULL_TREE if no simplification can
8655 fold_builtin_copysign (location_t loc, tree fndecl,
8656 tree arg1, tree arg2, tree type)
8660 if (!validate_arg (arg1, REAL_TYPE)
8661 || !validate_arg (arg2, REAL_TYPE))
8664 /* copysign(X,X) is X. */
8665 if (operand_equal_p (arg1, arg2, 0))
8666 return fold_convert_loc (loc, type, arg1);
8668 /* If ARG1 and ARG2 are compile-time constants, determine the result. */
8669 if (TREE_CODE (arg1) == REAL_CST
8670 && TREE_CODE (arg2) == REAL_CST
8671 && !TREE_OVERFLOW (arg1)
8672 && !TREE_OVERFLOW (arg2))
8674 REAL_VALUE_TYPE c1, c2;
8676 c1 = TREE_REAL_CST (arg1);
8677 c2 = TREE_REAL_CST (arg2);
8678 /* c1.sign := c2.sign. */
8679 real_copysign (&c1, &c2);
8680 return build_real (type, c1);
8683 /* copysign(X, Y) is fabs(X) when Y is always non-negative.
8684 Remember to evaluate Y for side-effects. */
8685 if (tree_expr_nonnegative_p (arg2))
8686 return omit_one_operand_loc (loc, type,
8687 fold_build1_loc (loc, ABS_EXPR, type, arg1),
8690 /* Strip sign changing operations for the first argument. */
8691 tem = fold_strip_sign_ops (arg1);
8693 return build_call_expr_loc (loc, fndecl, 2, tem, arg2);
8698 /* Fold a call to builtin isascii with argument ARG. */
8701 fold_builtin_isascii (location_t loc, tree arg)
8703 if (!validate_arg (arg, INTEGER_TYPE))
8707 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
8708 arg = fold_build2 (BIT_AND_EXPR, integer_type_node, arg,
8709 build_int_cst (integer_type_node,
8710 ~ (unsigned HOST_WIDE_INT) 0x7f));
8711 return fold_build2_loc (loc, EQ_EXPR, integer_type_node,
8712 arg, integer_zero_node);
8716 /* Fold a call to builtin toascii with argument ARG. */
8719 fold_builtin_toascii (location_t loc, tree arg)
8721 if (!validate_arg (arg, INTEGER_TYPE))
8724 /* Transform toascii(c) -> (c & 0x7f). */
8725 return fold_build2_loc (loc, BIT_AND_EXPR, integer_type_node, arg,
8726 build_int_cst (integer_type_node, 0x7f));
8729 /* Fold a call to builtin isdigit with argument ARG. */
8732 fold_builtin_isdigit (location_t loc, tree arg)
8734 if (!validate_arg (arg, INTEGER_TYPE))
8738 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
8739 /* According to the C standard, isdigit is unaffected by locale.
8740 However, it definitely is affected by the target character set. */
8741 unsigned HOST_WIDE_INT target_digit0
8742 = lang_hooks.to_target_charset ('0');
8744 if (target_digit0 == 0)
8747 arg = fold_convert_loc (loc, unsigned_type_node, arg);
8748 arg = fold_build2 (MINUS_EXPR, unsigned_type_node, arg,
8749 build_int_cst (unsigned_type_node, target_digit0));
8750 return fold_build2_loc (loc, LE_EXPR, integer_type_node, arg,
8751 build_int_cst (unsigned_type_node, 9));
8755 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
8758 fold_builtin_fabs (location_t loc, tree arg, tree type)
8760 if (!validate_arg (arg, REAL_TYPE))
8763 arg = fold_convert_loc (loc, type, arg);
8764 if (TREE_CODE (arg) == REAL_CST)
8765 return fold_abs_const (arg, type);
8766 return fold_build1_loc (loc, ABS_EXPR, type, arg);
8769 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
8772 fold_builtin_abs (location_t loc, tree arg, tree type)
8774 if (!validate_arg (arg, INTEGER_TYPE))
8777 arg = fold_convert_loc (loc, type, arg);
8778 if (TREE_CODE (arg) == INTEGER_CST)
8779 return fold_abs_const (arg, type);
8780 return fold_build1_loc (loc, ABS_EXPR, type, arg);
8783 /* Fold a fma operation with arguments ARG[012]. */
8786 fold_fma (location_t loc ATTRIBUTE_UNUSED,
8787 tree type, tree arg0, tree arg1, tree arg2)
8789 if (TREE_CODE (arg0) == REAL_CST
8790 && TREE_CODE (arg1) == REAL_CST
8791 && TREE_CODE (arg2) == REAL_CST)
8792 return do_mpfr_arg3 (arg0, arg1, arg2, type, mpfr_fma);
8797 /* Fold a call to fma, fmaf, or fmal with arguments ARG[012]. */
8800 fold_builtin_fma (location_t loc, tree arg0, tree arg1, tree arg2, tree type)
8802 if (validate_arg (arg0, REAL_TYPE)
8803 && validate_arg(arg1, REAL_TYPE)
8804 && validate_arg(arg2, REAL_TYPE))
8806 tree tem = fold_fma (loc, type, arg0, arg1, arg2);
8810 /* ??? Only expand to FMA_EXPR if it's directly supported. */
8811 if (optab_handler (fma_optab, TYPE_MODE (type)) != CODE_FOR_nothing)
8812 return fold_build3_loc (loc, FMA_EXPR, type, arg0, arg1, arg2);
8817 /* Fold a call to builtin fmin or fmax. */
8820 fold_builtin_fmin_fmax (location_t loc, tree arg0, tree arg1,
8821 tree type, bool max)
8823 if (validate_arg (arg0, REAL_TYPE) && validate_arg (arg1, REAL_TYPE))
8825 /* Calculate the result when the argument is a constant. */
8826 tree res = do_mpfr_arg2 (arg0, arg1, type, (max ? mpfr_max : mpfr_min));
8831 /* If either argument is NaN, return the other one. Avoid the
8832 transformation if we get (and honor) a signalling NaN. Using
8833 omit_one_operand() ensures we create a non-lvalue. */
8834 if (TREE_CODE (arg0) == REAL_CST
8835 && real_isnan (&TREE_REAL_CST (arg0))
8836 && (! HONOR_SNANS (TYPE_MODE (TREE_TYPE (arg0)))
8837 || ! TREE_REAL_CST (arg0).signalling))
8838 return omit_one_operand_loc (loc, type, arg1, arg0);
8839 if (TREE_CODE (arg1) == REAL_CST
8840 && real_isnan (&TREE_REAL_CST (arg1))
8841 && (! HONOR_SNANS (TYPE_MODE (TREE_TYPE (arg1)))
8842 || ! TREE_REAL_CST (arg1).signalling))
8843 return omit_one_operand_loc (loc, type, arg0, arg1);
8845 /* Transform fmin/fmax(x,x) -> x. */
8846 if (operand_equal_p (arg0, arg1, OEP_PURE_SAME))
8847 return omit_one_operand_loc (loc, type, arg0, arg1);
8849 /* Convert fmin/fmax to MIN_EXPR/MAX_EXPR. C99 requires these
8850 functions to return the numeric arg if the other one is NaN.
8851 These tree codes don't honor that, so only transform if
8852 -ffinite-math-only is set. C99 doesn't require -0.0 to be
8853 handled, so we don't have to worry about it either. */
8854 if (flag_finite_math_only)
8855 return fold_build2_loc (loc, (max ? MAX_EXPR : MIN_EXPR), type,
8856 fold_convert_loc (loc, type, arg0),
8857 fold_convert_loc (loc, type, arg1));
8862 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
8865 fold_builtin_carg (location_t loc, tree arg, tree type)
8867 if (validate_arg (arg, COMPLEX_TYPE)
8868 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) == REAL_TYPE)
8870 tree atan2_fn = mathfn_built_in (type, BUILT_IN_ATAN2);
8874 tree new_arg = builtin_save_expr (arg);
8875 tree r_arg = fold_build1_loc (loc, REALPART_EXPR, type, new_arg);
8876 tree i_arg = fold_build1_loc (loc, IMAGPART_EXPR, type, new_arg);
8877 return build_call_expr_loc (loc, atan2_fn, 2, i_arg, r_arg);
8884 /* Fold a call to builtin logb/ilogb. */
8887 fold_builtin_logb (location_t loc, tree arg, tree rettype)
8889 if (! validate_arg (arg, REAL_TYPE))
8894 if (TREE_CODE (arg) == REAL_CST && ! TREE_OVERFLOW (arg))
8896 const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (arg);
8902 /* If arg is Inf or NaN and we're logb, return it. */
8903 if (TREE_CODE (rettype) == REAL_TYPE)
8904 return fold_convert_loc (loc, rettype, arg);
8905 /* Fall through... */
8907 /* Zero may set errno and/or raise an exception for logb, also
8908 for ilogb we don't know FP_ILOGB0. */
8911 /* For normal numbers, proceed iff radix == 2. In GCC,
8912 normalized significands are in the range [0.5, 1.0). We
8913 want the exponent as if they were [1.0, 2.0) so get the
8914 exponent and subtract 1. */
8915 if (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (arg)))->b == 2)
8916 return fold_convert_loc (loc, rettype,
8917 build_int_cst (integer_type_node,
8918 REAL_EXP (value)-1));
8926 /* Fold a call to builtin significand, if radix == 2. */
8929 fold_builtin_significand (location_t loc, tree arg, tree rettype)
8931 if (! validate_arg (arg, REAL_TYPE))
8936 if (TREE_CODE (arg) == REAL_CST && ! TREE_OVERFLOW (arg))
8938 const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (arg);
8945 /* If arg is +-0, +-Inf or +-NaN, then return it. */
8946 return fold_convert_loc (loc, rettype, arg);
8948 /* For normal numbers, proceed iff radix == 2. */
8949 if (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (arg)))->b == 2)
8951 REAL_VALUE_TYPE result = *value;
8952 /* In GCC, normalized significands are in the range [0.5,
8953 1.0). We want them to be [1.0, 2.0) so set the
8955 SET_REAL_EXP (&result, 1);
8956 return build_real (rettype, result);
8965 /* Fold a call to builtin frexp, we can assume the base is 2. */
8968 fold_builtin_frexp (location_t loc, tree arg0, tree arg1, tree rettype)
8970 if (! validate_arg (arg0, REAL_TYPE) || ! validate_arg (arg1, POINTER_TYPE))
8975 if (!(TREE_CODE (arg0) == REAL_CST && ! TREE_OVERFLOW (arg0)))
8978 arg1 = build_fold_indirect_ref_loc (loc, arg1);
8980 /* Proceed if a valid pointer type was passed in. */
8981 if (TYPE_MAIN_VARIANT (TREE_TYPE (arg1)) == integer_type_node)
8983 const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (arg0);
8989 /* For +-0, return (*exp = 0, +-0). */
8990 exp = integer_zero_node;
8995 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
8996 return omit_one_operand_loc (loc, rettype, arg0, arg1);
8999 /* Since the frexp function always expects base 2, and in
9000 GCC normalized significands are already in the range
9001 [0.5, 1.0), we have exactly what frexp wants. */
9002 REAL_VALUE_TYPE frac_rvt = *value;
9003 SET_REAL_EXP (&frac_rvt, 0);
9004 frac = build_real (rettype, frac_rvt);
9005 exp = build_int_cst (integer_type_node, REAL_EXP (value));
9012 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
9013 arg1 = fold_build2_loc (loc, MODIFY_EXPR, rettype, arg1, exp);
9014 TREE_SIDE_EFFECTS (arg1) = 1;
9015 return fold_build2_loc (loc, COMPOUND_EXPR, rettype, arg1, frac);
9021 /* Fold a call to builtin ldexp or scalbn/scalbln. If LDEXP is true
9022 then we can assume the base is two. If it's false, then we have to
9023 check the mode of the TYPE parameter in certain cases. */
9026 fold_builtin_load_exponent (location_t loc, tree arg0, tree arg1,
9027 tree type, bool ldexp)
9029 if (validate_arg (arg0, REAL_TYPE) && validate_arg (arg1, INTEGER_TYPE))
9034 /* If arg0 is 0, Inf or NaN, or if arg1 is 0, then return arg0. */
9035 if (real_zerop (arg0) || integer_zerop (arg1)
9036 || (TREE_CODE (arg0) == REAL_CST
9037 && !real_isfinite (&TREE_REAL_CST (arg0))))
9038 return omit_one_operand_loc (loc, type, arg0, arg1);
9040 /* If both arguments are constant, then try to evaluate it. */
9041 if ((ldexp || REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2)
9042 && TREE_CODE (arg0) == REAL_CST && !TREE_OVERFLOW (arg0)
9043 && host_integerp (arg1, 0))
9045 /* Bound the maximum adjustment to twice the range of the
9046 mode's valid exponents. Use abs to ensure the range is
9047 positive as a sanity check. */
9048 const long max_exp_adj = 2 *
9049 labs (REAL_MODE_FORMAT (TYPE_MODE (type))->emax
9050 - REAL_MODE_FORMAT (TYPE_MODE (type))->emin);
9052 /* Get the user-requested adjustment. */
9053 const HOST_WIDE_INT req_exp_adj = tree_low_cst (arg1, 0);
9055 /* The requested adjustment must be inside this range. This
9056 is a preliminary cap to avoid things like overflow, we
9057 may still fail to compute the result for other reasons. */
9058 if (-max_exp_adj < req_exp_adj && req_exp_adj < max_exp_adj)
9060 REAL_VALUE_TYPE initial_result;
9062 real_ldexp (&initial_result, &TREE_REAL_CST (arg0), req_exp_adj);
9064 /* Ensure we didn't overflow. */
9065 if (! real_isinf (&initial_result))
9067 const REAL_VALUE_TYPE trunc_result
9068 = real_value_truncate (TYPE_MODE (type), initial_result);
9070 /* Only proceed if the target mode can hold the
9072 if (REAL_VALUES_EQUAL (initial_result, trunc_result))
9073 return build_real (type, trunc_result);
9082 /* Fold a call to builtin modf. */
9085 fold_builtin_modf (location_t loc, tree arg0, tree arg1, tree rettype)
9087 if (! validate_arg (arg0, REAL_TYPE) || ! validate_arg (arg1, POINTER_TYPE))
9092 if (!(TREE_CODE (arg0) == REAL_CST && ! TREE_OVERFLOW (arg0)))
9095 arg1 = build_fold_indirect_ref_loc (loc, arg1);
9097 /* Proceed if a valid pointer type was passed in. */
9098 if (TYPE_MAIN_VARIANT (TREE_TYPE (arg1)) == TYPE_MAIN_VARIANT (rettype))
9100 const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (arg0);
9101 REAL_VALUE_TYPE trunc, frac;
9107 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
9108 trunc = frac = *value;
9111 /* For +-Inf, return (*arg1 = arg0, +-0). */
9113 frac.sign = value->sign;
9117 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
9118 real_trunc (&trunc, VOIDmode, value);
9119 real_arithmetic (&frac, MINUS_EXPR, value, &trunc);
9120 /* If the original number was negative and already
9121 integral, then the fractional part is -0.0. */
9122 if (value->sign && frac.cl == rvc_zero)
9123 frac.sign = value->sign;
9127 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
9128 arg1 = fold_build2_loc (loc, MODIFY_EXPR, rettype, arg1,
9129 build_real (rettype, trunc));
9130 TREE_SIDE_EFFECTS (arg1) = 1;
9131 return fold_build2_loc (loc, COMPOUND_EXPR, rettype, arg1,
9132 build_real (rettype, frac));
9138 /* Given a location LOC, an interclass builtin function decl FNDECL
9139 and its single argument ARG, return an folded expression computing
9140 the same, or NULL_TREE if we either couldn't or didn't want to fold
9141 (the latter happen if there's an RTL instruction available). */
9144 fold_builtin_interclass_mathfn (location_t loc, tree fndecl, tree arg)
9146 enum machine_mode mode;
9148 if (!validate_arg (arg, REAL_TYPE))
9151 if (interclass_mathfn_icode (arg, fndecl) != CODE_FOR_nothing)
9154 mode = TYPE_MODE (TREE_TYPE (arg));
9156 /* If there is no optab, try generic code. */
9157 switch (DECL_FUNCTION_CODE (fndecl))
9161 CASE_FLT_FN (BUILT_IN_ISINF):
9163 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
9164 tree const isgr_fn = built_in_decls[BUILT_IN_ISGREATER];
9165 tree const type = TREE_TYPE (arg);
9169 get_max_float (REAL_MODE_FORMAT (mode), buf, sizeof (buf));
9170 real_from_string (&r, buf);
9171 result = build_call_expr (isgr_fn, 2,
9172 fold_build1_loc (loc, ABS_EXPR, type, arg),
9173 build_real (type, r));
9176 CASE_FLT_FN (BUILT_IN_FINITE):
9177 case BUILT_IN_ISFINITE:
9179 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
9180 tree const isle_fn = built_in_decls[BUILT_IN_ISLESSEQUAL];
9181 tree const type = TREE_TYPE (arg);
9185 get_max_float (REAL_MODE_FORMAT (mode), buf, sizeof (buf));
9186 real_from_string (&r, buf);
9187 result = build_call_expr (isle_fn, 2,
9188 fold_build1_loc (loc, ABS_EXPR, type, arg),
9189 build_real (type, r));
9190 /*result = fold_build2_loc (loc, UNGT_EXPR,
9191 TREE_TYPE (TREE_TYPE (fndecl)),
9192 fold_build1_loc (loc, ABS_EXPR, type, arg),
9193 build_real (type, r));
9194 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
9195 TREE_TYPE (TREE_TYPE (fndecl)),
9199 case BUILT_IN_ISNORMAL:
9201 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
9202 islessequal(fabs(x),DBL_MAX). */
9203 tree const isle_fn = built_in_decls[BUILT_IN_ISLESSEQUAL];
9204 tree const isge_fn = built_in_decls[BUILT_IN_ISGREATEREQUAL];
9205 tree const type = TREE_TYPE (arg);
9206 REAL_VALUE_TYPE rmax, rmin;
9209 get_max_float (REAL_MODE_FORMAT (mode), buf, sizeof (buf));
9210 real_from_string (&rmax, buf);
9211 sprintf (buf, "0x1p%d", REAL_MODE_FORMAT (mode)->emin - 1);
9212 real_from_string (&rmin, buf);
9213 arg = builtin_save_expr (fold_build1_loc (loc, ABS_EXPR, type, arg));
9214 result = build_call_expr (isle_fn, 2, arg,
9215 build_real (type, rmax));
9216 result = fold_build2 (BIT_AND_EXPR, integer_type_node, result,
9217 build_call_expr (isge_fn, 2, arg,
9218 build_real (type, rmin)));
9228 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
9229 ARG is the argument for the call. */
9232 fold_builtin_classify (location_t loc, tree fndecl, tree arg, int builtin_index)
9234 tree type = TREE_TYPE (TREE_TYPE (fndecl));
9237 if (!validate_arg (arg, REAL_TYPE))
9240 switch (builtin_index)
9242 case BUILT_IN_ISINF:
9243 if (!HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (arg))))
9244 return omit_one_operand_loc (loc, type, integer_zero_node, arg);
9246 if (TREE_CODE (arg) == REAL_CST)
9248 r = TREE_REAL_CST (arg);
9249 if (real_isinf (&r))
9250 return real_compare (GT_EXPR, &r, &dconst0)
9251 ? integer_one_node : integer_minus_one_node;
9253 return integer_zero_node;
9258 case BUILT_IN_ISINF_SIGN:
9260 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
9261 /* In a boolean context, GCC will fold the inner COND_EXPR to
9262 1. So e.g. "if (isinf_sign(x))" would be folded to just
9263 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
9264 tree signbit_fn = mathfn_built_in_1 (TREE_TYPE (arg), BUILT_IN_SIGNBIT, 0);
9265 tree isinf_fn = built_in_decls[BUILT_IN_ISINF];
9266 tree tmp = NULL_TREE;
9268 arg = builtin_save_expr (arg);
9270 if (signbit_fn && isinf_fn)
9272 tree signbit_call = build_call_expr_loc (loc, signbit_fn, 1, arg);
9273 tree isinf_call = build_call_expr_loc (loc, isinf_fn, 1, arg);
9275 signbit_call = fold_build2_loc (loc, NE_EXPR, integer_type_node,
9276 signbit_call, integer_zero_node);
9277 isinf_call = fold_build2_loc (loc, NE_EXPR, integer_type_node,
9278 isinf_call, integer_zero_node);
9280 tmp = fold_build3_loc (loc, COND_EXPR, integer_type_node, signbit_call,
9281 integer_minus_one_node, integer_one_node);
9282 tmp = fold_build3_loc (loc, COND_EXPR, integer_type_node,
9290 case BUILT_IN_ISFINITE:
9291 if (!HONOR_NANS (TYPE_MODE (TREE_TYPE (arg)))
9292 && !HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (arg))))
9293 return omit_one_operand_loc (loc, type, integer_one_node, arg);
9295 if (TREE_CODE (arg) == REAL_CST)
9297 r = TREE_REAL_CST (arg);
9298 return real_isfinite (&r) ? integer_one_node : integer_zero_node;
9303 case BUILT_IN_ISNAN:
9304 if (!HONOR_NANS (TYPE_MODE (TREE_TYPE (arg))))
9305 return omit_one_operand_loc (loc, type, integer_zero_node, arg);
9307 if (TREE_CODE (arg) == REAL_CST)
9309 r = TREE_REAL_CST (arg);
9310 return real_isnan (&r) ? integer_one_node : integer_zero_node;
9313 arg = builtin_save_expr (arg);
9314 return fold_build2_loc (loc, UNORDERED_EXPR, type, arg, arg);
9321 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
9322 This builtin will generate code to return the appropriate floating
9323 point classification depending on the value of the floating point
9324 number passed in. The possible return values must be supplied as
9325 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
9326 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
9327 one floating point argument which is "type generic". */
9330 fold_builtin_fpclassify (location_t loc, tree exp)
9332 tree fp_nan, fp_infinite, fp_normal, fp_subnormal, fp_zero,
9333 arg, type, res, tmp;
9334 enum machine_mode mode;
9338 /* Verify the required arguments in the original call. */
9339 if (!validate_arglist (exp, INTEGER_TYPE, INTEGER_TYPE,
9340 INTEGER_TYPE, INTEGER_TYPE,
9341 INTEGER_TYPE, REAL_TYPE, VOID_TYPE))
9344 fp_nan = CALL_EXPR_ARG (exp, 0);
9345 fp_infinite = CALL_EXPR_ARG (exp, 1);
9346 fp_normal = CALL_EXPR_ARG (exp, 2);
9347 fp_subnormal = CALL_EXPR_ARG (exp, 3);
9348 fp_zero = CALL_EXPR_ARG (exp, 4);
9349 arg = CALL_EXPR_ARG (exp, 5);
9350 type = TREE_TYPE (arg);
9351 mode = TYPE_MODE (type);
9352 arg = builtin_save_expr (fold_build1_loc (loc, ABS_EXPR, type, arg));
9356 (fabs(x) == Inf ? FP_INFINITE :
9357 (fabs(x) >= DBL_MIN ? FP_NORMAL :
9358 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
9360 tmp = fold_build2_loc (loc, EQ_EXPR, integer_type_node, arg,
9361 build_real (type, dconst0));
9362 res = fold_build3_loc (loc, COND_EXPR, integer_type_node,
9363 tmp, fp_zero, fp_subnormal);
9365 sprintf (buf, "0x1p%d", REAL_MODE_FORMAT (mode)->emin - 1);
9366 real_from_string (&r, buf);
9367 tmp = fold_build2_loc (loc, GE_EXPR, integer_type_node,
9368 arg, build_real (type, r));
9369 res = fold_build3_loc (loc, COND_EXPR, integer_type_node, tmp, fp_normal, res);
9371 if (HONOR_INFINITIES (mode))
9374 tmp = fold_build2_loc (loc, EQ_EXPR, integer_type_node, arg,
9375 build_real (type, r));
9376 res = fold_build3_loc (loc, COND_EXPR, integer_type_node, tmp,
9380 if (HONOR_NANS (mode))
9382 tmp = fold_build2_loc (loc, ORDERED_EXPR, integer_type_node, arg, arg);
9383 res = fold_build3_loc (loc, COND_EXPR, integer_type_node, tmp, res, fp_nan);
9389 /* Fold a call to an unordered comparison function such as
9390 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
9391 being called and ARG0 and ARG1 are the arguments for the call.
9392 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
9393 the opposite of the desired result. UNORDERED_CODE is used
9394 for modes that can hold NaNs and ORDERED_CODE is used for
9398 fold_builtin_unordered_cmp (location_t loc, tree fndecl, tree arg0, tree arg1,
9399 enum tree_code unordered_code,
9400 enum tree_code ordered_code)
9402 tree type = TREE_TYPE (TREE_TYPE (fndecl));
9403 enum tree_code code;
9405 enum tree_code code0, code1;
9406 tree cmp_type = NULL_TREE;
9408 type0 = TREE_TYPE (arg0);
9409 type1 = TREE_TYPE (arg1);
9411 code0 = TREE_CODE (type0);
9412 code1 = TREE_CODE (type1);
9414 if (code0 == REAL_TYPE && code1 == REAL_TYPE)
9415 /* Choose the wider of two real types. */
9416 cmp_type = TYPE_PRECISION (type0) >= TYPE_PRECISION (type1)
9418 else if (code0 == REAL_TYPE && code1 == INTEGER_TYPE)
9420 else if (code0 == INTEGER_TYPE && code1 == REAL_TYPE)
9423 arg0 = fold_convert_loc (loc, cmp_type, arg0);
9424 arg1 = fold_convert_loc (loc, cmp_type, arg1);
9426 if (unordered_code == UNORDERED_EXPR)
9428 if (!HONOR_NANS (TYPE_MODE (TREE_TYPE (arg0))))
9429 return omit_two_operands_loc (loc, type, integer_zero_node, arg0, arg1);
9430 return fold_build2_loc (loc, UNORDERED_EXPR, type, arg0, arg1);
9433 code = HONOR_NANS (TYPE_MODE (TREE_TYPE (arg0))) ? unordered_code
9435 return fold_build1_loc (loc, TRUTH_NOT_EXPR, type,
9436 fold_build2_loc (loc, code, type, arg0, arg1));
9439 /* Fold a call to built-in function FNDECL with 0 arguments.
9440 IGNORE is true if the result of the function call is ignored. This
9441 function returns NULL_TREE if no simplification was possible. */
9444 fold_builtin_0 (location_t loc, tree fndecl, bool ignore ATTRIBUTE_UNUSED)
9446 tree type = TREE_TYPE (TREE_TYPE (fndecl));
9447 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
9450 CASE_FLT_FN (BUILT_IN_INF):
9451 case BUILT_IN_INFD32:
9452 case BUILT_IN_INFD64:
9453 case BUILT_IN_INFD128:
9454 return fold_builtin_inf (loc, type, true);
9456 CASE_FLT_FN (BUILT_IN_HUGE_VAL):
9457 return fold_builtin_inf (loc, type, false);
9459 case BUILT_IN_CLASSIFY_TYPE:
9460 return fold_builtin_classify_type (NULL_TREE);
9468 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
9469 IGNORE is true if the result of the function call is ignored. This
9470 function returns NULL_TREE if no simplification was possible. */
9473 fold_builtin_1 (location_t loc, tree fndecl, tree arg0, bool ignore)
9475 tree type = TREE_TYPE (TREE_TYPE (fndecl));
9476 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
9479 case BUILT_IN_CONSTANT_P:
9481 tree val = fold_builtin_constant_p (arg0);
9483 /* Gimplification will pull the CALL_EXPR for the builtin out of
9484 an if condition. When not optimizing, we'll not CSE it back.
9485 To avoid link error types of regressions, return false now. */
9486 if (!val && !optimize)
9487 val = integer_zero_node;
9492 case BUILT_IN_CLASSIFY_TYPE:
9493 return fold_builtin_classify_type (arg0);
9495 case BUILT_IN_STRLEN:
9496 return fold_builtin_strlen (loc, type, arg0);
9498 CASE_FLT_FN (BUILT_IN_FABS):
9499 return fold_builtin_fabs (loc, arg0, type);
9503 case BUILT_IN_LLABS:
9504 case BUILT_IN_IMAXABS:
9505 return fold_builtin_abs (loc, arg0, type);
9507 CASE_FLT_FN (BUILT_IN_CONJ):
9508 if (validate_arg (arg0, COMPLEX_TYPE)
9509 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
9510 return fold_build1_loc (loc, CONJ_EXPR, type, arg0);
9513 CASE_FLT_FN (BUILT_IN_CREAL):
9514 if (validate_arg (arg0, COMPLEX_TYPE)
9515 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
9516 return non_lvalue_loc (loc, fold_build1_loc (loc, REALPART_EXPR, type, arg0));;
9519 CASE_FLT_FN (BUILT_IN_CIMAG):
9520 if (validate_arg (arg0, COMPLEX_TYPE)
9521 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
9522 return non_lvalue_loc (loc, fold_build1_loc (loc, IMAGPART_EXPR, type, arg0));
9525 CASE_FLT_FN (BUILT_IN_CCOS):
9526 return fold_builtin_ccos(loc, arg0, type, fndecl, /*hyper=*/ false);
9528 CASE_FLT_FN (BUILT_IN_CCOSH):
9529 return fold_builtin_ccos(loc, arg0, type, fndecl, /*hyper=*/ true);
9531 CASE_FLT_FN (BUILT_IN_CPROJ):
9532 return fold_builtin_cproj(loc, arg0, type);
9534 CASE_FLT_FN (BUILT_IN_CSIN):
9535 if (validate_arg (arg0, COMPLEX_TYPE)
9536 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
9537 return do_mpc_arg1 (arg0, type, mpc_sin);
9540 CASE_FLT_FN (BUILT_IN_CSINH):
9541 if (validate_arg (arg0, COMPLEX_TYPE)
9542 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
9543 return do_mpc_arg1 (arg0, type, mpc_sinh);
9546 CASE_FLT_FN (BUILT_IN_CTAN):
9547 if (validate_arg (arg0, COMPLEX_TYPE)
9548 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
9549 return do_mpc_arg1 (arg0, type, mpc_tan);
9552 CASE_FLT_FN (BUILT_IN_CTANH):
9553 if (validate_arg (arg0, COMPLEX_TYPE)
9554 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
9555 return do_mpc_arg1 (arg0, type, mpc_tanh);
9558 CASE_FLT_FN (BUILT_IN_CLOG):
9559 if (validate_arg (arg0, COMPLEX_TYPE)
9560 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
9561 return do_mpc_arg1 (arg0, type, mpc_log);
9564 CASE_FLT_FN (BUILT_IN_CSQRT):
9565 if (validate_arg (arg0, COMPLEX_TYPE)
9566 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
9567 return do_mpc_arg1 (arg0, type, mpc_sqrt);
9570 CASE_FLT_FN (BUILT_IN_CASIN):
9571 if (validate_arg (arg0, COMPLEX_TYPE)
9572 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
9573 return do_mpc_arg1 (arg0, type, mpc_asin);
9576 CASE_FLT_FN (BUILT_IN_CACOS):
9577 if (validate_arg (arg0, COMPLEX_TYPE)
9578 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
9579 return do_mpc_arg1 (arg0, type, mpc_acos);
9582 CASE_FLT_FN (BUILT_IN_CATAN):
9583 if (validate_arg (arg0, COMPLEX_TYPE)
9584 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
9585 return do_mpc_arg1 (arg0, type, mpc_atan);
9588 CASE_FLT_FN (BUILT_IN_CASINH):
9589 if (validate_arg (arg0, COMPLEX_TYPE)
9590 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
9591 return do_mpc_arg1 (arg0, type, mpc_asinh);
9594 CASE_FLT_FN (BUILT_IN_CACOSH):
9595 if (validate_arg (arg0, COMPLEX_TYPE)
9596 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
9597 return do_mpc_arg1 (arg0, type, mpc_acosh);
9600 CASE_FLT_FN (BUILT_IN_CATANH):
9601 if (validate_arg (arg0, COMPLEX_TYPE)
9602 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
9603 return do_mpc_arg1 (arg0, type, mpc_atanh);
9606 CASE_FLT_FN (BUILT_IN_CABS):
9607 return fold_builtin_cabs (loc, arg0, type, fndecl);
9609 CASE_FLT_FN (BUILT_IN_CARG):
9610 return fold_builtin_carg (loc, arg0, type);
9612 CASE_FLT_FN (BUILT_IN_SQRT):
9613 return fold_builtin_sqrt (loc, arg0, type);
9615 CASE_FLT_FN (BUILT_IN_CBRT):
9616 return fold_builtin_cbrt (loc, arg0, type);
9618 CASE_FLT_FN (BUILT_IN_ASIN):
9619 if (validate_arg (arg0, REAL_TYPE))
9620 return do_mpfr_arg1 (arg0, type, mpfr_asin,
9621 &dconstm1, &dconst1, true);
9624 CASE_FLT_FN (BUILT_IN_ACOS):
9625 if (validate_arg (arg0, REAL_TYPE))
9626 return do_mpfr_arg1 (arg0, type, mpfr_acos,
9627 &dconstm1, &dconst1, true);
9630 CASE_FLT_FN (BUILT_IN_ATAN):
9631 if (validate_arg (arg0, REAL_TYPE))
9632 return do_mpfr_arg1 (arg0, type, mpfr_atan, NULL, NULL, 0);
9635 CASE_FLT_FN (BUILT_IN_ASINH):
9636 if (validate_arg (arg0, REAL_TYPE))
9637 return do_mpfr_arg1 (arg0, type, mpfr_asinh, NULL, NULL, 0);
9640 CASE_FLT_FN (BUILT_IN_ACOSH):
9641 if (validate_arg (arg0, REAL_TYPE))
9642 return do_mpfr_arg1 (arg0, type, mpfr_acosh,
9643 &dconst1, NULL, true);
9646 CASE_FLT_FN (BUILT_IN_ATANH):
9647 if (validate_arg (arg0, REAL_TYPE))
9648 return do_mpfr_arg1 (arg0, type, mpfr_atanh,
9649 &dconstm1, &dconst1, false);
9652 CASE_FLT_FN (BUILT_IN_SIN):
9653 if (validate_arg (arg0, REAL_TYPE))
9654 return do_mpfr_arg1 (arg0, type, mpfr_sin, NULL, NULL, 0);
9657 CASE_FLT_FN (BUILT_IN_COS):
9658 return fold_builtin_cos (loc, arg0, type, fndecl);
9660 CASE_FLT_FN (BUILT_IN_TAN):
9661 return fold_builtin_tan (arg0, type);
9663 CASE_FLT_FN (BUILT_IN_CEXP):
9664 return fold_builtin_cexp (loc, arg0, type);
9666 CASE_FLT_FN (BUILT_IN_CEXPI):
9667 if (validate_arg (arg0, REAL_TYPE))
9668 return do_mpfr_sincos (arg0, NULL_TREE, NULL_TREE);
9671 CASE_FLT_FN (BUILT_IN_SINH):
9672 if (validate_arg (arg0, REAL_TYPE))
9673 return do_mpfr_arg1 (arg0, type, mpfr_sinh, NULL, NULL, 0);
9676 CASE_FLT_FN (BUILT_IN_COSH):
9677 return fold_builtin_cosh (loc, arg0, type, fndecl);
9679 CASE_FLT_FN (BUILT_IN_TANH):
9680 if (validate_arg (arg0, REAL_TYPE))
9681 return do_mpfr_arg1 (arg0, type, mpfr_tanh, NULL, NULL, 0);
9684 CASE_FLT_FN (BUILT_IN_ERF):
9685 if (validate_arg (arg0, REAL_TYPE))
9686 return do_mpfr_arg1 (arg0, type, mpfr_erf, NULL, NULL, 0);
9689 CASE_FLT_FN (BUILT_IN_ERFC):
9690 if (validate_arg (arg0, REAL_TYPE))
9691 return do_mpfr_arg1 (arg0, type, mpfr_erfc, NULL, NULL, 0);
9694 CASE_FLT_FN (BUILT_IN_TGAMMA):
9695 if (validate_arg (arg0, REAL_TYPE))
9696 return do_mpfr_arg1 (arg0, type, mpfr_gamma, NULL, NULL, 0);
9699 CASE_FLT_FN (BUILT_IN_EXP):
9700 return fold_builtin_exponent (loc, fndecl, arg0, mpfr_exp);
9702 CASE_FLT_FN (BUILT_IN_EXP2):
9703 return fold_builtin_exponent (loc, fndecl, arg0, mpfr_exp2);
9705 CASE_FLT_FN (BUILT_IN_EXP10):
9706 CASE_FLT_FN (BUILT_IN_POW10):
9707 return fold_builtin_exponent (loc, fndecl, arg0, mpfr_exp10);
9709 CASE_FLT_FN (BUILT_IN_EXPM1):
9710 if (validate_arg (arg0, REAL_TYPE))
9711 return do_mpfr_arg1 (arg0, type, mpfr_expm1, NULL, NULL, 0);
9714 CASE_FLT_FN (BUILT_IN_LOG):
9715 return fold_builtin_logarithm (loc, fndecl, arg0, mpfr_log);
9717 CASE_FLT_FN (BUILT_IN_LOG2):
9718 return fold_builtin_logarithm (loc, fndecl, arg0, mpfr_log2);
9720 CASE_FLT_FN (BUILT_IN_LOG10):
9721 return fold_builtin_logarithm (loc, fndecl, arg0, mpfr_log10);
9723 CASE_FLT_FN (BUILT_IN_LOG1P):
9724 if (validate_arg (arg0, REAL_TYPE))
9725 return do_mpfr_arg1 (arg0, type, mpfr_log1p,
9726 &dconstm1, NULL, false);
9729 CASE_FLT_FN (BUILT_IN_J0):
9730 if (validate_arg (arg0, REAL_TYPE))
9731 return do_mpfr_arg1 (arg0, type, mpfr_j0,
9735 CASE_FLT_FN (BUILT_IN_J1):
9736 if (validate_arg (arg0, REAL_TYPE))
9737 return do_mpfr_arg1 (arg0, type, mpfr_j1,
9741 CASE_FLT_FN (BUILT_IN_Y0):
9742 if (validate_arg (arg0, REAL_TYPE))
9743 return do_mpfr_arg1 (arg0, type, mpfr_y0,
9744 &dconst0, NULL, false);
9747 CASE_FLT_FN (BUILT_IN_Y1):
9748 if (validate_arg (arg0, REAL_TYPE))
9749 return do_mpfr_arg1 (arg0, type, mpfr_y1,
9750 &dconst0, NULL, false);
9753 CASE_FLT_FN (BUILT_IN_NAN):
9754 case BUILT_IN_NAND32:
9755 case BUILT_IN_NAND64:
9756 case BUILT_IN_NAND128:
9757 return fold_builtin_nan (arg0, type, true);
9759 CASE_FLT_FN (BUILT_IN_NANS):
9760 return fold_builtin_nan (arg0, type, false);
9762 CASE_FLT_FN (BUILT_IN_FLOOR):
9763 return fold_builtin_floor (loc, fndecl, arg0);
9765 CASE_FLT_FN (BUILT_IN_CEIL):
9766 return fold_builtin_ceil (loc, fndecl, arg0);
9768 CASE_FLT_FN (BUILT_IN_TRUNC):
9769 return fold_builtin_trunc (loc, fndecl, arg0);
9771 CASE_FLT_FN (BUILT_IN_ROUND):
9772 return fold_builtin_round (loc, fndecl, arg0);
9774 CASE_FLT_FN (BUILT_IN_NEARBYINT):
9775 CASE_FLT_FN (BUILT_IN_RINT):
9776 return fold_trunc_transparent_mathfn (loc, fndecl, arg0);
9778 CASE_FLT_FN (BUILT_IN_LCEIL):
9779 CASE_FLT_FN (BUILT_IN_LLCEIL):
9780 CASE_FLT_FN (BUILT_IN_LFLOOR):
9781 CASE_FLT_FN (BUILT_IN_LLFLOOR):
9782 CASE_FLT_FN (BUILT_IN_LROUND):
9783 CASE_FLT_FN (BUILT_IN_LLROUND):
9784 return fold_builtin_int_roundingfn (loc, fndecl, arg0);
9786 CASE_FLT_FN (BUILT_IN_LRINT):
9787 CASE_FLT_FN (BUILT_IN_LLRINT):
9788 return fold_fixed_mathfn (loc, fndecl, arg0);
9790 case BUILT_IN_BSWAP32:
9791 case BUILT_IN_BSWAP64:
9792 return fold_builtin_bswap (fndecl, arg0);
9794 CASE_INT_FN (BUILT_IN_FFS):
9795 CASE_INT_FN (BUILT_IN_CLZ):
9796 CASE_INT_FN (BUILT_IN_CTZ):
9797 CASE_INT_FN (BUILT_IN_CLRSB):
9798 CASE_INT_FN (BUILT_IN_POPCOUNT):
9799 CASE_INT_FN (BUILT_IN_PARITY):
9800 return fold_builtin_bitop (fndecl, arg0);
9802 CASE_FLT_FN (BUILT_IN_SIGNBIT):
9803 return fold_builtin_signbit (loc, arg0, type);
9805 CASE_FLT_FN (BUILT_IN_SIGNIFICAND):
9806 return fold_builtin_significand (loc, arg0, type);
9808 CASE_FLT_FN (BUILT_IN_ILOGB):
9809 CASE_FLT_FN (BUILT_IN_LOGB):
9810 return fold_builtin_logb (loc, arg0, type);
9812 case BUILT_IN_ISASCII:
9813 return fold_builtin_isascii (loc, arg0);
9815 case BUILT_IN_TOASCII:
9816 return fold_builtin_toascii (loc, arg0);
9818 case BUILT_IN_ISDIGIT:
9819 return fold_builtin_isdigit (loc, arg0);
9821 CASE_FLT_FN (BUILT_IN_FINITE):
9822 case BUILT_IN_FINITED32:
9823 case BUILT_IN_FINITED64:
9824 case BUILT_IN_FINITED128:
9825 case BUILT_IN_ISFINITE:
9827 tree ret = fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISFINITE);
9830 return fold_builtin_interclass_mathfn (loc, fndecl, arg0);
9833 CASE_FLT_FN (BUILT_IN_ISINF):
9834 case BUILT_IN_ISINFD32:
9835 case BUILT_IN_ISINFD64:
9836 case BUILT_IN_ISINFD128:
9838 tree ret = fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISINF);
9841 return fold_builtin_interclass_mathfn (loc, fndecl, arg0);
9844 case BUILT_IN_ISNORMAL:
9845 return fold_builtin_interclass_mathfn (loc, fndecl, arg0);
9847 case BUILT_IN_ISINF_SIGN:
9848 return fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISINF_SIGN);
9850 CASE_FLT_FN (BUILT_IN_ISNAN):
9851 case BUILT_IN_ISNAND32:
9852 case BUILT_IN_ISNAND64:
9853 case BUILT_IN_ISNAND128:
9854 return fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISNAN);
9856 case BUILT_IN_PRINTF:
9857 case BUILT_IN_PRINTF_UNLOCKED:
9858 case BUILT_IN_VPRINTF:
9859 return fold_builtin_printf (loc, fndecl, arg0, NULL_TREE, ignore, fcode);
9862 if (integer_zerop (arg0))
9863 return build_empty_stmt (loc);
9874 /* Fold a call to built-in function FNDECL with 2 arguments, ARG0 and ARG1.
9875 IGNORE is true if the result of the function call is ignored. This
9876 function returns NULL_TREE if no simplification was possible. */
9879 fold_builtin_2 (location_t loc, tree fndecl, tree arg0, tree arg1, bool ignore)
9881 tree type = TREE_TYPE (TREE_TYPE (fndecl));
9882 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
9886 CASE_FLT_FN (BUILT_IN_JN):
9887 if (validate_arg (arg0, INTEGER_TYPE)
9888 && validate_arg (arg1, REAL_TYPE))
9889 return do_mpfr_bessel_n (arg0, arg1, type, mpfr_jn, NULL, 0);
9892 CASE_FLT_FN (BUILT_IN_YN):
9893 if (validate_arg (arg0, INTEGER_TYPE)
9894 && validate_arg (arg1, REAL_TYPE))
9895 return do_mpfr_bessel_n (arg0, arg1, type, mpfr_yn,
9899 CASE_FLT_FN (BUILT_IN_DREM):
9900 CASE_FLT_FN (BUILT_IN_REMAINDER):
9901 if (validate_arg (arg0, REAL_TYPE)
9902 && validate_arg(arg1, REAL_TYPE))
9903 return do_mpfr_arg2 (arg0, arg1, type, mpfr_remainder);
9906 CASE_FLT_FN_REENT (BUILT_IN_GAMMA): /* GAMMA_R */
9907 CASE_FLT_FN_REENT (BUILT_IN_LGAMMA): /* LGAMMA_R */
9908 if (validate_arg (arg0, REAL_TYPE)
9909 && validate_arg(arg1, POINTER_TYPE))
9910 return do_mpfr_lgamma_r (arg0, arg1, type);
9913 CASE_FLT_FN (BUILT_IN_ATAN2):
9914 if (validate_arg (arg0, REAL_TYPE)
9915 && validate_arg(arg1, REAL_TYPE))
9916 return do_mpfr_arg2 (arg0, arg1, type, mpfr_atan2);
9919 CASE_FLT_FN (BUILT_IN_FDIM):
9920 if (validate_arg (arg0, REAL_TYPE)
9921 && validate_arg(arg1, REAL_TYPE))
9922 return do_mpfr_arg2 (arg0, arg1, type, mpfr_dim);
9925 CASE_FLT_FN (BUILT_IN_HYPOT):
9926 return fold_builtin_hypot (loc, fndecl, arg0, arg1, type);
9928 CASE_FLT_FN (BUILT_IN_CPOW):
9929 if (validate_arg (arg0, COMPLEX_TYPE)
9930 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE
9931 && validate_arg (arg1, COMPLEX_TYPE)
9932 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg1))) == REAL_TYPE)
9933 return do_mpc_arg2 (arg0, arg1, type, /*do_nonfinite=*/ 0, mpc_pow);
9936 CASE_FLT_FN (BUILT_IN_LDEXP):
9937 return fold_builtin_load_exponent (loc, arg0, arg1, type, /*ldexp=*/true);
9938 CASE_FLT_FN (BUILT_IN_SCALBN):
9939 CASE_FLT_FN (BUILT_IN_SCALBLN):
9940 return fold_builtin_load_exponent (loc, arg0, arg1,
9941 type, /*ldexp=*/false);
9943 CASE_FLT_FN (BUILT_IN_FREXP):
9944 return fold_builtin_frexp (loc, arg0, arg1, type);
9946 CASE_FLT_FN (BUILT_IN_MODF):
9947 return fold_builtin_modf (loc, arg0, arg1, type);
9949 case BUILT_IN_BZERO:
9950 return fold_builtin_bzero (loc, arg0, arg1, ignore);
9952 case BUILT_IN_FPUTS:
9953 return fold_builtin_fputs (loc, arg0, arg1, ignore, false, NULL_TREE);
9955 case BUILT_IN_FPUTS_UNLOCKED:
9956 return fold_builtin_fputs (loc, arg0, arg1, ignore, true, NULL_TREE);
9958 case BUILT_IN_STRSTR:
9959 return fold_builtin_strstr (loc, arg0, arg1, type);
9961 case BUILT_IN_STRCAT:
9962 return fold_builtin_strcat (loc, arg0, arg1);
9964 case BUILT_IN_STRSPN:
9965 return fold_builtin_strspn (loc, arg0, arg1);
9967 case BUILT_IN_STRCSPN:
9968 return fold_builtin_strcspn (loc, arg0, arg1);
9970 case BUILT_IN_STRCHR:
9971 case BUILT_IN_INDEX:
9972 return fold_builtin_strchr (loc, arg0, arg1, type);
9974 case BUILT_IN_STRRCHR:
9975 case BUILT_IN_RINDEX:
9976 return fold_builtin_strrchr (loc, arg0, arg1, type);
9978 case BUILT_IN_STRCPY:
9979 return fold_builtin_strcpy (loc, fndecl, arg0, arg1, NULL_TREE);
9981 case BUILT_IN_STPCPY:
9984 tree fn = implicit_built_in_decls[BUILT_IN_STRCPY];
9988 return build_call_expr_loc (loc, fn, 2, arg0, arg1);
9991 return fold_builtin_stpcpy (loc, fndecl, arg0, arg1);
9994 case BUILT_IN_STRCMP:
9995 return fold_builtin_strcmp (loc, arg0, arg1);
9997 case BUILT_IN_STRPBRK:
9998 return fold_builtin_strpbrk (loc, arg0, arg1, type);
10000 case BUILT_IN_EXPECT:
10001 return fold_builtin_expect (loc, arg0, arg1);
10003 CASE_FLT_FN (BUILT_IN_POW):
10004 return fold_builtin_pow (loc, fndecl, arg0, arg1, type);
10006 CASE_FLT_FN (BUILT_IN_POWI):
10007 return fold_builtin_powi (loc, fndecl, arg0, arg1, type);
10009 CASE_FLT_FN (BUILT_IN_COPYSIGN):
10010 return fold_builtin_copysign (loc, fndecl, arg0, arg1, type);
10012 CASE_FLT_FN (BUILT_IN_FMIN):
10013 return fold_builtin_fmin_fmax (loc, arg0, arg1, type, /*max=*/false);
10015 CASE_FLT_FN (BUILT_IN_FMAX):
10016 return fold_builtin_fmin_fmax (loc, arg0, arg1, type, /*max=*/true);
10018 case BUILT_IN_ISGREATER:
10019 return fold_builtin_unordered_cmp (loc, fndecl,
10020 arg0, arg1, UNLE_EXPR, LE_EXPR);
10021 case BUILT_IN_ISGREATEREQUAL:
10022 return fold_builtin_unordered_cmp (loc, fndecl,
10023 arg0, arg1, UNLT_EXPR, LT_EXPR);
10024 case BUILT_IN_ISLESS:
10025 return fold_builtin_unordered_cmp (loc, fndecl,
10026 arg0, arg1, UNGE_EXPR, GE_EXPR);
10027 case BUILT_IN_ISLESSEQUAL:
10028 return fold_builtin_unordered_cmp (loc, fndecl,
10029 arg0, arg1, UNGT_EXPR, GT_EXPR);
10030 case BUILT_IN_ISLESSGREATER:
10031 return fold_builtin_unordered_cmp (loc, fndecl,
10032 arg0, arg1, UNEQ_EXPR, EQ_EXPR);
10033 case BUILT_IN_ISUNORDERED:
10034 return fold_builtin_unordered_cmp (loc, fndecl,
10035 arg0, arg1, UNORDERED_EXPR,
10038 /* We do the folding for va_start in the expander. */
10039 case BUILT_IN_VA_START:
10042 case BUILT_IN_SPRINTF:
10043 return fold_builtin_sprintf (loc, arg0, arg1, NULL_TREE, ignore);
10045 case BUILT_IN_OBJECT_SIZE:
10046 return fold_builtin_object_size (arg0, arg1);
10048 case BUILT_IN_PRINTF:
10049 case BUILT_IN_PRINTF_UNLOCKED:
10050 case BUILT_IN_VPRINTF:
10051 return fold_builtin_printf (loc, fndecl, arg0, arg1, ignore, fcode);
10053 case BUILT_IN_PRINTF_CHK:
10054 case BUILT_IN_VPRINTF_CHK:
10055 if (!validate_arg (arg0, INTEGER_TYPE)
10056 || TREE_SIDE_EFFECTS (arg0))
10059 return fold_builtin_printf (loc, fndecl,
10060 arg1, NULL_TREE, ignore, fcode);
10063 case BUILT_IN_FPRINTF:
10064 case BUILT_IN_FPRINTF_UNLOCKED:
10065 case BUILT_IN_VFPRINTF:
10066 return fold_builtin_fprintf (loc, fndecl, arg0, arg1, NULL_TREE,
10075 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
10076 and ARG2. IGNORE is true if the result of the function call is ignored.
10077 This function returns NULL_TREE if no simplification was possible. */
10080 fold_builtin_3 (location_t loc, tree fndecl,
10081 tree arg0, tree arg1, tree arg2, bool ignore)
10083 tree type = TREE_TYPE (TREE_TYPE (fndecl));
10084 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
10088 CASE_FLT_FN (BUILT_IN_SINCOS):
10089 return fold_builtin_sincos (loc, arg0, arg1, arg2);
10091 CASE_FLT_FN (BUILT_IN_FMA):
10092 return fold_builtin_fma (loc, arg0, arg1, arg2, type);
10095 CASE_FLT_FN (BUILT_IN_REMQUO):
10096 if (validate_arg (arg0, REAL_TYPE)
10097 && validate_arg(arg1, REAL_TYPE)
10098 && validate_arg(arg2, POINTER_TYPE))
10099 return do_mpfr_remquo (arg0, arg1, arg2);
10102 case BUILT_IN_MEMSET:
10103 return fold_builtin_memset (loc, arg0, arg1, arg2, type, ignore);
10105 case BUILT_IN_BCOPY:
10106 return fold_builtin_memory_op (loc, arg1, arg0, arg2,
10107 void_type_node, true, /*endp=*/3);
10109 case BUILT_IN_MEMCPY:
10110 return fold_builtin_memory_op (loc, arg0, arg1, arg2,
10111 type, ignore, /*endp=*/0);
10113 case BUILT_IN_MEMPCPY:
10114 return fold_builtin_memory_op (loc, arg0, arg1, arg2,
10115 type, ignore, /*endp=*/1);
10117 case BUILT_IN_MEMMOVE:
10118 return fold_builtin_memory_op (loc, arg0, arg1, arg2,
10119 type, ignore, /*endp=*/3);
10121 case BUILT_IN_STRNCAT:
10122 return fold_builtin_strncat (loc, arg0, arg1, arg2);
10124 case BUILT_IN_STRNCPY:
10125 return fold_builtin_strncpy (loc, fndecl, arg0, arg1, arg2, NULL_TREE);
10127 case BUILT_IN_STRNCMP:
10128 return fold_builtin_strncmp (loc, arg0, arg1, arg2);
10130 case BUILT_IN_MEMCHR:
10131 return fold_builtin_memchr (loc, arg0, arg1, arg2, type);
10133 case BUILT_IN_BCMP:
10134 case BUILT_IN_MEMCMP:
10135 return fold_builtin_memcmp (loc, arg0, arg1, arg2);;
10137 case BUILT_IN_SPRINTF:
10138 return fold_builtin_sprintf (loc, arg0, arg1, arg2, ignore);
10140 case BUILT_IN_SNPRINTF:
10141 return fold_builtin_snprintf (loc, arg0, arg1, arg2, NULL_TREE, ignore);
10143 case BUILT_IN_STRCPY_CHK:
10144 case BUILT_IN_STPCPY_CHK:
10145 return fold_builtin_stxcpy_chk (loc, fndecl, arg0, arg1, arg2, NULL_TREE,
10148 case BUILT_IN_STRCAT_CHK:
10149 return fold_builtin_strcat_chk (loc, fndecl, arg0, arg1, arg2);
10151 case BUILT_IN_PRINTF_CHK:
10152 case BUILT_IN_VPRINTF_CHK:
10153 if (!validate_arg (arg0, INTEGER_TYPE)
10154 || TREE_SIDE_EFFECTS (arg0))
10157 return fold_builtin_printf (loc, fndecl, arg1, arg2, ignore, fcode);
10160 case BUILT_IN_FPRINTF:
10161 case BUILT_IN_FPRINTF_UNLOCKED:
10162 case BUILT_IN_VFPRINTF:
10163 return fold_builtin_fprintf (loc, fndecl, arg0, arg1, arg2,
10166 case BUILT_IN_FPRINTF_CHK:
10167 case BUILT_IN_VFPRINTF_CHK:
10168 if (!validate_arg (arg1, INTEGER_TYPE)
10169 || TREE_SIDE_EFFECTS (arg1))
10172 return fold_builtin_fprintf (loc, fndecl, arg0, arg2, NULL_TREE,
10181 /* Fold a call to built-in function FNDECL with 4 arguments, ARG0, ARG1,
10182 ARG2, and ARG3. IGNORE is true if the result of the function call is
10183 ignored. This function returns NULL_TREE if no simplification was
10187 fold_builtin_4 (location_t loc, tree fndecl,
10188 tree arg0, tree arg1, tree arg2, tree arg3, bool ignore)
10190 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
10194 case BUILT_IN_MEMCPY_CHK:
10195 case BUILT_IN_MEMPCPY_CHK:
10196 case BUILT_IN_MEMMOVE_CHK:
10197 case BUILT_IN_MEMSET_CHK:
10198 return fold_builtin_memory_chk (loc, fndecl, arg0, arg1, arg2, arg3,
10200 DECL_FUNCTION_CODE (fndecl));
10202 case BUILT_IN_STRNCPY_CHK:
10203 return fold_builtin_strncpy_chk (loc, arg0, arg1, arg2, arg3, NULL_TREE);
10205 case BUILT_IN_STRNCAT_CHK:
10206 return fold_builtin_strncat_chk (loc, fndecl, arg0, arg1, arg2, arg3);
10208 case BUILT_IN_SNPRINTF:
10209 return fold_builtin_snprintf (loc, arg0, arg1, arg2, arg3, ignore);
10211 case BUILT_IN_FPRINTF_CHK:
10212 case BUILT_IN_VFPRINTF_CHK:
10213 if (!validate_arg (arg1, INTEGER_TYPE)
10214 || TREE_SIDE_EFFECTS (arg1))
10217 return fold_builtin_fprintf (loc, fndecl, arg0, arg2, arg3,
10227 /* Fold a call to built-in function FNDECL. ARGS is an array of NARGS
10228 arguments, where NARGS <= 4. IGNORE is true if the result of the
10229 function call is ignored. This function returns NULL_TREE if no
10230 simplification was possible. Note that this only folds builtins with
10231 fixed argument patterns. Foldings that do varargs-to-varargs
10232 transformations, or that match calls with more than 4 arguments,
10233 need to be handled with fold_builtin_varargs instead. */
10235 #define MAX_ARGS_TO_FOLD_BUILTIN 4
10238 fold_builtin_n (location_t loc, tree fndecl, tree *args, int nargs, bool ignore)
10240 tree ret = NULL_TREE;
10245 ret = fold_builtin_0 (loc, fndecl, ignore);
10248 ret = fold_builtin_1 (loc, fndecl, args[0], ignore);
10251 ret = fold_builtin_2 (loc, fndecl, args[0], args[1], ignore);
10254 ret = fold_builtin_3 (loc, fndecl, args[0], args[1], args[2], ignore);
10257 ret = fold_builtin_4 (loc, fndecl, args[0], args[1], args[2], args[3],
10265 ret = build1 (NOP_EXPR, TREE_TYPE (ret), ret);
10266 SET_EXPR_LOCATION (ret, loc);
10267 TREE_NO_WARNING (ret) = 1;
10273 /* Builtins with folding operations that operate on "..." arguments
10274 need special handling; we need to store the arguments in a convenient
10275 data structure before attempting any folding. Fortunately there are
10276 only a few builtins that fall into this category. FNDECL is the
10277 function, EXP is the CALL_EXPR for the call, and IGNORE is true if the
10278 result of the function call is ignored. */
10281 fold_builtin_varargs (location_t loc, tree fndecl, tree exp,
10282 bool ignore ATTRIBUTE_UNUSED)
10284 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
10285 tree ret = NULL_TREE;
10289 case BUILT_IN_SPRINTF_CHK:
10290 case BUILT_IN_VSPRINTF_CHK:
10291 ret = fold_builtin_sprintf_chk (loc, exp, fcode);
10294 case BUILT_IN_SNPRINTF_CHK:
10295 case BUILT_IN_VSNPRINTF_CHK:
10296 ret = fold_builtin_snprintf_chk (loc, exp, NULL_TREE, fcode);
10299 case BUILT_IN_FPCLASSIFY:
10300 ret = fold_builtin_fpclassify (loc, exp);
10308 ret = build1 (NOP_EXPR, TREE_TYPE (ret), ret);
10309 SET_EXPR_LOCATION (ret, loc);
10310 TREE_NO_WARNING (ret) = 1;
10316 /* Return true if FNDECL shouldn't be folded right now.
10317 If a built-in function has an inline attribute always_inline
10318 wrapper, defer folding it after always_inline functions have
10319 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
10320 might not be performed. */
10323 avoid_folding_inline_builtin (tree fndecl)
10325 return (DECL_DECLARED_INLINE_P (fndecl)
10326 && DECL_DISREGARD_INLINE_LIMITS (fndecl)
10328 && !cfun->always_inline_functions_inlined
10329 && lookup_attribute ("always_inline", DECL_ATTRIBUTES (fndecl)));
10332 /* A wrapper function for builtin folding that prevents warnings for
10333 "statement without effect" and the like, caused by removing the
10334 call node earlier than the warning is generated. */
10337 fold_call_expr (location_t loc, tree exp, bool ignore)
10339 tree ret = NULL_TREE;
10340 tree fndecl = get_callee_fndecl (exp);
10342 && TREE_CODE (fndecl) == FUNCTION_DECL
10343 && DECL_BUILT_IN (fndecl)
10344 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
10345 yet. Defer folding until we see all the arguments
10346 (after inlining). */
10347 && !CALL_EXPR_VA_ARG_PACK (exp))
10349 int nargs = call_expr_nargs (exp);
10351 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
10352 instead last argument is __builtin_va_arg_pack (). Defer folding
10353 even in that case, until arguments are finalized. */
10354 if (nargs && TREE_CODE (CALL_EXPR_ARG (exp, nargs - 1)) == CALL_EXPR)
10356 tree fndecl2 = get_callee_fndecl (CALL_EXPR_ARG (exp, nargs - 1));
10358 && TREE_CODE (fndecl2) == FUNCTION_DECL
10359 && DECL_BUILT_IN_CLASS (fndecl2) == BUILT_IN_NORMAL
10360 && DECL_FUNCTION_CODE (fndecl2) == BUILT_IN_VA_ARG_PACK)
10364 if (avoid_folding_inline_builtin (fndecl))
10367 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
10368 return targetm.fold_builtin (fndecl, call_expr_nargs (exp),
10369 CALL_EXPR_ARGP (exp), ignore);
10372 if (nargs <= MAX_ARGS_TO_FOLD_BUILTIN)
10374 tree *args = CALL_EXPR_ARGP (exp);
10375 ret = fold_builtin_n (loc, fndecl, args, nargs, ignore);
10378 ret = fold_builtin_varargs (loc, fndecl, exp, ignore);
10386 /* Conveniently construct a function call expression. FNDECL names the
10387 function to be called and N arguments are passed in the array
10391 build_call_expr_loc_array (location_t loc, tree fndecl, int n, tree *argarray)
10393 tree fntype = TREE_TYPE (fndecl);
10394 tree fn = build1 (ADDR_EXPR, build_pointer_type (fntype), fndecl);
10396 return fold_builtin_call_array (loc, TREE_TYPE (fntype), fn, n, argarray);
10399 /* Conveniently construct a function call expression. FNDECL names the
10400 function to be called and the arguments are passed in the vector
10404 build_call_expr_loc_vec (location_t loc, tree fndecl, VEC(tree,gc) *vec)
10406 return build_call_expr_loc_array (loc, fndecl, VEC_length (tree, vec),
10407 VEC_address (tree, vec));
10411 /* Conveniently construct a function call expression. FNDECL names the
10412 function to be called, N is the number of arguments, and the "..."
10413 parameters are the argument expressions. */
10416 build_call_expr_loc (location_t loc, tree fndecl, int n, ...)
10419 tree *argarray = XALLOCAVEC (tree, n);
10423 for (i = 0; i < n; i++)
10424 argarray[i] = va_arg (ap, tree);
10426 return build_call_expr_loc_array (loc, fndecl, n, argarray);
10429 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
10430 varargs macros aren't supported by all bootstrap compilers. */
10433 build_call_expr (tree fndecl, int n, ...)
10436 tree *argarray = XALLOCAVEC (tree, n);
10440 for (i = 0; i < n; i++)
10441 argarray[i] = va_arg (ap, tree);
10443 return build_call_expr_loc_array (UNKNOWN_LOCATION, fndecl, n, argarray);
10446 /* Construct a CALL_EXPR with type TYPE with FN as the function expression.
10447 N arguments are passed in the array ARGARRAY. */
10450 fold_builtin_call_array (location_t loc, tree type,
10455 tree ret = NULL_TREE;
10458 if (TREE_CODE (fn) == ADDR_EXPR)
10460 tree fndecl = TREE_OPERAND (fn, 0);
10461 if (TREE_CODE (fndecl) == FUNCTION_DECL
10462 && DECL_BUILT_IN (fndecl))
10464 /* If last argument is __builtin_va_arg_pack (), arguments to this
10465 function are not finalized yet. Defer folding until they are. */
10466 if (n && TREE_CODE (argarray[n - 1]) == CALL_EXPR)
10468 tree fndecl2 = get_callee_fndecl (argarray[n - 1]);
10470 && TREE_CODE (fndecl2) == FUNCTION_DECL
10471 && DECL_BUILT_IN_CLASS (fndecl2) == BUILT_IN_NORMAL
10472 && DECL_FUNCTION_CODE (fndecl2) == BUILT_IN_VA_ARG_PACK)
10473 return build_call_array_loc (loc, type, fn, n, argarray);
10475 if (avoid_folding_inline_builtin (fndecl))
10476 return build_call_array_loc (loc, type, fn, n, argarray);
10477 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
10479 ret = targetm.fold_builtin (fndecl, n, argarray, false);
10483 return build_call_array_loc (loc, type, fn, n, argarray);
10485 else if (n <= MAX_ARGS_TO_FOLD_BUILTIN)
10487 /* First try the transformations that don't require consing up
10489 ret = fold_builtin_n (loc, fndecl, argarray, n, false);
10494 /* If we got this far, we need to build an exp. */
10495 exp = build_call_array_loc (loc, type, fn, n, argarray);
10496 ret = fold_builtin_varargs (loc, fndecl, exp, false);
10497 return ret ? ret : exp;
10501 return build_call_array_loc (loc, type, fn, n, argarray);
10504 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
10505 list ARGS along with N new arguments in NEWARGS. SKIP is the number
10506 of arguments in ARGS to be omitted. OLDNARGS is the number of
10507 elements in ARGS. */
10510 rewrite_call_expr_valist (location_t loc, int oldnargs, tree *args,
10511 int skip, tree fndecl, int n, va_list newargs)
10513 int nargs = oldnargs - skip + n;
10520 buffer = XALLOCAVEC (tree, nargs);
10521 for (i = 0; i < n; i++)
10522 buffer[i] = va_arg (newargs, tree);
10523 for (j = skip; j < oldnargs; j++, i++)
10524 buffer[i] = args[j];
10527 buffer = args + skip;
10529 return build_call_expr_loc_array (loc, fndecl, nargs, buffer);
10532 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
10533 list ARGS along with N new arguments specified as the "..."
10534 parameters. SKIP is the number of arguments in ARGS to be omitted.
10535 OLDNARGS is the number of elements in ARGS. */
10538 rewrite_call_expr_array (location_t loc, int oldnargs, tree *args,
10539 int skip, tree fndecl, int n, ...)
10545 t = rewrite_call_expr_valist (loc, oldnargs, args, skip, fndecl, n, ap);
10551 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
10552 along with N new arguments specified as the "..." parameters. SKIP
10553 is the number of arguments in EXP to be omitted. This function is used
10554 to do varargs-to-varargs transformations. */
10557 rewrite_call_expr (location_t loc, tree exp, int skip, tree fndecl, int n, ...)
10563 t = rewrite_call_expr_valist (loc, call_expr_nargs (exp),
10564 CALL_EXPR_ARGP (exp), skip, fndecl, n, ap);
10570 /* Validate a single argument ARG against a tree code CODE representing
10574 validate_arg (const_tree arg, enum tree_code code)
10578 else if (code == POINTER_TYPE)
10579 return POINTER_TYPE_P (TREE_TYPE (arg));
10580 else if (code == INTEGER_TYPE)
10581 return INTEGRAL_TYPE_P (TREE_TYPE (arg));
10582 return code == TREE_CODE (TREE_TYPE (arg));
10585 /* This function validates the types of a function call argument list
10586 against a specified list of tree_codes. If the last specifier is a 0,
10587 that represents an ellipses, otherwise the last specifier must be a
10590 This is the GIMPLE version of validate_arglist. Eventually we want to
10591 completely convert builtins.c to work from GIMPLEs and the tree based
10592 validate_arglist will then be removed. */
10595 validate_gimple_arglist (const_gimple call, ...)
10597 enum tree_code code;
10603 va_start (ap, call);
10608 code = (enum tree_code) va_arg (ap, int);
10612 /* This signifies an ellipses, any further arguments are all ok. */
10616 /* This signifies an endlink, if no arguments remain, return
10617 true, otherwise return false. */
10618 res = (i == gimple_call_num_args (call));
10621 /* If no parameters remain or the parameter's code does not
10622 match the specified code, return false. Otherwise continue
10623 checking any remaining arguments. */
10624 arg = gimple_call_arg (call, i++);
10625 if (!validate_arg (arg, code))
10632 /* We need gotos here since we can only have one VA_CLOSE in a
10640 /* This function validates the types of a function call argument list
10641 against a specified list of tree_codes. If the last specifier is a 0,
10642 that represents an ellipses, otherwise the last specifier must be a
10646 validate_arglist (const_tree callexpr, ...)
10648 enum tree_code code;
10651 const_call_expr_arg_iterator iter;
10654 va_start (ap, callexpr);
10655 init_const_call_expr_arg_iterator (callexpr, &iter);
10659 code = (enum tree_code) va_arg (ap, int);
10663 /* This signifies an ellipses, any further arguments are all ok. */
10667 /* This signifies an endlink, if no arguments remain, return
10668 true, otherwise return false. */
10669 res = !more_const_call_expr_args_p (&iter);
10672 /* If no parameters remain or the parameter's code does not
10673 match the specified code, return false. Otherwise continue
10674 checking any remaining arguments. */
10675 arg = next_const_call_expr_arg (&iter);
10676 if (!validate_arg (arg, code))
10683 /* We need gotos here since we can only have one VA_CLOSE in a
10691 /* Default target-specific builtin expander that does nothing. */
10694 default_expand_builtin (tree exp ATTRIBUTE_UNUSED,
10695 rtx target ATTRIBUTE_UNUSED,
10696 rtx subtarget ATTRIBUTE_UNUSED,
10697 enum machine_mode mode ATTRIBUTE_UNUSED,
10698 int ignore ATTRIBUTE_UNUSED)
10703 /* Returns true is EXP represents data that would potentially reside
10704 in a readonly section. */
10707 readonly_data_expr (tree exp)
10711 if (TREE_CODE (exp) != ADDR_EXPR)
10714 exp = get_base_address (TREE_OPERAND (exp, 0));
10718 /* Make sure we call decl_readonly_section only for trees it
10719 can handle (since it returns true for everything it doesn't
10721 if (TREE_CODE (exp) == STRING_CST
10722 || TREE_CODE (exp) == CONSTRUCTOR
10723 || (TREE_CODE (exp) == VAR_DECL && TREE_STATIC (exp)))
10724 return decl_readonly_section (exp, 0);
10729 /* Simplify a call to the strstr builtin. S1 and S2 are the arguments
10730 to the call, and TYPE is its return type.
10732 Return NULL_TREE if no simplification was possible, otherwise return the
10733 simplified form of the call as a tree.
10735 The simplified form may be a constant or other expression which
10736 computes the same value, but in a more efficient manner (including
10737 calls to other builtin functions).
10739 The call may contain arguments which need to be evaluated, but
10740 which are not useful to determine the result of the call. In
10741 this case we return a chain of COMPOUND_EXPRs. The LHS of each
10742 COMPOUND_EXPR will be an argument which must be evaluated.
10743 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
10744 COMPOUND_EXPR in the chain will contain the tree for the simplified
10745 form of the builtin function call. */
10748 fold_builtin_strstr (location_t loc, tree s1, tree s2, tree type)
10750 if (!validate_arg (s1, POINTER_TYPE)
10751 || !validate_arg (s2, POINTER_TYPE))
10756 const char *p1, *p2;
10758 p2 = c_getstr (s2);
10762 p1 = c_getstr (s1);
10765 const char *r = strstr (p1, p2);
10769 return build_int_cst (TREE_TYPE (s1), 0);
10771 /* Return an offset into the constant string argument. */
10772 tem = fold_build_pointer_plus_hwi_loc (loc, s1, r - p1);
10773 return fold_convert_loc (loc, type, tem);
10776 /* The argument is const char *, and the result is char *, so we need
10777 a type conversion here to avoid a warning. */
10779 return fold_convert_loc (loc, type, s1);
10784 fn = implicit_built_in_decls[BUILT_IN_STRCHR];
10788 /* New argument list transforming strstr(s1, s2) to
10789 strchr(s1, s2[0]). */
10790 return build_call_expr_loc (loc, fn, 2, s1,
10791 build_int_cst (integer_type_node, p2[0]));
10795 /* Simplify a call to the strchr builtin. S1 and S2 are the arguments to
10796 the call, and TYPE is its return type.
10798 Return NULL_TREE if no simplification was possible, otherwise return the
10799 simplified form of the call as a tree.
10801 The simplified form may be a constant or other expression which
10802 computes the same value, but in a more efficient manner (including
10803 calls to other builtin functions).
10805 The call may contain arguments which need to be evaluated, but
10806 which are not useful to determine the result of the call. In
10807 this case we return a chain of COMPOUND_EXPRs. The LHS of each
10808 COMPOUND_EXPR will be an argument which must be evaluated.
10809 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
10810 COMPOUND_EXPR in the chain will contain the tree for the simplified
10811 form of the builtin function call. */
10814 fold_builtin_strchr (location_t loc, tree s1, tree s2, tree type)
10816 if (!validate_arg (s1, POINTER_TYPE)
10817 || !validate_arg (s2, INTEGER_TYPE))
10823 if (TREE_CODE (s2) != INTEGER_CST)
10826 p1 = c_getstr (s1);
10833 if (target_char_cast (s2, &c))
10836 r = strchr (p1, c);
10839 return build_int_cst (TREE_TYPE (s1), 0);
10841 /* Return an offset into the constant string argument. */
10842 tem = fold_build_pointer_plus_hwi_loc (loc, s1, r - p1);
10843 return fold_convert_loc (loc, type, tem);
10849 /* Simplify a call to the strrchr builtin. S1 and S2 are the arguments to
10850 the call, and TYPE is its return type.
10852 Return NULL_TREE if no simplification was possible, otherwise return the
10853 simplified form of the call as a tree.
10855 The simplified form may be a constant or other expression which
10856 computes the same value, but in a more efficient manner (including
10857 calls to other builtin functions).
10859 The call may contain arguments which need to be evaluated, but
10860 which are not useful to determine the result of the call. In
10861 this case we return a chain of COMPOUND_EXPRs. The LHS of each
10862 COMPOUND_EXPR will be an argument which must be evaluated.
10863 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
10864 COMPOUND_EXPR in the chain will contain the tree for the simplified
10865 form of the builtin function call. */
10868 fold_builtin_strrchr (location_t loc, tree s1, tree s2, tree type)
10870 if (!validate_arg (s1, POINTER_TYPE)
10871 || !validate_arg (s2, INTEGER_TYPE))
10878 if (TREE_CODE (s2) != INTEGER_CST)
10881 p1 = c_getstr (s1);
10888 if (target_char_cast (s2, &c))
10891 r = strrchr (p1, c);
10894 return build_int_cst (TREE_TYPE (s1), 0);
10896 /* Return an offset into the constant string argument. */
10897 tem = fold_build_pointer_plus_hwi_loc (loc, s1, r - p1);
10898 return fold_convert_loc (loc, type, tem);
10901 if (! integer_zerop (s2))
10904 fn = implicit_built_in_decls[BUILT_IN_STRCHR];
10908 /* Transform strrchr(s1, '\0') to strchr(s1, '\0'). */
10909 return build_call_expr_loc (loc, fn, 2, s1, s2);
10913 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
10914 to the call, and TYPE is its return type.
10916 Return NULL_TREE if no simplification was possible, otherwise return the
10917 simplified form of the call as a tree.
10919 The simplified form may be a constant or other expression which
10920 computes the same value, but in a more efficient manner (including
10921 calls to other builtin functions).
10923 The call may contain arguments which need to be evaluated, but
10924 which are not useful to determine the result of the call. In
10925 this case we return a chain of COMPOUND_EXPRs. The LHS of each
10926 COMPOUND_EXPR will be an argument which must be evaluated.
10927 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
10928 COMPOUND_EXPR in the chain will contain the tree for the simplified
10929 form of the builtin function call. */
10932 fold_builtin_strpbrk (location_t loc, tree s1, tree s2, tree type)
10934 if (!validate_arg (s1, POINTER_TYPE)
10935 || !validate_arg (s2, POINTER_TYPE))
10940 const char *p1, *p2;
10942 p2 = c_getstr (s2);
10946 p1 = c_getstr (s1);
10949 const char *r = strpbrk (p1, p2);
10953 return build_int_cst (TREE_TYPE (s1), 0);
10955 /* Return an offset into the constant string argument. */
10956 tem = fold_build_pointer_plus_hwi_loc (loc, s1, r - p1);
10957 return fold_convert_loc (loc, type, tem);
10961 /* strpbrk(x, "") == NULL.
10962 Evaluate and ignore s1 in case it had side-effects. */
10963 return omit_one_operand_loc (loc, TREE_TYPE (s1), integer_zero_node, s1);
10966 return NULL_TREE; /* Really call strpbrk. */
10968 fn = implicit_built_in_decls[BUILT_IN_STRCHR];
10972 /* New argument list transforming strpbrk(s1, s2) to
10973 strchr(s1, s2[0]). */
10974 return build_call_expr_loc (loc, fn, 2, s1,
10975 build_int_cst (integer_type_node, p2[0]));
10979 /* Simplify a call to the strcat builtin. DST and SRC are the arguments
10982 Return NULL_TREE if no simplification was possible, otherwise return the
10983 simplified form of the call as a tree.
10985 The simplified form may be a constant or other expression which
10986 computes the same value, but in a more efficient manner (including
10987 calls to other builtin functions).
10989 The call may contain arguments which need to be evaluated, but
10990 which are not useful to determine the result of the call. In
10991 this case we return a chain of COMPOUND_EXPRs. The LHS of each
10992 COMPOUND_EXPR will be an argument which must be evaluated.
10993 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
10994 COMPOUND_EXPR in the chain will contain the tree for the simplified
10995 form of the builtin function call. */
10998 fold_builtin_strcat (location_t loc ATTRIBUTE_UNUSED, tree dst, tree src)
11000 if (!validate_arg (dst, POINTER_TYPE)
11001 || !validate_arg (src, POINTER_TYPE))
11005 const char *p = c_getstr (src);
11007 /* If the string length is zero, return the dst parameter. */
11008 if (p && *p == '\0')
11011 if (optimize_insn_for_speed_p ())
11013 /* See if we can store by pieces into (dst + strlen(dst)). */
11015 tree strlen_fn = implicit_built_in_decls[BUILT_IN_STRLEN];
11016 tree strcpy_fn = implicit_built_in_decls[BUILT_IN_STRCPY];
11018 if (!strlen_fn || !strcpy_fn)
11021 /* If we don't have a movstr we don't want to emit an strcpy
11022 call. We have to do that if the length of the source string
11023 isn't computable (in that case we can use memcpy probably
11024 later expanding to a sequence of mov instructions). If we
11025 have movstr instructions we can emit strcpy calls. */
11028 tree len = c_strlen (src, 1);
11029 if (! len || TREE_SIDE_EFFECTS (len))
11033 /* Stabilize the argument list. */
11034 dst = builtin_save_expr (dst);
11036 /* Create strlen (dst). */
11037 newdst = build_call_expr_loc (loc, strlen_fn, 1, dst);
11038 /* Create (dst p+ strlen (dst)). */
11040 newdst = fold_build_pointer_plus_loc (loc, dst, newdst);
11041 newdst = builtin_save_expr (newdst);
11043 call = build_call_expr_loc (loc, strcpy_fn, 2, newdst, src);
11044 return build2 (COMPOUND_EXPR, TREE_TYPE (dst), call, dst);
11050 /* Simplify a call to the strncat builtin. DST, SRC, and LEN are the
11051 arguments to the call.
11053 Return NULL_TREE if no simplification was possible, otherwise return the
11054 simplified form of the call as a tree.
11056 The simplified form may be a constant or other expression which
11057 computes the same value, but in a more efficient manner (including
11058 calls to other builtin functions).
11060 The call may contain arguments which need to be evaluated, but
11061 which are not useful to determine the result of the call. In
11062 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11063 COMPOUND_EXPR will be an argument which must be evaluated.
11064 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11065 COMPOUND_EXPR in the chain will contain the tree for the simplified
11066 form of the builtin function call. */
11069 fold_builtin_strncat (location_t loc, tree dst, tree src, tree len)
11071 if (!validate_arg (dst, POINTER_TYPE)
11072 || !validate_arg (src, POINTER_TYPE)
11073 || !validate_arg (len, INTEGER_TYPE))
11077 const char *p = c_getstr (src);
11079 /* If the requested length is zero, or the src parameter string
11080 length is zero, return the dst parameter. */
11081 if (integer_zerop (len) || (p && *p == '\0'))
11082 return omit_two_operands_loc (loc, TREE_TYPE (dst), dst, src, len);
11084 /* If the requested len is greater than or equal to the string
11085 length, call strcat. */
11086 if (TREE_CODE (len) == INTEGER_CST && p
11087 && compare_tree_int (len, strlen (p)) >= 0)
11089 tree fn = implicit_built_in_decls[BUILT_IN_STRCAT];
11091 /* If the replacement _DECL isn't initialized, don't do the
11096 return build_call_expr_loc (loc, fn, 2, dst, src);
11102 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
11105 Return NULL_TREE if no simplification was possible, otherwise return the
11106 simplified form of the call as a tree.
11108 The simplified form may be a constant or other expression which
11109 computes the same value, but in a more efficient manner (including
11110 calls to other builtin functions).
11112 The call may contain arguments which need to be evaluated, but
11113 which are not useful to determine the result of the call. In
11114 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11115 COMPOUND_EXPR will be an argument which must be evaluated.
11116 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11117 COMPOUND_EXPR in the chain will contain the tree for the simplified
11118 form of the builtin function call. */
11121 fold_builtin_strspn (location_t loc, tree s1, tree s2)
11123 if (!validate_arg (s1, POINTER_TYPE)
11124 || !validate_arg (s2, POINTER_TYPE))
11128 const char *p1 = c_getstr (s1), *p2 = c_getstr (s2);
11130 /* If both arguments are constants, evaluate at compile-time. */
11133 const size_t r = strspn (p1, p2);
11134 return size_int (r);
11137 /* If either argument is "", return NULL_TREE. */
11138 if ((p1 && *p1 == '\0') || (p2 && *p2 == '\0'))
11139 /* Evaluate and ignore both arguments in case either one has
11141 return omit_two_operands_loc (loc, size_type_node, size_zero_node,
11147 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
11150 Return NULL_TREE if no simplification was possible, otherwise return the
11151 simplified form of the call as a tree.
11153 The simplified form may be a constant or other expression which
11154 computes the same value, but in a more efficient manner (including
11155 calls to other builtin functions).
11157 The call may contain arguments which need to be evaluated, but
11158 which are not useful to determine the result of the call. In
11159 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11160 COMPOUND_EXPR will be an argument which must be evaluated.
11161 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11162 COMPOUND_EXPR in the chain will contain the tree for the simplified
11163 form of the builtin function call. */
11166 fold_builtin_strcspn (location_t loc, tree s1, tree s2)
11168 if (!validate_arg (s1, POINTER_TYPE)
11169 || !validate_arg (s2, POINTER_TYPE))
11173 const char *p1 = c_getstr (s1), *p2 = c_getstr (s2);
11175 /* If both arguments are constants, evaluate at compile-time. */
11178 const size_t r = strcspn (p1, p2);
11179 return size_int (r);
11182 /* If the first argument is "", return NULL_TREE. */
11183 if (p1 && *p1 == '\0')
11185 /* Evaluate and ignore argument s2 in case it has
11187 return omit_one_operand_loc (loc, size_type_node,
11188 size_zero_node, s2);
11191 /* If the second argument is "", return __builtin_strlen(s1). */
11192 if (p2 && *p2 == '\0')
11194 tree fn = implicit_built_in_decls[BUILT_IN_STRLEN];
11196 /* If the replacement _DECL isn't initialized, don't do the
11201 return build_call_expr_loc (loc, fn, 1, s1);
11207 /* Fold a call to the fputs builtin. ARG0 and ARG1 are the arguments
11208 to the call. IGNORE is true if the value returned
11209 by the builtin will be ignored. UNLOCKED is true is true if this
11210 actually a call to fputs_unlocked. If LEN in non-NULL, it represents
11211 the known length of the string. Return NULL_TREE if no simplification
11215 fold_builtin_fputs (location_t loc, tree arg0, tree arg1,
11216 bool ignore, bool unlocked, tree len)
11218 /* If we're using an unlocked function, assume the other unlocked
11219 functions exist explicitly. */
11220 tree const fn_fputc = unlocked ? built_in_decls[BUILT_IN_FPUTC_UNLOCKED]
11221 : implicit_built_in_decls[BUILT_IN_FPUTC];
11222 tree const fn_fwrite = unlocked ? built_in_decls[BUILT_IN_FWRITE_UNLOCKED]
11223 : implicit_built_in_decls[BUILT_IN_FWRITE];
11225 /* If the return value is used, don't do the transformation. */
11229 /* Verify the arguments in the original call. */
11230 if (!validate_arg (arg0, POINTER_TYPE)
11231 || !validate_arg (arg1, POINTER_TYPE))
11235 len = c_strlen (arg0, 0);
11237 /* Get the length of the string passed to fputs. If the length
11238 can't be determined, punt. */
11240 || TREE_CODE (len) != INTEGER_CST)
11243 switch (compare_tree_int (len, 1))
11245 case -1: /* length is 0, delete the call entirely . */
11246 return omit_one_operand_loc (loc, integer_type_node,
11247 integer_zero_node, arg1);;
11249 case 0: /* length is 1, call fputc. */
11251 const char *p = c_getstr (arg0);
11256 return build_call_expr_loc (loc, fn_fputc, 2,
11258 (integer_type_node, p[0]), arg1);
11264 case 1: /* length is greater than 1, call fwrite. */
11266 /* If optimizing for size keep fputs. */
11267 if (optimize_function_for_size_p (cfun))
11269 /* New argument list transforming fputs(string, stream) to
11270 fwrite(string, 1, len, stream). */
11272 return build_call_expr_loc (loc, fn_fwrite, 4, arg0,
11273 size_one_node, len, arg1);
11278 gcc_unreachable ();
11283 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
11284 produced. False otherwise. This is done so that we don't output the error
11285 or warning twice or three times. */
11288 fold_builtin_next_arg (tree exp, bool va_start_p)
11290 tree fntype = TREE_TYPE (current_function_decl);
11291 int nargs = call_expr_nargs (exp);
11294 if (!stdarg_p (fntype))
11296 error ("%<va_start%> used in function with fixed args");
11302 if (va_start_p && (nargs != 2))
11304 error ("wrong number of arguments to function %<va_start%>");
11307 arg = CALL_EXPR_ARG (exp, 1);
11309 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
11310 when we checked the arguments and if needed issued a warning. */
11315 /* Evidently an out of date version of <stdarg.h>; can't validate
11316 va_start's second argument, but can still work as intended. */
11317 warning (0, "%<__builtin_next_arg%> called without an argument");
11320 else if (nargs > 1)
11322 error ("wrong number of arguments to function %<__builtin_next_arg%>");
11325 arg = CALL_EXPR_ARG (exp, 0);
11328 if (TREE_CODE (arg) == SSA_NAME)
11329 arg = SSA_NAME_VAR (arg);
11331 /* We destructively modify the call to be __builtin_va_start (ap, 0)
11332 or __builtin_next_arg (0) the first time we see it, after checking
11333 the arguments and if needed issuing a warning. */
11334 if (!integer_zerop (arg))
11336 tree last_parm = tree_last (DECL_ARGUMENTS (current_function_decl));
11338 /* Strip off all nops for the sake of the comparison. This
11339 is not quite the same as STRIP_NOPS. It does more.
11340 We must also strip off INDIRECT_EXPR for C++ reference
11342 while (CONVERT_EXPR_P (arg)
11343 || TREE_CODE (arg) == INDIRECT_REF)
11344 arg = TREE_OPERAND (arg, 0);
11345 if (arg != last_parm)
11347 /* FIXME: Sometimes with the tree optimizers we can get the
11348 not the last argument even though the user used the last
11349 argument. We just warn and set the arg to be the last
11350 argument so that we will get wrong-code because of
11352 warning (0, "second parameter of %<va_start%> not last named argument");
11355 /* Undefined by C99 7.15.1.4p4 (va_start):
11356 "If the parameter parmN is declared with the register storage
11357 class, with a function or array type, or with a type that is
11358 not compatible with the type that results after application of
11359 the default argument promotions, the behavior is undefined."
11361 else if (DECL_REGISTER (arg))
11362 warning (0, "undefined behaviour when second parameter of "
11363 "%<va_start%> is declared with %<register%> storage");
11365 /* We want to verify the second parameter just once before the tree
11366 optimizers are run and then avoid keeping it in the tree,
11367 as otherwise we could warn even for correct code like:
11368 void foo (int i, ...)
11369 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
11371 CALL_EXPR_ARG (exp, 1) = integer_zero_node;
11373 CALL_EXPR_ARG (exp, 0) = integer_zero_node;
11379 /* Simplify a call to the sprintf builtin with arguments DEST, FMT, and ORIG.
11380 ORIG may be null if this is a 2-argument call. We don't attempt to
11381 simplify calls with more than 3 arguments.
11383 Return NULL_TREE if no simplification was possible, otherwise return the
11384 simplified form of the call as a tree. If IGNORED is true, it means that
11385 the caller does not use the returned value of the function. */
11388 fold_builtin_sprintf (location_t loc, tree dest, tree fmt,
11389 tree orig, int ignored)
11392 const char *fmt_str = NULL;
11394 /* Verify the required arguments in the original call. We deal with two
11395 types of sprintf() calls: 'sprintf (str, fmt)' and
11396 'sprintf (dest, "%s", orig)'. */
11397 if (!validate_arg (dest, POINTER_TYPE)
11398 || !validate_arg (fmt, POINTER_TYPE))
11400 if (orig && !validate_arg (orig, POINTER_TYPE))
11403 /* Check whether the format is a literal string constant. */
11404 fmt_str = c_getstr (fmt);
11405 if (fmt_str == NULL)
11409 retval = NULL_TREE;
11411 if (!init_target_chars ())
11414 /* If the format doesn't contain % args or %%, use strcpy. */
11415 if (strchr (fmt_str, target_percent) == NULL)
11417 tree fn = implicit_built_in_decls[BUILT_IN_STRCPY];
11422 /* Don't optimize sprintf (buf, "abc", ptr++). */
11426 /* Convert sprintf (str, fmt) into strcpy (str, fmt) when
11427 'format' is known to contain no % formats. */
11428 call = build_call_expr_loc (loc, fn, 2, dest, fmt);
11430 retval = build_int_cst (integer_type_node, strlen (fmt_str));
11433 /* If the format is "%s", use strcpy if the result isn't used. */
11434 else if (fmt_str && strcmp (fmt_str, target_percent_s) == 0)
11437 fn = implicit_built_in_decls[BUILT_IN_STRCPY];
11442 /* Don't crash on sprintf (str1, "%s"). */
11446 /* Convert sprintf (str1, "%s", str2) into strcpy (str1, str2). */
11449 retval = c_strlen (orig, 1);
11450 if (!retval || TREE_CODE (retval) != INTEGER_CST)
11453 call = build_call_expr_loc (loc, fn, 2, dest, orig);
11456 if (call && retval)
11458 retval = fold_convert_loc
11459 (loc, TREE_TYPE (TREE_TYPE (implicit_built_in_decls[BUILT_IN_SPRINTF])),
11461 return build2 (COMPOUND_EXPR, TREE_TYPE (retval), call, retval);
11467 /* Simplify a call to the snprintf builtin with arguments DEST, DESTSIZE,
11468 FMT, and ORIG. ORIG may be null if this is a 3-argument call. We don't
11469 attempt to simplify calls with more than 4 arguments.
11471 Return NULL_TREE if no simplification was possible, otherwise return the
11472 simplified form of the call as a tree. If IGNORED is true, it means that
11473 the caller does not use the returned value of the function. */
11476 fold_builtin_snprintf (location_t loc, tree dest, tree destsize, tree fmt,
11477 tree orig, int ignored)
11480 const char *fmt_str = NULL;
11481 unsigned HOST_WIDE_INT destlen;
11483 /* Verify the required arguments in the original call. We deal with two
11484 types of snprintf() calls: 'snprintf (str, cst, fmt)' and
11485 'snprintf (dest, cst, "%s", orig)'. */
11486 if (!validate_arg (dest, POINTER_TYPE)
11487 || !validate_arg (destsize, INTEGER_TYPE)
11488 || !validate_arg (fmt, POINTER_TYPE))
11490 if (orig && !validate_arg (orig, POINTER_TYPE))
11493 if (!host_integerp (destsize, 1))
11496 /* Check whether the format is a literal string constant. */
11497 fmt_str = c_getstr (fmt);
11498 if (fmt_str == NULL)
11502 retval = NULL_TREE;
11504 if (!init_target_chars ())
11507 destlen = tree_low_cst (destsize, 1);
11509 /* If the format doesn't contain % args or %%, use strcpy. */
11510 if (strchr (fmt_str, target_percent) == NULL)
11512 tree fn = implicit_built_in_decls[BUILT_IN_STRCPY];
11513 size_t len = strlen (fmt_str);
11515 /* Don't optimize snprintf (buf, 4, "abc", ptr++). */
11519 /* We could expand this as
11520 memcpy (str, fmt, cst - 1); str[cst - 1] = '\0';
11522 memcpy (str, fmt_with_nul_at_cstm1, cst);
11523 but in the former case that might increase code size
11524 and in the latter case grow .rodata section too much.
11525 So punt for now. */
11526 if (len >= destlen)
11532 /* Convert snprintf (str, cst, fmt) into strcpy (str, fmt) when
11533 'format' is known to contain no % formats and
11534 strlen (fmt) < cst. */
11535 call = build_call_expr_loc (loc, fn, 2, dest, fmt);
11538 retval = build_int_cst (integer_type_node, strlen (fmt_str));
11541 /* If the format is "%s", use strcpy if the result isn't used. */
11542 else if (fmt_str && strcmp (fmt_str, target_percent_s) == 0)
11544 tree fn = implicit_built_in_decls[BUILT_IN_STRCPY];
11545 unsigned HOST_WIDE_INT origlen;
11547 /* Don't crash on snprintf (str1, cst, "%s"). */
11551 retval = c_strlen (orig, 1);
11552 if (!retval || !host_integerp (retval, 1))
11555 origlen = tree_low_cst (retval, 1);
11556 /* We could expand this as
11557 memcpy (str1, str2, cst - 1); str1[cst - 1] = '\0';
11559 memcpy (str1, str2_with_nul_at_cstm1, cst);
11560 but in the former case that might increase code size
11561 and in the latter case grow .rodata section too much.
11562 So punt for now. */
11563 if (origlen >= destlen)
11566 /* Convert snprintf (str1, cst, "%s", str2) into
11567 strcpy (str1, str2) if strlen (str2) < cst. */
11571 call = build_call_expr_loc (loc, fn, 2, dest, orig);
11574 retval = NULL_TREE;
11577 if (call && retval)
11579 tree fn = built_in_decls[BUILT_IN_SNPRINTF];
11580 retval = fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fn)), retval);
11581 return build2 (COMPOUND_EXPR, TREE_TYPE (retval), call, retval);
11587 /* Expand a call EXP to __builtin_object_size. */
11590 expand_builtin_object_size (tree exp)
11593 int object_size_type;
11594 tree fndecl = get_callee_fndecl (exp);
11596 if (!validate_arglist (exp, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
11598 error ("%Kfirst argument of %D must be a pointer, second integer constant",
11600 expand_builtin_trap ();
11604 ost = CALL_EXPR_ARG (exp, 1);
11607 if (TREE_CODE (ost) != INTEGER_CST
11608 || tree_int_cst_sgn (ost) < 0
11609 || compare_tree_int (ost, 3) > 0)
11611 error ("%Klast argument of %D is not integer constant between 0 and 3",
11613 expand_builtin_trap ();
11617 object_size_type = tree_low_cst (ost, 0);
11619 return object_size_type < 2 ? constm1_rtx : const0_rtx;
11622 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
11623 FCODE is the BUILT_IN_* to use.
11624 Return NULL_RTX if we failed; the caller should emit a normal call,
11625 otherwise try to get the result in TARGET, if convenient (and in
11626 mode MODE if that's convenient). */
11629 expand_builtin_memory_chk (tree exp, rtx target, enum machine_mode mode,
11630 enum built_in_function fcode)
11632 tree dest, src, len, size;
11634 if (!validate_arglist (exp,
11636 fcode == BUILT_IN_MEMSET_CHK
11637 ? INTEGER_TYPE : POINTER_TYPE,
11638 INTEGER_TYPE, INTEGER_TYPE, VOID_TYPE))
11641 dest = CALL_EXPR_ARG (exp, 0);
11642 src = CALL_EXPR_ARG (exp, 1);
11643 len = CALL_EXPR_ARG (exp, 2);
11644 size = CALL_EXPR_ARG (exp, 3);
11646 if (! host_integerp (size, 1))
11649 if (host_integerp (len, 1) || integer_all_onesp (size))
11653 if (! integer_all_onesp (size) && tree_int_cst_lt (size, len))
11655 warning_at (tree_nonartificial_location (exp),
11656 0, "%Kcall to %D will always overflow destination buffer",
11657 exp, get_callee_fndecl (exp));
11662 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
11663 mem{cpy,pcpy,move,set} is available. */
11666 case BUILT_IN_MEMCPY_CHK:
11667 fn = built_in_decls[BUILT_IN_MEMCPY];
11669 case BUILT_IN_MEMPCPY_CHK:
11670 fn = built_in_decls[BUILT_IN_MEMPCPY];
11672 case BUILT_IN_MEMMOVE_CHK:
11673 fn = built_in_decls[BUILT_IN_MEMMOVE];
11675 case BUILT_IN_MEMSET_CHK:
11676 fn = built_in_decls[BUILT_IN_MEMSET];
11685 fn = build_call_nofold_loc (EXPR_LOCATION (exp), fn, 3, dest, src, len);
11686 gcc_assert (TREE_CODE (fn) == CALL_EXPR);
11687 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
11688 return expand_expr (fn, target, mode, EXPAND_NORMAL);
11690 else if (fcode == BUILT_IN_MEMSET_CHK)
11694 unsigned int dest_align
11695 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
11697 /* If DEST is not a pointer type, call the normal function. */
11698 if (dest_align == 0)
11701 /* If SRC and DEST are the same (and not volatile), do nothing. */
11702 if (operand_equal_p (src, dest, 0))
11706 if (fcode != BUILT_IN_MEMPCPY_CHK)
11708 /* Evaluate and ignore LEN in case it has side-effects. */
11709 expand_expr (len, const0_rtx, VOIDmode, EXPAND_NORMAL);
11710 return expand_expr (dest, target, mode, EXPAND_NORMAL);
11713 expr = fold_build_pointer_plus (dest, len);
11714 return expand_expr (expr, target, mode, EXPAND_NORMAL);
11717 /* __memmove_chk special case. */
11718 if (fcode == BUILT_IN_MEMMOVE_CHK)
11720 unsigned int src_align
11721 = get_pointer_alignment (src, BIGGEST_ALIGNMENT);
11723 if (src_align == 0)
11726 /* If src is categorized for a readonly section we can use
11727 normal __memcpy_chk. */
11728 if (readonly_data_expr (src))
11730 tree fn = built_in_decls[BUILT_IN_MEMCPY_CHK];
11733 fn = build_call_nofold_loc (EXPR_LOCATION (exp), fn, 4,
11734 dest, src, len, size);
11735 gcc_assert (TREE_CODE (fn) == CALL_EXPR);
11736 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
11737 return expand_expr (fn, target, mode, EXPAND_NORMAL);
11744 /* Emit warning if a buffer overflow is detected at compile time. */
11747 maybe_emit_chk_warning (tree exp, enum built_in_function fcode)
11751 location_t loc = tree_nonartificial_location (exp);
11755 case BUILT_IN_STRCPY_CHK:
11756 case BUILT_IN_STPCPY_CHK:
11757 /* For __strcat_chk the warning will be emitted only if overflowing
11758 by at least strlen (dest) + 1 bytes. */
11759 case BUILT_IN_STRCAT_CHK:
11760 len = CALL_EXPR_ARG (exp, 1);
11761 size = CALL_EXPR_ARG (exp, 2);
11764 case BUILT_IN_STRNCAT_CHK:
11765 case BUILT_IN_STRNCPY_CHK:
11766 len = CALL_EXPR_ARG (exp, 2);
11767 size = CALL_EXPR_ARG (exp, 3);
11769 case BUILT_IN_SNPRINTF_CHK:
11770 case BUILT_IN_VSNPRINTF_CHK:
11771 len = CALL_EXPR_ARG (exp, 1);
11772 size = CALL_EXPR_ARG (exp, 3);
11775 gcc_unreachable ();
11781 if (! host_integerp (size, 1) || integer_all_onesp (size))
11786 len = c_strlen (len, 1);
11787 if (! len || ! host_integerp (len, 1) || tree_int_cst_lt (len, size))
11790 else if (fcode == BUILT_IN_STRNCAT_CHK)
11792 tree src = CALL_EXPR_ARG (exp, 1);
11793 if (! src || ! host_integerp (len, 1) || tree_int_cst_lt (len, size))
11795 src = c_strlen (src, 1);
11796 if (! src || ! host_integerp (src, 1))
11798 warning_at (loc, 0, "%Kcall to %D might overflow destination buffer",
11799 exp, get_callee_fndecl (exp));
11802 else if (tree_int_cst_lt (src, size))
11805 else if (! host_integerp (len, 1) || ! tree_int_cst_lt (size, len))
11808 warning_at (loc, 0, "%Kcall to %D will always overflow destination buffer",
11809 exp, get_callee_fndecl (exp));
11812 /* Emit warning if a buffer overflow is detected at compile time
11813 in __sprintf_chk/__vsprintf_chk calls. */
11816 maybe_emit_sprintf_chk_warning (tree exp, enum built_in_function fcode)
11818 tree size, len, fmt;
11819 const char *fmt_str;
11820 int nargs = call_expr_nargs (exp);
11822 /* Verify the required arguments in the original call. */
11826 size = CALL_EXPR_ARG (exp, 2);
11827 fmt = CALL_EXPR_ARG (exp, 3);
11829 if (! host_integerp (size, 1) || integer_all_onesp (size))
11832 /* Check whether the format is a literal string constant. */
11833 fmt_str = c_getstr (fmt);
11834 if (fmt_str == NULL)
11837 if (!init_target_chars ())
11840 /* If the format doesn't contain % args or %%, we know its size. */
11841 if (strchr (fmt_str, target_percent) == 0)
11842 len = build_int_cstu (size_type_node, strlen (fmt_str));
11843 /* If the format is "%s" and first ... argument is a string literal,
11845 else if (fcode == BUILT_IN_SPRINTF_CHK
11846 && strcmp (fmt_str, target_percent_s) == 0)
11852 arg = CALL_EXPR_ARG (exp, 4);
11853 if (! POINTER_TYPE_P (TREE_TYPE (arg)))
11856 len = c_strlen (arg, 1);
11857 if (!len || ! host_integerp (len, 1))
11863 if (! tree_int_cst_lt (len, size))
11864 warning_at (tree_nonartificial_location (exp),
11865 0, "%Kcall to %D will always overflow destination buffer",
11866 exp, get_callee_fndecl (exp));
11869 /* Emit warning if a free is called with address of a variable. */
11872 maybe_emit_free_warning (tree exp)
11874 tree arg = CALL_EXPR_ARG (exp, 0);
11877 if (TREE_CODE (arg) != ADDR_EXPR)
11880 arg = get_base_address (TREE_OPERAND (arg, 0));
11881 if (arg == NULL || INDIRECT_REF_P (arg) || TREE_CODE (arg) == MEM_REF)
11884 if (SSA_VAR_P (arg))
11885 warning_at (tree_nonartificial_location (exp),
11886 0, "%Kattempt to free a non-heap object %qD", exp, arg);
11888 warning_at (tree_nonartificial_location (exp),
11889 0, "%Kattempt to free a non-heap object", exp);
11892 /* Fold a call to __builtin_object_size with arguments PTR and OST,
11896 fold_builtin_object_size (tree ptr, tree ost)
11898 unsigned HOST_WIDE_INT bytes;
11899 int object_size_type;
11901 if (!validate_arg (ptr, POINTER_TYPE)
11902 || !validate_arg (ost, INTEGER_TYPE))
11907 if (TREE_CODE (ost) != INTEGER_CST
11908 || tree_int_cst_sgn (ost) < 0
11909 || compare_tree_int (ost, 3) > 0)
11912 object_size_type = tree_low_cst (ost, 0);
11914 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
11915 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
11916 and (size_t) 0 for types 2 and 3. */
11917 if (TREE_SIDE_EFFECTS (ptr))
11918 return build_int_cst_type (size_type_node, object_size_type < 2 ? -1 : 0);
11920 if (TREE_CODE (ptr) == ADDR_EXPR)
11922 bytes = compute_builtin_object_size (ptr, object_size_type);
11923 if (double_int_fits_to_tree_p (size_type_node,
11924 uhwi_to_double_int (bytes)))
11925 return build_int_cstu (size_type_node, bytes);
11927 else if (TREE_CODE (ptr) == SSA_NAME)
11929 /* If object size is not known yet, delay folding until
11930 later. Maybe subsequent passes will help determining
11932 bytes = compute_builtin_object_size (ptr, object_size_type);
11933 if (bytes != (unsigned HOST_WIDE_INT) (object_size_type < 2 ? -1 : 0)
11934 && double_int_fits_to_tree_p (size_type_node,
11935 uhwi_to_double_int (bytes)))
11936 return build_int_cstu (size_type_node, bytes);
11942 /* Fold a call to the __mem{cpy,pcpy,move,set}_chk builtin.
11943 DEST, SRC, LEN, and SIZE are the arguments to the call.
11944 IGNORE is true, if return value can be ignored. FCODE is the BUILT_IN_*
11945 code of the builtin. If MAXLEN is not NULL, it is maximum length
11946 passed as third argument. */
11949 fold_builtin_memory_chk (location_t loc, tree fndecl,
11950 tree dest, tree src, tree len, tree size,
11951 tree maxlen, bool ignore,
11952 enum built_in_function fcode)
11956 if (!validate_arg (dest, POINTER_TYPE)
11957 || !validate_arg (src,
11958 (fcode == BUILT_IN_MEMSET_CHK
11959 ? INTEGER_TYPE : POINTER_TYPE))
11960 || !validate_arg (len, INTEGER_TYPE)
11961 || !validate_arg (size, INTEGER_TYPE))
11964 /* If SRC and DEST are the same (and not volatile), return DEST
11965 (resp. DEST+LEN for __mempcpy_chk). */
11966 if (fcode != BUILT_IN_MEMSET_CHK && operand_equal_p (src, dest, 0))
11968 if (fcode != BUILT_IN_MEMPCPY_CHK)
11969 return omit_one_operand_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)),
11973 tree temp = fold_build_pointer_plus_loc (loc, dest, len);
11974 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), temp);
11978 if (! host_integerp (size, 1))
11981 if (! integer_all_onesp (size))
11983 if (! host_integerp (len, 1))
11985 /* If LEN is not constant, try MAXLEN too.
11986 For MAXLEN only allow optimizing into non-_ocs function
11987 if SIZE is >= MAXLEN, never convert to __ocs_fail (). */
11988 if (maxlen == NULL_TREE || ! host_integerp (maxlen, 1))
11990 if (fcode == BUILT_IN_MEMPCPY_CHK && ignore)
11992 /* (void) __mempcpy_chk () can be optimized into
11993 (void) __memcpy_chk (). */
11994 fn = built_in_decls[BUILT_IN_MEMCPY_CHK];
11998 return build_call_expr_loc (loc, fn, 4, dest, src, len, size);
12006 if (tree_int_cst_lt (size, maxlen))
12011 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
12012 mem{cpy,pcpy,move,set} is available. */
12015 case BUILT_IN_MEMCPY_CHK:
12016 fn = built_in_decls[BUILT_IN_MEMCPY];
12018 case BUILT_IN_MEMPCPY_CHK:
12019 fn = built_in_decls[BUILT_IN_MEMPCPY];
12021 case BUILT_IN_MEMMOVE_CHK:
12022 fn = built_in_decls[BUILT_IN_MEMMOVE];
12024 case BUILT_IN_MEMSET_CHK:
12025 fn = built_in_decls[BUILT_IN_MEMSET];
12034 return build_call_expr_loc (loc, fn, 3, dest, src, len);
12037 /* Fold a call to the __st[rp]cpy_chk builtin.
12038 DEST, SRC, and SIZE are the arguments to the call.
12039 IGNORE is true if return value can be ignored. FCODE is the BUILT_IN_*
12040 code of the builtin. If MAXLEN is not NULL, it is maximum length of
12041 strings passed as second argument. */
12044 fold_builtin_stxcpy_chk (location_t loc, tree fndecl, tree dest,
12045 tree src, tree size,
12046 tree maxlen, bool ignore,
12047 enum built_in_function fcode)
12051 if (!validate_arg (dest, POINTER_TYPE)
12052 || !validate_arg (src, POINTER_TYPE)
12053 || !validate_arg (size, INTEGER_TYPE))
12056 /* If SRC and DEST are the same (and not volatile), return DEST. */
12057 if (fcode == BUILT_IN_STRCPY_CHK && operand_equal_p (src, dest, 0))
12058 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest);
12060 if (! host_integerp (size, 1))
12063 if (! integer_all_onesp (size))
12065 len = c_strlen (src, 1);
12066 if (! len || ! host_integerp (len, 1))
12068 /* If LEN is not constant, try MAXLEN too.
12069 For MAXLEN only allow optimizing into non-_ocs function
12070 if SIZE is >= MAXLEN, never convert to __ocs_fail (). */
12071 if (maxlen == NULL_TREE || ! host_integerp (maxlen, 1))
12073 if (fcode == BUILT_IN_STPCPY_CHK)
12078 /* If return value of __stpcpy_chk is ignored,
12079 optimize into __strcpy_chk. */
12080 fn = built_in_decls[BUILT_IN_STRCPY_CHK];
12084 return build_call_expr_loc (loc, fn, 3, dest, src, size);
12087 if (! len || TREE_SIDE_EFFECTS (len))
12090 /* If c_strlen returned something, but not a constant,
12091 transform __strcpy_chk into __memcpy_chk. */
12092 fn = built_in_decls[BUILT_IN_MEMCPY_CHK];
12096 len = size_binop_loc (loc, PLUS_EXPR, len, ssize_int (1));
12097 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)),
12098 build_call_expr_loc (loc, fn, 4,
12099 dest, src, len, size));
12105 if (! tree_int_cst_lt (maxlen, size))
12109 /* If __builtin_st{r,p}cpy_chk is used, assume st{r,p}cpy is available. */
12110 fn = built_in_decls[fcode == BUILT_IN_STPCPY_CHK
12111 ? BUILT_IN_STPCPY : BUILT_IN_STRCPY];
12115 return build_call_expr_loc (loc, fn, 2, dest, src);
12118 /* Fold a call to the __strncpy_chk builtin. DEST, SRC, LEN, and SIZE
12119 are the arguments to the call. If MAXLEN is not NULL, it is maximum
12120 length passed as third argument. */
12123 fold_builtin_strncpy_chk (location_t loc, tree dest, tree src,
12124 tree len, tree size, tree maxlen)
12128 if (!validate_arg (dest, POINTER_TYPE)
12129 || !validate_arg (src, POINTER_TYPE)
12130 || !validate_arg (len, INTEGER_TYPE)
12131 || !validate_arg (size, INTEGER_TYPE))
12134 if (! host_integerp (size, 1))
12137 if (! integer_all_onesp (size))
12139 if (! host_integerp (len, 1))
12141 /* If LEN is not constant, try MAXLEN too.
12142 For MAXLEN only allow optimizing into non-_ocs function
12143 if SIZE is >= MAXLEN, never convert to __ocs_fail (). */
12144 if (maxlen == NULL_TREE || ! host_integerp (maxlen, 1))
12150 if (tree_int_cst_lt (size, maxlen))
12154 /* If __builtin_strncpy_chk is used, assume strncpy is available. */
12155 fn = built_in_decls[BUILT_IN_STRNCPY];
12159 return build_call_expr_loc (loc, fn, 3, dest, src, len);
12162 /* Fold a call to the __strcat_chk builtin FNDECL. DEST, SRC, and SIZE
12163 are the arguments to the call. */
12166 fold_builtin_strcat_chk (location_t loc, tree fndecl, tree dest,
12167 tree src, tree size)
12172 if (!validate_arg (dest, POINTER_TYPE)
12173 || !validate_arg (src, POINTER_TYPE)
12174 || !validate_arg (size, INTEGER_TYPE))
12177 p = c_getstr (src);
12178 /* If the SRC parameter is "", return DEST. */
12179 if (p && *p == '\0')
12180 return omit_one_operand_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest, src);
12182 if (! host_integerp (size, 1) || ! integer_all_onesp (size))
12185 /* If __builtin_strcat_chk is used, assume strcat is available. */
12186 fn = built_in_decls[BUILT_IN_STRCAT];
12190 return build_call_expr_loc (loc, fn, 2, dest, src);
12193 /* Fold a call to the __strncat_chk builtin with arguments DEST, SRC,
12197 fold_builtin_strncat_chk (location_t loc, tree fndecl,
12198 tree dest, tree src, tree len, tree size)
12203 if (!validate_arg (dest, POINTER_TYPE)
12204 || !validate_arg (src, POINTER_TYPE)
12205 || !validate_arg (size, INTEGER_TYPE)
12206 || !validate_arg (size, INTEGER_TYPE))
12209 p = c_getstr (src);
12210 /* If the SRC parameter is "" or if LEN is 0, return DEST. */
12211 if (p && *p == '\0')
12212 return omit_one_operand_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest, len);
12213 else if (integer_zerop (len))
12214 return omit_one_operand_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest, src);
12216 if (! host_integerp (size, 1))
12219 if (! integer_all_onesp (size))
12221 tree src_len = c_strlen (src, 1);
12223 && host_integerp (src_len, 1)
12224 && host_integerp (len, 1)
12225 && ! tree_int_cst_lt (len, src_len))
12227 /* If LEN >= strlen (SRC), optimize into __strcat_chk. */
12228 fn = built_in_decls[BUILT_IN_STRCAT_CHK];
12232 return build_call_expr_loc (loc, fn, 3, dest, src, size);
12237 /* If __builtin_strncat_chk is used, assume strncat is available. */
12238 fn = built_in_decls[BUILT_IN_STRNCAT];
12242 return build_call_expr_loc (loc, fn, 3, dest, src, len);
12245 /* Fold a call EXP to __{,v}sprintf_chk having NARGS passed as ARGS.
12246 Return NULL_TREE if a normal call should be emitted rather than
12247 expanding the function inline. FCODE is either BUILT_IN_SPRINTF_CHK
12248 or BUILT_IN_VSPRINTF_CHK. */
12251 fold_builtin_sprintf_chk_1 (location_t loc, int nargs, tree *args,
12252 enum built_in_function fcode)
12254 tree dest, size, len, fn, fmt, flag;
12255 const char *fmt_str;
12257 /* Verify the required arguments in the original call. */
12261 if (!validate_arg (dest, POINTER_TYPE))
12264 if (!validate_arg (flag, INTEGER_TYPE))
12267 if (!validate_arg (size, INTEGER_TYPE))
12270 if (!validate_arg (fmt, POINTER_TYPE))
12273 if (! host_integerp (size, 1))
12278 if (!init_target_chars ())
12281 /* Check whether the format is a literal string constant. */
12282 fmt_str = c_getstr (fmt);
12283 if (fmt_str != NULL)
12285 /* If the format doesn't contain % args or %%, we know the size. */
12286 if (strchr (fmt_str, target_percent) == 0)
12288 if (fcode != BUILT_IN_SPRINTF_CHK || nargs == 4)
12289 len = build_int_cstu (size_type_node, strlen (fmt_str));
12291 /* If the format is "%s" and first ... argument is a string literal,
12292 we know the size too. */
12293 else if (fcode == BUILT_IN_SPRINTF_CHK
12294 && strcmp (fmt_str, target_percent_s) == 0)
12301 if (validate_arg (arg, POINTER_TYPE))
12303 len = c_strlen (arg, 1);
12304 if (! len || ! host_integerp (len, 1))
12311 if (! integer_all_onesp (size))
12313 if (! len || ! tree_int_cst_lt (len, size))
12317 /* Only convert __{,v}sprintf_chk to {,v}sprintf if flag is 0
12318 or if format doesn't contain % chars or is "%s". */
12319 if (! integer_zerop (flag))
12321 if (fmt_str == NULL)
12323 if (strchr (fmt_str, target_percent) != NULL
12324 && strcmp (fmt_str, target_percent_s))
12328 /* If __builtin_{,v}sprintf_chk is used, assume {,v}sprintf is available. */
12329 fn = built_in_decls[fcode == BUILT_IN_VSPRINTF_CHK
12330 ? BUILT_IN_VSPRINTF : BUILT_IN_SPRINTF];
12334 return rewrite_call_expr_array (loc, nargs, args, 4, fn, 2, dest, fmt);
12337 /* Fold a call EXP to __{,v}sprintf_chk. Return NULL_TREE if
12338 a normal call should be emitted rather than expanding the function
12339 inline. FCODE is either BUILT_IN_SPRINTF_CHK or BUILT_IN_VSPRINTF_CHK. */
12342 fold_builtin_sprintf_chk (location_t loc, tree exp,
12343 enum built_in_function fcode)
12345 return fold_builtin_sprintf_chk_1 (loc, call_expr_nargs (exp),
12346 CALL_EXPR_ARGP (exp), fcode);
12349 /* Fold a call EXP to {,v}snprintf having NARGS passed as ARGS. Return
12350 NULL_TREE if a normal call should be emitted rather than expanding
12351 the function inline. FCODE is either BUILT_IN_SNPRINTF_CHK or
12352 BUILT_IN_VSNPRINTF_CHK. If MAXLEN is not NULL, it is maximum length
12353 passed as second argument. */
12356 fold_builtin_snprintf_chk_1 (location_t loc, int nargs, tree *args,
12357 tree maxlen, enum built_in_function fcode)
12359 tree dest, size, len, fn, fmt, flag;
12360 const char *fmt_str;
12362 /* Verify the required arguments in the original call. */
12366 if (!validate_arg (dest, POINTER_TYPE))
12369 if (!validate_arg (len, INTEGER_TYPE))
12372 if (!validate_arg (flag, INTEGER_TYPE))
12375 if (!validate_arg (size, INTEGER_TYPE))
12378 if (!validate_arg (fmt, POINTER_TYPE))
12381 if (! host_integerp (size, 1))
12384 if (! integer_all_onesp (size))
12386 if (! host_integerp (len, 1))
12388 /* If LEN is not constant, try MAXLEN too.
12389 For MAXLEN only allow optimizing into non-_ocs function
12390 if SIZE is >= MAXLEN, never convert to __ocs_fail (). */
12391 if (maxlen == NULL_TREE || ! host_integerp (maxlen, 1))
12397 if (tree_int_cst_lt (size, maxlen))
12401 if (!init_target_chars ())
12404 /* Only convert __{,v}snprintf_chk to {,v}snprintf if flag is 0
12405 or if format doesn't contain % chars or is "%s". */
12406 if (! integer_zerop (flag))
12408 fmt_str = c_getstr (fmt);
12409 if (fmt_str == NULL)
12411 if (strchr (fmt_str, target_percent) != NULL
12412 && strcmp (fmt_str, target_percent_s))
12416 /* If __builtin_{,v}snprintf_chk is used, assume {,v}snprintf is
12418 fn = built_in_decls[fcode == BUILT_IN_VSNPRINTF_CHK
12419 ? BUILT_IN_VSNPRINTF : BUILT_IN_SNPRINTF];
12423 return rewrite_call_expr_array (loc, nargs, args, 5, fn, 3, dest, len, fmt);
12426 /* Fold a call EXP to {,v}snprintf. Return NULL_TREE if
12427 a normal call should be emitted rather than expanding the function
12428 inline. FCODE is either BUILT_IN_SNPRINTF_CHK or
12429 BUILT_IN_VSNPRINTF_CHK. If MAXLEN is not NULL, it is maximum length
12430 passed as second argument. */
12433 fold_builtin_snprintf_chk (location_t loc, tree exp, tree maxlen,
12434 enum built_in_function fcode)
12436 return fold_builtin_snprintf_chk_1 (loc, call_expr_nargs (exp),
12437 CALL_EXPR_ARGP (exp), maxlen, fcode);
12440 /* Fold a call to the {,v}printf{,_unlocked} and __{,v}printf_chk builtins.
12441 FMT and ARG are the arguments to the call; we don't fold cases with
12442 more than 2 arguments, and ARG may be null if this is a 1-argument case.
12444 Return NULL_TREE if no simplification was possible, otherwise return the
12445 simplified form of the call as a tree. FCODE is the BUILT_IN_*
12446 code of the function to be simplified. */
12449 fold_builtin_printf (location_t loc, tree fndecl, tree fmt,
12450 tree arg, bool ignore,
12451 enum built_in_function fcode)
12453 tree fn_putchar, fn_puts, newarg, call = NULL_TREE;
12454 const char *fmt_str = NULL;
12456 /* If the return value is used, don't do the transformation. */
12460 /* Verify the required arguments in the original call. */
12461 if (!validate_arg (fmt, POINTER_TYPE))
12464 /* Check whether the format is a literal string constant. */
12465 fmt_str = c_getstr (fmt);
12466 if (fmt_str == NULL)
12469 if (fcode == BUILT_IN_PRINTF_UNLOCKED)
12471 /* If we're using an unlocked function, assume the other
12472 unlocked functions exist explicitly. */
12473 fn_putchar = built_in_decls[BUILT_IN_PUTCHAR_UNLOCKED];
12474 fn_puts = built_in_decls[BUILT_IN_PUTS_UNLOCKED];
12478 fn_putchar = implicit_built_in_decls[BUILT_IN_PUTCHAR];
12479 fn_puts = implicit_built_in_decls[BUILT_IN_PUTS];
12482 if (!init_target_chars ())
12485 if (strcmp (fmt_str, target_percent_s) == 0
12486 || strchr (fmt_str, target_percent) == NULL)
12490 if (strcmp (fmt_str, target_percent_s) == 0)
12492 if (fcode == BUILT_IN_VPRINTF || fcode == BUILT_IN_VPRINTF_CHK)
12495 if (!arg || !validate_arg (arg, POINTER_TYPE))
12498 str = c_getstr (arg);
12504 /* The format specifier doesn't contain any '%' characters. */
12505 if (fcode != BUILT_IN_VPRINTF && fcode != BUILT_IN_VPRINTF_CHK
12511 /* If the string was "", printf does nothing. */
12512 if (str[0] == '\0')
12513 return build_int_cst (TREE_TYPE (TREE_TYPE (fndecl)), 0);
12515 /* If the string has length of 1, call putchar. */
12516 if (str[1] == '\0')
12518 /* Given printf("c"), (where c is any one character,)
12519 convert "c"[0] to an int and pass that to the replacement
12521 newarg = build_int_cst (integer_type_node, str[0]);
12523 call = build_call_expr_loc (loc, fn_putchar, 1, newarg);
12527 /* If the string was "string\n", call puts("string"). */
12528 size_t len = strlen (str);
12529 if ((unsigned char)str[len - 1] == target_newline
12530 && (size_t) (int) len == len
12534 tree offset_node, string_cst;
12536 /* Create a NUL-terminated string that's one char shorter
12537 than the original, stripping off the trailing '\n'. */
12538 newarg = build_string_literal (len, str);
12539 string_cst = string_constant (newarg, &offset_node);
12540 gcc_checking_assert (string_cst
12541 && (TREE_STRING_LENGTH (string_cst)
12543 && integer_zerop (offset_node)
12545 TREE_STRING_POINTER (string_cst)[len - 1]
12546 == target_newline);
12547 /* build_string_literal creates a new STRING_CST,
12548 modify it in place to avoid double copying. */
12549 newstr = CONST_CAST (char *, TREE_STRING_POINTER (string_cst));
12550 newstr[len - 1] = '\0';
12552 call = build_call_expr_loc (loc, fn_puts, 1, newarg);
12555 /* We'd like to arrange to call fputs(string,stdout) here,
12556 but we need stdout and don't have a way to get it yet. */
12561 /* The other optimizations can be done only on the non-va_list variants. */
12562 else if (fcode == BUILT_IN_VPRINTF || fcode == BUILT_IN_VPRINTF_CHK)
12565 /* If the format specifier was "%s\n", call __builtin_puts(arg). */
12566 else if (strcmp (fmt_str, target_percent_s_newline) == 0)
12568 if (!arg || !validate_arg (arg, POINTER_TYPE))
12571 call = build_call_expr_loc (loc, fn_puts, 1, arg);
12574 /* If the format specifier was "%c", call __builtin_putchar(arg). */
12575 else if (strcmp (fmt_str, target_percent_c) == 0)
12577 if (!arg || !validate_arg (arg, INTEGER_TYPE))
12580 call = build_call_expr_loc (loc, fn_putchar, 1, arg);
12586 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), call);
12589 /* Fold a call to the {,v}fprintf{,_unlocked} and __{,v}printf_chk builtins.
12590 FP, FMT, and ARG are the arguments to the call. We don't fold calls with
12591 more than 3 arguments, and ARG may be null in the 2-argument case.
12593 Return NULL_TREE if no simplification was possible, otherwise return the
12594 simplified form of the call as a tree. FCODE is the BUILT_IN_*
12595 code of the function to be simplified. */
12598 fold_builtin_fprintf (location_t loc, tree fndecl, tree fp,
12599 tree fmt, tree arg, bool ignore,
12600 enum built_in_function fcode)
12602 tree fn_fputc, fn_fputs, call = NULL_TREE;
12603 const char *fmt_str = NULL;
12605 /* If the return value is used, don't do the transformation. */
12609 /* Verify the required arguments in the original call. */
12610 if (!validate_arg (fp, POINTER_TYPE))
12612 if (!validate_arg (fmt, POINTER_TYPE))
12615 /* Check whether the format is a literal string constant. */
12616 fmt_str = c_getstr (fmt);
12617 if (fmt_str == NULL)
12620 if (fcode == BUILT_IN_FPRINTF_UNLOCKED)
12622 /* If we're using an unlocked function, assume the other
12623 unlocked functions exist explicitly. */
12624 fn_fputc = built_in_decls[BUILT_IN_FPUTC_UNLOCKED];
12625 fn_fputs = built_in_decls[BUILT_IN_FPUTS_UNLOCKED];
12629 fn_fputc = implicit_built_in_decls[BUILT_IN_FPUTC];
12630 fn_fputs = implicit_built_in_decls[BUILT_IN_FPUTS];
12633 if (!init_target_chars ())
12636 /* If the format doesn't contain % args or %%, use strcpy. */
12637 if (strchr (fmt_str, target_percent) == NULL)
12639 if (fcode != BUILT_IN_VFPRINTF && fcode != BUILT_IN_VFPRINTF_CHK
12643 /* If the format specifier was "", fprintf does nothing. */
12644 if (fmt_str[0] == '\0')
12646 /* If FP has side-effects, just wait until gimplification is
12648 if (TREE_SIDE_EFFECTS (fp))
12651 return build_int_cst (TREE_TYPE (TREE_TYPE (fndecl)), 0);
12654 /* When "string" doesn't contain %, replace all cases of
12655 fprintf (fp, string) with fputs (string, fp). The fputs
12656 builtin will take care of special cases like length == 1. */
12658 call = build_call_expr_loc (loc, fn_fputs, 2, fmt, fp);
12661 /* The other optimizations can be done only on the non-va_list variants. */
12662 else if (fcode == BUILT_IN_VFPRINTF || fcode == BUILT_IN_VFPRINTF_CHK)
12665 /* If the format specifier was "%s", call __builtin_fputs (arg, fp). */
12666 else if (strcmp (fmt_str, target_percent_s) == 0)
12668 if (!arg || !validate_arg (arg, POINTER_TYPE))
12671 call = build_call_expr_loc (loc, fn_fputs, 2, arg, fp);
12674 /* If the format specifier was "%c", call __builtin_fputc (arg, fp). */
12675 else if (strcmp (fmt_str, target_percent_c) == 0)
12677 if (!arg || !validate_arg (arg, INTEGER_TYPE))
12680 call = build_call_expr_loc (loc, fn_fputc, 2, arg, fp);
12685 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), call);
12688 /* Initialize format string characters in the target charset. */
12691 init_target_chars (void)
12696 target_newline = lang_hooks.to_target_charset ('\n');
12697 target_percent = lang_hooks.to_target_charset ('%');
12698 target_c = lang_hooks.to_target_charset ('c');
12699 target_s = lang_hooks.to_target_charset ('s');
12700 if (target_newline == 0 || target_percent == 0 || target_c == 0
12704 target_percent_c[0] = target_percent;
12705 target_percent_c[1] = target_c;
12706 target_percent_c[2] = '\0';
12708 target_percent_s[0] = target_percent;
12709 target_percent_s[1] = target_s;
12710 target_percent_s[2] = '\0';
12712 target_percent_s_newline[0] = target_percent;
12713 target_percent_s_newline[1] = target_s;
12714 target_percent_s_newline[2] = target_newline;
12715 target_percent_s_newline[3] = '\0';
12722 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
12723 and no overflow/underflow occurred. INEXACT is true if M was not
12724 exactly calculated. TYPE is the tree type for the result. This
12725 function assumes that you cleared the MPFR flags and then
12726 calculated M to see if anything subsequently set a flag prior to
12727 entering this function. Return NULL_TREE if any checks fail. */
12730 do_mpfr_ckconv (mpfr_srcptr m, tree type, int inexact)
12732 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
12733 overflow/underflow occurred. If -frounding-math, proceed iff the
12734 result of calling FUNC was exact. */
12735 if (mpfr_number_p (m) && !mpfr_overflow_p () && !mpfr_underflow_p ()
12736 && (!flag_rounding_math || !inexact))
12738 REAL_VALUE_TYPE rr;
12740 real_from_mpfr (&rr, m, type, GMP_RNDN);
12741 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
12742 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
12743 but the mpft_t is not, then we underflowed in the
12745 if (real_isfinite (&rr)
12746 && (rr.cl == rvc_zero) == (mpfr_zero_p (m) != 0))
12748 REAL_VALUE_TYPE rmode;
12750 real_convert (&rmode, TYPE_MODE (type), &rr);
12751 /* Proceed iff the specified mode can hold the value. */
12752 if (real_identical (&rmode, &rr))
12753 return build_real (type, rmode);
12759 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
12760 number and no overflow/underflow occurred. INEXACT is true if M
12761 was not exactly calculated. TYPE is the tree type for the result.
12762 This function assumes that you cleared the MPFR flags and then
12763 calculated M to see if anything subsequently set a flag prior to
12764 entering this function. Return NULL_TREE if any checks fail, if
12765 FORCE_CONVERT is true, then bypass the checks. */
12768 do_mpc_ckconv (mpc_srcptr m, tree type, int inexact, int force_convert)
12770 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
12771 overflow/underflow occurred. If -frounding-math, proceed iff the
12772 result of calling FUNC was exact. */
12774 || (mpfr_number_p (mpc_realref (m)) && mpfr_number_p (mpc_imagref (m))
12775 && !mpfr_overflow_p () && !mpfr_underflow_p ()
12776 && (!flag_rounding_math || !inexact)))
12778 REAL_VALUE_TYPE re, im;
12780 real_from_mpfr (&re, mpc_realref (m), TREE_TYPE (type), GMP_RNDN);
12781 real_from_mpfr (&im, mpc_imagref (m), TREE_TYPE (type), GMP_RNDN);
12782 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
12783 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
12784 but the mpft_t is not, then we underflowed in the
12787 || (real_isfinite (&re) && real_isfinite (&im)
12788 && (re.cl == rvc_zero) == (mpfr_zero_p (mpc_realref (m)) != 0)
12789 && (im.cl == rvc_zero) == (mpfr_zero_p (mpc_imagref (m)) != 0)))
12791 REAL_VALUE_TYPE re_mode, im_mode;
12793 real_convert (&re_mode, TYPE_MODE (TREE_TYPE (type)), &re);
12794 real_convert (&im_mode, TYPE_MODE (TREE_TYPE (type)), &im);
12795 /* Proceed iff the specified mode can hold the value. */
12797 || (real_identical (&re_mode, &re)
12798 && real_identical (&im_mode, &im)))
12799 return build_complex (type, build_real (TREE_TYPE (type), re_mode),
12800 build_real (TREE_TYPE (type), im_mode));
12806 /* If argument ARG is a REAL_CST, call the one-argument mpfr function
12807 FUNC on it and return the resulting value as a tree with type TYPE.
12808 If MIN and/or MAX are not NULL, then the supplied ARG must be
12809 within those bounds. If INCLUSIVE is true, then MIN/MAX are
12810 acceptable values, otherwise they are not. The mpfr precision is
12811 set to the precision of TYPE. We assume that function FUNC returns
12812 zero if the result could be calculated exactly within the requested
12816 do_mpfr_arg1 (tree arg, tree type, int (*func)(mpfr_ptr, mpfr_srcptr, mp_rnd_t),
12817 const REAL_VALUE_TYPE *min, const REAL_VALUE_TYPE *max,
12820 tree result = NULL_TREE;
12824 /* To proceed, MPFR must exactly represent the target floating point
12825 format, which only happens when the target base equals two. */
12826 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
12827 && TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
12829 const REAL_VALUE_TYPE *const ra = &TREE_REAL_CST (arg);
12831 if (real_isfinite (ra)
12832 && (!min || real_compare (inclusive ? GE_EXPR: GT_EXPR , ra, min))
12833 && (!max || real_compare (inclusive ? LE_EXPR: LT_EXPR , ra, max)))
12835 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
12836 const int prec = fmt->p;
12837 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
12841 mpfr_init2 (m, prec);
12842 mpfr_from_real (m, ra, GMP_RNDN);
12843 mpfr_clear_flags ();
12844 inexact = func (m, m, rnd);
12845 result = do_mpfr_ckconv (m, type, inexact);
12853 /* If argument ARG is a REAL_CST, call the two-argument mpfr function
12854 FUNC on it and return the resulting value as a tree with type TYPE.
12855 The mpfr precision is set to the precision of TYPE. We assume that
12856 function FUNC returns zero if the result could be calculated
12857 exactly within the requested precision. */
12860 do_mpfr_arg2 (tree arg1, tree arg2, tree type,
12861 int (*func)(mpfr_ptr, mpfr_srcptr, mpfr_srcptr, mp_rnd_t))
12863 tree result = NULL_TREE;
12868 /* To proceed, MPFR must exactly represent the target floating point
12869 format, which only happens when the target base equals two. */
12870 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
12871 && TREE_CODE (arg1) == REAL_CST && !TREE_OVERFLOW (arg1)
12872 && TREE_CODE (arg2) == REAL_CST && !TREE_OVERFLOW (arg2))
12874 const REAL_VALUE_TYPE *const ra1 = &TREE_REAL_CST (arg1);
12875 const REAL_VALUE_TYPE *const ra2 = &TREE_REAL_CST (arg2);
12877 if (real_isfinite (ra1) && real_isfinite (ra2))
12879 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
12880 const int prec = fmt->p;
12881 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
12885 mpfr_inits2 (prec, m1, m2, NULL);
12886 mpfr_from_real (m1, ra1, GMP_RNDN);
12887 mpfr_from_real (m2, ra2, GMP_RNDN);
12888 mpfr_clear_flags ();
12889 inexact = func (m1, m1, m2, rnd);
12890 result = do_mpfr_ckconv (m1, type, inexact);
12891 mpfr_clears (m1, m2, NULL);
12898 /* If argument ARG is a REAL_CST, call the three-argument mpfr function
12899 FUNC on it and return the resulting value as a tree with type TYPE.
12900 The mpfr precision is set to the precision of TYPE. We assume that
12901 function FUNC returns zero if the result could be calculated
12902 exactly within the requested precision. */
12905 do_mpfr_arg3 (tree arg1, tree arg2, tree arg3, tree type,
12906 int (*func)(mpfr_ptr, mpfr_srcptr, mpfr_srcptr, mpfr_srcptr, mp_rnd_t))
12908 tree result = NULL_TREE;
12914 /* To proceed, MPFR must exactly represent the target floating point
12915 format, which only happens when the target base equals two. */
12916 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
12917 && TREE_CODE (arg1) == REAL_CST && !TREE_OVERFLOW (arg1)
12918 && TREE_CODE (arg2) == REAL_CST && !TREE_OVERFLOW (arg2)
12919 && TREE_CODE (arg3) == REAL_CST && !TREE_OVERFLOW (arg3))
12921 const REAL_VALUE_TYPE *const ra1 = &TREE_REAL_CST (arg1);
12922 const REAL_VALUE_TYPE *const ra2 = &TREE_REAL_CST (arg2);
12923 const REAL_VALUE_TYPE *const ra3 = &TREE_REAL_CST (arg3);
12925 if (real_isfinite (ra1) && real_isfinite (ra2) && real_isfinite (ra3))
12927 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
12928 const int prec = fmt->p;
12929 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
12933 mpfr_inits2 (prec, m1, m2, m3, NULL);
12934 mpfr_from_real (m1, ra1, GMP_RNDN);
12935 mpfr_from_real (m2, ra2, GMP_RNDN);
12936 mpfr_from_real (m3, ra3, GMP_RNDN);
12937 mpfr_clear_flags ();
12938 inexact = func (m1, m1, m2, m3, rnd);
12939 result = do_mpfr_ckconv (m1, type, inexact);
12940 mpfr_clears (m1, m2, m3, NULL);
12947 /* If argument ARG is a REAL_CST, call mpfr_sin_cos() on it and set
12948 the pointers *(ARG_SINP) and *(ARG_COSP) to the resulting values.
12949 If ARG_SINP and ARG_COSP are NULL then the result is returned
12950 as a complex value.
12951 The type is taken from the type of ARG and is used for setting the
12952 precision of the calculation and results. */
12955 do_mpfr_sincos (tree arg, tree arg_sinp, tree arg_cosp)
12957 tree const type = TREE_TYPE (arg);
12958 tree result = NULL_TREE;
12962 /* To proceed, MPFR must exactly represent the target floating point
12963 format, which only happens when the target base equals two. */
12964 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
12965 && TREE_CODE (arg) == REAL_CST
12966 && !TREE_OVERFLOW (arg))
12968 const REAL_VALUE_TYPE *const ra = &TREE_REAL_CST (arg);
12970 if (real_isfinite (ra))
12972 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
12973 const int prec = fmt->p;
12974 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
12975 tree result_s, result_c;
12979 mpfr_inits2 (prec, m, ms, mc, NULL);
12980 mpfr_from_real (m, ra, GMP_RNDN);
12981 mpfr_clear_flags ();
12982 inexact = mpfr_sin_cos (ms, mc, m, rnd);
12983 result_s = do_mpfr_ckconv (ms, type, inexact);
12984 result_c = do_mpfr_ckconv (mc, type, inexact);
12985 mpfr_clears (m, ms, mc, NULL);
12986 if (result_s && result_c)
12988 /* If we are to return in a complex value do so. */
12989 if (!arg_sinp && !arg_cosp)
12990 return build_complex (build_complex_type (type),
12991 result_c, result_s);
12993 /* Dereference the sin/cos pointer arguments. */
12994 arg_sinp = build_fold_indirect_ref (arg_sinp);
12995 arg_cosp = build_fold_indirect_ref (arg_cosp);
12996 /* Proceed if valid pointer type were passed in. */
12997 if (TYPE_MAIN_VARIANT (TREE_TYPE (arg_sinp)) == TYPE_MAIN_VARIANT (type)
12998 && TYPE_MAIN_VARIANT (TREE_TYPE (arg_cosp)) == TYPE_MAIN_VARIANT (type))
13000 /* Set the values. */
13001 result_s = fold_build2 (MODIFY_EXPR, type, arg_sinp,
13003 TREE_SIDE_EFFECTS (result_s) = 1;
13004 result_c = fold_build2 (MODIFY_EXPR, type, arg_cosp,
13006 TREE_SIDE_EFFECTS (result_c) = 1;
13007 /* Combine the assignments into a compound expr. */
13008 result = non_lvalue (fold_build2 (COMPOUND_EXPR, type,
13009 result_s, result_c));
13017 /* If argument ARG1 is an INTEGER_CST and ARG2 is a REAL_CST, call the
13018 two-argument mpfr order N Bessel function FUNC on them and return
13019 the resulting value as a tree with type TYPE. The mpfr precision
13020 is set to the precision of TYPE. We assume that function FUNC
13021 returns zero if the result could be calculated exactly within the
13022 requested precision. */
13024 do_mpfr_bessel_n (tree arg1, tree arg2, tree type,
13025 int (*func)(mpfr_ptr, long, mpfr_srcptr, mp_rnd_t),
13026 const REAL_VALUE_TYPE *min, bool inclusive)
13028 tree result = NULL_TREE;
13033 /* To proceed, MPFR must exactly represent the target floating point
13034 format, which only happens when the target base equals two. */
13035 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
13036 && host_integerp (arg1, 0)
13037 && TREE_CODE (arg2) == REAL_CST && !TREE_OVERFLOW (arg2))
13039 const HOST_WIDE_INT n = tree_low_cst(arg1, 0);
13040 const REAL_VALUE_TYPE *const ra = &TREE_REAL_CST (arg2);
13043 && real_isfinite (ra)
13044 && (!min || real_compare (inclusive ? GE_EXPR: GT_EXPR , ra, min)))
13046 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
13047 const int prec = fmt->p;
13048 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
13052 mpfr_init2 (m, prec);
13053 mpfr_from_real (m, ra, GMP_RNDN);
13054 mpfr_clear_flags ();
13055 inexact = func (m, n, m, rnd);
13056 result = do_mpfr_ckconv (m, type, inexact);
13064 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
13065 the pointer *(ARG_QUO) and return the result. The type is taken
13066 from the type of ARG0 and is used for setting the precision of the
13067 calculation and results. */
13070 do_mpfr_remquo (tree arg0, tree arg1, tree arg_quo)
13072 tree const type = TREE_TYPE (arg0);
13073 tree result = NULL_TREE;
13078 /* To proceed, MPFR must exactly represent the target floating point
13079 format, which only happens when the target base equals two. */
13080 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
13081 && TREE_CODE (arg0) == REAL_CST && !TREE_OVERFLOW (arg0)
13082 && TREE_CODE (arg1) == REAL_CST && !TREE_OVERFLOW (arg1))
13084 const REAL_VALUE_TYPE *const ra0 = TREE_REAL_CST_PTR (arg0);
13085 const REAL_VALUE_TYPE *const ra1 = TREE_REAL_CST_PTR (arg1);
13087 if (real_isfinite (ra0) && real_isfinite (ra1))
13089 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
13090 const int prec = fmt->p;
13091 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
13096 mpfr_inits2 (prec, m0, m1, NULL);
13097 mpfr_from_real (m0, ra0, GMP_RNDN);
13098 mpfr_from_real (m1, ra1, GMP_RNDN);
13099 mpfr_clear_flags ();
13100 mpfr_remquo (m0, &integer_quo, m0, m1, rnd);
13101 /* Remquo is independent of the rounding mode, so pass
13102 inexact=0 to do_mpfr_ckconv(). */
13103 result_rem = do_mpfr_ckconv (m0, type, /*inexact=*/ 0);
13104 mpfr_clears (m0, m1, NULL);
13107 /* MPFR calculates quo in the host's long so it may
13108 return more bits in quo than the target int can hold
13109 if sizeof(host long) > sizeof(target int). This can
13110 happen even for native compilers in LP64 mode. In
13111 these cases, modulo the quo value with the largest
13112 number that the target int can hold while leaving one
13113 bit for the sign. */
13114 if (sizeof (integer_quo) * CHAR_BIT > INT_TYPE_SIZE)
13115 integer_quo %= (long)(1UL << (INT_TYPE_SIZE - 1));
13117 /* Dereference the quo pointer argument. */
13118 arg_quo = build_fold_indirect_ref (arg_quo);
13119 /* Proceed iff a valid pointer type was passed in. */
13120 if (TYPE_MAIN_VARIANT (TREE_TYPE (arg_quo)) == integer_type_node)
13122 /* Set the value. */
13124 = fold_build2 (MODIFY_EXPR, TREE_TYPE (arg_quo), arg_quo,
13125 build_int_cst (TREE_TYPE (arg_quo),
13127 TREE_SIDE_EFFECTS (result_quo) = 1;
13128 /* Combine the quo assignment with the rem. */
13129 result = non_lvalue (fold_build2 (COMPOUND_EXPR, type,
13130 result_quo, result_rem));
13138 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
13139 resulting value as a tree with type TYPE. The mpfr precision is
13140 set to the precision of TYPE. We assume that this mpfr function
13141 returns zero if the result could be calculated exactly within the
13142 requested precision. In addition, the integer pointer represented
13143 by ARG_SG will be dereferenced and set to the appropriate signgam
13147 do_mpfr_lgamma_r (tree arg, tree arg_sg, tree type)
13149 tree result = NULL_TREE;
13153 /* To proceed, MPFR must exactly represent the target floating point
13154 format, which only happens when the target base equals two. Also
13155 verify ARG is a constant and that ARG_SG is an int pointer. */
13156 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
13157 && TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg)
13158 && TREE_CODE (TREE_TYPE (arg_sg)) == POINTER_TYPE
13159 && TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (arg_sg))) == integer_type_node)
13161 const REAL_VALUE_TYPE *const ra = TREE_REAL_CST_PTR (arg);
13163 /* In addition to NaN and Inf, the argument cannot be zero or a
13164 negative integer. */
13165 if (real_isfinite (ra)
13166 && ra->cl != rvc_zero
13167 && !(real_isneg(ra) && real_isinteger(ra, TYPE_MODE (type))))
13169 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
13170 const int prec = fmt->p;
13171 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
13176 mpfr_init2 (m, prec);
13177 mpfr_from_real (m, ra, GMP_RNDN);
13178 mpfr_clear_flags ();
13179 inexact = mpfr_lgamma (m, &sg, m, rnd);
13180 result_lg = do_mpfr_ckconv (m, type, inexact);
13186 /* Dereference the arg_sg pointer argument. */
13187 arg_sg = build_fold_indirect_ref (arg_sg);
13188 /* Assign the signgam value into *arg_sg. */
13189 result_sg = fold_build2 (MODIFY_EXPR,
13190 TREE_TYPE (arg_sg), arg_sg,
13191 build_int_cst (TREE_TYPE (arg_sg), sg));
13192 TREE_SIDE_EFFECTS (result_sg) = 1;
13193 /* Combine the signgam assignment with the lgamma result. */
13194 result = non_lvalue (fold_build2 (COMPOUND_EXPR, type,
13195 result_sg, result_lg));
13203 /* If argument ARG is a COMPLEX_CST, call the one-argument mpc
13204 function FUNC on it and return the resulting value as a tree with
13205 type TYPE. The mpfr precision is set to the precision of TYPE. We
13206 assume that function FUNC returns zero if the result could be
13207 calculated exactly within the requested precision. */
13210 do_mpc_arg1 (tree arg, tree type, int (*func)(mpc_ptr, mpc_srcptr, mpc_rnd_t))
13212 tree result = NULL_TREE;
13216 /* To proceed, MPFR must exactly represent the target floating point
13217 format, which only happens when the target base equals two. */
13218 if (TREE_CODE (arg) == COMPLEX_CST && !TREE_OVERFLOW (arg)
13219 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) == REAL_TYPE
13220 && REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (TREE_TYPE (arg))))->b == 2)
13222 const REAL_VALUE_TYPE *const re = TREE_REAL_CST_PTR (TREE_REALPART (arg));
13223 const REAL_VALUE_TYPE *const im = TREE_REAL_CST_PTR (TREE_IMAGPART (arg));
13225 if (real_isfinite (re) && real_isfinite (im))
13227 const struct real_format *const fmt =
13228 REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (type)));
13229 const int prec = fmt->p;
13230 const mp_rnd_t rnd = fmt->round_towards_zero ? GMP_RNDZ : GMP_RNDN;
13231 const mpc_rnd_t crnd = fmt->round_towards_zero ? MPC_RNDZZ : MPC_RNDNN;
13235 mpc_init2 (m, prec);
13236 mpfr_from_real (mpc_realref(m), re, rnd);
13237 mpfr_from_real (mpc_imagref(m), im, rnd);
13238 mpfr_clear_flags ();
13239 inexact = func (m, m, crnd);
13240 result = do_mpc_ckconv (m, type, inexact, /*force_convert=*/ 0);
13248 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
13249 mpc function FUNC on it and return the resulting value as a tree
13250 with type TYPE. The mpfr precision is set to the precision of
13251 TYPE. We assume that function FUNC returns zero if the result
13252 could be calculated exactly within the requested precision. If
13253 DO_NONFINITE is true, then fold expressions containing Inf or NaN
13254 in the arguments and/or results. */
13257 do_mpc_arg2 (tree arg0, tree arg1, tree type, int do_nonfinite,
13258 int (*func)(mpc_ptr, mpc_srcptr, mpc_srcptr, mpc_rnd_t))
13260 tree result = NULL_TREE;
13265 /* To proceed, MPFR must exactly represent the target floating point
13266 format, which only happens when the target base equals two. */
13267 if (TREE_CODE (arg0) == COMPLEX_CST && !TREE_OVERFLOW (arg0)
13268 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE
13269 && TREE_CODE (arg1) == COMPLEX_CST && !TREE_OVERFLOW (arg1)
13270 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg1))) == REAL_TYPE
13271 && REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (TREE_TYPE (arg0))))->b == 2)
13273 const REAL_VALUE_TYPE *const re0 = TREE_REAL_CST_PTR (TREE_REALPART (arg0));
13274 const REAL_VALUE_TYPE *const im0 = TREE_REAL_CST_PTR (TREE_IMAGPART (arg0));
13275 const REAL_VALUE_TYPE *const re1 = TREE_REAL_CST_PTR (TREE_REALPART (arg1));
13276 const REAL_VALUE_TYPE *const im1 = TREE_REAL_CST_PTR (TREE_IMAGPART (arg1));
13279 || (real_isfinite (re0) && real_isfinite (im0)
13280 && real_isfinite (re1) && real_isfinite (im1)))
13282 const struct real_format *const fmt =
13283 REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (type)));
13284 const int prec = fmt->p;
13285 const mp_rnd_t rnd = fmt->round_towards_zero ? GMP_RNDZ : GMP_RNDN;
13286 const mpc_rnd_t crnd = fmt->round_towards_zero ? MPC_RNDZZ : MPC_RNDNN;
13290 mpc_init2 (m0, prec);
13291 mpc_init2 (m1, prec);
13292 mpfr_from_real (mpc_realref(m0), re0, rnd);
13293 mpfr_from_real (mpc_imagref(m0), im0, rnd);
13294 mpfr_from_real (mpc_realref(m1), re1, rnd);
13295 mpfr_from_real (mpc_imagref(m1), im1, rnd);
13296 mpfr_clear_flags ();
13297 inexact = func (m0, m0, m1, crnd);
13298 result = do_mpc_ckconv (m0, type, inexact, do_nonfinite);
13307 /* Fold a call STMT to __{,v}sprintf_chk. Return NULL_TREE if
13308 a normal call should be emitted rather than expanding the function
13309 inline. FCODE is either BUILT_IN_SPRINTF_CHK or BUILT_IN_VSPRINTF_CHK. */
13312 gimple_fold_builtin_sprintf_chk (gimple stmt, enum built_in_function fcode)
13314 int nargs = gimple_call_num_args (stmt);
13316 return fold_builtin_sprintf_chk_1 (gimple_location (stmt), nargs,
13318 ? gimple_call_arg_ptr (stmt, 0)
13319 : &error_mark_node), fcode);
13322 /* Fold a call STMT to {,v}snprintf. Return NULL_TREE if
13323 a normal call should be emitted rather than expanding the function
13324 inline. FCODE is either BUILT_IN_SNPRINTF_CHK or
13325 BUILT_IN_VSNPRINTF_CHK. If MAXLEN is not NULL, it is maximum length
13326 passed as second argument. */
13329 gimple_fold_builtin_snprintf_chk (gimple stmt, tree maxlen,
13330 enum built_in_function fcode)
13332 int nargs = gimple_call_num_args (stmt);
13334 return fold_builtin_snprintf_chk_1 (gimple_location (stmt), nargs,
13336 ? gimple_call_arg_ptr (stmt, 0)
13337 : &error_mark_node), maxlen, fcode);
13340 /* Builtins with folding operations that operate on "..." arguments
13341 need special handling; we need to store the arguments in a convenient
13342 data structure before attempting any folding. Fortunately there are
13343 only a few builtins that fall into this category. FNDECL is the
13344 function, EXP is the CALL_EXPR for the call, and IGNORE is true if the
13345 result of the function call is ignored. */
13348 gimple_fold_builtin_varargs (tree fndecl, gimple stmt,
13349 bool ignore ATTRIBUTE_UNUSED)
13351 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
13352 tree ret = NULL_TREE;
13356 case BUILT_IN_SPRINTF_CHK:
13357 case BUILT_IN_VSPRINTF_CHK:
13358 ret = gimple_fold_builtin_sprintf_chk (stmt, fcode);
13361 case BUILT_IN_SNPRINTF_CHK:
13362 case BUILT_IN_VSNPRINTF_CHK:
13363 ret = gimple_fold_builtin_snprintf_chk (stmt, NULL_TREE, fcode);
13370 ret = build1 (NOP_EXPR, TREE_TYPE (ret), ret);
13371 TREE_NO_WARNING (ret) = 1;
13377 /* A wrapper function for builtin folding that prevents warnings for
13378 "statement without effect" and the like, caused by removing the
13379 call node earlier than the warning is generated. */
13382 fold_call_stmt (gimple stmt, bool ignore)
13384 tree ret = NULL_TREE;
13385 tree fndecl = gimple_call_fndecl (stmt);
13386 location_t loc = gimple_location (stmt);
13388 && TREE_CODE (fndecl) == FUNCTION_DECL
13389 && DECL_BUILT_IN (fndecl)
13390 && !gimple_call_va_arg_pack_p (stmt))
13392 int nargs = gimple_call_num_args (stmt);
13393 tree *args = (nargs > 0
13394 ? gimple_call_arg_ptr (stmt, 0)
13395 : &error_mark_node);
13397 if (avoid_folding_inline_builtin (fndecl))
13399 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
13401 return targetm.fold_builtin (fndecl, nargs, args, ignore);
13405 if (nargs <= MAX_ARGS_TO_FOLD_BUILTIN)
13406 ret = fold_builtin_n (loc, fndecl, args, nargs, ignore);
13408 ret = gimple_fold_builtin_varargs (fndecl, stmt, ignore);
13411 /* Propagate location information from original call to
13412 expansion of builtin. Otherwise things like
13413 maybe_emit_chk_warning, that operate on the expansion
13414 of a builtin, will use the wrong location information. */
13415 if (gimple_has_location (stmt))
13417 tree realret = ret;
13418 if (TREE_CODE (ret) == NOP_EXPR)
13419 realret = TREE_OPERAND (ret, 0);
13420 if (CAN_HAVE_LOCATION_P (realret)
13421 && !EXPR_HAS_LOCATION (realret))
13422 SET_EXPR_LOCATION (realret, loc);
13432 /* Look up the function in built_in_decls that corresponds to DECL
13433 and set ASMSPEC as its user assembler name. DECL must be a
13434 function decl that declares a builtin. */
13437 set_builtin_user_assembler_name (tree decl, const char *asmspec)
13440 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL
13441 && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
13444 builtin = built_in_decls [DECL_FUNCTION_CODE (decl)];
13445 set_user_assembler_name (builtin, asmspec);
13446 switch (DECL_FUNCTION_CODE (decl))
13448 case BUILT_IN_MEMCPY:
13449 init_block_move_fn (asmspec);
13450 memcpy_libfunc = set_user_assembler_libfunc ("memcpy", asmspec);
13452 case BUILT_IN_MEMSET:
13453 init_block_clear_fn (asmspec);
13454 memset_libfunc = set_user_assembler_libfunc ("memset", asmspec);
13456 case BUILT_IN_MEMMOVE:
13457 memmove_libfunc = set_user_assembler_libfunc ("memmove", asmspec);
13459 case BUILT_IN_MEMCMP:
13460 memcmp_libfunc = set_user_assembler_libfunc ("memcmp", asmspec);
13462 case BUILT_IN_ABORT:
13463 abort_libfunc = set_user_assembler_libfunc ("abort", asmspec);
13466 if (INT_TYPE_SIZE < BITS_PER_WORD)
13468 set_user_assembler_libfunc ("ffs", asmspec);
13469 set_optab_libfunc (ffs_optab, mode_for_size (INT_TYPE_SIZE,
13470 MODE_INT, 0), "ffs");
13478 /* Return true if DECL is a builtin that expands to a constant or similarly
13481 is_simple_builtin (tree decl)
13483 if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL)
13484 switch (DECL_FUNCTION_CODE (decl))
13486 /* Builtins that expand to constants. */
13487 case BUILT_IN_CONSTANT_P:
13488 case BUILT_IN_EXPECT:
13489 case BUILT_IN_OBJECT_SIZE:
13490 case BUILT_IN_UNREACHABLE:
13491 /* Simple register moves or loads from stack. */
13492 case BUILT_IN_ASSUME_ALIGNED:
13493 case BUILT_IN_RETURN_ADDRESS:
13494 case BUILT_IN_EXTRACT_RETURN_ADDR:
13495 case BUILT_IN_FROB_RETURN_ADDR:
13496 case BUILT_IN_RETURN:
13497 case BUILT_IN_AGGREGATE_INCOMING_ADDRESS:
13498 case BUILT_IN_FRAME_ADDRESS:
13499 case BUILT_IN_VA_END:
13500 case BUILT_IN_STACK_SAVE:
13501 case BUILT_IN_STACK_RESTORE:
13502 /* Exception state returns or moves registers around. */
13503 case BUILT_IN_EH_FILTER:
13504 case BUILT_IN_EH_POINTER:
13505 case BUILT_IN_EH_COPY_VALUES:
13515 /* Return true if DECL is a builtin that is not expensive, i.e., they are
13516 most probably expanded inline into reasonably simple code. This is a
13517 superset of is_simple_builtin. */
13519 is_inexpensive_builtin (tree decl)
13523 else if (DECL_BUILT_IN_CLASS (decl) == BUILT_IN_MD)
13525 else if (DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL)
13526 switch (DECL_FUNCTION_CODE (decl))
13529 case BUILT_IN_ALLOCA:
13530 case BUILT_IN_BSWAP32:
13531 case BUILT_IN_BSWAP64:
13533 case BUILT_IN_CLZIMAX:
13534 case BUILT_IN_CLZL:
13535 case BUILT_IN_CLZLL:
13537 case BUILT_IN_CTZIMAX:
13538 case BUILT_IN_CTZL:
13539 case BUILT_IN_CTZLL:
13541 case BUILT_IN_FFSIMAX:
13542 case BUILT_IN_FFSL:
13543 case BUILT_IN_FFSLL:
13544 case BUILT_IN_IMAXABS:
13545 case BUILT_IN_FINITE:
13546 case BUILT_IN_FINITEF:
13547 case BUILT_IN_FINITEL:
13548 case BUILT_IN_FINITED32:
13549 case BUILT_IN_FINITED64:
13550 case BUILT_IN_FINITED128:
13551 case BUILT_IN_FPCLASSIFY:
13552 case BUILT_IN_ISFINITE:
13553 case BUILT_IN_ISINF_SIGN:
13554 case BUILT_IN_ISINF:
13555 case BUILT_IN_ISINFF:
13556 case BUILT_IN_ISINFL:
13557 case BUILT_IN_ISINFD32:
13558 case BUILT_IN_ISINFD64:
13559 case BUILT_IN_ISINFD128:
13560 case BUILT_IN_ISNAN:
13561 case BUILT_IN_ISNANF:
13562 case BUILT_IN_ISNANL:
13563 case BUILT_IN_ISNAND32:
13564 case BUILT_IN_ISNAND64:
13565 case BUILT_IN_ISNAND128:
13566 case BUILT_IN_ISNORMAL:
13567 case BUILT_IN_ISGREATER:
13568 case BUILT_IN_ISGREATEREQUAL:
13569 case BUILT_IN_ISLESS:
13570 case BUILT_IN_ISLESSEQUAL:
13571 case BUILT_IN_ISLESSGREATER:
13572 case BUILT_IN_ISUNORDERED:
13573 case BUILT_IN_VA_ARG_PACK:
13574 case BUILT_IN_VA_ARG_PACK_LEN:
13575 case BUILT_IN_VA_COPY:
13576 case BUILT_IN_TRAP:
13577 case BUILT_IN_SAVEREGS:
13578 case BUILT_IN_POPCOUNTL:
13579 case BUILT_IN_POPCOUNTLL:
13580 case BUILT_IN_POPCOUNTIMAX:
13581 case BUILT_IN_POPCOUNT:
13582 case BUILT_IN_PARITYL:
13583 case BUILT_IN_PARITYLL:
13584 case BUILT_IN_PARITYIMAX:
13585 case BUILT_IN_PARITY:
13586 case BUILT_IN_LABS:
13587 case BUILT_IN_LLABS:
13588 case BUILT_IN_PREFETCH:
13592 return is_simple_builtin (decl);