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 /* Return the size required for the block returned by __builtin_apply_args,
1263 and initialize apply_args_mode. */
1266 apply_args_size (void)
1268 static int size = -1;
1271 enum machine_mode mode;
1273 /* The values computed by this function never change. */
1276 /* The first value is the incoming arg-pointer. */
1277 size = GET_MODE_SIZE (Pmode);
1279 /* The second value is the structure value address unless this is
1280 passed as an "invisible" first argument. */
1281 if (targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0))
1282 size += GET_MODE_SIZE (Pmode);
1284 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1285 if (FUNCTION_ARG_REGNO_P (regno))
1287 mode = reg_raw_mode[regno];
1289 gcc_assert (mode != VOIDmode);
1291 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1292 if (size % align != 0)
1293 size = CEIL (size, align) * align;
1294 size += GET_MODE_SIZE (mode);
1295 apply_args_mode[regno] = mode;
1299 apply_args_mode[regno] = VOIDmode;
1305 /* Return the size required for the block returned by __builtin_apply,
1306 and initialize apply_result_mode. */
1309 apply_result_size (void)
1311 static int size = -1;
1313 enum machine_mode mode;
1315 /* The values computed by this function never change. */
1320 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1321 if (FUNCTION_VALUE_REGNO_P (regno))
1323 mode = reg_raw_mode[regno];
1325 gcc_assert (mode != VOIDmode);
1327 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1328 if (size % align != 0)
1329 size = CEIL (size, align) * align;
1330 size += GET_MODE_SIZE (mode);
1331 apply_result_mode[regno] = mode;
1334 apply_result_mode[regno] = VOIDmode;
1336 /* Allow targets that use untyped_call and untyped_return to override
1337 the size so that machine-specific information can be stored here. */
1338 #ifdef APPLY_RESULT_SIZE
1339 size = APPLY_RESULT_SIZE;
1345 #if defined (HAVE_untyped_call) || defined (HAVE_untyped_return)
1346 /* Create a vector describing the result block RESULT. If SAVEP is true,
1347 the result block is used to save the values; otherwise it is used to
1348 restore the values. */
1351 result_vector (int savep, rtx result)
1353 int regno, size, align, nelts;
1354 enum machine_mode mode;
1356 rtx *savevec = XALLOCAVEC (rtx, FIRST_PSEUDO_REGISTER);
1359 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1360 if ((mode = apply_result_mode[regno]) != VOIDmode)
1362 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1363 if (size % align != 0)
1364 size = CEIL (size, align) * align;
1365 reg = gen_rtx_REG (mode, savep ? regno : INCOMING_REGNO (regno));
1366 mem = adjust_address (result, mode, size);
1367 savevec[nelts++] = (savep
1368 ? gen_rtx_SET (VOIDmode, mem, reg)
1369 : gen_rtx_SET (VOIDmode, reg, mem));
1370 size += GET_MODE_SIZE (mode);
1372 return gen_rtx_PARALLEL (VOIDmode, gen_rtvec_v (nelts, savevec));
1374 #endif /* HAVE_untyped_call or HAVE_untyped_return */
1376 /* Save the state required to perform an untyped call with the same
1377 arguments as were passed to the current function. */
1380 expand_builtin_apply_args_1 (void)
1383 int size, align, regno;
1384 enum machine_mode mode;
1385 rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1387 /* Create a block where the arg-pointer, structure value address,
1388 and argument registers can be saved. */
1389 registers = assign_stack_local (BLKmode, apply_args_size (), -1);
1391 /* Walk past the arg-pointer and structure value address. */
1392 size = GET_MODE_SIZE (Pmode);
1393 if (targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0))
1394 size += GET_MODE_SIZE (Pmode);
1396 /* Save each register used in calling a function to the block. */
1397 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1398 if ((mode = apply_args_mode[regno]) != VOIDmode)
1400 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1401 if (size % align != 0)
1402 size = CEIL (size, align) * align;
1404 tem = gen_rtx_REG (mode, INCOMING_REGNO (regno));
1406 emit_move_insn (adjust_address (registers, mode, size), tem);
1407 size += GET_MODE_SIZE (mode);
1410 /* Save the arg pointer to the block. */
1411 tem = copy_to_reg (crtl->args.internal_arg_pointer);
1412 #ifdef STACK_GROWS_DOWNWARD
1413 /* We need the pointer as the caller actually passed them to us, not
1414 as we might have pretended they were passed. Make sure it's a valid
1415 operand, as emit_move_insn isn't expected to handle a PLUS. */
1417 = force_operand (plus_constant (tem, crtl->args.pretend_args_size),
1420 emit_move_insn (adjust_address (registers, Pmode, 0), tem);
1422 size = GET_MODE_SIZE (Pmode);
1424 /* Save the structure value address unless this is passed as an
1425 "invisible" first argument. */
1426 if (struct_incoming_value)
1428 emit_move_insn (adjust_address (registers, Pmode, size),
1429 copy_to_reg (struct_incoming_value));
1430 size += GET_MODE_SIZE (Pmode);
1433 /* Return the address of the block. */
1434 return copy_addr_to_reg (XEXP (registers, 0));
1437 /* __builtin_apply_args returns block of memory allocated on
1438 the stack into which is stored the arg pointer, structure
1439 value address, static chain, and all the registers that might
1440 possibly be used in performing a function call. The code is
1441 moved to the start of the function so the incoming values are
1445 expand_builtin_apply_args (void)
1447 /* Don't do __builtin_apply_args more than once in a function.
1448 Save the result of the first call and reuse it. */
1449 if (apply_args_value != 0)
1450 return apply_args_value;
1452 /* When this function is called, it means that registers must be
1453 saved on entry to this function. So we migrate the
1454 call to the first insn of this function. */
1459 temp = expand_builtin_apply_args_1 ();
1463 apply_args_value = temp;
1465 /* Put the insns after the NOTE that starts the function.
1466 If this is inside a start_sequence, make the outer-level insn
1467 chain current, so the code is placed at the start of the
1468 function. If internal_arg_pointer is a non-virtual pseudo,
1469 it needs to be placed after the function that initializes
1471 push_topmost_sequence ();
1472 if (REG_P (crtl->args.internal_arg_pointer)
1473 && REGNO (crtl->args.internal_arg_pointer) > LAST_VIRTUAL_REGISTER)
1474 emit_insn_before (seq, parm_birth_insn);
1476 emit_insn_before (seq, NEXT_INSN (entry_of_function ()));
1477 pop_topmost_sequence ();
1482 /* Perform an untyped call and save the state required to perform an
1483 untyped return of whatever value was returned by the given function. */
1486 expand_builtin_apply (rtx function, rtx arguments, rtx argsize)
1488 int size, align, regno;
1489 enum machine_mode mode;
1490 rtx incoming_args, result, reg, dest, src, call_insn;
1491 rtx old_stack_level = 0;
1492 rtx call_fusage = 0;
1493 rtx struct_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0);
1495 arguments = convert_memory_address (Pmode, arguments);
1497 /* Create a block where the return registers can be saved. */
1498 result = assign_stack_local (BLKmode, apply_result_size (), -1);
1500 /* Fetch the arg pointer from the ARGUMENTS block. */
1501 incoming_args = gen_reg_rtx (Pmode);
1502 emit_move_insn (incoming_args, gen_rtx_MEM (Pmode, arguments));
1503 #ifndef STACK_GROWS_DOWNWARD
1504 incoming_args = expand_simple_binop (Pmode, MINUS, incoming_args, argsize,
1505 incoming_args, 0, OPTAB_LIB_WIDEN);
1508 /* Push a new argument block and copy the arguments. Do not allow
1509 the (potential) memcpy call below to interfere with our stack
1511 do_pending_stack_adjust ();
1514 /* Save the stack with nonlocal if available. */
1515 #ifdef HAVE_save_stack_nonlocal
1516 if (HAVE_save_stack_nonlocal)
1517 emit_stack_save (SAVE_NONLOCAL, &old_stack_level, NULL_RTX);
1520 emit_stack_save (SAVE_BLOCK, &old_stack_level, NULL_RTX);
1522 /* Allocate a block of memory onto the stack and copy the memory
1523 arguments to the outgoing arguments address. */
1524 allocate_dynamic_stack_space (argsize, 0, BITS_PER_UNIT);
1526 /* Set DRAP flag to true, even though allocate_dynamic_stack_space
1527 may have already set current_function_calls_alloca to true.
1528 current_function_calls_alloca won't be set if argsize is zero,
1529 so we have to guarantee need_drap is true here. */
1530 if (SUPPORTS_STACK_ALIGNMENT)
1531 crtl->need_drap = true;
1533 dest = virtual_outgoing_args_rtx;
1534 #ifndef STACK_GROWS_DOWNWARD
1535 if (CONST_INT_P (argsize))
1536 dest = plus_constant (dest, -INTVAL (argsize));
1538 dest = gen_rtx_PLUS (Pmode, dest, negate_rtx (Pmode, argsize));
1540 dest = gen_rtx_MEM (BLKmode, dest);
1541 set_mem_align (dest, PARM_BOUNDARY);
1542 src = gen_rtx_MEM (BLKmode, incoming_args);
1543 set_mem_align (src, PARM_BOUNDARY);
1544 emit_block_move (dest, src, argsize, BLOCK_OP_NORMAL);
1546 /* Refer to the argument block. */
1548 arguments = gen_rtx_MEM (BLKmode, arguments);
1549 set_mem_align (arguments, PARM_BOUNDARY);
1551 /* Walk past the arg-pointer and structure value address. */
1552 size = GET_MODE_SIZE (Pmode);
1554 size += GET_MODE_SIZE (Pmode);
1556 /* Restore each of the registers previously saved. Make USE insns
1557 for each of these registers for use in making the call. */
1558 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1559 if ((mode = apply_args_mode[regno]) != VOIDmode)
1561 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1562 if (size % align != 0)
1563 size = CEIL (size, align) * align;
1564 reg = gen_rtx_REG (mode, regno);
1565 emit_move_insn (reg, adjust_address (arguments, mode, size));
1566 use_reg (&call_fusage, reg);
1567 size += GET_MODE_SIZE (mode);
1570 /* Restore the structure value address unless this is passed as an
1571 "invisible" first argument. */
1572 size = GET_MODE_SIZE (Pmode);
1575 rtx value = gen_reg_rtx (Pmode);
1576 emit_move_insn (value, adjust_address (arguments, Pmode, size));
1577 emit_move_insn (struct_value, value);
1578 if (REG_P (struct_value))
1579 use_reg (&call_fusage, struct_value);
1580 size += GET_MODE_SIZE (Pmode);
1583 /* All arguments and registers used for the call are set up by now! */
1584 function = prepare_call_address (NULL, function, NULL, &call_fusage, 0, 0);
1586 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1587 and we don't want to load it into a register as an optimization,
1588 because prepare_call_address already did it if it should be done. */
1589 if (GET_CODE (function) != SYMBOL_REF)
1590 function = memory_address (FUNCTION_MODE, function);
1592 /* Generate the actual call instruction and save the return value. */
1593 #ifdef HAVE_untyped_call
1594 if (HAVE_untyped_call)
1595 emit_call_insn (gen_untyped_call (gen_rtx_MEM (FUNCTION_MODE, function),
1596 result, result_vector (1, result)));
1599 #ifdef HAVE_call_value
1600 if (HAVE_call_value)
1604 /* Locate the unique return register. It is not possible to
1605 express a call that sets more than one return register using
1606 call_value; use untyped_call for that. In fact, untyped_call
1607 only needs to save the return registers in the given block. */
1608 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1609 if ((mode = apply_result_mode[regno]) != VOIDmode)
1611 gcc_assert (!valreg); /* HAVE_untyped_call required. */
1613 valreg = gen_rtx_REG (mode, regno);
1616 emit_call_insn (GEN_CALL_VALUE (valreg,
1617 gen_rtx_MEM (FUNCTION_MODE, function),
1618 const0_rtx, NULL_RTX, const0_rtx));
1620 emit_move_insn (adjust_address (result, GET_MODE (valreg), 0), valreg);
1626 /* Find the CALL insn we just emitted, and attach the register usage
1628 call_insn = last_call_insn ();
1629 add_function_usage_to (call_insn, call_fusage);
1631 /* Restore the stack. */
1632 #ifdef HAVE_save_stack_nonlocal
1633 if (HAVE_save_stack_nonlocal)
1634 emit_stack_restore (SAVE_NONLOCAL, old_stack_level, NULL_RTX);
1637 emit_stack_restore (SAVE_BLOCK, old_stack_level, NULL_RTX);
1641 /* Return the address of the result block. */
1642 result = copy_addr_to_reg (XEXP (result, 0));
1643 return convert_memory_address (ptr_mode, result);
1646 /* Perform an untyped return. */
1649 expand_builtin_return (rtx result)
1651 int size, align, regno;
1652 enum machine_mode mode;
1654 rtx call_fusage = 0;
1656 result = convert_memory_address (Pmode, result);
1658 apply_result_size ();
1659 result = gen_rtx_MEM (BLKmode, result);
1661 #ifdef HAVE_untyped_return
1662 if (HAVE_untyped_return)
1664 emit_jump_insn (gen_untyped_return (result, result_vector (0, result)));
1670 /* Restore the return value and note that each value is used. */
1672 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1673 if ((mode = apply_result_mode[regno]) != VOIDmode)
1675 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1676 if (size % align != 0)
1677 size = CEIL (size, align) * align;
1678 reg = gen_rtx_REG (mode, INCOMING_REGNO (regno));
1679 emit_move_insn (reg, adjust_address (result, mode, size));
1681 push_to_sequence (call_fusage);
1683 call_fusage = get_insns ();
1685 size += GET_MODE_SIZE (mode);
1688 /* Put the USE insns before the return. */
1689 emit_insn (call_fusage);
1691 /* Return whatever values was restored by jumping directly to the end
1693 expand_naked_return ();
1696 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1698 static enum type_class
1699 type_to_class (tree type)
1701 switch (TREE_CODE (type))
1703 case VOID_TYPE: return void_type_class;
1704 case INTEGER_TYPE: return integer_type_class;
1705 case ENUMERAL_TYPE: return enumeral_type_class;
1706 case BOOLEAN_TYPE: return boolean_type_class;
1707 case POINTER_TYPE: return pointer_type_class;
1708 case REFERENCE_TYPE: return reference_type_class;
1709 case OFFSET_TYPE: return offset_type_class;
1710 case REAL_TYPE: return real_type_class;
1711 case COMPLEX_TYPE: return complex_type_class;
1712 case FUNCTION_TYPE: return function_type_class;
1713 case METHOD_TYPE: return method_type_class;
1714 case RECORD_TYPE: return record_type_class;
1716 case QUAL_UNION_TYPE: return union_type_class;
1717 case ARRAY_TYPE: return (TYPE_STRING_FLAG (type)
1718 ? string_type_class : array_type_class);
1719 case LANG_TYPE: return lang_type_class;
1720 default: return no_type_class;
1724 /* Expand a call EXP to __builtin_classify_type. */
1727 expand_builtin_classify_type (tree exp)
1729 if (call_expr_nargs (exp))
1730 return GEN_INT (type_to_class (TREE_TYPE (CALL_EXPR_ARG (exp, 0))));
1731 return GEN_INT (no_type_class);
1734 /* This helper macro, meant to be used in mathfn_built_in below,
1735 determines which among a set of three builtin math functions is
1736 appropriate for a given type mode. The `F' and `L' cases are
1737 automatically generated from the `double' case. */
1738 #define CASE_MATHFN(BUILT_IN_MATHFN) \
1739 case BUILT_IN_MATHFN: case BUILT_IN_MATHFN##F: case BUILT_IN_MATHFN##L: \
1740 fcode = BUILT_IN_MATHFN; fcodef = BUILT_IN_MATHFN##F ; \
1741 fcodel = BUILT_IN_MATHFN##L ; break;
1742 /* Similar to above, but appends _R after any F/L suffix. */
1743 #define CASE_MATHFN_REENT(BUILT_IN_MATHFN) \
1744 case BUILT_IN_MATHFN##_R: case BUILT_IN_MATHFN##F_R: case BUILT_IN_MATHFN##L_R: \
1745 fcode = BUILT_IN_MATHFN##_R; fcodef = BUILT_IN_MATHFN##F_R ; \
1746 fcodel = BUILT_IN_MATHFN##L_R ; break;
1748 /* Return mathematic function equivalent to FN but operating directly
1749 on TYPE, if available. If IMPLICIT is true find the function in
1750 implicit_built_in_decls[], otherwise use built_in_decls[]. If we
1751 can't do the conversion, return zero. */
1754 mathfn_built_in_1 (tree type, enum built_in_function fn, bool implicit)
1756 tree const *const fn_arr
1757 = implicit ? implicit_built_in_decls : built_in_decls;
1758 enum built_in_function fcode, fcodef, fcodel;
1762 CASE_MATHFN (BUILT_IN_ACOS)
1763 CASE_MATHFN (BUILT_IN_ACOSH)
1764 CASE_MATHFN (BUILT_IN_ASIN)
1765 CASE_MATHFN (BUILT_IN_ASINH)
1766 CASE_MATHFN (BUILT_IN_ATAN)
1767 CASE_MATHFN (BUILT_IN_ATAN2)
1768 CASE_MATHFN (BUILT_IN_ATANH)
1769 CASE_MATHFN (BUILT_IN_CBRT)
1770 CASE_MATHFN (BUILT_IN_CEIL)
1771 CASE_MATHFN (BUILT_IN_CEXPI)
1772 CASE_MATHFN (BUILT_IN_COPYSIGN)
1773 CASE_MATHFN (BUILT_IN_COS)
1774 CASE_MATHFN (BUILT_IN_COSH)
1775 CASE_MATHFN (BUILT_IN_DREM)
1776 CASE_MATHFN (BUILT_IN_ERF)
1777 CASE_MATHFN (BUILT_IN_ERFC)
1778 CASE_MATHFN (BUILT_IN_EXP)
1779 CASE_MATHFN (BUILT_IN_EXP10)
1780 CASE_MATHFN (BUILT_IN_EXP2)
1781 CASE_MATHFN (BUILT_IN_EXPM1)
1782 CASE_MATHFN (BUILT_IN_FABS)
1783 CASE_MATHFN (BUILT_IN_FDIM)
1784 CASE_MATHFN (BUILT_IN_FLOOR)
1785 CASE_MATHFN (BUILT_IN_FMA)
1786 CASE_MATHFN (BUILT_IN_FMAX)
1787 CASE_MATHFN (BUILT_IN_FMIN)
1788 CASE_MATHFN (BUILT_IN_FMOD)
1789 CASE_MATHFN (BUILT_IN_FREXP)
1790 CASE_MATHFN (BUILT_IN_GAMMA)
1791 CASE_MATHFN_REENT (BUILT_IN_GAMMA) /* GAMMA_R */
1792 CASE_MATHFN (BUILT_IN_HUGE_VAL)
1793 CASE_MATHFN (BUILT_IN_HYPOT)
1794 CASE_MATHFN (BUILT_IN_ILOGB)
1795 CASE_MATHFN (BUILT_IN_INF)
1796 CASE_MATHFN (BUILT_IN_ISINF)
1797 CASE_MATHFN (BUILT_IN_J0)
1798 CASE_MATHFN (BUILT_IN_J1)
1799 CASE_MATHFN (BUILT_IN_JN)
1800 CASE_MATHFN (BUILT_IN_LCEIL)
1801 CASE_MATHFN (BUILT_IN_LDEXP)
1802 CASE_MATHFN (BUILT_IN_LFLOOR)
1803 CASE_MATHFN (BUILT_IN_LGAMMA)
1804 CASE_MATHFN_REENT (BUILT_IN_LGAMMA) /* LGAMMA_R */
1805 CASE_MATHFN (BUILT_IN_LLCEIL)
1806 CASE_MATHFN (BUILT_IN_LLFLOOR)
1807 CASE_MATHFN (BUILT_IN_LLRINT)
1808 CASE_MATHFN (BUILT_IN_LLROUND)
1809 CASE_MATHFN (BUILT_IN_LOG)
1810 CASE_MATHFN (BUILT_IN_LOG10)
1811 CASE_MATHFN (BUILT_IN_LOG1P)
1812 CASE_MATHFN (BUILT_IN_LOG2)
1813 CASE_MATHFN (BUILT_IN_LOGB)
1814 CASE_MATHFN (BUILT_IN_LRINT)
1815 CASE_MATHFN (BUILT_IN_LROUND)
1816 CASE_MATHFN (BUILT_IN_MODF)
1817 CASE_MATHFN (BUILT_IN_NAN)
1818 CASE_MATHFN (BUILT_IN_NANS)
1819 CASE_MATHFN (BUILT_IN_NEARBYINT)
1820 CASE_MATHFN (BUILT_IN_NEXTAFTER)
1821 CASE_MATHFN (BUILT_IN_NEXTTOWARD)
1822 CASE_MATHFN (BUILT_IN_POW)
1823 CASE_MATHFN (BUILT_IN_POWI)
1824 CASE_MATHFN (BUILT_IN_POW10)
1825 CASE_MATHFN (BUILT_IN_REMAINDER)
1826 CASE_MATHFN (BUILT_IN_REMQUO)
1827 CASE_MATHFN (BUILT_IN_RINT)
1828 CASE_MATHFN (BUILT_IN_ROUND)
1829 CASE_MATHFN (BUILT_IN_SCALB)
1830 CASE_MATHFN (BUILT_IN_SCALBLN)
1831 CASE_MATHFN (BUILT_IN_SCALBN)
1832 CASE_MATHFN (BUILT_IN_SIGNBIT)
1833 CASE_MATHFN (BUILT_IN_SIGNIFICAND)
1834 CASE_MATHFN (BUILT_IN_SIN)
1835 CASE_MATHFN (BUILT_IN_SINCOS)
1836 CASE_MATHFN (BUILT_IN_SINH)
1837 CASE_MATHFN (BUILT_IN_SQRT)
1838 CASE_MATHFN (BUILT_IN_TAN)
1839 CASE_MATHFN (BUILT_IN_TANH)
1840 CASE_MATHFN (BUILT_IN_TGAMMA)
1841 CASE_MATHFN (BUILT_IN_TRUNC)
1842 CASE_MATHFN (BUILT_IN_Y0)
1843 CASE_MATHFN (BUILT_IN_Y1)
1844 CASE_MATHFN (BUILT_IN_YN)
1850 if (TYPE_MAIN_VARIANT (type) == double_type_node)
1851 return fn_arr[fcode];
1852 else if (TYPE_MAIN_VARIANT (type) == float_type_node)
1853 return fn_arr[fcodef];
1854 else if (TYPE_MAIN_VARIANT (type) == long_double_type_node)
1855 return fn_arr[fcodel];
1860 /* Like mathfn_built_in_1(), but always use the implicit array. */
1863 mathfn_built_in (tree type, enum built_in_function fn)
1865 return mathfn_built_in_1 (type, fn, /*implicit=*/ 1);
1868 /* If errno must be maintained, expand the RTL to check if the result,
1869 TARGET, of a built-in function call, EXP, is NaN, and if so set
1873 expand_errno_check (tree exp, rtx target)
1875 rtx lab = gen_label_rtx ();
1877 /* Test the result; if it is NaN, set errno=EDOM because
1878 the argument was not in the domain. */
1879 do_compare_rtx_and_jump (target, target, EQ, 0, GET_MODE (target),
1880 NULL_RTX, NULL_RTX, lab);
1883 /* If this built-in doesn't throw an exception, set errno directly. */
1884 if (TREE_NOTHROW (TREE_OPERAND (CALL_EXPR_FN (exp), 0)))
1886 #ifdef GEN_ERRNO_RTX
1887 rtx errno_rtx = GEN_ERRNO_RTX;
1890 = gen_rtx_MEM (word_mode, gen_rtx_SYMBOL_REF (Pmode, "errno"));
1892 emit_move_insn (errno_rtx, GEN_INT (TARGET_EDOM));
1898 /* Make sure the library call isn't expanded as a tail call. */
1899 CALL_EXPR_TAILCALL (exp) = 0;
1901 /* We can't set errno=EDOM directly; let the library call do it.
1902 Pop the arguments right away in case the call gets deleted. */
1904 expand_call (exp, target, 0);
1909 /* Expand a call to one of the builtin math functions (sqrt, exp, or log).
1910 Return NULL_RTX if a normal call should be emitted rather than expanding
1911 the function in-line. EXP is the expression that is a call to the builtin
1912 function; if convenient, the result should be placed in TARGET.
1913 SUBTARGET may be used as the target for computing one of EXP's operands. */
1916 expand_builtin_mathfn (tree exp, rtx target, rtx subtarget)
1918 optab builtin_optab;
1920 tree fndecl = get_callee_fndecl (exp);
1921 enum machine_mode mode;
1922 bool errno_set = false;
1925 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
1928 arg = CALL_EXPR_ARG (exp, 0);
1930 switch (DECL_FUNCTION_CODE (fndecl))
1932 CASE_FLT_FN (BUILT_IN_SQRT):
1933 errno_set = ! tree_expr_nonnegative_p (arg);
1934 builtin_optab = sqrt_optab;
1936 CASE_FLT_FN (BUILT_IN_EXP):
1937 errno_set = true; builtin_optab = exp_optab; break;
1938 CASE_FLT_FN (BUILT_IN_EXP10):
1939 CASE_FLT_FN (BUILT_IN_POW10):
1940 errno_set = true; builtin_optab = exp10_optab; break;
1941 CASE_FLT_FN (BUILT_IN_EXP2):
1942 errno_set = true; builtin_optab = exp2_optab; break;
1943 CASE_FLT_FN (BUILT_IN_EXPM1):
1944 errno_set = true; builtin_optab = expm1_optab; break;
1945 CASE_FLT_FN (BUILT_IN_LOGB):
1946 errno_set = true; builtin_optab = logb_optab; break;
1947 CASE_FLT_FN (BUILT_IN_LOG):
1948 errno_set = true; builtin_optab = log_optab; break;
1949 CASE_FLT_FN (BUILT_IN_LOG10):
1950 errno_set = true; builtin_optab = log10_optab; break;
1951 CASE_FLT_FN (BUILT_IN_LOG2):
1952 errno_set = true; builtin_optab = log2_optab; break;
1953 CASE_FLT_FN (BUILT_IN_LOG1P):
1954 errno_set = true; builtin_optab = log1p_optab; break;
1955 CASE_FLT_FN (BUILT_IN_ASIN):
1956 builtin_optab = asin_optab; break;
1957 CASE_FLT_FN (BUILT_IN_ACOS):
1958 builtin_optab = acos_optab; break;
1959 CASE_FLT_FN (BUILT_IN_TAN):
1960 builtin_optab = tan_optab; break;
1961 CASE_FLT_FN (BUILT_IN_ATAN):
1962 builtin_optab = atan_optab; break;
1963 CASE_FLT_FN (BUILT_IN_FLOOR):
1964 builtin_optab = floor_optab; break;
1965 CASE_FLT_FN (BUILT_IN_CEIL):
1966 builtin_optab = ceil_optab; break;
1967 CASE_FLT_FN (BUILT_IN_TRUNC):
1968 builtin_optab = btrunc_optab; break;
1969 CASE_FLT_FN (BUILT_IN_ROUND):
1970 builtin_optab = round_optab; break;
1971 CASE_FLT_FN (BUILT_IN_NEARBYINT):
1972 builtin_optab = nearbyint_optab;
1973 if (flag_trapping_math)
1975 /* Else fallthrough and expand as rint. */
1976 CASE_FLT_FN (BUILT_IN_RINT):
1977 builtin_optab = rint_optab; break;
1978 CASE_FLT_FN (BUILT_IN_SIGNIFICAND):
1979 builtin_optab = significand_optab; break;
1984 /* Make a suitable register to place result in. */
1985 mode = TYPE_MODE (TREE_TYPE (exp));
1987 if (! flag_errno_math || ! HONOR_NANS (mode))
1990 /* Before working hard, check whether the instruction is available. */
1991 if (optab_handler (builtin_optab, mode)->insn_code != CODE_FOR_nothing)
1993 target = gen_reg_rtx (mode);
1995 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
1996 need to expand the argument again. This way, we will not perform
1997 side-effects more the once. */
1998 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2000 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
2004 /* Compute into TARGET.
2005 Set TARGET to wherever the result comes back. */
2006 target = expand_unop (mode, builtin_optab, op0, target, 0);
2011 expand_errno_check (exp, target);
2013 /* Output the entire sequence. */
2014 insns = get_insns ();
2020 /* If we were unable to expand via the builtin, stop the sequence
2021 (without outputting the insns) and call to the library function
2022 with the stabilized argument list. */
2026 return expand_call (exp, target, target == const0_rtx);
2029 /* Expand a call to the builtin binary math functions (pow and atan2).
2030 Return NULL_RTX if a normal call should be emitted rather than expanding the
2031 function in-line. EXP is the expression that is a call to the builtin
2032 function; if convenient, the result should be placed in TARGET.
2033 SUBTARGET may be used as the target for computing one of EXP's
2037 expand_builtin_mathfn_2 (tree exp, rtx target, rtx subtarget)
2039 optab builtin_optab;
2040 rtx op0, op1, insns;
2041 int op1_type = REAL_TYPE;
2042 tree fndecl = get_callee_fndecl (exp);
2044 enum machine_mode mode;
2045 bool errno_set = true;
2047 switch (DECL_FUNCTION_CODE (fndecl))
2049 CASE_FLT_FN (BUILT_IN_SCALBN):
2050 CASE_FLT_FN (BUILT_IN_SCALBLN):
2051 CASE_FLT_FN (BUILT_IN_LDEXP):
2052 op1_type = INTEGER_TYPE;
2057 if (!validate_arglist (exp, REAL_TYPE, op1_type, VOID_TYPE))
2060 arg0 = CALL_EXPR_ARG (exp, 0);
2061 arg1 = CALL_EXPR_ARG (exp, 1);
2063 switch (DECL_FUNCTION_CODE (fndecl))
2065 CASE_FLT_FN (BUILT_IN_POW):
2066 builtin_optab = pow_optab; break;
2067 CASE_FLT_FN (BUILT_IN_ATAN2):
2068 builtin_optab = atan2_optab; break;
2069 CASE_FLT_FN (BUILT_IN_SCALB):
2070 if (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (exp)))->b != 2)
2072 builtin_optab = scalb_optab; break;
2073 CASE_FLT_FN (BUILT_IN_SCALBN):
2074 CASE_FLT_FN (BUILT_IN_SCALBLN):
2075 if (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (exp)))->b != 2)
2077 /* Fall through... */
2078 CASE_FLT_FN (BUILT_IN_LDEXP):
2079 builtin_optab = ldexp_optab; break;
2080 CASE_FLT_FN (BUILT_IN_FMOD):
2081 builtin_optab = fmod_optab; break;
2082 CASE_FLT_FN (BUILT_IN_REMAINDER):
2083 CASE_FLT_FN (BUILT_IN_DREM):
2084 builtin_optab = remainder_optab; break;
2089 /* Make a suitable register to place result in. */
2090 mode = TYPE_MODE (TREE_TYPE (exp));
2092 /* Before working hard, check whether the instruction is available. */
2093 if (optab_handler (builtin_optab, mode)->insn_code == CODE_FOR_nothing)
2096 target = gen_reg_rtx (mode);
2098 if (! flag_errno_math || ! HONOR_NANS (mode))
2101 /* Always stabilize the argument list. */
2102 CALL_EXPR_ARG (exp, 0) = arg0 = builtin_save_expr (arg0);
2103 CALL_EXPR_ARG (exp, 1) = arg1 = builtin_save_expr (arg1);
2105 op0 = expand_expr (arg0, subtarget, VOIDmode, EXPAND_NORMAL);
2106 op1 = expand_normal (arg1);
2110 /* Compute into TARGET.
2111 Set TARGET to wherever the result comes back. */
2112 target = expand_binop (mode, builtin_optab, op0, op1,
2113 target, 0, OPTAB_DIRECT);
2115 /* If we were unable to expand via the builtin, stop the sequence
2116 (without outputting the insns) and call to the library function
2117 with the stabilized argument list. */
2121 return expand_call (exp, target, target == const0_rtx);
2125 expand_errno_check (exp, target);
2127 /* Output the entire sequence. */
2128 insns = get_insns ();
2135 /* Expand a call to the builtin sin and cos math functions.
2136 Return NULL_RTX if a normal call should be emitted rather than expanding the
2137 function in-line. EXP is the expression that is a call to the builtin
2138 function; if convenient, the result should be placed in TARGET.
2139 SUBTARGET may be used as the target for computing one of EXP's
2143 expand_builtin_mathfn_3 (tree exp, rtx target, rtx subtarget)
2145 optab builtin_optab;
2147 tree fndecl = get_callee_fndecl (exp);
2148 enum machine_mode mode;
2151 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2154 arg = CALL_EXPR_ARG (exp, 0);
2156 switch (DECL_FUNCTION_CODE (fndecl))
2158 CASE_FLT_FN (BUILT_IN_SIN):
2159 CASE_FLT_FN (BUILT_IN_COS):
2160 builtin_optab = sincos_optab; break;
2165 /* Make a suitable register to place result in. */
2166 mode = TYPE_MODE (TREE_TYPE (exp));
2168 /* Check if sincos insn is available, otherwise fallback
2169 to sin or cos insn. */
2170 if (optab_handler (builtin_optab, mode)->insn_code == CODE_FOR_nothing)
2171 switch (DECL_FUNCTION_CODE (fndecl))
2173 CASE_FLT_FN (BUILT_IN_SIN):
2174 builtin_optab = sin_optab; break;
2175 CASE_FLT_FN (BUILT_IN_COS):
2176 builtin_optab = cos_optab; break;
2181 /* Before working hard, check whether the instruction is available. */
2182 if (optab_handler (builtin_optab, mode)->insn_code != CODE_FOR_nothing)
2184 target = gen_reg_rtx (mode);
2186 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2187 need to expand the argument again. This way, we will not perform
2188 side-effects more the once. */
2189 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2191 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
2195 /* Compute into TARGET.
2196 Set TARGET to wherever the result comes back. */
2197 if (builtin_optab == sincos_optab)
2201 switch (DECL_FUNCTION_CODE (fndecl))
2203 CASE_FLT_FN (BUILT_IN_SIN):
2204 result = expand_twoval_unop (builtin_optab, op0, 0, target, 0);
2206 CASE_FLT_FN (BUILT_IN_COS):
2207 result = expand_twoval_unop (builtin_optab, op0, target, 0, 0);
2212 gcc_assert (result);
2216 target = expand_unop (mode, builtin_optab, op0, target, 0);
2221 /* Output the entire sequence. */
2222 insns = get_insns ();
2228 /* If we were unable to expand via the builtin, stop the sequence
2229 (without outputting the insns) and call to the library function
2230 with the stabilized argument list. */
2234 target = expand_call (exp, target, target == const0_rtx);
2239 /* Given an interclass math builtin decl FNDECL and it's argument ARG
2240 return an RTL instruction code that implements the functionality.
2241 If that isn't possible or available return CODE_FOR_nothing. */
2243 static enum insn_code
2244 interclass_mathfn_icode (tree arg, tree fndecl)
2246 bool errno_set = false;
2247 optab builtin_optab = 0;
2248 enum machine_mode mode;
2250 switch (DECL_FUNCTION_CODE (fndecl))
2252 CASE_FLT_FN (BUILT_IN_ILOGB):
2253 errno_set = true; builtin_optab = ilogb_optab; break;
2254 CASE_FLT_FN (BUILT_IN_ISINF):
2255 builtin_optab = isinf_optab; break;
2256 case BUILT_IN_ISNORMAL:
2257 case BUILT_IN_ISFINITE:
2258 CASE_FLT_FN (BUILT_IN_FINITE):
2259 case BUILT_IN_FINITED32:
2260 case BUILT_IN_FINITED64:
2261 case BUILT_IN_FINITED128:
2262 case BUILT_IN_ISINFD32:
2263 case BUILT_IN_ISINFD64:
2264 case BUILT_IN_ISINFD128:
2265 /* These builtins have no optabs (yet). */
2271 /* There's no easy way to detect the case we need to set EDOM. */
2272 if (flag_errno_math && errno_set)
2273 return CODE_FOR_nothing;
2275 /* Optab mode depends on the mode of the input argument. */
2276 mode = TYPE_MODE (TREE_TYPE (arg));
2279 return optab_handler (builtin_optab, mode)->insn_code;
2280 return CODE_FOR_nothing;
2283 /* Expand a call to one of the builtin math functions that operate on
2284 floating point argument and output an integer result (ilogb, isinf,
2286 Return 0 if a normal call should be emitted rather than expanding the
2287 function in-line. EXP is the expression that is a call to the builtin
2288 function; if convenient, the result should be placed in TARGET.
2289 SUBTARGET may be used as the target for computing one of EXP's operands. */
2292 expand_builtin_interclass_mathfn (tree exp, rtx target, rtx subtarget)
2294 enum insn_code icode = CODE_FOR_nothing;
2296 tree fndecl = get_callee_fndecl (exp);
2297 enum machine_mode mode;
2300 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2303 arg = CALL_EXPR_ARG (exp, 0);
2304 icode = interclass_mathfn_icode (arg, fndecl);
2305 mode = TYPE_MODE (TREE_TYPE (arg));
2307 if (icode != CODE_FOR_nothing)
2309 /* Make a suitable register to place result in. */
2311 || GET_MODE (target) != TYPE_MODE (TREE_TYPE (exp)))
2312 target = gen_reg_rtx (TYPE_MODE (TREE_TYPE (exp)));
2314 gcc_assert (insn_data[icode].operand[0].predicate
2315 (target, GET_MODE (target)));
2317 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2318 need to expand the argument again. This way, we will not perform
2319 side-effects more the once. */
2320 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2322 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
2324 if (mode != GET_MODE (op0))
2325 op0 = convert_to_mode (mode, op0, 0);
2327 /* Compute into TARGET.
2328 Set TARGET to wherever the result comes back. */
2329 emit_unop_insn (icode, target, op0, UNKNOWN);
2336 /* Expand a call to the builtin sincos math function.
2337 Return NULL_RTX if a normal call should be emitted rather than expanding the
2338 function in-line. EXP is the expression that is a call to the builtin
2342 expand_builtin_sincos (tree exp)
2344 rtx op0, op1, op2, target1, target2;
2345 enum machine_mode mode;
2346 tree arg, sinp, cosp;
2348 location_t loc = EXPR_LOCATION (exp);
2350 if (!validate_arglist (exp, REAL_TYPE,
2351 POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
2354 arg = CALL_EXPR_ARG (exp, 0);
2355 sinp = CALL_EXPR_ARG (exp, 1);
2356 cosp = CALL_EXPR_ARG (exp, 2);
2358 /* Make a suitable register to place result in. */
2359 mode = TYPE_MODE (TREE_TYPE (arg));
2361 /* Check if sincos insn is available, otherwise emit the call. */
2362 if (optab_handler (sincos_optab, mode)->insn_code == CODE_FOR_nothing)
2365 target1 = gen_reg_rtx (mode);
2366 target2 = gen_reg_rtx (mode);
2368 op0 = expand_normal (arg);
2369 op1 = expand_normal (build_fold_indirect_ref_loc (loc, sinp));
2370 op2 = expand_normal (build_fold_indirect_ref_loc (loc, cosp));
2372 /* Compute into target1 and target2.
2373 Set TARGET to wherever the result comes back. */
2374 result = expand_twoval_unop (sincos_optab, op0, target2, target1, 0);
2375 gcc_assert (result);
2377 /* Move target1 and target2 to the memory locations indicated
2379 emit_move_insn (op1, target1);
2380 emit_move_insn (op2, target2);
2385 /* Expand a call to the internal cexpi builtin to the sincos math function.
2386 EXP is the expression that is a call to the builtin function; if convenient,
2387 the result should be placed in TARGET. SUBTARGET may be used as the target
2388 for computing one of EXP's operands. */
2391 expand_builtin_cexpi (tree exp, rtx target, rtx subtarget)
2393 tree fndecl = get_callee_fndecl (exp);
2395 enum machine_mode mode;
2397 location_t loc = EXPR_LOCATION (exp);
2399 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2402 arg = CALL_EXPR_ARG (exp, 0);
2403 type = TREE_TYPE (arg);
2404 mode = TYPE_MODE (TREE_TYPE (arg));
2406 /* Try expanding via a sincos optab, fall back to emitting a libcall
2407 to sincos or cexp. We are sure we have sincos or cexp because cexpi
2408 is only generated from sincos, cexp or if we have either of them. */
2409 if (optab_handler (sincos_optab, mode)->insn_code != CODE_FOR_nothing)
2411 op1 = gen_reg_rtx (mode);
2412 op2 = gen_reg_rtx (mode);
2414 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
2416 /* Compute into op1 and op2. */
2417 expand_twoval_unop (sincos_optab, op0, op2, op1, 0);
2419 else if (TARGET_HAS_SINCOS)
2421 tree call, fn = NULL_TREE;
2425 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIF)
2426 fn = built_in_decls[BUILT_IN_SINCOSF];
2427 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPI)
2428 fn = built_in_decls[BUILT_IN_SINCOS];
2429 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIL)
2430 fn = built_in_decls[BUILT_IN_SINCOSL];
2434 op1 = assign_temp (TREE_TYPE (arg), 0, 1, 1);
2435 op2 = assign_temp (TREE_TYPE (arg), 0, 1, 1);
2436 op1a = copy_to_mode_reg (Pmode, XEXP (op1, 0));
2437 op2a = copy_to_mode_reg (Pmode, XEXP (op2, 0));
2438 top1 = make_tree (build_pointer_type (TREE_TYPE (arg)), op1a);
2439 top2 = make_tree (build_pointer_type (TREE_TYPE (arg)), op2a);
2441 /* Make sure not to fold the sincos call again. */
2442 call = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn);
2443 expand_normal (build_call_nary (TREE_TYPE (TREE_TYPE (fn)),
2444 call, 3, arg, top1, top2));
2448 tree call, fn = NULL_TREE, narg;
2449 tree ctype = build_complex_type (type);
2451 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIF)
2452 fn = built_in_decls[BUILT_IN_CEXPF];
2453 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPI)
2454 fn = built_in_decls[BUILT_IN_CEXP];
2455 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIL)
2456 fn = built_in_decls[BUILT_IN_CEXPL];
2460 /* If we don't have a decl for cexp create one. This is the
2461 friendliest fallback if the user calls __builtin_cexpi
2462 without full target C99 function support. */
2463 if (fn == NULL_TREE)
2466 const char *name = NULL;
2468 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIF)
2470 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPI)
2472 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIL)
2475 fntype = build_function_type_list (ctype, ctype, NULL_TREE);
2476 fn = build_fn_decl (name, fntype);
2479 narg = fold_build2_loc (loc, COMPLEX_EXPR, ctype,
2480 build_real (type, dconst0), arg);
2482 /* Make sure not to fold the cexp call again. */
2483 call = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn);
2484 return expand_expr (build_call_nary (ctype, call, 1, narg),
2485 target, VOIDmode, EXPAND_NORMAL);
2488 /* Now build the proper return type. */
2489 return expand_expr (build2 (COMPLEX_EXPR, build_complex_type (type),
2490 make_tree (TREE_TYPE (arg), op2),
2491 make_tree (TREE_TYPE (arg), op1)),
2492 target, VOIDmode, EXPAND_NORMAL);
2495 /* Conveniently construct a function call expression. FNDECL names the
2496 function to be called, N is the number of arguments, and the "..."
2497 parameters are the argument expressions. Unlike build_call_exr
2498 this doesn't fold the call, hence it will always return a CALL_EXPR. */
2501 build_call_nofold_loc (location_t loc, tree fndecl, int n, ...)
2504 tree fntype = TREE_TYPE (fndecl);
2505 tree fn = build1 (ADDR_EXPR, build_pointer_type (fntype), fndecl);
2508 fn = build_call_valist (TREE_TYPE (fntype), fn, n, ap);
2510 SET_EXPR_LOCATION (fn, loc);
2513 #define build_call_nofold(...) \
2514 build_call_nofold_loc (UNKNOWN_LOCATION, __VA_ARGS__)
2516 /* Expand a call to one of the builtin rounding functions gcc defines
2517 as an extension (lfloor and lceil). As these are gcc extensions we
2518 do not need to worry about setting errno to EDOM.
2519 If expanding via optab fails, lower expression to (int)(floor(x)).
2520 EXP is the expression that is a call to the builtin function;
2521 if convenient, the result should be placed in TARGET. */
2524 expand_builtin_int_roundingfn (tree exp, rtx target)
2526 convert_optab builtin_optab;
2527 rtx op0, insns, tmp;
2528 tree fndecl = get_callee_fndecl (exp);
2529 enum built_in_function fallback_fn;
2530 tree fallback_fndecl;
2531 enum machine_mode mode;
2534 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2537 arg = CALL_EXPR_ARG (exp, 0);
2539 switch (DECL_FUNCTION_CODE (fndecl))
2541 CASE_FLT_FN (BUILT_IN_LCEIL):
2542 CASE_FLT_FN (BUILT_IN_LLCEIL):
2543 builtin_optab = lceil_optab;
2544 fallback_fn = BUILT_IN_CEIL;
2547 CASE_FLT_FN (BUILT_IN_LFLOOR):
2548 CASE_FLT_FN (BUILT_IN_LLFLOOR):
2549 builtin_optab = lfloor_optab;
2550 fallback_fn = BUILT_IN_FLOOR;
2557 /* Make a suitable register to place result in. */
2558 mode = TYPE_MODE (TREE_TYPE (exp));
2560 target = gen_reg_rtx (mode);
2562 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2563 need to expand the argument again. This way, we will not perform
2564 side-effects more the once. */
2565 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2567 op0 = expand_expr (arg, NULL, VOIDmode, EXPAND_NORMAL);
2571 /* Compute into TARGET. */
2572 if (expand_sfix_optab (target, op0, builtin_optab))
2574 /* Output the entire sequence. */
2575 insns = get_insns ();
2581 /* If we were unable to expand via the builtin, stop the sequence
2582 (without outputting the insns). */
2585 /* Fall back to floating point rounding optab. */
2586 fallback_fndecl = mathfn_built_in (TREE_TYPE (arg), fallback_fn);
2588 /* For non-C99 targets we may end up without a fallback fndecl here
2589 if the user called __builtin_lfloor directly. In this case emit
2590 a call to the floor/ceil variants nevertheless. This should result
2591 in the best user experience for not full C99 targets. */
2592 if (fallback_fndecl == NULL_TREE)
2595 const char *name = NULL;
2597 switch (DECL_FUNCTION_CODE (fndecl))
2599 case BUILT_IN_LCEIL:
2600 case BUILT_IN_LLCEIL:
2603 case BUILT_IN_LCEILF:
2604 case BUILT_IN_LLCEILF:
2607 case BUILT_IN_LCEILL:
2608 case BUILT_IN_LLCEILL:
2611 case BUILT_IN_LFLOOR:
2612 case BUILT_IN_LLFLOOR:
2615 case BUILT_IN_LFLOORF:
2616 case BUILT_IN_LLFLOORF:
2619 case BUILT_IN_LFLOORL:
2620 case BUILT_IN_LLFLOORL:
2627 fntype = build_function_type_list (TREE_TYPE (arg),
2628 TREE_TYPE (arg), NULL_TREE);
2629 fallback_fndecl = build_fn_decl (name, fntype);
2632 exp = build_call_nofold (fallback_fndecl, 1, arg);
2634 tmp = expand_normal (exp);
2636 /* Truncate the result of floating point optab to integer
2637 via expand_fix (). */
2638 target = gen_reg_rtx (mode);
2639 expand_fix (target, tmp, 0);
2644 /* Expand a call to one of the builtin math functions doing integer
2646 Return 0 if a normal call should be emitted rather than expanding the
2647 function in-line. EXP is the expression that is a call to the builtin
2648 function; if convenient, the result should be placed in TARGET. */
2651 expand_builtin_int_roundingfn_2 (tree exp, rtx target)
2653 convert_optab builtin_optab;
2655 tree fndecl = get_callee_fndecl (exp);
2657 enum machine_mode mode;
2659 /* There's no easy way to detect the case we need to set EDOM. */
2660 if (flag_errno_math)
2663 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2666 arg = CALL_EXPR_ARG (exp, 0);
2668 switch (DECL_FUNCTION_CODE (fndecl))
2670 CASE_FLT_FN (BUILT_IN_LRINT):
2671 CASE_FLT_FN (BUILT_IN_LLRINT):
2672 builtin_optab = lrint_optab; break;
2673 CASE_FLT_FN (BUILT_IN_LROUND):
2674 CASE_FLT_FN (BUILT_IN_LLROUND):
2675 builtin_optab = lround_optab; break;
2680 /* Make a suitable register to place result in. */
2681 mode = TYPE_MODE (TREE_TYPE (exp));
2683 target = gen_reg_rtx (mode);
2685 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2686 need to expand the argument again. This way, we will not perform
2687 side-effects more the once. */
2688 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2690 op0 = expand_expr (arg, NULL, VOIDmode, EXPAND_NORMAL);
2694 if (expand_sfix_optab (target, op0, builtin_optab))
2696 /* Output the entire sequence. */
2697 insns = get_insns ();
2703 /* If we were unable to expand via the builtin, stop the sequence
2704 (without outputting the insns) and call to the library function
2705 with the stabilized argument list. */
2708 target = expand_call (exp, target, target == const0_rtx);
2713 /* To evaluate powi(x,n), the floating point value x raised to the
2714 constant integer exponent n, we use a hybrid algorithm that
2715 combines the "window method" with look-up tables. For an
2716 introduction to exponentiation algorithms and "addition chains",
2717 see section 4.6.3, "Evaluation of Powers" of Donald E. Knuth,
2718 "Seminumerical Algorithms", Vol. 2, "The Art of Computer Programming",
2719 3rd Edition, 1998, and Daniel M. Gordon, "A Survey of Fast Exponentiation
2720 Methods", Journal of Algorithms, Vol. 27, pp. 129-146, 1998. */
2722 /* Provide a default value for POWI_MAX_MULTS, the maximum number of
2723 multiplications to inline before calling the system library's pow
2724 function. powi(x,n) requires at worst 2*bits(n)-2 multiplications,
2725 so this default never requires calling pow, powf or powl. */
2727 #ifndef POWI_MAX_MULTS
2728 #define POWI_MAX_MULTS (2*HOST_BITS_PER_WIDE_INT-2)
2731 /* The size of the "optimal power tree" lookup table. All
2732 exponents less than this value are simply looked up in the
2733 powi_table below. This threshold is also used to size the
2734 cache of pseudo registers that hold intermediate results. */
2735 #define POWI_TABLE_SIZE 256
2737 /* The size, in bits of the window, used in the "window method"
2738 exponentiation algorithm. This is equivalent to a radix of
2739 (1<<POWI_WINDOW_SIZE) in the corresponding "m-ary method". */
2740 #define POWI_WINDOW_SIZE 3
2742 /* The following table is an efficient representation of an
2743 "optimal power tree". For each value, i, the corresponding
2744 value, j, in the table states than an optimal evaluation
2745 sequence for calculating pow(x,i) can be found by evaluating
2746 pow(x,j)*pow(x,i-j). An optimal power tree for the first
2747 100 integers is given in Knuth's "Seminumerical algorithms". */
2749 static const unsigned char powi_table[POWI_TABLE_SIZE] =
2751 0, 1, 1, 2, 2, 3, 3, 4, /* 0 - 7 */
2752 4, 6, 5, 6, 6, 10, 7, 9, /* 8 - 15 */
2753 8, 16, 9, 16, 10, 12, 11, 13, /* 16 - 23 */
2754 12, 17, 13, 18, 14, 24, 15, 26, /* 24 - 31 */
2755 16, 17, 17, 19, 18, 33, 19, 26, /* 32 - 39 */
2756 20, 25, 21, 40, 22, 27, 23, 44, /* 40 - 47 */
2757 24, 32, 25, 34, 26, 29, 27, 44, /* 48 - 55 */
2758 28, 31, 29, 34, 30, 60, 31, 36, /* 56 - 63 */
2759 32, 64, 33, 34, 34, 46, 35, 37, /* 64 - 71 */
2760 36, 65, 37, 50, 38, 48, 39, 69, /* 72 - 79 */
2761 40, 49, 41, 43, 42, 51, 43, 58, /* 80 - 87 */
2762 44, 64, 45, 47, 46, 59, 47, 76, /* 88 - 95 */
2763 48, 65, 49, 66, 50, 67, 51, 66, /* 96 - 103 */
2764 52, 70, 53, 74, 54, 104, 55, 74, /* 104 - 111 */
2765 56, 64, 57, 69, 58, 78, 59, 68, /* 112 - 119 */
2766 60, 61, 61, 80, 62, 75, 63, 68, /* 120 - 127 */
2767 64, 65, 65, 128, 66, 129, 67, 90, /* 128 - 135 */
2768 68, 73, 69, 131, 70, 94, 71, 88, /* 136 - 143 */
2769 72, 128, 73, 98, 74, 132, 75, 121, /* 144 - 151 */
2770 76, 102, 77, 124, 78, 132, 79, 106, /* 152 - 159 */
2771 80, 97, 81, 160, 82, 99, 83, 134, /* 160 - 167 */
2772 84, 86, 85, 95, 86, 160, 87, 100, /* 168 - 175 */
2773 88, 113, 89, 98, 90, 107, 91, 122, /* 176 - 183 */
2774 92, 111, 93, 102, 94, 126, 95, 150, /* 184 - 191 */
2775 96, 128, 97, 130, 98, 133, 99, 195, /* 192 - 199 */
2776 100, 128, 101, 123, 102, 164, 103, 138, /* 200 - 207 */
2777 104, 145, 105, 146, 106, 109, 107, 149, /* 208 - 215 */
2778 108, 200, 109, 146, 110, 170, 111, 157, /* 216 - 223 */
2779 112, 128, 113, 130, 114, 182, 115, 132, /* 224 - 231 */
2780 116, 200, 117, 132, 118, 158, 119, 206, /* 232 - 239 */
2781 120, 240, 121, 162, 122, 147, 123, 152, /* 240 - 247 */
2782 124, 166, 125, 214, 126, 138, 127, 153, /* 248 - 255 */
2786 /* Return the number of multiplications required to calculate
2787 powi(x,n) where n is less than POWI_TABLE_SIZE. This is a
2788 subroutine of powi_cost. CACHE is an array indicating
2789 which exponents have already been calculated. */
2792 powi_lookup_cost (unsigned HOST_WIDE_INT n, bool *cache)
2794 /* If we've already calculated this exponent, then this evaluation
2795 doesn't require any additional multiplications. */
2800 return powi_lookup_cost (n - powi_table[n], cache)
2801 + powi_lookup_cost (powi_table[n], cache) + 1;
2804 /* Return the number of multiplications required to calculate
2805 powi(x,n) for an arbitrary x, given the exponent N. This
2806 function needs to be kept in sync with expand_powi below. */
2809 powi_cost (HOST_WIDE_INT n)
2811 bool cache[POWI_TABLE_SIZE];
2812 unsigned HOST_WIDE_INT digit;
2813 unsigned HOST_WIDE_INT val;
2819 /* Ignore the reciprocal when calculating the cost. */
2820 val = (n < 0) ? -n : n;
2822 /* Initialize the exponent cache. */
2823 memset (cache, 0, POWI_TABLE_SIZE * sizeof (bool));
2828 while (val >= POWI_TABLE_SIZE)
2832 digit = val & ((1 << POWI_WINDOW_SIZE) - 1);
2833 result += powi_lookup_cost (digit, cache)
2834 + POWI_WINDOW_SIZE + 1;
2835 val >>= POWI_WINDOW_SIZE;
2844 return result + powi_lookup_cost (val, cache);
2847 /* Recursive subroutine of expand_powi. This function takes the array,
2848 CACHE, of already calculated exponents and an exponent N and returns
2849 an RTX that corresponds to CACHE[1]**N, as calculated in mode MODE. */
2852 expand_powi_1 (enum machine_mode mode, unsigned HOST_WIDE_INT n, rtx *cache)
2854 unsigned HOST_WIDE_INT digit;
2858 if (n < POWI_TABLE_SIZE)
2863 target = gen_reg_rtx (mode);
2866 op0 = expand_powi_1 (mode, n - powi_table[n], cache);
2867 op1 = expand_powi_1 (mode, powi_table[n], cache);
2871 target = gen_reg_rtx (mode);
2872 digit = n & ((1 << POWI_WINDOW_SIZE) - 1);
2873 op0 = expand_powi_1 (mode, n - digit, cache);
2874 op1 = expand_powi_1 (mode, digit, cache);
2878 target = gen_reg_rtx (mode);
2879 op0 = expand_powi_1 (mode, n >> 1, cache);
2883 result = expand_mult (mode, op0, op1, target, 0);
2884 if (result != target)
2885 emit_move_insn (target, result);
2889 /* Expand the RTL to evaluate powi(x,n) in mode MODE. X is the
2890 floating point operand in mode MODE, and N is the exponent. This
2891 function needs to be kept in sync with powi_cost above. */
2894 expand_powi (rtx x, enum machine_mode mode, HOST_WIDE_INT n)
2896 rtx cache[POWI_TABLE_SIZE];
2900 return CONST1_RTX (mode);
2902 memset (cache, 0, sizeof (cache));
2905 result = expand_powi_1 (mode, (n < 0) ? -n : n, cache);
2907 /* If the original exponent was negative, reciprocate the result. */
2909 result = expand_binop (mode, sdiv_optab, CONST1_RTX (mode),
2910 result, NULL_RTX, 0, OPTAB_LIB_WIDEN);
2915 /* Expand a call to the pow built-in mathematical function. Return NULL_RTX if
2916 a normal call should be emitted rather than expanding the function
2917 in-line. EXP is the expression that is a call to the builtin
2918 function; if convenient, the result should be placed in TARGET. */
2921 expand_builtin_pow (tree exp, rtx target, rtx subtarget)
2925 tree type = TREE_TYPE (exp);
2926 REAL_VALUE_TYPE cint, c, c2;
2929 enum machine_mode mode = TYPE_MODE (type);
2931 if (! validate_arglist (exp, REAL_TYPE, REAL_TYPE, VOID_TYPE))
2934 arg0 = CALL_EXPR_ARG (exp, 0);
2935 arg1 = CALL_EXPR_ARG (exp, 1);
2937 if (TREE_CODE (arg1) != REAL_CST
2938 || TREE_OVERFLOW (arg1))
2939 return expand_builtin_mathfn_2 (exp, target, subtarget);
2941 /* Handle constant exponents. */
2943 /* For integer valued exponents we can expand to an optimal multiplication
2944 sequence using expand_powi. */
2945 c = TREE_REAL_CST (arg1);
2946 n = real_to_integer (&c);
2947 real_from_integer (&cint, VOIDmode, n, n < 0 ? -1 : 0, 0);
2948 if (real_identical (&c, &cint)
2949 && ((n >= -1 && n <= 2)
2950 || (flag_unsafe_math_optimizations
2951 && optimize_insn_for_speed_p ()
2952 && powi_cost (n) <= POWI_MAX_MULTS)))
2954 op = expand_expr (arg0, subtarget, VOIDmode, EXPAND_NORMAL);
2957 op = force_reg (mode, op);
2958 op = expand_powi (op, mode, n);
2963 narg0 = builtin_save_expr (arg0);
2965 /* If the exponent is not integer valued, check if it is half of an integer.
2966 In this case we can expand to sqrt (x) * x**(n/2). */
2967 fn = mathfn_built_in (type, BUILT_IN_SQRT);
2968 if (fn != NULL_TREE)
2970 real_arithmetic (&c2, MULT_EXPR, &c, &dconst2);
2971 n = real_to_integer (&c2);
2972 real_from_integer (&cint, VOIDmode, n, n < 0 ? -1 : 0, 0);
2973 if (real_identical (&c2, &cint)
2974 && ((flag_unsafe_math_optimizations
2975 && optimize_insn_for_speed_p ()
2976 && powi_cost (n/2) <= POWI_MAX_MULTS)
2979 tree call_expr = build_call_nofold (fn, 1, narg0);
2980 /* Use expand_expr in case the newly built call expression
2981 was folded to a non-call. */
2982 op = expand_expr (call_expr, subtarget, mode, EXPAND_NORMAL);
2985 op2 = expand_expr (narg0, subtarget, VOIDmode, EXPAND_NORMAL);
2986 op2 = force_reg (mode, op2);
2987 op2 = expand_powi (op2, mode, abs (n / 2));
2988 op = expand_simple_binop (mode, MULT, op, op2, NULL_RTX,
2989 0, OPTAB_LIB_WIDEN);
2990 /* If the original exponent was negative, reciprocate the
2993 op = expand_binop (mode, sdiv_optab, CONST1_RTX (mode),
2994 op, NULL_RTX, 0, OPTAB_LIB_WIDEN);
3000 /* Try if the exponent is a third of an integer. In this case
3001 we can expand to x**(n/3) * cbrt(x)**(n%3). As cbrt (x) is
3002 different from pow (x, 1./3.) due to rounding and behavior
3003 with negative x we need to constrain this transformation to
3004 unsafe math and positive x or finite math. */
3005 fn = mathfn_built_in (type, BUILT_IN_CBRT);
3007 && flag_unsafe_math_optimizations
3008 && (tree_expr_nonnegative_p (arg0)
3009 || !HONOR_NANS (mode)))
3011 REAL_VALUE_TYPE dconst3;
3012 real_from_integer (&dconst3, VOIDmode, 3, 0, 0);
3013 real_arithmetic (&c2, MULT_EXPR, &c, &dconst3);
3014 real_round (&c2, mode, &c2);
3015 n = real_to_integer (&c2);
3016 real_from_integer (&cint, VOIDmode, n, n < 0 ? -1 : 0, 0);
3017 real_arithmetic (&c2, RDIV_EXPR, &cint, &dconst3);
3018 real_convert (&c2, mode, &c2);
3019 if (real_identical (&c2, &c)
3020 && ((optimize_insn_for_speed_p ()
3021 && powi_cost (n/3) <= POWI_MAX_MULTS)
3024 tree call_expr = build_call_nofold (fn, 1,narg0);
3025 op = expand_builtin (call_expr, NULL_RTX, subtarget, mode, 0);
3026 if (abs (n) % 3 == 2)
3027 op = expand_simple_binop (mode, MULT, op, op, op,
3028 0, OPTAB_LIB_WIDEN);
3031 op2 = expand_expr (narg0, subtarget, VOIDmode, EXPAND_NORMAL);
3032 op2 = force_reg (mode, op2);
3033 op2 = expand_powi (op2, mode, abs (n / 3));
3034 op = expand_simple_binop (mode, MULT, op, op2, NULL_RTX,
3035 0, OPTAB_LIB_WIDEN);
3036 /* If the original exponent was negative, reciprocate the
3039 op = expand_binop (mode, sdiv_optab, CONST1_RTX (mode),
3040 op, NULL_RTX, 0, OPTAB_LIB_WIDEN);
3046 /* Fall back to optab expansion. */
3047 return expand_builtin_mathfn_2 (exp, target, subtarget);
3050 /* Expand a call to the powi built-in mathematical function. Return NULL_RTX if
3051 a normal call should be emitted rather than expanding the function
3052 in-line. EXP is the expression that is a call to the builtin
3053 function; if convenient, the result should be placed in TARGET. */
3056 expand_builtin_powi (tree exp, rtx target, rtx subtarget)
3060 enum machine_mode mode;
3061 enum machine_mode mode2;
3063 if (! validate_arglist (exp, REAL_TYPE, INTEGER_TYPE, VOID_TYPE))
3066 arg0 = CALL_EXPR_ARG (exp, 0);
3067 arg1 = CALL_EXPR_ARG (exp, 1);
3068 mode = TYPE_MODE (TREE_TYPE (exp));
3070 /* Handle constant power. */
3072 if (TREE_CODE (arg1) == INTEGER_CST
3073 && !TREE_OVERFLOW (arg1))
3075 HOST_WIDE_INT n = TREE_INT_CST_LOW (arg1);
3077 /* If the exponent is -1, 0, 1 or 2, then expand_powi is exact.
3078 Otherwise, check the number of multiplications required. */
3079 if ((TREE_INT_CST_HIGH (arg1) == 0
3080 || TREE_INT_CST_HIGH (arg1) == -1)
3081 && ((n >= -1 && n <= 2)
3082 || (optimize_insn_for_speed_p ()
3083 && powi_cost (n) <= POWI_MAX_MULTS)))
3085 op0 = expand_expr (arg0, subtarget, VOIDmode, EXPAND_NORMAL);
3086 op0 = force_reg (mode, op0);
3087 return expand_powi (op0, mode, n);
3091 /* Emit a libcall to libgcc. */
3093 /* Mode of the 2nd argument must match that of an int. */
3094 mode2 = mode_for_size (INT_TYPE_SIZE, MODE_INT, 0);
3096 if (target == NULL_RTX)
3097 target = gen_reg_rtx (mode);
3099 op0 = expand_expr (arg0, subtarget, mode, EXPAND_NORMAL);
3100 if (GET_MODE (op0) != mode)
3101 op0 = convert_to_mode (mode, op0, 0);
3102 op1 = expand_expr (arg1, NULL_RTX, mode2, EXPAND_NORMAL);
3103 if (GET_MODE (op1) != mode2)
3104 op1 = convert_to_mode (mode2, op1, 0);
3106 target = emit_library_call_value (optab_libfunc (powi_optab, mode),
3107 target, LCT_CONST, mode, 2,
3108 op0, mode, op1, mode2);
3113 /* Expand expression EXP which is a call to the strlen builtin. Return
3114 NULL_RTX if we failed the caller should emit a normal call, otherwise
3115 try to get the result in TARGET, if convenient. */
3118 expand_builtin_strlen (tree exp, rtx target,
3119 enum machine_mode target_mode)
3121 if (!validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
3127 tree src = CALL_EXPR_ARG (exp, 0);
3128 rtx result, src_reg, char_rtx, before_strlen;
3129 enum machine_mode insn_mode = target_mode, char_mode;
3130 enum insn_code icode = CODE_FOR_nothing;
3133 /* If the length can be computed at compile-time, return it. */
3134 len = c_strlen (src, 0);
3136 return expand_expr (len, target, target_mode, EXPAND_NORMAL);
3138 /* If the length can be computed at compile-time and is constant
3139 integer, but there are side-effects in src, evaluate
3140 src for side-effects, then return len.
3141 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
3142 can be optimized into: i++; x = 3; */
3143 len = c_strlen (src, 1);
3144 if (len && TREE_CODE (len) == INTEGER_CST)
3146 expand_expr (src, const0_rtx, VOIDmode, EXPAND_NORMAL);
3147 return expand_expr (len, target, target_mode, EXPAND_NORMAL);
3150 align = get_pointer_alignment (src, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3152 /* If SRC is not a pointer type, don't do this operation inline. */
3156 /* Bail out if we can't compute strlen in the right mode. */
3157 while (insn_mode != VOIDmode)
3159 icode = optab_handler (strlen_optab, insn_mode)->insn_code;
3160 if (icode != CODE_FOR_nothing)
3163 insn_mode = GET_MODE_WIDER_MODE (insn_mode);
3165 if (insn_mode == VOIDmode)
3168 /* Make a place to write the result of the instruction. */
3172 && GET_MODE (result) == insn_mode
3173 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
3174 result = gen_reg_rtx (insn_mode);
3176 /* Make a place to hold the source address. We will not expand
3177 the actual source until we are sure that the expansion will
3178 not fail -- there are trees that cannot be expanded twice. */
3179 src_reg = gen_reg_rtx (Pmode);
3181 /* Mark the beginning of the strlen sequence so we can emit the
3182 source operand later. */
3183 before_strlen = get_last_insn ();
3185 char_rtx = const0_rtx;
3186 char_mode = insn_data[(int) icode].operand[2].mode;
3187 if (! (*insn_data[(int) icode].operand[2].predicate) (char_rtx,
3189 char_rtx = copy_to_mode_reg (char_mode, char_rtx);
3191 pat = GEN_FCN (icode) (result, gen_rtx_MEM (BLKmode, src_reg),
3192 char_rtx, GEN_INT (align));
3197 /* Now that we are assured of success, expand the source. */
3199 pat = expand_expr (src, src_reg, ptr_mode, EXPAND_NORMAL);
3201 emit_move_insn (src_reg, pat);
3206 emit_insn_after (pat, before_strlen);
3208 emit_insn_before (pat, get_insns ());
3210 /* Return the value in the proper mode for this function. */
3211 if (GET_MODE (result) == target_mode)
3213 else if (target != 0)
3214 convert_move (target, result, 0);
3216 target = convert_to_mode (target_mode, result, 0);
3222 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3223 bytes from constant string DATA + OFFSET and return it as target
3227 builtin_memcpy_read_str (void *data, HOST_WIDE_INT offset,
3228 enum machine_mode mode)
3230 const char *str = (const char *) data;
3232 gcc_assert (offset >= 0
3233 && ((unsigned HOST_WIDE_INT) offset + GET_MODE_SIZE (mode)
3234 <= strlen (str) + 1));
3236 return c_readstr (str + offset, mode);
3239 /* Expand a call EXP to the memcpy builtin.
3240 Return NULL_RTX if we failed, the caller should emit a normal call,
3241 otherwise try to get the result in TARGET, if convenient (and in
3242 mode MODE if that's convenient). */
3245 expand_builtin_memcpy (tree exp, rtx target)
3247 if (!validate_arglist (exp,
3248 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3252 tree dest = CALL_EXPR_ARG (exp, 0);
3253 tree src = CALL_EXPR_ARG (exp, 1);
3254 tree len = CALL_EXPR_ARG (exp, 2);
3255 const char *src_str;
3256 unsigned int src_align = get_pointer_alignment (src, BIGGEST_ALIGNMENT);
3257 unsigned int dest_align
3258 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
3259 rtx dest_mem, src_mem, dest_addr, len_rtx;
3260 HOST_WIDE_INT expected_size = -1;
3261 unsigned int expected_align = 0;
3262 tree_ann_common_t ann;
3264 /* If DEST is not a pointer type, call the normal function. */
3265 if (dest_align == 0)
3268 /* If either SRC is not a pointer type, don't do this
3269 operation in-line. */
3273 ann = tree_common_ann (exp);
3275 stringop_block_profile (ann->stmt, &expected_align, &expected_size);
3277 if (expected_align < dest_align)
3278 expected_align = dest_align;
3279 dest_mem = get_memory_rtx (dest, len);
3280 set_mem_align (dest_mem, dest_align);
3281 len_rtx = expand_normal (len);
3282 src_str = c_getstr (src);
3284 /* If SRC is a string constant and block move would be done
3285 by pieces, we can avoid loading the string from memory
3286 and only stored the computed constants. */
3288 && CONST_INT_P (len_rtx)
3289 && (unsigned HOST_WIDE_INT) INTVAL (len_rtx) <= strlen (src_str) + 1
3290 && can_store_by_pieces (INTVAL (len_rtx), builtin_memcpy_read_str,
3291 CONST_CAST (char *, src_str),
3294 dest_mem = store_by_pieces (dest_mem, INTVAL (len_rtx),
3295 builtin_memcpy_read_str,
3296 CONST_CAST (char *, src_str),
3297 dest_align, false, 0);
3298 dest_mem = force_operand (XEXP (dest_mem, 0), target);
3299 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3303 src_mem = get_memory_rtx (src, len);
3304 set_mem_align (src_mem, src_align);
3306 /* Copy word part most expediently. */
3307 dest_addr = emit_block_move_hints (dest_mem, src_mem, len_rtx,
3308 CALL_EXPR_TAILCALL (exp)
3309 ? BLOCK_OP_TAILCALL : BLOCK_OP_NORMAL,
3310 expected_align, expected_size);
3314 dest_addr = force_operand (XEXP (dest_mem, 0), target);
3315 dest_addr = convert_memory_address (ptr_mode, dest_addr);
3321 /* Expand a call EXP to the mempcpy builtin.
3322 Return NULL_RTX if we failed; the caller should emit a normal call,
3323 otherwise try to get the result in TARGET, if convenient (and in
3324 mode MODE if that's convenient). If ENDP is 0 return the
3325 destination pointer, if ENDP is 1 return the end pointer ala
3326 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3330 expand_builtin_mempcpy (tree exp, rtx target, enum machine_mode mode)
3332 if (!validate_arglist (exp,
3333 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3337 tree dest = CALL_EXPR_ARG (exp, 0);
3338 tree src = CALL_EXPR_ARG (exp, 1);
3339 tree len = CALL_EXPR_ARG (exp, 2);
3340 return expand_builtin_mempcpy_args (dest, src, len,
3341 target, mode, /*endp=*/ 1);
3345 /* Helper function to do the actual work for expand_builtin_mempcpy. The
3346 arguments to the builtin_mempcpy call DEST, SRC, and LEN are broken out
3347 so that this can also be called without constructing an actual CALL_EXPR.
3348 The other arguments and return value are the same as for
3349 expand_builtin_mempcpy. */
3352 expand_builtin_mempcpy_args (tree dest, tree src, tree len,
3353 rtx target, enum machine_mode mode, int endp)
3355 /* If return value is ignored, transform mempcpy into memcpy. */
3356 if (target == const0_rtx && implicit_built_in_decls[BUILT_IN_MEMCPY])
3358 tree fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
3359 tree result = build_call_nofold (fn, 3, dest, src, len);
3360 return expand_expr (result, target, mode, EXPAND_NORMAL);
3364 const char *src_str;
3365 unsigned int src_align = get_pointer_alignment (src, BIGGEST_ALIGNMENT);
3366 unsigned int dest_align
3367 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
3368 rtx dest_mem, src_mem, len_rtx;
3370 /* If either SRC or DEST is not a pointer type, don't do this
3371 operation in-line. */
3372 if (dest_align == 0 || src_align == 0)
3375 /* If LEN is not constant, call the normal function. */
3376 if (! host_integerp (len, 1))
3379 len_rtx = expand_normal (len);
3380 src_str = c_getstr (src);
3382 /* If SRC is a string constant and block move would be done
3383 by pieces, we can avoid loading the string from memory
3384 and only stored the computed constants. */
3386 && CONST_INT_P (len_rtx)
3387 && (unsigned HOST_WIDE_INT) INTVAL (len_rtx) <= strlen (src_str) + 1
3388 && can_store_by_pieces (INTVAL (len_rtx), builtin_memcpy_read_str,
3389 CONST_CAST (char *, src_str),
3392 dest_mem = get_memory_rtx (dest, len);
3393 set_mem_align (dest_mem, dest_align);
3394 dest_mem = store_by_pieces (dest_mem, INTVAL (len_rtx),
3395 builtin_memcpy_read_str,
3396 CONST_CAST (char *, src_str),
3397 dest_align, false, endp);
3398 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3399 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3403 if (CONST_INT_P (len_rtx)
3404 && can_move_by_pieces (INTVAL (len_rtx),
3405 MIN (dest_align, src_align)))
3407 dest_mem = get_memory_rtx (dest, len);
3408 set_mem_align (dest_mem, dest_align);
3409 src_mem = get_memory_rtx (src, len);
3410 set_mem_align (src_mem, src_align);
3411 dest_mem = move_by_pieces (dest_mem, src_mem, INTVAL (len_rtx),
3412 MIN (dest_align, src_align), endp);
3413 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3414 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3423 # define HAVE_movstr 0
3424 # define CODE_FOR_movstr CODE_FOR_nothing
3427 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
3428 we failed, the caller should emit a normal call, otherwise try to
3429 get the result in TARGET, if convenient. If ENDP is 0 return the
3430 destination pointer, if ENDP is 1 return the end pointer ala
3431 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3435 expand_movstr (tree dest, tree src, rtx target, int endp)
3441 const struct insn_data * data;
3446 dest_mem = get_memory_rtx (dest, NULL);
3447 src_mem = get_memory_rtx (src, NULL);
3450 target = force_reg (Pmode, XEXP (dest_mem, 0));
3451 dest_mem = replace_equiv_address (dest_mem, target);
3452 end = gen_reg_rtx (Pmode);
3456 if (target == 0 || target == const0_rtx)
3458 end = gen_reg_rtx (Pmode);
3466 data = insn_data + CODE_FOR_movstr;
3468 if (data->operand[0].mode != VOIDmode)
3469 end = gen_lowpart (data->operand[0].mode, end);
3471 insn = data->genfun (end, dest_mem, src_mem);
3477 /* movstr is supposed to set end to the address of the NUL
3478 terminator. If the caller requested a mempcpy-like return value,
3480 if (endp == 1 && target != const0_rtx)
3482 rtx tem = plus_constant (gen_lowpart (GET_MODE (target), end), 1);
3483 emit_move_insn (target, force_operand (tem, NULL_RTX));
3489 /* Expand expression EXP, which is a call to the strcpy builtin. Return
3490 NULL_RTX if we failed the caller should emit a normal call, otherwise
3491 try to get the result in TARGET, if convenient (and in mode MODE if that's
3495 expand_builtin_strcpy (tree exp, rtx target)
3497 if (validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3499 tree dest = CALL_EXPR_ARG (exp, 0);
3500 tree src = CALL_EXPR_ARG (exp, 1);
3501 return expand_builtin_strcpy_args (dest, src, target);
3506 /* Helper function to do the actual work for expand_builtin_strcpy. The
3507 arguments to the builtin_strcpy call DEST and SRC are broken out
3508 so that this can also be called without constructing an actual CALL_EXPR.
3509 The other arguments and return value are the same as for
3510 expand_builtin_strcpy. */
3513 expand_builtin_strcpy_args (tree dest, tree src, rtx target)
3515 return expand_movstr (dest, src, target, /*endp=*/0);
3518 /* Expand a call EXP to the stpcpy builtin.
3519 Return NULL_RTX if we failed the caller should emit a normal call,
3520 otherwise try to get the result in TARGET, if convenient (and in
3521 mode MODE if that's convenient). */
3524 expand_builtin_stpcpy (tree exp, rtx target, enum machine_mode mode)
3527 location_t loc = EXPR_LOCATION (exp);
3529 if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3532 dst = CALL_EXPR_ARG (exp, 0);
3533 src = CALL_EXPR_ARG (exp, 1);
3535 /* If return value is ignored, transform stpcpy into strcpy. */
3536 if (target == const0_rtx && implicit_built_in_decls[BUILT_IN_STRCPY])
3538 tree fn = implicit_built_in_decls[BUILT_IN_STRCPY];
3539 tree result = build_call_nofold (fn, 2, dst, src);
3540 return expand_expr (result, target, mode, EXPAND_NORMAL);
3547 /* Ensure we get an actual string whose length can be evaluated at
3548 compile-time, not an expression containing a string. This is
3549 because the latter will potentially produce pessimized code
3550 when used to produce the return value. */
3551 if (! c_getstr (src) || ! (len = c_strlen (src, 0)))
3552 return expand_movstr (dst, src, target, /*endp=*/2);
3554 lenp1 = size_binop_loc (loc, PLUS_EXPR, len, ssize_int (1));
3555 ret = expand_builtin_mempcpy_args (dst, src, lenp1,
3556 target, mode, /*endp=*/2);
3561 if (TREE_CODE (len) == INTEGER_CST)
3563 rtx len_rtx = expand_normal (len);
3565 if (CONST_INT_P (len_rtx))
3567 ret = expand_builtin_strcpy_args (dst, src, target);
3573 if (mode != VOIDmode)
3574 target = gen_reg_rtx (mode);
3576 target = gen_reg_rtx (GET_MODE (ret));
3578 if (GET_MODE (target) != GET_MODE (ret))
3579 ret = gen_lowpart (GET_MODE (target), ret);
3581 ret = plus_constant (ret, INTVAL (len_rtx));
3582 ret = emit_move_insn (target, force_operand (ret, NULL_RTX));
3590 return expand_movstr (dst, src, target, /*endp=*/2);
3594 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3595 bytes from constant string DATA + OFFSET and return it as target
3599 builtin_strncpy_read_str (void *data, HOST_WIDE_INT offset,
3600 enum machine_mode mode)
3602 const char *str = (const char *) data;
3604 if ((unsigned HOST_WIDE_INT) offset > strlen (str))
3607 return c_readstr (str + offset, mode);
3610 /* Expand expression EXP, which is a call to the strncpy builtin. Return
3611 NULL_RTX if we failed the caller should emit a normal call. */
3614 expand_builtin_strncpy (tree exp, rtx target)
3616 location_t loc = EXPR_LOCATION (exp);
3618 if (validate_arglist (exp,
3619 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3621 tree dest = CALL_EXPR_ARG (exp, 0);
3622 tree src = CALL_EXPR_ARG (exp, 1);
3623 tree len = CALL_EXPR_ARG (exp, 2);
3624 tree slen = c_strlen (src, 1);
3626 /* We must be passed a constant len and src parameter. */
3627 if (!host_integerp (len, 1) || !slen || !host_integerp (slen, 1))
3630 slen = size_binop_loc (loc, PLUS_EXPR, slen, ssize_int (1));
3632 /* We're required to pad with trailing zeros if the requested
3633 len is greater than strlen(s2)+1. In that case try to
3634 use store_by_pieces, if it fails, punt. */
3635 if (tree_int_cst_lt (slen, len))
3637 unsigned int dest_align
3638 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
3639 const char *p = c_getstr (src);
3642 if (!p || dest_align == 0 || !host_integerp (len, 1)
3643 || !can_store_by_pieces (tree_low_cst (len, 1),
3644 builtin_strncpy_read_str,
3645 CONST_CAST (char *, p),
3649 dest_mem = get_memory_rtx (dest, len);
3650 store_by_pieces (dest_mem, tree_low_cst (len, 1),
3651 builtin_strncpy_read_str,
3652 CONST_CAST (char *, p), dest_align, false, 0);
3653 dest_mem = force_operand (XEXP (dest_mem, 0), target);
3654 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3661 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3662 bytes from constant string DATA + OFFSET and return it as target
3666 builtin_memset_read_str (void *data, HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
3667 enum machine_mode mode)
3669 const char *c = (const char *) data;
3670 char *p = XALLOCAVEC (char, GET_MODE_SIZE (mode));
3672 memset (p, *c, GET_MODE_SIZE (mode));
3674 return c_readstr (p, mode);
3677 /* Callback routine for store_by_pieces. Return the RTL of a register
3678 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
3679 char value given in the RTL register data. For example, if mode is
3680 4 bytes wide, return the RTL for 0x01010101*data. */
3683 builtin_memset_gen_str (void *data, HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
3684 enum machine_mode mode)
3690 size = GET_MODE_SIZE (mode);
3694 p = XALLOCAVEC (char, size);
3695 memset (p, 1, size);
3696 coeff = c_readstr (p, mode);
3698 target = convert_to_mode (mode, (rtx) data, 1);
3699 target = expand_mult (mode, target, coeff, NULL_RTX, 1);
3700 return force_reg (mode, target);
3703 /* Expand expression EXP, which is a call to the memset builtin. Return
3704 NULL_RTX if we failed the caller should emit a normal call, otherwise
3705 try to get the result in TARGET, if convenient (and in mode MODE if that's
3709 expand_builtin_memset (tree exp, rtx target, enum machine_mode mode)
3711 if (!validate_arglist (exp,
3712 POINTER_TYPE, INTEGER_TYPE, INTEGER_TYPE, VOID_TYPE))
3716 tree dest = CALL_EXPR_ARG (exp, 0);
3717 tree val = CALL_EXPR_ARG (exp, 1);
3718 tree len = CALL_EXPR_ARG (exp, 2);
3719 return expand_builtin_memset_args (dest, val, len, target, mode, exp);
3723 /* Helper function to do the actual work for expand_builtin_memset. The
3724 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
3725 so that this can also be called without constructing an actual CALL_EXPR.
3726 The other arguments and return value are the same as for
3727 expand_builtin_memset. */
3730 expand_builtin_memset_args (tree dest, tree val, tree len,
3731 rtx target, enum machine_mode mode, tree orig_exp)
3734 enum built_in_function fcode;
3736 unsigned int dest_align;
3737 rtx dest_mem, dest_addr, len_rtx;
3738 HOST_WIDE_INT expected_size = -1;
3739 unsigned int expected_align = 0;
3740 tree_ann_common_t ann;
3742 dest_align = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
3744 /* If DEST is not a pointer type, don't do this operation in-line. */
3745 if (dest_align == 0)
3748 ann = tree_common_ann (orig_exp);
3750 stringop_block_profile (ann->stmt, &expected_align, &expected_size);
3752 if (expected_align < dest_align)
3753 expected_align = dest_align;
3755 /* If the LEN parameter is zero, return DEST. */
3756 if (integer_zerop (len))
3758 /* Evaluate and ignore VAL in case it has side-effects. */
3759 expand_expr (val, const0_rtx, VOIDmode, EXPAND_NORMAL);
3760 return expand_expr (dest, target, mode, EXPAND_NORMAL);
3763 /* Stabilize the arguments in case we fail. */
3764 dest = builtin_save_expr (dest);
3765 val = builtin_save_expr (val);
3766 len = builtin_save_expr (len);
3768 len_rtx = expand_normal (len);
3769 dest_mem = get_memory_rtx (dest, len);
3771 if (TREE_CODE (val) != INTEGER_CST)
3775 val_rtx = expand_normal (val);
3776 val_rtx = convert_to_mode (TYPE_MODE (unsigned_char_type_node),
3779 /* Assume that we can memset by pieces if we can store
3780 * the coefficients by pieces (in the required modes).
3781 * We can't pass builtin_memset_gen_str as that emits RTL. */
3783 if (host_integerp (len, 1)
3784 && can_store_by_pieces (tree_low_cst (len, 1),
3785 builtin_memset_read_str, &c, dest_align,
3788 val_rtx = force_reg (TYPE_MODE (unsigned_char_type_node),
3790 store_by_pieces (dest_mem, tree_low_cst (len, 1),
3791 builtin_memset_gen_str, val_rtx, dest_align,
3794 else if (!set_storage_via_setmem (dest_mem, len_rtx, val_rtx,
3795 dest_align, expected_align,
3799 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3800 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3804 if (target_char_cast (val, &c))
3809 if (host_integerp (len, 1)
3810 && can_store_by_pieces (tree_low_cst (len, 1),
3811 builtin_memset_read_str, &c, dest_align,
3813 store_by_pieces (dest_mem, tree_low_cst (len, 1),
3814 builtin_memset_read_str, &c, dest_align, true, 0);
3815 else if (!set_storage_via_setmem (dest_mem, len_rtx, GEN_INT (c),
3816 dest_align, expected_align,
3820 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3821 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3825 set_mem_align (dest_mem, dest_align);
3826 dest_addr = clear_storage_hints (dest_mem, len_rtx,
3827 CALL_EXPR_TAILCALL (orig_exp)
3828 ? BLOCK_OP_TAILCALL : BLOCK_OP_NORMAL,
3829 expected_align, expected_size);
3833 dest_addr = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3834 dest_addr = convert_memory_address (ptr_mode, dest_addr);
3840 fndecl = get_callee_fndecl (orig_exp);
3841 fcode = DECL_FUNCTION_CODE (fndecl);
3842 if (fcode == BUILT_IN_MEMSET)
3843 fn = build_call_nofold (fndecl, 3, dest, val, len);
3844 else if (fcode == BUILT_IN_BZERO)
3845 fn = build_call_nofold (fndecl, 2, dest, len);
3848 gcc_assert (TREE_CODE (fn) == CALL_EXPR);
3849 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (orig_exp);
3850 return expand_call (fn, target, target == const0_rtx);
3853 /* Expand expression EXP, which is a call to the bzero builtin. Return
3854 NULL_RTX if we failed the caller should emit a normal call. */
3857 expand_builtin_bzero (tree exp)
3860 location_t loc = EXPR_LOCATION (exp);
3862 if (!validate_arglist (exp, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3865 dest = CALL_EXPR_ARG (exp, 0);
3866 size = CALL_EXPR_ARG (exp, 1);
3868 /* New argument list transforming bzero(ptr x, int y) to
3869 memset(ptr x, int 0, size_t y). This is done this way
3870 so that if it isn't expanded inline, we fallback to
3871 calling bzero instead of memset. */
3873 return expand_builtin_memset_args (dest, integer_zero_node,
3874 fold_convert_loc (loc, sizetype, size),
3875 const0_rtx, VOIDmode, exp);
3878 /* Expand expression EXP, which is a call to the memcmp built-in function.
3879 Return NULL_RTX if we failed and the
3880 caller should emit a normal call, otherwise try to get the result in
3881 TARGET, if convenient (and in mode MODE, if that's convenient). */
3884 expand_builtin_memcmp (tree exp, ATTRIBUTE_UNUSED rtx target,
3885 ATTRIBUTE_UNUSED enum machine_mode mode)
3887 location_t loc ATTRIBUTE_UNUSED = EXPR_LOCATION (exp);
3889 if (!validate_arglist (exp,
3890 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3893 #if defined HAVE_cmpmemsi || defined HAVE_cmpstrnsi
3895 rtx arg1_rtx, arg2_rtx, arg3_rtx;
3898 tree arg1 = CALL_EXPR_ARG (exp, 0);
3899 tree arg2 = CALL_EXPR_ARG (exp, 1);
3900 tree len = CALL_EXPR_ARG (exp, 2);
3903 = get_pointer_alignment (arg1, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3905 = get_pointer_alignment (arg2, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3906 enum machine_mode insn_mode;
3908 #ifdef HAVE_cmpmemsi
3910 insn_mode = insn_data[(int) CODE_FOR_cmpmemsi].operand[0].mode;
3913 #ifdef HAVE_cmpstrnsi
3915 insn_mode = insn_data[(int) CODE_FOR_cmpstrnsi].operand[0].mode;
3920 /* If we don't have POINTER_TYPE, call the function. */
3921 if (arg1_align == 0 || arg2_align == 0)
3924 /* Make a place to write the result of the instruction. */
3927 && REG_P (result) && GET_MODE (result) == insn_mode
3928 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
3929 result = gen_reg_rtx (insn_mode);
3931 arg1_rtx = get_memory_rtx (arg1, len);
3932 arg2_rtx = get_memory_rtx (arg2, len);
3933 arg3_rtx = expand_normal (fold_convert_loc (loc, sizetype, len));
3935 /* Set MEM_SIZE as appropriate. */
3936 if (CONST_INT_P (arg3_rtx))
3938 set_mem_size (arg1_rtx, arg3_rtx);
3939 set_mem_size (arg2_rtx, arg3_rtx);
3942 #ifdef HAVE_cmpmemsi
3944 insn = gen_cmpmemsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
3945 GEN_INT (MIN (arg1_align, arg2_align)));
3948 #ifdef HAVE_cmpstrnsi
3950 insn = gen_cmpstrnsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
3951 GEN_INT (MIN (arg1_align, arg2_align)));
3959 emit_library_call_value (memcmp_libfunc, result, LCT_PURE,
3960 TYPE_MODE (integer_type_node), 3,
3961 XEXP (arg1_rtx, 0), Pmode,
3962 XEXP (arg2_rtx, 0), Pmode,
3963 convert_to_mode (TYPE_MODE (sizetype), arg3_rtx,
3964 TYPE_UNSIGNED (sizetype)),
3965 TYPE_MODE (sizetype));
3967 /* Return the value in the proper mode for this function. */
3968 mode = TYPE_MODE (TREE_TYPE (exp));
3969 if (GET_MODE (result) == mode)
3971 else if (target != 0)
3973 convert_move (target, result, 0);
3977 return convert_to_mode (mode, result, 0);
3984 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
3985 if we failed the caller should emit a normal call, otherwise try to get
3986 the result in TARGET, if convenient. */
3989 expand_builtin_strcmp (tree exp, ATTRIBUTE_UNUSED rtx target)
3991 if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3994 #if defined HAVE_cmpstrsi || defined HAVE_cmpstrnsi
3995 if (cmpstr_optab[SImode] != CODE_FOR_nothing
3996 || cmpstrn_optab[SImode] != CODE_FOR_nothing)
3998 rtx arg1_rtx, arg2_rtx;
3999 rtx result, insn = NULL_RTX;
4001 tree arg1 = CALL_EXPR_ARG (exp, 0);
4002 tree arg2 = CALL_EXPR_ARG (exp, 1);
4005 = get_pointer_alignment (arg1, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
4007 = get_pointer_alignment (arg2, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
4009 /* If we don't have POINTER_TYPE, call the function. */
4010 if (arg1_align == 0 || arg2_align == 0)
4013 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
4014 arg1 = builtin_save_expr (arg1);
4015 arg2 = builtin_save_expr (arg2);
4017 arg1_rtx = get_memory_rtx (arg1, NULL);
4018 arg2_rtx = get_memory_rtx (arg2, NULL);
4020 #ifdef HAVE_cmpstrsi
4021 /* Try to call cmpstrsi. */
4024 enum machine_mode insn_mode
4025 = insn_data[(int) CODE_FOR_cmpstrsi].operand[0].mode;
4027 /* Make a place to write the result of the instruction. */
4030 && REG_P (result) && GET_MODE (result) == insn_mode
4031 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
4032 result = gen_reg_rtx (insn_mode);
4034 insn = gen_cmpstrsi (result, arg1_rtx, arg2_rtx,
4035 GEN_INT (MIN (arg1_align, arg2_align)));
4038 #ifdef HAVE_cmpstrnsi
4039 /* Try to determine at least one length and call cmpstrnsi. */
4040 if (!insn && HAVE_cmpstrnsi)
4045 enum machine_mode insn_mode
4046 = insn_data[(int) CODE_FOR_cmpstrnsi].operand[0].mode;
4047 tree len1 = c_strlen (arg1, 1);
4048 tree len2 = c_strlen (arg2, 1);
4051 len1 = size_binop (PLUS_EXPR, ssize_int (1), len1);
4053 len2 = size_binop (PLUS_EXPR, ssize_int (1), len2);
4055 /* If we don't have a constant length for the first, use the length
4056 of the second, if we know it. We don't require a constant for
4057 this case; some cost analysis could be done if both are available
4058 but neither is constant. For now, assume they're equally cheap,
4059 unless one has side effects. If both strings have constant lengths,
4066 else if (TREE_SIDE_EFFECTS (len1))
4068 else if (TREE_SIDE_EFFECTS (len2))
4070 else if (TREE_CODE (len1) != INTEGER_CST)
4072 else if (TREE_CODE (len2) != INTEGER_CST)
4074 else if (tree_int_cst_lt (len1, len2))
4079 /* If both arguments have side effects, we cannot optimize. */
4080 if (!len || TREE_SIDE_EFFECTS (len))
4083 arg3_rtx = expand_normal (len);
4085 /* Make a place to write the result of the instruction. */
4088 && REG_P (result) && GET_MODE (result) == insn_mode
4089 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
4090 result = gen_reg_rtx (insn_mode);
4092 insn = gen_cmpstrnsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
4093 GEN_INT (MIN (arg1_align, arg2_align)));
4099 enum machine_mode mode;
4102 /* Return the value in the proper mode for this function. */
4103 mode = TYPE_MODE (TREE_TYPE (exp));
4104 if (GET_MODE (result) == mode)
4107 return convert_to_mode (mode, result, 0);
4108 convert_move (target, result, 0);
4112 /* Expand the library call ourselves using a stabilized argument
4113 list to avoid re-evaluating the function's arguments twice. */
4114 #ifdef HAVE_cmpstrnsi
4117 fndecl = get_callee_fndecl (exp);
4118 fn = build_call_nofold (fndecl, 2, arg1, arg2);
4119 gcc_assert (TREE_CODE (fn) == CALL_EXPR);
4120 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
4121 return expand_call (fn, target, target == const0_rtx);
4127 /* Expand expression EXP, which is a call to the strncmp builtin. Return
4128 NULL_RTX if we failed the caller should emit a normal call, otherwise try to get
4129 the result in TARGET, if convenient. */
4132 expand_builtin_strncmp (tree exp, ATTRIBUTE_UNUSED rtx target,
4133 ATTRIBUTE_UNUSED enum machine_mode mode)
4135 location_t loc ATTRIBUTE_UNUSED = EXPR_LOCATION (exp);
4137 if (!validate_arglist (exp,
4138 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
4141 /* If c_strlen can determine an expression for one of the string
4142 lengths, and it doesn't have side effects, then emit cmpstrnsi
4143 using length MIN(strlen(string)+1, arg3). */
4144 #ifdef HAVE_cmpstrnsi
4147 tree len, len1, len2;
4148 rtx arg1_rtx, arg2_rtx, arg3_rtx;
4151 tree arg1 = CALL_EXPR_ARG (exp, 0);
4152 tree arg2 = CALL_EXPR_ARG (exp, 1);
4153 tree arg3 = CALL_EXPR_ARG (exp, 2);
4156 = get_pointer_alignment (arg1, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
4158 = get_pointer_alignment (arg2, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
4159 enum machine_mode insn_mode
4160 = insn_data[(int) CODE_FOR_cmpstrnsi].operand[0].mode;
4162 len1 = c_strlen (arg1, 1);
4163 len2 = c_strlen (arg2, 1);
4166 len1 = size_binop_loc (loc, PLUS_EXPR, ssize_int (1), len1);
4168 len2 = size_binop_loc (loc, PLUS_EXPR, ssize_int (1), len2);
4170 /* If we don't have a constant length for the first, use the length
4171 of the second, if we know it. We don't require a constant for
4172 this case; some cost analysis could be done if both are available
4173 but neither is constant. For now, assume they're equally cheap,
4174 unless one has side effects. If both strings have constant lengths,
4181 else if (TREE_SIDE_EFFECTS (len1))
4183 else if (TREE_SIDE_EFFECTS (len2))
4185 else if (TREE_CODE (len1) != INTEGER_CST)
4187 else if (TREE_CODE (len2) != INTEGER_CST)
4189 else if (tree_int_cst_lt (len1, len2))
4194 /* If both arguments have side effects, we cannot optimize. */
4195 if (!len || TREE_SIDE_EFFECTS (len))
4198 /* The actual new length parameter is MIN(len,arg3). */
4199 len = fold_build2_loc (loc, MIN_EXPR, TREE_TYPE (len), len,
4200 fold_convert_loc (loc, TREE_TYPE (len), arg3));
4202 /* If we don't have POINTER_TYPE, call the function. */
4203 if (arg1_align == 0 || arg2_align == 0)
4206 /* Make a place to write the result of the instruction. */
4209 && REG_P (result) && GET_MODE (result) == insn_mode
4210 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
4211 result = gen_reg_rtx (insn_mode);
4213 /* Stabilize the arguments in case gen_cmpstrnsi fails. */
4214 arg1 = builtin_save_expr (arg1);
4215 arg2 = builtin_save_expr (arg2);
4216 len = builtin_save_expr (len);
4218 arg1_rtx = get_memory_rtx (arg1, len);
4219 arg2_rtx = get_memory_rtx (arg2, len);
4220 arg3_rtx = expand_normal (len);
4221 insn = gen_cmpstrnsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
4222 GEN_INT (MIN (arg1_align, arg2_align)));
4227 /* Return the value in the proper mode for this function. */
4228 mode = TYPE_MODE (TREE_TYPE (exp));
4229 if (GET_MODE (result) == mode)
4232 return convert_to_mode (mode, result, 0);
4233 convert_move (target, result, 0);
4237 /* Expand the library call ourselves using a stabilized argument
4238 list to avoid re-evaluating the function's arguments twice. */
4239 fndecl = get_callee_fndecl (exp);
4240 fn = build_call_nofold (fndecl, 3, arg1, arg2, len);
4241 gcc_assert (TREE_CODE (fn) == CALL_EXPR);
4242 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
4243 return expand_call (fn, target, target == const0_rtx);
4249 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
4250 if that's convenient. */
4253 expand_builtin_saveregs (void)
4257 /* Don't do __builtin_saveregs more than once in a function.
4258 Save the result of the first call and reuse it. */
4259 if (saveregs_value != 0)
4260 return saveregs_value;
4262 /* When this function is called, it means that registers must be
4263 saved on entry to this function. So we migrate the call to the
4264 first insn of this function. */
4268 /* Do whatever the machine needs done in this case. */
4269 val = targetm.calls.expand_builtin_saveregs ();
4274 saveregs_value = val;
4276 /* Put the insns after the NOTE that starts the function. If this
4277 is inside a start_sequence, make the outer-level insn chain current, so
4278 the code is placed at the start of the function. */
4279 push_topmost_sequence ();
4280 emit_insn_after (seq, entry_of_function ());
4281 pop_topmost_sequence ();
4286 /* __builtin_args_info (N) returns word N of the arg space info
4287 for the current function. The number and meanings of words
4288 is controlled by the definition of CUMULATIVE_ARGS. */
4291 expand_builtin_args_info (tree exp)
4293 int nwords = sizeof (CUMULATIVE_ARGS) / sizeof (int);
4294 int *word_ptr = (int *) &crtl->args.info;
4296 gcc_assert (sizeof (CUMULATIVE_ARGS) % sizeof (int) == 0);
4298 if (call_expr_nargs (exp) != 0)
4300 if (!host_integerp (CALL_EXPR_ARG (exp, 0), 0))
4301 error ("argument of %<__builtin_args_info%> must be constant");
4304 HOST_WIDE_INT wordnum = tree_low_cst (CALL_EXPR_ARG (exp, 0), 0);
4306 if (wordnum < 0 || wordnum >= nwords)
4307 error ("argument of %<__builtin_args_info%> out of range");
4309 return GEN_INT (word_ptr[wordnum]);
4313 error ("missing argument in %<__builtin_args_info%>");
4318 /* Expand a call to __builtin_next_arg. */
4321 expand_builtin_next_arg (void)
4323 /* Checking arguments is already done in fold_builtin_next_arg
4324 that must be called before this function. */
4325 return expand_binop (ptr_mode, add_optab,
4326 crtl->args.internal_arg_pointer,
4327 crtl->args.arg_offset_rtx,
4328 NULL_RTX, 0, OPTAB_LIB_WIDEN);
4331 /* Make it easier for the backends by protecting the valist argument
4332 from multiple evaluations. */
4335 stabilize_va_list_loc (location_t loc, tree valist, int needs_lvalue)
4337 tree vatype = targetm.canonical_va_list_type (TREE_TYPE (valist));
4339 gcc_assert (vatype != NULL_TREE);
4341 if (TREE_CODE (vatype) == ARRAY_TYPE)
4343 if (TREE_SIDE_EFFECTS (valist))
4344 valist = save_expr (valist);
4346 /* For this case, the backends will be expecting a pointer to
4347 vatype, but it's possible we've actually been given an array
4348 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
4350 if (TREE_CODE (TREE_TYPE (valist)) == ARRAY_TYPE)
4352 tree p1 = build_pointer_type (TREE_TYPE (vatype));
4353 valist = build_fold_addr_expr_with_type_loc (loc, valist, p1);
4362 if (! TREE_SIDE_EFFECTS (valist))
4365 pt = build_pointer_type (vatype);
4366 valist = fold_build1_loc (loc, ADDR_EXPR, pt, valist);
4367 TREE_SIDE_EFFECTS (valist) = 1;
4370 if (TREE_SIDE_EFFECTS (valist))
4371 valist = save_expr (valist);
4372 valist = build_fold_indirect_ref_loc (loc, valist);
4378 /* The "standard" definition of va_list is void*. */
4381 std_build_builtin_va_list (void)
4383 return ptr_type_node;
4386 /* The "standard" abi va_list is va_list_type_node. */
4389 std_fn_abi_va_list (tree fndecl ATTRIBUTE_UNUSED)
4391 return va_list_type_node;
4394 /* The "standard" type of va_list is va_list_type_node. */
4397 std_canonical_va_list_type (tree type)
4401 if (INDIRECT_REF_P (type))
4402 type = TREE_TYPE (type);
4403 else if (POINTER_TYPE_P (type) && POINTER_TYPE_P (TREE_TYPE(type)))
4404 type = TREE_TYPE (type);
4405 wtype = va_list_type_node;
4407 /* Treat structure va_list types. */
4408 if (TREE_CODE (wtype) == RECORD_TYPE && POINTER_TYPE_P (htype))
4409 htype = TREE_TYPE (htype);
4410 else if (TREE_CODE (wtype) == ARRAY_TYPE)
4412 /* If va_list is an array type, the argument may have decayed
4413 to a pointer type, e.g. by being passed to another function.
4414 In that case, unwrap both types so that we can compare the
4415 underlying records. */
4416 if (TREE_CODE (htype) == ARRAY_TYPE
4417 || POINTER_TYPE_P (htype))
4419 wtype = TREE_TYPE (wtype);
4420 htype = TREE_TYPE (htype);
4423 if (TYPE_MAIN_VARIANT (wtype) == TYPE_MAIN_VARIANT (htype))
4424 return va_list_type_node;
4429 /* The "standard" implementation of va_start: just assign `nextarg' to
4433 std_expand_builtin_va_start (tree valist, rtx nextarg)
4435 rtx va_r = expand_expr (valist, NULL_RTX, VOIDmode, EXPAND_WRITE);
4436 convert_move (va_r, nextarg, 0);
4439 /* Expand EXP, a call to __builtin_va_start. */
4442 expand_builtin_va_start (tree exp)
4446 location_t loc = EXPR_LOCATION (exp);
4448 if (call_expr_nargs (exp) < 2)
4450 error_at (loc, "too few arguments to function %<va_start%>");
4454 if (fold_builtin_next_arg (exp, true))
4457 nextarg = expand_builtin_next_arg ();
4458 valist = stabilize_va_list_loc (loc, CALL_EXPR_ARG (exp, 0), 1);
4460 if (targetm.expand_builtin_va_start)
4461 targetm.expand_builtin_va_start (valist, nextarg);
4463 std_expand_builtin_va_start (valist, nextarg);
4468 /* The "standard" implementation of va_arg: read the value from the
4469 current (padded) address and increment by the (padded) size. */
4472 std_gimplify_va_arg_expr (tree valist, tree type, gimple_seq *pre_p,
4475 tree addr, t, type_size, rounded_size, valist_tmp;
4476 unsigned HOST_WIDE_INT align, boundary;
4479 #ifdef ARGS_GROW_DOWNWARD
4480 /* All of the alignment and movement below is for args-grow-up machines.
4481 As of 2004, there are only 3 ARGS_GROW_DOWNWARD targets, and they all
4482 implement their own specialized gimplify_va_arg_expr routines. */
4486 indirect = pass_by_reference (NULL, TYPE_MODE (type), type, false);
4488 type = build_pointer_type (type);
4490 align = PARM_BOUNDARY / BITS_PER_UNIT;
4491 boundary = FUNCTION_ARG_BOUNDARY (TYPE_MODE (type), type);
4493 /* When we align parameter on stack for caller, if the parameter
4494 alignment is beyond MAX_SUPPORTED_STACK_ALIGNMENT, it will be
4495 aligned at MAX_SUPPORTED_STACK_ALIGNMENT. We will match callee
4496 here with caller. */
4497 if (boundary > MAX_SUPPORTED_STACK_ALIGNMENT)
4498 boundary = MAX_SUPPORTED_STACK_ALIGNMENT;
4500 boundary /= BITS_PER_UNIT;
4502 /* Hoist the valist value into a temporary for the moment. */
4503 valist_tmp = get_initialized_tmp_var (valist, pre_p, NULL);
4505 /* va_list pointer is aligned to PARM_BOUNDARY. If argument actually
4506 requires greater alignment, we must perform dynamic alignment. */
4507 if (boundary > align
4508 && !integer_zerop (TYPE_SIZE (type)))
4510 t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist_tmp,
4511 fold_build2 (POINTER_PLUS_EXPR,
4513 valist_tmp, size_int (boundary - 1)));
4514 gimplify_and_add (t, pre_p);
4516 t = fold_convert (sizetype, valist_tmp);
4517 t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist_tmp,
4518 fold_convert (TREE_TYPE (valist),
4519 fold_build2 (BIT_AND_EXPR, sizetype, t,
4520 size_int (-boundary))));
4521 gimplify_and_add (t, pre_p);
4526 /* If the actual alignment is less than the alignment of the type,
4527 adjust the type accordingly so that we don't assume strict alignment
4528 when dereferencing the pointer. */
4529 boundary *= BITS_PER_UNIT;
4530 if (boundary < TYPE_ALIGN (type))
4532 type = build_variant_type_copy (type);
4533 TYPE_ALIGN (type) = boundary;
4536 /* Compute the rounded size of the type. */
4537 type_size = size_in_bytes (type);
4538 rounded_size = round_up (type_size, align);
4540 /* Reduce rounded_size so it's sharable with the postqueue. */
4541 gimplify_expr (&rounded_size, pre_p, post_p, is_gimple_val, fb_rvalue);
4545 if (PAD_VARARGS_DOWN && !integer_zerop (rounded_size))
4547 /* Small args are padded downward. */
4548 t = fold_build2_loc (input_location, GT_EXPR, sizetype,
4549 rounded_size, size_int (align));
4550 t = fold_build3 (COND_EXPR, sizetype, t, size_zero_node,
4551 size_binop (MINUS_EXPR, rounded_size, type_size));
4552 addr = fold_build2 (POINTER_PLUS_EXPR,
4553 TREE_TYPE (addr), addr, t);
4556 /* Compute new value for AP. */
4557 t = build2 (POINTER_PLUS_EXPR, TREE_TYPE (valist), valist_tmp, rounded_size);
4558 t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist, t);
4559 gimplify_and_add (t, pre_p);
4561 addr = fold_convert (build_pointer_type (type), addr);
4564 addr = build_va_arg_indirect_ref (addr);
4566 return build_va_arg_indirect_ref (addr);
4569 /* Build an indirect-ref expression over the given TREE, which represents a
4570 piece of a va_arg() expansion. */
4572 build_va_arg_indirect_ref (tree addr)
4574 addr = build_fold_indirect_ref_loc (EXPR_LOCATION (addr), addr);
4576 if (flag_mudflap) /* Don't instrument va_arg INDIRECT_REF. */
4582 /* Return a dummy expression of type TYPE in order to keep going after an
4586 dummy_object (tree type)
4588 tree t = build_int_cst (build_pointer_type (type), 0);
4589 return build1 (INDIRECT_REF, type, t);
4592 /* Gimplify __builtin_va_arg, aka VA_ARG_EXPR, which is not really a
4593 builtin function, but a very special sort of operator. */
4595 enum gimplify_status
4596 gimplify_va_arg_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4598 tree promoted_type, have_va_type;
4599 tree valist = TREE_OPERAND (*expr_p, 0);
4600 tree type = TREE_TYPE (*expr_p);
4602 location_t loc = EXPR_LOCATION (*expr_p);
4604 /* Verify that valist is of the proper type. */
4605 have_va_type = TREE_TYPE (valist);
4606 if (have_va_type == error_mark_node)
4608 have_va_type = targetm.canonical_va_list_type (have_va_type);
4610 if (have_va_type == NULL_TREE)
4612 error_at (loc, "first argument to %<va_arg%> not of type %<va_list%>");
4616 /* Generate a diagnostic for requesting data of a type that cannot
4617 be passed through `...' due to type promotion at the call site. */
4618 if ((promoted_type = lang_hooks.types.type_promotes_to (type))
4621 static bool gave_help;
4624 /* Unfortunately, this is merely undefined, rather than a constraint
4625 violation, so we cannot make this an error. If this call is never
4626 executed, the program is still strictly conforming. */
4627 warned = warning_at (loc, 0,
4628 "%qT is promoted to %qT when passed through %<...%>",
4629 type, promoted_type);
4630 if (!gave_help && warned)
4633 inform (loc, "(so you should pass %qT not %qT to %<va_arg%>)",
4634 promoted_type, type);
4637 /* We can, however, treat "undefined" any way we please.
4638 Call abort to encourage the user to fix the program. */
4640 inform (loc, "if this code is reached, the program will abort");
4641 /* Before the abort, allow the evaluation of the va_list
4642 expression to exit or longjmp. */
4643 gimplify_and_add (valist, pre_p);
4644 t = build_call_expr_loc (loc,
4645 implicit_built_in_decls[BUILT_IN_TRAP], 0);
4646 gimplify_and_add (t, pre_p);
4648 /* This is dead code, but go ahead and finish so that the
4649 mode of the result comes out right. */
4650 *expr_p = dummy_object (type);
4655 /* Make it easier for the backends by protecting the valist argument
4656 from multiple evaluations. */
4657 if (TREE_CODE (have_va_type) == ARRAY_TYPE)
4659 /* For this case, the backends will be expecting a pointer to
4660 TREE_TYPE (abi), but it's possible we've
4661 actually been given an array (an actual TARGET_FN_ABI_VA_LIST).
4663 if (TREE_CODE (TREE_TYPE (valist)) == ARRAY_TYPE)
4665 tree p1 = build_pointer_type (TREE_TYPE (have_va_type));
4666 valist = fold_convert_loc (loc, p1,
4667 build_fold_addr_expr_loc (loc, valist));
4670 gimplify_expr (&valist, pre_p, post_p, is_gimple_val, fb_rvalue);
4673 gimplify_expr (&valist, pre_p, post_p, is_gimple_min_lval, fb_lvalue);
4675 if (!targetm.gimplify_va_arg_expr)
4676 /* FIXME: Once most targets are converted we should merely
4677 assert this is non-null. */
4680 *expr_p = targetm.gimplify_va_arg_expr (valist, type, pre_p, post_p);
4685 /* Expand EXP, a call to __builtin_va_end. */
4688 expand_builtin_va_end (tree exp)
4690 tree valist = CALL_EXPR_ARG (exp, 0);
4692 /* Evaluate for side effects, if needed. I hate macros that don't
4694 if (TREE_SIDE_EFFECTS (valist))
4695 expand_expr (valist, const0_rtx, VOIDmode, EXPAND_NORMAL);
4700 /* Expand EXP, a call to __builtin_va_copy. We do this as a
4701 builtin rather than just as an assignment in stdarg.h because of the
4702 nastiness of array-type va_list types. */
4705 expand_builtin_va_copy (tree exp)
4708 location_t loc = EXPR_LOCATION (exp);
4710 dst = CALL_EXPR_ARG (exp, 0);
4711 src = CALL_EXPR_ARG (exp, 1);
4713 dst = stabilize_va_list_loc (loc, dst, 1);
4714 src = stabilize_va_list_loc (loc, src, 0);
4716 gcc_assert (cfun != NULL && cfun->decl != NULL_TREE);
4718 if (TREE_CODE (targetm.fn_abi_va_list (cfun->decl)) != ARRAY_TYPE)
4720 t = build2 (MODIFY_EXPR, targetm.fn_abi_va_list (cfun->decl), dst, src);
4721 TREE_SIDE_EFFECTS (t) = 1;
4722 expand_expr (t, const0_rtx, VOIDmode, EXPAND_NORMAL);
4726 rtx dstb, srcb, size;
4728 /* Evaluate to pointers. */
4729 dstb = expand_expr (dst, NULL_RTX, Pmode, EXPAND_NORMAL);
4730 srcb = expand_expr (src, NULL_RTX, Pmode, EXPAND_NORMAL);
4731 size = expand_expr (TYPE_SIZE_UNIT (targetm.fn_abi_va_list (cfun->decl)),
4732 NULL_RTX, VOIDmode, EXPAND_NORMAL);
4734 dstb = convert_memory_address (Pmode, dstb);
4735 srcb = convert_memory_address (Pmode, srcb);
4737 /* "Dereference" to BLKmode memories. */
4738 dstb = gen_rtx_MEM (BLKmode, dstb);
4739 set_mem_alias_set (dstb, get_alias_set (TREE_TYPE (TREE_TYPE (dst))));
4740 set_mem_align (dstb, TYPE_ALIGN (targetm.fn_abi_va_list (cfun->decl)));
4741 srcb = gen_rtx_MEM (BLKmode, srcb);
4742 set_mem_alias_set (srcb, get_alias_set (TREE_TYPE (TREE_TYPE (src))));
4743 set_mem_align (srcb, TYPE_ALIGN (targetm.fn_abi_va_list (cfun->decl)));
4746 emit_block_move (dstb, srcb, size, BLOCK_OP_NORMAL);
4752 /* Expand a call to one of the builtin functions __builtin_frame_address or
4753 __builtin_return_address. */
4756 expand_builtin_frame_address (tree fndecl, tree exp)
4758 /* The argument must be a nonnegative integer constant.
4759 It counts the number of frames to scan up the stack.
4760 The value is the return address saved in that frame. */
4761 if (call_expr_nargs (exp) == 0)
4762 /* Warning about missing arg was already issued. */
4764 else if (! host_integerp (CALL_EXPR_ARG (exp, 0), 1))
4766 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS)
4767 error ("invalid argument to %<__builtin_frame_address%>");
4769 error ("invalid argument to %<__builtin_return_address%>");
4775 = expand_builtin_return_addr (DECL_FUNCTION_CODE (fndecl),
4776 tree_low_cst (CALL_EXPR_ARG (exp, 0), 1));
4778 /* Some ports cannot access arbitrary stack frames. */
4781 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS)
4782 warning (0, "unsupported argument to %<__builtin_frame_address%>");
4784 warning (0, "unsupported argument to %<__builtin_return_address%>");
4788 /* For __builtin_frame_address, return what we've got. */
4789 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS)
4793 && ! CONSTANT_P (tem))
4794 tem = copy_to_mode_reg (Pmode, tem);
4799 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if
4800 we failed and the caller should emit a normal call, otherwise try to get
4801 the result in TARGET, if convenient. */
4804 expand_builtin_alloca (tree exp, rtx target)
4809 /* Emit normal call if marked not-inlineable. */
4810 if (CALL_CANNOT_INLINE_P (exp))
4813 if (!validate_arglist (exp, INTEGER_TYPE, VOID_TYPE))
4816 /* Compute the argument. */
4817 op0 = expand_normal (CALL_EXPR_ARG (exp, 0));
4819 /* Allocate the desired space. */
4820 result = allocate_dynamic_stack_space (op0, target, BITS_PER_UNIT);
4821 result = convert_memory_address (ptr_mode, result);
4826 /* Expand a call to a bswap builtin with argument ARG0. MODE
4827 is the mode to expand with. */
4830 expand_builtin_bswap (tree exp, rtx target, rtx subtarget)
4832 enum machine_mode mode;
4836 if (!validate_arglist (exp, INTEGER_TYPE, VOID_TYPE))
4839 arg = CALL_EXPR_ARG (exp, 0);
4840 mode = TYPE_MODE (TREE_TYPE (arg));
4841 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
4843 target = expand_unop (mode, bswap_optab, op0, target, 1);
4845 gcc_assert (target);
4847 return convert_to_mode (mode, target, 0);
4850 /* Expand a call to a unary builtin in EXP.
4851 Return NULL_RTX if a normal call should be emitted rather than expanding the
4852 function in-line. If convenient, the result should be placed in TARGET.
4853 SUBTARGET may be used as the target for computing one of EXP's operands. */
4856 expand_builtin_unop (enum machine_mode target_mode, tree exp, rtx target,
4857 rtx subtarget, optab op_optab)
4861 if (!validate_arglist (exp, INTEGER_TYPE, VOID_TYPE))
4864 /* Compute the argument. */
4865 op0 = expand_expr (CALL_EXPR_ARG (exp, 0), subtarget,
4866 VOIDmode, EXPAND_NORMAL);
4867 /* Compute op, into TARGET if possible.
4868 Set TARGET to wherever the result comes back. */
4869 target = expand_unop (TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp, 0))),
4870 op_optab, op0, target, 1);
4871 gcc_assert (target);
4873 return convert_to_mode (target_mode, target, 0);
4876 /* Expand a call to __builtin_expect. We just return our argument
4877 as the builtin_expect semantic should've been already executed by
4878 tree branch prediction pass. */
4881 expand_builtin_expect (tree exp, rtx target)
4885 if (call_expr_nargs (exp) < 2)
4887 arg = CALL_EXPR_ARG (exp, 0);
4889 target = expand_expr (arg, target, VOIDmode, EXPAND_NORMAL);
4890 /* When guessing was done, the hints should be already stripped away. */
4891 gcc_assert (!flag_guess_branch_prob
4892 || optimize == 0 || errorcount || sorrycount);
4897 expand_builtin_trap (void)
4901 emit_insn (gen_trap ());
4904 emit_library_call (abort_libfunc, LCT_NORETURN, VOIDmode, 0);
4908 /* Expand a call to __builtin_unreachable. We do nothing except emit
4909 a barrier saying that control flow will not pass here.
4911 It is the responsibility of the program being compiled to ensure
4912 that control flow does never reach __builtin_unreachable. */
4914 expand_builtin_unreachable (void)
4919 /* Expand EXP, a call to fabs, fabsf or fabsl.
4920 Return NULL_RTX if a normal call should be emitted rather than expanding
4921 the function inline. If convenient, the result should be placed
4922 in TARGET. SUBTARGET may be used as the target for computing
4926 expand_builtin_fabs (tree exp, rtx target, rtx subtarget)
4928 enum machine_mode mode;
4932 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
4935 arg = CALL_EXPR_ARG (exp, 0);
4936 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
4937 mode = TYPE_MODE (TREE_TYPE (arg));
4938 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
4939 return expand_abs (mode, op0, target, 0, safe_from_p (target, arg, 1));
4942 /* Expand EXP, a call to copysign, copysignf, or copysignl.
4943 Return NULL is a normal call should be emitted rather than expanding the
4944 function inline. If convenient, the result should be placed in TARGET.
4945 SUBTARGET may be used as the target for computing the operand. */
4948 expand_builtin_copysign (tree exp, rtx target, rtx subtarget)
4953 if (!validate_arglist (exp, REAL_TYPE, REAL_TYPE, VOID_TYPE))
4956 arg = CALL_EXPR_ARG (exp, 0);
4957 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
4959 arg = CALL_EXPR_ARG (exp, 1);
4960 op1 = expand_normal (arg);
4962 return expand_copysign (op0, op1, target);
4965 /* Create a new constant string literal and return a char* pointer to it.
4966 The STRING_CST value is the LEN characters at STR. */
4968 build_string_literal (int len, const char *str)
4970 tree t, elem, index, type;
4972 t = build_string (len, str);
4973 elem = build_type_variant (char_type_node, 1, 0);
4974 index = build_index_type (size_int (len - 1));
4975 type = build_array_type (elem, index);
4976 TREE_TYPE (t) = type;
4977 TREE_CONSTANT (t) = 1;
4978 TREE_READONLY (t) = 1;
4979 TREE_STATIC (t) = 1;
4981 type = build_pointer_type (elem);
4982 t = build1 (ADDR_EXPR, type,
4983 build4 (ARRAY_REF, elem,
4984 t, integer_zero_node, NULL_TREE, NULL_TREE));
4988 /* Expand EXP, a call to printf or printf_unlocked.
4989 Return NULL_RTX if a normal call should be emitted rather than transforming
4990 the function inline. If convenient, the result should be placed in
4991 TARGET with mode MODE. UNLOCKED indicates this is a printf_unlocked
4994 expand_builtin_printf (tree exp, rtx target, enum machine_mode mode,
4997 /* If we're using an unlocked function, assume the other unlocked
4998 functions exist explicitly. */
4999 tree const fn_putchar = unlocked ? built_in_decls[BUILT_IN_PUTCHAR_UNLOCKED]
5000 : implicit_built_in_decls[BUILT_IN_PUTCHAR];
5001 tree const fn_puts = unlocked ? built_in_decls[BUILT_IN_PUTS_UNLOCKED]
5002 : implicit_built_in_decls[BUILT_IN_PUTS];
5003 const char *fmt_str;
5006 int nargs = call_expr_nargs (exp);
5008 /* If the return value is used, don't do the transformation. */
5009 if (target != const0_rtx)
5012 /* Verify the required arguments in the original call. */
5015 fmt = CALL_EXPR_ARG (exp, 0);
5016 if (! POINTER_TYPE_P (TREE_TYPE (fmt)))
5019 /* Check whether the format is a literal string constant. */
5020 fmt_str = c_getstr (fmt);
5021 if (fmt_str == NULL)
5024 if (!init_target_chars ())
5027 /* If the format specifier was "%s\n", call __builtin_puts(arg). */
5028 if (strcmp (fmt_str, target_percent_s_newline) == 0)
5031 || ! POINTER_TYPE_P (TREE_TYPE (CALL_EXPR_ARG (exp, 1))))
5034 fn = build_call_nofold (fn_puts, 1, CALL_EXPR_ARG (exp, 1));
5036 /* If the format specifier was "%c", call __builtin_putchar(arg). */
5037 else if (strcmp (fmt_str, target_percent_c) == 0)
5040 || TREE_CODE (TREE_TYPE (CALL_EXPR_ARG (exp, 1))) != INTEGER_TYPE)
5043 fn = build_call_nofold (fn_putchar, 1, CALL_EXPR_ARG (exp, 1));
5047 /* We can't handle anything else with % args or %% ... yet. */
5048 if (strchr (fmt_str, target_percent))
5054 /* If the format specifier was "", printf does nothing. */
5055 if (fmt_str[0] == '\0')
5057 /* If the format specifier has length of 1, call putchar. */
5058 if (fmt_str[1] == '\0')
5060 /* Given printf("c"), (where c is any one character,)
5061 convert "c"[0] to an int and pass that to the replacement
5063 arg = build_int_cst (NULL_TREE, fmt_str[0]);
5065 fn = build_call_nofold (fn_putchar, 1, arg);
5069 /* If the format specifier was "string\n", call puts("string"). */
5070 size_t len = strlen (fmt_str);
5071 if ((unsigned char)fmt_str[len - 1] == target_newline)
5073 /* Create a NUL-terminated string that's one char shorter
5074 than the original, stripping off the trailing '\n'. */
5075 char *newstr = XALLOCAVEC (char, len);
5076 memcpy (newstr, fmt_str, len - 1);
5077 newstr[len - 1] = 0;
5078 arg = build_string_literal (len, newstr);
5080 fn = build_call_nofold (fn_puts, 1, arg);
5083 /* We'd like to arrange to call fputs(string,stdout) here,
5084 but we need stdout and don't have a way to get it yet. */
5091 gcc_assert (TREE_CODE (fn) == CALL_EXPR);
5092 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
5093 return expand_expr (fn, target, mode, EXPAND_NORMAL);
5096 /* Expand EXP, a call to fprintf or fprintf_unlocked.
5097 Return NULL_RTX if a normal call should be emitted rather than transforming
5098 the function inline. If convenient, the result should be placed in
5099 TARGET with mode MODE. UNLOCKED indicates this is a fprintf_unlocked
5102 expand_builtin_fprintf (tree exp, rtx target, enum machine_mode mode,
5105 /* If we're using an unlocked function, assume the other unlocked
5106 functions exist explicitly. */
5107 tree const fn_fputc = unlocked ? built_in_decls[BUILT_IN_FPUTC_UNLOCKED]
5108 : implicit_built_in_decls[BUILT_IN_FPUTC];
5109 tree const fn_fputs = unlocked ? built_in_decls[BUILT_IN_FPUTS_UNLOCKED]
5110 : implicit_built_in_decls[BUILT_IN_FPUTS];
5111 const char *fmt_str;
5114 int nargs = call_expr_nargs (exp);
5116 /* If the return value is used, don't do the transformation. */
5117 if (target != const0_rtx)
5120 /* Verify the required arguments in the original call. */
5123 fp = CALL_EXPR_ARG (exp, 0);
5124 if (! POINTER_TYPE_P (TREE_TYPE (fp)))
5126 fmt = CALL_EXPR_ARG (exp, 1);
5127 if (! POINTER_TYPE_P (TREE_TYPE (fmt)))
5130 /* Check whether the format is a literal string constant. */
5131 fmt_str = c_getstr (fmt);
5132 if (fmt_str == NULL)
5135 if (!init_target_chars ())
5138 /* If the format specifier was "%s", call __builtin_fputs(arg,fp). */
5139 if (strcmp (fmt_str, target_percent_s) == 0)
5142 || ! POINTER_TYPE_P (TREE_TYPE (CALL_EXPR_ARG (exp, 2))))
5144 arg = CALL_EXPR_ARG (exp, 2);
5146 fn = build_call_nofold (fn_fputs, 2, arg, fp);
5148 /* If the format specifier was "%c", call __builtin_fputc(arg,fp). */
5149 else if (strcmp (fmt_str, target_percent_c) == 0)
5152 || TREE_CODE (TREE_TYPE (CALL_EXPR_ARG (exp, 2))) != INTEGER_TYPE)
5154 arg = CALL_EXPR_ARG (exp, 2);
5156 fn = build_call_nofold (fn_fputc, 2, arg, fp);
5160 /* We can't handle anything else with % args or %% ... yet. */
5161 if (strchr (fmt_str, target_percent))
5167 /* If the format specifier was "", fprintf does nothing. */
5168 if (fmt_str[0] == '\0')
5170 /* Evaluate and ignore FILE* argument for side-effects. */
5171 expand_expr (fp, const0_rtx, VOIDmode, EXPAND_NORMAL);
5175 /* When "string" doesn't contain %, replace all cases of
5176 fprintf(stream,string) with fputs(string,stream). The fputs
5177 builtin will take care of special cases like length == 1. */
5179 fn = build_call_nofold (fn_fputs, 2, fmt, fp);
5184 gcc_assert (TREE_CODE (fn) == CALL_EXPR);
5185 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
5186 return expand_expr (fn, target, mode, EXPAND_NORMAL);
5189 /* Expand a call EXP to sprintf. Return NULL_RTX if
5190 a normal call should be emitted rather than expanding the function
5191 inline. If convenient, the result should be placed in TARGET with
5195 expand_builtin_sprintf (tree exp, rtx target, enum machine_mode mode)
5198 const char *fmt_str;
5199 int nargs = call_expr_nargs (exp);
5201 /* Verify the required arguments in the original call. */
5204 dest = CALL_EXPR_ARG (exp, 0);
5205 if (! POINTER_TYPE_P (TREE_TYPE (dest)))
5207 fmt = CALL_EXPR_ARG (exp, 0);
5208 if (! POINTER_TYPE_P (TREE_TYPE (fmt)))
5211 /* Check whether the format is a literal string constant. */
5212 fmt_str = c_getstr (fmt);
5213 if (fmt_str == NULL)
5216 if (!init_target_chars ())
5219 /* If the format doesn't contain % args or %%, use strcpy. */
5220 if (strchr (fmt_str, target_percent) == 0)
5222 tree fn = implicit_built_in_decls[BUILT_IN_STRCPY];
5225 if ((nargs > 2) || ! fn)
5227 expand_expr (build_call_nofold (fn, 2, dest, fmt),
5228 const0_rtx, VOIDmode, EXPAND_NORMAL);
5229 if (target == const0_rtx)
5231 exp = build_int_cst (NULL_TREE, strlen (fmt_str));
5232 return expand_expr (exp, target, mode, EXPAND_NORMAL);
5234 /* If the format is "%s", use strcpy if the result isn't used. */
5235 else if (strcmp (fmt_str, target_percent_s) == 0)
5238 fn = implicit_built_in_decls[BUILT_IN_STRCPY];
5244 arg = CALL_EXPR_ARG (exp, 2);
5245 if (! POINTER_TYPE_P (TREE_TYPE (arg)))
5248 if (target != const0_rtx)
5250 len = c_strlen (arg, 1);
5251 if (! len || TREE_CODE (len) != INTEGER_CST)
5257 expand_expr (build_call_nofold (fn, 2, dest, arg),
5258 const0_rtx, VOIDmode, EXPAND_NORMAL);
5260 if (target == const0_rtx)
5262 return expand_expr (len, target, mode, EXPAND_NORMAL);
5268 /* Expand a call to either the entry or exit function profiler. */
5271 expand_builtin_profile_func (bool exitp)
5273 rtx this_rtx, which;
5275 this_rtx = DECL_RTL (current_function_decl);
5276 gcc_assert (MEM_P (this_rtx));
5277 this_rtx = XEXP (this_rtx, 0);
5280 which = profile_function_exit_libfunc;
5282 which = profile_function_entry_libfunc;
5284 emit_library_call (which, LCT_NORMAL, VOIDmode, 2, this_rtx, Pmode,
5285 expand_builtin_return_addr (BUILT_IN_RETURN_ADDRESS,
5292 /* Expand a call to __builtin___clear_cache. */
5295 expand_builtin___clear_cache (tree exp ATTRIBUTE_UNUSED)
5297 #ifndef HAVE_clear_cache
5298 #ifdef CLEAR_INSN_CACHE
5299 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5300 does something. Just do the default expansion to a call to
5304 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5305 does nothing. There is no need to call it. Do nothing. */
5307 #endif /* CLEAR_INSN_CACHE */
5309 /* We have a "clear_cache" insn, and it will handle everything. */
5311 rtx begin_rtx, end_rtx;
5312 enum insn_code icode;
5314 /* We must not expand to a library call. If we did, any
5315 fallback library function in libgcc that might contain a call to
5316 __builtin___clear_cache() would recurse infinitely. */
5317 if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
5319 error ("both arguments to %<__builtin___clear_cache%> must be pointers");
5323 if (HAVE_clear_cache)
5325 icode = CODE_FOR_clear_cache;
5327 begin = CALL_EXPR_ARG (exp, 0);
5328 begin_rtx = expand_expr (begin, NULL_RTX, Pmode, EXPAND_NORMAL);
5329 begin_rtx = convert_memory_address (Pmode, begin_rtx);
5330 if (!insn_data[icode].operand[0].predicate (begin_rtx, Pmode))
5331 begin_rtx = copy_to_mode_reg (Pmode, begin_rtx);
5333 end = CALL_EXPR_ARG (exp, 1);
5334 end_rtx = expand_expr (end, NULL_RTX, Pmode, EXPAND_NORMAL);
5335 end_rtx = convert_memory_address (Pmode, end_rtx);
5336 if (!insn_data[icode].operand[1].predicate (end_rtx, Pmode))
5337 end_rtx = copy_to_mode_reg (Pmode, end_rtx);
5339 emit_insn (gen_clear_cache (begin_rtx, end_rtx));
5342 #endif /* HAVE_clear_cache */
5345 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
5348 round_trampoline_addr (rtx tramp)
5350 rtx temp, addend, mask;
5352 /* If we don't need too much alignment, we'll have been guaranteed
5353 proper alignment by get_trampoline_type. */
5354 if (TRAMPOLINE_ALIGNMENT <= STACK_BOUNDARY)
5357 /* Round address up to desired boundary. */
5358 temp = gen_reg_rtx (Pmode);
5359 addend = GEN_INT (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT - 1);
5360 mask = GEN_INT (-TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT);
5362 temp = expand_simple_binop (Pmode, PLUS, tramp, addend,
5363 temp, 0, OPTAB_LIB_WIDEN);
5364 tramp = expand_simple_binop (Pmode, AND, temp, mask,
5365 temp, 0, OPTAB_LIB_WIDEN);
5371 expand_builtin_init_trampoline (tree exp)
5373 tree t_tramp, t_func, t_chain;
5374 rtx m_tramp, r_tramp, r_chain, tmp;
5376 if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE,
5377 POINTER_TYPE, VOID_TYPE))
5380 t_tramp = CALL_EXPR_ARG (exp, 0);
5381 t_func = CALL_EXPR_ARG (exp, 1);
5382 t_chain = CALL_EXPR_ARG (exp, 2);
5384 r_tramp = expand_normal (t_tramp);
5385 m_tramp = gen_rtx_MEM (BLKmode, r_tramp);
5386 MEM_NOTRAP_P (m_tramp) = 1;
5388 /* The TRAMP argument should be the address of a field within the
5389 local function's FRAME decl. Let's see if we can fill in the
5390 to fill in the MEM_ATTRs for this memory. */
5391 if (TREE_CODE (t_tramp) == ADDR_EXPR)
5392 set_mem_attributes_minus_bitpos (m_tramp, TREE_OPERAND (t_tramp, 0),
5395 tmp = round_trampoline_addr (r_tramp);
5398 m_tramp = change_address (m_tramp, BLKmode, tmp);
5399 set_mem_align (m_tramp, TRAMPOLINE_ALIGNMENT);
5400 set_mem_size (m_tramp, GEN_INT (TRAMPOLINE_SIZE));
5403 /* The FUNC argument should be the address of the nested function.
5404 Extract the actual function decl to pass to the hook. */
5405 gcc_assert (TREE_CODE (t_func) == ADDR_EXPR);
5406 t_func = TREE_OPERAND (t_func, 0);
5407 gcc_assert (TREE_CODE (t_func) == FUNCTION_DECL);
5409 r_chain = expand_normal (t_chain);
5411 /* Generate insns to initialize the trampoline. */
5412 targetm.calls.trampoline_init (m_tramp, t_func, r_chain);
5414 trampolines_created = 1;
5419 expand_builtin_adjust_trampoline (tree exp)
5423 if (!validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
5426 tramp = expand_normal (CALL_EXPR_ARG (exp, 0));
5427 tramp = round_trampoline_addr (tramp);
5428 if (targetm.calls.trampoline_adjust_address)
5429 tramp = targetm.calls.trampoline_adjust_address (tramp);
5434 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
5435 function. The function first checks whether the back end provides
5436 an insn to implement signbit for the respective mode. If not, it
5437 checks whether the floating point format of the value is such that
5438 the sign bit can be extracted. If that is not the case, the
5439 function returns NULL_RTX to indicate that a normal call should be
5440 emitted rather than expanding the function in-line. EXP is the
5441 expression that is a call to the builtin function; if convenient,
5442 the result should be placed in TARGET. */
5444 expand_builtin_signbit (tree exp, rtx target)
5446 const struct real_format *fmt;
5447 enum machine_mode fmode, imode, rmode;
5448 HOST_WIDE_INT hi, lo;
5451 enum insn_code icode;
5453 location_t loc = EXPR_LOCATION (exp);
5455 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
5458 arg = CALL_EXPR_ARG (exp, 0);
5459 fmode = TYPE_MODE (TREE_TYPE (arg));
5460 rmode = TYPE_MODE (TREE_TYPE (exp));
5461 fmt = REAL_MODE_FORMAT (fmode);
5463 arg = builtin_save_expr (arg);
5465 /* Expand the argument yielding a RTX expression. */
5466 temp = expand_normal (arg);
5468 /* Check if the back end provides an insn that handles signbit for the
5470 icode = signbit_optab->handlers [(int) fmode].insn_code;
5471 if (icode != CODE_FOR_nothing)
5473 target = gen_reg_rtx (TYPE_MODE (TREE_TYPE (exp)));
5474 emit_unop_insn (icode, target, temp, UNKNOWN);
5478 /* For floating point formats without a sign bit, implement signbit
5480 bitpos = fmt->signbit_ro;
5483 /* But we can't do this if the format supports signed zero. */
5484 if (fmt->has_signed_zero && HONOR_SIGNED_ZEROS (fmode))
5487 arg = fold_build2_loc (loc, LT_EXPR, TREE_TYPE (exp), arg,
5488 build_real (TREE_TYPE (arg), dconst0));
5489 return expand_expr (arg, target, VOIDmode, EXPAND_NORMAL);
5492 if (GET_MODE_SIZE (fmode) <= UNITS_PER_WORD)
5494 imode = int_mode_for_mode (fmode);
5495 if (imode == BLKmode)
5497 temp = gen_lowpart (imode, temp);
5502 /* Handle targets with different FP word orders. */
5503 if (FLOAT_WORDS_BIG_ENDIAN)
5504 word = (GET_MODE_BITSIZE (fmode) - bitpos) / BITS_PER_WORD;
5506 word = bitpos / BITS_PER_WORD;
5507 temp = operand_subword_force (temp, word, fmode);
5508 bitpos = bitpos % BITS_PER_WORD;
5511 /* Force the intermediate word_mode (or narrower) result into a
5512 register. This avoids attempting to create paradoxical SUBREGs
5513 of floating point modes below. */
5514 temp = force_reg (imode, temp);
5516 /* If the bitpos is within the "result mode" lowpart, the operation
5517 can be implement with a single bitwise AND. Otherwise, we need
5518 a right shift and an AND. */
5520 if (bitpos < GET_MODE_BITSIZE (rmode))
5522 if (bitpos < HOST_BITS_PER_WIDE_INT)
5525 lo = (HOST_WIDE_INT) 1 << bitpos;
5529 hi = (HOST_WIDE_INT) 1 << (bitpos - HOST_BITS_PER_WIDE_INT);
5533 if (GET_MODE_SIZE (imode) > GET_MODE_SIZE (rmode))
5534 temp = gen_lowpart (rmode, temp);
5535 temp = expand_binop (rmode, and_optab, temp,
5536 immed_double_const (lo, hi, rmode),
5537 NULL_RTX, 1, OPTAB_LIB_WIDEN);
5541 /* Perform a logical right shift to place the signbit in the least
5542 significant bit, then truncate the result to the desired mode
5543 and mask just this bit. */
5544 temp = expand_shift (RSHIFT_EXPR, imode, temp,
5545 build_int_cst (NULL_TREE, bitpos), NULL_RTX, 1);
5546 temp = gen_lowpart (rmode, temp);
5547 temp = expand_binop (rmode, and_optab, temp, const1_rtx,
5548 NULL_RTX, 1, OPTAB_LIB_WIDEN);
5554 /* Expand fork or exec calls. TARGET is the desired target of the
5555 call. EXP is the call. FN is the
5556 identificator of the actual function. IGNORE is nonzero if the
5557 value is to be ignored. */
5560 expand_builtin_fork_or_exec (tree fn, tree exp, rtx target, int ignore)
5565 /* If we are not profiling, just call the function. */
5566 if (!profile_arc_flag)
5569 /* Otherwise call the wrapper. This should be equivalent for the rest of
5570 compiler, so the code does not diverge, and the wrapper may run the
5571 code necessary for keeping the profiling sane. */
5573 switch (DECL_FUNCTION_CODE (fn))
5576 id = get_identifier ("__gcov_fork");
5579 case BUILT_IN_EXECL:
5580 id = get_identifier ("__gcov_execl");
5583 case BUILT_IN_EXECV:
5584 id = get_identifier ("__gcov_execv");
5587 case BUILT_IN_EXECLP:
5588 id = get_identifier ("__gcov_execlp");
5591 case BUILT_IN_EXECLE:
5592 id = get_identifier ("__gcov_execle");
5595 case BUILT_IN_EXECVP:
5596 id = get_identifier ("__gcov_execvp");
5599 case BUILT_IN_EXECVE:
5600 id = get_identifier ("__gcov_execve");
5607 decl = build_decl (DECL_SOURCE_LOCATION (fn),
5608 FUNCTION_DECL, id, TREE_TYPE (fn));
5609 DECL_EXTERNAL (decl) = 1;
5610 TREE_PUBLIC (decl) = 1;
5611 DECL_ARTIFICIAL (decl) = 1;
5612 TREE_NOTHROW (decl) = 1;
5613 DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT;
5614 DECL_VISIBILITY_SPECIFIED (decl) = 1;
5615 call = rewrite_call_expr (EXPR_LOCATION (exp), exp, 0, decl, 0);
5616 return expand_call (call, target, ignore);
5621 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
5622 the pointer in these functions is void*, the tree optimizers may remove
5623 casts. The mode computed in expand_builtin isn't reliable either, due
5624 to __sync_bool_compare_and_swap.
5626 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
5627 group of builtins. This gives us log2 of the mode size. */
5629 static inline enum machine_mode
5630 get_builtin_sync_mode (int fcode_diff)
5632 /* The size is not negotiable, so ask not to get BLKmode in return
5633 if the target indicates that a smaller size would be better. */
5634 return mode_for_size (BITS_PER_UNIT << fcode_diff, MODE_INT, 0);
5637 /* Expand the memory expression LOC and return the appropriate memory operand
5638 for the builtin_sync operations. */
5641 get_builtin_sync_mem (tree loc, enum machine_mode mode)
5645 addr = expand_expr (loc, NULL_RTX, ptr_mode, EXPAND_SUM);
5646 addr = convert_memory_address (Pmode, addr);
5648 /* Note that we explicitly do not want any alias information for this
5649 memory, so that we kill all other live memories. Otherwise we don't
5650 satisfy the full barrier semantics of the intrinsic. */
5651 mem = validize_mem (gen_rtx_MEM (mode, addr));
5653 set_mem_align (mem, get_pointer_alignment (loc, BIGGEST_ALIGNMENT));
5654 set_mem_alias_set (mem, ALIAS_SET_MEMORY_BARRIER);
5655 MEM_VOLATILE_P (mem) = 1;
5660 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
5661 EXP is the CALL_EXPR. CODE is the rtx code
5662 that corresponds to the arithmetic or logical operation from the name;
5663 an exception here is that NOT actually means NAND. TARGET is an optional
5664 place for us to store the results; AFTER is true if this is the
5665 fetch_and_xxx form. IGNORE is true if we don't actually care about
5666 the result of the operation at all. */
5669 expand_builtin_sync_operation (enum machine_mode mode, tree exp,
5670 enum rtx_code code, bool after,
5671 rtx target, bool ignore)
5674 enum machine_mode old_mode;
5675 location_t loc = EXPR_LOCATION (exp);
5677 if (code == NOT && warn_sync_nand)
5679 tree fndecl = get_callee_fndecl (exp);
5680 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
5682 static bool warned_f_a_n, warned_n_a_f;
5686 case BUILT_IN_FETCH_AND_NAND_1:
5687 case BUILT_IN_FETCH_AND_NAND_2:
5688 case BUILT_IN_FETCH_AND_NAND_4:
5689 case BUILT_IN_FETCH_AND_NAND_8:
5690 case BUILT_IN_FETCH_AND_NAND_16:
5695 fndecl = implicit_built_in_decls[BUILT_IN_FETCH_AND_NAND_N];
5696 inform (loc, "%qD changed semantics in GCC 4.4", fndecl);
5697 warned_f_a_n = true;
5700 case BUILT_IN_NAND_AND_FETCH_1:
5701 case BUILT_IN_NAND_AND_FETCH_2:
5702 case BUILT_IN_NAND_AND_FETCH_4:
5703 case BUILT_IN_NAND_AND_FETCH_8:
5704 case BUILT_IN_NAND_AND_FETCH_16:
5709 fndecl = implicit_built_in_decls[BUILT_IN_NAND_AND_FETCH_N];
5710 inform (loc, "%qD changed semantics in GCC 4.4", fndecl);
5711 warned_n_a_f = true;
5719 /* Expand the operands. */
5720 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5722 val = expand_expr (CALL_EXPR_ARG (exp, 1), NULL_RTX, mode, EXPAND_NORMAL);
5723 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5724 of CONST_INTs, where we know the old_mode only from the call argument. */
5725 old_mode = GET_MODE (val);
5726 if (old_mode == VOIDmode)
5727 old_mode = TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp, 1)));
5728 val = convert_modes (mode, old_mode, val, 1);
5731 return expand_sync_operation (mem, val, code);
5733 return expand_sync_fetch_operation (mem, val, code, after, target);
5736 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
5737 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
5738 true if this is the boolean form. TARGET is a place for us to store the
5739 results; this is NOT optional if IS_BOOL is true. */
5742 expand_builtin_compare_and_swap (enum machine_mode mode, tree exp,
5743 bool is_bool, rtx target)
5745 rtx old_val, new_val, mem;
5746 enum machine_mode old_mode;
5748 /* Expand the operands. */
5749 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5752 old_val = expand_expr (CALL_EXPR_ARG (exp, 1), NULL_RTX,
5753 mode, EXPAND_NORMAL);
5754 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5755 of CONST_INTs, where we know the old_mode only from the call argument. */
5756 old_mode = GET_MODE (old_val);
5757 if (old_mode == VOIDmode)
5758 old_mode = TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp, 1)));
5759 old_val = convert_modes (mode, old_mode, old_val, 1);
5761 new_val = expand_expr (CALL_EXPR_ARG (exp, 2), NULL_RTX,
5762 mode, EXPAND_NORMAL);
5763 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5764 of CONST_INTs, where we know the old_mode only from the call argument. */
5765 old_mode = GET_MODE (new_val);
5766 if (old_mode == VOIDmode)
5767 old_mode = TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp, 2)));
5768 new_val = convert_modes (mode, old_mode, new_val, 1);
5771 return expand_bool_compare_and_swap (mem, old_val, new_val, target);
5773 return expand_val_compare_and_swap (mem, old_val, new_val, target);
5776 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
5777 general form is actually an atomic exchange, and some targets only
5778 support a reduced form with the second argument being a constant 1.
5779 EXP is the CALL_EXPR; TARGET is an optional place for us to store
5783 expand_builtin_lock_test_and_set (enum machine_mode mode, tree exp,
5787 enum machine_mode old_mode;
5789 /* Expand the operands. */
5790 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5791 val = expand_expr (CALL_EXPR_ARG (exp, 1), NULL_RTX, mode, EXPAND_NORMAL);
5792 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5793 of CONST_INTs, where we know the old_mode only from the call argument. */
5794 old_mode = GET_MODE (val);
5795 if (old_mode == VOIDmode)
5796 old_mode = TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp, 1)));
5797 val = convert_modes (mode, old_mode, val, 1);
5799 return expand_sync_lock_test_and_set (mem, val, target);
5802 /* Expand the __sync_synchronize intrinsic. */
5805 expand_builtin_synchronize (void)
5808 VEC (tree, gc) *v_clobbers;
5810 #ifdef HAVE_memory_barrier
5811 if (HAVE_memory_barrier)
5813 emit_insn (gen_memory_barrier ());
5818 if (synchronize_libfunc != NULL_RTX)
5820 emit_library_call (synchronize_libfunc, LCT_NORMAL, VOIDmode, 0);
5824 /* If no explicit memory barrier instruction is available, create an
5825 empty asm stmt with a memory clobber. */
5826 v_clobbers = VEC_alloc (tree, gc, 1);
5827 VEC_quick_push (tree, v_clobbers,
5828 tree_cons (NULL, build_string (6, "memory"), NULL));
5829 x = gimple_build_asm_vec ("", NULL, NULL, v_clobbers, NULL);
5830 gimple_asm_set_volatile (x, true);
5831 expand_asm_stmt (x);
5834 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
5837 expand_builtin_lock_release (enum machine_mode mode, tree exp)
5839 enum insn_code icode;
5841 rtx val = const0_rtx;
5843 /* Expand the operands. */
5844 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5846 /* If there is an explicit operation in the md file, use it. */
5847 icode = sync_lock_release[mode];
5848 if (icode != CODE_FOR_nothing)
5850 if (!insn_data[icode].operand[1].predicate (val, mode))
5851 val = force_reg (mode, val);
5853 insn = GEN_FCN (icode) (mem, val);
5861 /* Otherwise we can implement this operation by emitting a barrier
5862 followed by a store of zero. */
5863 expand_builtin_synchronize ();
5864 emit_move_insn (mem, val);
5867 /* Expand an expression EXP that calls a built-in function,
5868 with result going to TARGET if that's convenient
5869 (and in mode MODE if that's convenient).
5870 SUBTARGET may be used as the target for computing one of EXP's operands.
5871 IGNORE is nonzero if the value is to be ignored. */
5874 expand_builtin (tree exp, rtx target, rtx subtarget, enum machine_mode mode,
5877 tree fndecl = get_callee_fndecl (exp);
5878 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
5879 enum machine_mode target_mode = TYPE_MODE (TREE_TYPE (exp));
5881 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
5882 return targetm.expand_builtin (exp, target, subtarget, mode, ignore);
5884 /* When not optimizing, generate calls to library functions for a certain
5887 && !called_as_built_in (fndecl)
5888 && DECL_ASSEMBLER_NAME_SET_P (fndecl)
5889 && fcode != BUILT_IN_ALLOCA
5890 && fcode != BUILT_IN_FREE)
5891 return expand_call (exp, target, ignore);
5893 /* The built-in function expanders test for target == const0_rtx
5894 to determine whether the function's result will be ignored. */
5896 target = const0_rtx;
5898 /* If the result of a pure or const built-in function is ignored, and
5899 none of its arguments are volatile, we can avoid expanding the
5900 built-in call and just evaluate the arguments for side-effects. */
5901 if (target == const0_rtx
5902 && (DECL_PURE_P (fndecl) || TREE_READONLY (fndecl)))
5904 bool volatilep = false;
5906 call_expr_arg_iterator iter;
5908 FOR_EACH_CALL_EXPR_ARG (arg, iter, exp)
5909 if (TREE_THIS_VOLATILE (arg))
5917 FOR_EACH_CALL_EXPR_ARG (arg, iter, exp)
5918 expand_expr (arg, const0_rtx, VOIDmode, EXPAND_NORMAL);
5925 CASE_FLT_FN (BUILT_IN_FABS):
5926 target = expand_builtin_fabs (exp, target, subtarget);
5931 CASE_FLT_FN (BUILT_IN_COPYSIGN):
5932 target = expand_builtin_copysign (exp, target, subtarget);
5937 /* Just do a normal library call if we were unable to fold
5939 CASE_FLT_FN (BUILT_IN_CABS):
5942 CASE_FLT_FN (BUILT_IN_EXP):
5943 CASE_FLT_FN (BUILT_IN_EXP10):
5944 CASE_FLT_FN (BUILT_IN_POW10):
5945 CASE_FLT_FN (BUILT_IN_EXP2):
5946 CASE_FLT_FN (BUILT_IN_EXPM1):
5947 CASE_FLT_FN (BUILT_IN_LOGB):
5948 CASE_FLT_FN (BUILT_IN_LOG):
5949 CASE_FLT_FN (BUILT_IN_LOG10):
5950 CASE_FLT_FN (BUILT_IN_LOG2):
5951 CASE_FLT_FN (BUILT_IN_LOG1P):
5952 CASE_FLT_FN (BUILT_IN_TAN):
5953 CASE_FLT_FN (BUILT_IN_ASIN):
5954 CASE_FLT_FN (BUILT_IN_ACOS):
5955 CASE_FLT_FN (BUILT_IN_ATAN):
5956 CASE_FLT_FN (BUILT_IN_SIGNIFICAND):
5957 /* Treat these like sqrt only if unsafe math optimizations are allowed,
5958 because of possible accuracy problems. */
5959 if (! flag_unsafe_math_optimizations)
5961 CASE_FLT_FN (BUILT_IN_SQRT):
5962 CASE_FLT_FN (BUILT_IN_FLOOR):
5963 CASE_FLT_FN (BUILT_IN_CEIL):
5964 CASE_FLT_FN (BUILT_IN_TRUNC):
5965 CASE_FLT_FN (BUILT_IN_ROUND):
5966 CASE_FLT_FN (BUILT_IN_NEARBYINT):
5967 CASE_FLT_FN (BUILT_IN_RINT):
5968 target = expand_builtin_mathfn (exp, target, subtarget);
5973 CASE_FLT_FN (BUILT_IN_ILOGB):
5974 if (! flag_unsafe_math_optimizations)
5976 CASE_FLT_FN (BUILT_IN_ISINF):
5977 CASE_FLT_FN (BUILT_IN_FINITE):
5978 case BUILT_IN_ISFINITE:
5979 case BUILT_IN_ISNORMAL:
5980 target = expand_builtin_interclass_mathfn (exp, target, subtarget);
5985 CASE_FLT_FN (BUILT_IN_LCEIL):
5986 CASE_FLT_FN (BUILT_IN_LLCEIL):
5987 CASE_FLT_FN (BUILT_IN_LFLOOR):
5988 CASE_FLT_FN (BUILT_IN_LLFLOOR):
5989 target = expand_builtin_int_roundingfn (exp, target);
5994 CASE_FLT_FN (BUILT_IN_LRINT):
5995 CASE_FLT_FN (BUILT_IN_LLRINT):
5996 CASE_FLT_FN (BUILT_IN_LROUND):
5997 CASE_FLT_FN (BUILT_IN_LLROUND):
5998 target = expand_builtin_int_roundingfn_2 (exp, target);
6003 CASE_FLT_FN (BUILT_IN_POW):
6004 target = expand_builtin_pow (exp, target, subtarget);
6009 CASE_FLT_FN (BUILT_IN_POWI):
6010 target = expand_builtin_powi (exp, target, subtarget);
6015 CASE_FLT_FN (BUILT_IN_ATAN2):
6016 CASE_FLT_FN (BUILT_IN_LDEXP):
6017 CASE_FLT_FN (BUILT_IN_SCALB):
6018 CASE_FLT_FN (BUILT_IN_SCALBN):
6019 CASE_FLT_FN (BUILT_IN_SCALBLN):
6020 if (! flag_unsafe_math_optimizations)
6023 CASE_FLT_FN (BUILT_IN_FMOD):
6024 CASE_FLT_FN (BUILT_IN_REMAINDER):
6025 CASE_FLT_FN (BUILT_IN_DREM):
6026 target = expand_builtin_mathfn_2 (exp, target, subtarget);
6031 CASE_FLT_FN (BUILT_IN_CEXPI):
6032 target = expand_builtin_cexpi (exp, target, subtarget);
6033 gcc_assert (target);
6036 CASE_FLT_FN (BUILT_IN_SIN):
6037 CASE_FLT_FN (BUILT_IN_COS):
6038 if (! flag_unsafe_math_optimizations)
6040 target = expand_builtin_mathfn_3 (exp, target, subtarget);
6045 CASE_FLT_FN (BUILT_IN_SINCOS):
6046 if (! flag_unsafe_math_optimizations)
6048 target = expand_builtin_sincos (exp);
6053 case BUILT_IN_APPLY_ARGS:
6054 return expand_builtin_apply_args ();
6056 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
6057 FUNCTION with a copy of the parameters described by
6058 ARGUMENTS, and ARGSIZE. It returns a block of memory
6059 allocated on the stack into which is stored all the registers
6060 that might possibly be used for returning the result of a
6061 function. ARGUMENTS is the value returned by
6062 __builtin_apply_args. ARGSIZE is the number of bytes of
6063 arguments that must be copied. ??? How should this value be
6064 computed? We'll also need a safe worst case value for varargs
6066 case BUILT_IN_APPLY:
6067 if (!validate_arglist (exp, POINTER_TYPE,
6068 POINTER_TYPE, INTEGER_TYPE, VOID_TYPE)
6069 && !validate_arglist (exp, REFERENCE_TYPE,
6070 POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
6076 ops[0] = expand_normal (CALL_EXPR_ARG (exp, 0));
6077 ops[1] = expand_normal (CALL_EXPR_ARG (exp, 1));
6078 ops[2] = expand_normal (CALL_EXPR_ARG (exp, 2));
6080 return expand_builtin_apply (ops[0], ops[1], ops[2]);
6083 /* __builtin_return (RESULT) causes the function to return the
6084 value described by RESULT. RESULT is address of the block of
6085 memory returned by __builtin_apply. */
6086 case BUILT_IN_RETURN:
6087 if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
6088 expand_builtin_return (expand_normal (CALL_EXPR_ARG (exp, 0)));
6091 case BUILT_IN_SAVEREGS:
6092 return expand_builtin_saveregs ();
6094 case BUILT_IN_ARGS_INFO:
6095 return expand_builtin_args_info (exp);
6097 case BUILT_IN_VA_ARG_PACK:
6098 /* All valid uses of __builtin_va_arg_pack () are removed during
6100 error ("%Kinvalid use of %<__builtin_va_arg_pack ()%>", exp);
6103 case BUILT_IN_VA_ARG_PACK_LEN:
6104 /* All valid uses of __builtin_va_arg_pack_len () are removed during
6106 error ("%Kinvalid use of %<__builtin_va_arg_pack_len ()%>", exp);
6109 /* Return the address of the first anonymous stack arg. */
6110 case BUILT_IN_NEXT_ARG:
6111 if (fold_builtin_next_arg (exp, false))
6113 return expand_builtin_next_arg ();
6115 case BUILT_IN_CLEAR_CACHE:
6116 target = expand_builtin___clear_cache (exp);
6121 case BUILT_IN_CLASSIFY_TYPE:
6122 return expand_builtin_classify_type (exp);
6124 case BUILT_IN_CONSTANT_P:
6127 case BUILT_IN_FRAME_ADDRESS:
6128 case BUILT_IN_RETURN_ADDRESS:
6129 return expand_builtin_frame_address (fndecl, exp);
6131 /* Returns the address of the area where the structure is returned.
6133 case BUILT_IN_AGGREGATE_INCOMING_ADDRESS:
6134 if (call_expr_nargs (exp) != 0
6135 || ! AGGREGATE_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl)))
6136 || !MEM_P (DECL_RTL (DECL_RESULT (current_function_decl))))
6139 return XEXP (DECL_RTL (DECL_RESULT (current_function_decl)), 0);
6141 case BUILT_IN_ALLOCA:
6142 target = expand_builtin_alloca (exp, target);
6147 case BUILT_IN_STACK_SAVE:
6148 return expand_stack_save ();
6150 case BUILT_IN_STACK_RESTORE:
6151 expand_stack_restore (CALL_EXPR_ARG (exp, 0));
6154 case BUILT_IN_BSWAP32:
6155 case BUILT_IN_BSWAP64:
6156 target = expand_builtin_bswap (exp, target, subtarget);
6162 CASE_INT_FN (BUILT_IN_FFS):
6163 case BUILT_IN_FFSIMAX:
6164 target = expand_builtin_unop (target_mode, exp, target,
6165 subtarget, ffs_optab);
6170 CASE_INT_FN (BUILT_IN_CLZ):
6171 case BUILT_IN_CLZIMAX:
6172 target = expand_builtin_unop (target_mode, exp, target,
6173 subtarget, clz_optab);
6178 CASE_INT_FN (BUILT_IN_CTZ):
6179 case BUILT_IN_CTZIMAX:
6180 target = expand_builtin_unop (target_mode, exp, target,
6181 subtarget, ctz_optab);
6186 CASE_INT_FN (BUILT_IN_POPCOUNT):
6187 case BUILT_IN_POPCOUNTIMAX:
6188 target = expand_builtin_unop (target_mode, exp, target,
6189 subtarget, popcount_optab);
6194 CASE_INT_FN (BUILT_IN_PARITY):
6195 case BUILT_IN_PARITYIMAX:
6196 target = expand_builtin_unop (target_mode, exp, target,
6197 subtarget, parity_optab);
6202 case BUILT_IN_STRLEN:
6203 target = expand_builtin_strlen (exp, target, target_mode);
6208 case BUILT_IN_STRCPY:
6209 target = expand_builtin_strcpy (exp, target);
6214 case BUILT_IN_STRNCPY:
6215 target = expand_builtin_strncpy (exp, target);
6220 case BUILT_IN_STPCPY:
6221 target = expand_builtin_stpcpy (exp, target, mode);
6226 case BUILT_IN_MEMCPY:
6227 target = expand_builtin_memcpy (exp, target);
6232 case BUILT_IN_MEMPCPY:
6233 target = expand_builtin_mempcpy (exp, target, mode);
6238 case BUILT_IN_MEMSET:
6239 target = expand_builtin_memset (exp, target, mode);
6244 case BUILT_IN_BZERO:
6245 target = expand_builtin_bzero (exp);
6250 case BUILT_IN_STRCMP:
6251 target = expand_builtin_strcmp (exp, target);
6256 case BUILT_IN_STRNCMP:
6257 target = expand_builtin_strncmp (exp, target, mode);
6263 case BUILT_IN_MEMCMP:
6264 target = expand_builtin_memcmp (exp, target, mode);
6269 case BUILT_IN_SETJMP:
6270 /* This should have been lowered to the builtins below. */
6273 case BUILT_IN_SETJMP_SETUP:
6274 /* __builtin_setjmp_setup is passed a pointer to an array of five words
6275 and the receiver label. */
6276 if (validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
6278 rtx buf_addr = expand_expr (CALL_EXPR_ARG (exp, 0), subtarget,
6279 VOIDmode, EXPAND_NORMAL);
6280 tree label = TREE_OPERAND (CALL_EXPR_ARG (exp, 1), 0);
6281 rtx label_r = label_rtx (label);
6283 /* This is copied from the handling of non-local gotos. */
6284 expand_builtin_setjmp_setup (buf_addr, label_r);
6285 nonlocal_goto_handler_labels
6286 = gen_rtx_EXPR_LIST (VOIDmode, label_r,
6287 nonlocal_goto_handler_labels);
6288 /* ??? Do not let expand_label treat us as such since we would
6289 not want to be both on the list of non-local labels and on
6290 the list of forced labels. */
6291 FORCED_LABEL (label) = 0;
6296 case BUILT_IN_SETJMP_DISPATCHER:
6297 /* __builtin_setjmp_dispatcher is passed the dispatcher label. */
6298 if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
6300 tree label = TREE_OPERAND (CALL_EXPR_ARG (exp, 0), 0);
6301 rtx label_r = label_rtx (label);
6303 /* Remove the dispatcher label from the list of non-local labels
6304 since the receiver labels have been added to it above. */
6305 remove_node_from_expr_list (label_r, &nonlocal_goto_handler_labels);
6310 case BUILT_IN_SETJMP_RECEIVER:
6311 /* __builtin_setjmp_receiver is passed the receiver label. */
6312 if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
6314 tree label = TREE_OPERAND (CALL_EXPR_ARG (exp, 0), 0);
6315 rtx label_r = label_rtx (label);
6317 expand_builtin_setjmp_receiver (label_r);
6322 /* __builtin_longjmp is passed a pointer to an array of five words.
6323 It's similar to the C library longjmp function but works with
6324 __builtin_setjmp above. */
6325 case BUILT_IN_LONGJMP:
6326 if (validate_arglist (exp, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
6328 rtx buf_addr = expand_expr (CALL_EXPR_ARG (exp, 0), subtarget,
6329 VOIDmode, EXPAND_NORMAL);
6330 rtx value = expand_normal (CALL_EXPR_ARG (exp, 1));
6332 if (value != const1_rtx)
6334 error ("%<__builtin_longjmp%> second argument must be 1");
6338 expand_builtin_longjmp (buf_addr, value);
6343 case BUILT_IN_NONLOCAL_GOTO:
6344 target = expand_builtin_nonlocal_goto (exp);
6349 /* This updates the setjmp buffer that is its argument with the value
6350 of the current stack pointer. */
6351 case BUILT_IN_UPDATE_SETJMP_BUF:
6352 if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
6355 = expand_normal (CALL_EXPR_ARG (exp, 0));
6357 expand_builtin_update_setjmp_buf (buf_addr);
6363 expand_builtin_trap ();
6366 case BUILT_IN_UNREACHABLE:
6367 expand_builtin_unreachable ();
6370 case BUILT_IN_PRINTF:
6371 target = expand_builtin_printf (exp, target, mode, false);
6376 case BUILT_IN_PRINTF_UNLOCKED:
6377 target = expand_builtin_printf (exp, target, mode, true);
6382 case BUILT_IN_FPRINTF:
6383 target = expand_builtin_fprintf (exp, target, mode, false);
6388 case BUILT_IN_FPRINTF_UNLOCKED:
6389 target = expand_builtin_fprintf (exp, target, mode, true);
6394 case BUILT_IN_SPRINTF:
6395 target = expand_builtin_sprintf (exp, target, mode);
6400 CASE_FLT_FN (BUILT_IN_SIGNBIT):
6401 case BUILT_IN_SIGNBITD32:
6402 case BUILT_IN_SIGNBITD64:
6403 case BUILT_IN_SIGNBITD128:
6404 target = expand_builtin_signbit (exp, target);
6409 /* Various hooks for the DWARF 2 __throw routine. */
6410 case BUILT_IN_UNWIND_INIT:
6411 expand_builtin_unwind_init ();
6413 case BUILT_IN_DWARF_CFA:
6414 return virtual_cfa_rtx;
6415 #ifdef DWARF2_UNWIND_INFO
6416 case BUILT_IN_DWARF_SP_COLUMN:
6417 return expand_builtin_dwarf_sp_column ();
6418 case BUILT_IN_INIT_DWARF_REG_SIZES:
6419 expand_builtin_init_dwarf_reg_sizes (CALL_EXPR_ARG (exp, 0));
6422 case BUILT_IN_FROB_RETURN_ADDR:
6423 return expand_builtin_frob_return_addr (CALL_EXPR_ARG (exp, 0));
6424 case BUILT_IN_EXTRACT_RETURN_ADDR:
6425 return expand_builtin_extract_return_addr (CALL_EXPR_ARG (exp, 0));
6426 case BUILT_IN_EH_RETURN:
6427 expand_builtin_eh_return (CALL_EXPR_ARG (exp, 0),
6428 CALL_EXPR_ARG (exp, 1));
6430 #ifdef EH_RETURN_DATA_REGNO
6431 case BUILT_IN_EH_RETURN_DATA_REGNO:
6432 return expand_builtin_eh_return_data_regno (exp);
6434 case BUILT_IN_EXTEND_POINTER:
6435 return expand_builtin_extend_pointer (CALL_EXPR_ARG (exp, 0));
6436 case BUILT_IN_EH_POINTER:
6437 return expand_builtin_eh_pointer (exp);
6438 case BUILT_IN_EH_FILTER:
6439 return expand_builtin_eh_filter (exp);
6440 case BUILT_IN_EH_COPY_VALUES:
6441 return expand_builtin_eh_copy_values (exp);
6443 case BUILT_IN_VA_START:
6444 return expand_builtin_va_start (exp);
6445 case BUILT_IN_VA_END:
6446 return expand_builtin_va_end (exp);
6447 case BUILT_IN_VA_COPY:
6448 return expand_builtin_va_copy (exp);
6449 case BUILT_IN_EXPECT:
6450 return expand_builtin_expect (exp, target);
6451 case BUILT_IN_PREFETCH:
6452 expand_builtin_prefetch (exp);
6455 case BUILT_IN_PROFILE_FUNC_ENTER:
6456 return expand_builtin_profile_func (false);
6457 case BUILT_IN_PROFILE_FUNC_EXIT:
6458 return expand_builtin_profile_func (true);
6460 case BUILT_IN_INIT_TRAMPOLINE:
6461 return expand_builtin_init_trampoline (exp);
6462 case BUILT_IN_ADJUST_TRAMPOLINE:
6463 return expand_builtin_adjust_trampoline (exp);
6466 case BUILT_IN_EXECL:
6467 case BUILT_IN_EXECV:
6468 case BUILT_IN_EXECLP:
6469 case BUILT_IN_EXECLE:
6470 case BUILT_IN_EXECVP:
6471 case BUILT_IN_EXECVE:
6472 target = expand_builtin_fork_or_exec (fndecl, exp, target, ignore);
6477 case BUILT_IN_FETCH_AND_ADD_1:
6478 case BUILT_IN_FETCH_AND_ADD_2:
6479 case BUILT_IN_FETCH_AND_ADD_4:
6480 case BUILT_IN_FETCH_AND_ADD_8:
6481 case BUILT_IN_FETCH_AND_ADD_16:
6482 mode = get_builtin_sync_mode (fcode - BUILT_IN_FETCH_AND_ADD_1);
6483 target = expand_builtin_sync_operation (mode, exp, PLUS,
6484 false, target, ignore);
6489 case BUILT_IN_FETCH_AND_SUB_1:
6490 case BUILT_IN_FETCH_AND_SUB_2:
6491 case BUILT_IN_FETCH_AND_SUB_4:
6492 case BUILT_IN_FETCH_AND_SUB_8:
6493 case BUILT_IN_FETCH_AND_SUB_16:
6494 mode = get_builtin_sync_mode (fcode - BUILT_IN_FETCH_AND_SUB_1);
6495 target = expand_builtin_sync_operation (mode, exp, MINUS,
6496 false, target, ignore);
6501 case BUILT_IN_FETCH_AND_OR_1:
6502 case BUILT_IN_FETCH_AND_OR_2:
6503 case BUILT_IN_FETCH_AND_OR_4:
6504 case BUILT_IN_FETCH_AND_OR_8:
6505 case BUILT_IN_FETCH_AND_OR_16:
6506 mode = get_builtin_sync_mode (fcode - BUILT_IN_FETCH_AND_OR_1);
6507 target = expand_builtin_sync_operation (mode, exp, IOR,
6508 false, target, ignore);
6513 case BUILT_IN_FETCH_AND_AND_1:
6514 case BUILT_IN_FETCH_AND_AND_2:
6515 case BUILT_IN_FETCH_AND_AND_4:
6516 case BUILT_IN_FETCH_AND_AND_8:
6517 case BUILT_IN_FETCH_AND_AND_16:
6518 mode = get_builtin_sync_mode (fcode - BUILT_IN_FETCH_AND_AND_1);
6519 target = expand_builtin_sync_operation (mode, exp, AND,
6520 false, target, ignore);
6525 case BUILT_IN_FETCH_AND_XOR_1:
6526 case BUILT_IN_FETCH_AND_XOR_2:
6527 case BUILT_IN_FETCH_AND_XOR_4:
6528 case BUILT_IN_FETCH_AND_XOR_8:
6529 case BUILT_IN_FETCH_AND_XOR_16:
6530 mode = get_builtin_sync_mode (fcode - BUILT_IN_FETCH_AND_XOR_1);
6531 target = expand_builtin_sync_operation (mode, exp, XOR,
6532 false, target, ignore);
6537 case BUILT_IN_FETCH_AND_NAND_1:
6538 case BUILT_IN_FETCH_AND_NAND_2:
6539 case BUILT_IN_FETCH_AND_NAND_4:
6540 case BUILT_IN_FETCH_AND_NAND_8:
6541 case BUILT_IN_FETCH_AND_NAND_16:
6542 mode = get_builtin_sync_mode (fcode - BUILT_IN_FETCH_AND_NAND_1);
6543 target = expand_builtin_sync_operation (mode, exp, NOT,
6544 false, target, ignore);
6549 case BUILT_IN_ADD_AND_FETCH_1:
6550 case BUILT_IN_ADD_AND_FETCH_2:
6551 case BUILT_IN_ADD_AND_FETCH_4:
6552 case BUILT_IN_ADD_AND_FETCH_8:
6553 case BUILT_IN_ADD_AND_FETCH_16:
6554 mode = get_builtin_sync_mode (fcode - BUILT_IN_ADD_AND_FETCH_1);
6555 target = expand_builtin_sync_operation (mode, exp, PLUS,
6556 true, target, ignore);
6561 case BUILT_IN_SUB_AND_FETCH_1:
6562 case BUILT_IN_SUB_AND_FETCH_2:
6563 case BUILT_IN_SUB_AND_FETCH_4:
6564 case BUILT_IN_SUB_AND_FETCH_8:
6565 case BUILT_IN_SUB_AND_FETCH_16:
6566 mode = get_builtin_sync_mode (fcode - BUILT_IN_SUB_AND_FETCH_1);
6567 target = expand_builtin_sync_operation (mode, exp, MINUS,
6568 true, target, ignore);
6573 case BUILT_IN_OR_AND_FETCH_1:
6574 case BUILT_IN_OR_AND_FETCH_2:
6575 case BUILT_IN_OR_AND_FETCH_4:
6576 case BUILT_IN_OR_AND_FETCH_8:
6577 case BUILT_IN_OR_AND_FETCH_16:
6578 mode = get_builtin_sync_mode (fcode - BUILT_IN_OR_AND_FETCH_1);
6579 target = expand_builtin_sync_operation (mode, exp, IOR,
6580 true, target, ignore);
6585 case BUILT_IN_AND_AND_FETCH_1:
6586 case BUILT_IN_AND_AND_FETCH_2:
6587 case BUILT_IN_AND_AND_FETCH_4:
6588 case BUILT_IN_AND_AND_FETCH_8:
6589 case BUILT_IN_AND_AND_FETCH_16:
6590 mode = get_builtin_sync_mode (fcode - BUILT_IN_AND_AND_FETCH_1);
6591 target = expand_builtin_sync_operation (mode, exp, AND,
6592 true, target, ignore);
6597 case BUILT_IN_XOR_AND_FETCH_1:
6598 case BUILT_IN_XOR_AND_FETCH_2:
6599 case BUILT_IN_XOR_AND_FETCH_4:
6600 case BUILT_IN_XOR_AND_FETCH_8:
6601 case BUILT_IN_XOR_AND_FETCH_16:
6602 mode = get_builtin_sync_mode (fcode - BUILT_IN_XOR_AND_FETCH_1);
6603 target = expand_builtin_sync_operation (mode, exp, XOR,
6604 true, target, ignore);
6609 case BUILT_IN_NAND_AND_FETCH_1:
6610 case BUILT_IN_NAND_AND_FETCH_2:
6611 case BUILT_IN_NAND_AND_FETCH_4:
6612 case BUILT_IN_NAND_AND_FETCH_8:
6613 case BUILT_IN_NAND_AND_FETCH_16:
6614 mode = get_builtin_sync_mode (fcode - BUILT_IN_NAND_AND_FETCH_1);
6615 target = expand_builtin_sync_operation (mode, exp, NOT,
6616 true, target, ignore);
6621 case BUILT_IN_BOOL_COMPARE_AND_SWAP_1:
6622 case BUILT_IN_BOOL_COMPARE_AND_SWAP_2:
6623 case BUILT_IN_BOOL_COMPARE_AND_SWAP_4:
6624 case BUILT_IN_BOOL_COMPARE_AND_SWAP_8:
6625 case BUILT_IN_BOOL_COMPARE_AND_SWAP_16:
6626 if (mode == VOIDmode)
6627 mode = TYPE_MODE (boolean_type_node);
6628 if (!target || !register_operand (target, mode))
6629 target = gen_reg_rtx (mode);
6631 mode = get_builtin_sync_mode (fcode - BUILT_IN_BOOL_COMPARE_AND_SWAP_1);
6632 target = expand_builtin_compare_and_swap (mode, exp, true, target);
6637 case BUILT_IN_VAL_COMPARE_AND_SWAP_1:
6638 case BUILT_IN_VAL_COMPARE_AND_SWAP_2:
6639 case BUILT_IN_VAL_COMPARE_AND_SWAP_4:
6640 case BUILT_IN_VAL_COMPARE_AND_SWAP_8:
6641 case BUILT_IN_VAL_COMPARE_AND_SWAP_16:
6642 mode = get_builtin_sync_mode (fcode - BUILT_IN_VAL_COMPARE_AND_SWAP_1);
6643 target = expand_builtin_compare_and_swap (mode, exp, false, target);
6648 case BUILT_IN_LOCK_TEST_AND_SET_1:
6649 case BUILT_IN_LOCK_TEST_AND_SET_2:
6650 case BUILT_IN_LOCK_TEST_AND_SET_4:
6651 case BUILT_IN_LOCK_TEST_AND_SET_8:
6652 case BUILT_IN_LOCK_TEST_AND_SET_16:
6653 mode = get_builtin_sync_mode (fcode - BUILT_IN_LOCK_TEST_AND_SET_1);
6654 target = expand_builtin_lock_test_and_set (mode, exp, target);
6659 case BUILT_IN_LOCK_RELEASE_1:
6660 case BUILT_IN_LOCK_RELEASE_2:
6661 case BUILT_IN_LOCK_RELEASE_4:
6662 case BUILT_IN_LOCK_RELEASE_8:
6663 case BUILT_IN_LOCK_RELEASE_16:
6664 mode = get_builtin_sync_mode (fcode - BUILT_IN_LOCK_RELEASE_1);
6665 expand_builtin_lock_release (mode, exp);
6668 case BUILT_IN_SYNCHRONIZE:
6669 expand_builtin_synchronize ();
6672 case BUILT_IN_OBJECT_SIZE:
6673 return expand_builtin_object_size (exp);
6675 case BUILT_IN_MEMCPY_CHK:
6676 case BUILT_IN_MEMPCPY_CHK:
6677 case BUILT_IN_MEMMOVE_CHK:
6678 case BUILT_IN_MEMSET_CHK:
6679 target = expand_builtin_memory_chk (exp, target, mode, fcode);
6684 case BUILT_IN_STRCPY_CHK:
6685 case BUILT_IN_STPCPY_CHK:
6686 case BUILT_IN_STRNCPY_CHK:
6687 case BUILT_IN_STRCAT_CHK:
6688 case BUILT_IN_STRNCAT_CHK:
6689 case BUILT_IN_SNPRINTF_CHK:
6690 case BUILT_IN_VSNPRINTF_CHK:
6691 maybe_emit_chk_warning (exp, fcode);
6694 case BUILT_IN_SPRINTF_CHK:
6695 case BUILT_IN_VSPRINTF_CHK:
6696 maybe_emit_sprintf_chk_warning (exp, fcode);
6700 maybe_emit_free_warning (exp);
6703 default: /* just do library call, if unknown builtin */
6707 /* The switch statement above can drop through to cause the function
6708 to be called normally. */
6709 return expand_call (exp, target, ignore);
6712 /* Determine whether a tree node represents a call to a built-in
6713 function. If the tree T is a call to a built-in function with
6714 the right number of arguments of the appropriate types, return
6715 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
6716 Otherwise the return value is END_BUILTINS. */
6718 enum built_in_function
6719 builtin_mathfn_code (const_tree t)
6721 const_tree fndecl, arg, parmlist;
6722 const_tree argtype, parmtype;
6723 const_call_expr_arg_iterator iter;
6725 if (TREE_CODE (t) != CALL_EXPR
6726 || TREE_CODE (CALL_EXPR_FN (t)) != ADDR_EXPR)
6727 return END_BUILTINS;
6729 fndecl = get_callee_fndecl (t);
6730 if (fndecl == NULL_TREE
6731 || TREE_CODE (fndecl) != FUNCTION_DECL
6732 || ! DECL_BUILT_IN (fndecl)
6733 || DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
6734 return END_BUILTINS;
6736 parmlist = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
6737 init_const_call_expr_arg_iterator (t, &iter);
6738 for (; parmlist; parmlist = TREE_CHAIN (parmlist))
6740 /* If a function doesn't take a variable number of arguments,
6741 the last element in the list will have type `void'. */
6742 parmtype = TREE_VALUE (parmlist);
6743 if (VOID_TYPE_P (parmtype))
6745 if (more_const_call_expr_args_p (&iter))
6746 return END_BUILTINS;
6747 return DECL_FUNCTION_CODE (fndecl);
6750 if (! more_const_call_expr_args_p (&iter))
6751 return END_BUILTINS;
6753 arg = next_const_call_expr_arg (&iter);
6754 argtype = TREE_TYPE (arg);
6756 if (SCALAR_FLOAT_TYPE_P (parmtype))
6758 if (! SCALAR_FLOAT_TYPE_P (argtype))
6759 return END_BUILTINS;
6761 else if (COMPLEX_FLOAT_TYPE_P (parmtype))
6763 if (! COMPLEX_FLOAT_TYPE_P (argtype))
6764 return END_BUILTINS;
6766 else if (POINTER_TYPE_P (parmtype))
6768 if (! POINTER_TYPE_P (argtype))
6769 return END_BUILTINS;
6771 else if (INTEGRAL_TYPE_P (parmtype))
6773 if (! INTEGRAL_TYPE_P (argtype))
6774 return END_BUILTINS;
6777 return END_BUILTINS;
6780 /* Variable-length argument list. */
6781 return DECL_FUNCTION_CODE (fndecl);
6784 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
6785 evaluate to a constant. */
6788 fold_builtin_constant_p (tree arg)
6790 /* We return 1 for a numeric type that's known to be a constant
6791 value at compile-time or for an aggregate type that's a
6792 literal constant. */
6795 /* If we know this is a constant, emit the constant of one. */
6796 if (CONSTANT_CLASS_P (arg)
6797 || (TREE_CODE (arg) == CONSTRUCTOR
6798 && TREE_CONSTANT (arg)))
6799 return integer_one_node;
6800 if (TREE_CODE (arg) == ADDR_EXPR)
6802 tree op = TREE_OPERAND (arg, 0);
6803 if (TREE_CODE (op) == STRING_CST
6804 || (TREE_CODE (op) == ARRAY_REF
6805 && integer_zerop (TREE_OPERAND (op, 1))
6806 && TREE_CODE (TREE_OPERAND (op, 0)) == STRING_CST))
6807 return integer_one_node;
6810 /* If this expression has side effects, show we don't know it to be a
6811 constant. Likewise if it's a pointer or aggregate type since in
6812 those case we only want literals, since those are only optimized
6813 when generating RTL, not later.
6814 And finally, if we are compiling an initializer, not code, we
6815 need to return a definite result now; there's not going to be any
6816 more optimization done. */
6817 if (TREE_SIDE_EFFECTS (arg)
6818 || AGGREGATE_TYPE_P (TREE_TYPE (arg))
6819 || POINTER_TYPE_P (TREE_TYPE (arg))
6821 || folding_initializer)
6822 return integer_zero_node;
6827 /* Create builtin_expect with PRED and EXPECTED as its arguments and
6828 return it as a truthvalue. */
6831 build_builtin_expect_predicate (location_t loc, tree pred, tree expected)
6833 tree fn, arg_types, pred_type, expected_type, call_expr, ret_type;
6835 fn = built_in_decls[BUILT_IN_EXPECT];
6836 arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn));
6837 ret_type = TREE_TYPE (TREE_TYPE (fn));
6838 pred_type = TREE_VALUE (arg_types);
6839 expected_type = TREE_VALUE (TREE_CHAIN (arg_types));
6841 pred = fold_convert_loc (loc, pred_type, pred);
6842 expected = fold_convert_loc (loc, expected_type, expected);
6843 call_expr = build_call_expr_loc (loc, fn, 2, pred, expected);
6845 return build2 (NE_EXPR, TREE_TYPE (pred), call_expr,
6846 build_int_cst (ret_type, 0));
6849 /* Fold a call to builtin_expect with arguments ARG0 and ARG1. Return
6850 NULL_TREE if no simplification is possible. */
6853 fold_builtin_expect (location_t loc, tree arg0, tree arg1)
6856 enum tree_code code;
6858 /* If this is a builtin_expect within a builtin_expect keep the
6859 inner one. See through a comparison against a constant. It
6860 might have been added to create a thruthvalue. */
6862 if (COMPARISON_CLASS_P (inner)
6863 && TREE_CODE (TREE_OPERAND (inner, 1)) == INTEGER_CST)
6864 inner = TREE_OPERAND (inner, 0);
6866 if (TREE_CODE (inner) == CALL_EXPR
6867 && (fndecl = get_callee_fndecl (inner))
6868 && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
6869 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_EXPECT)
6872 /* Distribute the expected value over short-circuiting operators.
6873 See through the cast from truthvalue_type_node to long. */
6875 while (TREE_CODE (inner) == NOP_EXPR
6876 && INTEGRAL_TYPE_P (TREE_TYPE (inner))
6877 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (inner, 0))))
6878 inner = TREE_OPERAND (inner, 0);
6880 code = TREE_CODE (inner);
6881 if (code == TRUTH_ANDIF_EXPR || code == TRUTH_ORIF_EXPR)
6883 tree op0 = TREE_OPERAND (inner, 0);
6884 tree op1 = TREE_OPERAND (inner, 1);
6886 op0 = build_builtin_expect_predicate (loc, op0, arg1);
6887 op1 = build_builtin_expect_predicate (loc, op1, arg1);
6888 inner = build2 (code, TREE_TYPE (inner), op0, op1);
6890 return fold_convert_loc (loc, TREE_TYPE (arg0), inner);
6893 /* If the argument isn't invariant then there's nothing else we can do. */
6894 if (!TREE_CONSTANT (arg0))
6897 /* If we expect that a comparison against the argument will fold to
6898 a constant return the constant. In practice, this means a true
6899 constant or the address of a non-weak symbol. */
6902 if (TREE_CODE (inner) == ADDR_EXPR)
6906 inner = TREE_OPERAND (inner, 0);
6908 while (TREE_CODE (inner) == COMPONENT_REF
6909 || TREE_CODE (inner) == ARRAY_REF);
6910 if ((TREE_CODE (inner) == VAR_DECL
6911 || TREE_CODE (inner) == FUNCTION_DECL)
6912 && DECL_WEAK (inner))
6916 /* Otherwise, ARG0 already has the proper type for the return value. */
6920 /* Fold a call to __builtin_classify_type with argument ARG. */
6923 fold_builtin_classify_type (tree arg)
6926 return build_int_cst (NULL_TREE, no_type_class);
6928 return build_int_cst (NULL_TREE, type_to_class (TREE_TYPE (arg)));
6931 /* Fold a call to __builtin_strlen with argument ARG. */
6934 fold_builtin_strlen (location_t loc, tree arg)
6936 if (!validate_arg (arg, POINTER_TYPE))
6940 tree len = c_strlen (arg, 0);
6944 /* Convert from the internal "sizetype" type to "size_t". */
6946 len = fold_convert_loc (loc, size_type_node, len);
6954 /* Fold a call to __builtin_inf or __builtin_huge_val. */
6957 fold_builtin_inf (location_t loc, tree type, int warn)
6959 REAL_VALUE_TYPE real;
6961 /* __builtin_inff is intended to be usable to define INFINITY on all
6962 targets. If an infinity is not available, INFINITY expands "to a
6963 positive constant of type float that overflows at translation
6964 time", footnote "In this case, using INFINITY will violate the
6965 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
6966 Thus we pedwarn to ensure this constraint violation is
6968 if (!MODE_HAS_INFINITIES (TYPE_MODE (type)) && warn)
6969 pedwarn (loc, 0, "target format does not support infinity");
6972 return build_real (type, real);
6975 /* Fold a call to __builtin_nan or __builtin_nans with argument ARG. */
6978 fold_builtin_nan (tree arg, tree type, int quiet)
6980 REAL_VALUE_TYPE real;
6983 if (!validate_arg (arg, POINTER_TYPE))
6985 str = c_getstr (arg);
6989 if (!real_nan (&real, str, quiet, TYPE_MODE (type)))
6992 return build_real (type, real);
6995 /* Return true if the floating point expression T has an integer value.
6996 We also allow +Inf, -Inf and NaN to be considered integer values. */
6999 integer_valued_real_p (tree t)
7001 switch (TREE_CODE (t))
7008 return integer_valued_real_p (TREE_OPERAND (t, 0));
7013 return integer_valued_real_p (TREE_OPERAND (t, 1));
7020 return integer_valued_real_p (TREE_OPERAND (t, 0))
7021 && integer_valued_real_p (TREE_OPERAND (t, 1));
7024 return integer_valued_real_p (TREE_OPERAND (t, 1))
7025 && integer_valued_real_p (TREE_OPERAND (t, 2));
7028 return real_isinteger (TREE_REAL_CST_PTR (t), TYPE_MODE (TREE_TYPE (t)));
7032 tree type = TREE_TYPE (TREE_OPERAND (t, 0));
7033 if (TREE_CODE (type) == INTEGER_TYPE)
7035 if (TREE_CODE (type) == REAL_TYPE)
7036 return integer_valued_real_p (TREE_OPERAND (t, 0));
7041 switch (builtin_mathfn_code (t))
7043 CASE_FLT_FN (BUILT_IN_CEIL):
7044 CASE_FLT_FN (BUILT_IN_FLOOR):
7045 CASE_FLT_FN (BUILT_IN_NEARBYINT):
7046 CASE_FLT_FN (BUILT_IN_RINT):
7047 CASE_FLT_FN (BUILT_IN_ROUND):
7048 CASE_FLT_FN (BUILT_IN_TRUNC):
7051 CASE_FLT_FN (BUILT_IN_FMIN):
7052 CASE_FLT_FN (BUILT_IN_FMAX):
7053 return integer_valued_real_p (CALL_EXPR_ARG (t, 0))
7054 && integer_valued_real_p (CALL_EXPR_ARG (t, 1));
7067 /* FNDECL is assumed to be a builtin where truncation can be propagated
7068 across (for instance floor((double)f) == (double)floorf (f).
7069 Do the transformation for a call with argument ARG. */
7072 fold_trunc_transparent_mathfn (location_t loc, tree fndecl, tree arg)
7074 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
7076 if (!validate_arg (arg, REAL_TYPE))
7079 /* Integer rounding functions are idempotent. */
7080 if (fcode == builtin_mathfn_code (arg))
7083 /* If argument is already integer valued, and we don't need to worry
7084 about setting errno, there's no need to perform rounding. */
7085 if (! flag_errno_math && integer_valued_real_p (arg))
7090 tree arg0 = strip_float_extensions (arg);
7091 tree ftype = TREE_TYPE (TREE_TYPE (fndecl));
7092 tree newtype = TREE_TYPE (arg0);
7095 if (TYPE_PRECISION (newtype) < TYPE_PRECISION (ftype)
7096 && (decl = mathfn_built_in (newtype, fcode)))
7097 return fold_convert_loc (loc, ftype,
7098 build_call_expr_loc (loc, decl, 1,
7099 fold_convert_loc (loc,
7106 /* FNDECL is assumed to be builtin which can narrow the FP type of
7107 the argument, for instance lround((double)f) -> lroundf (f).
7108 Do the transformation for a call with argument ARG. */
7111 fold_fixed_mathfn (location_t loc, tree fndecl, tree arg)
7113 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
7115 if (!validate_arg (arg, REAL_TYPE))
7118 /* If argument is already integer valued, and we don't need to worry
7119 about setting errno, there's no need to perform rounding. */
7120 if (! flag_errno_math && integer_valued_real_p (arg))
7121 return fold_build1_loc (loc, FIX_TRUNC_EXPR,
7122 TREE_TYPE (TREE_TYPE (fndecl)), arg);
7126 tree ftype = TREE_TYPE (arg);
7127 tree arg0 = strip_float_extensions (arg);
7128 tree newtype = TREE_TYPE (arg0);
7131 if (TYPE_PRECISION (newtype) < TYPE_PRECISION (ftype)
7132 && (decl = mathfn_built_in (newtype, fcode)))
7133 return build_call_expr_loc (loc, decl, 1,
7134 fold_convert_loc (loc, newtype, arg0));
7137 /* Canonicalize llround (x) to lround (x) on LP64 targets where
7138 sizeof (long long) == sizeof (long). */
7139 if (TYPE_PRECISION (long_long_integer_type_node)
7140 == TYPE_PRECISION (long_integer_type_node))
7142 tree newfn = NULL_TREE;
7145 CASE_FLT_FN (BUILT_IN_LLCEIL):
7146 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LCEIL);
7149 CASE_FLT_FN (BUILT_IN_LLFLOOR):
7150 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LFLOOR);
7153 CASE_FLT_FN (BUILT_IN_LLROUND):
7154 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LROUND);
7157 CASE_FLT_FN (BUILT_IN_LLRINT):
7158 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LRINT);
7167 tree newcall = build_call_expr_loc (loc, newfn, 1, arg);
7168 return fold_convert_loc (loc,
7169 TREE_TYPE (TREE_TYPE (fndecl)), newcall);
7176 /* Fold call to builtin cabs, cabsf or cabsl with argument ARG. TYPE is the
7177 return type. Return NULL_TREE if no simplification can be made. */
7180 fold_builtin_cabs (location_t loc, tree arg, tree type, tree fndecl)
7184 if (!validate_arg (arg, COMPLEX_TYPE)
7185 || TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) != REAL_TYPE)
7188 /* Calculate the result when the argument is a constant. */
7189 if (TREE_CODE (arg) == COMPLEX_CST
7190 && (res = do_mpfr_arg2 (TREE_REALPART (arg), TREE_IMAGPART (arg),
7194 if (TREE_CODE (arg) == COMPLEX_EXPR)
7196 tree real = TREE_OPERAND (arg, 0);
7197 tree imag = TREE_OPERAND (arg, 1);
7199 /* If either part is zero, cabs is fabs of the other. */
7200 if (real_zerop (real))
7201 return fold_build1_loc (loc, ABS_EXPR, type, imag);
7202 if (real_zerop (imag))
7203 return fold_build1_loc (loc, ABS_EXPR, type, real);
7205 /* cabs(x+xi) -> fabs(x)*sqrt(2). */
7206 if (flag_unsafe_math_optimizations
7207 && operand_equal_p (real, imag, OEP_PURE_SAME))
7209 const REAL_VALUE_TYPE sqrt2_trunc
7210 = real_value_truncate (TYPE_MODE (type), dconst_sqrt2 ());
7212 return fold_build2_loc (loc, MULT_EXPR, type,
7213 fold_build1_loc (loc, ABS_EXPR, type, real),
7214 build_real (type, sqrt2_trunc));
7218 /* Optimize cabs(-z) and cabs(conj(z)) as cabs(z). */
7219 if (TREE_CODE (arg) == NEGATE_EXPR
7220 || TREE_CODE (arg) == CONJ_EXPR)
7221 return build_call_expr_loc (loc, fndecl, 1, TREE_OPERAND (arg, 0));
7223 /* Don't do this when optimizing for size. */
7224 if (flag_unsafe_math_optimizations
7225 && optimize && optimize_function_for_speed_p (cfun))
7227 tree sqrtfn = mathfn_built_in (type, BUILT_IN_SQRT);
7229 if (sqrtfn != NULL_TREE)
7231 tree rpart, ipart, result;
7233 arg = builtin_save_expr (arg);
7235 rpart = fold_build1_loc (loc, REALPART_EXPR, type, arg);
7236 ipart = fold_build1_loc (loc, IMAGPART_EXPR, type, arg);
7238 rpart = builtin_save_expr (rpart);
7239 ipart = builtin_save_expr (ipart);
7241 result = fold_build2_loc (loc, PLUS_EXPR, type,
7242 fold_build2_loc (loc, MULT_EXPR, type,
7244 fold_build2_loc (loc, MULT_EXPR, type,
7247 return build_call_expr_loc (loc, sqrtfn, 1, result);
7254 /* Fold a builtin function call to sqrt, sqrtf, or sqrtl with argument ARG.
7255 Return NULL_TREE if no simplification can be made. */
7258 fold_builtin_sqrt (location_t loc, tree arg, tree type)
7261 enum built_in_function fcode;
7264 if (!validate_arg (arg, REAL_TYPE))
7267 /* Calculate the result when the argument is a constant. */
7268 if ((res = do_mpfr_arg1 (arg, type, mpfr_sqrt, &dconst0, NULL, true)))
7271 /* Optimize sqrt(expN(x)) = expN(x*0.5). */
7272 fcode = builtin_mathfn_code (arg);
7273 if (flag_unsafe_math_optimizations && BUILTIN_EXPONENT_P (fcode))
7275 tree expfn = TREE_OPERAND (CALL_EXPR_FN (arg), 0);
7276 arg = fold_build2_loc (loc, MULT_EXPR, type,
7277 CALL_EXPR_ARG (arg, 0),
7278 build_real (type, dconsthalf));
7279 return build_call_expr_loc (loc, expfn, 1, arg);
7282 /* Optimize sqrt(Nroot(x)) -> pow(x,1/(2*N)). */
7283 if (flag_unsafe_math_optimizations && BUILTIN_ROOT_P (fcode))
7285 tree powfn = mathfn_built_in (type, BUILT_IN_POW);
7289 tree arg0 = CALL_EXPR_ARG (arg, 0);
7291 /* The inner root was either sqrt or cbrt. */
7292 /* This was a conditional expression but it triggered a bug
7294 REAL_VALUE_TYPE dconstroot;
7295 if (BUILTIN_SQRT_P (fcode))
7296 dconstroot = dconsthalf;
7298 dconstroot = dconst_third ();
7300 /* Adjust for the outer root. */
7301 SET_REAL_EXP (&dconstroot, REAL_EXP (&dconstroot) - 1);
7302 dconstroot = real_value_truncate (TYPE_MODE (type), dconstroot);
7303 tree_root = build_real (type, dconstroot);
7304 return build_call_expr_loc (loc, powfn, 2, arg0, tree_root);
7308 /* Optimize sqrt(pow(x,y)) = pow(|x|,y*0.5). */
7309 if (flag_unsafe_math_optimizations
7310 && (fcode == BUILT_IN_POW
7311 || fcode == BUILT_IN_POWF
7312 || fcode == BUILT_IN_POWL))
7314 tree powfn = TREE_OPERAND (CALL_EXPR_FN (arg), 0);
7315 tree arg0 = CALL_EXPR_ARG (arg, 0);
7316 tree arg1 = CALL_EXPR_ARG (arg, 1);
7318 if (!tree_expr_nonnegative_p (arg0))
7319 arg0 = build1 (ABS_EXPR, type, arg0);
7320 narg1 = fold_build2_loc (loc, MULT_EXPR, type, arg1,
7321 build_real (type, dconsthalf));
7322 return build_call_expr_loc (loc, powfn, 2, arg0, narg1);
7328 /* Fold a builtin function call to cbrt, cbrtf, or cbrtl with argument ARG.
7329 Return NULL_TREE if no simplification can be made. */
7332 fold_builtin_cbrt (location_t loc, tree arg, tree type)
7334 const enum built_in_function fcode = builtin_mathfn_code (arg);
7337 if (!validate_arg (arg, REAL_TYPE))
7340 /* Calculate the result when the argument is a constant. */
7341 if ((res = do_mpfr_arg1 (arg, type, mpfr_cbrt, NULL, NULL, 0)))
7344 if (flag_unsafe_math_optimizations)
7346 /* Optimize cbrt(expN(x)) -> expN(x/3). */
7347 if (BUILTIN_EXPONENT_P (fcode))
7349 tree expfn = TREE_OPERAND (CALL_EXPR_FN (arg), 0);
7350 const REAL_VALUE_TYPE third_trunc =
7351 real_value_truncate (TYPE_MODE (type), dconst_third ());
7352 arg = fold_build2_loc (loc, MULT_EXPR, type,
7353 CALL_EXPR_ARG (arg, 0),
7354 build_real (type, third_trunc));
7355 return build_call_expr_loc (loc, expfn, 1, arg);
7358 /* Optimize cbrt(sqrt(x)) -> pow(x,1/6). */
7359 if (BUILTIN_SQRT_P (fcode))
7361 tree powfn = mathfn_built_in (type, BUILT_IN_POW);
7365 tree arg0 = CALL_EXPR_ARG (arg, 0);
7367 REAL_VALUE_TYPE dconstroot = dconst_third ();
7369 SET_REAL_EXP (&dconstroot, REAL_EXP (&dconstroot) - 1);
7370 dconstroot = real_value_truncate (TYPE_MODE (type), dconstroot);
7371 tree_root = build_real (type, dconstroot);
7372 return build_call_expr_loc (loc, powfn, 2, arg0, tree_root);
7376 /* Optimize cbrt(cbrt(x)) -> pow(x,1/9) iff x is nonnegative. */
7377 if (BUILTIN_CBRT_P (fcode))
7379 tree arg0 = CALL_EXPR_ARG (arg, 0);
7380 if (tree_expr_nonnegative_p (arg0))
7382 tree powfn = mathfn_built_in (type, BUILT_IN_POW);
7387 REAL_VALUE_TYPE dconstroot;
7389 real_arithmetic (&dconstroot, MULT_EXPR,
7390 dconst_third_ptr (), dconst_third_ptr ());
7391 dconstroot = real_value_truncate (TYPE_MODE (type), dconstroot);
7392 tree_root = build_real (type, dconstroot);
7393 return build_call_expr_loc (loc, powfn, 2, arg0, tree_root);
7398 /* Optimize cbrt(pow(x,y)) -> pow(x,y/3) iff x is nonnegative. */
7399 if (fcode == BUILT_IN_POW
7400 || fcode == BUILT_IN_POWF
7401 || fcode == BUILT_IN_POWL)
7403 tree arg00 = CALL_EXPR_ARG (arg, 0);
7404 tree arg01 = CALL_EXPR_ARG (arg, 1);
7405 if (tree_expr_nonnegative_p (arg00))
7407 tree powfn = TREE_OPERAND (CALL_EXPR_FN (arg), 0);
7408 const REAL_VALUE_TYPE dconstroot
7409 = real_value_truncate (TYPE_MODE (type), dconst_third ());
7410 tree narg01 = fold_build2_loc (loc, MULT_EXPR, type, arg01,
7411 build_real (type, dconstroot));
7412 return build_call_expr_loc (loc, powfn, 2, arg00, narg01);
7419 /* Fold function call to builtin cos, cosf, or cosl with argument ARG.
7420 TYPE is the type of the return value. Return NULL_TREE if no
7421 simplification can be made. */
7424 fold_builtin_cos (location_t loc,
7425 tree arg, tree type, tree fndecl)
7429 if (!validate_arg (arg, REAL_TYPE))
7432 /* Calculate the result when the argument is a constant. */
7433 if ((res = do_mpfr_arg1 (arg, type, mpfr_cos, NULL, NULL, 0)))
7436 /* Optimize cos(-x) into cos (x). */
7437 if ((narg = fold_strip_sign_ops (arg)))
7438 return build_call_expr_loc (loc, fndecl, 1, narg);
7443 /* Fold function call to builtin cosh, coshf, or coshl with argument ARG.
7444 Return NULL_TREE if no simplification can be made. */
7447 fold_builtin_cosh (location_t loc, tree arg, tree type, tree fndecl)
7449 if (validate_arg (arg, REAL_TYPE))
7453 /* Calculate the result when the argument is a constant. */
7454 if ((res = do_mpfr_arg1 (arg, type, mpfr_cosh, NULL, NULL, 0)))
7457 /* Optimize cosh(-x) into cosh (x). */
7458 if ((narg = fold_strip_sign_ops (arg)))
7459 return build_call_expr_loc (loc, fndecl, 1, narg);
7465 /* Fold function call to builtin ccos (or ccosh if HYPER is TRUE) with
7466 argument ARG. TYPE is the type of the return value. Return
7467 NULL_TREE if no simplification can be made. */
7470 fold_builtin_ccos (location_t loc,
7471 tree arg, tree type ATTRIBUTE_UNUSED, tree fndecl,
7472 bool hyper ATTRIBUTE_UNUSED)
7474 if (validate_arg (arg, COMPLEX_TYPE)
7475 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) == REAL_TYPE)
7480 /* Calculate the result when the argument is a constant. */
7481 if ((tmp = do_mpc_arg1 (arg, type, (hyper ? mpc_cosh : mpc_cos))))
7485 /* Optimize fn(-x) into fn(x). */
7486 if ((tmp = fold_strip_sign_ops (arg)))
7487 return build_call_expr_loc (loc, fndecl, 1, tmp);
7493 /* Fold function call to builtin tan, tanf, or tanl with argument ARG.
7494 Return NULL_TREE if no simplification can be made. */
7497 fold_builtin_tan (tree arg, tree type)
7499 enum built_in_function fcode;
7502 if (!validate_arg (arg, REAL_TYPE))
7505 /* Calculate the result when the argument is a constant. */
7506 if ((res = do_mpfr_arg1 (arg, type, mpfr_tan, NULL, NULL, 0)))
7509 /* Optimize tan(atan(x)) = x. */
7510 fcode = builtin_mathfn_code (arg);
7511 if (flag_unsafe_math_optimizations
7512 && (fcode == BUILT_IN_ATAN
7513 || fcode == BUILT_IN_ATANF
7514 || fcode == BUILT_IN_ATANL))
7515 return CALL_EXPR_ARG (arg, 0);
7520 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
7521 NULL_TREE if no simplification can be made. */
7524 fold_builtin_sincos (location_t loc,
7525 tree arg0, tree arg1, tree arg2)
7530 if (!validate_arg (arg0, REAL_TYPE)
7531 || !validate_arg (arg1, POINTER_TYPE)
7532 || !validate_arg (arg2, POINTER_TYPE))
7535 type = TREE_TYPE (arg0);
7537 /* Calculate the result when the argument is a constant. */
7538 if ((res = do_mpfr_sincos (arg0, arg1, arg2)))
7541 /* Canonicalize sincos to cexpi. */
7542 if (!TARGET_C99_FUNCTIONS)
7544 fn = mathfn_built_in (type, BUILT_IN_CEXPI);
7548 call = build_call_expr_loc (loc, fn, 1, arg0);
7549 call = builtin_save_expr (call);
7551 return build2 (COMPOUND_EXPR, void_type_node,
7552 build2 (MODIFY_EXPR, void_type_node,
7553 build_fold_indirect_ref_loc (loc, arg1),
7554 build1 (IMAGPART_EXPR, type, call)),
7555 build2 (MODIFY_EXPR, void_type_node,
7556 build_fold_indirect_ref_loc (loc, arg2),
7557 build1 (REALPART_EXPR, type, call)));
7560 /* Fold function call to builtin cexp, cexpf, or cexpl. Return
7561 NULL_TREE if no simplification can be made. */
7564 fold_builtin_cexp (location_t loc, tree arg0, tree type)
7567 tree realp, imagp, ifn;
7572 if (!validate_arg (arg0, COMPLEX_TYPE)
7573 || TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) != REAL_TYPE)
7577 /* Calculate the result when the argument is a constant. */
7578 if ((res = do_mpc_arg1 (arg0, type, mpc_exp)))
7582 rtype = TREE_TYPE (TREE_TYPE (arg0));
7584 /* In case we can figure out the real part of arg0 and it is constant zero
7586 if (!TARGET_C99_FUNCTIONS)
7588 ifn = mathfn_built_in (rtype, BUILT_IN_CEXPI);
7592 if ((realp = fold_unary_loc (loc, REALPART_EXPR, rtype, arg0))
7593 && real_zerop (realp))
7595 tree narg = fold_build1_loc (loc, IMAGPART_EXPR, rtype, arg0);
7596 return build_call_expr_loc (loc, ifn, 1, narg);
7599 /* In case we can easily decompose real and imaginary parts split cexp
7600 to exp (r) * cexpi (i). */
7601 if (flag_unsafe_math_optimizations
7604 tree rfn, rcall, icall;
7606 rfn = mathfn_built_in (rtype, BUILT_IN_EXP);
7610 imagp = fold_unary_loc (loc, IMAGPART_EXPR, rtype, arg0);
7614 icall = build_call_expr_loc (loc, ifn, 1, imagp);
7615 icall = builtin_save_expr (icall);
7616 rcall = build_call_expr_loc (loc, rfn, 1, realp);
7617 rcall = builtin_save_expr (rcall);
7618 return fold_build2_loc (loc, COMPLEX_EXPR, type,
7619 fold_build2_loc (loc, MULT_EXPR, rtype,
7621 fold_build1_loc (loc, REALPART_EXPR,
7623 fold_build2_loc (loc, MULT_EXPR, rtype,
7625 fold_build1_loc (loc, IMAGPART_EXPR,
7632 /* Fold function call to builtin trunc, truncf or truncl with argument ARG.
7633 Return NULL_TREE if no simplification can be made. */
7636 fold_builtin_trunc (location_t loc, tree fndecl, tree arg)
7638 if (!validate_arg (arg, REAL_TYPE))
7641 /* Optimize trunc of constant value. */
7642 if (TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
7644 REAL_VALUE_TYPE r, x;
7645 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7647 x = TREE_REAL_CST (arg);
7648 real_trunc (&r, TYPE_MODE (type), &x);
7649 return build_real (type, r);
7652 return fold_trunc_transparent_mathfn (loc, fndecl, arg);
7655 /* Fold function call to builtin floor, floorf or floorl with argument ARG.
7656 Return NULL_TREE if no simplification can be made. */
7659 fold_builtin_floor (location_t loc, tree fndecl, tree arg)
7661 if (!validate_arg (arg, REAL_TYPE))
7664 /* Optimize floor of constant value. */
7665 if (TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
7669 x = TREE_REAL_CST (arg);
7670 if (! REAL_VALUE_ISNAN (x) || ! flag_errno_math)
7672 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7675 real_floor (&r, TYPE_MODE (type), &x);
7676 return build_real (type, r);
7680 /* Fold floor (x) where x is nonnegative to trunc (x). */
7681 if (tree_expr_nonnegative_p (arg))
7683 tree truncfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_TRUNC);
7685 return build_call_expr_loc (loc, truncfn, 1, arg);
7688 return fold_trunc_transparent_mathfn (loc, fndecl, arg);
7691 /* Fold function call to builtin ceil, ceilf or ceill with argument ARG.
7692 Return NULL_TREE if no simplification can be made. */
7695 fold_builtin_ceil (location_t loc, tree fndecl, tree arg)
7697 if (!validate_arg (arg, REAL_TYPE))
7700 /* Optimize ceil of constant value. */
7701 if (TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
7705 x = TREE_REAL_CST (arg);
7706 if (! REAL_VALUE_ISNAN (x) || ! flag_errno_math)
7708 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7711 real_ceil (&r, TYPE_MODE (type), &x);
7712 return build_real (type, r);
7716 return fold_trunc_transparent_mathfn (loc, fndecl, arg);
7719 /* Fold function call to builtin round, roundf or roundl with argument ARG.
7720 Return NULL_TREE if no simplification can be made. */
7723 fold_builtin_round (location_t loc, tree fndecl, tree arg)
7725 if (!validate_arg (arg, REAL_TYPE))
7728 /* Optimize round of constant value. */
7729 if (TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
7733 x = TREE_REAL_CST (arg);
7734 if (! REAL_VALUE_ISNAN (x) || ! flag_errno_math)
7736 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7739 real_round (&r, TYPE_MODE (type), &x);
7740 return build_real (type, r);
7744 return fold_trunc_transparent_mathfn (loc, fndecl, arg);
7747 /* Fold function call to builtin lround, lroundf or lroundl (or the
7748 corresponding long long versions) and other rounding functions. ARG
7749 is the argument to the call. Return NULL_TREE if no simplification
7753 fold_builtin_int_roundingfn (location_t loc, tree fndecl, tree arg)
7755 if (!validate_arg (arg, REAL_TYPE))
7758 /* Optimize lround of constant value. */
7759 if (TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
7761 const REAL_VALUE_TYPE x = TREE_REAL_CST (arg);
7763 if (real_isfinite (&x))
7765 tree itype = TREE_TYPE (TREE_TYPE (fndecl));
7766 tree ftype = TREE_TYPE (arg);
7767 unsigned HOST_WIDE_INT lo2;
7768 HOST_WIDE_INT hi, lo;
7771 switch (DECL_FUNCTION_CODE (fndecl))
7773 CASE_FLT_FN (BUILT_IN_LFLOOR):
7774 CASE_FLT_FN (BUILT_IN_LLFLOOR):
7775 real_floor (&r, TYPE_MODE (ftype), &x);
7778 CASE_FLT_FN (BUILT_IN_LCEIL):
7779 CASE_FLT_FN (BUILT_IN_LLCEIL):
7780 real_ceil (&r, TYPE_MODE (ftype), &x);
7783 CASE_FLT_FN (BUILT_IN_LROUND):
7784 CASE_FLT_FN (BUILT_IN_LLROUND):
7785 real_round (&r, TYPE_MODE (ftype), &x);
7792 REAL_VALUE_TO_INT (&lo, &hi, r);
7793 if (!fit_double_type (lo, hi, &lo2, &hi, itype))
7794 return build_int_cst_wide (itype, lo2, hi);
7798 switch (DECL_FUNCTION_CODE (fndecl))
7800 CASE_FLT_FN (BUILT_IN_LFLOOR):
7801 CASE_FLT_FN (BUILT_IN_LLFLOOR):
7802 /* Fold lfloor (x) where x is nonnegative to FIX_TRUNC (x). */
7803 if (tree_expr_nonnegative_p (arg))
7804 return fold_build1_loc (loc, FIX_TRUNC_EXPR,
7805 TREE_TYPE (TREE_TYPE (fndecl)), arg);
7810 return fold_fixed_mathfn (loc, fndecl, arg);
7813 /* Fold function call to builtin ffs, clz, ctz, popcount and parity
7814 and their long and long long variants (i.e. ffsl and ffsll). ARG is
7815 the argument to the call. Return NULL_TREE if no simplification can
7819 fold_builtin_bitop (tree fndecl, tree arg)
7821 if (!validate_arg (arg, INTEGER_TYPE))
7824 /* Optimize for constant argument. */
7825 if (TREE_CODE (arg) == INTEGER_CST && !TREE_OVERFLOW (arg))
7827 HOST_WIDE_INT hi, width, result;
7828 unsigned HOST_WIDE_INT lo;
7831 type = TREE_TYPE (arg);
7832 width = TYPE_PRECISION (type);
7833 lo = TREE_INT_CST_LOW (arg);
7835 /* Clear all the bits that are beyond the type's precision. */
7836 if (width > HOST_BITS_PER_WIDE_INT)
7838 hi = TREE_INT_CST_HIGH (arg);
7839 if (width < 2 * HOST_BITS_PER_WIDE_INT)
7840 hi &= ~((HOST_WIDE_INT) (-1) >> (width - HOST_BITS_PER_WIDE_INT));
7845 if (width < HOST_BITS_PER_WIDE_INT)
7846 lo &= ~((unsigned HOST_WIDE_INT) (-1) << width);
7849 switch (DECL_FUNCTION_CODE (fndecl))
7851 CASE_INT_FN (BUILT_IN_FFS):
7853 result = exact_log2 (lo & -lo) + 1;
7855 result = HOST_BITS_PER_WIDE_INT + exact_log2 (hi & -hi) + 1;
7860 CASE_INT_FN (BUILT_IN_CLZ):
7862 result = width - floor_log2 (hi) - 1 - HOST_BITS_PER_WIDE_INT;
7864 result = width - floor_log2 (lo) - 1;
7865 else if (! CLZ_DEFINED_VALUE_AT_ZERO (TYPE_MODE (type), result))
7869 CASE_INT_FN (BUILT_IN_CTZ):
7871 result = exact_log2 (lo & -lo);
7873 result = HOST_BITS_PER_WIDE_INT + exact_log2 (hi & -hi);
7874 else if (! CTZ_DEFINED_VALUE_AT_ZERO (TYPE_MODE (type), result))
7878 CASE_INT_FN (BUILT_IN_POPCOUNT):
7881 result++, lo &= lo - 1;
7883 result++, hi &= hi - 1;
7886 CASE_INT_FN (BUILT_IN_PARITY):
7889 result++, lo &= lo - 1;
7891 result++, hi &= hi - 1;
7899 return build_int_cst (TREE_TYPE (TREE_TYPE (fndecl)), result);
7905 /* Fold function call to builtin_bswap and the long and long long
7906 variants. Return NULL_TREE if no simplification can be made. */
7908 fold_builtin_bswap (tree fndecl, tree arg)
7910 if (! validate_arg (arg, INTEGER_TYPE))
7913 /* Optimize constant value. */
7914 if (TREE_CODE (arg) == INTEGER_CST && !TREE_OVERFLOW (arg))
7916 HOST_WIDE_INT hi, width, r_hi = 0;
7917 unsigned HOST_WIDE_INT lo, r_lo = 0;
7920 type = TREE_TYPE (arg);
7921 width = TYPE_PRECISION (type);
7922 lo = TREE_INT_CST_LOW (arg);
7923 hi = TREE_INT_CST_HIGH (arg);
7925 switch (DECL_FUNCTION_CODE (fndecl))
7927 case BUILT_IN_BSWAP32:
7928 case BUILT_IN_BSWAP64:
7932 for (s = 0; s < width; s += 8)
7934 int d = width - s - 8;
7935 unsigned HOST_WIDE_INT byte;
7937 if (s < HOST_BITS_PER_WIDE_INT)
7938 byte = (lo >> s) & 0xff;
7940 byte = (hi >> (s - HOST_BITS_PER_WIDE_INT)) & 0xff;
7942 if (d < HOST_BITS_PER_WIDE_INT)
7945 r_hi |= byte << (d - HOST_BITS_PER_WIDE_INT);
7955 if (width < HOST_BITS_PER_WIDE_INT)
7956 return build_int_cst (TREE_TYPE (TREE_TYPE (fndecl)), r_lo);
7958 return build_int_cst_wide (TREE_TYPE (TREE_TYPE (fndecl)), r_lo, r_hi);
7964 /* A subroutine of fold_builtin to fold the various logarithmic
7965 functions. Return NULL_TREE if no simplification can me made.
7966 FUNC is the corresponding MPFR logarithm function. */
7969 fold_builtin_logarithm (location_t loc, tree fndecl, tree arg,
7970 int (*func)(mpfr_ptr, mpfr_srcptr, mp_rnd_t))
7972 if (validate_arg (arg, REAL_TYPE))
7974 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7976 const enum built_in_function fcode = builtin_mathfn_code (arg);
7978 /* Calculate the result when the argument is a constant. */
7979 if ((res = do_mpfr_arg1 (arg, type, func, &dconst0, NULL, false)))
7982 /* Special case, optimize logN(expN(x)) = x. */
7983 if (flag_unsafe_math_optimizations
7984 && ((func == mpfr_log
7985 && (fcode == BUILT_IN_EXP
7986 || fcode == BUILT_IN_EXPF
7987 || fcode == BUILT_IN_EXPL))
7988 || (func == mpfr_log2
7989 && (fcode == BUILT_IN_EXP2
7990 || fcode == BUILT_IN_EXP2F
7991 || fcode == BUILT_IN_EXP2L))
7992 || (func == mpfr_log10 && (BUILTIN_EXP10_P (fcode)))))
7993 return fold_convert_loc (loc, type, CALL_EXPR_ARG (arg, 0));
7995 /* Optimize logN(func()) for various exponential functions. We
7996 want to determine the value "x" and the power "exponent" in
7997 order to transform logN(x**exponent) into exponent*logN(x). */
7998 if (flag_unsafe_math_optimizations)
8000 tree exponent = 0, x = 0;
8004 CASE_FLT_FN (BUILT_IN_EXP):
8005 /* Prepare to do logN(exp(exponent) -> exponent*logN(e). */
8006 x = build_real (type, real_value_truncate (TYPE_MODE (type),
8008 exponent = CALL_EXPR_ARG (arg, 0);
8010 CASE_FLT_FN (BUILT_IN_EXP2):
8011 /* Prepare to do logN(exp2(exponent) -> exponent*logN(2). */
8012 x = build_real (type, dconst2);
8013 exponent = CALL_EXPR_ARG (arg, 0);
8015 CASE_FLT_FN (BUILT_IN_EXP10):
8016 CASE_FLT_FN (BUILT_IN_POW10):
8017 /* Prepare to do logN(exp10(exponent) -> exponent*logN(10). */
8019 REAL_VALUE_TYPE dconst10;
8020 real_from_integer (&dconst10, VOIDmode, 10, 0, 0);
8021 x = build_real (type, dconst10);
8023 exponent = CALL_EXPR_ARG (arg, 0);
8025 CASE_FLT_FN (BUILT_IN_SQRT):
8026 /* Prepare to do logN(sqrt(x) -> 0.5*logN(x). */
8027 x = CALL_EXPR_ARG (arg, 0);
8028 exponent = build_real (type, dconsthalf);
8030 CASE_FLT_FN (BUILT_IN_CBRT):
8031 /* Prepare to do logN(cbrt(x) -> (1/3)*logN(x). */
8032 x = CALL_EXPR_ARG (arg, 0);
8033 exponent = build_real (type, real_value_truncate (TYPE_MODE (type),
8036 CASE_FLT_FN (BUILT_IN_POW):
8037 /* Prepare to do logN(pow(x,exponent) -> exponent*logN(x). */
8038 x = CALL_EXPR_ARG (arg, 0);
8039 exponent = CALL_EXPR_ARG (arg, 1);
8045 /* Now perform the optimization. */
8048 tree logfn = build_call_expr_loc (loc, fndecl, 1, x);
8049 return fold_build2_loc (loc, MULT_EXPR, type, exponent, logfn);
8057 /* Fold a builtin function call to hypot, hypotf, or hypotl. Return
8058 NULL_TREE if no simplification can be made. */
8061 fold_builtin_hypot (location_t loc, tree fndecl,
8062 tree arg0, tree arg1, tree type)
8064 tree res, narg0, narg1;
8066 if (!validate_arg (arg0, REAL_TYPE)
8067 || !validate_arg (arg1, REAL_TYPE))
8070 /* Calculate the result when the argument is a constant. */
8071 if ((res = do_mpfr_arg2 (arg0, arg1, type, mpfr_hypot)))
8074 /* If either argument to hypot has a negate or abs, strip that off.
8075 E.g. hypot(-x,fabs(y)) -> hypot(x,y). */
8076 narg0 = fold_strip_sign_ops (arg0);
8077 narg1 = fold_strip_sign_ops (arg1);
8080 return build_call_expr_loc (loc, fndecl, 2, narg0 ? narg0 : arg0,
8081 narg1 ? narg1 : arg1);
8084 /* If either argument is zero, hypot is fabs of the other. */
8085 if (real_zerop (arg0))
8086 return fold_build1_loc (loc, ABS_EXPR, type, arg1);
8087 else if (real_zerop (arg1))
8088 return fold_build1_loc (loc, ABS_EXPR, type, arg0);
8090 /* hypot(x,x) -> fabs(x)*sqrt(2). */
8091 if (flag_unsafe_math_optimizations
8092 && operand_equal_p (arg0, arg1, OEP_PURE_SAME))
8094 const REAL_VALUE_TYPE sqrt2_trunc
8095 = real_value_truncate (TYPE_MODE (type), dconst_sqrt2 ());
8096 return fold_build2_loc (loc, MULT_EXPR, type,
8097 fold_build1_loc (loc, ABS_EXPR, type, arg0),
8098 build_real (type, sqrt2_trunc));
8105 /* Fold a builtin function call to pow, powf, or powl. Return
8106 NULL_TREE if no simplification can be made. */
8108 fold_builtin_pow (location_t loc, tree fndecl, tree arg0, tree arg1, tree type)
8112 if (!validate_arg (arg0, REAL_TYPE)
8113 || !validate_arg (arg1, REAL_TYPE))
8116 /* Calculate the result when the argument is a constant. */
8117 if ((res = do_mpfr_arg2 (arg0, arg1, type, mpfr_pow)))
8120 /* Optimize pow(1.0,y) = 1.0. */
8121 if (real_onep (arg0))
8122 return omit_one_operand_loc (loc, type, build_real (type, dconst1), arg1);
8124 if (TREE_CODE (arg1) == REAL_CST
8125 && !TREE_OVERFLOW (arg1))
8127 REAL_VALUE_TYPE cint;
8131 c = TREE_REAL_CST (arg1);
8133 /* Optimize pow(x,0.0) = 1.0. */
8134 if (REAL_VALUES_EQUAL (c, dconst0))
8135 return omit_one_operand_loc (loc, type, build_real (type, dconst1),
8138 /* Optimize pow(x,1.0) = x. */
8139 if (REAL_VALUES_EQUAL (c, dconst1))
8142 /* Optimize pow(x,-1.0) = 1.0/x. */
8143 if (REAL_VALUES_EQUAL (c, dconstm1))
8144 return fold_build2_loc (loc, RDIV_EXPR, type,
8145 build_real (type, dconst1), arg0);
8147 /* Optimize pow(x,0.5) = sqrt(x). */
8148 if (flag_unsafe_math_optimizations
8149 && REAL_VALUES_EQUAL (c, dconsthalf))
8151 tree sqrtfn = mathfn_built_in (type, BUILT_IN_SQRT);
8153 if (sqrtfn != NULL_TREE)
8154 return build_call_expr_loc (loc, sqrtfn, 1, arg0);
8157 /* Optimize pow(x,1.0/3.0) = cbrt(x). */
8158 if (flag_unsafe_math_optimizations)
8160 const REAL_VALUE_TYPE dconstroot
8161 = real_value_truncate (TYPE_MODE (type), dconst_third ());
8163 if (REAL_VALUES_EQUAL (c, dconstroot))
8165 tree cbrtfn = mathfn_built_in (type, BUILT_IN_CBRT);
8166 if (cbrtfn != NULL_TREE)
8167 return build_call_expr_loc (loc, cbrtfn, 1, arg0);
8171 /* Check for an integer exponent. */
8172 n = real_to_integer (&c);
8173 real_from_integer (&cint, VOIDmode, n, n < 0 ? -1 : 0, 0);
8174 if (real_identical (&c, &cint))
8176 /* Attempt to evaluate pow at compile-time, unless this should
8177 raise an exception. */
8178 if (TREE_CODE (arg0) == REAL_CST
8179 && !TREE_OVERFLOW (arg0)
8181 || (!flag_trapping_math && !flag_errno_math)
8182 || !REAL_VALUES_EQUAL (TREE_REAL_CST (arg0), dconst0)))
8187 x = TREE_REAL_CST (arg0);
8188 inexact = real_powi (&x, TYPE_MODE (type), &x, n);
8189 if (flag_unsafe_math_optimizations || !inexact)
8190 return build_real (type, x);
8193 /* Strip sign ops from even integer powers. */
8194 if ((n & 1) == 0 && flag_unsafe_math_optimizations)
8196 tree narg0 = fold_strip_sign_ops (arg0);
8198 return build_call_expr_loc (loc, fndecl, 2, narg0, arg1);
8203 if (flag_unsafe_math_optimizations)
8205 const enum built_in_function fcode = builtin_mathfn_code (arg0);
8207 /* Optimize pow(expN(x),y) = expN(x*y). */
8208 if (BUILTIN_EXPONENT_P (fcode))
8210 tree expfn = TREE_OPERAND (CALL_EXPR_FN (arg0), 0);
8211 tree arg = CALL_EXPR_ARG (arg0, 0);
8212 arg = fold_build2_loc (loc, MULT_EXPR, type, arg, arg1);
8213 return build_call_expr_loc (loc, expfn, 1, arg);
8216 /* Optimize pow(sqrt(x),y) = pow(x,y*0.5). */
8217 if (BUILTIN_SQRT_P (fcode))
8219 tree narg0 = CALL_EXPR_ARG (arg0, 0);
8220 tree narg1 = fold_build2_loc (loc, MULT_EXPR, type, arg1,
8221 build_real (type, dconsthalf));
8222 return build_call_expr_loc (loc, fndecl, 2, narg0, narg1);
8225 /* Optimize pow(cbrt(x),y) = pow(x,y/3) iff x is nonnegative. */
8226 if (BUILTIN_CBRT_P (fcode))
8228 tree arg = CALL_EXPR_ARG (arg0, 0);
8229 if (tree_expr_nonnegative_p (arg))
8231 const REAL_VALUE_TYPE dconstroot
8232 = real_value_truncate (TYPE_MODE (type), dconst_third ());
8233 tree narg1 = fold_build2_loc (loc, MULT_EXPR, type, arg1,
8234 build_real (type, dconstroot));
8235 return build_call_expr_loc (loc, fndecl, 2, arg, narg1);
8239 /* Optimize pow(pow(x,y),z) = pow(x,y*z) iff x is nonnegative. */
8240 if (fcode == BUILT_IN_POW
8241 || fcode == BUILT_IN_POWF
8242 || fcode == BUILT_IN_POWL)
8244 tree arg00 = CALL_EXPR_ARG (arg0, 0);
8245 if (tree_expr_nonnegative_p (arg00))
8247 tree arg01 = CALL_EXPR_ARG (arg0, 1);
8248 tree narg1 = fold_build2_loc (loc, MULT_EXPR, type, arg01, arg1);
8249 return build_call_expr_loc (loc, fndecl, 2, arg00, narg1);
8257 /* Fold a builtin function call to powi, powif, or powil with argument ARG.
8258 Return NULL_TREE if no simplification can be made. */
8260 fold_builtin_powi (location_t loc, tree fndecl ATTRIBUTE_UNUSED,
8261 tree arg0, tree arg1, tree type)
8263 if (!validate_arg (arg0, REAL_TYPE)
8264 || !validate_arg (arg1, INTEGER_TYPE))
8267 /* Optimize pow(1.0,y) = 1.0. */
8268 if (real_onep (arg0))
8269 return omit_one_operand_loc (loc, type, build_real (type, dconst1), arg1);
8271 if (host_integerp (arg1, 0))
8273 HOST_WIDE_INT c = TREE_INT_CST_LOW (arg1);
8275 /* Evaluate powi at compile-time. */
8276 if (TREE_CODE (arg0) == REAL_CST
8277 && !TREE_OVERFLOW (arg0))
8280 x = TREE_REAL_CST (arg0);
8281 real_powi (&x, TYPE_MODE (type), &x, c);
8282 return build_real (type, x);
8285 /* Optimize pow(x,0) = 1.0. */
8287 return omit_one_operand_loc (loc, type, build_real (type, dconst1),
8290 /* Optimize pow(x,1) = x. */
8294 /* Optimize pow(x,-1) = 1.0/x. */
8296 return fold_build2_loc (loc, RDIV_EXPR, type,
8297 build_real (type, dconst1), arg0);
8303 /* A subroutine of fold_builtin to fold the various exponent
8304 functions. Return NULL_TREE if no simplification can be made.
8305 FUNC is the corresponding MPFR exponent function. */
8308 fold_builtin_exponent (location_t loc, tree fndecl, tree arg,
8309 int (*func)(mpfr_ptr, mpfr_srcptr, mp_rnd_t))
8311 if (validate_arg (arg, REAL_TYPE))
8313 tree type = TREE_TYPE (TREE_TYPE (fndecl));
8316 /* Calculate the result when the argument is a constant. */
8317 if ((res = do_mpfr_arg1 (arg, type, func, NULL, NULL, 0)))
8320 /* Optimize expN(logN(x)) = x. */
8321 if (flag_unsafe_math_optimizations)
8323 const enum built_in_function fcode = builtin_mathfn_code (arg);
8325 if ((func == mpfr_exp
8326 && (fcode == BUILT_IN_LOG
8327 || fcode == BUILT_IN_LOGF
8328 || fcode == BUILT_IN_LOGL))
8329 || (func == mpfr_exp2
8330 && (fcode == BUILT_IN_LOG2
8331 || fcode == BUILT_IN_LOG2F
8332 || fcode == BUILT_IN_LOG2L))
8333 || (func == mpfr_exp10
8334 && (fcode == BUILT_IN_LOG10
8335 || fcode == BUILT_IN_LOG10F
8336 || fcode == BUILT_IN_LOG10L)))
8337 return fold_convert_loc (loc, type, CALL_EXPR_ARG (arg, 0));
8344 /* Return true if VAR is a VAR_DECL or a component thereof. */
8347 var_decl_component_p (tree var)
8350 while (handled_component_p (inner))
8351 inner = TREE_OPERAND (inner, 0);
8352 return SSA_VAR_P (inner);
8355 /* Fold function call to builtin memset. Return
8356 NULL_TREE if no simplification can be made. */
8359 fold_builtin_memset (location_t loc, tree dest, tree c, tree len,
8360 tree type, bool ignore)
8362 tree var, ret, etype;
8363 unsigned HOST_WIDE_INT length, cval;
8365 if (! validate_arg (dest, POINTER_TYPE)
8366 || ! validate_arg (c, INTEGER_TYPE)
8367 || ! validate_arg (len, INTEGER_TYPE))
8370 if (! host_integerp (len, 1))
8373 /* If the LEN parameter is zero, return DEST. */
8374 if (integer_zerop (len))
8375 return omit_one_operand_loc (loc, type, dest, c);
8377 if (! host_integerp (c, 1) || TREE_SIDE_EFFECTS (dest))
8382 if (TREE_CODE (var) != ADDR_EXPR)
8385 var = TREE_OPERAND (var, 0);
8386 if (TREE_THIS_VOLATILE (var))
8389 etype = TREE_TYPE (var);
8390 if (TREE_CODE (etype) == ARRAY_TYPE)
8391 etype = TREE_TYPE (etype);
8393 if (!INTEGRAL_TYPE_P (etype)
8394 && !POINTER_TYPE_P (etype))
8397 if (! var_decl_component_p (var))
8400 length = tree_low_cst (len, 1);
8401 if (GET_MODE_SIZE (TYPE_MODE (etype)) != length
8402 || get_pointer_alignment (dest, BIGGEST_ALIGNMENT) / BITS_PER_UNIT
8406 if (length > HOST_BITS_PER_WIDE_INT / BITS_PER_UNIT)
8409 if (integer_zerop (c))
8413 if (CHAR_BIT != 8 || BITS_PER_UNIT != 8 || HOST_BITS_PER_WIDE_INT > 64)
8416 cval = tree_low_cst (c, 1);
8420 cval |= (cval << 31) << 1;
8423 ret = build_int_cst_type (etype, cval);
8424 var = build_fold_indirect_ref_loc (loc,
8425 fold_convert_loc (loc,
8426 build_pointer_type (etype),
8428 ret = build2 (MODIFY_EXPR, etype, var, ret);
8432 return omit_one_operand_loc (loc, type, dest, ret);
8435 /* Fold function call to builtin memset. Return
8436 NULL_TREE if no simplification can be made. */
8439 fold_builtin_bzero (location_t loc, tree dest, tree size, bool ignore)
8441 if (! validate_arg (dest, POINTER_TYPE)
8442 || ! validate_arg (size, INTEGER_TYPE))
8448 /* New argument list transforming bzero(ptr x, int y) to
8449 memset(ptr x, int 0, size_t y). This is done this way
8450 so that if it isn't expanded inline, we fallback to
8451 calling bzero instead of memset. */
8453 return fold_builtin_memset (loc, dest, integer_zero_node,
8454 fold_convert_loc (loc, sizetype, size),
8455 void_type_node, ignore);
8458 /* Fold function call to builtin mem{{,p}cpy,move}. Return
8459 NULL_TREE if no simplification can be made.
8460 If ENDP is 0, return DEST (like memcpy).
8461 If ENDP is 1, return DEST+LEN (like mempcpy).
8462 If ENDP is 2, return DEST+LEN-1 (like stpcpy).
8463 If ENDP is 3, return DEST, additionally *SRC and *DEST may overlap
8467 fold_builtin_memory_op (location_t loc, tree dest, tree src,
8468 tree len, tree type, bool ignore, int endp)
8470 tree destvar, srcvar, expr;
8472 if (! validate_arg (dest, POINTER_TYPE)
8473 || ! validate_arg (src, POINTER_TYPE)
8474 || ! validate_arg (len, INTEGER_TYPE))
8477 /* If the LEN parameter is zero, return DEST. */
8478 if (integer_zerop (len))
8479 return omit_one_operand_loc (loc, type, dest, src);
8481 /* If SRC and DEST are the same (and not volatile), return
8482 DEST{,+LEN,+LEN-1}. */
8483 if (operand_equal_p (src, dest, 0))
8487 tree srctype, desttype;
8488 int src_align, dest_align;
8492 src_align = get_pointer_alignment (src, BIGGEST_ALIGNMENT);
8493 dest_align = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
8495 /* Both DEST and SRC must be pointer types.
8496 ??? This is what old code did. Is the testing for pointer types
8499 If either SRC is readonly or length is 1, we can use memcpy. */
8500 if (!dest_align || !src_align)
8502 if (readonly_data_expr (src)
8503 || (host_integerp (len, 1)
8504 && (MIN (src_align, dest_align) / BITS_PER_UNIT
8505 >= tree_low_cst (len, 1))))
8507 tree fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
8510 return build_call_expr_loc (loc, fn, 3, dest, src, len);
8513 /* If *src and *dest can't overlap, optimize into memcpy as well. */
8514 srcvar = build_fold_indirect_ref_loc (loc, src);
8515 destvar = build_fold_indirect_ref_loc (loc, dest);
8517 && !TREE_THIS_VOLATILE (srcvar)
8519 && !TREE_THIS_VOLATILE (destvar))
8521 tree src_base, dest_base, fn;
8522 HOST_WIDE_INT src_offset = 0, dest_offset = 0;
8523 HOST_WIDE_INT size = -1;
8524 HOST_WIDE_INT maxsize = -1;
8527 if (handled_component_p (src_base))
8528 src_base = get_ref_base_and_extent (src_base, &src_offset,
8530 dest_base = destvar;
8531 if (handled_component_p (dest_base))
8532 dest_base = get_ref_base_and_extent (dest_base, &dest_offset,
8534 if (host_integerp (len, 1))
8536 maxsize = tree_low_cst (len, 1);
8538 > INTTYPE_MAXIMUM (HOST_WIDE_INT) / BITS_PER_UNIT)
8541 maxsize *= BITS_PER_UNIT;
8545 if (SSA_VAR_P (src_base)
8546 && SSA_VAR_P (dest_base))
8548 if (operand_equal_p (src_base, dest_base, 0)
8549 && ranges_overlap_p (src_offset, maxsize,
8550 dest_offset, maxsize))
8553 else if (TREE_CODE (src_base) == INDIRECT_REF
8554 && TREE_CODE (dest_base) == INDIRECT_REF)
8556 if (! operand_equal_p (TREE_OPERAND (src_base, 0),
8557 TREE_OPERAND (dest_base, 0), 0)
8558 || ranges_overlap_p (src_offset, maxsize,
8559 dest_offset, maxsize))
8565 fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
8568 return build_call_expr_loc (loc, fn, 3, dest, src, len);
8573 if (!host_integerp (len, 0))
8576 This logic lose for arguments like (type *)malloc (sizeof (type)),
8577 since we strip the casts of up to VOID return value from malloc.
8578 Perhaps we ought to inherit type from non-VOID argument here? */
8581 /* As we fold (void *)(p + CST) to (void *)p + CST undo this here. */
8582 if (TREE_CODE (src) == POINTER_PLUS_EXPR)
8584 tree tem = TREE_OPERAND (src, 0);
8586 if (tem != TREE_OPERAND (src, 0))
8587 src = build1 (NOP_EXPR, TREE_TYPE (tem), src);
8589 if (TREE_CODE (dest) == POINTER_PLUS_EXPR)
8591 tree tem = TREE_OPERAND (dest, 0);
8593 if (tem != TREE_OPERAND (dest, 0))
8594 dest = build1 (NOP_EXPR, TREE_TYPE (tem), dest);
8596 srctype = TREE_TYPE (TREE_TYPE (src));
8598 && TREE_CODE (srctype) == ARRAY_TYPE
8599 && !tree_int_cst_equal (TYPE_SIZE_UNIT (srctype), len))
8601 srctype = TREE_TYPE (srctype);
8603 src = build1 (NOP_EXPR, build_pointer_type (srctype), src);
8605 desttype = TREE_TYPE (TREE_TYPE (dest));
8607 && TREE_CODE (desttype) == ARRAY_TYPE
8608 && !tree_int_cst_equal (TYPE_SIZE_UNIT (desttype), len))
8610 desttype = TREE_TYPE (desttype);
8612 dest = build1 (NOP_EXPR, build_pointer_type (desttype), dest);
8614 if (!srctype || !desttype
8615 || !TYPE_SIZE_UNIT (srctype)
8616 || !TYPE_SIZE_UNIT (desttype)
8617 || TREE_CODE (TYPE_SIZE_UNIT (srctype)) != INTEGER_CST
8618 || TREE_CODE (TYPE_SIZE_UNIT (desttype)) != INTEGER_CST
8619 || TYPE_VOLATILE (srctype)
8620 || TYPE_VOLATILE (desttype))
8623 src_align = get_pointer_alignment (src, BIGGEST_ALIGNMENT);
8624 dest_align = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
8625 if (dest_align < (int) TYPE_ALIGN (desttype)
8626 || src_align < (int) TYPE_ALIGN (srctype))
8630 dest = builtin_save_expr (dest);
8633 if (tree_int_cst_equal (TYPE_SIZE_UNIT (srctype), len))
8635 srcvar = build_fold_indirect_ref_loc (loc, src);
8636 if (TREE_THIS_VOLATILE (srcvar))
8638 else if (!tree_int_cst_equal (tree_expr_size (srcvar), len))
8640 /* With memcpy, it is possible to bypass aliasing rules, so without
8641 this check i.e. execute/20060930-2.c would be misoptimized,
8642 because it use conflicting alias set to hold argument for the
8643 memcpy call. This check is probably unnecessary with
8644 -fno-strict-aliasing. Similarly for destvar. See also
8646 else if (!var_decl_component_p (srcvar))
8650 destvar = NULL_TREE;
8651 if (tree_int_cst_equal (TYPE_SIZE_UNIT (desttype), len))
8653 destvar = build_fold_indirect_ref_loc (loc, dest);
8654 if (TREE_THIS_VOLATILE (destvar))
8656 else if (!tree_int_cst_equal (tree_expr_size (destvar), len))
8657 destvar = NULL_TREE;
8658 else if (!var_decl_component_p (destvar))
8659 destvar = NULL_TREE;
8662 if (srcvar == NULL_TREE && destvar == NULL_TREE)
8665 if (srcvar == NULL_TREE)
8668 if (TREE_ADDRESSABLE (TREE_TYPE (destvar)))
8671 srctype = build_qualified_type (desttype, 0);
8672 if (src_align < (int) TYPE_ALIGN (srctype))
8674 if (AGGREGATE_TYPE_P (srctype)
8675 || SLOW_UNALIGNED_ACCESS (TYPE_MODE (srctype), src_align))
8678 srctype = build_variant_type_copy (srctype);
8679 TYPE_ALIGN (srctype) = src_align;
8680 TYPE_USER_ALIGN (srctype) = 1;
8681 TYPE_PACKED (srctype) = 1;
8683 srcptype = build_pointer_type_for_mode (srctype, ptr_mode, true);
8684 src = fold_convert_loc (loc, srcptype, src);
8685 srcvar = build_fold_indirect_ref_loc (loc, src);
8687 else if (destvar == NULL_TREE)
8690 if (TREE_ADDRESSABLE (TREE_TYPE (srcvar)))
8693 desttype = build_qualified_type (srctype, 0);
8694 if (dest_align < (int) TYPE_ALIGN (desttype))
8696 if (AGGREGATE_TYPE_P (desttype)
8697 || SLOW_UNALIGNED_ACCESS (TYPE_MODE (desttype), dest_align))
8700 desttype = build_variant_type_copy (desttype);
8701 TYPE_ALIGN (desttype) = dest_align;
8702 TYPE_USER_ALIGN (desttype) = 1;
8703 TYPE_PACKED (desttype) = 1;
8705 destptype = build_pointer_type_for_mode (desttype, ptr_mode, true);
8706 dest = fold_convert_loc (loc, destptype, dest);
8707 destvar = build_fold_indirect_ref_loc (loc, dest);
8710 if (srctype == desttype
8711 || (gimple_in_ssa_p (cfun)
8712 && useless_type_conversion_p (desttype, srctype)))
8714 else if ((INTEGRAL_TYPE_P (TREE_TYPE (srcvar))
8715 || POINTER_TYPE_P (TREE_TYPE (srcvar)))
8716 && (INTEGRAL_TYPE_P (TREE_TYPE (destvar))
8717 || POINTER_TYPE_P (TREE_TYPE (destvar))))
8718 expr = fold_convert_loc (loc, TREE_TYPE (destvar), srcvar);
8720 expr = fold_build1_loc (loc, VIEW_CONVERT_EXPR,
8721 TREE_TYPE (destvar), srcvar);
8722 expr = build2 (MODIFY_EXPR, TREE_TYPE (destvar), destvar, expr);
8728 if (endp == 0 || endp == 3)
8729 return omit_one_operand_loc (loc, type, dest, expr);
8735 len = fold_build2_loc (loc, MINUS_EXPR, TREE_TYPE (len), len,
8738 len = fold_convert_loc (loc, sizetype, len);
8739 dest = fold_build2_loc (loc, POINTER_PLUS_EXPR, TREE_TYPE (dest), dest, len);
8740 dest = fold_convert_loc (loc, type, dest);
8742 dest = omit_one_operand_loc (loc, type, dest, expr);
8746 /* Fold function call to builtin strcpy with arguments DEST and SRC.
8747 If LEN is not NULL, it represents the length of the string to be
8748 copied. Return NULL_TREE if no simplification can be made. */
8751 fold_builtin_strcpy (location_t loc, tree fndecl, tree dest, tree src, tree len)
8755 if (!validate_arg (dest, POINTER_TYPE)
8756 || !validate_arg (src, POINTER_TYPE))
8759 /* If SRC and DEST are the same (and not volatile), return DEST. */
8760 if (operand_equal_p (src, dest, 0))
8761 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest);
8763 if (optimize_function_for_size_p (cfun))
8766 fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
8772 len = c_strlen (src, 1);
8773 if (! len || TREE_SIDE_EFFECTS (len))
8777 len = size_binop_loc (loc, PLUS_EXPR, len, ssize_int (1));
8778 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)),
8779 build_call_expr_loc (loc, fn, 3, dest, src, len));
8782 /* Fold function call to builtin stpcpy with arguments DEST and SRC.
8783 Return NULL_TREE if no simplification can be made. */
8786 fold_builtin_stpcpy (location_t loc, tree fndecl, tree dest, tree src)
8788 tree fn, len, lenp1, call, type;
8790 if (!validate_arg (dest, POINTER_TYPE)
8791 || !validate_arg (src, POINTER_TYPE))
8794 len = c_strlen (src, 1);
8796 || TREE_CODE (len) != INTEGER_CST)
8799 if (optimize_function_for_size_p (cfun)
8800 /* If length is zero it's small enough. */
8801 && !integer_zerop (len))
8804 fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
8808 lenp1 = size_binop_loc (loc, PLUS_EXPR, len, ssize_int (1));
8809 /* We use dest twice in building our expression. Save it from
8810 multiple expansions. */
8811 dest = builtin_save_expr (dest);
8812 call = build_call_expr_loc (loc, fn, 3, dest, src, lenp1);
8814 type = TREE_TYPE (TREE_TYPE (fndecl));
8815 len = fold_convert_loc (loc, sizetype, len);
8816 dest = fold_build2_loc (loc, POINTER_PLUS_EXPR, TREE_TYPE (dest), dest, len);
8817 dest = fold_convert_loc (loc, type, dest);
8818 dest = omit_one_operand_loc (loc, type, dest, call);
8822 /* Fold function call to builtin strncpy with arguments DEST, SRC, and LEN.
8823 If SLEN is not NULL, it represents the length of the source string.
8824 Return NULL_TREE if no simplification can be made. */
8827 fold_builtin_strncpy (location_t loc, tree fndecl, tree dest,
8828 tree src, tree len, tree slen)
8832 if (!validate_arg (dest, POINTER_TYPE)
8833 || !validate_arg (src, POINTER_TYPE)
8834 || !validate_arg (len, INTEGER_TYPE))
8837 /* If the LEN parameter is zero, return DEST. */
8838 if (integer_zerop (len))
8839 return omit_one_operand_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest, src);
8841 /* We can't compare slen with len as constants below if len is not a
8843 if (len == 0 || TREE_CODE (len) != INTEGER_CST)
8847 slen = c_strlen (src, 1);
8849 /* Now, we must be passed a constant src ptr parameter. */
8850 if (slen == 0 || TREE_CODE (slen) != INTEGER_CST)
8853 slen = size_binop_loc (loc, PLUS_EXPR, slen, ssize_int (1));
8855 /* We do not support simplification of this case, though we do
8856 support it when expanding trees into RTL. */
8857 /* FIXME: generate a call to __builtin_memset. */
8858 if (tree_int_cst_lt (slen, len))
8861 /* OK transform into builtin memcpy. */
8862 fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
8865 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)),
8866 build_call_expr_loc (loc, fn, 3, dest, src, len));
8869 /* Fold function call to builtin memchr. ARG1, ARG2 and LEN are the
8870 arguments to the call, and TYPE is its return type.
8871 Return NULL_TREE if no simplification can be made. */
8874 fold_builtin_memchr (location_t loc, tree arg1, tree arg2, tree len, tree type)
8876 if (!validate_arg (arg1, POINTER_TYPE)
8877 || !validate_arg (arg2, INTEGER_TYPE)
8878 || !validate_arg (len, INTEGER_TYPE))
8884 if (TREE_CODE (arg2) != INTEGER_CST
8885 || !host_integerp (len, 1))
8888 p1 = c_getstr (arg1);
8889 if (p1 && compare_tree_int (len, strlen (p1) + 1) <= 0)
8895 if (target_char_cast (arg2, &c))
8898 r = (char *) memchr (p1, c, tree_low_cst (len, 1));
8901 return build_int_cst (TREE_TYPE (arg1), 0);
8903 tem = fold_build2_loc (loc, POINTER_PLUS_EXPR, TREE_TYPE (arg1), arg1,
8905 return fold_convert_loc (loc, type, tem);
8911 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
8912 Return NULL_TREE if no simplification can be made. */
8915 fold_builtin_memcmp (location_t loc, tree arg1, tree arg2, tree len)
8917 const char *p1, *p2;
8919 if (!validate_arg (arg1, POINTER_TYPE)
8920 || !validate_arg (arg2, POINTER_TYPE)
8921 || !validate_arg (len, INTEGER_TYPE))
8924 /* If the LEN parameter is zero, return zero. */
8925 if (integer_zerop (len))
8926 return omit_two_operands_loc (loc, integer_type_node, integer_zero_node,
8929 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8930 if (operand_equal_p (arg1, arg2, 0))
8931 return omit_one_operand_loc (loc, integer_type_node, integer_zero_node, len);
8933 p1 = c_getstr (arg1);
8934 p2 = c_getstr (arg2);
8936 /* If all arguments are constant, and the value of len is not greater
8937 than the lengths of arg1 and arg2, evaluate at compile-time. */
8938 if (host_integerp (len, 1) && p1 && p2
8939 && compare_tree_int (len, strlen (p1) + 1) <= 0
8940 && compare_tree_int (len, strlen (p2) + 1) <= 0)
8942 const int r = memcmp (p1, p2, tree_low_cst (len, 1));
8945 return integer_one_node;
8947 return integer_minus_one_node;
8949 return integer_zero_node;
8952 /* If len parameter is one, return an expression corresponding to
8953 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
8954 if (host_integerp (len, 1) && tree_low_cst (len, 1) == 1)
8956 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
8957 tree cst_uchar_ptr_node
8958 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
8961 = fold_convert_loc (loc, integer_type_node,
8962 build1 (INDIRECT_REF, cst_uchar_node,
8963 fold_convert_loc (loc,
8967 = fold_convert_loc (loc, integer_type_node,
8968 build1 (INDIRECT_REF, cst_uchar_node,
8969 fold_convert_loc (loc,
8972 return fold_build2_loc (loc, MINUS_EXPR, integer_type_node, ind1, ind2);
8978 /* Fold function call to builtin strcmp with arguments ARG1 and ARG2.
8979 Return NULL_TREE if no simplification can be made. */
8982 fold_builtin_strcmp (location_t loc, tree arg1, tree arg2)
8984 const char *p1, *p2;
8986 if (!validate_arg (arg1, POINTER_TYPE)
8987 || !validate_arg (arg2, POINTER_TYPE))
8990 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8991 if (operand_equal_p (arg1, arg2, 0))
8992 return integer_zero_node;
8994 p1 = c_getstr (arg1);
8995 p2 = c_getstr (arg2);
8999 const int i = strcmp (p1, p2);
9001 return integer_minus_one_node;
9003 return integer_one_node;
9005 return integer_zero_node;
9008 /* If the second arg is "", return *(const unsigned char*)arg1. */
9009 if (p2 && *p2 == '\0')
9011 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
9012 tree cst_uchar_ptr_node
9013 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
9015 return fold_convert_loc (loc, integer_type_node,
9016 build1 (INDIRECT_REF, cst_uchar_node,
9017 fold_convert_loc (loc,
9022 /* If the first arg is "", return -*(const unsigned char*)arg2. */
9023 if (p1 && *p1 == '\0')
9025 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
9026 tree cst_uchar_ptr_node
9027 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
9030 = fold_convert_loc (loc, integer_type_node,
9031 build1 (INDIRECT_REF, cst_uchar_node,
9032 fold_convert_loc (loc,
9035 return fold_build1_loc (loc, NEGATE_EXPR, integer_type_node, temp);
9041 /* Fold function call to builtin strncmp with arguments ARG1, ARG2, and LEN.
9042 Return NULL_TREE if no simplification can be made. */
9045 fold_builtin_strncmp (location_t loc, tree arg1, tree arg2, tree len)
9047 const char *p1, *p2;
9049 if (!validate_arg (arg1, POINTER_TYPE)
9050 || !validate_arg (arg2, POINTER_TYPE)
9051 || !validate_arg (len, INTEGER_TYPE))
9054 /* If the LEN parameter is zero, return zero. */
9055 if (integer_zerop (len))
9056 return omit_two_operands_loc (loc, integer_type_node, integer_zero_node,
9059 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
9060 if (operand_equal_p (arg1, arg2, 0))
9061 return omit_one_operand_loc (loc, integer_type_node, integer_zero_node, len);
9063 p1 = c_getstr (arg1);
9064 p2 = c_getstr (arg2);
9066 if (host_integerp (len, 1) && p1 && p2)
9068 const int i = strncmp (p1, p2, tree_low_cst (len, 1));
9070 return integer_one_node;
9072 return integer_minus_one_node;
9074 return integer_zero_node;
9077 /* If the second arg is "", and the length is greater than zero,
9078 return *(const unsigned char*)arg1. */
9079 if (p2 && *p2 == '\0'
9080 && TREE_CODE (len) == INTEGER_CST
9081 && tree_int_cst_sgn (len) == 1)
9083 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
9084 tree cst_uchar_ptr_node
9085 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
9087 return fold_convert_loc (loc, integer_type_node,
9088 build1 (INDIRECT_REF, cst_uchar_node,
9089 fold_convert_loc (loc,
9094 /* If the first arg is "", and the length is greater than zero,
9095 return -*(const unsigned char*)arg2. */
9096 if (p1 && *p1 == '\0'
9097 && TREE_CODE (len) == INTEGER_CST
9098 && tree_int_cst_sgn (len) == 1)
9100 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
9101 tree cst_uchar_ptr_node
9102 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
9104 tree temp = fold_convert_loc (loc, integer_type_node,
9105 build1 (INDIRECT_REF, cst_uchar_node,
9106 fold_convert_loc (loc,
9109 return fold_build1_loc (loc, NEGATE_EXPR, integer_type_node, temp);
9112 /* If len parameter is one, return an expression corresponding to
9113 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
9114 if (host_integerp (len, 1) && tree_low_cst (len, 1) == 1)
9116 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
9117 tree cst_uchar_ptr_node
9118 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
9120 tree ind1 = fold_convert_loc (loc, integer_type_node,
9121 build1 (INDIRECT_REF, cst_uchar_node,
9122 fold_convert_loc (loc,
9125 tree ind2 = fold_convert_loc (loc, integer_type_node,
9126 build1 (INDIRECT_REF, cst_uchar_node,
9127 fold_convert_loc (loc,
9130 return fold_build2_loc (loc, MINUS_EXPR, integer_type_node, ind1, ind2);
9136 /* Fold function call to builtin signbit, signbitf or signbitl with argument
9137 ARG. Return NULL_TREE if no simplification can be made. */
9140 fold_builtin_signbit (location_t loc, tree arg, tree type)
9144 if (!validate_arg (arg, REAL_TYPE))
9147 /* If ARG is a compile-time constant, determine the result. */
9148 if (TREE_CODE (arg) == REAL_CST
9149 && !TREE_OVERFLOW (arg))
9153 c = TREE_REAL_CST (arg);
9154 temp = REAL_VALUE_NEGATIVE (c) ? integer_one_node : integer_zero_node;
9155 return fold_convert_loc (loc, type, temp);
9158 /* If ARG is non-negative, the result is always zero. */
9159 if (tree_expr_nonnegative_p (arg))
9160 return omit_one_operand_loc (loc, type, integer_zero_node, arg);
9162 /* If ARG's format doesn't have signed zeros, return "arg < 0.0". */
9163 if (!HONOR_SIGNED_ZEROS (TYPE_MODE (TREE_TYPE (arg))))
9164 return fold_build2_loc (loc, LT_EXPR, type, arg,
9165 build_real (TREE_TYPE (arg), dconst0));
9170 /* Fold function call to builtin copysign, copysignf or copysignl with
9171 arguments ARG1 and ARG2. Return NULL_TREE if no simplification can
9175 fold_builtin_copysign (location_t loc, tree fndecl,
9176 tree arg1, tree arg2, tree type)
9180 if (!validate_arg (arg1, REAL_TYPE)
9181 || !validate_arg (arg2, REAL_TYPE))
9184 /* copysign(X,X) is X. */
9185 if (operand_equal_p (arg1, arg2, 0))
9186 return fold_convert_loc (loc, type, arg1);
9188 /* If ARG1 and ARG2 are compile-time constants, determine the result. */
9189 if (TREE_CODE (arg1) == REAL_CST
9190 && TREE_CODE (arg2) == REAL_CST
9191 && !TREE_OVERFLOW (arg1)
9192 && !TREE_OVERFLOW (arg2))
9194 REAL_VALUE_TYPE c1, c2;
9196 c1 = TREE_REAL_CST (arg1);
9197 c2 = TREE_REAL_CST (arg2);
9198 /* c1.sign := c2.sign. */
9199 real_copysign (&c1, &c2);
9200 return build_real (type, c1);
9203 /* copysign(X, Y) is fabs(X) when Y is always non-negative.
9204 Remember to evaluate Y for side-effects. */
9205 if (tree_expr_nonnegative_p (arg2))
9206 return omit_one_operand_loc (loc, type,
9207 fold_build1_loc (loc, ABS_EXPR, type, arg1),
9210 /* Strip sign changing operations for the first argument. */
9211 tem = fold_strip_sign_ops (arg1);
9213 return build_call_expr_loc (loc, fndecl, 2, tem, arg2);
9218 /* Fold a call to builtin isascii with argument ARG. */
9221 fold_builtin_isascii (location_t loc, tree arg)
9223 if (!validate_arg (arg, INTEGER_TYPE))
9227 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
9228 arg = fold_build2 (BIT_AND_EXPR, integer_type_node, arg,
9229 build_int_cst (NULL_TREE,
9230 ~ (unsigned HOST_WIDE_INT) 0x7f));
9231 return fold_build2_loc (loc, EQ_EXPR, integer_type_node,
9232 arg, integer_zero_node);
9236 /* Fold a call to builtin toascii with argument ARG. */
9239 fold_builtin_toascii (location_t loc, tree arg)
9241 if (!validate_arg (arg, INTEGER_TYPE))
9244 /* Transform toascii(c) -> (c & 0x7f). */
9245 return fold_build2_loc (loc, BIT_AND_EXPR, integer_type_node, arg,
9246 build_int_cst (NULL_TREE, 0x7f));
9249 /* Fold a call to builtin isdigit with argument ARG. */
9252 fold_builtin_isdigit (location_t loc, tree arg)
9254 if (!validate_arg (arg, INTEGER_TYPE))
9258 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
9259 /* According to the C standard, isdigit is unaffected by locale.
9260 However, it definitely is affected by the target character set. */
9261 unsigned HOST_WIDE_INT target_digit0
9262 = lang_hooks.to_target_charset ('0');
9264 if (target_digit0 == 0)
9267 arg = fold_convert_loc (loc, unsigned_type_node, arg);
9268 arg = fold_build2 (MINUS_EXPR, unsigned_type_node, arg,
9269 build_int_cst (unsigned_type_node, target_digit0));
9270 return fold_build2_loc (loc, LE_EXPR, integer_type_node, arg,
9271 build_int_cst (unsigned_type_node, 9));
9275 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
9278 fold_builtin_fabs (location_t loc, tree arg, tree type)
9280 if (!validate_arg (arg, REAL_TYPE))
9283 arg = fold_convert_loc (loc, type, arg);
9284 if (TREE_CODE (arg) == REAL_CST)
9285 return fold_abs_const (arg, type);
9286 return fold_build1_loc (loc, ABS_EXPR, type, arg);
9289 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
9292 fold_builtin_abs (location_t loc, tree arg, tree type)
9294 if (!validate_arg (arg, INTEGER_TYPE))
9297 arg = fold_convert_loc (loc, type, arg);
9298 if (TREE_CODE (arg) == INTEGER_CST)
9299 return fold_abs_const (arg, type);
9300 return fold_build1_loc (loc, ABS_EXPR, type, arg);
9303 /* Fold a call to builtin fmin or fmax. */
9306 fold_builtin_fmin_fmax (location_t loc, tree arg0, tree arg1,
9307 tree type, bool max)
9309 if (validate_arg (arg0, REAL_TYPE) && validate_arg (arg1, REAL_TYPE))
9311 /* Calculate the result when the argument is a constant. */
9312 tree res = do_mpfr_arg2 (arg0, arg1, type, (max ? mpfr_max : mpfr_min));
9317 /* If either argument is NaN, return the other one. Avoid the
9318 transformation if we get (and honor) a signalling NaN. Using
9319 omit_one_operand() ensures we create a non-lvalue. */
9320 if (TREE_CODE (arg0) == REAL_CST
9321 && real_isnan (&TREE_REAL_CST (arg0))
9322 && (! HONOR_SNANS (TYPE_MODE (TREE_TYPE (arg0)))
9323 || ! TREE_REAL_CST (arg0).signalling))
9324 return omit_one_operand_loc (loc, type, arg1, arg0);
9325 if (TREE_CODE (arg1) == REAL_CST
9326 && real_isnan (&TREE_REAL_CST (arg1))
9327 && (! HONOR_SNANS (TYPE_MODE (TREE_TYPE (arg1)))
9328 || ! TREE_REAL_CST (arg1).signalling))
9329 return omit_one_operand_loc (loc, type, arg0, arg1);
9331 /* Transform fmin/fmax(x,x) -> x. */
9332 if (operand_equal_p (arg0, arg1, OEP_PURE_SAME))
9333 return omit_one_operand_loc (loc, type, arg0, arg1);
9335 /* Convert fmin/fmax to MIN_EXPR/MAX_EXPR. C99 requires these
9336 functions to return the numeric arg if the other one is NaN.
9337 These tree codes don't honor that, so only transform if
9338 -ffinite-math-only is set. C99 doesn't require -0.0 to be
9339 handled, so we don't have to worry about it either. */
9340 if (flag_finite_math_only)
9341 return fold_build2_loc (loc, (max ? MAX_EXPR : MIN_EXPR), type,
9342 fold_convert_loc (loc, type, arg0),
9343 fold_convert_loc (loc, type, arg1));
9348 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
9351 fold_builtin_carg (location_t loc, tree arg, tree type)
9353 if (validate_arg (arg, COMPLEX_TYPE)
9354 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) == REAL_TYPE)
9356 tree atan2_fn = mathfn_built_in (type, BUILT_IN_ATAN2);
9360 tree new_arg = builtin_save_expr (arg);
9361 tree r_arg = fold_build1_loc (loc, REALPART_EXPR, type, new_arg);
9362 tree i_arg = fold_build1_loc (loc, IMAGPART_EXPR, type, new_arg);
9363 return build_call_expr_loc (loc, atan2_fn, 2, i_arg, r_arg);
9370 /* Fold a call to builtin logb/ilogb. */
9373 fold_builtin_logb (location_t loc, tree arg, tree rettype)
9375 if (! validate_arg (arg, REAL_TYPE))
9380 if (TREE_CODE (arg) == REAL_CST && ! TREE_OVERFLOW (arg))
9382 const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (arg);
9388 /* If arg is Inf or NaN and we're logb, return it. */
9389 if (TREE_CODE (rettype) == REAL_TYPE)
9390 return fold_convert_loc (loc, rettype, arg);
9391 /* Fall through... */
9393 /* Zero may set errno and/or raise an exception for logb, also
9394 for ilogb we don't know FP_ILOGB0. */
9397 /* For normal numbers, proceed iff radix == 2. In GCC,
9398 normalized significands are in the range [0.5, 1.0). We
9399 want the exponent as if they were [1.0, 2.0) so get the
9400 exponent and subtract 1. */
9401 if (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (arg)))->b == 2)
9402 return fold_convert_loc (loc, rettype,
9403 build_int_cst (NULL_TREE,
9404 REAL_EXP (value)-1));
9412 /* Fold a call to builtin significand, if radix == 2. */
9415 fold_builtin_significand (location_t loc, tree arg, tree rettype)
9417 if (! validate_arg (arg, REAL_TYPE))
9422 if (TREE_CODE (arg) == REAL_CST && ! TREE_OVERFLOW (arg))
9424 const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (arg);
9431 /* If arg is +-0, +-Inf or +-NaN, then return it. */
9432 return fold_convert_loc (loc, rettype, arg);
9434 /* For normal numbers, proceed iff radix == 2. */
9435 if (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (arg)))->b == 2)
9437 REAL_VALUE_TYPE result = *value;
9438 /* In GCC, normalized significands are in the range [0.5,
9439 1.0). We want them to be [1.0, 2.0) so set the
9441 SET_REAL_EXP (&result, 1);
9442 return build_real (rettype, result);
9451 /* Fold a call to builtin frexp, we can assume the base is 2. */
9454 fold_builtin_frexp (location_t loc, tree arg0, tree arg1, tree rettype)
9456 if (! validate_arg (arg0, REAL_TYPE) || ! validate_arg (arg1, POINTER_TYPE))
9461 if (!(TREE_CODE (arg0) == REAL_CST && ! TREE_OVERFLOW (arg0)))
9464 arg1 = build_fold_indirect_ref_loc (loc, arg1);
9466 /* Proceed if a valid pointer type was passed in. */
9467 if (TYPE_MAIN_VARIANT (TREE_TYPE (arg1)) == integer_type_node)
9469 const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (arg0);
9475 /* For +-0, return (*exp = 0, +-0). */
9476 exp = integer_zero_node;
9481 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
9482 return omit_one_operand_loc (loc, rettype, arg0, arg1);
9485 /* Since the frexp function always expects base 2, and in
9486 GCC normalized significands are already in the range
9487 [0.5, 1.0), we have exactly what frexp wants. */
9488 REAL_VALUE_TYPE frac_rvt = *value;
9489 SET_REAL_EXP (&frac_rvt, 0);
9490 frac = build_real (rettype, frac_rvt);
9491 exp = build_int_cst (NULL_TREE, REAL_EXP (value));
9498 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
9499 arg1 = fold_build2_loc (loc, MODIFY_EXPR, rettype, arg1, exp);
9500 TREE_SIDE_EFFECTS (arg1) = 1;
9501 return fold_build2_loc (loc, COMPOUND_EXPR, rettype, arg1, frac);
9507 /* Fold a call to builtin ldexp or scalbn/scalbln. If LDEXP is true
9508 then we can assume the base is two. If it's false, then we have to
9509 check the mode of the TYPE parameter in certain cases. */
9512 fold_builtin_load_exponent (location_t loc, tree arg0, tree arg1,
9513 tree type, bool ldexp)
9515 if (validate_arg (arg0, REAL_TYPE) && validate_arg (arg1, INTEGER_TYPE))
9520 /* If arg0 is 0, Inf or NaN, or if arg1 is 0, then return arg0. */
9521 if (real_zerop (arg0) || integer_zerop (arg1)
9522 || (TREE_CODE (arg0) == REAL_CST
9523 && !real_isfinite (&TREE_REAL_CST (arg0))))
9524 return omit_one_operand_loc (loc, type, arg0, arg1);
9526 /* If both arguments are constant, then try to evaluate it. */
9527 if ((ldexp || REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2)
9528 && TREE_CODE (arg0) == REAL_CST && !TREE_OVERFLOW (arg0)
9529 && host_integerp (arg1, 0))
9531 /* Bound the maximum adjustment to twice the range of the
9532 mode's valid exponents. Use abs to ensure the range is
9533 positive as a sanity check. */
9534 const long max_exp_adj = 2 *
9535 labs (REAL_MODE_FORMAT (TYPE_MODE (type))->emax
9536 - REAL_MODE_FORMAT (TYPE_MODE (type))->emin);
9538 /* Get the user-requested adjustment. */
9539 const HOST_WIDE_INT req_exp_adj = tree_low_cst (arg1, 0);
9541 /* The requested adjustment must be inside this range. This
9542 is a preliminary cap to avoid things like overflow, we
9543 may still fail to compute the result for other reasons. */
9544 if (-max_exp_adj < req_exp_adj && req_exp_adj < max_exp_adj)
9546 REAL_VALUE_TYPE initial_result;
9548 real_ldexp (&initial_result, &TREE_REAL_CST (arg0), req_exp_adj);
9550 /* Ensure we didn't overflow. */
9551 if (! real_isinf (&initial_result))
9553 const REAL_VALUE_TYPE trunc_result
9554 = real_value_truncate (TYPE_MODE (type), initial_result);
9556 /* Only proceed if the target mode can hold the
9558 if (REAL_VALUES_EQUAL (initial_result, trunc_result))
9559 return build_real (type, trunc_result);
9568 /* Fold a call to builtin modf. */
9571 fold_builtin_modf (location_t loc, tree arg0, tree arg1, tree rettype)
9573 if (! validate_arg (arg0, REAL_TYPE) || ! validate_arg (arg1, POINTER_TYPE))
9578 if (!(TREE_CODE (arg0) == REAL_CST && ! TREE_OVERFLOW (arg0)))
9581 arg1 = build_fold_indirect_ref_loc (loc, arg1);
9583 /* Proceed if a valid pointer type was passed in. */
9584 if (TYPE_MAIN_VARIANT (TREE_TYPE (arg1)) == TYPE_MAIN_VARIANT (rettype))
9586 const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (arg0);
9587 REAL_VALUE_TYPE trunc, frac;
9593 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
9594 trunc = frac = *value;
9597 /* For +-Inf, return (*arg1 = arg0, +-0). */
9599 frac.sign = value->sign;
9603 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
9604 real_trunc (&trunc, VOIDmode, value);
9605 real_arithmetic (&frac, MINUS_EXPR, value, &trunc);
9606 /* If the original number was negative and already
9607 integral, then the fractional part is -0.0. */
9608 if (value->sign && frac.cl == rvc_zero)
9609 frac.sign = value->sign;
9613 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
9614 arg1 = fold_build2_loc (loc, MODIFY_EXPR, rettype, arg1,
9615 build_real (rettype, trunc));
9616 TREE_SIDE_EFFECTS (arg1) = 1;
9617 return fold_build2_loc (loc, COMPOUND_EXPR, rettype, arg1,
9618 build_real (rettype, frac));
9624 /* Given a location LOC, an interclass builtin function decl FNDECL
9625 and its single argument ARG, return an folded expression computing
9626 the same, or NULL_TREE if we either couldn't or didn't want to fold
9627 (the latter happen if there's an RTL instruction available). */
9630 fold_builtin_interclass_mathfn (location_t loc, tree fndecl, tree arg)
9632 enum machine_mode mode;
9634 if (!validate_arg (arg, REAL_TYPE))
9637 if (interclass_mathfn_icode (arg, fndecl) != CODE_FOR_nothing)
9640 mode = TYPE_MODE (TREE_TYPE (arg));
9642 /* If there is no optab, try generic code. */
9643 switch (DECL_FUNCTION_CODE (fndecl))
9647 CASE_FLT_FN (BUILT_IN_ISINF):
9649 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
9650 tree const isgr_fn = built_in_decls[BUILT_IN_ISGREATER];
9651 tree const type = TREE_TYPE (arg);
9655 get_max_float (REAL_MODE_FORMAT (mode), buf, sizeof (buf));
9656 real_from_string (&r, buf);
9657 result = build_call_expr (isgr_fn, 2,
9658 fold_build1_loc (loc, ABS_EXPR, type, arg),
9659 build_real (type, r));
9662 CASE_FLT_FN (BUILT_IN_FINITE):
9663 case BUILT_IN_ISFINITE:
9665 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
9666 tree const isle_fn = built_in_decls[BUILT_IN_ISLESSEQUAL];
9667 tree const type = TREE_TYPE (arg);
9671 get_max_float (REAL_MODE_FORMAT (mode), buf, sizeof (buf));
9672 real_from_string (&r, buf);
9673 result = build_call_expr (isle_fn, 2,
9674 fold_build1_loc (loc, ABS_EXPR, type, arg),
9675 build_real (type, r));
9676 /*result = fold_build2_loc (loc, UNGT_EXPR,
9677 TREE_TYPE (TREE_TYPE (fndecl)),
9678 fold_build1_loc (loc, ABS_EXPR, type, arg),
9679 build_real (type, r));
9680 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
9681 TREE_TYPE (TREE_TYPE (fndecl)),
9685 case BUILT_IN_ISNORMAL:
9687 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
9688 islessequal(fabs(x),DBL_MAX). */
9689 tree const isle_fn = built_in_decls[BUILT_IN_ISLESSEQUAL];
9690 tree const isge_fn = built_in_decls[BUILT_IN_ISGREATEREQUAL];
9691 tree const type = TREE_TYPE (arg);
9692 REAL_VALUE_TYPE rmax, rmin;
9695 get_max_float (REAL_MODE_FORMAT (mode), buf, sizeof (buf));
9696 real_from_string (&rmax, buf);
9697 sprintf (buf, "0x1p%d", REAL_MODE_FORMAT (mode)->emin - 1);
9698 real_from_string (&rmin, buf);
9699 arg = builtin_save_expr (fold_build1_loc (loc, ABS_EXPR, type, arg));
9700 result = build_call_expr (isle_fn, 2, arg,
9701 build_real (type, rmax));
9702 result = fold_build2 (BIT_AND_EXPR, integer_type_node, result,
9703 build_call_expr (isge_fn, 2, arg,
9704 build_real (type, rmin)));
9714 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
9715 ARG is the argument for the call. */
9718 fold_builtin_classify (location_t loc, tree fndecl, tree arg, int builtin_index)
9720 tree type = TREE_TYPE (TREE_TYPE (fndecl));
9723 if (!validate_arg (arg, REAL_TYPE))
9726 switch (builtin_index)
9728 case BUILT_IN_ISINF:
9729 if (!HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (arg))))
9730 return omit_one_operand_loc (loc, type, integer_zero_node, arg);
9732 if (TREE_CODE (arg) == REAL_CST)
9734 r = TREE_REAL_CST (arg);
9735 if (real_isinf (&r))
9736 return real_compare (GT_EXPR, &r, &dconst0)
9737 ? integer_one_node : integer_minus_one_node;
9739 return integer_zero_node;
9744 case BUILT_IN_ISINF_SIGN:
9746 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
9747 /* In a boolean context, GCC will fold the inner COND_EXPR to
9748 1. So e.g. "if (isinf_sign(x))" would be folded to just
9749 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
9750 tree signbit_fn = mathfn_built_in_1 (TREE_TYPE (arg), BUILT_IN_SIGNBIT, 0);
9751 tree isinf_fn = built_in_decls[BUILT_IN_ISINF];
9752 tree tmp = NULL_TREE;
9754 arg = builtin_save_expr (arg);
9756 if (signbit_fn && isinf_fn)
9758 tree signbit_call = build_call_expr_loc (loc, signbit_fn, 1, arg);
9759 tree isinf_call = build_call_expr_loc (loc, isinf_fn, 1, arg);
9761 signbit_call = fold_build2_loc (loc, NE_EXPR, integer_type_node,
9762 signbit_call, integer_zero_node);
9763 isinf_call = fold_build2_loc (loc, NE_EXPR, integer_type_node,
9764 isinf_call, integer_zero_node);
9766 tmp = fold_build3_loc (loc, COND_EXPR, integer_type_node, signbit_call,
9767 integer_minus_one_node, integer_one_node);
9768 tmp = fold_build3_loc (loc, COND_EXPR, integer_type_node,
9776 case BUILT_IN_ISFINITE:
9777 if (!HONOR_NANS (TYPE_MODE (TREE_TYPE (arg)))
9778 && !HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (arg))))
9779 return omit_one_operand_loc (loc, type, integer_one_node, arg);
9781 if (TREE_CODE (arg) == REAL_CST)
9783 r = TREE_REAL_CST (arg);
9784 return real_isfinite (&r) ? integer_one_node : integer_zero_node;
9789 case BUILT_IN_ISNAN:
9790 if (!HONOR_NANS (TYPE_MODE (TREE_TYPE (arg))))
9791 return omit_one_operand_loc (loc, type, integer_zero_node, arg);
9793 if (TREE_CODE (arg) == REAL_CST)
9795 r = TREE_REAL_CST (arg);
9796 return real_isnan (&r) ? integer_one_node : integer_zero_node;
9799 arg = builtin_save_expr (arg);
9800 return fold_build2_loc (loc, UNORDERED_EXPR, type, arg, arg);
9807 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
9808 This builtin will generate code to return the appropriate floating
9809 point classification depending on the value of the floating point
9810 number passed in. The possible return values must be supplied as
9811 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
9812 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
9813 one floating point argument which is "type generic". */
9816 fold_builtin_fpclassify (location_t loc, tree exp)
9818 tree fp_nan, fp_infinite, fp_normal, fp_subnormal, fp_zero,
9819 arg, type, res, tmp;
9820 enum machine_mode mode;
9824 /* Verify the required arguments in the original call. */
9825 if (!validate_arglist (exp, INTEGER_TYPE, INTEGER_TYPE,
9826 INTEGER_TYPE, INTEGER_TYPE,
9827 INTEGER_TYPE, REAL_TYPE, VOID_TYPE))
9830 fp_nan = CALL_EXPR_ARG (exp, 0);
9831 fp_infinite = CALL_EXPR_ARG (exp, 1);
9832 fp_normal = CALL_EXPR_ARG (exp, 2);
9833 fp_subnormal = CALL_EXPR_ARG (exp, 3);
9834 fp_zero = CALL_EXPR_ARG (exp, 4);
9835 arg = CALL_EXPR_ARG (exp, 5);
9836 type = TREE_TYPE (arg);
9837 mode = TYPE_MODE (type);
9838 arg = builtin_save_expr (fold_build1_loc (loc, ABS_EXPR, type, arg));
9842 (fabs(x) == Inf ? FP_INFINITE :
9843 (fabs(x) >= DBL_MIN ? FP_NORMAL :
9844 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
9846 tmp = fold_build2_loc (loc, EQ_EXPR, integer_type_node, arg,
9847 build_real (type, dconst0));
9848 res = fold_build3_loc (loc, COND_EXPR, integer_type_node,
9849 tmp, fp_zero, fp_subnormal);
9851 sprintf (buf, "0x1p%d", REAL_MODE_FORMAT (mode)->emin - 1);
9852 real_from_string (&r, buf);
9853 tmp = fold_build2_loc (loc, GE_EXPR, integer_type_node,
9854 arg, build_real (type, r));
9855 res = fold_build3_loc (loc, COND_EXPR, integer_type_node, tmp, fp_normal, res);
9857 if (HONOR_INFINITIES (mode))
9860 tmp = fold_build2_loc (loc, EQ_EXPR, integer_type_node, arg,
9861 build_real (type, r));
9862 res = fold_build3_loc (loc, COND_EXPR, integer_type_node, tmp,
9866 if (HONOR_NANS (mode))
9868 tmp = fold_build2_loc (loc, ORDERED_EXPR, integer_type_node, arg, arg);
9869 res = fold_build3_loc (loc, COND_EXPR, integer_type_node, tmp, res, fp_nan);
9875 /* Fold a call to an unordered comparison function such as
9876 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
9877 being called and ARG0 and ARG1 are the arguments for the call.
9878 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
9879 the opposite of the desired result. UNORDERED_CODE is used
9880 for modes that can hold NaNs and ORDERED_CODE is used for
9884 fold_builtin_unordered_cmp (location_t loc, tree fndecl, tree arg0, tree arg1,
9885 enum tree_code unordered_code,
9886 enum tree_code ordered_code)
9888 tree type = TREE_TYPE (TREE_TYPE (fndecl));
9889 enum tree_code code;
9891 enum tree_code code0, code1;
9892 tree cmp_type = NULL_TREE;
9894 type0 = TREE_TYPE (arg0);
9895 type1 = TREE_TYPE (arg1);
9897 code0 = TREE_CODE (type0);
9898 code1 = TREE_CODE (type1);
9900 if (code0 == REAL_TYPE && code1 == REAL_TYPE)
9901 /* Choose the wider of two real types. */
9902 cmp_type = TYPE_PRECISION (type0) >= TYPE_PRECISION (type1)
9904 else if (code0 == REAL_TYPE && code1 == INTEGER_TYPE)
9906 else if (code0 == INTEGER_TYPE && code1 == REAL_TYPE)
9909 arg0 = fold_convert_loc (loc, cmp_type, arg0);
9910 arg1 = fold_convert_loc (loc, cmp_type, arg1);
9912 if (unordered_code == UNORDERED_EXPR)
9914 if (!HONOR_NANS (TYPE_MODE (TREE_TYPE (arg0))))
9915 return omit_two_operands_loc (loc, type, integer_zero_node, arg0, arg1);
9916 return fold_build2_loc (loc, UNORDERED_EXPR, type, arg0, arg1);
9919 code = HONOR_NANS (TYPE_MODE (TREE_TYPE (arg0))) ? unordered_code
9921 return fold_build1_loc (loc, TRUTH_NOT_EXPR, type,
9922 fold_build2_loc (loc, code, type, arg0, arg1));
9925 /* Fold a call to built-in function FNDECL with 0 arguments.
9926 IGNORE is true if the result of the function call is ignored. This
9927 function returns NULL_TREE if no simplification was possible. */
9930 fold_builtin_0 (location_t loc, tree fndecl, bool ignore ATTRIBUTE_UNUSED)
9932 tree type = TREE_TYPE (TREE_TYPE (fndecl));
9933 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
9936 CASE_FLT_FN (BUILT_IN_INF):
9937 case BUILT_IN_INFD32:
9938 case BUILT_IN_INFD64:
9939 case BUILT_IN_INFD128:
9940 return fold_builtin_inf (loc, type, true);
9942 CASE_FLT_FN (BUILT_IN_HUGE_VAL):
9943 return fold_builtin_inf (loc, type, false);
9945 case BUILT_IN_CLASSIFY_TYPE:
9946 return fold_builtin_classify_type (NULL_TREE);
9954 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
9955 IGNORE is true if the result of the function call is ignored. This
9956 function returns NULL_TREE if no simplification was possible. */
9959 fold_builtin_1 (location_t loc, tree fndecl, tree arg0, bool ignore)
9961 tree type = TREE_TYPE (TREE_TYPE (fndecl));
9962 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
9966 case BUILT_IN_CONSTANT_P:
9968 tree val = fold_builtin_constant_p (arg0);
9970 /* Gimplification will pull the CALL_EXPR for the builtin out of
9971 an if condition. When not optimizing, we'll not CSE it back.
9972 To avoid link error types of regressions, return false now. */
9973 if (!val && !optimize)
9974 val = integer_zero_node;
9979 case BUILT_IN_CLASSIFY_TYPE:
9980 return fold_builtin_classify_type (arg0);
9982 case BUILT_IN_STRLEN:
9983 return fold_builtin_strlen (loc, arg0);
9985 CASE_FLT_FN (BUILT_IN_FABS):
9986 return fold_builtin_fabs (loc, arg0, type);
9990 case BUILT_IN_LLABS:
9991 case BUILT_IN_IMAXABS:
9992 return fold_builtin_abs (loc, arg0, type);
9994 CASE_FLT_FN (BUILT_IN_CONJ):
9995 if (validate_arg (arg0, COMPLEX_TYPE)
9996 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
9997 return fold_build1_loc (loc, CONJ_EXPR, type, arg0);
10000 CASE_FLT_FN (BUILT_IN_CREAL):
10001 if (validate_arg (arg0, COMPLEX_TYPE)
10002 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10003 return non_lvalue_loc (loc, fold_build1_loc (loc, REALPART_EXPR, type, arg0));;
10006 CASE_FLT_FN (BUILT_IN_CIMAG):
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, IMAGPART_EXPR, type, arg0));
10012 CASE_FLT_FN (BUILT_IN_CCOS):
10013 return fold_builtin_ccos(loc, arg0, type, fndecl, /*hyper=*/ false);
10015 CASE_FLT_FN (BUILT_IN_CCOSH):
10016 return fold_builtin_ccos(loc, arg0, type, fndecl, /*hyper=*/ true);
10019 CASE_FLT_FN (BUILT_IN_CSIN):
10020 if (validate_arg (arg0, COMPLEX_TYPE)
10021 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10022 return do_mpc_arg1 (arg0, type, mpc_sin);
10025 CASE_FLT_FN (BUILT_IN_CSINH):
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_sinh);
10031 CASE_FLT_FN (BUILT_IN_CTAN):
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_tan);
10037 CASE_FLT_FN (BUILT_IN_CTANH):
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_tanh);
10043 CASE_FLT_FN (BUILT_IN_CLOG):
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_log);
10049 CASE_FLT_FN (BUILT_IN_CSQRT):
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_sqrt);
10055 #ifdef HAVE_mpc_arc
10056 CASE_FLT_FN (BUILT_IN_CASIN):
10057 if (validate_arg (arg0, COMPLEX_TYPE)
10058 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10059 return do_mpc_arg1 (arg0, type, mpc_asin);
10062 CASE_FLT_FN (BUILT_IN_CACOS):
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_acos);
10068 CASE_FLT_FN (BUILT_IN_CATAN):
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_atan);
10074 CASE_FLT_FN (BUILT_IN_CASINH):
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_asinh);
10080 CASE_FLT_FN (BUILT_IN_CACOSH):
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_acosh);
10086 CASE_FLT_FN (BUILT_IN_CATANH):
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_atanh);
10091 #endif /* HAVE_mpc_arc */
10092 #endif /* HAVE_mpc */
10094 CASE_FLT_FN (BUILT_IN_CABS):
10095 return fold_builtin_cabs (loc, arg0, type, fndecl);
10097 CASE_FLT_FN (BUILT_IN_CARG):
10098 return fold_builtin_carg (loc, arg0, type);
10100 CASE_FLT_FN (BUILT_IN_SQRT):
10101 return fold_builtin_sqrt (loc, arg0, type);
10103 CASE_FLT_FN (BUILT_IN_CBRT):
10104 return fold_builtin_cbrt (loc, arg0, type);
10106 CASE_FLT_FN (BUILT_IN_ASIN):
10107 if (validate_arg (arg0, REAL_TYPE))
10108 return do_mpfr_arg1 (arg0, type, mpfr_asin,
10109 &dconstm1, &dconst1, true);
10112 CASE_FLT_FN (BUILT_IN_ACOS):
10113 if (validate_arg (arg0, REAL_TYPE))
10114 return do_mpfr_arg1 (arg0, type, mpfr_acos,
10115 &dconstm1, &dconst1, true);
10118 CASE_FLT_FN (BUILT_IN_ATAN):
10119 if (validate_arg (arg0, REAL_TYPE))
10120 return do_mpfr_arg1 (arg0, type, mpfr_atan, NULL, NULL, 0);
10123 CASE_FLT_FN (BUILT_IN_ASINH):
10124 if (validate_arg (arg0, REAL_TYPE))
10125 return do_mpfr_arg1 (arg0, type, mpfr_asinh, NULL, NULL, 0);
10128 CASE_FLT_FN (BUILT_IN_ACOSH):
10129 if (validate_arg (arg0, REAL_TYPE))
10130 return do_mpfr_arg1 (arg0, type, mpfr_acosh,
10131 &dconst1, NULL, true);
10134 CASE_FLT_FN (BUILT_IN_ATANH):
10135 if (validate_arg (arg0, REAL_TYPE))
10136 return do_mpfr_arg1 (arg0, type, mpfr_atanh,
10137 &dconstm1, &dconst1, false);
10140 CASE_FLT_FN (BUILT_IN_SIN):
10141 if (validate_arg (arg0, REAL_TYPE))
10142 return do_mpfr_arg1 (arg0, type, mpfr_sin, NULL, NULL, 0);
10145 CASE_FLT_FN (BUILT_IN_COS):
10146 return fold_builtin_cos (loc, arg0, type, fndecl);
10148 CASE_FLT_FN (BUILT_IN_TAN):
10149 return fold_builtin_tan (arg0, type);
10151 CASE_FLT_FN (BUILT_IN_CEXP):
10152 return fold_builtin_cexp (loc, arg0, type);
10154 CASE_FLT_FN (BUILT_IN_CEXPI):
10155 if (validate_arg (arg0, REAL_TYPE))
10156 return do_mpfr_sincos (arg0, NULL_TREE, NULL_TREE);
10159 CASE_FLT_FN (BUILT_IN_SINH):
10160 if (validate_arg (arg0, REAL_TYPE))
10161 return do_mpfr_arg1 (arg0, type, mpfr_sinh, NULL, NULL, 0);
10164 CASE_FLT_FN (BUILT_IN_COSH):
10165 return fold_builtin_cosh (loc, arg0, type, fndecl);
10167 CASE_FLT_FN (BUILT_IN_TANH):
10168 if (validate_arg (arg0, REAL_TYPE))
10169 return do_mpfr_arg1 (arg0, type, mpfr_tanh, NULL, NULL, 0);
10172 CASE_FLT_FN (BUILT_IN_ERF):
10173 if (validate_arg (arg0, REAL_TYPE))
10174 return do_mpfr_arg1 (arg0, type, mpfr_erf, NULL, NULL, 0);
10177 CASE_FLT_FN (BUILT_IN_ERFC):
10178 if (validate_arg (arg0, REAL_TYPE))
10179 return do_mpfr_arg1 (arg0, type, mpfr_erfc, NULL, NULL, 0);
10182 CASE_FLT_FN (BUILT_IN_TGAMMA):
10183 if (validate_arg (arg0, REAL_TYPE))
10184 return do_mpfr_arg1 (arg0, type, mpfr_gamma, NULL, NULL, 0);
10187 CASE_FLT_FN (BUILT_IN_EXP):
10188 return fold_builtin_exponent (loc, fndecl, arg0, mpfr_exp);
10190 CASE_FLT_FN (BUILT_IN_EXP2):
10191 return fold_builtin_exponent (loc, fndecl, arg0, mpfr_exp2);
10193 CASE_FLT_FN (BUILT_IN_EXP10):
10194 CASE_FLT_FN (BUILT_IN_POW10):
10195 return fold_builtin_exponent (loc, fndecl, arg0, mpfr_exp10);
10197 CASE_FLT_FN (BUILT_IN_EXPM1):
10198 if (validate_arg (arg0, REAL_TYPE))
10199 return do_mpfr_arg1 (arg0, type, mpfr_expm1, NULL, NULL, 0);
10202 CASE_FLT_FN (BUILT_IN_LOG):
10203 return fold_builtin_logarithm (loc, fndecl, arg0, mpfr_log);
10205 CASE_FLT_FN (BUILT_IN_LOG2):
10206 return fold_builtin_logarithm (loc, fndecl, arg0, mpfr_log2);
10208 CASE_FLT_FN (BUILT_IN_LOG10):
10209 return fold_builtin_logarithm (loc, fndecl, arg0, mpfr_log10);
10211 CASE_FLT_FN (BUILT_IN_LOG1P):
10212 if (validate_arg (arg0, REAL_TYPE))
10213 return do_mpfr_arg1 (arg0, type, mpfr_log1p,
10214 &dconstm1, NULL, false);
10217 CASE_FLT_FN (BUILT_IN_J0):
10218 if (validate_arg (arg0, REAL_TYPE))
10219 return do_mpfr_arg1 (arg0, type, mpfr_j0,
10223 CASE_FLT_FN (BUILT_IN_J1):
10224 if (validate_arg (arg0, REAL_TYPE))
10225 return do_mpfr_arg1 (arg0, type, mpfr_j1,
10229 CASE_FLT_FN (BUILT_IN_Y0):
10230 if (validate_arg (arg0, REAL_TYPE))
10231 return do_mpfr_arg1 (arg0, type, mpfr_y0,
10232 &dconst0, NULL, false);
10235 CASE_FLT_FN (BUILT_IN_Y1):
10236 if (validate_arg (arg0, REAL_TYPE))
10237 return do_mpfr_arg1 (arg0, type, mpfr_y1,
10238 &dconst0, NULL, false);
10241 CASE_FLT_FN (BUILT_IN_NAN):
10242 case BUILT_IN_NAND32:
10243 case BUILT_IN_NAND64:
10244 case BUILT_IN_NAND128:
10245 return fold_builtin_nan (arg0, type, true);
10247 CASE_FLT_FN (BUILT_IN_NANS):
10248 return fold_builtin_nan (arg0, type, false);
10250 CASE_FLT_FN (BUILT_IN_FLOOR):
10251 return fold_builtin_floor (loc, fndecl, arg0);
10253 CASE_FLT_FN (BUILT_IN_CEIL):
10254 return fold_builtin_ceil (loc, fndecl, arg0);
10256 CASE_FLT_FN (BUILT_IN_TRUNC):
10257 return fold_builtin_trunc (loc, fndecl, arg0);
10259 CASE_FLT_FN (BUILT_IN_ROUND):
10260 return fold_builtin_round (loc, fndecl, arg0);
10262 CASE_FLT_FN (BUILT_IN_NEARBYINT):
10263 CASE_FLT_FN (BUILT_IN_RINT):
10264 return fold_trunc_transparent_mathfn (loc, fndecl, arg0);
10266 CASE_FLT_FN (BUILT_IN_LCEIL):
10267 CASE_FLT_FN (BUILT_IN_LLCEIL):
10268 CASE_FLT_FN (BUILT_IN_LFLOOR):
10269 CASE_FLT_FN (BUILT_IN_LLFLOOR):
10270 CASE_FLT_FN (BUILT_IN_LROUND):
10271 CASE_FLT_FN (BUILT_IN_LLROUND):
10272 return fold_builtin_int_roundingfn (loc, fndecl, arg0);
10274 CASE_FLT_FN (BUILT_IN_LRINT):
10275 CASE_FLT_FN (BUILT_IN_LLRINT):
10276 return fold_fixed_mathfn (loc, fndecl, arg0);
10278 case BUILT_IN_BSWAP32:
10279 case BUILT_IN_BSWAP64:
10280 return fold_builtin_bswap (fndecl, arg0);
10282 CASE_INT_FN (BUILT_IN_FFS):
10283 CASE_INT_FN (BUILT_IN_CLZ):
10284 CASE_INT_FN (BUILT_IN_CTZ):
10285 CASE_INT_FN (BUILT_IN_POPCOUNT):
10286 CASE_INT_FN (BUILT_IN_PARITY):
10287 return fold_builtin_bitop (fndecl, arg0);
10289 CASE_FLT_FN (BUILT_IN_SIGNBIT):
10290 return fold_builtin_signbit (loc, arg0, type);
10292 CASE_FLT_FN (BUILT_IN_SIGNIFICAND):
10293 return fold_builtin_significand (loc, arg0, type);
10295 CASE_FLT_FN (BUILT_IN_ILOGB):
10296 CASE_FLT_FN (BUILT_IN_LOGB):
10297 return fold_builtin_logb (loc, arg0, type);
10299 case BUILT_IN_ISASCII:
10300 return fold_builtin_isascii (loc, arg0);
10302 case BUILT_IN_TOASCII:
10303 return fold_builtin_toascii (loc, arg0);
10305 case BUILT_IN_ISDIGIT:
10306 return fold_builtin_isdigit (loc, arg0);
10308 CASE_FLT_FN (BUILT_IN_FINITE):
10309 case BUILT_IN_FINITED32:
10310 case BUILT_IN_FINITED64:
10311 case BUILT_IN_FINITED128:
10312 case BUILT_IN_ISFINITE:
10314 tree ret = fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISFINITE);
10317 return fold_builtin_interclass_mathfn (loc, fndecl, arg0);
10320 CASE_FLT_FN (BUILT_IN_ISINF):
10321 case BUILT_IN_ISINFD32:
10322 case BUILT_IN_ISINFD64:
10323 case BUILT_IN_ISINFD128:
10325 tree ret = fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISINF);
10328 return fold_builtin_interclass_mathfn (loc, fndecl, arg0);
10331 case BUILT_IN_ISNORMAL:
10332 return fold_builtin_interclass_mathfn (loc, fndecl, arg0);
10334 case BUILT_IN_ISINF_SIGN:
10335 return fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISINF_SIGN);
10337 CASE_FLT_FN (BUILT_IN_ISNAN):
10338 case BUILT_IN_ISNAND32:
10339 case BUILT_IN_ISNAND64:
10340 case BUILT_IN_ISNAND128:
10341 return fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISNAN);
10343 case BUILT_IN_PRINTF:
10344 case BUILT_IN_PRINTF_UNLOCKED:
10345 case BUILT_IN_VPRINTF:
10346 return fold_builtin_printf (loc, fndecl, arg0, NULL_TREE, ignore, fcode);
10356 /* Fold a call to built-in function FNDECL with 2 arguments, ARG0 and ARG1.
10357 IGNORE is true if the result of the function call is ignored. This
10358 function returns NULL_TREE if no simplification was possible. */
10361 fold_builtin_2 (location_t loc, tree fndecl, tree arg0, tree arg1, bool ignore)
10363 tree type = TREE_TYPE (TREE_TYPE (fndecl));
10364 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
10368 CASE_FLT_FN (BUILT_IN_JN):
10369 if (validate_arg (arg0, INTEGER_TYPE)
10370 && validate_arg (arg1, REAL_TYPE))
10371 return do_mpfr_bessel_n (arg0, arg1, type, mpfr_jn, NULL, 0);
10374 CASE_FLT_FN (BUILT_IN_YN):
10375 if (validate_arg (arg0, INTEGER_TYPE)
10376 && validate_arg (arg1, REAL_TYPE))
10377 return do_mpfr_bessel_n (arg0, arg1, type, mpfr_yn,
10381 CASE_FLT_FN (BUILT_IN_DREM):
10382 CASE_FLT_FN (BUILT_IN_REMAINDER):
10383 if (validate_arg (arg0, REAL_TYPE)
10384 && validate_arg(arg1, REAL_TYPE))
10385 return do_mpfr_arg2 (arg0, arg1, type, mpfr_remainder);
10388 CASE_FLT_FN_REENT (BUILT_IN_GAMMA): /* GAMMA_R */
10389 CASE_FLT_FN_REENT (BUILT_IN_LGAMMA): /* LGAMMA_R */
10390 if (validate_arg (arg0, REAL_TYPE)
10391 && validate_arg(arg1, POINTER_TYPE))
10392 return do_mpfr_lgamma_r (arg0, arg1, type);
10395 CASE_FLT_FN (BUILT_IN_ATAN2):
10396 if (validate_arg (arg0, REAL_TYPE)
10397 && validate_arg(arg1, REAL_TYPE))
10398 return do_mpfr_arg2 (arg0, arg1, type, mpfr_atan2);
10401 CASE_FLT_FN (BUILT_IN_FDIM):
10402 if (validate_arg (arg0, REAL_TYPE)
10403 && validate_arg(arg1, REAL_TYPE))
10404 return do_mpfr_arg2 (arg0, arg1, type, mpfr_dim);
10407 CASE_FLT_FN (BUILT_IN_HYPOT):
10408 return fold_builtin_hypot (loc, fndecl, arg0, arg1, type);
10410 #ifdef HAVE_mpc_pow
10411 CASE_FLT_FN (BUILT_IN_CPOW):
10412 if (validate_arg (arg0, COMPLEX_TYPE)
10413 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE
10414 && validate_arg (arg1, COMPLEX_TYPE)
10415 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg1))) == REAL_TYPE)
10416 return do_mpc_arg2 (arg0, arg1, type, /*do_nonfinite=*/ 0, mpc_pow);
10420 CASE_FLT_FN (BUILT_IN_LDEXP):
10421 return fold_builtin_load_exponent (loc, arg0, arg1, type, /*ldexp=*/true);
10422 CASE_FLT_FN (BUILT_IN_SCALBN):
10423 CASE_FLT_FN (BUILT_IN_SCALBLN):
10424 return fold_builtin_load_exponent (loc, arg0, arg1,
10425 type, /*ldexp=*/false);
10427 CASE_FLT_FN (BUILT_IN_FREXP):
10428 return fold_builtin_frexp (loc, arg0, arg1, type);
10430 CASE_FLT_FN (BUILT_IN_MODF):
10431 return fold_builtin_modf (loc, arg0, arg1, type);
10433 case BUILT_IN_BZERO:
10434 return fold_builtin_bzero (loc, arg0, arg1, ignore);
10436 case BUILT_IN_FPUTS:
10437 return fold_builtin_fputs (loc, arg0, arg1, ignore, false, NULL_TREE);
10439 case BUILT_IN_FPUTS_UNLOCKED:
10440 return fold_builtin_fputs (loc, arg0, arg1, ignore, true, NULL_TREE);
10442 case BUILT_IN_STRSTR:
10443 return fold_builtin_strstr (loc, arg0, arg1, type);
10445 case BUILT_IN_STRCAT:
10446 return fold_builtin_strcat (loc, arg0, arg1);
10448 case BUILT_IN_STRSPN:
10449 return fold_builtin_strspn (loc, arg0, arg1);
10451 case BUILT_IN_STRCSPN:
10452 return fold_builtin_strcspn (loc, arg0, arg1);
10454 case BUILT_IN_STRCHR:
10455 case BUILT_IN_INDEX:
10456 return fold_builtin_strchr (loc, arg0, arg1, type);
10458 case BUILT_IN_STRRCHR:
10459 case BUILT_IN_RINDEX:
10460 return fold_builtin_strrchr (loc, arg0, arg1, type);
10462 case BUILT_IN_STRCPY:
10463 return fold_builtin_strcpy (loc, fndecl, arg0, arg1, NULL_TREE);
10465 case BUILT_IN_STPCPY:
10468 tree fn = implicit_built_in_decls[BUILT_IN_STRCPY];
10472 return build_call_expr_loc (loc, fn, 2, arg0, arg1);
10475 return fold_builtin_stpcpy (loc, fndecl, arg0, arg1);
10478 case BUILT_IN_STRCMP:
10479 return fold_builtin_strcmp (loc, arg0, arg1);
10481 case BUILT_IN_STRPBRK:
10482 return fold_builtin_strpbrk (loc, arg0, arg1, type);
10484 case BUILT_IN_EXPECT:
10485 return fold_builtin_expect (loc, arg0, arg1);
10487 CASE_FLT_FN (BUILT_IN_POW):
10488 return fold_builtin_pow (loc, fndecl, arg0, arg1, type);
10490 CASE_FLT_FN (BUILT_IN_POWI):
10491 return fold_builtin_powi (loc, fndecl, arg0, arg1, type);
10493 CASE_FLT_FN (BUILT_IN_COPYSIGN):
10494 return fold_builtin_copysign (loc, fndecl, arg0, arg1, type);
10496 CASE_FLT_FN (BUILT_IN_FMIN):
10497 return fold_builtin_fmin_fmax (loc, arg0, arg1, type, /*max=*/false);
10499 CASE_FLT_FN (BUILT_IN_FMAX):
10500 return fold_builtin_fmin_fmax (loc, arg0, arg1, type, /*max=*/true);
10502 case BUILT_IN_ISGREATER:
10503 return fold_builtin_unordered_cmp (loc, fndecl,
10504 arg0, arg1, UNLE_EXPR, LE_EXPR);
10505 case BUILT_IN_ISGREATEREQUAL:
10506 return fold_builtin_unordered_cmp (loc, fndecl,
10507 arg0, arg1, UNLT_EXPR, LT_EXPR);
10508 case BUILT_IN_ISLESS:
10509 return fold_builtin_unordered_cmp (loc, fndecl,
10510 arg0, arg1, UNGE_EXPR, GE_EXPR);
10511 case BUILT_IN_ISLESSEQUAL:
10512 return fold_builtin_unordered_cmp (loc, fndecl,
10513 arg0, arg1, UNGT_EXPR, GT_EXPR);
10514 case BUILT_IN_ISLESSGREATER:
10515 return fold_builtin_unordered_cmp (loc, fndecl,
10516 arg0, arg1, UNEQ_EXPR, EQ_EXPR);
10517 case BUILT_IN_ISUNORDERED:
10518 return fold_builtin_unordered_cmp (loc, fndecl,
10519 arg0, arg1, UNORDERED_EXPR,
10522 /* We do the folding for va_start in the expander. */
10523 case BUILT_IN_VA_START:
10526 case BUILT_IN_SPRINTF:
10527 return fold_builtin_sprintf (loc, arg0, arg1, NULL_TREE, ignore);
10529 case BUILT_IN_OBJECT_SIZE:
10530 return fold_builtin_object_size (arg0, arg1);
10532 case BUILT_IN_PRINTF:
10533 case BUILT_IN_PRINTF_UNLOCKED:
10534 case BUILT_IN_VPRINTF:
10535 return fold_builtin_printf (loc, fndecl, arg0, arg1, ignore, fcode);
10537 case BUILT_IN_PRINTF_CHK:
10538 case BUILT_IN_VPRINTF_CHK:
10539 if (!validate_arg (arg0, INTEGER_TYPE)
10540 || TREE_SIDE_EFFECTS (arg0))
10543 return fold_builtin_printf (loc, fndecl,
10544 arg1, NULL_TREE, ignore, fcode);
10547 case BUILT_IN_FPRINTF:
10548 case BUILT_IN_FPRINTF_UNLOCKED:
10549 case BUILT_IN_VFPRINTF:
10550 return fold_builtin_fprintf (loc, fndecl, arg0, arg1, NULL_TREE,
10559 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
10560 and ARG2. IGNORE is true if the result of the function call is ignored.
10561 This function returns NULL_TREE if no simplification was possible. */
10564 fold_builtin_3 (location_t loc, tree fndecl,
10565 tree arg0, tree arg1, tree arg2, bool ignore)
10567 tree type = TREE_TYPE (TREE_TYPE (fndecl));
10568 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
10572 CASE_FLT_FN (BUILT_IN_SINCOS):
10573 return fold_builtin_sincos (loc, arg0, arg1, arg2);
10575 CASE_FLT_FN (BUILT_IN_FMA):
10576 if (validate_arg (arg0, REAL_TYPE)
10577 && validate_arg(arg1, REAL_TYPE)
10578 && validate_arg(arg2, REAL_TYPE))
10579 return do_mpfr_arg3 (arg0, arg1, arg2, type, mpfr_fma);
10582 CASE_FLT_FN (BUILT_IN_REMQUO):
10583 if (validate_arg (arg0, REAL_TYPE)
10584 && validate_arg(arg1, REAL_TYPE)
10585 && validate_arg(arg2, POINTER_TYPE))
10586 return do_mpfr_remquo (arg0, arg1, arg2);
10589 case BUILT_IN_MEMSET:
10590 return fold_builtin_memset (loc, arg0, arg1, arg2, type, ignore);
10592 case BUILT_IN_BCOPY:
10593 return fold_builtin_memory_op (loc, arg1, arg0, arg2,
10594 void_type_node, true, /*endp=*/3);
10596 case BUILT_IN_MEMCPY:
10597 return fold_builtin_memory_op (loc, arg0, arg1, arg2,
10598 type, ignore, /*endp=*/0);
10600 case BUILT_IN_MEMPCPY:
10601 return fold_builtin_memory_op (loc, arg0, arg1, arg2,
10602 type, ignore, /*endp=*/1);
10604 case BUILT_IN_MEMMOVE:
10605 return fold_builtin_memory_op (loc, arg0, arg1, arg2,
10606 type, ignore, /*endp=*/3);
10608 case BUILT_IN_STRNCAT:
10609 return fold_builtin_strncat (loc, arg0, arg1, arg2);
10611 case BUILT_IN_STRNCPY:
10612 return fold_builtin_strncpy (loc, fndecl, arg0, arg1, arg2, NULL_TREE);
10614 case BUILT_IN_STRNCMP:
10615 return fold_builtin_strncmp (loc, arg0, arg1, arg2);
10617 case BUILT_IN_MEMCHR:
10618 return fold_builtin_memchr (loc, arg0, arg1, arg2, type);
10620 case BUILT_IN_BCMP:
10621 case BUILT_IN_MEMCMP:
10622 return fold_builtin_memcmp (loc, arg0, arg1, arg2);;
10624 case BUILT_IN_SPRINTF:
10625 return fold_builtin_sprintf (loc, arg0, arg1, arg2, ignore);
10627 case BUILT_IN_STRCPY_CHK:
10628 case BUILT_IN_STPCPY_CHK:
10629 return fold_builtin_stxcpy_chk (loc, fndecl, arg0, arg1, arg2, NULL_TREE,
10632 case BUILT_IN_STRCAT_CHK:
10633 return fold_builtin_strcat_chk (loc, fndecl, arg0, arg1, arg2);
10635 case BUILT_IN_PRINTF_CHK:
10636 case BUILT_IN_VPRINTF_CHK:
10637 if (!validate_arg (arg0, INTEGER_TYPE)
10638 || TREE_SIDE_EFFECTS (arg0))
10641 return fold_builtin_printf (loc, fndecl, arg1, arg2, ignore, fcode);
10644 case BUILT_IN_FPRINTF:
10645 case BUILT_IN_FPRINTF_UNLOCKED:
10646 case BUILT_IN_VFPRINTF:
10647 return fold_builtin_fprintf (loc, fndecl, arg0, arg1, arg2,
10650 case BUILT_IN_FPRINTF_CHK:
10651 case BUILT_IN_VFPRINTF_CHK:
10652 if (!validate_arg (arg1, INTEGER_TYPE)
10653 || TREE_SIDE_EFFECTS (arg1))
10656 return fold_builtin_fprintf (loc, fndecl, arg0, arg2, NULL_TREE,
10665 /* Fold a call to built-in function FNDECL with 4 arguments, ARG0, ARG1,
10666 ARG2, and ARG3. IGNORE is true if the result of the function call is
10667 ignored. This function returns NULL_TREE if no simplification was
10671 fold_builtin_4 (location_t loc, tree fndecl,
10672 tree arg0, tree arg1, tree arg2, tree arg3, bool ignore)
10674 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
10678 case BUILT_IN_MEMCPY_CHK:
10679 case BUILT_IN_MEMPCPY_CHK:
10680 case BUILT_IN_MEMMOVE_CHK:
10681 case BUILT_IN_MEMSET_CHK:
10682 return fold_builtin_memory_chk (loc, fndecl, arg0, arg1, arg2, arg3,
10684 DECL_FUNCTION_CODE (fndecl));
10686 case BUILT_IN_STRNCPY_CHK:
10687 return fold_builtin_strncpy_chk (loc, arg0, arg1, arg2, arg3, NULL_TREE);
10689 case BUILT_IN_STRNCAT_CHK:
10690 return fold_builtin_strncat_chk (loc, fndecl, arg0, arg1, arg2, arg3);
10692 case BUILT_IN_FPRINTF_CHK:
10693 case BUILT_IN_VFPRINTF_CHK:
10694 if (!validate_arg (arg1, INTEGER_TYPE)
10695 || TREE_SIDE_EFFECTS (arg1))
10698 return fold_builtin_fprintf (loc, fndecl, arg0, arg2, arg3,
10708 /* Fold a call to built-in function FNDECL. ARGS is an array of NARGS
10709 arguments, where NARGS <= 4. IGNORE is true if the result of the
10710 function call is ignored. This function returns NULL_TREE if no
10711 simplification was possible. Note that this only folds builtins with
10712 fixed argument patterns. Foldings that do varargs-to-varargs
10713 transformations, or that match calls with more than 4 arguments,
10714 need to be handled with fold_builtin_varargs instead. */
10716 #define MAX_ARGS_TO_FOLD_BUILTIN 4
10719 fold_builtin_n (location_t loc, tree fndecl, tree *args, int nargs, bool ignore)
10721 tree ret = NULL_TREE;
10726 ret = fold_builtin_0 (loc, fndecl, ignore);
10729 ret = fold_builtin_1 (loc, fndecl, args[0], ignore);
10732 ret = fold_builtin_2 (loc, fndecl, args[0], args[1], ignore);
10735 ret = fold_builtin_3 (loc, fndecl, args[0], args[1], args[2], ignore);
10738 ret = fold_builtin_4 (loc, fndecl, args[0], args[1], args[2], args[3],
10746 ret = build1 (NOP_EXPR, TREE_TYPE (ret), ret);
10747 SET_EXPR_LOCATION (ret, loc);
10748 TREE_NO_WARNING (ret) = 1;
10754 /* Builtins with folding operations that operate on "..." arguments
10755 need special handling; we need to store the arguments in a convenient
10756 data structure before attempting any folding. Fortunately there are
10757 only a few builtins that fall into this category. FNDECL is the
10758 function, EXP is the CALL_EXPR for the call, and IGNORE is true if the
10759 result of the function call is ignored. */
10762 fold_builtin_varargs (location_t loc, tree fndecl, tree exp,
10763 bool ignore ATTRIBUTE_UNUSED)
10765 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
10766 tree ret = NULL_TREE;
10770 case BUILT_IN_SPRINTF_CHK:
10771 case BUILT_IN_VSPRINTF_CHK:
10772 ret = fold_builtin_sprintf_chk (loc, exp, fcode);
10775 case BUILT_IN_SNPRINTF_CHK:
10776 case BUILT_IN_VSNPRINTF_CHK:
10777 ret = fold_builtin_snprintf_chk (loc, exp, NULL_TREE, fcode);
10780 case BUILT_IN_FPCLASSIFY:
10781 ret = fold_builtin_fpclassify (loc, exp);
10789 ret = build1 (NOP_EXPR, TREE_TYPE (ret), ret);
10790 SET_EXPR_LOCATION (ret, loc);
10791 TREE_NO_WARNING (ret) = 1;
10797 /* Return true if FNDECL shouldn't be folded right now.
10798 If a built-in function has an inline attribute always_inline
10799 wrapper, defer folding it after always_inline functions have
10800 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
10801 might not be performed. */
10804 avoid_folding_inline_builtin (tree fndecl)
10806 return (DECL_DECLARED_INLINE_P (fndecl)
10807 && DECL_DISREGARD_INLINE_LIMITS (fndecl)
10809 && !cfun->always_inline_functions_inlined
10810 && lookup_attribute ("always_inline", DECL_ATTRIBUTES (fndecl)));
10813 /* A wrapper function for builtin folding that prevents warnings for
10814 "statement without effect" and the like, caused by removing the
10815 call node earlier than the warning is generated. */
10818 fold_call_expr (location_t loc, tree exp, bool ignore)
10820 tree ret = NULL_TREE;
10821 tree fndecl = get_callee_fndecl (exp);
10823 && TREE_CODE (fndecl) == FUNCTION_DECL
10824 && DECL_BUILT_IN (fndecl)
10825 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
10826 yet. Defer folding until we see all the arguments
10827 (after inlining). */
10828 && !CALL_EXPR_VA_ARG_PACK (exp))
10830 int nargs = call_expr_nargs (exp);
10832 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
10833 instead last argument is __builtin_va_arg_pack (). Defer folding
10834 even in that case, until arguments are finalized. */
10835 if (nargs && TREE_CODE (CALL_EXPR_ARG (exp, nargs - 1)) == CALL_EXPR)
10837 tree fndecl2 = get_callee_fndecl (CALL_EXPR_ARG (exp, nargs - 1));
10839 && TREE_CODE (fndecl2) == FUNCTION_DECL
10840 && DECL_BUILT_IN_CLASS (fndecl2) == BUILT_IN_NORMAL
10841 && DECL_FUNCTION_CODE (fndecl2) == BUILT_IN_VA_ARG_PACK)
10845 if (avoid_folding_inline_builtin (fndecl))
10848 /* FIXME: Don't use a list in this interface. */
10849 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
10850 return targetm.fold_builtin (fndecl, CALL_EXPR_ARGS (exp), ignore);
10853 if (nargs <= MAX_ARGS_TO_FOLD_BUILTIN)
10855 tree *args = CALL_EXPR_ARGP (exp);
10856 ret = fold_builtin_n (loc, fndecl, args, nargs, ignore);
10859 ret = fold_builtin_varargs (loc, fndecl, exp, ignore);
10867 /* Conveniently construct a function call expression. FNDECL names the
10868 function to be called and ARGLIST is a TREE_LIST of arguments. */
10871 build_function_call_expr (location_t loc, tree fndecl, tree arglist)
10873 tree fntype = TREE_TYPE (fndecl);
10874 tree fn = build1 (ADDR_EXPR, build_pointer_type (fntype), fndecl);
10875 int n = list_length (arglist);
10876 tree *argarray = (tree *) alloca (n * sizeof (tree));
10879 for (i = 0; i < n; i++, arglist = TREE_CHAIN (arglist))
10880 argarray[i] = TREE_VALUE (arglist);
10881 return fold_builtin_call_array (loc, TREE_TYPE (fntype), fn, n, argarray);
10884 /* Conveniently construct a function call expression. FNDECL names the
10885 function to be called, N is the number of arguments, and the "..."
10886 parameters are the argument expressions. */
10889 build_call_expr_loc (location_t loc, tree fndecl, int n, ...)
10892 tree fntype = TREE_TYPE (fndecl);
10893 tree fn = build1 (ADDR_EXPR, build_pointer_type (fntype), fndecl);
10894 tree *argarray = (tree *) alloca (n * sizeof (tree));
10898 for (i = 0; i < n; i++)
10899 argarray[i] = va_arg (ap, tree);
10901 return fold_builtin_call_array (loc, TREE_TYPE (fntype), fn, n, argarray);
10904 /* Construct a CALL_EXPR with type TYPE with FN as the function expression.
10905 N arguments are passed in the array ARGARRAY. */
10908 fold_builtin_call_array (location_t loc, tree type,
10913 tree ret = NULL_TREE;
10917 if (TREE_CODE (fn) == ADDR_EXPR)
10919 tree fndecl = TREE_OPERAND (fn, 0);
10920 if (TREE_CODE (fndecl) == FUNCTION_DECL
10921 && DECL_BUILT_IN (fndecl))
10923 /* If last argument is __builtin_va_arg_pack (), arguments to this
10924 function are not finalized yet. Defer folding until they are. */
10925 if (n && TREE_CODE (argarray[n - 1]) == CALL_EXPR)
10927 tree fndecl2 = get_callee_fndecl (argarray[n - 1]);
10929 && TREE_CODE (fndecl2) == FUNCTION_DECL
10930 && DECL_BUILT_IN_CLASS (fndecl2) == BUILT_IN_NORMAL
10931 && DECL_FUNCTION_CODE (fndecl2) == BUILT_IN_VA_ARG_PACK)
10932 return build_call_array_loc (loc, type, fn, n, argarray);
10934 if (avoid_folding_inline_builtin (fndecl))
10935 return build_call_array_loc (loc, type, fn, n, argarray);
10936 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
10938 tree arglist = NULL_TREE;
10939 for (i = n - 1; i >= 0; i--)
10940 arglist = tree_cons (NULL_TREE, argarray[i], arglist);
10941 ret = targetm.fold_builtin (fndecl, arglist, false);
10944 return build_call_array_loc (loc, type, fn, n, argarray);
10946 else if (n <= MAX_ARGS_TO_FOLD_BUILTIN)
10948 /* First try the transformations that don't require consing up
10950 ret = fold_builtin_n (loc, fndecl, argarray, n, false);
10955 /* If we got this far, we need to build an exp. */
10956 exp = build_call_array_loc (loc, type, fn, n, argarray);
10957 ret = fold_builtin_varargs (loc, fndecl, exp, false);
10958 return ret ? ret : exp;
10962 return build_call_array_loc (loc, type, fn, n, argarray);
10965 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
10966 along with N new arguments specified as the "..." parameters. SKIP
10967 is the number of arguments in EXP to be omitted. This function is used
10968 to do varargs-to-varargs transformations. */
10971 rewrite_call_expr (location_t loc, tree exp, int skip, tree fndecl, int n, ...)
10973 int oldnargs = call_expr_nargs (exp);
10974 int nargs = oldnargs - skip + n;
10975 tree fntype = TREE_TYPE (fndecl);
10976 tree fn = build1 (ADDR_EXPR, build_pointer_type (fntype), fndecl);
10984 buffer = XALLOCAVEC (tree, nargs);
10986 for (i = 0; i < n; i++)
10987 buffer[i] = va_arg (ap, tree);
10989 for (j = skip; j < oldnargs; j++, i++)
10990 buffer[i] = CALL_EXPR_ARG (exp, j);
10993 buffer = CALL_EXPR_ARGP (exp) + skip;
10995 return fold (build_call_array_loc (loc, TREE_TYPE (exp), fn, nargs, buffer));
10998 /* Validate a single argument ARG against a tree code CODE representing
11002 validate_arg (const_tree arg, enum tree_code code)
11006 else if (code == POINTER_TYPE)
11007 return POINTER_TYPE_P (TREE_TYPE (arg));
11008 else if (code == INTEGER_TYPE)
11009 return INTEGRAL_TYPE_P (TREE_TYPE (arg));
11010 return code == TREE_CODE (TREE_TYPE (arg));
11013 /* This function validates the types of a function call argument list
11014 against a specified list of tree_codes. If the last specifier is a 0,
11015 that represents an ellipses, otherwise the last specifier must be a
11018 This is the GIMPLE version of validate_arglist. Eventually we want to
11019 completely convert builtins.c to work from GIMPLEs and the tree based
11020 validate_arglist will then be removed. */
11023 validate_gimple_arglist (const_gimple call, ...)
11025 enum tree_code code;
11031 va_start (ap, call);
11036 code = (enum tree_code) va_arg (ap, int);
11040 /* This signifies an ellipses, any further arguments are all ok. */
11044 /* This signifies an endlink, if no arguments remain, return
11045 true, otherwise return false. */
11046 res = (i == gimple_call_num_args (call));
11049 /* If no parameters remain or the parameter's code does not
11050 match the specified code, return false. Otherwise continue
11051 checking any remaining arguments. */
11052 arg = gimple_call_arg (call, i++);
11053 if (!validate_arg (arg, code))
11060 /* We need gotos here since we can only have one VA_CLOSE in a
11068 /* This function validates the types of a function call argument list
11069 against a specified list of tree_codes. If the last specifier is a 0,
11070 that represents an ellipses, otherwise the last specifier must be a
11074 validate_arglist (const_tree callexpr, ...)
11076 enum tree_code code;
11079 const_call_expr_arg_iterator iter;
11082 va_start (ap, callexpr);
11083 init_const_call_expr_arg_iterator (callexpr, &iter);
11087 code = (enum tree_code) va_arg (ap, int);
11091 /* This signifies an ellipses, any further arguments are all ok. */
11095 /* This signifies an endlink, if no arguments remain, return
11096 true, otherwise return false. */
11097 res = !more_const_call_expr_args_p (&iter);
11100 /* If no parameters remain or the parameter's code does not
11101 match the specified code, return false. Otherwise continue
11102 checking any remaining arguments. */
11103 arg = next_const_call_expr_arg (&iter);
11104 if (!validate_arg (arg, code))
11111 /* We need gotos here since we can only have one VA_CLOSE in a
11119 /* Default target-specific builtin expander that does nothing. */
11122 default_expand_builtin (tree exp ATTRIBUTE_UNUSED,
11123 rtx target ATTRIBUTE_UNUSED,
11124 rtx subtarget ATTRIBUTE_UNUSED,
11125 enum machine_mode mode ATTRIBUTE_UNUSED,
11126 int ignore ATTRIBUTE_UNUSED)
11131 /* Returns true is EXP represents data that would potentially reside
11132 in a readonly section. */
11135 readonly_data_expr (tree exp)
11139 if (TREE_CODE (exp) != ADDR_EXPR)
11142 exp = get_base_address (TREE_OPERAND (exp, 0));
11146 /* Make sure we call decl_readonly_section only for trees it
11147 can handle (since it returns true for everything it doesn't
11149 if (TREE_CODE (exp) == STRING_CST
11150 || TREE_CODE (exp) == CONSTRUCTOR
11151 || (TREE_CODE (exp) == VAR_DECL && TREE_STATIC (exp)))
11152 return decl_readonly_section (exp, 0);
11157 /* Simplify a call to the strstr builtin. S1 and S2 are the arguments
11158 to the call, and TYPE is its return type.
11160 Return NULL_TREE if no simplification was possible, otherwise return the
11161 simplified form of the call as a tree.
11163 The simplified form may be a constant or other expression which
11164 computes the same value, but in a more efficient manner (including
11165 calls to other builtin functions).
11167 The call may contain arguments which need to be evaluated, but
11168 which are not useful to determine the result of the call. In
11169 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11170 COMPOUND_EXPR will be an argument which must be evaluated.
11171 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11172 COMPOUND_EXPR in the chain will contain the tree for the simplified
11173 form of the builtin function call. */
11176 fold_builtin_strstr (location_t loc, tree s1, tree s2, tree type)
11178 if (!validate_arg (s1, POINTER_TYPE)
11179 || !validate_arg (s2, POINTER_TYPE))
11184 const char *p1, *p2;
11186 p2 = c_getstr (s2);
11190 p1 = c_getstr (s1);
11193 const char *r = strstr (p1, p2);
11197 return build_int_cst (TREE_TYPE (s1), 0);
11199 /* Return an offset into the constant string argument. */
11200 tem = fold_build2_loc (loc, POINTER_PLUS_EXPR, TREE_TYPE (s1),
11201 s1, size_int (r - p1));
11202 return fold_convert_loc (loc, type, tem);
11205 /* The argument is const char *, and the result is char *, so we need
11206 a type conversion here to avoid a warning. */
11208 return fold_convert_loc (loc, type, s1);
11213 fn = implicit_built_in_decls[BUILT_IN_STRCHR];
11217 /* New argument list transforming strstr(s1, s2) to
11218 strchr(s1, s2[0]). */
11219 return build_call_expr_loc (loc, fn, 2, s1, build_int_cst (NULL_TREE, p2[0]));
11223 /* Simplify a call to the strchr builtin. S1 and S2 are the arguments to
11224 the call, and TYPE is its return type.
11226 Return NULL_TREE if no simplification was possible, otherwise return the
11227 simplified form of the call as a tree.
11229 The simplified form may be a constant or other expression which
11230 computes the same value, but in a more efficient manner (including
11231 calls to other builtin functions).
11233 The call may contain arguments which need to be evaluated, but
11234 which are not useful to determine the result of the call. In
11235 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11236 COMPOUND_EXPR will be an argument which must be evaluated.
11237 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11238 COMPOUND_EXPR in the chain will contain the tree for the simplified
11239 form of the builtin function call. */
11242 fold_builtin_strchr (location_t loc, tree s1, tree s2, tree type)
11244 if (!validate_arg (s1, POINTER_TYPE)
11245 || !validate_arg (s2, INTEGER_TYPE))
11251 if (TREE_CODE (s2) != INTEGER_CST)
11254 p1 = c_getstr (s1);
11261 if (target_char_cast (s2, &c))
11264 r = strchr (p1, c);
11267 return build_int_cst (TREE_TYPE (s1), 0);
11269 /* Return an offset into the constant string argument. */
11270 tem = fold_build2_loc (loc, POINTER_PLUS_EXPR, TREE_TYPE (s1),
11271 s1, size_int (r - p1));
11272 return fold_convert_loc (loc, type, tem);
11278 /* Simplify a call to the strrchr builtin. S1 and S2 are the arguments to
11279 the call, and TYPE is its return type.
11281 Return NULL_TREE if no simplification was possible, otherwise return the
11282 simplified form of the call as a tree.
11284 The simplified form may be a constant or other expression which
11285 computes the same value, but in a more efficient manner (including
11286 calls to other builtin functions).
11288 The call may contain arguments which need to be evaluated, but
11289 which are not useful to determine the result of the call. In
11290 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11291 COMPOUND_EXPR will be an argument which must be evaluated.
11292 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11293 COMPOUND_EXPR in the chain will contain the tree for the simplified
11294 form of the builtin function call. */
11297 fold_builtin_strrchr (location_t loc, tree s1, tree s2, tree type)
11299 if (!validate_arg (s1, POINTER_TYPE)
11300 || !validate_arg (s2, INTEGER_TYPE))
11307 if (TREE_CODE (s2) != INTEGER_CST)
11310 p1 = c_getstr (s1);
11317 if (target_char_cast (s2, &c))
11320 r = strrchr (p1, c);
11323 return build_int_cst (TREE_TYPE (s1), 0);
11325 /* Return an offset into the constant string argument. */
11326 tem = fold_build2_loc (loc, POINTER_PLUS_EXPR, TREE_TYPE (s1),
11327 s1, size_int (r - p1));
11328 return fold_convert_loc (loc, type, tem);
11331 if (! integer_zerop (s2))
11334 fn = implicit_built_in_decls[BUILT_IN_STRCHR];
11338 /* Transform strrchr(s1, '\0') to strchr(s1, '\0'). */
11339 return build_call_expr_loc (loc, fn, 2, s1, s2);
11343 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
11344 to the call, and TYPE is its return type.
11346 Return NULL_TREE if no simplification was possible, otherwise return the
11347 simplified form of the call as a tree.
11349 The simplified form may be a constant or other expression which
11350 computes the same value, but in a more efficient manner (including
11351 calls to other builtin functions).
11353 The call may contain arguments which need to be evaluated, but
11354 which are not useful to determine the result of the call. In
11355 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11356 COMPOUND_EXPR will be an argument which must be evaluated.
11357 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11358 COMPOUND_EXPR in the chain will contain the tree for the simplified
11359 form of the builtin function call. */
11362 fold_builtin_strpbrk (location_t loc, tree s1, tree s2, tree type)
11364 if (!validate_arg (s1, POINTER_TYPE)
11365 || !validate_arg (s2, POINTER_TYPE))
11370 const char *p1, *p2;
11372 p2 = c_getstr (s2);
11376 p1 = c_getstr (s1);
11379 const char *r = strpbrk (p1, p2);
11383 return build_int_cst (TREE_TYPE (s1), 0);
11385 /* Return an offset into the constant string argument. */
11386 tem = fold_build2_loc (loc, POINTER_PLUS_EXPR, TREE_TYPE (s1),
11387 s1, size_int (r - p1));
11388 return fold_convert_loc (loc, type, tem);
11392 /* strpbrk(x, "") == NULL.
11393 Evaluate and ignore s1 in case it had side-effects. */
11394 return omit_one_operand_loc (loc, TREE_TYPE (s1), integer_zero_node, s1);
11397 return NULL_TREE; /* Really call strpbrk. */
11399 fn = implicit_built_in_decls[BUILT_IN_STRCHR];
11403 /* New argument list transforming strpbrk(s1, s2) to
11404 strchr(s1, s2[0]). */
11405 return build_call_expr_loc (loc, fn, 2, s1, build_int_cst (NULL_TREE, p2[0]));
11409 /* Simplify a call to the strcat builtin. DST and SRC are the arguments
11412 Return NULL_TREE if no simplification was possible, otherwise return the
11413 simplified form of the call as a tree.
11415 The simplified form may be a constant or other expression which
11416 computes the same value, but in a more efficient manner (including
11417 calls to other builtin functions).
11419 The call may contain arguments which need to be evaluated, but
11420 which are not useful to determine the result of the call. In
11421 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11422 COMPOUND_EXPR will be an argument which must be evaluated.
11423 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11424 COMPOUND_EXPR in the chain will contain the tree for the simplified
11425 form of the builtin function call. */
11428 fold_builtin_strcat (location_t loc ATTRIBUTE_UNUSED, tree dst, tree src)
11430 if (!validate_arg (dst, POINTER_TYPE)
11431 || !validate_arg (src, POINTER_TYPE))
11435 const char *p = c_getstr (src);
11437 /* If the string length is zero, return the dst parameter. */
11438 if (p && *p == '\0')
11441 if (optimize_insn_for_speed_p ())
11443 /* See if we can store by pieces into (dst + strlen(dst)). */
11445 tree strlen_fn = implicit_built_in_decls[BUILT_IN_STRLEN];
11446 tree strcpy_fn = implicit_built_in_decls[BUILT_IN_STRCPY];
11448 if (!strlen_fn || !strcpy_fn)
11451 /* If we don't have a movstr we don't want to emit an strcpy
11452 call. We have to do that if the length of the source string
11453 isn't computable (in that case we can use memcpy probably
11454 later expanding to a sequence of mov instructions). If we
11455 have movstr instructions we can emit strcpy calls. */
11458 tree len = c_strlen (src, 1);
11459 if (! len || TREE_SIDE_EFFECTS (len))
11463 /* Stabilize the argument list. */
11464 dst = builtin_save_expr (dst);
11466 /* Create strlen (dst). */
11467 newdst = build_call_expr_loc (loc, strlen_fn, 1, dst);
11468 /* Create (dst p+ strlen (dst)). */
11470 newdst = fold_build2_loc (loc, POINTER_PLUS_EXPR,
11471 TREE_TYPE (dst), dst, newdst);
11472 newdst = builtin_save_expr (newdst);
11474 call = build_call_expr_loc (loc, strcpy_fn, 2, newdst, src);
11475 return build2 (COMPOUND_EXPR, TREE_TYPE (dst), call, dst);
11481 /* Simplify a call to the strncat builtin. DST, SRC, and LEN are the
11482 arguments to the call.
11484 Return NULL_TREE if no simplification was possible, otherwise return the
11485 simplified form of the call as a tree.
11487 The simplified form may be a constant or other expression which
11488 computes the same value, but in a more efficient manner (including
11489 calls to other builtin functions).
11491 The call may contain arguments which need to be evaluated, but
11492 which are not useful to determine the result of the call. In
11493 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11494 COMPOUND_EXPR will be an argument which must be evaluated.
11495 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11496 COMPOUND_EXPR in the chain will contain the tree for the simplified
11497 form of the builtin function call. */
11500 fold_builtin_strncat (location_t loc, tree dst, tree src, tree len)
11502 if (!validate_arg (dst, POINTER_TYPE)
11503 || !validate_arg (src, POINTER_TYPE)
11504 || !validate_arg (len, INTEGER_TYPE))
11508 const char *p = c_getstr (src);
11510 /* If the requested length is zero, or the src parameter string
11511 length is zero, return the dst parameter. */
11512 if (integer_zerop (len) || (p && *p == '\0'))
11513 return omit_two_operands_loc (loc, TREE_TYPE (dst), dst, src, len);
11515 /* If the requested len is greater than or equal to the string
11516 length, call strcat. */
11517 if (TREE_CODE (len) == INTEGER_CST && p
11518 && compare_tree_int (len, strlen (p)) >= 0)
11520 tree fn = implicit_built_in_decls[BUILT_IN_STRCAT];
11522 /* If the replacement _DECL isn't initialized, don't do the
11527 return build_call_expr_loc (loc, fn, 2, dst, src);
11533 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
11536 Return NULL_TREE if no simplification was possible, otherwise return the
11537 simplified form of the call as a tree.
11539 The simplified form may be a constant or other expression which
11540 computes the same value, but in a more efficient manner (including
11541 calls to other builtin functions).
11543 The call may contain arguments which need to be evaluated, but
11544 which are not useful to determine the result of the call. In
11545 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11546 COMPOUND_EXPR will be an argument which must be evaluated.
11547 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11548 COMPOUND_EXPR in the chain will contain the tree for the simplified
11549 form of the builtin function call. */
11552 fold_builtin_strspn (location_t loc, tree s1, tree s2)
11554 if (!validate_arg (s1, POINTER_TYPE)
11555 || !validate_arg (s2, POINTER_TYPE))
11559 const char *p1 = c_getstr (s1), *p2 = c_getstr (s2);
11561 /* If both arguments are constants, evaluate at compile-time. */
11564 const size_t r = strspn (p1, p2);
11565 return size_int (r);
11568 /* If either argument is "", return NULL_TREE. */
11569 if ((p1 && *p1 == '\0') || (p2 && *p2 == '\0'))
11570 /* Evaluate and ignore both arguments in case either one has
11572 return omit_two_operands_loc (loc, size_type_node, size_zero_node,
11578 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
11581 Return NULL_TREE if no simplification was possible, otherwise return the
11582 simplified form of the call as a tree.
11584 The simplified form may be a constant or other expression which
11585 computes the same value, but in a more efficient manner (including
11586 calls to other builtin functions).
11588 The call may contain arguments which need to be evaluated, but
11589 which are not useful to determine the result of the call. In
11590 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11591 COMPOUND_EXPR will be an argument which must be evaluated.
11592 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11593 COMPOUND_EXPR in the chain will contain the tree for the simplified
11594 form of the builtin function call. */
11597 fold_builtin_strcspn (location_t loc, tree s1, tree s2)
11599 if (!validate_arg (s1, POINTER_TYPE)
11600 || !validate_arg (s2, POINTER_TYPE))
11604 const char *p1 = c_getstr (s1), *p2 = c_getstr (s2);
11606 /* If both arguments are constants, evaluate at compile-time. */
11609 const size_t r = strcspn (p1, p2);
11610 return size_int (r);
11613 /* If the first argument is "", return NULL_TREE. */
11614 if (p1 && *p1 == '\0')
11616 /* Evaluate and ignore argument s2 in case it has
11618 return omit_one_operand_loc (loc, size_type_node,
11619 size_zero_node, s2);
11622 /* If the second argument is "", return __builtin_strlen(s1). */
11623 if (p2 && *p2 == '\0')
11625 tree fn = implicit_built_in_decls[BUILT_IN_STRLEN];
11627 /* If the replacement _DECL isn't initialized, don't do the
11632 return build_call_expr_loc (loc, fn, 1, s1);
11638 /* Fold a call to the fputs builtin. ARG0 and ARG1 are the arguments
11639 to the call. IGNORE is true if the value returned
11640 by the builtin will be ignored. UNLOCKED is true is true if this
11641 actually a call to fputs_unlocked. If LEN in non-NULL, it represents
11642 the known length of the string. Return NULL_TREE if no simplification
11646 fold_builtin_fputs (location_t loc, tree arg0, tree arg1,
11647 bool ignore, bool unlocked, tree len)
11649 /* If we're using an unlocked function, assume the other unlocked
11650 functions exist explicitly. */
11651 tree const fn_fputc = unlocked ? built_in_decls[BUILT_IN_FPUTC_UNLOCKED]
11652 : implicit_built_in_decls[BUILT_IN_FPUTC];
11653 tree const fn_fwrite = unlocked ? built_in_decls[BUILT_IN_FWRITE_UNLOCKED]
11654 : implicit_built_in_decls[BUILT_IN_FWRITE];
11656 /* If the return value is used, don't do the transformation. */
11660 /* Verify the arguments in the original call. */
11661 if (!validate_arg (arg0, POINTER_TYPE)
11662 || !validate_arg (arg1, POINTER_TYPE))
11666 len = c_strlen (arg0, 0);
11668 /* Get the length of the string passed to fputs. If the length
11669 can't be determined, punt. */
11671 || TREE_CODE (len) != INTEGER_CST)
11674 switch (compare_tree_int (len, 1))
11676 case -1: /* length is 0, delete the call entirely . */
11677 return omit_one_operand_loc (loc, integer_type_node,
11678 integer_zero_node, arg1);;
11680 case 0: /* length is 1, call fputc. */
11682 const char *p = c_getstr (arg0);
11687 return build_call_expr_loc (loc, fn_fputc, 2,
11688 build_int_cst (NULL_TREE, p[0]), arg1);
11694 case 1: /* length is greater than 1, call fwrite. */
11696 /* If optimizing for size keep fputs. */
11697 if (optimize_function_for_size_p (cfun))
11699 /* New argument list transforming fputs(string, stream) to
11700 fwrite(string, 1, len, stream). */
11702 return build_call_expr_loc (loc, fn_fwrite, 4, arg0,
11703 size_one_node, len, arg1);
11708 gcc_unreachable ();
11713 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
11714 produced. False otherwise. This is done so that we don't output the error
11715 or warning twice or three times. */
11718 fold_builtin_next_arg (tree exp, bool va_start_p)
11720 tree fntype = TREE_TYPE (current_function_decl);
11721 int nargs = call_expr_nargs (exp);
11724 if (TYPE_ARG_TYPES (fntype) == 0
11725 || (TREE_VALUE (tree_last (TYPE_ARG_TYPES (fntype)))
11726 == void_type_node))
11728 error ("%<va_start%> used in function with fixed args");
11734 if (va_start_p && (nargs != 2))
11736 error ("wrong number of arguments to function %<va_start%>");
11739 arg = CALL_EXPR_ARG (exp, 1);
11741 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
11742 when we checked the arguments and if needed issued a warning. */
11747 /* Evidently an out of date version of <stdarg.h>; can't validate
11748 va_start's second argument, but can still work as intended. */
11749 warning (0, "%<__builtin_next_arg%> called without an argument");
11752 else if (nargs > 1)
11754 error ("wrong number of arguments to function %<__builtin_next_arg%>");
11757 arg = CALL_EXPR_ARG (exp, 0);
11760 if (TREE_CODE (arg) == SSA_NAME)
11761 arg = SSA_NAME_VAR (arg);
11763 /* We destructively modify the call to be __builtin_va_start (ap, 0)
11764 or __builtin_next_arg (0) the first time we see it, after checking
11765 the arguments and if needed issuing a warning. */
11766 if (!integer_zerop (arg))
11768 tree last_parm = tree_last (DECL_ARGUMENTS (current_function_decl));
11770 /* Strip off all nops for the sake of the comparison. This
11771 is not quite the same as STRIP_NOPS. It does more.
11772 We must also strip off INDIRECT_EXPR for C++ reference
11774 while (CONVERT_EXPR_P (arg)
11775 || TREE_CODE (arg) == INDIRECT_REF)
11776 arg = TREE_OPERAND (arg, 0);
11777 if (arg != last_parm)
11779 /* FIXME: Sometimes with the tree optimizers we can get the
11780 not the last argument even though the user used the last
11781 argument. We just warn and set the arg to be the last
11782 argument so that we will get wrong-code because of
11784 warning (0, "second parameter of %<va_start%> not last named argument");
11787 /* Undefined by C99 7.15.1.4p4 (va_start):
11788 "If the parameter parmN is declared with the register storage
11789 class, with a function or array type, or with a type that is
11790 not compatible with the type that results after application of
11791 the default argument promotions, the behavior is undefined."
11793 else if (DECL_REGISTER (arg))
11794 warning (0, "undefined behaviour when second parameter of "
11795 "%<va_start%> is declared with %<register%> storage");
11797 /* We want to verify the second parameter just once before the tree
11798 optimizers are run and then avoid keeping it in the tree,
11799 as otherwise we could warn even for correct code like:
11800 void foo (int i, ...)
11801 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
11803 CALL_EXPR_ARG (exp, 1) = integer_zero_node;
11805 CALL_EXPR_ARG (exp, 0) = integer_zero_node;
11811 /* Simplify a call to the sprintf builtin with arguments DEST, FMT, and ORIG.
11812 ORIG may be null if this is a 2-argument call. We don't attempt to
11813 simplify calls with more than 3 arguments.
11815 Return NULL_TREE if no simplification was possible, otherwise return the
11816 simplified form of the call as a tree. If IGNORED is true, it means that
11817 the caller does not use the returned value of the function. */
11820 fold_builtin_sprintf (location_t loc, tree dest, tree fmt,
11821 tree orig, int ignored)
11824 const char *fmt_str = NULL;
11826 /* Verify the required arguments in the original call. We deal with two
11827 types of sprintf() calls: 'sprintf (str, fmt)' and
11828 'sprintf (dest, "%s", orig)'. */
11829 if (!validate_arg (dest, POINTER_TYPE)
11830 || !validate_arg (fmt, POINTER_TYPE))
11832 if (orig && !validate_arg (orig, POINTER_TYPE))
11835 /* Check whether the format is a literal string constant. */
11836 fmt_str = c_getstr (fmt);
11837 if (fmt_str == NULL)
11841 retval = NULL_TREE;
11843 if (!init_target_chars ())
11846 /* If the format doesn't contain % args or %%, use strcpy. */
11847 if (strchr (fmt_str, target_percent) == NULL)
11849 tree fn = implicit_built_in_decls[BUILT_IN_STRCPY];
11854 /* Don't optimize sprintf (buf, "abc", ptr++). */
11858 /* Convert sprintf (str, fmt) into strcpy (str, fmt) when
11859 'format' is known to contain no % formats. */
11860 call = build_call_expr_loc (loc, fn, 2, dest, fmt);
11862 retval = build_int_cst (NULL_TREE, strlen (fmt_str));
11865 /* If the format is "%s", use strcpy if the result isn't used. */
11866 else if (fmt_str && strcmp (fmt_str, target_percent_s) == 0)
11869 fn = implicit_built_in_decls[BUILT_IN_STRCPY];
11874 /* Don't crash on sprintf (str1, "%s"). */
11878 /* Convert sprintf (str1, "%s", str2) into strcpy (str1, str2). */
11881 retval = c_strlen (orig, 1);
11882 if (!retval || TREE_CODE (retval) != INTEGER_CST)
11885 call = build_call_expr_loc (loc, fn, 2, dest, orig);
11888 if (call && retval)
11890 retval = fold_convert_loc
11891 (loc, TREE_TYPE (TREE_TYPE (implicit_built_in_decls[BUILT_IN_SPRINTF])),
11893 return build2 (COMPOUND_EXPR, TREE_TYPE (retval), call, retval);
11899 /* Expand a call EXP to __builtin_object_size. */
11902 expand_builtin_object_size (tree exp)
11905 int object_size_type;
11906 tree fndecl = get_callee_fndecl (exp);
11908 if (!validate_arglist (exp, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
11910 error ("%Kfirst argument of %D must be a pointer, second integer constant",
11912 expand_builtin_trap ();
11916 ost = CALL_EXPR_ARG (exp, 1);
11919 if (TREE_CODE (ost) != INTEGER_CST
11920 || tree_int_cst_sgn (ost) < 0
11921 || compare_tree_int (ost, 3) > 0)
11923 error ("%Klast argument of %D is not integer constant between 0 and 3",
11925 expand_builtin_trap ();
11929 object_size_type = tree_low_cst (ost, 0);
11931 return object_size_type < 2 ? constm1_rtx : const0_rtx;
11934 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
11935 FCODE is the BUILT_IN_* to use.
11936 Return NULL_RTX if we failed; the caller should emit a normal call,
11937 otherwise try to get the result in TARGET, if convenient (and in
11938 mode MODE if that's convenient). */
11941 expand_builtin_memory_chk (tree exp, rtx target, enum machine_mode mode,
11942 enum built_in_function fcode)
11944 tree dest, src, len, size;
11946 if (!validate_arglist (exp,
11948 fcode == BUILT_IN_MEMSET_CHK
11949 ? INTEGER_TYPE : POINTER_TYPE,
11950 INTEGER_TYPE, INTEGER_TYPE, VOID_TYPE))
11953 dest = CALL_EXPR_ARG (exp, 0);
11954 src = CALL_EXPR_ARG (exp, 1);
11955 len = CALL_EXPR_ARG (exp, 2);
11956 size = CALL_EXPR_ARG (exp, 3);
11958 if (! host_integerp (size, 1))
11961 if (host_integerp (len, 1) || integer_all_onesp (size))
11965 if (! integer_all_onesp (size) && tree_int_cst_lt (size, len))
11967 warning_at (tree_nonartificial_location (exp),
11968 0, "%Kcall to %D will always overflow destination buffer",
11969 exp, get_callee_fndecl (exp));
11974 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
11975 mem{cpy,pcpy,move,set} is available. */
11978 case BUILT_IN_MEMCPY_CHK:
11979 fn = built_in_decls[BUILT_IN_MEMCPY];
11981 case BUILT_IN_MEMPCPY_CHK:
11982 fn = built_in_decls[BUILT_IN_MEMPCPY];
11984 case BUILT_IN_MEMMOVE_CHK:
11985 fn = built_in_decls[BUILT_IN_MEMMOVE];
11987 case BUILT_IN_MEMSET_CHK:
11988 fn = built_in_decls[BUILT_IN_MEMSET];
11997 fn = build_call_nofold (fn, 3, dest, src, len);
11998 gcc_assert (TREE_CODE (fn) == CALL_EXPR);
11999 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
12000 return expand_expr (fn, target, mode, EXPAND_NORMAL);
12002 else if (fcode == BUILT_IN_MEMSET_CHK)
12006 unsigned int dest_align
12007 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
12009 /* If DEST is not a pointer type, call the normal function. */
12010 if (dest_align == 0)
12013 /* If SRC and DEST are the same (and not volatile), do nothing. */
12014 if (operand_equal_p (src, dest, 0))
12018 if (fcode != BUILT_IN_MEMPCPY_CHK)
12020 /* Evaluate and ignore LEN in case it has side-effects. */
12021 expand_expr (len, const0_rtx, VOIDmode, EXPAND_NORMAL);
12022 return expand_expr (dest, target, mode, EXPAND_NORMAL);
12025 expr = fold_build2 (POINTER_PLUS_EXPR, TREE_TYPE (dest), dest, len);
12026 return expand_expr (expr, target, mode, EXPAND_NORMAL);
12029 /* __memmove_chk special case. */
12030 if (fcode == BUILT_IN_MEMMOVE_CHK)
12032 unsigned int src_align
12033 = get_pointer_alignment (src, BIGGEST_ALIGNMENT);
12035 if (src_align == 0)
12038 /* If src is categorized for a readonly section we can use
12039 normal __memcpy_chk. */
12040 if (readonly_data_expr (src))
12042 tree fn = built_in_decls[BUILT_IN_MEMCPY_CHK];
12045 fn = build_call_nofold (fn, 4, dest, src, len, size);
12046 gcc_assert (TREE_CODE (fn) == CALL_EXPR);
12047 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
12048 return expand_expr (fn, target, mode, EXPAND_NORMAL);
12055 /* Emit warning if a buffer overflow is detected at compile time. */
12058 maybe_emit_chk_warning (tree exp, enum built_in_function fcode)
12062 location_t loc = tree_nonartificial_location (exp);
12066 case BUILT_IN_STRCPY_CHK:
12067 case BUILT_IN_STPCPY_CHK:
12068 /* For __strcat_chk the warning will be emitted only if overflowing
12069 by at least strlen (dest) + 1 bytes. */
12070 case BUILT_IN_STRCAT_CHK:
12071 len = CALL_EXPR_ARG (exp, 1);
12072 size = CALL_EXPR_ARG (exp, 2);
12075 case BUILT_IN_STRNCAT_CHK:
12076 case BUILT_IN_STRNCPY_CHK:
12077 len = CALL_EXPR_ARG (exp, 2);
12078 size = CALL_EXPR_ARG (exp, 3);
12080 case BUILT_IN_SNPRINTF_CHK:
12081 case BUILT_IN_VSNPRINTF_CHK:
12082 len = CALL_EXPR_ARG (exp, 1);
12083 size = CALL_EXPR_ARG (exp, 3);
12086 gcc_unreachable ();
12092 if (! host_integerp (size, 1) || integer_all_onesp (size))
12097 len = c_strlen (len, 1);
12098 if (! len || ! host_integerp (len, 1) || tree_int_cst_lt (len, size))
12101 else if (fcode == BUILT_IN_STRNCAT_CHK)
12103 tree src = CALL_EXPR_ARG (exp, 1);
12104 if (! src || ! host_integerp (len, 1) || tree_int_cst_lt (len, size))
12106 src = c_strlen (src, 1);
12107 if (! src || ! host_integerp (src, 1))
12109 warning_at (loc, 0, "%Kcall to %D might overflow destination buffer",
12110 exp, get_callee_fndecl (exp));
12113 else if (tree_int_cst_lt (src, size))
12116 else if (! host_integerp (len, 1) || ! tree_int_cst_lt (size, len))
12119 warning_at (loc, 0, "%Kcall to %D will always overflow destination buffer",
12120 exp, get_callee_fndecl (exp));
12123 /* Emit warning if a buffer overflow is detected at compile time
12124 in __sprintf_chk/__vsprintf_chk calls. */
12127 maybe_emit_sprintf_chk_warning (tree exp, enum built_in_function fcode)
12129 tree size, len, fmt;
12130 const char *fmt_str;
12131 int nargs = call_expr_nargs (exp);
12133 /* Verify the required arguments in the original call. */
12137 size = CALL_EXPR_ARG (exp, 2);
12138 fmt = CALL_EXPR_ARG (exp, 3);
12140 if (! host_integerp (size, 1) || integer_all_onesp (size))
12143 /* Check whether the format is a literal string constant. */
12144 fmt_str = c_getstr (fmt);
12145 if (fmt_str == NULL)
12148 if (!init_target_chars ())
12151 /* If the format doesn't contain % args or %%, we know its size. */
12152 if (strchr (fmt_str, target_percent) == 0)
12153 len = build_int_cstu (size_type_node, strlen (fmt_str));
12154 /* If the format is "%s" and first ... argument is a string literal,
12156 else if (fcode == BUILT_IN_SPRINTF_CHK
12157 && strcmp (fmt_str, target_percent_s) == 0)
12163 arg = CALL_EXPR_ARG (exp, 4);
12164 if (! POINTER_TYPE_P (TREE_TYPE (arg)))
12167 len = c_strlen (arg, 1);
12168 if (!len || ! host_integerp (len, 1))
12174 if (! tree_int_cst_lt (len, size))
12175 warning_at (tree_nonartificial_location (exp),
12176 0, "%Kcall to %D will always overflow destination buffer",
12177 exp, get_callee_fndecl (exp));
12180 /* Emit warning if a free is called with address of a variable. */
12183 maybe_emit_free_warning (tree exp)
12185 tree arg = CALL_EXPR_ARG (exp, 0);
12188 if (TREE_CODE (arg) != ADDR_EXPR)
12191 arg = get_base_address (TREE_OPERAND (arg, 0));
12192 if (arg == NULL || INDIRECT_REF_P (arg))
12195 if (SSA_VAR_P (arg))
12196 warning_at (tree_nonartificial_location (exp),
12197 0, "%Kattempt to free a non-heap object %qD", exp, arg);
12199 warning_at (tree_nonartificial_location (exp),
12200 0, "%Kattempt to free a non-heap object", exp);
12203 /* Fold a call to __builtin_object_size with arguments PTR and OST,
12207 fold_builtin_object_size (tree ptr, tree ost)
12209 tree ret = NULL_TREE;
12210 int object_size_type;
12212 if (!validate_arg (ptr, POINTER_TYPE)
12213 || !validate_arg (ost, INTEGER_TYPE))
12218 if (TREE_CODE (ost) != INTEGER_CST
12219 || tree_int_cst_sgn (ost) < 0
12220 || compare_tree_int (ost, 3) > 0)
12223 object_size_type = tree_low_cst (ost, 0);
12225 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
12226 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
12227 and (size_t) 0 for types 2 and 3. */
12228 if (TREE_SIDE_EFFECTS (ptr))
12229 return build_int_cst_type (size_type_node, object_size_type < 2 ? -1 : 0);
12231 if (TREE_CODE (ptr) == ADDR_EXPR)
12232 ret = build_int_cstu (size_type_node,
12233 compute_builtin_object_size (ptr, object_size_type));
12235 else if (TREE_CODE (ptr) == SSA_NAME)
12237 unsigned HOST_WIDE_INT bytes;
12239 /* If object size is not known yet, delay folding until
12240 later. Maybe subsequent passes will help determining
12242 bytes = compute_builtin_object_size (ptr, object_size_type);
12243 if (bytes != (unsigned HOST_WIDE_INT) (object_size_type < 2
12245 ret = build_int_cstu (size_type_node, bytes);
12250 unsigned HOST_WIDE_INT low = TREE_INT_CST_LOW (ret);
12251 HOST_WIDE_INT high = TREE_INT_CST_HIGH (ret);
12252 if (fit_double_type (low, high, &low, &high, TREE_TYPE (ret)))
12259 /* Fold a call to the __mem{cpy,pcpy,move,set}_chk builtin.
12260 DEST, SRC, LEN, and SIZE are the arguments to the call.
12261 IGNORE is true, if return value can be ignored. FCODE is the BUILT_IN_*
12262 code of the builtin. If MAXLEN is not NULL, it is maximum length
12263 passed as third argument. */
12266 fold_builtin_memory_chk (location_t loc, tree fndecl,
12267 tree dest, tree src, tree len, tree size,
12268 tree maxlen, bool ignore,
12269 enum built_in_function fcode)
12273 if (!validate_arg (dest, POINTER_TYPE)
12274 || !validate_arg (src,
12275 (fcode == BUILT_IN_MEMSET_CHK
12276 ? INTEGER_TYPE : POINTER_TYPE))
12277 || !validate_arg (len, INTEGER_TYPE)
12278 || !validate_arg (size, INTEGER_TYPE))
12281 /* If SRC and DEST are the same (and not volatile), return DEST
12282 (resp. DEST+LEN for __mempcpy_chk). */
12283 if (fcode != BUILT_IN_MEMSET_CHK && operand_equal_p (src, dest, 0))
12285 if (fcode != BUILT_IN_MEMPCPY_CHK)
12286 return omit_one_operand_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)),
12290 tree temp = fold_build2_loc (loc, POINTER_PLUS_EXPR, TREE_TYPE (dest),
12292 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), temp);
12296 if (! host_integerp (size, 1))
12299 if (! integer_all_onesp (size))
12301 if (! host_integerp (len, 1))
12303 /* If LEN is not constant, try MAXLEN too.
12304 For MAXLEN only allow optimizing into non-_ocs function
12305 if SIZE is >= MAXLEN, never convert to __ocs_fail (). */
12306 if (maxlen == NULL_TREE || ! host_integerp (maxlen, 1))
12308 if (fcode == BUILT_IN_MEMPCPY_CHK && ignore)
12310 /* (void) __mempcpy_chk () can be optimized into
12311 (void) __memcpy_chk (). */
12312 fn = built_in_decls[BUILT_IN_MEMCPY_CHK];
12316 return build_call_expr_loc (loc, fn, 4, dest, src, len, size);
12324 if (tree_int_cst_lt (size, maxlen))
12329 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
12330 mem{cpy,pcpy,move,set} is available. */
12333 case BUILT_IN_MEMCPY_CHK:
12334 fn = built_in_decls[BUILT_IN_MEMCPY];
12336 case BUILT_IN_MEMPCPY_CHK:
12337 fn = built_in_decls[BUILT_IN_MEMPCPY];
12339 case BUILT_IN_MEMMOVE_CHK:
12340 fn = built_in_decls[BUILT_IN_MEMMOVE];
12342 case BUILT_IN_MEMSET_CHK:
12343 fn = built_in_decls[BUILT_IN_MEMSET];
12352 return build_call_expr_loc (loc, fn, 3, dest, src, len);
12355 /* Fold a call to the __st[rp]cpy_chk builtin.
12356 DEST, SRC, and SIZE are the arguments to the call.
12357 IGNORE is true if return value can be ignored. FCODE is the BUILT_IN_*
12358 code of the builtin. If MAXLEN is not NULL, it is maximum length of
12359 strings passed as second argument. */
12362 fold_builtin_stxcpy_chk (location_t loc, tree fndecl, tree dest,
12363 tree src, tree size,
12364 tree maxlen, bool ignore,
12365 enum built_in_function fcode)
12369 if (!validate_arg (dest, POINTER_TYPE)
12370 || !validate_arg (src, POINTER_TYPE)
12371 || !validate_arg (size, INTEGER_TYPE))
12374 /* If SRC and DEST are the same (and not volatile), return DEST. */
12375 if (fcode == BUILT_IN_STRCPY_CHK && operand_equal_p (src, dest, 0))
12376 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest);
12378 if (! host_integerp (size, 1))
12381 if (! integer_all_onesp (size))
12383 len = c_strlen (src, 1);
12384 if (! len || ! host_integerp (len, 1))
12386 /* If LEN is not constant, try MAXLEN too.
12387 For MAXLEN only allow optimizing into non-_ocs function
12388 if SIZE is >= MAXLEN, never convert to __ocs_fail (). */
12389 if (maxlen == NULL_TREE || ! host_integerp (maxlen, 1))
12391 if (fcode == BUILT_IN_STPCPY_CHK)
12396 /* If return value of __stpcpy_chk is ignored,
12397 optimize into __strcpy_chk. */
12398 fn = built_in_decls[BUILT_IN_STRCPY_CHK];
12402 return build_call_expr_loc (loc, fn, 3, dest, src, size);
12405 if (! len || TREE_SIDE_EFFECTS (len))
12408 /* If c_strlen returned something, but not a constant,
12409 transform __strcpy_chk into __memcpy_chk. */
12410 fn = built_in_decls[BUILT_IN_MEMCPY_CHK];
12414 len = size_binop_loc (loc, PLUS_EXPR, len, ssize_int (1));
12415 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)),
12416 build_call_expr_loc (loc, fn, 4,
12417 dest, src, len, size));
12423 if (! tree_int_cst_lt (maxlen, size))
12427 /* If __builtin_st{r,p}cpy_chk is used, assume st{r,p}cpy is available. */
12428 fn = built_in_decls[fcode == BUILT_IN_STPCPY_CHK
12429 ? BUILT_IN_STPCPY : BUILT_IN_STRCPY];
12433 return build_call_expr_loc (loc, fn, 2, dest, src);
12436 /* Fold a call to the __strncpy_chk builtin. DEST, SRC, LEN, and SIZE
12437 are the arguments to the call. If MAXLEN is not NULL, it is maximum
12438 length passed as third argument. */
12441 fold_builtin_strncpy_chk (location_t loc, tree dest, tree src,
12442 tree len, tree size, tree maxlen)
12446 if (!validate_arg (dest, POINTER_TYPE)
12447 || !validate_arg (src, POINTER_TYPE)
12448 || !validate_arg (len, INTEGER_TYPE)
12449 || !validate_arg (size, INTEGER_TYPE))
12452 if (! host_integerp (size, 1))
12455 if (! integer_all_onesp (size))
12457 if (! host_integerp (len, 1))
12459 /* If LEN is not constant, try MAXLEN too.
12460 For MAXLEN only allow optimizing into non-_ocs function
12461 if SIZE is >= MAXLEN, never convert to __ocs_fail (). */
12462 if (maxlen == NULL_TREE || ! host_integerp (maxlen, 1))
12468 if (tree_int_cst_lt (size, maxlen))
12472 /* If __builtin_strncpy_chk is used, assume strncpy is available. */
12473 fn = built_in_decls[BUILT_IN_STRNCPY];
12477 return build_call_expr_loc (loc, fn, 3, dest, src, len);
12480 /* Fold a call to the __strcat_chk builtin FNDECL. DEST, SRC, and SIZE
12481 are the arguments to the call. */
12484 fold_builtin_strcat_chk (location_t loc, tree fndecl, tree dest,
12485 tree src, tree size)
12490 if (!validate_arg (dest, POINTER_TYPE)
12491 || !validate_arg (src, POINTER_TYPE)
12492 || !validate_arg (size, INTEGER_TYPE))
12495 p = c_getstr (src);
12496 /* If the SRC parameter is "", return DEST. */
12497 if (p && *p == '\0')
12498 return omit_one_operand_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest, src);
12500 if (! host_integerp (size, 1) || ! integer_all_onesp (size))
12503 /* If __builtin_strcat_chk is used, assume strcat is available. */
12504 fn = built_in_decls[BUILT_IN_STRCAT];
12508 return build_call_expr_loc (loc, fn, 2, dest, src);
12511 /* Fold a call to the __strncat_chk builtin with arguments DEST, SRC,
12515 fold_builtin_strncat_chk (location_t loc, tree fndecl,
12516 tree dest, tree src, tree len, tree size)
12521 if (!validate_arg (dest, POINTER_TYPE)
12522 || !validate_arg (src, POINTER_TYPE)
12523 || !validate_arg (size, INTEGER_TYPE)
12524 || !validate_arg (size, INTEGER_TYPE))
12527 p = c_getstr (src);
12528 /* If the SRC parameter is "" or if LEN is 0, return DEST. */
12529 if (p && *p == '\0')
12530 return omit_one_operand_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest, len);
12531 else if (integer_zerop (len))
12532 return omit_one_operand_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest, src);
12534 if (! host_integerp (size, 1))
12537 if (! integer_all_onesp (size))
12539 tree src_len = c_strlen (src, 1);
12541 && host_integerp (src_len, 1)
12542 && host_integerp (len, 1)
12543 && ! tree_int_cst_lt (len, src_len))
12545 /* If LEN >= strlen (SRC), optimize into __strcat_chk. */
12546 fn = built_in_decls[BUILT_IN_STRCAT_CHK];
12550 return build_call_expr_loc (loc, fn, 3, dest, src, size);
12555 /* If __builtin_strncat_chk is used, assume strncat is available. */
12556 fn = built_in_decls[BUILT_IN_STRNCAT];
12560 return build_call_expr_loc (loc, fn, 3, dest, src, len);
12563 /* Fold a call EXP to __{,v}sprintf_chk. Return NULL_TREE if
12564 a normal call should be emitted rather than expanding the function
12565 inline. FCODE is either BUILT_IN_SPRINTF_CHK or BUILT_IN_VSPRINTF_CHK. */
12568 fold_builtin_sprintf_chk (location_t loc, tree exp,
12569 enum built_in_function fcode)
12571 tree dest, size, len, fn, fmt, flag;
12572 const char *fmt_str;
12573 int nargs = call_expr_nargs (exp);
12575 /* Verify the required arguments in the original call. */
12578 dest = CALL_EXPR_ARG (exp, 0);
12579 if (!validate_arg (dest, POINTER_TYPE))
12581 flag = CALL_EXPR_ARG (exp, 1);
12582 if (!validate_arg (flag, INTEGER_TYPE))
12584 size = CALL_EXPR_ARG (exp, 2);
12585 if (!validate_arg (size, INTEGER_TYPE))
12587 fmt = CALL_EXPR_ARG (exp, 3);
12588 if (!validate_arg (fmt, POINTER_TYPE))
12591 if (! host_integerp (size, 1))
12596 if (!init_target_chars ())
12599 /* Check whether the format is a literal string constant. */
12600 fmt_str = c_getstr (fmt);
12601 if (fmt_str != NULL)
12603 /* If the format doesn't contain % args or %%, we know the size. */
12604 if (strchr (fmt_str, target_percent) == 0)
12606 if (fcode != BUILT_IN_SPRINTF_CHK || nargs == 4)
12607 len = build_int_cstu (size_type_node, strlen (fmt_str));
12609 /* If the format is "%s" and first ... argument is a string literal,
12610 we know the size too. */
12611 else if (fcode == BUILT_IN_SPRINTF_CHK
12612 && strcmp (fmt_str, target_percent_s) == 0)
12618 arg = CALL_EXPR_ARG (exp, 4);
12619 if (validate_arg (arg, POINTER_TYPE))
12621 len = c_strlen (arg, 1);
12622 if (! len || ! host_integerp (len, 1))
12629 if (! integer_all_onesp (size))
12631 if (! len || ! tree_int_cst_lt (len, size))
12635 /* Only convert __{,v}sprintf_chk to {,v}sprintf if flag is 0
12636 or if format doesn't contain % chars or is "%s". */
12637 if (! integer_zerop (flag))
12639 if (fmt_str == NULL)
12641 if (strchr (fmt_str, target_percent) != NULL
12642 && strcmp (fmt_str, target_percent_s))
12646 /* If __builtin_{,v}sprintf_chk is used, assume {,v}sprintf is available. */
12647 fn = built_in_decls[fcode == BUILT_IN_VSPRINTF_CHK
12648 ? BUILT_IN_VSPRINTF : BUILT_IN_SPRINTF];
12652 return rewrite_call_expr (loc, exp, 4, fn, 2, dest, fmt);
12655 /* Fold a call EXP to {,v}snprintf. Return NULL_TREE if
12656 a normal call should be emitted rather than expanding the function
12657 inline. FCODE is either BUILT_IN_SNPRINTF_CHK or
12658 BUILT_IN_VSNPRINTF_CHK. If MAXLEN is not NULL, it is maximum length
12659 passed as second argument. */
12662 fold_builtin_snprintf_chk (location_t loc, tree exp, tree maxlen,
12663 enum built_in_function fcode)
12665 tree dest, size, len, fn, fmt, flag;
12666 const char *fmt_str;
12668 /* Verify the required arguments in the original call. */
12669 if (call_expr_nargs (exp) < 5)
12671 dest = CALL_EXPR_ARG (exp, 0);
12672 if (!validate_arg (dest, POINTER_TYPE))
12674 len = CALL_EXPR_ARG (exp, 1);
12675 if (!validate_arg (len, INTEGER_TYPE))
12677 flag = CALL_EXPR_ARG (exp, 2);
12678 if (!validate_arg (flag, INTEGER_TYPE))
12680 size = CALL_EXPR_ARG (exp, 3);
12681 if (!validate_arg (size, INTEGER_TYPE))
12683 fmt = CALL_EXPR_ARG (exp, 4);
12684 if (!validate_arg (fmt, POINTER_TYPE))
12687 if (! host_integerp (size, 1))
12690 if (! integer_all_onesp (size))
12692 if (! host_integerp (len, 1))
12694 /* If LEN is not constant, try MAXLEN too.
12695 For MAXLEN only allow optimizing into non-_ocs function
12696 if SIZE is >= MAXLEN, never convert to __ocs_fail (). */
12697 if (maxlen == NULL_TREE || ! host_integerp (maxlen, 1))
12703 if (tree_int_cst_lt (size, maxlen))
12707 if (!init_target_chars ())
12710 /* Only convert __{,v}snprintf_chk to {,v}snprintf if flag is 0
12711 or if format doesn't contain % chars or is "%s". */
12712 if (! integer_zerop (flag))
12714 fmt_str = c_getstr (fmt);
12715 if (fmt_str == NULL)
12717 if (strchr (fmt_str, target_percent) != NULL
12718 && strcmp (fmt_str, target_percent_s))
12722 /* If __builtin_{,v}snprintf_chk is used, assume {,v}snprintf is
12724 fn = built_in_decls[fcode == BUILT_IN_VSNPRINTF_CHK
12725 ? BUILT_IN_VSNPRINTF : BUILT_IN_SNPRINTF];
12729 return rewrite_call_expr (loc, exp, 5, fn, 3, dest, len, fmt);
12732 /* Fold a call to the {,v}printf{,_unlocked} and __{,v}printf_chk builtins.
12733 FMT and ARG are the arguments to the call; we don't fold cases with
12734 more than 2 arguments, and ARG may be null if this is a 1-argument case.
12736 Return NULL_TREE if no simplification was possible, otherwise return the
12737 simplified form of the call as a tree. FCODE is the BUILT_IN_*
12738 code of the function to be simplified. */
12741 fold_builtin_printf (location_t loc, tree fndecl, tree fmt,
12742 tree arg, bool ignore,
12743 enum built_in_function fcode)
12745 tree fn_putchar, fn_puts, newarg, call = NULL_TREE;
12746 const char *fmt_str = NULL;
12748 /* If the return value is used, don't do the transformation. */
12752 /* Verify the required arguments in the original call. */
12753 if (!validate_arg (fmt, POINTER_TYPE))
12756 /* Check whether the format is a literal string constant. */
12757 fmt_str = c_getstr (fmt);
12758 if (fmt_str == NULL)
12761 if (fcode == BUILT_IN_PRINTF_UNLOCKED)
12763 /* If we're using an unlocked function, assume the other
12764 unlocked functions exist explicitly. */
12765 fn_putchar = built_in_decls[BUILT_IN_PUTCHAR_UNLOCKED];
12766 fn_puts = built_in_decls[BUILT_IN_PUTS_UNLOCKED];
12770 fn_putchar = implicit_built_in_decls[BUILT_IN_PUTCHAR];
12771 fn_puts = implicit_built_in_decls[BUILT_IN_PUTS];
12774 if (!init_target_chars ())
12777 if (strcmp (fmt_str, target_percent_s) == 0
12778 || strchr (fmt_str, target_percent) == NULL)
12782 if (strcmp (fmt_str, target_percent_s) == 0)
12784 if (fcode == BUILT_IN_VPRINTF || fcode == BUILT_IN_VPRINTF_CHK)
12787 if (!arg || !validate_arg (arg, POINTER_TYPE))
12790 str = c_getstr (arg);
12796 /* The format specifier doesn't contain any '%' characters. */
12797 if (fcode != BUILT_IN_VPRINTF && fcode != BUILT_IN_VPRINTF_CHK
12803 /* If the string was "", printf does nothing. */
12804 if (str[0] == '\0')
12805 return build_int_cst (TREE_TYPE (TREE_TYPE (fndecl)), 0);
12807 /* If the string has length of 1, call putchar. */
12808 if (str[1] == '\0')
12810 /* Given printf("c"), (where c is any one character,)
12811 convert "c"[0] to an int and pass that to the replacement
12813 newarg = build_int_cst (NULL_TREE, str[0]);
12815 call = build_call_expr_loc (loc, fn_putchar, 1, newarg);
12819 /* If the string was "string\n", call puts("string"). */
12820 size_t len = strlen (str);
12821 if ((unsigned char)str[len - 1] == target_newline)
12823 /* Create a NUL-terminated string that's one char shorter
12824 than the original, stripping off the trailing '\n'. */
12825 char *newstr = XALLOCAVEC (char, len);
12826 memcpy (newstr, str, len - 1);
12827 newstr[len - 1] = 0;
12829 newarg = build_string_literal (len, newstr);
12831 call = build_call_expr_loc (loc, fn_puts, 1, newarg);
12834 /* We'd like to arrange to call fputs(string,stdout) here,
12835 but we need stdout and don't have a way to get it yet. */
12840 /* The other optimizations can be done only on the non-va_list variants. */
12841 else if (fcode == BUILT_IN_VPRINTF || fcode == BUILT_IN_VPRINTF_CHK)
12844 /* If the format specifier was "%s\n", call __builtin_puts(arg). */
12845 else if (strcmp (fmt_str, target_percent_s_newline) == 0)
12847 if (!arg || !validate_arg (arg, POINTER_TYPE))
12850 call = build_call_expr_loc (loc, fn_puts, 1, arg);
12853 /* If the format specifier was "%c", call __builtin_putchar(arg). */
12854 else if (strcmp (fmt_str, target_percent_c) == 0)
12856 if (!arg || !validate_arg (arg, INTEGER_TYPE))
12859 call = build_call_expr_loc (loc, fn_putchar, 1, arg);
12865 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), call);
12868 /* Fold a call to the {,v}fprintf{,_unlocked} and __{,v}printf_chk builtins.
12869 FP, FMT, and ARG are the arguments to the call. We don't fold calls with
12870 more than 3 arguments, and ARG may be null in the 2-argument case.
12872 Return NULL_TREE if no simplification was possible, otherwise return the
12873 simplified form of the call as a tree. FCODE is the BUILT_IN_*
12874 code of the function to be simplified. */
12877 fold_builtin_fprintf (location_t loc, tree fndecl, tree fp,
12878 tree fmt, tree arg, bool ignore,
12879 enum built_in_function fcode)
12881 tree fn_fputc, fn_fputs, call = NULL_TREE;
12882 const char *fmt_str = NULL;
12884 /* If the return value is used, don't do the transformation. */
12888 /* Verify the required arguments in the original call. */
12889 if (!validate_arg (fp, POINTER_TYPE))
12891 if (!validate_arg (fmt, POINTER_TYPE))
12894 /* Check whether the format is a literal string constant. */
12895 fmt_str = c_getstr (fmt);
12896 if (fmt_str == NULL)
12899 if (fcode == BUILT_IN_FPRINTF_UNLOCKED)
12901 /* If we're using an unlocked function, assume the other
12902 unlocked functions exist explicitly. */
12903 fn_fputc = built_in_decls[BUILT_IN_FPUTC_UNLOCKED];
12904 fn_fputs = built_in_decls[BUILT_IN_FPUTS_UNLOCKED];
12908 fn_fputc = implicit_built_in_decls[BUILT_IN_FPUTC];
12909 fn_fputs = implicit_built_in_decls[BUILT_IN_FPUTS];
12912 if (!init_target_chars ())
12915 /* If the format doesn't contain % args or %%, use strcpy. */
12916 if (strchr (fmt_str, target_percent) == NULL)
12918 if (fcode != BUILT_IN_VFPRINTF && fcode != BUILT_IN_VFPRINTF_CHK
12922 /* If the format specifier was "", fprintf does nothing. */
12923 if (fmt_str[0] == '\0')
12925 /* If FP has side-effects, just wait until gimplification is
12927 if (TREE_SIDE_EFFECTS (fp))
12930 return build_int_cst (TREE_TYPE (TREE_TYPE (fndecl)), 0);
12933 /* When "string" doesn't contain %, replace all cases of
12934 fprintf (fp, string) with fputs (string, fp). The fputs
12935 builtin will take care of special cases like length == 1. */
12937 call = build_call_expr_loc (loc, fn_fputs, 2, fmt, fp);
12940 /* The other optimizations can be done only on the non-va_list variants. */
12941 else if (fcode == BUILT_IN_VFPRINTF || fcode == BUILT_IN_VFPRINTF_CHK)
12944 /* If the format specifier was "%s", call __builtin_fputs (arg, fp). */
12945 else if (strcmp (fmt_str, target_percent_s) == 0)
12947 if (!arg || !validate_arg (arg, POINTER_TYPE))
12950 call = build_call_expr_loc (loc, fn_fputs, 2, arg, fp);
12953 /* If the format specifier was "%c", call __builtin_fputc (arg, fp). */
12954 else if (strcmp (fmt_str, target_percent_c) == 0)
12956 if (!arg || !validate_arg (arg, INTEGER_TYPE))
12959 call = build_call_expr_loc (loc, fn_fputc, 2, arg, fp);
12964 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), call);
12967 /* Initialize format string characters in the target charset. */
12970 init_target_chars (void)
12975 target_newline = lang_hooks.to_target_charset ('\n');
12976 target_percent = lang_hooks.to_target_charset ('%');
12977 target_c = lang_hooks.to_target_charset ('c');
12978 target_s = lang_hooks.to_target_charset ('s');
12979 if (target_newline == 0 || target_percent == 0 || target_c == 0
12983 target_percent_c[0] = target_percent;
12984 target_percent_c[1] = target_c;
12985 target_percent_c[2] = '\0';
12987 target_percent_s[0] = target_percent;
12988 target_percent_s[1] = target_s;
12989 target_percent_s[2] = '\0';
12991 target_percent_s_newline[0] = target_percent;
12992 target_percent_s_newline[1] = target_s;
12993 target_percent_s_newline[2] = target_newline;
12994 target_percent_s_newline[3] = '\0';
13001 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
13002 and no overflow/underflow occurred. INEXACT is true if M was not
13003 exactly calculated. TYPE is the tree type for the result. This
13004 function assumes that you cleared the MPFR flags and then
13005 calculated M to see if anything subsequently set a flag prior to
13006 entering this function. Return NULL_TREE if any checks fail. */
13009 do_mpfr_ckconv (mpfr_srcptr m, tree type, int inexact)
13011 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
13012 overflow/underflow occurred. If -frounding-math, proceed iff the
13013 result of calling FUNC was exact. */
13014 if (mpfr_number_p (m) && !mpfr_overflow_p () && !mpfr_underflow_p ()
13015 && (!flag_rounding_math || !inexact))
13017 REAL_VALUE_TYPE rr;
13019 real_from_mpfr (&rr, m, type, GMP_RNDN);
13020 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
13021 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
13022 but the mpft_t is not, then we underflowed in the
13024 if (real_isfinite (&rr)
13025 && (rr.cl == rvc_zero) == (mpfr_zero_p (m) != 0))
13027 REAL_VALUE_TYPE rmode;
13029 real_convert (&rmode, TYPE_MODE (type), &rr);
13030 /* Proceed iff the specified mode can hold the value. */
13031 if (real_identical (&rmode, &rr))
13032 return build_real (type, rmode);
13039 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
13040 number and no overflow/underflow occurred. INEXACT is true if M
13041 was not exactly calculated. TYPE is the tree type for the result.
13042 This function assumes that you cleared the MPFR flags and then
13043 calculated M to see if anything subsequently set a flag prior to
13044 entering this function. Return NULL_TREE if any checks fail, if
13045 FORCE_CONVERT is true, then bypass the checks. */
13048 do_mpc_ckconv (mpc_srcptr m, tree type, int inexact, int force_convert)
13050 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
13051 overflow/underflow occurred. If -frounding-math, proceed iff the
13052 result of calling FUNC was exact. */
13054 || (mpfr_number_p (mpc_realref (m)) && mpfr_number_p (mpc_imagref (m))
13055 && !mpfr_overflow_p () && !mpfr_underflow_p ()
13056 && (!flag_rounding_math || !inexact)))
13058 REAL_VALUE_TYPE re, im;
13060 real_from_mpfr (&re, mpc_realref (m), type, GMP_RNDN);
13061 real_from_mpfr (&im, mpc_imagref (m), type, GMP_RNDN);
13062 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
13063 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
13064 but the mpft_t is not, then we underflowed in the
13067 || (real_isfinite (&re) && real_isfinite (&im)
13068 && (re.cl == rvc_zero) == (mpfr_zero_p (mpc_realref (m)) != 0)
13069 && (im.cl == rvc_zero) == (mpfr_zero_p (mpc_imagref (m)) != 0)))
13071 REAL_VALUE_TYPE re_mode, im_mode;
13073 real_convert (&re_mode, TYPE_MODE (TREE_TYPE (type)), &re);
13074 real_convert (&im_mode, TYPE_MODE (TREE_TYPE (type)), &im);
13075 /* Proceed iff the specified mode can hold the value. */
13077 || (real_identical (&re_mode, &re)
13078 && real_identical (&im_mode, &im)))
13079 return build_complex (type, build_real (TREE_TYPE (type), re_mode),
13080 build_real (TREE_TYPE (type), im_mode));
13085 #endif /* HAVE_mpc */
13087 /* If argument ARG is a REAL_CST, call the one-argument mpfr function
13088 FUNC on it and return the resulting value as a tree with type TYPE.
13089 If MIN and/or MAX are not NULL, then the supplied ARG must be
13090 within those bounds. If INCLUSIVE is true, then MIN/MAX are
13091 acceptable values, otherwise they are not. The mpfr precision is
13092 set to the precision of TYPE. We assume that function FUNC returns
13093 zero if the result could be calculated exactly within the requested
13097 do_mpfr_arg1 (tree arg, tree type, int (*func)(mpfr_ptr, mpfr_srcptr, mp_rnd_t),
13098 const REAL_VALUE_TYPE *min, const REAL_VALUE_TYPE *max,
13101 tree result = NULL_TREE;
13105 /* To proceed, MPFR must exactly represent the target floating point
13106 format, which only happens when the target base equals two. */
13107 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
13108 && TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
13110 const REAL_VALUE_TYPE *const ra = &TREE_REAL_CST (arg);
13112 if (real_isfinite (ra)
13113 && (!min || real_compare (inclusive ? GE_EXPR: GT_EXPR , ra, min))
13114 && (!max || real_compare (inclusive ? LE_EXPR: LT_EXPR , ra, max)))
13116 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
13117 const int prec = fmt->p;
13118 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
13122 mpfr_init2 (m, prec);
13123 mpfr_from_real (m, ra, GMP_RNDN);
13124 mpfr_clear_flags ();
13125 inexact = func (m, m, rnd);
13126 result = do_mpfr_ckconv (m, type, inexact);
13134 /* If argument ARG is a REAL_CST, call the two-argument mpfr function
13135 FUNC on it and return the resulting value as a tree with type TYPE.
13136 The mpfr precision is set to the precision of TYPE. We assume that
13137 function FUNC returns zero if the result could be calculated
13138 exactly within the requested precision. */
13141 do_mpfr_arg2 (tree arg1, tree arg2, tree type,
13142 int (*func)(mpfr_ptr, mpfr_srcptr, mpfr_srcptr, mp_rnd_t))
13144 tree result = NULL_TREE;
13149 /* To proceed, MPFR must exactly represent the target floating point
13150 format, which only happens when the target base equals two. */
13151 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
13152 && TREE_CODE (arg1) == REAL_CST && !TREE_OVERFLOW (arg1)
13153 && TREE_CODE (arg2) == REAL_CST && !TREE_OVERFLOW (arg2))
13155 const REAL_VALUE_TYPE *const ra1 = &TREE_REAL_CST (arg1);
13156 const REAL_VALUE_TYPE *const ra2 = &TREE_REAL_CST (arg2);
13158 if (real_isfinite (ra1) && real_isfinite (ra2))
13160 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
13161 const int prec = fmt->p;
13162 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
13166 mpfr_inits2 (prec, m1, m2, NULL);
13167 mpfr_from_real (m1, ra1, GMP_RNDN);
13168 mpfr_from_real (m2, ra2, GMP_RNDN);
13169 mpfr_clear_flags ();
13170 inexact = func (m1, m1, m2, rnd);
13171 result = do_mpfr_ckconv (m1, type, inexact);
13172 mpfr_clears (m1, m2, NULL);
13179 /* If argument ARG is a REAL_CST, call the three-argument mpfr function
13180 FUNC on it and return the resulting value as a tree with type TYPE.
13181 The mpfr precision is set to the precision of TYPE. We assume that
13182 function FUNC returns zero if the result could be calculated
13183 exactly within the requested precision. */
13186 do_mpfr_arg3 (tree arg1, tree arg2, tree arg3, tree type,
13187 int (*func)(mpfr_ptr, mpfr_srcptr, mpfr_srcptr, mpfr_srcptr, mp_rnd_t))
13189 tree result = NULL_TREE;
13195 /* To proceed, MPFR must exactly represent the target floating point
13196 format, which only happens when the target base equals two. */
13197 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
13198 && TREE_CODE (arg1) == REAL_CST && !TREE_OVERFLOW (arg1)
13199 && TREE_CODE (arg2) == REAL_CST && !TREE_OVERFLOW (arg2)
13200 && TREE_CODE (arg3) == REAL_CST && !TREE_OVERFLOW (arg3))
13202 const REAL_VALUE_TYPE *const ra1 = &TREE_REAL_CST (arg1);
13203 const REAL_VALUE_TYPE *const ra2 = &TREE_REAL_CST (arg2);
13204 const REAL_VALUE_TYPE *const ra3 = &TREE_REAL_CST (arg3);
13206 if (real_isfinite (ra1) && real_isfinite (ra2) && real_isfinite (ra3))
13208 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
13209 const int prec = fmt->p;
13210 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
13214 mpfr_inits2 (prec, m1, m2, m3, NULL);
13215 mpfr_from_real (m1, ra1, GMP_RNDN);
13216 mpfr_from_real (m2, ra2, GMP_RNDN);
13217 mpfr_from_real (m3, ra3, GMP_RNDN);
13218 mpfr_clear_flags ();
13219 inexact = func (m1, m1, m2, m3, rnd);
13220 result = do_mpfr_ckconv (m1, type, inexact);
13221 mpfr_clears (m1, m2, m3, NULL);
13228 /* If argument ARG is a REAL_CST, call mpfr_sin_cos() on it and set
13229 the pointers *(ARG_SINP) and *(ARG_COSP) to the resulting values.
13230 If ARG_SINP and ARG_COSP are NULL then the result is returned
13231 as a complex value.
13232 The type is taken from the type of ARG and is used for setting the
13233 precision of the calculation and results. */
13236 do_mpfr_sincos (tree arg, tree arg_sinp, tree arg_cosp)
13238 tree const type = TREE_TYPE (arg);
13239 tree result = NULL_TREE;
13243 /* To proceed, MPFR must exactly represent the target floating point
13244 format, which only happens when the target base equals two. */
13245 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
13246 && TREE_CODE (arg) == REAL_CST
13247 && !TREE_OVERFLOW (arg))
13249 const REAL_VALUE_TYPE *const ra = &TREE_REAL_CST (arg);
13251 if (real_isfinite (ra))
13253 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
13254 const int prec = fmt->p;
13255 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
13256 tree result_s, result_c;
13260 mpfr_inits2 (prec, m, ms, mc, NULL);
13261 mpfr_from_real (m, ra, GMP_RNDN);
13262 mpfr_clear_flags ();
13263 inexact = mpfr_sin_cos (ms, mc, m, rnd);
13264 result_s = do_mpfr_ckconv (ms, type, inexact);
13265 result_c = do_mpfr_ckconv (mc, type, inexact);
13266 mpfr_clears (m, ms, mc, NULL);
13267 if (result_s && result_c)
13269 /* If we are to return in a complex value do so. */
13270 if (!arg_sinp && !arg_cosp)
13271 return build_complex (build_complex_type (type),
13272 result_c, result_s);
13274 /* Dereference the sin/cos pointer arguments. */
13275 arg_sinp = build_fold_indirect_ref (arg_sinp);
13276 arg_cosp = build_fold_indirect_ref (arg_cosp);
13277 /* Proceed if valid pointer type were passed in. */
13278 if (TYPE_MAIN_VARIANT (TREE_TYPE (arg_sinp)) == TYPE_MAIN_VARIANT (type)
13279 && TYPE_MAIN_VARIANT (TREE_TYPE (arg_cosp)) == TYPE_MAIN_VARIANT (type))
13281 /* Set the values. */
13282 result_s = fold_build2 (MODIFY_EXPR, type, arg_sinp,
13284 TREE_SIDE_EFFECTS (result_s) = 1;
13285 result_c = fold_build2 (MODIFY_EXPR, type, arg_cosp,
13287 TREE_SIDE_EFFECTS (result_c) = 1;
13288 /* Combine the assignments into a compound expr. */
13289 result = non_lvalue (fold_build2 (COMPOUND_EXPR, type,
13290 result_s, result_c));
13298 /* If argument ARG1 is an INTEGER_CST and ARG2 is a REAL_CST, call the
13299 two-argument mpfr order N Bessel function FUNC on them and return
13300 the resulting value as a tree with type TYPE. The mpfr precision
13301 is set to the precision of TYPE. We assume that function FUNC
13302 returns zero if the result could be calculated exactly within the
13303 requested precision. */
13305 do_mpfr_bessel_n (tree arg1, tree arg2, tree type,
13306 int (*func)(mpfr_ptr, long, mpfr_srcptr, mp_rnd_t),
13307 const REAL_VALUE_TYPE *min, bool inclusive)
13309 tree result = NULL_TREE;
13314 /* To proceed, MPFR must exactly represent the target floating point
13315 format, which only happens when the target base equals two. */
13316 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
13317 && host_integerp (arg1, 0)
13318 && TREE_CODE (arg2) == REAL_CST && !TREE_OVERFLOW (arg2))
13320 const HOST_WIDE_INT n = tree_low_cst(arg1, 0);
13321 const REAL_VALUE_TYPE *const ra = &TREE_REAL_CST (arg2);
13324 && real_isfinite (ra)
13325 && (!min || real_compare (inclusive ? GE_EXPR: GT_EXPR , ra, min)))
13327 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
13328 const int prec = fmt->p;
13329 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
13333 mpfr_init2 (m, prec);
13334 mpfr_from_real (m, ra, GMP_RNDN);
13335 mpfr_clear_flags ();
13336 inexact = func (m, n, m, rnd);
13337 result = do_mpfr_ckconv (m, type, inexact);
13345 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
13346 the pointer *(ARG_QUO) and return the result. The type is taken
13347 from the type of ARG0 and is used for setting the precision of the
13348 calculation and results. */
13351 do_mpfr_remquo (tree arg0, tree arg1, tree arg_quo)
13353 tree const type = TREE_TYPE (arg0);
13354 tree result = NULL_TREE;
13359 /* To proceed, MPFR must exactly represent the target floating point
13360 format, which only happens when the target base equals two. */
13361 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
13362 && TREE_CODE (arg0) == REAL_CST && !TREE_OVERFLOW (arg0)
13363 && TREE_CODE (arg1) == REAL_CST && !TREE_OVERFLOW (arg1))
13365 const REAL_VALUE_TYPE *const ra0 = TREE_REAL_CST_PTR (arg0);
13366 const REAL_VALUE_TYPE *const ra1 = TREE_REAL_CST_PTR (arg1);
13368 if (real_isfinite (ra0) && real_isfinite (ra1))
13370 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
13371 const int prec = fmt->p;
13372 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
13377 mpfr_inits2 (prec, m0, m1, NULL);
13378 mpfr_from_real (m0, ra0, GMP_RNDN);
13379 mpfr_from_real (m1, ra1, GMP_RNDN);
13380 mpfr_clear_flags ();
13381 mpfr_remquo (m0, &integer_quo, m0, m1, rnd);
13382 /* Remquo is independent of the rounding mode, so pass
13383 inexact=0 to do_mpfr_ckconv(). */
13384 result_rem = do_mpfr_ckconv (m0, type, /*inexact=*/ 0);
13385 mpfr_clears (m0, m1, NULL);
13388 /* MPFR calculates quo in the host's long so it may
13389 return more bits in quo than the target int can hold
13390 if sizeof(host long) > sizeof(target int). This can
13391 happen even for native compilers in LP64 mode. In
13392 these cases, modulo the quo value with the largest
13393 number that the target int can hold while leaving one
13394 bit for the sign. */
13395 if (sizeof (integer_quo) * CHAR_BIT > INT_TYPE_SIZE)
13396 integer_quo %= (long)(1UL << (INT_TYPE_SIZE - 1));
13398 /* Dereference the quo pointer argument. */
13399 arg_quo = build_fold_indirect_ref (arg_quo);
13400 /* Proceed iff a valid pointer type was passed in. */
13401 if (TYPE_MAIN_VARIANT (TREE_TYPE (arg_quo)) == integer_type_node)
13403 /* Set the value. */
13404 tree result_quo = fold_build2 (MODIFY_EXPR,
13405 TREE_TYPE (arg_quo), arg_quo,
13406 build_int_cst (NULL, integer_quo));
13407 TREE_SIDE_EFFECTS (result_quo) = 1;
13408 /* Combine the quo assignment with the rem. */
13409 result = non_lvalue (fold_build2 (COMPOUND_EXPR, type,
13410 result_quo, result_rem));
13418 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
13419 resulting value as a tree with type TYPE. The mpfr precision is
13420 set to the precision of TYPE. We assume that this mpfr function
13421 returns zero if the result could be calculated exactly within the
13422 requested precision. In addition, the integer pointer represented
13423 by ARG_SG will be dereferenced and set to the appropriate signgam
13427 do_mpfr_lgamma_r (tree arg, tree arg_sg, tree type)
13429 tree result = NULL_TREE;
13433 /* To proceed, MPFR must exactly represent the target floating point
13434 format, which only happens when the target base equals two. Also
13435 verify ARG is a constant and that ARG_SG is an int pointer. */
13436 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
13437 && TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg)
13438 && TREE_CODE (TREE_TYPE (arg_sg)) == POINTER_TYPE
13439 && TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (arg_sg))) == integer_type_node)
13441 const REAL_VALUE_TYPE *const ra = TREE_REAL_CST_PTR (arg);
13443 /* In addition to NaN and Inf, the argument cannot be zero or a
13444 negative integer. */
13445 if (real_isfinite (ra)
13446 && ra->cl != rvc_zero
13447 && !(real_isneg(ra) && real_isinteger(ra, TYPE_MODE (type))))
13449 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
13450 const int prec = fmt->p;
13451 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
13456 mpfr_init2 (m, prec);
13457 mpfr_from_real (m, ra, GMP_RNDN);
13458 mpfr_clear_flags ();
13459 inexact = mpfr_lgamma (m, &sg, m, rnd);
13460 result_lg = do_mpfr_ckconv (m, type, inexact);
13466 /* Dereference the arg_sg pointer argument. */
13467 arg_sg = build_fold_indirect_ref (arg_sg);
13468 /* Assign the signgam value into *arg_sg. */
13469 result_sg = fold_build2 (MODIFY_EXPR,
13470 TREE_TYPE (arg_sg), arg_sg,
13471 build_int_cst (NULL, sg));
13472 TREE_SIDE_EFFECTS (result_sg) = 1;
13473 /* Combine the signgam assignment with the lgamma result. */
13474 result = non_lvalue (fold_build2 (COMPOUND_EXPR, type,
13475 result_sg, result_lg));
13484 /* If argument ARG is a COMPLEX_CST, call the one-argument mpc
13485 function FUNC on it and return the resulting value as a tree with
13486 type TYPE. The mpfr precision is set to the precision of TYPE. We
13487 assume that function FUNC returns zero if the result could be
13488 calculated exactly within the requested precision. */
13491 do_mpc_arg1 (tree arg, tree type, int (*func)(mpc_ptr, mpc_srcptr, mpc_rnd_t))
13493 tree result = NULL_TREE;
13497 /* To proceed, MPFR must exactly represent the target floating point
13498 format, which only happens when the target base equals two. */
13499 if (TREE_CODE (arg) == COMPLEX_CST && !TREE_OVERFLOW (arg)
13500 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) == REAL_TYPE
13501 && REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (TREE_TYPE (arg))))->b == 2)
13503 const REAL_VALUE_TYPE *const re = TREE_REAL_CST_PTR (TREE_REALPART (arg));
13504 const REAL_VALUE_TYPE *const im = TREE_REAL_CST_PTR (TREE_IMAGPART (arg));
13506 if (real_isfinite (re) && real_isfinite (im))
13508 const struct real_format *const fmt =
13509 REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (type)));
13510 const int prec = fmt->p;
13511 const mp_rnd_t rnd = fmt->round_towards_zero ? GMP_RNDZ : GMP_RNDN;
13512 const mpc_rnd_t crnd = fmt->round_towards_zero ? MPC_RNDZZ : MPC_RNDNN;
13516 mpc_init2 (m, prec);
13517 mpfr_from_real (mpc_realref(m), re, rnd);
13518 mpfr_from_real (mpc_imagref(m), im, rnd);
13519 mpfr_clear_flags ();
13520 inexact = func (m, m, crnd);
13521 result = do_mpc_ckconv (m, type, inexact, /*force_convert=*/ 0);
13529 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
13530 mpc function FUNC on it and return the resulting value as a tree
13531 with type TYPE. The mpfr precision is set to the precision of
13532 TYPE. We assume that function FUNC returns zero if the result
13533 could be calculated exactly within the requested precision. If
13534 DO_NONFINITE is true, then fold expressions containing Inf or NaN
13535 in the arguments and/or results. */
13539 do_mpc_arg2 (tree arg0, tree arg1, tree type, int do_nonfinite,
13540 int (*func)(mpc_ptr, mpc_srcptr, mpc_srcptr, mpc_rnd_t))
13542 tree result = NULL_TREE;
13547 /* To proceed, MPFR must exactly represent the target floating point
13548 format, which only happens when the target base equals two. */
13549 if (TREE_CODE (arg0) == COMPLEX_CST && !TREE_OVERFLOW (arg0)
13550 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE
13551 && TREE_CODE (arg1) == COMPLEX_CST && !TREE_OVERFLOW (arg1)
13552 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg1))) == REAL_TYPE
13553 && REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (TREE_TYPE (arg0))))->b == 2)
13555 const REAL_VALUE_TYPE *const re0 = TREE_REAL_CST_PTR (TREE_REALPART (arg0));
13556 const REAL_VALUE_TYPE *const im0 = TREE_REAL_CST_PTR (TREE_IMAGPART (arg0));
13557 const REAL_VALUE_TYPE *const re1 = TREE_REAL_CST_PTR (TREE_REALPART (arg1));
13558 const REAL_VALUE_TYPE *const im1 = TREE_REAL_CST_PTR (TREE_IMAGPART (arg1));
13561 || (real_isfinite (re0) && real_isfinite (im0)
13562 && real_isfinite (re1) && real_isfinite (im1)))
13564 const struct real_format *const fmt =
13565 REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (type)));
13566 const int prec = fmt->p;
13567 const mp_rnd_t rnd = fmt->round_towards_zero ? GMP_RNDZ : GMP_RNDN;
13568 const mpc_rnd_t crnd = fmt->round_towards_zero ? MPC_RNDZZ : MPC_RNDNN;
13572 mpc_init2 (m0, prec);
13573 mpc_init2 (m1, prec);
13574 mpfr_from_real (mpc_realref(m0), re0, rnd);
13575 mpfr_from_real (mpc_imagref(m0), im0, rnd);
13576 mpfr_from_real (mpc_realref(m1), re1, rnd);
13577 mpfr_from_real (mpc_imagref(m1), im1, rnd);
13578 mpfr_clear_flags ();
13579 inexact = func (m0, m0, m1, crnd);
13580 result = do_mpc_ckconv (m0, type, inexact, do_nonfinite);
13589 #endif /* HAVE_mpc */
13592 The functions below provide an alternate interface for folding
13593 builtin function calls presented as GIMPLE_CALL statements rather
13594 than as CALL_EXPRs. The folded result is still expressed as a
13595 tree. There is too much code duplication in the handling of
13596 varargs functions, and a more intrusive re-factoring would permit
13597 better sharing of code between the tree and statement-based
13598 versions of these functions. */
13600 /* Construct a new CALL_EXPR using the tail of the argument list of STMT
13601 along with N new arguments specified as the "..." parameters. SKIP
13602 is the number of arguments in STMT to be omitted. This function is used
13603 to do varargs-to-varargs transformations. */
13606 gimple_rewrite_call_expr (gimple stmt, int skip, tree fndecl, int n, ...)
13608 int oldnargs = gimple_call_num_args (stmt);
13609 int nargs = oldnargs - skip + n;
13610 tree fntype = TREE_TYPE (fndecl);
13611 tree fn = build1 (ADDR_EXPR, build_pointer_type (fntype), fndecl);
13615 location_t loc = gimple_location (stmt);
13617 buffer = XALLOCAVEC (tree, nargs);
13619 for (i = 0; i < n; i++)
13620 buffer[i] = va_arg (ap, tree);
13622 for (j = skip; j < oldnargs; j++, i++)
13623 buffer[i] = gimple_call_arg (stmt, j);
13625 return fold (build_call_array_loc (loc, TREE_TYPE (fntype), fn, nargs, buffer));
13628 /* Fold a call STMT to __{,v}sprintf_chk. Return NULL_TREE if
13629 a normal call should be emitted rather than expanding the function
13630 inline. FCODE is either BUILT_IN_SPRINTF_CHK or BUILT_IN_VSPRINTF_CHK. */
13633 gimple_fold_builtin_sprintf_chk (gimple stmt, enum built_in_function fcode)
13635 tree dest, size, len, fn, fmt, flag;
13636 const char *fmt_str;
13637 int nargs = gimple_call_num_args (stmt);
13639 /* Verify the required arguments in the original call. */
13642 dest = gimple_call_arg (stmt, 0);
13643 if (!validate_arg (dest, POINTER_TYPE))
13645 flag = gimple_call_arg (stmt, 1);
13646 if (!validate_arg (flag, INTEGER_TYPE))
13648 size = gimple_call_arg (stmt, 2);
13649 if (!validate_arg (size, INTEGER_TYPE))
13651 fmt = gimple_call_arg (stmt, 3);
13652 if (!validate_arg (fmt, POINTER_TYPE))
13655 if (! host_integerp (size, 1))
13660 if (!init_target_chars ())
13663 /* Check whether the format is a literal string constant. */
13664 fmt_str = c_getstr (fmt);
13665 if (fmt_str != NULL)
13667 /* If the format doesn't contain % args or %%, we know the size. */
13668 if (strchr (fmt_str, target_percent) == 0)
13670 if (fcode != BUILT_IN_SPRINTF_CHK || nargs == 4)
13671 len = build_int_cstu (size_type_node, strlen (fmt_str));
13673 /* If the format is "%s" and first ... argument is a string literal,
13674 we know the size too. */
13675 else if (fcode == BUILT_IN_SPRINTF_CHK
13676 && strcmp (fmt_str, target_percent_s) == 0)
13682 arg = gimple_call_arg (stmt, 4);
13683 if (validate_arg (arg, POINTER_TYPE))
13685 len = c_strlen (arg, 1);
13686 if (! len || ! host_integerp (len, 1))
13693 if (! integer_all_onesp (size))
13695 if (! len || ! tree_int_cst_lt (len, size))
13699 /* Only convert __{,v}sprintf_chk to {,v}sprintf if flag is 0
13700 or if format doesn't contain % chars or is "%s". */
13701 if (! integer_zerop (flag))
13703 if (fmt_str == NULL)
13705 if (strchr (fmt_str, target_percent) != NULL
13706 && strcmp (fmt_str, target_percent_s))
13710 /* If __builtin_{,v}sprintf_chk is used, assume {,v}sprintf is available. */
13711 fn = built_in_decls[fcode == BUILT_IN_VSPRINTF_CHK
13712 ? BUILT_IN_VSPRINTF : BUILT_IN_SPRINTF];
13716 return gimple_rewrite_call_expr (stmt, 4, fn, 2, dest, fmt);
13719 /* Fold a call STMT to {,v}snprintf. Return NULL_TREE if
13720 a normal call should be emitted rather than expanding the function
13721 inline. FCODE is either BUILT_IN_SNPRINTF_CHK or
13722 BUILT_IN_VSNPRINTF_CHK. If MAXLEN is not NULL, it is maximum length
13723 passed as second argument. */
13726 gimple_fold_builtin_snprintf_chk (gimple stmt, tree maxlen,
13727 enum built_in_function fcode)
13729 tree dest, size, len, fn, fmt, flag;
13730 const char *fmt_str;
13732 /* Verify the required arguments in the original call. */
13733 if (gimple_call_num_args (stmt) < 5)
13735 dest = gimple_call_arg (stmt, 0);
13736 if (!validate_arg (dest, POINTER_TYPE))
13738 len = gimple_call_arg (stmt, 1);
13739 if (!validate_arg (len, INTEGER_TYPE))
13741 flag = gimple_call_arg (stmt, 2);
13742 if (!validate_arg (flag, INTEGER_TYPE))
13744 size = gimple_call_arg (stmt, 3);
13745 if (!validate_arg (size, INTEGER_TYPE))
13747 fmt = gimple_call_arg (stmt, 4);
13748 if (!validate_arg (fmt, POINTER_TYPE))
13751 if (! host_integerp (size, 1))
13754 if (! integer_all_onesp (size))
13756 if (! host_integerp (len, 1))
13758 /* If LEN is not constant, try MAXLEN too.
13759 For MAXLEN only allow optimizing into non-_ocs function
13760 if SIZE is >= MAXLEN, never convert to __ocs_fail (). */
13761 if (maxlen == NULL_TREE || ! host_integerp (maxlen, 1))
13767 if (tree_int_cst_lt (size, maxlen))
13771 if (!init_target_chars ())
13774 /* Only convert __{,v}snprintf_chk to {,v}snprintf if flag is 0
13775 or if format doesn't contain % chars or is "%s". */
13776 if (! integer_zerop (flag))
13778 fmt_str = c_getstr (fmt);
13779 if (fmt_str == NULL)
13781 if (strchr (fmt_str, target_percent) != NULL
13782 && strcmp (fmt_str, target_percent_s))
13786 /* If __builtin_{,v}snprintf_chk is used, assume {,v}snprintf is
13788 fn = built_in_decls[fcode == BUILT_IN_VSNPRINTF_CHK
13789 ? BUILT_IN_VSNPRINTF : BUILT_IN_SNPRINTF];
13793 return gimple_rewrite_call_expr (stmt, 5, fn, 3, dest, len, fmt);
13796 /* Builtins with folding operations that operate on "..." arguments
13797 need special handling; we need to store the arguments in a convenient
13798 data structure before attempting any folding. Fortunately there are
13799 only a few builtins that fall into this category. FNDECL is the
13800 function, EXP is the CALL_EXPR for the call, and IGNORE is true if the
13801 result of the function call is ignored. */
13804 gimple_fold_builtin_varargs (tree fndecl, gimple stmt,
13805 bool ignore ATTRIBUTE_UNUSED)
13807 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
13808 tree ret = NULL_TREE;
13812 case BUILT_IN_SPRINTF_CHK:
13813 case BUILT_IN_VSPRINTF_CHK:
13814 ret = gimple_fold_builtin_sprintf_chk (stmt, fcode);
13817 case BUILT_IN_SNPRINTF_CHK:
13818 case BUILT_IN_VSNPRINTF_CHK:
13819 ret = gimple_fold_builtin_snprintf_chk (stmt, NULL_TREE, fcode);
13826 ret = build1 (NOP_EXPR, TREE_TYPE (ret), ret);
13827 TREE_NO_WARNING (ret) = 1;
13833 /* A wrapper function for builtin folding that prevents warnings for
13834 "statement without effect" and the like, caused by removing the
13835 call node earlier than the warning is generated. */
13838 fold_call_stmt (gimple stmt, bool ignore)
13840 tree ret = NULL_TREE;
13841 tree fndecl = gimple_call_fndecl (stmt);
13842 location_t loc = gimple_location (stmt);
13844 && TREE_CODE (fndecl) == FUNCTION_DECL
13845 && DECL_BUILT_IN (fndecl)
13846 && !gimple_call_va_arg_pack_p (stmt))
13848 int nargs = gimple_call_num_args (stmt);
13850 if (avoid_folding_inline_builtin (fndecl))
13852 /* FIXME: Don't use a list in this interface. */
13853 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
13855 tree arglist = NULL_TREE;
13857 for (i = nargs - 1; i >= 0; i--)
13858 arglist = tree_cons (NULL_TREE, gimple_call_arg (stmt, i), arglist);
13859 return targetm.fold_builtin (fndecl, arglist, ignore);
13863 if (nargs <= MAX_ARGS_TO_FOLD_BUILTIN)
13865 tree args[MAX_ARGS_TO_FOLD_BUILTIN];
13867 for (i = 0; i < nargs; i++)
13868 args[i] = gimple_call_arg (stmt, i);
13869 ret = fold_builtin_n (loc, fndecl, args, nargs, ignore);
13872 ret = gimple_fold_builtin_varargs (fndecl, stmt, ignore);
13875 /* Propagate location information from original call to
13876 expansion of builtin. Otherwise things like
13877 maybe_emit_chk_warning, that operate on the expansion
13878 of a builtin, will use the wrong location information. */
13879 if (gimple_has_location (stmt))
13881 tree realret = ret;
13882 if (TREE_CODE (ret) == NOP_EXPR)
13883 realret = TREE_OPERAND (ret, 0);
13884 if (CAN_HAVE_LOCATION_P (realret)
13885 && !EXPR_HAS_LOCATION (realret))
13886 SET_EXPR_LOCATION (realret, loc);
13896 /* Look up the function in built_in_decls that corresponds to DECL
13897 and set ASMSPEC as its user assembler name. DECL must be a
13898 function decl that declares a builtin. */
13901 set_builtin_user_assembler_name (tree decl, const char *asmspec)
13904 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL
13905 && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
13908 builtin = built_in_decls [DECL_FUNCTION_CODE (decl)];
13909 set_user_assembler_name (builtin, asmspec);
13910 switch (DECL_FUNCTION_CODE (decl))
13912 case BUILT_IN_MEMCPY:
13913 init_block_move_fn (asmspec);
13914 memcpy_libfunc = set_user_assembler_libfunc ("memcpy", asmspec);
13916 case BUILT_IN_MEMSET:
13917 init_block_clear_fn (asmspec);
13918 memset_libfunc = set_user_assembler_libfunc ("memset", asmspec);
13920 case BUILT_IN_MEMMOVE:
13921 memmove_libfunc = set_user_assembler_libfunc ("memmove", asmspec);
13923 case BUILT_IN_MEMCMP:
13924 memcmp_libfunc = set_user_assembler_libfunc ("memcmp", asmspec);
13926 case BUILT_IN_ABORT:
13927 abort_libfunc = set_user_assembler_libfunc ("abort", asmspec);