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
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"
47 #include "langhooks.h"
48 #include "basic-block.h"
49 #include "tree-mudflap.h"
50 #include "tree-flow.h"
51 #include "value-prof.h"
52 #include "diagnostic.h"
54 #ifndef SLOW_UNALIGNED_ACCESS
55 #define SLOW_UNALIGNED_ACCESS(MODE, ALIGN) STRICT_ALIGNMENT
58 #ifndef PAD_VARARGS_DOWN
59 #define PAD_VARARGS_DOWN BYTES_BIG_ENDIAN
62 static tree do_mpc_arg1 (tree, tree, int (*)(mpc_ptr, mpc_srcptr, mpc_rnd_t));
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_interclass_mathfn (tree, rtx, rtx);
106 static rtx expand_builtin_sincos (tree);
107 static rtx expand_builtin_cexpi (tree, rtx, rtx);
108 static rtx expand_builtin_int_roundingfn (tree, rtx);
109 static rtx expand_builtin_int_roundingfn_2 (tree, rtx);
110 static rtx expand_builtin_args_info (tree);
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, rtx);
133 static rtx expand_builtin_unop (enum machine_mode, tree, rtx, rtx, optab);
134 static rtx expand_builtin_frame_address (tree, tree);
135 static rtx expand_builtin_printf (tree, rtx, enum machine_mode, bool);
136 static rtx expand_builtin_fprintf (tree, rtx, enum machine_mode, bool);
137 static rtx expand_builtin_sprintf (tree, rtx, enum machine_mode);
138 static tree stabilize_va_list_loc (location_t, tree, int);
139 static rtx expand_builtin_expect (tree, rtx);
140 static tree fold_builtin_constant_p (tree);
141 static tree fold_builtin_expect (location_t, tree, tree);
142 static tree fold_builtin_classify_type (tree);
143 static tree fold_builtin_strlen (location_t, tree);
144 static tree fold_builtin_inf (location_t, tree, int);
145 static tree fold_builtin_nan (tree, tree, int);
146 static tree rewrite_call_expr (location_t, tree, int, tree, int, ...);
147 static bool validate_arg (const_tree, enum tree_code code);
148 static bool integer_valued_real_p (tree);
149 static tree fold_trunc_transparent_mathfn (location_t, tree, tree);
150 static bool readonly_data_expr (tree);
151 static rtx expand_builtin_fabs (tree, rtx, rtx);
152 static rtx expand_builtin_signbit (tree, rtx);
153 static tree fold_builtin_sqrt (location_t, tree, tree);
154 static tree fold_builtin_cbrt (location_t, tree, tree);
155 static tree fold_builtin_pow (location_t, tree, tree, tree, tree);
156 static tree fold_builtin_powi (location_t, tree, tree, tree, tree);
157 static tree fold_builtin_cos (location_t, tree, tree, tree);
158 static tree fold_builtin_cosh (location_t, tree, tree, tree);
159 static tree fold_builtin_tan (tree, tree);
160 static tree fold_builtin_trunc (location_t, tree, tree);
161 static tree fold_builtin_floor (location_t, tree, tree);
162 static tree fold_builtin_ceil (location_t, tree, tree);
163 static tree fold_builtin_round (location_t, tree, tree);
164 static tree fold_builtin_int_roundingfn (location_t, tree, tree);
165 static tree fold_builtin_bitop (tree, tree);
166 static tree fold_builtin_memory_op (location_t, tree, tree, tree, tree, bool, int);
167 static tree fold_builtin_strchr (location_t, tree, tree, tree);
168 static tree fold_builtin_memchr (location_t, tree, tree, tree, tree);
169 static tree fold_builtin_memcmp (location_t, tree, tree, tree);
170 static tree fold_builtin_strcmp (location_t, tree, tree);
171 static tree fold_builtin_strncmp (location_t, tree, tree, tree);
172 static tree fold_builtin_signbit (location_t, tree, tree);
173 static tree fold_builtin_copysign (location_t, tree, tree, tree, tree);
174 static tree fold_builtin_isascii (location_t, tree);
175 static tree fold_builtin_toascii (location_t, tree);
176 static tree fold_builtin_isdigit (location_t, tree);
177 static tree fold_builtin_fabs (location_t, tree, tree);
178 static tree fold_builtin_abs (location_t, tree, tree);
179 static tree fold_builtin_unordered_cmp (location_t, tree, tree, tree, enum tree_code,
181 static tree fold_builtin_n (location_t, tree, tree *, int, bool);
182 static tree fold_builtin_0 (location_t, tree, bool);
183 static tree fold_builtin_1 (location_t, tree, tree, bool);
184 static tree fold_builtin_2 (location_t, tree, tree, tree, bool);
185 static tree fold_builtin_3 (location_t, tree, tree, tree, tree, bool);
186 static tree fold_builtin_4 (location_t, tree, tree, tree, tree, tree, bool);
187 static tree fold_builtin_varargs (location_t, tree, tree, bool);
189 static tree fold_builtin_strpbrk (location_t, tree, tree, tree);
190 static tree fold_builtin_strstr (location_t, tree, tree, tree);
191 static tree fold_builtin_strrchr (location_t, tree, tree, tree);
192 static tree fold_builtin_strcat (location_t, tree, tree);
193 static tree fold_builtin_strncat (location_t, tree, tree, tree);
194 static tree fold_builtin_strspn (location_t, tree, tree);
195 static tree fold_builtin_strcspn (location_t, tree, tree);
196 static tree fold_builtin_sprintf (location_t, tree, tree, tree, int);
198 static rtx expand_builtin_object_size (tree);
199 static rtx expand_builtin_memory_chk (tree, rtx, enum machine_mode,
200 enum built_in_function);
201 static void maybe_emit_chk_warning (tree, enum built_in_function);
202 static void maybe_emit_sprintf_chk_warning (tree, enum built_in_function);
203 static void maybe_emit_free_warning (tree);
204 static tree fold_builtin_object_size (tree, tree);
205 static tree fold_builtin_strcat_chk (location_t, tree, tree, tree, tree);
206 static tree fold_builtin_strncat_chk (location_t, tree, tree, tree, tree, tree);
207 static tree fold_builtin_sprintf_chk (location_t, tree, enum built_in_function);
208 static tree fold_builtin_printf (location_t, tree, tree, tree, bool, enum built_in_function);
209 static tree fold_builtin_fprintf (location_t, tree, tree, tree, tree, bool,
210 enum built_in_function);
211 static bool init_target_chars (void);
213 static unsigned HOST_WIDE_INT target_newline;
214 static unsigned HOST_WIDE_INT target_percent;
215 static unsigned HOST_WIDE_INT target_c;
216 static unsigned HOST_WIDE_INT target_s;
217 static char target_percent_c[3];
218 static char target_percent_s[3];
219 static char target_percent_s_newline[4];
220 static tree do_mpfr_arg1 (tree, tree, int (*)(mpfr_ptr, mpfr_srcptr, mp_rnd_t),
221 const REAL_VALUE_TYPE *, const REAL_VALUE_TYPE *, bool);
222 static tree do_mpfr_arg2 (tree, tree, tree,
223 int (*)(mpfr_ptr, mpfr_srcptr, mpfr_srcptr, mp_rnd_t));
224 static tree do_mpfr_arg3 (tree, tree, tree, tree,
225 int (*)(mpfr_ptr, mpfr_srcptr, mpfr_srcptr, mpfr_srcptr, mp_rnd_t));
226 static tree do_mpfr_sincos (tree, tree, tree);
227 static tree do_mpfr_bessel_n (tree, tree, tree,
228 int (*)(mpfr_ptr, long, mpfr_srcptr, mp_rnd_t),
229 const REAL_VALUE_TYPE *, bool);
230 static tree do_mpfr_remquo (tree, tree, tree);
231 static tree do_mpfr_lgamma_r (tree, tree, tree);
233 /* Return true if NAME starts with __builtin_ or __sync_. */
236 is_builtin_name (const char *name)
238 if (strncmp (name, "__builtin_", 10) == 0)
240 if (strncmp (name, "__sync_", 7) == 0)
246 /* Return true if DECL is a function symbol representing a built-in. */
249 is_builtin_fn (tree decl)
251 return TREE_CODE (decl) == FUNCTION_DECL && DECL_BUILT_IN (decl);
255 /* Return true if NODE should be considered for inline expansion regardless
256 of the optimization level. This means whenever a function is invoked with
257 its "internal" name, which normally contains the prefix "__builtin". */
260 called_as_built_in (tree node)
262 /* Note that we must use DECL_NAME, not DECL_ASSEMBLER_NAME_SET_P since
263 we want the name used to call the function, not the name it
265 const char *name = IDENTIFIER_POINTER (DECL_NAME (node));
266 return is_builtin_name (name);
269 /* Return the alignment in bits of EXP, an object.
270 Don't return more than MAX_ALIGN no matter what, ALIGN is the inital
271 guessed alignment e.g. from type alignment. */
274 get_object_alignment (tree exp, unsigned int align, unsigned int max_align)
279 if (handled_component_p (exp))
281 HOST_WIDE_INT bitsize, bitpos;
283 enum machine_mode mode;
284 int unsignedp, volatilep;
286 exp = get_inner_reference (exp, &bitsize, &bitpos, &offset,
287 &mode, &unsignedp, &volatilep, true);
289 inner = MIN (inner, (unsigned) (bitpos & -bitpos));
294 if (TREE_CODE (offset) == PLUS_EXPR)
296 next_offset = TREE_OPERAND (offset, 0);
297 offset = TREE_OPERAND (offset, 1);
301 if (host_integerp (offset, 1))
303 /* Any overflow in calculating offset_bits won't change
306 = ((unsigned) tree_low_cst (offset, 1) * BITS_PER_UNIT);
309 inner = MIN (inner, (offset_bits & -offset_bits));
311 else if (TREE_CODE (offset) == MULT_EXPR
312 && host_integerp (TREE_OPERAND (offset, 1), 1))
314 /* Any overflow in calculating offset_factor won't change
316 unsigned offset_factor
317 = ((unsigned) tree_low_cst (TREE_OPERAND (offset, 1), 1)
321 inner = MIN (inner, (offset_factor & -offset_factor));
325 inner = MIN (inner, BITS_PER_UNIT);
328 offset = next_offset;
332 align = MIN (inner, DECL_ALIGN (exp));
333 #ifdef CONSTANT_ALIGNMENT
334 else if (CONSTANT_CLASS_P (exp))
335 align = MIN (inner, (unsigned)CONSTANT_ALIGNMENT (exp, align));
337 else if (TREE_CODE (exp) == VIEW_CONVERT_EXPR
338 || TREE_CODE (exp) == INDIRECT_REF)
339 align = MIN (TYPE_ALIGN (TREE_TYPE (exp)), inner);
341 align = MIN (align, inner);
342 return MIN (align, max_align);
345 /* Returns true iff we can trust that alignment information has been
346 calculated properly. */
349 can_trust_pointer_alignment (void)
351 /* We rely on TER to compute accurate alignment information. */
352 return (optimize && flag_tree_ter);
355 /* Return the alignment in bits of EXP, a pointer valued expression.
356 But don't return more than MAX_ALIGN no matter what.
357 The alignment returned is, by default, the alignment of the thing that
358 EXP points to. If it is not a POINTER_TYPE, 0 is returned.
360 Otherwise, look at the expression to see if we can do better, i.e., if the
361 expression is actually pointing at an object whose alignment is tighter. */
364 get_pointer_alignment (tree exp, unsigned int max_align)
366 unsigned int align, inner;
368 if (!can_trust_pointer_alignment ())
371 if (!POINTER_TYPE_P (TREE_TYPE (exp)))
374 align = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (exp)));
375 align = MIN (align, max_align);
379 switch (TREE_CODE (exp))
382 exp = TREE_OPERAND (exp, 0);
383 if (! POINTER_TYPE_P (TREE_TYPE (exp)))
386 inner = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (exp)));
387 align = MIN (inner, max_align);
390 case POINTER_PLUS_EXPR:
391 /* If sum of pointer + int, restrict our maximum alignment to that
392 imposed by the integer. If not, we can't do any better than
394 if (! host_integerp (TREE_OPERAND (exp, 1), 1))
397 while (((tree_low_cst (TREE_OPERAND (exp, 1), 1))
398 & (max_align / BITS_PER_UNIT - 1))
402 exp = TREE_OPERAND (exp, 0);
406 /* See what we are pointing at and look at its alignment. */
407 return get_object_alignment (TREE_OPERAND (exp, 0), align, max_align);
415 /* Compute the length of a C string. TREE_STRING_LENGTH is not the right
416 way, because it could contain a zero byte in the middle.
417 TREE_STRING_LENGTH is the size of the character array, not the string.
419 ONLY_VALUE should be nonzero if the result is not going to be emitted
420 into the instruction stream and zero if it is going to be expanded.
421 E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3
422 is returned, otherwise NULL, since
423 len = c_strlen (src, 1); if (len) expand_expr (len, ...); would not
424 evaluate the side-effects.
426 The value returned is of type `ssizetype'.
428 Unfortunately, string_constant can't access the values of const char
429 arrays with initializers, so neither can we do so here. */
432 c_strlen (tree src, int only_value)
435 HOST_WIDE_INT offset;
440 if (TREE_CODE (src) == COND_EXPR
441 && (only_value || !TREE_SIDE_EFFECTS (TREE_OPERAND (src, 0))))
445 len1 = c_strlen (TREE_OPERAND (src, 1), only_value);
446 len2 = c_strlen (TREE_OPERAND (src, 2), only_value);
447 if (tree_int_cst_equal (len1, len2))
451 if (TREE_CODE (src) == COMPOUND_EXPR
452 && (only_value || !TREE_SIDE_EFFECTS (TREE_OPERAND (src, 0))))
453 return c_strlen (TREE_OPERAND (src, 1), only_value);
455 src = string_constant (src, &offset_node);
459 max = TREE_STRING_LENGTH (src) - 1;
460 ptr = TREE_STRING_POINTER (src);
462 if (offset_node && TREE_CODE (offset_node) != INTEGER_CST)
464 /* If the string has an internal zero byte (e.g., "foo\0bar"), we can't
465 compute the offset to the following null if we don't know where to
466 start searching for it. */
469 for (i = 0; i < max; i++)
473 /* We don't know the starting offset, but we do know that the string
474 has no internal zero bytes. We can assume that the offset falls
475 within the bounds of the string; otherwise, the programmer deserves
476 what he gets. Subtract the offset from the length of the string,
477 and return that. This would perhaps not be valid if we were dealing
478 with named arrays in addition to literal string constants. */
480 return size_diffop_loc (input_location, size_int (max), offset_node);
483 /* We have a known offset into the string. Start searching there for
484 a null character if we can represent it as a single HOST_WIDE_INT. */
485 if (offset_node == 0)
487 else if (! host_integerp (offset_node, 0))
490 offset = tree_low_cst (offset_node, 0);
492 /* If the offset is known to be out of bounds, warn, and call strlen at
494 if (offset < 0 || offset > max)
496 /* Suppress multiple warnings for propagated constant strings. */
497 if (! TREE_NO_WARNING (src))
499 warning (0, "offset outside bounds of constant string");
500 TREE_NO_WARNING (src) = 1;
505 /* Use strlen to search for the first zero byte. Since any strings
506 constructed with build_string will have nulls appended, we win even
507 if we get handed something like (char[4])"abcd".
509 Since OFFSET is our starting index into the string, no further
510 calculation is needed. */
511 return ssize_int (strlen (ptr + offset));
514 /* Return a char pointer for a C string if it is a string constant
515 or sum of string constant and integer constant. */
522 src = string_constant (src, &offset_node);
526 if (offset_node == 0)
527 return TREE_STRING_POINTER (src);
528 else if (!host_integerp (offset_node, 1)
529 || compare_tree_int (offset_node, TREE_STRING_LENGTH (src) - 1) > 0)
532 return TREE_STRING_POINTER (src) + tree_low_cst (offset_node, 1);
535 /* Return a CONST_INT or CONST_DOUBLE corresponding to target reading
536 GET_MODE_BITSIZE (MODE) bits from string constant STR. */
539 c_readstr (const char *str, enum machine_mode mode)
545 gcc_assert (GET_MODE_CLASS (mode) == MODE_INT);
550 for (i = 0; i < GET_MODE_SIZE (mode); i++)
553 if (WORDS_BIG_ENDIAN)
554 j = GET_MODE_SIZE (mode) - i - 1;
555 if (BYTES_BIG_ENDIAN != WORDS_BIG_ENDIAN
556 && GET_MODE_SIZE (mode) > UNITS_PER_WORD)
557 j = j + UNITS_PER_WORD - 2 * (j % UNITS_PER_WORD) - 1;
559 gcc_assert (j <= 2 * HOST_BITS_PER_WIDE_INT);
562 ch = (unsigned char) str[i];
563 c[j / HOST_BITS_PER_WIDE_INT] |= ch << (j % HOST_BITS_PER_WIDE_INT);
565 return immed_double_const (c[0], c[1], mode);
568 /* Cast a target constant CST to target CHAR and if that value fits into
569 host char type, return zero and put that value into variable pointed to by
573 target_char_cast (tree cst, char *p)
575 unsigned HOST_WIDE_INT val, hostval;
577 if (!host_integerp (cst, 1)
578 || CHAR_TYPE_SIZE > HOST_BITS_PER_WIDE_INT)
581 val = tree_low_cst (cst, 1);
582 if (CHAR_TYPE_SIZE < HOST_BITS_PER_WIDE_INT)
583 val &= (((unsigned HOST_WIDE_INT) 1) << CHAR_TYPE_SIZE) - 1;
586 if (HOST_BITS_PER_CHAR < HOST_BITS_PER_WIDE_INT)
587 hostval &= (((unsigned HOST_WIDE_INT) 1) << HOST_BITS_PER_CHAR) - 1;
596 /* Similar to save_expr, but assumes that arbitrary code is not executed
597 in between the multiple evaluations. In particular, we assume that a
598 non-addressable local variable will not be modified. */
601 builtin_save_expr (tree exp)
603 if (TREE_ADDRESSABLE (exp) == 0
604 && (TREE_CODE (exp) == PARM_DECL
605 || (TREE_CODE (exp) == VAR_DECL && !TREE_STATIC (exp))))
608 return save_expr (exp);
611 /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT
612 times to get the address of either a higher stack frame, or a return
613 address located within it (depending on FNDECL_CODE). */
616 expand_builtin_return_addr (enum built_in_function fndecl_code, int count)
620 #ifdef INITIAL_FRAME_ADDRESS_RTX
621 rtx tem = INITIAL_FRAME_ADDRESS_RTX;
625 /* For a zero count with __builtin_return_address, we don't care what
626 frame address we return, because target-specific definitions will
627 override us. Therefore frame pointer elimination is OK, and using
628 the soft frame pointer is OK.
630 For a nonzero count, or a zero count with __builtin_frame_address,
631 we require a stable offset from the current frame pointer to the
632 previous one, so we must use the hard frame pointer, and
633 we must disable frame pointer elimination. */
634 if (count == 0 && fndecl_code == BUILT_IN_RETURN_ADDRESS)
635 tem = frame_pointer_rtx;
638 tem = hard_frame_pointer_rtx;
640 /* Tell reload not to eliminate the frame pointer. */
641 crtl->accesses_prior_frames = 1;
645 /* Some machines need special handling before we can access
646 arbitrary frames. For example, on the SPARC, we must first flush
647 all register windows to the stack. */
648 #ifdef SETUP_FRAME_ADDRESSES
650 SETUP_FRAME_ADDRESSES ();
653 /* On the SPARC, the return address is not in the frame, it is in a
654 register. There is no way to access it off of the current frame
655 pointer, but it can be accessed off the previous frame pointer by
656 reading the value from the register window save area. */
657 #ifdef RETURN_ADDR_IN_PREVIOUS_FRAME
658 if (fndecl_code == BUILT_IN_RETURN_ADDRESS)
662 /* Scan back COUNT frames to the specified frame. */
663 for (i = 0; i < count; i++)
665 /* Assume the dynamic chain pointer is in the word that the
666 frame address points to, unless otherwise specified. */
667 #ifdef DYNAMIC_CHAIN_ADDRESS
668 tem = DYNAMIC_CHAIN_ADDRESS (tem);
670 tem = memory_address (Pmode, tem);
671 tem = gen_frame_mem (Pmode, tem);
672 tem = copy_to_reg (tem);
675 /* For __builtin_frame_address, return what we've got. But, on
676 the SPARC for example, we may have to add a bias. */
677 if (fndecl_code == BUILT_IN_FRAME_ADDRESS)
678 #ifdef FRAME_ADDR_RTX
679 return FRAME_ADDR_RTX (tem);
684 /* For __builtin_return_address, get the return address from that frame. */
685 #ifdef RETURN_ADDR_RTX
686 tem = RETURN_ADDR_RTX (count, tem);
688 tem = memory_address (Pmode,
689 plus_constant (tem, GET_MODE_SIZE (Pmode)));
690 tem = gen_frame_mem (Pmode, tem);
695 /* Alias set used for setjmp buffer. */
696 static alias_set_type setjmp_alias_set = -1;
698 /* Construct the leading half of a __builtin_setjmp call. Control will
699 return to RECEIVER_LABEL. This is also called directly by the SJLJ
700 exception handling code. */
703 expand_builtin_setjmp_setup (rtx buf_addr, rtx receiver_label)
705 enum machine_mode sa_mode = STACK_SAVEAREA_MODE (SAVE_NONLOCAL);
709 if (setjmp_alias_set == -1)
710 setjmp_alias_set = new_alias_set ();
712 buf_addr = convert_memory_address (Pmode, buf_addr);
714 buf_addr = force_reg (Pmode, force_operand (buf_addr, NULL_RTX));
716 /* We store the frame pointer and the address of receiver_label in
717 the buffer and use the rest of it for the stack save area, which
718 is machine-dependent. */
720 mem = gen_rtx_MEM (Pmode, buf_addr);
721 set_mem_alias_set (mem, setjmp_alias_set);
722 emit_move_insn (mem, targetm.builtin_setjmp_frame_value ());
724 mem = gen_rtx_MEM (Pmode, plus_constant (buf_addr, GET_MODE_SIZE (Pmode))),
725 set_mem_alias_set (mem, setjmp_alias_set);
727 emit_move_insn (validize_mem (mem),
728 force_reg (Pmode, gen_rtx_LABEL_REF (Pmode, receiver_label)));
730 stack_save = gen_rtx_MEM (sa_mode,
731 plus_constant (buf_addr,
732 2 * GET_MODE_SIZE (Pmode)));
733 set_mem_alias_set (stack_save, setjmp_alias_set);
734 emit_stack_save (SAVE_NONLOCAL, &stack_save, NULL_RTX);
736 /* If there is further processing to do, do it. */
737 #ifdef HAVE_builtin_setjmp_setup
738 if (HAVE_builtin_setjmp_setup)
739 emit_insn (gen_builtin_setjmp_setup (buf_addr));
742 /* Tell optimize_save_area_alloca that extra work is going to
743 need to go on during alloca. */
744 cfun->calls_setjmp = 1;
746 /* We have a nonlocal label. */
747 cfun->has_nonlocal_label = 1;
750 /* Construct the trailing part of a __builtin_setjmp call. This is
751 also called directly by the SJLJ exception handling code. */
754 expand_builtin_setjmp_receiver (rtx receiver_label ATTRIBUTE_UNUSED)
758 /* Clobber the FP when we get here, so we have to make sure it's
759 marked as used by this function. */
760 emit_use (hard_frame_pointer_rtx);
762 /* Mark the static chain as clobbered here so life information
763 doesn't get messed up for it. */
764 chain = targetm.calls.static_chain (current_function_decl, true);
765 if (chain && REG_P (chain))
766 emit_clobber (chain);
768 /* Now put in the code to restore the frame pointer, and argument
769 pointer, if needed. */
770 #ifdef HAVE_nonlocal_goto
771 if (! HAVE_nonlocal_goto)
774 emit_move_insn (virtual_stack_vars_rtx, hard_frame_pointer_rtx);
775 /* This might change the hard frame pointer in ways that aren't
776 apparent to early optimization passes, so force a clobber. */
777 emit_clobber (hard_frame_pointer_rtx);
780 #if ARG_POINTER_REGNUM != HARD_FRAME_POINTER_REGNUM
781 if (fixed_regs[ARG_POINTER_REGNUM])
783 #ifdef ELIMINABLE_REGS
785 static const struct elims {const int from, to;} elim_regs[] = ELIMINABLE_REGS;
787 for (i = 0; i < ARRAY_SIZE (elim_regs); i++)
788 if (elim_regs[i].from == ARG_POINTER_REGNUM
789 && elim_regs[i].to == HARD_FRAME_POINTER_REGNUM)
792 if (i == ARRAY_SIZE (elim_regs))
795 /* Now restore our arg pointer from the address at which it
796 was saved in our stack frame. */
797 emit_move_insn (crtl->args.internal_arg_pointer,
798 copy_to_reg (get_arg_pointer_save_area ()));
803 #ifdef HAVE_builtin_setjmp_receiver
804 if (HAVE_builtin_setjmp_receiver)
805 emit_insn (gen_builtin_setjmp_receiver (receiver_label));
808 #ifdef HAVE_nonlocal_goto_receiver
809 if (HAVE_nonlocal_goto_receiver)
810 emit_insn (gen_nonlocal_goto_receiver ());
815 /* We must not allow the code we just generated to be reordered by
816 scheduling. Specifically, the update of the frame pointer must
817 happen immediately, not later. */
818 emit_insn (gen_blockage ());
821 /* __builtin_longjmp is passed a pointer to an array of five words (not
822 all will be used on all machines). It operates similarly to the C
823 library function of the same name, but is more efficient. Much of
824 the code below is copied from the handling of non-local gotos. */
827 expand_builtin_longjmp (rtx buf_addr, rtx value)
829 rtx fp, lab, stack, insn, last;
830 enum machine_mode sa_mode = STACK_SAVEAREA_MODE (SAVE_NONLOCAL);
832 /* DRAP is needed for stack realign if longjmp is expanded to current
834 if (SUPPORTS_STACK_ALIGNMENT)
835 crtl->need_drap = true;
837 if (setjmp_alias_set == -1)
838 setjmp_alias_set = new_alias_set ();
840 buf_addr = convert_memory_address (Pmode, buf_addr);
842 buf_addr = force_reg (Pmode, buf_addr);
844 /* We require that the user must pass a second argument of 1, because
845 that is what builtin_setjmp will return. */
846 gcc_assert (value == const1_rtx);
848 last = get_last_insn ();
849 #ifdef HAVE_builtin_longjmp
850 if (HAVE_builtin_longjmp)
851 emit_insn (gen_builtin_longjmp (buf_addr));
855 fp = gen_rtx_MEM (Pmode, buf_addr);
856 lab = gen_rtx_MEM (Pmode, plus_constant (buf_addr,
857 GET_MODE_SIZE (Pmode)));
859 stack = gen_rtx_MEM (sa_mode, plus_constant (buf_addr,
860 2 * GET_MODE_SIZE (Pmode)));
861 set_mem_alias_set (fp, setjmp_alias_set);
862 set_mem_alias_set (lab, setjmp_alias_set);
863 set_mem_alias_set (stack, setjmp_alias_set);
865 /* Pick up FP, label, and SP from the block and jump. This code is
866 from expand_goto in stmt.c; see there for detailed comments. */
867 #ifdef HAVE_nonlocal_goto
868 if (HAVE_nonlocal_goto)
869 /* We have to pass a value to the nonlocal_goto pattern that will
870 get copied into the static_chain pointer, but it does not matter
871 what that value is, because builtin_setjmp does not use it. */
872 emit_insn (gen_nonlocal_goto (value, lab, stack, fp));
876 lab = copy_to_reg (lab);
878 emit_clobber (gen_rtx_MEM (BLKmode, gen_rtx_SCRATCH (VOIDmode)));
879 emit_clobber (gen_rtx_MEM (BLKmode, hard_frame_pointer_rtx));
881 emit_move_insn (hard_frame_pointer_rtx, fp);
882 emit_stack_restore (SAVE_NONLOCAL, stack, NULL_RTX);
884 emit_use (hard_frame_pointer_rtx);
885 emit_use (stack_pointer_rtx);
886 emit_indirect_jump (lab);
890 /* Search backwards and mark the jump insn as a non-local goto.
891 Note that this precludes the use of __builtin_longjmp to a
892 __builtin_setjmp target in the same function. However, we've
893 already cautioned the user that these functions are for
894 internal exception handling use only. */
895 for (insn = get_last_insn (); insn; insn = PREV_INSN (insn))
897 gcc_assert (insn != last);
901 add_reg_note (insn, REG_NON_LOCAL_GOTO, const0_rtx);
904 else if (CALL_P (insn))
909 /* Expand a call to __builtin_nonlocal_goto. We're passed the target label
910 and the address of the save area. */
913 expand_builtin_nonlocal_goto (tree exp)
915 tree t_label, t_save_area;
916 rtx r_label, r_save_area, r_fp, r_sp, insn;
918 if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
921 t_label = CALL_EXPR_ARG (exp, 0);
922 t_save_area = CALL_EXPR_ARG (exp, 1);
924 r_label = expand_normal (t_label);
925 r_label = convert_memory_address (Pmode, r_label);
926 r_save_area = expand_normal (t_save_area);
927 r_save_area = convert_memory_address (Pmode, r_save_area);
928 /* Copy the address of the save location to a register just in case it was based
929 on the frame pointer. */
930 r_save_area = copy_to_reg (r_save_area);
931 r_fp = gen_rtx_MEM (Pmode, r_save_area);
932 r_sp = gen_rtx_MEM (STACK_SAVEAREA_MODE (SAVE_NONLOCAL),
933 plus_constant (r_save_area, GET_MODE_SIZE (Pmode)));
935 crtl->has_nonlocal_goto = 1;
937 #ifdef HAVE_nonlocal_goto
938 /* ??? We no longer need to pass the static chain value, afaik. */
939 if (HAVE_nonlocal_goto)
940 emit_insn (gen_nonlocal_goto (const0_rtx, r_label, r_sp, r_fp));
944 r_label = copy_to_reg (r_label);
946 emit_clobber (gen_rtx_MEM (BLKmode, gen_rtx_SCRATCH (VOIDmode)));
947 emit_clobber (gen_rtx_MEM (BLKmode, hard_frame_pointer_rtx));
949 /* Restore frame pointer for containing function.
950 This sets the actual hard register used for the frame pointer
951 to the location of the function's incoming static chain info.
952 The non-local goto handler will then adjust it to contain the
953 proper value and reload the argument pointer, if needed. */
954 emit_move_insn (hard_frame_pointer_rtx, r_fp);
955 emit_stack_restore (SAVE_NONLOCAL, r_sp, NULL_RTX);
957 /* USE of hard_frame_pointer_rtx added for consistency;
958 not clear if really needed. */
959 emit_use (hard_frame_pointer_rtx);
960 emit_use (stack_pointer_rtx);
962 /* If the architecture is using a GP register, we must
963 conservatively assume that the target function makes use of it.
964 The prologue of functions with nonlocal gotos must therefore
965 initialize the GP register to the appropriate value, and we
966 must then make sure that this value is live at the point
967 of the jump. (Note that this doesn't necessarily apply
968 to targets with a nonlocal_goto pattern; they are free
969 to implement it in their own way. Note also that this is
970 a no-op if the GP register is a global invariant.) */
971 if ((unsigned) PIC_OFFSET_TABLE_REGNUM != INVALID_REGNUM
972 && fixed_regs[PIC_OFFSET_TABLE_REGNUM])
973 emit_use (pic_offset_table_rtx);
975 emit_indirect_jump (r_label);
978 /* Search backwards to the jump insn and mark it as a
980 for (insn = get_last_insn (); insn; insn = PREV_INSN (insn))
984 add_reg_note (insn, REG_NON_LOCAL_GOTO, const0_rtx);
987 else if (CALL_P (insn))
994 /* __builtin_update_setjmp_buf is passed a pointer to an array of five words
995 (not all will be used on all machines) that was passed to __builtin_setjmp.
996 It updates the stack pointer in that block to correspond to the current
1000 expand_builtin_update_setjmp_buf (rtx buf_addr)
1002 enum machine_mode sa_mode = Pmode;
1006 #ifdef HAVE_save_stack_nonlocal
1007 if (HAVE_save_stack_nonlocal)
1008 sa_mode = insn_data[(int) CODE_FOR_save_stack_nonlocal].operand[0].mode;
1010 #ifdef STACK_SAVEAREA_MODE
1011 sa_mode = STACK_SAVEAREA_MODE (SAVE_NONLOCAL);
1015 = gen_rtx_MEM (sa_mode,
1018 plus_constant (buf_addr, 2 * GET_MODE_SIZE (Pmode))));
1022 emit_insn (gen_setjmp ());
1025 emit_stack_save (SAVE_NONLOCAL, &stack_save, NULL_RTX);
1028 /* Expand a call to __builtin_prefetch. For a target that does not support
1029 data prefetch, evaluate the memory address argument in case it has side
1033 expand_builtin_prefetch (tree exp)
1035 tree arg0, arg1, arg2;
1039 if (!validate_arglist (exp, POINTER_TYPE, 0))
1042 arg0 = CALL_EXPR_ARG (exp, 0);
1044 /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
1045 zero (read) and argument 2 (locality) defaults to 3 (high degree of
1047 nargs = call_expr_nargs (exp);
1049 arg1 = CALL_EXPR_ARG (exp, 1);
1051 arg1 = integer_zero_node;
1053 arg2 = CALL_EXPR_ARG (exp, 2);
1055 arg2 = build_int_cst (NULL_TREE, 3);
1057 /* Argument 0 is an address. */
1058 op0 = expand_expr (arg0, NULL_RTX, Pmode, EXPAND_NORMAL);
1060 /* Argument 1 (read/write flag) must be a compile-time constant int. */
1061 if (TREE_CODE (arg1) != INTEGER_CST)
1063 error ("second argument to %<__builtin_prefetch%> must be a constant");
1064 arg1 = integer_zero_node;
1066 op1 = expand_normal (arg1);
1067 /* Argument 1 must be either zero or one. */
1068 if (INTVAL (op1) != 0 && INTVAL (op1) != 1)
1070 warning (0, "invalid second argument to %<__builtin_prefetch%>;"
1075 /* Argument 2 (locality) must be a compile-time constant int. */
1076 if (TREE_CODE (arg2) != INTEGER_CST)
1078 error ("third argument to %<__builtin_prefetch%> must be a constant");
1079 arg2 = integer_zero_node;
1081 op2 = expand_normal (arg2);
1082 /* Argument 2 must be 0, 1, 2, or 3. */
1083 if (INTVAL (op2) < 0 || INTVAL (op2) > 3)
1085 warning (0, "invalid third argument to %<__builtin_prefetch%>; using zero");
1089 #ifdef HAVE_prefetch
1092 if ((! (*insn_data[(int) CODE_FOR_prefetch].operand[0].predicate)
1094 insn_data[(int) CODE_FOR_prefetch].operand[0].mode))
1095 || (GET_MODE (op0) != Pmode))
1097 op0 = convert_memory_address (Pmode, op0);
1098 op0 = force_reg (Pmode, op0);
1100 emit_insn (gen_prefetch (op0, op1, op2));
1104 /* Don't do anything with direct references to volatile memory, but
1105 generate code to handle other side effects. */
1106 if (!MEM_P (op0) && side_effects_p (op0))
1110 /* Get a MEM rtx for expression EXP which is the address of an operand
1111 to be used in a string instruction (cmpstrsi, movmemsi, ..). LEN is
1112 the maximum length of the block of memory that might be accessed or
1116 get_memory_rtx (tree exp, tree len)
1118 tree orig_exp = exp;
1122 /* When EXP is not resolved SAVE_EXPR, MEM_ATTRS can be still derived
1123 from its expression, for expr->a.b only <variable>.a.b is recorded. */
1124 if (TREE_CODE (exp) == SAVE_EXPR && !SAVE_EXPR_RESOLVED_P (exp))
1125 exp = TREE_OPERAND (exp, 0);
1127 addr = expand_expr (orig_exp, NULL_RTX, ptr_mode, EXPAND_NORMAL);
1128 mem = gen_rtx_MEM (BLKmode, memory_address (BLKmode, addr));
1130 /* Get an expression we can use to find the attributes to assign to MEM.
1131 If it is an ADDR_EXPR, use the operand. Otherwise, dereference it if
1132 we can. First remove any nops. */
1133 while (CONVERT_EXPR_P (exp)
1134 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (exp, 0))))
1135 exp = TREE_OPERAND (exp, 0);
1138 if (TREE_CODE (exp) == POINTER_PLUS_EXPR
1139 && TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
1140 && host_integerp (TREE_OPERAND (exp, 1), 0)
1141 && (off = tree_low_cst (TREE_OPERAND (exp, 1), 0)) > 0)
1142 exp = TREE_OPERAND (TREE_OPERAND (exp, 0), 0);
1143 else if (TREE_CODE (exp) == ADDR_EXPR)
1144 exp = TREE_OPERAND (exp, 0);
1145 else if (POINTER_TYPE_P (TREE_TYPE (exp)))
1146 exp = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (exp)), exp);
1150 /* Honor attributes derived from exp, except for the alias set
1151 (as builtin stringops may alias with anything) and the size
1152 (as stringops may access multiple array elements). */
1155 set_mem_attributes (mem, exp, 0);
1158 mem = adjust_automodify_address_nv (mem, BLKmode, NULL, off);
1160 /* Allow the string and memory builtins to overflow from one
1161 field into another, see http://gcc.gnu.org/PR23561.
1162 Thus avoid COMPONENT_REFs in MEM_EXPR unless we know the whole
1163 memory accessed by the string or memory builtin will fit
1164 within the field. */
1165 if (MEM_EXPR (mem) && TREE_CODE (MEM_EXPR (mem)) == COMPONENT_REF)
1167 tree mem_expr = MEM_EXPR (mem);
1168 HOST_WIDE_INT offset = -1, length = -1;
1171 while (TREE_CODE (inner) == ARRAY_REF
1172 || CONVERT_EXPR_P (inner)
1173 || TREE_CODE (inner) == VIEW_CONVERT_EXPR
1174 || TREE_CODE (inner) == SAVE_EXPR)
1175 inner = TREE_OPERAND (inner, 0);
1177 gcc_assert (TREE_CODE (inner) == COMPONENT_REF);
1179 if (MEM_OFFSET (mem)
1180 && CONST_INT_P (MEM_OFFSET (mem)))
1181 offset = INTVAL (MEM_OFFSET (mem));
1183 if (offset >= 0 && len && host_integerp (len, 0))
1184 length = tree_low_cst (len, 0);
1186 while (TREE_CODE (inner) == COMPONENT_REF)
1188 tree field = TREE_OPERAND (inner, 1);
1189 gcc_assert (TREE_CODE (mem_expr) == COMPONENT_REF);
1190 gcc_assert (field == TREE_OPERAND (mem_expr, 1));
1192 /* Bitfields are generally not byte-addressable. */
1193 gcc_assert (!DECL_BIT_FIELD (field)
1194 || ((tree_low_cst (DECL_FIELD_BIT_OFFSET (field), 1)
1195 % BITS_PER_UNIT) == 0
1196 && host_integerp (DECL_SIZE (field), 0)
1197 && (TREE_INT_CST_LOW (DECL_SIZE (field))
1198 % BITS_PER_UNIT) == 0));
1200 /* If we can prove that the memory starting at XEXP (mem, 0) and
1201 ending at XEXP (mem, 0) + LENGTH will fit into this field, we
1202 can keep the COMPONENT_REF in MEM_EXPR. But be careful with
1203 fields without DECL_SIZE_UNIT like flexible array members. */
1205 && DECL_SIZE_UNIT (field)
1206 && host_integerp (DECL_SIZE_UNIT (field), 0))
1209 = TREE_INT_CST_LOW (DECL_SIZE_UNIT (field));
1212 && offset + length <= size)
1217 && host_integerp (DECL_FIELD_OFFSET (field), 0))
1218 offset += TREE_INT_CST_LOW (DECL_FIELD_OFFSET (field))
1219 + tree_low_cst (DECL_FIELD_BIT_OFFSET (field), 1)
1227 mem_expr = TREE_OPERAND (mem_expr, 0);
1228 inner = TREE_OPERAND (inner, 0);
1231 if (mem_expr == NULL)
1233 if (mem_expr != MEM_EXPR (mem))
1235 set_mem_expr (mem, mem_expr);
1236 set_mem_offset (mem, offset >= 0 ? GEN_INT (offset) : NULL_RTX);
1239 set_mem_alias_set (mem, 0);
1240 set_mem_size (mem, NULL_RTX);
1246 /* Built-in functions to perform an untyped call and return. */
1248 /* For each register that may be used for calling a function, this
1249 gives a mode used to copy the register's value. VOIDmode indicates
1250 the register is not used for calling a function. If the machine
1251 has register windows, this gives only the outbound registers.
1252 INCOMING_REGNO gives the corresponding inbound register. */
1253 static enum machine_mode apply_args_mode[FIRST_PSEUDO_REGISTER];
1255 /* For each register that may be used for returning values, this gives
1256 a mode used to copy the register's value. VOIDmode indicates the
1257 register is not used for returning values. If the machine has
1258 register windows, this gives only the outbound registers.
1259 INCOMING_REGNO gives the corresponding inbound register. */
1260 static enum machine_mode apply_result_mode[FIRST_PSEUDO_REGISTER];
1262 /* For each register that may be used for calling a function, this
1263 gives the offset of that register into the block returned by
1264 __builtin_apply_args. 0 indicates that the register is not
1265 used for calling a function. */
1266 /* static int apply_args_reg_offset[FIRST_PSEUDO_REGISTER]; not used */
1268 /* Return the size required for the block returned by __builtin_apply_args,
1269 and initialize apply_args_mode. */
1272 apply_args_size (void)
1274 static int size = -1;
1277 enum machine_mode mode;
1279 /* The values computed by this function never change. */
1282 /* The first value is the incoming arg-pointer. */
1283 size = GET_MODE_SIZE (Pmode);
1285 /* The second value is the structure value address unless this is
1286 passed as an "invisible" first argument. */
1287 if (targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0))
1288 size += GET_MODE_SIZE (Pmode);
1290 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1291 if (FUNCTION_ARG_REGNO_P (regno))
1293 mode = reg_raw_mode[regno];
1295 gcc_assert (mode != VOIDmode);
1297 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1298 if (size % align != 0)
1299 size = CEIL (size, align) * align;
1300 size += GET_MODE_SIZE (mode);
1301 apply_args_mode[regno] = mode;
1305 apply_args_mode[regno] = VOIDmode;
1311 /* Return the size required for the block returned by __builtin_apply,
1312 and initialize apply_result_mode. */
1315 apply_result_size (void)
1317 static int size = -1;
1319 enum machine_mode mode;
1321 /* The values computed by this function never change. */
1326 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1327 if (FUNCTION_VALUE_REGNO_P (regno))
1329 mode = reg_raw_mode[regno];
1331 gcc_assert (mode != VOIDmode);
1333 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1334 if (size % align != 0)
1335 size = CEIL (size, align) * align;
1336 size += GET_MODE_SIZE (mode);
1337 apply_result_mode[regno] = mode;
1340 apply_result_mode[regno] = VOIDmode;
1342 /* Allow targets that use untyped_call and untyped_return to override
1343 the size so that machine-specific information can be stored here. */
1344 #ifdef APPLY_RESULT_SIZE
1345 size = APPLY_RESULT_SIZE;
1351 #if defined (HAVE_untyped_call) || defined (HAVE_untyped_return)
1352 /* Create a vector describing the result block RESULT. If SAVEP is true,
1353 the result block is used to save the values; otherwise it is used to
1354 restore the values. */
1357 result_vector (int savep, rtx result)
1359 int regno, size, align, nelts;
1360 enum machine_mode mode;
1362 rtx *savevec = XALLOCAVEC (rtx, FIRST_PSEUDO_REGISTER);
1365 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1366 if ((mode = apply_result_mode[regno]) != VOIDmode)
1368 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1369 if (size % align != 0)
1370 size = CEIL (size, align) * align;
1371 reg = gen_rtx_REG (mode, savep ? regno : INCOMING_REGNO (regno));
1372 mem = adjust_address (result, mode, size);
1373 savevec[nelts++] = (savep
1374 ? gen_rtx_SET (VOIDmode, mem, reg)
1375 : gen_rtx_SET (VOIDmode, reg, mem));
1376 size += GET_MODE_SIZE (mode);
1378 return gen_rtx_PARALLEL (VOIDmode, gen_rtvec_v (nelts, savevec));
1380 #endif /* HAVE_untyped_call or HAVE_untyped_return */
1382 /* Save the state required to perform an untyped call with the same
1383 arguments as were passed to the current function. */
1386 expand_builtin_apply_args_1 (void)
1389 int size, align, regno;
1390 enum machine_mode mode;
1391 rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1393 /* Create a block where the arg-pointer, structure value address,
1394 and argument registers can be saved. */
1395 registers = assign_stack_local (BLKmode, apply_args_size (), -1);
1397 /* Walk past the arg-pointer and structure value address. */
1398 size = GET_MODE_SIZE (Pmode);
1399 if (targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0))
1400 size += GET_MODE_SIZE (Pmode);
1402 /* Save each register used in calling a function to the block. */
1403 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1404 if ((mode = apply_args_mode[regno]) != VOIDmode)
1406 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1407 if (size % align != 0)
1408 size = CEIL (size, align) * align;
1410 tem = gen_rtx_REG (mode, INCOMING_REGNO (regno));
1412 emit_move_insn (adjust_address (registers, mode, size), tem);
1413 size += GET_MODE_SIZE (mode);
1416 /* Save the arg pointer to the block. */
1417 tem = copy_to_reg (crtl->args.internal_arg_pointer);
1418 #ifdef STACK_GROWS_DOWNWARD
1419 /* We need the pointer as the caller actually passed them to us, not
1420 as we might have pretended they were passed. Make sure it's a valid
1421 operand, as emit_move_insn isn't expected to handle a PLUS. */
1423 = force_operand (plus_constant (tem, crtl->args.pretend_args_size),
1426 emit_move_insn (adjust_address (registers, Pmode, 0), tem);
1428 size = GET_MODE_SIZE (Pmode);
1430 /* Save the structure value address unless this is passed as an
1431 "invisible" first argument. */
1432 if (struct_incoming_value)
1434 emit_move_insn (adjust_address (registers, Pmode, size),
1435 copy_to_reg (struct_incoming_value));
1436 size += GET_MODE_SIZE (Pmode);
1439 /* Return the address of the block. */
1440 return copy_addr_to_reg (XEXP (registers, 0));
1443 /* __builtin_apply_args returns block of memory allocated on
1444 the stack into which is stored the arg pointer, structure
1445 value address, static chain, and all the registers that might
1446 possibly be used in performing a function call. The code is
1447 moved to the start of the function so the incoming values are
1451 expand_builtin_apply_args (void)
1453 /* Don't do __builtin_apply_args more than once in a function.
1454 Save the result of the first call and reuse it. */
1455 if (apply_args_value != 0)
1456 return apply_args_value;
1458 /* When this function is called, it means that registers must be
1459 saved on entry to this function. So we migrate the
1460 call to the first insn of this function. */
1465 temp = expand_builtin_apply_args_1 ();
1469 apply_args_value = temp;
1471 /* Put the insns after the NOTE that starts the function.
1472 If this is inside a start_sequence, make the outer-level insn
1473 chain current, so the code is placed at the start of the
1474 function. If internal_arg_pointer is a non-virtual pseudo,
1475 it needs to be placed after the function that initializes
1477 push_topmost_sequence ();
1478 if (REG_P (crtl->args.internal_arg_pointer)
1479 && REGNO (crtl->args.internal_arg_pointer) > LAST_VIRTUAL_REGISTER)
1480 emit_insn_before (seq, parm_birth_insn);
1482 emit_insn_before (seq, NEXT_INSN (entry_of_function ()));
1483 pop_topmost_sequence ();
1488 /* Perform an untyped call and save the state required to perform an
1489 untyped return of whatever value was returned by the given function. */
1492 expand_builtin_apply (rtx function, rtx arguments, rtx argsize)
1494 int size, align, regno;
1495 enum machine_mode mode;
1496 rtx incoming_args, result, reg, dest, src, call_insn;
1497 rtx old_stack_level = 0;
1498 rtx call_fusage = 0;
1499 rtx struct_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0);
1501 arguments = convert_memory_address (Pmode, arguments);
1503 /* Create a block where the return registers can be saved. */
1504 result = assign_stack_local (BLKmode, apply_result_size (), -1);
1506 /* Fetch the arg pointer from the ARGUMENTS block. */
1507 incoming_args = gen_reg_rtx (Pmode);
1508 emit_move_insn (incoming_args, gen_rtx_MEM (Pmode, arguments));
1509 #ifndef STACK_GROWS_DOWNWARD
1510 incoming_args = expand_simple_binop (Pmode, MINUS, incoming_args, argsize,
1511 incoming_args, 0, OPTAB_LIB_WIDEN);
1514 /* Push a new argument block and copy the arguments. Do not allow
1515 the (potential) memcpy call below to interfere with our stack
1517 do_pending_stack_adjust ();
1520 /* Save the stack with nonlocal if available. */
1521 #ifdef HAVE_save_stack_nonlocal
1522 if (HAVE_save_stack_nonlocal)
1523 emit_stack_save (SAVE_NONLOCAL, &old_stack_level, NULL_RTX);
1526 emit_stack_save (SAVE_BLOCK, &old_stack_level, NULL_RTX);
1528 /* Allocate a block of memory onto the stack and copy the memory
1529 arguments to the outgoing arguments address. */
1530 allocate_dynamic_stack_space (argsize, 0, BITS_PER_UNIT);
1532 /* Set DRAP flag to true, even though allocate_dynamic_stack_space
1533 may have already set current_function_calls_alloca to true.
1534 current_function_calls_alloca won't be set if argsize is zero,
1535 so we have to guarantee need_drap is true here. */
1536 if (SUPPORTS_STACK_ALIGNMENT)
1537 crtl->need_drap = true;
1539 dest = virtual_outgoing_args_rtx;
1540 #ifndef STACK_GROWS_DOWNWARD
1541 if (CONST_INT_P (argsize))
1542 dest = plus_constant (dest, -INTVAL (argsize));
1544 dest = gen_rtx_PLUS (Pmode, dest, negate_rtx (Pmode, argsize));
1546 dest = gen_rtx_MEM (BLKmode, dest);
1547 set_mem_align (dest, PARM_BOUNDARY);
1548 src = gen_rtx_MEM (BLKmode, incoming_args);
1549 set_mem_align (src, PARM_BOUNDARY);
1550 emit_block_move (dest, src, argsize, BLOCK_OP_NORMAL);
1552 /* Refer to the argument block. */
1554 arguments = gen_rtx_MEM (BLKmode, arguments);
1555 set_mem_align (arguments, PARM_BOUNDARY);
1557 /* Walk past the arg-pointer and structure value address. */
1558 size = GET_MODE_SIZE (Pmode);
1560 size += GET_MODE_SIZE (Pmode);
1562 /* Restore each of the registers previously saved. Make USE insns
1563 for each of these registers for use in making the call. */
1564 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1565 if ((mode = apply_args_mode[regno]) != VOIDmode)
1567 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1568 if (size % align != 0)
1569 size = CEIL (size, align) * align;
1570 reg = gen_rtx_REG (mode, regno);
1571 emit_move_insn (reg, adjust_address (arguments, mode, size));
1572 use_reg (&call_fusage, reg);
1573 size += GET_MODE_SIZE (mode);
1576 /* Restore the structure value address unless this is passed as an
1577 "invisible" first argument. */
1578 size = GET_MODE_SIZE (Pmode);
1581 rtx value = gen_reg_rtx (Pmode);
1582 emit_move_insn (value, adjust_address (arguments, Pmode, size));
1583 emit_move_insn (struct_value, value);
1584 if (REG_P (struct_value))
1585 use_reg (&call_fusage, struct_value);
1586 size += GET_MODE_SIZE (Pmode);
1589 /* All arguments and registers used for the call are set up by now! */
1590 function = prepare_call_address (NULL, function, NULL, &call_fusage, 0, 0);
1592 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1593 and we don't want to load it into a register as an optimization,
1594 because prepare_call_address already did it if it should be done. */
1595 if (GET_CODE (function) != SYMBOL_REF)
1596 function = memory_address (FUNCTION_MODE, function);
1598 /* Generate the actual call instruction and save the return value. */
1599 #ifdef HAVE_untyped_call
1600 if (HAVE_untyped_call)
1601 emit_call_insn (gen_untyped_call (gen_rtx_MEM (FUNCTION_MODE, function),
1602 result, result_vector (1, result)));
1605 #ifdef HAVE_call_value
1606 if (HAVE_call_value)
1610 /* Locate the unique return register. It is not possible to
1611 express a call that sets more than one return register using
1612 call_value; use untyped_call for that. In fact, untyped_call
1613 only needs to save the return registers in the given block. */
1614 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1615 if ((mode = apply_result_mode[regno]) != VOIDmode)
1617 gcc_assert (!valreg); /* HAVE_untyped_call required. */
1619 valreg = gen_rtx_REG (mode, regno);
1622 emit_call_insn (GEN_CALL_VALUE (valreg,
1623 gen_rtx_MEM (FUNCTION_MODE, function),
1624 const0_rtx, NULL_RTX, const0_rtx));
1626 emit_move_insn (adjust_address (result, GET_MODE (valreg), 0), valreg);
1632 /* Find the CALL insn we just emitted, and attach the register usage
1634 call_insn = last_call_insn ();
1635 add_function_usage_to (call_insn, call_fusage);
1637 /* Restore the stack. */
1638 #ifdef HAVE_save_stack_nonlocal
1639 if (HAVE_save_stack_nonlocal)
1640 emit_stack_restore (SAVE_NONLOCAL, old_stack_level, NULL_RTX);
1643 emit_stack_restore (SAVE_BLOCK, old_stack_level, NULL_RTX);
1647 /* Return the address of the result block. */
1648 result = copy_addr_to_reg (XEXP (result, 0));
1649 return convert_memory_address (ptr_mode, result);
1652 /* Perform an untyped return. */
1655 expand_builtin_return (rtx result)
1657 int size, align, regno;
1658 enum machine_mode mode;
1660 rtx call_fusage = 0;
1662 result = convert_memory_address (Pmode, result);
1664 apply_result_size ();
1665 result = gen_rtx_MEM (BLKmode, result);
1667 #ifdef HAVE_untyped_return
1668 if (HAVE_untyped_return)
1670 emit_jump_insn (gen_untyped_return (result, result_vector (0, result)));
1676 /* Restore the return value and note that each value is used. */
1678 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1679 if ((mode = apply_result_mode[regno]) != VOIDmode)
1681 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1682 if (size % align != 0)
1683 size = CEIL (size, align) * align;
1684 reg = gen_rtx_REG (mode, INCOMING_REGNO (regno));
1685 emit_move_insn (reg, adjust_address (result, mode, size));
1687 push_to_sequence (call_fusage);
1689 call_fusage = get_insns ();
1691 size += GET_MODE_SIZE (mode);
1694 /* Put the USE insns before the return. */
1695 emit_insn (call_fusage);
1697 /* Return whatever values was restored by jumping directly to the end
1699 expand_naked_return ();
1702 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1704 static enum type_class
1705 type_to_class (tree type)
1707 switch (TREE_CODE (type))
1709 case VOID_TYPE: return void_type_class;
1710 case INTEGER_TYPE: return integer_type_class;
1711 case ENUMERAL_TYPE: return enumeral_type_class;
1712 case BOOLEAN_TYPE: return boolean_type_class;
1713 case POINTER_TYPE: return pointer_type_class;
1714 case REFERENCE_TYPE: return reference_type_class;
1715 case OFFSET_TYPE: return offset_type_class;
1716 case REAL_TYPE: return real_type_class;
1717 case COMPLEX_TYPE: return complex_type_class;
1718 case FUNCTION_TYPE: return function_type_class;
1719 case METHOD_TYPE: return method_type_class;
1720 case RECORD_TYPE: return record_type_class;
1722 case QUAL_UNION_TYPE: return union_type_class;
1723 case ARRAY_TYPE: return (TYPE_STRING_FLAG (type)
1724 ? string_type_class : array_type_class);
1725 case LANG_TYPE: return lang_type_class;
1726 default: return no_type_class;
1730 /* Expand a call EXP to __builtin_classify_type. */
1733 expand_builtin_classify_type (tree exp)
1735 if (call_expr_nargs (exp))
1736 return GEN_INT (type_to_class (TREE_TYPE (CALL_EXPR_ARG (exp, 0))));
1737 return GEN_INT (no_type_class);
1740 /* This helper macro, meant to be used in mathfn_built_in below,
1741 determines which among a set of three builtin math functions is
1742 appropriate for a given type mode. The `F' and `L' cases are
1743 automatically generated from the `double' case. */
1744 #define CASE_MATHFN(BUILT_IN_MATHFN) \
1745 case BUILT_IN_MATHFN: case BUILT_IN_MATHFN##F: case BUILT_IN_MATHFN##L: \
1746 fcode = BUILT_IN_MATHFN; fcodef = BUILT_IN_MATHFN##F ; \
1747 fcodel = BUILT_IN_MATHFN##L ; break;
1748 /* Similar to above, but appends _R after any F/L suffix. */
1749 #define CASE_MATHFN_REENT(BUILT_IN_MATHFN) \
1750 case BUILT_IN_MATHFN##_R: case BUILT_IN_MATHFN##F_R: case BUILT_IN_MATHFN##L_R: \
1751 fcode = BUILT_IN_MATHFN##_R; fcodef = BUILT_IN_MATHFN##F_R ; \
1752 fcodel = BUILT_IN_MATHFN##L_R ; break;
1754 /* Return mathematic function equivalent to FN but operating directly
1755 on TYPE, if available. If IMPLICIT is true find the function in
1756 implicit_built_in_decls[], otherwise use built_in_decls[]. If we
1757 can't do the conversion, return zero. */
1760 mathfn_built_in_1 (tree type, enum built_in_function fn, bool implicit)
1762 tree const *const fn_arr
1763 = implicit ? implicit_built_in_decls : built_in_decls;
1764 enum built_in_function fcode, fcodef, fcodel;
1768 CASE_MATHFN (BUILT_IN_ACOS)
1769 CASE_MATHFN (BUILT_IN_ACOSH)
1770 CASE_MATHFN (BUILT_IN_ASIN)
1771 CASE_MATHFN (BUILT_IN_ASINH)
1772 CASE_MATHFN (BUILT_IN_ATAN)
1773 CASE_MATHFN (BUILT_IN_ATAN2)
1774 CASE_MATHFN (BUILT_IN_ATANH)
1775 CASE_MATHFN (BUILT_IN_CBRT)
1776 CASE_MATHFN (BUILT_IN_CEIL)
1777 CASE_MATHFN (BUILT_IN_CEXPI)
1778 CASE_MATHFN (BUILT_IN_COPYSIGN)
1779 CASE_MATHFN (BUILT_IN_COS)
1780 CASE_MATHFN (BUILT_IN_COSH)
1781 CASE_MATHFN (BUILT_IN_DREM)
1782 CASE_MATHFN (BUILT_IN_ERF)
1783 CASE_MATHFN (BUILT_IN_ERFC)
1784 CASE_MATHFN (BUILT_IN_EXP)
1785 CASE_MATHFN (BUILT_IN_EXP10)
1786 CASE_MATHFN (BUILT_IN_EXP2)
1787 CASE_MATHFN (BUILT_IN_EXPM1)
1788 CASE_MATHFN (BUILT_IN_FABS)
1789 CASE_MATHFN (BUILT_IN_FDIM)
1790 CASE_MATHFN (BUILT_IN_FLOOR)
1791 CASE_MATHFN (BUILT_IN_FMA)
1792 CASE_MATHFN (BUILT_IN_FMAX)
1793 CASE_MATHFN (BUILT_IN_FMIN)
1794 CASE_MATHFN (BUILT_IN_FMOD)
1795 CASE_MATHFN (BUILT_IN_FREXP)
1796 CASE_MATHFN (BUILT_IN_GAMMA)
1797 CASE_MATHFN_REENT (BUILT_IN_GAMMA) /* GAMMA_R */
1798 CASE_MATHFN (BUILT_IN_HUGE_VAL)
1799 CASE_MATHFN (BUILT_IN_HYPOT)
1800 CASE_MATHFN (BUILT_IN_ILOGB)
1801 CASE_MATHFN (BUILT_IN_INF)
1802 CASE_MATHFN (BUILT_IN_ISINF)
1803 CASE_MATHFN (BUILT_IN_J0)
1804 CASE_MATHFN (BUILT_IN_J1)
1805 CASE_MATHFN (BUILT_IN_JN)
1806 CASE_MATHFN (BUILT_IN_LCEIL)
1807 CASE_MATHFN (BUILT_IN_LDEXP)
1808 CASE_MATHFN (BUILT_IN_LFLOOR)
1809 CASE_MATHFN (BUILT_IN_LGAMMA)
1810 CASE_MATHFN_REENT (BUILT_IN_LGAMMA) /* LGAMMA_R */
1811 CASE_MATHFN (BUILT_IN_LLCEIL)
1812 CASE_MATHFN (BUILT_IN_LLFLOOR)
1813 CASE_MATHFN (BUILT_IN_LLRINT)
1814 CASE_MATHFN (BUILT_IN_LLROUND)
1815 CASE_MATHFN (BUILT_IN_LOG)
1816 CASE_MATHFN (BUILT_IN_LOG10)
1817 CASE_MATHFN (BUILT_IN_LOG1P)
1818 CASE_MATHFN (BUILT_IN_LOG2)
1819 CASE_MATHFN (BUILT_IN_LOGB)
1820 CASE_MATHFN (BUILT_IN_LRINT)
1821 CASE_MATHFN (BUILT_IN_LROUND)
1822 CASE_MATHFN (BUILT_IN_MODF)
1823 CASE_MATHFN (BUILT_IN_NAN)
1824 CASE_MATHFN (BUILT_IN_NANS)
1825 CASE_MATHFN (BUILT_IN_NEARBYINT)
1826 CASE_MATHFN (BUILT_IN_NEXTAFTER)
1827 CASE_MATHFN (BUILT_IN_NEXTTOWARD)
1828 CASE_MATHFN (BUILT_IN_POW)
1829 CASE_MATHFN (BUILT_IN_POWI)
1830 CASE_MATHFN (BUILT_IN_POW10)
1831 CASE_MATHFN (BUILT_IN_REMAINDER)
1832 CASE_MATHFN (BUILT_IN_REMQUO)
1833 CASE_MATHFN (BUILT_IN_RINT)
1834 CASE_MATHFN (BUILT_IN_ROUND)
1835 CASE_MATHFN (BUILT_IN_SCALB)
1836 CASE_MATHFN (BUILT_IN_SCALBLN)
1837 CASE_MATHFN (BUILT_IN_SCALBN)
1838 CASE_MATHFN (BUILT_IN_SIGNBIT)
1839 CASE_MATHFN (BUILT_IN_SIGNIFICAND)
1840 CASE_MATHFN (BUILT_IN_SIN)
1841 CASE_MATHFN (BUILT_IN_SINCOS)
1842 CASE_MATHFN (BUILT_IN_SINH)
1843 CASE_MATHFN (BUILT_IN_SQRT)
1844 CASE_MATHFN (BUILT_IN_TAN)
1845 CASE_MATHFN (BUILT_IN_TANH)
1846 CASE_MATHFN (BUILT_IN_TGAMMA)
1847 CASE_MATHFN (BUILT_IN_TRUNC)
1848 CASE_MATHFN (BUILT_IN_Y0)
1849 CASE_MATHFN (BUILT_IN_Y1)
1850 CASE_MATHFN (BUILT_IN_YN)
1856 if (TYPE_MAIN_VARIANT (type) == double_type_node)
1857 return fn_arr[fcode];
1858 else if (TYPE_MAIN_VARIANT (type) == float_type_node)
1859 return fn_arr[fcodef];
1860 else if (TYPE_MAIN_VARIANT (type) == long_double_type_node)
1861 return fn_arr[fcodel];
1866 /* Like mathfn_built_in_1(), but always use the implicit array. */
1869 mathfn_built_in (tree type, enum built_in_function fn)
1871 return mathfn_built_in_1 (type, fn, /*implicit=*/ 1);
1874 /* If errno must be maintained, expand the RTL to check if the result,
1875 TARGET, of a built-in function call, EXP, is NaN, and if so set
1879 expand_errno_check (tree exp, rtx target)
1881 rtx lab = gen_label_rtx ();
1883 /* Test the result; if it is NaN, set errno=EDOM because
1884 the argument was not in the domain. */
1885 do_compare_rtx_and_jump (target, target, EQ, 0, GET_MODE (target),
1886 NULL_RTX, NULL_RTX, lab);
1889 /* If this built-in doesn't throw an exception, set errno directly. */
1890 if (TREE_NOTHROW (TREE_OPERAND (CALL_EXPR_FN (exp), 0)))
1892 #ifdef GEN_ERRNO_RTX
1893 rtx errno_rtx = GEN_ERRNO_RTX;
1896 = gen_rtx_MEM (word_mode, gen_rtx_SYMBOL_REF (Pmode, "errno"));
1898 emit_move_insn (errno_rtx, GEN_INT (TARGET_EDOM));
1904 /* Make sure the library call isn't expanded as a tail call. */
1905 CALL_EXPR_TAILCALL (exp) = 0;
1907 /* We can't set errno=EDOM directly; let the library call do it.
1908 Pop the arguments right away in case the call gets deleted. */
1910 expand_call (exp, target, 0);
1915 /* Expand a call to one of the builtin math functions (sqrt, exp, or log).
1916 Return NULL_RTX if a normal call should be emitted rather than expanding
1917 the function in-line. EXP is the expression that is a call to the builtin
1918 function; if convenient, the result should be placed in TARGET.
1919 SUBTARGET may be used as the target for computing one of EXP's operands. */
1922 expand_builtin_mathfn (tree exp, rtx target, rtx subtarget)
1924 optab builtin_optab;
1926 tree fndecl = get_callee_fndecl (exp);
1927 enum machine_mode mode;
1928 bool errno_set = false;
1931 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
1934 arg = CALL_EXPR_ARG (exp, 0);
1936 switch (DECL_FUNCTION_CODE (fndecl))
1938 CASE_FLT_FN (BUILT_IN_SQRT):
1939 errno_set = ! tree_expr_nonnegative_p (arg);
1940 builtin_optab = sqrt_optab;
1942 CASE_FLT_FN (BUILT_IN_EXP):
1943 errno_set = true; builtin_optab = exp_optab; break;
1944 CASE_FLT_FN (BUILT_IN_EXP10):
1945 CASE_FLT_FN (BUILT_IN_POW10):
1946 errno_set = true; builtin_optab = exp10_optab; break;
1947 CASE_FLT_FN (BUILT_IN_EXP2):
1948 errno_set = true; builtin_optab = exp2_optab; break;
1949 CASE_FLT_FN (BUILT_IN_EXPM1):
1950 errno_set = true; builtin_optab = expm1_optab; break;
1951 CASE_FLT_FN (BUILT_IN_LOGB):
1952 errno_set = true; builtin_optab = logb_optab; break;
1953 CASE_FLT_FN (BUILT_IN_LOG):
1954 errno_set = true; builtin_optab = log_optab; break;
1955 CASE_FLT_FN (BUILT_IN_LOG10):
1956 errno_set = true; builtin_optab = log10_optab; break;
1957 CASE_FLT_FN (BUILT_IN_LOG2):
1958 errno_set = true; builtin_optab = log2_optab; break;
1959 CASE_FLT_FN (BUILT_IN_LOG1P):
1960 errno_set = true; builtin_optab = log1p_optab; break;
1961 CASE_FLT_FN (BUILT_IN_ASIN):
1962 builtin_optab = asin_optab; break;
1963 CASE_FLT_FN (BUILT_IN_ACOS):
1964 builtin_optab = acos_optab; break;
1965 CASE_FLT_FN (BUILT_IN_TAN):
1966 builtin_optab = tan_optab; break;
1967 CASE_FLT_FN (BUILT_IN_ATAN):
1968 builtin_optab = atan_optab; break;
1969 CASE_FLT_FN (BUILT_IN_FLOOR):
1970 builtin_optab = floor_optab; break;
1971 CASE_FLT_FN (BUILT_IN_CEIL):
1972 builtin_optab = ceil_optab; break;
1973 CASE_FLT_FN (BUILT_IN_TRUNC):
1974 builtin_optab = btrunc_optab; break;
1975 CASE_FLT_FN (BUILT_IN_ROUND):
1976 builtin_optab = round_optab; break;
1977 CASE_FLT_FN (BUILT_IN_NEARBYINT):
1978 builtin_optab = nearbyint_optab;
1979 if (flag_trapping_math)
1981 /* Else fallthrough and expand as rint. */
1982 CASE_FLT_FN (BUILT_IN_RINT):
1983 builtin_optab = rint_optab; break;
1984 CASE_FLT_FN (BUILT_IN_SIGNIFICAND):
1985 builtin_optab = significand_optab; break;
1990 /* Make a suitable register to place result in. */
1991 mode = TYPE_MODE (TREE_TYPE (exp));
1993 if (! flag_errno_math || ! HONOR_NANS (mode))
1996 /* Before working hard, check whether the instruction is available. */
1997 if (optab_handler (builtin_optab, mode)->insn_code != CODE_FOR_nothing)
1999 target = gen_reg_rtx (mode);
2001 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2002 need to expand the argument again. This way, we will not perform
2003 side-effects more the once. */
2004 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2006 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
2010 /* Compute into TARGET.
2011 Set TARGET to wherever the result comes back. */
2012 target = expand_unop (mode, builtin_optab, op0, target, 0);
2017 expand_errno_check (exp, target);
2019 /* Output the entire sequence. */
2020 insns = get_insns ();
2026 /* If we were unable to expand via the builtin, stop the sequence
2027 (without outputting the insns) and call to the library function
2028 with the stabilized argument list. */
2032 return expand_call (exp, target, target == const0_rtx);
2035 /* Expand a call to the builtin binary math functions (pow and atan2).
2036 Return NULL_RTX if a normal call should be emitted rather than expanding the
2037 function in-line. EXP is the expression that is a call to the builtin
2038 function; if convenient, the result should be placed in TARGET.
2039 SUBTARGET may be used as the target for computing one of EXP's
2043 expand_builtin_mathfn_2 (tree exp, rtx target, rtx subtarget)
2045 optab builtin_optab;
2046 rtx op0, op1, insns;
2047 int op1_type = REAL_TYPE;
2048 tree fndecl = get_callee_fndecl (exp);
2050 enum machine_mode mode;
2051 bool errno_set = true;
2053 switch (DECL_FUNCTION_CODE (fndecl))
2055 CASE_FLT_FN (BUILT_IN_SCALBN):
2056 CASE_FLT_FN (BUILT_IN_SCALBLN):
2057 CASE_FLT_FN (BUILT_IN_LDEXP):
2058 op1_type = INTEGER_TYPE;
2063 if (!validate_arglist (exp, REAL_TYPE, op1_type, VOID_TYPE))
2066 arg0 = CALL_EXPR_ARG (exp, 0);
2067 arg1 = CALL_EXPR_ARG (exp, 1);
2069 switch (DECL_FUNCTION_CODE (fndecl))
2071 CASE_FLT_FN (BUILT_IN_POW):
2072 builtin_optab = pow_optab; break;
2073 CASE_FLT_FN (BUILT_IN_ATAN2):
2074 builtin_optab = atan2_optab; break;
2075 CASE_FLT_FN (BUILT_IN_SCALB):
2076 if (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (exp)))->b != 2)
2078 builtin_optab = scalb_optab; break;
2079 CASE_FLT_FN (BUILT_IN_SCALBN):
2080 CASE_FLT_FN (BUILT_IN_SCALBLN):
2081 if (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (exp)))->b != 2)
2083 /* Fall through... */
2084 CASE_FLT_FN (BUILT_IN_LDEXP):
2085 builtin_optab = ldexp_optab; break;
2086 CASE_FLT_FN (BUILT_IN_FMOD):
2087 builtin_optab = fmod_optab; break;
2088 CASE_FLT_FN (BUILT_IN_REMAINDER):
2089 CASE_FLT_FN (BUILT_IN_DREM):
2090 builtin_optab = remainder_optab; break;
2095 /* Make a suitable register to place result in. */
2096 mode = TYPE_MODE (TREE_TYPE (exp));
2098 /* Before working hard, check whether the instruction is available. */
2099 if (optab_handler (builtin_optab, mode)->insn_code == CODE_FOR_nothing)
2102 target = gen_reg_rtx (mode);
2104 if (! flag_errno_math || ! HONOR_NANS (mode))
2107 /* Always stabilize the argument list. */
2108 CALL_EXPR_ARG (exp, 0) = arg0 = builtin_save_expr (arg0);
2109 CALL_EXPR_ARG (exp, 1) = arg1 = builtin_save_expr (arg1);
2111 op0 = expand_expr (arg0, subtarget, VOIDmode, EXPAND_NORMAL);
2112 op1 = expand_normal (arg1);
2116 /* Compute into TARGET.
2117 Set TARGET to wherever the result comes back. */
2118 target = expand_binop (mode, builtin_optab, op0, op1,
2119 target, 0, OPTAB_DIRECT);
2121 /* If we were unable to expand via the builtin, stop the sequence
2122 (without outputting the insns) and call to the library function
2123 with the stabilized argument list. */
2127 return expand_call (exp, target, target == const0_rtx);
2131 expand_errno_check (exp, target);
2133 /* Output the entire sequence. */
2134 insns = get_insns ();
2141 /* Expand a call to the builtin sin and cos math functions.
2142 Return NULL_RTX if a normal call should be emitted rather than expanding the
2143 function in-line. EXP is the expression that is a call to the builtin
2144 function; if convenient, the result should be placed in TARGET.
2145 SUBTARGET may be used as the target for computing one of EXP's
2149 expand_builtin_mathfn_3 (tree exp, rtx target, rtx subtarget)
2151 optab builtin_optab;
2153 tree fndecl = get_callee_fndecl (exp);
2154 enum machine_mode mode;
2157 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2160 arg = CALL_EXPR_ARG (exp, 0);
2162 switch (DECL_FUNCTION_CODE (fndecl))
2164 CASE_FLT_FN (BUILT_IN_SIN):
2165 CASE_FLT_FN (BUILT_IN_COS):
2166 builtin_optab = sincos_optab; break;
2171 /* Make a suitable register to place result in. */
2172 mode = TYPE_MODE (TREE_TYPE (exp));
2174 /* Check if sincos insn is available, otherwise fallback
2175 to sin or cos insn. */
2176 if (optab_handler (builtin_optab, mode)->insn_code == CODE_FOR_nothing)
2177 switch (DECL_FUNCTION_CODE (fndecl))
2179 CASE_FLT_FN (BUILT_IN_SIN):
2180 builtin_optab = sin_optab; break;
2181 CASE_FLT_FN (BUILT_IN_COS):
2182 builtin_optab = cos_optab; break;
2187 /* Before working hard, check whether the instruction is available. */
2188 if (optab_handler (builtin_optab, mode)->insn_code != CODE_FOR_nothing)
2190 target = gen_reg_rtx (mode);
2192 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2193 need to expand the argument again. This way, we will not perform
2194 side-effects more the once. */
2195 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2197 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
2201 /* Compute into TARGET.
2202 Set TARGET to wherever the result comes back. */
2203 if (builtin_optab == sincos_optab)
2207 switch (DECL_FUNCTION_CODE (fndecl))
2209 CASE_FLT_FN (BUILT_IN_SIN):
2210 result = expand_twoval_unop (builtin_optab, op0, 0, target, 0);
2212 CASE_FLT_FN (BUILT_IN_COS):
2213 result = expand_twoval_unop (builtin_optab, op0, target, 0, 0);
2218 gcc_assert (result);
2222 target = expand_unop (mode, builtin_optab, op0, target, 0);
2227 /* Output the entire sequence. */
2228 insns = get_insns ();
2234 /* If we were unable to expand via the builtin, stop the sequence
2235 (without outputting the insns) and call to the library function
2236 with the stabilized argument list. */
2240 target = expand_call (exp, target, target == const0_rtx);
2245 /* Given an interclass math builtin decl FNDECL and it's argument ARG
2246 return an RTL instruction code that implements the functionality.
2247 If that isn't possible or available return CODE_FOR_nothing. */
2249 static enum insn_code
2250 interclass_mathfn_icode (tree arg, tree fndecl)
2252 bool errno_set = false;
2253 optab builtin_optab = 0;
2254 enum machine_mode mode;
2256 switch (DECL_FUNCTION_CODE (fndecl))
2258 CASE_FLT_FN (BUILT_IN_ILOGB):
2259 errno_set = true; builtin_optab = ilogb_optab; break;
2260 CASE_FLT_FN (BUILT_IN_ISINF):
2261 builtin_optab = isinf_optab; break;
2262 case BUILT_IN_ISNORMAL:
2263 case BUILT_IN_ISFINITE:
2264 CASE_FLT_FN (BUILT_IN_FINITE):
2265 case BUILT_IN_FINITED32:
2266 case BUILT_IN_FINITED64:
2267 case BUILT_IN_FINITED128:
2268 case BUILT_IN_ISINFD32:
2269 case BUILT_IN_ISINFD64:
2270 case BUILT_IN_ISINFD128:
2271 /* These builtins have no optabs (yet). */
2277 /* There's no easy way to detect the case we need to set EDOM. */
2278 if (flag_errno_math && errno_set)
2279 return CODE_FOR_nothing;
2281 /* Optab mode depends on the mode of the input argument. */
2282 mode = TYPE_MODE (TREE_TYPE (arg));
2285 return optab_handler (builtin_optab, mode)->insn_code;
2286 return CODE_FOR_nothing;
2289 /* Expand a call to one of the builtin math functions that operate on
2290 floating point argument and output an integer result (ilogb, isinf,
2292 Return 0 if a normal call should be emitted rather than expanding the
2293 function in-line. EXP is the expression that is a call to the builtin
2294 function; if convenient, the result should be placed in TARGET.
2295 SUBTARGET may be used as the target for computing one of EXP's operands. */
2298 expand_builtin_interclass_mathfn (tree exp, rtx target, rtx subtarget)
2300 enum insn_code icode = CODE_FOR_nothing;
2302 tree fndecl = get_callee_fndecl (exp);
2303 enum machine_mode mode;
2306 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2309 arg = CALL_EXPR_ARG (exp, 0);
2310 icode = interclass_mathfn_icode (arg, fndecl);
2311 mode = TYPE_MODE (TREE_TYPE (arg));
2313 if (icode != CODE_FOR_nothing)
2315 /* Make a suitable register to place result in. */
2317 || GET_MODE (target) != TYPE_MODE (TREE_TYPE (exp)))
2318 target = gen_reg_rtx (TYPE_MODE (TREE_TYPE (exp)));
2320 gcc_assert (insn_data[icode].operand[0].predicate
2321 (target, GET_MODE (target)));
2323 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2324 need to expand the argument again. This way, we will not perform
2325 side-effects more the once. */
2326 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2328 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
2330 if (mode != GET_MODE (op0))
2331 op0 = convert_to_mode (mode, op0, 0);
2333 /* Compute into TARGET.
2334 Set TARGET to wherever the result comes back. */
2335 emit_unop_insn (icode, target, op0, UNKNOWN);
2342 /* Expand a call to the builtin sincos math function.
2343 Return NULL_RTX if a normal call should be emitted rather than expanding the
2344 function in-line. EXP is the expression that is a call to the builtin
2348 expand_builtin_sincos (tree exp)
2350 rtx op0, op1, op2, target1, target2;
2351 enum machine_mode mode;
2352 tree arg, sinp, cosp;
2354 location_t loc = EXPR_LOCATION (exp);
2356 if (!validate_arglist (exp, REAL_TYPE,
2357 POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
2360 arg = CALL_EXPR_ARG (exp, 0);
2361 sinp = CALL_EXPR_ARG (exp, 1);
2362 cosp = CALL_EXPR_ARG (exp, 2);
2364 /* Make a suitable register to place result in. */
2365 mode = TYPE_MODE (TREE_TYPE (arg));
2367 /* Check if sincos insn is available, otherwise emit the call. */
2368 if (optab_handler (sincos_optab, mode)->insn_code == CODE_FOR_nothing)
2371 target1 = gen_reg_rtx (mode);
2372 target2 = gen_reg_rtx (mode);
2374 op0 = expand_normal (arg);
2375 op1 = expand_normal (build_fold_indirect_ref_loc (loc, sinp));
2376 op2 = expand_normal (build_fold_indirect_ref_loc (loc, cosp));
2378 /* Compute into target1 and target2.
2379 Set TARGET to wherever the result comes back. */
2380 result = expand_twoval_unop (sincos_optab, op0, target2, target1, 0);
2381 gcc_assert (result);
2383 /* Move target1 and target2 to the memory locations indicated
2385 emit_move_insn (op1, target1);
2386 emit_move_insn (op2, target2);
2391 /* Expand a call to the internal cexpi builtin to the sincos math function.
2392 EXP is the expression that is a call to the builtin function; if convenient,
2393 the result should be placed in TARGET. SUBTARGET may be used as the target
2394 for computing one of EXP's operands. */
2397 expand_builtin_cexpi (tree exp, rtx target, rtx subtarget)
2399 tree fndecl = get_callee_fndecl (exp);
2401 enum machine_mode mode;
2403 location_t loc = EXPR_LOCATION (exp);
2405 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2408 arg = CALL_EXPR_ARG (exp, 0);
2409 type = TREE_TYPE (arg);
2410 mode = TYPE_MODE (TREE_TYPE (arg));
2412 /* Try expanding via a sincos optab, fall back to emitting a libcall
2413 to sincos or cexp. We are sure we have sincos or cexp because cexpi
2414 is only generated from sincos, cexp or if we have either of them. */
2415 if (optab_handler (sincos_optab, mode)->insn_code != CODE_FOR_nothing)
2417 op1 = gen_reg_rtx (mode);
2418 op2 = gen_reg_rtx (mode);
2420 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
2422 /* Compute into op1 and op2. */
2423 expand_twoval_unop (sincos_optab, op0, op2, op1, 0);
2425 else if (TARGET_HAS_SINCOS)
2427 tree call, fn = NULL_TREE;
2431 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIF)
2432 fn = built_in_decls[BUILT_IN_SINCOSF];
2433 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPI)
2434 fn = built_in_decls[BUILT_IN_SINCOS];
2435 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIL)
2436 fn = built_in_decls[BUILT_IN_SINCOSL];
2440 op1 = assign_temp (TREE_TYPE (arg), 0, 1, 1);
2441 op2 = assign_temp (TREE_TYPE (arg), 0, 1, 1);
2442 op1a = copy_to_mode_reg (Pmode, XEXP (op1, 0));
2443 op2a = copy_to_mode_reg (Pmode, XEXP (op2, 0));
2444 top1 = make_tree (build_pointer_type (TREE_TYPE (arg)), op1a);
2445 top2 = make_tree (build_pointer_type (TREE_TYPE (arg)), op2a);
2447 /* Make sure not to fold the sincos call again. */
2448 call = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn);
2449 expand_normal (build_call_nary (TREE_TYPE (TREE_TYPE (fn)),
2450 call, 3, arg, top1, top2));
2454 tree call, fn = NULL_TREE, narg;
2455 tree ctype = build_complex_type (type);
2457 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIF)
2458 fn = built_in_decls[BUILT_IN_CEXPF];
2459 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPI)
2460 fn = built_in_decls[BUILT_IN_CEXP];
2461 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIL)
2462 fn = built_in_decls[BUILT_IN_CEXPL];
2466 /* If we don't have a decl for cexp create one. This is the
2467 friendliest fallback if the user calls __builtin_cexpi
2468 without full target C99 function support. */
2469 if (fn == NULL_TREE)
2472 const char *name = NULL;
2474 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIF)
2476 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPI)
2478 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIL)
2481 fntype = build_function_type_list (ctype, ctype, NULL_TREE);
2482 fn = build_fn_decl (name, fntype);
2485 narg = fold_build2_loc (loc, COMPLEX_EXPR, ctype,
2486 build_real (type, dconst0), arg);
2488 /* Make sure not to fold the cexp call again. */
2489 call = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn);
2490 return expand_expr (build_call_nary (ctype, call, 1, narg),
2491 target, VOIDmode, EXPAND_NORMAL);
2494 /* Now build the proper return type. */
2495 return expand_expr (build2 (COMPLEX_EXPR, build_complex_type (type),
2496 make_tree (TREE_TYPE (arg), op2),
2497 make_tree (TREE_TYPE (arg), op1)),
2498 target, VOIDmode, EXPAND_NORMAL);
2501 /* Conveniently construct a function call expression. FNDECL names the
2502 function to be called, N is the number of arguments, and the "..."
2503 parameters are the argument expressions. Unlike build_call_exr
2504 this doesn't fold the call, hence it will always return a CALL_EXPR. */
2507 build_call_nofold_loc (location_t loc, tree fndecl, int n, ...)
2510 tree fntype = TREE_TYPE (fndecl);
2511 tree fn = build1 (ADDR_EXPR, build_pointer_type (fntype), fndecl);
2514 fn = build_call_valist (TREE_TYPE (fntype), fn, n, ap);
2516 SET_EXPR_LOCATION (fn, loc);
2519 #define build_call_nofold(...) \
2520 build_call_nofold_loc (UNKNOWN_LOCATION, __VA_ARGS__)
2522 /* Expand a call to one of the builtin rounding functions gcc defines
2523 as an extension (lfloor and lceil). As these are gcc extensions we
2524 do not need to worry about setting errno to EDOM.
2525 If expanding via optab fails, lower expression to (int)(floor(x)).
2526 EXP is the expression that is a call to the builtin function;
2527 if convenient, the result should be placed in TARGET. */
2530 expand_builtin_int_roundingfn (tree exp, rtx target)
2532 convert_optab builtin_optab;
2533 rtx op0, insns, tmp;
2534 tree fndecl = get_callee_fndecl (exp);
2535 enum built_in_function fallback_fn;
2536 tree fallback_fndecl;
2537 enum machine_mode mode;
2540 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2543 arg = CALL_EXPR_ARG (exp, 0);
2545 switch (DECL_FUNCTION_CODE (fndecl))
2547 CASE_FLT_FN (BUILT_IN_LCEIL):
2548 CASE_FLT_FN (BUILT_IN_LLCEIL):
2549 builtin_optab = lceil_optab;
2550 fallback_fn = BUILT_IN_CEIL;
2553 CASE_FLT_FN (BUILT_IN_LFLOOR):
2554 CASE_FLT_FN (BUILT_IN_LLFLOOR):
2555 builtin_optab = lfloor_optab;
2556 fallback_fn = BUILT_IN_FLOOR;
2563 /* Make a suitable register to place result in. */
2564 mode = TYPE_MODE (TREE_TYPE (exp));
2566 target = gen_reg_rtx (mode);
2568 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2569 need to expand the argument again. This way, we will not perform
2570 side-effects more the once. */
2571 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2573 op0 = expand_expr (arg, NULL, VOIDmode, EXPAND_NORMAL);
2577 /* Compute into TARGET. */
2578 if (expand_sfix_optab (target, op0, builtin_optab))
2580 /* Output the entire sequence. */
2581 insns = get_insns ();
2587 /* If we were unable to expand via the builtin, stop the sequence
2588 (without outputting the insns). */
2591 /* Fall back to floating point rounding optab. */
2592 fallback_fndecl = mathfn_built_in (TREE_TYPE (arg), fallback_fn);
2594 /* For non-C99 targets we may end up without a fallback fndecl here
2595 if the user called __builtin_lfloor directly. In this case emit
2596 a call to the floor/ceil variants nevertheless. This should result
2597 in the best user experience for not full C99 targets. */
2598 if (fallback_fndecl == NULL_TREE)
2601 const char *name = NULL;
2603 switch (DECL_FUNCTION_CODE (fndecl))
2605 case BUILT_IN_LCEIL:
2606 case BUILT_IN_LLCEIL:
2609 case BUILT_IN_LCEILF:
2610 case BUILT_IN_LLCEILF:
2613 case BUILT_IN_LCEILL:
2614 case BUILT_IN_LLCEILL:
2617 case BUILT_IN_LFLOOR:
2618 case BUILT_IN_LLFLOOR:
2621 case BUILT_IN_LFLOORF:
2622 case BUILT_IN_LLFLOORF:
2625 case BUILT_IN_LFLOORL:
2626 case BUILT_IN_LLFLOORL:
2633 fntype = build_function_type_list (TREE_TYPE (arg),
2634 TREE_TYPE (arg), NULL_TREE);
2635 fallback_fndecl = build_fn_decl (name, fntype);
2638 exp = build_call_nofold (fallback_fndecl, 1, arg);
2640 tmp = expand_normal (exp);
2642 /* Truncate the result of floating point optab to integer
2643 via expand_fix (). */
2644 target = gen_reg_rtx (mode);
2645 expand_fix (target, tmp, 0);
2650 /* Expand a call to one of the builtin math functions doing integer
2652 Return 0 if a normal call should be emitted rather than expanding the
2653 function in-line. EXP is the expression that is a call to the builtin
2654 function; if convenient, the result should be placed in TARGET. */
2657 expand_builtin_int_roundingfn_2 (tree exp, rtx target)
2659 convert_optab builtin_optab;
2661 tree fndecl = get_callee_fndecl (exp);
2663 enum machine_mode mode;
2665 /* There's no easy way to detect the case we need to set EDOM. */
2666 if (flag_errno_math)
2669 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2672 arg = CALL_EXPR_ARG (exp, 0);
2674 switch (DECL_FUNCTION_CODE (fndecl))
2676 CASE_FLT_FN (BUILT_IN_LRINT):
2677 CASE_FLT_FN (BUILT_IN_LLRINT):
2678 builtin_optab = lrint_optab; break;
2679 CASE_FLT_FN (BUILT_IN_LROUND):
2680 CASE_FLT_FN (BUILT_IN_LLROUND):
2681 builtin_optab = lround_optab; break;
2686 /* Make a suitable register to place result in. */
2687 mode = TYPE_MODE (TREE_TYPE (exp));
2689 target = gen_reg_rtx (mode);
2691 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2692 need to expand the argument again. This way, we will not perform
2693 side-effects more the once. */
2694 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2696 op0 = expand_expr (arg, NULL, VOIDmode, EXPAND_NORMAL);
2700 if (expand_sfix_optab (target, op0, builtin_optab))
2702 /* Output the entire sequence. */
2703 insns = get_insns ();
2709 /* If we were unable to expand via the builtin, stop the sequence
2710 (without outputting the insns) and call to the library function
2711 with the stabilized argument list. */
2714 target = expand_call (exp, target, target == const0_rtx);
2719 /* To evaluate powi(x,n), the floating point value x raised to the
2720 constant integer exponent n, we use a hybrid algorithm that
2721 combines the "window method" with look-up tables. For an
2722 introduction to exponentiation algorithms and "addition chains",
2723 see section 4.6.3, "Evaluation of Powers" of Donald E. Knuth,
2724 "Seminumerical Algorithms", Vol. 2, "The Art of Computer Programming",
2725 3rd Edition, 1998, and Daniel M. Gordon, "A Survey of Fast Exponentiation
2726 Methods", Journal of Algorithms, Vol. 27, pp. 129-146, 1998. */
2728 /* Provide a default value for POWI_MAX_MULTS, the maximum number of
2729 multiplications to inline before calling the system library's pow
2730 function. powi(x,n) requires at worst 2*bits(n)-2 multiplications,
2731 so this default never requires calling pow, powf or powl. */
2733 #ifndef POWI_MAX_MULTS
2734 #define POWI_MAX_MULTS (2*HOST_BITS_PER_WIDE_INT-2)
2737 /* The size of the "optimal power tree" lookup table. All
2738 exponents less than this value are simply looked up in the
2739 powi_table below. This threshold is also used to size the
2740 cache of pseudo registers that hold intermediate results. */
2741 #define POWI_TABLE_SIZE 256
2743 /* The size, in bits of the window, used in the "window method"
2744 exponentiation algorithm. This is equivalent to a radix of
2745 (1<<POWI_WINDOW_SIZE) in the corresponding "m-ary method". */
2746 #define POWI_WINDOW_SIZE 3
2748 /* The following table is an efficient representation of an
2749 "optimal power tree". For each value, i, the corresponding
2750 value, j, in the table states than an optimal evaluation
2751 sequence for calculating pow(x,i) can be found by evaluating
2752 pow(x,j)*pow(x,i-j). An optimal power tree for the first
2753 100 integers is given in Knuth's "Seminumerical algorithms". */
2755 static const unsigned char powi_table[POWI_TABLE_SIZE] =
2757 0, 1, 1, 2, 2, 3, 3, 4, /* 0 - 7 */
2758 4, 6, 5, 6, 6, 10, 7, 9, /* 8 - 15 */
2759 8, 16, 9, 16, 10, 12, 11, 13, /* 16 - 23 */
2760 12, 17, 13, 18, 14, 24, 15, 26, /* 24 - 31 */
2761 16, 17, 17, 19, 18, 33, 19, 26, /* 32 - 39 */
2762 20, 25, 21, 40, 22, 27, 23, 44, /* 40 - 47 */
2763 24, 32, 25, 34, 26, 29, 27, 44, /* 48 - 55 */
2764 28, 31, 29, 34, 30, 60, 31, 36, /* 56 - 63 */
2765 32, 64, 33, 34, 34, 46, 35, 37, /* 64 - 71 */
2766 36, 65, 37, 50, 38, 48, 39, 69, /* 72 - 79 */
2767 40, 49, 41, 43, 42, 51, 43, 58, /* 80 - 87 */
2768 44, 64, 45, 47, 46, 59, 47, 76, /* 88 - 95 */
2769 48, 65, 49, 66, 50, 67, 51, 66, /* 96 - 103 */
2770 52, 70, 53, 74, 54, 104, 55, 74, /* 104 - 111 */
2771 56, 64, 57, 69, 58, 78, 59, 68, /* 112 - 119 */
2772 60, 61, 61, 80, 62, 75, 63, 68, /* 120 - 127 */
2773 64, 65, 65, 128, 66, 129, 67, 90, /* 128 - 135 */
2774 68, 73, 69, 131, 70, 94, 71, 88, /* 136 - 143 */
2775 72, 128, 73, 98, 74, 132, 75, 121, /* 144 - 151 */
2776 76, 102, 77, 124, 78, 132, 79, 106, /* 152 - 159 */
2777 80, 97, 81, 160, 82, 99, 83, 134, /* 160 - 167 */
2778 84, 86, 85, 95, 86, 160, 87, 100, /* 168 - 175 */
2779 88, 113, 89, 98, 90, 107, 91, 122, /* 176 - 183 */
2780 92, 111, 93, 102, 94, 126, 95, 150, /* 184 - 191 */
2781 96, 128, 97, 130, 98, 133, 99, 195, /* 192 - 199 */
2782 100, 128, 101, 123, 102, 164, 103, 138, /* 200 - 207 */
2783 104, 145, 105, 146, 106, 109, 107, 149, /* 208 - 215 */
2784 108, 200, 109, 146, 110, 170, 111, 157, /* 216 - 223 */
2785 112, 128, 113, 130, 114, 182, 115, 132, /* 224 - 231 */
2786 116, 200, 117, 132, 118, 158, 119, 206, /* 232 - 239 */
2787 120, 240, 121, 162, 122, 147, 123, 152, /* 240 - 247 */
2788 124, 166, 125, 214, 126, 138, 127, 153, /* 248 - 255 */
2792 /* Return the number of multiplications required to calculate
2793 powi(x,n) where n is less than POWI_TABLE_SIZE. This is a
2794 subroutine of powi_cost. CACHE is an array indicating
2795 which exponents have already been calculated. */
2798 powi_lookup_cost (unsigned HOST_WIDE_INT n, bool *cache)
2800 /* If we've already calculated this exponent, then this evaluation
2801 doesn't require any additional multiplications. */
2806 return powi_lookup_cost (n - powi_table[n], cache)
2807 + powi_lookup_cost (powi_table[n], cache) + 1;
2810 /* Return the number of multiplications required to calculate
2811 powi(x,n) for an arbitrary x, given the exponent N. This
2812 function needs to be kept in sync with expand_powi below. */
2815 powi_cost (HOST_WIDE_INT n)
2817 bool cache[POWI_TABLE_SIZE];
2818 unsigned HOST_WIDE_INT digit;
2819 unsigned HOST_WIDE_INT val;
2825 /* Ignore the reciprocal when calculating the cost. */
2826 val = (n < 0) ? -n : n;
2828 /* Initialize the exponent cache. */
2829 memset (cache, 0, POWI_TABLE_SIZE * sizeof (bool));
2834 while (val >= POWI_TABLE_SIZE)
2838 digit = val & ((1 << POWI_WINDOW_SIZE) - 1);
2839 result += powi_lookup_cost (digit, cache)
2840 + POWI_WINDOW_SIZE + 1;
2841 val >>= POWI_WINDOW_SIZE;
2850 return result + powi_lookup_cost (val, cache);
2853 /* Recursive subroutine of expand_powi. This function takes the array,
2854 CACHE, of already calculated exponents and an exponent N and returns
2855 an RTX that corresponds to CACHE[1]**N, as calculated in mode MODE. */
2858 expand_powi_1 (enum machine_mode mode, unsigned HOST_WIDE_INT n, rtx *cache)
2860 unsigned HOST_WIDE_INT digit;
2864 if (n < POWI_TABLE_SIZE)
2869 target = gen_reg_rtx (mode);
2872 op0 = expand_powi_1 (mode, n - powi_table[n], cache);
2873 op1 = expand_powi_1 (mode, powi_table[n], cache);
2877 target = gen_reg_rtx (mode);
2878 digit = n & ((1 << POWI_WINDOW_SIZE) - 1);
2879 op0 = expand_powi_1 (mode, n - digit, cache);
2880 op1 = expand_powi_1 (mode, digit, cache);
2884 target = gen_reg_rtx (mode);
2885 op0 = expand_powi_1 (mode, n >> 1, cache);
2889 result = expand_mult (mode, op0, op1, target, 0);
2890 if (result != target)
2891 emit_move_insn (target, result);
2895 /* Expand the RTL to evaluate powi(x,n) in mode MODE. X is the
2896 floating point operand in mode MODE, and N is the exponent. This
2897 function needs to be kept in sync with powi_cost above. */
2900 expand_powi (rtx x, enum machine_mode mode, HOST_WIDE_INT n)
2902 rtx cache[POWI_TABLE_SIZE];
2906 return CONST1_RTX (mode);
2908 memset (cache, 0, sizeof (cache));
2911 result = expand_powi_1 (mode, (n < 0) ? -n : n, cache);
2913 /* If the original exponent was negative, reciprocate the result. */
2915 result = expand_binop (mode, sdiv_optab, CONST1_RTX (mode),
2916 result, NULL_RTX, 0, OPTAB_LIB_WIDEN);
2921 /* Expand a call to the pow built-in mathematical function. Return NULL_RTX if
2922 a normal call should be emitted rather than expanding the function
2923 in-line. EXP is the expression that is a call to the builtin
2924 function; if convenient, the result should be placed in TARGET. */
2927 expand_builtin_pow (tree exp, rtx target, rtx subtarget)
2931 tree type = TREE_TYPE (exp);
2932 REAL_VALUE_TYPE cint, c, c2;
2935 enum machine_mode mode = TYPE_MODE (type);
2937 if (! validate_arglist (exp, REAL_TYPE, REAL_TYPE, VOID_TYPE))
2940 arg0 = CALL_EXPR_ARG (exp, 0);
2941 arg1 = CALL_EXPR_ARG (exp, 1);
2943 if (TREE_CODE (arg1) != REAL_CST
2944 || TREE_OVERFLOW (arg1))
2945 return expand_builtin_mathfn_2 (exp, target, subtarget);
2947 /* Handle constant exponents. */
2949 /* For integer valued exponents we can expand to an optimal multiplication
2950 sequence using expand_powi. */
2951 c = TREE_REAL_CST (arg1);
2952 n = real_to_integer (&c);
2953 real_from_integer (&cint, VOIDmode, n, n < 0 ? -1 : 0, 0);
2954 if (real_identical (&c, &cint)
2955 && ((n >= -1 && n <= 2)
2956 || (flag_unsafe_math_optimizations
2957 && optimize_insn_for_speed_p ()
2958 && powi_cost (n) <= POWI_MAX_MULTS)))
2960 op = expand_expr (arg0, subtarget, VOIDmode, EXPAND_NORMAL);
2963 op = force_reg (mode, op);
2964 op = expand_powi (op, mode, n);
2969 narg0 = builtin_save_expr (arg0);
2971 /* If the exponent is not integer valued, check if it is half of an integer.
2972 In this case we can expand to sqrt (x) * x**(n/2). */
2973 fn = mathfn_built_in (type, BUILT_IN_SQRT);
2974 if (fn != NULL_TREE)
2976 real_arithmetic (&c2, MULT_EXPR, &c, &dconst2);
2977 n = real_to_integer (&c2);
2978 real_from_integer (&cint, VOIDmode, n, n < 0 ? -1 : 0, 0);
2979 if (real_identical (&c2, &cint)
2980 && ((flag_unsafe_math_optimizations
2981 && optimize_insn_for_speed_p ()
2982 && powi_cost (n/2) <= POWI_MAX_MULTS)
2985 tree call_expr = build_call_nofold (fn, 1, narg0);
2986 /* Use expand_expr in case the newly built call expression
2987 was folded to a non-call. */
2988 op = expand_expr (call_expr, subtarget, mode, EXPAND_NORMAL);
2991 op2 = expand_expr (narg0, subtarget, VOIDmode, EXPAND_NORMAL);
2992 op2 = force_reg (mode, op2);
2993 op2 = expand_powi (op2, mode, abs (n / 2));
2994 op = expand_simple_binop (mode, MULT, op, op2, NULL_RTX,
2995 0, OPTAB_LIB_WIDEN);
2996 /* If the original exponent was negative, reciprocate the
2999 op = expand_binop (mode, sdiv_optab, CONST1_RTX (mode),
3000 op, NULL_RTX, 0, OPTAB_LIB_WIDEN);
3006 /* Try if the exponent is a third of an integer. In this case
3007 we can expand to x**(n/3) * cbrt(x)**(n%3). As cbrt (x) is
3008 different from pow (x, 1./3.) due to rounding and behavior
3009 with negative x we need to constrain this transformation to
3010 unsafe math and positive x or finite math. */
3011 fn = mathfn_built_in (type, BUILT_IN_CBRT);
3013 && flag_unsafe_math_optimizations
3014 && (tree_expr_nonnegative_p (arg0)
3015 || !HONOR_NANS (mode)))
3017 REAL_VALUE_TYPE dconst3;
3018 real_from_integer (&dconst3, VOIDmode, 3, 0, 0);
3019 real_arithmetic (&c2, MULT_EXPR, &c, &dconst3);
3020 real_round (&c2, mode, &c2);
3021 n = real_to_integer (&c2);
3022 real_from_integer (&cint, VOIDmode, n, n < 0 ? -1 : 0, 0);
3023 real_arithmetic (&c2, RDIV_EXPR, &cint, &dconst3);
3024 real_convert (&c2, mode, &c2);
3025 if (real_identical (&c2, &c)
3026 && ((optimize_insn_for_speed_p ()
3027 && powi_cost (n/3) <= POWI_MAX_MULTS)
3030 tree call_expr = build_call_nofold (fn, 1,narg0);
3031 op = expand_builtin (call_expr, NULL_RTX, subtarget, mode, 0);
3032 if (abs (n) % 3 == 2)
3033 op = expand_simple_binop (mode, MULT, op, op, op,
3034 0, OPTAB_LIB_WIDEN);
3037 op2 = expand_expr (narg0, subtarget, VOIDmode, EXPAND_NORMAL);
3038 op2 = force_reg (mode, op2);
3039 op2 = expand_powi (op2, mode, abs (n / 3));
3040 op = expand_simple_binop (mode, MULT, op, op2, NULL_RTX,
3041 0, OPTAB_LIB_WIDEN);
3042 /* If the original exponent was negative, reciprocate the
3045 op = expand_binop (mode, sdiv_optab, CONST1_RTX (mode),
3046 op, NULL_RTX, 0, OPTAB_LIB_WIDEN);
3052 /* Fall back to optab expansion. */
3053 return expand_builtin_mathfn_2 (exp, target, subtarget);
3056 /* Expand a call to the powi built-in mathematical function. Return NULL_RTX if
3057 a normal call should be emitted rather than expanding the function
3058 in-line. EXP is the expression that is a call to the builtin
3059 function; if convenient, the result should be placed in TARGET. */
3062 expand_builtin_powi (tree exp, rtx target, rtx subtarget)
3066 enum machine_mode mode;
3067 enum machine_mode mode2;
3069 if (! validate_arglist (exp, REAL_TYPE, INTEGER_TYPE, VOID_TYPE))
3072 arg0 = CALL_EXPR_ARG (exp, 0);
3073 arg1 = CALL_EXPR_ARG (exp, 1);
3074 mode = TYPE_MODE (TREE_TYPE (exp));
3076 /* Handle constant power. */
3078 if (TREE_CODE (arg1) == INTEGER_CST
3079 && !TREE_OVERFLOW (arg1))
3081 HOST_WIDE_INT n = TREE_INT_CST_LOW (arg1);
3083 /* If the exponent is -1, 0, 1 or 2, then expand_powi is exact.
3084 Otherwise, check the number of multiplications required. */
3085 if ((TREE_INT_CST_HIGH (arg1) == 0
3086 || TREE_INT_CST_HIGH (arg1) == -1)
3087 && ((n >= -1 && n <= 2)
3088 || (optimize_insn_for_speed_p ()
3089 && powi_cost (n) <= POWI_MAX_MULTS)))
3091 op0 = expand_expr (arg0, subtarget, VOIDmode, EXPAND_NORMAL);
3092 op0 = force_reg (mode, op0);
3093 return expand_powi (op0, mode, n);
3097 /* Emit a libcall to libgcc. */
3099 /* Mode of the 2nd argument must match that of an int. */
3100 mode2 = mode_for_size (INT_TYPE_SIZE, MODE_INT, 0);
3102 if (target == NULL_RTX)
3103 target = gen_reg_rtx (mode);
3105 op0 = expand_expr (arg0, subtarget, mode, EXPAND_NORMAL);
3106 if (GET_MODE (op0) != mode)
3107 op0 = convert_to_mode (mode, op0, 0);
3108 op1 = expand_expr (arg1, NULL_RTX, mode2, EXPAND_NORMAL);
3109 if (GET_MODE (op1) != mode2)
3110 op1 = convert_to_mode (mode2, op1, 0);
3112 target = emit_library_call_value (optab_libfunc (powi_optab, mode),
3113 target, LCT_CONST, mode, 2,
3114 op0, mode, op1, mode2);
3119 /* Expand expression EXP which is a call to the strlen builtin. Return
3120 NULL_RTX if we failed the caller should emit a normal call, otherwise
3121 try to get the result in TARGET, if convenient. */
3124 expand_builtin_strlen (tree exp, rtx target,
3125 enum machine_mode target_mode)
3127 if (!validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
3133 tree src = CALL_EXPR_ARG (exp, 0);
3134 rtx result, src_reg, char_rtx, before_strlen;
3135 enum machine_mode insn_mode = target_mode, char_mode;
3136 enum insn_code icode = CODE_FOR_nothing;
3139 /* If the length can be computed at compile-time, return it. */
3140 len = c_strlen (src, 0);
3142 return expand_expr (len, target, target_mode, EXPAND_NORMAL);
3144 /* If the length can be computed at compile-time and is constant
3145 integer, but there are side-effects in src, evaluate
3146 src for side-effects, then return len.
3147 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
3148 can be optimized into: i++; x = 3; */
3149 len = c_strlen (src, 1);
3150 if (len && TREE_CODE (len) == INTEGER_CST)
3152 expand_expr (src, const0_rtx, VOIDmode, EXPAND_NORMAL);
3153 return expand_expr (len, target, target_mode, EXPAND_NORMAL);
3156 align = get_pointer_alignment (src, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3158 /* If SRC is not a pointer type, don't do this operation inline. */
3162 /* Bail out if we can't compute strlen in the right mode. */
3163 while (insn_mode != VOIDmode)
3165 icode = optab_handler (strlen_optab, insn_mode)->insn_code;
3166 if (icode != CODE_FOR_nothing)
3169 insn_mode = GET_MODE_WIDER_MODE (insn_mode);
3171 if (insn_mode == VOIDmode)
3174 /* Make a place to write the result of the instruction. */
3178 && GET_MODE (result) == insn_mode
3179 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
3180 result = gen_reg_rtx (insn_mode);
3182 /* Make a place to hold the source address. We will not expand
3183 the actual source until we are sure that the expansion will
3184 not fail -- there are trees that cannot be expanded twice. */
3185 src_reg = gen_reg_rtx (Pmode);
3187 /* Mark the beginning of the strlen sequence so we can emit the
3188 source operand later. */
3189 before_strlen = get_last_insn ();
3191 char_rtx = const0_rtx;
3192 char_mode = insn_data[(int) icode].operand[2].mode;
3193 if (! (*insn_data[(int) icode].operand[2].predicate) (char_rtx,
3195 char_rtx = copy_to_mode_reg (char_mode, char_rtx);
3197 pat = GEN_FCN (icode) (result, gen_rtx_MEM (BLKmode, src_reg),
3198 char_rtx, GEN_INT (align));
3203 /* Now that we are assured of success, expand the source. */
3205 pat = expand_expr (src, src_reg, ptr_mode, EXPAND_NORMAL);
3207 emit_move_insn (src_reg, pat);
3212 emit_insn_after (pat, before_strlen);
3214 emit_insn_before (pat, get_insns ());
3216 /* Return the value in the proper mode for this function. */
3217 if (GET_MODE (result) == target_mode)
3219 else if (target != 0)
3220 convert_move (target, result, 0);
3222 target = convert_to_mode (target_mode, result, 0);
3228 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3229 bytes from constant string DATA + OFFSET and return it as target
3233 builtin_memcpy_read_str (void *data, HOST_WIDE_INT offset,
3234 enum machine_mode mode)
3236 const char *str = (const char *) data;
3238 gcc_assert (offset >= 0
3239 && ((unsigned HOST_WIDE_INT) offset + GET_MODE_SIZE (mode)
3240 <= strlen (str) + 1));
3242 return c_readstr (str + offset, mode);
3245 /* Expand a call EXP to the memcpy builtin.
3246 Return NULL_RTX if we failed, the caller should emit a normal call,
3247 otherwise try to get the result in TARGET, if convenient (and in
3248 mode MODE if that's convenient). */
3251 expand_builtin_memcpy (tree exp, rtx target)
3253 if (!validate_arglist (exp,
3254 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3258 tree dest = CALL_EXPR_ARG (exp, 0);
3259 tree src = CALL_EXPR_ARG (exp, 1);
3260 tree len = CALL_EXPR_ARG (exp, 2);
3261 const char *src_str;
3262 unsigned int src_align = get_pointer_alignment (src, BIGGEST_ALIGNMENT);
3263 unsigned int dest_align
3264 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
3265 rtx dest_mem, src_mem, dest_addr, len_rtx;
3266 HOST_WIDE_INT expected_size = -1;
3267 unsigned int expected_align = 0;
3268 tree_ann_common_t ann;
3270 /* If DEST is not a pointer type, call the normal function. */
3271 if (dest_align == 0)
3274 /* If either SRC is not a pointer type, don't do this
3275 operation in-line. */
3279 ann = tree_common_ann (exp);
3281 stringop_block_profile (ann->stmt, &expected_align, &expected_size);
3283 if (expected_align < dest_align)
3284 expected_align = dest_align;
3285 dest_mem = get_memory_rtx (dest, len);
3286 set_mem_align (dest_mem, dest_align);
3287 len_rtx = expand_normal (len);
3288 src_str = c_getstr (src);
3290 /* If SRC is a string constant and block move would be done
3291 by pieces, we can avoid loading the string from memory
3292 and only stored the computed constants. */
3294 && CONST_INT_P (len_rtx)
3295 && (unsigned HOST_WIDE_INT) INTVAL (len_rtx) <= strlen (src_str) + 1
3296 && can_store_by_pieces (INTVAL (len_rtx), builtin_memcpy_read_str,
3297 CONST_CAST (char *, src_str),
3300 dest_mem = store_by_pieces (dest_mem, INTVAL (len_rtx),
3301 builtin_memcpy_read_str,
3302 CONST_CAST (char *, src_str),
3303 dest_align, false, 0);
3304 dest_mem = force_operand (XEXP (dest_mem, 0), target);
3305 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3309 src_mem = get_memory_rtx (src, len);
3310 set_mem_align (src_mem, src_align);
3312 /* Copy word part most expediently. */
3313 dest_addr = emit_block_move_hints (dest_mem, src_mem, len_rtx,
3314 CALL_EXPR_TAILCALL (exp)
3315 ? BLOCK_OP_TAILCALL : BLOCK_OP_NORMAL,
3316 expected_align, expected_size);
3320 dest_addr = force_operand (XEXP (dest_mem, 0), target);
3321 dest_addr = convert_memory_address (ptr_mode, dest_addr);
3327 /* Expand a call EXP to the mempcpy builtin.
3328 Return NULL_RTX if we failed; the caller should emit a normal call,
3329 otherwise try to get the result in TARGET, if convenient (and in
3330 mode MODE if that's convenient). If ENDP is 0 return the
3331 destination pointer, if ENDP is 1 return the end pointer ala
3332 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3336 expand_builtin_mempcpy (tree exp, rtx target, enum machine_mode mode)
3338 if (!validate_arglist (exp,
3339 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3343 tree dest = CALL_EXPR_ARG (exp, 0);
3344 tree src = CALL_EXPR_ARG (exp, 1);
3345 tree len = CALL_EXPR_ARG (exp, 2);
3346 return expand_builtin_mempcpy_args (dest, src, len,
3347 target, mode, /*endp=*/ 1);
3351 /* Helper function to do the actual work for expand_builtin_mempcpy. The
3352 arguments to the builtin_mempcpy call DEST, SRC, and LEN are broken out
3353 so that this can also be called without constructing an actual CALL_EXPR.
3354 The other arguments and return value are the same as for
3355 expand_builtin_mempcpy. */
3358 expand_builtin_mempcpy_args (tree dest, tree src, tree len,
3359 rtx target, enum machine_mode mode, int endp)
3361 /* If return value is ignored, transform mempcpy into memcpy. */
3362 if (target == const0_rtx && implicit_built_in_decls[BUILT_IN_MEMCPY])
3364 tree fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
3365 tree result = build_call_nofold (fn, 3, dest, src, len);
3366 return expand_expr (result, target, mode, EXPAND_NORMAL);
3370 const char *src_str;
3371 unsigned int src_align = get_pointer_alignment (src, BIGGEST_ALIGNMENT);
3372 unsigned int dest_align
3373 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
3374 rtx dest_mem, src_mem, len_rtx;
3376 /* If either SRC or DEST is not a pointer type, don't do this
3377 operation in-line. */
3378 if (dest_align == 0 || src_align == 0)
3381 /* If LEN is not constant, call the normal function. */
3382 if (! host_integerp (len, 1))
3385 len_rtx = expand_normal (len);
3386 src_str = c_getstr (src);
3388 /* If SRC is a string constant and block move would be done
3389 by pieces, we can avoid loading the string from memory
3390 and only stored the computed constants. */
3392 && CONST_INT_P (len_rtx)
3393 && (unsigned HOST_WIDE_INT) INTVAL (len_rtx) <= strlen (src_str) + 1
3394 && can_store_by_pieces (INTVAL (len_rtx), builtin_memcpy_read_str,
3395 CONST_CAST (char *, src_str),
3398 dest_mem = get_memory_rtx (dest, len);
3399 set_mem_align (dest_mem, dest_align);
3400 dest_mem = store_by_pieces (dest_mem, INTVAL (len_rtx),
3401 builtin_memcpy_read_str,
3402 CONST_CAST (char *, src_str),
3403 dest_align, false, endp);
3404 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3405 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3409 if (CONST_INT_P (len_rtx)
3410 && can_move_by_pieces (INTVAL (len_rtx),
3411 MIN (dest_align, src_align)))
3413 dest_mem = get_memory_rtx (dest, len);
3414 set_mem_align (dest_mem, dest_align);
3415 src_mem = get_memory_rtx (src, len);
3416 set_mem_align (src_mem, src_align);
3417 dest_mem = move_by_pieces (dest_mem, src_mem, INTVAL (len_rtx),
3418 MIN (dest_align, src_align), endp);
3419 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3420 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3429 # define HAVE_movstr 0
3430 # define CODE_FOR_movstr CODE_FOR_nothing
3433 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
3434 we failed, the caller should emit a normal call, otherwise try to
3435 get the result in TARGET, if convenient. If ENDP is 0 return the
3436 destination pointer, if ENDP is 1 return the end pointer ala
3437 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3441 expand_movstr (tree dest, tree src, rtx target, int endp)
3447 const struct insn_data * data;
3452 dest_mem = get_memory_rtx (dest, NULL);
3453 src_mem = get_memory_rtx (src, NULL);
3456 target = force_reg (Pmode, XEXP (dest_mem, 0));
3457 dest_mem = replace_equiv_address (dest_mem, target);
3458 end = gen_reg_rtx (Pmode);
3462 if (target == 0 || target == const0_rtx)
3464 end = gen_reg_rtx (Pmode);
3472 data = insn_data + CODE_FOR_movstr;
3474 if (data->operand[0].mode != VOIDmode)
3475 end = gen_lowpart (data->operand[0].mode, end);
3477 insn = data->genfun (end, dest_mem, src_mem);
3483 /* movstr is supposed to set end to the address of the NUL
3484 terminator. If the caller requested a mempcpy-like return value,
3486 if (endp == 1 && target != const0_rtx)
3488 rtx tem = plus_constant (gen_lowpart (GET_MODE (target), end), 1);
3489 emit_move_insn (target, force_operand (tem, NULL_RTX));
3495 /* Expand expression EXP, which is a call to the strcpy builtin. Return
3496 NULL_RTX if we failed the caller should emit a normal call, otherwise
3497 try to get the result in TARGET, if convenient (and in mode MODE if that's
3501 expand_builtin_strcpy (tree exp, rtx target)
3503 if (validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3505 tree dest = CALL_EXPR_ARG (exp, 0);
3506 tree src = CALL_EXPR_ARG (exp, 1);
3507 return expand_builtin_strcpy_args (dest, src, target);
3512 /* Helper function to do the actual work for expand_builtin_strcpy. The
3513 arguments to the builtin_strcpy call DEST and SRC are broken out
3514 so that this can also be called without constructing an actual CALL_EXPR.
3515 The other arguments and return value are the same as for
3516 expand_builtin_strcpy. */
3519 expand_builtin_strcpy_args (tree dest, tree src, rtx target)
3521 return expand_movstr (dest, src, target, /*endp=*/0);
3524 /* Expand a call EXP to the stpcpy builtin.
3525 Return NULL_RTX if we failed the caller should emit a normal call,
3526 otherwise try to get the result in TARGET, if convenient (and in
3527 mode MODE if that's convenient). */
3530 expand_builtin_stpcpy (tree exp, rtx target, enum machine_mode mode)
3533 location_t loc = EXPR_LOCATION (exp);
3535 if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3538 dst = CALL_EXPR_ARG (exp, 0);
3539 src = CALL_EXPR_ARG (exp, 1);
3541 /* If return value is ignored, transform stpcpy into strcpy. */
3542 if (target == const0_rtx && implicit_built_in_decls[BUILT_IN_STRCPY])
3544 tree fn = implicit_built_in_decls[BUILT_IN_STRCPY];
3545 tree result = build_call_nofold (fn, 2, dst, src);
3546 return expand_expr (result, target, mode, EXPAND_NORMAL);
3553 /* Ensure we get an actual string whose length can be evaluated at
3554 compile-time, not an expression containing a string. This is
3555 because the latter will potentially produce pessimized code
3556 when used to produce the return value. */
3557 if (! c_getstr (src) || ! (len = c_strlen (src, 0)))
3558 return expand_movstr (dst, src, target, /*endp=*/2);
3560 lenp1 = size_binop_loc (loc, PLUS_EXPR, len, ssize_int (1));
3561 ret = expand_builtin_mempcpy_args (dst, src, lenp1,
3562 target, mode, /*endp=*/2);
3567 if (TREE_CODE (len) == INTEGER_CST)
3569 rtx len_rtx = expand_normal (len);
3571 if (CONST_INT_P (len_rtx))
3573 ret = expand_builtin_strcpy_args (dst, src, target);
3579 if (mode != VOIDmode)
3580 target = gen_reg_rtx (mode);
3582 target = gen_reg_rtx (GET_MODE (ret));
3584 if (GET_MODE (target) != GET_MODE (ret))
3585 ret = gen_lowpart (GET_MODE (target), ret);
3587 ret = plus_constant (ret, INTVAL (len_rtx));
3588 ret = emit_move_insn (target, force_operand (ret, NULL_RTX));
3596 return expand_movstr (dst, src, target, /*endp=*/2);
3600 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3601 bytes from constant string DATA + OFFSET and return it as target
3605 builtin_strncpy_read_str (void *data, HOST_WIDE_INT offset,
3606 enum machine_mode mode)
3608 const char *str = (const char *) data;
3610 if ((unsigned HOST_WIDE_INT) offset > strlen (str))
3613 return c_readstr (str + offset, mode);
3616 /* Expand expression EXP, which is a call to the strncpy builtin. Return
3617 NULL_RTX if we failed the caller should emit a normal call. */
3620 expand_builtin_strncpy (tree exp, rtx target)
3622 location_t loc = EXPR_LOCATION (exp);
3624 if (validate_arglist (exp,
3625 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3627 tree dest = CALL_EXPR_ARG (exp, 0);
3628 tree src = CALL_EXPR_ARG (exp, 1);
3629 tree len = CALL_EXPR_ARG (exp, 2);
3630 tree slen = c_strlen (src, 1);
3632 /* We must be passed a constant len and src parameter. */
3633 if (!host_integerp (len, 1) || !slen || !host_integerp (slen, 1))
3636 slen = size_binop_loc (loc, PLUS_EXPR, slen, ssize_int (1));
3638 /* We're required to pad with trailing zeros if the requested
3639 len is greater than strlen(s2)+1. In that case try to
3640 use store_by_pieces, if it fails, punt. */
3641 if (tree_int_cst_lt (slen, len))
3643 unsigned int dest_align
3644 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
3645 const char *p = c_getstr (src);
3648 if (!p || dest_align == 0 || !host_integerp (len, 1)
3649 || !can_store_by_pieces (tree_low_cst (len, 1),
3650 builtin_strncpy_read_str,
3651 CONST_CAST (char *, p),
3655 dest_mem = get_memory_rtx (dest, len);
3656 store_by_pieces (dest_mem, tree_low_cst (len, 1),
3657 builtin_strncpy_read_str,
3658 CONST_CAST (char *, p), dest_align, false, 0);
3659 dest_mem = force_operand (XEXP (dest_mem, 0), target);
3660 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3667 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3668 bytes from constant string DATA + OFFSET and return it as target
3672 builtin_memset_read_str (void *data, HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
3673 enum machine_mode mode)
3675 const char *c = (const char *) data;
3676 char *p = XALLOCAVEC (char, GET_MODE_SIZE (mode));
3678 memset (p, *c, GET_MODE_SIZE (mode));
3680 return c_readstr (p, mode);
3683 /* Callback routine for store_by_pieces. Return the RTL of a register
3684 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
3685 char value given in the RTL register data. For example, if mode is
3686 4 bytes wide, return the RTL for 0x01010101*data. */
3689 builtin_memset_gen_str (void *data, HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
3690 enum machine_mode mode)
3696 size = GET_MODE_SIZE (mode);
3700 p = XALLOCAVEC (char, size);
3701 memset (p, 1, size);
3702 coeff = c_readstr (p, mode);
3704 target = convert_to_mode (mode, (rtx) data, 1);
3705 target = expand_mult (mode, target, coeff, NULL_RTX, 1);
3706 return force_reg (mode, target);
3709 /* Expand expression EXP, which is a call to the memset builtin. Return
3710 NULL_RTX if we failed the caller should emit a normal call, otherwise
3711 try to get the result in TARGET, if convenient (and in mode MODE if that's
3715 expand_builtin_memset (tree exp, rtx target, enum machine_mode mode)
3717 if (!validate_arglist (exp,
3718 POINTER_TYPE, INTEGER_TYPE, INTEGER_TYPE, VOID_TYPE))
3722 tree dest = CALL_EXPR_ARG (exp, 0);
3723 tree val = CALL_EXPR_ARG (exp, 1);
3724 tree len = CALL_EXPR_ARG (exp, 2);
3725 return expand_builtin_memset_args (dest, val, len, target, mode, exp);
3729 /* Helper function to do the actual work for expand_builtin_memset. The
3730 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
3731 so that this can also be called without constructing an actual CALL_EXPR.
3732 The other arguments and return value are the same as for
3733 expand_builtin_memset. */
3736 expand_builtin_memset_args (tree dest, tree val, tree len,
3737 rtx target, enum machine_mode mode, tree orig_exp)
3740 enum built_in_function fcode;
3742 unsigned int dest_align;
3743 rtx dest_mem, dest_addr, len_rtx;
3744 HOST_WIDE_INT expected_size = -1;
3745 unsigned int expected_align = 0;
3746 tree_ann_common_t ann;
3748 dest_align = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
3750 /* If DEST is not a pointer type, don't do this operation in-line. */
3751 if (dest_align == 0)
3754 ann = tree_common_ann (orig_exp);
3756 stringop_block_profile (ann->stmt, &expected_align, &expected_size);
3758 if (expected_align < dest_align)
3759 expected_align = dest_align;
3761 /* If the LEN parameter is zero, return DEST. */
3762 if (integer_zerop (len))
3764 /* Evaluate and ignore VAL in case it has side-effects. */
3765 expand_expr (val, const0_rtx, VOIDmode, EXPAND_NORMAL);
3766 return expand_expr (dest, target, mode, EXPAND_NORMAL);
3769 /* Stabilize the arguments in case we fail. */
3770 dest = builtin_save_expr (dest);
3771 val = builtin_save_expr (val);
3772 len = builtin_save_expr (len);
3774 len_rtx = expand_normal (len);
3775 dest_mem = get_memory_rtx (dest, len);
3777 if (TREE_CODE (val) != INTEGER_CST)
3781 val_rtx = expand_normal (val);
3782 val_rtx = convert_to_mode (TYPE_MODE (unsigned_char_type_node),
3785 /* Assume that we can memset by pieces if we can store
3786 * the coefficients by pieces (in the required modes).
3787 * We can't pass builtin_memset_gen_str as that emits RTL. */
3789 if (host_integerp (len, 1)
3790 && can_store_by_pieces (tree_low_cst (len, 1),
3791 builtin_memset_read_str, &c, dest_align,
3794 val_rtx = force_reg (TYPE_MODE (unsigned_char_type_node),
3796 store_by_pieces (dest_mem, tree_low_cst (len, 1),
3797 builtin_memset_gen_str, val_rtx, dest_align,
3800 else if (!set_storage_via_setmem (dest_mem, len_rtx, val_rtx,
3801 dest_align, expected_align,
3805 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3806 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3810 if (target_char_cast (val, &c))
3815 if (host_integerp (len, 1)
3816 && can_store_by_pieces (tree_low_cst (len, 1),
3817 builtin_memset_read_str, &c, dest_align,
3819 store_by_pieces (dest_mem, tree_low_cst (len, 1),
3820 builtin_memset_read_str, &c, dest_align, true, 0);
3821 else if (!set_storage_via_setmem (dest_mem, len_rtx, GEN_INT (c),
3822 dest_align, expected_align,
3826 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3827 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3831 set_mem_align (dest_mem, dest_align);
3832 dest_addr = clear_storage_hints (dest_mem, len_rtx,
3833 CALL_EXPR_TAILCALL (orig_exp)
3834 ? BLOCK_OP_TAILCALL : BLOCK_OP_NORMAL,
3835 expected_align, expected_size);
3839 dest_addr = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3840 dest_addr = convert_memory_address (ptr_mode, dest_addr);
3846 fndecl = get_callee_fndecl (orig_exp);
3847 fcode = DECL_FUNCTION_CODE (fndecl);
3848 if (fcode == BUILT_IN_MEMSET)
3849 fn = build_call_nofold (fndecl, 3, dest, val, len);
3850 else if (fcode == BUILT_IN_BZERO)
3851 fn = build_call_nofold (fndecl, 2, dest, len);
3854 gcc_assert (TREE_CODE (fn) == CALL_EXPR);
3855 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (orig_exp);
3856 return expand_call (fn, target, target == const0_rtx);
3859 /* Expand expression EXP, which is a call to the bzero builtin. Return
3860 NULL_RTX if we failed the caller should emit a normal call. */
3863 expand_builtin_bzero (tree exp)
3866 location_t loc = EXPR_LOCATION (exp);
3868 if (!validate_arglist (exp, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3871 dest = CALL_EXPR_ARG (exp, 0);
3872 size = CALL_EXPR_ARG (exp, 1);
3874 /* New argument list transforming bzero(ptr x, int y) to
3875 memset(ptr x, int 0, size_t y). This is done this way
3876 so that if it isn't expanded inline, we fallback to
3877 calling bzero instead of memset. */
3879 return expand_builtin_memset_args (dest, integer_zero_node,
3880 fold_convert_loc (loc, sizetype, size),
3881 const0_rtx, VOIDmode, exp);
3884 /* Expand expression EXP, which is a call to the memcmp built-in function.
3885 Return NULL_RTX if we failed and the
3886 caller should emit a normal call, otherwise try to get the result in
3887 TARGET, if convenient (and in mode MODE, if that's convenient). */
3890 expand_builtin_memcmp (tree exp, ATTRIBUTE_UNUSED rtx target,
3891 ATTRIBUTE_UNUSED enum machine_mode mode)
3893 location_t loc ATTRIBUTE_UNUSED = EXPR_LOCATION (exp);
3895 if (!validate_arglist (exp,
3896 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3899 #if defined HAVE_cmpmemsi || defined HAVE_cmpstrnsi
3901 rtx arg1_rtx, arg2_rtx, arg3_rtx;
3904 tree arg1 = CALL_EXPR_ARG (exp, 0);
3905 tree arg2 = CALL_EXPR_ARG (exp, 1);
3906 tree len = CALL_EXPR_ARG (exp, 2);
3909 = get_pointer_alignment (arg1, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3911 = get_pointer_alignment (arg2, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3912 enum machine_mode insn_mode;
3914 #ifdef HAVE_cmpmemsi
3916 insn_mode = insn_data[(int) CODE_FOR_cmpmemsi].operand[0].mode;
3919 #ifdef HAVE_cmpstrnsi
3921 insn_mode = insn_data[(int) CODE_FOR_cmpstrnsi].operand[0].mode;
3926 /* If we don't have POINTER_TYPE, call the function. */
3927 if (arg1_align == 0 || arg2_align == 0)
3930 /* Make a place to write the result of the instruction. */
3933 && REG_P (result) && GET_MODE (result) == insn_mode
3934 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
3935 result = gen_reg_rtx (insn_mode);
3937 arg1_rtx = get_memory_rtx (arg1, len);
3938 arg2_rtx = get_memory_rtx (arg2, len);
3939 arg3_rtx = expand_normal (fold_convert_loc (loc, sizetype, len));
3941 /* Set MEM_SIZE as appropriate. */
3942 if (CONST_INT_P (arg3_rtx))
3944 set_mem_size (arg1_rtx, arg3_rtx);
3945 set_mem_size (arg2_rtx, arg3_rtx);
3948 #ifdef HAVE_cmpmemsi
3950 insn = gen_cmpmemsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
3951 GEN_INT (MIN (arg1_align, arg2_align)));
3954 #ifdef HAVE_cmpstrnsi
3956 insn = gen_cmpstrnsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
3957 GEN_INT (MIN (arg1_align, arg2_align)));
3965 emit_library_call_value (memcmp_libfunc, result, LCT_PURE,
3966 TYPE_MODE (integer_type_node), 3,
3967 XEXP (arg1_rtx, 0), Pmode,
3968 XEXP (arg2_rtx, 0), Pmode,
3969 convert_to_mode (TYPE_MODE (sizetype), arg3_rtx,
3970 TYPE_UNSIGNED (sizetype)),
3971 TYPE_MODE (sizetype));
3973 /* Return the value in the proper mode for this function. */
3974 mode = TYPE_MODE (TREE_TYPE (exp));
3975 if (GET_MODE (result) == mode)
3977 else if (target != 0)
3979 convert_move (target, result, 0);
3983 return convert_to_mode (mode, result, 0);
3990 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
3991 if we failed the caller should emit a normal call, otherwise try to get
3992 the result in TARGET, if convenient. */
3995 expand_builtin_strcmp (tree exp, ATTRIBUTE_UNUSED rtx target)
3997 if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
4000 #if defined HAVE_cmpstrsi || defined HAVE_cmpstrnsi
4001 if (cmpstr_optab[SImode] != CODE_FOR_nothing
4002 || cmpstrn_optab[SImode] != CODE_FOR_nothing)
4004 rtx arg1_rtx, arg2_rtx;
4005 rtx result, insn = NULL_RTX;
4007 tree arg1 = CALL_EXPR_ARG (exp, 0);
4008 tree arg2 = CALL_EXPR_ARG (exp, 1);
4011 = get_pointer_alignment (arg1, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
4013 = get_pointer_alignment (arg2, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
4015 /* If we don't have POINTER_TYPE, call the function. */
4016 if (arg1_align == 0 || arg2_align == 0)
4019 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
4020 arg1 = builtin_save_expr (arg1);
4021 arg2 = builtin_save_expr (arg2);
4023 arg1_rtx = get_memory_rtx (arg1, NULL);
4024 arg2_rtx = get_memory_rtx (arg2, NULL);
4026 #ifdef HAVE_cmpstrsi
4027 /* Try to call cmpstrsi. */
4030 enum machine_mode insn_mode
4031 = insn_data[(int) CODE_FOR_cmpstrsi].operand[0].mode;
4033 /* Make a place to write the result of the instruction. */
4036 && REG_P (result) && GET_MODE (result) == insn_mode
4037 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
4038 result = gen_reg_rtx (insn_mode);
4040 insn = gen_cmpstrsi (result, arg1_rtx, arg2_rtx,
4041 GEN_INT (MIN (arg1_align, arg2_align)));
4044 #ifdef HAVE_cmpstrnsi
4045 /* Try to determine at least one length and call cmpstrnsi. */
4046 if (!insn && HAVE_cmpstrnsi)
4051 enum machine_mode insn_mode
4052 = insn_data[(int) CODE_FOR_cmpstrnsi].operand[0].mode;
4053 tree len1 = c_strlen (arg1, 1);
4054 tree len2 = c_strlen (arg2, 1);
4057 len1 = size_binop (PLUS_EXPR, ssize_int (1), len1);
4059 len2 = size_binop (PLUS_EXPR, ssize_int (1), len2);
4061 /* If we don't have a constant length for the first, use the length
4062 of the second, if we know it. We don't require a constant for
4063 this case; some cost analysis could be done if both are available
4064 but neither is constant. For now, assume they're equally cheap,
4065 unless one has side effects. If both strings have constant lengths,
4072 else if (TREE_SIDE_EFFECTS (len1))
4074 else if (TREE_SIDE_EFFECTS (len2))
4076 else if (TREE_CODE (len1) != INTEGER_CST)
4078 else if (TREE_CODE (len2) != INTEGER_CST)
4080 else if (tree_int_cst_lt (len1, len2))
4085 /* If both arguments have side effects, we cannot optimize. */
4086 if (!len || TREE_SIDE_EFFECTS (len))
4089 arg3_rtx = expand_normal (len);
4091 /* Make a place to write the result of the instruction. */
4094 && REG_P (result) && GET_MODE (result) == insn_mode
4095 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
4096 result = gen_reg_rtx (insn_mode);
4098 insn = gen_cmpstrnsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
4099 GEN_INT (MIN (arg1_align, arg2_align)));
4105 enum machine_mode mode;
4108 /* Return the value in the proper mode for this function. */
4109 mode = TYPE_MODE (TREE_TYPE (exp));
4110 if (GET_MODE (result) == mode)
4113 return convert_to_mode (mode, result, 0);
4114 convert_move (target, result, 0);
4118 /* Expand the library call ourselves using a stabilized argument
4119 list to avoid re-evaluating the function's arguments twice. */
4120 #ifdef HAVE_cmpstrnsi
4123 fndecl = get_callee_fndecl (exp);
4124 fn = build_call_nofold (fndecl, 2, arg1, arg2);
4125 gcc_assert (TREE_CODE (fn) == CALL_EXPR);
4126 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
4127 return expand_call (fn, target, target == const0_rtx);
4133 /* Expand expression EXP, which is a call to the strncmp builtin. Return
4134 NULL_RTX if we failed the caller should emit a normal call, otherwise try to get
4135 the result in TARGET, if convenient. */
4138 expand_builtin_strncmp (tree exp, ATTRIBUTE_UNUSED rtx target,
4139 ATTRIBUTE_UNUSED enum machine_mode mode)
4141 location_t loc ATTRIBUTE_UNUSED = EXPR_LOCATION (exp);
4143 if (!validate_arglist (exp,
4144 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
4147 /* If c_strlen can determine an expression for one of the string
4148 lengths, and it doesn't have side effects, then emit cmpstrnsi
4149 using length MIN(strlen(string)+1, arg3). */
4150 #ifdef HAVE_cmpstrnsi
4153 tree len, len1, len2;
4154 rtx arg1_rtx, arg2_rtx, arg3_rtx;
4157 tree arg1 = CALL_EXPR_ARG (exp, 0);
4158 tree arg2 = CALL_EXPR_ARG (exp, 1);
4159 tree arg3 = CALL_EXPR_ARG (exp, 2);
4162 = get_pointer_alignment (arg1, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
4164 = get_pointer_alignment (arg2, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
4165 enum machine_mode insn_mode
4166 = insn_data[(int) CODE_FOR_cmpstrnsi].operand[0].mode;
4168 len1 = c_strlen (arg1, 1);
4169 len2 = c_strlen (arg2, 1);
4172 len1 = size_binop_loc (loc, PLUS_EXPR, ssize_int (1), len1);
4174 len2 = size_binop_loc (loc, PLUS_EXPR, ssize_int (1), len2);
4176 /* If we don't have a constant length for the first, use the length
4177 of the second, if we know it. We don't require a constant for
4178 this case; some cost analysis could be done if both are available
4179 but neither is constant. For now, assume they're equally cheap,
4180 unless one has side effects. If both strings have constant lengths,
4187 else if (TREE_SIDE_EFFECTS (len1))
4189 else if (TREE_SIDE_EFFECTS (len2))
4191 else if (TREE_CODE (len1) != INTEGER_CST)
4193 else if (TREE_CODE (len2) != INTEGER_CST)
4195 else if (tree_int_cst_lt (len1, len2))
4200 /* If both arguments have side effects, we cannot optimize. */
4201 if (!len || TREE_SIDE_EFFECTS (len))
4204 /* The actual new length parameter is MIN(len,arg3). */
4205 len = fold_build2_loc (loc, MIN_EXPR, TREE_TYPE (len), len,
4206 fold_convert_loc (loc, TREE_TYPE (len), arg3));
4208 /* If we don't have POINTER_TYPE, call the function. */
4209 if (arg1_align == 0 || arg2_align == 0)
4212 /* Make a place to write the result of the instruction. */
4215 && REG_P (result) && GET_MODE (result) == insn_mode
4216 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
4217 result = gen_reg_rtx (insn_mode);
4219 /* Stabilize the arguments in case gen_cmpstrnsi fails. */
4220 arg1 = builtin_save_expr (arg1);
4221 arg2 = builtin_save_expr (arg2);
4222 len = builtin_save_expr (len);
4224 arg1_rtx = get_memory_rtx (arg1, len);
4225 arg2_rtx = get_memory_rtx (arg2, len);
4226 arg3_rtx = expand_normal (len);
4227 insn = gen_cmpstrnsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
4228 GEN_INT (MIN (arg1_align, arg2_align)));
4233 /* Return the value in the proper mode for this function. */
4234 mode = TYPE_MODE (TREE_TYPE (exp));
4235 if (GET_MODE (result) == mode)
4238 return convert_to_mode (mode, result, 0);
4239 convert_move (target, result, 0);
4243 /* Expand the library call ourselves using a stabilized argument
4244 list to avoid re-evaluating the function's arguments twice. */
4245 fndecl = get_callee_fndecl (exp);
4246 fn = build_call_nofold (fndecl, 3, arg1, arg2, len);
4247 gcc_assert (TREE_CODE (fn) == CALL_EXPR);
4248 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
4249 return expand_call (fn, target, target == const0_rtx);
4255 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
4256 if that's convenient. */
4259 expand_builtin_saveregs (void)
4263 /* Don't do __builtin_saveregs more than once in a function.
4264 Save the result of the first call and reuse it. */
4265 if (saveregs_value != 0)
4266 return saveregs_value;
4268 /* When this function is called, it means that registers must be
4269 saved on entry to this function. So we migrate the call to the
4270 first insn of this function. */
4274 /* Do whatever the machine needs done in this case. */
4275 val = targetm.calls.expand_builtin_saveregs ();
4280 saveregs_value = val;
4282 /* Put the insns after the NOTE that starts the function. If this
4283 is inside a start_sequence, make the outer-level insn chain current, so
4284 the code is placed at the start of the function. */
4285 push_topmost_sequence ();
4286 emit_insn_after (seq, entry_of_function ());
4287 pop_topmost_sequence ();
4292 /* __builtin_args_info (N) returns word N of the arg space info
4293 for the current function. The number and meanings of words
4294 is controlled by the definition of CUMULATIVE_ARGS. */
4297 expand_builtin_args_info (tree exp)
4299 int nwords = sizeof (CUMULATIVE_ARGS) / sizeof (int);
4300 int *word_ptr = (int *) &crtl->args.info;
4302 gcc_assert (sizeof (CUMULATIVE_ARGS) % sizeof (int) == 0);
4304 if (call_expr_nargs (exp) != 0)
4306 if (!host_integerp (CALL_EXPR_ARG (exp, 0), 0))
4307 error ("argument of %<__builtin_args_info%> must be constant");
4310 HOST_WIDE_INT wordnum = tree_low_cst (CALL_EXPR_ARG (exp, 0), 0);
4312 if (wordnum < 0 || wordnum >= nwords)
4313 error ("argument of %<__builtin_args_info%> out of range");
4315 return GEN_INT (word_ptr[wordnum]);
4319 error ("missing argument in %<__builtin_args_info%>");
4324 /* Expand a call to __builtin_next_arg. */
4327 expand_builtin_next_arg (void)
4329 /* Checking arguments is already done in fold_builtin_next_arg
4330 that must be called before this function. */
4331 return expand_binop (ptr_mode, add_optab,
4332 crtl->args.internal_arg_pointer,
4333 crtl->args.arg_offset_rtx,
4334 NULL_RTX, 0, OPTAB_LIB_WIDEN);
4337 /* Make it easier for the backends by protecting the valist argument
4338 from multiple evaluations. */
4341 stabilize_va_list_loc (location_t loc, tree valist, int needs_lvalue)
4343 tree vatype = targetm.canonical_va_list_type (TREE_TYPE (valist));
4345 gcc_assert (vatype != NULL_TREE);
4347 if (TREE_CODE (vatype) == ARRAY_TYPE)
4349 if (TREE_SIDE_EFFECTS (valist))
4350 valist = save_expr (valist);
4352 /* For this case, the backends will be expecting a pointer to
4353 vatype, but it's possible we've actually been given an array
4354 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
4356 if (TREE_CODE (TREE_TYPE (valist)) == ARRAY_TYPE)
4358 tree p1 = build_pointer_type (TREE_TYPE (vatype));
4359 valist = build_fold_addr_expr_with_type_loc (loc, valist, p1);
4368 if (! TREE_SIDE_EFFECTS (valist))
4371 pt = build_pointer_type (vatype);
4372 valist = fold_build1_loc (loc, ADDR_EXPR, pt, valist);
4373 TREE_SIDE_EFFECTS (valist) = 1;
4376 if (TREE_SIDE_EFFECTS (valist))
4377 valist = save_expr (valist);
4378 valist = build_fold_indirect_ref_loc (loc, valist);
4384 /* The "standard" definition of va_list is void*. */
4387 std_build_builtin_va_list (void)
4389 return ptr_type_node;
4392 /* The "standard" abi va_list is va_list_type_node. */
4395 std_fn_abi_va_list (tree fndecl ATTRIBUTE_UNUSED)
4397 return va_list_type_node;
4400 /* The "standard" type of va_list is va_list_type_node. */
4403 std_canonical_va_list_type (tree type)
4407 if (INDIRECT_REF_P (type))
4408 type = TREE_TYPE (type);
4409 else if (POINTER_TYPE_P (type) && POINTER_TYPE_P (TREE_TYPE(type)))
4410 type = TREE_TYPE (type);
4411 wtype = va_list_type_node;
4413 /* Treat structure va_list types. */
4414 if (TREE_CODE (wtype) == RECORD_TYPE && POINTER_TYPE_P (htype))
4415 htype = TREE_TYPE (htype);
4416 else if (TREE_CODE (wtype) == ARRAY_TYPE)
4418 /* If va_list is an array type, the argument may have decayed
4419 to a pointer type, e.g. by being passed to another function.
4420 In that case, unwrap both types so that we can compare the
4421 underlying records. */
4422 if (TREE_CODE (htype) == ARRAY_TYPE
4423 || POINTER_TYPE_P (htype))
4425 wtype = TREE_TYPE (wtype);
4426 htype = TREE_TYPE (htype);
4429 if (TYPE_MAIN_VARIANT (wtype) == TYPE_MAIN_VARIANT (htype))
4430 return va_list_type_node;
4435 /* The "standard" implementation of va_start: just assign `nextarg' to
4439 std_expand_builtin_va_start (tree valist, rtx nextarg)
4441 rtx va_r = expand_expr (valist, NULL_RTX, VOIDmode, EXPAND_WRITE);
4442 convert_move (va_r, nextarg, 0);
4445 /* Expand EXP, a call to __builtin_va_start. */
4448 expand_builtin_va_start (tree exp)
4452 location_t loc = EXPR_LOCATION (exp);
4454 if (call_expr_nargs (exp) < 2)
4456 error_at (loc, "too few arguments to function %<va_start%>");
4460 if (fold_builtin_next_arg (exp, true))
4463 nextarg = expand_builtin_next_arg ();
4464 valist = stabilize_va_list_loc (loc, CALL_EXPR_ARG (exp, 0), 1);
4466 if (targetm.expand_builtin_va_start)
4467 targetm.expand_builtin_va_start (valist, nextarg);
4469 std_expand_builtin_va_start (valist, nextarg);
4474 /* The "standard" implementation of va_arg: read the value from the
4475 current (padded) address and increment by the (padded) size. */
4478 std_gimplify_va_arg_expr (tree valist, tree type, gimple_seq *pre_p,
4481 tree addr, t, type_size, rounded_size, valist_tmp;
4482 unsigned HOST_WIDE_INT align, boundary;
4485 #ifdef ARGS_GROW_DOWNWARD
4486 /* All of the alignment and movement below is for args-grow-up machines.
4487 As of 2004, there are only 3 ARGS_GROW_DOWNWARD targets, and they all
4488 implement their own specialized gimplify_va_arg_expr routines. */
4492 indirect = pass_by_reference (NULL, TYPE_MODE (type), type, false);
4494 type = build_pointer_type (type);
4496 align = PARM_BOUNDARY / BITS_PER_UNIT;
4497 boundary = FUNCTION_ARG_BOUNDARY (TYPE_MODE (type), type);
4499 /* When we align parameter on stack for caller, if the parameter
4500 alignment is beyond MAX_SUPPORTED_STACK_ALIGNMENT, it will be
4501 aligned at MAX_SUPPORTED_STACK_ALIGNMENT. We will match callee
4502 here with caller. */
4503 if (boundary > MAX_SUPPORTED_STACK_ALIGNMENT)
4504 boundary = MAX_SUPPORTED_STACK_ALIGNMENT;
4506 boundary /= BITS_PER_UNIT;
4508 /* Hoist the valist value into a temporary for the moment. */
4509 valist_tmp = get_initialized_tmp_var (valist, pre_p, NULL);
4511 /* va_list pointer is aligned to PARM_BOUNDARY. If argument actually
4512 requires greater alignment, we must perform dynamic alignment. */
4513 if (boundary > align
4514 && !integer_zerop (TYPE_SIZE (type)))
4516 t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist_tmp,
4517 fold_build2 (POINTER_PLUS_EXPR,
4519 valist_tmp, size_int (boundary - 1)));
4520 gimplify_and_add (t, pre_p);
4522 t = fold_convert (sizetype, valist_tmp);
4523 t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist_tmp,
4524 fold_convert (TREE_TYPE (valist),
4525 fold_build2 (BIT_AND_EXPR, sizetype, t,
4526 size_int (-boundary))));
4527 gimplify_and_add (t, pre_p);
4532 /* If the actual alignment is less than the alignment of the type,
4533 adjust the type accordingly so that we don't assume strict alignment
4534 when dereferencing the pointer. */
4535 boundary *= BITS_PER_UNIT;
4536 if (boundary < TYPE_ALIGN (type))
4538 type = build_variant_type_copy (type);
4539 TYPE_ALIGN (type) = boundary;
4542 /* Compute the rounded size of the type. */
4543 type_size = size_in_bytes (type);
4544 rounded_size = round_up (type_size, align);
4546 /* Reduce rounded_size so it's sharable with the postqueue. */
4547 gimplify_expr (&rounded_size, pre_p, post_p, is_gimple_val, fb_rvalue);
4551 if (PAD_VARARGS_DOWN && !integer_zerop (rounded_size))
4553 /* Small args are padded downward. */
4554 t = fold_build2_loc (input_location, GT_EXPR, sizetype,
4555 rounded_size, size_int (align));
4556 t = fold_build3 (COND_EXPR, sizetype, t, size_zero_node,
4557 size_binop (MINUS_EXPR, rounded_size, type_size));
4558 addr = fold_build2 (POINTER_PLUS_EXPR,
4559 TREE_TYPE (addr), addr, t);
4562 /* Compute new value for AP. */
4563 t = build2 (POINTER_PLUS_EXPR, TREE_TYPE (valist), valist_tmp, rounded_size);
4564 t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist, t);
4565 gimplify_and_add (t, pre_p);
4567 addr = fold_convert (build_pointer_type (type), addr);
4570 addr = build_va_arg_indirect_ref (addr);
4572 return build_va_arg_indirect_ref (addr);
4575 /* Build an indirect-ref expression over the given TREE, which represents a
4576 piece of a va_arg() expansion. */
4578 build_va_arg_indirect_ref (tree addr)
4580 addr = build_fold_indirect_ref_loc (EXPR_LOCATION (addr), addr);
4582 if (flag_mudflap) /* Don't instrument va_arg INDIRECT_REF. */
4588 /* Return a dummy expression of type TYPE in order to keep going after an
4592 dummy_object (tree type)
4594 tree t = build_int_cst (build_pointer_type (type), 0);
4595 return build1 (INDIRECT_REF, type, t);
4598 /* Gimplify __builtin_va_arg, aka VA_ARG_EXPR, which is not really a
4599 builtin function, but a very special sort of operator. */
4601 enum gimplify_status
4602 gimplify_va_arg_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4604 tree promoted_type, have_va_type;
4605 tree valist = TREE_OPERAND (*expr_p, 0);
4606 tree type = TREE_TYPE (*expr_p);
4608 location_t loc = EXPR_LOCATION (*expr_p);
4610 /* Verify that valist is of the proper type. */
4611 have_va_type = TREE_TYPE (valist);
4612 if (have_va_type == error_mark_node)
4614 have_va_type = targetm.canonical_va_list_type (have_va_type);
4616 if (have_va_type == NULL_TREE)
4618 error_at (loc, "first argument to %<va_arg%> not of type %<va_list%>");
4622 /* Generate a diagnostic for requesting data of a type that cannot
4623 be passed through `...' due to type promotion at the call site. */
4624 if ((promoted_type = lang_hooks.types.type_promotes_to (type))
4627 static bool gave_help;
4630 /* Unfortunately, this is merely undefined, rather than a constraint
4631 violation, so we cannot make this an error. If this call is never
4632 executed, the program is still strictly conforming. */
4633 warned = warning_at (loc, 0,
4634 "%qT is promoted to %qT when passed through %<...%>",
4635 type, promoted_type);
4636 if (!gave_help && warned)
4639 inform (loc, "(so you should pass %qT not %qT to %<va_arg%>)",
4640 promoted_type, type);
4643 /* We can, however, treat "undefined" any way we please.
4644 Call abort to encourage the user to fix the program. */
4646 inform (loc, "if this code is reached, the program will abort");
4647 /* Before the abort, allow the evaluation of the va_list
4648 expression to exit or longjmp. */
4649 gimplify_and_add (valist, pre_p);
4650 t = build_call_expr_loc (loc,
4651 implicit_built_in_decls[BUILT_IN_TRAP], 0);
4652 gimplify_and_add (t, pre_p);
4654 /* This is dead code, but go ahead and finish so that the
4655 mode of the result comes out right. */
4656 *expr_p = dummy_object (type);
4661 /* Make it easier for the backends by protecting the valist argument
4662 from multiple evaluations. */
4663 if (TREE_CODE (have_va_type) == ARRAY_TYPE)
4665 /* For this case, the backends will be expecting a pointer to
4666 TREE_TYPE (abi), but it's possible we've
4667 actually been given an array (an actual TARGET_FN_ABI_VA_LIST).
4669 if (TREE_CODE (TREE_TYPE (valist)) == ARRAY_TYPE)
4671 tree p1 = build_pointer_type (TREE_TYPE (have_va_type));
4672 valist = fold_convert_loc (loc, p1,
4673 build_fold_addr_expr_loc (loc, valist));
4676 gimplify_expr (&valist, pre_p, post_p, is_gimple_val, fb_rvalue);
4679 gimplify_expr (&valist, pre_p, post_p, is_gimple_min_lval, fb_lvalue);
4681 if (!targetm.gimplify_va_arg_expr)
4682 /* FIXME: Once most targets are converted we should merely
4683 assert this is non-null. */
4686 *expr_p = targetm.gimplify_va_arg_expr (valist, type, pre_p, post_p);
4691 /* Expand EXP, a call to __builtin_va_end. */
4694 expand_builtin_va_end (tree exp)
4696 tree valist = CALL_EXPR_ARG (exp, 0);
4698 /* Evaluate for side effects, if needed. I hate macros that don't
4700 if (TREE_SIDE_EFFECTS (valist))
4701 expand_expr (valist, const0_rtx, VOIDmode, EXPAND_NORMAL);
4706 /* Expand EXP, a call to __builtin_va_copy. We do this as a
4707 builtin rather than just as an assignment in stdarg.h because of the
4708 nastiness of array-type va_list types. */
4711 expand_builtin_va_copy (tree exp)
4714 location_t loc = EXPR_LOCATION (exp);
4716 dst = CALL_EXPR_ARG (exp, 0);
4717 src = CALL_EXPR_ARG (exp, 1);
4719 dst = stabilize_va_list_loc (loc, dst, 1);
4720 src = stabilize_va_list_loc (loc, src, 0);
4722 gcc_assert (cfun != NULL && cfun->decl != NULL_TREE);
4724 if (TREE_CODE (targetm.fn_abi_va_list (cfun->decl)) != ARRAY_TYPE)
4726 t = build2 (MODIFY_EXPR, targetm.fn_abi_va_list (cfun->decl), dst, src);
4727 TREE_SIDE_EFFECTS (t) = 1;
4728 expand_expr (t, const0_rtx, VOIDmode, EXPAND_NORMAL);
4732 rtx dstb, srcb, size;
4734 /* Evaluate to pointers. */
4735 dstb = expand_expr (dst, NULL_RTX, Pmode, EXPAND_NORMAL);
4736 srcb = expand_expr (src, NULL_RTX, Pmode, EXPAND_NORMAL);
4737 size = expand_expr (TYPE_SIZE_UNIT (targetm.fn_abi_va_list (cfun->decl)),
4738 NULL_RTX, VOIDmode, EXPAND_NORMAL);
4740 dstb = convert_memory_address (Pmode, dstb);
4741 srcb = convert_memory_address (Pmode, srcb);
4743 /* "Dereference" to BLKmode memories. */
4744 dstb = gen_rtx_MEM (BLKmode, dstb);
4745 set_mem_alias_set (dstb, get_alias_set (TREE_TYPE (TREE_TYPE (dst))));
4746 set_mem_align (dstb, TYPE_ALIGN (targetm.fn_abi_va_list (cfun->decl)));
4747 srcb = gen_rtx_MEM (BLKmode, srcb);
4748 set_mem_alias_set (srcb, get_alias_set (TREE_TYPE (TREE_TYPE (src))));
4749 set_mem_align (srcb, TYPE_ALIGN (targetm.fn_abi_va_list (cfun->decl)));
4752 emit_block_move (dstb, srcb, size, BLOCK_OP_NORMAL);
4758 /* Expand a call to one of the builtin functions __builtin_frame_address or
4759 __builtin_return_address. */
4762 expand_builtin_frame_address (tree fndecl, tree exp)
4764 /* The argument must be a nonnegative integer constant.
4765 It counts the number of frames to scan up the stack.
4766 The value is the return address saved in that frame. */
4767 if (call_expr_nargs (exp) == 0)
4768 /* Warning about missing arg was already issued. */
4770 else if (! host_integerp (CALL_EXPR_ARG (exp, 0), 1))
4772 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS)
4773 error ("invalid argument to %<__builtin_frame_address%>");
4775 error ("invalid argument to %<__builtin_return_address%>");
4781 = expand_builtin_return_addr (DECL_FUNCTION_CODE (fndecl),
4782 tree_low_cst (CALL_EXPR_ARG (exp, 0), 1));
4784 /* Some ports cannot access arbitrary stack frames. */
4787 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS)
4788 warning (0, "unsupported argument to %<__builtin_frame_address%>");
4790 warning (0, "unsupported argument to %<__builtin_return_address%>");
4794 /* For __builtin_frame_address, return what we've got. */
4795 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS)
4799 && ! CONSTANT_P (tem))
4800 tem = copy_to_mode_reg (Pmode, tem);
4805 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if
4806 we failed and the caller should emit a normal call, otherwise try to get
4807 the result in TARGET, if convenient. */
4810 expand_builtin_alloca (tree exp, rtx target)
4815 /* Emit normal call if marked not-inlineable. */
4816 if (CALL_CANNOT_INLINE_P (exp))
4819 if (!validate_arglist (exp, INTEGER_TYPE, VOID_TYPE))
4822 /* Compute the argument. */
4823 op0 = expand_normal (CALL_EXPR_ARG (exp, 0));
4825 /* Allocate the desired space. */
4826 result = allocate_dynamic_stack_space (op0, target, BITS_PER_UNIT);
4827 result = convert_memory_address (ptr_mode, result);
4832 /* Expand a call to a bswap builtin with argument ARG0. MODE
4833 is the mode to expand with. */
4836 expand_builtin_bswap (tree exp, rtx target, rtx subtarget)
4838 enum machine_mode mode;
4842 if (!validate_arglist (exp, INTEGER_TYPE, VOID_TYPE))
4845 arg = CALL_EXPR_ARG (exp, 0);
4846 mode = TYPE_MODE (TREE_TYPE (arg));
4847 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
4849 target = expand_unop (mode, bswap_optab, op0, target, 1);
4851 gcc_assert (target);
4853 return convert_to_mode (mode, target, 0);
4856 /* Expand a call to a unary builtin in EXP.
4857 Return NULL_RTX if a normal call should be emitted rather than expanding the
4858 function in-line. If convenient, the result should be placed in TARGET.
4859 SUBTARGET may be used as the target for computing one of EXP's operands. */
4862 expand_builtin_unop (enum machine_mode target_mode, tree exp, rtx target,
4863 rtx subtarget, optab op_optab)
4867 if (!validate_arglist (exp, INTEGER_TYPE, VOID_TYPE))
4870 /* Compute the argument. */
4871 op0 = expand_expr (CALL_EXPR_ARG (exp, 0), subtarget,
4872 VOIDmode, EXPAND_NORMAL);
4873 /* Compute op, into TARGET if possible.
4874 Set TARGET to wherever the result comes back. */
4875 target = expand_unop (TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp, 0))),
4876 op_optab, op0, target, 1);
4877 gcc_assert (target);
4879 return convert_to_mode (target_mode, target, 0);
4882 /* Expand a call to __builtin_expect. We just return our argument
4883 as the builtin_expect semantic should've been already executed by
4884 tree branch prediction pass. */
4887 expand_builtin_expect (tree exp, rtx target)
4891 if (call_expr_nargs (exp) < 2)
4893 arg = CALL_EXPR_ARG (exp, 0);
4895 target = expand_expr (arg, target, VOIDmode, EXPAND_NORMAL);
4896 /* When guessing was done, the hints should be already stripped away. */
4897 gcc_assert (!flag_guess_branch_prob
4898 || optimize == 0 || errorcount || sorrycount);
4903 expand_builtin_trap (void)
4907 emit_insn (gen_trap ());
4910 emit_library_call (abort_libfunc, LCT_NORETURN, VOIDmode, 0);
4914 /* Expand a call to __builtin_unreachable. We do nothing except emit
4915 a barrier saying that control flow will not pass here.
4917 It is the responsibility of the program being compiled to ensure
4918 that control flow does never reach __builtin_unreachable. */
4920 expand_builtin_unreachable (void)
4925 /* Expand EXP, a call to fabs, fabsf or fabsl.
4926 Return NULL_RTX if a normal call should be emitted rather than expanding
4927 the function inline. If convenient, the result should be placed
4928 in TARGET. SUBTARGET may be used as the target for computing
4932 expand_builtin_fabs (tree exp, rtx target, rtx subtarget)
4934 enum machine_mode mode;
4938 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
4941 arg = CALL_EXPR_ARG (exp, 0);
4942 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
4943 mode = TYPE_MODE (TREE_TYPE (arg));
4944 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
4945 return expand_abs (mode, op0, target, 0, safe_from_p (target, arg, 1));
4948 /* Expand EXP, a call to copysign, copysignf, or copysignl.
4949 Return NULL is a normal call should be emitted rather than expanding the
4950 function inline. If convenient, the result should be placed in TARGET.
4951 SUBTARGET may be used as the target for computing the operand. */
4954 expand_builtin_copysign (tree exp, rtx target, rtx subtarget)
4959 if (!validate_arglist (exp, REAL_TYPE, REAL_TYPE, VOID_TYPE))
4962 arg = CALL_EXPR_ARG (exp, 0);
4963 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
4965 arg = CALL_EXPR_ARG (exp, 1);
4966 op1 = expand_normal (arg);
4968 return expand_copysign (op0, op1, target);
4971 /* Create a new constant string literal and return a char* pointer to it.
4972 The STRING_CST value is the LEN characters at STR. */
4974 build_string_literal (int len, const char *str)
4976 tree t, elem, index, type;
4978 t = build_string (len, str);
4979 elem = build_type_variant (char_type_node, 1, 0);
4980 index = build_index_type (size_int (len - 1));
4981 type = build_array_type (elem, index);
4982 TREE_TYPE (t) = type;
4983 TREE_CONSTANT (t) = 1;
4984 TREE_READONLY (t) = 1;
4985 TREE_STATIC (t) = 1;
4987 type = build_pointer_type (elem);
4988 t = build1 (ADDR_EXPR, type,
4989 build4 (ARRAY_REF, elem,
4990 t, integer_zero_node, NULL_TREE, NULL_TREE));
4994 /* Expand EXP, a call to printf or printf_unlocked.
4995 Return NULL_RTX if a normal call should be emitted rather than transforming
4996 the function inline. If convenient, the result should be placed in
4997 TARGET with mode MODE. UNLOCKED indicates this is a printf_unlocked
5000 expand_builtin_printf (tree exp, rtx target, enum machine_mode mode,
5003 /* If we're using an unlocked function, assume the other unlocked
5004 functions exist explicitly. */
5005 tree const fn_putchar = unlocked ? built_in_decls[BUILT_IN_PUTCHAR_UNLOCKED]
5006 : implicit_built_in_decls[BUILT_IN_PUTCHAR];
5007 tree const fn_puts = unlocked ? built_in_decls[BUILT_IN_PUTS_UNLOCKED]
5008 : implicit_built_in_decls[BUILT_IN_PUTS];
5009 const char *fmt_str;
5012 int nargs = call_expr_nargs (exp);
5014 /* If the return value is used, don't do the transformation. */
5015 if (target != const0_rtx)
5018 /* Verify the required arguments in the original call. */
5021 fmt = CALL_EXPR_ARG (exp, 0);
5022 if (! POINTER_TYPE_P (TREE_TYPE (fmt)))
5025 /* Check whether the format is a literal string constant. */
5026 fmt_str = c_getstr (fmt);
5027 if (fmt_str == NULL)
5030 if (!init_target_chars ())
5033 /* If the format specifier was "%s\n", call __builtin_puts(arg). */
5034 if (strcmp (fmt_str, target_percent_s_newline) == 0)
5037 || ! POINTER_TYPE_P (TREE_TYPE (CALL_EXPR_ARG (exp, 1))))
5040 fn = build_call_nofold (fn_puts, 1, CALL_EXPR_ARG (exp, 1));
5042 /* If the format specifier was "%c", call __builtin_putchar(arg). */
5043 else if (strcmp (fmt_str, target_percent_c) == 0)
5046 || TREE_CODE (TREE_TYPE (CALL_EXPR_ARG (exp, 1))) != INTEGER_TYPE)
5049 fn = build_call_nofold (fn_putchar, 1, CALL_EXPR_ARG (exp, 1));
5053 /* We can't handle anything else with % args or %% ... yet. */
5054 if (strchr (fmt_str, target_percent))
5060 /* If the format specifier was "", printf does nothing. */
5061 if (fmt_str[0] == '\0')
5063 /* If the format specifier has length of 1, call putchar. */
5064 if (fmt_str[1] == '\0')
5066 /* Given printf("c"), (where c is any one character,)
5067 convert "c"[0] to an int and pass that to the replacement
5069 arg = build_int_cst (NULL_TREE, fmt_str[0]);
5071 fn = build_call_nofold (fn_putchar, 1, arg);
5075 /* If the format specifier was "string\n", call puts("string"). */
5076 size_t len = strlen (fmt_str);
5077 if ((unsigned char)fmt_str[len - 1] == target_newline)
5079 /* Create a NUL-terminated string that's one char shorter
5080 than the original, stripping off the trailing '\n'. */
5081 char *newstr = XALLOCAVEC (char, len);
5082 memcpy (newstr, fmt_str, len - 1);
5083 newstr[len - 1] = 0;
5084 arg = build_string_literal (len, newstr);
5086 fn = build_call_nofold (fn_puts, 1, arg);
5089 /* We'd like to arrange to call fputs(string,stdout) here,
5090 but we need stdout and don't have a way to get it yet. */
5097 gcc_assert (TREE_CODE (fn) == CALL_EXPR);
5098 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
5099 return expand_expr (fn, target, mode, EXPAND_NORMAL);
5102 /* Expand EXP, a call to fprintf or fprintf_unlocked.
5103 Return NULL_RTX if a normal call should be emitted rather than transforming
5104 the function inline. If convenient, the result should be placed in
5105 TARGET with mode MODE. UNLOCKED indicates this is a fprintf_unlocked
5108 expand_builtin_fprintf (tree exp, rtx target, enum machine_mode mode,
5111 /* If we're using an unlocked function, assume the other unlocked
5112 functions exist explicitly. */
5113 tree const fn_fputc = unlocked ? built_in_decls[BUILT_IN_FPUTC_UNLOCKED]
5114 : implicit_built_in_decls[BUILT_IN_FPUTC];
5115 tree const fn_fputs = unlocked ? built_in_decls[BUILT_IN_FPUTS_UNLOCKED]
5116 : implicit_built_in_decls[BUILT_IN_FPUTS];
5117 const char *fmt_str;
5120 int nargs = call_expr_nargs (exp);
5122 /* If the return value is used, don't do the transformation. */
5123 if (target != const0_rtx)
5126 /* Verify the required arguments in the original call. */
5129 fp = CALL_EXPR_ARG (exp, 0);
5130 if (! POINTER_TYPE_P (TREE_TYPE (fp)))
5132 fmt = CALL_EXPR_ARG (exp, 1);
5133 if (! POINTER_TYPE_P (TREE_TYPE (fmt)))
5136 /* Check whether the format is a literal string constant. */
5137 fmt_str = c_getstr (fmt);
5138 if (fmt_str == NULL)
5141 if (!init_target_chars ())
5144 /* If the format specifier was "%s", call __builtin_fputs(arg,fp). */
5145 if (strcmp (fmt_str, target_percent_s) == 0)
5148 || ! POINTER_TYPE_P (TREE_TYPE (CALL_EXPR_ARG (exp, 2))))
5150 arg = CALL_EXPR_ARG (exp, 2);
5152 fn = build_call_nofold (fn_fputs, 2, arg, fp);
5154 /* If the format specifier was "%c", call __builtin_fputc(arg,fp). */
5155 else if (strcmp (fmt_str, target_percent_c) == 0)
5158 || TREE_CODE (TREE_TYPE (CALL_EXPR_ARG (exp, 2))) != INTEGER_TYPE)
5160 arg = CALL_EXPR_ARG (exp, 2);
5162 fn = build_call_nofold (fn_fputc, 2, arg, fp);
5166 /* We can't handle anything else with % args or %% ... yet. */
5167 if (strchr (fmt_str, target_percent))
5173 /* If the format specifier was "", fprintf does nothing. */
5174 if (fmt_str[0] == '\0')
5176 /* Evaluate and ignore FILE* argument for side-effects. */
5177 expand_expr (fp, const0_rtx, VOIDmode, EXPAND_NORMAL);
5181 /* When "string" doesn't contain %, replace all cases of
5182 fprintf(stream,string) with fputs(string,stream). The fputs
5183 builtin will take care of special cases like length == 1. */
5185 fn = build_call_nofold (fn_fputs, 2, fmt, fp);
5190 gcc_assert (TREE_CODE (fn) == CALL_EXPR);
5191 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
5192 return expand_expr (fn, target, mode, EXPAND_NORMAL);
5195 /* Expand a call EXP to sprintf. Return NULL_RTX if
5196 a normal call should be emitted rather than expanding the function
5197 inline. If convenient, the result should be placed in TARGET with
5201 expand_builtin_sprintf (tree exp, rtx target, enum machine_mode mode)
5204 const char *fmt_str;
5205 int nargs = call_expr_nargs (exp);
5207 /* Verify the required arguments in the original call. */
5210 dest = CALL_EXPR_ARG (exp, 0);
5211 if (! POINTER_TYPE_P (TREE_TYPE (dest)))
5213 fmt = CALL_EXPR_ARG (exp, 0);
5214 if (! POINTER_TYPE_P (TREE_TYPE (fmt)))
5217 /* Check whether the format is a literal string constant. */
5218 fmt_str = c_getstr (fmt);
5219 if (fmt_str == NULL)
5222 if (!init_target_chars ())
5225 /* If the format doesn't contain % args or %%, use strcpy. */
5226 if (strchr (fmt_str, target_percent) == 0)
5228 tree fn = implicit_built_in_decls[BUILT_IN_STRCPY];
5231 if ((nargs > 2) || ! fn)
5233 expand_expr (build_call_nofold (fn, 2, dest, fmt),
5234 const0_rtx, VOIDmode, EXPAND_NORMAL);
5235 if (target == const0_rtx)
5237 exp = build_int_cst (NULL_TREE, strlen (fmt_str));
5238 return expand_expr (exp, target, mode, EXPAND_NORMAL);
5240 /* If the format is "%s", use strcpy if the result isn't used. */
5241 else if (strcmp (fmt_str, target_percent_s) == 0)
5244 fn = implicit_built_in_decls[BUILT_IN_STRCPY];
5250 arg = CALL_EXPR_ARG (exp, 2);
5251 if (! POINTER_TYPE_P (TREE_TYPE (arg)))
5254 if (target != const0_rtx)
5256 len = c_strlen (arg, 1);
5257 if (! len || TREE_CODE (len) != INTEGER_CST)
5263 expand_expr (build_call_nofold (fn, 2, dest, arg),
5264 const0_rtx, VOIDmode, EXPAND_NORMAL);
5266 if (target == const0_rtx)
5268 return expand_expr (len, target, mode, EXPAND_NORMAL);
5274 /* Expand a call to either the entry or exit function profiler. */
5277 expand_builtin_profile_func (bool exitp)
5279 rtx this_rtx, which;
5281 this_rtx = DECL_RTL (current_function_decl);
5282 gcc_assert (MEM_P (this_rtx));
5283 this_rtx = XEXP (this_rtx, 0);
5286 which = profile_function_exit_libfunc;
5288 which = profile_function_entry_libfunc;
5290 emit_library_call (which, LCT_NORMAL, VOIDmode, 2, this_rtx, Pmode,
5291 expand_builtin_return_addr (BUILT_IN_RETURN_ADDRESS,
5298 /* Expand a call to __builtin___clear_cache. */
5301 expand_builtin___clear_cache (tree exp ATTRIBUTE_UNUSED)
5303 #ifndef HAVE_clear_cache
5304 #ifdef CLEAR_INSN_CACHE
5305 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5306 does something. Just do the default expansion to a call to
5310 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5311 does nothing. There is no need to call it. Do nothing. */
5313 #endif /* CLEAR_INSN_CACHE */
5315 /* We have a "clear_cache" insn, and it will handle everything. */
5317 rtx begin_rtx, end_rtx;
5318 enum insn_code icode;
5320 /* We must not expand to a library call. If we did, any
5321 fallback library function in libgcc that might contain a call to
5322 __builtin___clear_cache() would recurse infinitely. */
5323 if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
5325 error ("both arguments to %<__builtin___clear_cache%> must be pointers");
5329 if (HAVE_clear_cache)
5331 icode = CODE_FOR_clear_cache;
5333 begin = CALL_EXPR_ARG (exp, 0);
5334 begin_rtx = expand_expr (begin, NULL_RTX, Pmode, EXPAND_NORMAL);
5335 begin_rtx = convert_memory_address (Pmode, begin_rtx);
5336 if (!insn_data[icode].operand[0].predicate (begin_rtx, Pmode))
5337 begin_rtx = copy_to_mode_reg (Pmode, begin_rtx);
5339 end = CALL_EXPR_ARG (exp, 1);
5340 end_rtx = expand_expr (end, NULL_RTX, Pmode, EXPAND_NORMAL);
5341 end_rtx = convert_memory_address (Pmode, end_rtx);
5342 if (!insn_data[icode].operand[1].predicate (end_rtx, Pmode))
5343 end_rtx = copy_to_mode_reg (Pmode, end_rtx);
5345 emit_insn (gen_clear_cache (begin_rtx, end_rtx));
5348 #endif /* HAVE_clear_cache */
5351 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
5354 round_trampoline_addr (rtx tramp)
5356 rtx temp, addend, mask;
5358 /* If we don't need too much alignment, we'll have been guaranteed
5359 proper alignment by get_trampoline_type. */
5360 if (TRAMPOLINE_ALIGNMENT <= STACK_BOUNDARY)
5363 /* Round address up to desired boundary. */
5364 temp = gen_reg_rtx (Pmode);
5365 addend = GEN_INT (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT - 1);
5366 mask = GEN_INT (-TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT);
5368 temp = expand_simple_binop (Pmode, PLUS, tramp, addend,
5369 temp, 0, OPTAB_LIB_WIDEN);
5370 tramp = expand_simple_binop (Pmode, AND, temp, mask,
5371 temp, 0, OPTAB_LIB_WIDEN);
5377 expand_builtin_init_trampoline (tree exp)
5379 tree t_tramp, t_func, t_chain;
5380 rtx m_tramp, r_tramp, r_chain, tmp;
5382 if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE,
5383 POINTER_TYPE, VOID_TYPE))
5386 t_tramp = CALL_EXPR_ARG (exp, 0);
5387 t_func = CALL_EXPR_ARG (exp, 1);
5388 t_chain = CALL_EXPR_ARG (exp, 2);
5390 r_tramp = expand_normal (t_tramp);
5391 m_tramp = gen_rtx_MEM (BLKmode, r_tramp);
5392 MEM_NOTRAP_P (m_tramp) = 1;
5394 /* The TRAMP argument should be the address of a field within the
5395 local function's FRAME decl. Let's see if we can fill in the
5396 to fill in the MEM_ATTRs for this memory. */
5397 if (TREE_CODE (t_tramp) == ADDR_EXPR)
5398 set_mem_attributes_minus_bitpos (m_tramp, TREE_OPERAND (t_tramp, 0),
5401 tmp = round_trampoline_addr (r_tramp);
5404 m_tramp = change_address (m_tramp, BLKmode, tmp);
5405 set_mem_align (m_tramp, TRAMPOLINE_ALIGNMENT);
5406 set_mem_size (m_tramp, GEN_INT (TRAMPOLINE_SIZE));
5409 /* The FUNC argument should be the address of the nested function.
5410 Extract the actual function decl to pass to the hook. */
5411 gcc_assert (TREE_CODE (t_func) == ADDR_EXPR);
5412 t_func = TREE_OPERAND (t_func, 0);
5413 gcc_assert (TREE_CODE (t_func) == FUNCTION_DECL);
5415 r_chain = expand_normal (t_chain);
5417 /* Generate insns to initialize the trampoline. */
5418 targetm.calls.trampoline_init (m_tramp, t_func, r_chain);
5420 trampolines_created = 1;
5425 expand_builtin_adjust_trampoline (tree exp)
5429 if (!validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
5432 tramp = expand_normal (CALL_EXPR_ARG (exp, 0));
5433 tramp = round_trampoline_addr (tramp);
5434 if (targetm.calls.trampoline_adjust_address)
5435 tramp = targetm.calls.trampoline_adjust_address (tramp);
5440 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
5441 function. The function first checks whether the back end provides
5442 an insn to implement signbit for the respective mode. If not, it
5443 checks whether the floating point format of the value is such that
5444 the sign bit can be extracted. If that is not the case, the
5445 function returns NULL_RTX to indicate that a normal call should be
5446 emitted rather than expanding the function in-line. EXP is the
5447 expression that is a call to the builtin function; if convenient,
5448 the result should be placed in TARGET. */
5450 expand_builtin_signbit (tree exp, rtx target)
5452 const struct real_format *fmt;
5453 enum machine_mode fmode, imode, rmode;
5454 HOST_WIDE_INT hi, lo;
5457 enum insn_code icode;
5459 location_t loc = EXPR_LOCATION (exp);
5461 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
5464 arg = CALL_EXPR_ARG (exp, 0);
5465 fmode = TYPE_MODE (TREE_TYPE (arg));
5466 rmode = TYPE_MODE (TREE_TYPE (exp));
5467 fmt = REAL_MODE_FORMAT (fmode);
5469 arg = builtin_save_expr (arg);
5471 /* Expand the argument yielding a RTX expression. */
5472 temp = expand_normal (arg);
5474 /* Check if the back end provides an insn that handles signbit for the
5476 icode = signbit_optab->handlers [(int) fmode].insn_code;
5477 if (icode != CODE_FOR_nothing)
5479 target = gen_reg_rtx (TYPE_MODE (TREE_TYPE (exp)));
5480 emit_unop_insn (icode, target, temp, UNKNOWN);
5484 /* For floating point formats without a sign bit, implement signbit
5486 bitpos = fmt->signbit_ro;
5489 /* But we can't do this if the format supports signed zero. */
5490 if (fmt->has_signed_zero && HONOR_SIGNED_ZEROS (fmode))
5493 arg = fold_build2_loc (loc, LT_EXPR, TREE_TYPE (exp), arg,
5494 build_real (TREE_TYPE (arg), dconst0));
5495 return expand_expr (arg, target, VOIDmode, EXPAND_NORMAL);
5498 if (GET_MODE_SIZE (fmode) <= UNITS_PER_WORD)
5500 imode = int_mode_for_mode (fmode);
5501 if (imode == BLKmode)
5503 temp = gen_lowpart (imode, temp);
5508 /* Handle targets with different FP word orders. */
5509 if (FLOAT_WORDS_BIG_ENDIAN)
5510 word = (GET_MODE_BITSIZE (fmode) - bitpos) / BITS_PER_WORD;
5512 word = bitpos / BITS_PER_WORD;
5513 temp = operand_subword_force (temp, word, fmode);
5514 bitpos = bitpos % BITS_PER_WORD;
5517 /* Force the intermediate word_mode (or narrower) result into a
5518 register. This avoids attempting to create paradoxical SUBREGs
5519 of floating point modes below. */
5520 temp = force_reg (imode, temp);
5522 /* If the bitpos is within the "result mode" lowpart, the operation
5523 can be implement with a single bitwise AND. Otherwise, we need
5524 a right shift and an AND. */
5526 if (bitpos < GET_MODE_BITSIZE (rmode))
5528 if (bitpos < HOST_BITS_PER_WIDE_INT)
5531 lo = (HOST_WIDE_INT) 1 << bitpos;
5535 hi = (HOST_WIDE_INT) 1 << (bitpos - HOST_BITS_PER_WIDE_INT);
5539 if (GET_MODE_SIZE (imode) > GET_MODE_SIZE (rmode))
5540 temp = gen_lowpart (rmode, temp);
5541 temp = expand_binop (rmode, and_optab, temp,
5542 immed_double_const (lo, hi, rmode),
5543 NULL_RTX, 1, OPTAB_LIB_WIDEN);
5547 /* Perform a logical right shift to place the signbit in the least
5548 significant bit, then truncate the result to the desired mode
5549 and mask just this bit. */
5550 temp = expand_shift (RSHIFT_EXPR, imode, temp,
5551 build_int_cst (NULL_TREE, bitpos), NULL_RTX, 1);
5552 temp = gen_lowpart (rmode, temp);
5553 temp = expand_binop (rmode, and_optab, temp, const1_rtx,
5554 NULL_RTX, 1, OPTAB_LIB_WIDEN);
5560 /* Expand fork or exec calls. TARGET is the desired target of the
5561 call. EXP is the call. FN is the
5562 identificator of the actual function. IGNORE is nonzero if the
5563 value is to be ignored. */
5566 expand_builtin_fork_or_exec (tree fn, tree exp, rtx target, int ignore)
5571 /* If we are not profiling, just call the function. */
5572 if (!profile_arc_flag)
5575 /* Otherwise call the wrapper. This should be equivalent for the rest of
5576 compiler, so the code does not diverge, and the wrapper may run the
5577 code necessary for keeping the profiling sane. */
5579 switch (DECL_FUNCTION_CODE (fn))
5582 id = get_identifier ("__gcov_fork");
5585 case BUILT_IN_EXECL:
5586 id = get_identifier ("__gcov_execl");
5589 case BUILT_IN_EXECV:
5590 id = get_identifier ("__gcov_execv");
5593 case BUILT_IN_EXECLP:
5594 id = get_identifier ("__gcov_execlp");
5597 case BUILT_IN_EXECLE:
5598 id = get_identifier ("__gcov_execle");
5601 case BUILT_IN_EXECVP:
5602 id = get_identifier ("__gcov_execvp");
5605 case BUILT_IN_EXECVE:
5606 id = get_identifier ("__gcov_execve");
5613 decl = build_decl (DECL_SOURCE_LOCATION (fn),
5614 FUNCTION_DECL, id, TREE_TYPE (fn));
5615 DECL_EXTERNAL (decl) = 1;
5616 TREE_PUBLIC (decl) = 1;
5617 DECL_ARTIFICIAL (decl) = 1;
5618 TREE_NOTHROW (decl) = 1;
5619 DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT;
5620 DECL_VISIBILITY_SPECIFIED (decl) = 1;
5621 call = rewrite_call_expr (EXPR_LOCATION (exp), exp, 0, decl, 0);
5622 return expand_call (call, target, ignore);
5627 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
5628 the pointer in these functions is void*, the tree optimizers may remove
5629 casts. The mode computed in expand_builtin isn't reliable either, due
5630 to __sync_bool_compare_and_swap.
5632 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
5633 group of builtins. This gives us log2 of the mode size. */
5635 static inline enum machine_mode
5636 get_builtin_sync_mode (int fcode_diff)
5638 /* The size is not negotiable, so ask not to get BLKmode in return
5639 if the target indicates that a smaller size would be better. */
5640 return mode_for_size (BITS_PER_UNIT << fcode_diff, MODE_INT, 0);
5643 /* Expand the memory expression LOC and return the appropriate memory operand
5644 for the builtin_sync operations. */
5647 get_builtin_sync_mem (tree loc, enum machine_mode mode)
5651 addr = expand_expr (loc, NULL_RTX, ptr_mode, EXPAND_SUM);
5652 addr = convert_memory_address (Pmode, addr);
5654 /* Note that we explicitly do not want any alias information for this
5655 memory, so that we kill all other live memories. Otherwise we don't
5656 satisfy the full barrier semantics of the intrinsic. */
5657 mem = validize_mem (gen_rtx_MEM (mode, addr));
5659 set_mem_align (mem, get_pointer_alignment (loc, BIGGEST_ALIGNMENT));
5660 set_mem_alias_set (mem, ALIAS_SET_MEMORY_BARRIER);
5661 MEM_VOLATILE_P (mem) = 1;
5666 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
5667 EXP is the CALL_EXPR. CODE is the rtx code
5668 that corresponds to the arithmetic or logical operation from the name;
5669 an exception here is that NOT actually means NAND. TARGET is an optional
5670 place for us to store the results; AFTER is true if this is the
5671 fetch_and_xxx form. IGNORE is true if we don't actually care about
5672 the result of the operation at all. */
5675 expand_builtin_sync_operation (enum machine_mode mode, tree exp,
5676 enum rtx_code code, bool after,
5677 rtx target, bool ignore)
5680 enum machine_mode old_mode;
5681 location_t loc = EXPR_LOCATION (exp);
5683 if (code == NOT && warn_sync_nand)
5685 tree fndecl = get_callee_fndecl (exp);
5686 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
5688 static bool warned_f_a_n, warned_n_a_f;
5692 case BUILT_IN_FETCH_AND_NAND_1:
5693 case BUILT_IN_FETCH_AND_NAND_2:
5694 case BUILT_IN_FETCH_AND_NAND_4:
5695 case BUILT_IN_FETCH_AND_NAND_8:
5696 case BUILT_IN_FETCH_AND_NAND_16:
5701 fndecl = implicit_built_in_decls[BUILT_IN_FETCH_AND_NAND_N];
5702 inform (loc, "%qD changed semantics in GCC 4.4", fndecl);
5703 warned_f_a_n = true;
5706 case BUILT_IN_NAND_AND_FETCH_1:
5707 case BUILT_IN_NAND_AND_FETCH_2:
5708 case BUILT_IN_NAND_AND_FETCH_4:
5709 case BUILT_IN_NAND_AND_FETCH_8:
5710 case BUILT_IN_NAND_AND_FETCH_16:
5715 fndecl = implicit_built_in_decls[BUILT_IN_NAND_AND_FETCH_N];
5716 inform (loc, "%qD changed semantics in GCC 4.4", fndecl);
5717 warned_n_a_f = true;
5725 /* Expand the operands. */
5726 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5728 val = expand_expr (CALL_EXPR_ARG (exp, 1), NULL_RTX, mode, EXPAND_NORMAL);
5729 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5730 of CONST_INTs, where we know the old_mode only from the call argument. */
5731 old_mode = GET_MODE (val);
5732 if (old_mode == VOIDmode)
5733 old_mode = TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp, 1)));
5734 val = convert_modes (mode, old_mode, val, 1);
5737 return expand_sync_operation (mem, val, code);
5739 return expand_sync_fetch_operation (mem, val, code, after, target);
5742 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
5743 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
5744 true if this is the boolean form. TARGET is a place for us to store the
5745 results; this is NOT optional if IS_BOOL is true. */
5748 expand_builtin_compare_and_swap (enum machine_mode mode, tree exp,
5749 bool is_bool, rtx target)
5751 rtx old_val, new_val, mem;
5752 enum machine_mode old_mode;
5754 /* Expand the operands. */
5755 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5758 old_val = expand_expr (CALL_EXPR_ARG (exp, 1), NULL_RTX,
5759 mode, EXPAND_NORMAL);
5760 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5761 of CONST_INTs, where we know the old_mode only from the call argument. */
5762 old_mode = GET_MODE (old_val);
5763 if (old_mode == VOIDmode)
5764 old_mode = TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp, 1)));
5765 old_val = convert_modes (mode, old_mode, old_val, 1);
5767 new_val = expand_expr (CALL_EXPR_ARG (exp, 2), NULL_RTX,
5768 mode, EXPAND_NORMAL);
5769 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5770 of CONST_INTs, where we know the old_mode only from the call argument. */
5771 old_mode = GET_MODE (new_val);
5772 if (old_mode == VOIDmode)
5773 old_mode = TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp, 2)));
5774 new_val = convert_modes (mode, old_mode, new_val, 1);
5777 return expand_bool_compare_and_swap (mem, old_val, new_val, target);
5779 return expand_val_compare_and_swap (mem, old_val, new_val, target);
5782 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
5783 general form is actually an atomic exchange, and some targets only
5784 support a reduced form with the second argument being a constant 1.
5785 EXP is the CALL_EXPR; TARGET is an optional place for us to store
5789 expand_builtin_lock_test_and_set (enum machine_mode mode, tree exp,
5793 enum machine_mode old_mode;
5795 /* Expand the operands. */
5796 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5797 val = expand_expr (CALL_EXPR_ARG (exp, 1), NULL_RTX, mode, EXPAND_NORMAL);
5798 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5799 of CONST_INTs, where we know the old_mode only from the call argument. */
5800 old_mode = GET_MODE (val);
5801 if (old_mode == VOIDmode)
5802 old_mode = TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp, 1)));
5803 val = convert_modes (mode, old_mode, val, 1);
5805 return expand_sync_lock_test_and_set (mem, val, target);
5808 /* Expand the __sync_synchronize intrinsic. */
5811 expand_builtin_synchronize (void)
5814 VEC (tree, gc) *v_clobbers;
5816 #ifdef HAVE_memory_barrier
5817 if (HAVE_memory_barrier)
5819 emit_insn (gen_memory_barrier ());
5824 if (synchronize_libfunc != NULL_RTX)
5826 emit_library_call (synchronize_libfunc, LCT_NORMAL, VOIDmode, 0);
5830 /* If no explicit memory barrier instruction is available, create an
5831 empty asm stmt with a memory clobber. */
5832 v_clobbers = VEC_alloc (tree, gc, 1);
5833 VEC_quick_push (tree, v_clobbers,
5834 tree_cons (NULL, build_string (6, "memory"), NULL));
5835 x = gimple_build_asm_vec ("", NULL, NULL, v_clobbers, NULL);
5836 gimple_asm_set_volatile (x, true);
5837 expand_asm_stmt (x);
5840 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
5843 expand_builtin_lock_release (enum machine_mode mode, tree exp)
5845 enum insn_code icode;
5847 rtx val = const0_rtx;
5849 /* Expand the operands. */
5850 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5852 /* If there is an explicit operation in the md file, use it. */
5853 icode = sync_lock_release[mode];
5854 if (icode != CODE_FOR_nothing)
5856 if (!insn_data[icode].operand[1].predicate (val, mode))
5857 val = force_reg (mode, val);
5859 insn = GEN_FCN (icode) (mem, val);
5867 /* Otherwise we can implement this operation by emitting a barrier
5868 followed by a store of zero. */
5869 expand_builtin_synchronize ();
5870 emit_move_insn (mem, val);
5873 /* Expand an expression EXP that calls a built-in function,
5874 with result going to TARGET if that's convenient
5875 (and in mode MODE if that's convenient).
5876 SUBTARGET may be used as the target for computing one of EXP's operands.
5877 IGNORE is nonzero if the value is to be ignored. */
5880 expand_builtin (tree exp, rtx target, rtx subtarget, enum machine_mode mode,
5883 tree fndecl = get_callee_fndecl (exp);
5884 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
5885 enum machine_mode target_mode = TYPE_MODE (TREE_TYPE (exp));
5887 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
5888 return targetm.expand_builtin (exp, target, subtarget, mode, ignore);
5890 /* When not optimizing, generate calls to library functions for a certain
5893 && !called_as_built_in (fndecl)
5894 && DECL_ASSEMBLER_NAME_SET_P (fndecl)
5895 && fcode != BUILT_IN_ALLOCA
5896 && fcode != BUILT_IN_FREE)
5897 return expand_call (exp, target, ignore);
5899 /* The built-in function expanders test for target == const0_rtx
5900 to determine whether the function's result will be ignored. */
5902 target = const0_rtx;
5904 /* If the result of a pure or const built-in function is ignored, and
5905 none of its arguments are volatile, we can avoid expanding the
5906 built-in call and just evaluate the arguments for side-effects. */
5907 if (target == const0_rtx
5908 && (DECL_PURE_P (fndecl) || TREE_READONLY (fndecl)))
5910 bool volatilep = false;
5912 call_expr_arg_iterator iter;
5914 FOR_EACH_CALL_EXPR_ARG (arg, iter, exp)
5915 if (TREE_THIS_VOLATILE (arg))
5923 FOR_EACH_CALL_EXPR_ARG (arg, iter, exp)
5924 expand_expr (arg, const0_rtx, VOIDmode, EXPAND_NORMAL);
5931 CASE_FLT_FN (BUILT_IN_FABS):
5932 target = expand_builtin_fabs (exp, target, subtarget);
5937 CASE_FLT_FN (BUILT_IN_COPYSIGN):
5938 target = expand_builtin_copysign (exp, target, subtarget);
5943 /* Just do a normal library call if we were unable to fold
5945 CASE_FLT_FN (BUILT_IN_CABS):
5948 CASE_FLT_FN (BUILT_IN_EXP):
5949 CASE_FLT_FN (BUILT_IN_EXP10):
5950 CASE_FLT_FN (BUILT_IN_POW10):
5951 CASE_FLT_FN (BUILT_IN_EXP2):
5952 CASE_FLT_FN (BUILT_IN_EXPM1):
5953 CASE_FLT_FN (BUILT_IN_LOGB):
5954 CASE_FLT_FN (BUILT_IN_LOG):
5955 CASE_FLT_FN (BUILT_IN_LOG10):
5956 CASE_FLT_FN (BUILT_IN_LOG2):
5957 CASE_FLT_FN (BUILT_IN_LOG1P):
5958 CASE_FLT_FN (BUILT_IN_TAN):
5959 CASE_FLT_FN (BUILT_IN_ASIN):
5960 CASE_FLT_FN (BUILT_IN_ACOS):
5961 CASE_FLT_FN (BUILT_IN_ATAN):
5962 CASE_FLT_FN (BUILT_IN_SIGNIFICAND):
5963 /* Treat these like sqrt only if unsafe math optimizations are allowed,
5964 because of possible accuracy problems. */
5965 if (! flag_unsafe_math_optimizations)
5967 CASE_FLT_FN (BUILT_IN_SQRT):
5968 CASE_FLT_FN (BUILT_IN_FLOOR):
5969 CASE_FLT_FN (BUILT_IN_CEIL):
5970 CASE_FLT_FN (BUILT_IN_TRUNC):
5971 CASE_FLT_FN (BUILT_IN_ROUND):
5972 CASE_FLT_FN (BUILT_IN_NEARBYINT):
5973 CASE_FLT_FN (BUILT_IN_RINT):
5974 target = expand_builtin_mathfn (exp, target, subtarget);
5979 CASE_FLT_FN (BUILT_IN_ILOGB):
5980 if (! flag_unsafe_math_optimizations)
5982 CASE_FLT_FN (BUILT_IN_ISINF):
5983 CASE_FLT_FN (BUILT_IN_FINITE):
5984 case BUILT_IN_ISFINITE:
5985 case BUILT_IN_ISNORMAL:
5986 target = expand_builtin_interclass_mathfn (exp, target, subtarget);
5991 CASE_FLT_FN (BUILT_IN_LCEIL):
5992 CASE_FLT_FN (BUILT_IN_LLCEIL):
5993 CASE_FLT_FN (BUILT_IN_LFLOOR):
5994 CASE_FLT_FN (BUILT_IN_LLFLOOR):
5995 target = expand_builtin_int_roundingfn (exp, target);
6000 CASE_FLT_FN (BUILT_IN_LRINT):
6001 CASE_FLT_FN (BUILT_IN_LLRINT):
6002 CASE_FLT_FN (BUILT_IN_LROUND):
6003 CASE_FLT_FN (BUILT_IN_LLROUND):
6004 target = expand_builtin_int_roundingfn_2 (exp, target);
6009 CASE_FLT_FN (BUILT_IN_POW):
6010 target = expand_builtin_pow (exp, target, subtarget);
6015 CASE_FLT_FN (BUILT_IN_POWI):
6016 target = expand_builtin_powi (exp, target, subtarget);
6021 CASE_FLT_FN (BUILT_IN_ATAN2):
6022 CASE_FLT_FN (BUILT_IN_LDEXP):
6023 CASE_FLT_FN (BUILT_IN_SCALB):
6024 CASE_FLT_FN (BUILT_IN_SCALBN):
6025 CASE_FLT_FN (BUILT_IN_SCALBLN):
6026 if (! flag_unsafe_math_optimizations)
6029 CASE_FLT_FN (BUILT_IN_FMOD):
6030 CASE_FLT_FN (BUILT_IN_REMAINDER):
6031 CASE_FLT_FN (BUILT_IN_DREM):
6032 target = expand_builtin_mathfn_2 (exp, target, subtarget);
6037 CASE_FLT_FN (BUILT_IN_CEXPI):
6038 target = expand_builtin_cexpi (exp, target, subtarget);
6039 gcc_assert (target);
6042 CASE_FLT_FN (BUILT_IN_SIN):
6043 CASE_FLT_FN (BUILT_IN_COS):
6044 if (! flag_unsafe_math_optimizations)
6046 target = expand_builtin_mathfn_3 (exp, target, subtarget);
6051 CASE_FLT_FN (BUILT_IN_SINCOS):
6052 if (! flag_unsafe_math_optimizations)
6054 target = expand_builtin_sincos (exp);
6059 case BUILT_IN_APPLY_ARGS:
6060 return expand_builtin_apply_args ();
6062 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
6063 FUNCTION with a copy of the parameters described by
6064 ARGUMENTS, and ARGSIZE. It returns a block of memory
6065 allocated on the stack into which is stored all the registers
6066 that might possibly be used for returning the result of a
6067 function. ARGUMENTS is the value returned by
6068 __builtin_apply_args. ARGSIZE is the number of bytes of
6069 arguments that must be copied. ??? How should this value be
6070 computed? We'll also need a safe worst case value for varargs
6072 case BUILT_IN_APPLY:
6073 if (!validate_arglist (exp, POINTER_TYPE,
6074 POINTER_TYPE, INTEGER_TYPE, VOID_TYPE)
6075 && !validate_arglist (exp, REFERENCE_TYPE,
6076 POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
6082 ops[0] = expand_normal (CALL_EXPR_ARG (exp, 0));
6083 ops[1] = expand_normal (CALL_EXPR_ARG (exp, 1));
6084 ops[2] = expand_normal (CALL_EXPR_ARG (exp, 2));
6086 return expand_builtin_apply (ops[0], ops[1], ops[2]);
6089 /* __builtin_return (RESULT) causes the function to return the
6090 value described by RESULT. RESULT is address of the block of
6091 memory returned by __builtin_apply. */
6092 case BUILT_IN_RETURN:
6093 if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
6094 expand_builtin_return (expand_normal (CALL_EXPR_ARG (exp, 0)));
6097 case BUILT_IN_SAVEREGS:
6098 return expand_builtin_saveregs ();
6100 case BUILT_IN_ARGS_INFO:
6101 return expand_builtin_args_info (exp);
6103 case BUILT_IN_VA_ARG_PACK:
6104 /* All valid uses of __builtin_va_arg_pack () are removed during
6106 error ("%Kinvalid use of %<__builtin_va_arg_pack ()%>", exp);
6109 case BUILT_IN_VA_ARG_PACK_LEN:
6110 /* All valid uses of __builtin_va_arg_pack_len () are removed during
6112 error ("%Kinvalid use of %<__builtin_va_arg_pack_len ()%>", exp);
6115 /* Return the address of the first anonymous stack arg. */
6116 case BUILT_IN_NEXT_ARG:
6117 if (fold_builtin_next_arg (exp, false))
6119 return expand_builtin_next_arg ();
6121 case BUILT_IN_CLEAR_CACHE:
6122 target = expand_builtin___clear_cache (exp);
6127 case BUILT_IN_CLASSIFY_TYPE:
6128 return expand_builtin_classify_type (exp);
6130 case BUILT_IN_CONSTANT_P:
6133 case BUILT_IN_FRAME_ADDRESS:
6134 case BUILT_IN_RETURN_ADDRESS:
6135 return expand_builtin_frame_address (fndecl, exp);
6137 /* Returns the address of the area where the structure is returned.
6139 case BUILT_IN_AGGREGATE_INCOMING_ADDRESS:
6140 if (call_expr_nargs (exp) != 0
6141 || ! AGGREGATE_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl)))
6142 || !MEM_P (DECL_RTL (DECL_RESULT (current_function_decl))))
6145 return XEXP (DECL_RTL (DECL_RESULT (current_function_decl)), 0);
6147 case BUILT_IN_ALLOCA:
6148 target = expand_builtin_alloca (exp, target);
6153 case BUILT_IN_STACK_SAVE:
6154 return expand_stack_save ();
6156 case BUILT_IN_STACK_RESTORE:
6157 expand_stack_restore (CALL_EXPR_ARG (exp, 0));
6160 case BUILT_IN_BSWAP32:
6161 case BUILT_IN_BSWAP64:
6162 target = expand_builtin_bswap (exp, target, subtarget);
6168 CASE_INT_FN (BUILT_IN_FFS):
6169 case BUILT_IN_FFSIMAX:
6170 target = expand_builtin_unop (target_mode, exp, target,
6171 subtarget, ffs_optab);
6176 CASE_INT_FN (BUILT_IN_CLZ):
6177 case BUILT_IN_CLZIMAX:
6178 target = expand_builtin_unop (target_mode, exp, target,
6179 subtarget, clz_optab);
6184 CASE_INT_FN (BUILT_IN_CTZ):
6185 case BUILT_IN_CTZIMAX:
6186 target = expand_builtin_unop (target_mode, exp, target,
6187 subtarget, ctz_optab);
6192 CASE_INT_FN (BUILT_IN_POPCOUNT):
6193 case BUILT_IN_POPCOUNTIMAX:
6194 target = expand_builtin_unop (target_mode, exp, target,
6195 subtarget, popcount_optab);
6200 CASE_INT_FN (BUILT_IN_PARITY):
6201 case BUILT_IN_PARITYIMAX:
6202 target = expand_builtin_unop (target_mode, exp, target,
6203 subtarget, parity_optab);
6208 case BUILT_IN_STRLEN:
6209 target = expand_builtin_strlen (exp, target, target_mode);
6214 case BUILT_IN_STRCPY:
6215 target = expand_builtin_strcpy (exp, target);
6220 case BUILT_IN_STRNCPY:
6221 target = expand_builtin_strncpy (exp, target);
6226 case BUILT_IN_STPCPY:
6227 target = expand_builtin_stpcpy (exp, target, mode);
6232 case BUILT_IN_MEMCPY:
6233 target = expand_builtin_memcpy (exp, target);
6238 case BUILT_IN_MEMPCPY:
6239 target = expand_builtin_mempcpy (exp, target, mode);
6244 case BUILT_IN_MEMSET:
6245 target = expand_builtin_memset (exp, target, mode);
6250 case BUILT_IN_BZERO:
6251 target = expand_builtin_bzero (exp);
6256 case BUILT_IN_STRCMP:
6257 target = expand_builtin_strcmp (exp, target);
6262 case BUILT_IN_STRNCMP:
6263 target = expand_builtin_strncmp (exp, target, mode);
6269 case BUILT_IN_MEMCMP:
6270 target = expand_builtin_memcmp (exp, target, mode);
6275 case BUILT_IN_SETJMP:
6276 /* This should have been lowered to the builtins below. */
6279 case BUILT_IN_SETJMP_SETUP:
6280 /* __builtin_setjmp_setup is passed a pointer to an array of five words
6281 and the receiver label. */
6282 if (validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
6284 rtx buf_addr = expand_expr (CALL_EXPR_ARG (exp, 0), subtarget,
6285 VOIDmode, EXPAND_NORMAL);
6286 tree label = TREE_OPERAND (CALL_EXPR_ARG (exp, 1), 0);
6287 rtx label_r = label_rtx (label);
6289 /* This is copied from the handling of non-local gotos. */
6290 expand_builtin_setjmp_setup (buf_addr, label_r);
6291 nonlocal_goto_handler_labels
6292 = gen_rtx_EXPR_LIST (VOIDmode, label_r,
6293 nonlocal_goto_handler_labels);
6294 /* ??? Do not let expand_label treat us as such since we would
6295 not want to be both on the list of non-local labels and on
6296 the list of forced labels. */
6297 FORCED_LABEL (label) = 0;
6302 case BUILT_IN_SETJMP_DISPATCHER:
6303 /* __builtin_setjmp_dispatcher is passed the dispatcher label. */
6304 if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
6306 tree label = TREE_OPERAND (CALL_EXPR_ARG (exp, 0), 0);
6307 rtx label_r = label_rtx (label);
6309 /* Remove the dispatcher label from the list of non-local labels
6310 since the receiver labels have been added to it above. */
6311 remove_node_from_expr_list (label_r, &nonlocal_goto_handler_labels);
6316 case BUILT_IN_SETJMP_RECEIVER:
6317 /* __builtin_setjmp_receiver is passed the receiver label. */
6318 if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
6320 tree label = TREE_OPERAND (CALL_EXPR_ARG (exp, 0), 0);
6321 rtx label_r = label_rtx (label);
6323 expand_builtin_setjmp_receiver (label_r);
6328 /* __builtin_longjmp is passed a pointer to an array of five words.
6329 It's similar to the C library longjmp function but works with
6330 __builtin_setjmp above. */
6331 case BUILT_IN_LONGJMP:
6332 if (validate_arglist (exp, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
6334 rtx buf_addr = expand_expr (CALL_EXPR_ARG (exp, 0), subtarget,
6335 VOIDmode, EXPAND_NORMAL);
6336 rtx value = expand_normal (CALL_EXPR_ARG (exp, 1));
6338 if (value != const1_rtx)
6340 error ("%<__builtin_longjmp%> second argument must be 1");
6344 expand_builtin_longjmp (buf_addr, value);
6349 case BUILT_IN_NONLOCAL_GOTO:
6350 target = expand_builtin_nonlocal_goto (exp);
6355 /* This updates the setjmp buffer that is its argument with the value
6356 of the current stack pointer. */
6357 case BUILT_IN_UPDATE_SETJMP_BUF:
6358 if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
6361 = expand_normal (CALL_EXPR_ARG (exp, 0));
6363 expand_builtin_update_setjmp_buf (buf_addr);
6369 expand_builtin_trap ();
6372 case BUILT_IN_UNREACHABLE:
6373 expand_builtin_unreachable ();
6376 case BUILT_IN_PRINTF:
6377 target = expand_builtin_printf (exp, target, mode, false);
6382 case BUILT_IN_PRINTF_UNLOCKED:
6383 target = expand_builtin_printf (exp, target, mode, true);
6388 case BUILT_IN_FPRINTF:
6389 target = expand_builtin_fprintf (exp, target, mode, false);
6394 case BUILT_IN_FPRINTF_UNLOCKED:
6395 target = expand_builtin_fprintf (exp, target, mode, true);
6400 case BUILT_IN_SPRINTF:
6401 target = expand_builtin_sprintf (exp, target, mode);
6406 CASE_FLT_FN (BUILT_IN_SIGNBIT):
6407 case BUILT_IN_SIGNBITD32:
6408 case BUILT_IN_SIGNBITD64:
6409 case BUILT_IN_SIGNBITD128:
6410 target = expand_builtin_signbit (exp, target);
6415 /* Various hooks for the DWARF 2 __throw routine. */
6416 case BUILT_IN_UNWIND_INIT:
6417 expand_builtin_unwind_init ();
6419 case BUILT_IN_DWARF_CFA:
6420 return virtual_cfa_rtx;
6421 #ifdef DWARF2_UNWIND_INFO
6422 case BUILT_IN_DWARF_SP_COLUMN:
6423 return expand_builtin_dwarf_sp_column ();
6424 case BUILT_IN_INIT_DWARF_REG_SIZES:
6425 expand_builtin_init_dwarf_reg_sizes (CALL_EXPR_ARG (exp, 0));
6428 case BUILT_IN_FROB_RETURN_ADDR:
6429 return expand_builtin_frob_return_addr (CALL_EXPR_ARG (exp, 0));
6430 case BUILT_IN_EXTRACT_RETURN_ADDR:
6431 return expand_builtin_extract_return_addr (CALL_EXPR_ARG (exp, 0));
6432 case BUILT_IN_EH_RETURN:
6433 expand_builtin_eh_return (CALL_EXPR_ARG (exp, 0),
6434 CALL_EXPR_ARG (exp, 1));
6436 #ifdef EH_RETURN_DATA_REGNO
6437 case BUILT_IN_EH_RETURN_DATA_REGNO:
6438 return expand_builtin_eh_return_data_regno (exp);
6440 case BUILT_IN_EXTEND_POINTER:
6441 return expand_builtin_extend_pointer (CALL_EXPR_ARG (exp, 0));
6442 case BUILT_IN_EH_POINTER:
6443 return expand_builtin_eh_pointer (exp);
6444 case BUILT_IN_EH_FILTER:
6445 return expand_builtin_eh_filter (exp);
6446 case BUILT_IN_EH_COPY_VALUES:
6447 return expand_builtin_eh_copy_values (exp);
6449 case BUILT_IN_VA_START:
6450 return expand_builtin_va_start (exp);
6451 case BUILT_IN_VA_END:
6452 return expand_builtin_va_end (exp);
6453 case BUILT_IN_VA_COPY:
6454 return expand_builtin_va_copy (exp);
6455 case BUILT_IN_EXPECT:
6456 return expand_builtin_expect (exp, target);
6457 case BUILT_IN_PREFETCH:
6458 expand_builtin_prefetch (exp);
6461 case BUILT_IN_PROFILE_FUNC_ENTER:
6462 return expand_builtin_profile_func (false);
6463 case BUILT_IN_PROFILE_FUNC_EXIT:
6464 return expand_builtin_profile_func (true);
6466 case BUILT_IN_INIT_TRAMPOLINE:
6467 return expand_builtin_init_trampoline (exp);
6468 case BUILT_IN_ADJUST_TRAMPOLINE:
6469 return expand_builtin_adjust_trampoline (exp);
6472 case BUILT_IN_EXECL:
6473 case BUILT_IN_EXECV:
6474 case BUILT_IN_EXECLP:
6475 case BUILT_IN_EXECLE:
6476 case BUILT_IN_EXECVP:
6477 case BUILT_IN_EXECVE:
6478 target = expand_builtin_fork_or_exec (fndecl, exp, target, ignore);
6483 case BUILT_IN_FETCH_AND_ADD_1:
6484 case BUILT_IN_FETCH_AND_ADD_2:
6485 case BUILT_IN_FETCH_AND_ADD_4:
6486 case BUILT_IN_FETCH_AND_ADD_8:
6487 case BUILT_IN_FETCH_AND_ADD_16:
6488 mode = get_builtin_sync_mode (fcode - BUILT_IN_FETCH_AND_ADD_1);
6489 target = expand_builtin_sync_operation (mode, exp, PLUS,
6490 false, target, ignore);
6495 case BUILT_IN_FETCH_AND_SUB_1:
6496 case BUILT_IN_FETCH_AND_SUB_2:
6497 case BUILT_IN_FETCH_AND_SUB_4:
6498 case BUILT_IN_FETCH_AND_SUB_8:
6499 case BUILT_IN_FETCH_AND_SUB_16:
6500 mode = get_builtin_sync_mode (fcode - BUILT_IN_FETCH_AND_SUB_1);
6501 target = expand_builtin_sync_operation (mode, exp, MINUS,
6502 false, target, ignore);
6507 case BUILT_IN_FETCH_AND_OR_1:
6508 case BUILT_IN_FETCH_AND_OR_2:
6509 case BUILT_IN_FETCH_AND_OR_4:
6510 case BUILT_IN_FETCH_AND_OR_8:
6511 case BUILT_IN_FETCH_AND_OR_16:
6512 mode = get_builtin_sync_mode (fcode - BUILT_IN_FETCH_AND_OR_1);
6513 target = expand_builtin_sync_operation (mode, exp, IOR,
6514 false, target, ignore);
6519 case BUILT_IN_FETCH_AND_AND_1:
6520 case BUILT_IN_FETCH_AND_AND_2:
6521 case BUILT_IN_FETCH_AND_AND_4:
6522 case BUILT_IN_FETCH_AND_AND_8:
6523 case BUILT_IN_FETCH_AND_AND_16:
6524 mode = get_builtin_sync_mode (fcode - BUILT_IN_FETCH_AND_AND_1);
6525 target = expand_builtin_sync_operation (mode, exp, AND,
6526 false, target, ignore);
6531 case BUILT_IN_FETCH_AND_XOR_1:
6532 case BUILT_IN_FETCH_AND_XOR_2:
6533 case BUILT_IN_FETCH_AND_XOR_4:
6534 case BUILT_IN_FETCH_AND_XOR_8:
6535 case BUILT_IN_FETCH_AND_XOR_16:
6536 mode = get_builtin_sync_mode (fcode - BUILT_IN_FETCH_AND_XOR_1);
6537 target = expand_builtin_sync_operation (mode, exp, XOR,
6538 false, target, ignore);
6543 case BUILT_IN_FETCH_AND_NAND_1:
6544 case BUILT_IN_FETCH_AND_NAND_2:
6545 case BUILT_IN_FETCH_AND_NAND_4:
6546 case BUILT_IN_FETCH_AND_NAND_8:
6547 case BUILT_IN_FETCH_AND_NAND_16:
6548 mode = get_builtin_sync_mode (fcode - BUILT_IN_FETCH_AND_NAND_1);
6549 target = expand_builtin_sync_operation (mode, exp, NOT,
6550 false, target, ignore);
6555 case BUILT_IN_ADD_AND_FETCH_1:
6556 case BUILT_IN_ADD_AND_FETCH_2:
6557 case BUILT_IN_ADD_AND_FETCH_4:
6558 case BUILT_IN_ADD_AND_FETCH_8:
6559 case BUILT_IN_ADD_AND_FETCH_16:
6560 mode = get_builtin_sync_mode (fcode - BUILT_IN_ADD_AND_FETCH_1);
6561 target = expand_builtin_sync_operation (mode, exp, PLUS,
6562 true, target, ignore);
6567 case BUILT_IN_SUB_AND_FETCH_1:
6568 case BUILT_IN_SUB_AND_FETCH_2:
6569 case BUILT_IN_SUB_AND_FETCH_4:
6570 case BUILT_IN_SUB_AND_FETCH_8:
6571 case BUILT_IN_SUB_AND_FETCH_16:
6572 mode = get_builtin_sync_mode (fcode - BUILT_IN_SUB_AND_FETCH_1);
6573 target = expand_builtin_sync_operation (mode, exp, MINUS,
6574 true, target, ignore);
6579 case BUILT_IN_OR_AND_FETCH_1:
6580 case BUILT_IN_OR_AND_FETCH_2:
6581 case BUILT_IN_OR_AND_FETCH_4:
6582 case BUILT_IN_OR_AND_FETCH_8:
6583 case BUILT_IN_OR_AND_FETCH_16:
6584 mode = get_builtin_sync_mode (fcode - BUILT_IN_OR_AND_FETCH_1);
6585 target = expand_builtin_sync_operation (mode, exp, IOR,
6586 true, target, ignore);
6591 case BUILT_IN_AND_AND_FETCH_1:
6592 case BUILT_IN_AND_AND_FETCH_2:
6593 case BUILT_IN_AND_AND_FETCH_4:
6594 case BUILT_IN_AND_AND_FETCH_8:
6595 case BUILT_IN_AND_AND_FETCH_16:
6596 mode = get_builtin_sync_mode (fcode - BUILT_IN_AND_AND_FETCH_1);
6597 target = expand_builtin_sync_operation (mode, exp, AND,
6598 true, target, ignore);
6603 case BUILT_IN_XOR_AND_FETCH_1:
6604 case BUILT_IN_XOR_AND_FETCH_2:
6605 case BUILT_IN_XOR_AND_FETCH_4:
6606 case BUILT_IN_XOR_AND_FETCH_8:
6607 case BUILT_IN_XOR_AND_FETCH_16:
6608 mode = get_builtin_sync_mode (fcode - BUILT_IN_XOR_AND_FETCH_1);
6609 target = expand_builtin_sync_operation (mode, exp, XOR,
6610 true, target, ignore);
6615 case BUILT_IN_NAND_AND_FETCH_1:
6616 case BUILT_IN_NAND_AND_FETCH_2:
6617 case BUILT_IN_NAND_AND_FETCH_4:
6618 case BUILT_IN_NAND_AND_FETCH_8:
6619 case BUILT_IN_NAND_AND_FETCH_16:
6620 mode = get_builtin_sync_mode (fcode - BUILT_IN_NAND_AND_FETCH_1);
6621 target = expand_builtin_sync_operation (mode, exp, NOT,
6622 true, target, ignore);
6627 case BUILT_IN_BOOL_COMPARE_AND_SWAP_1:
6628 case BUILT_IN_BOOL_COMPARE_AND_SWAP_2:
6629 case BUILT_IN_BOOL_COMPARE_AND_SWAP_4:
6630 case BUILT_IN_BOOL_COMPARE_AND_SWAP_8:
6631 case BUILT_IN_BOOL_COMPARE_AND_SWAP_16:
6632 if (mode == VOIDmode)
6633 mode = TYPE_MODE (boolean_type_node);
6634 if (!target || !register_operand (target, mode))
6635 target = gen_reg_rtx (mode);
6637 mode = get_builtin_sync_mode (fcode - BUILT_IN_BOOL_COMPARE_AND_SWAP_1);
6638 target = expand_builtin_compare_and_swap (mode, exp, true, target);
6643 case BUILT_IN_VAL_COMPARE_AND_SWAP_1:
6644 case BUILT_IN_VAL_COMPARE_AND_SWAP_2:
6645 case BUILT_IN_VAL_COMPARE_AND_SWAP_4:
6646 case BUILT_IN_VAL_COMPARE_AND_SWAP_8:
6647 case BUILT_IN_VAL_COMPARE_AND_SWAP_16:
6648 mode = get_builtin_sync_mode (fcode - BUILT_IN_VAL_COMPARE_AND_SWAP_1);
6649 target = expand_builtin_compare_and_swap (mode, exp, false, target);
6654 case BUILT_IN_LOCK_TEST_AND_SET_1:
6655 case BUILT_IN_LOCK_TEST_AND_SET_2:
6656 case BUILT_IN_LOCK_TEST_AND_SET_4:
6657 case BUILT_IN_LOCK_TEST_AND_SET_8:
6658 case BUILT_IN_LOCK_TEST_AND_SET_16:
6659 mode = get_builtin_sync_mode (fcode - BUILT_IN_LOCK_TEST_AND_SET_1);
6660 target = expand_builtin_lock_test_and_set (mode, exp, target);
6665 case BUILT_IN_LOCK_RELEASE_1:
6666 case BUILT_IN_LOCK_RELEASE_2:
6667 case BUILT_IN_LOCK_RELEASE_4:
6668 case BUILT_IN_LOCK_RELEASE_8:
6669 case BUILT_IN_LOCK_RELEASE_16:
6670 mode = get_builtin_sync_mode (fcode - BUILT_IN_LOCK_RELEASE_1);
6671 expand_builtin_lock_release (mode, exp);
6674 case BUILT_IN_SYNCHRONIZE:
6675 expand_builtin_synchronize ();
6678 case BUILT_IN_OBJECT_SIZE:
6679 return expand_builtin_object_size (exp);
6681 case BUILT_IN_MEMCPY_CHK:
6682 case BUILT_IN_MEMPCPY_CHK:
6683 case BUILT_IN_MEMMOVE_CHK:
6684 case BUILT_IN_MEMSET_CHK:
6685 target = expand_builtin_memory_chk (exp, target, mode, fcode);
6690 case BUILT_IN_STRCPY_CHK:
6691 case BUILT_IN_STPCPY_CHK:
6692 case BUILT_IN_STRNCPY_CHK:
6693 case BUILT_IN_STRCAT_CHK:
6694 case BUILT_IN_STRNCAT_CHK:
6695 case BUILT_IN_SNPRINTF_CHK:
6696 case BUILT_IN_VSNPRINTF_CHK:
6697 maybe_emit_chk_warning (exp, fcode);
6700 case BUILT_IN_SPRINTF_CHK:
6701 case BUILT_IN_VSPRINTF_CHK:
6702 maybe_emit_sprintf_chk_warning (exp, fcode);
6706 maybe_emit_free_warning (exp);
6709 default: /* just do library call, if unknown builtin */
6713 /* The switch statement above can drop through to cause the function
6714 to be called normally. */
6715 return expand_call (exp, target, ignore);
6718 /* Determine whether a tree node represents a call to a built-in
6719 function. If the tree T is a call to a built-in function with
6720 the right number of arguments of the appropriate types, return
6721 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
6722 Otherwise the return value is END_BUILTINS. */
6724 enum built_in_function
6725 builtin_mathfn_code (const_tree t)
6727 const_tree fndecl, arg, parmlist;
6728 const_tree argtype, parmtype;
6729 const_call_expr_arg_iterator iter;
6731 if (TREE_CODE (t) != CALL_EXPR
6732 || TREE_CODE (CALL_EXPR_FN (t)) != ADDR_EXPR)
6733 return END_BUILTINS;
6735 fndecl = get_callee_fndecl (t);
6736 if (fndecl == NULL_TREE
6737 || TREE_CODE (fndecl) != FUNCTION_DECL
6738 || ! DECL_BUILT_IN (fndecl)
6739 || DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
6740 return END_BUILTINS;
6742 parmlist = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
6743 init_const_call_expr_arg_iterator (t, &iter);
6744 for (; parmlist; parmlist = TREE_CHAIN (parmlist))
6746 /* If a function doesn't take a variable number of arguments,
6747 the last element in the list will have type `void'. */
6748 parmtype = TREE_VALUE (parmlist);
6749 if (VOID_TYPE_P (parmtype))
6751 if (more_const_call_expr_args_p (&iter))
6752 return END_BUILTINS;
6753 return DECL_FUNCTION_CODE (fndecl);
6756 if (! more_const_call_expr_args_p (&iter))
6757 return END_BUILTINS;
6759 arg = next_const_call_expr_arg (&iter);
6760 argtype = TREE_TYPE (arg);
6762 if (SCALAR_FLOAT_TYPE_P (parmtype))
6764 if (! SCALAR_FLOAT_TYPE_P (argtype))
6765 return END_BUILTINS;
6767 else if (COMPLEX_FLOAT_TYPE_P (parmtype))
6769 if (! COMPLEX_FLOAT_TYPE_P (argtype))
6770 return END_BUILTINS;
6772 else if (POINTER_TYPE_P (parmtype))
6774 if (! POINTER_TYPE_P (argtype))
6775 return END_BUILTINS;
6777 else if (INTEGRAL_TYPE_P (parmtype))
6779 if (! INTEGRAL_TYPE_P (argtype))
6780 return END_BUILTINS;
6783 return END_BUILTINS;
6786 /* Variable-length argument list. */
6787 return DECL_FUNCTION_CODE (fndecl);
6790 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
6791 evaluate to a constant. */
6794 fold_builtin_constant_p (tree arg)
6796 /* We return 1 for a numeric type that's known to be a constant
6797 value at compile-time or for an aggregate type that's a
6798 literal constant. */
6801 /* If we know this is a constant, emit the constant of one. */
6802 if (CONSTANT_CLASS_P (arg)
6803 || (TREE_CODE (arg) == CONSTRUCTOR
6804 && TREE_CONSTANT (arg)))
6805 return integer_one_node;
6806 if (TREE_CODE (arg) == ADDR_EXPR)
6808 tree op = TREE_OPERAND (arg, 0);
6809 if (TREE_CODE (op) == STRING_CST
6810 || (TREE_CODE (op) == ARRAY_REF
6811 && integer_zerop (TREE_OPERAND (op, 1))
6812 && TREE_CODE (TREE_OPERAND (op, 0)) == STRING_CST))
6813 return integer_one_node;
6816 /* If this expression has side effects, show we don't know it to be a
6817 constant. Likewise if it's a pointer or aggregate type since in
6818 those case we only want literals, since those are only optimized
6819 when generating RTL, not later.
6820 And finally, if we are compiling an initializer, not code, we
6821 need to return a definite result now; there's not going to be any
6822 more optimization done. */
6823 if (TREE_SIDE_EFFECTS (arg)
6824 || AGGREGATE_TYPE_P (TREE_TYPE (arg))
6825 || POINTER_TYPE_P (TREE_TYPE (arg))
6827 || folding_initializer)
6828 return integer_zero_node;
6833 /* Create builtin_expect with PRED and EXPECTED as its arguments and
6834 return it as a truthvalue. */
6837 build_builtin_expect_predicate (location_t loc, tree pred, tree expected)
6839 tree fn, arg_types, pred_type, expected_type, call_expr, ret_type;
6841 fn = built_in_decls[BUILT_IN_EXPECT];
6842 arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn));
6843 ret_type = TREE_TYPE (TREE_TYPE (fn));
6844 pred_type = TREE_VALUE (arg_types);
6845 expected_type = TREE_VALUE (TREE_CHAIN (arg_types));
6847 pred = fold_convert_loc (loc, pred_type, pred);
6848 expected = fold_convert_loc (loc, expected_type, expected);
6849 call_expr = build_call_expr_loc (loc, fn, 2, pred, expected);
6851 return build2 (NE_EXPR, TREE_TYPE (pred), call_expr,
6852 build_int_cst (ret_type, 0));
6855 /* Fold a call to builtin_expect with arguments ARG0 and ARG1. Return
6856 NULL_TREE if no simplification is possible. */
6859 fold_builtin_expect (location_t loc, tree arg0, tree arg1)
6862 enum tree_code code;
6864 /* If this is a builtin_expect within a builtin_expect keep the
6865 inner one. See through a comparison against a constant. It
6866 might have been added to create a thruthvalue. */
6868 if (COMPARISON_CLASS_P (inner)
6869 && TREE_CODE (TREE_OPERAND (inner, 1)) == INTEGER_CST)
6870 inner = TREE_OPERAND (inner, 0);
6872 if (TREE_CODE (inner) == CALL_EXPR
6873 && (fndecl = get_callee_fndecl (inner))
6874 && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
6875 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_EXPECT)
6878 /* Distribute the expected value over short-circuiting operators.
6879 See through the cast from truthvalue_type_node to long. */
6881 while (TREE_CODE (inner) == NOP_EXPR
6882 && INTEGRAL_TYPE_P (TREE_TYPE (inner))
6883 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (inner, 0))))
6884 inner = TREE_OPERAND (inner, 0);
6886 code = TREE_CODE (inner);
6887 if (code == TRUTH_ANDIF_EXPR || code == TRUTH_ORIF_EXPR)
6889 tree op0 = TREE_OPERAND (inner, 0);
6890 tree op1 = TREE_OPERAND (inner, 1);
6892 op0 = build_builtin_expect_predicate (loc, op0, arg1);
6893 op1 = build_builtin_expect_predicate (loc, op1, arg1);
6894 inner = build2 (code, TREE_TYPE (inner), op0, op1);
6896 return fold_convert_loc (loc, TREE_TYPE (arg0), inner);
6899 /* If the argument isn't invariant then there's nothing else we can do. */
6900 if (!TREE_CONSTANT (arg0))
6903 /* If we expect that a comparison against the argument will fold to
6904 a constant return the constant. In practice, this means a true
6905 constant or the address of a non-weak symbol. */
6908 if (TREE_CODE (inner) == ADDR_EXPR)
6912 inner = TREE_OPERAND (inner, 0);
6914 while (TREE_CODE (inner) == COMPONENT_REF
6915 || TREE_CODE (inner) == ARRAY_REF);
6916 if ((TREE_CODE (inner) == VAR_DECL
6917 || TREE_CODE (inner) == FUNCTION_DECL)
6918 && DECL_WEAK (inner))
6922 /* Otherwise, ARG0 already has the proper type for the return value. */
6926 /* Fold a call to __builtin_classify_type with argument ARG. */
6929 fold_builtin_classify_type (tree arg)
6932 return build_int_cst (NULL_TREE, no_type_class);
6934 return build_int_cst (NULL_TREE, type_to_class (TREE_TYPE (arg)));
6937 /* Fold a call to __builtin_strlen with argument ARG. */
6940 fold_builtin_strlen (location_t loc, tree arg)
6942 if (!validate_arg (arg, POINTER_TYPE))
6946 tree len = c_strlen (arg, 0);
6950 /* Convert from the internal "sizetype" type to "size_t". */
6952 len = fold_convert_loc (loc, size_type_node, len);
6960 /* Fold a call to __builtin_inf or __builtin_huge_val. */
6963 fold_builtin_inf (location_t loc, tree type, int warn)
6965 REAL_VALUE_TYPE real;
6967 /* __builtin_inff is intended to be usable to define INFINITY on all
6968 targets. If an infinity is not available, INFINITY expands "to a
6969 positive constant of type float that overflows at translation
6970 time", footnote "In this case, using INFINITY will violate the
6971 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
6972 Thus we pedwarn to ensure this constraint violation is
6974 if (!MODE_HAS_INFINITIES (TYPE_MODE (type)) && warn)
6975 pedwarn (loc, 0, "target format does not support infinity");
6978 return build_real (type, real);
6981 /* Fold a call to __builtin_nan or __builtin_nans with argument ARG. */
6984 fold_builtin_nan (tree arg, tree type, int quiet)
6986 REAL_VALUE_TYPE real;
6989 if (!validate_arg (arg, POINTER_TYPE))
6991 str = c_getstr (arg);
6995 if (!real_nan (&real, str, quiet, TYPE_MODE (type)))
6998 return build_real (type, real);
7001 /* Return true if the floating point expression T has an integer value.
7002 We also allow +Inf, -Inf and NaN to be considered integer values. */
7005 integer_valued_real_p (tree t)
7007 switch (TREE_CODE (t))
7014 return integer_valued_real_p (TREE_OPERAND (t, 0));
7019 return integer_valued_real_p (TREE_OPERAND (t, 1));
7026 return integer_valued_real_p (TREE_OPERAND (t, 0))
7027 && integer_valued_real_p (TREE_OPERAND (t, 1));
7030 return integer_valued_real_p (TREE_OPERAND (t, 1))
7031 && integer_valued_real_p (TREE_OPERAND (t, 2));
7034 return real_isinteger (TREE_REAL_CST_PTR (t), TYPE_MODE (TREE_TYPE (t)));
7038 tree type = TREE_TYPE (TREE_OPERAND (t, 0));
7039 if (TREE_CODE (type) == INTEGER_TYPE)
7041 if (TREE_CODE (type) == REAL_TYPE)
7042 return integer_valued_real_p (TREE_OPERAND (t, 0));
7047 switch (builtin_mathfn_code (t))
7049 CASE_FLT_FN (BUILT_IN_CEIL):
7050 CASE_FLT_FN (BUILT_IN_FLOOR):
7051 CASE_FLT_FN (BUILT_IN_NEARBYINT):
7052 CASE_FLT_FN (BUILT_IN_RINT):
7053 CASE_FLT_FN (BUILT_IN_ROUND):
7054 CASE_FLT_FN (BUILT_IN_TRUNC):
7057 CASE_FLT_FN (BUILT_IN_FMIN):
7058 CASE_FLT_FN (BUILT_IN_FMAX):
7059 return integer_valued_real_p (CALL_EXPR_ARG (t, 0))
7060 && integer_valued_real_p (CALL_EXPR_ARG (t, 1));
7073 /* FNDECL is assumed to be a builtin where truncation can be propagated
7074 across (for instance floor((double)f) == (double)floorf (f).
7075 Do the transformation for a call with argument ARG. */
7078 fold_trunc_transparent_mathfn (location_t loc, tree fndecl, tree arg)
7080 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
7082 if (!validate_arg (arg, REAL_TYPE))
7085 /* Integer rounding functions are idempotent. */
7086 if (fcode == builtin_mathfn_code (arg))
7089 /* If argument is already integer valued, and we don't need to worry
7090 about setting errno, there's no need to perform rounding. */
7091 if (! flag_errno_math && integer_valued_real_p (arg))
7096 tree arg0 = strip_float_extensions (arg);
7097 tree ftype = TREE_TYPE (TREE_TYPE (fndecl));
7098 tree newtype = TREE_TYPE (arg0);
7101 if (TYPE_PRECISION (newtype) < TYPE_PRECISION (ftype)
7102 && (decl = mathfn_built_in (newtype, fcode)))
7103 return fold_convert_loc (loc, ftype,
7104 build_call_expr_loc (loc, decl, 1,
7105 fold_convert_loc (loc,
7112 /* FNDECL is assumed to be builtin which can narrow the FP type of
7113 the argument, for instance lround((double)f) -> lroundf (f).
7114 Do the transformation for a call with argument ARG. */
7117 fold_fixed_mathfn (location_t loc, tree fndecl, tree arg)
7119 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
7121 if (!validate_arg (arg, REAL_TYPE))
7124 /* If argument is already integer valued, and we don't need to worry
7125 about setting errno, there's no need to perform rounding. */
7126 if (! flag_errno_math && integer_valued_real_p (arg))
7127 return fold_build1_loc (loc, FIX_TRUNC_EXPR,
7128 TREE_TYPE (TREE_TYPE (fndecl)), arg);
7132 tree ftype = TREE_TYPE (arg);
7133 tree arg0 = strip_float_extensions (arg);
7134 tree newtype = TREE_TYPE (arg0);
7137 if (TYPE_PRECISION (newtype) < TYPE_PRECISION (ftype)
7138 && (decl = mathfn_built_in (newtype, fcode)))
7139 return build_call_expr_loc (loc, decl, 1,
7140 fold_convert_loc (loc, newtype, arg0));
7143 /* Canonicalize llround (x) to lround (x) on LP64 targets where
7144 sizeof (long long) == sizeof (long). */
7145 if (TYPE_PRECISION (long_long_integer_type_node)
7146 == TYPE_PRECISION (long_integer_type_node))
7148 tree newfn = NULL_TREE;
7151 CASE_FLT_FN (BUILT_IN_LLCEIL):
7152 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LCEIL);
7155 CASE_FLT_FN (BUILT_IN_LLFLOOR):
7156 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LFLOOR);
7159 CASE_FLT_FN (BUILT_IN_LLROUND):
7160 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LROUND);
7163 CASE_FLT_FN (BUILT_IN_LLRINT):
7164 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LRINT);
7173 tree newcall = build_call_expr_loc (loc, newfn, 1, arg);
7174 return fold_convert_loc (loc,
7175 TREE_TYPE (TREE_TYPE (fndecl)), newcall);
7182 /* Fold call to builtin cabs, cabsf or cabsl with argument ARG. TYPE is the
7183 return type. Return NULL_TREE if no simplification can be made. */
7186 fold_builtin_cabs (location_t loc, tree arg, tree type, tree fndecl)
7190 if (!validate_arg (arg, COMPLEX_TYPE)
7191 || TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) != REAL_TYPE)
7194 /* Calculate the result when the argument is a constant. */
7195 if (TREE_CODE (arg) == COMPLEX_CST
7196 && (res = do_mpfr_arg2 (TREE_REALPART (arg), TREE_IMAGPART (arg),
7200 if (TREE_CODE (arg) == COMPLEX_EXPR)
7202 tree real = TREE_OPERAND (arg, 0);
7203 tree imag = TREE_OPERAND (arg, 1);
7205 /* If either part is zero, cabs is fabs of the other. */
7206 if (real_zerop (real))
7207 return fold_build1_loc (loc, ABS_EXPR, type, imag);
7208 if (real_zerop (imag))
7209 return fold_build1_loc (loc, ABS_EXPR, type, real);
7211 /* cabs(x+xi) -> fabs(x)*sqrt(2). */
7212 if (flag_unsafe_math_optimizations
7213 && operand_equal_p (real, imag, OEP_PURE_SAME))
7215 const REAL_VALUE_TYPE sqrt2_trunc
7216 = real_value_truncate (TYPE_MODE (type), dconst_sqrt2 ());
7218 return fold_build2_loc (loc, MULT_EXPR, type,
7219 fold_build1_loc (loc, ABS_EXPR, type, real),
7220 build_real (type, sqrt2_trunc));
7224 /* Optimize cabs(-z) and cabs(conj(z)) as cabs(z). */
7225 if (TREE_CODE (arg) == NEGATE_EXPR
7226 || TREE_CODE (arg) == CONJ_EXPR)
7227 return build_call_expr_loc (loc, fndecl, 1, TREE_OPERAND (arg, 0));
7229 /* Don't do this when optimizing for size. */
7230 if (flag_unsafe_math_optimizations
7231 && optimize && optimize_function_for_speed_p (cfun))
7233 tree sqrtfn = mathfn_built_in (type, BUILT_IN_SQRT);
7235 if (sqrtfn != NULL_TREE)
7237 tree rpart, ipart, result;
7239 arg = builtin_save_expr (arg);
7241 rpart = fold_build1_loc (loc, REALPART_EXPR, type, arg);
7242 ipart = fold_build1_loc (loc, IMAGPART_EXPR, type, arg);
7244 rpart = builtin_save_expr (rpart);
7245 ipart = builtin_save_expr (ipart);
7247 result = fold_build2_loc (loc, PLUS_EXPR, type,
7248 fold_build2_loc (loc, MULT_EXPR, type,
7250 fold_build2_loc (loc, MULT_EXPR, type,
7253 return build_call_expr_loc (loc, sqrtfn, 1, result);
7260 /* Fold a builtin function call to sqrt, sqrtf, or sqrtl with argument ARG.
7261 Return NULL_TREE if no simplification can be made. */
7264 fold_builtin_sqrt (location_t loc, tree arg, tree type)
7267 enum built_in_function fcode;
7270 if (!validate_arg (arg, REAL_TYPE))
7273 /* Calculate the result when the argument is a constant. */
7274 if ((res = do_mpfr_arg1 (arg, type, mpfr_sqrt, &dconst0, NULL, true)))
7277 /* Optimize sqrt(expN(x)) = expN(x*0.5). */
7278 fcode = builtin_mathfn_code (arg);
7279 if (flag_unsafe_math_optimizations && BUILTIN_EXPONENT_P (fcode))
7281 tree expfn = TREE_OPERAND (CALL_EXPR_FN (arg), 0);
7282 arg = fold_build2_loc (loc, MULT_EXPR, type,
7283 CALL_EXPR_ARG (arg, 0),
7284 build_real (type, dconsthalf));
7285 return build_call_expr_loc (loc, expfn, 1, arg);
7288 /* Optimize sqrt(Nroot(x)) -> pow(x,1/(2*N)). */
7289 if (flag_unsafe_math_optimizations && BUILTIN_ROOT_P (fcode))
7291 tree powfn = mathfn_built_in (type, BUILT_IN_POW);
7295 tree arg0 = CALL_EXPR_ARG (arg, 0);
7297 /* The inner root was either sqrt or cbrt. */
7298 /* This was a conditional expression but it triggered a bug
7300 REAL_VALUE_TYPE dconstroot;
7301 if (BUILTIN_SQRT_P (fcode))
7302 dconstroot = dconsthalf;
7304 dconstroot = dconst_third ();
7306 /* Adjust for the outer root. */
7307 SET_REAL_EXP (&dconstroot, REAL_EXP (&dconstroot) - 1);
7308 dconstroot = real_value_truncate (TYPE_MODE (type), dconstroot);
7309 tree_root = build_real (type, dconstroot);
7310 return build_call_expr_loc (loc, powfn, 2, arg0, tree_root);
7314 /* Optimize sqrt(pow(x,y)) = pow(|x|,y*0.5). */
7315 if (flag_unsafe_math_optimizations
7316 && (fcode == BUILT_IN_POW
7317 || fcode == BUILT_IN_POWF
7318 || fcode == BUILT_IN_POWL))
7320 tree powfn = TREE_OPERAND (CALL_EXPR_FN (arg), 0);
7321 tree arg0 = CALL_EXPR_ARG (arg, 0);
7322 tree arg1 = CALL_EXPR_ARG (arg, 1);
7324 if (!tree_expr_nonnegative_p (arg0))
7325 arg0 = build1 (ABS_EXPR, type, arg0);
7326 narg1 = fold_build2_loc (loc, MULT_EXPR, type, arg1,
7327 build_real (type, dconsthalf));
7328 return build_call_expr_loc (loc, powfn, 2, arg0, narg1);
7334 /* Fold a builtin function call to cbrt, cbrtf, or cbrtl with argument ARG.
7335 Return NULL_TREE if no simplification can be made. */
7338 fold_builtin_cbrt (location_t loc, tree arg, tree type)
7340 const enum built_in_function fcode = builtin_mathfn_code (arg);
7343 if (!validate_arg (arg, REAL_TYPE))
7346 /* Calculate the result when the argument is a constant. */
7347 if ((res = do_mpfr_arg1 (arg, type, mpfr_cbrt, NULL, NULL, 0)))
7350 if (flag_unsafe_math_optimizations)
7352 /* Optimize cbrt(expN(x)) -> expN(x/3). */
7353 if (BUILTIN_EXPONENT_P (fcode))
7355 tree expfn = TREE_OPERAND (CALL_EXPR_FN (arg), 0);
7356 const REAL_VALUE_TYPE third_trunc =
7357 real_value_truncate (TYPE_MODE (type), dconst_third ());
7358 arg = fold_build2_loc (loc, MULT_EXPR, type,
7359 CALL_EXPR_ARG (arg, 0),
7360 build_real (type, third_trunc));
7361 return build_call_expr_loc (loc, expfn, 1, arg);
7364 /* Optimize cbrt(sqrt(x)) -> pow(x,1/6). */
7365 if (BUILTIN_SQRT_P (fcode))
7367 tree powfn = mathfn_built_in (type, BUILT_IN_POW);
7371 tree arg0 = CALL_EXPR_ARG (arg, 0);
7373 REAL_VALUE_TYPE dconstroot = dconst_third ();
7375 SET_REAL_EXP (&dconstroot, REAL_EXP (&dconstroot) - 1);
7376 dconstroot = real_value_truncate (TYPE_MODE (type), dconstroot);
7377 tree_root = build_real (type, dconstroot);
7378 return build_call_expr_loc (loc, powfn, 2, arg0, tree_root);
7382 /* Optimize cbrt(cbrt(x)) -> pow(x,1/9) iff x is nonnegative. */
7383 if (BUILTIN_CBRT_P (fcode))
7385 tree arg0 = CALL_EXPR_ARG (arg, 0);
7386 if (tree_expr_nonnegative_p (arg0))
7388 tree powfn = mathfn_built_in (type, BUILT_IN_POW);
7393 REAL_VALUE_TYPE dconstroot;
7395 real_arithmetic (&dconstroot, MULT_EXPR,
7396 dconst_third_ptr (), dconst_third_ptr ());
7397 dconstroot = real_value_truncate (TYPE_MODE (type), dconstroot);
7398 tree_root = build_real (type, dconstroot);
7399 return build_call_expr_loc (loc, powfn, 2, arg0, tree_root);
7404 /* Optimize cbrt(pow(x,y)) -> pow(x,y/3) iff x is nonnegative. */
7405 if (fcode == BUILT_IN_POW
7406 || fcode == BUILT_IN_POWF
7407 || fcode == BUILT_IN_POWL)
7409 tree arg00 = CALL_EXPR_ARG (arg, 0);
7410 tree arg01 = CALL_EXPR_ARG (arg, 1);
7411 if (tree_expr_nonnegative_p (arg00))
7413 tree powfn = TREE_OPERAND (CALL_EXPR_FN (arg), 0);
7414 const REAL_VALUE_TYPE dconstroot
7415 = real_value_truncate (TYPE_MODE (type), dconst_third ());
7416 tree narg01 = fold_build2_loc (loc, MULT_EXPR, type, arg01,
7417 build_real (type, dconstroot));
7418 return build_call_expr_loc (loc, powfn, 2, arg00, narg01);
7425 /* Fold function call to builtin cos, cosf, or cosl with argument ARG.
7426 TYPE is the type of the return value. Return NULL_TREE if no
7427 simplification can be made. */
7430 fold_builtin_cos (location_t loc,
7431 tree arg, tree type, tree fndecl)
7435 if (!validate_arg (arg, REAL_TYPE))
7438 /* Calculate the result when the argument is a constant. */
7439 if ((res = do_mpfr_arg1 (arg, type, mpfr_cos, NULL, NULL, 0)))
7442 /* Optimize cos(-x) into cos (x). */
7443 if ((narg = fold_strip_sign_ops (arg)))
7444 return build_call_expr_loc (loc, fndecl, 1, narg);
7449 /* Fold function call to builtin cosh, coshf, or coshl with argument ARG.
7450 Return NULL_TREE if no simplification can be made. */
7453 fold_builtin_cosh (location_t loc, tree arg, tree type, tree fndecl)
7455 if (validate_arg (arg, REAL_TYPE))
7459 /* Calculate the result when the argument is a constant. */
7460 if ((res = do_mpfr_arg1 (arg, type, mpfr_cosh, NULL, NULL, 0)))
7463 /* Optimize cosh(-x) into cosh (x). */
7464 if ((narg = fold_strip_sign_ops (arg)))
7465 return build_call_expr_loc (loc, fndecl, 1, narg);
7471 /* Fold function call to builtin ccos (or ccosh if HYPER is TRUE) with
7472 argument ARG. TYPE is the type of the return value. Return
7473 NULL_TREE if no simplification can be made. */
7476 fold_builtin_ccos (location_t loc,
7477 tree arg, tree type ATTRIBUTE_UNUSED, tree fndecl,
7478 bool hyper ATTRIBUTE_UNUSED)
7480 if (validate_arg (arg, COMPLEX_TYPE)
7481 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) == REAL_TYPE)
7486 /* Calculate the result when the argument is a constant. */
7487 if ((tmp = do_mpc_arg1 (arg, type, (hyper ? mpc_cosh : mpc_cos))))
7491 /* Optimize fn(-x) into fn(x). */
7492 if ((tmp = fold_strip_sign_ops (arg)))
7493 return build_call_expr_loc (loc, fndecl, 1, tmp);
7499 /* Fold function call to builtin tan, tanf, or tanl with argument ARG.
7500 Return NULL_TREE if no simplification can be made. */
7503 fold_builtin_tan (tree arg, tree type)
7505 enum built_in_function fcode;
7508 if (!validate_arg (arg, REAL_TYPE))
7511 /* Calculate the result when the argument is a constant. */
7512 if ((res = do_mpfr_arg1 (arg, type, mpfr_tan, NULL, NULL, 0)))
7515 /* Optimize tan(atan(x)) = x. */
7516 fcode = builtin_mathfn_code (arg);
7517 if (flag_unsafe_math_optimizations
7518 && (fcode == BUILT_IN_ATAN
7519 || fcode == BUILT_IN_ATANF
7520 || fcode == BUILT_IN_ATANL))
7521 return CALL_EXPR_ARG (arg, 0);
7526 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
7527 NULL_TREE if no simplification can be made. */
7530 fold_builtin_sincos (location_t loc,
7531 tree arg0, tree arg1, tree arg2)
7536 if (!validate_arg (arg0, REAL_TYPE)
7537 || !validate_arg (arg1, POINTER_TYPE)
7538 || !validate_arg (arg2, POINTER_TYPE))
7541 type = TREE_TYPE (arg0);
7543 /* Calculate the result when the argument is a constant. */
7544 if ((res = do_mpfr_sincos (arg0, arg1, arg2)))
7547 /* Canonicalize sincos to cexpi. */
7548 if (!TARGET_C99_FUNCTIONS)
7550 fn = mathfn_built_in (type, BUILT_IN_CEXPI);
7554 call = build_call_expr_loc (loc, fn, 1, arg0);
7555 call = builtin_save_expr (call);
7557 return build2 (COMPOUND_EXPR, void_type_node,
7558 build2 (MODIFY_EXPR, void_type_node,
7559 build_fold_indirect_ref_loc (loc, arg1),
7560 build1 (IMAGPART_EXPR, type, call)),
7561 build2 (MODIFY_EXPR, void_type_node,
7562 build_fold_indirect_ref_loc (loc, arg2),
7563 build1 (REALPART_EXPR, type, call)));
7566 /* Fold function call to builtin cexp, cexpf, or cexpl. Return
7567 NULL_TREE if no simplification can be made. */
7570 fold_builtin_cexp (location_t loc, tree arg0, tree type)
7573 tree realp, imagp, ifn;
7578 if (!validate_arg (arg0, COMPLEX_TYPE)
7579 || TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) != REAL_TYPE)
7583 /* Calculate the result when the argument is a constant. */
7584 if ((res = do_mpc_arg1 (arg0, type, mpc_exp)))
7588 rtype = TREE_TYPE (TREE_TYPE (arg0));
7590 /* In case we can figure out the real part of arg0 and it is constant zero
7592 if (!TARGET_C99_FUNCTIONS)
7594 ifn = mathfn_built_in (rtype, BUILT_IN_CEXPI);
7598 if ((realp = fold_unary_loc (loc, REALPART_EXPR, rtype, arg0))
7599 && real_zerop (realp))
7601 tree narg = fold_build1_loc (loc, IMAGPART_EXPR, rtype, arg0);
7602 return build_call_expr_loc (loc, ifn, 1, narg);
7605 /* In case we can easily decompose real and imaginary parts split cexp
7606 to exp (r) * cexpi (i). */
7607 if (flag_unsafe_math_optimizations
7610 tree rfn, rcall, icall;
7612 rfn = mathfn_built_in (rtype, BUILT_IN_EXP);
7616 imagp = fold_unary_loc (loc, IMAGPART_EXPR, rtype, arg0);
7620 icall = build_call_expr_loc (loc, ifn, 1, imagp);
7621 icall = builtin_save_expr (icall);
7622 rcall = build_call_expr_loc (loc, rfn, 1, realp);
7623 rcall = builtin_save_expr (rcall);
7624 return fold_build2_loc (loc, COMPLEX_EXPR, type,
7625 fold_build2_loc (loc, MULT_EXPR, rtype,
7627 fold_build1_loc (loc, REALPART_EXPR,
7629 fold_build2_loc (loc, MULT_EXPR, rtype,
7631 fold_build1_loc (loc, IMAGPART_EXPR,
7638 /* Fold function call to builtin trunc, truncf or truncl with argument ARG.
7639 Return NULL_TREE if no simplification can be made. */
7642 fold_builtin_trunc (location_t loc, tree fndecl, tree arg)
7644 if (!validate_arg (arg, REAL_TYPE))
7647 /* Optimize trunc of constant value. */
7648 if (TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
7650 REAL_VALUE_TYPE r, x;
7651 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7653 x = TREE_REAL_CST (arg);
7654 real_trunc (&r, TYPE_MODE (type), &x);
7655 return build_real (type, r);
7658 return fold_trunc_transparent_mathfn (loc, fndecl, arg);
7661 /* Fold function call to builtin floor, floorf or floorl with argument ARG.
7662 Return NULL_TREE if no simplification can be made. */
7665 fold_builtin_floor (location_t loc, tree fndecl, tree arg)
7667 if (!validate_arg (arg, REAL_TYPE))
7670 /* Optimize floor of constant value. */
7671 if (TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
7675 x = TREE_REAL_CST (arg);
7676 if (! REAL_VALUE_ISNAN (x) || ! flag_errno_math)
7678 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7681 real_floor (&r, TYPE_MODE (type), &x);
7682 return build_real (type, r);
7686 /* Fold floor (x) where x is nonnegative to trunc (x). */
7687 if (tree_expr_nonnegative_p (arg))
7689 tree truncfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_TRUNC);
7691 return build_call_expr_loc (loc, truncfn, 1, arg);
7694 return fold_trunc_transparent_mathfn (loc, fndecl, arg);
7697 /* Fold function call to builtin ceil, ceilf or ceill with argument ARG.
7698 Return NULL_TREE if no simplification can be made. */
7701 fold_builtin_ceil (location_t loc, tree fndecl, tree arg)
7703 if (!validate_arg (arg, REAL_TYPE))
7706 /* Optimize ceil of constant value. */
7707 if (TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
7711 x = TREE_REAL_CST (arg);
7712 if (! REAL_VALUE_ISNAN (x) || ! flag_errno_math)
7714 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7717 real_ceil (&r, TYPE_MODE (type), &x);
7718 return build_real (type, r);
7722 return fold_trunc_transparent_mathfn (loc, fndecl, arg);
7725 /* Fold function call to builtin round, roundf or roundl with argument ARG.
7726 Return NULL_TREE if no simplification can be made. */
7729 fold_builtin_round (location_t loc, tree fndecl, tree arg)
7731 if (!validate_arg (arg, REAL_TYPE))
7734 /* Optimize round of constant value. */
7735 if (TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
7739 x = TREE_REAL_CST (arg);
7740 if (! REAL_VALUE_ISNAN (x) || ! flag_errno_math)
7742 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7745 real_round (&r, TYPE_MODE (type), &x);
7746 return build_real (type, r);
7750 return fold_trunc_transparent_mathfn (loc, fndecl, arg);
7753 /* Fold function call to builtin lround, lroundf or lroundl (or the
7754 corresponding long long versions) and other rounding functions. ARG
7755 is the argument to the call. Return NULL_TREE if no simplification
7759 fold_builtin_int_roundingfn (location_t loc, tree fndecl, tree arg)
7761 if (!validate_arg (arg, REAL_TYPE))
7764 /* Optimize lround of constant value. */
7765 if (TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
7767 const REAL_VALUE_TYPE x = TREE_REAL_CST (arg);
7769 if (real_isfinite (&x))
7771 tree itype = TREE_TYPE (TREE_TYPE (fndecl));
7772 tree ftype = TREE_TYPE (arg);
7773 unsigned HOST_WIDE_INT lo2;
7774 HOST_WIDE_INT hi, lo;
7777 switch (DECL_FUNCTION_CODE (fndecl))
7779 CASE_FLT_FN (BUILT_IN_LFLOOR):
7780 CASE_FLT_FN (BUILT_IN_LLFLOOR):
7781 real_floor (&r, TYPE_MODE (ftype), &x);
7784 CASE_FLT_FN (BUILT_IN_LCEIL):
7785 CASE_FLT_FN (BUILT_IN_LLCEIL):
7786 real_ceil (&r, TYPE_MODE (ftype), &x);
7789 CASE_FLT_FN (BUILT_IN_LROUND):
7790 CASE_FLT_FN (BUILT_IN_LLROUND):
7791 real_round (&r, TYPE_MODE (ftype), &x);
7798 REAL_VALUE_TO_INT (&lo, &hi, r);
7799 if (!fit_double_type (lo, hi, &lo2, &hi, itype))
7800 return build_int_cst_wide (itype, lo2, hi);
7804 switch (DECL_FUNCTION_CODE (fndecl))
7806 CASE_FLT_FN (BUILT_IN_LFLOOR):
7807 CASE_FLT_FN (BUILT_IN_LLFLOOR):
7808 /* Fold lfloor (x) where x is nonnegative to FIX_TRUNC (x). */
7809 if (tree_expr_nonnegative_p (arg))
7810 return fold_build1_loc (loc, FIX_TRUNC_EXPR,
7811 TREE_TYPE (TREE_TYPE (fndecl)), arg);
7816 return fold_fixed_mathfn (loc, fndecl, arg);
7819 /* Fold function call to builtin ffs, clz, ctz, popcount and parity
7820 and their long and long long variants (i.e. ffsl and ffsll). ARG is
7821 the argument to the call. Return NULL_TREE if no simplification can
7825 fold_builtin_bitop (tree fndecl, tree arg)
7827 if (!validate_arg (arg, INTEGER_TYPE))
7830 /* Optimize for constant argument. */
7831 if (TREE_CODE (arg) == INTEGER_CST && !TREE_OVERFLOW (arg))
7833 HOST_WIDE_INT hi, width, result;
7834 unsigned HOST_WIDE_INT lo;
7837 type = TREE_TYPE (arg);
7838 width = TYPE_PRECISION (type);
7839 lo = TREE_INT_CST_LOW (arg);
7841 /* Clear all the bits that are beyond the type's precision. */
7842 if (width > HOST_BITS_PER_WIDE_INT)
7844 hi = TREE_INT_CST_HIGH (arg);
7845 if (width < 2 * HOST_BITS_PER_WIDE_INT)
7846 hi &= ~((HOST_WIDE_INT) (-1) >> (width - HOST_BITS_PER_WIDE_INT));
7851 if (width < HOST_BITS_PER_WIDE_INT)
7852 lo &= ~((unsigned HOST_WIDE_INT) (-1) << width);
7855 switch (DECL_FUNCTION_CODE (fndecl))
7857 CASE_INT_FN (BUILT_IN_FFS):
7859 result = exact_log2 (lo & -lo) + 1;
7861 result = HOST_BITS_PER_WIDE_INT + exact_log2 (hi & -hi) + 1;
7866 CASE_INT_FN (BUILT_IN_CLZ):
7868 result = width - floor_log2 (hi) - 1 - HOST_BITS_PER_WIDE_INT;
7870 result = width - floor_log2 (lo) - 1;
7871 else if (! CLZ_DEFINED_VALUE_AT_ZERO (TYPE_MODE (type), result))
7875 CASE_INT_FN (BUILT_IN_CTZ):
7877 result = exact_log2 (lo & -lo);
7879 result = HOST_BITS_PER_WIDE_INT + exact_log2 (hi & -hi);
7880 else if (! CTZ_DEFINED_VALUE_AT_ZERO (TYPE_MODE (type), result))
7884 CASE_INT_FN (BUILT_IN_POPCOUNT):
7887 result++, lo &= lo - 1;
7889 result++, hi &= hi - 1;
7892 CASE_INT_FN (BUILT_IN_PARITY):
7895 result++, lo &= lo - 1;
7897 result++, hi &= hi - 1;
7905 return build_int_cst (TREE_TYPE (TREE_TYPE (fndecl)), result);
7911 /* Fold function call to builtin_bswap and the long and long long
7912 variants. Return NULL_TREE if no simplification can be made. */
7914 fold_builtin_bswap (tree fndecl, tree arg)
7916 if (! validate_arg (arg, INTEGER_TYPE))
7919 /* Optimize constant value. */
7920 if (TREE_CODE (arg) == INTEGER_CST && !TREE_OVERFLOW (arg))
7922 HOST_WIDE_INT hi, width, r_hi = 0;
7923 unsigned HOST_WIDE_INT lo, r_lo = 0;
7926 type = TREE_TYPE (arg);
7927 width = TYPE_PRECISION (type);
7928 lo = TREE_INT_CST_LOW (arg);
7929 hi = TREE_INT_CST_HIGH (arg);
7931 switch (DECL_FUNCTION_CODE (fndecl))
7933 case BUILT_IN_BSWAP32:
7934 case BUILT_IN_BSWAP64:
7938 for (s = 0; s < width; s += 8)
7940 int d = width - s - 8;
7941 unsigned HOST_WIDE_INT byte;
7943 if (s < HOST_BITS_PER_WIDE_INT)
7944 byte = (lo >> s) & 0xff;
7946 byte = (hi >> (s - HOST_BITS_PER_WIDE_INT)) & 0xff;
7948 if (d < HOST_BITS_PER_WIDE_INT)
7951 r_hi |= byte << (d - HOST_BITS_PER_WIDE_INT);
7961 if (width < HOST_BITS_PER_WIDE_INT)
7962 return build_int_cst (TREE_TYPE (TREE_TYPE (fndecl)), r_lo);
7964 return build_int_cst_wide (TREE_TYPE (TREE_TYPE (fndecl)), r_lo, r_hi);
7970 /* A subroutine of fold_builtin to fold the various logarithmic
7971 functions. Return NULL_TREE if no simplification can me made.
7972 FUNC is the corresponding MPFR logarithm function. */
7975 fold_builtin_logarithm (location_t loc, tree fndecl, tree arg,
7976 int (*func)(mpfr_ptr, mpfr_srcptr, mp_rnd_t))
7978 if (validate_arg (arg, REAL_TYPE))
7980 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7982 const enum built_in_function fcode = builtin_mathfn_code (arg);
7984 /* Calculate the result when the argument is a constant. */
7985 if ((res = do_mpfr_arg1 (arg, type, func, &dconst0, NULL, false)))
7988 /* Special case, optimize logN(expN(x)) = x. */
7989 if (flag_unsafe_math_optimizations
7990 && ((func == mpfr_log
7991 && (fcode == BUILT_IN_EXP
7992 || fcode == BUILT_IN_EXPF
7993 || fcode == BUILT_IN_EXPL))
7994 || (func == mpfr_log2
7995 && (fcode == BUILT_IN_EXP2
7996 || fcode == BUILT_IN_EXP2F
7997 || fcode == BUILT_IN_EXP2L))
7998 || (func == mpfr_log10 && (BUILTIN_EXP10_P (fcode)))))
7999 return fold_convert_loc (loc, type, CALL_EXPR_ARG (arg, 0));
8001 /* Optimize logN(func()) for various exponential functions. We
8002 want to determine the value "x" and the power "exponent" in
8003 order to transform logN(x**exponent) into exponent*logN(x). */
8004 if (flag_unsafe_math_optimizations)
8006 tree exponent = 0, x = 0;
8010 CASE_FLT_FN (BUILT_IN_EXP):
8011 /* Prepare to do logN(exp(exponent) -> exponent*logN(e). */
8012 x = build_real (type, real_value_truncate (TYPE_MODE (type),
8014 exponent = CALL_EXPR_ARG (arg, 0);
8016 CASE_FLT_FN (BUILT_IN_EXP2):
8017 /* Prepare to do logN(exp2(exponent) -> exponent*logN(2). */
8018 x = build_real (type, dconst2);
8019 exponent = CALL_EXPR_ARG (arg, 0);
8021 CASE_FLT_FN (BUILT_IN_EXP10):
8022 CASE_FLT_FN (BUILT_IN_POW10):
8023 /* Prepare to do logN(exp10(exponent) -> exponent*logN(10). */
8025 REAL_VALUE_TYPE dconst10;
8026 real_from_integer (&dconst10, VOIDmode, 10, 0, 0);
8027 x = build_real (type, dconst10);
8029 exponent = CALL_EXPR_ARG (arg, 0);
8031 CASE_FLT_FN (BUILT_IN_SQRT):
8032 /* Prepare to do logN(sqrt(x) -> 0.5*logN(x). */
8033 x = CALL_EXPR_ARG (arg, 0);
8034 exponent = build_real (type, dconsthalf);
8036 CASE_FLT_FN (BUILT_IN_CBRT):
8037 /* Prepare to do logN(cbrt(x) -> (1/3)*logN(x). */
8038 x = CALL_EXPR_ARG (arg, 0);
8039 exponent = build_real (type, real_value_truncate (TYPE_MODE (type),
8042 CASE_FLT_FN (BUILT_IN_POW):
8043 /* Prepare to do logN(pow(x,exponent) -> exponent*logN(x). */
8044 x = CALL_EXPR_ARG (arg, 0);
8045 exponent = CALL_EXPR_ARG (arg, 1);
8051 /* Now perform the optimization. */
8054 tree logfn = build_call_expr_loc (loc, fndecl, 1, x);
8055 return fold_build2_loc (loc, MULT_EXPR, type, exponent, logfn);
8063 /* Fold a builtin function call to hypot, hypotf, or hypotl. Return
8064 NULL_TREE if no simplification can be made. */
8067 fold_builtin_hypot (location_t loc, tree fndecl,
8068 tree arg0, tree arg1, tree type)
8070 tree res, narg0, narg1;
8072 if (!validate_arg (arg0, REAL_TYPE)
8073 || !validate_arg (arg1, REAL_TYPE))
8076 /* Calculate the result when the argument is a constant. */
8077 if ((res = do_mpfr_arg2 (arg0, arg1, type, mpfr_hypot)))
8080 /* If either argument to hypot has a negate or abs, strip that off.
8081 E.g. hypot(-x,fabs(y)) -> hypot(x,y). */
8082 narg0 = fold_strip_sign_ops (arg0);
8083 narg1 = fold_strip_sign_ops (arg1);
8086 return build_call_expr_loc (loc, fndecl, 2, narg0 ? narg0 : arg0,
8087 narg1 ? narg1 : arg1);
8090 /* If either argument is zero, hypot is fabs of the other. */
8091 if (real_zerop (arg0))
8092 return fold_build1_loc (loc, ABS_EXPR, type, arg1);
8093 else if (real_zerop (arg1))
8094 return fold_build1_loc (loc, ABS_EXPR, type, arg0);
8096 /* hypot(x,x) -> fabs(x)*sqrt(2). */
8097 if (flag_unsafe_math_optimizations
8098 && operand_equal_p (arg0, arg1, OEP_PURE_SAME))
8100 const REAL_VALUE_TYPE sqrt2_trunc
8101 = real_value_truncate (TYPE_MODE (type), dconst_sqrt2 ());
8102 return fold_build2_loc (loc, MULT_EXPR, type,
8103 fold_build1_loc (loc, ABS_EXPR, type, arg0),
8104 build_real (type, sqrt2_trunc));
8111 /* Fold a builtin function call to pow, powf, or powl. Return
8112 NULL_TREE if no simplification can be made. */
8114 fold_builtin_pow (location_t loc, tree fndecl, tree arg0, tree arg1, tree type)
8118 if (!validate_arg (arg0, REAL_TYPE)
8119 || !validate_arg (arg1, REAL_TYPE))
8122 /* Calculate the result when the argument is a constant. */
8123 if ((res = do_mpfr_arg2 (arg0, arg1, type, mpfr_pow)))
8126 /* Optimize pow(1.0,y) = 1.0. */
8127 if (real_onep (arg0))
8128 return omit_one_operand_loc (loc, type, build_real (type, dconst1), arg1);
8130 if (TREE_CODE (arg1) == REAL_CST
8131 && !TREE_OVERFLOW (arg1))
8133 REAL_VALUE_TYPE cint;
8137 c = TREE_REAL_CST (arg1);
8139 /* Optimize pow(x,0.0) = 1.0. */
8140 if (REAL_VALUES_EQUAL (c, dconst0))
8141 return omit_one_operand_loc (loc, type, build_real (type, dconst1),
8144 /* Optimize pow(x,1.0) = x. */
8145 if (REAL_VALUES_EQUAL (c, dconst1))
8148 /* Optimize pow(x,-1.0) = 1.0/x. */
8149 if (REAL_VALUES_EQUAL (c, dconstm1))
8150 return fold_build2_loc (loc, RDIV_EXPR, type,
8151 build_real (type, dconst1), arg0);
8153 /* Optimize pow(x,0.5) = sqrt(x). */
8154 if (flag_unsafe_math_optimizations
8155 && REAL_VALUES_EQUAL (c, dconsthalf))
8157 tree sqrtfn = mathfn_built_in (type, BUILT_IN_SQRT);
8159 if (sqrtfn != NULL_TREE)
8160 return build_call_expr_loc (loc, sqrtfn, 1, arg0);
8163 /* Optimize pow(x,1.0/3.0) = cbrt(x). */
8164 if (flag_unsafe_math_optimizations)
8166 const REAL_VALUE_TYPE dconstroot
8167 = real_value_truncate (TYPE_MODE (type), dconst_third ());
8169 if (REAL_VALUES_EQUAL (c, dconstroot))
8171 tree cbrtfn = mathfn_built_in (type, BUILT_IN_CBRT);
8172 if (cbrtfn != NULL_TREE)
8173 return build_call_expr_loc (loc, cbrtfn, 1, arg0);
8177 /* Check for an integer exponent. */
8178 n = real_to_integer (&c);
8179 real_from_integer (&cint, VOIDmode, n, n < 0 ? -1 : 0, 0);
8180 if (real_identical (&c, &cint))
8182 /* Attempt to evaluate pow at compile-time, unless this should
8183 raise an exception. */
8184 if (TREE_CODE (arg0) == REAL_CST
8185 && !TREE_OVERFLOW (arg0)
8187 || (!flag_trapping_math && !flag_errno_math)
8188 || !REAL_VALUES_EQUAL (TREE_REAL_CST (arg0), dconst0)))
8193 x = TREE_REAL_CST (arg0);
8194 inexact = real_powi (&x, TYPE_MODE (type), &x, n);
8195 if (flag_unsafe_math_optimizations || !inexact)
8196 return build_real (type, x);
8199 /* Strip sign ops from even integer powers. */
8200 if ((n & 1) == 0 && flag_unsafe_math_optimizations)
8202 tree narg0 = fold_strip_sign_ops (arg0);
8204 return build_call_expr_loc (loc, fndecl, 2, narg0, arg1);
8209 if (flag_unsafe_math_optimizations)
8211 const enum built_in_function fcode = builtin_mathfn_code (arg0);
8213 /* Optimize pow(expN(x),y) = expN(x*y). */
8214 if (BUILTIN_EXPONENT_P (fcode))
8216 tree expfn = TREE_OPERAND (CALL_EXPR_FN (arg0), 0);
8217 tree arg = CALL_EXPR_ARG (arg0, 0);
8218 arg = fold_build2_loc (loc, MULT_EXPR, type, arg, arg1);
8219 return build_call_expr_loc (loc, expfn, 1, arg);
8222 /* Optimize pow(sqrt(x),y) = pow(x,y*0.5). */
8223 if (BUILTIN_SQRT_P (fcode))
8225 tree narg0 = CALL_EXPR_ARG (arg0, 0);
8226 tree narg1 = fold_build2_loc (loc, MULT_EXPR, type, arg1,
8227 build_real (type, dconsthalf));
8228 return build_call_expr_loc (loc, fndecl, 2, narg0, narg1);
8231 /* Optimize pow(cbrt(x),y) = pow(x,y/3) iff x is nonnegative. */
8232 if (BUILTIN_CBRT_P (fcode))
8234 tree arg = CALL_EXPR_ARG (arg0, 0);
8235 if (tree_expr_nonnegative_p (arg))
8237 const REAL_VALUE_TYPE dconstroot
8238 = real_value_truncate (TYPE_MODE (type), dconst_third ());
8239 tree narg1 = fold_build2_loc (loc, MULT_EXPR, type, arg1,
8240 build_real (type, dconstroot));
8241 return build_call_expr_loc (loc, fndecl, 2, arg, narg1);
8245 /* Optimize pow(pow(x,y),z) = pow(x,y*z) iff x is nonnegative. */
8246 if (fcode == BUILT_IN_POW
8247 || fcode == BUILT_IN_POWF
8248 || fcode == BUILT_IN_POWL)
8250 tree arg00 = CALL_EXPR_ARG (arg0, 0);
8251 if (tree_expr_nonnegative_p (arg00))
8253 tree arg01 = CALL_EXPR_ARG (arg0, 1);
8254 tree narg1 = fold_build2_loc (loc, MULT_EXPR, type, arg01, arg1);
8255 return build_call_expr_loc (loc, fndecl, 2, arg00, narg1);
8263 /* Fold a builtin function call to powi, powif, or powil with argument ARG.
8264 Return NULL_TREE if no simplification can be made. */
8266 fold_builtin_powi (location_t loc, tree fndecl ATTRIBUTE_UNUSED,
8267 tree arg0, tree arg1, tree type)
8269 if (!validate_arg (arg0, REAL_TYPE)
8270 || !validate_arg (arg1, INTEGER_TYPE))
8273 /* Optimize pow(1.0,y) = 1.0. */
8274 if (real_onep (arg0))
8275 return omit_one_operand_loc (loc, type, build_real (type, dconst1), arg1);
8277 if (host_integerp (arg1, 0))
8279 HOST_WIDE_INT c = TREE_INT_CST_LOW (arg1);
8281 /* Evaluate powi at compile-time. */
8282 if (TREE_CODE (arg0) == REAL_CST
8283 && !TREE_OVERFLOW (arg0))
8286 x = TREE_REAL_CST (arg0);
8287 real_powi (&x, TYPE_MODE (type), &x, c);
8288 return build_real (type, x);
8291 /* Optimize pow(x,0) = 1.0. */
8293 return omit_one_operand_loc (loc, type, build_real (type, dconst1),
8296 /* Optimize pow(x,1) = x. */
8300 /* Optimize pow(x,-1) = 1.0/x. */
8302 return fold_build2_loc (loc, RDIV_EXPR, type,
8303 build_real (type, dconst1), arg0);
8309 /* A subroutine of fold_builtin to fold the various exponent
8310 functions. Return NULL_TREE if no simplification can be made.
8311 FUNC is the corresponding MPFR exponent function. */
8314 fold_builtin_exponent (location_t loc, tree fndecl, tree arg,
8315 int (*func)(mpfr_ptr, mpfr_srcptr, mp_rnd_t))
8317 if (validate_arg (arg, REAL_TYPE))
8319 tree type = TREE_TYPE (TREE_TYPE (fndecl));
8322 /* Calculate the result when the argument is a constant. */
8323 if ((res = do_mpfr_arg1 (arg, type, func, NULL, NULL, 0)))
8326 /* Optimize expN(logN(x)) = x. */
8327 if (flag_unsafe_math_optimizations)
8329 const enum built_in_function fcode = builtin_mathfn_code (arg);
8331 if ((func == mpfr_exp
8332 && (fcode == BUILT_IN_LOG
8333 || fcode == BUILT_IN_LOGF
8334 || fcode == BUILT_IN_LOGL))
8335 || (func == mpfr_exp2
8336 && (fcode == BUILT_IN_LOG2
8337 || fcode == BUILT_IN_LOG2F
8338 || fcode == BUILT_IN_LOG2L))
8339 || (func == mpfr_exp10
8340 && (fcode == BUILT_IN_LOG10
8341 || fcode == BUILT_IN_LOG10F
8342 || fcode == BUILT_IN_LOG10L)))
8343 return fold_convert_loc (loc, type, CALL_EXPR_ARG (arg, 0));
8350 /* Return true if VAR is a VAR_DECL or a component thereof. */
8353 var_decl_component_p (tree var)
8356 while (handled_component_p (inner))
8357 inner = TREE_OPERAND (inner, 0);
8358 return SSA_VAR_P (inner);
8361 /* Fold function call to builtin memset. Return
8362 NULL_TREE if no simplification can be made. */
8365 fold_builtin_memset (location_t loc, tree dest, tree c, tree len,
8366 tree type, bool ignore)
8368 tree var, ret, etype;
8369 unsigned HOST_WIDE_INT length, cval;
8371 if (! validate_arg (dest, POINTER_TYPE)
8372 || ! validate_arg (c, INTEGER_TYPE)
8373 || ! validate_arg (len, INTEGER_TYPE))
8376 if (! host_integerp (len, 1))
8379 /* If the LEN parameter is zero, return DEST. */
8380 if (integer_zerop (len))
8381 return omit_one_operand_loc (loc, type, dest, c);
8383 if (! host_integerp (c, 1) || TREE_SIDE_EFFECTS (dest))
8388 if (TREE_CODE (var) != ADDR_EXPR)
8391 var = TREE_OPERAND (var, 0);
8392 if (TREE_THIS_VOLATILE (var))
8395 etype = TREE_TYPE (var);
8396 if (TREE_CODE (etype) == ARRAY_TYPE)
8397 etype = TREE_TYPE (etype);
8399 if (!INTEGRAL_TYPE_P (etype)
8400 && !POINTER_TYPE_P (etype))
8403 if (! var_decl_component_p (var))
8406 length = tree_low_cst (len, 1);
8407 if (GET_MODE_SIZE (TYPE_MODE (etype)) != length
8408 || get_pointer_alignment (dest, BIGGEST_ALIGNMENT) / BITS_PER_UNIT
8412 if (length > HOST_BITS_PER_WIDE_INT / BITS_PER_UNIT)
8415 if (integer_zerop (c))
8419 if (CHAR_BIT != 8 || BITS_PER_UNIT != 8 || HOST_BITS_PER_WIDE_INT > 64)
8422 cval = tree_low_cst (c, 1);
8426 cval |= (cval << 31) << 1;
8429 ret = build_int_cst_type (etype, cval);
8430 var = build_fold_indirect_ref_loc (loc,
8431 fold_convert_loc (loc,
8432 build_pointer_type (etype),
8434 ret = build2 (MODIFY_EXPR, etype, var, ret);
8438 return omit_one_operand_loc (loc, type, dest, ret);
8441 /* Fold function call to builtin memset. Return
8442 NULL_TREE if no simplification can be made. */
8445 fold_builtin_bzero (location_t loc, tree dest, tree size, bool ignore)
8447 if (! validate_arg (dest, POINTER_TYPE)
8448 || ! validate_arg (size, INTEGER_TYPE))
8454 /* New argument list transforming bzero(ptr x, int y) to
8455 memset(ptr x, int 0, size_t y). This is done this way
8456 so that if it isn't expanded inline, we fallback to
8457 calling bzero instead of memset. */
8459 return fold_builtin_memset (loc, dest, integer_zero_node,
8460 fold_convert_loc (loc, sizetype, size),
8461 void_type_node, ignore);
8464 /* Fold function call to builtin mem{{,p}cpy,move}. Return
8465 NULL_TREE if no simplification can be made.
8466 If ENDP is 0, return DEST (like memcpy).
8467 If ENDP is 1, return DEST+LEN (like mempcpy).
8468 If ENDP is 2, return DEST+LEN-1 (like stpcpy).
8469 If ENDP is 3, return DEST, additionally *SRC and *DEST may overlap
8473 fold_builtin_memory_op (location_t loc, tree dest, tree src,
8474 tree len, tree type, bool ignore, int endp)
8476 tree destvar, srcvar, expr;
8478 if (! validate_arg (dest, POINTER_TYPE)
8479 || ! validate_arg (src, POINTER_TYPE)
8480 || ! validate_arg (len, INTEGER_TYPE))
8483 /* If the LEN parameter is zero, return DEST. */
8484 if (integer_zerop (len))
8485 return omit_one_operand_loc (loc, type, dest, src);
8487 /* If SRC and DEST are the same (and not volatile), return
8488 DEST{,+LEN,+LEN-1}. */
8489 if (operand_equal_p (src, dest, 0))
8493 tree srctype, desttype;
8494 int src_align, dest_align;
8498 src_align = get_pointer_alignment (src, BIGGEST_ALIGNMENT);
8499 dest_align = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
8501 /* Both DEST and SRC must be pointer types.
8502 ??? This is what old code did. Is the testing for pointer types
8505 If either SRC is readonly or length is 1, we can use memcpy. */
8506 if (!dest_align || !src_align)
8508 if (readonly_data_expr (src)
8509 || (host_integerp (len, 1)
8510 && (MIN (src_align, dest_align) / BITS_PER_UNIT
8511 >= tree_low_cst (len, 1))))
8513 tree fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
8516 return build_call_expr_loc (loc, fn, 3, dest, src, len);
8519 /* If *src and *dest can't overlap, optimize into memcpy as well. */
8520 srcvar = build_fold_indirect_ref_loc (loc, src);
8521 destvar = build_fold_indirect_ref_loc (loc, dest);
8523 && !TREE_THIS_VOLATILE (srcvar)
8525 && !TREE_THIS_VOLATILE (destvar))
8527 tree src_base, dest_base, fn;
8528 HOST_WIDE_INT src_offset = 0, dest_offset = 0;
8529 HOST_WIDE_INT size = -1;
8530 HOST_WIDE_INT maxsize = -1;
8533 if (handled_component_p (src_base))
8534 src_base = get_ref_base_and_extent (src_base, &src_offset,
8536 dest_base = destvar;
8537 if (handled_component_p (dest_base))
8538 dest_base = get_ref_base_and_extent (dest_base, &dest_offset,
8540 if (host_integerp (len, 1))
8542 maxsize = tree_low_cst (len, 1);
8544 > INTTYPE_MAXIMUM (HOST_WIDE_INT) / BITS_PER_UNIT)
8547 maxsize *= BITS_PER_UNIT;
8551 if (SSA_VAR_P (src_base)
8552 && SSA_VAR_P (dest_base))
8554 if (operand_equal_p (src_base, dest_base, 0)
8555 && ranges_overlap_p (src_offset, maxsize,
8556 dest_offset, maxsize))
8559 else if (TREE_CODE (src_base) == INDIRECT_REF
8560 && TREE_CODE (dest_base) == INDIRECT_REF)
8562 if (! operand_equal_p (TREE_OPERAND (src_base, 0),
8563 TREE_OPERAND (dest_base, 0), 0)
8564 || ranges_overlap_p (src_offset, maxsize,
8565 dest_offset, maxsize))
8571 fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
8574 return build_call_expr_loc (loc, fn, 3, dest, src, len);
8579 if (!host_integerp (len, 0))
8582 This logic lose for arguments like (type *)malloc (sizeof (type)),
8583 since we strip the casts of up to VOID return value from malloc.
8584 Perhaps we ought to inherit type from non-VOID argument here? */
8587 /* As we fold (void *)(p + CST) to (void *)p + CST undo this here. */
8588 if (TREE_CODE (src) == POINTER_PLUS_EXPR)
8590 tree tem = TREE_OPERAND (src, 0);
8592 if (tem != TREE_OPERAND (src, 0))
8593 src = build1 (NOP_EXPR, TREE_TYPE (tem), src);
8595 if (TREE_CODE (dest) == POINTER_PLUS_EXPR)
8597 tree tem = TREE_OPERAND (dest, 0);
8599 if (tem != TREE_OPERAND (dest, 0))
8600 dest = build1 (NOP_EXPR, TREE_TYPE (tem), dest);
8602 srctype = TREE_TYPE (TREE_TYPE (src));
8604 && TREE_CODE (srctype) == ARRAY_TYPE
8605 && !tree_int_cst_equal (TYPE_SIZE_UNIT (srctype), len))
8607 srctype = TREE_TYPE (srctype);
8609 src = build1 (NOP_EXPR, build_pointer_type (srctype), src);
8611 desttype = TREE_TYPE (TREE_TYPE (dest));
8613 && TREE_CODE (desttype) == ARRAY_TYPE
8614 && !tree_int_cst_equal (TYPE_SIZE_UNIT (desttype), len))
8616 desttype = TREE_TYPE (desttype);
8618 dest = build1 (NOP_EXPR, build_pointer_type (desttype), dest);
8620 if (!srctype || !desttype
8621 || !TYPE_SIZE_UNIT (srctype)
8622 || !TYPE_SIZE_UNIT (desttype)
8623 || TREE_CODE (TYPE_SIZE_UNIT (srctype)) != INTEGER_CST
8624 || TREE_CODE (TYPE_SIZE_UNIT (desttype)) != INTEGER_CST
8625 || TYPE_VOLATILE (srctype)
8626 || TYPE_VOLATILE (desttype))
8629 src_align = get_pointer_alignment (src, BIGGEST_ALIGNMENT);
8630 dest_align = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
8631 if (dest_align < (int) TYPE_ALIGN (desttype)
8632 || src_align < (int) TYPE_ALIGN (srctype))
8636 dest = builtin_save_expr (dest);
8639 if (tree_int_cst_equal (TYPE_SIZE_UNIT (srctype), len))
8641 srcvar = build_fold_indirect_ref_loc (loc, src);
8642 if (TREE_THIS_VOLATILE (srcvar))
8644 else if (!tree_int_cst_equal (tree_expr_size (srcvar), len))
8646 /* With memcpy, it is possible to bypass aliasing rules, so without
8647 this check i.e. execute/20060930-2.c would be misoptimized,
8648 because it use conflicting alias set to hold argument for the
8649 memcpy call. This check is probably unnecessary with
8650 -fno-strict-aliasing. Similarly for destvar. See also
8652 else if (!var_decl_component_p (srcvar))
8656 destvar = NULL_TREE;
8657 if (tree_int_cst_equal (TYPE_SIZE_UNIT (desttype), len))
8659 destvar = build_fold_indirect_ref_loc (loc, dest);
8660 if (TREE_THIS_VOLATILE (destvar))
8662 else if (!tree_int_cst_equal (tree_expr_size (destvar), len))
8663 destvar = NULL_TREE;
8664 else if (!var_decl_component_p (destvar))
8665 destvar = NULL_TREE;
8668 if (srcvar == NULL_TREE && destvar == NULL_TREE)
8671 if (srcvar == NULL_TREE)
8674 if (TREE_ADDRESSABLE (TREE_TYPE (destvar)))
8677 srctype = build_qualified_type (desttype, 0);
8678 if (src_align < (int) TYPE_ALIGN (srctype))
8680 if (AGGREGATE_TYPE_P (srctype)
8681 || SLOW_UNALIGNED_ACCESS (TYPE_MODE (srctype), src_align))
8684 srctype = build_variant_type_copy (srctype);
8685 TYPE_ALIGN (srctype) = src_align;
8686 TYPE_USER_ALIGN (srctype) = 1;
8687 TYPE_PACKED (srctype) = 1;
8689 srcptype = build_pointer_type_for_mode (srctype, ptr_mode, true);
8690 src = fold_convert_loc (loc, srcptype, src);
8691 srcvar = build_fold_indirect_ref_loc (loc, src);
8693 else if (destvar == NULL_TREE)
8696 if (TREE_ADDRESSABLE (TREE_TYPE (srcvar)))
8699 desttype = build_qualified_type (srctype, 0);
8700 if (dest_align < (int) TYPE_ALIGN (desttype))
8702 if (AGGREGATE_TYPE_P (desttype)
8703 || SLOW_UNALIGNED_ACCESS (TYPE_MODE (desttype), dest_align))
8706 desttype = build_variant_type_copy (desttype);
8707 TYPE_ALIGN (desttype) = dest_align;
8708 TYPE_USER_ALIGN (desttype) = 1;
8709 TYPE_PACKED (desttype) = 1;
8711 destptype = build_pointer_type_for_mode (desttype, ptr_mode, true);
8712 dest = fold_convert_loc (loc, destptype, dest);
8713 destvar = build_fold_indirect_ref_loc (loc, dest);
8716 if (srctype == desttype
8717 || (gimple_in_ssa_p (cfun)
8718 && useless_type_conversion_p (desttype, srctype)))
8720 else if ((INTEGRAL_TYPE_P (TREE_TYPE (srcvar))
8721 || POINTER_TYPE_P (TREE_TYPE (srcvar)))
8722 && (INTEGRAL_TYPE_P (TREE_TYPE (destvar))
8723 || POINTER_TYPE_P (TREE_TYPE (destvar))))
8724 expr = fold_convert_loc (loc, TREE_TYPE (destvar), srcvar);
8726 expr = fold_build1_loc (loc, VIEW_CONVERT_EXPR,
8727 TREE_TYPE (destvar), srcvar);
8728 expr = build2 (MODIFY_EXPR, TREE_TYPE (destvar), destvar, expr);
8734 if (endp == 0 || endp == 3)
8735 return omit_one_operand_loc (loc, type, dest, expr);
8741 len = fold_build2_loc (loc, MINUS_EXPR, TREE_TYPE (len), len,
8744 len = fold_convert_loc (loc, sizetype, len);
8745 dest = fold_build2_loc (loc, POINTER_PLUS_EXPR, TREE_TYPE (dest), dest, len);
8746 dest = fold_convert_loc (loc, type, dest);
8748 dest = omit_one_operand_loc (loc, type, dest, expr);
8752 /* Fold function call to builtin strcpy with arguments DEST and SRC.
8753 If LEN is not NULL, it represents the length of the string to be
8754 copied. Return NULL_TREE if no simplification can be made. */
8757 fold_builtin_strcpy (location_t loc, tree fndecl, tree dest, tree src, tree len)
8761 if (!validate_arg (dest, POINTER_TYPE)
8762 || !validate_arg (src, POINTER_TYPE))
8765 /* If SRC and DEST are the same (and not volatile), return DEST. */
8766 if (operand_equal_p (src, dest, 0))
8767 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest);
8769 if (optimize_function_for_size_p (cfun))
8772 fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
8778 len = c_strlen (src, 1);
8779 if (! len || TREE_SIDE_EFFECTS (len))
8783 len = size_binop_loc (loc, PLUS_EXPR, len, ssize_int (1));
8784 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)),
8785 build_call_expr_loc (loc, fn, 3, dest, src, len));
8788 /* Fold function call to builtin stpcpy with arguments DEST and SRC.
8789 Return NULL_TREE if no simplification can be made. */
8792 fold_builtin_stpcpy (location_t loc, tree fndecl, tree dest, tree src)
8794 tree fn, len, lenp1, call, type;
8796 if (!validate_arg (dest, POINTER_TYPE)
8797 || !validate_arg (src, POINTER_TYPE))
8800 len = c_strlen (src, 1);
8802 || TREE_CODE (len) != INTEGER_CST)
8805 if (optimize_function_for_size_p (cfun)
8806 /* If length is zero it's small enough. */
8807 && !integer_zerop (len))
8810 fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
8814 lenp1 = size_binop_loc (loc, PLUS_EXPR, len, ssize_int (1));
8815 /* We use dest twice in building our expression. Save it from
8816 multiple expansions. */
8817 dest = builtin_save_expr (dest);
8818 call = build_call_expr_loc (loc, fn, 3, dest, src, lenp1);
8820 type = TREE_TYPE (TREE_TYPE (fndecl));
8821 len = fold_convert_loc (loc, sizetype, len);
8822 dest = fold_build2_loc (loc, POINTER_PLUS_EXPR, TREE_TYPE (dest), dest, len);
8823 dest = fold_convert_loc (loc, type, dest);
8824 dest = omit_one_operand_loc (loc, type, dest, call);
8828 /* Fold function call to builtin strncpy with arguments DEST, SRC, and LEN.
8829 If SLEN is not NULL, it represents the length of the source string.
8830 Return NULL_TREE if no simplification can be made. */
8833 fold_builtin_strncpy (location_t loc, tree fndecl, tree dest,
8834 tree src, tree len, tree slen)
8838 if (!validate_arg (dest, POINTER_TYPE)
8839 || !validate_arg (src, POINTER_TYPE)
8840 || !validate_arg (len, INTEGER_TYPE))
8843 /* If the LEN parameter is zero, return DEST. */
8844 if (integer_zerop (len))
8845 return omit_one_operand_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest, src);
8847 /* We can't compare slen with len as constants below if len is not a
8849 if (len == 0 || TREE_CODE (len) != INTEGER_CST)
8853 slen = c_strlen (src, 1);
8855 /* Now, we must be passed a constant src ptr parameter. */
8856 if (slen == 0 || TREE_CODE (slen) != INTEGER_CST)
8859 slen = size_binop_loc (loc, PLUS_EXPR, slen, ssize_int (1));
8861 /* We do not support simplification of this case, though we do
8862 support it when expanding trees into RTL. */
8863 /* FIXME: generate a call to __builtin_memset. */
8864 if (tree_int_cst_lt (slen, len))
8867 /* OK transform into builtin memcpy. */
8868 fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
8871 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)),
8872 build_call_expr_loc (loc, fn, 3, dest, src, len));
8875 /* Fold function call to builtin memchr. ARG1, ARG2 and LEN are the
8876 arguments to the call, and TYPE is its return type.
8877 Return NULL_TREE if no simplification can be made. */
8880 fold_builtin_memchr (location_t loc, tree arg1, tree arg2, tree len, tree type)
8882 if (!validate_arg (arg1, POINTER_TYPE)
8883 || !validate_arg (arg2, INTEGER_TYPE)
8884 || !validate_arg (len, INTEGER_TYPE))
8890 if (TREE_CODE (arg2) != INTEGER_CST
8891 || !host_integerp (len, 1))
8894 p1 = c_getstr (arg1);
8895 if (p1 && compare_tree_int (len, strlen (p1) + 1) <= 0)
8901 if (target_char_cast (arg2, &c))
8904 r = (char *) memchr (p1, c, tree_low_cst (len, 1));
8907 return build_int_cst (TREE_TYPE (arg1), 0);
8909 tem = fold_build2_loc (loc, POINTER_PLUS_EXPR, TREE_TYPE (arg1), arg1,
8911 return fold_convert_loc (loc, type, tem);
8917 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
8918 Return NULL_TREE if no simplification can be made. */
8921 fold_builtin_memcmp (location_t loc, tree arg1, tree arg2, tree len)
8923 const char *p1, *p2;
8925 if (!validate_arg (arg1, POINTER_TYPE)
8926 || !validate_arg (arg2, POINTER_TYPE)
8927 || !validate_arg (len, INTEGER_TYPE))
8930 /* If the LEN parameter is zero, return zero. */
8931 if (integer_zerop (len))
8932 return omit_two_operands_loc (loc, integer_type_node, integer_zero_node,
8935 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8936 if (operand_equal_p (arg1, arg2, 0))
8937 return omit_one_operand_loc (loc, integer_type_node, integer_zero_node, len);
8939 p1 = c_getstr (arg1);
8940 p2 = c_getstr (arg2);
8942 /* If all arguments are constant, and the value of len is not greater
8943 than the lengths of arg1 and arg2, evaluate at compile-time. */
8944 if (host_integerp (len, 1) && p1 && p2
8945 && compare_tree_int (len, strlen (p1) + 1) <= 0
8946 && compare_tree_int (len, strlen (p2) + 1) <= 0)
8948 const int r = memcmp (p1, p2, tree_low_cst (len, 1));
8951 return integer_one_node;
8953 return integer_minus_one_node;
8955 return integer_zero_node;
8958 /* If len parameter is one, return an expression corresponding to
8959 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
8960 if (host_integerp (len, 1) && tree_low_cst (len, 1) == 1)
8962 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
8963 tree cst_uchar_ptr_node
8964 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
8967 = fold_convert_loc (loc, integer_type_node,
8968 build1 (INDIRECT_REF, cst_uchar_node,
8969 fold_convert_loc (loc,
8973 = fold_convert_loc (loc, integer_type_node,
8974 build1 (INDIRECT_REF, cst_uchar_node,
8975 fold_convert_loc (loc,
8978 return fold_build2_loc (loc, MINUS_EXPR, integer_type_node, ind1, ind2);
8984 /* Fold function call to builtin strcmp with arguments ARG1 and ARG2.
8985 Return NULL_TREE if no simplification can be made. */
8988 fold_builtin_strcmp (location_t loc, tree arg1, tree arg2)
8990 const char *p1, *p2;
8992 if (!validate_arg (arg1, POINTER_TYPE)
8993 || !validate_arg (arg2, POINTER_TYPE))
8996 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8997 if (operand_equal_p (arg1, arg2, 0))
8998 return integer_zero_node;
9000 p1 = c_getstr (arg1);
9001 p2 = c_getstr (arg2);
9005 const int i = strcmp (p1, p2);
9007 return integer_minus_one_node;
9009 return integer_one_node;
9011 return integer_zero_node;
9014 /* If the second arg is "", return *(const unsigned char*)arg1. */
9015 if (p2 && *p2 == '\0')
9017 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
9018 tree cst_uchar_ptr_node
9019 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
9021 return fold_convert_loc (loc, integer_type_node,
9022 build1 (INDIRECT_REF, cst_uchar_node,
9023 fold_convert_loc (loc,
9028 /* If the first arg is "", return -*(const unsigned char*)arg2. */
9029 if (p1 && *p1 == '\0')
9031 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
9032 tree cst_uchar_ptr_node
9033 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
9036 = fold_convert_loc (loc, integer_type_node,
9037 build1 (INDIRECT_REF, cst_uchar_node,
9038 fold_convert_loc (loc,
9041 return fold_build1_loc (loc, NEGATE_EXPR, integer_type_node, temp);
9047 /* Fold function call to builtin strncmp with arguments ARG1, ARG2, and LEN.
9048 Return NULL_TREE if no simplification can be made. */
9051 fold_builtin_strncmp (location_t loc, tree arg1, tree arg2, tree len)
9053 const char *p1, *p2;
9055 if (!validate_arg (arg1, POINTER_TYPE)
9056 || !validate_arg (arg2, POINTER_TYPE)
9057 || !validate_arg (len, INTEGER_TYPE))
9060 /* If the LEN parameter is zero, return zero. */
9061 if (integer_zerop (len))
9062 return omit_two_operands_loc (loc, integer_type_node, integer_zero_node,
9065 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
9066 if (operand_equal_p (arg1, arg2, 0))
9067 return omit_one_operand_loc (loc, integer_type_node, integer_zero_node, len);
9069 p1 = c_getstr (arg1);
9070 p2 = c_getstr (arg2);
9072 if (host_integerp (len, 1) && p1 && p2)
9074 const int i = strncmp (p1, p2, tree_low_cst (len, 1));
9076 return integer_one_node;
9078 return integer_minus_one_node;
9080 return integer_zero_node;
9083 /* If the second arg is "", and the length is greater than zero,
9084 return *(const unsigned char*)arg1. */
9085 if (p2 && *p2 == '\0'
9086 && TREE_CODE (len) == INTEGER_CST
9087 && tree_int_cst_sgn (len) == 1)
9089 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
9090 tree cst_uchar_ptr_node
9091 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
9093 return fold_convert_loc (loc, integer_type_node,
9094 build1 (INDIRECT_REF, cst_uchar_node,
9095 fold_convert_loc (loc,
9100 /* If the first arg is "", and the length is greater than zero,
9101 return -*(const unsigned char*)arg2. */
9102 if (p1 && *p1 == '\0'
9103 && TREE_CODE (len) == INTEGER_CST
9104 && tree_int_cst_sgn (len) == 1)
9106 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
9107 tree cst_uchar_ptr_node
9108 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
9110 tree temp = fold_convert_loc (loc, integer_type_node,
9111 build1 (INDIRECT_REF, cst_uchar_node,
9112 fold_convert_loc (loc,
9115 return fold_build1_loc (loc, NEGATE_EXPR, integer_type_node, temp);
9118 /* If len parameter is one, return an expression corresponding to
9119 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
9120 if (host_integerp (len, 1) && tree_low_cst (len, 1) == 1)
9122 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
9123 tree cst_uchar_ptr_node
9124 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
9126 tree ind1 = fold_convert_loc (loc, integer_type_node,
9127 build1 (INDIRECT_REF, cst_uchar_node,
9128 fold_convert_loc (loc,
9131 tree ind2 = fold_convert_loc (loc, integer_type_node,
9132 build1 (INDIRECT_REF, cst_uchar_node,
9133 fold_convert_loc (loc,
9136 return fold_build2_loc (loc, MINUS_EXPR, integer_type_node, ind1, ind2);
9142 /* Fold function call to builtin signbit, signbitf or signbitl with argument
9143 ARG. Return NULL_TREE if no simplification can be made. */
9146 fold_builtin_signbit (location_t loc, tree arg, tree type)
9150 if (!validate_arg (arg, REAL_TYPE))
9153 /* If ARG is a compile-time constant, determine the result. */
9154 if (TREE_CODE (arg) == REAL_CST
9155 && !TREE_OVERFLOW (arg))
9159 c = TREE_REAL_CST (arg);
9160 temp = REAL_VALUE_NEGATIVE (c) ? integer_one_node : integer_zero_node;
9161 return fold_convert_loc (loc, type, temp);
9164 /* If ARG is non-negative, the result is always zero. */
9165 if (tree_expr_nonnegative_p (arg))
9166 return omit_one_operand_loc (loc, type, integer_zero_node, arg);
9168 /* If ARG's format doesn't have signed zeros, return "arg < 0.0". */
9169 if (!HONOR_SIGNED_ZEROS (TYPE_MODE (TREE_TYPE (arg))))
9170 return fold_build2_loc (loc, LT_EXPR, type, arg,
9171 build_real (TREE_TYPE (arg), dconst0));
9176 /* Fold function call to builtin copysign, copysignf or copysignl with
9177 arguments ARG1 and ARG2. Return NULL_TREE if no simplification can
9181 fold_builtin_copysign (location_t loc, tree fndecl,
9182 tree arg1, tree arg2, tree type)
9186 if (!validate_arg (arg1, REAL_TYPE)
9187 || !validate_arg (arg2, REAL_TYPE))
9190 /* copysign(X,X) is X. */
9191 if (operand_equal_p (arg1, arg2, 0))
9192 return fold_convert_loc (loc, type, arg1);
9194 /* If ARG1 and ARG2 are compile-time constants, determine the result. */
9195 if (TREE_CODE (arg1) == REAL_CST
9196 && TREE_CODE (arg2) == REAL_CST
9197 && !TREE_OVERFLOW (arg1)
9198 && !TREE_OVERFLOW (arg2))
9200 REAL_VALUE_TYPE c1, c2;
9202 c1 = TREE_REAL_CST (arg1);
9203 c2 = TREE_REAL_CST (arg2);
9204 /* c1.sign := c2.sign. */
9205 real_copysign (&c1, &c2);
9206 return build_real (type, c1);
9209 /* copysign(X, Y) is fabs(X) when Y is always non-negative.
9210 Remember to evaluate Y for side-effects. */
9211 if (tree_expr_nonnegative_p (arg2))
9212 return omit_one_operand_loc (loc, type,
9213 fold_build1_loc (loc, ABS_EXPR, type, arg1),
9216 /* Strip sign changing operations for the first argument. */
9217 tem = fold_strip_sign_ops (arg1);
9219 return build_call_expr_loc (loc, fndecl, 2, tem, arg2);
9224 /* Fold a call to builtin isascii with argument ARG. */
9227 fold_builtin_isascii (location_t loc, tree arg)
9229 if (!validate_arg (arg, INTEGER_TYPE))
9233 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
9234 arg = fold_build2 (BIT_AND_EXPR, integer_type_node, arg,
9235 build_int_cst (NULL_TREE,
9236 ~ (unsigned HOST_WIDE_INT) 0x7f));
9237 return fold_build2_loc (loc, EQ_EXPR, integer_type_node,
9238 arg, integer_zero_node);
9242 /* Fold a call to builtin toascii with argument ARG. */
9245 fold_builtin_toascii (location_t loc, tree arg)
9247 if (!validate_arg (arg, INTEGER_TYPE))
9250 /* Transform toascii(c) -> (c & 0x7f). */
9251 return fold_build2_loc (loc, BIT_AND_EXPR, integer_type_node, arg,
9252 build_int_cst (NULL_TREE, 0x7f));
9255 /* Fold a call to builtin isdigit with argument ARG. */
9258 fold_builtin_isdigit (location_t loc, tree arg)
9260 if (!validate_arg (arg, INTEGER_TYPE))
9264 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
9265 /* According to the C standard, isdigit is unaffected by locale.
9266 However, it definitely is affected by the target character set. */
9267 unsigned HOST_WIDE_INT target_digit0
9268 = lang_hooks.to_target_charset ('0');
9270 if (target_digit0 == 0)
9273 arg = fold_convert_loc (loc, unsigned_type_node, arg);
9274 arg = fold_build2 (MINUS_EXPR, unsigned_type_node, arg,
9275 build_int_cst (unsigned_type_node, target_digit0));
9276 return fold_build2_loc (loc, LE_EXPR, integer_type_node, arg,
9277 build_int_cst (unsigned_type_node, 9));
9281 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
9284 fold_builtin_fabs (location_t loc, tree arg, tree type)
9286 if (!validate_arg (arg, REAL_TYPE))
9289 arg = fold_convert_loc (loc, type, arg);
9290 if (TREE_CODE (arg) == REAL_CST)
9291 return fold_abs_const (arg, type);
9292 return fold_build1_loc (loc, ABS_EXPR, type, arg);
9295 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
9298 fold_builtin_abs (location_t loc, tree arg, tree type)
9300 if (!validate_arg (arg, INTEGER_TYPE))
9303 arg = fold_convert_loc (loc, type, arg);
9304 if (TREE_CODE (arg) == INTEGER_CST)
9305 return fold_abs_const (arg, type);
9306 return fold_build1_loc (loc, ABS_EXPR, type, arg);
9309 /* Fold a call to builtin fmin or fmax. */
9312 fold_builtin_fmin_fmax (location_t loc, tree arg0, tree arg1,
9313 tree type, bool max)
9315 if (validate_arg (arg0, REAL_TYPE) && validate_arg (arg1, REAL_TYPE))
9317 /* Calculate the result when the argument is a constant. */
9318 tree res = do_mpfr_arg2 (arg0, arg1, type, (max ? mpfr_max : mpfr_min));
9323 /* If either argument is NaN, return the other one. Avoid the
9324 transformation if we get (and honor) a signalling NaN. Using
9325 omit_one_operand() ensures we create a non-lvalue. */
9326 if (TREE_CODE (arg0) == REAL_CST
9327 && real_isnan (&TREE_REAL_CST (arg0))
9328 && (! HONOR_SNANS (TYPE_MODE (TREE_TYPE (arg0)))
9329 || ! TREE_REAL_CST (arg0).signalling))
9330 return omit_one_operand_loc (loc, type, arg1, arg0);
9331 if (TREE_CODE (arg1) == REAL_CST
9332 && real_isnan (&TREE_REAL_CST (arg1))
9333 && (! HONOR_SNANS (TYPE_MODE (TREE_TYPE (arg1)))
9334 || ! TREE_REAL_CST (arg1).signalling))
9335 return omit_one_operand_loc (loc, type, arg0, arg1);
9337 /* Transform fmin/fmax(x,x) -> x. */
9338 if (operand_equal_p (arg0, arg1, OEP_PURE_SAME))
9339 return omit_one_operand_loc (loc, type, arg0, arg1);
9341 /* Convert fmin/fmax to MIN_EXPR/MAX_EXPR. C99 requires these
9342 functions to return the numeric arg if the other one is NaN.
9343 These tree codes don't honor that, so only transform if
9344 -ffinite-math-only is set. C99 doesn't require -0.0 to be
9345 handled, so we don't have to worry about it either. */
9346 if (flag_finite_math_only)
9347 return fold_build2_loc (loc, (max ? MAX_EXPR : MIN_EXPR), type,
9348 fold_convert_loc (loc, type, arg0),
9349 fold_convert_loc (loc, type, arg1));
9354 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
9357 fold_builtin_carg (location_t loc, tree arg, tree type)
9359 if (validate_arg (arg, COMPLEX_TYPE)
9360 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) == REAL_TYPE)
9362 tree atan2_fn = mathfn_built_in (type, BUILT_IN_ATAN2);
9366 tree new_arg = builtin_save_expr (arg);
9367 tree r_arg = fold_build1_loc (loc, REALPART_EXPR, type, new_arg);
9368 tree i_arg = fold_build1_loc (loc, IMAGPART_EXPR, type, new_arg);
9369 return build_call_expr_loc (loc, atan2_fn, 2, i_arg, r_arg);
9376 /* Fold a call to builtin logb/ilogb. */
9379 fold_builtin_logb (location_t loc, tree arg, tree rettype)
9381 if (! validate_arg (arg, REAL_TYPE))
9386 if (TREE_CODE (arg) == REAL_CST && ! TREE_OVERFLOW (arg))
9388 const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (arg);
9394 /* If arg is Inf or NaN and we're logb, return it. */
9395 if (TREE_CODE (rettype) == REAL_TYPE)
9396 return fold_convert_loc (loc, rettype, arg);
9397 /* Fall through... */
9399 /* Zero may set errno and/or raise an exception for logb, also
9400 for ilogb we don't know FP_ILOGB0. */
9403 /* For normal numbers, proceed iff radix == 2. In GCC,
9404 normalized significands are in the range [0.5, 1.0). We
9405 want the exponent as if they were [1.0, 2.0) so get the
9406 exponent and subtract 1. */
9407 if (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (arg)))->b == 2)
9408 return fold_convert_loc (loc, rettype,
9409 build_int_cst (NULL_TREE,
9410 REAL_EXP (value)-1));
9418 /* Fold a call to builtin significand, if radix == 2. */
9421 fold_builtin_significand (location_t loc, tree arg, tree rettype)
9423 if (! validate_arg (arg, REAL_TYPE))
9428 if (TREE_CODE (arg) == REAL_CST && ! TREE_OVERFLOW (arg))
9430 const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (arg);
9437 /* If arg is +-0, +-Inf or +-NaN, then return it. */
9438 return fold_convert_loc (loc, rettype, arg);
9440 /* For normal numbers, proceed iff radix == 2. */
9441 if (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (arg)))->b == 2)
9443 REAL_VALUE_TYPE result = *value;
9444 /* In GCC, normalized significands are in the range [0.5,
9445 1.0). We want them to be [1.0, 2.0) so set the
9447 SET_REAL_EXP (&result, 1);
9448 return build_real (rettype, result);
9457 /* Fold a call to builtin frexp, we can assume the base is 2. */
9460 fold_builtin_frexp (location_t loc, tree arg0, tree arg1, tree rettype)
9462 if (! validate_arg (arg0, REAL_TYPE) || ! validate_arg (arg1, POINTER_TYPE))
9467 if (!(TREE_CODE (arg0) == REAL_CST && ! TREE_OVERFLOW (arg0)))
9470 arg1 = build_fold_indirect_ref_loc (loc, arg1);
9472 /* Proceed if a valid pointer type was passed in. */
9473 if (TYPE_MAIN_VARIANT (TREE_TYPE (arg1)) == integer_type_node)
9475 const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (arg0);
9481 /* For +-0, return (*exp = 0, +-0). */
9482 exp = integer_zero_node;
9487 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
9488 return omit_one_operand_loc (loc, rettype, arg0, arg1);
9491 /* Since the frexp function always expects base 2, and in
9492 GCC normalized significands are already in the range
9493 [0.5, 1.0), we have exactly what frexp wants. */
9494 REAL_VALUE_TYPE frac_rvt = *value;
9495 SET_REAL_EXP (&frac_rvt, 0);
9496 frac = build_real (rettype, frac_rvt);
9497 exp = build_int_cst (NULL_TREE, REAL_EXP (value));
9504 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
9505 arg1 = fold_build2_loc (loc, MODIFY_EXPR, rettype, arg1, exp);
9506 TREE_SIDE_EFFECTS (arg1) = 1;
9507 return fold_build2_loc (loc, COMPOUND_EXPR, rettype, arg1, frac);
9513 /* Fold a call to builtin ldexp or scalbn/scalbln. If LDEXP is true
9514 then we can assume the base is two. If it's false, then we have to
9515 check the mode of the TYPE parameter in certain cases. */
9518 fold_builtin_load_exponent (location_t loc, tree arg0, tree arg1,
9519 tree type, bool ldexp)
9521 if (validate_arg (arg0, REAL_TYPE) && validate_arg (arg1, INTEGER_TYPE))
9526 /* If arg0 is 0, Inf or NaN, or if arg1 is 0, then return arg0. */
9527 if (real_zerop (arg0) || integer_zerop (arg1)
9528 || (TREE_CODE (arg0) == REAL_CST
9529 && !real_isfinite (&TREE_REAL_CST (arg0))))
9530 return omit_one_operand_loc (loc, type, arg0, arg1);
9532 /* If both arguments are constant, then try to evaluate it. */
9533 if ((ldexp || REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2)
9534 && TREE_CODE (arg0) == REAL_CST && !TREE_OVERFLOW (arg0)
9535 && host_integerp (arg1, 0))
9537 /* Bound the maximum adjustment to twice the range of the
9538 mode's valid exponents. Use abs to ensure the range is
9539 positive as a sanity check. */
9540 const long max_exp_adj = 2 *
9541 labs (REAL_MODE_FORMAT (TYPE_MODE (type))->emax
9542 - REAL_MODE_FORMAT (TYPE_MODE (type))->emin);
9544 /* Get the user-requested adjustment. */
9545 const HOST_WIDE_INT req_exp_adj = tree_low_cst (arg1, 0);
9547 /* The requested adjustment must be inside this range. This
9548 is a preliminary cap to avoid things like overflow, we
9549 may still fail to compute the result for other reasons. */
9550 if (-max_exp_adj < req_exp_adj && req_exp_adj < max_exp_adj)
9552 REAL_VALUE_TYPE initial_result;
9554 real_ldexp (&initial_result, &TREE_REAL_CST (arg0), req_exp_adj);
9556 /* Ensure we didn't overflow. */
9557 if (! real_isinf (&initial_result))
9559 const REAL_VALUE_TYPE trunc_result
9560 = real_value_truncate (TYPE_MODE (type), initial_result);
9562 /* Only proceed if the target mode can hold the
9564 if (REAL_VALUES_EQUAL (initial_result, trunc_result))
9565 return build_real (type, trunc_result);
9574 /* Fold a call to builtin modf. */
9577 fold_builtin_modf (location_t loc, tree arg0, tree arg1, tree rettype)
9579 if (! validate_arg (arg0, REAL_TYPE) || ! validate_arg (arg1, POINTER_TYPE))
9584 if (!(TREE_CODE (arg0) == REAL_CST && ! TREE_OVERFLOW (arg0)))
9587 arg1 = build_fold_indirect_ref_loc (loc, arg1);
9589 /* Proceed if a valid pointer type was passed in. */
9590 if (TYPE_MAIN_VARIANT (TREE_TYPE (arg1)) == TYPE_MAIN_VARIANT (rettype))
9592 const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (arg0);
9593 REAL_VALUE_TYPE trunc, frac;
9599 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
9600 trunc = frac = *value;
9603 /* For +-Inf, return (*arg1 = arg0, +-0). */
9605 frac.sign = value->sign;
9609 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
9610 real_trunc (&trunc, VOIDmode, value);
9611 real_arithmetic (&frac, MINUS_EXPR, value, &trunc);
9612 /* If the original number was negative and already
9613 integral, then the fractional part is -0.0. */
9614 if (value->sign && frac.cl == rvc_zero)
9615 frac.sign = value->sign;
9619 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
9620 arg1 = fold_build2_loc (loc, MODIFY_EXPR, rettype, arg1,
9621 build_real (rettype, trunc));
9622 TREE_SIDE_EFFECTS (arg1) = 1;
9623 return fold_build2_loc (loc, COMPOUND_EXPR, rettype, arg1,
9624 build_real (rettype, frac));
9630 /* Given a location LOC, an interclass builtin function decl FNDECL
9631 and its single argument ARG, return an folded expression computing
9632 the same, or NULL_TREE if we either couldn't or didn't want to fold
9633 (the latter happen if there's an RTL instruction available). */
9636 fold_builtin_interclass_mathfn (location_t loc, tree fndecl, tree arg)
9638 enum machine_mode mode;
9640 if (!validate_arg (arg, REAL_TYPE))
9643 if (interclass_mathfn_icode (arg, fndecl) != CODE_FOR_nothing)
9646 mode = TYPE_MODE (TREE_TYPE (arg));
9648 /* If there is no optab, try generic code. */
9649 switch (DECL_FUNCTION_CODE (fndecl))
9653 CASE_FLT_FN (BUILT_IN_ISINF):
9655 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
9656 tree const isgr_fn = built_in_decls[BUILT_IN_ISGREATER];
9657 tree const type = TREE_TYPE (arg);
9661 get_max_float (REAL_MODE_FORMAT (mode), buf, sizeof (buf));
9662 real_from_string (&r, buf);
9663 result = build_call_expr (isgr_fn, 2,
9664 fold_build1_loc (loc, ABS_EXPR, type, arg),
9665 build_real (type, r));
9668 CASE_FLT_FN (BUILT_IN_FINITE):
9669 case BUILT_IN_ISFINITE:
9671 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
9672 tree const isle_fn = built_in_decls[BUILT_IN_ISLESSEQUAL];
9673 tree const type = TREE_TYPE (arg);
9677 get_max_float (REAL_MODE_FORMAT (mode), buf, sizeof (buf));
9678 real_from_string (&r, buf);
9679 result = build_call_expr (isle_fn, 2,
9680 fold_build1_loc (loc, ABS_EXPR, type, arg),
9681 build_real (type, r));
9682 /*result = fold_build2_loc (loc, UNGT_EXPR,
9683 TREE_TYPE (TREE_TYPE (fndecl)),
9684 fold_build1_loc (loc, ABS_EXPR, type, arg),
9685 build_real (type, r));
9686 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
9687 TREE_TYPE (TREE_TYPE (fndecl)),
9691 case BUILT_IN_ISNORMAL:
9693 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
9694 islessequal(fabs(x),DBL_MAX). */
9695 tree const isle_fn = built_in_decls[BUILT_IN_ISLESSEQUAL];
9696 tree const isge_fn = built_in_decls[BUILT_IN_ISGREATEREQUAL];
9697 tree const type = TREE_TYPE (arg);
9698 REAL_VALUE_TYPE rmax, rmin;
9701 get_max_float (REAL_MODE_FORMAT (mode), buf, sizeof (buf));
9702 real_from_string (&rmax, buf);
9703 sprintf (buf, "0x1p%d", REAL_MODE_FORMAT (mode)->emin - 1);
9704 real_from_string (&rmin, buf);
9705 arg = builtin_save_expr (fold_build1_loc (loc, ABS_EXPR, type, arg));
9706 result = build_call_expr (isle_fn, 2, arg,
9707 build_real (type, rmax));
9708 result = fold_build2 (BIT_AND_EXPR, integer_type_node, result,
9709 build_call_expr (isge_fn, 2, arg,
9710 build_real (type, rmin)));
9720 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
9721 ARG is the argument for the call. */
9724 fold_builtin_classify (location_t loc, tree fndecl, tree arg, int builtin_index)
9726 tree type = TREE_TYPE (TREE_TYPE (fndecl));
9729 if (!validate_arg (arg, REAL_TYPE))
9732 switch (builtin_index)
9734 case BUILT_IN_ISINF:
9735 if (!HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (arg))))
9736 return omit_one_operand_loc (loc, type, integer_zero_node, arg);
9738 if (TREE_CODE (arg) == REAL_CST)
9740 r = TREE_REAL_CST (arg);
9741 if (real_isinf (&r))
9742 return real_compare (GT_EXPR, &r, &dconst0)
9743 ? integer_one_node : integer_minus_one_node;
9745 return integer_zero_node;
9750 case BUILT_IN_ISINF_SIGN:
9752 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
9753 /* In a boolean context, GCC will fold the inner COND_EXPR to
9754 1. So e.g. "if (isinf_sign(x))" would be folded to just
9755 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
9756 tree signbit_fn = mathfn_built_in_1 (TREE_TYPE (arg), BUILT_IN_SIGNBIT, 0);
9757 tree isinf_fn = built_in_decls[BUILT_IN_ISINF];
9758 tree tmp = NULL_TREE;
9760 arg = builtin_save_expr (arg);
9762 if (signbit_fn && isinf_fn)
9764 tree signbit_call = build_call_expr_loc (loc, signbit_fn, 1, arg);
9765 tree isinf_call = build_call_expr_loc (loc, isinf_fn, 1, arg);
9767 signbit_call = fold_build2_loc (loc, NE_EXPR, integer_type_node,
9768 signbit_call, integer_zero_node);
9769 isinf_call = fold_build2_loc (loc, NE_EXPR, integer_type_node,
9770 isinf_call, integer_zero_node);
9772 tmp = fold_build3_loc (loc, COND_EXPR, integer_type_node, signbit_call,
9773 integer_minus_one_node, integer_one_node);
9774 tmp = fold_build3_loc (loc, COND_EXPR, integer_type_node,
9782 case BUILT_IN_ISFINITE:
9783 if (!HONOR_NANS (TYPE_MODE (TREE_TYPE (arg)))
9784 && !HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (arg))))
9785 return omit_one_operand_loc (loc, type, integer_one_node, arg);
9787 if (TREE_CODE (arg) == REAL_CST)
9789 r = TREE_REAL_CST (arg);
9790 return real_isfinite (&r) ? integer_one_node : integer_zero_node;
9795 case BUILT_IN_ISNAN:
9796 if (!HONOR_NANS (TYPE_MODE (TREE_TYPE (arg))))
9797 return omit_one_operand_loc (loc, type, integer_zero_node, arg);
9799 if (TREE_CODE (arg) == REAL_CST)
9801 r = TREE_REAL_CST (arg);
9802 return real_isnan (&r) ? integer_one_node : integer_zero_node;
9805 arg = builtin_save_expr (arg);
9806 return fold_build2_loc (loc, UNORDERED_EXPR, type, arg, arg);
9813 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
9814 This builtin will generate code to return the appropriate floating
9815 point classification depending on the value of the floating point
9816 number passed in. The possible return values must be supplied as
9817 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
9818 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
9819 one floating point argument which is "type generic". */
9822 fold_builtin_fpclassify (location_t loc, tree exp)
9824 tree fp_nan, fp_infinite, fp_normal, fp_subnormal, fp_zero,
9825 arg, type, res, tmp;
9826 enum machine_mode mode;
9830 /* Verify the required arguments in the original call. */
9831 if (!validate_arglist (exp, INTEGER_TYPE, INTEGER_TYPE,
9832 INTEGER_TYPE, INTEGER_TYPE,
9833 INTEGER_TYPE, REAL_TYPE, VOID_TYPE))
9836 fp_nan = CALL_EXPR_ARG (exp, 0);
9837 fp_infinite = CALL_EXPR_ARG (exp, 1);
9838 fp_normal = CALL_EXPR_ARG (exp, 2);
9839 fp_subnormal = CALL_EXPR_ARG (exp, 3);
9840 fp_zero = CALL_EXPR_ARG (exp, 4);
9841 arg = CALL_EXPR_ARG (exp, 5);
9842 type = TREE_TYPE (arg);
9843 mode = TYPE_MODE (type);
9844 arg = builtin_save_expr (fold_build1_loc (loc, ABS_EXPR, type, arg));
9848 (fabs(x) == Inf ? FP_INFINITE :
9849 (fabs(x) >= DBL_MIN ? FP_NORMAL :
9850 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
9852 tmp = fold_build2_loc (loc, EQ_EXPR, integer_type_node, arg,
9853 build_real (type, dconst0));
9854 res = fold_build3_loc (loc, COND_EXPR, integer_type_node,
9855 tmp, fp_zero, fp_subnormal);
9857 sprintf (buf, "0x1p%d", REAL_MODE_FORMAT (mode)->emin - 1);
9858 real_from_string (&r, buf);
9859 tmp = fold_build2_loc (loc, GE_EXPR, integer_type_node,
9860 arg, build_real (type, r));
9861 res = fold_build3_loc (loc, COND_EXPR, integer_type_node, tmp, fp_normal, res);
9863 if (HONOR_INFINITIES (mode))
9866 tmp = fold_build2_loc (loc, EQ_EXPR, integer_type_node, arg,
9867 build_real (type, r));
9868 res = fold_build3_loc (loc, COND_EXPR, integer_type_node, tmp,
9872 if (HONOR_NANS (mode))
9874 tmp = fold_build2_loc (loc, ORDERED_EXPR, integer_type_node, arg, arg);
9875 res = fold_build3_loc (loc, COND_EXPR, integer_type_node, tmp, res, fp_nan);
9881 /* Fold a call to an unordered comparison function such as
9882 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
9883 being called and ARG0 and ARG1 are the arguments for the call.
9884 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
9885 the opposite of the desired result. UNORDERED_CODE is used
9886 for modes that can hold NaNs and ORDERED_CODE is used for
9890 fold_builtin_unordered_cmp (location_t loc, tree fndecl, tree arg0, tree arg1,
9891 enum tree_code unordered_code,
9892 enum tree_code ordered_code)
9894 tree type = TREE_TYPE (TREE_TYPE (fndecl));
9895 enum tree_code code;
9897 enum tree_code code0, code1;
9898 tree cmp_type = NULL_TREE;
9900 type0 = TREE_TYPE (arg0);
9901 type1 = TREE_TYPE (arg1);
9903 code0 = TREE_CODE (type0);
9904 code1 = TREE_CODE (type1);
9906 if (code0 == REAL_TYPE && code1 == REAL_TYPE)
9907 /* Choose the wider of two real types. */
9908 cmp_type = TYPE_PRECISION (type0) >= TYPE_PRECISION (type1)
9910 else if (code0 == REAL_TYPE && code1 == INTEGER_TYPE)
9912 else if (code0 == INTEGER_TYPE && code1 == REAL_TYPE)
9915 arg0 = fold_convert_loc (loc, cmp_type, arg0);
9916 arg1 = fold_convert_loc (loc, cmp_type, arg1);
9918 if (unordered_code == UNORDERED_EXPR)
9920 if (!HONOR_NANS (TYPE_MODE (TREE_TYPE (arg0))))
9921 return omit_two_operands_loc (loc, type, integer_zero_node, arg0, arg1);
9922 return fold_build2_loc (loc, UNORDERED_EXPR, type, arg0, arg1);
9925 code = HONOR_NANS (TYPE_MODE (TREE_TYPE (arg0))) ? unordered_code
9927 return fold_build1_loc (loc, TRUTH_NOT_EXPR, type,
9928 fold_build2_loc (loc, code, type, arg0, arg1));
9931 /* Fold a call to built-in function FNDECL with 0 arguments.
9932 IGNORE is true if the result of the function call is ignored. This
9933 function returns NULL_TREE if no simplification was possible. */
9936 fold_builtin_0 (location_t loc, tree fndecl, bool ignore ATTRIBUTE_UNUSED)
9938 tree type = TREE_TYPE (TREE_TYPE (fndecl));
9939 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
9942 CASE_FLT_FN (BUILT_IN_INF):
9943 case BUILT_IN_INFD32:
9944 case BUILT_IN_INFD64:
9945 case BUILT_IN_INFD128:
9946 return fold_builtin_inf (loc, type, true);
9948 CASE_FLT_FN (BUILT_IN_HUGE_VAL):
9949 return fold_builtin_inf (loc, type, false);
9951 case BUILT_IN_CLASSIFY_TYPE:
9952 return fold_builtin_classify_type (NULL_TREE);
9960 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
9961 IGNORE is true if the result of the function call is ignored. This
9962 function returns NULL_TREE if no simplification was possible. */
9965 fold_builtin_1 (location_t loc, tree fndecl, tree arg0, bool ignore)
9967 tree type = TREE_TYPE (TREE_TYPE (fndecl));
9968 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
9972 case BUILT_IN_CONSTANT_P:
9974 tree val = fold_builtin_constant_p (arg0);
9976 /* Gimplification will pull the CALL_EXPR for the builtin out of
9977 an if condition. When not optimizing, we'll not CSE it back.
9978 To avoid link error types of regressions, return false now. */
9979 if (!val && !optimize)
9980 val = integer_zero_node;
9985 case BUILT_IN_CLASSIFY_TYPE:
9986 return fold_builtin_classify_type (arg0);
9988 case BUILT_IN_STRLEN:
9989 return fold_builtin_strlen (loc, arg0);
9991 CASE_FLT_FN (BUILT_IN_FABS):
9992 return fold_builtin_fabs (loc, arg0, type);
9996 case BUILT_IN_LLABS:
9997 case BUILT_IN_IMAXABS:
9998 return fold_builtin_abs (loc, arg0, type);
10000 CASE_FLT_FN (BUILT_IN_CONJ):
10001 if (validate_arg (arg0, COMPLEX_TYPE)
10002 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10003 return fold_build1_loc (loc, CONJ_EXPR, type, arg0);
10006 CASE_FLT_FN (BUILT_IN_CREAL):
10007 if (validate_arg (arg0, COMPLEX_TYPE)
10008 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10009 return non_lvalue_loc (loc, fold_build1_loc (loc, REALPART_EXPR, type, arg0));;
10012 CASE_FLT_FN (BUILT_IN_CIMAG):
10013 if (validate_arg (arg0, COMPLEX_TYPE)
10014 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10015 return non_lvalue_loc (loc, fold_build1_loc (loc, IMAGPART_EXPR, type, arg0));
10018 CASE_FLT_FN (BUILT_IN_CCOS):
10019 return fold_builtin_ccos(loc, arg0, type, fndecl, /*hyper=*/ false);
10021 CASE_FLT_FN (BUILT_IN_CCOSH):
10022 return fold_builtin_ccos(loc, arg0, type, fndecl, /*hyper=*/ true);
10025 CASE_FLT_FN (BUILT_IN_CSIN):
10026 if (validate_arg (arg0, COMPLEX_TYPE)
10027 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10028 return do_mpc_arg1 (arg0, type, mpc_sin);
10031 CASE_FLT_FN (BUILT_IN_CSINH):
10032 if (validate_arg (arg0, COMPLEX_TYPE)
10033 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10034 return do_mpc_arg1 (arg0, type, mpc_sinh);
10037 CASE_FLT_FN (BUILT_IN_CTAN):
10038 if (validate_arg (arg0, COMPLEX_TYPE)
10039 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10040 return do_mpc_arg1 (arg0, type, mpc_tan);
10043 CASE_FLT_FN (BUILT_IN_CTANH):
10044 if (validate_arg (arg0, COMPLEX_TYPE)
10045 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10046 return do_mpc_arg1 (arg0, type, mpc_tanh);
10049 CASE_FLT_FN (BUILT_IN_CLOG):
10050 if (validate_arg (arg0, COMPLEX_TYPE)
10051 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10052 return do_mpc_arg1 (arg0, type, mpc_log);
10055 CASE_FLT_FN (BUILT_IN_CSQRT):
10056 if (validate_arg (arg0, COMPLEX_TYPE)
10057 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10058 return do_mpc_arg1 (arg0, type, mpc_sqrt);
10061 #ifdef HAVE_mpc_arc
10062 CASE_FLT_FN (BUILT_IN_CASIN):
10063 if (validate_arg (arg0, COMPLEX_TYPE)
10064 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10065 return do_mpc_arg1 (arg0, type, mpc_asin);
10068 CASE_FLT_FN (BUILT_IN_CACOS):
10069 if (validate_arg (arg0, COMPLEX_TYPE)
10070 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10071 return do_mpc_arg1 (arg0, type, mpc_acos);
10074 CASE_FLT_FN (BUILT_IN_CATAN):
10075 if (validate_arg (arg0, COMPLEX_TYPE)
10076 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10077 return do_mpc_arg1 (arg0, type, mpc_atan);
10080 CASE_FLT_FN (BUILT_IN_CASINH):
10081 if (validate_arg (arg0, COMPLEX_TYPE)
10082 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10083 return do_mpc_arg1 (arg0, type, mpc_asinh);
10086 CASE_FLT_FN (BUILT_IN_CACOSH):
10087 if (validate_arg (arg0, COMPLEX_TYPE)
10088 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10089 return do_mpc_arg1 (arg0, type, mpc_acosh);
10092 CASE_FLT_FN (BUILT_IN_CATANH):
10093 if (validate_arg (arg0, COMPLEX_TYPE)
10094 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10095 return do_mpc_arg1 (arg0, type, mpc_atanh);
10097 #endif /* HAVE_mpc_arc */
10098 #endif /* HAVE_mpc */
10100 CASE_FLT_FN (BUILT_IN_CABS):
10101 return fold_builtin_cabs (loc, arg0, type, fndecl);
10103 CASE_FLT_FN (BUILT_IN_CARG):
10104 return fold_builtin_carg (loc, arg0, type);
10106 CASE_FLT_FN (BUILT_IN_SQRT):
10107 return fold_builtin_sqrt (loc, arg0, type);
10109 CASE_FLT_FN (BUILT_IN_CBRT):
10110 return fold_builtin_cbrt (loc, arg0, type);
10112 CASE_FLT_FN (BUILT_IN_ASIN):
10113 if (validate_arg (arg0, REAL_TYPE))
10114 return do_mpfr_arg1 (arg0, type, mpfr_asin,
10115 &dconstm1, &dconst1, true);
10118 CASE_FLT_FN (BUILT_IN_ACOS):
10119 if (validate_arg (arg0, REAL_TYPE))
10120 return do_mpfr_arg1 (arg0, type, mpfr_acos,
10121 &dconstm1, &dconst1, true);
10124 CASE_FLT_FN (BUILT_IN_ATAN):
10125 if (validate_arg (arg0, REAL_TYPE))
10126 return do_mpfr_arg1 (arg0, type, mpfr_atan, NULL, NULL, 0);
10129 CASE_FLT_FN (BUILT_IN_ASINH):
10130 if (validate_arg (arg0, REAL_TYPE))
10131 return do_mpfr_arg1 (arg0, type, mpfr_asinh, NULL, NULL, 0);
10134 CASE_FLT_FN (BUILT_IN_ACOSH):
10135 if (validate_arg (arg0, REAL_TYPE))
10136 return do_mpfr_arg1 (arg0, type, mpfr_acosh,
10137 &dconst1, NULL, true);
10140 CASE_FLT_FN (BUILT_IN_ATANH):
10141 if (validate_arg (arg0, REAL_TYPE))
10142 return do_mpfr_arg1 (arg0, type, mpfr_atanh,
10143 &dconstm1, &dconst1, false);
10146 CASE_FLT_FN (BUILT_IN_SIN):
10147 if (validate_arg (arg0, REAL_TYPE))
10148 return do_mpfr_arg1 (arg0, type, mpfr_sin, NULL, NULL, 0);
10151 CASE_FLT_FN (BUILT_IN_COS):
10152 return fold_builtin_cos (loc, arg0, type, fndecl);
10154 CASE_FLT_FN (BUILT_IN_TAN):
10155 return fold_builtin_tan (arg0, type);
10157 CASE_FLT_FN (BUILT_IN_CEXP):
10158 return fold_builtin_cexp (loc, arg0, type);
10160 CASE_FLT_FN (BUILT_IN_CEXPI):
10161 if (validate_arg (arg0, REAL_TYPE))
10162 return do_mpfr_sincos (arg0, NULL_TREE, NULL_TREE);
10165 CASE_FLT_FN (BUILT_IN_SINH):
10166 if (validate_arg (arg0, REAL_TYPE))
10167 return do_mpfr_arg1 (arg0, type, mpfr_sinh, NULL, NULL, 0);
10170 CASE_FLT_FN (BUILT_IN_COSH):
10171 return fold_builtin_cosh (loc, arg0, type, fndecl);
10173 CASE_FLT_FN (BUILT_IN_TANH):
10174 if (validate_arg (arg0, REAL_TYPE))
10175 return do_mpfr_arg1 (arg0, type, mpfr_tanh, NULL, NULL, 0);
10178 CASE_FLT_FN (BUILT_IN_ERF):
10179 if (validate_arg (arg0, REAL_TYPE))
10180 return do_mpfr_arg1 (arg0, type, mpfr_erf, NULL, NULL, 0);
10183 CASE_FLT_FN (BUILT_IN_ERFC):
10184 if (validate_arg (arg0, REAL_TYPE))
10185 return do_mpfr_arg1 (arg0, type, mpfr_erfc, NULL, NULL, 0);
10188 CASE_FLT_FN (BUILT_IN_TGAMMA):
10189 if (validate_arg (arg0, REAL_TYPE))
10190 return do_mpfr_arg1 (arg0, type, mpfr_gamma, NULL, NULL, 0);
10193 CASE_FLT_FN (BUILT_IN_EXP):
10194 return fold_builtin_exponent (loc, fndecl, arg0, mpfr_exp);
10196 CASE_FLT_FN (BUILT_IN_EXP2):
10197 return fold_builtin_exponent (loc, fndecl, arg0, mpfr_exp2);
10199 CASE_FLT_FN (BUILT_IN_EXP10):
10200 CASE_FLT_FN (BUILT_IN_POW10):
10201 return fold_builtin_exponent (loc, fndecl, arg0, mpfr_exp10);
10203 CASE_FLT_FN (BUILT_IN_EXPM1):
10204 if (validate_arg (arg0, REAL_TYPE))
10205 return do_mpfr_arg1 (arg0, type, mpfr_expm1, NULL, NULL, 0);
10208 CASE_FLT_FN (BUILT_IN_LOG):
10209 return fold_builtin_logarithm (loc, fndecl, arg0, mpfr_log);
10211 CASE_FLT_FN (BUILT_IN_LOG2):
10212 return fold_builtin_logarithm (loc, fndecl, arg0, mpfr_log2);
10214 CASE_FLT_FN (BUILT_IN_LOG10):
10215 return fold_builtin_logarithm (loc, fndecl, arg0, mpfr_log10);
10217 CASE_FLT_FN (BUILT_IN_LOG1P):
10218 if (validate_arg (arg0, REAL_TYPE))
10219 return do_mpfr_arg1 (arg0, type, mpfr_log1p,
10220 &dconstm1, NULL, false);
10223 CASE_FLT_FN (BUILT_IN_J0):
10224 if (validate_arg (arg0, REAL_TYPE))
10225 return do_mpfr_arg1 (arg0, type, mpfr_j0,
10229 CASE_FLT_FN (BUILT_IN_J1):
10230 if (validate_arg (arg0, REAL_TYPE))
10231 return do_mpfr_arg1 (arg0, type, mpfr_j1,
10235 CASE_FLT_FN (BUILT_IN_Y0):
10236 if (validate_arg (arg0, REAL_TYPE))
10237 return do_mpfr_arg1 (arg0, type, mpfr_y0,
10238 &dconst0, NULL, false);
10241 CASE_FLT_FN (BUILT_IN_Y1):
10242 if (validate_arg (arg0, REAL_TYPE))
10243 return do_mpfr_arg1 (arg0, type, mpfr_y1,
10244 &dconst0, NULL, false);
10247 CASE_FLT_FN (BUILT_IN_NAN):
10248 case BUILT_IN_NAND32:
10249 case BUILT_IN_NAND64:
10250 case BUILT_IN_NAND128:
10251 return fold_builtin_nan (arg0, type, true);
10253 CASE_FLT_FN (BUILT_IN_NANS):
10254 return fold_builtin_nan (arg0, type, false);
10256 CASE_FLT_FN (BUILT_IN_FLOOR):
10257 return fold_builtin_floor (loc, fndecl, arg0);
10259 CASE_FLT_FN (BUILT_IN_CEIL):
10260 return fold_builtin_ceil (loc, fndecl, arg0);
10262 CASE_FLT_FN (BUILT_IN_TRUNC):
10263 return fold_builtin_trunc (loc, fndecl, arg0);
10265 CASE_FLT_FN (BUILT_IN_ROUND):
10266 return fold_builtin_round (loc, fndecl, arg0);
10268 CASE_FLT_FN (BUILT_IN_NEARBYINT):
10269 CASE_FLT_FN (BUILT_IN_RINT):
10270 return fold_trunc_transparent_mathfn (loc, fndecl, arg0);
10272 CASE_FLT_FN (BUILT_IN_LCEIL):
10273 CASE_FLT_FN (BUILT_IN_LLCEIL):
10274 CASE_FLT_FN (BUILT_IN_LFLOOR):
10275 CASE_FLT_FN (BUILT_IN_LLFLOOR):
10276 CASE_FLT_FN (BUILT_IN_LROUND):
10277 CASE_FLT_FN (BUILT_IN_LLROUND):
10278 return fold_builtin_int_roundingfn (loc, fndecl, arg0);
10280 CASE_FLT_FN (BUILT_IN_LRINT):
10281 CASE_FLT_FN (BUILT_IN_LLRINT):
10282 return fold_fixed_mathfn (loc, fndecl, arg0);
10284 case BUILT_IN_BSWAP32:
10285 case BUILT_IN_BSWAP64:
10286 return fold_builtin_bswap (fndecl, arg0);
10288 CASE_INT_FN (BUILT_IN_FFS):
10289 CASE_INT_FN (BUILT_IN_CLZ):
10290 CASE_INT_FN (BUILT_IN_CTZ):
10291 CASE_INT_FN (BUILT_IN_POPCOUNT):
10292 CASE_INT_FN (BUILT_IN_PARITY):
10293 return fold_builtin_bitop (fndecl, arg0);
10295 CASE_FLT_FN (BUILT_IN_SIGNBIT):
10296 return fold_builtin_signbit (loc, arg0, type);
10298 CASE_FLT_FN (BUILT_IN_SIGNIFICAND):
10299 return fold_builtin_significand (loc, arg0, type);
10301 CASE_FLT_FN (BUILT_IN_ILOGB):
10302 CASE_FLT_FN (BUILT_IN_LOGB):
10303 return fold_builtin_logb (loc, arg0, type);
10305 case BUILT_IN_ISASCII:
10306 return fold_builtin_isascii (loc, arg0);
10308 case BUILT_IN_TOASCII:
10309 return fold_builtin_toascii (loc, arg0);
10311 case BUILT_IN_ISDIGIT:
10312 return fold_builtin_isdigit (loc, arg0);
10314 CASE_FLT_FN (BUILT_IN_FINITE):
10315 case BUILT_IN_FINITED32:
10316 case BUILT_IN_FINITED64:
10317 case BUILT_IN_FINITED128:
10318 case BUILT_IN_ISFINITE:
10320 tree ret = fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISFINITE);
10323 return fold_builtin_interclass_mathfn (loc, fndecl, arg0);
10326 CASE_FLT_FN (BUILT_IN_ISINF):
10327 case BUILT_IN_ISINFD32:
10328 case BUILT_IN_ISINFD64:
10329 case BUILT_IN_ISINFD128:
10331 tree ret = fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISINF);
10334 return fold_builtin_interclass_mathfn (loc, fndecl, arg0);
10337 case BUILT_IN_ISNORMAL:
10338 return fold_builtin_interclass_mathfn (loc, fndecl, arg0);
10340 case BUILT_IN_ISINF_SIGN:
10341 return fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISINF_SIGN);
10343 CASE_FLT_FN (BUILT_IN_ISNAN):
10344 case BUILT_IN_ISNAND32:
10345 case BUILT_IN_ISNAND64:
10346 case BUILT_IN_ISNAND128:
10347 return fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISNAN);
10349 case BUILT_IN_PRINTF:
10350 case BUILT_IN_PRINTF_UNLOCKED:
10351 case BUILT_IN_VPRINTF:
10352 return fold_builtin_printf (loc, fndecl, arg0, NULL_TREE, ignore, fcode);
10362 /* Fold a call to built-in function FNDECL with 2 arguments, ARG0 and ARG1.
10363 IGNORE is true if the result of the function call is ignored. This
10364 function returns NULL_TREE if no simplification was possible. */
10367 fold_builtin_2 (location_t loc, tree fndecl, tree arg0, tree arg1, bool ignore)
10369 tree type = TREE_TYPE (TREE_TYPE (fndecl));
10370 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
10374 CASE_FLT_FN (BUILT_IN_JN):
10375 if (validate_arg (arg0, INTEGER_TYPE)
10376 && validate_arg (arg1, REAL_TYPE))
10377 return do_mpfr_bessel_n (arg0, arg1, type, mpfr_jn, NULL, 0);
10380 CASE_FLT_FN (BUILT_IN_YN):
10381 if (validate_arg (arg0, INTEGER_TYPE)
10382 && validate_arg (arg1, REAL_TYPE))
10383 return do_mpfr_bessel_n (arg0, arg1, type, mpfr_yn,
10387 CASE_FLT_FN (BUILT_IN_DREM):
10388 CASE_FLT_FN (BUILT_IN_REMAINDER):
10389 if (validate_arg (arg0, REAL_TYPE)
10390 && validate_arg(arg1, REAL_TYPE))
10391 return do_mpfr_arg2 (arg0, arg1, type, mpfr_remainder);
10394 CASE_FLT_FN_REENT (BUILT_IN_GAMMA): /* GAMMA_R */
10395 CASE_FLT_FN_REENT (BUILT_IN_LGAMMA): /* LGAMMA_R */
10396 if (validate_arg (arg0, REAL_TYPE)
10397 && validate_arg(arg1, POINTER_TYPE))
10398 return do_mpfr_lgamma_r (arg0, arg1, type);
10401 CASE_FLT_FN (BUILT_IN_ATAN2):
10402 if (validate_arg (arg0, REAL_TYPE)
10403 && validate_arg(arg1, REAL_TYPE))
10404 return do_mpfr_arg2 (arg0, arg1, type, mpfr_atan2);
10407 CASE_FLT_FN (BUILT_IN_FDIM):
10408 if (validate_arg (arg0, REAL_TYPE)
10409 && validate_arg(arg1, REAL_TYPE))
10410 return do_mpfr_arg2 (arg0, arg1, type, mpfr_dim);
10413 CASE_FLT_FN (BUILT_IN_HYPOT):
10414 return fold_builtin_hypot (loc, fndecl, arg0, arg1, type);
10416 #ifdef HAVE_mpc_pow
10417 CASE_FLT_FN (BUILT_IN_CPOW):
10418 if (validate_arg (arg0, COMPLEX_TYPE)
10419 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE
10420 && validate_arg (arg1, COMPLEX_TYPE)
10421 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg1))) == REAL_TYPE)
10422 return do_mpc_arg2 (arg0, arg1, type, /*do_nonfinite=*/ 0, mpc_pow);
10426 CASE_FLT_FN (BUILT_IN_LDEXP):
10427 return fold_builtin_load_exponent (loc, arg0, arg1, type, /*ldexp=*/true);
10428 CASE_FLT_FN (BUILT_IN_SCALBN):
10429 CASE_FLT_FN (BUILT_IN_SCALBLN):
10430 return fold_builtin_load_exponent (loc, arg0, arg1,
10431 type, /*ldexp=*/false);
10433 CASE_FLT_FN (BUILT_IN_FREXP):
10434 return fold_builtin_frexp (loc, arg0, arg1, type);
10436 CASE_FLT_FN (BUILT_IN_MODF):
10437 return fold_builtin_modf (loc, arg0, arg1, type);
10439 case BUILT_IN_BZERO:
10440 return fold_builtin_bzero (loc, arg0, arg1, ignore);
10442 case BUILT_IN_FPUTS:
10443 return fold_builtin_fputs (loc, arg0, arg1, ignore, false, NULL_TREE);
10445 case BUILT_IN_FPUTS_UNLOCKED:
10446 return fold_builtin_fputs (loc, arg0, arg1, ignore, true, NULL_TREE);
10448 case BUILT_IN_STRSTR:
10449 return fold_builtin_strstr (loc, arg0, arg1, type);
10451 case BUILT_IN_STRCAT:
10452 return fold_builtin_strcat (loc, arg0, arg1);
10454 case BUILT_IN_STRSPN:
10455 return fold_builtin_strspn (loc, arg0, arg1);
10457 case BUILT_IN_STRCSPN:
10458 return fold_builtin_strcspn (loc, arg0, arg1);
10460 case BUILT_IN_STRCHR:
10461 case BUILT_IN_INDEX:
10462 return fold_builtin_strchr (loc, arg0, arg1, type);
10464 case BUILT_IN_STRRCHR:
10465 case BUILT_IN_RINDEX:
10466 return fold_builtin_strrchr (loc, arg0, arg1, type);
10468 case BUILT_IN_STRCPY:
10469 return fold_builtin_strcpy (loc, fndecl, arg0, arg1, NULL_TREE);
10471 case BUILT_IN_STPCPY:
10474 tree fn = implicit_built_in_decls[BUILT_IN_STRCPY];
10478 return build_call_expr_loc (loc, fn, 2, arg0, arg1);
10481 return fold_builtin_stpcpy (loc, fndecl, arg0, arg1);
10484 case BUILT_IN_STRCMP:
10485 return fold_builtin_strcmp (loc, arg0, arg1);
10487 case BUILT_IN_STRPBRK:
10488 return fold_builtin_strpbrk (loc, arg0, arg1, type);
10490 case BUILT_IN_EXPECT:
10491 return fold_builtin_expect (loc, arg0, arg1);
10493 CASE_FLT_FN (BUILT_IN_POW):
10494 return fold_builtin_pow (loc, fndecl, arg0, arg1, type);
10496 CASE_FLT_FN (BUILT_IN_POWI):
10497 return fold_builtin_powi (loc, fndecl, arg0, arg1, type);
10499 CASE_FLT_FN (BUILT_IN_COPYSIGN):
10500 return fold_builtin_copysign (loc, fndecl, arg0, arg1, type);
10502 CASE_FLT_FN (BUILT_IN_FMIN):
10503 return fold_builtin_fmin_fmax (loc, arg0, arg1, type, /*max=*/false);
10505 CASE_FLT_FN (BUILT_IN_FMAX):
10506 return fold_builtin_fmin_fmax (loc, arg0, arg1, type, /*max=*/true);
10508 case BUILT_IN_ISGREATER:
10509 return fold_builtin_unordered_cmp (loc, fndecl,
10510 arg0, arg1, UNLE_EXPR, LE_EXPR);
10511 case BUILT_IN_ISGREATEREQUAL:
10512 return fold_builtin_unordered_cmp (loc, fndecl,
10513 arg0, arg1, UNLT_EXPR, LT_EXPR);
10514 case BUILT_IN_ISLESS:
10515 return fold_builtin_unordered_cmp (loc, fndecl,
10516 arg0, arg1, UNGE_EXPR, GE_EXPR);
10517 case BUILT_IN_ISLESSEQUAL:
10518 return fold_builtin_unordered_cmp (loc, fndecl,
10519 arg0, arg1, UNGT_EXPR, GT_EXPR);
10520 case BUILT_IN_ISLESSGREATER:
10521 return fold_builtin_unordered_cmp (loc, fndecl,
10522 arg0, arg1, UNEQ_EXPR, EQ_EXPR);
10523 case BUILT_IN_ISUNORDERED:
10524 return fold_builtin_unordered_cmp (loc, fndecl,
10525 arg0, arg1, UNORDERED_EXPR,
10528 /* We do the folding for va_start in the expander. */
10529 case BUILT_IN_VA_START:
10532 case BUILT_IN_SPRINTF:
10533 return fold_builtin_sprintf (loc, arg0, arg1, NULL_TREE, ignore);
10535 case BUILT_IN_OBJECT_SIZE:
10536 return fold_builtin_object_size (arg0, arg1);
10538 case BUILT_IN_PRINTF:
10539 case BUILT_IN_PRINTF_UNLOCKED:
10540 case BUILT_IN_VPRINTF:
10541 return fold_builtin_printf (loc, fndecl, arg0, arg1, ignore, fcode);
10543 case BUILT_IN_PRINTF_CHK:
10544 case BUILT_IN_VPRINTF_CHK:
10545 if (!validate_arg (arg0, INTEGER_TYPE)
10546 || TREE_SIDE_EFFECTS (arg0))
10549 return fold_builtin_printf (loc, fndecl,
10550 arg1, NULL_TREE, ignore, fcode);
10553 case BUILT_IN_FPRINTF:
10554 case BUILT_IN_FPRINTF_UNLOCKED:
10555 case BUILT_IN_VFPRINTF:
10556 return fold_builtin_fprintf (loc, fndecl, arg0, arg1, NULL_TREE,
10565 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
10566 and ARG2. IGNORE is true if the result of the function call is ignored.
10567 This function returns NULL_TREE if no simplification was possible. */
10570 fold_builtin_3 (location_t loc, tree fndecl,
10571 tree arg0, tree arg1, tree arg2, bool ignore)
10573 tree type = TREE_TYPE (TREE_TYPE (fndecl));
10574 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
10578 CASE_FLT_FN (BUILT_IN_SINCOS):
10579 return fold_builtin_sincos (loc, arg0, arg1, arg2);
10581 CASE_FLT_FN (BUILT_IN_FMA):
10582 if (validate_arg (arg0, REAL_TYPE)
10583 && validate_arg(arg1, REAL_TYPE)
10584 && validate_arg(arg2, REAL_TYPE))
10585 return do_mpfr_arg3 (arg0, arg1, arg2, type, mpfr_fma);
10588 CASE_FLT_FN (BUILT_IN_REMQUO):
10589 if (validate_arg (arg0, REAL_TYPE)
10590 && validate_arg(arg1, REAL_TYPE)
10591 && validate_arg(arg2, POINTER_TYPE))
10592 return do_mpfr_remquo (arg0, arg1, arg2);
10595 case BUILT_IN_MEMSET:
10596 return fold_builtin_memset (loc, arg0, arg1, arg2, type, ignore);
10598 case BUILT_IN_BCOPY:
10599 return fold_builtin_memory_op (loc, arg1, arg0, arg2,
10600 void_type_node, true, /*endp=*/3);
10602 case BUILT_IN_MEMCPY:
10603 return fold_builtin_memory_op (loc, arg0, arg1, arg2,
10604 type, ignore, /*endp=*/0);
10606 case BUILT_IN_MEMPCPY:
10607 return fold_builtin_memory_op (loc, arg0, arg1, arg2,
10608 type, ignore, /*endp=*/1);
10610 case BUILT_IN_MEMMOVE:
10611 return fold_builtin_memory_op (loc, arg0, arg1, arg2,
10612 type, ignore, /*endp=*/3);
10614 case BUILT_IN_STRNCAT:
10615 return fold_builtin_strncat (loc, arg0, arg1, arg2);
10617 case BUILT_IN_STRNCPY:
10618 return fold_builtin_strncpy (loc, fndecl, arg0, arg1, arg2, NULL_TREE);
10620 case BUILT_IN_STRNCMP:
10621 return fold_builtin_strncmp (loc, arg0, arg1, arg2);
10623 case BUILT_IN_MEMCHR:
10624 return fold_builtin_memchr (loc, arg0, arg1, arg2, type);
10626 case BUILT_IN_BCMP:
10627 case BUILT_IN_MEMCMP:
10628 return fold_builtin_memcmp (loc, arg0, arg1, arg2);;
10630 case BUILT_IN_SPRINTF:
10631 return fold_builtin_sprintf (loc, arg0, arg1, arg2, ignore);
10633 case BUILT_IN_STRCPY_CHK:
10634 case BUILT_IN_STPCPY_CHK:
10635 return fold_builtin_stxcpy_chk (loc, fndecl, arg0, arg1, arg2, NULL_TREE,
10638 case BUILT_IN_STRCAT_CHK:
10639 return fold_builtin_strcat_chk (loc, fndecl, arg0, arg1, arg2);
10641 case BUILT_IN_PRINTF_CHK:
10642 case BUILT_IN_VPRINTF_CHK:
10643 if (!validate_arg (arg0, INTEGER_TYPE)
10644 || TREE_SIDE_EFFECTS (arg0))
10647 return fold_builtin_printf (loc, fndecl, arg1, arg2, ignore, fcode);
10650 case BUILT_IN_FPRINTF:
10651 case BUILT_IN_FPRINTF_UNLOCKED:
10652 case BUILT_IN_VFPRINTF:
10653 return fold_builtin_fprintf (loc, fndecl, arg0, arg1, arg2,
10656 case BUILT_IN_FPRINTF_CHK:
10657 case BUILT_IN_VFPRINTF_CHK:
10658 if (!validate_arg (arg1, INTEGER_TYPE)
10659 || TREE_SIDE_EFFECTS (arg1))
10662 return fold_builtin_fprintf (loc, fndecl, arg0, arg2, NULL_TREE,
10671 /* Fold a call to built-in function FNDECL with 4 arguments, ARG0, ARG1,
10672 ARG2, and ARG3. IGNORE is true if the result of the function call is
10673 ignored. This function returns NULL_TREE if no simplification was
10677 fold_builtin_4 (location_t loc, tree fndecl,
10678 tree arg0, tree arg1, tree arg2, tree arg3, bool ignore)
10680 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
10684 case BUILT_IN_MEMCPY_CHK:
10685 case BUILT_IN_MEMPCPY_CHK:
10686 case BUILT_IN_MEMMOVE_CHK:
10687 case BUILT_IN_MEMSET_CHK:
10688 return fold_builtin_memory_chk (loc, fndecl, arg0, arg1, arg2, arg3,
10690 DECL_FUNCTION_CODE (fndecl));
10692 case BUILT_IN_STRNCPY_CHK:
10693 return fold_builtin_strncpy_chk (loc, arg0, arg1, arg2, arg3, NULL_TREE);
10695 case BUILT_IN_STRNCAT_CHK:
10696 return fold_builtin_strncat_chk (loc, fndecl, arg0, arg1, arg2, arg3);
10698 case BUILT_IN_FPRINTF_CHK:
10699 case BUILT_IN_VFPRINTF_CHK:
10700 if (!validate_arg (arg1, INTEGER_TYPE)
10701 || TREE_SIDE_EFFECTS (arg1))
10704 return fold_builtin_fprintf (loc, fndecl, arg0, arg2, arg3,
10714 /* Fold a call to built-in function FNDECL. ARGS is an array of NARGS
10715 arguments, where NARGS <= 4. IGNORE is true if the result of the
10716 function call is ignored. This function returns NULL_TREE if no
10717 simplification was possible. Note that this only folds builtins with
10718 fixed argument patterns. Foldings that do varargs-to-varargs
10719 transformations, or that match calls with more than 4 arguments,
10720 need to be handled with fold_builtin_varargs instead. */
10722 #define MAX_ARGS_TO_FOLD_BUILTIN 4
10725 fold_builtin_n (location_t loc, tree fndecl, tree *args, int nargs, bool ignore)
10727 tree ret = NULL_TREE;
10732 ret = fold_builtin_0 (loc, fndecl, ignore);
10735 ret = fold_builtin_1 (loc, fndecl, args[0], ignore);
10738 ret = fold_builtin_2 (loc, fndecl, args[0], args[1], ignore);
10741 ret = fold_builtin_3 (loc, fndecl, args[0], args[1], args[2], ignore);
10744 ret = fold_builtin_4 (loc, fndecl, args[0], args[1], args[2], args[3],
10752 ret = build1 (NOP_EXPR, TREE_TYPE (ret), ret);
10753 SET_EXPR_LOCATION (ret, loc);
10754 TREE_NO_WARNING (ret) = 1;
10760 /* Builtins with folding operations that operate on "..." arguments
10761 need special handling; we need to store the arguments in a convenient
10762 data structure before attempting any folding. Fortunately there are
10763 only a few builtins that fall into this category. FNDECL is the
10764 function, EXP is the CALL_EXPR for the call, and IGNORE is true if the
10765 result of the function call is ignored. */
10768 fold_builtin_varargs (location_t loc, tree fndecl, tree exp,
10769 bool ignore ATTRIBUTE_UNUSED)
10771 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
10772 tree ret = NULL_TREE;
10776 case BUILT_IN_SPRINTF_CHK:
10777 case BUILT_IN_VSPRINTF_CHK:
10778 ret = fold_builtin_sprintf_chk (loc, exp, fcode);
10781 case BUILT_IN_SNPRINTF_CHK:
10782 case BUILT_IN_VSNPRINTF_CHK:
10783 ret = fold_builtin_snprintf_chk (loc, exp, NULL_TREE, fcode);
10786 case BUILT_IN_FPCLASSIFY:
10787 ret = fold_builtin_fpclassify (loc, exp);
10795 ret = build1 (NOP_EXPR, TREE_TYPE (ret), ret);
10796 SET_EXPR_LOCATION (ret, loc);
10797 TREE_NO_WARNING (ret) = 1;
10803 /* Return true if FNDECL shouldn't be folded right now.
10804 If a built-in function has an inline attribute always_inline
10805 wrapper, defer folding it after always_inline functions have
10806 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
10807 might not be performed. */
10810 avoid_folding_inline_builtin (tree fndecl)
10812 return (DECL_DECLARED_INLINE_P (fndecl)
10813 && DECL_DISREGARD_INLINE_LIMITS (fndecl)
10815 && !cfun->always_inline_functions_inlined
10816 && lookup_attribute ("always_inline", DECL_ATTRIBUTES (fndecl)));
10819 /* A wrapper function for builtin folding that prevents warnings for
10820 "statement without effect" and the like, caused by removing the
10821 call node earlier than the warning is generated. */
10824 fold_call_expr (location_t loc, tree exp, bool ignore)
10826 tree ret = NULL_TREE;
10827 tree fndecl = get_callee_fndecl (exp);
10829 && TREE_CODE (fndecl) == FUNCTION_DECL
10830 && DECL_BUILT_IN (fndecl)
10831 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
10832 yet. Defer folding until we see all the arguments
10833 (after inlining). */
10834 && !CALL_EXPR_VA_ARG_PACK (exp))
10836 int nargs = call_expr_nargs (exp);
10838 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
10839 instead last argument is __builtin_va_arg_pack (). Defer folding
10840 even in that case, until arguments are finalized. */
10841 if (nargs && TREE_CODE (CALL_EXPR_ARG (exp, nargs - 1)) == CALL_EXPR)
10843 tree fndecl2 = get_callee_fndecl (CALL_EXPR_ARG (exp, nargs - 1));
10845 && TREE_CODE (fndecl2) == FUNCTION_DECL
10846 && DECL_BUILT_IN_CLASS (fndecl2) == BUILT_IN_NORMAL
10847 && DECL_FUNCTION_CODE (fndecl2) == BUILT_IN_VA_ARG_PACK)
10851 if (avoid_folding_inline_builtin (fndecl))
10854 /* FIXME: Don't use a list in this interface. */
10855 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
10856 return targetm.fold_builtin (fndecl, CALL_EXPR_ARGS (exp), ignore);
10859 if (nargs <= MAX_ARGS_TO_FOLD_BUILTIN)
10861 tree *args = CALL_EXPR_ARGP (exp);
10862 ret = fold_builtin_n (loc, fndecl, args, nargs, ignore);
10865 ret = fold_builtin_varargs (loc, fndecl, exp, ignore);
10873 /* Conveniently construct a function call expression. FNDECL names the
10874 function to be called and ARGLIST is a TREE_LIST of arguments. */
10877 build_function_call_expr (location_t loc, tree fndecl, tree arglist)
10879 tree fntype = TREE_TYPE (fndecl);
10880 tree fn = build1 (ADDR_EXPR, build_pointer_type (fntype), fndecl);
10881 int n = list_length (arglist);
10882 tree *argarray = (tree *) alloca (n * sizeof (tree));
10885 for (i = 0; i < n; i++, arglist = TREE_CHAIN (arglist))
10886 argarray[i] = TREE_VALUE (arglist);
10887 return fold_builtin_call_array (loc, TREE_TYPE (fntype), fn, n, argarray);
10890 /* Conveniently construct a function call expression. FNDECL names the
10891 function to be called, N is the number of arguments, and the "..."
10892 parameters are the argument expressions. */
10895 build_call_expr_loc (location_t loc, tree fndecl, int n, ...)
10898 tree fntype = TREE_TYPE (fndecl);
10899 tree fn = build1 (ADDR_EXPR, build_pointer_type (fntype), fndecl);
10900 tree *argarray = (tree *) alloca (n * sizeof (tree));
10904 for (i = 0; i < n; i++)
10905 argarray[i] = va_arg (ap, tree);
10907 return fold_builtin_call_array (loc, TREE_TYPE (fntype), fn, n, argarray);
10910 /* Construct a CALL_EXPR with type TYPE with FN as the function expression.
10911 N arguments are passed in the array ARGARRAY. */
10914 fold_builtin_call_array (location_t loc, tree type,
10919 tree ret = NULL_TREE;
10923 if (TREE_CODE (fn) == ADDR_EXPR)
10925 tree fndecl = TREE_OPERAND (fn, 0);
10926 if (TREE_CODE (fndecl) == FUNCTION_DECL
10927 && DECL_BUILT_IN (fndecl))
10929 /* If last argument is __builtin_va_arg_pack (), arguments to this
10930 function are not finalized yet. Defer folding until they are. */
10931 if (n && TREE_CODE (argarray[n - 1]) == CALL_EXPR)
10933 tree fndecl2 = get_callee_fndecl (argarray[n - 1]);
10935 && TREE_CODE (fndecl2) == FUNCTION_DECL
10936 && DECL_BUILT_IN_CLASS (fndecl2) == BUILT_IN_NORMAL
10937 && DECL_FUNCTION_CODE (fndecl2) == BUILT_IN_VA_ARG_PACK)
10938 return build_call_array_loc (loc, type, fn, n, argarray);
10940 if (avoid_folding_inline_builtin (fndecl))
10941 return build_call_array_loc (loc, type, fn, n, argarray);
10942 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
10944 tree arglist = NULL_TREE;
10945 for (i = n - 1; i >= 0; i--)
10946 arglist = tree_cons (NULL_TREE, argarray[i], arglist);
10947 ret = targetm.fold_builtin (fndecl, arglist, false);
10950 return build_call_array_loc (loc, type, fn, n, argarray);
10952 else if (n <= MAX_ARGS_TO_FOLD_BUILTIN)
10954 /* First try the transformations that don't require consing up
10956 ret = fold_builtin_n (loc, fndecl, argarray, n, false);
10961 /* If we got this far, we need to build an exp. */
10962 exp = build_call_array_loc (loc, type, fn, n, argarray);
10963 ret = fold_builtin_varargs (loc, fndecl, exp, false);
10964 return ret ? ret : exp;
10968 return build_call_array_loc (loc, type, fn, n, argarray);
10971 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
10972 along with N new arguments specified as the "..." parameters. SKIP
10973 is the number of arguments in EXP to be omitted. This function is used
10974 to do varargs-to-varargs transformations. */
10977 rewrite_call_expr (location_t loc, tree exp, int skip, tree fndecl, int n, ...)
10979 int oldnargs = call_expr_nargs (exp);
10980 int nargs = oldnargs - skip + n;
10981 tree fntype = TREE_TYPE (fndecl);
10982 tree fn = build1 (ADDR_EXPR, build_pointer_type (fntype), fndecl);
10990 buffer = XALLOCAVEC (tree, nargs);
10992 for (i = 0; i < n; i++)
10993 buffer[i] = va_arg (ap, tree);
10995 for (j = skip; j < oldnargs; j++, i++)
10996 buffer[i] = CALL_EXPR_ARG (exp, j);
10999 buffer = CALL_EXPR_ARGP (exp) + skip;
11001 return fold (build_call_array_loc (loc, TREE_TYPE (exp), fn, nargs, buffer));
11004 /* Validate a single argument ARG against a tree code CODE representing
11008 validate_arg (const_tree arg, enum tree_code code)
11012 else if (code == POINTER_TYPE)
11013 return POINTER_TYPE_P (TREE_TYPE (arg));
11014 else if (code == INTEGER_TYPE)
11015 return INTEGRAL_TYPE_P (TREE_TYPE (arg));
11016 return code == TREE_CODE (TREE_TYPE (arg));
11019 /* This function validates the types of a function call argument list
11020 against a specified list of tree_codes. If the last specifier is a 0,
11021 that represents an ellipses, otherwise the last specifier must be a
11024 This is the GIMPLE version of validate_arglist. Eventually we want to
11025 completely convert builtins.c to work from GIMPLEs and the tree based
11026 validate_arglist will then be removed. */
11029 validate_gimple_arglist (const_gimple call, ...)
11031 enum tree_code code;
11037 va_start (ap, call);
11042 code = (enum tree_code) va_arg (ap, int);
11046 /* This signifies an ellipses, any further arguments are all ok. */
11050 /* This signifies an endlink, if no arguments remain, return
11051 true, otherwise return false. */
11052 res = (i == gimple_call_num_args (call));
11055 /* If no parameters remain or the parameter's code does not
11056 match the specified code, return false. Otherwise continue
11057 checking any remaining arguments. */
11058 arg = gimple_call_arg (call, i++);
11059 if (!validate_arg (arg, code))
11066 /* We need gotos here since we can only have one VA_CLOSE in a
11074 /* This function validates the types of a function call argument list
11075 against a specified list of tree_codes. If the last specifier is a 0,
11076 that represents an ellipses, otherwise the last specifier must be a
11080 validate_arglist (const_tree callexpr, ...)
11082 enum tree_code code;
11085 const_call_expr_arg_iterator iter;
11088 va_start (ap, callexpr);
11089 init_const_call_expr_arg_iterator (callexpr, &iter);
11093 code = (enum tree_code) va_arg (ap, int);
11097 /* This signifies an ellipses, any further arguments are all ok. */
11101 /* This signifies an endlink, if no arguments remain, return
11102 true, otherwise return false. */
11103 res = !more_const_call_expr_args_p (&iter);
11106 /* If no parameters remain or the parameter's code does not
11107 match the specified code, return false. Otherwise continue
11108 checking any remaining arguments. */
11109 arg = next_const_call_expr_arg (&iter);
11110 if (!validate_arg (arg, code))
11117 /* We need gotos here since we can only have one VA_CLOSE in a
11125 /* Default target-specific builtin expander that does nothing. */
11128 default_expand_builtin (tree exp ATTRIBUTE_UNUSED,
11129 rtx target ATTRIBUTE_UNUSED,
11130 rtx subtarget ATTRIBUTE_UNUSED,
11131 enum machine_mode mode ATTRIBUTE_UNUSED,
11132 int ignore ATTRIBUTE_UNUSED)
11137 /* Returns true is EXP represents data that would potentially reside
11138 in a readonly section. */
11141 readonly_data_expr (tree exp)
11145 if (TREE_CODE (exp) != ADDR_EXPR)
11148 exp = get_base_address (TREE_OPERAND (exp, 0));
11152 /* Make sure we call decl_readonly_section only for trees it
11153 can handle (since it returns true for everything it doesn't
11155 if (TREE_CODE (exp) == STRING_CST
11156 || TREE_CODE (exp) == CONSTRUCTOR
11157 || (TREE_CODE (exp) == VAR_DECL && TREE_STATIC (exp)))
11158 return decl_readonly_section (exp, 0);
11163 /* Simplify a call to the strstr builtin. S1 and S2 are the arguments
11164 to the call, and TYPE is its return type.
11166 Return NULL_TREE if no simplification was possible, otherwise return the
11167 simplified form of the call as a tree.
11169 The simplified form may be a constant or other expression which
11170 computes the same value, but in a more efficient manner (including
11171 calls to other builtin functions).
11173 The call may contain arguments which need to be evaluated, but
11174 which are not useful to determine the result of the call. In
11175 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11176 COMPOUND_EXPR will be an argument which must be evaluated.
11177 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11178 COMPOUND_EXPR in the chain will contain the tree for the simplified
11179 form of the builtin function call. */
11182 fold_builtin_strstr (location_t loc, tree s1, tree s2, tree type)
11184 if (!validate_arg (s1, POINTER_TYPE)
11185 || !validate_arg (s2, POINTER_TYPE))
11190 const char *p1, *p2;
11192 p2 = c_getstr (s2);
11196 p1 = c_getstr (s1);
11199 const char *r = strstr (p1, p2);
11203 return build_int_cst (TREE_TYPE (s1), 0);
11205 /* Return an offset into the constant string argument. */
11206 tem = fold_build2_loc (loc, POINTER_PLUS_EXPR, TREE_TYPE (s1),
11207 s1, size_int (r - p1));
11208 return fold_convert_loc (loc, type, tem);
11211 /* The argument is const char *, and the result is char *, so we need
11212 a type conversion here to avoid a warning. */
11214 return fold_convert_loc (loc, type, s1);
11219 fn = implicit_built_in_decls[BUILT_IN_STRCHR];
11223 /* New argument list transforming strstr(s1, s2) to
11224 strchr(s1, s2[0]). */
11225 return build_call_expr_loc (loc, fn, 2, s1, build_int_cst (NULL_TREE, p2[0]));
11229 /* Simplify a call to the strchr builtin. S1 and S2 are the arguments to
11230 the call, and TYPE is its return type.
11232 Return NULL_TREE if no simplification was possible, otherwise return the
11233 simplified form of the call as a tree.
11235 The simplified form may be a constant or other expression which
11236 computes the same value, but in a more efficient manner (including
11237 calls to other builtin functions).
11239 The call may contain arguments which need to be evaluated, but
11240 which are not useful to determine the result of the call. In
11241 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11242 COMPOUND_EXPR will be an argument which must be evaluated.
11243 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11244 COMPOUND_EXPR in the chain will contain the tree for the simplified
11245 form of the builtin function call. */
11248 fold_builtin_strchr (location_t loc, tree s1, tree s2, tree type)
11250 if (!validate_arg (s1, POINTER_TYPE)
11251 || !validate_arg (s2, INTEGER_TYPE))
11257 if (TREE_CODE (s2) != INTEGER_CST)
11260 p1 = c_getstr (s1);
11267 if (target_char_cast (s2, &c))
11270 r = strchr (p1, c);
11273 return build_int_cst (TREE_TYPE (s1), 0);
11275 /* Return an offset into the constant string argument. */
11276 tem = fold_build2_loc (loc, POINTER_PLUS_EXPR, TREE_TYPE (s1),
11277 s1, size_int (r - p1));
11278 return fold_convert_loc (loc, type, tem);
11284 /* Simplify a call to the strrchr builtin. S1 and S2 are the arguments to
11285 the call, and TYPE is its return type.
11287 Return NULL_TREE if no simplification was possible, otherwise return the
11288 simplified form of the call as a tree.
11290 The simplified form may be a constant or other expression which
11291 computes the same value, but in a more efficient manner (including
11292 calls to other builtin functions).
11294 The call may contain arguments which need to be evaluated, but
11295 which are not useful to determine the result of the call. In
11296 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11297 COMPOUND_EXPR will be an argument which must be evaluated.
11298 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11299 COMPOUND_EXPR in the chain will contain the tree for the simplified
11300 form of the builtin function call. */
11303 fold_builtin_strrchr (location_t loc, tree s1, tree s2, tree type)
11305 if (!validate_arg (s1, POINTER_TYPE)
11306 || !validate_arg (s2, INTEGER_TYPE))
11313 if (TREE_CODE (s2) != INTEGER_CST)
11316 p1 = c_getstr (s1);
11323 if (target_char_cast (s2, &c))
11326 r = strrchr (p1, c);
11329 return build_int_cst (TREE_TYPE (s1), 0);
11331 /* Return an offset into the constant string argument. */
11332 tem = fold_build2_loc (loc, POINTER_PLUS_EXPR, TREE_TYPE (s1),
11333 s1, size_int (r - p1));
11334 return fold_convert_loc (loc, type, tem);
11337 if (! integer_zerop (s2))
11340 fn = implicit_built_in_decls[BUILT_IN_STRCHR];
11344 /* Transform strrchr(s1, '\0') to strchr(s1, '\0'). */
11345 return build_call_expr_loc (loc, fn, 2, s1, s2);
11349 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
11350 to the call, and TYPE is its return type.
11352 Return NULL_TREE if no simplification was possible, otherwise return the
11353 simplified form of the call as a tree.
11355 The simplified form may be a constant or other expression which
11356 computes the same value, but in a more efficient manner (including
11357 calls to other builtin functions).
11359 The call may contain arguments which need to be evaluated, but
11360 which are not useful to determine the result of the call. In
11361 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11362 COMPOUND_EXPR will be an argument which must be evaluated.
11363 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11364 COMPOUND_EXPR in the chain will contain the tree for the simplified
11365 form of the builtin function call. */
11368 fold_builtin_strpbrk (location_t loc, tree s1, tree s2, tree type)
11370 if (!validate_arg (s1, POINTER_TYPE)
11371 || !validate_arg (s2, POINTER_TYPE))
11376 const char *p1, *p2;
11378 p2 = c_getstr (s2);
11382 p1 = c_getstr (s1);
11385 const char *r = strpbrk (p1, p2);
11389 return build_int_cst (TREE_TYPE (s1), 0);
11391 /* Return an offset into the constant string argument. */
11392 tem = fold_build2_loc (loc, POINTER_PLUS_EXPR, TREE_TYPE (s1),
11393 s1, size_int (r - p1));
11394 return fold_convert_loc (loc, type, tem);
11398 /* strpbrk(x, "") == NULL.
11399 Evaluate and ignore s1 in case it had side-effects. */
11400 return omit_one_operand_loc (loc, TREE_TYPE (s1), integer_zero_node, s1);
11403 return NULL_TREE; /* Really call strpbrk. */
11405 fn = implicit_built_in_decls[BUILT_IN_STRCHR];
11409 /* New argument list transforming strpbrk(s1, s2) to
11410 strchr(s1, s2[0]). */
11411 return build_call_expr_loc (loc, fn, 2, s1, build_int_cst (NULL_TREE, p2[0]));
11415 /* Simplify a call to the strcat builtin. DST and SRC are the arguments
11418 Return NULL_TREE if no simplification was possible, otherwise return the
11419 simplified form of the call as a tree.
11421 The simplified form may be a constant or other expression which
11422 computes the same value, but in a more efficient manner (including
11423 calls to other builtin functions).
11425 The call may contain arguments which need to be evaluated, but
11426 which are not useful to determine the result of the call. In
11427 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11428 COMPOUND_EXPR will be an argument which must be evaluated.
11429 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11430 COMPOUND_EXPR in the chain will contain the tree for the simplified
11431 form of the builtin function call. */
11434 fold_builtin_strcat (location_t loc ATTRIBUTE_UNUSED, tree dst, tree src)
11436 if (!validate_arg (dst, POINTER_TYPE)
11437 || !validate_arg (src, POINTER_TYPE))
11441 const char *p = c_getstr (src);
11443 /* If the string length is zero, return the dst parameter. */
11444 if (p && *p == '\0')
11447 if (optimize_insn_for_speed_p ())
11449 /* See if we can store by pieces into (dst + strlen(dst)). */
11451 tree strlen_fn = implicit_built_in_decls[BUILT_IN_STRLEN];
11452 tree strcpy_fn = implicit_built_in_decls[BUILT_IN_STRCPY];
11454 if (!strlen_fn || !strcpy_fn)
11457 /* If we don't have a movstr we don't want to emit an strcpy
11458 call. We have to do that if the length of the source string
11459 isn't computable (in that case we can use memcpy probably
11460 later expanding to a sequence of mov instructions). If we
11461 have movstr instructions we can emit strcpy calls. */
11464 tree len = c_strlen (src, 1);
11465 if (! len || TREE_SIDE_EFFECTS (len))
11469 /* Stabilize the argument list. */
11470 dst = builtin_save_expr (dst);
11472 /* Create strlen (dst). */
11473 newdst = build_call_expr_loc (loc, strlen_fn, 1, dst);
11474 /* Create (dst p+ strlen (dst)). */
11476 newdst = fold_build2_loc (loc, POINTER_PLUS_EXPR,
11477 TREE_TYPE (dst), dst, newdst);
11478 newdst = builtin_save_expr (newdst);
11480 call = build_call_expr_loc (loc, strcpy_fn, 2, newdst, src);
11481 return build2 (COMPOUND_EXPR, TREE_TYPE (dst), call, dst);
11487 /* Simplify a call to the strncat builtin. DST, SRC, and LEN are the
11488 arguments to the call.
11490 Return NULL_TREE if no simplification was possible, otherwise return the
11491 simplified form of the call as a tree.
11493 The simplified form may be a constant or other expression which
11494 computes the same value, but in a more efficient manner (including
11495 calls to other builtin functions).
11497 The call may contain arguments which need to be evaluated, but
11498 which are not useful to determine the result of the call. In
11499 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11500 COMPOUND_EXPR will be an argument which must be evaluated.
11501 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11502 COMPOUND_EXPR in the chain will contain the tree for the simplified
11503 form of the builtin function call. */
11506 fold_builtin_strncat (location_t loc, tree dst, tree src, tree len)
11508 if (!validate_arg (dst, POINTER_TYPE)
11509 || !validate_arg (src, POINTER_TYPE)
11510 || !validate_arg (len, INTEGER_TYPE))
11514 const char *p = c_getstr (src);
11516 /* If the requested length is zero, or the src parameter string
11517 length is zero, return the dst parameter. */
11518 if (integer_zerop (len) || (p && *p == '\0'))
11519 return omit_two_operands_loc (loc, TREE_TYPE (dst), dst, src, len);
11521 /* If the requested len is greater than or equal to the string
11522 length, call strcat. */
11523 if (TREE_CODE (len) == INTEGER_CST && p
11524 && compare_tree_int (len, strlen (p)) >= 0)
11526 tree fn = implicit_built_in_decls[BUILT_IN_STRCAT];
11528 /* If the replacement _DECL isn't initialized, don't do the
11533 return build_call_expr_loc (loc, fn, 2, dst, src);
11539 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
11542 Return NULL_TREE if no simplification was possible, otherwise return the
11543 simplified form of the call as a tree.
11545 The simplified form may be a constant or other expression which
11546 computes the same value, but in a more efficient manner (including
11547 calls to other builtin functions).
11549 The call may contain arguments which need to be evaluated, but
11550 which are not useful to determine the result of the call. In
11551 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11552 COMPOUND_EXPR will be an argument which must be evaluated.
11553 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11554 COMPOUND_EXPR in the chain will contain the tree for the simplified
11555 form of the builtin function call. */
11558 fold_builtin_strspn (location_t loc, tree s1, tree s2)
11560 if (!validate_arg (s1, POINTER_TYPE)
11561 || !validate_arg (s2, POINTER_TYPE))
11565 const char *p1 = c_getstr (s1), *p2 = c_getstr (s2);
11567 /* If both arguments are constants, evaluate at compile-time. */
11570 const size_t r = strspn (p1, p2);
11571 return size_int (r);
11574 /* If either argument is "", return NULL_TREE. */
11575 if ((p1 && *p1 == '\0') || (p2 && *p2 == '\0'))
11576 /* Evaluate and ignore both arguments in case either one has
11578 return omit_two_operands_loc (loc, size_type_node, size_zero_node,
11584 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
11587 Return NULL_TREE if no simplification was possible, otherwise return the
11588 simplified form of the call as a tree.
11590 The simplified form may be a constant or other expression which
11591 computes the same value, but in a more efficient manner (including
11592 calls to other builtin functions).
11594 The call may contain arguments which need to be evaluated, but
11595 which are not useful to determine the result of the call. In
11596 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11597 COMPOUND_EXPR will be an argument which must be evaluated.
11598 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11599 COMPOUND_EXPR in the chain will contain the tree for the simplified
11600 form of the builtin function call. */
11603 fold_builtin_strcspn (location_t loc, tree s1, tree s2)
11605 if (!validate_arg (s1, POINTER_TYPE)
11606 || !validate_arg (s2, POINTER_TYPE))
11610 const char *p1 = c_getstr (s1), *p2 = c_getstr (s2);
11612 /* If both arguments are constants, evaluate at compile-time. */
11615 const size_t r = strcspn (p1, p2);
11616 return size_int (r);
11619 /* If the first argument is "", return NULL_TREE. */
11620 if (p1 && *p1 == '\0')
11622 /* Evaluate and ignore argument s2 in case it has
11624 return omit_one_operand_loc (loc, size_type_node,
11625 size_zero_node, s2);
11628 /* If the second argument is "", return __builtin_strlen(s1). */
11629 if (p2 && *p2 == '\0')
11631 tree fn = implicit_built_in_decls[BUILT_IN_STRLEN];
11633 /* If the replacement _DECL isn't initialized, don't do the
11638 return build_call_expr_loc (loc, fn, 1, s1);
11644 /* Fold a call to the fputs builtin. ARG0 and ARG1 are the arguments
11645 to the call. IGNORE is true if the value returned
11646 by the builtin will be ignored. UNLOCKED is true is true if this
11647 actually a call to fputs_unlocked. If LEN in non-NULL, it represents
11648 the known length of the string. Return NULL_TREE if no simplification
11652 fold_builtin_fputs (location_t loc, tree arg0, tree arg1,
11653 bool ignore, bool unlocked, tree len)
11655 /* If we're using an unlocked function, assume the other unlocked
11656 functions exist explicitly. */
11657 tree const fn_fputc = unlocked ? built_in_decls[BUILT_IN_FPUTC_UNLOCKED]
11658 : implicit_built_in_decls[BUILT_IN_FPUTC];
11659 tree const fn_fwrite = unlocked ? built_in_decls[BUILT_IN_FWRITE_UNLOCKED]
11660 : implicit_built_in_decls[BUILT_IN_FWRITE];
11662 /* If the return value is used, don't do the transformation. */
11666 /* Verify the arguments in the original call. */
11667 if (!validate_arg (arg0, POINTER_TYPE)
11668 || !validate_arg (arg1, POINTER_TYPE))
11672 len = c_strlen (arg0, 0);
11674 /* Get the length of the string passed to fputs. If the length
11675 can't be determined, punt. */
11677 || TREE_CODE (len) != INTEGER_CST)
11680 switch (compare_tree_int (len, 1))
11682 case -1: /* length is 0, delete the call entirely . */
11683 return omit_one_operand_loc (loc, integer_type_node,
11684 integer_zero_node, arg1);;
11686 case 0: /* length is 1, call fputc. */
11688 const char *p = c_getstr (arg0);
11693 return build_call_expr_loc (loc, fn_fputc, 2,
11694 build_int_cst (NULL_TREE, p[0]), arg1);
11700 case 1: /* length is greater than 1, call fwrite. */
11702 /* If optimizing for size keep fputs. */
11703 if (optimize_function_for_size_p (cfun))
11705 /* New argument list transforming fputs(string, stream) to
11706 fwrite(string, 1, len, stream). */
11708 return build_call_expr_loc (loc, fn_fwrite, 4, arg0,
11709 size_one_node, len, arg1);
11714 gcc_unreachable ();
11719 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
11720 produced. False otherwise. This is done so that we don't output the error
11721 or warning twice or three times. */
11724 fold_builtin_next_arg (tree exp, bool va_start_p)
11726 tree fntype = TREE_TYPE (current_function_decl);
11727 int nargs = call_expr_nargs (exp);
11730 if (TYPE_ARG_TYPES (fntype) == 0
11731 || (TREE_VALUE (tree_last (TYPE_ARG_TYPES (fntype)))
11732 == void_type_node))
11734 error ("%<va_start%> used in function with fixed args");
11740 if (va_start_p && (nargs != 2))
11742 error ("wrong number of arguments to function %<va_start%>");
11745 arg = CALL_EXPR_ARG (exp, 1);
11747 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
11748 when we checked the arguments and if needed issued a warning. */
11753 /* Evidently an out of date version of <stdarg.h>; can't validate
11754 va_start's second argument, but can still work as intended. */
11755 warning (0, "%<__builtin_next_arg%> called without an argument");
11758 else if (nargs > 1)
11760 error ("wrong number of arguments to function %<__builtin_next_arg%>");
11763 arg = CALL_EXPR_ARG (exp, 0);
11766 if (TREE_CODE (arg) == SSA_NAME)
11767 arg = SSA_NAME_VAR (arg);
11769 /* We destructively modify the call to be __builtin_va_start (ap, 0)
11770 or __builtin_next_arg (0) the first time we see it, after checking
11771 the arguments and if needed issuing a warning. */
11772 if (!integer_zerop (arg))
11774 tree last_parm = tree_last (DECL_ARGUMENTS (current_function_decl));
11776 /* Strip off all nops for the sake of the comparison. This
11777 is not quite the same as STRIP_NOPS. It does more.
11778 We must also strip off INDIRECT_EXPR for C++ reference
11780 while (CONVERT_EXPR_P (arg)
11781 || TREE_CODE (arg) == INDIRECT_REF)
11782 arg = TREE_OPERAND (arg, 0);
11783 if (arg != last_parm)
11785 /* FIXME: Sometimes with the tree optimizers we can get the
11786 not the last argument even though the user used the last
11787 argument. We just warn and set the arg to be the last
11788 argument so that we will get wrong-code because of
11790 warning (0, "second parameter of %<va_start%> not last named argument");
11793 /* Undefined by C99 7.15.1.4p4 (va_start):
11794 "If the parameter parmN is declared with the register storage
11795 class, with a function or array type, or with a type that is
11796 not compatible with the type that results after application of
11797 the default argument promotions, the behavior is undefined."
11799 else if (DECL_REGISTER (arg))
11800 warning (0, "undefined behaviour when second parameter of "
11801 "%<va_start%> is declared with %<register%> storage");
11803 /* We want to verify the second parameter just once before the tree
11804 optimizers are run and then avoid keeping it in the tree,
11805 as otherwise we could warn even for correct code like:
11806 void foo (int i, ...)
11807 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
11809 CALL_EXPR_ARG (exp, 1) = integer_zero_node;
11811 CALL_EXPR_ARG (exp, 0) = integer_zero_node;
11817 /* Simplify a call to the sprintf builtin with arguments DEST, FMT, and ORIG.
11818 ORIG may be null if this is a 2-argument call. We don't attempt to
11819 simplify calls with more than 3 arguments.
11821 Return NULL_TREE if no simplification was possible, otherwise return the
11822 simplified form of the call as a tree. If IGNORED is true, it means that
11823 the caller does not use the returned value of the function. */
11826 fold_builtin_sprintf (location_t loc, tree dest, tree fmt,
11827 tree orig, int ignored)
11830 const char *fmt_str = NULL;
11832 /* Verify the required arguments in the original call. We deal with two
11833 types of sprintf() calls: 'sprintf (str, fmt)' and
11834 'sprintf (dest, "%s", orig)'. */
11835 if (!validate_arg (dest, POINTER_TYPE)
11836 || !validate_arg (fmt, POINTER_TYPE))
11838 if (orig && !validate_arg (orig, POINTER_TYPE))
11841 /* Check whether the format is a literal string constant. */
11842 fmt_str = c_getstr (fmt);
11843 if (fmt_str == NULL)
11847 retval = NULL_TREE;
11849 if (!init_target_chars ())
11852 /* If the format doesn't contain % args or %%, use strcpy. */
11853 if (strchr (fmt_str, target_percent) == NULL)
11855 tree fn = implicit_built_in_decls[BUILT_IN_STRCPY];
11860 /* Don't optimize sprintf (buf, "abc", ptr++). */
11864 /* Convert sprintf (str, fmt) into strcpy (str, fmt) when
11865 'format' is known to contain no % formats. */
11866 call = build_call_expr_loc (loc, fn, 2, dest, fmt);
11868 retval = build_int_cst (NULL_TREE, strlen (fmt_str));
11871 /* If the format is "%s", use strcpy if the result isn't used. */
11872 else if (fmt_str && strcmp (fmt_str, target_percent_s) == 0)
11875 fn = implicit_built_in_decls[BUILT_IN_STRCPY];
11880 /* Don't crash on sprintf (str1, "%s"). */
11884 /* Convert sprintf (str1, "%s", str2) into strcpy (str1, str2). */
11887 retval = c_strlen (orig, 1);
11888 if (!retval || TREE_CODE (retval) != INTEGER_CST)
11891 call = build_call_expr_loc (loc, fn, 2, dest, orig);
11894 if (call && retval)
11896 retval = fold_convert_loc
11897 (loc, TREE_TYPE (TREE_TYPE (implicit_built_in_decls[BUILT_IN_SPRINTF])),
11899 return build2 (COMPOUND_EXPR, TREE_TYPE (retval), call, retval);
11905 /* Expand a call EXP to __builtin_object_size. */
11908 expand_builtin_object_size (tree exp)
11911 int object_size_type;
11912 tree fndecl = get_callee_fndecl (exp);
11914 if (!validate_arglist (exp, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
11916 error ("%Kfirst argument of %D must be a pointer, second integer constant",
11918 expand_builtin_trap ();
11922 ost = CALL_EXPR_ARG (exp, 1);
11925 if (TREE_CODE (ost) != INTEGER_CST
11926 || tree_int_cst_sgn (ost) < 0
11927 || compare_tree_int (ost, 3) > 0)
11929 error ("%Klast argument of %D is not integer constant between 0 and 3",
11931 expand_builtin_trap ();
11935 object_size_type = tree_low_cst (ost, 0);
11937 return object_size_type < 2 ? constm1_rtx : const0_rtx;
11940 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
11941 FCODE is the BUILT_IN_* to use.
11942 Return NULL_RTX if we failed; the caller should emit a normal call,
11943 otherwise try to get the result in TARGET, if convenient (and in
11944 mode MODE if that's convenient). */
11947 expand_builtin_memory_chk (tree exp, rtx target, enum machine_mode mode,
11948 enum built_in_function fcode)
11950 tree dest, src, len, size;
11952 if (!validate_arglist (exp,
11954 fcode == BUILT_IN_MEMSET_CHK
11955 ? INTEGER_TYPE : POINTER_TYPE,
11956 INTEGER_TYPE, INTEGER_TYPE, VOID_TYPE))
11959 dest = CALL_EXPR_ARG (exp, 0);
11960 src = CALL_EXPR_ARG (exp, 1);
11961 len = CALL_EXPR_ARG (exp, 2);
11962 size = CALL_EXPR_ARG (exp, 3);
11964 if (! host_integerp (size, 1))
11967 if (host_integerp (len, 1) || integer_all_onesp (size))
11971 if (! integer_all_onesp (size) && tree_int_cst_lt (size, len))
11973 warning_at (tree_nonartificial_location (exp),
11974 0, "%Kcall to %D will always overflow destination buffer",
11975 exp, get_callee_fndecl (exp));
11980 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
11981 mem{cpy,pcpy,move,set} is available. */
11984 case BUILT_IN_MEMCPY_CHK:
11985 fn = built_in_decls[BUILT_IN_MEMCPY];
11987 case BUILT_IN_MEMPCPY_CHK:
11988 fn = built_in_decls[BUILT_IN_MEMPCPY];
11990 case BUILT_IN_MEMMOVE_CHK:
11991 fn = built_in_decls[BUILT_IN_MEMMOVE];
11993 case BUILT_IN_MEMSET_CHK:
11994 fn = built_in_decls[BUILT_IN_MEMSET];
12003 fn = build_call_nofold (fn, 3, dest, src, len);
12004 gcc_assert (TREE_CODE (fn) == CALL_EXPR);
12005 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
12006 return expand_expr (fn, target, mode, EXPAND_NORMAL);
12008 else if (fcode == BUILT_IN_MEMSET_CHK)
12012 unsigned int dest_align
12013 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
12015 /* If DEST is not a pointer type, call the normal function. */
12016 if (dest_align == 0)
12019 /* If SRC and DEST are the same (and not volatile), do nothing. */
12020 if (operand_equal_p (src, dest, 0))
12024 if (fcode != BUILT_IN_MEMPCPY_CHK)
12026 /* Evaluate and ignore LEN in case it has side-effects. */
12027 expand_expr (len, const0_rtx, VOIDmode, EXPAND_NORMAL);
12028 return expand_expr (dest, target, mode, EXPAND_NORMAL);
12031 expr = fold_build2 (POINTER_PLUS_EXPR, TREE_TYPE (dest), dest, len);
12032 return expand_expr (expr, target, mode, EXPAND_NORMAL);
12035 /* __memmove_chk special case. */
12036 if (fcode == BUILT_IN_MEMMOVE_CHK)
12038 unsigned int src_align
12039 = get_pointer_alignment (src, BIGGEST_ALIGNMENT);
12041 if (src_align == 0)
12044 /* If src is categorized for a readonly section we can use
12045 normal __memcpy_chk. */
12046 if (readonly_data_expr (src))
12048 tree fn = built_in_decls[BUILT_IN_MEMCPY_CHK];
12051 fn = build_call_nofold (fn, 4, dest, src, len, size);
12052 gcc_assert (TREE_CODE (fn) == CALL_EXPR);
12053 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
12054 return expand_expr (fn, target, mode, EXPAND_NORMAL);
12061 /* Emit warning if a buffer overflow is detected at compile time. */
12064 maybe_emit_chk_warning (tree exp, enum built_in_function fcode)
12068 location_t loc = tree_nonartificial_location (exp);
12072 case BUILT_IN_STRCPY_CHK:
12073 case BUILT_IN_STPCPY_CHK:
12074 /* For __strcat_chk the warning will be emitted only if overflowing
12075 by at least strlen (dest) + 1 bytes. */
12076 case BUILT_IN_STRCAT_CHK:
12077 len = CALL_EXPR_ARG (exp, 1);
12078 size = CALL_EXPR_ARG (exp, 2);
12081 case BUILT_IN_STRNCAT_CHK:
12082 case BUILT_IN_STRNCPY_CHK:
12083 len = CALL_EXPR_ARG (exp, 2);
12084 size = CALL_EXPR_ARG (exp, 3);
12086 case BUILT_IN_SNPRINTF_CHK:
12087 case BUILT_IN_VSNPRINTF_CHK:
12088 len = CALL_EXPR_ARG (exp, 1);
12089 size = CALL_EXPR_ARG (exp, 3);
12092 gcc_unreachable ();
12098 if (! host_integerp (size, 1) || integer_all_onesp (size))
12103 len = c_strlen (len, 1);
12104 if (! len || ! host_integerp (len, 1) || tree_int_cst_lt (len, size))
12107 else if (fcode == BUILT_IN_STRNCAT_CHK)
12109 tree src = CALL_EXPR_ARG (exp, 1);
12110 if (! src || ! host_integerp (len, 1) || tree_int_cst_lt (len, size))
12112 src = c_strlen (src, 1);
12113 if (! src || ! host_integerp (src, 1))
12115 warning_at (loc, 0, "%Kcall to %D might overflow destination buffer",
12116 exp, get_callee_fndecl (exp));
12119 else if (tree_int_cst_lt (src, size))
12122 else if (! host_integerp (len, 1) || ! tree_int_cst_lt (size, len))
12125 warning_at (loc, 0, "%Kcall to %D will always overflow destination buffer",
12126 exp, get_callee_fndecl (exp));
12129 /* Emit warning if a buffer overflow is detected at compile time
12130 in __sprintf_chk/__vsprintf_chk calls. */
12133 maybe_emit_sprintf_chk_warning (tree exp, enum built_in_function fcode)
12135 tree size, len, fmt;
12136 const char *fmt_str;
12137 int nargs = call_expr_nargs (exp);
12139 /* Verify the required arguments in the original call. */
12143 size = CALL_EXPR_ARG (exp, 2);
12144 fmt = CALL_EXPR_ARG (exp, 3);
12146 if (! host_integerp (size, 1) || integer_all_onesp (size))
12149 /* Check whether the format is a literal string constant. */
12150 fmt_str = c_getstr (fmt);
12151 if (fmt_str == NULL)
12154 if (!init_target_chars ())
12157 /* If the format doesn't contain % args or %%, we know its size. */
12158 if (strchr (fmt_str, target_percent) == 0)
12159 len = build_int_cstu (size_type_node, strlen (fmt_str));
12160 /* If the format is "%s" and first ... argument is a string literal,
12162 else if (fcode == BUILT_IN_SPRINTF_CHK
12163 && strcmp (fmt_str, target_percent_s) == 0)
12169 arg = CALL_EXPR_ARG (exp, 4);
12170 if (! POINTER_TYPE_P (TREE_TYPE (arg)))
12173 len = c_strlen (arg, 1);
12174 if (!len || ! host_integerp (len, 1))
12180 if (! tree_int_cst_lt (len, size))
12181 warning_at (tree_nonartificial_location (exp),
12182 0, "%Kcall to %D will always overflow destination buffer",
12183 exp, get_callee_fndecl (exp));
12186 /* Emit warning if a free is called with address of a variable. */
12189 maybe_emit_free_warning (tree exp)
12191 tree arg = CALL_EXPR_ARG (exp, 0);
12194 if (TREE_CODE (arg) != ADDR_EXPR)
12197 arg = get_base_address (TREE_OPERAND (arg, 0));
12198 if (arg == NULL || INDIRECT_REF_P (arg))
12201 if (SSA_VAR_P (arg))
12202 warning_at (tree_nonartificial_location (exp),
12203 0, "%Kattempt to free a non-heap object %qD", exp, arg);
12205 warning_at (tree_nonartificial_location (exp),
12206 0, "%Kattempt to free a non-heap object", exp);
12209 /* Fold a call to __builtin_object_size with arguments PTR and OST,
12213 fold_builtin_object_size (tree ptr, tree ost)
12215 tree ret = NULL_TREE;
12216 int object_size_type;
12218 if (!validate_arg (ptr, POINTER_TYPE)
12219 || !validate_arg (ost, INTEGER_TYPE))
12224 if (TREE_CODE (ost) != INTEGER_CST
12225 || tree_int_cst_sgn (ost) < 0
12226 || compare_tree_int (ost, 3) > 0)
12229 object_size_type = tree_low_cst (ost, 0);
12231 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
12232 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
12233 and (size_t) 0 for types 2 and 3. */
12234 if (TREE_SIDE_EFFECTS (ptr))
12235 return build_int_cst_type (size_type_node, object_size_type < 2 ? -1 : 0);
12237 if (TREE_CODE (ptr) == ADDR_EXPR)
12238 ret = build_int_cstu (size_type_node,
12239 compute_builtin_object_size (ptr, object_size_type));
12241 else if (TREE_CODE (ptr) == SSA_NAME)
12243 unsigned HOST_WIDE_INT bytes;
12245 /* If object size is not known yet, delay folding until
12246 later. Maybe subsequent passes will help determining
12248 bytes = compute_builtin_object_size (ptr, object_size_type);
12249 if (bytes != (unsigned HOST_WIDE_INT) (object_size_type < 2
12251 ret = build_int_cstu (size_type_node, bytes);
12256 unsigned HOST_WIDE_INT low = TREE_INT_CST_LOW (ret);
12257 HOST_WIDE_INT high = TREE_INT_CST_HIGH (ret);
12258 if (fit_double_type (low, high, &low, &high, TREE_TYPE (ret)))
12265 /* Fold a call to the __mem{cpy,pcpy,move,set}_chk builtin.
12266 DEST, SRC, LEN, and SIZE are the arguments to the call.
12267 IGNORE is true, if return value can be ignored. FCODE is the BUILT_IN_*
12268 code of the builtin. If MAXLEN is not NULL, it is maximum length
12269 passed as third argument. */
12272 fold_builtin_memory_chk (location_t loc, tree fndecl,
12273 tree dest, tree src, tree len, tree size,
12274 tree maxlen, bool ignore,
12275 enum built_in_function fcode)
12279 if (!validate_arg (dest, POINTER_TYPE)
12280 || !validate_arg (src,
12281 (fcode == BUILT_IN_MEMSET_CHK
12282 ? INTEGER_TYPE : POINTER_TYPE))
12283 || !validate_arg (len, INTEGER_TYPE)
12284 || !validate_arg (size, INTEGER_TYPE))
12287 /* If SRC and DEST are the same (and not volatile), return DEST
12288 (resp. DEST+LEN for __mempcpy_chk). */
12289 if (fcode != BUILT_IN_MEMSET_CHK && operand_equal_p (src, dest, 0))
12291 if (fcode != BUILT_IN_MEMPCPY_CHK)
12292 return omit_one_operand_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)),
12296 tree temp = fold_build2_loc (loc, POINTER_PLUS_EXPR, TREE_TYPE (dest),
12298 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), temp);
12302 if (! host_integerp (size, 1))
12305 if (! integer_all_onesp (size))
12307 if (! host_integerp (len, 1))
12309 /* If LEN is not constant, try MAXLEN too.
12310 For MAXLEN only allow optimizing into non-_ocs function
12311 if SIZE is >= MAXLEN, never convert to __ocs_fail (). */
12312 if (maxlen == NULL_TREE || ! host_integerp (maxlen, 1))
12314 if (fcode == BUILT_IN_MEMPCPY_CHK && ignore)
12316 /* (void) __mempcpy_chk () can be optimized into
12317 (void) __memcpy_chk (). */
12318 fn = built_in_decls[BUILT_IN_MEMCPY_CHK];
12322 return build_call_expr_loc (loc, fn, 4, dest, src, len, size);
12330 if (tree_int_cst_lt (size, maxlen))
12335 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
12336 mem{cpy,pcpy,move,set} is available. */
12339 case BUILT_IN_MEMCPY_CHK:
12340 fn = built_in_decls[BUILT_IN_MEMCPY];
12342 case BUILT_IN_MEMPCPY_CHK:
12343 fn = built_in_decls[BUILT_IN_MEMPCPY];
12345 case BUILT_IN_MEMMOVE_CHK:
12346 fn = built_in_decls[BUILT_IN_MEMMOVE];
12348 case BUILT_IN_MEMSET_CHK:
12349 fn = built_in_decls[BUILT_IN_MEMSET];
12358 return build_call_expr_loc (loc, fn, 3, dest, src, len);
12361 /* Fold a call to the __st[rp]cpy_chk builtin.
12362 DEST, SRC, and SIZE are the arguments to the call.
12363 IGNORE is true if return value can be ignored. FCODE is the BUILT_IN_*
12364 code of the builtin. If MAXLEN is not NULL, it is maximum length of
12365 strings passed as second argument. */
12368 fold_builtin_stxcpy_chk (location_t loc, tree fndecl, tree dest,
12369 tree src, tree size,
12370 tree maxlen, bool ignore,
12371 enum built_in_function fcode)
12375 if (!validate_arg (dest, POINTER_TYPE)
12376 || !validate_arg (src, POINTER_TYPE)
12377 || !validate_arg (size, INTEGER_TYPE))
12380 /* If SRC and DEST are the same (and not volatile), return DEST. */
12381 if (fcode == BUILT_IN_STRCPY_CHK && operand_equal_p (src, dest, 0))
12382 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest);
12384 if (! host_integerp (size, 1))
12387 if (! integer_all_onesp (size))
12389 len = c_strlen (src, 1);
12390 if (! len || ! host_integerp (len, 1))
12392 /* If LEN is not constant, try MAXLEN too.
12393 For MAXLEN only allow optimizing into non-_ocs function
12394 if SIZE is >= MAXLEN, never convert to __ocs_fail (). */
12395 if (maxlen == NULL_TREE || ! host_integerp (maxlen, 1))
12397 if (fcode == BUILT_IN_STPCPY_CHK)
12402 /* If return value of __stpcpy_chk is ignored,
12403 optimize into __strcpy_chk. */
12404 fn = built_in_decls[BUILT_IN_STRCPY_CHK];
12408 return build_call_expr_loc (loc, fn, 3, dest, src, size);
12411 if (! len || TREE_SIDE_EFFECTS (len))
12414 /* If c_strlen returned something, but not a constant,
12415 transform __strcpy_chk into __memcpy_chk. */
12416 fn = built_in_decls[BUILT_IN_MEMCPY_CHK];
12420 len = size_binop_loc (loc, PLUS_EXPR, len, ssize_int (1));
12421 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)),
12422 build_call_expr_loc (loc, fn, 4,
12423 dest, src, len, size));
12429 if (! tree_int_cst_lt (maxlen, size))
12433 /* If __builtin_st{r,p}cpy_chk is used, assume st{r,p}cpy is available. */
12434 fn = built_in_decls[fcode == BUILT_IN_STPCPY_CHK
12435 ? BUILT_IN_STPCPY : BUILT_IN_STRCPY];
12439 return build_call_expr_loc (loc, fn, 2, dest, src);
12442 /* Fold a call to the __strncpy_chk builtin. DEST, SRC, LEN, and SIZE
12443 are the arguments to the call. If MAXLEN is not NULL, it is maximum
12444 length passed as third argument. */
12447 fold_builtin_strncpy_chk (location_t loc, tree dest, tree src,
12448 tree len, tree size, tree maxlen)
12452 if (!validate_arg (dest, POINTER_TYPE)
12453 || !validate_arg (src, POINTER_TYPE)
12454 || !validate_arg (len, INTEGER_TYPE)
12455 || !validate_arg (size, INTEGER_TYPE))
12458 if (! host_integerp (size, 1))
12461 if (! integer_all_onesp (size))
12463 if (! host_integerp (len, 1))
12465 /* If LEN is not constant, try MAXLEN too.
12466 For MAXLEN only allow optimizing into non-_ocs function
12467 if SIZE is >= MAXLEN, never convert to __ocs_fail (). */
12468 if (maxlen == NULL_TREE || ! host_integerp (maxlen, 1))
12474 if (tree_int_cst_lt (size, maxlen))
12478 /* If __builtin_strncpy_chk is used, assume strncpy is available. */
12479 fn = built_in_decls[BUILT_IN_STRNCPY];
12483 return build_call_expr_loc (loc, fn, 3, dest, src, len);
12486 /* Fold a call to the __strcat_chk builtin FNDECL. DEST, SRC, and SIZE
12487 are the arguments to the call. */
12490 fold_builtin_strcat_chk (location_t loc, tree fndecl, tree dest,
12491 tree src, tree size)
12496 if (!validate_arg (dest, POINTER_TYPE)
12497 || !validate_arg (src, POINTER_TYPE)
12498 || !validate_arg (size, INTEGER_TYPE))
12501 p = c_getstr (src);
12502 /* If the SRC parameter is "", return DEST. */
12503 if (p && *p == '\0')
12504 return omit_one_operand_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest, src);
12506 if (! host_integerp (size, 1) || ! integer_all_onesp (size))
12509 /* If __builtin_strcat_chk is used, assume strcat is available. */
12510 fn = built_in_decls[BUILT_IN_STRCAT];
12514 return build_call_expr_loc (loc, fn, 2, dest, src);
12517 /* Fold a call to the __strncat_chk builtin with arguments DEST, SRC,
12521 fold_builtin_strncat_chk (location_t loc, tree fndecl,
12522 tree dest, tree src, tree len, tree size)
12527 if (!validate_arg (dest, POINTER_TYPE)
12528 || !validate_arg (src, POINTER_TYPE)
12529 || !validate_arg (size, INTEGER_TYPE)
12530 || !validate_arg (size, INTEGER_TYPE))
12533 p = c_getstr (src);
12534 /* If the SRC parameter is "" or if LEN is 0, return DEST. */
12535 if (p && *p == '\0')
12536 return omit_one_operand_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest, len);
12537 else if (integer_zerop (len))
12538 return omit_one_operand_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest, src);
12540 if (! host_integerp (size, 1))
12543 if (! integer_all_onesp (size))
12545 tree src_len = c_strlen (src, 1);
12547 && host_integerp (src_len, 1)
12548 && host_integerp (len, 1)
12549 && ! tree_int_cst_lt (len, src_len))
12551 /* If LEN >= strlen (SRC), optimize into __strcat_chk. */
12552 fn = built_in_decls[BUILT_IN_STRCAT_CHK];
12556 return build_call_expr_loc (loc, fn, 3, dest, src, size);
12561 /* If __builtin_strncat_chk is used, assume strncat is available. */
12562 fn = built_in_decls[BUILT_IN_STRNCAT];
12566 return build_call_expr_loc (loc, fn, 3, dest, src, len);
12569 /* Fold a call EXP to __{,v}sprintf_chk. Return NULL_TREE if
12570 a normal call should be emitted rather than expanding the function
12571 inline. FCODE is either BUILT_IN_SPRINTF_CHK or BUILT_IN_VSPRINTF_CHK. */
12574 fold_builtin_sprintf_chk (location_t loc, tree exp,
12575 enum built_in_function fcode)
12577 tree dest, size, len, fn, fmt, flag;
12578 const char *fmt_str;
12579 int nargs = call_expr_nargs (exp);
12581 /* Verify the required arguments in the original call. */
12584 dest = CALL_EXPR_ARG (exp, 0);
12585 if (!validate_arg (dest, POINTER_TYPE))
12587 flag = CALL_EXPR_ARG (exp, 1);
12588 if (!validate_arg (flag, INTEGER_TYPE))
12590 size = CALL_EXPR_ARG (exp, 2);
12591 if (!validate_arg (size, INTEGER_TYPE))
12593 fmt = CALL_EXPR_ARG (exp, 3);
12594 if (!validate_arg (fmt, POINTER_TYPE))
12597 if (! host_integerp (size, 1))
12602 if (!init_target_chars ())
12605 /* Check whether the format is a literal string constant. */
12606 fmt_str = c_getstr (fmt);
12607 if (fmt_str != NULL)
12609 /* If the format doesn't contain % args or %%, we know the size. */
12610 if (strchr (fmt_str, target_percent) == 0)
12612 if (fcode != BUILT_IN_SPRINTF_CHK || nargs == 4)
12613 len = build_int_cstu (size_type_node, strlen (fmt_str));
12615 /* If the format is "%s" and first ... argument is a string literal,
12616 we know the size too. */
12617 else if (fcode == BUILT_IN_SPRINTF_CHK
12618 && strcmp (fmt_str, target_percent_s) == 0)
12624 arg = CALL_EXPR_ARG (exp, 4);
12625 if (validate_arg (arg, POINTER_TYPE))
12627 len = c_strlen (arg, 1);
12628 if (! len || ! host_integerp (len, 1))
12635 if (! integer_all_onesp (size))
12637 if (! len || ! tree_int_cst_lt (len, size))
12641 /* Only convert __{,v}sprintf_chk to {,v}sprintf if flag is 0
12642 or if format doesn't contain % chars or is "%s". */
12643 if (! integer_zerop (flag))
12645 if (fmt_str == NULL)
12647 if (strchr (fmt_str, target_percent) != NULL
12648 && strcmp (fmt_str, target_percent_s))
12652 /* If __builtin_{,v}sprintf_chk is used, assume {,v}sprintf is available. */
12653 fn = built_in_decls[fcode == BUILT_IN_VSPRINTF_CHK
12654 ? BUILT_IN_VSPRINTF : BUILT_IN_SPRINTF];
12658 return rewrite_call_expr (loc, exp, 4, fn, 2, dest, fmt);
12661 /* Fold a call EXP to {,v}snprintf. Return NULL_TREE if
12662 a normal call should be emitted rather than expanding the function
12663 inline. FCODE is either BUILT_IN_SNPRINTF_CHK or
12664 BUILT_IN_VSNPRINTF_CHK. If MAXLEN is not NULL, it is maximum length
12665 passed as second argument. */
12668 fold_builtin_snprintf_chk (location_t loc, tree exp, tree maxlen,
12669 enum built_in_function fcode)
12671 tree dest, size, len, fn, fmt, flag;
12672 const char *fmt_str;
12674 /* Verify the required arguments in the original call. */
12675 if (call_expr_nargs (exp) < 5)
12677 dest = CALL_EXPR_ARG (exp, 0);
12678 if (!validate_arg (dest, POINTER_TYPE))
12680 len = CALL_EXPR_ARG (exp, 1);
12681 if (!validate_arg (len, INTEGER_TYPE))
12683 flag = CALL_EXPR_ARG (exp, 2);
12684 if (!validate_arg (flag, INTEGER_TYPE))
12686 size = CALL_EXPR_ARG (exp, 3);
12687 if (!validate_arg (size, INTEGER_TYPE))
12689 fmt = CALL_EXPR_ARG (exp, 4);
12690 if (!validate_arg (fmt, POINTER_TYPE))
12693 if (! host_integerp (size, 1))
12696 if (! integer_all_onesp (size))
12698 if (! host_integerp (len, 1))
12700 /* If LEN is not constant, try MAXLEN too.
12701 For MAXLEN only allow optimizing into non-_ocs function
12702 if SIZE is >= MAXLEN, never convert to __ocs_fail (). */
12703 if (maxlen == NULL_TREE || ! host_integerp (maxlen, 1))
12709 if (tree_int_cst_lt (size, maxlen))
12713 if (!init_target_chars ())
12716 /* Only convert __{,v}snprintf_chk to {,v}snprintf if flag is 0
12717 or if format doesn't contain % chars or is "%s". */
12718 if (! integer_zerop (flag))
12720 fmt_str = c_getstr (fmt);
12721 if (fmt_str == NULL)
12723 if (strchr (fmt_str, target_percent) != NULL
12724 && strcmp (fmt_str, target_percent_s))
12728 /* If __builtin_{,v}snprintf_chk is used, assume {,v}snprintf is
12730 fn = built_in_decls[fcode == BUILT_IN_VSNPRINTF_CHK
12731 ? BUILT_IN_VSNPRINTF : BUILT_IN_SNPRINTF];
12735 return rewrite_call_expr (loc, exp, 5, fn, 3, dest, len, fmt);
12738 /* Fold a call to the {,v}printf{,_unlocked} and __{,v}printf_chk builtins.
12739 FMT and ARG are the arguments to the call; we don't fold cases with
12740 more than 2 arguments, and ARG may be null if this is a 1-argument case.
12742 Return NULL_TREE if no simplification was possible, otherwise return the
12743 simplified form of the call as a tree. FCODE is the BUILT_IN_*
12744 code of the function to be simplified. */
12747 fold_builtin_printf (location_t loc, tree fndecl, tree fmt,
12748 tree arg, bool ignore,
12749 enum built_in_function fcode)
12751 tree fn_putchar, fn_puts, newarg, call = NULL_TREE;
12752 const char *fmt_str = NULL;
12754 /* If the return value is used, don't do the transformation. */
12758 /* Verify the required arguments in the original call. */
12759 if (!validate_arg (fmt, POINTER_TYPE))
12762 /* Check whether the format is a literal string constant. */
12763 fmt_str = c_getstr (fmt);
12764 if (fmt_str == NULL)
12767 if (fcode == BUILT_IN_PRINTF_UNLOCKED)
12769 /* If we're using an unlocked function, assume the other
12770 unlocked functions exist explicitly. */
12771 fn_putchar = built_in_decls[BUILT_IN_PUTCHAR_UNLOCKED];
12772 fn_puts = built_in_decls[BUILT_IN_PUTS_UNLOCKED];
12776 fn_putchar = implicit_built_in_decls[BUILT_IN_PUTCHAR];
12777 fn_puts = implicit_built_in_decls[BUILT_IN_PUTS];
12780 if (!init_target_chars ())
12783 if (strcmp (fmt_str, target_percent_s) == 0
12784 || strchr (fmt_str, target_percent) == NULL)
12788 if (strcmp (fmt_str, target_percent_s) == 0)
12790 if (fcode == BUILT_IN_VPRINTF || fcode == BUILT_IN_VPRINTF_CHK)
12793 if (!arg || !validate_arg (arg, POINTER_TYPE))
12796 str = c_getstr (arg);
12802 /* The format specifier doesn't contain any '%' characters. */
12803 if (fcode != BUILT_IN_VPRINTF && fcode != BUILT_IN_VPRINTF_CHK
12809 /* If the string was "", printf does nothing. */
12810 if (str[0] == '\0')
12811 return build_int_cst (TREE_TYPE (TREE_TYPE (fndecl)), 0);
12813 /* If the string has length of 1, call putchar. */
12814 if (str[1] == '\0')
12816 /* Given printf("c"), (where c is any one character,)
12817 convert "c"[0] to an int and pass that to the replacement
12819 newarg = build_int_cst (NULL_TREE, str[0]);
12821 call = build_call_expr_loc (loc, fn_putchar, 1, newarg);
12825 /* If the string was "string\n", call puts("string"). */
12826 size_t len = strlen (str);
12827 if ((unsigned char)str[len - 1] == target_newline)
12829 /* Create a NUL-terminated string that's one char shorter
12830 than the original, stripping off the trailing '\n'. */
12831 char *newstr = XALLOCAVEC (char, len);
12832 memcpy (newstr, str, len - 1);
12833 newstr[len - 1] = 0;
12835 newarg = build_string_literal (len, newstr);
12837 call = build_call_expr_loc (loc, fn_puts, 1, newarg);
12840 /* We'd like to arrange to call fputs(string,stdout) here,
12841 but we need stdout and don't have a way to get it yet. */
12846 /* The other optimizations can be done only on the non-va_list variants. */
12847 else if (fcode == BUILT_IN_VPRINTF || fcode == BUILT_IN_VPRINTF_CHK)
12850 /* If the format specifier was "%s\n", call __builtin_puts(arg). */
12851 else if (strcmp (fmt_str, target_percent_s_newline) == 0)
12853 if (!arg || !validate_arg (arg, POINTER_TYPE))
12856 call = build_call_expr_loc (loc, fn_puts, 1, arg);
12859 /* If the format specifier was "%c", call __builtin_putchar(arg). */
12860 else if (strcmp (fmt_str, target_percent_c) == 0)
12862 if (!arg || !validate_arg (arg, INTEGER_TYPE))
12865 call = build_call_expr_loc (loc, fn_putchar, 1, arg);
12871 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), call);
12874 /* Fold a call to the {,v}fprintf{,_unlocked} and __{,v}printf_chk builtins.
12875 FP, FMT, and ARG are the arguments to the call. We don't fold calls with
12876 more than 3 arguments, and ARG may be null in the 2-argument case.
12878 Return NULL_TREE if no simplification was possible, otherwise return the
12879 simplified form of the call as a tree. FCODE is the BUILT_IN_*
12880 code of the function to be simplified. */
12883 fold_builtin_fprintf (location_t loc, tree fndecl, tree fp,
12884 tree fmt, tree arg, bool ignore,
12885 enum built_in_function fcode)
12887 tree fn_fputc, fn_fputs, call = NULL_TREE;
12888 const char *fmt_str = NULL;
12890 /* If the return value is used, don't do the transformation. */
12894 /* Verify the required arguments in the original call. */
12895 if (!validate_arg (fp, POINTER_TYPE))
12897 if (!validate_arg (fmt, POINTER_TYPE))
12900 /* Check whether the format is a literal string constant. */
12901 fmt_str = c_getstr (fmt);
12902 if (fmt_str == NULL)
12905 if (fcode == BUILT_IN_FPRINTF_UNLOCKED)
12907 /* If we're using an unlocked function, assume the other
12908 unlocked functions exist explicitly. */
12909 fn_fputc = built_in_decls[BUILT_IN_FPUTC_UNLOCKED];
12910 fn_fputs = built_in_decls[BUILT_IN_FPUTS_UNLOCKED];
12914 fn_fputc = implicit_built_in_decls[BUILT_IN_FPUTC];
12915 fn_fputs = implicit_built_in_decls[BUILT_IN_FPUTS];
12918 if (!init_target_chars ())
12921 /* If the format doesn't contain % args or %%, use strcpy. */
12922 if (strchr (fmt_str, target_percent) == NULL)
12924 if (fcode != BUILT_IN_VFPRINTF && fcode != BUILT_IN_VFPRINTF_CHK
12928 /* If the format specifier was "", fprintf does nothing. */
12929 if (fmt_str[0] == '\0')
12931 /* If FP has side-effects, just wait until gimplification is
12933 if (TREE_SIDE_EFFECTS (fp))
12936 return build_int_cst (TREE_TYPE (TREE_TYPE (fndecl)), 0);
12939 /* When "string" doesn't contain %, replace all cases of
12940 fprintf (fp, string) with fputs (string, fp). The fputs
12941 builtin will take care of special cases like length == 1. */
12943 call = build_call_expr_loc (loc, fn_fputs, 2, fmt, fp);
12946 /* The other optimizations can be done only on the non-va_list variants. */
12947 else if (fcode == BUILT_IN_VFPRINTF || fcode == BUILT_IN_VFPRINTF_CHK)
12950 /* If the format specifier was "%s", call __builtin_fputs (arg, fp). */
12951 else if (strcmp (fmt_str, target_percent_s) == 0)
12953 if (!arg || !validate_arg (arg, POINTER_TYPE))
12956 call = build_call_expr_loc (loc, fn_fputs, 2, arg, fp);
12959 /* If the format specifier was "%c", call __builtin_fputc (arg, fp). */
12960 else if (strcmp (fmt_str, target_percent_c) == 0)
12962 if (!arg || !validate_arg (arg, INTEGER_TYPE))
12965 call = build_call_expr_loc (loc, fn_fputc, 2, arg, fp);
12970 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), call);
12973 /* Initialize format string characters in the target charset. */
12976 init_target_chars (void)
12981 target_newline = lang_hooks.to_target_charset ('\n');
12982 target_percent = lang_hooks.to_target_charset ('%');
12983 target_c = lang_hooks.to_target_charset ('c');
12984 target_s = lang_hooks.to_target_charset ('s');
12985 if (target_newline == 0 || target_percent == 0 || target_c == 0
12989 target_percent_c[0] = target_percent;
12990 target_percent_c[1] = target_c;
12991 target_percent_c[2] = '\0';
12993 target_percent_s[0] = target_percent;
12994 target_percent_s[1] = target_s;
12995 target_percent_s[2] = '\0';
12997 target_percent_s_newline[0] = target_percent;
12998 target_percent_s_newline[1] = target_s;
12999 target_percent_s_newline[2] = target_newline;
13000 target_percent_s_newline[3] = '\0';
13007 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
13008 and no overflow/underflow occurred. INEXACT is true if M was not
13009 exactly calculated. TYPE is the tree type for the result. This
13010 function assumes that you cleared the MPFR flags and then
13011 calculated M to see if anything subsequently set a flag prior to
13012 entering this function. Return NULL_TREE if any checks fail. */
13015 do_mpfr_ckconv (mpfr_srcptr m, tree type, int inexact)
13017 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
13018 overflow/underflow occurred. If -frounding-math, proceed iff the
13019 result of calling FUNC was exact. */
13020 if (mpfr_number_p (m) && !mpfr_overflow_p () && !mpfr_underflow_p ()
13021 && (!flag_rounding_math || !inexact))
13023 REAL_VALUE_TYPE rr;
13025 real_from_mpfr (&rr, m, type, GMP_RNDN);
13026 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
13027 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
13028 but the mpft_t is not, then we underflowed in the
13030 if (real_isfinite (&rr)
13031 && (rr.cl == rvc_zero) == (mpfr_zero_p (m) != 0))
13033 REAL_VALUE_TYPE rmode;
13035 real_convert (&rmode, TYPE_MODE (type), &rr);
13036 /* Proceed iff the specified mode can hold the value. */
13037 if (real_identical (&rmode, &rr))
13038 return build_real (type, rmode);
13045 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
13046 number and no overflow/underflow occurred. INEXACT is true if M
13047 was not exactly calculated. TYPE is the tree type for the result.
13048 This function assumes that you cleared the MPFR flags and then
13049 calculated M to see if anything subsequently set a flag prior to
13050 entering this function. Return NULL_TREE if any checks fail, if
13051 FORCE_CONVERT is true, then bypass the checks. */
13054 do_mpc_ckconv (mpc_srcptr m, tree type, int inexact, int force_convert)
13056 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
13057 overflow/underflow occurred. If -frounding-math, proceed iff the
13058 result of calling FUNC was exact. */
13060 || (mpfr_number_p (mpc_realref (m)) && mpfr_number_p (mpc_imagref (m))
13061 && !mpfr_overflow_p () && !mpfr_underflow_p ()
13062 && (!flag_rounding_math || !inexact)))
13064 REAL_VALUE_TYPE re, im;
13066 real_from_mpfr (&re, mpc_realref (m), type, GMP_RNDN);
13067 real_from_mpfr (&im, mpc_imagref (m), type, GMP_RNDN);
13068 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
13069 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
13070 but the mpft_t is not, then we underflowed in the
13073 || (real_isfinite (&re) && real_isfinite (&im)
13074 && (re.cl == rvc_zero) == (mpfr_zero_p (mpc_realref (m)) != 0)
13075 && (im.cl == rvc_zero) == (mpfr_zero_p (mpc_imagref (m)) != 0)))
13077 REAL_VALUE_TYPE re_mode, im_mode;
13079 real_convert (&re_mode, TYPE_MODE (TREE_TYPE (type)), &re);
13080 real_convert (&im_mode, TYPE_MODE (TREE_TYPE (type)), &im);
13081 /* Proceed iff the specified mode can hold the value. */
13083 || (real_identical (&re_mode, &re)
13084 && real_identical (&im_mode, &im)))
13085 return build_complex (type, build_real (TREE_TYPE (type), re_mode),
13086 build_real (TREE_TYPE (type), im_mode));
13091 #endif /* HAVE_mpc */
13093 /* If argument ARG is a REAL_CST, call the one-argument mpfr function
13094 FUNC on it and return the resulting value as a tree with type TYPE.
13095 If MIN and/or MAX are not NULL, then the supplied ARG must be
13096 within those bounds. If INCLUSIVE is true, then MIN/MAX are
13097 acceptable values, otherwise they are not. The mpfr precision is
13098 set to the precision of TYPE. We assume that function FUNC returns
13099 zero if the result could be calculated exactly within the requested
13103 do_mpfr_arg1 (tree arg, tree type, int (*func)(mpfr_ptr, mpfr_srcptr, mp_rnd_t),
13104 const REAL_VALUE_TYPE *min, const REAL_VALUE_TYPE *max,
13107 tree result = NULL_TREE;
13111 /* To proceed, MPFR must exactly represent the target floating point
13112 format, which only happens when the target base equals two. */
13113 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
13114 && TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
13116 const REAL_VALUE_TYPE *const ra = &TREE_REAL_CST (arg);
13118 if (real_isfinite (ra)
13119 && (!min || real_compare (inclusive ? GE_EXPR: GT_EXPR , ra, min))
13120 && (!max || real_compare (inclusive ? LE_EXPR: LT_EXPR , ra, max)))
13122 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
13123 const int prec = fmt->p;
13124 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
13128 mpfr_init2 (m, prec);
13129 mpfr_from_real (m, ra, GMP_RNDN);
13130 mpfr_clear_flags ();
13131 inexact = func (m, m, rnd);
13132 result = do_mpfr_ckconv (m, type, inexact);
13140 /* If argument ARG is a REAL_CST, call the two-argument mpfr function
13141 FUNC on it and return the resulting value as a tree with type TYPE.
13142 The mpfr precision is set to the precision of TYPE. We assume that
13143 function FUNC returns zero if the result could be calculated
13144 exactly within the requested precision. */
13147 do_mpfr_arg2 (tree arg1, tree arg2, tree type,
13148 int (*func)(mpfr_ptr, mpfr_srcptr, mpfr_srcptr, mp_rnd_t))
13150 tree result = NULL_TREE;
13155 /* To proceed, MPFR must exactly represent the target floating point
13156 format, which only happens when the target base equals two. */
13157 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
13158 && TREE_CODE (arg1) == REAL_CST && !TREE_OVERFLOW (arg1)
13159 && TREE_CODE (arg2) == REAL_CST && !TREE_OVERFLOW (arg2))
13161 const REAL_VALUE_TYPE *const ra1 = &TREE_REAL_CST (arg1);
13162 const REAL_VALUE_TYPE *const ra2 = &TREE_REAL_CST (arg2);
13164 if (real_isfinite (ra1) && real_isfinite (ra2))
13166 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
13167 const int prec = fmt->p;
13168 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
13172 mpfr_inits2 (prec, m1, m2, NULL);
13173 mpfr_from_real (m1, ra1, GMP_RNDN);
13174 mpfr_from_real (m2, ra2, GMP_RNDN);
13175 mpfr_clear_flags ();
13176 inexact = func (m1, m1, m2, rnd);
13177 result = do_mpfr_ckconv (m1, type, inexact);
13178 mpfr_clears (m1, m2, NULL);
13185 /* If argument ARG is a REAL_CST, call the three-argument mpfr function
13186 FUNC on it and return the resulting value as a tree with type TYPE.
13187 The mpfr precision is set to the precision of TYPE. We assume that
13188 function FUNC returns zero if the result could be calculated
13189 exactly within the requested precision. */
13192 do_mpfr_arg3 (tree arg1, tree arg2, tree arg3, tree type,
13193 int (*func)(mpfr_ptr, mpfr_srcptr, mpfr_srcptr, mpfr_srcptr, mp_rnd_t))
13195 tree result = NULL_TREE;
13201 /* To proceed, MPFR must exactly represent the target floating point
13202 format, which only happens when the target base equals two. */
13203 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
13204 && TREE_CODE (arg1) == REAL_CST && !TREE_OVERFLOW (arg1)
13205 && TREE_CODE (arg2) == REAL_CST && !TREE_OVERFLOW (arg2)
13206 && TREE_CODE (arg3) == REAL_CST && !TREE_OVERFLOW (arg3))
13208 const REAL_VALUE_TYPE *const ra1 = &TREE_REAL_CST (arg1);
13209 const REAL_VALUE_TYPE *const ra2 = &TREE_REAL_CST (arg2);
13210 const REAL_VALUE_TYPE *const ra3 = &TREE_REAL_CST (arg3);
13212 if (real_isfinite (ra1) && real_isfinite (ra2) && real_isfinite (ra3))
13214 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
13215 const int prec = fmt->p;
13216 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
13220 mpfr_inits2 (prec, m1, m2, m3, NULL);
13221 mpfr_from_real (m1, ra1, GMP_RNDN);
13222 mpfr_from_real (m2, ra2, GMP_RNDN);
13223 mpfr_from_real (m3, ra3, GMP_RNDN);
13224 mpfr_clear_flags ();
13225 inexact = func (m1, m1, m2, m3, rnd);
13226 result = do_mpfr_ckconv (m1, type, inexact);
13227 mpfr_clears (m1, m2, m3, NULL);
13234 /* If argument ARG is a REAL_CST, call mpfr_sin_cos() on it and set
13235 the pointers *(ARG_SINP) and *(ARG_COSP) to the resulting values.
13236 If ARG_SINP and ARG_COSP are NULL then the result is returned
13237 as a complex value.
13238 The type is taken from the type of ARG and is used for setting the
13239 precision of the calculation and results. */
13242 do_mpfr_sincos (tree arg, tree arg_sinp, tree arg_cosp)
13244 tree const type = TREE_TYPE (arg);
13245 tree result = NULL_TREE;
13249 /* To proceed, MPFR must exactly represent the target floating point
13250 format, which only happens when the target base equals two. */
13251 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
13252 && TREE_CODE (arg) == REAL_CST
13253 && !TREE_OVERFLOW (arg))
13255 const REAL_VALUE_TYPE *const ra = &TREE_REAL_CST (arg);
13257 if (real_isfinite (ra))
13259 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
13260 const int prec = fmt->p;
13261 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
13262 tree result_s, result_c;
13266 mpfr_inits2 (prec, m, ms, mc, NULL);
13267 mpfr_from_real (m, ra, GMP_RNDN);
13268 mpfr_clear_flags ();
13269 inexact = mpfr_sin_cos (ms, mc, m, rnd);
13270 result_s = do_mpfr_ckconv (ms, type, inexact);
13271 result_c = do_mpfr_ckconv (mc, type, inexact);
13272 mpfr_clears (m, ms, mc, NULL);
13273 if (result_s && result_c)
13275 /* If we are to return in a complex value do so. */
13276 if (!arg_sinp && !arg_cosp)
13277 return build_complex (build_complex_type (type),
13278 result_c, result_s);
13280 /* Dereference the sin/cos pointer arguments. */
13281 arg_sinp = build_fold_indirect_ref (arg_sinp);
13282 arg_cosp = build_fold_indirect_ref (arg_cosp);
13283 /* Proceed if valid pointer type were passed in. */
13284 if (TYPE_MAIN_VARIANT (TREE_TYPE (arg_sinp)) == TYPE_MAIN_VARIANT (type)
13285 && TYPE_MAIN_VARIANT (TREE_TYPE (arg_cosp)) == TYPE_MAIN_VARIANT (type))
13287 /* Set the values. */
13288 result_s = fold_build2 (MODIFY_EXPR, type, arg_sinp,
13290 TREE_SIDE_EFFECTS (result_s) = 1;
13291 result_c = fold_build2 (MODIFY_EXPR, type, arg_cosp,
13293 TREE_SIDE_EFFECTS (result_c) = 1;
13294 /* Combine the assignments into a compound expr. */
13295 result = non_lvalue (fold_build2 (COMPOUND_EXPR, type,
13296 result_s, result_c));
13304 /* If argument ARG1 is an INTEGER_CST and ARG2 is a REAL_CST, call the
13305 two-argument mpfr order N Bessel function FUNC on them and return
13306 the resulting value as a tree with type TYPE. The mpfr precision
13307 is set to the precision of TYPE. We assume that function FUNC
13308 returns zero if the result could be calculated exactly within the
13309 requested precision. */
13311 do_mpfr_bessel_n (tree arg1, tree arg2, tree type,
13312 int (*func)(mpfr_ptr, long, mpfr_srcptr, mp_rnd_t),
13313 const REAL_VALUE_TYPE *min, bool inclusive)
13315 tree result = NULL_TREE;
13320 /* To proceed, MPFR must exactly represent the target floating point
13321 format, which only happens when the target base equals two. */
13322 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
13323 && host_integerp (arg1, 0)
13324 && TREE_CODE (arg2) == REAL_CST && !TREE_OVERFLOW (arg2))
13326 const HOST_WIDE_INT n = tree_low_cst(arg1, 0);
13327 const REAL_VALUE_TYPE *const ra = &TREE_REAL_CST (arg2);
13330 && real_isfinite (ra)
13331 && (!min || real_compare (inclusive ? GE_EXPR: GT_EXPR , ra, min)))
13333 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
13334 const int prec = fmt->p;
13335 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
13339 mpfr_init2 (m, prec);
13340 mpfr_from_real (m, ra, GMP_RNDN);
13341 mpfr_clear_flags ();
13342 inexact = func (m, n, m, rnd);
13343 result = do_mpfr_ckconv (m, type, inexact);
13351 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
13352 the pointer *(ARG_QUO) and return the result. The type is taken
13353 from the type of ARG0 and is used for setting the precision of the
13354 calculation and results. */
13357 do_mpfr_remquo (tree arg0, tree arg1, tree arg_quo)
13359 tree const type = TREE_TYPE (arg0);
13360 tree result = NULL_TREE;
13365 /* To proceed, MPFR must exactly represent the target floating point
13366 format, which only happens when the target base equals two. */
13367 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
13368 && TREE_CODE (arg0) == REAL_CST && !TREE_OVERFLOW (arg0)
13369 && TREE_CODE (arg1) == REAL_CST && !TREE_OVERFLOW (arg1))
13371 const REAL_VALUE_TYPE *const ra0 = TREE_REAL_CST_PTR (arg0);
13372 const REAL_VALUE_TYPE *const ra1 = TREE_REAL_CST_PTR (arg1);
13374 if (real_isfinite (ra0) && real_isfinite (ra1))
13376 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
13377 const int prec = fmt->p;
13378 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
13383 mpfr_inits2 (prec, m0, m1, NULL);
13384 mpfr_from_real (m0, ra0, GMP_RNDN);
13385 mpfr_from_real (m1, ra1, GMP_RNDN);
13386 mpfr_clear_flags ();
13387 mpfr_remquo (m0, &integer_quo, m0, m1, rnd);
13388 /* Remquo is independent of the rounding mode, so pass
13389 inexact=0 to do_mpfr_ckconv(). */
13390 result_rem = do_mpfr_ckconv (m0, type, /*inexact=*/ 0);
13391 mpfr_clears (m0, m1, NULL);
13394 /* MPFR calculates quo in the host's long so it may
13395 return more bits in quo than the target int can hold
13396 if sizeof(host long) > sizeof(target int). This can
13397 happen even for native compilers in LP64 mode. In
13398 these cases, modulo the quo value with the largest
13399 number that the target int can hold while leaving one
13400 bit for the sign. */
13401 if (sizeof (integer_quo) * CHAR_BIT > INT_TYPE_SIZE)
13402 integer_quo %= (long)(1UL << (INT_TYPE_SIZE - 1));
13404 /* Dereference the quo pointer argument. */
13405 arg_quo = build_fold_indirect_ref (arg_quo);
13406 /* Proceed iff a valid pointer type was passed in. */
13407 if (TYPE_MAIN_VARIANT (TREE_TYPE (arg_quo)) == integer_type_node)
13409 /* Set the value. */
13410 tree result_quo = fold_build2 (MODIFY_EXPR,
13411 TREE_TYPE (arg_quo), arg_quo,
13412 build_int_cst (NULL, integer_quo));
13413 TREE_SIDE_EFFECTS (result_quo) = 1;
13414 /* Combine the quo assignment with the rem. */
13415 result = non_lvalue (fold_build2 (COMPOUND_EXPR, type,
13416 result_quo, result_rem));
13424 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
13425 resulting value as a tree with type TYPE. The mpfr precision is
13426 set to the precision of TYPE. We assume that this mpfr function
13427 returns zero if the result could be calculated exactly within the
13428 requested precision. In addition, the integer pointer represented
13429 by ARG_SG will be dereferenced and set to the appropriate signgam
13433 do_mpfr_lgamma_r (tree arg, tree arg_sg, tree type)
13435 tree result = NULL_TREE;
13439 /* To proceed, MPFR must exactly represent the target floating point
13440 format, which only happens when the target base equals two. Also
13441 verify ARG is a constant and that ARG_SG is an int pointer. */
13442 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
13443 && TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg)
13444 && TREE_CODE (TREE_TYPE (arg_sg)) == POINTER_TYPE
13445 && TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (arg_sg))) == integer_type_node)
13447 const REAL_VALUE_TYPE *const ra = TREE_REAL_CST_PTR (arg);
13449 /* In addition to NaN and Inf, the argument cannot be zero or a
13450 negative integer. */
13451 if (real_isfinite (ra)
13452 && ra->cl != rvc_zero
13453 && !(real_isneg(ra) && real_isinteger(ra, TYPE_MODE (type))))
13455 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
13456 const int prec = fmt->p;
13457 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
13462 mpfr_init2 (m, prec);
13463 mpfr_from_real (m, ra, GMP_RNDN);
13464 mpfr_clear_flags ();
13465 inexact = mpfr_lgamma (m, &sg, m, rnd);
13466 result_lg = do_mpfr_ckconv (m, type, inexact);
13472 /* Dereference the arg_sg pointer argument. */
13473 arg_sg = build_fold_indirect_ref (arg_sg);
13474 /* Assign the signgam value into *arg_sg. */
13475 result_sg = fold_build2 (MODIFY_EXPR,
13476 TREE_TYPE (arg_sg), arg_sg,
13477 build_int_cst (NULL, sg));
13478 TREE_SIDE_EFFECTS (result_sg) = 1;
13479 /* Combine the signgam assignment with the lgamma result. */
13480 result = non_lvalue (fold_build2 (COMPOUND_EXPR, type,
13481 result_sg, result_lg));
13490 /* If argument ARG is a COMPLEX_CST, call the one-argument mpc
13491 function FUNC on it and return the resulting value as a tree with
13492 type TYPE. The mpfr precision is set to the precision of TYPE. We
13493 assume that function FUNC returns zero if the result could be
13494 calculated exactly within the requested precision. */
13497 do_mpc_arg1 (tree arg, tree type, int (*func)(mpc_ptr, mpc_srcptr, mpc_rnd_t))
13499 tree result = NULL_TREE;
13503 /* To proceed, MPFR must exactly represent the target floating point
13504 format, which only happens when the target base equals two. */
13505 if (TREE_CODE (arg) == COMPLEX_CST && !TREE_OVERFLOW (arg)
13506 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) == REAL_TYPE
13507 && REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (TREE_TYPE (arg))))->b == 2)
13509 const REAL_VALUE_TYPE *const re = TREE_REAL_CST_PTR (TREE_REALPART (arg));
13510 const REAL_VALUE_TYPE *const im = TREE_REAL_CST_PTR (TREE_IMAGPART (arg));
13512 if (real_isfinite (re) && real_isfinite (im))
13514 const struct real_format *const fmt =
13515 REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (type)));
13516 const int prec = fmt->p;
13517 const mp_rnd_t rnd = fmt->round_towards_zero ? GMP_RNDZ : GMP_RNDN;
13518 const mpc_rnd_t crnd = fmt->round_towards_zero ? MPC_RNDZZ : MPC_RNDNN;
13522 mpc_init2 (m, prec);
13523 mpfr_from_real (mpc_realref(m), re, rnd);
13524 mpfr_from_real (mpc_imagref(m), im, rnd);
13525 mpfr_clear_flags ();
13526 inexact = func (m, m, crnd);
13527 result = do_mpc_ckconv (m, type, inexact, /*force_convert=*/ 0);
13535 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
13536 mpc function FUNC on it and return the resulting value as a tree
13537 with type TYPE. The mpfr precision is set to the precision of
13538 TYPE. We assume that function FUNC returns zero if the result
13539 could be calculated exactly within the requested precision. If
13540 DO_NONFINITE is true, then fold expressions containing Inf or NaN
13541 in the arguments and/or results. */
13545 do_mpc_arg2 (tree arg0, tree arg1, tree type, int do_nonfinite,
13546 int (*func)(mpc_ptr, mpc_srcptr, mpc_srcptr, mpc_rnd_t))
13548 tree result = NULL_TREE;
13553 /* To proceed, MPFR must exactly represent the target floating point
13554 format, which only happens when the target base equals two. */
13555 if (TREE_CODE (arg0) == COMPLEX_CST && !TREE_OVERFLOW (arg0)
13556 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE
13557 && TREE_CODE (arg1) == COMPLEX_CST && !TREE_OVERFLOW (arg1)
13558 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg1))) == REAL_TYPE
13559 && REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (TREE_TYPE (arg0))))->b == 2)
13561 const REAL_VALUE_TYPE *const re0 = TREE_REAL_CST_PTR (TREE_REALPART (arg0));
13562 const REAL_VALUE_TYPE *const im0 = TREE_REAL_CST_PTR (TREE_IMAGPART (arg0));
13563 const REAL_VALUE_TYPE *const re1 = TREE_REAL_CST_PTR (TREE_REALPART (arg1));
13564 const REAL_VALUE_TYPE *const im1 = TREE_REAL_CST_PTR (TREE_IMAGPART (arg1));
13567 || (real_isfinite (re0) && real_isfinite (im0)
13568 && real_isfinite (re1) && real_isfinite (im1)))
13570 const struct real_format *const fmt =
13571 REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (type)));
13572 const int prec = fmt->p;
13573 const mp_rnd_t rnd = fmt->round_towards_zero ? GMP_RNDZ : GMP_RNDN;
13574 const mpc_rnd_t crnd = fmt->round_towards_zero ? MPC_RNDZZ : MPC_RNDNN;
13578 mpc_init2 (m0, prec);
13579 mpc_init2 (m1, prec);
13580 mpfr_from_real (mpc_realref(m0), re0, rnd);
13581 mpfr_from_real (mpc_imagref(m0), im0, rnd);
13582 mpfr_from_real (mpc_realref(m1), re1, rnd);
13583 mpfr_from_real (mpc_imagref(m1), im1, rnd);
13584 mpfr_clear_flags ();
13585 inexact = func (m0, m0, m1, crnd);
13586 result = do_mpc_ckconv (m0, type, inexact, do_nonfinite);
13595 #endif /* HAVE_mpc */
13598 The functions below provide an alternate interface for folding
13599 builtin function calls presented as GIMPLE_CALL statements rather
13600 than as CALL_EXPRs. The folded result is still expressed as a
13601 tree. There is too much code duplication in the handling of
13602 varargs functions, and a more intrusive re-factoring would permit
13603 better sharing of code between the tree and statement-based
13604 versions of these functions. */
13606 /* Construct a new CALL_EXPR using the tail of the argument list of STMT
13607 along with N new arguments specified as the "..." parameters. SKIP
13608 is the number of arguments in STMT to be omitted. This function is used
13609 to do varargs-to-varargs transformations. */
13612 gimple_rewrite_call_expr (gimple stmt, int skip, tree fndecl, int n, ...)
13614 int oldnargs = gimple_call_num_args (stmt);
13615 int nargs = oldnargs - skip + n;
13616 tree fntype = TREE_TYPE (fndecl);
13617 tree fn = build1 (ADDR_EXPR, build_pointer_type (fntype), fndecl);
13621 location_t loc = gimple_location (stmt);
13623 buffer = XALLOCAVEC (tree, nargs);
13625 for (i = 0; i < n; i++)
13626 buffer[i] = va_arg (ap, tree);
13628 for (j = skip; j < oldnargs; j++, i++)
13629 buffer[i] = gimple_call_arg (stmt, j);
13631 return fold (build_call_array_loc (loc, TREE_TYPE (fntype), fn, nargs, buffer));
13634 /* Fold a call STMT to __{,v}sprintf_chk. Return NULL_TREE if
13635 a normal call should be emitted rather than expanding the function
13636 inline. FCODE is either BUILT_IN_SPRINTF_CHK or BUILT_IN_VSPRINTF_CHK. */
13639 gimple_fold_builtin_sprintf_chk (gimple stmt, enum built_in_function fcode)
13641 tree dest, size, len, fn, fmt, flag;
13642 const char *fmt_str;
13643 int nargs = gimple_call_num_args (stmt);
13645 /* Verify the required arguments in the original call. */
13648 dest = gimple_call_arg (stmt, 0);
13649 if (!validate_arg (dest, POINTER_TYPE))
13651 flag = gimple_call_arg (stmt, 1);
13652 if (!validate_arg (flag, INTEGER_TYPE))
13654 size = gimple_call_arg (stmt, 2);
13655 if (!validate_arg (size, INTEGER_TYPE))
13657 fmt = gimple_call_arg (stmt, 3);
13658 if (!validate_arg (fmt, POINTER_TYPE))
13661 if (! host_integerp (size, 1))
13666 if (!init_target_chars ())
13669 /* Check whether the format is a literal string constant. */
13670 fmt_str = c_getstr (fmt);
13671 if (fmt_str != NULL)
13673 /* If the format doesn't contain % args or %%, we know the size. */
13674 if (strchr (fmt_str, target_percent) == 0)
13676 if (fcode != BUILT_IN_SPRINTF_CHK || nargs == 4)
13677 len = build_int_cstu (size_type_node, strlen (fmt_str));
13679 /* If the format is "%s" and first ... argument is a string literal,
13680 we know the size too. */
13681 else if (fcode == BUILT_IN_SPRINTF_CHK
13682 && strcmp (fmt_str, target_percent_s) == 0)
13688 arg = gimple_call_arg (stmt, 4);
13689 if (validate_arg (arg, POINTER_TYPE))
13691 len = c_strlen (arg, 1);
13692 if (! len || ! host_integerp (len, 1))
13699 if (! integer_all_onesp (size))
13701 if (! len || ! tree_int_cst_lt (len, size))
13705 /* Only convert __{,v}sprintf_chk to {,v}sprintf if flag is 0
13706 or if format doesn't contain % chars or is "%s". */
13707 if (! integer_zerop (flag))
13709 if (fmt_str == NULL)
13711 if (strchr (fmt_str, target_percent) != NULL
13712 && strcmp (fmt_str, target_percent_s))
13716 /* If __builtin_{,v}sprintf_chk is used, assume {,v}sprintf is available. */
13717 fn = built_in_decls[fcode == BUILT_IN_VSPRINTF_CHK
13718 ? BUILT_IN_VSPRINTF : BUILT_IN_SPRINTF];
13722 return gimple_rewrite_call_expr (stmt, 4, fn, 2, dest, fmt);
13725 /* Fold a call STMT to {,v}snprintf. Return NULL_TREE if
13726 a normal call should be emitted rather than expanding the function
13727 inline. FCODE is either BUILT_IN_SNPRINTF_CHK or
13728 BUILT_IN_VSNPRINTF_CHK. If MAXLEN is not NULL, it is maximum length
13729 passed as second argument. */
13732 gimple_fold_builtin_snprintf_chk (gimple stmt, tree maxlen,
13733 enum built_in_function fcode)
13735 tree dest, size, len, fn, fmt, flag;
13736 const char *fmt_str;
13738 /* Verify the required arguments in the original call. */
13739 if (gimple_call_num_args (stmt) < 5)
13741 dest = gimple_call_arg (stmt, 0);
13742 if (!validate_arg (dest, POINTER_TYPE))
13744 len = gimple_call_arg (stmt, 1);
13745 if (!validate_arg (len, INTEGER_TYPE))
13747 flag = gimple_call_arg (stmt, 2);
13748 if (!validate_arg (flag, INTEGER_TYPE))
13750 size = gimple_call_arg (stmt, 3);
13751 if (!validate_arg (size, INTEGER_TYPE))
13753 fmt = gimple_call_arg (stmt, 4);
13754 if (!validate_arg (fmt, POINTER_TYPE))
13757 if (! host_integerp (size, 1))
13760 if (! integer_all_onesp (size))
13762 if (! host_integerp (len, 1))
13764 /* If LEN is not constant, try MAXLEN too.
13765 For MAXLEN only allow optimizing into non-_ocs function
13766 if SIZE is >= MAXLEN, never convert to __ocs_fail (). */
13767 if (maxlen == NULL_TREE || ! host_integerp (maxlen, 1))
13773 if (tree_int_cst_lt (size, maxlen))
13777 if (!init_target_chars ())
13780 /* Only convert __{,v}snprintf_chk to {,v}snprintf if flag is 0
13781 or if format doesn't contain % chars or is "%s". */
13782 if (! integer_zerop (flag))
13784 fmt_str = c_getstr (fmt);
13785 if (fmt_str == NULL)
13787 if (strchr (fmt_str, target_percent) != NULL
13788 && strcmp (fmt_str, target_percent_s))
13792 /* If __builtin_{,v}snprintf_chk is used, assume {,v}snprintf is
13794 fn = built_in_decls[fcode == BUILT_IN_VSNPRINTF_CHK
13795 ? BUILT_IN_VSNPRINTF : BUILT_IN_SNPRINTF];
13799 return gimple_rewrite_call_expr (stmt, 5, fn, 3, dest, len, fmt);
13802 /* Builtins with folding operations that operate on "..." arguments
13803 need special handling; we need to store the arguments in a convenient
13804 data structure before attempting any folding. Fortunately there are
13805 only a few builtins that fall into this category. FNDECL is the
13806 function, EXP is the CALL_EXPR for the call, and IGNORE is true if the
13807 result of the function call is ignored. */
13810 gimple_fold_builtin_varargs (tree fndecl, gimple stmt,
13811 bool ignore ATTRIBUTE_UNUSED)
13813 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
13814 tree ret = NULL_TREE;
13818 case BUILT_IN_SPRINTF_CHK:
13819 case BUILT_IN_VSPRINTF_CHK:
13820 ret = gimple_fold_builtin_sprintf_chk (stmt, fcode);
13823 case BUILT_IN_SNPRINTF_CHK:
13824 case BUILT_IN_VSNPRINTF_CHK:
13825 ret = gimple_fold_builtin_snprintf_chk (stmt, NULL_TREE, fcode);
13832 ret = build1 (NOP_EXPR, TREE_TYPE (ret), ret);
13833 TREE_NO_WARNING (ret) = 1;
13839 /* A wrapper function for builtin folding that prevents warnings for
13840 "statement without effect" and the like, caused by removing the
13841 call node earlier than the warning is generated. */
13844 fold_call_stmt (gimple stmt, bool ignore)
13846 tree ret = NULL_TREE;
13847 tree fndecl = gimple_call_fndecl (stmt);
13848 location_t loc = gimple_location (stmt);
13850 && TREE_CODE (fndecl) == FUNCTION_DECL
13851 && DECL_BUILT_IN (fndecl)
13852 && !gimple_call_va_arg_pack_p (stmt))
13854 int nargs = gimple_call_num_args (stmt);
13856 if (avoid_folding_inline_builtin (fndecl))
13858 /* FIXME: Don't use a list in this interface. */
13859 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
13861 tree arglist = NULL_TREE;
13863 for (i = nargs - 1; i >= 0; i--)
13864 arglist = tree_cons (NULL_TREE, gimple_call_arg (stmt, i), arglist);
13865 return targetm.fold_builtin (fndecl, arglist, ignore);
13869 if (nargs <= MAX_ARGS_TO_FOLD_BUILTIN)
13871 tree args[MAX_ARGS_TO_FOLD_BUILTIN];
13873 for (i = 0; i < nargs; i++)
13874 args[i] = gimple_call_arg (stmt, i);
13875 ret = fold_builtin_n (loc, fndecl, args, nargs, ignore);
13878 ret = gimple_fold_builtin_varargs (fndecl, stmt, ignore);
13881 /* Propagate location information from original call to
13882 expansion of builtin. Otherwise things like
13883 maybe_emit_chk_warning, that operate on the expansion
13884 of a builtin, will use the wrong location information. */
13885 if (gimple_has_location (stmt))
13887 tree realret = ret;
13888 if (TREE_CODE (ret) == NOP_EXPR)
13889 realret = TREE_OPERAND (ret, 0);
13890 if (CAN_HAVE_LOCATION_P (realret)
13891 && !EXPR_HAS_LOCATION (realret))
13892 SET_EXPR_LOCATION (realret, loc);
13902 /* Look up the function in built_in_decls that corresponds to DECL
13903 and set ASMSPEC as its user assembler name. DECL must be a
13904 function decl that declares a builtin. */
13907 set_builtin_user_assembler_name (tree decl, const char *asmspec)
13910 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL
13911 && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
13914 builtin = built_in_decls [DECL_FUNCTION_CODE (decl)];
13915 set_user_assembler_name (builtin, asmspec);
13916 switch (DECL_FUNCTION_CODE (decl))
13918 case BUILT_IN_MEMCPY:
13919 init_block_move_fn (asmspec);
13920 memcpy_libfunc = set_user_assembler_libfunc ("memcpy", asmspec);
13922 case BUILT_IN_MEMSET:
13923 init_block_clear_fn (asmspec);
13924 memset_libfunc = set_user_assembler_libfunc ("memset", asmspec);
13926 case BUILT_IN_MEMMOVE:
13927 memmove_libfunc = set_user_assembler_libfunc ("memmove", asmspec);
13929 case BUILT_IN_MEMCMP:
13930 memcmp_libfunc = set_user_assembler_libfunc ("memcmp", asmspec);
13932 case BUILT_IN_ABORT:
13933 abort_libfunc = set_user_assembler_libfunc ("abort", asmspec);