1 /* Expand builtin functions.
2 Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
3 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
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
61 static tree do_mpc_arg1 (tree, tree, int (*)(mpc_ptr, mpc_srcptr, mpc_rnd_t));
63 /* Define the names of the builtin function types and codes. */
64 const char *const built_in_class_names[4]
65 = {"NOT_BUILT_IN", "BUILT_IN_FRONTEND", "BUILT_IN_MD", "BUILT_IN_NORMAL"};
67 #define DEF_BUILTIN(X, N, C, T, LT, B, F, NA, AT, IM, COND) #X,
68 const char * built_in_names[(int) END_BUILTINS] =
70 #include "builtins.def"
74 /* Setup an array of _DECL trees, make sure each element is
75 initialized to NULL_TREE. */
76 tree built_in_decls[(int) END_BUILTINS];
77 /* Declarations used when constructing the builtin implicitly in the compiler.
78 It may be NULL_TREE when this is invalid (for instance runtime is not
79 required to implement the function call in all cases). */
80 tree implicit_built_in_decls[(int) END_BUILTINS];
82 static const char *c_getstr (tree);
83 static rtx c_readstr (const char *, enum machine_mode);
84 static int target_char_cast (tree, char *);
85 static rtx get_memory_rtx (tree, tree);
86 static int apply_args_size (void);
87 static int apply_result_size (void);
88 #if defined (HAVE_untyped_call) || defined (HAVE_untyped_return)
89 static rtx result_vector (int, rtx);
91 static void expand_builtin_update_setjmp_buf (rtx);
92 static void expand_builtin_prefetch (tree);
93 static rtx expand_builtin_apply_args (void);
94 static rtx expand_builtin_apply_args_1 (void);
95 static rtx expand_builtin_apply (rtx, rtx, rtx);
96 static void expand_builtin_return (rtx);
97 static enum type_class type_to_class (tree);
98 static rtx expand_builtin_classify_type (tree);
99 static void expand_errno_check (tree, rtx);
100 static rtx expand_builtin_mathfn (tree, rtx, rtx);
101 static rtx expand_builtin_mathfn_2 (tree, rtx, rtx);
102 static rtx expand_builtin_mathfn_3 (tree, rtx, rtx);
103 static rtx expand_builtin_interclass_mathfn (tree, rtx, rtx);
104 static rtx expand_builtin_sincos (tree);
105 static rtx expand_builtin_cexpi (tree, rtx, rtx);
106 static rtx expand_builtin_int_roundingfn (tree, rtx);
107 static rtx expand_builtin_int_roundingfn_2 (tree, rtx);
108 static rtx expand_builtin_args_info (tree);
109 static rtx expand_builtin_next_arg (void);
110 static rtx expand_builtin_va_start (tree);
111 static rtx expand_builtin_va_end (tree);
112 static rtx expand_builtin_va_copy (tree);
113 static rtx expand_builtin_memcmp (tree, rtx, enum machine_mode);
114 static rtx expand_builtin_strcmp (tree, rtx);
115 static rtx expand_builtin_strncmp (tree, rtx, enum machine_mode);
116 static rtx builtin_memcpy_read_str (void *, HOST_WIDE_INT, enum machine_mode);
117 static rtx expand_builtin_memcpy (tree, rtx);
118 static rtx expand_builtin_mempcpy (tree, rtx, enum machine_mode);
119 static rtx expand_builtin_mempcpy_args (tree, tree, tree, rtx,
120 enum machine_mode, int);
121 static rtx expand_builtin_strcpy (tree, rtx);
122 static rtx expand_builtin_strcpy_args (tree, tree, rtx);
123 static rtx expand_builtin_stpcpy (tree, rtx, enum machine_mode);
124 static rtx expand_builtin_strncpy (tree, rtx);
125 static rtx builtin_memset_gen_str (void *, HOST_WIDE_INT, enum machine_mode);
126 static rtx expand_builtin_memset (tree, rtx, enum machine_mode);
127 static rtx expand_builtin_memset_args (tree, tree, tree, rtx, enum machine_mode, tree);
128 static rtx expand_builtin_bzero (tree);
129 static rtx expand_builtin_strlen (tree, rtx, enum machine_mode);
130 static rtx expand_builtin_alloca (tree, rtx);
131 static rtx expand_builtin_unop (enum machine_mode, tree, rtx, rtx, optab);
132 static rtx expand_builtin_frame_address (tree, tree);
133 static tree stabilize_va_list_loc (location_t, tree, int);
134 static rtx expand_builtin_expect (tree, rtx);
135 static tree fold_builtin_constant_p (tree);
136 static tree fold_builtin_expect (location_t, tree, tree);
137 static tree fold_builtin_classify_type (tree);
138 static tree fold_builtin_strlen (location_t, tree, tree);
139 static tree fold_builtin_inf (location_t, tree, int);
140 static tree fold_builtin_nan (tree, tree, int);
141 static tree rewrite_call_expr (location_t, tree, int, tree, int, ...);
142 static bool validate_arg (const_tree, enum tree_code code);
143 static bool integer_valued_real_p (tree);
144 static tree fold_trunc_transparent_mathfn (location_t, tree, tree);
145 static bool readonly_data_expr (tree);
146 static rtx expand_builtin_fabs (tree, rtx, rtx);
147 static rtx expand_builtin_signbit (tree, rtx);
148 static tree fold_builtin_sqrt (location_t, tree, tree);
149 static tree fold_builtin_cbrt (location_t, tree, tree);
150 static tree fold_builtin_pow (location_t, tree, tree, tree, tree);
151 static tree fold_builtin_powi (location_t, tree, tree, tree, tree);
152 static tree fold_builtin_cos (location_t, tree, tree, tree);
153 static tree fold_builtin_cosh (location_t, tree, tree, tree);
154 static tree fold_builtin_tan (tree, tree);
155 static tree fold_builtin_trunc (location_t, tree, tree);
156 static tree fold_builtin_floor (location_t, tree, tree);
157 static tree fold_builtin_ceil (location_t, tree, tree);
158 static tree fold_builtin_round (location_t, tree, tree);
159 static tree fold_builtin_int_roundingfn (location_t, tree, tree);
160 static tree fold_builtin_bitop (tree, tree);
161 static tree fold_builtin_memory_op (location_t, tree, tree, tree, tree, bool, int);
162 static tree fold_builtin_strchr (location_t, tree, tree, tree);
163 static tree fold_builtin_memchr (location_t, tree, tree, tree, tree);
164 static tree fold_builtin_memcmp (location_t, tree, tree, tree);
165 static tree fold_builtin_strcmp (location_t, tree, tree);
166 static tree fold_builtin_strncmp (location_t, tree, tree, tree);
167 static tree fold_builtin_signbit (location_t, tree, tree);
168 static tree fold_builtin_copysign (location_t, tree, tree, tree, tree);
169 static tree fold_builtin_isascii (location_t, tree);
170 static tree fold_builtin_toascii (location_t, tree);
171 static tree fold_builtin_isdigit (location_t, tree);
172 static tree fold_builtin_fabs (location_t, tree, tree);
173 static tree fold_builtin_abs (location_t, tree, tree);
174 static tree fold_builtin_unordered_cmp (location_t, tree, tree, tree, enum tree_code,
176 static tree fold_builtin_n (location_t, tree, tree *, int, bool);
177 static tree fold_builtin_0 (location_t, tree, bool);
178 static tree fold_builtin_1 (location_t, tree, tree, bool);
179 static tree fold_builtin_2 (location_t, tree, tree, tree, bool);
180 static tree fold_builtin_3 (location_t, tree, tree, tree, tree, bool);
181 static tree fold_builtin_4 (location_t, tree, tree, tree, tree, tree, bool);
182 static tree fold_builtin_varargs (location_t, tree, tree, bool);
184 static tree fold_builtin_strpbrk (location_t, tree, tree, tree);
185 static tree fold_builtin_strstr (location_t, tree, tree, tree);
186 static tree fold_builtin_strrchr (location_t, tree, tree, tree);
187 static tree fold_builtin_strcat (location_t, tree, tree);
188 static tree fold_builtin_strncat (location_t, tree, tree, tree);
189 static tree fold_builtin_strspn (location_t, tree, tree);
190 static tree fold_builtin_strcspn (location_t, tree, tree);
191 static tree fold_builtin_sprintf (location_t, tree, tree, tree, int);
193 static rtx expand_builtin_object_size (tree);
194 static rtx expand_builtin_memory_chk (tree, rtx, enum machine_mode,
195 enum built_in_function);
196 static void maybe_emit_chk_warning (tree, enum built_in_function);
197 static void maybe_emit_sprintf_chk_warning (tree, enum built_in_function);
198 static void maybe_emit_free_warning (tree);
199 static tree fold_builtin_object_size (tree, tree);
200 static tree fold_builtin_strcat_chk (location_t, tree, tree, tree, tree);
201 static tree fold_builtin_strncat_chk (location_t, tree, tree, tree, tree, tree);
202 static tree fold_builtin_sprintf_chk (location_t, tree, enum built_in_function);
203 static tree fold_builtin_printf (location_t, tree, tree, tree, bool, enum built_in_function);
204 static tree fold_builtin_fprintf (location_t, tree, tree, tree, tree, bool,
205 enum built_in_function);
206 static bool init_target_chars (void);
208 static unsigned HOST_WIDE_INT target_newline;
209 static unsigned HOST_WIDE_INT target_percent;
210 static unsigned HOST_WIDE_INT target_c;
211 static unsigned HOST_WIDE_INT target_s;
212 static char target_percent_c[3];
213 static char target_percent_s[3];
214 static char target_percent_s_newline[4];
215 static tree do_mpfr_arg1 (tree, tree, int (*)(mpfr_ptr, mpfr_srcptr, mp_rnd_t),
216 const REAL_VALUE_TYPE *, const REAL_VALUE_TYPE *, bool);
217 static tree do_mpfr_arg2 (tree, tree, tree,
218 int (*)(mpfr_ptr, mpfr_srcptr, mpfr_srcptr, mp_rnd_t));
219 static tree do_mpfr_arg3 (tree, tree, tree, tree,
220 int (*)(mpfr_ptr, mpfr_srcptr, mpfr_srcptr, mpfr_srcptr, mp_rnd_t));
221 static tree do_mpfr_sincos (tree, tree, tree);
222 static tree do_mpfr_bessel_n (tree, tree, tree,
223 int (*)(mpfr_ptr, long, mpfr_srcptr, mp_rnd_t),
224 const REAL_VALUE_TYPE *, bool);
225 static tree do_mpfr_remquo (tree, tree, tree);
226 static tree do_mpfr_lgamma_r (tree, tree, tree);
228 /* Return true if NAME starts with __builtin_ or __sync_. */
231 is_builtin_name (const char *name)
233 if (strncmp (name, "__builtin_", 10) == 0)
235 if (strncmp (name, "__sync_", 7) == 0)
241 /* Return true if DECL is a function symbol representing a built-in. */
244 is_builtin_fn (tree decl)
246 return TREE_CODE (decl) == FUNCTION_DECL && DECL_BUILT_IN (decl);
250 /* Return true if NODE should be considered for inline expansion regardless
251 of the optimization level. This means whenever a function is invoked with
252 its "internal" name, which normally contains the prefix "__builtin". */
255 called_as_built_in (tree node)
257 /* Note that we must use DECL_NAME, not DECL_ASSEMBLER_NAME_SET_P since
258 we want the name used to call the function, not the name it
260 const char *name = IDENTIFIER_POINTER (DECL_NAME (node));
261 return is_builtin_name (name);
264 /* Return the alignment in bits of EXP, an object.
265 Don't return more than MAX_ALIGN no matter what, ALIGN is the inital
266 guessed alignment e.g. from type alignment. */
269 get_object_alignment (tree exp, unsigned int align, unsigned int max_align)
274 if (handled_component_p (exp))
276 HOST_WIDE_INT bitsize, bitpos;
278 enum machine_mode mode;
279 int unsignedp, volatilep;
281 exp = get_inner_reference (exp, &bitsize, &bitpos, &offset,
282 &mode, &unsignedp, &volatilep, true);
284 inner = MIN (inner, (unsigned) (bitpos & -bitpos));
289 if (TREE_CODE (offset) == PLUS_EXPR)
291 next_offset = TREE_OPERAND (offset, 0);
292 offset = TREE_OPERAND (offset, 1);
296 if (host_integerp (offset, 1))
298 /* Any overflow in calculating offset_bits won't change
301 = ((unsigned) tree_low_cst (offset, 1) * BITS_PER_UNIT);
304 inner = MIN (inner, (offset_bits & -offset_bits));
306 else if (TREE_CODE (offset) == MULT_EXPR
307 && host_integerp (TREE_OPERAND (offset, 1), 1))
309 /* Any overflow in calculating offset_factor won't change
311 unsigned offset_factor
312 = ((unsigned) tree_low_cst (TREE_OPERAND (offset, 1), 1)
316 inner = MIN (inner, (offset_factor & -offset_factor));
320 inner = MIN (inner, BITS_PER_UNIT);
323 offset = next_offset;
326 if (TREE_CODE (exp) == CONST_DECL)
327 exp = DECL_INITIAL (exp);
329 && TREE_CODE (exp) != LABEL_DECL)
330 align = MIN (inner, DECL_ALIGN (exp));
331 #ifdef CONSTANT_ALIGNMENT
332 else if (CONSTANT_CLASS_P (exp))
333 align = MIN (inner, (unsigned)CONSTANT_ALIGNMENT (exp, align));
335 else if (TREE_CODE (exp) == VIEW_CONVERT_EXPR
336 || TREE_CODE (exp) == INDIRECT_REF)
337 align = MIN (TYPE_ALIGN (TREE_TYPE (exp)), inner);
339 align = MIN (align, inner);
340 return MIN (align, max_align);
343 /* Returns true iff we can trust that alignment information has been
344 calculated properly. */
347 can_trust_pointer_alignment (void)
349 /* We rely on TER to compute accurate alignment information. */
350 return (optimize && flag_tree_ter);
353 /* Return the alignment in bits of EXP, a pointer valued expression.
354 But don't return more than MAX_ALIGN no matter what.
355 The alignment returned is, by default, the alignment of the thing that
356 EXP points to. If it is not a POINTER_TYPE, 0 is returned.
358 Otherwise, look at the expression to see if we can do better, i.e., if the
359 expression is actually pointing at an object whose alignment is tighter. */
362 get_pointer_alignment (tree exp, unsigned int max_align)
364 unsigned int align, inner;
366 if (!can_trust_pointer_alignment ())
369 if (!POINTER_TYPE_P (TREE_TYPE (exp)))
372 align = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (exp)));
373 align = MIN (align, max_align);
377 switch (TREE_CODE (exp))
380 exp = TREE_OPERAND (exp, 0);
381 if (! POINTER_TYPE_P (TREE_TYPE (exp)))
384 inner = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (exp)));
385 align = MIN (inner, max_align);
388 case POINTER_PLUS_EXPR:
389 /* If sum of pointer + int, restrict our maximum alignment to that
390 imposed by the integer. If not, we can't do any better than
392 if (! host_integerp (TREE_OPERAND (exp, 1), 1))
395 while (((tree_low_cst (TREE_OPERAND (exp, 1), 1))
396 & (max_align / BITS_PER_UNIT - 1))
400 exp = TREE_OPERAND (exp, 0);
404 /* See what we are pointing at and look at its alignment. */
405 return get_object_alignment (TREE_OPERAND (exp, 0), align, max_align);
413 /* Compute the length of a C string. TREE_STRING_LENGTH is not the right
414 way, because it could contain a zero byte in the middle.
415 TREE_STRING_LENGTH is the size of the character array, not the string.
417 ONLY_VALUE should be nonzero if the result is not going to be emitted
418 into the instruction stream and zero if it is going to be expanded.
419 E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3
420 is returned, otherwise NULL, since
421 len = c_strlen (src, 1); if (len) expand_expr (len, ...); would not
422 evaluate the side-effects.
424 The value returned is of type `ssizetype'.
426 Unfortunately, string_constant can't access the values of const char
427 arrays with initializers, so neither can we do so here. */
430 c_strlen (tree src, int only_value)
433 HOST_WIDE_INT offset;
439 if (TREE_CODE (src) == COND_EXPR
440 && (only_value || !TREE_SIDE_EFFECTS (TREE_OPERAND (src, 0))))
444 len1 = c_strlen (TREE_OPERAND (src, 1), only_value);
445 len2 = c_strlen (TREE_OPERAND (src, 2), only_value);
446 if (tree_int_cst_equal (len1, len2))
450 if (TREE_CODE (src) == COMPOUND_EXPR
451 && (only_value || !TREE_SIDE_EFFECTS (TREE_OPERAND (src, 0))))
452 return c_strlen (TREE_OPERAND (src, 1), only_value);
454 if (EXPR_HAS_LOCATION (src))
455 loc = EXPR_LOCATION (src);
457 loc = input_location;
459 src = string_constant (src, &offset_node);
463 max = TREE_STRING_LENGTH (src) - 1;
464 ptr = TREE_STRING_POINTER (src);
466 if (offset_node && TREE_CODE (offset_node) != INTEGER_CST)
468 /* If the string has an internal zero byte (e.g., "foo\0bar"), we can't
469 compute the offset to the following null if we don't know where to
470 start searching for it. */
473 for (i = 0; i < max; i++)
477 /* We don't know the starting offset, but we do know that the string
478 has no internal zero bytes. We can assume that the offset falls
479 within the bounds of the string; otherwise, the programmer deserves
480 what he gets. Subtract the offset from the length of the string,
481 and return that. This would perhaps not be valid if we were dealing
482 with named arrays in addition to literal string constants. */
484 return size_diffop_loc (loc, size_int (max), offset_node);
487 /* We have a known offset into the string. Start searching there for
488 a null character if we can represent it as a single HOST_WIDE_INT. */
489 if (offset_node == 0)
491 else if (! host_integerp (offset_node, 0))
494 offset = tree_low_cst (offset_node, 0);
496 /* If the offset is known to be out of bounds, warn, and call strlen at
498 if (offset < 0 || offset > max)
500 /* Suppress multiple warnings for propagated constant strings. */
501 if (! TREE_NO_WARNING (src))
503 warning_at (loc, 0, "offset outside bounds of constant string");
504 TREE_NO_WARNING (src) = 1;
509 /* Use strlen to search for the first zero byte. Since any strings
510 constructed with build_string will have nulls appended, we win even
511 if we get handed something like (char[4])"abcd".
513 Since OFFSET is our starting index into the string, no further
514 calculation is needed. */
515 return ssize_int (strlen (ptr + offset));
518 /* Return a char pointer for a C string if it is a string constant
519 or sum of string constant and integer constant. */
526 src = string_constant (src, &offset_node);
530 if (offset_node == 0)
531 return TREE_STRING_POINTER (src);
532 else if (!host_integerp (offset_node, 1)
533 || compare_tree_int (offset_node, TREE_STRING_LENGTH (src) - 1) > 0)
536 return TREE_STRING_POINTER (src) + tree_low_cst (offset_node, 1);
539 /* Return a CONST_INT or CONST_DOUBLE corresponding to target reading
540 GET_MODE_BITSIZE (MODE) bits from string constant STR. */
543 c_readstr (const char *str, enum machine_mode mode)
549 gcc_assert (GET_MODE_CLASS (mode) == MODE_INT);
554 for (i = 0; i < GET_MODE_SIZE (mode); i++)
557 if (WORDS_BIG_ENDIAN)
558 j = GET_MODE_SIZE (mode) - i - 1;
559 if (BYTES_BIG_ENDIAN != WORDS_BIG_ENDIAN
560 && GET_MODE_SIZE (mode) > UNITS_PER_WORD)
561 j = j + UNITS_PER_WORD - 2 * (j % UNITS_PER_WORD) - 1;
563 gcc_assert (j < 2 * HOST_BITS_PER_WIDE_INT);
566 ch = (unsigned char) str[i];
567 c[j / HOST_BITS_PER_WIDE_INT] |= ch << (j % HOST_BITS_PER_WIDE_INT);
569 return immed_double_const (c[0], c[1], mode);
572 /* Cast a target constant CST to target CHAR and if that value fits into
573 host char type, return zero and put that value into variable pointed to by
577 target_char_cast (tree cst, char *p)
579 unsigned HOST_WIDE_INT val, hostval;
581 if (!host_integerp (cst, 1)
582 || CHAR_TYPE_SIZE > HOST_BITS_PER_WIDE_INT)
585 val = tree_low_cst (cst, 1);
586 if (CHAR_TYPE_SIZE < HOST_BITS_PER_WIDE_INT)
587 val &= (((unsigned HOST_WIDE_INT) 1) << CHAR_TYPE_SIZE) - 1;
590 if (HOST_BITS_PER_CHAR < HOST_BITS_PER_WIDE_INT)
591 hostval &= (((unsigned HOST_WIDE_INT) 1) << HOST_BITS_PER_CHAR) - 1;
600 /* Similar to save_expr, but assumes that arbitrary code is not executed
601 in between the multiple evaluations. In particular, we assume that a
602 non-addressable local variable will not be modified. */
605 builtin_save_expr (tree exp)
607 if (TREE_ADDRESSABLE (exp) == 0
608 && (TREE_CODE (exp) == PARM_DECL
609 || (TREE_CODE (exp) == VAR_DECL && !TREE_STATIC (exp))))
612 return save_expr (exp);
615 /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT
616 times to get the address of either a higher stack frame, or a return
617 address located within it (depending on FNDECL_CODE). */
620 expand_builtin_return_addr (enum built_in_function fndecl_code, int count)
624 #ifdef INITIAL_FRAME_ADDRESS_RTX
625 rtx tem = INITIAL_FRAME_ADDRESS_RTX;
629 /* For a zero count with __builtin_return_address, we don't care what
630 frame address we return, because target-specific definitions will
631 override us. Therefore frame pointer elimination is OK, and using
632 the soft frame pointer is OK.
634 For a nonzero count, or a zero count with __builtin_frame_address,
635 we require a stable offset from the current frame pointer to the
636 previous one, so we must use the hard frame pointer, and
637 we must disable frame pointer elimination. */
638 if (count == 0 && fndecl_code == BUILT_IN_RETURN_ADDRESS)
639 tem = frame_pointer_rtx;
642 tem = hard_frame_pointer_rtx;
644 /* Tell reload not to eliminate the frame pointer. */
645 crtl->accesses_prior_frames = 1;
649 /* Some machines need special handling before we can access
650 arbitrary frames. For example, on the SPARC, we must first flush
651 all register windows to the stack. */
652 #ifdef SETUP_FRAME_ADDRESSES
654 SETUP_FRAME_ADDRESSES ();
657 /* On the SPARC, the return address is not in the frame, it is in a
658 register. There is no way to access it off of the current frame
659 pointer, but it can be accessed off the previous frame pointer by
660 reading the value from the register window save area. */
661 #ifdef RETURN_ADDR_IN_PREVIOUS_FRAME
662 if (fndecl_code == BUILT_IN_RETURN_ADDRESS)
666 /* Scan back COUNT frames to the specified frame. */
667 for (i = 0; i < count; i++)
669 /* Assume the dynamic chain pointer is in the word that the
670 frame address points to, unless otherwise specified. */
671 #ifdef DYNAMIC_CHAIN_ADDRESS
672 tem = DYNAMIC_CHAIN_ADDRESS (tem);
674 tem = memory_address (Pmode, tem);
675 tem = gen_frame_mem (Pmode, tem);
676 tem = copy_to_reg (tem);
679 /* For __builtin_frame_address, return what we've got. But, on
680 the SPARC for example, we may have to add a bias. */
681 if (fndecl_code == BUILT_IN_FRAME_ADDRESS)
682 #ifdef FRAME_ADDR_RTX
683 return FRAME_ADDR_RTX (tem);
688 /* For __builtin_return_address, get the return address from that frame. */
689 #ifdef RETURN_ADDR_RTX
690 tem = RETURN_ADDR_RTX (count, tem);
692 tem = memory_address (Pmode,
693 plus_constant (tem, GET_MODE_SIZE (Pmode)));
694 tem = gen_frame_mem (Pmode, tem);
699 /* Alias set used for setjmp buffer. */
700 static alias_set_type setjmp_alias_set = -1;
702 /* Construct the leading half of a __builtin_setjmp call. Control will
703 return to RECEIVER_LABEL. This is also called directly by the SJLJ
704 exception handling code. */
707 expand_builtin_setjmp_setup (rtx buf_addr, rtx receiver_label)
709 enum machine_mode sa_mode = STACK_SAVEAREA_MODE (SAVE_NONLOCAL);
713 if (setjmp_alias_set == -1)
714 setjmp_alias_set = new_alias_set ();
716 buf_addr = convert_memory_address (Pmode, buf_addr);
718 buf_addr = force_reg (Pmode, force_operand (buf_addr, NULL_RTX));
720 /* We store the frame pointer and the address of receiver_label in
721 the buffer and use the rest of it for the stack save area, which
722 is machine-dependent. */
724 mem = gen_rtx_MEM (Pmode, buf_addr);
725 set_mem_alias_set (mem, setjmp_alias_set);
726 emit_move_insn (mem, targetm.builtin_setjmp_frame_value ());
728 mem = gen_rtx_MEM (Pmode, plus_constant (buf_addr, GET_MODE_SIZE (Pmode))),
729 set_mem_alias_set (mem, setjmp_alias_set);
731 emit_move_insn (validize_mem (mem),
732 force_reg (Pmode, gen_rtx_LABEL_REF (Pmode, receiver_label)));
734 stack_save = gen_rtx_MEM (sa_mode,
735 plus_constant (buf_addr,
736 2 * GET_MODE_SIZE (Pmode)));
737 set_mem_alias_set (stack_save, setjmp_alias_set);
738 emit_stack_save (SAVE_NONLOCAL, &stack_save, NULL_RTX);
740 /* If there is further processing to do, do it. */
741 #ifdef HAVE_builtin_setjmp_setup
742 if (HAVE_builtin_setjmp_setup)
743 emit_insn (gen_builtin_setjmp_setup (buf_addr));
746 /* Tell optimize_save_area_alloca that extra work is going to
747 need to go on during alloca. */
748 cfun->calls_setjmp = 1;
750 /* We have a nonlocal label. */
751 cfun->has_nonlocal_label = 1;
754 /* Construct the trailing part of a __builtin_setjmp call. This is
755 also called directly by the SJLJ exception handling code. */
758 expand_builtin_setjmp_receiver (rtx receiver_label ATTRIBUTE_UNUSED)
762 /* Clobber the FP when we get here, so we have to make sure it's
763 marked as used by this function. */
764 emit_use (hard_frame_pointer_rtx);
766 /* Mark the static chain as clobbered here so life information
767 doesn't get messed up for it. */
768 chain = targetm.calls.static_chain (current_function_decl, true);
769 if (chain && REG_P (chain))
770 emit_clobber (chain);
772 /* Now put in the code to restore the frame pointer, and argument
773 pointer, if needed. */
774 #ifdef HAVE_nonlocal_goto
775 if (! HAVE_nonlocal_goto)
778 emit_move_insn (virtual_stack_vars_rtx, hard_frame_pointer_rtx);
779 /* This might change the hard frame pointer in ways that aren't
780 apparent to early optimization passes, so force a clobber. */
781 emit_clobber (hard_frame_pointer_rtx);
784 #if ARG_POINTER_REGNUM != HARD_FRAME_POINTER_REGNUM
785 if (fixed_regs[ARG_POINTER_REGNUM])
787 #ifdef ELIMINABLE_REGS
789 static const struct elims {const int from, to;} elim_regs[] = ELIMINABLE_REGS;
791 for (i = 0; i < ARRAY_SIZE (elim_regs); i++)
792 if (elim_regs[i].from == ARG_POINTER_REGNUM
793 && elim_regs[i].to == HARD_FRAME_POINTER_REGNUM)
796 if (i == ARRAY_SIZE (elim_regs))
799 /* Now restore our arg pointer from the address at which it
800 was saved in our stack frame. */
801 emit_move_insn (crtl->args.internal_arg_pointer,
802 copy_to_reg (get_arg_pointer_save_area ()));
807 #ifdef HAVE_builtin_setjmp_receiver
808 if (HAVE_builtin_setjmp_receiver)
809 emit_insn (gen_builtin_setjmp_receiver (receiver_label));
812 #ifdef HAVE_nonlocal_goto_receiver
813 if (HAVE_nonlocal_goto_receiver)
814 emit_insn (gen_nonlocal_goto_receiver ());
819 /* We must not allow the code we just generated to be reordered by
820 scheduling. Specifically, the update of the frame pointer must
821 happen immediately, not later. */
822 emit_insn (gen_blockage ());
825 /* __builtin_longjmp is passed a pointer to an array of five words (not
826 all will be used on all machines). It operates similarly to the C
827 library function of the same name, but is more efficient. Much of
828 the code below is copied from the handling of non-local gotos. */
831 expand_builtin_longjmp (rtx buf_addr, rtx value)
833 rtx fp, lab, stack, insn, last;
834 enum machine_mode sa_mode = STACK_SAVEAREA_MODE (SAVE_NONLOCAL);
836 /* DRAP is needed for stack realign if longjmp is expanded to current
838 if (SUPPORTS_STACK_ALIGNMENT)
839 crtl->need_drap = true;
841 if (setjmp_alias_set == -1)
842 setjmp_alias_set = new_alias_set ();
844 buf_addr = convert_memory_address (Pmode, buf_addr);
846 buf_addr = force_reg (Pmode, buf_addr);
848 /* We require that the user must pass a second argument of 1, because
849 that is what builtin_setjmp will return. */
850 gcc_assert (value == const1_rtx);
852 last = get_last_insn ();
853 #ifdef HAVE_builtin_longjmp
854 if (HAVE_builtin_longjmp)
855 emit_insn (gen_builtin_longjmp (buf_addr));
859 fp = gen_rtx_MEM (Pmode, buf_addr);
860 lab = gen_rtx_MEM (Pmode, plus_constant (buf_addr,
861 GET_MODE_SIZE (Pmode)));
863 stack = gen_rtx_MEM (sa_mode, plus_constant (buf_addr,
864 2 * GET_MODE_SIZE (Pmode)));
865 set_mem_alias_set (fp, setjmp_alias_set);
866 set_mem_alias_set (lab, setjmp_alias_set);
867 set_mem_alias_set (stack, setjmp_alias_set);
869 /* Pick up FP, label, and SP from the block and jump. This code is
870 from expand_goto in stmt.c; see there for detailed comments. */
871 #ifdef HAVE_nonlocal_goto
872 if (HAVE_nonlocal_goto)
873 /* We have to pass a value to the nonlocal_goto pattern that will
874 get copied into the static_chain pointer, but it does not matter
875 what that value is, because builtin_setjmp does not use it. */
876 emit_insn (gen_nonlocal_goto (value, lab, stack, fp));
880 lab = copy_to_reg (lab);
882 emit_clobber (gen_rtx_MEM (BLKmode, gen_rtx_SCRATCH (VOIDmode)));
883 emit_clobber (gen_rtx_MEM (BLKmode, hard_frame_pointer_rtx));
885 emit_move_insn (hard_frame_pointer_rtx, fp);
886 emit_stack_restore (SAVE_NONLOCAL, stack, NULL_RTX);
888 emit_use (hard_frame_pointer_rtx);
889 emit_use (stack_pointer_rtx);
890 emit_indirect_jump (lab);
894 /* Search backwards and mark the jump insn as a non-local goto.
895 Note that this precludes the use of __builtin_longjmp to a
896 __builtin_setjmp target in the same function. However, we've
897 already cautioned the user that these functions are for
898 internal exception handling use only. */
899 for (insn = get_last_insn (); insn; insn = PREV_INSN (insn))
901 gcc_assert (insn != last);
905 add_reg_note (insn, REG_NON_LOCAL_GOTO, const0_rtx);
908 else if (CALL_P (insn))
913 /* Expand a call to __builtin_nonlocal_goto. We're passed the target label
914 and the address of the save area. */
917 expand_builtin_nonlocal_goto (tree exp)
919 tree t_label, t_save_area;
920 rtx r_label, r_save_area, r_fp, r_sp, insn;
922 if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
925 t_label = CALL_EXPR_ARG (exp, 0);
926 t_save_area = CALL_EXPR_ARG (exp, 1);
928 r_label = expand_normal (t_label);
929 r_label = convert_memory_address (Pmode, r_label);
930 r_save_area = expand_normal (t_save_area);
931 r_save_area = convert_memory_address (Pmode, r_save_area);
932 /* Copy the address of the save location to a register just in case it was based
933 on the frame pointer. */
934 r_save_area = copy_to_reg (r_save_area);
935 r_fp = gen_rtx_MEM (Pmode, r_save_area);
936 r_sp = gen_rtx_MEM (STACK_SAVEAREA_MODE (SAVE_NONLOCAL),
937 plus_constant (r_save_area, GET_MODE_SIZE (Pmode)));
939 crtl->has_nonlocal_goto = 1;
941 #ifdef HAVE_nonlocal_goto
942 /* ??? We no longer need to pass the static chain value, afaik. */
943 if (HAVE_nonlocal_goto)
944 emit_insn (gen_nonlocal_goto (const0_rtx, r_label, r_sp, r_fp));
948 r_label = copy_to_reg (r_label);
950 emit_clobber (gen_rtx_MEM (BLKmode, gen_rtx_SCRATCH (VOIDmode)));
951 emit_clobber (gen_rtx_MEM (BLKmode, hard_frame_pointer_rtx));
953 /* Restore frame pointer for containing function.
954 This sets the actual hard register used for the frame pointer
955 to the location of the function's incoming static chain info.
956 The non-local goto handler will then adjust it to contain the
957 proper value and reload the argument pointer, if needed. */
958 emit_move_insn (hard_frame_pointer_rtx, r_fp);
959 emit_stack_restore (SAVE_NONLOCAL, r_sp, NULL_RTX);
961 /* USE of hard_frame_pointer_rtx added for consistency;
962 not clear if really needed. */
963 emit_use (hard_frame_pointer_rtx);
964 emit_use (stack_pointer_rtx);
966 /* If the architecture is using a GP register, we must
967 conservatively assume that the target function makes use of it.
968 The prologue of functions with nonlocal gotos must therefore
969 initialize the GP register to the appropriate value, and we
970 must then make sure that this value is live at the point
971 of the jump. (Note that this doesn't necessarily apply
972 to targets with a nonlocal_goto pattern; they are free
973 to implement it in their own way. Note also that this is
974 a no-op if the GP register is a global invariant.) */
975 if ((unsigned) PIC_OFFSET_TABLE_REGNUM != INVALID_REGNUM
976 && fixed_regs[PIC_OFFSET_TABLE_REGNUM])
977 emit_use (pic_offset_table_rtx);
979 emit_indirect_jump (r_label);
982 /* Search backwards to the jump insn and mark it as a
984 for (insn = get_last_insn (); insn; insn = PREV_INSN (insn))
988 add_reg_note (insn, REG_NON_LOCAL_GOTO, const0_rtx);
991 else if (CALL_P (insn))
998 /* __builtin_update_setjmp_buf is passed a pointer to an array of five words
999 (not all will be used on all machines) that was passed to __builtin_setjmp.
1000 It updates the stack pointer in that block to correspond to the current
1004 expand_builtin_update_setjmp_buf (rtx buf_addr)
1006 enum machine_mode sa_mode = Pmode;
1010 #ifdef HAVE_save_stack_nonlocal
1011 if (HAVE_save_stack_nonlocal)
1012 sa_mode = insn_data[(int) CODE_FOR_save_stack_nonlocal].operand[0].mode;
1014 #ifdef STACK_SAVEAREA_MODE
1015 sa_mode = STACK_SAVEAREA_MODE (SAVE_NONLOCAL);
1019 = gen_rtx_MEM (sa_mode,
1022 plus_constant (buf_addr, 2 * GET_MODE_SIZE (Pmode))));
1026 emit_insn (gen_setjmp ());
1029 emit_stack_save (SAVE_NONLOCAL, &stack_save, NULL_RTX);
1032 /* Expand a call to __builtin_prefetch. For a target that does not support
1033 data prefetch, evaluate the memory address argument in case it has side
1037 expand_builtin_prefetch (tree exp)
1039 tree arg0, arg1, arg2;
1043 if (!validate_arglist (exp, POINTER_TYPE, 0))
1046 arg0 = CALL_EXPR_ARG (exp, 0);
1048 /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
1049 zero (read) and argument 2 (locality) defaults to 3 (high degree of
1051 nargs = call_expr_nargs (exp);
1053 arg1 = CALL_EXPR_ARG (exp, 1);
1055 arg1 = integer_zero_node;
1057 arg2 = CALL_EXPR_ARG (exp, 2);
1059 arg2 = build_int_cst (NULL_TREE, 3);
1061 /* Argument 0 is an address. */
1062 op0 = expand_expr (arg0, NULL_RTX, Pmode, EXPAND_NORMAL);
1064 /* Argument 1 (read/write flag) must be a compile-time constant int. */
1065 if (TREE_CODE (arg1) != INTEGER_CST)
1067 error ("second argument to %<__builtin_prefetch%> must be a constant");
1068 arg1 = integer_zero_node;
1070 op1 = expand_normal (arg1);
1071 /* Argument 1 must be either zero or one. */
1072 if (INTVAL (op1) != 0 && INTVAL (op1) != 1)
1074 warning (0, "invalid second argument to %<__builtin_prefetch%>;"
1079 /* Argument 2 (locality) must be a compile-time constant int. */
1080 if (TREE_CODE (arg2) != INTEGER_CST)
1082 error ("third argument to %<__builtin_prefetch%> must be a constant");
1083 arg2 = integer_zero_node;
1085 op2 = expand_normal (arg2);
1086 /* Argument 2 must be 0, 1, 2, or 3. */
1087 if (INTVAL (op2) < 0 || INTVAL (op2) > 3)
1089 warning (0, "invalid third argument to %<__builtin_prefetch%>; using zero");
1093 #ifdef HAVE_prefetch
1096 if ((! (*insn_data[(int) CODE_FOR_prefetch].operand[0].predicate)
1098 insn_data[(int) CODE_FOR_prefetch].operand[0].mode))
1099 || (GET_MODE (op0) != Pmode))
1101 op0 = convert_memory_address (Pmode, op0);
1102 op0 = force_reg (Pmode, op0);
1104 emit_insn (gen_prefetch (op0, op1, op2));
1108 /* Don't do anything with direct references to volatile memory, but
1109 generate code to handle other side effects. */
1110 if (!MEM_P (op0) && side_effects_p (op0))
1114 /* Get a MEM rtx for expression EXP which is the address of an operand
1115 to be used in a string instruction (cmpstrsi, movmemsi, ..). LEN is
1116 the maximum length of the block of memory that might be accessed or
1120 get_memory_rtx (tree exp, tree len)
1122 tree orig_exp = exp;
1126 /* When EXP is not resolved SAVE_EXPR, MEM_ATTRS can be still derived
1127 from its expression, for expr->a.b only <variable>.a.b is recorded. */
1128 if (TREE_CODE (exp) == SAVE_EXPR && !SAVE_EXPR_RESOLVED_P (exp))
1129 exp = TREE_OPERAND (exp, 0);
1131 addr = expand_expr (orig_exp, NULL_RTX, ptr_mode, EXPAND_NORMAL);
1132 mem = gen_rtx_MEM (BLKmode, memory_address (BLKmode, addr));
1134 /* Get an expression we can use to find the attributes to assign to MEM.
1135 If it is an ADDR_EXPR, use the operand. Otherwise, dereference it if
1136 we can. First remove any nops. */
1137 while (CONVERT_EXPR_P (exp)
1138 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (exp, 0))))
1139 exp = TREE_OPERAND (exp, 0);
1142 if (TREE_CODE (exp) == POINTER_PLUS_EXPR
1143 && TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
1144 && host_integerp (TREE_OPERAND (exp, 1), 0)
1145 && (off = tree_low_cst (TREE_OPERAND (exp, 1), 0)) > 0)
1146 exp = TREE_OPERAND (TREE_OPERAND (exp, 0), 0);
1147 else if (TREE_CODE (exp) == ADDR_EXPR)
1148 exp = TREE_OPERAND (exp, 0);
1149 else if (POINTER_TYPE_P (TREE_TYPE (exp)))
1150 exp = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (exp)), exp);
1154 /* Honor attributes derived from exp, except for the alias set
1155 (as builtin stringops may alias with anything) and the size
1156 (as stringops may access multiple array elements). */
1159 set_mem_attributes (mem, exp, 0);
1162 mem = adjust_automodify_address_nv (mem, BLKmode, NULL, off);
1164 /* Allow the string and memory builtins to overflow from one
1165 field into another, see http://gcc.gnu.org/PR23561.
1166 Thus avoid COMPONENT_REFs in MEM_EXPR unless we know the whole
1167 memory accessed by the string or memory builtin will fit
1168 within the field. */
1169 if (MEM_EXPR (mem) && TREE_CODE (MEM_EXPR (mem)) == COMPONENT_REF)
1171 tree mem_expr = MEM_EXPR (mem);
1172 HOST_WIDE_INT offset = -1, length = -1;
1175 while (TREE_CODE (inner) == ARRAY_REF
1176 || CONVERT_EXPR_P (inner)
1177 || TREE_CODE (inner) == VIEW_CONVERT_EXPR
1178 || TREE_CODE (inner) == SAVE_EXPR)
1179 inner = TREE_OPERAND (inner, 0);
1181 gcc_assert (TREE_CODE (inner) == COMPONENT_REF);
1183 if (MEM_OFFSET (mem)
1184 && CONST_INT_P (MEM_OFFSET (mem)))
1185 offset = INTVAL (MEM_OFFSET (mem));
1187 if (offset >= 0 && len && host_integerp (len, 0))
1188 length = tree_low_cst (len, 0);
1190 while (TREE_CODE (inner) == COMPONENT_REF)
1192 tree field = TREE_OPERAND (inner, 1);
1193 gcc_assert (TREE_CODE (mem_expr) == COMPONENT_REF);
1194 gcc_assert (field == TREE_OPERAND (mem_expr, 1));
1196 /* Bitfields are generally not byte-addressable. */
1197 gcc_assert (!DECL_BIT_FIELD (field)
1198 || ((tree_low_cst (DECL_FIELD_BIT_OFFSET (field), 1)
1199 % BITS_PER_UNIT) == 0
1200 && host_integerp (DECL_SIZE (field), 0)
1201 && (TREE_INT_CST_LOW (DECL_SIZE (field))
1202 % BITS_PER_UNIT) == 0));
1204 /* If we can prove that the memory starting at XEXP (mem, 0) and
1205 ending at XEXP (mem, 0) + LENGTH will fit into this field, we
1206 can keep the COMPONENT_REF in MEM_EXPR. But be careful with
1207 fields without DECL_SIZE_UNIT like flexible array members. */
1209 && DECL_SIZE_UNIT (field)
1210 && host_integerp (DECL_SIZE_UNIT (field), 0))
1213 = TREE_INT_CST_LOW (DECL_SIZE_UNIT (field));
1216 && offset + length <= size)
1221 && host_integerp (DECL_FIELD_OFFSET (field), 0))
1222 offset += TREE_INT_CST_LOW (DECL_FIELD_OFFSET (field))
1223 + tree_low_cst (DECL_FIELD_BIT_OFFSET (field), 1)
1231 mem_expr = TREE_OPERAND (mem_expr, 0);
1232 inner = TREE_OPERAND (inner, 0);
1235 if (mem_expr == NULL)
1237 if (mem_expr != MEM_EXPR (mem))
1239 set_mem_expr (mem, mem_expr);
1240 set_mem_offset (mem, offset >= 0 ? GEN_INT (offset) : NULL_RTX);
1243 set_mem_alias_set (mem, 0);
1244 set_mem_size (mem, NULL_RTX);
1250 /* Built-in functions to perform an untyped call and return. */
1252 /* For each register that may be used for calling a function, this
1253 gives a mode used to copy the register's value. VOIDmode indicates
1254 the register is not used for calling a function. If the machine
1255 has register windows, this gives only the outbound registers.
1256 INCOMING_REGNO gives the corresponding inbound register. */
1257 static enum machine_mode apply_args_mode[FIRST_PSEUDO_REGISTER];
1259 /* For each register that may be used for returning values, this gives
1260 a mode used to copy the register's value. VOIDmode indicates the
1261 register is not used for returning values. If the machine has
1262 register windows, this gives only the outbound registers.
1263 INCOMING_REGNO gives the corresponding inbound register. */
1264 static enum machine_mode apply_result_mode[FIRST_PSEUDO_REGISTER];
1266 /* Return the size required for the block returned by __builtin_apply_args,
1267 and initialize apply_args_mode. */
1270 apply_args_size (void)
1272 static int size = -1;
1275 enum machine_mode mode;
1277 /* The values computed by this function never change. */
1280 /* The first value is the incoming arg-pointer. */
1281 size = GET_MODE_SIZE (Pmode);
1283 /* The second value is the structure value address unless this is
1284 passed as an "invisible" first argument. */
1285 if (targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0))
1286 size += GET_MODE_SIZE (Pmode);
1288 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1289 if (FUNCTION_ARG_REGNO_P (regno))
1291 mode = reg_raw_mode[regno];
1293 gcc_assert (mode != VOIDmode);
1295 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1296 if (size % align != 0)
1297 size = CEIL (size, align) * align;
1298 size += GET_MODE_SIZE (mode);
1299 apply_args_mode[regno] = mode;
1303 apply_args_mode[regno] = VOIDmode;
1309 /* Return the size required for the block returned by __builtin_apply,
1310 and initialize apply_result_mode. */
1313 apply_result_size (void)
1315 static int size = -1;
1317 enum machine_mode mode;
1319 /* The values computed by this function never change. */
1324 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1325 if (FUNCTION_VALUE_REGNO_P (regno))
1327 mode = reg_raw_mode[regno];
1329 gcc_assert (mode != VOIDmode);
1331 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1332 if (size % align != 0)
1333 size = CEIL (size, align) * align;
1334 size += GET_MODE_SIZE (mode);
1335 apply_result_mode[regno] = mode;
1338 apply_result_mode[regno] = VOIDmode;
1340 /* Allow targets that use untyped_call and untyped_return to override
1341 the size so that machine-specific information can be stored here. */
1342 #ifdef APPLY_RESULT_SIZE
1343 size = APPLY_RESULT_SIZE;
1349 #if defined (HAVE_untyped_call) || defined (HAVE_untyped_return)
1350 /* Create a vector describing the result block RESULT. If SAVEP is true,
1351 the result block is used to save the values; otherwise it is used to
1352 restore the values. */
1355 result_vector (int savep, rtx result)
1357 int regno, size, align, nelts;
1358 enum machine_mode mode;
1360 rtx *savevec = XALLOCAVEC (rtx, FIRST_PSEUDO_REGISTER);
1363 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1364 if ((mode = apply_result_mode[regno]) != VOIDmode)
1366 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1367 if (size % align != 0)
1368 size = CEIL (size, align) * align;
1369 reg = gen_rtx_REG (mode, savep ? regno : INCOMING_REGNO (regno));
1370 mem = adjust_address (result, mode, size);
1371 savevec[nelts++] = (savep
1372 ? gen_rtx_SET (VOIDmode, mem, reg)
1373 : gen_rtx_SET (VOIDmode, reg, mem));
1374 size += GET_MODE_SIZE (mode);
1376 return gen_rtx_PARALLEL (VOIDmode, gen_rtvec_v (nelts, savevec));
1378 #endif /* HAVE_untyped_call or HAVE_untyped_return */
1380 /* Save the state required to perform an untyped call with the same
1381 arguments as were passed to the current function. */
1384 expand_builtin_apply_args_1 (void)
1387 int size, align, regno;
1388 enum machine_mode mode;
1389 rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1391 /* Create a block where the arg-pointer, structure value address,
1392 and argument registers can be saved. */
1393 registers = assign_stack_local (BLKmode, apply_args_size (), -1);
1395 /* Walk past the arg-pointer and structure value address. */
1396 size = GET_MODE_SIZE (Pmode);
1397 if (targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0))
1398 size += GET_MODE_SIZE (Pmode);
1400 /* Save each register used in calling a function to the block. */
1401 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1402 if ((mode = apply_args_mode[regno]) != VOIDmode)
1404 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1405 if (size % align != 0)
1406 size = CEIL (size, align) * align;
1408 tem = gen_rtx_REG (mode, INCOMING_REGNO (regno));
1410 emit_move_insn (adjust_address (registers, mode, size), tem);
1411 size += GET_MODE_SIZE (mode);
1414 /* Save the arg pointer to the block. */
1415 tem = copy_to_reg (crtl->args.internal_arg_pointer);
1416 #ifdef STACK_GROWS_DOWNWARD
1417 /* We need the pointer as the caller actually passed them to us, not
1418 as we might have pretended they were passed. Make sure it's a valid
1419 operand, as emit_move_insn isn't expected to handle a PLUS. */
1421 = force_operand (plus_constant (tem, crtl->args.pretend_args_size),
1424 emit_move_insn (adjust_address (registers, Pmode, 0), tem);
1426 size = GET_MODE_SIZE (Pmode);
1428 /* Save the structure value address unless this is passed as an
1429 "invisible" first argument. */
1430 if (struct_incoming_value)
1432 emit_move_insn (adjust_address (registers, Pmode, size),
1433 copy_to_reg (struct_incoming_value));
1434 size += GET_MODE_SIZE (Pmode);
1437 /* Return the address of the block. */
1438 return copy_addr_to_reg (XEXP (registers, 0));
1441 /* __builtin_apply_args returns block of memory allocated on
1442 the stack into which is stored the arg pointer, structure
1443 value address, static chain, and all the registers that might
1444 possibly be used in performing a function call. The code is
1445 moved to the start of the function so the incoming values are
1449 expand_builtin_apply_args (void)
1451 /* Don't do __builtin_apply_args more than once in a function.
1452 Save the result of the first call and reuse it. */
1453 if (apply_args_value != 0)
1454 return apply_args_value;
1456 /* When this function is called, it means that registers must be
1457 saved on entry to this function. So we migrate the
1458 call to the first insn of this function. */
1463 temp = expand_builtin_apply_args_1 ();
1467 apply_args_value = temp;
1469 /* Put the insns after the NOTE that starts the function.
1470 If this is inside a start_sequence, make the outer-level insn
1471 chain current, so the code is placed at the start of the
1472 function. If internal_arg_pointer is a non-virtual pseudo,
1473 it needs to be placed after the function that initializes
1475 push_topmost_sequence ();
1476 if (REG_P (crtl->args.internal_arg_pointer)
1477 && REGNO (crtl->args.internal_arg_pointer) > LAST_VIRTUAL_REGISTER)
1478 emit_insn_before (seq, parm_birth_insn);
1480 emit_insn_before (seq, NEXT_INSN (entry_of_function ()));
1481 pop_topmost_sequence ();
1486 /* Perform an untyped call and save the state required to perform an
1487 untyped return of whatever value was returned by the given function. */
1490 expand_builtin_apply (rtx function, rtx arguments, rtx argsize)
1492 int size, align, regno;
1493 enum machine_mode mode;
1494 rtx incoming_args, result, reg, dest, src, call_insn;
1495 rtx old_stack_level = 0;
1496 rtx call_fusage = 0;
1497 rtx struct_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0);
1499 arguments = convert_memory_address (Pmode, arguments);
1501 /* Create a block where the return registers can be saved. */
1502 result = assign_stack_local (BLKmode, apply_result_size (), -1);
1504 /* Fetch the arg pointer from the ARGUMENTS block. */
1505 incoming_args = gen_reg_rtx (Pmode);
1506 emit_move_insn (incoming_args, gen_rtx_MEM (Pmode, arguments));
1507 #ifndef STACK_GROWS_DOWNWARD
1508 incoming_args = expand_simple_binop (Pmode, MINUS, incoming_args, argsize,
1509 incoming_args, 0, OPTAB_LIB_WIDEN);
1512 /* Push a new argument block and copy the arguments. Do not allow
1513 the (potential) memcpy call below to interfere with our stack
1515 do_pending_stack_adjust ();
1518 /* Save the stack with nonlocal if available. */
1519 #ifdef HAVE_save_stack_nonlocal
1520 if (HAVE_save_stack_nonlocal)
1521 emit_stack_save (SAVE_NONLOCAL, &old_stack_level, NULL_RTX);
1524 emit_stack_save (SAVE_BLOCK, &old_stack_level, NULL_RTX);
1526 /* Allocate a block of memory onto the stack and copy the memory
1527 arguments to the outgoing arguments address. */
1528 allocate_dynamic_stack_space (argsize, 0, BITS_PER_UNIT);
1530 /* Set DRAP flag to true, even though allocate_dynamic_stack_space
1531 may have already set current_function_calls_alloca to true.
1532 current_function_calls_alloca won't be set if argsize is zero,
1533 so we have to guarantee need_drap is true here. */
1534 if (SUPPORTS_STACK_ALIGNMENT)
1535 crtl->need_drap = true;
1537 dest = virtual_outgoing_args_rtx;
1538 #ifndef STACK_GROWS_DOWNWARD
1539 if (CONST_INT_P (argsize))
1540 dest = plus_constant (dest, -INTVAL (argsize));
1542 dest = gen_rtx_PLUS (Pmode, dest, negate_rtx (Pmode, argsize));
1544 dest = gen_rtx_MEM (BLKmode, dest);
1545 set_mem_align (dest, PARM_BOUNDARY);
1546 src = gen_rtx_MEM (BLKmode, incoming_args);
1547 set_mem_align (src, PARM_BOUNDARY);
1548 emit_block_move (dest, src, argsize, BLOCK_OP_NORMAL);
1550 /* Refer to the argument block. */
1552 arguments = gen_rtx_MEM (BLKmode, arguments);
1553 set_mem_align (arguments, PARM_BOUNDARY);
1555 /* Walk past the arg-pointer and structure value address. */
1556 size = GET_MODE_SIZE (Pmode);
1558 size += GET_MODE_SIZE (Pmode);
1560 /* Restore each of the registers previously saved. Make USE insns
1561 for each of these registers for use in making the call. */
1562 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1563 if ((mode = apply_args_mode[regno]) != VOIDmode)
1565 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1566 if (size % align != 0)
1567 size = CEIL (size, align) * align;
1568 reg = gen_rtx_REG (mode, regno);
1569 emit_move_insn (reg, adjust_address (arguments, mode, size));
1570 use_reg (&call_fusage, reg);
1571 size += GET_MODE_SIZE (mode);
1574 /* Restore the structure value address unless this is passed as an
1575 "invisible" first argument. */
1576 size = GET_MODE_SIZE (Pmode);
1579 rtx value = gen_reg_rtx (Pmode);
1580 emit_move_insn (value, adjust_address (arguments, Pmode, size));
1581 emit_move_insn (struct_value, value);
1582 if (REG_P (struct_value))
1583 use_reg (&call_fusage, struct_value);
1584 size += GET_MODE_SIZE (Pmode);
1587 /* All arguments and registers used for the call are set up by now! */
1588 function = prepare_call_address (NULL, function, NULL, &call_fusage, 0, 0);
1590 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1591 and we don't want to load it into a register as an optimization,
1592 because prepare_call_address already did it if it should be done. */
1593 if (GET_CODE (function) != SYMBOL_REF)
1594 function = memory_address (FUNCTION_MODE, function);
1596 /* Generate the actual call instruction and save the return value. */
1597 #ifdef HAVE_untyped_call
1598 if (HAVE_untyped_call)
1599 emit_call_insn (gen_untyped_call (gen_rtx_MEM (FUNCTION_MODE, function),
1600 result, result_vector (1, result)));
1603 #ifdef HAVE_call_value
1604 if (HAVE_call_value)
1608 /* Locate the unique return register. It is not possible to
1609 express a call that sets more than one return register using
1610 call_value; use untyped_call for that. In fact, untyped_call
1611 only needs to save the return registers in the given block. */
1612 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1613 if ((mode = apply_result_mode[regno]) != VOIDmode)
1615 gcc_assert (!valreg); /* HAVE_untyped_call required. */
1617 valreg = gen_rtx_REG (mode, regno);
1620 emit_call_insn (GEN_CALL_VALUE (valreg,
1621 gen_rtx_MEM (FUNCTION_MODE, function),
1622 const0_rtx, NULL_RTX, const0_rtx));
1624 emit_move_insn (adjust_address (result, GET_MODE (valreg), 0), valreg);
1630 /* Find the CALL insn we just emitted, and attach the register usage
1632 call_insn = last_call_insn ();
1633 add_function_usage_to (call_insn, call_fusage);
1635 /* Restore the stack. */
1636 #ifdef HAVE_save_stack_nonlocal
1637 if (HAVE_save_stack_nonlocal)
1638 emit_stack_restore (SAVE_NONLOCAL, old_stack_level, NULL_RTX);
1641 emit_stack_restore (SAVE_BLOCK, old_stack_level, NULL_RTX);
1645 /* Return the address of the result block. */
1646 result = copy_addr_to_reg (XEXP (result, 0));
1647 return convert_memory_address (ptr_mode, result);
1650 /* Perform an untyped return. */
1653 expand_builtin_return (rtx result)
1655 int size, align, regno;
1656 enum machine_mode mode;
1658 rtx call_fusage = 0;
1660 result = convert_memory_address (Pmode, result);
1662 apply_result_size ();
1663 result = gen_rtx_MEM (BLKmode, result);
1665 #ifdef HAVE_untyped_return
1666 if (HAVE_untyped_return)
1668 emit_jump_insn (gen_untyped_return (result, result_vector (0, result)));
1674 /* Restore the return value and note that each value is used. */
1676 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1677 if ((mode = apply_result_mode[regno]) != VOIDmode)
1679 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1680 if (size % align != 0)
1681 size = CEIL (size, align) * align;
1682 reg = gen_rtx_REG (mode, INCOMING_REGNO (regno));
1683 emit_move_insn (reg, adjust_address (result, mode, size));
1685 push_to_sequence (call_fusage);
1687 call_fusage = get_insns ();
1689 size += GET_MODE_SIZE (mode);
1692 /* Put the USE insns before the return. */
1693 emit_insn (call_fusage);
1695 /* Return whatever values was restored by jumping directly to the end
1697 expand_naked_return ();
1700 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1702 static enum type_class
1703 type_to_class (tree type)
1705 switch (TREE_CODE (type))
1707 case VOID_TYPE: return void_type_class;
1708 case INTEGER_TYPE: return integer_type_class;
1709 case ENUMERAL_TYPE: return enumeral_type_class;
1710 case BOOLEAN_TYPE: return boolean_type_class;
1711 case POINTER_TYPE: return pointer_type_class;
1712 case REFERENCE_TYPE: return reference_type_class;
1713 case OFFSET_TYPE: return offset_type_class;
1714 case REAL_TYPE: return real_type_class;
1715 case COMPLEX_TYPE: return complex_type_class;
1716 case FUNCTION_TYPE: return function_type_class;
1717 case METHOD_TYPE: return method_type_class;
1718 case RECORD_TYPE: return record_type_class;
1720 case QUAL_UNION_TYPE: return union_type_class;
1721 case ARRAY_TYPE: return (TYPE_STRING_FLAG (type)
1722 ? string_type_class : array_type_class);
1723 case LANG_TYPE: return lang_type_class;
1724 default: return no_type_class;
1728 /* Expand a call EXP to __builtin_classify_type. */
1731 expand_builtin_classify_type (tree exp)
1733 if (call_expr_nargs (exp))
1734 return GEN_INT (type_to_class (TREE_TYPE (CALL_EXPR_ARG (exp, 0))));
1735 return GEN_INT (no_type_class);
1738 /* This helper macro, meant to be used in mathfn_built_in below,
1739 determines which among a set of three builtin math functions is
1740 appropriate for a given type mode. The `F' and `L' cases are
1741 automatically generated from the `double' case. */
1742 #define CASE_MATHFN(BUILT_IN_MATHFN) \
1743 case BUILT_IN_MATHFN: case BUILT_IN_MATHFN##F: case BUILT_IN_MATHFN##L: \
1744 fcode = BUILT_IN_MATHFN; fcodef = BUILT_IN_MATHFN##F ; \
1745 fcodel = BUILT_IN_MATHFN##L ; break;
1746 /* Similar to above, but appends _R after any F/L suffix. */
1747 #define CASE_MATHFN_REENT(BUILT_IN_MATHFN) \
1748 case BUILT_IN_MATHFN##_R: case BUILT_IN_MATHFN##F_R: case BUILT_IN_MATHFN##L_R: \
1749 fcode = BUILT_IN_MATHFN##_R; fcodef = BUILT_IN_MATHFN##F_R ; \
1750 fcodel = BUILT_IN_MATHFN##L_R ; break;
1752 /* Return mathematic function equivalent to FN but operating directly
1753 on TYPE, if available. If IMPLICIT is true find the function in
1754 implicit_built_in_decls[], otherwise use built_in_decls[]. If we
1755 can't do the conversion, return zero. */
1758 mathfn_built_in_1 (tree type, enum built_in_function fn, bool implicit)
1760 tree const *const fn_arr
1761 = implicit ? implicit_built_in_decls : built_in_decls;
1762 enum built_in_function fcode, fcodef, fcodel;
1766 CASE_MATHFN (BUILT_IN_ACOS)
1767 CASE_MATHFN (BUILT_IN_ACOSH)
1768 CASE_MATHFN (BUILT_IN_ASIN)
1769 CASE_MATHFN (BUILT_IN_ASINH)
1770 CASE_MATHFN (BUILT_IN_ATAN)
1771 CASE_MATHFN (BUILT_IN_ATAN2)
1772 CASE_MATHFN (BUILT_IN_ATANH)
1773 CASE_MATHFN (BUILT_IN_CBRT)
1774 CASE_MATHFN (BUILT_IN_CEIL)
1775 CASE_MATHFN (BUILT_IN_CEXPI)
1776 CASE_MATHFN (BUILT_IN_COPYSIGN)
1777 CASE_MATHFN (BUILT_IN_COS)
1778 CASE_MATHFN (BUILT_IN_COSH)
1779 CASE_MATHFN (BUILT_IN_DREM)
1780 CASE_MATHFN (BUILT_IN_ERF)
1781 CASE_MATHFN (BUILT_IN_ERFC)
1782 CASE_MATHFN (BUILT_IN_EXP)
1783 CASE_MATHFN (BUILT_IN_EXP10)
1784 CASE_MATHFN (BUILT_IN_EXP2)
1785 CASE_MATHFN (BUILT_IN_EXPM1)
1786 CASE_MATHFN (BUILT_IN_FABS)
1787 CASE_MATHFN (BUILT_IN_FDIM)
1788 CASE_MATHFN (BUILT_IN_FLOOR)
1789 CASE_MATHFN (BUILT_IN_FMA)
1790 CASE_MATHFN (BUILT_IN_FMAX)
1791 CASE_MATHFN (BUILT_IN_FMIN)
1792 CASE_MATHFN (BUILT_IN_FMOD)
1793 CASE_MATHFN (BUILT_IN_FREXP)
1794 CASE_MATHFN (BUILT_IN_GAMMA)
1795 CASE_MATHFN_REENT (BUILT_IN_GAMMA) /* GAMMA_R */
1796 CASE_MATHFN (BUILT_IN_HUGE_VAL)
1797 CASE_MATHFN (BUILT_IN_HYPOT)
1798 CASE_MATHFN (BUILT_IN_ILOGB)
1799 CASE_MATHFN (BUILT_IN_INF)
1800 CASE_MATHFN (BUILT_IN_ISINF)
1801 CASE_MATHFN (BUILT_IN_J0)
1802 CASE_MATHFN (BUILT_IN_J1)
1803 CASE_MATHFN (BUILT_IN_JN)
1804 CASE_MATHFN (BUILT_IN_LCEIL)
1805 CASE_MATHFN (BUILT_IN_LDEXP)
1806 CASE_MATHFN (BUILT_IN_LFLOOR)
1807 CASE_MATHFN (BUILT_IN_LGAMMA)
1808 CASE_MATHFN_REENT (BUILT_IN_LGAMMA) /* LGAMMA_R */
1809 CASE_MATHFN (BUILT_IN_LLCEIL)
1810 CASE_MATHFN (BUILT_IN_LLFLOOR)
1811 CASE_MATHFN (BUILT_IN_LLRINT)
1812 CASE_MATHFN (BUILT_IN_LLROUND)
1813 CASE_MATHFN (BUILT_IN_LOG)
1814 CASE_MATHFN (BUILT_IN_LOG10)
1815 CASE_MATHFN (BUILT_IN_LOG1P)
1816 CASE_MATHFN (BUILT_IN_LOG2)
1817 CASE_MATHFN (BUILT_IN_LOGB)
1818 CASE_MATHFN (BUILT_IN_LRINT)
1819 CASE_MATHFN (BUILT_IN_LROUND)
1820 CASE_MATHFN (BUILT_IN_MODF)
1821 CASE_MATHFN (BUILT_IN_NAN)
1822 CASE_MATHFN (BUILT_IN_NANS)
1823 CASE_MATHFN (BUILT_IN_NEARBYINT)
1824 CASE_MATHFN (BUILT_IN_NEXTAFTER)
1825 CASE_MATHFN (BUILT_IN_NEXTTOWARD)
1826 CASE_MATHFN (BUILT_IN_POW)
1827 CASE_MATHFN (BUILT_IN_POWI)
1828 CASE_MATHFN (BUILT_IN_POW10)
1829 CASE_MATHFN (BUILT_IN_REMAINDER)
1830 CASE_MATHFN (BUILT_IN_REMQUO)
1831 CASE_MATHFN (BUILT_IN_RINT)
1832 CASE_MATHFN (BUILT_IN_ROUND)
1833 CASE_MATHFN (BUILT_IN_SCALB)
1834 CASE_MATHFN (BUILT_IN_SCALBLN)
1835 CASE_MATHFN (BUILT_IN_SCALBN)
1836 CASE_MATHFN (BUILT_IN_SIGNBIT)
1837 CASE_MATHFN (BUILT_IN_SIGNIFICAND)
1838 CASE_MATHFN (BUILT_IN_SIN)
1839 CASE_MATHFN (BUILT_IN_SINCOS)
1840 CASE_MATHFN (BUILT_IN_SINH)
1841 CASE_MATHFN (BUILT_IN_SQRT)
1842 CASE_MATHFN (BUILT_IN_TAN)
1843 CASE_MATHFN (BUILT_IN_TANH)
1844 CASE_MATHFN (BUILT_IN_TGAMMA)
1845 CASE_MATHFN (BUILT_IN_TRUNC)
1846 CASE_MATHFN (BUILT_IN_Y0)
1847 CASE_MATHFN (BUILT_IN_Y1)
1848 CASE_MATHFN (BUILT_IN_YN)
1854 if (TYPE_MAIN_VARIANT (type) == double_type_node)
1855 return fn_arr[fcode];
1856 else if (TYPE_MAIN_VARIANT (type) == float_type_node)
1857 return fn_arr[fcodef];
1858 else if (TYPE_MAIN_VARIANT (type) == long_double_type_node)
1859 return fn_arr[fcodel];
1864 /* Like mathfn_built_in_1(), but always use the implicit array. */
1867 mathfn_built_in (tree type, enum built_in_function fn)
1869 return mathfn_built_in_1 (type, fn, /*implicit=*/ 1);
1872 /* If errno must be maintained, expand the RTL to check if the result,
1873 TARGET, of a built-in function call, EXP, is NaN, and if so set
1877 expand_errno_check (tree exp, rtx target)
1879 rtx lab = gen_label_rtx ();
1881 /* Test the result; if it is NaN, set errno=EDOM because
1882 the argument was not in the domain. */
1883 do_compare_rtx_and_jump (target, target, EQ, 0, GET_MODE (target),
1884 NULL_RTX, NULL_RTX, lab,
1885 /* The jump is very likely. */
1886 REG_BR_PROB_BASE - (REG_BR_PROB_BASE / 2000 - 1));
1889 /* If this built-in doesn't throw an exception, set errno directly. */
1890 if (TREE_NOTHROW (TREE_OPERAND (CALL_EXPR_FN (exp), 0)))
1892 #ifdef GEN_ERRNO_RTX
1893 rtx errno_rtx = GEN_ERRNO_RTX;
1896 = gen_rtx_MEM (word_mode, gen_rtx_SYMBOL_REF (Pmode, "errno"));
1898 emit_move_insn (errno_rtx, GEN_INT (TARGET_EDOM));
1904 /* Make sure the library call isn't expanded as a tail call. */
1905 CALL_EXPR_TAILCALL (exp) = 0;
1907 /* We can't set errno=EDOM directly; let the library call do it.
1908 Pop the arguments right away in case the call gets deleted. */
1910 expand_call (exp, target, 0);
1915 /* Expand a call to one of the builtin math functions (sqrt, exp, or log).
1916 Return NULL_RTX if a normal call should be emitted rather than expanding
1917 the function in-line. EXP is the expression that is a call to the builtin
1918 function; if convenient, the result should be placed in TARGET.
1919 SUBTARGET may be used as the target for computing one of EXP's operands. */
1922 expand_builtin_mathfn (tree exp, rtx target, rtx subtarget)
1924 optab builtin_optab;
1926 tree fndecl = get_callee_fndecl (exp);
1927 enum machine_mode mode;
1928 bool errno_set = false;
1931 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
1934 arg = CALL_EXPR_ARG (exp, 0);
1936 switch (DECL_FUNCTION_CODE (fndecl))
1938 CASE_FLT_FN (BUILT_IN_SQRT):
1939 errno_set = ! tree_expr_nonnegative_p (arg);
1940 builtin_optab = sqrt_optab;
1942 CASE_FLT_FN (BUILT_IN_EXP):
1943 errno_set = true; builtin_optab = exp_optab; break;
1944 CASE_FLT_FN (BUILT_IN_EXP10):
1945 CASE_FLT_FN (BUILT_IN_POW10):
1946 errno_set = true; builtin_optab = exp10_optab; break;
1947 CASE_FLT_FN (BUILT_IN_EXP2):
1948 errno_set = true; builtin_optab = exp2_optab; break;
1949 CASE_FLT_FN (BUILT_IN_EXPM1):
1950 errno_set = true; builtin_optab = expm1_optab; break;
1951 CASE_FLT_FN (BUILT_IN_LOGB):
1952 errno_set = true; builtin_optab = logb_optab; break;
1953 CASE_FLT_FN (BUILT_IN_LOG):
1954 errno_set = true; builtin_optab = log_optab; break;
1955 CASE_FLT_FN (BUILT_IN_LOG10):
1956 errno_set = true; builtin_optab = log10_optab; break;
1957 CASE_FLT_FN (BUILT_IN_LOG2):
1958 errno_set = true; builtin_optab = log2_optab; break;
1959 CASE_FLT_FN (BUILT_IN_LOG1P):
1960 errno_set = true; builtin_optab = log1p_optab; break;
1961 CASE_FLT_FN (BUILT_IN_ASIN):
1962 builtin_optab = asin_optab; break;
1963 CASE_FLT_FN (BUILT_IN_ACOS):
1964 builtin_optab = acos_optab; break;
1965 CASE_FLT_FN (BUILT_IN_TAN):
1966 builtin_optab = tan_optab; break;
1967 CASE_FLT_FN (BUILT_IN_ATAN):
1968 builtin_optab = atan_optab; break;
1969 CASE_FLT_FN (BUILT_IN_FLOOR):
1970 builtin_optab = floor_optab; break;
1971 CASE_FLT_FN (BUILT_IN_CEIL):
1972 builtin_optab = ceil_optab; break;
1973 CASE_FLT_FN (BUILT_IN_TRUNC):
1974 builtin_optab = btrunc_optab; break;
1975 CASE_FLT_FN (BUILT_IN_ROUND):
1976 builtin_optab = round_optab; break;
1977 CASE_FLT_FN (BUILT_IN_NEARBYINT):
1978 builtin_optab = nearbyint_optab;
1979 if (flag_trapping_math)
1981 /* Else fallthrough and expand as rint. */
1982 CASE_FLT_FN (BUILT_IN_RINT):
1983 builtin_optab = rint_optab; break;
1984 CASE_FLT_FN (BUILT_IN_SIGNIFICAND):
1985 builtin_optab = significand_optab; break;
1990 /* Make a suitable register to place result in. */
1991 mode = TYPE_MODE (TREE_TYPE (exp));
1993 if (! flag_errno_math || ! HONOR_NANS (mode))
1996 /* Before working hard, check whether the instruction is available. */
1997 if (optab_handler (builtin_optab, mode)->insn_code != CODE_FOR_nothing)
1999 target = gen_reg_rtx (mode);
2001 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2002 need to expand the argument again. This way, we will not perform
2003 side-effects more the once. */
2004 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2006 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
2010 /* Compute into TARGET.
2011 Set TARGET to wherever the result comes back. */
2012 target = expand_unop (mode, builtin_optab, op0, target, 0);
2017 expand_errno_check (exp, target);
2019 /* Output the entire sequence. */
2020 insns = get_insns ();
2026 /* If we were unable to expand via the builtin, stop the sequence
2027 (without outputting the insns) and call to the library function
2028 with the stabilized argument list. */
2032 return expand_call (exp, target, target == const0_rtx);
2035 /* Expand a call to the builtin binary math functions (pow and atan2).
2036 Return NULL_RTX if a normal call should be emitted rather than expanding the
2037 function in-line. EXP is the expression that is a call to the builtin
2038 function; if convenient, the result should be placed in TARGET.
2039 SUBTARGET may be used as the target for computing one of EXP's
2043 expand_builtin_mathfn_2 (tree exp, rtx target, rtx subtarget)
2045 optab builtin_optab;
2046 rtx op0, op1, insns;
2047 int op1_type = REAL_TYPE;
2048 tree fndecl = get_callee_fndecl (exp);
2050 enum machine_mode mode;
2051 bool errno_set = true;
2053 switch (DECL_FUNCTION_CODE (fndecl))
2055 CASE_FLT_FN (BUILT_IN_SCALBN):
2056 CASE_FLT_FN (BUILT_IN_SCALBLN):
2057 CASE_FLT_FN (BUILT_IN_LDEXP):
2058 op1_type = INTEGER_TYPE;
2063 if (!validate_arglist (exp, REAL_TYPE, op1_type, VOID_TYPE))
2066 arg0 = CALL_EXPR_ARG (exp, 0);
2067 arg1 = CALL_EXPR_ARG (exp, 1);
2069 switch (DECL_FUNCTION_CODE (fndecl))
2071 CASE_FLT_FN (BUILT_IN_POW):
2072 builtin_optab = pow_optab; break;
2073 CASE_FLT_FN (BUILT_IN_ATAN2):
2074 builtin_optab = atan2_optab; break;
2075 CASE_FLT_FN (BUILT_IN_SCALB):
2076 if (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (exp)))->b != 2)
2078 builtin_optab = scalb_optab; break;
2079 CASE_FLT_FN (BUILT_IN_SCALBN):
2080 CASE_FLT_FN (BUILT_IN_SCALBLN):
2081 if (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (exp)))->b != 2)
2083 /* Fall through... */
2084 CASE_FLT_FN (BUILT_IN_LDEXP):
2085 builtin_optab = ldexp_optab; break;
2086 CASE_FLT_FN (BUILT_IN_FMOD):
2087 builtin_optab = fmod_optab; break;
2088 CASE_FLT_FN (BUILT_IN_REMAINDER):
2089 CASE_FLT_FN (BUILT_IN_DREM):
2090 builtin_optab = remainder_optab; break;
2095 /* Make a suitable register to place result in. */
2096 mode = TYPE_MODE (TREE_TYPE (exp));
2098 /* Before working hard, check whether the instruction is available. */
2099 if (optab_handler (builtin_optab, mode)->insn_code == CODE_FOR_nothing)
2102 target = gen_reg_rtx (mode);
2104 if (! flag_errno_math || ! HONOR_NANS (mode))
2107 /* Always stabilize the argument list. */
2108 CALL_EXPR_ARG (exp, 0) = arg0 = builtin_save_expr (arg0);
2109 CALL_EXPR_ARG (exp, 1) = arg1 = builtin_save_expr (arg1);
2111 op0 = expand_expr (arg0, subtarget, VOIDmode, EXPAND_NORMAL);
2112 op1 = expand_normal (arg1);
2116 /* Compute into TARGET.
2117 Set TARGET to wherever the result comes back. */
2118 target = expand_binop (mode, builtin_optab, op0, op1,
2119 target, 0, OPTAB_DIRECT);
2121 /* If we were unable to expand via the builtin, stop the sequence
2122 (without outputting the insns) and call to the library function
2123 with the stabilized argument list. */
2127 return expand_call (exp, target, target == const0_rtx);
2131 expand_errno_check (exp, target);
2133 /* Output the entire sequence. */
2134 insns = get_insns ();
2141 /* Expand a call to the builtin sin and cos math functions.
2142 Return NULL_RTX if a normal call should be emitted rather than expanding the
2143 function in-line. EXP is the expression that is a call to the builtin
2144 function; if convenient, the result should be placed in TARGET.
2145 SUBTARGET may be used as the target for computing one of EXP's
2149 expand_builtin_mathfn_3 (tree exp, rtx target, rtx subtarget)
2151 optab builtin_optab;
2153 tree fndecl = get_callee_fndecl (exp);
2154 enum machine_mode mode;
2157 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2160 arg = CALL_EXPR_ARG (exp, 0);
2162 switch (DECL_FUNCTION_CODE (fndecl))
2164 CASE_FLT_FN (BUILT_IN_SIN):
2165 CASE_FLT_FN (BUILT_IN_COS):
2166 builtin_optab = sincos_optab; break;
2171 /* Make a suitable register to place result in. */
2172 mode = TYPE_MODE (TREE_TYPE (exp));
2174 /* Check if sincos insn is available, otherwise fallback
2175 to sin or cos insn. */
2176 if (optab_handler (builtin_optab, mode)->insn_code == CODE_FOR_nothing)
2177 switch (DECL_FUNCTION_CODE (fndecl))
2179 CASE_FLT_FN (BUILT_IN_SIN):
2180 builtin_optab = sin_optab; break;
2181 CASE_FLT_FN (BUILT_IN_COS):
2182 builtin_optab = cos_optab; break;
2187 /* Before working hard, check whether the instruction is available. */
2188 if (optab_handler (builtin_optab, mode)->insn_code != CODE_FOR_nothing)
2190 target = gen_reg_rtx (mode);
2192 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2193 need to expand the argument again. This way, we will not perform
2194 side-effects more the once. */
2195 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2197 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
2201 /* Compute into TARGET.
2202 Set TARGET to wherever the result comes back. */
2203 if (builtin_optab == sincos_optab)
2207 switch (DECL_FUNCTION_CODE (fndecl))
2209 CASE_FLT_FN (BUILT_IN_SIN):
2210 result = expand_twoval_unop (builtin_optab, op0, 0, target, 0);
2212 CASE_FLT_FN (BUILT_IN_COS):
2213 result = expand_twoval_unop (builtin_optab, op0, target, 0, 0);
2218 gcc_assert (result);
2222 target = expand_unop (mode, builtin_optab, op0, target, 0);
2227 /* Output the entire sequence. */
2228 insns = get_insns ();
2234 /* If we were unable to expand via the builtin, stop the sequence
2235 (without outputting the insns) and call to the library function
2236 with the stabilized argument list. */
2240 target = expand_call (exp, target, target == const0_rtx);
2245 /* Given an interclass math builtin decl FNDECL and it's argument ARG
2246 return an RTL instruction code that implements the functionality.
2247 If that isn't possible or available return CODE_FOR_nothing. */
2249 static enum insn_code
2250 interclass_mathfn_icode (tree arg, tree fndecl)
2252 bool errno_set = false;
2253 optab builtin_optab = 0;
2254 enum machine_mode mode;
2256 switch (DECL_FUNCTION_CODE (fndecl))
2258 CASE_FLT_FN (BUILT_IN_ILOGB):
2259 errno_set = true; builtin_optab = ilogb_optab; break;
2260 CASE_FLT_FN (BUILT_IN_ISINF):
2261 builtin_optab = isinf_optab; break;
2262 case BUILT_IN_ISNORMAL:
2263 case BUILT_IN_ISFINITE:
2264 CASE_FLT_FN (BUILT_IN_FINITE):
2265 case BUILT_IN_FINITED32:
2266 case BUILT_IN_FINITED64:
2267 case BUILT_IN_FINITED128:
2268 case BUILT_IN_ISINFD32:
2269 case BUILT_IN_ISINFD64:
2270 case BUILT_IN_ISINFD128:
2271 /* These builtins have no optabs (yet). */
2277 /* There's no easy way to detect the case we need to set EDOM. */
2278 if (flag_errno_math && errno_set)
2279 return CODE_FOR_nothing;
2281 /* Optab mode depends on the mode of the input argument. */
2282 mode = TYPE_MODE (TREE_TYPE (arg));
2285 return optab_handler (builtin_optab, mode)->insn_code;
2286 return CODE_FOR_nothing;
2289 /* Expand a call to one of the builtin math functions that operate on
2290 floating point argument and output an integer result (ilogb, isinf,
2292 Return 0 if a normal call should be emitted rather than expanding the
2293 function in-line. EXP is the expression that is a call to the builtin
2294 function; if convenient, the result should be placed in TARGET.
2295 SUBTARGET may be used as the target for computing one of EXP's operands. */
2298 expand_builtin_interclass_mathfn (tree exp, rtx target, rtx subtarget)
2300 enum insn_code icode = CODE_FOR_nothing;
2302 tree fndecl = get_callee_fndecl (exp);
2303 enum machine_mode mode;
2306 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2309 arg = CALL_EXPR_ARG (exp, 0);
2310 icode = interclass_mathfn_icode (arg, fndecl);
2311 mode = TYPE_MODE (TREE_TYPE (arg));
2313 if (icode != CODE_FOR_nothing)
2315 rtx last = get_last_insn ();
2316 tree orig_arg = arg;
2317 /* Make a suitable register to place result in. */
2319 || GET_MODE (target) != TYPE_MODE (TREE_TYPE (exp))
2320 || !insn_data[icode].operand[0].predicate (target, GET_MODE (target)))
2321 target = gen_reg_rtx (TYPE_MODE (TREE_TYPE (exp)));
2323 gcc_assert (insn_data[icode].operand[0].predicate
2324 (target, GET_MODE (target)));
2326 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2327 need to expand the argument again. This way, we will not perform
2328 side-effects more the once. */
2329 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2331 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
2333 if (mode != GET_MODE (op0))
2334 op0 = convert_to_mode (mode, op0, 0);
2336 /* Compute into TARGET.
2337 Set TARGET to wherever the result comes back. */
2338 if (maybe_emit_unop_insn (icode, target, op0, UNKNOWN))
2340 delete_insns_since (last);
2341 CALL_EXPR_ARG (exp, 0) = orig_arg;
2347 /* Expand a call to the builtin sincos math function.
2348 Return NULL_RTX if a normal call should be emitted rather than expanding the
2349 function in-line. EXP is the expression that is a call to the builtin
2353 expand_builtin_sincos (tree exp)
2355 rtx op0, op1, op2, target1, target2;
2356 enum machine_mode mode;
2357 tree arg, sinp, cosp;
2359 location_t loc = EXPR_LOCATION (exp);
2361 if (!validate_arglist (exp, REAL_TYPE,
2362 POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
2365 arg = CALL_EXPR_ARG (exp, 0);
2366 sinp = CALL_EXPR_ARG (exp, 1);
2367 cosp = CALL_EXPR_ARG (exp, 2);
2369 /* Make a suitable register to place result in. */
2370 mode = TYPE_MODE (TREE_TYPE (arg));
2372 /* Check if sincos insn is available, otherwise emit the call. */
2373 if (optab_handler (sincos_optab, mode)->insn_code == CODE_FOR_nothing)
2376 target1 = gen_reg_rtx (mode);
2377 target2 = gen_reg_rtx (mode);
2379 op0 = expand_normal (arg);
2380 op1 = expand_normal (build_fold_indirect_ref_loc (loc, sinp));
2381 op2 = expand_normal (build_fold_indirect_ref_loc (loc, cosp));
2383 /* Compute into target1 and target2.
2384 Set TARGET to wherever the result comes back. */
2385 result = expand_twoval_unop (sincos_optab, op0, target2, target1, 0);
2386 gcc_assert (result);
2388 /* Move target1 and target2 to the memory locations indicated
2390 emit_move_insn (op1, target1);
2391 emit_move_insn (op2, target2);
2396 /* Expand a call to the internal cexpi builtin to the sincos math function.
2397 EXP is the expression that is a call to the builtin function; if convenient,
2398 the result should be placed in TARGET. SUBTARGET may be used as the target
2399 for computing one of EXP's operands. */
2402 expand_builtin_cexpi (tree exp, rtx target, rtx subtarget)
2404 tree fndecl = get_callee_fndecl (exp);
2406 enum machine_mode mode;
2408 location_t loc = EXPR_LOCATION (exp);
2410 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2413 arg = CALL_EXPR_ARG (exp, 0);
2414 type = TREE_TYPE (arg);
2415 mode = TYPE_MODE (TREE_TYPE (arg));
2417 /* Try expanding via a sincos optab, fall back to emitting a libcall
2418 to sincos or cexp. We are sure we have sincos or cexp because cexpi
2419 is only generated from sincos, cexp or if we have either of them. */
2420 if (optab_handler (sincos_optab, mode)->insn_code != CODE_FOR_nothing)
2422 op1 = gen_reg_rtx (mode);
2423 op2 = gen_reg_rtx (mode);
2425 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
2427 /* Compute into op1 and op2. */
2428 expand_twoval_unop (sincos_optab, op0, op2, op1, 0);
2430 else if (TARGET_HAS_SINCOS)
2432 tree call, fn = NULL_TREE;
2436 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIF)
2437 fn = built_in_decls[BUILT_IN_SINCOSF];
2438 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPI)
2439 fn = built_in_decls[BUILT_IN_SINCOS];
2440 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIL)
2441 fn = built_in_decls[BUILT_IN_SINCOSL];
2445 op1 = assign_temp (TREE_TYPE (arg), 0, 1, 1);
2446 op2 = assign_temp (TREE_TYPE (arg), 0, 1, 1);
2447 op1a = copy_to_mode_reg (Pmode, XEXP (op1, 0));
2448 op2a = copy_to_mode_reg (Pmode, XEXP (op2, 0));
2449 top1 = make_tree (build_pointer_type (TREE_TYPE (arg)), op1a);
2450 top2 = make_tree (build_pointer_type (TREE_TYPE (arg)), op2a);
2452 /* Make sure not to fold the sincos call again. */
2453 call = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn);
2454 expand_normal (build_call_nary (TREE_TYPE (TREE_TYPE (fn)),
2455 call, 3, arg, top1, top2));
2459 tree call, fn = NULL_TREE, narg;
2460 tree ctype = build_complex_type (type);
2462 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIF)
2463 fn = built_in_decls[BUILT_IN_CEXPF];
2464 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPI)
2465 fn = built_in_decls[BUILT_IN_CEXP];
2466 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIL)
2467 fn = built_in_decls[BUILT_IN_CEXPL];
2471 /* If we don't have a decl for cexp create one. This is the
2472 friendliest fallback if the user calls __builtin_cexpi
2473 without full target C99 function support. */
2474 if (fn == NULL_TREE)
2477 const char *name = NULL;
2479 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIF)
2481 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPI)
2483 else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIL)
2486 fntype = build_function_type_list (ctype, ctype, NULL_TREE);
2487 fn = build_fn_decl (name, fntype);
2490 narg = fold_build2_loc (loc, COMPLEX_EXPR, ctype,
2491 build_real (type, dconst0), arg);
2493 /* Make sure not to fold the cexp call again. */
2494 call = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn);
2495 return expand_expr (build_call_nary (ctype, call, 1, narg),
2496 target, VOIDmode, EXPAND_NORMAL);
2499 /* Now build the proper return type. */
2500 return expand_expr (build2 (COMPLEX_EXPR, build_complex_type (type),
2501 make_tree (TREE_TYPE (arg), op2),
2502 make_tree (TREE_TYPE (arg), op1)),
2503 target, VOIDmode, EXPAND_NORMAL);
2506 /* Conveniently construct a function call expression. FNDECL names the
2507 function to be called, N is the number of arguments, and the "..."
2508 parameters are the argument expressions. Unlike build_call_exr
2509 this doesn't fold the call, hence it will always return a CALL_EXPR. */
2512 build_call_nofold_loc (location_t loc, tree fndecl, int n, ...)
2515 tree fntype = TREE_TYPE (fndecl);
2516 tree fn = build1 (ADDR_EXPR, build_pointer_type (fntype), fndecl);
2519 fn = build_call_valist (TREE_TYPE (fntype), fn, n, ap);
2521 SET_EXPR_LOCATION (fn, loc);
2524 #define build_call_nofold(...) \
2525 build_call_nofold_loc (UNKNOWN_LOCATION, __VA_ARGS__)
2527 /* Expand a call to one of the builtin rounding functions gcc defines
2528 as an extension (lfloor and lceil). As these are gcc extensions we
2529 do not need to worry about setting errno to EDOM.
2530 If expanding via optab fails, lower expression to (int)(floor(x)).
2531 EXP is the expression that is a call to the builtin function;
2532 if convenient, the result should be placed in TARGET. */
2535 expand_builtin_int_roundingfn (tree exp, rtx target)
2537 convert_optab builtin_optab;
2538 rtx op0, insns, tmp;
2539 tree fndecl = get_callee_fndecl (exp);
2540 enum built_in_function fallback_fn;
2541 tree fallback_fndecl;
2542 enum machine_mode mode;
2545 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2548 arg = CALL_EXPR_ARG (exp, 0);
2550 switch (DECL_FUNCTION_CODE (fndecl))
2552 CASE_FLT_FN (BUILT_IN_LCEIL):
2553 CASE_FLT_FN (BUILT_IN_LLCEIL):
2554 builtin_optab = lceil_optab;
2555 fallback_fn = BUILT_IN_CEIL;
2558 CASE_FLT_FN (BUILT_IN_LFLOOR):
2559 CASE_FLT_FN (BUILT_IN_LLFLOOR):
2560 builtin_optab = lfloor_optab;
2561 fallback_fn = BUILT_IN_FLOOR;
2568 /* Make a suitable register to place result in. */
2569 mode = TYPE_MODE (TREE_TYPE (exp));
2571 target = gen_reg_rtx (mode);
2573 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2574 need to expand the argument again. This way, we will not perform
2575 side-effects more the once. */
2576 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2578 op0 = expand_expr (arg, NULL, VOIDmode, EXPAND_NORMAL);
2582 /* Compute into TARGET. */
2583 if (expand_sfix_optab (target, op0, builtin_optab))
2585 /* Output the entire sequence. */
2586 insns = get_insns ();
2592 /* If we were unable to expand via the builtin, stop the sequence
2593 (without outputting the insns). */
2596 /* Fall back to floating point rounding optab. */
2597 fallback_fndecl = mathfn_built_in (TREE_TYPE (arg), fallback_fn);
2599 /* For non-C99 targets we may end up without a fallback fndecl here
2600 if the user called __builtin_lfloor directly. In this case emit
2601 a call to the floor/ceil variants nevertheless. This should result
2602 in the best user experience for not full C99 targets. */
2603 if (fallback_fndecl == NULL_TREE)
2606 const char *name = NULL;
2608 switch (DECL_FUNCTION_CODE (fndecl))
2610 case BUILT_IN_LCEIL:
2611 case BUILT_IN_LLCEIL:
2614 case BUILT_IN_LCEILF:
2615 case BUILT_IN_LLCEILF:
2618 case BUILT_IN_LCEILL:
2619 case BUILT_IN_LLCEILL:
2622 case BUILT_IN_LFLOOR:
2623 case BUILT_IN_LLFLOOR:
2626 case BUILT_IN_LFLOORF:
2627 case BUILT_IN_LLFLOORF:
2630 case BUILT_IN_LFLOORL:
2631 case BUILT_IN_LLFLOORL:
2638 fntype = build_function_type_list (TREE_TYPE (arg),
2639 TREE_TYPE (arg), NULL_TREE);
2640 fallback_fndecl = build_fn_decl (name, fntype);
2643 exp = build_call_nofold (fallback_fndecl, 1, arg);
2645 tmp = expand_normal (exp);
2647 /* Truncate the result of floating point optab to integer
2648 via expand_fix (). */
2649 target = gen_reg_rtx (mode);
2650 expand_fix (target, tmp, 0);
2655 /* Expand a call to one of the builtin math functions doing integer
2657 Return 0 if a normal call should be emitted rather than expanding the
2658 function in-line. EXP is the expression that is a call to the builtin
2659 function; if convenient, the result should be placed in TARGET. */
2662 expand_builtin_int_roundingfn_2 (tree exp, rtx target)
2664 convert_optab builtin_optab;
2666 tree fndecl = get_callee_fndecl (exp);
2668 enum machine_mode mode;
2670 /* There's no easy way to detect the case we need to set EDOM. */
2671 if (flag_errno_math)
2674 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2677 arg = CALL_EXPR_ARG (exp, 0);
2679 switch (DECL_FUNCTION_CODE (fndecl))
2681 CASE_FLT_FN (BUILT_IN_LRINT):
2682 CASE_FLT_FN (BUILT_IN_LLRINT):
2683 builtin_optab = lrint_optab; break;
2684 CASE_FLT_FN (BUILT_IN_LROUND):
2685 CASE_FLT_FN (BUILT_IN_LLROUND):
2686 builtin_optab = lround_optab; break;
2691 /* Make a suitable register to place result in. */
2692 mode = TYPE_MODE (TREE_TYPE (exp));
2694 target = gen_reg_rtx (mode);
2696 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2697 need to expand the argument again. This way, we will not perform
2698 side-effects more the once. */
2699 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2701 op0 = expand_expr (arg, NULL, VOIDmode, EXPAND_NORMAL);
2705 if (expand_sfix_optab (target, op0, builtin_optab))
2707 /* Output the entire sequence. */
2708 insns = get_insns ();
2714 /* If we were unable to expand via the builtin, stop the sequence
2715 (without outputting the insns) and call to the library function
2716 with the stabilized argument list. */
2719 target = expand_call (exp, target, target == const0_rtx);
2724 /* To evaluate powi(x,n), the floating point value x raised to the
2725 constant integer exponent n, we use a hybrid algorithm that
2726 combines the "window method" with look-up tables. For an
2727 introduction to exponentiation algorithms and "addition chains",
2728 see section 4.6.3, "Evaluation of Powers" of Donald E. Knuth,
2729 "Seminumerical Algorithms", Vol. 2, "The Art of Computer Programming",
2730 3rd Edition, 1998, and Daniel M. Gordon, "A Survey of Fast Exponentiation
2731 Methods", Journal of Algorithms, Vol. 27, pp. 129-146, 1998. */
2733 /* Provide a default value for POWI_MAX_MULTS, the maximum number of
2734 multiplications to inline before calling the system library's pow
2735 function. powi(x,n) requires at worst 2*bits(n)-2 multiplications,
2736 so this default never requires calling pow, powf or powl. */
2738 #ifndef POWI_MAX_MULTS
2739 #define POWI_MAX_MULTS (2*HOST_BITS_PER_WIDE_INT-2)
2742 /* The size of the "optimal power tree" lookup table. All
2743 exponents less than this value are simply looked up in the
2744 powi_table below. This threshold is also used to size the
2745 cache of pseudo registers that hold intermediate results. */
2746 #define POWI_TABLE_SIZE 256
2748 /* The size, in bits of the window, used in the "window method"
2749 exponentiation algorithm. This is equivalent to a radix of
2750 (1<<POWI_WINDOW_SIZE) in the corresponding "m-ary method". */
2751 #define POWI_WINDOW_SIZE 3
2753 /* The following table is an efficient representation of an
2754 "optimal power tree". For each value, i, the corresponding
2755 value, j, in the table states than an optimal evaluation
2756 sequence for calculating pow(x,i) can be found by evaluating
2757 pow(x,j)*pow(x,i-j). An optimal power tree for the first
2758 100 integers is given in Knuth's "Seminumerical algorithms". */
2760 static const unsigned char powi_table[POWI_TABLE_SIZE] =
2762 0, 1, 1, 2, 2, 3, 3, 4, /* 0 - 7 */
2763 4, 6, 5, 6, 6, 10, 7, 9, /* 8 - 15 */
2764 8, 16, 9, 16, 10, 12, 11, 13, /* 16 - 23 */
2765 12, 17, 13, 18, 14, 24, 15, 26, /* 24 - 31 */
2766 16, 17, 17, 19, 18, 33, 19, 26, /* 32 - 39 */
2767 20, 25, 21, 40, 22, 27, 23, 44, /* 40 - 47 */
2768 24, 32, 25, 34, 26, 29, 27, 44, /* 48 - 55 */
2769 28, 31, 29, 34, 30, 60, 31, 36, /* 56 - 63 */
2770 32, 64, 33, 34, 34, 46, 35, 37, /* 64 - 71 */
2771 36, 65, 37, 50, 38, 48, 39, 69, /* 72 - 79 */
2772 40, 49, 41, 43, 42, 51, 43, 58, /* 80 - 87 */
2773 44, 64, 45, 47, 46, 59, 47, 76, /* 88 - 95 */
2774 48, 65, 49, 66, 50, 67, 51, 66, /* 96 - 103 */
2775 52, 70, 53, 74, 54, 104, 55, 74, /* 104 - 111 */
2776 56, 64, 57, 69, 58, 78, 59, 68, /* 112 - 119 */
2777 60, 61, 61, 80, 62, 75, 63, 68, /* 120 - 127 */
2778 64, 65, 65, 128, 66, 129, 67, 90, /* 128 - 135 */
2779 68, 73, 69, 131, 70, 94, 71, 88, /* 136 - 143 */
2780 72, 128, 73, 98, 74, 132, 75, 121, /* 144 - 151 */
2781 76, 102, 77, 124, 78, 132, 79, 106, /* 152 - 159 */
2782 80, 97, 81, 160, 82, 99, 83, 134, /* 160 - 167 */
2783 84, 86, 85, 95, 86, 160, 87, 100, /* 168 - 175 */
2784 88, 113, 89, 98, 90, 107, 91, 122, /* 176 - 183 */
2785 92, 111, 93, 102, 94, 126, 95, 150, /* 184 - 191 */
2786 96, 128, 97, 130, 98, 133, 99, 195, /* 192 - 199 */
2787 100, 128, 101, 123, 102, 164, 103, 138, /* 200 - 207 */
2788 104, 145, 105, 146, 106, 109, 107, 149, /* 208 - 215 */
2789 108, 200, 109, 146, 110, 170, 111, 157, /* 216 - 223 */
2790 112, 128, 113, 130, 114, 182, 115, 132, /* 224 - 231 */
2791 116, 200, 117, 132, 118, 158, 119, 206, /* 232 - 239 */
2792 120, 240, 121, 162, 122, 147, 123, 152, /* 240 - 247 */
2793 124, 166, 125, 214, 126, 138, 127, 153, /* 248 - 255 */
2797 /* Return the number of multiplications required to calculate
2798 powi(x,n) where n is less than POWI_TABLE_SIZE. This is a
2799 subroutine of powi_cost. CACHE is an array indicating
2800 which exponents have already been calculated. */
2803 powi_lookup_cost (unsigned HOST_WIDE_INT n, bool *cache)
2805 /* If we've already calculated this exponent, then this evaluation
2806 doesn't require any additional multiplications. */
2811 return powi_lookup_cost (n - powi_table[n], cache)
2812 + powi_lookup_cost (powi_table[n], cache) + 1;
2815 /* Return the number of multiplications required to calculate
2816 powi(x,n) for an arbitrary x, given the exponent N. This
2817 function needs to be kept in sync with expand_powi below. */
2820 powi_cost (HOST_WIDE_INT n)
2822 bool cache[POWI_TABLE_SIZE];
2823 unsigned HOST_WIDE_INT digit;
2824 unsigned HOST_WIDE_INT val;
2830 /* Ignore the reciprocal when calculating the cost. */
2831 val = (n < 0) ? -n : n;
2833 /* Initialize the exponent cache. */
2834 memset (cache, 0, POWI_TABLE_SIZE * sizeof (bool));
2839 while (val >= POWI_TABLE_SIZE)
2843 digit = val & ((1 << POWI_WINDOW_SIZE) - 1);
2844 result += powi_lookup_cost (digit, cache)
2845 + POWI_WINDOW_SIZE + 1;
2846 val >>= POWI_WINDOW_SIZE;
2855 return result + powi_lookup_cost (val, cache);
2858 /* Recursive subroutine of expand_powi. This function takes the array,
2859 CACHE, of already calculated exponents and an exponent N and returns
2860 an RTX that corresponds to CACHE[1]**N, as calculated in mode MODE. */
2863 expand_powi_1 (enum machine_mode mode, unsigned HOST_WIDE_INT n, rtx *cache)
2865 unsigned HOST_WIDE_INT digit;
2869 if (n < POWI_TABLE_SIZE)
2874 target = gen_reg_rtx (mode);
2877 op0 = expand_powi_1 (mode, n - powi_table[n], cache);
2878 op1 = expand_powi_1 (mode, powi_table[n], cache);
2882 target = gen_reg_rtx (mode);
2883 digit = n & ((1 << POWI_WINDOW_SIZE) - 1);
2884 op0 = expand_powi_1 (mode, n - digit, cache);
2885 op1 = expand_powi_1 (mode, digit, cache);
2889 target = gen_reg_rtx (mode);
2890 op0 = expand_powi_1 (mode, n >> 1, cache);
2894 result = expand_mult (mode, op0, op1, target, 0);
2895 if (result != target)
2896 emit_move_insn (target, result);
2900 /* Expand the RTL to evaluate powi(x,n) in mode MODE. X is the
2901 floating point operand in mode MODE, and N is the exponent. This
2902 function needs to be kept in sync with powi_cost above. */
2905 expand_powi (rtx x, enum machine_mode mode, HOST_WIDE_INT n)
2907 rtx cache[POWI_TABLE_SIZE];
2911 return CONST1_RTX (mode);
2913 memset (cache, 0, sizeof (cache));
2916 result = expand_powi_1 (mode, (n < 0) ? -n : n, cache);
2918 /* If the original exponent was negative, reciprocate the result. */
2920 result = expand_binop (mode, sdiv_optab, CONST1_RTX (mode),
2921 result, NULL_RTX, 0, OPTAB_LIB_WIDEN);
2926 /* Fold a builtin function call to pow, powf, or powl into a series of sqrts or
2927 cbrts. Return NULL_RTX if no simplification can be made or expand the tree
2928 if we can simplify it. */
2930 expand_builtin_pow_root (location_t loc, tree arg0, tree arg1, tree type,
2933 if (TREE_CODE (arg1) == REAL_CST
2934 && !TREE_OVERFLOW (arg1)
2935 && flag_unsafe_math_optimizations)
2937 enum machine_mode mode = TYPE_MODE (type);
2938 tree sqrtfn = mathfn_built_in (type, BUILT_IN_SQRT);
2939 tree cbrtfn = mathfn_built_in (type, BUILT_IN_CBRT);
2940 REAL_VALUE_TYPE c = TREE_REAL_CST (arg1);
2941 tree op = NULL_TREE;
2945 /* Optimize pow (x, 0.5) into sqrt. */
2946 if (REAL_VALUES_EQUAL (c, dconsthalf))
2947 op = build_call_nofold_loc (loc, sqrtfn, 1, arg0);
2951 REAL_VALUE_TYPE dconst1_4 = dconst1;
2952 REAL_VALUE_TYPE dconst3_4;
2953 SET_REAL_EXP (&dconst1_4, REAL_EXP (&dconst1_4) - 2);
2955 real_from_integer (&dconst3_4, VOIDmode, 3, 0, 0);
2956 SET_REAL_EXP (&dconst3_4, REAL_EXP (&dconst3_4) - 2);
2958 /* Optimize pow (x, 0.25) into sqrt (sqrt (x)). Assume on most
2959 machines that a builtin sqrt instruction is smaller than a
2960 call to pow with 0.25, so do this optimization even if
2962 if (REAL_VALUES_EQUAL (c, dconst1_4))
2964 op = build_call_nofold_loc (loc, sqrtfn, 1, arg0);
2965 op = build_call_nofold_loc (loc, sqrtfn, 1, op);
2968 /* Optimize pow (x, 0.75) = sqrt (x) * sqrt (sqrt (x)) unless we
2969 are optimizing for space. */
2970 else if (optimize_insn_for_speed_p ()
2971 && !TREE_SIDE_EFFECTS (arg0)
2972 && REAL_VALUES_EQUAL (c, dconst3_4))
2974 tree sqrt1 = build_call_expr_loc (loc, sqrtfn, 1, arg0);
2975 tree sqrt2 = builtin_save_expr (sqrt1);
2976 tree sqrt3 = build_call_expr_loc (loc, sqrtfn, 1, sqrt1);
2977 op = fold_build2_loc (loc, MULT_EXPR, type, sqrt2, sqrt3);
2982 /* Check whether we can do cbrt insstead of pow (x, 1./3.) and
2983 cbrt/sqrts instead of pow (x, 1./6.). */
2985 && (tree_expr_nonnegative_p (arg0) || !HONOR_NANS (mode)))
2987 /* First try 1/3. */
2988 REAL_VALUE_TYPE dconst1_3
2989 = real_value_truncate (mode, dconst_third ());
2991 if (REAL_VALUES_EQUAL (c, dconst1_3))
2992 op = build_call_nofold_loc (loc, cbrtfn, 1, arg0);
2995 else if (optimize_insn_for_speed_p ())
2997 REAL_VALUE_TYPE dconst1_6 = dconst1_3;
2998 SET_REAL_EXP (&dconst1_6, REAL_EXP (&dconst1_6) - 1);
3000 if (REAL_VALUES_EQUAL (c, dconst1_6))
3002 op = build_call_nofold_loc (loc, sqrtfn, 1, arg0);
3003 op = build_call_nofold_loc (loc, cbrtfn, 1, op);
3009 return expand_expr (op, subtarget, mode, EXPAND_NORMAL);
3015 /* Expand a call to the pow built-in mathematical function. Return NULL_RTX if
3016 a normal call should be emitted rather than expanding the function
3017 in-line. EXP is the expression that is a call to the builtin
3018 function; if convenient, the result should be placed in TARGET. */
3021 expand_builtin_pow (tree exp, rtx target, rtx subtarget)
3025 tree type = TREE_TYPE (exp);
3026 REAL_VALUE_TYPE cint, c, c2;
3029 enum machine_mode mode = TYPE_MODE (type);
3031 if (! validate_arglist (exp, REAL_TYPE, REAL_TYPE, VOID_TYPE))
3034 arg0 = CALL_EXPR_ARG (exp, 0);
3035 arg1 = CALL_EXPR_ARG (exp, 1);
3037 if (TREE_CODE (arg1) != REAL_CST
3038 || TREE_OVERFLOW (arg1))
3039 return expand_builtin_mathfn_2 (exp, target, subtarget);
3041 /* Handle constant exponents. */
3043 /* For integer valued exponents we can expand to an optimal multiplication
3044 sequence using expand_powi. */
3045 c = TREE_REAL_CST (arg1);
3046 n = real_to_integer (&c);
3047 real_from_integer (&cint, VOIDmode, n, n < 0 ? -1 : 0, 0);
3048 if (real_identical (&c, &cint)
3049 && ((n >= -1 && n <= 2)
3050 || (flag_unsafe_math_optimizations
3051 && optimize_insn_for_speed_p ()
3052 && powi_cost (n) <= POWI_MAX_MULTS)))
3054 op = expand_expr (arg0, subtarget, VOIDmode, EXPAND_NORMAL);
3057 op = force_reg (mode, op);
3058 op = expand_powi (op, mode, n);
3063 narg0 = builtin_save_expr (arg0);
3065 /* If the exponent is not integer valued, check if it is half of an integer.
3066 In this case we can expand to sqrt (x) * x**(n/2). */
3067 fn = mathfn_built_in (type, BUILT_IN_SQRT);
3068 if (fn != NULL_TREE)
3070 real_arithmetic (&c2, MULT_EXPR, &c, &dconst2);
3071 n = real_to_integer (&c2);
3072 real_from_integer (&cint, VOIDmode, n, n < 0 ? -1 : 0, 0);
3073 if (real_identical (&c2, &cint)
3074 && ((flag_unsafe_math_optimizations
3075 && optimize_insn_for_speed_p ()
3076 && powi_cost (n/2) <= POWI_MAX_MULTS)
3077 /* Even the c == 0.5 case cannot be done unconditionally
3078 when we need to preserve signed zeros, as
3079 pow (-0, 0.5) is +0, while sqrt(-0) is -0. */
3080 || (!HONOR_SIGNED_ZEROS (mode) && n == 1)
3081 /* For c == 1.5 we can assume that x * sqrt (x) is always
3082 smaller than pow (x, 1.5) if sqrt will not be expanded
3085 && (optab_handler (sqrt_optab, mode)->insn_code
3086 != CODE_FOR_nothing))))
3088 tree call_expr = build_call_nofold (fn, 1, narg0);
3089 /* Use expand_expr in case the newly built call expression
3090 was folded to a non-call. */
3091 op = expand_expr (call_expr, subtarget, mode, EXPAND_NORMAL);
3094 op2 = expand_expr (narg0, subtarget, VOIDmode, EXPAND_NORMAL);
3095 op2 = force_reg (mode, op2);
3096 op2 = expand_powi (op2, mode, abs (n / 2));
3097 op = expand_simple_binop (mode, MULT, op, op2, NULL_RTX,
3098 0, OPTAB_LIB_WIDEN);
3099 /* If the original exponent was negative, reciprocate the
3102 op = expand_binop (mode, sdiv_optab, CONST1_RTX (mode),
3103 op, NULL_RTX, 0, OPTAB_LIB_WIDEN);
3109 /* Check whether we can do a series of sqrt or cbrt's instead of the pow
3111 op = expand_builtin_pow_root (EXPR_LOCATION (exp), arg0, arg1, type,
3116 /* Try if the exponent is a third of an integer. In this case
3117 we can expand to x**(n/3) * cbrt(x)**(n%3). As cbrt (x) is
3118 different from pow (x, 1./3.) due to rounding and behavior
3119 with negative x we need to constrain this transformation to
3120 unsafe math and positive x or finite math. */
3121 fn = mathfn_built_in (type, BUILT_IN_CBRT);
3123 && flag_unsafe_math_optimizations
3124 && (tree_expr_nonnegative_p (arg0)
3125 || !HONOR_NANS (mode)))
3127 REAL_VALUE_TYPE dconst3;
3128 real_from_integer (&dconst3, VOIDmode, 3, 0, 0);
3129 real_arithmetic (&c2, MULT_EXPR, &c, &dconst3);
3130 real_round (&c2, mode, &c2);
3131 n = real_to_integer (&c2);
3132 real_from_integer (&cint, VOIDmode, n, n < 0 ? -1 : 0, 0);
3133 real_arithmetic (&c2, RDIV_EXPR, &cint, &dconst3);
3134 real_convert (&c2, mode, &c2);
3135 if (real_identical (&c2, &c)
3136 && ((optimize_insn_for_speed_p ()
3137 && powi_cost (n/3) <= POWI_MAX_MULTS)
3140 tree call_expr = build_call_nofold (fn, 1,narg0);
3141 op = expand_builtin (call_expr, NULL_RTX, subtarget, mode, 0);
3142 if (abs (n) % 3 == 2)
3143 op = expand_simple_binop (mode, MULT, op, op, op,
3144 0, OPTAB_LIB_WIDEN);
3147 op2 = expand_expr (narg0, subtarget, VOIDmode, EXPAND_NORMAL);
3148 op2 = force_reg (mode, op2);
3149 op2 = expand_powi (op2, mode, abs (n / 3));
3150 op = expand_simple_binop (mode, MULT, op, op2, NULL_RTX,
3151 0, OPTAB_LIB_WIDEN);
3152 /* If the original exponent was negative, reciprocate the
3155 op = expand_binop (mode, sdiv_optab, CONST1_RTX (mode),
3156 op, NULL_RTX, 0, OPTAB_LIB_WIDEN);
3162 /* Fall back to optab expansion. */
3163 return expand_builtin_mathfn_2 (exp, target, subtarget);
3166 /* Expand a call to the powi built-in mathematical function. Return NULL_RTX if
3167 a normal call should be emitted rather than expanding the function
3168 in-line. EXP is the expression that is a call to the builtin
3169 function; if convenient, the result should be placed in TARGET. */
3172 expand_builtin_powi (tree exp, rtx target, rtx subtarget)
3176 enum machine_mode mode;
3177 enum machine_mode mode2;
3179 if (! validate_arglist (exp, REAL_TYPE, INTEGER_TYPE, VOID_TYPE))
3182 arg0 = CALL_EXPR_ARG (exp, 0);
3183 arg1 = CALL_EXPR_ARG (exp, 1);
3184 mode = TYPE_MODE (TREE_TYPE (exp));
3186 /* Handle constant power. */
3188 if (TREE_CODE (arg1) == INTEGER_CST
3189 && !TREE_OVERFLOW (arg1))
3191 HOST_WIDE_INT n = TREE_INT_CST_LOW (arg1);
3193 /* If the exponent is -1, 0, 1 or 2, then expand_powi is exact.
3194 Otherwise, check the number of multiplications required. */
3195 if ((TREE_INT_CST_HIGH (arg1) == 0
3196 || TREE_INT_CST_HIGH (arg1) == -1)
3197 && ((n >= -1 && n <= 2)
3198 || (optimize_insn_for_speed_p ()
3199 && powi_cost (n) <= POWI_MAX_MULTS)))
3201 op0 = expand_expr (arg0, subtarget, VOIDmode, EXPAND_NORMAL);
3202 op0 = force_reg (mode, op0);
3203 return expand_powi (op0, mode, n);
3207 /* Emit a libcall to libgcc. */
3209 /* Mode of the 2nd argument must match that of an int. */
3210 mode2 = mode_for_size (INT_TYPE_SIZE, MODE_INT, 0);
3212 if (target == NULL_RTX)
3213 target = gen_reg_rtx (mode);
3215 op0 = expand_expr (arg0, subtarget, mode, EXPAND_NORMAL);
3216 if (GET_MODE (op0) != mode)
3217 op0 = convert_to_mode (mode, op0, 0);
3218 op1 = expand_expr (arg1, NULL_RTX, mode2, EXPAND_NORMAL);
3219 if (GET_MODE (op1) != mode2)
3220 op1 = convert_to_mode (mode2, op1, 0);
3222 target = emit_library_call_value (optab_libfunc (powi_optab, mode),
3223 target, LCT_CONST, mode, 2,
3224 op0, mode, op1, mode2);
3229 /* Expand expression EXP which is a call to the strlen builtin. Return
3230 NULL_RTX if we failed the caller should emit a normal call, otherwise
3231 try to get the result in TARGET, if convenient. */
3234 expand_builtin_strlen (tree exp, rtx target,
3235 enum machine_mode target_mode)
3237 if (!validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
3243 tree src = CALL_EXPR_ARG (exp, 0);
3244 rtx result, src_reg, char_rtx, before_strlen;
3245 enum machine_mode insn_mode = target_mode, char_mode;
3246 enum insn_code icode = CODE_FOR_nothing;
3249 /* If the length can be computed at compile-time, return it. */
3250 len = c_strlen (src, 0);
3252 return expand_expr (len, target, target_mode, EXPAND_NORMAL);
3254 /* If the length can be computed at compile-time and is constant
3255 integer, but there are side-effects in src, evaluate
3256 src for side-effects, then return len.
3257 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
3258 can be optimized into: i++; x = 3; */
3259 len = c_strlen (src, 1);
3260 if (len && TREE_CODE (len) == INTEGER_CST)
3262 expand_expr (src, const0_rtx, VOIDmode, EXPAND_NORMAL);
3263 return expand_expr (len, target, target_mode, EXPAND_NORMAL);
3266 align = get_pointer_alignment (src, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3268 /* If SRC is not a pointer type, don't do this operation inline. */
3272 /* Bail out if we can't compute strlen in the right mode. */
3273 while (insn_mode != VOIDmode)
3275 icode = optab_handler (strlen_optab, insn_mode)->insn_code;
3276 if (icode != CODE_FOR_nothing)
3279 insn_mode = GET_MODE_WIDER_MODE (insn_mode);
3281 if (insn_mode == VOIDmode)
3284 /* Make a place to write the result of the instruction. */
3288 && GET_MODE (result) == insn_mode
3289 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
3290 result = gen_reg_rtx (insn_mode);
3292 /* Make a place to hold the source address. We will not expand
3293 the actual source until we are sure that the expansion will
3294 not fail -- there are trees that cannot be expanded twice. */
3295 src_reg = gen_reg_rtx (Pmode);
3297 /* Mark the beginning of the strlen sequence so we can emit the
3298 source operand later. */
3299 before_strlen = get_last_insn ();
3301 char_rtx = const0_rtx;
3302 char_mode = insn_data[(int) icode].operand[2].mode;
3303 if (! (*insn_data[(int) icode].operand[2].predicate) (char_rtx,
3305 char_rtx = copy_to_mode_reg (char_mode, char_rtx);
3307 pat = GEN_FCN (icode) (result, gen_rtx_MEM (BLKmode, src_reg),
3308 char_rtx, GEN_INT (align));
3313 /* Now that we are assured of success, expand the source. */
3315 pat = expand_expr (src, src_reg, ptr_mode, EXPAND_NORMAL);
3317 emit_move_insn (src_reg, pat);
3322 emit_insn_after (pat, before_strlen);
3324 emit_insn_before (pat, get_insns ());
3326 /* Return the value in the proper mode for this function. */
3327 if (GET_MODE (result) == target_mode)
3329 else if (target != 0)
3330 convert_move (target, result, 0);
3332 target = convert_to_mode (target_mode, result, 0);
3338 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3339 bytes from constant string DATA + OFFSET and return it as target
3343 builtin_memcpy_read_str (void *data, HOST_WIDE_INT offset,
3344 enum machine_mode mode)
3346 const char *str = (const char *) data;
3348 gcc_assert (offset >= 0
3349 && ((unsigned HOST_WIDE_INT) offset + GET_MODE_SIZE (mode)
3350 <= strlen (str) + 1));
3352 return c_readstr (str + offset, mode);
3355 /* Expand a call EXP to the memcpy builtin.
3356 Return NULL_RTX if we failed, the caller should emit a normal call,
3357 otherwise try to get the result in TARGET, if convenient (and in
3358 mode MODE if that's convenient). */
3361 expand_builtin_memcpy (tree exp, rtx target)
3363 if (!validate_arglist (exp,
3364 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3368 tree dest = CALL_EXPR_ARG (exp, 0);
3369 tree src = CALL_EXPR_ARG (exp, 1);
3370 tree len = CALL_EXPR_ARG (exp, 2);
3371 const char *src_str;
3372 unsigned int src_align = get_pointer_alignment (src, BIGGEST_ALIGNMENT);
3373 unsigned int dest_align
3374 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
3375 rtx dest_mem, src_mem, dest_addr, len_rtx;
3376 HOST_WIDE_INT expected_size = -1;
3377 unsigned int expected_align = 0;
3379 /* If DEST is not a pointer type, call the normal function. */
3380 if (dest_align == 0)
3383 /* If either SRC is not a pointer type, don't do this
3384 operation in-line. */
3388 if (currently_expanding_gimple_stmt)
3389 stringop_block_profile (currently_expanding_gimple_stmt,
3390 &expected_align, &expected_size);
3392 if (expected_align < dest_align)
3393 expected_align = dest_align;
3394 dest_mem = get_memory_rtx (dest, len);
3395 set_mem_align (dest_mem, dest_align);
3396 len_rtx = expand_normal (len);
3397 src_str = c_getstr (src);
3399 /* If SRC is a string constant and block move would be done
3400 by pieces, we can avoid loading the string from memory
3401 and only stored the computed constants. */
3403 && CONST_INT_P (len_rtx)
3404 && (unsigned HOST_WIDE_INT) INTVAL (len_rtx) <= strlen (src_str) + 1
3405 && can_store_by_pieces (INTVAL (len_rtx), builtin_memcpy_read_str,
3406 CONST_CAST (char *, src_str),
3409 dest_mem = store_by_pieces (dest_mem, INTVAL (len_rtx),
3410 builtin_memcpy_read_str,
3411 CONST_CAST (char *, src_str),
3412 dest_align, false, 0);
3413 dest_mem = force_operand (XEXP (dest_mem, 0), target);
3414 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3418 src_mem = get_memory_rtx (src, len);
3419 set_mem_align (src_mem, src_align);
3421 /* Copy word part most expediently. */
3422 dest_addr = emit_block_move_hints (dest_mem, src_mem, len_rtx,
3423 CALL_EXPR_TAILCALL (exp)
3424 ? BLOCK_OP_TAILCALL : BLOCK_OP_NORMAL,
3425 expected_align, expected_size);
3429 dest_addr = force_operand (XEXP (dest_mem, 0), target);
3430 dest_addr = convert_memory_address (ptr_mode, dest_addr);
3436 /* Expand a call EXP to the mempcpy builtin.
3437 Return NULL_RTX if we failed; the caller should emit a normal call,
3438 otherwise try to get the result in TARGET, if convenient (and in
3439 mode MODE if that's convenient). If ENDP is 0 return the
3440 destination pointer, if ENDP is 1 return the end pointer ala
3441 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3445 expand_builtin_mempcpy (tree exp, rtx target, enum machine_mode mode)
3447 if (!validate_arglist (exp,
3448 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3452 tree dest = CALL_EXPR_ARG (exp, 0);
3453 tree src = CALL_EXPR_ARG (exp, 1);
3454 tree len = CALL_EXPR_ARG (exp, 2);
3455 return expand_builtin_mempcpy_args (dest, src, len,
3456 target, mode, /*endp=*/ 1);
3460 /* Helper function to do the actual work for expand_builtin_mempcpy. The
3461 arguments to the builtin_mempcpy call DEST, SRC, and LEN are broken out
3462 so that this can also be called without constructing an actual CALL_EXPR.
3463 The other arguments and return value are the same as for
3464 expand_builtin_mempcpy. */
3467 expand_builtin_mempcpy_args (tree dest, tree src, tree len,
3468 rtx target, enum machine_mode mode, int endp)
3470 /* If return value is ignored, transform mempcpy into memcpy. */
3471 if (target == const0_rtx && implicit_built_in_decls[BUILT_IN_MEMCPY])
3473 tree fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
3474 tree result = build_call_nofold (fn, 3, dest, src, len);
3475 return expand_expr (result, target, mode, EXPAND_NORMAL);
3479 const char *src_str;
3480 unsigned int src_align = get_pointer_alignment (src, BIGGEST_ALIGNMENT);
3481 unsigned int dest_align
3482 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
3483 rtx dest_mem, src_mem, len_rtx;
3485 /* If either SRC or DEST is not a pointer type, don't do this
3486 operation in-line. */
3487 if (dest_align == 0 || src_align == 0)
3490 /* If LEN is not constant, call the normal function. */
3491 if (! host_integerp (len, 1))
3494 len_rtx = expand_normal (len);
3495 src_str = c_getstr (src);
3497 /* If SRC is a string constant and block move would be done
3498 by pieces, we can avoid loading the string from memory
3499 and only stored the computed constants. */
3501 && CONST_INT_P (len_rtx)
3502 && (unsigned HOST_WIDE_INT) INTVAL (len_rtx) <= strlen (src_str) + 1
3503 && can_store_by_pieces (INTVAL (len_rtx), builtin_memcpy_read_str,
3504 CONST_CAST (char *, src_str),
3507 dest_mem = get_memory_rtx (dest, len);
3508 set_mem_align (dest_mem, dest_align);
3509 dest_mem = store_by_pieces (dest_mem, INTVAL (len_rtx),
3510 builtin_memcpy_read_str,
3511 CONST_CAST (char *, src_str),
3512 dest_align, false, endp);
3513 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3514 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3518 if (CONST_INT_P (len_rtx)
3519 && can_move_by_pieces (INTVAL (len_rtx),
3520 MIN (dest_align, src_align)))
3522 dest_mem = get_memory_rtx (dest, len);
3523 set_mem_align (dest_mem, dest_align);
3524 src_mem = get_memory_rtx (src, len);
3525 set_mem_align (src_mem, src_align);
3526 dest_mem = move_by_pieces (dest_mem, src_mem, INTVAL (len_rtx),
3527 MIN (dest_align, src_align), endp);
3528 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3529 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3538 # define HAVE_movstr 0
3539 # define CODE_FOR_movstr CODE_FOR_nothing
3542 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
3543 we failed, the caller should emit a normal call, otherwise try to
3544 get the result in TARGET, if convenient. If ENDP is 0 return the
3545 destination pointer, if ENDP is 1 return the end pointer ala
3546 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3550 expand_movstr (tree dest, tree src, rtx target, int endp)
3556 const struct insn_data * data;
3561 dest_mem = get_memory_rtx (dest, NULL);
3562 src_mem = get_memory_rtx (src, NULL);
3565 target = force_reg (Pmode, XEXP (dest_mem, 0));
3566 dest_mem = replace_equiv_address (dest_mem, target);
3567 end = gen_reg_rtx (Pmode);
3571 if (target == 0 || target == const0_rtx)
3573 end = gen_reg_rtx (Pmode);
3581 data = insn_data + CODE_FOR_movstr;
3583 if (data->operand[0].mode != VOIDmode)
3584 end = gen_lowpart (data->operand[0].mode, end);
3586 insn = data->genfun (end, dest_mem, src_mem);
3592 /* movstr is supposed to set end to the address of the NUL
3593 terminator. If the caller requested a mempcpy-like return value,
3595 if (endp == 1 && target != const0_rtx)
3597 rtx tem = plus_constant (gen_lowpart (GET_MODE (target), end), 1);
3598 emit_move_insn (target, force_operand (tem, NULL_RTX));
3604 /* Expand expression EXP, which is a call to the strcpy builtin. Return
3605 NULL_RTX if we failed the caller should emit a normal call, otherwise
3606 try to get the result in TARGET, if convenient (and in mode MODE if that's
3610 expand_builtin_strcpy (tree exp, rtx target)
3612 if (validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3614 tree dest = CALL_EXPR_ARG (exp, 0);
3615 tree src = CALL_EXPR_ARG (exp, 1);
3616 return expand_builtin_strcpy_args (dest, src, target);
3621 /* Helper function to do the actual work for expand_builtin_strcpy. The
3622 arguments to the builtin_strcpy call DEST and SRC are broken out
3623 so that this can also be called without constructing an actual CALL_EXPR.
3624 The other arguments and return value are the same as for
3625 expand_builtin_strcpy. */
3628 expand_builtin_strcpy_args (tree dest, tree src, rtx target)
3630 return expand_movstr (dest, src, target, /*endp=*/0);
3633 /* Expand a call EXP to the stpcpy builtin.
3634 Return NULL_RTX if we failed the caller should emit a normal call,
3635 otherwise try to get the result in TARGET, if convenient (and in
3636 mode MODE if that's convenient). */
3639 expand_builtin_stpcpy (tree exp, rtx target, enum machine_mode mode)
3642 location_t loc = EXPR_LOCATION (exp);
3644 if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3647 dst = CALL_EXPR_ARG (exp, 0);
3648 src = CALL_EXPR_ARG (exp, 1);
3650 /* If return value is ignored, transform stpcpy into strcpy. */
3651 if (target == const0_rtx && implicit_built_in_decls[BUILT_IN_STRCPY])
3653 tree fn = implicit_built_in_decls[BUILT_IN_STRCPY];
3654 tree result = build_call_nofold (fn, 2, dst, src);
3655 return expand_expr (result, target, mode, EXPAND_NORMAL);
3662 /* Ensure we get an actual string whose length can be evaluated at
3663 compile-time, not an expression containing a string. This is
3664 because the latter will potentially produce pessimized code
3665 when used to produce the return value. */
3666 if (! c_getstr (src) || ! (len = c_strlen (src, 0)))
3667 return expand_movstr (dst, src, target, /*endp=*/2);
3669 lenp1 = size_binop_loc (loc, PLUS_EXPR, len, ssize_int (1));
3670 ret = expand_builtin_mempcpy_args (dst, src, lenp1,
3671 target, mode, /*endp=*/2);
3676 if (TREE_CODE (len) == INTEGER_CST)
3678 rtx len_rtx = expand_normal (len);
3680 if (CONST_INT_P (len_rtx))
3682 ret = expand_builtin_strcpy_args (dst, src, target);
3688 if (mode != VOIDmode)
3689 target = gen_reg_rtx (mode);
3691 target = gen_reg_rtx (GET_MODE (ret));
3693 if (GET_MODE (target) != GET_MODE (ret))
3694 ret = gen_lowpart (GET_MODE (target), ret);
3696 ret = plus_constant (ret, INTVAL (len_rtx));
3697 ret = emit_move_insn (target, force_operand (ret, NULL_RTX));
3705 return expand_movstr (dst, src, target, /*endp=*/2);
3709 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3710 bytes from constant string DATA + OFFSET and return it as target
3714 builtin_strncpy_read_str (void *data, HOST_WIDE_INT offset,
3715 enum machine_mode mode)
3717 const char *str = (const char *) data;
3719 if ((unsigned HOST_WIDE_INT) offset > strlen (str))
3722 return c_readstr (str + offset, mode);
3725 /* Expand expression EXP, which is a call to the strncpy builtin. Return
3726 NULL_RTX if we failed the caller should emit a normal call. */
3729 expand_builtin_strncpy (tree exp, rtx target)
3731 location_t loc = EXPR_LOCATION (exp);
3733 if (validate_arglist (exp,
3734 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3736 tree dest = CALL_EXPR_ARG (exp, 0);
3737 tree src = CALL_EXPR_ARG (exp, 1);
3738 tree len = CALL_EXPR_ARG (exp, 2);
3739 tree slen = c_strlen (src, 1);
3741 /* We must be passed a constant len and src parameter. */
3742 if (!host_integerp (len, 1) || !slen || !host_integerp (slen, 1))
3745 slen = size_binop_loc (loc, PLUS_EXPR, slen, ssize_int (1));
3747 /* We're required to pad with trailing zeros if the requested
3748 len is greater than strlen(s2)+1. In that case try to
3749 use store_by_pieces, if it fails, punt. */
3750 if (tree_int_cst_lt (slen, len))
3752 unsigned int dest_align
3753 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
3754 const char *p = c_getstr (src);
3757 if (!p || dest_align == 0 || !host_integerp (len, 1)
3758 || !can_store_by_pieces (tree_low_cst (len, 1),
3759 builtin_strncpy_read_str,
3760 CONST_CAST (char *, p),
3764 dest_mem = get_memory_rtx (dest, len);
3765 store_by_pieces (dest_mem, tree_low_cst (len, 1),
3766 builtin_strncpy_read_str,
3767 CONST_CAST (char *, p), dest_align, false, 0);
3768 dest_mem = force_operand (XEXP (dest_mem, 0), target);
3769 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3776 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3777 bytes from constant string DATA + OFFSET and return it as target
3781 builtin_memset_read_str (void *data, HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
3782 enum machine_mode mode)
3784 const char *c = (const char *) data;
3785 char *p = XALLOCAVEC (char, GET_MODE_SIZE (mode));
3787 memset (p, *c, GET_MODE_SIZE (mode));
3789 return c_readstr (p, mode);
3792 /* Callback routine for store_by_pieces. Return the RTL of a register
3793 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
3794 char value given in the RTL register data. For example, if mode is
3795 4 bytes wide, return the RTL for 0x01010101*data. */
3798 builtin_memset_gen_str (void *data, HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
3799 enum machine_mode mode)
3805 size = GET_MODE_SIZE (mode);
3809 p = XALLOCAVEC (char, size);
3810 memset (p, 1, size);
3811 coeff = c_readstr (p, mode);
3813 target = convert_to_mode (mode, (rtx) data, 1);
3814 target = expand_mult (mode, target, coeff, NULL_RTX, 1);
3815 return force_reg (mode, target);
3818 /* Expand expression EXP, which is a call to the memset builtin. Return
3819 NULL_RTX if we failed the caller should emit a normal call, otherwise
3820 try to get the result in TARGET, if convenient (and in mode MODE if that's
3824 expand_builtin_memset (tree exp, rtx target, enum machine_mode mode)
3826 if (!validate_arglist (exp,
3827 POINTER_TYPE, INTEGER_TYPE, INTEGER_TYPE, VOID_TYPE))
3831 tree dest = CALL_EXPR_ARG (exp, 0);
3832 tree val = CALL_EXPR_ARG (exp, 1);
3833 tree len = CALL_EXPR_ARG (exp, 2);
3834 return expand_builtin_memset_args (dest, val, len, target, mode, exp);
3838 /* Helper function to do the actual work for expand_builtin_memset. The
3839 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
3840 so that this can also be called without constructing an actual CALL_EXPR.
3841 The other arguments and return value are the same as for
3842 expand_builtin_memset. */
3845 expand_builtin_memset_args (tree dest, tree val, tree len,
3846 rtx target, enum machine_mode mode, tree orig_exp)
3849 enum built_in_function fcode;
3851 unsigned int dest_align;
3852 rtx dest_mem, dest_addr, len_rtx;
3853 HOST_WIDE_INT expected_size = -1;
3854 unsigned int expected_align = 0;
3856 dest_align = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
3858 /* If DEST is not a pointer type, don't do this operation in-line. */
3859 if (dest_align == 0)
3862 if (currently_expanding_gimple_stmt)
3863 stringop_block_profile (currently_expanding_gimple_stmt,
3864 &expected_align, &expected_size);
3866 if (expected_align < dest_align)
3867 expected_align = dest_align;
3869 /* If the LEN parameter is zero, return DEST. */
3870 if (integer_zerop (len))
3872 /* Evaluate and ignore VAL in case it has side-effects. */
3873 expand_expr (val, const0_rtx, VOIDmode, EXPAND_NORMAL);
3874 return expand_expr (dest, target, mode, EXPAND_NORMAL);
3877 /* Stabilize the arguments in case we fail. */
3878 dest = builtin_save_expr (dest);
3879 val = builtin_save_expr (val);
3880 len = builtin_save_expr (len);
3882 len_rtx = expand_normal (len);
3883 dest_mem = get_memory_rtx (dest, len);
3885 if (TREE_CODE (val) != INTEGER_CST)
3889 val_rtx = expand_normal (val);
3890 val_rtx = convert_to_mode (TYPE_MODE (unsigned_char_type_node),
3893 /* Assume that we can memset by pieces if we can store
3894 * the coefficients by pieces (in the required modes).
3895 * We can't pass builtin_memset_gen_str as that emits RTL. */
3897 if (host_integerp (len, 1)
3898 && can_store_by_pieces (tree_low_cst (len, 1),
3899 builtin_memset_read_str, &c, dest_align,
3902 val_rtx = force_reg (TYPE_MODE (unsigned_char_type_node),
3904 store_by_pieces (dest_mem, tree_low_cst (len, 1),
3905 builtin_memset_gen_str, val_rtx, dest_align,
3908 else if (!set_storage_via_setmem (dest_mem, len_rtx, val_rtx,
3909 dest_align, expected_align,
3913 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3914 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3918 if (target_char_cast (val, &c))
3923 if (host_integerp (len, 1)
3924 && can_store_by_pieces (tree_low_cst (len, 1),
3925 builtin_memset_read_str, &c, dest_align,
3927 store_by_pieces (dest_mem, tree_low_cst (len, 1),
3928 builtin_memset_read_str, &c, dest_align, true, 0);
3929 else if (!set_storage_via_setmem (dest_mem, len_rtx, GEN_INT (c),
3930 dest_align, expected_align,
3934 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3935 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3939 set_mem_align (dest_mem, dest_align);
3940 dest_addr = clear_storage_hints (dest_mem, len_rtx,
3941 CALL_EXPR_TAILCALL (orig_exp)
3942 ? BLOCK_OP_TAILCALL : BLOCK_OP_NORMAL,
3943 expected_align, expected_size);
3947 dest_addr = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3948 dest_addr = convert_memory_address (ptr_mode, dest_addr);
3954 fndecl = get_callee_fndecl (orig_exp);
3955 fcode = DECL_FUNCTION_CODE (fndecl);
3956 if (fcode == BUILT_IN_MEMSET)
3957 fn = build_call_nofold (fndecl, 3, dest, val, len);
3958 else if (fcode == BUILT_IN_BZERO)
3959 fn = build_call_nofold (fndecl, 2, dest, len);
3962 gcc_assert (TREE_CODE (fn) == CALL_EXPR);
3963 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (orig_exp);
3964 return expand_call (fn, target, target == const0_rtx);
3967 /* Expand expression EXP, which is a call to the bzero builtin. Return
3968 NULL_RTX if we failed the caller should emit a normal call. */
3971 expand_builtin_bzero (tree exp)
3974 location_t loc = EXPR_LOCATION (exp);
3976 if (!validate_arglist (exp, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3979 dest = CALL_EXPR_ARG (exp, 0);
3980 size = CALL_EXPR_ARG (exp, 1);
3982 /* New argument list transforming bzero(ptr x, int y) to
3983 memset(ptr x, int 0, size_t y). This is done this way
3984 so that if it isn't expanded inline, we fallback to
3985 calling bzero instead of memset. */
3987 return expand_builtin_memset_args (dest, integer_zero_node,
3988 fold_convert_loc (loc, sizetype, size),
3989 const0_rtx, VOIDmode, exp);
3992 /* Expand expression EXP, which is a call to the memcmp built-in function.
3993 Return NULL_RTX if we failed and the
3994 caller should emit a normal call, otherwise try to get the result in
3995 TARGET, if convenient (and in mode MODE, if that's convenient). */
3998 expand_builtin_memcmp (tree exp, ATTRIBUTE_UNUSED rtx target,
3999 ATTRIBUTE_UNUSED enum machine_mode mode)
4001 location_t loc ATTRIBUTE_UNUSED = EXPR_LOCATION (exp);
4003 if (!validate_arglist (exp,
4004 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
4007 #if defined HAVE_cmpmemsi || defined HAVE_cmpstrnsi
4009 rtx arg1_rtx, arg2_rtx, arg3_rtx;
4012 tree arg1 = CALL_EXPR_ARG (exp, 0);
4013 tree arg2 = CALL_EXPR_ARG (exp, 1);
4014 tree len = CALL_EXPR_ARG (exp, 2);
4017 = get_pointer_alignment (arg1, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
4019 = get_pointer_alignment (arg2, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
4020 enum machine_mode insn_mode;
4022 #ifdef HAVE_cmpmemsi
4024 insn_mode = insn_data[(int) CODE_FOR_cmpmemsi].operand[0].mode;
4027 #ifdef HAVE_cmpstrnsi
4029 insn_mode = insn_data[(int) CODE_FOR_cmpstrnsi].operand[0].mode;
4034 /* If we don't have POINTER_TYPE, call the function. */
4035 if (arg1_align == 0 || arg2_align == 0)
4038 /* Make a place to write the result of the instruction. */
4041 && REG_P (result) && GET_MODE (result) == insn_mode
4042 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
4043 result = gen_reg_rtx (insn_mode);
4045 arg1_rtx = get_memory_rtx (arg1, len);
4046 arg2_rtx = get_memory_rtx (arg2, len);
4047 arg3_rtx = expand_normal (fold_convert_loc (loc, sizetype, len));
4049 /* Set MEM_SIZE as appropriate. */
4050 if (CONST_INT_P (arg3_rtx))
4052 set_mem_size (arg1_rtx, arg3_rtx);
4053 set_mem_size (arg2_rtx, arg3_rtx);
4056 #ifdef HAVE_cmpmemsi
4058 insn = gen_cmpmemsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
4059 GEN_INT (MIN (arg1_align, arg2_align)));
4062 #ifdef HAVE_cmpstrnsi
4064 insn = gen_cmpstrnsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
4065 GEN_INT (MIN (arg1_align, arg2_align)));
4073 emit_library_call_value (memcmp_libfunc, result, LCT_PURE,
4074 TYPE_MODE (integer_type_node), 3,
4075 XEXP (arg1_rtx, 0), Pmode,
4076 XEXP (arg2_rtx, 0), Pmode,
4077 convert_to_mode (TYPE_MODE (sizetype), arg3_rtx,
4078 TYPE_UNSIGNED (sizetype)),
4079 TYPE_MODE (sizetype));
4081 /* Return the value in the proper mode for this function. */
4082 mode = TYPE_MODE (TREE_TYPE (exp));
4083 if (GET_MODE (result) == mode)
4085 else if (target != 0)
4087 convert_move (target, result, 0);
4091 return convert_to_mode (mode, result, 0);
4098 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
4099 if we failed the caller should emit a normal call, otherwise try to get
4100 the result in TARGET, if convenient. */
4103 expand_builtin_strcmp (tree exp, ATTRIBUTE_UNUSED rtx target)
4105 if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
4108 #if defined HAVE_cmpstrsi || defined HAVE_cmpstrnsi
4109 if (cmpstr_optab[SImode] != CODE_FOR_nothing
4110 || cmpstrn_optab[SImode] != CODE_FOR_nothing)
4112 rtx arg1_rtx, arg2_rtx;
4113 rtx result, insn = NULL_RTX;
4115 tree arg1 = CALL_EXPR_ARG (exp, 0);
4116 tree arg2 = CALL_EXPR_ARG (exp, 1);
4119 = get_pointer_alignment (arg1, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
4121 = get_pointer_alignment (arg2, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
4123 /* If we don't have POINTER_TYPE, call the function. */
4124 if (arg1_align == 0 || arg2_align == 0)
4127 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
4128 arg1 = builtin_save_expr (arg1);
4129 arg2 = builtin_save_expr (arg2);
4131 arg1_rtx = get_memory_rtx (arg1, NULL);
4132 arg2_rtx = get_memory_rtx (arg2, NULL);
4134 #ifdef HAVE_cmpstrsi
4135 /* Try to call cmpstrsi. */
4138 enum machine_mode insn_mode
4139 = insn_data[(int) CODE_FOR_cmpstrsi].operand[0].mode;
4141 /* Make a place to write the result of the instruction. */
4144 && REG_P (result) && GET_MODE (result) == insn_mode
4145 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
4146 result = gen_reg_rtx (insn_mode);
4148 insn = gen_cmpstrsi (result, arg1_rtx, arg2_rtx,
4149 GEN_INT (MIN (arg1_align, arg2_align)));
4152 #ifdef HAVE_cmpstrnsi
4153 /* Try to determine at least one length and call cmpstrnsi. */
4154 if (!insn && HAVE_cmpstrnsi)
4159 enum machine_mode insn_mode
4160 = insn_data[(int) CODE_FOR_cmpstrnsi].operand[0].mode;
4161 tree len1 = c_strlen (arg1, 1);
4162 tree len2 = c_strlen (arg2, 1);
4165 len1 = size_binop (PLUS_EXPR, ssize_int (1), len1);
4167 len2 = size_binop (PLUS_EXPR, ssize_int (1), len2);
4169 /* If we don't have a constant length for the first, use the length
4170 of the second, if we know it. We don't require a constant for
4171 this case; some cost analysis could be done if both are available
4172 but neither is constant. For now, assume they're equally cheap,
4173 unless one has side effects. If both strings have constant lengths,
4180 else if (TREE_SIDE_EFFECTS (len1))
4182 else if (TREE_SIDE_EFFECTS (len2))
4184 else if (TREE_CODE (len1) != INTEGER_CST)
4186 else if (TREE_CODE (len2) != INTEGER_CST)
4188 else if (tree_int_cst_lt (len1, len2))
4193 /* If both arguments have side effects, we cannot optimize. */
4194 if (!len || TREE_SIDE_EFFECTS (len))
4197 arg3_rtx = expand_normal (len);
4199 /* Make a place to write the result of the instruction. */
4202 && REG_P (result) && GET_MODE (result) == insn_mode
4203 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
4204 result = gen_reg_rtx (insn_mode);
4206 insn = gen_cmpstrnsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
4207 GEN_INT (MIN (arg1_align, arg2_align)));
4213 enum machine_mode mode;
4216 /* Return the value in the proper mode for this function. */
4217 mode = TYPE_MODE (TREE_TYPE (exp));
4218 if (GET_MODE (result) == mode)
4221 return convert_to_mode (mode, result, 0);
4222 convert_move (target, result, 0);
4226 /* Expand the library call ourselves using a stabilized argument
4227 list to avoid re-evaluating the function's arguments twice. */
4228 #ifdef HAVE_cmpstrnsi
4231 fndecl = get_callee_fndecl (exp);
4232 fn = build_call_nofold (fndecl, 2, arg1, arg2);
4233 gcc_assert (TREE_CODE (fn) == CALL_EXPR);
4234 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
4235 return expand_call (fn, target, target == const0_rtx);
4241 /* Expand expression EXP, which is a call to the strncmp builtin. Return
4242 NULL_RTX if we failed the caller should emit a normal call, otherwise try to get
4243 the result in TARGET, if convenient. */
4246 expand_builtin_strncmp (tree exp, ATTRIBUTE_UNUSED rtx target,
4247 ATTRIBUTE_UNUSED enum machine_mode mode)
4249 location_t loc ATTRIBUTE_UNUSED = EXPR_LOCATION (exp);
4251 if (!validate_arglist (exp,
4252 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
4255 /* If c_strlen can determine an expression for one of the string
4256 lengths, and it doesn't have side effects, then emit cmpstrnsi
4257 using length MIN(strlen(string)+1, arg3). */
4258 #ifdef HAVE_cmpstrnsi
4261 tree len, len1, len2;
4262 rtx arg1_rtx, arg2_rtx, arg3_rtx;
4265 tree arg1 = CALL_EXPR_ARG (exp, 0);
4266 tree arg2 = CALL_EXPR_ARG (exp, 1);
4267 tree arg3 = CALL_EXPR_ARG (exp, 2);
4270 = get_pointer_alignment (arg1, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
4272 = get_pointer_alignment (arg2, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
4273 enum machine_mode insn_mode
4274 = insn_data[(int) CODE_FOR_cmpstrnsi].operand[0].mode;
4276 len1 = c_strlen (arg1, 1);
4277 len2 = c_strlen (arg2, 1);
4280 len1 = size_binop_loc (loc, PLUS_EXPR, ssize_int (1), len1);
4282 len2 = size_binop_loc (loc, PLUS_EXPR, ssize_int (1), len2);
4284 /* If we don't have a constant length for the first, use the length
4285 of the second, if we know it. We don't require a constant for
4286 this case; some cost analysis could be done if both are available
4287 but neither is constant. For now, assume they're equally cheap,
4288 unless one has side effects. If both strings have constant lengths,
4295 else if (TREE_SIDE_EFFECTS (len1))
4297 else if (TREE_SIDE_EFFECTS (len2))
4299 else if (TREE_CODE (len1) != INTEGER_CST)
4301 else if (TREE_CODE (len2) != INTEGER_CST)
4303 else if (tree_int_cst_lt (len1, len2))
4308 /* If both arguments have side effects, we cannot optimize. */
4309 if (!len || TREE_SIDE_EFFECTS (len))
4312 /* The actual new length parameter is MIN(len,arg3). */
4313 len = fold_build2_loc (loc, MIN_EXPR, TREE_TYPE (len), len,
4314 fold_convert_loc (loc, TREE_TYPE (len), arg3));
4316 /* If we don't have POINTER_TYPE, call the function. */
4317 if (arg1_align == 0 || arg2_align == 0)
4320 /* Make a place to write the result of the instruction. */
4323 && REG_P (result) && GET_MODE (result) == insn_mode
4324 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
4325 result = gen_reg_rtx (insn_mode);
4327 /* Stabilize the arguments in case gen_cmpstrnsi fails. */
4328 arg1 = builtin_save_expr (arg1);
4329 arg2 = builtin_save_expr (arg2);
4330 len = builtin_save_expr (len);
4332 arg1_rtx = get_memory_rtx (arg1, len);
4333 arg2_rtx = get_memory_rtx (arg2, len);
4334 arg3_rtx = expand_normal (len);
4335 insn = gen_cmpstrnsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
4336 GEN_INT (MIN (arg1_align, arg2_align)));
4341 /* Return the value in the proper mode for this function. */
4342 mode = TYPE_MODE (TREE_TYPE (exp));
4343 if (GET_MODE (result) == mode)
4346 return convert_to_mode (mode, result, 0);
4347 convert_move (target, result, 0);
4351 /* Expand the library call ourselves using a stabilized argument
4352 list to avoid re-evaluating the function's arguments twice. */
4353 fndecl = get_callee_fndecl (exp);
4354 fn = build_call_nofold (fndecl, 3, arg1, arg2, len);
4355 gcc_assert (TREE_CODE (fn) == CALL_EXPR);
4356 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
4357 return expand_call (fn, target, target == const0_rtx);
4363 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
4364 if that's convenient. */
4367 expand_builtin_saveregs (void)
4371 /* Don't do __builtin_saveregs more than once in a function.
4372 Save the result of the first call and reuse it. */
4373 if (saveregs_value != 0)
4374 return saveregs_value;
4376 /* When this function is called, it means that registers must be
4377 saved on entry to this function. So we migrate the call to the
4378 first insn of this function. */
4382 /* Do whatever the machine needs done in this case. */
4383 val = targetm.calls.expand_builtin_saveregs ();
4388 saveregs_value = val;
4390 /* Put the insns after the NOTE that starts the function. If this
4391 is inside a start_sequence, make the outer-level insn chain current, so
4392 the code is placed at the start of the function. */
4393 push_topmost_sequence ();
4394 emit_insn_after (seq, entry_of_function ());
4395 pop_topmost_sequence ();
4400 /* __builtin_args_info (N) returns word N of the arg space info
4401 for the current function. The number and meanings of words
4402 is controlled by the definition of CUMULATIVE_ARGS. */
4405 expand_builtin_args_info (tree exp)
4407 int nwords = sizeof (CUMULATIVE_ARGS) / sizeof (int);
4408 int *word_ptr = (int *) &crtl->args.info;
4410 gcc_assert (sizeof (CUMULATIVE_ARGS) % sizeof (int) == 0);
4412 if (call_expr_nargs (exp) != 0)
4414 if (!host_integerp (CALL_EXPR_ARG (exp, 0), 0))
4415 error ("argument of %<__builtin_args_info%> must be constant");
4418 HOST_WIDE_INT wordnum = tree_low_cst (CALL_EXPR_ARG (exp, 0), 0);
4420 if (wordnum < 0 || wordnum >= nwords)
4421 error ("argument of %<__builtin_args_info%> out of range");
4423 return GEN_INT (word_ptr[wordnum]);
4427 error ("missing argument in %<__builtin_args_info%>");
4432 /* Expand a call to __builtin_next_arg. */
4435 expand_builtin_next_arg (void)
4437 /* Checking arguments is already done in fold_builtin_next_arg
4438 that must be called before this function. */
4439 return expand_binop (ptr_mode, add_optab,
4440 crtl->args.internal_arg_pointer,
4441 crtl->args.arg_offset_rtx,
4442 NULL_RTX, 0, OPTAB_LIB_WIDEN);
4445 /* Make it easier for the backends by protecting the valist argument
4446 from multiple evaluations. */
4449 stabilize_va_list_loc (location_t loc, tree valist, int needs_lvalue)
4451 tree vatype = targetm.canonical_va_list_type (TREE_TYPE (valist));
4453 gcc_assert (vatype != NULL_TREE);
4455 if (TREE_CODE (vatype) == ARRAY_TYPE)
4457 if (TREE_SIDE_EFFECTS (valist))
4458 valist = save_expr (valist);
4460 /* For this case, the backends will be expecting a pointer to
4461 vatype, but it's possible we've actually been given an array
4462 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
4464 if (TREE_CODE (TREE_TYPE (valist)) == ARRAY_TYPE)
4466 tree p1 = build_pointer_type (TREE_TYPE (vatype));
4467 valist = build_fold_addr_expr_with_type_loc (loc, valist, p1);
4476 if (! TREE_SIDE_EFFECTS (valist))
4479 pt = build_pointer_type (vatype);
4480 valist = fold_build1_loc (loc, ADDR_EXPR, pt, valist);
4481 TREE_SIDE_EFFECTS (valist) = 1;
4484 if (TREE_SIDE_EFFECTS (valist))
4485 valist = save_expr (valist);
4486 valist = build_fold_indirect_ref_loc (loc, valist);
4492 /* The "standard" definition of va_list is void*. */
4495 std_build_builtin_va_list (void)
4497 return ptr_type_node;
4500 /* The "standard" abi va_list is va_list_type_node. */
4503 std_fn_abi_va_list (tree fndecl ATTRIBUTE_UNUSED)
4505 return va_list_type_node;
4508 /* The "standard" type of va_list is va_list_type_node. */
4511 std_canonical_va_list_type (tree type)
4515 if (INDIRECT_REF_P (type))
4516 type = TREE_TYPE (type);
4517 else if (POINTER_TYPE_P (type) && POINTER_TYPE_P (TREE_TYPE(type)))
4518 type = TREE_TYPE (type);
4519 wtype = va_list_type_node;
4521 /* Treat structure va_list types. */
4522 if (TREE_CODE (wtype) == RECORD_TYPE && POINTER_TYPE_P (htype))
4523 htype = TREE_TYPE (htype);
4524 else if (TREE_CODE (wtype) == ARRAY_TYPE)
4526 /* If va_list is an array type, the argument may have decayed
4527 to a pointer type, e.g. by being passed to another function.
4528 In that case, unwrap both types so that we can compare the
4529 underlying records. */
4530 if (TREE_CODE (htype) == ARRAY_TYPE
4531 || POINTER_TYPE_P (htype))
4533 wtype = TREE_TYPE (wtype);
4534 htype = TREE_TYPE (htype);
4537 if (TYPE_MAIN_VARIANT (wtype) == TYPE_MAIN_VARIANT (htype))
4538 return va_list_type_node;
4543 /* The "standard" implementation of va_start: just assign `nextarg' to
4547 std_expand_builtin_va_start (tree valist, rtx nextarg)
4549 rtx va_r = expand_expr (valist, NULL_RTX, VOIDmode, EXPAND_WRITE);
4550 convert_move (va_r, nextarg, 0);
4553 /* Expand EXP, a call to __builtin_va_start. */
4556 expand_builtin_va_start (tree exp)
4560 location_t loc = EXPR_LOCATION (exp);
4562 if (call_expr_nargs (exp) < 2)
4564 error_at (loc, "too few arguments to function %<va_start%>");
4568 if (fold_builtin_next_arg (exp, true))
4571 nextarg = expand_builtin_next_arg ();
4572 valist = stabilize_va_list_loc (loc, CALL_EXPR_ARG (exp, 0), 1);
4574 if (targetm.expand_builtin_va_start)
4575 targetm.expand_builtin_va_start (valist, nextarg);
4577 std_expand_builtin_va_start (valist, nextarg);
4582 /* The "standard" implementation of va_arg: read the value from the
4583 current (padded) address and increment by the (padded) size. */
4586 std_gimplify_va_arg_expr (tree valist, tree type, gimple_seq *pre_p,
4589 tree addr, t, type_size, rounded_size, valist_tmp;
4590 unsigned HOST_WIDE_INT align, boundary;
4593 #ifdef ARGS_GROW_DOWNWARD
4594 /* All of the alignment and movement below is for args-grow-up machines.
4595 As of 2004, there are only 3 ARGS_GROW_DOWNWARD targets, and they all
4596 implement their own specialized gimplify_va_arg_expr routines. */
4600 indirect = pass_by_reference (NULL, TYPE_MODE (type), type, false);
4602 type = build_pointer_type (type);
4604 align = PARM_BOUNDARY / BITS_PER_UNIT;
4605 boundary = FUNCTION_ARG_BOUNDARY (TYPE_MODE (type), type);
4607 /* When we align parameter on stack for caller, if the parameter
4608 alignment is beyond MAX_SUPPORTED_STACK_ALIGNMENT, it will be
4609 aligned at MAX_SUPPORTED_STACK_ALIGNMENT. We will match callee
4610 here with caller. */
4611 if (boundary > MAX_SUPPORTED_STACK_ALIGNMENT)
4612 boundary = MAX_SUPPORTED_STACK_ALIGNMENT;
4614 boundary /= BITS_PER_UNIT;
4616 /* Hoist the valist value into a temporary for the moment. */
4617 valist_tmp = get_initialized_tmp_var (valist, pre_p, NULL);
4619 /* va_list pointer is aligned to PARM_BOUNDARY. If argument actually
4620 requires greater alignment, we must perform dynamic alignment. */
4621 if (boundary > align
4622 && !integer_zerop (TYPE_SIZE (type)))
4624 t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist_tmp,
4625 fold_build2 (POINTER_PLUS_EXPR,
4627 valist_tmp, size_int (boundary - 1)));
4628 gimplify_and_add (t, pre_p);
4630 t = fold_convert (sizetype, valist_tmp);
4631 t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist_tmp,
4632 fold_convert (TREE_TYPE (valist),
4633 fold_build2 (BIT_AND_EXPR, sizetype, t,
4634 size_int (-boundary))));
4635 gimplify_and_add (t, pre_p);
4640 /* If the actual alignment is less than the alignment of the type,
4641 adjust the type accordingly so that we don't assume strict alignment
4642 when dereferencing the pointer. */
4643 boundary *= BITS_PER_UNIT;
4644 if (boundary < TYPE_ALIGN (type))
4646 type = build_variant_type_copy (type);
4647 TYPE_ALIGN (type) = boundary;
4650 /* Compute the rounded size of the type. */
4651 type_size = size_in_bytes (type);
4652 rounded_size = round_up (type_size, align);
4654 /* Reduce rounded_size so it's sharable with the postqueue. */
4655 gimplify_expr (&rounded_size, pre_p, post_p, is_gimple_val, fb_rvalue);
4659 if (PAD_VARARGS_DOWN && !integer_zerop (rounded_size))
4661 /* Small args are padded downward. */
4662 t = fold_build2_loc (input_location, GT_EXPR, sizetype,
4663 rounded_size, size_int (align));
4664 t = fold_build3 (COND_EXPR, sizetype, t, size_zero_node,
4665 size_binop (MINUS_EXPR, rounded_size, type_size));
4666 addr = fold_build2 (POINTER_PLUS_EXPR,
4667 TREE_TYPE (addr), addr, t);
4670 /* Compute new value for AP. */
4671 t = build2 (POINTER_PLUS_EXPR, TREE_TYPE (valist), valist_tmp, rounded_size);
4672 t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist, t);
4673 gimplify_and_add (t, pre_p);
4675 addr = fold_convert (build_pointer_type (type), addr);
4678 addr = build_va_arg_indirect_ref (addr);
4680 return build_va_arg_indirect_ref (addr);
4683 /* Build an indirect-ref expression over the given TREE, which represents a
4684 piece of a va_arg() expansion. */
4686 build_va_arg_indirect_ref (tree addr)
4688 addr = build_fold_indirect_ref_loc (EXPR_LOCATION (addr), addr);
4690 if (flag_mudflap) /* Don't instrument va_arg INDIRECT_REF. */
4696 /* Return a dummy expression of type TYPE in order to keep going after an
4700 dummy_object (tree type)
4702 tree t = build_int_cst (build_pointer_type (type), 0);
4703 return build1 (INDIRECT_REF, type, t);
4706 /* Gimplify __builtin_va_arg, aka VA_ARG_EXPR, which is not really a
4707 builtin function, but a very special sort of operator. */
4709 enum gimplify_status
4710 gimplify_va_arg_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4712 tree promoted_type, have_va_type;
4713 tree valist = TREE_OPERAND (*expr_p, 0);
4714 tree type = TREE_TYPE (*expr_p);
4716 location_t loc = EXPR_LOCATION (*expr_p);
4718 /* Verify that valist is of the proper type. */
4719 have_va_type = TREE_TYPE (valist);
4720 if (have_va_type == error_mark_node)
4722 have_va_type = targetm.canonical_va_list_type (have_va_type);
4724 if (have_va_type == NULL_TREE)
4726 error_at (loc, "first argument to %<va_arg%> not of type %<va_list%>");
4730 /* Generate a diagnostic for requesting data of a type that cannot
4731 be passed through `...' due to type promotion at the call site. */
4732 if ((promoted_type = lang_hooks.types.type_promotes_to (type))
4735 static bool gave_help;
4738 /* Unfortunately, this is merely undefined, rather than a constraint
4739 violation, so we cannot make this an error. If this call is never
4740 executed, the program is still strictly conforming. */
4741 warned = warning_at (loc, 0,
4742 "%qT is promoted to %qT when passed through %<...%>",
4743 type, promoted_type);
4744 if (!gave_help && warned)
4747 inform (loc, "(so you should pass %qT not %qT to %<va_arg%>)",
4748 promoted_type, type);
4751 /* We can, however, treat "undefined" any way we please.
4752 Call abort to encourage the user to fix the program. */
4754 inform (loc, "if this code is reached, the program will abort");
4755 /* Before the abort, allow the evaluation of the va_list
4756 expression to exit or longjmp. */
4757 gimplify_and_add (valist, pre_p);
4758 t = build_call_expr_loc (loc,
4759 implicit_built_in_decls[BUILT_IN_TRAP], 0);
4760 gimplify_and_add (t, pre_p);
4762 /* This is dead code, but go ahead and finish so that the
4763 mode of the result comes out right. */
4764 *expr_p = dummy_object (type);
4769 /* Make it easier for the backends by protecting the valist argument
4770 from multiple evaluations. */
4771 if (TREE_CODE (have_va_type) == ARRAY_TYPE)
4773 /* For this case, the backends will be expecting a pointer to
4774 TREE_TYPE (abi), but it's possible we've
4775 actually been given an array (an actual TARGET_FN_ABI_VA_LIST).
4777 if (TREE_CODE (TREE_TYPE (valist)) == ARRAY_TYPE)
4779 tree p1 = build_pointer_type (TREE_TYPE (have_va_type));
4780 valist = fold_convert_loc (loc, p1,
4781 build_fold_addr_expr_loc (loc, valist));
4784 gimplify_expr (&valist, pre_p, post_p, is_gimple_val, fb_rvalue);
4787 gimplify_expr (&valist, pre_p, post_p, is_gimple_min_lval, fb_lvalue);
4789 if (!targetm.gimplify_va_arg_expr)
4790 /* FIXME: Once most targets are converted we should merely
4791 assert this is non-null. */
4794 *expr_p = targetm.gimplify_va_arg_expr (valist, type, pre_p, post_p);
4799 /* Expand EXP, a call to __builtin_va_end. */
4802 expand_builtin_va_end (tree exp)
4804 tree valist = CALL_EXPR_ARG (exp, 0);
4806 /* Evaluate for side effects, if needed. I hate macros that don't
4808 if (TREE_SIDE_EFFECTS (valist))
4809 expand_expr (valist, const0_rtx, VOIDmode, EXPAND_NORMAL);
4814 /* Expand EXP, a call to __builtin_va_copy. We do this as a
4815 builtin rather than just as an assignment in stdarg.h because of the
4816 nastiness of array-type va_list types. */
4819 expand_builtin_va_copy (tree exp)
4822 location_t loc = EXPR_LOCATION (exp);
4824 dst = CALL_EXPR_ARG (exp, 0);
4825 src = CALL_EXPR_ARG (exp, 1);
4827 dst = stabilize_va_list_loc (loc, dst, 1);
4828 src = stabilize_va_list_loc (loc, src, 0);
4830 gcc_assert (cfun != NULL && cfun->decl != NULL_TREE);
4832 if (TREE_CODE (targetm.fn_abi_va_list (cfun->decl)) != ARRAY_TYPE)
4834 t = build2 (MODIFY_EXPR, targetm.fn_abi_va_list (cfun->decl), dst, src);
4835 TREE_SIDE_EFFECTS (t) = 1;
4836 expand_expr (t, const0_rtx, VOIDmode, EXPAND_NORMAL);
4840 rtx dstb, srcb, size;
4842 /* Evaluate to pointers. */
4843 dstb = expand_expr (dst, NULL_RTX, Pmode, EXPAND_NORMAL);
4844 srcb = expand_expr (src, NULL_RTX, Pmode, EXPAND_NORMAL);
4845 size = expand_expr (TYPE_SIZE_UNIT (targetm.fn_abi_va_list (cfun->decl)),
4846 NULL_RTX, VOIDmode, EXPAND_NORMAL);
4848 dstb = convert_memory_address (Pmode, dstb);
4849 srcb = convert_memory_address (Pmode, srcb);
4851 /* "Dereference" to BLKmode memories. */
4852 dstb = gen_rtx_MEM (BLKmode, dstb);
4853 set_mem_alias_set (dstb, get_alias_set (TREE_TYPE (TREE_TYPE (dst))));
4854 set_mem_align (dstb, TYPE_ALIGN (targetm.fn_abi_va_list (cfun->decl)));
4855 srcb = gen_rtx_MEM (BLKmode, srcb);
4856 set_mem_alias_set (srcb, get_alias_set (TREE_TYPE (TREE_TYPE (src))));
4857 set_mem_align (srcb, TYPE_ALIGN (targetm.fn_abi_va_list (cfun->decl)));
4860 emit_block_move (dstb, srcb, size, BLOCK_OP_NORMAL);
4866 /* Expand a call to one of the builtin functions __builtin_frame_address or
4867 __builtin_return_address. */
4870 expand_builtin_frame_address (tree fndecl, tree exp)
4872 /* The argument must be a nonnegative integer constant.
4873 It counts the number of frames to scan up the stack.
4874 The value is the return address saved in that frame. */
4875 if (call_expr_nargs (exp) == 0)
4876 /* Warning about missing arg was already issued. */
4878 else if (! host_integerp (CALL_EXPR_ARG (exp, 0), 1))
4880 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS)
4881 error ("invalid argument to %<__builtin_frame_address%>");
4883 error ("invalid argument to %<__builtin_return_address%>");
4889 = expand_builtin_return_addr (DECL_FUNCTION_CODE (fndecl),
4890 tree_low_cst (CALL_EXPR_ARG (exp, 0), 1));
4892 /* Some ports cannot access arbitrary stack frames. */
4895 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS)
4896 warning (0, "unsupported argument to %<__builtin_frame_address%>");
4898 warning (0, "unsupported argument to %<__builtin_return_address%>");
4902 /* For __builtin_frame_address, return what we've got. */
4903 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS)
4907 && ! CONSTANT_P (tem))
4908 tem = copy_to_mode_reg (Pmode, tem);
4913 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if
4914 we failed and the caller should emit a normal call, otherwise try to get
4915 the result in TARGET, if convenient. */
4918 expand_builtin_alloca (tree exp, rtx target)
4923 /* Emit normal call if marked not-inlineable. */
4924 if (CALL_CANNOT_INLINE_P (exp))
4927 if (!validate_arglist (exp, INTEGER_TYPE, VOID_TYPE))
4930 /* Compute the argument. */
4931 op0 = expand_normal (CALL_EXPR_ARG (exp, 0));
4933 /* Allocate the desired space. */
4934 result = allocate_dynamic_stack_space (op0, target, BITS_PER_UNIT);
4935 result = convert_memory_address (ptr_mode, result);
4940 /* Expand a call to a bswap builtin with argument ARG0. MODE
4941 is the mode to expand with. */
4944 expand_builtin_bswap (tree exp, rtx target, rtx subtarget)
4946 enum machine_mode mode;
4950 if (!validate_arglist (exp, INTEGER_TYPE, VOID_TYPE))
4953 arg = CALL_EXPR_ARG (exp, 0);
4954 mode = TYPE_MODE (TREE_TYPE (arg));
4955 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
4957 target = expand_unop (mode, bswap_optab, op0, target, 1);
4959 gcc_assert (target);
4961 return convert_to_mode (mode, target, 0);
4964 /* Expand a call to a unary builtin in EXP.
4965 Return NULL_RTX if a normal call should be emitted rather than expanding the
4966 function in-line. If convenient, the result should be placed in TARGET.
4967 SUBTARGET may be used as the target for computing one of EXP's operands. */
4970 expand_builtin_unop (enum machine_mode target_mode, tree exp, rtx target,
4971 rtx subtarget, optab op_optab)
4975 if (!validate_arglist (exp, INTEGER_TYPE, VOID_TYPE))
4978 /* Compute the argument. */
4979 op0 = expand_expr (CALL_EXPR_ARG (exp, 0), subtarget,
4980 VOIDmode, EXPAND_NORMAL);
4981 /* Compute op, into TARGET if possible.
4982 Set TARGET to wherever the result comes back. */
4983 target = expand_unop (TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp, 0))),
4984 op_optab, op0, target, 1);
4985 gcc_assert (target);
4987 return convert_to_mode (target_mode, target, 0);
4990 /* Expand a call to __builtin_expect. We just return our argument
4991 as the builtin_expect semantic should've been already executed by
4992 tree branch prediction pass. */
4995 expand_builtin_expect (tree exp, rtx target)
4999 if (call_expr_nargs (exp) < 2)
5001 arg = CALL_EXPR_ARG (exp, 0);
5003 target = expand_expr (arg, target, VOIDmode, EXPAND_NORMAL);
5004 /* When guessing was done, the hints should be already stripped away. */
5005 gcc_assert (!flag_guess_branch_prob
5006 || optimize == 0 || errorcount || sorrycount);
5011 expand_builtin_trap (void)
5015 emit_insn (gen_trap ());
5018 emit_library_call (abort_libfunc, LCT_NORETURN, VOIDmode, 0);
5022 /* Expand a call to __builtin_unreachable. We do nothing except emit
5023 a barrier saying that control flow will not pass here.
5025 It is the responsibility of the program being compiled to ensure
5026 that control flow does never reach __builtin_unreachable. */
5028 expand_builtin_unreachable (void)
5033 /* Expand EXP, a call to fabs, fabsf or fabsl.
5034 Return NULL_RTX if a normal call should be emitted rather than expanding
5035 the function inline. If convenient, the result should be placed
5036 in TARGET. SUBTARGET may be used as the target for computing
5040 expand_builtin_fabs (tree exp, rtx target, rtx subtarget)
5042 enum machine_mode mode;
5046 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
5049 arg = CALL_EXPR_ARG (exp, 0);
5050 CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
5051 mode = TYPE_MODE (TREE_TYPE (arg));
5052 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
5053 return expand_abs (mode, op0, target, 0, safe_from_p (target, arg, 1));
5056 /* Expand EXP, a call to copysign, copysignf, or copysignl.
5057 Return NULL is a normal call should be emitted rather than expanding the
5058 function inline. If convenient, the result should be placed in TARGET.
5059 SUBTARGET may be used as the target for computing the operand. */
5062 expand_builtin_copysign (tree exp, rtx target, rtx subtarget)
5067 if (!validate_arglist (exp, REAL_TYPE, REAL_TYPE, VOID_TYPE))
5070 arg = CALL_EXPR_ARG (exp, 0);
5071 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
5073 arg = CALL_EXPR_ARG (exp, 1);
5074 op1 = expand_normal (arg);
5076 return expand_copysign (op0, op1, target);
5079 /* Create a new constant string literal and return a char* pointer to it.
5080 The STRING_CST value is the LEN characters at STR. */
5082 build_string_literal (int len, const char *str)
5084 tree t, elem, index, type;
5086 t = build_string (len, str);
5087 elem = build_type_variant (char_type_node, 1, 0);
5088 index = build_index_type (size_int (len - 1));
5089 type = build_array_type (elem, index);
5090 TREE_TYPE (t) = type;
5091 TREE_CONSTANT (t) = 1;
5092 TREE_READONLY (t) = 1;
5093 TREE_STATIC (t) = 1;
5095 type = build_pointer_type (elem);
5096 t = build1 (ADDR_EXPR, type,
5097 build4 (ARRAY_REF, elem,
5098 t, integer_zero_node, NULL_TREE, NULL_TREE));
5102 /* Expand a call to either the entry or exit function profiler. */
5105 expand_builtin_profile_func (bool exitp)
5107 rtx this_rtx, which;
5109 this_rtx = DECL_RTL (current_function_decl);
5110 gcc_assert (MEM_P (this_rtx));
5111 this_rtx = XEXP (this_rtx, 0);
5114 which = profile_function_exit_libfunc;
5116 which = profile_function_entry_libfunc;
5118 emit_library_call (which, LCT_NORMAL, VOIDmode, 2, this_rtx, Pmode,
5119 expand_builtin_return_addr (BUILT_IN_RETURN_ADDRESS,
5126 /* Expand a call to __builtin___clear_cache. */
5129 expand_builtin___clear_cache (tree exp ATTRIBUTE_UNUSED)
5131 #ifndef HAVE_clear_cache
5132 #ifdef CLEAR_INSN_CACHE
5133 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5134 does something. Just do the default expansion to a call to
5138 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5139 does nothing. There is no need to call it. Do nothing. */
5141 #endif /* CLEAR_INSN_CACHE */
5143 /* We have a "clear_cache" insn, and it will handle everything. */
5145 rtx begin_rtx, end_rtx;
5146 enum insn_code icode;
5148 /* We must not expand to a library call. If we did, any
5149 fallback library function in libgcc that might contain a call to
5150 __builtin___clear_cache() would recurse infinitely. */
5151 if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
5153 error ("both arguments to %<__builtin___clear_cache%> must be pointers");
5157 if (HAVE_clear_cache)
5159 icode = CODE_FOR_clear_cache;
5161 begin = CALL_EXPR_ARG (exp, 0);
5162 begin_rtx = expand_expr (begin, NULL_RTX, Pmode, EXPAND_NORMAL);
5163 begin_rtx = convert_memory_address (Pmode, begin_rtx);
5164 if (!insn_data[icode].operand[0].predicate (begin_rtx, Pmode))
5165 begin_rtx = copy_to_mode_reg (Pmode, begin_rtx);
5167 end = CALL_EXPR_ARG (exp, 1);
5168 end_rtx = expand_expr (end, NULL_RTX, Pmode, EXPAND_NORMAL);
5169 end_rtx = convert_memory_address (Pmode, end_rtx);
5170 if (!insn_data[icode].operand[1].predicate (end_rtx, Pmode))
5171 end_rtx = copy_to_mode_reg (Pmode, end_rtx);
5173 emit_insn (gen_clear_cache (begin_rtx, end_rtx));
5176 #endif /* HAVE_clear_cache */
5179 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
5182 round_trampoline_addr (rtx tramp)
5184 rtx temp, addend, mask;
5186 /* If we don't need too much alignment, we'll have been guaranteed
5187 proper alignment by get_trampoline_type. */
5188 if (TRAMPOLINE_ALIGNMENT <= STACK_BOUNDARY)
5191 /* Round address up to desired boundary. */
5192 temp = gen_reg_rtx (Pmode);
5193 addend = GEN_INT (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT - 1);
5194 mask = GEN_INT (-TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT);
5196 temp = expand_simple_binop (Pmode, PLUS, tramp, addend,
5197 temp, 0, OPTAB_LIB_WIDEN);
5198 tramp = expand_simple_binop (Pmode, AND, temp, mask,
5199 temp, 0, OPTAB_LIB_WIDEN);
5205 expand_builtin_init_trampoline (tree exp)
5207 tree t_tramp, t_func, t_chain;
5208 rtx m_tramp, r_tramp, r_chain, tmp;
5210 if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE,
5211 POINTER_TYPE, VOID_TYPE))
5214 t_tramp = CALL_EXPR_ARG (exp, 0);
5215 t_func = CALL_EXPR_ARG (exp, 1);
5216 t_chain = CALL_EXPR_ARG (exp, 2);
5218 r_tramp = expand_normal (t_tramp);
5219 m_tramp = gen_rtx_MEM (BLKmode, r_tramp);
5220 MEM_NOTRAP_P (m_tramp) = 1;
5222 /* The TRAMP argument should be the address of a field within the
5223 local function's FRAME decl. Let's see if we can fill in the
5224 to fill in the MEM_ATTRs for this memory. */
5225 if (TREE_CODE (t_tramp) == ADDR_EXPR)
5226 set_mem_attributes_minus_bitpos (m_tramp, TREE_OPERAND (t_tramp, 0),
5229 tmp = round_trampoline_addr (r_tramp);
5232 m_tramp = change_address (m_tramp, BLKmode, tmp);
5233 set_mem_align (m_tramp, TRAMPOLINE_ALIGNMENT);
5234 set_mem_size (m_tramp, GEN_INT (TRAMPOLINE_SIZE));
5237 /* The FUNC argument should be the address of the nested function.
5238 Extract the actual function decl to pass to the hook. */
5239 gcc_assert (TREE_CODE (t_func) == ADDR_EXPR);
5240 t_func = TREE_OPERAND (t_func, 0);
5241 gcc_assert (TREE_CODE (t_func) == FUNCTION_DECL);
5243 r_chain = expand_normal (t_chain);
5245 /* Generate insns to initialize the trampoline. */
5246 targetm.calls.trampoline_init (m_tramp, t_func, r_chain);
5248 trampolines_created = 1;
5253 expand_builtin_adjust_trampoline (tree exp)
5257 if (!validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
5260 tramp = expand_normal (CALL_EXPR_ARG (exp, 0));
5261 tramp = round_trampoline_addr (tramp);
5262 if (targetm.calls.trampoline_adjust_address)
5263 tramp = targetm.calls.trampoline_adjust_address (tramp);
5268 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
5269 function. The function first checks whether the back end provides
5270 an insn to implement signbit for the respective mode. If not, it
5271 checks whether the floating point format of the value is such that
5272 the sign bit can be extracted. If that is not the case, the
5273 function returns NULL_RTX to indicate that a normal call should be
5274 emitted rather than expanding the function in-line. EXP is the
5275 expression that is a call to the builtin function; if convenient,
5276 the result should be placed in TARGET. */
5278 expand_builtin_signbit (tree exp, rtx target)
5280 const struct real_format *fmt;
5281 enum machine_mode fmode, imode, rmode;
5284 enum insn_code icode;
5286 location_t loc = EXPR_LOCATION (exp);
5288 if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
5291 arg = CALL_EXPR_ARG (exp, 0);
5292 fmode = TYPE_MODE (TREE_TYPE (arg));
5293 rmode = TYPE_MODE (TREE_TYPE (exp));
5294 fmt = REAL_MODE_FORMAT (fmode);
5296 arg = builtin_save_expr (arg);
5298 /* Expand the argument yielding a RTX expression. */
5299 temp = expand_normal (arg);
5301 /* Check if the back end provides an insn that handles signbit for the
5303 icode = signbit_optab->handlers [(int) fmode].insn_code;
5304 if (icode != CODE_FOR_nothing)
5306 rtx last = get_last_insn ();
5307 target = gen_reg_rtx (TYPE_MODE (TREE_TYPE (exp)));
5308 if (maybe_emit_unop_insn (icode, target, temp, UNKNOWN))
5310 delete_insns_since (last);
5313 /* For floating point formats without a sign bit, implement signbit
5315 bitpos = fmt->signbit_ro;
5318 /* But we can't do this if the format supports signed zero. */
5319 if (fmt->has_signed_zero && HONOR_SIGNED_ZEROS (fmode))
5322 arg = fold_build2_loc (loc, LT_EXPR, TREE_TYPE (exp), arg,
5323 build_real (TREE_TYPE (arg), dconst0));
5324 return expand_expr (arg, target, VOIDmode, EXPAND_NORMAL);
5327 if (GET_MODE_SIZE (fmode) <= UNITS_PER_WORD)
5329 imode = int_mode_for_mode (fmode);
5330 if (imode == BLKmode)
5332 temp = gen_lowpart (imode, temp);
5337 /* Handle targets with different FP word orders. */
5338 if (FLOAT_WORDS_BIG_ENDIAN)
5339 word = (GET_MODE_BITSIZE (fmode) - bitpos) / BITS_PER_WORD;
5341 word = bitpos / BITS_PER_WORD;
5342 temp = operand_subword_force (temp, word, fmode);
5343 bitpos = bitpos % BITS_PER_WORD;
5346 /* Force the intermediate word_mode (or narrower) result into a
5347 register. This avoids attempting to create paradoxical SUBREGs
5348 of floating point modes below. */
5349 temp = force_reg (imode, temp);
5351 /* If the bitpos is within the "result mode" lowpart, the operation
5352 can be implement with a single bitwise AND. Otherwise, we need
5353 a right shift and an AND. */
5355 if (bitpos < GET_MODE_BITSIZE (rmode))
5357 double_int mask = double_int_setbit (double_int_zero, bitpos);
5359 if (GET_MODE_SIZE (imode) > GET_MODE_SIZE (rmode))
5360 temp = gen_lowpart (rmode, temp);
5361 temp = expand_binop (rmode, and_optab, temp,
5362 immed_double_int_const (mask, rmode),
5363 NULL_RTX, 1, OPTAB_LIB_WIDEN);
5367 /* Perform a logical right shift to place the signbit in the least
5368 significant bit, then truncate the result to the desired mode
5369 and mask just this bit. */
5370 temp = expand_shift (RSHIFT_EXPR, imode, temp,
5371 build_int_cst (NULL_TREE, bitpos), NULL_RTX, 1);
5372 temp = gen_lowpart (rmode, temp);
5373 temp = expand_binop (rmode, and_optab, temp, const1_rtx,
5374 NULL_RTX, 1, OPTAB_LIB_WIDEN);
5380 /* Expand fork or exec calls. TARGET is the desired target of the
5381 call. EXP is the call. FN is the
5382 identificator of the actual function. IGNORE is nonzero if the
5383 value is to be ignored. */
5386 expand_builtin_fork_or_exec (tree fn, tree exp, rtx target, int ignore)
5391 /* If we are not profiling, just call the function. */
5392 if (!profile_arc_flag)
5395 /* Otherwise call the wrapper. This should be equivalent for the rest of
5396 compiler, so the code does not diverge, and the wrapper may run the
5397 code necessary for keeping the profiling sane. */
5399 switch (DECL_FUNCTION_CODE (fn))
5402 id = get_identifier ("__gcov_fork");
5405 case BUILT_IN_EXECL:
5406 id = get_identifier ("__gcov_execl");
5409 case BUILT_IN_EXECV:
5410 id = get_identifier ("__gcov_execv");
5413 case BUILT_IN_EXECLP:
5414 id = get_identifier ("__gcov_execlp");
5417 case BUILT_IN_EXECLE:
5418 id = get_identifier ("__gcov_execle");
5421 case BUILT_IN_EXECVP:
5422 id = get_identifier ("__gcov_execvp");
5425 case BUILT_IN_EXECVE:
5426 id = get_identifier ("__gcov_execve");
5433 decl = build_decl (DECL_SOURCE_LOCATION (fn),
5434 FUNCTION_DECL, id, TREE_TYPE (fn));
5435 DECL_EXTERNAL (decl) = 1;
5436 TREE_PUBLIC (decl) = 1;
5437 DECL_ARTIFICIAL (decl) = 1;
5438 TREE_NOTHROW (decl) = 1;
5439 DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT;
5440 DECL_VISIBILITY_SPECIFIED (decl) = 1;
5441 call = rewrite_call_expr (EXPR_LOCATION (exp), exp, 0, decl, 0);
5442 return expand_call (call, target, ignore);
5447 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
5448 the pointer in these functions is void*, the tree optimizers may remove
5449 casts. The mode computed in expand_builtin isn't reliable either, due
5450 to __sync_bool_compare_and_swap.
5452 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
5453 group of builtins. This gives us log2 of the mode size. */
5455 static inline enum machine_mode
5456 get_builtin_sync_mode (int fcode_diff)
5458 /* The size is not negotiable, so ask not to get BLKmode in return
5459 if the target indicates that a smaller size would be better. */
5460 return mode_for_size (BITS_PER_UNIT << fcode_diff, MODE_INT, 0);
5463 /* Expand the memory expression LOC and return the appropriate memory operand
5464 for the builtin_sync operations. */
5467 get_builtin_sync_mem (tree loc, enum machine_mode mode)
5471 addr = expand_expr (loc, NULL_RTX, ptr_mode, EXPAND_SUM);
5472 addr = convert_memory_address (Pmode, addr);
5474 /* Note that we explicitly do not want any alias information for this
5475 memory, so that we kill all other live memories. Otherwise we don't
5476 satisfy the full barrier semantics of the intrinsic. */
5477 mem = validize_mem (gen_rtx_MEM (mode, addr));
5479 set_mem_align (mem, get_pointer_alignment (loc, BIGGEST_ALIGNMENT));
5480 set_mem_alias_set (mem, ALIAS_SET_MEMORY_BARRIER);
5481 MEM_VOLATILE_P (mem) = 1;
5486 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
5487 EXP is the CALL_EXPR. CODE is the rtx code
5488 that corresponds to the arithmetic or logical operation from the name;
5489 an exception here is that NOT actually means NAND. TARGET is an optional
5490 place for us to store the results; AFTER is true if this is the
5491 fetch_and_xxx form. IGNORE is true if we don't actually care about
5492 the result of the operation at all. */
5495 expand_builtin_sync_operation (enum machine_mode mode, tree exp,
5496 enum rtx_code code, bool after,
5497 rtx target, bool ignore)
5500 enum machine_mode old_mode;
5501 location_t loc = EXPR_LOCATION (exp);
5503 if (code == NOT && warn_sync_nand)
5505 tree fndecl = get_callee_fndecl (exp);
5506 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
5508 static bool warned_f_a_n, warned_n_a_f;
5512 case BUILT_IN_FETCH_AND_NAND_1:
5513 case BUILT_IN_FETCH_AND_NAND_2:
5514 case BUILT_IN_FETCH_AND_NAND_4:
5515 case BUILT_IN_FETCH_AND_NAND_8:
5516 case BUILT_IN_FETCH_AND_NAND_16:
5521 fndecl = implicit_built_in_decls[BUILT_IN_FETCH_AND_NAND_N];
5522 inform (loc, "%qD changed semantics in GCC 4.4", fndecl);
5523 warned_f_a_n = true;
5526 case BUILT_IN_NAND_AND_FETCH_1:
5527 case BUILT_IN_NAND_AND_FETCH_2:
5528 case BUILT_IN_NAND_AND_FETCH_4:
5529 case BUILT_IN_NAND_AND_FETCH_8:
5530 case BUILT_IN_NAND_AND_FETCH_16:
5535 fndecl = implicit_built_in_decls[BUILT_IN_NAND_AND_FETCH_N];
5536 inform (loc, "%qD changed semantics in GCC 4.4", fndecl);
5537 warned_n_a_f = true;
5545 /* Expand the operands. */
5546 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5548 val = expand_expr (CALL_EXPR_ARG (exp, 1), NULL_RTX, mode, EXPAND_NORMAL);
5549 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5550 of CONST_INTs, where we know the old_mode only from the call argument. */
5551 old_mode = GET_MODE (val);
5552 if (old_mode == VOIDmode)
5553 old_mode = TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp, 1)));
5554 val = convert_modes (mode, old_mode, val, 1);
5557 return expand_sync_operation (mem, val, code);
5559 return expand_sync_fetch_operation (mem, val, code, after, target);
5562 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
5563 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
5564 true if this is the boolean form. TARGET is a place for us to store the
5565 results; this is NOT optional if IS_BOOL is true. */
5568 expand_builtin_compare_and_swap (enum machine_mode mode, tree exp,
5569 bool is_bool, rtx target)
5571 rtx old_val, new_val, mem;
5572 enum machine_mode old_mode;
5574 /* Expand the operands. */
5575 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5578 old_val = expand_expr (CALL_EXPR_ARG (exp, 1), NULL_RTX,
5579 mode, EXPAND_NORMAL);
5580 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5581 of CONST_INTs, where we know the old_mode only from the call argument. */
5582 old_mode = GET_MODE (old_val);
5583 if (old_mode == VOIDmode)
5584 old_mode = TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp, 1)));
5585 old_val = convert_modes (mode, old_mode, old_val, 1);
5587 new_val = expand_expr (CALL_EXPR_ARG (exp, 2), NULL_RTX,
5588 mode, EXPAND_NORMAL);
5589 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5590 of CONST_INTs, where we know the old_mode only from the call argument. */
5591 old_mode = GET_MODE (new_val);
5592 if (old_mode == VOIDmode)
5593 old_mode = TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp, 2)));
5594 new_val = convert_modes (mode, old_mode, new_val, 1);
5597 return expand_bool_compare_and_swap (mem, old_val, new_val, target);
5599 return expand_val_compare_and_swap (mem, old_val, new_val, target);
5602 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
5603 general form is actually an atomic exchange, and some targets only
5604 support a reduced form with the second argument being a constant 1.
5605 EXP is the CALL_EXPR; TARGET is an optional place for us to store
5609 expand_builtin_lock_test_and_set (enum machine_mode mode, tree exp,
5613 enum machine_mode old_mode;
5615 /* Expand the operands. */
5616 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5617 val = expand_expr (CALL_EXPR_ARG (exp, 1), NULL_RTX, mode, EXPAND_NORMAL);
5618 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5619 of CONST_INTs, where we know the old_mode only from the call argument. */
5620 old_mode = GET_MODE (val);
5621 if (old_mode == VOIDmode)
5622 old_mode = TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp, 1)));
5623 val = convert_modes (mode, old_mode, val, 1);
5625 return expand_sync_lock_test_and_set (mem, val, target);
5628 /* Expand the __sync_synchronize intrinsic. */
5631 expand_builtin_synchronize (void)
5634 VEC (tree, gc) *v_clobbers;
5636 #ifdef HAVE_memory_barrier
5637 if (HAVE_memory_barrier)
5639 emit_insn (gen_memory_barrier ());
5644 if (synchronize_libfunc != NULL_RTX)
5646 emit_library_call (synchronize_libfunc, LCT_NORMAL, VOIDmode, 0);
5650 /* If no explicit memory barrier instruction is available, create an
5651 empty asm stmt with a memory clobber. */
5652 v_clobbers = VEC_alloc (tree, gc, 1);
5653 VEC_quick_push (tree, v_clobbers,
5654 tree_cons (NULL, build_string (6, "memory"), NULL));
5655 x = gimple_build_asm_vec ("", NULL, NULL, v_clobbers, NULL);
5656 gimple_asm_set_volatile (x, true);
5657 expand_asm_stmt (x);
5660 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
5663 expand_builtin_lock_release (enum machine_mode mode, tree exp)
5665 enum insn_code icode;
5667 rtx val = const0_rtx;
5669 /* Expand the operands. */
5670 mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5672 /* If there is an explicit operation in the md file, use it. */
5673 icode = sync_lock_release[mode];
5674 if (icode != CODE_FOR_nothing)
5676 if (!insn_data[icode].operand[1].predicate (val, mode))
5677 val = force_reg (mode, val);
5679 insn = GEN_FCN (icode) (mem, val);
5687 /* Otherwise we can implement this operation by emitting a barrier
5688 followed by a store of zero. */
5689 expand_builtin_synchronize ();
5690 emit_move_insn (mem, val);
5693 /* Expand an expression EXP that calls a built-in function,
5694 with result going to TARGET if that's convenient
5695 (and in mode MODE if that's convenient).
5696 SUBTARGET may be used as the target for computing one of EXP's operands.
5697 IGNORE is nonzero if the value is to be ignored. */
5700 expand_builtin (tree exp, rtx target, rtx subtarget, enum machine_mode mode,
5703 tree fndecl = get_callee_fndecl (exp);
5704 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
5705 enum machine_mode target_mode = TYPE_MODE (TREE_TYPE (exp));
5707 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
5708 return targetm.expand_builtin (exp, target, subtarget, mode, ignore);
5710 /* When not optimizing, generate calls to library functions for a certain
5713 && !called_as_built_in (fndecl)
5714 && DECL_ASSEMBLER_NAME_SET_P (fndecl)
5715 && fcode != BUILT_IN_ALLOCA
5716 && fcode != BUILT_IN_FREE)
5717 return expand_call (exp, target, ignore);
5719 /* The built-in function expanders test for target == const0_rtx
5720 to determine whether the function's result will be ignored. */
5722 target = const0_rtx;
5724 /* If the result of a pure or const built-in function is ignored, and
5725 none of its arguments are volatile, we can avoid expanding the
5726 built-in call and just evaluate the arguments for side-effects. */
5727 if (target == const0_rtx
5728 && (DECL_PURE_P (fndecl) || TREE_READONLY (fndecl)))
5730 bool volatilep = false;
5732 call_expr_arg_iterator iter;
5734 FOR_EACH_CALL_EXPR_ARG (arg, iter, exp)
5735 if (TREE_THIS_VOLATILE (arg))
5743 FOR_EACH_CALL_EXPR_ARG (arg, iter, exp)
5744 expand_expr (arg, const0_rtx, VOIDmode, EXPAND_NORMAL);
5751 CASE_FLT_FN (BUILT_IN_FABS):
5752 target = expand_builtin_fabs (exp, target, subtarget);
5757 CASE_FLT_FN (BUILT_IN_COPYSIGN):
5758 target = expand_builtin_copysign (exp, target, subtarget);
5763 /* Just do a normal library call if we were unable to fold
5765 CASE_FLT_FN (BUILT_IN_CABS):
5768 CASE_FLT_FN (BUILT_IN_EXP):
5769 CASE_FLT_FN (BUILT_IN_EXP10):
5770 CASE_FLT_FN (BUILT_IN_POW10):
5771 CASE_FLT_FN (BUILT_IN_EXP2):
5772 CASE_FLT_FN (BUILT_IN_EXPM1):
5773 CASE_FLT_FN (BUILT_IN_LOGB):
5774 CASE_FLT_FN (BUILT_IN_LOG):
5775 CASE_FLT_FN (BUILT_IN_LOG10):
5776 CASE_FLT_FN (BUILT_IN_LOG2):
5777 CASE_FLT_FN (BUILT_IN_LOG1P):
5778 CASE_FLT_FN (BUILT_IN_TAN):
5779 CASE_FLT_FN (BUILT_IN_ASIN):
5780 CASE_FLT_FN (BUILT_IN_ACOS):
5781 CASE_FLT_FN (BUILT_IN_ATAN):
5782 CASE_FLT_FN (BUILT_IN_SIGNIFICAND):
5783 /* Treat these like sqrt only if unsafe math optimizations are allowed,
5784 because of possible accuracy problems. */
5785 if (! flag_unsafe_math_optimizations)
5787 CASE_FLT_FN (BUILT_IN_SQRT):
5788 CASE_FLT_FN (BUILT_IN_FLOOR):
5789 CASE_FLT_FN (BUILT_IN_CEIL):
5790 CASE_FLT_FN (BUILT_IN_TRUNC):
5791 CASE_FLT_FN (BUILT_IN_ROUND):
5792 CASE_FLT_FN (BUILT_IN_NEARBYINT):
5793 CASE_FLT_FN (BUILT_IN_RINT):
5794 target = expand_builtin_mathfn (exp, target, subtarget);
5799 CASE_FLT_FN (BUILT_IN_ILOGB):
5800 if (! flag_unsafe_math_optimizations)
5802 CASE_FLT_FN (BUILT_IN_ISINF):
5803 CASE_FLT_FN (BUILT_IN_FINITE):
5804 case BUILT_IN_ISFINITE:
5805 case BUILT_IN_ISNORMAL:
5806 target = expand_builtin_interclass_mathfn (exp, target, subtarget);
5811 CASE_FLT_FN (BUILT_IN_LCEIL):
5812 CASE_FLT_FN (BUILT_IN_LLCEIL):
5813 CASE_FLT_FN (BUILT_IN_LFLOOR):
5814 CASE_FLT_FN (BUILT_IN_LLFLOOR):
5815 target = expand_builtin_int_roundingfn (exp, target);
5820 CASE_FLT_FN (BUILT_IN_LRINT):
5821 CASE_FLT_FN (BUILT_IN_LLRINT):
5822 CASE_FLT_FN (BUILT_IN_LROUND):
5823 CASE_FLT_FN (BUILT_IN_LLROUND):
5824 target = expand_builtin_int_roundingfn_2 (exp, target);
5829 CASE_FLT_FN (BUILT_IN_POW):
5830 target = expand_builtin_pow (exp, target, subtarget);
5835 CASE_FLT_FN (BUILT_IN_POWI):
5836 target = expand_builtin_powi (exp, target, subtarget);
5841 CASE_FLT_FN (BUILT_IN_ATAN2):
5842 CASE_FLT_FN (BUILT_IN_LDEXP):
5843 CASE_FLT_FN (BUILT_IN_SCALB):
5844 CASE_FLT_FN (BUILT_IN_SCALBN):
5845 CASE_FLT_FN (BUILT_IN_SCALBLN):
5846 if (! flag_unsafe_math_optimizations)
5849 CASE_FLT_FN (BUILT_IN_FMOD):
5850 CASE_FLT_FN (BUILT_IN_REMAINDER):
5851 CASE_FLT_FN (BUILT_IN_DREM):
5852 target = expand_builtin_mathfn_2 (exp, target, subtarget);
5857 CASE_FLT_FN (BUILT_IN_CEXPI):
5858 target = expand_builtin_cexpi (exp, target, subtarget);
5859 gcc_assert (target);
5862 CASE_FLT_FN (BUILT_IN_SIN):
5863 CASE_FLT_FN (BUILT_IN_COS):
5864 if (! flag_unsafe_math_optimizations)
5866 target = expand_builtin_mathfn_3 (exp, target, subtarget);
5871 CASE_FLT_FN (BUILT_IN_SINCOS):
5872 if (! flag_unsafe_math_optimizations)
5874 target = expand_builtin_sincos (exp);
5879 case BUILT_IN_APPLY_ARGS:
5880 return expand_builtin_apply_args ();
5882 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
5883 FUNCTION with a copy of the parameters described by
5884 ARGUMENTS, and ARGSIZE. It returns a block of memory
5885 allocated on the stack into which is stored all the registers
5886 that might possibly be used for returning the result of a
5887 function. ARGUMENTS is the value returned by
5888 __builtin_apply_args. ARGSIZE is the number of bytes of
5889 arguments that must be copied. ??? How should this value be
5890 computed? We'll also need a safe worst case value for varargs
5892 case BUILT_IN_APPLY:
5893 if (!validate_arglist (exp, POINTER_TYPE,
5894 POINTER_TYPE, INTEGER_TYPE, VOID_TYPE)
5895 && !validate_arglist (exp, REFERENCE_TYPE,
5896 POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
5902 ops[0] = expand_normal (CALL_EXPR_ARG (exp, 0));
5903 ops[1] = expand_normal (CALL_EXPR_ARG (exp, 1));
5904 ops[2] = expand_normal (CALL_EXPR_ARG (exp, 2));
5906 return expand_builtin_apply (ops[0], ops[1], ops[2]);
5909 /* __builtin_return (RESULT) causes the function to return the
5910 value described by RESULT. RESULT is address of the block of
5911 memory returned by __builtin_apply. */
5912 case BUILT_IN_RETURN:
5913 if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
5914 expand_builtin_return (expand_normal (CALL_EXPR_ARG (exp, 0)));
5917 case BUILT_IN_SAVEREGS:
5918 return expand_builtin_saveregs ();
5920 case BUILT_IN_ARGS_INFO:
5921 return expand_builtin_args_info (exp);
5923 case BUILT_IN_VA_ARG_PACK:
5924 /* All valid uses of __builtin_va_arg_pack () are removed during
5926 error ("%Kinvalid use of %<__builtin_va_arg_pack ()%>", exp);
5929 case BUILT_IN_VA_ARG_PACK_LEN:
5930 /* All valid uses of __builtin_va_arg_pack_len () are removed during
5932 error ("%Kinvalid use of %<__builtin_va_arg_pack_len ()%>", exp);
5935 /* Return the address of the first anonymous stack arg. */
5936 case BUILT_IN_NEXT_ARG:
5937 if (fold_builtin_next_arg (exp, false))
5939 return expand_builtin_next_arg ();
5941 case BUILT_IN_CLEAR_CACHE:
5942 target = expand_builtin___clear_cache (exp);
5947 case BUILT_IN_CLASSIFY_TYPE:
5948 return expand_builtin_classify_type (exp);
5950 case BUILT_IN_CONSTANT_P:
5953 case BUILT_IN_FRAME_ADDRESS:
5954 case BUILT_IN_RETURN_ADDRESS:
5955 return expand_builtin_frame_address (fndecl, exp);
5957 /* Returns the address of the area where the structure is returned.
5959 case BUILT_IN_AGGREGATE_INCOMING_ADDRESS:
5960 if (call_expr_nargs (exp) != 0
5961 || ! AGGREGATE_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl)))
5962 || !MEM_P (DECL_RTL (DECL_RESULT (current_function_decl))))
5965 return XEXP (DECL_RTL (DECL_RESULT (current_function_decl)), 0);
5967 case BUILT_IN_ALLOCA:
5968 target = expand_builtin_alloca (exp, target);
5973 case BUILT_IN_STACK_SAVE:
5974 return expand_stack_save ();
5976 case BUILT_IN_STACK_RESTORE:
5977 expand_stack_restore (CALL_EXPR_ARG (exp, 0));
5980 case BUILT_IN_BSWAP32:
5981 case BUILT_IN_BSWAP64:
5982 target = expand_builtin_bswap (exp, target, subtarget);
5988 CASE_INT_FN (BUILT_IN_FFS):
5989 case BUILT_IN_FFSIMAX:
5990 target = expand_builtin_unop (target_mode, exp, target,
5991 subtarget, ffs_optab);
5996 CASE_INT_FN (BUILT_IN_CLZ):
5997 case BUILT_IN_CLZIMAX:
5998 target = expand_builtin_unop (target_mode, exp, target,
5999 subtarget, clz_optab);
6004 CASE_INT_FN (BUILT_IN_CTZ):
6005 case BUILT_IN_CTZIMAX:
6006 target = expand_builtin_unop (target_mode, exp, target,
6007 subtarget, ctz_optab);
6012 CASE_INT_FN (BUILT_IN_POPCOUNT):
6013 case BUILT_IN_POPCOUNTIMAX:
6014 target = expand_builtin_unop (target_mode, exp, target,
6015 subtarget, popcount_optab);
6020 CASE_INT_FN (BUILT_IN_PARITY):
6021 case BUILT_IN_PARITYIMAX:
6022 target = expand_builtin_unop (target_mode, exp, target,
6023 subtarget, parity_optab);
6028 case BUILT_IN_STRLEN:
6029 target = expand_builtin_strlen (exp, target, target_mode);
6034 case BUILT_IN_STRCPY:
6035 target = expand_builtin_strcpy (exp, target);
6040 case BUILT_IN_STRNCPY:
6041 target = expand_builtin_strncpy (exp, target);
6046 case BUILT_IN_STPCPY:
6047 target = expand_builtin_stpcpy (exp, target, mode);
6052 case BUILT_IN_MEMCPY:
6053 target = expand_builtin_memcpy (exp, target);
6058 case BUILT_IN_MEMPCPY:
6059 target = expand_builtin_mempcpy (exp, target, mode);
6064 case BUILT_IN_MEMSET:
6065 target = expand_builtin_memset (exp, target, mode);
6070 case BUILT_IN_BZERO:
6071 target = expand_builtin_bzero (exp);
6076 case BUILT_IN_STRCMP:
6077 target = expand_builtin_strcmp (exp, target);
6082 case BUILT_IN_STRNCMP:
6083 target = expand_builtin_strncmp (exp, target, mode);
6089 case BUILT_IN_MEMCMP:
6090 target = expand_builtin_memcmp (exp, target, mode);
6095 case BUILT_IN_SETJMP:
6096 /* This should have been lowered to the builtins below. */
6099 case BUILT_IN_SETJMP_SETUP:
6100 /* __builtin_setjmp_setup is passed a pointer to an array of five words
6101 and the receiver label. */
6102 if (validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
6104 rtx buf_addr = expand_expr (CALL_EXPR_ARG (exp, 0), subtarget,
6105 VOIDmode, EXPAND_NORMAL);
6106 tree label = TREE_OPERAND (CALL_EXPR_ARG (exp, 1), 0);
6107 rtx label_r = label_rtx (label);
6109 /* This is copied from the handling of non-local gotos. */
6110 expand_builtin_setjmp_setup (buf_addr, label_r);
6111 nonlocal_goto_handler_labels
6112 = gen_rtx_EXPR_LIST (VOIDmode, label_r,
6113 nonlocal_goto_handler_labels);
6114 /* ??? Do not let expand_label treat us as such since we would
6115 not want to be both on the list of non-local labels and on
6116 the list of forced labels. */
6117 FORCED_LABEL (label) = 0;
6122 case BUILT_IN_SETJMP_DISPATCHER:
6123 /* __builtin_setjmp_dispatcher is passed the dispatcher label. */
6124 if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
6126 tree label = TREE_OPERAND (CALL_EXPR_ARG (exp, 0), 0);
6127 rtx label_r = label_rtx (label);
6129 /* Remove the dispatcher label from the list of non-local labels
6130 since the receiver labels have been added to it above. */
6131 remove_node_from_expr_list (label_r, &nonlocal_goto_handler_labels);
6136 case BUILT_IN_SETJMP_RECEIVER:
6137 /* __builtin_setjmp_receiver is passed the receiver label. */
6138 if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
6140 tree label = TREE_OPERAND (CALL_EXPR_ARG (exp, 0), 0);
6141 rtx label_r = label_rtx (label);
6143 expand_builtin_setjmp_receiver (label_r);
6148 /* __builtin_longjmp is passed a pointer to an array of five words.
6149 It's similar to the C library longjmp function but works with
6150 __builtin_setjmp above. */
6151 case BUILT_IN_LONGJMP:
6152 if (validate_arglist (exp, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
6154 rtx buf_addr = expand_expr (CALL_EXPR_ARG (exp, 0), subtarget,
6155 VOIDmode, EXPAND_NORMAL);
6156 rtx value = expand_normal (CALL_EXPR_ARG (exp, 1));
6158 if (value != const1_rtx)
6160 error ("%<__builtin_longjmp%> second argument must be 1");
6164 expand_builtin_longjmp (buf_addr, value);
6169 case BUILT_IN_NONLOCAL_GOTO:
6170 target = expand_builtin_nonlocal_goto (exp);
6175 /* This updates the setjmp buffer that is its argument with the value
6176 of the current stack pointer. */
6177 case BUILT_IN_UPDATE_SETJMP_BUF:
6178 if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
6181 = expand_normal (CALL_EXPR_ARG (exp, 0));
6183 expand_builtin_update_setjmp_buf (buf_addr);
6189 expand_builtin_trap ();
6192 case BUILT_IN_UNREACHABLE:
6193 expand_builtin_unreachable ();
6196 CASE_FLT_FN (BUILT_IN_SIGNBIT):
6197 case BUILT_IN_SIGNBITD32:
6198 case BUILT_IN_SIGNBITD64:
6199 case BUILT_IN_SIGNBITD128:
6200 target = expand_builtin_signbit (exp, target);
6205 /* Various hooks for the DWARF 2 __throw routine. */
6206 case BUILT_IN_UNWIND_INIT:
6207 expand_builtin_unwind_init ();
6209 case BUILT_IN_DWARF_CFA:
6210 return virtual_cfa_rtx;
6211 #ifdef DWARF2_UNWIND_INFO
6212 case BUILT_IN_DWARF_SP_COLUMN:
6213 return expand_builtin_dwarf_sp_column ();
6214 case BUILT_IN_INIT_DWARF_REG_SIZES:
6215 expand_builtin_init_dwarf_reg_sizes (CALL_EXPR_ARG (exp, 0));
6218 case BUILT_IN_FROB_RETURN_ADDR:
6219 return expand_builtin_frob_return_addr (CALL_EXPR_ARG (exp, 0));
6220 case BUILT_IN_EXTRACT_RETURN_ADDR:
6221 return expand_builtin_extract_return_addr (CALL_EXPR_ARG (exp, 0));
6222 case BUILT_IN_EH_RETURN:
6223 expand_builtin_eh_return (CALL_EXPR_ARG (exp, 0),
6224 CALL_EXPR_ARG (exp, 1));
6226 #ifdef EH_RETURN_DATA_REGNO
6227 case BUILT_IN_EH_RETURN_DATA_REGNO:
6228 return expand_builtin_eh_return_data_regno (exp);
6230 case BUILT_IN_EXTEND_POINTER:
6231 return expand_builtin_extend_pointer (CALL_EXPR_ARG (exp, 0));
6232 case BUILT_IN_EH_POINTER:
6233 return expand_builtin_eh_pointer (exp);
6234 case BUILT_IN_EH_FILTER:
6235 return expand_builtin_eh_filter (exp);
6236 case BUILT_IN_EH_COPY_VALUES:
6237 return expand_builtin_eh_copy_values (exp);
6239 case BUILT_IN_VA_START:
6240 return expand_builtin_va_start (exp);
6241 case BUILT_IN_VA_END:
6242 return expand_builtin_va_end (exp);
6243 case BUILT_IN_VA_COPY:
6244 return expand_builtin_va_copy (exp);
6245 case BUILT_IN_EXPECT:
6246 return expand_builtin_expect (exp, target);
6247 case BUILT_IN_PREFETCH:
6248 expand_builtin_prefetch (exp);
6251 case BUILT_IN_PROFILE_FUNC_ENTER:
6252 return expand_builtin_profile_func (false);
6253 case BUILT_IN_PROFILE_FUNC_EXIT:
6254 return expand_builtin_profile_func (true);
6256 case BUILT_IN_INIT_TRAMPOLINE:
6257 return expand_builtin_init_trampoline (exp);
6258 case BUILT_IN_ADJUST_TRAMPOLINE:
6259 return expand_builtin_adjust_trampoline (exp);
6262 case BUILT_IN_EXECL:
6263 case BUILT_IN_EXECV:
6264 case BUILT_IN_EXECLP:
6265 case BUILT_IN_EXECLE:
6266 case BUILT_IN_EXECVP:
6267 case BUILT_IN_EXECVE:
6268 target = expand_builtin_fork_or_exec (fndecl, exp, target, ignore);
6273 case BUILT_IN_FETCH_AND_ADD_1:
6274 case BUILT_IN_FETCH_AND_ADD_2:
6275 case BUILT_IN_FETCH_AND_ADD_4:
6276 case BUILT_IN_FETCH_AND_ADD_8:
6277 case BUILT_IN_FETCH_AND_ADD_16:
6278 mode = get_builtin_sync_mode (fcode - BUILT_IN_FETCH_AND_ADD_1);
6279 target = expand_builtin_sync_operation (mode, exp, PLUS,
6280 false, target, ignore);
6285 case BUILT_IN_FETCH_AND_SUB_1:
6286 case BUILT_IN_FETCH_AND_SUB_2:
6287 case BUILT_IN_FETCH_AND_SUB_4:
6288 case BUILT_IN_FETCH_AND_SUB_8:
6289 case BUILT_IN_FETCH_AND_SUB_16:
6290 mode = get_builtin_sync_mode (fcode - BUILT_IN_FETCH_AND_SUB_1);
6291 target = expand_builtin_sync_operation (mode, exp, MINUS,
6292 false, target, ignore);
6297 case BUILT_IN_FETCH_AND_OR_1:
6298 case BUILT_IN_FETCH_AND_OR_2:
6299 case BUILT_IN_FETCH_AND_OR_4:
6300 case BUILT_IN_FETCH_AND_OR_8:
6301 case BUILT_IN_FETCH_AND_OR_16:
6302 mode = get_builtin_sync_mode (fcode - BUILT_IN_FETCH_AND_OR_1);
6303 target = expand_builtin_sync_operation (mode, exp, IOR,
6304 false, target, ignore);
6309 case BUILT_IN_FETCH_AND_AND_1:
6310 case BUILT_IN_FETCH_AND_AND_2:
6311 case BUILT_IN_FETCH_AND_AND_4:
6312 case BUILT_IN_FETCH_AND_AND_8:
6313 case BUILT_IN_FETCH_AND_AND_16:
6314 mode = get_builtin_sync_mode (fcode - BUILT_IN_FETCH_AND_AND_1);
6315 target = expand_builtin_sync_operation (mode, exp, AND,
6316 false, target, ignore);
6321 case BUILT_IN_FETCH_AND_XOR_1:
6322 case BUILT_IN_FETCH_AND_XOR_2:
6323 case BUILT_IN_FETCH_AND_XOR_4:
6324 case BUILT_IN_FETCH_AND_XOR_8:
6325 case BUILT_IN_FETCH_AND_XOR_16:
6326 mode = get_builtin_sync_mode (fcode - BUILT_IN_FETCH_AND_XOR_1);
6327 target = expand_builtin_sync_operation (mode, exp, XOR,
6328 false, target, ignore);
6333 case BUILT_IN_FETCH_AND_NAND_1:
6334 case BUILT_IN_FETCH_AND_NAND_2:
6335 case BUILT_IN_FETCH_AND_NAND_4:
6336 case BUILT_IN_FETCH_AND_NAND_8:
6337 case BUILT_IN_FETCH_AND_NAND_16:
6338 mode = get_builtin_sync_mode (fcode - BUILT_IN_FETCH_AND_NAND_1);
6339 target = expand_builtin_sync_operation (mode, exp, NOT,
6340 false, target, ignore);
6345 case BUILT_IN_ADD_AND_FETCH_1:
6346 case BUILT_IN_ADD_AND_FETCH_2:
6347 case BUILT_IN_ADD_AND_FETCH_4:
6348 case BUILT_IN_ADD_AND_FETCH_8:
6349 case BUILT_IN_ADD_AND_FETCH_16:
6350 mode = get_builtin_sync_mode (fcode - BUILT_IN_ADD_AND_FETCH_1);
6351 target = expand_builtin_sync_operation (mode, exp, PLUS,
6352 true, target, ignore);
6357 case BUILT_IN_SUB_AND_FETCH_1:
6358 case BUILT_IN_SUB_AND_FETCH_2:
6359 case BUILT_IN_SUB_AND_FETCH_4:
6360 case BUILT_IN_SUB_AND_FETCH_8:
6361 case BUILT_IN_SUB_AND_FETCH_16:
6362 mode = get_builtin_sync_mode (fcode - BUILT_IN_SUB_AND_FETCH_1);
6363 target = expand_builtin_sync_operation (mode, exp, MINUS,
6364 true, target, ignore);
6369 case BUILT_IN_OR_AND_FETCH_1:
6370 case BUILT_IN_OR_AND_FETCH_2:
6371 case BUILT_IN_OR_AND_FETCH_4:
6372 case BUILT_IN_OR_AND_FETCH_8:
6373 case BUILT_IN_OR_AND_FETCH_16:
6374 mode = get_builtin_sync_mode (fcode - BUILT_IN_OR_AND_FETCH_1);
6375 target = expand_builtin_sync_operation (mode, exp, IOR,
6376 true, target, ignore);
6381 case BUILT_IN_AND_AND_FETCH_1:
6382 case BUILT_IN_AND_AND_FETCH_2:
6383 case BUILT_IN_AND_AND_FETCH_4:
6384 case BUILT_IN_AND_AND_FETCH_8:
6385 case BUILT_IN_AND_AND_FETCH_16:
6386 mode = get_builtin_sync_mode (fcode - BUILT_IN_AND_AND_FETCH_1);
6387 target = expand_builtin_sync_operation (mode, exp, AND,
6388 true, target, ignore);
6393 case BUILT_IN_XOR_AND_FETCH_1:
6394 case BUILT_IN_XOR_AND_FETCH_2:
6395 case BUILT_IN_XOR_AND_FETCH_4:
6396 case BUILT_IN_XOR_AND_FETCH_8:
6397 case BUILT_IN_XOR_AND_FETCH_16:
6398 mode = get_builtin_sync_mode (fcode - BUILT_IN_XOR_AND_FETCH_1);
6399 target = expand_builtin_sync_operation (mode, exp, XOR,
6400 true, target, ignore);
6405 case BUILT_IN_NAND_AND_FETCH_1:
6406 case BUILT_IN_NAND_AND_FETCH_2:
6407 case BUILT_IN_NAND_AND_FETCH_4:
6408 case BUILT_IN_NAND_AND_FETCH_8:
6409 case BUILT_IN_NAND_AND_FETCH_16:
6410 mode = get_builtin_sync_mode (fcode - BUILT_IN_NAND_AND_FETCH_1);
6411 target = expand_builtin_sync_operation (mode, exp, NOT,
6412 true, target, ignore);
6417 case BUILT_IN_BOOL_COMPARE_AND_SWAP_1:
6418 case BUILT_IN_BOOL_COMPARE_AND_SWAP_2:
6419 case BUILT_IN_BOOL_COMPARE_AND_SWAP_4:
6420 case BUILT_IN_BOOL_COMPARE_AND_SWAP_8:
6421 case BUILT_IN_BOOL_COMPARE_AND_SWAP_16:
6422 if (mode == VOIDmode)
6423 mode = TYPE_MODE (boolean_type_node);
6424 if (!target || !register_operand (target, mode))
6425 target = gen_reg_rtx (mode);
6427 mode = get_builtin_sync_mode (fcode - BUILT_IN_BOOL_COMPARE_AND_SWAP_1);
6428 target = expand_builtin_compare_and_swap (mode, exp, true, target);
6433 case BUILT_IN_VAL_COMPARE_AND_SWAP_1:
6434 case BUILT_IN_VAL_COMPARE_AND_SWAP_2:
6435 case BUILT_IN_VAL_COMPARE_AND_SWAP_4:
6436 case BUILT_IN_VAL_COMPARE_AND_SWAP_8:
6437 case BUILT_IN_VAL_COMPARE_AND_SWAP_16:
6438 mode = get_builtin_sync_mode (fcode - BUILT_IN_VAL_COMPARE_AND_SWAP_1);
6439 target = expand_builtin_compare_and_swap (mode, exp, false, target);
6444 case BUILT_IN_LOCK_TEST_AND_SET_1:
6445 case BUILT_IN_LOCK_TEST_AND_SET_2:
6446 case BUILT_IN_LOCK_TEST_AND_SET_4:
6447 case BUILT_IN_LOCK_TEST_AND_SET_8:
6448 case BUILT_IN_LOCK_TEST_AND_SET_16:
6449 mode = get_builtin_sync_mode (fcode - BUILT_IN_LOCK_TEST_AND_SET_1);
6450 target = expand_builtin_lock_test_and_set (mode, exp, target);
6455 case BUILT_IN_LOCK_RELEASE_1:
6456 case BUILT_IN_LOCK_RELEASE_2:
6457 case BUILT_IN_LOCK_RELEASE_4:
6458 case BUILT_IN_LOCK_RELEASE_8:
6459 case BUILT_IN_LOCK_RELEASE_16:
6460 mode = get_builtin_sync_mode (fcode - BUILT_IN_LOCK_RELEASE_1);
6461 expand_builtin_lock_release (mode, exp);
6464 case BUILT_IN_SYNCHRONIZE:
6465 expand_builtin_synchronize ();
6468 case BUILT_IN_OBJECT_SIZE:
6469 return expand_builtin_object_size (exp);
6471 case BUILT_IN_MEMCPY_CHK:
6472 case BUILT_IN_MEMPCPY_CHK:
6473 case BUILT_IN_MEMMOVE_CHK:
6474 case BUILT_IN_MEMSET_CHK:
6475 target = expand_builtin_memory_chk (exp, target, mode, fcode);
6480 case BUILT_IN_STRCPY_CHK:
6481 case BUILT_IN_STPCPY_CHK:
6482 case BUILT_IN_STRNCPY_CHK:
6483 case BUILT_IN_STRCAT_CHK:
6484 case BUILT_IN_STRNCAT_CHK:
6485 case BUILT_IN_SNPRINTF_CHK:
6486 case BUILT_IN_VSNPRINTF_CHK:
6487 maybe_emit_chk_warning (exp, fcode);
6490 case BUILT_IN_SPRINTF_CHK:
6491 case BUILT_IN_VSPRINTF_CHK:
6492 maybe_emit_sprintf_chk_warning (exp, fcode);
6496 maybe_emit_free_warning (exp);
6499 default: /* just do library call, if unknown builtin */
6503 /* The switch statement above can drop through to cause the function
6504 to be called normally. */
6505 return expand_call (exp, target, ignore);
6508 /* Determine whether a tree node represents a call to a built-in
6509 function. If the tree T is a call to a built-in function with
6510 the right number of arguments of the appropriate types, return
6511 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
6512 Otherwise the return value is END_BUILTINS. */
6514 enum built_in_function
6515 builtin_mathfn_code (const_tree t)
6517 const_tree fndecl, arg, parmlist;
6518 const_tree argtype, parmtype;
6519 const_call_expr_arg_iterator iter;
6521 if (TREE_CODE (t) != CALL_EXPR
6522 || TREE_CODE (CALL_EXPR_FN (t)) != ADDR_EXPR)
6523 return END_BUILTINS;
6525 fndecl = get_callee_fndecl (t);
6526 if (fndecl == NULL_TREE
6527 || TREE_CODE (fndecl) != FUNCTION_DECL
6528 || ! DECL_BUILT_IN (fndecl)
6529 || DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
6530 return END_BUILTINS;
6532 parmlist = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
6533 init_const_call_expr_arg_iterator (t, &iter);
6534 for (; parmlist; parmlist = TREE_CHAIN (parmlist))
6536 /* If a function doesn't take a variable number of arguments,
6537 the last element in the list will have type `void'. */
6538 parmtype = TREE_VALUE (parmlist);
6539 if (VOID_TYPE_P (parmtype))
6541 if (more_const_call_expr_args_p (&iter))
6542 return END_BUILTINS;
6543 return DECL_FUNCTION_CODE (fndecl);
6546 if (! more_const_call_expr_args_p (&iter))
6547 return END_BUILTINS;
6549 arg = next_const_call_expr_arg (&iter);
6550 argtype = TREE_TYPE (arg);
6552 if (SCALAR_FLOAT_TYPE_P (parmtype))
6554 if (! SCALAR_FLOAT_TYPE_P (argtype))
6555 return END_BUILTINS;
6557 else if (COMPLEX_FLOAT_TYPE_P (parmtype))
6559 if (! COMPLEX_FLOAT_TYPE_P (argtype))
6560 return END_BUILTINS;
6562 else if (POINTER_TYPE_P (parmtype))
6564 if (! POINTER_TYPE_P (argtype))
6565 return END_BUILTINS;
6567 else if (INTEGRAL_TYPE_P (parmtype))
6569 if (! INTEGRAL_TYPE_P (argtype))
6570 return END_BUILTINS;
6573 return END_BUILTINS;
6576 /* Variable-length argument list. */
6577 return DECL_FUNCTION_CODE (fndecl);
6580 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
6581 evaluate to a constant. */
6584 fold_builtin_constant_p (tree arg)
6586 /* We return 1 for a numeric type that's known to be a constant
6587 value at compile-time or for an aggregate type that's a
6588 literal constant. */
6591 /* If we know this is a constant, emit the constant of one. */
6592 if (CONSTANT_CLASS_P (arg)
6593 || (TREE_CODE (arg) == CONSTRUCTOR
6594 && TREE_CONSTANT (arg)))
6595 return integer_one_node;
6596 if (TREE_CODE (arg) == ADDR_EXPR)
6598 tree op = TREE_OPERAND (arg, 0);
6599 if (TREE_CODE (op) == STRING_CST
6600 || (TREE_CODE (op) == ARRAY_REF
6601 && integer_zerop (TREE_OPERAND (op, 1))
6602 && TREE_CODE (TREE_OPERAND (op, 0)) == STRING_CST))
6603 return integer_one_node;
6606 /* If this expression has side effects, show we don't know it to be a
6607 constant. Likewise if it's a pointer or aggregate type since in
6608 those case we only want literals, since those are only optimized
6609 when generating RTL, not later.
6610 And finally, if we are compiling an initializer, not code, we
6611 need to return a definite result now; there's not going to be any
6612 more optimization done. */
6613 if (TREE_SIDE_EFFECTS (arg)
6614 || AGGREGATE_TYPE_P (TREE_TYPE (arg))
6615 || POINTER_TYPE_P (TREE_TYPE (arg))
6617 || folding_initializer)
6618 return integer_zero_node;
6623 /* Create builtin_expect with PRED and EXPECTED as its arguments and
6624 return it as a truthvalue. */
6627 build_builtin_expect_predicate (location_t loc, tree pred, tree expected)
6629 tree fn, arg_types, pred_type, expected_type, call_expr, ret_type;
6631 fn = built_in_decls[BUILT_IN_EXPECT];
6632 arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn));
6633 ret_type = TREE_TYPE (TREE_TYPE (fn));
6634 pred_type = TREE_VALUE (arg_types);
6635 expected_type = TREE_VALUE (TREE_CHAIN (arg_types));
6637 pred = fold_convert_loc (loc, pred_type, pred);
6638 expected = fold_convert_loc (loc, expected_type, expected);
6639 call_expr = build_call_expr_loc (loc, fn, 2, pred, expected);
6641 return build2 (NE_EXPR, TREE_TYPE (pred), call_expr,
6642 build_int_cst (ret_type, 0));
6645 /* Fold a call to builtin_expect with arguments ARG0 and ARG1. Return
6646 NULL_TREE if no simplification is possible. */
6649 fold_builtin_expect (location_t loc, tree arg0, tree arg1)
6652 enum tree_code code;
6654 /* If this is a builtin_expect within a builtin_expect keep the
6655 inner one. See through a comparison against a constant. It
6656 might have been added to create a thruthvalue. */
6658 if (COMPARISON_CLASS_P (inner)
6659 && TREE_CODE (TREE_OPERAND (inner, 1)) == INTEGER_CST)
6660 inner = TREE_OPERAND (inner, 0);
6662 if (TREE_CODE (inner) == CALL_EXPR
6663 && (fndecl = get_callee_fndecl (inner))
6664 && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
6665 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_EXPECT)
6668 /* Distribute the expected value over short-circuiting operators.
6669 See through the cast from truthvalue_type_node to long. */
6671 while (TREE_CODE (inner) == NOP_EXPR
6672 && INTEGRAL_TYPE_P (TREE_TYPE (inner))
6673 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (inner, 0))))
6674 inner = TREE_OPERAND (inner, 0);
6676 code = TREE_CODE (inner);
6677 if (code == TRUTH_ANDIF_EXPR || code == TRUTH_ORIF_EXPR)
6679 tree op0 = TREE_OPERAND (inner, 0);
6680 tree op1 = TREE_OPERAND (inner, 1);
6682 op0 = build_builtin_expect_predicate (loc, op0, arg1);
6683 op1 = build_builtin_expect_predicate (loc, op1, arg1);
6684 inner = build2 (code, TREE_TYPE (inner), op0, op1);
6686 return fold_convert_loc (loc, TREE_TYPE (arg0), inner);
6689 /* If the argument isn't invariant then there's nothing else we can do. */
6690 if (!TREE_CONSTANT (arg0))
6693 /* If we expect that a comparison against the argument will fold to
6694 a constant return the constant. In practice, this means a true
6695 constant or the address of a non-weak symbol. */
6698 if (TREE_CODE (inner) == ADDR_EXPR)
6702 inner = TREE_OPERAND (inner, 0);
6704 while (TREE_CODE (inner) == COMPONENT_REF
6705 || TREE_CODE (inner) == ARRAY_REF);
6706 if ((TREE_CODE (inner) == VAR_DECL
6707 || TREE_CODE (inner) == FUNCTION_DECL)
6708 && DECL_WEAK (inner))
6712 /* Otherwise, ARG0 already has the proper type for the return value. */
6716 /* Fold a call to __builtin_classify_type with argument ARG. */
6719 fold_builtin_classify_type (tree arg)
6722 return build_int_cst (NULL_TREE, no_type_class);
6724 return build_int_cst (NULL_TREE, type_to_class (TREE_TYPE (arg)));
6727 /* Fold a call to __builtin_strlen with argument ARG. */
6730 fold_builtin_strlen (location_t loc, tree type, tree arg)
6732 if (!validate_arg (arg, POINTER_TYPE))
6736 tree len = c_strlen (arg, 0);
6739 return fold_convert_loc (loc, type, len);
6745 /* Fold a call to __builtin_inf or __builtin_huge_val. */
6748 fold_builtin_inf (location_t loc, tree type, int warn)
6750 REAL_VALUE_TYPE real;
6752 /* __builtin_inff is intended to be usable to define INFINITY on all
6753 targets. If an infinity is not available, INFINITY expands "to a
6754 positive constant of type float that overflows at translation
6755 time", footnote "In this case, using INFINITY will violate the
6756 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
6757 Thus we pedwarn to ensure this constraint violation is
6759 if (!MODE_HAS_INFINITIES (TYPE_MODE (type)) && warn)
6760 pedwarn (loc, 0, "target format does not support infinity");
6763 return build_real (type, real);
6766 /* Fold a call to __builtin_nan or __builtin_nans with argument ARG. */
6769 fold_builtin_nan (tree arg, tree type, int quiet)
6771 REAL_VALUE_TYPE real;
6774 if (!validate_arg (arg, POINTER_TYPE))
6776 str = c_getstr (arg);
6780 if (!real_nan (&real, str, quiet, TYPE_MODE (type)))
6783 return build_real (type, real);
6786 /* Return true if the floating point expression T has an integer value.
6787 We also allow +Inf, -Inf and NaN to be considered integer values. */
6790 integer_valued_real_p (tree t)
6792 switch (TREE_CODE (t))
6799 return integer_valued_real_p (TREE_OPERAND (t, 0));
6804 return integer_valued_real_p (TREE_OPERAND (t, 1));
6811 return integer_valued_real_p (TREE_OPERAND (t, 0))
6812 && integer_valued_real_p (TREE_OPERAND (t, 1));
6815 return integer_valued_real_p (TREE_OPERAND (t, 1))
6816 && integer_valued_real_p (TREE_OPERAND (t, 2));
6819 return real_isinteger (TREE_REAL_CST_PTR (t), TYPE_MODE (TREE_TYPE (t)));
6823 tree type = TREE_TYPE (TREE_OPERAND (t, 0));
6824 if (TREE_CODE (type) == INTEGER_TYPE)
6826 if (TREE_CODE (type) == REAL_TYPE)
6827 return integer_valued_real_p (TREE_OPERAND (t, 0));
6832 switch (builtin_mathfn_code (t))
6834 CASE_FLT_FN (BUILT_IN_CEIL):
6835 CASE_FLT_FN (BUILT_IN_FLOOR):
6836 CASE_FLT_FN (BUILT_IN_NEARBYINT):
6837 CASE_FLT_FN (BUILT_IN_RINT):
6838 CASE_FLT_FN (BUILT_IN_ROUND):
6839 CASE_FLT_FN (BUILT_IN_TRUNC):
6842 CASE_FLT_FN (BUILT_IN_FMIN):
6843 CASE_FLT_FN (BUILT_IN_FMAX):
6844 return integer_valued_real_p (CALL_EXPR_ARG (t, 0))
6845 && integer_valued_real_p (CALL_EXPR_ARG (t, 1));
6858 /* FNDECL is assumed to be a builtin where truncation can be propagated
6859 across (for instance floor((double)f) == (double)floorf (f).
6860 Do the transformation for a call with argument ARG. */
6863 fold_trunc_transparent_mathfn (location_t loc, tree fndecl, tree arg)
6865 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
6867 if (!validate_arg (arg, REAL_TYPE))
6870 /* Integer rounding functions are idempotent. */
6871 if (fcode == builtin_mathfn_code (arg))
6874 /* If argument is already integer valued, and we don't need to worry
6875 about setting errno, there's no need to perform rounding. */
6876 if (! flag_errno_math && integer_valued_real_p (arg))
6881 tree arg0 = strip_float_extensions (arg);
6882 tree ftype = TREE_TYPE (TREE_TYPE (fndecl));
6883 tree newtype = TREE_TYPE (arg0);
6886 if (TYPE_PRECISION (newtype) < TYPE_PRECISION (ftype)
6887 && (decl = mathfn_built_in (newtype, fcode)))
6888 return fold_convert_loc (loc, ftype,
6889 build_call_expr_loc (loc, decl, 1,
6890 fold_convert_loc (loc,
6897 /* FNDECL is assumed to be builtin which can narrow the FP type of
6898 the argument, for instance lround((double)f) -> lroundf (f).
6899 Do the transformation for a call with argument ARG. */
6902 fold_fixed_mathfn (location_t loc, tree fndecl, tree arg)
6904 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
6906 if (!validate_arg (arg, REAL_TYPE))
6909 /* If argument is already integer valued, and we don't need to worry
6910 about setting errno, there's no need to perform rounding. */
6911 if (! flag_errno_math && integer_valued_real_p (arg))
6912 return fold_build1_loc (loc, FIX_TRUNC_EXPR,
6913 TREE_TYPE (TREE_TYPE (fndecl)), arg);
6917 tree ftype = TREE_TYPE (arg);
6918 tree arg0 = strip_float_extensions (arg);
6919 tree newtype = TREE_TYPE (arg0);
6922 if (TYPE_PRECISION (newtype) < TYPE_PRECISION (ftype)
6923 && (decl = mathfn_built_in (newtype, fcode)))
6924 return build_call_expr_loc (loc, decl, 1,
6925 fold_convert_loc (loc, newtype, arg0));
6928 /* Canonicalize llround (x) to lround (x) on LP64 targets where
6929 sizeof (long long) == sizeof (long). */
6930 if (TYPE_PRECISION (long_long_integer_type_node)
6931 == TYPE_PRECISION (long_integer_type_node))
6933 tree newfn = NULL_TREE;
6936 CASE_FLT_FN (BUILT_IN_LLCEIL):
6937 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LCEIL);
6940 CASE_FLT_FN (BUILT_IN_LLFLOOR):
6941 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LFLOOR);
6944 CASE_FLT_FN (BUILT_IN_LLROUND):
6945 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LROUND);
6948 CASE_FLT_FN (BUILT_IN_LLRINT):
6949 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LRINT);
6958 tree newcall = build_call_expr_loc (loc, newfn, 1, arg);
6959 return fold_convert_loc (loc,
6960 TREE_TYPE (TREE_TYPE (fndecl)), newcall);
6967 /* Fold call to builtin cabs, cabsf or cabsl with argument ARG. TYPE is the
6968 return type. Return NULL_TREE if no simplification can be made. */
6971 fold_builtin_cabs (location_t loc, tree arg, tree type, tree fndecl)
6975 if (!validate_arg (arg, COMPLEX_TYPE)
6976 || TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) != REAL_TYPE)
6979 /* Calculate the result when the argument is a constant. */
6980 if (TREE_CODE (arg) == COMPLEX_CST
6981 && (res = do_mpfr_arg2 (TREE_REALPART (arg), TREE_IMAGPART (arg),
6985 if (TREE_CODE (arg) == COMPLEX_EXPR)
6987 tree real = TREE_OPERAND (arg, 0);
6988 tree imag = TREE_OPERAND (arg, 1);
6990 /* If either part is zero, cabs is fabs of the other. */
6991 if (real_zerop (real))
6992 return fold_build1_loc (loc, ABS_EXPR, type, imag);
6993 if (real_zerop (imag))
6994 return fold_build1_loc (loc, ABS_EXPR, type, real);
6996 /* cabs(x+xi) -> fabs(x)*sqrt(2). */
6997 if (flag_unsafe_math_optimizations
6998 && operand_equal_p (real, imag, OEP_PURE_SAME))
7000 const REAL_VALUE_TYPE sqrt2_trunc
7001 = real_value_truncate (TYPE_MODE (type), dconst_sqrt2 ());
7003 return fold_build2_loc (loc, MULT_EXPR, type,
7004 fold_build1_loc (loc, ABS_EXPR, type, real),
7005 build_real (type, sqrt2_trunc));
7009 /* Optimize cabs(-z) and cabs(conj(z)) as cabs(z). */
7010 if (TREE_CODE (arg) == NEGATE_EXPR
7011 || TREE_CODE (arg) == CONJ_EXPR)
7012 return build_call_expr_loc (loc, fndecl, 1, TREE_OPERAND (arg, 0));
7014 /* Don't do this when optimizing for size. */
7015 if (flag_unsafe_math_optimizations
7016 && optimize && optimize_function_for_speed_p (cfun))
7018 tree sqrtfn = mathfn_built_in (type, BUILT_IN_SQRT);
7020 if (sqrtfn != NULL_TREE)
7022 tree rpart, ipart, result;
7024 arg = builtin_save_expr (arg);
7026 rpart = fold_build1_loc (loc, REALPART_EXPR, type, arg);
7027 ipart = fold_build1_loc (loc, IMAGPART_EXPR, type, arg);
7029 rpart = builtin_save_expr (rpart);
7030 ipart = builtin_save_expr (ipart);
7032 result = fold_build2_loc (loc, PLUS_EXPR, type,
7033 fold_build2_loc (loc, MULT_EXPR, type,
7035 fold_build2_loc (loc, MULT_EXPR, type,
7038 return build_call_expr_loc (loc, sqrtfn, 1, result);
7045 /* Fold a builtin function call to sqrt, sqrtf, or sqrtl with argument ARG.
7046 Return NULL_TREE if no simplification can be made. */
7049 fold_builtin_sqrt (location_t loc, tree arg, tree type)
7052 enum built_in_function fcode;
7055 if (!validate_arg (arg, REAL_TYPE))
7058 /* Calculate the result when the argument is a constant. */
7059 if ((res = do_mpfr_arg1 (arg, type, mpfr_sqrt, &dconst0, NULL, true)))
7062 /* Optimize sqrt(expN(x)) = expN(x*0.5). */
7063 fcode = builtin_mathfn_code (arg);
7064 if (flag_unsafe_math_optimizations && BUILTIN_EXPONENT_P (fcode))
7066 tree expfn = TREE_OPERAND (CALL_EXPR_FN (arg), 0);
7067 arg = fold_build2_loc (loc, MULT_EXPR, type,
7068 CALL_EXPR_ARG (arg, 0),
7069 build_real (type, dconsthalf));
7070 return build_call_expr_loc (loc, expfn, 1, arg);
7073 /* Optimize sqrt(Nroot(x)) -> pow(x,1/(2*N)). */
7074 if (flag_unsafe_math_optimizations && BUILTIN_ROOT_P (fcode))
7076 tree powfn = mathfn_built_in (type, BUILT_IN_POW);
7080 tree arg0 = CALL_EXPR_ARG (arg, 0);
7082 /* The inner root was either sqrt or cbrt. */
7083 /* This was a conditional expression but it triggered a bug
7085 REAL_VALUE_TYPE dconstroot;
7086 if (BUILTIN_SQRT_P (fcode))
7087 dconstroot = dconsthalf;
7089 dconstroot = dconst_third ();
7091 /* Adjust for the outer root. */
7092 SET_REAL_EXP (&dconstroot, REAL_EXP (&dconstroot) - 1);
7093 dconstroot = real_value_truncate (TYPE_MODE (type), dconstroot);
7094 tree_root = build_real (type, dconstroot);
7095 return build_call_expr_loc (loc, powfn, 2, arg0, tree_root);
7099 /* Optimize sqrt(pow(x,y)) = pow(|x|,y*0.5). */
7100 if (flag_unsafe_math_optimizations
7101 && (fcode == BUILT_IN_POW
7102 || fcode == BUILT_IN_POWF
7103 || fcode == BUILT_IN_POWL))
7105 tree powfn = TREE_OPERAND (CALL_EXPR_FN (arg), 0);
7106 tree arg0 = CALL_EXPR_ARG (arg, 0);
7107 tree arg1 = CALL_EXPR_ARG (arg, 1);
7109 if (!tree_expr_nonnegative_p (arg0))
7110 arg0 = build1 (ABS_EXPR, type, arg0);
7111 narg1 = fold_build2_loc (loc, MULT_EXPR, type, arg1,
7112 build_real (type, dconsthalf));
7113 return build_call_expr_loc (loc, powfn, 2, arg0, narg1);
7119 /* Fold a builtin function call to cbrt, cbrtf, or cbrtl with argument ARG.
7120 Return NULL_TREE if no simplification can be made. */
7123 fold_builtin_cbrt (location_t loc, tree arg, tree type)
7125 const enum built_in_function fcode = builtin_mathfn_code (arg);
7128 if (!validate_arg (arg, REAL_TYPE))
7131 /* Calculate the result when the argument is a constant. */
7132 if ((res = do_mpfr_arg1 (arg, type, mpfr_cbrt, NULL, NULL, 0)))
7135 if (flag_unsafe_math_optimizations)
7137 /* Optimize cbrt(expN(x)) -> expN(x/3). */
7138 if (BUILTIN_EXPONENT_P (fcode))
7140 tree expfn = TREE_OPERAND (CALL_EXPR_FN (arg), 0);
7141 const REAL_VALUE_TYPE third_trunc =
7142 real_value_truncate (TYPE_MODE (type), dconst_third ());
7143 arg = fold_build2_loc (loc, MULT_EXPR, type,
7144 CALL_EXPR_ARG (arg, 0),
7145 build_real (type, third_trunc));
7146 return build_call_expr_loc (loc, expfn, 1, arg);
7149 /* Optimize cbrt(sqrt(x)) -> pow(x,1/6). */
7150 if (BUILTIN_SQRT_P (fcode))
7152 tree powfn = mathfn_built_in (type, BUILT_IN_POW);
7156 tree arg0 = CALL_EXPR_ARG (arg, 0);
7158 REAL_VALUE_TYPE dconstroot = dconst_third ();
7160 SET_REAL_EXP (&dconstroot, REAL_EXP (&dconstroot) - 1);
7161 dconstroot = real_value_truncate (TYPE_MODE (type), dconstroot);
7162 tree_root = build_real (type, dconstroot);
7163 return build_call_expr_loc (loc, powfn, 2, arg0, tree_root);
7167 /* Optimize cbrt(cbrt(x)) -> pow(x,1/9) iff x is nonnegative. */
7168 if (BUILTIN_CBRT_P (fcode))
7170 tree arg0 = CALL_EXPR_ARG (arg, 0);
7171 if (tree_expr_nonnegative_p (arg0))
7173 tree powfn = mathfn_built_in (type, BUILT_IN_POW);
7178 REAL_VALUE_TYPE dconstroot;
7180 real_arithmetic (&dconstroot, MULT_EXPR,
7181 dconst_third_ptr (), dconst_third_ptr ());
7182 dconstroot = real_value_truncate (TYPE_MODE (type), dconstroot);
7183 tree_root = build_real (type, dconstroot);
7184 return build_call_expr_loc (loc, powfn, 2, arg0, tree_root);
7189 /* Optimize cbrt(pow(x,y)) -> pow(x,y/3) iff x is nonnegative. */
7190 if (fcode == BUILT_IN_POW
7191 || fcode == BUILT_IN_POWF
7192 || fcode == BUILT_IN_POWL)
7194 tree arg00 = CALL_EXPR_ARG (arg, 0);
7195 tree arg01 = CALL_EXPR_ARG (arg, 1);
7196 if (tree_expr_nonnegative_p (arg00))
7198 tree powfn = TREE_OPERAND (CALL_EXPR_FN (arg), 0);
7199 const REAL_VALUE_TYPE dconstroot
7200 = real_value_truncate (TYPE_MODE (type), dconst_third ());
7201 tree narg01 = fold_build2_loc (loc, MULT_EXPR, type, arg01,
7202 build_real (type, dconstroot));
7203 return build_call_expr_loc (loc, powfn, 2, arg00, narg01);
7210 /* Fold function call to builtin cos, cosf, or cosl with argument ARG.
7211 TYPE is the type of the return value. Return NULL_TREE if no
7212 simplification can be made. */
7215 fold_builtin_cos (location_t loc,
7216 tree arg, tree type, tree fndecl)
7220 if (!validate_arg (arg, REAL_TYPE))
7223 /* Calculate the result when the argument is a constant. */
7224 if ((res = do_mpfr_arg1 (arg, type, mpfr_cos, NULL, NULL, 0)))
7227 /* Optimize cos(-x) into cos (x). */
7228 if ((narg = fold_strip_sign_ops (arg)))
7229 return build_call_expr_loc (loc, fndecl, 1, narg);
7234 /* Fold function call to builtin cosh, coshf, or coshl with argument ARG.
7235 Return NULL_TREE if no simplification can be made. */
7238 fold_builtin_cosh (location_t loc, tree arg, tree type, tree fndecl)
7240 if (validate_arg (arg, REAL_TYPE))
7244 /* Calculate the result when the argument is a constant. */
7245 if ((res = do_mpfr_arg1 (arg, type, mpfr_cosh, NULL, NULL, 0)))
7248 /* Optimize cosh(-x) into cosh (x). */
7249 if ((narg = fold_strip_sign_ops (arg)))
7250 return build_call_expr_loc (loc, fndecl, 1, narg);
7256 /* Fold function call to builtin ccos (or ccosh if HYPER is TRUE) with
7257 argument ARG. TYPE is the type of the return value. Return
7258 NULL_TREE if no simplification can be made. */
7261 fold_builtin_ccos (location_t loc, tree arg, tree type, tree fndecl,
7264 if (validate_arg (arg, COMPLEX_TYPE)
7265 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) == REAL_TYPE)
7269 /* Calculate the result when the argument is a constant. */
7270 if ((tmp = do_mpc_arg1 (arg, type, (hyper ? mpc_cosh : mpc_cos))))
7273 /* Optimize fn(-x) into fn(x). */
7274 if ((tmp = fold_strip_sign_ops (arg)))
7275 return build_call_expr_loc (loc, fndecl, 1, tmp);
7281 /* Fold function call to builtin tan, tanf, or tanl with argument ARG.
7282 Return NULL_TREE if no simplification can be made. */
7285 fold_builtin_tan (tree arg, tree type)
7287 enum built_in_function fcode;
7290 if (!validate_arg (arg, REAL_TYPE))
7293 /* Calculate the result when the argument is a constant. */
7294 if ((res = do_mpfr_arg1 (arg, type, mpfr_tan, NULL, NULL, 0)))
7297 /* Optimize tan(atan(x)) = x. */
7298 fcode = builtin_mathfn_code (arg);
7299 if (flag_unsafe_math_optimizations
7300 && (fcode == BUILT_IN_ATAN
7301 || fcode == BUILT_IN_ATANF
7302 || fcode == BUILT_IN_ATANL))
7303 return CALL_EXPR_ARG (arg, 0);
7308 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
7309 NULL_TREE if no simplification can be made. */
7312 fold_builtin_sincos (location_t loc,
7313 tree arg0, tree arg1, tree arg2)
7318 if (!validate_arg (arg0, REAL_TYPE)
7319 || !validate_arg (arg1, POINTER_TYPE)
7320 || !validate_arg (arg2, POINTER_TYPE))
7323 type = TREE_TYPE (arg0);
7325 /* Calculate the result when the argument is a constant. */
7326 if ((res = do_mpfr_sincos (arg0, arg1, arg2)))
7329 /* Canonicalize sincos to cexpi. */
7330 if (!TARGET_C99_FUNCTIONS)
7332 fn = mathfn_built_in (type, BUILT_IN_CEXPI);
7336 call = build_call_expr_loc (loc, fn, 1, arg0);
7337 call = builtin_save_expr (call);
7339 return build2 (COMPOUND_EXPR, void_type_node,
7340 build2 (MODIFY_EXPR, void_type_node,
7341 build_fold_indirect_ref_loc (loc, arg1),
7342 build1 (IMAGPART_EXPR, type, call)),
7343 build2 (MODIFY_EXPR, void_type_node,
7344 build_fold_indirect_ref_loc (loc, arg2),
7345 build1 (REALPART_EXPR, type, call)));
7348 /* Fold function call to builtin cexp, cexpf, or cexpl. Return
7349 NULL_TREE if no simplification can be made. */
7352 fold_builtin_cexp (location_t loc, tree arg0, tree type)
7355 tree realp, imagp, ifn;
7358 if (!validate_arg (arg0, COMPLEX_TYPE)
7359 || TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) != REAL_TYPE)
7362 /* Calculate the result when the argument is a constant. */
7363 if ((res = do_mpc_arg1 (arg0, type, mpc_exp)))
7366 rtype = TREE_TYPE (TREE_TYPE (arg0));
7368 /* In case we can figure out the real part of arg0 and it is constant zero
7370 if (!TARGET_C99_FUNCTIONS)
7372 ifn = mathfn_built_in (rtype, BUILT_IN_CEXPI);
7376 if ((realp = fold_unary_loc (loc, REALPART_EXPR, rtype, arg0))
7377 && real_zerop (realp))
7379 tree narg = fold_build1_loc (loc, IMAGPART_EXPR, rtype, arg0);
7380 return build_call_expr_loc (loc, ifn, 1, narg);
7383 /* In case we can easily decompose real and imaginary parts split cexp
7384 to exp (r) * cexpi (i). */
7385 if (flag_unsafe_math_optimizations
7388 tree rfn, rcall, icall;
7390 rfn = mathfn_built_in (rtype, BUILT_IN_EXP);
7394 imagp = fold_unary_loc (loc, IMAGPART_EXPR, rtype, arg0);
7398 icall = build_call_expr_loc (loc, ifn, 1, imagp);
7399 icall = builtin_save_expr (icall);
7400 rcall = build_call_expr_loc (loc, rfn, 1, realp);
7401 rcall = builtin_save_expr (rcall);
7402 return fold_build2_loc (loc, COMPLEX_EXPR, type,
7403 fold_build2_loc (loc, MULT_EXPR, rtype,
7405 fold_build1_loc (loc, REALPART_EXPR,
7407 fold_build2_loc (loc, MULT_EXPR, rtype,
7409 fold_build1_loc (loc, IMAGPART_EXPR,
7416 /* Fold function call to builtin trunc, truncf or truncl with argument ARG.
7417 Return NULL_TREE if no simplification can be made. */
7420 fold_builtin_trunc (location_t loc, tree fndecl, tree arg)
7422 if (!validate_arg (arg, REAL_TYPE))
7425 /* Optimize trunc of constant value. */
7426 if (TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
7428 REAL_VALUE_TYPE r, x;
7429 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7431 x = TREE_REAL_CST (arg);
7432 real_trunc (&r, TYPE_MODE (type), &x);
7433 return build_real (type, r);
7436 return fold_trunc_transparent_mathfn (loc, fndecl, arg);
7439 /* Fold function call to builtin floor, floorf or floorl with argument ARG.
7440 Return NULL_TREE if no simplification can be made. */
7443 fold_builtin_floor (location_t loc, tree fndecl, tree arg)
7445 if (!validate_arg (arg, REAL_TYPE))
7448 /* Optimize floor of constant value. */
7449 if (TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
7453 x = TREE_REAL_CST (arg);
7454 if (! REAL_VALUE_ISNAN (x) || ! flag_errno_math)
7456 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7459 real_floor (&r, TYPE_MODE (type), &x);
7460 return build_real (type, r);
7464 /* Fold floor (x) where x is nonnegative to trunc (x). */
7465 if (tree_expr_nonnegative_p (arg))
7467 tree truncfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_TRUNC);
7469 return build_call_expr_loc (loc, truncfn, 1, arg);
7472 return fold_trunc_transparent_mathfn (loc, fndecl, arg);
7475 /* Fold function call to builtin ceil, ceilf or ceill with argument ARG.
7476 Return NULL_TREE if no simplification can be made. */
7479 fold_builtin_ceil (location_t loc, tree fndecl, tree arg)
7481 if (!validate_arg (arg, REAL_TYPE))
7484 /* Optimize ceil of constant value. */
7485 if (TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
7489 x = TREE_REAL_CST (arg);
7490 if (! REAL_VALUE_ISNAN (x) || ! flag_errno_math)
7492 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7495 real_ceil (&r, TYPE_MODE (type), &x);
7496 return build_real (type, r);
7500 return fold_trunc_transparent_mathfn (loc, fndecl, arg);
7503 /* Fold function call to builtin round, roundf or roundl with argument ARG.
7504 Return NULL_TREE if no simplification can be made. */
7507 fold_builtin_round (location_t loc, tree fndecl, tree arg)
7509 if (!validate_arg (arg, REAL_TYPE))
7512 /* Optimize round of constant value. */
7513 if (TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
7517 x = TREE_REAL_CST (arg);
7518 if (! REAL_VALUE_ISNAN (x) || ! flag_errno_math)
7520 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7523 real_round (&r, TYPE_MODE (type), &x);
7524 return build_real (type, r);
7528 return fold_trunc_transparent_mathfn (loc, fndecl, arg);
7531 /* Fold function call to builtin lround, lroundf or lroundl (or the
7532 corresponding long long versions) and other rounding functions. ARG
7533 is the argument to the call. Return NULL_TREE if no simplification
7537 fold_builtin_int_roundingfn (location_t loc, tree fndecl, tree arg)
7539 if (!validate_arg (arg, REAL_TYPE))
7542 /* Optimize lround of constant value. */
7543 if (TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
7545 const REAL_VALUE_TYPE x = TREE_REAL_CST (arg);
7547 if (real_isfinite (&x))
7549 tree itype = TREE_TYPE (TREE_TYPE (fndecl));
7550 tree ftype = TREE_TYPE (arg);
7551 unsigned HOST_WIDE_INT lo2;
7552 HOST_WIDE_INT hi, lo;
7555 switch (DECL_FUNCTION_CODE (fndecl))
7557 CASE_FLT_FN (BUILT_IN_LFLOOR):
7558 CASE_FLT_FN (BUILT_IN_LLFLOOR):
7559 real_floor (&r, TYPE_MODE (ftype), &x);
7562 CASE_FLT_FN (BUILT_IN_LCEIL):
7563 CASE_FLT_FN (BUILT_IN_LLCEIL):
7564 real_ceil (&r, TYPE_MODE (ftype), &x);
7567 CASE_FLT_FN (BUILT_IN_LROUND):
7568 CASE_FLT_FN (BUILT_IN_LLROUND):
7569 real_round (&r, TYPE_MODE (ftype), &x);
7576 REAL_VALUE_TO_INT (&lo, &hi, r);
7577 if (!fit_double_type (lo, hi, &lo2, &hi, itype))
7578 return build_int_cst_wide (itype, lo2, hi);
7582 switch (DECL_FUNCTION_CODE (fndecl))
7584 CASE_FLT_FN (BUILT_IN_LFLOOR):
7585 CASE_FLT_FN (BUILT_IN_LLFLOOR):
7586 /* Fold lfloor (x) where x is nonnegative to FIX_TRUNC (x). */
7587 if (tree_expr_nonnegative_p (arg))
7588 return fold_build1_loc (loc, FIX_TRUNC_EXPR,
7589 TREE_TYPE (TREE_TYPE (fndecl)), arg);
7594 return fold_fixed_mathfn (loc, fndecl, arg);
7597 /* Fold function call to builtin ffs, clz, ctz, popcount and parity
7598 and their long and long long variants (i.e. ffsl and ffsll). ARG is
7599 the argument to the call. Return NULL_TREE if no simplification can
7603 fold_builtin_bitop (tree fndecl, tree arg)
7605 if (!validate_arg (arg, INTEGER_TYPE))
7608 /* Optimize for constant argument. */
7609 if (TREE_CODE (arg) == INTEGER_CST && !TREE_OVERFLOW (arg))
7611 HOST_WIDE_INT hi, width, result;
7612 unsigned HOST_WIDE_INT lo;
7615 type = TREE_TYPE (arg);
7616 width = TYPE_PRECISION (type);
7617 lo = TREE_INT_CST_LOW (arg);
7619 /* Clear all the bits that are beyond the type's precision. */
7620 if (width > HOST_BITS_PER_WIDE_INT)
7622 hi = TREE_INT_CST_HIGH (arg);
7623 if (width < 2 * HOST_BITS_PER_WIDE_INT)
7624 hi &= ~((HOST_WIDE_INT) (-1) >> (width - HOST_BITS_PER_WIDE_INT));
7629 if (width < HOST_BITS_PER_WIDE_INT)
7630 lo &= ~((unsigned HOST_WIDE_INT) (-1) << width);
7633 switch (DECL_FUNCTION_CODE (fndecl))
7635 CASE_INT_FN (BUILT_IN_FFS):
7637 result = exact_log2 (lo & -lo) + 1;
7639 result = HOST_BITS_PER_WIDE_INT + exact_log2 (hi & -hi) + 1;
7644 CASE_INT_FN (BUILT_IN_CLZ):
7646 result = width - floor_log2 (hi) - 1 - HOST_BITS_PER_WIDE_INT;
7648 result = width - floor_log2 (lo) - 1;
7649 else if (! CLZ_DEFINED_VALUE_AT_ZERO (TYPE_MODE (type), result))
7653 CASE_INT_FN (BUILT_IN_CTZ):
7655 result = exact_log2 (lo & -lo);
7657 result = HOST_BITS_PER_WIDE_INT + exact_log2 (hi & -hi);
7658 else if (! CTZ_DEFINED_VALUE_AT_ZERO (TYPE_MODE (type), result))
7662 CASE_INT_FN (BUILT_IN_POPCOUNT):
7665 result++, lo &= lo - 1;
7667 result++, hi &= hi - 1;
7670 CASE_INT_FN (BUILT_IN_PARITY):
7673 result++, lo &= lo - 1;
7675 result++, hi &= hi - 1;
7683 return build_int_cst (TREE_TYPE (TREE_TYPE (fndecl)), result);
7689 /* Fold function call to builtin_bswap and the long and long long
7690 variants. Return NULL_TREE if no simplification can be made. */
7692 fold_builtin_bswap (tree fndecl, tree arg)
7694 if (! validate_arg (arg, INTEGER_TYPE))
7697 /* Optimize constant value. */
7698 if (TREE_CODE (arg) == INTEGER_CST && !TREE_OVERFLOW (arg))
7700 HOST_WIDE_INT hi, width, r_hi = 0;
7701 unsigned HOST_WIDE_INT lo, r_lo = 0;
7704 type = TREE_TYPE (arg);
7705 width = TYPE_PRECISION (type);
7706 lo = TREE_INT_CST_LOW (arg);
7707 hi = TREE_INT_CST_HIGH (arg);
7709 switch (DECL_FUNCTION_CODE (fndecl))
7711 case BUILT_IN_BSWAP32:
7712 case BUILT_IN_BSWAP64:
7716 for (s = 0; s < width; s += 8)
7718 int d = width - s - 8;
7719 unsigned HOST_WIDE_INT byte;
7721 if (s < HOST_BITS_PER_WIDE_INT)
7722 byte = (lo >> s) & 0xff;
7724 byte = (hi >> (s - HOST_BITS_PER_WIDE_INT)) & 0xff;
7726 if (d < HOST_BITS_PER_WIDE_INT)
7729 r_hi |= byte << (d - HOST_BITS_PER_WIDE_INT);
7739 if (width < HOST_BITS_PER_WIDE_INT)
7740 return build_int_cst (TREE_TYPE (TREE_TYPE (fndecl)), r_lo);
7742 return build_int_cst_wide (TREE_TYPE (TREE_TYPE (fndecl)), r_lo, r_hi);
7748 /* A subroutine of fold_builtin to fold the various logarithmic
7749 functions. Return NULL_TREE if no simplification can me made.
7750 FUNC is the corresponding MPFR logarithm function. */
7753 fold_builtin_logarithm (location_t loc, tree fndecl, tree arg,
7754 int (*func)(mpfr_ptr, mpfr_srcptr, mp_rnd_t))
7756 if (validate_arg (arg, REAL_TYPE))
7758 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7760 const enum built_in_function fcode = builtin_mathfn_code (arg);
7762 /* Calculate the result when the argument is a constant. */
7763 if ((res = do_mpfr_arg1 (arg, type, func, &dconst0, NULL, false)))
7766 /* Special case, optimize logN(expN(x)) = x. */
7767 if (flag_unsafe_math_optimizations
7768 && ((func == mpfr_log
7769 && (fcode == BUILT_IN_EXP
7770 || fcode == BUILT_IN_EXPF
7771 || fcode == BUILT_IN_EXPL))
7772 || (func == mpfr_log2
7773 && (fcode == BUILT_IN_EXP2
7774 || fcode == BUILT_IN_EXP2F
7775 || fcode == BUILT_IN_EXP2L))
7776 || (func == mpfr_log10 && (BUILTIN_EXP10_P (fcode)))))
7777 return fold_convert_loc (loc, type, CALL_EXPR_ARG (arg, 0));
7779 /* Optimize logN(func()) for various exponential functions. We
7780 want to determine the value "x" and the power "exponent" in
7781 order to transform logN(x**exponent) into exponent*logN(x). */
7782 if (flag_unsafe_math_optimizations)
7784 tree exponent = 0, x = 0;
7788 CASE_FLT_FN (BUILT_IN_EXP):
7789 /* Prepare to do logN(exp(exponent) -> exponent*logN(e). */
7790 x = build_real (type, real_value_truncate (TYPE_MODE (type),
7792 exponent = CALL_EXPR_ARG (arg, 0);
7794 CASE_FLT_FN (BUILT_IN_EXP2):
7795 /* Prepare to do logN(exp2(exponent) -> exponent*logN(2). */
7796 x = build_real (type, dconst2);
7797 exponent = CALL_EXPR_ARG (arg, 0);
7799 CASE_FLT_FN (BUILT_IN_EXP10):
7800 CASE_FLT_FN (BUILT_IN_POW10):
7801 /* Prepare to do logN(exp10(exponent) -> exponent*logN(10). */
7803 REAL_VALUE_TYPE dconst10;
7804 real_from_integer (&dconst10, VOIDmode, 10, 0, 0);
7805 x = build_real (type, dconst10);
7807 exponent = CALL_EXPR_ARG (arg, 0);
7809 CASE_FLT_FN (BUILT_IN_SQRT):
7810 /* Prepare to do logN(sqrt(x) -> 0.5*logN(x). */
7811 x = CALL_EXPR_ARG (arg, 0);
7812 exponent = build_real (type, dconsthalf);
7814 CASE_FLT_FN (BUILT_IN_CBRT):
7815 /* Prepare to do logN(cbrt(x) -> (1/3)*logN(x). */
7816 x = CALL_EXPR_ARG (arg, 0);
7817 exponent = build_real (type, real_value_truncate (TYPE_MODE (type),
7820 CASE_FLT_FN (BUILT_IN_POW):
7821 /* Prepare to do logN(pow(x,exponent) -> exponent*logN(x). */
7822 x = CALL_EXPR_ARG (arg, 0);
7823 exponent = CALL_EXPR_ARG (arg, 1);
7829 /* Now perform the optimization. */
7832 tree logfn = build_call_expr_loc (loc, fndecl, 1, x);
7833 return fold_build2_loc (loc, MULT_EXPR, type, exponent, logfn);
7841 /* Fold a builtin function call to hypot, hypotf, or hypotl. Return
7842 NULL_TREE if no simplification can be made. */
7845 fold_builtin_hypot (location_t loc, tree fndecl,
7846 tree arg0, tree arg1, tree type)
7848 tree res, narg0, narg1;
7850 if (!validate_arg (arg0, REAL_TYPE)
7851 || !validate_arg (arg1, REAL_TYPE))
7854 /* Calculate the result when the argument is a constant. */
7855 if ((res = do_mpfr_arg2 (arg0, arg1, type, mpfr_hypot)))
7858 /* If either argument to hypot has a negate or abs, strip that off.
7859 E.g. hypot(-x,fabs(y)) -> hypot(x,y). */
7860 narg0 = fold_strip_sign_ops (arg0);
7861 narg1 = fold_strip_sign_ops (arg1);
7864 return build_call_expr_loc (loc, fndecl, 2, narg0 ? narg0 : arg0,
7865 narg1 ? narg1 : arg1);
7868 /* If either argument is zero, hypot is fabs of the other. */
7869 if (real_zerop (arg0))
7870 return fold_build1_loc (loc, ABS_EXPR, type, arg1);
7871 else if (real_zerop (arg1))
7872 return fold_build1_loc (loc, ABS_EXPR, type, arg0);
7874 /* hypot(x,x) -> fabs(x)*sqrt(2). */
7875 if (flag_unsafe_math_optimizations
7876 && operand_equal_p (arg0, arg1, OEP_PURE_SAME))
7878 const REAL_VALUE_TYPE sqrt2_trunc
7879 = real_value_truncate (TYPE_MODE (type), dconst_sqrt2 ());
7880 return fold_build2_loc (loc, MULT_EXPR, type,
7881 fold_build1_loc (loc, ABS_EXPR, type, arg0),
7882 build_real (type, sqrt2_trunc));
7889 /* Fold a builtin function call to pow, powf, or powl. Return
7890 NULL_TREE if no simplification can be made. */
7892 fold_builtin_pow (location_t loc, tree fndecl, tree arg0, tree arg1, tree type)
7896 if (!validate_arg (arg0, REAL_TYPE)
7897 || !validate_arg (arg1, REAL_TYPE))
7900 /* Calculate the result when the argument is a constant. */
7901 if ((res = do_mpfr_arg2 (arg0, arg1, type, mpfr_pow)))
7904 /* Optimize pow(1.0,y) = 1.0. */
7905 if (real_onep (arg0))
7906 return omit_one_operand_loc (loc, type, build_real (type, dconst1), arg1);
7908 if (TREE_CODE (arg1) == REAL_CST
7909 && !TREE_OVERFLOW (arg1))
7911 REAL_VALUE_TYPE cint;
7915 c = TREE_REAL_CST (arg1);
7917 /* Optimize pow(x,0.0) = 1.0. */
7918 if (REAL_VALUES_EQUAL (c, dconst0))
7919 return omit_one_operand_loc (loc, type, build_real (type, dconst1),
7922 /* Optimize pow(x,1.0) = x. */
7923 if (REAL_VALUES_EQUAL (c, dconst1))
7926 /* Optimize pow(x,-1.0) = 1.0/x. */
7927 if (REAL_VALUES_EQUAL (c, dconstm1))
7928 return fold_build2_loc (loc, RDIV_EXPR, type,
7929 build_real (type, dconst1), arg0);
7931 /* Optimize pow(x,0.5) = sqrt(x). */
7932 if (flag_unsafe_math_optimizations
7933 && REAL_VALUES_EQUAL (c, dconsthalf))
7935 tree sqrtfn = mathfn_built_in (type, BUILT_IN_SQRT);
7937 if (sqrtfn != NULL_TREE)
7938 return build_call_expr_loc (loc, sqrtfn, 1, arg0);
7941 /* Optimize pow(x,1.0/3.0) = cbrt(x). */
7942 if (flag_unsafe_math_optimizations)
7944 const REAL_VALUE_TYPE dconstroot
7945 = real_value_truncate (TYPE_MODE (type), dconst_third ());
7947 if (REAL_VALUES_EQUAL (c, dconstroot))
7949 tree cbrtfn = mathfn_built_in (type, BUILT_IN_CBRT);
7950 if (cbrtfn != NULL_TREE)
7951 return build_call_expr_loc (loc, cbrtfn, 1, arg0);
7955 /* Check for an integer exponent. */
7956 n = real_to_integer (&c);
7957 real_from_integer (&cint, VOIDmode, n, n < 0 ? -1 : 0, 0);
7958 if (real_identical (&c, &cint))
7960 /* Attempt to evaluate pow at compile-time, unless this should
7961 raise an exception. */
7962 if (TREE_CODE (arg0) == REAL_CST
7963 && !TREE_OVERFLOW (arg0)
7965 || (!flag_trapping_math && !flag_errno_math)
7966 || !REAL_VALUES_EQUAL (TREE_REAL_CST (arg0), dconst0)))
7971 x = TREE_REAL_CST (arg0);
7972 inexact = real_powi (&x, TYPE_MODE (type), &x, n);
7973 if (flag_unsafe_math_optimizations || !inexact)
7974 return build_real (type, x);
7977 /* Strip sign ops from even integer powers. */
7978 if ((n & 1) == 0 && flag_unsafe_math_optimizations)
7980 tree narg0 = fold_strip_sign_ops (arg0);
7982 return build_call_expr_loc (loc, fndecl, 2, narg0, arg1);
7987 if (flag_unsafe_math_optimizations)
7989 const enum built_in_function fcode = builtin_mathfn_code (arg0);
7991 /* Optimize pow(expN(x),y) = expN(x*y). */
7992 if (BUILTIN_EXPONENT_P (fcode))
7994 tree expfn = TREE_OPERAND (CALL_EXPR_FN (arg0), 0);
7995 tree arg = CALL_EXPR_ARG (arg0, 0);
7996 arg = fold_build2_loc (loc, MULT_EXPR, type, arg, arg1);
7997 return build_call_expr_loc (loc, expfn, 1, arg);
8000 /* Optimize pow(sqrt(x),y) = pow(x,y*0.5). */
8001 if (BUILTIN_SQRT_P (fcode))
8003 tree narg0 = CALL_EXPR_ARG (arg0, 0);
8004 tree narg1 = fold_build2_loc (loc, MULT_EXPR, type, arg1,
8005 build_real (type, dconsthalf));
8006 return build_call_expr_loc (loc, fndecl, 2, narg0, narg1);
8009 /* Optimize pow(cbrt(x),y) = pow(x,y/3) iff x is nonnegative. */
8010 if (BUILTIN_CBRT_P (fcode))
8012 tree arg = CALL_EXPR_ARG (arg0, 0);
8013 if (tree_expr_nonnegative_p (arg))
8015 const REAL_VALUE_TYPE dconstroot
8016 = real_value_truncate (TYPE_MODE (type), dconst_third ());
8017 tree narg1 = fold_build2_loc (loc, MULT_EXPR, type, arg1,
8018 build_real (type, dconstroot));
8019 return build_call_expr_loc (loc, fndecl, 2, arg, narg1);
8023 /* Optimize pow(pow(x,y),z) = pow(x,y*z) iff x is nonnegative. */
8024 if (fcode == BUILT_IN_POW
8025 || fcode == BUILT_IN_POWF
8026 || fcode == BUILT_IN_POWL)
8028 tree arg00 = CALL_EXPR_ARG (arg0, 0);
8029 if (tree_expr_nonnegative_p (arg00))
8031 tree arg01 = CALL_EXPR_ARG (arg0, 1);
8032 tree narg1 = fold_build2_loc (loc, MULT_EXPR, type, arg01, arg1);
8033 return build_call_expr_loc (loc, fndecl, 2, arg00, narg1);
8041 /* Fold a builtin function call to powi, powif, or powil with argument ARG.
8042 Return NULL_TREE if no simplification can be made. */
8044 fold_builtin_powi (location_t loc, tree fndecl ATTRIBUTE_UNUSED,
8045 tree arg0, tree arg1, tree type)
8047 if (!validate_arg (arg0, REAL_TYPE)
8048 || !validate_arg (arg1, INTEGER_TYPE))
8051 /* Optimize pow(1.0,y) = 1.0. */
8052 if (real_onep (arg0))
8053 return omit_one_operand_loc (loc, type, build_real (type, dconst1), arg1);
8055 if (host_integerp (arg1, 0))
8057 HOST_WIDE_INT c = TREE_INT_CST_LOW (arg1);
8059 /* Evaluate powi at compile-time. */
8060 if (TREE_CODE (arg0) == REAL_CST
8061 && !TREE_OVERFLOW (arg0))
8064 x = TREE_REAL_CST (arg0);
8065 real_powi (&x, TYPE_MODE (type), &x, c);
8066 return build_real (type, x);
8069 /* Optimize pow(x,0) = 1.0. */
8071 return omit_one_operand_loc (loc, type, build_real (type, dconst1),
8074 /* Optimize pow(x,1) = x. */
8078 /* Optimize pow(x,-1) = 1.0/x. */
8080 return fold_build2_loc (loc, RDIV_EXPR, type,
8081 build_real (type, dconst1), arg0);
8087 /* A subroutine of fold_builtin to fold the various exponent
8088 functions. Return NULL_TREE if no simplification can be made.
8089 FUNC is the corresponding MPFR exponent function. */
8092 fold_builtin_exponent (location_t loc, tree fndecl, tree arg,
8093 int (*func)(mpfr_ptr, mpfr_srcptr, mp_rnd_t))
8095 if (validate_arg (arg, REAL_TYPE))
8097 tree type = TREE_TYPE (TREE_TYPE (fndecl));
8100 /* Calculate the result when the argument is a constant. */
8101 if ((res = do_mpfr_arg1 (arg, type, func, NULL, NULL, 0)))
8104 /* Optimize expN(logN(x)) = x. */
8105 if (flag_unsafe_math_optimizations)
8107 const enum built_in_function fcode = builtin_mathfn_code (arg);
8109 if ((func == mpfr_exp
8110 && (fcode == BUILT_IN_LOG
8111 || fcode == BUILT_IN_LOGF
8112 || fcode == BUILT_IN_LOGL))
8113 || (func == mpfr_exp2
8114 && (fcode == BUILT_IN_LOG2
8115 || fcode == BUILT_IN_LOG2F
8116 || fcode == BUILT_IN_LOG2L))
8117 || (func == mpfr_exp10
8118 && (fcode == BUILT_IN_LOG10
8119 || fcode == BUILT_IN_LOG10F
8120 || fcode == BUILT_IN_LOG10L)))
8121 return fold_convert_loc (loc, type, CALL_EXPR_ARG (arg, 0));
8128 /* Return true if VAR is a VAR_DECL or a component thereof. */
8131 var_decl_component_p (tree var)
8134 while (handled_component_p (inner))
8135 inner = TREE_OPERAND (inner, 0);
8136 return SSA_VAR_P (inner);
8139 /* Fold function call to builtin memset. Return
8140 NULL_TREE if no simplification can be made. */
8143 fold_builtin_memset (location_t loc, tree dest, tree c, tree len,
8144 tree type, bool ignore)
8146 tree var, ret, etype;
8147 unsigned HOST_WIDE_INT length, cval;
8149 if (! validate_arg (dest, POINTER_TYPE)
8150 || ! validate_arg (c, INTEGER_TYPE)
8151 || ! validate_arg (len, INTEGER_TYPE))
8154 if (! host_integerp (len, 1))
8157 /* If the LEN parameter is zero, return DEST. */
8158 if (integer_zerop (len))
8159 return omit_one_operand_loc (loc, type, dest, c);
8161 if (! host_integerp (c, 1) || TREE_SIDE_EFFECTS (dest))
8166 if (TREE_CODE (var) != ADDR_EXPR)
8169 var = TREE_OPERAND (var, 0);
8170 if (TREE_THIS_VOLATILE (var))
8173 etype = TREE_TYPE (var);
8174 if (TREE_CODE (etype) == ARRAY_TYPE)
8175 etype = TREE_TYPE (etype);
8177 if (!INTEGRAL_TYPE_P (etype)
8178 && !POINTER_TYPE_P (etype))
8181 if (! var_decl_component_p (var))
8184 length = tree_low_cst (len, 1);
8185 if (GET_MODE_SIZE (TYPE_MODE (etype)) != length
8186 || get_pointer_alignment (dest, BIGGEST_ALIGNMENT) / BITS_PER_UNIT
8190 if (length > HOST_BITS_PER_WIDE_INT / BITS_PER_UNIT)
8193 if (integer_zerop (c))
8197 if (CHAR_BIT != 8 || BITS_PER_UNIT != 8 || HOST_BITS_PER_WIDE_INT > 64)
8200 cval = tree_low_cst (c, 1);
8204 cval |= (cval << 31) << 1;
8207 ret = build_int_cst_type (etype, cval);
8208 var = build_fold_indirect_ref_loc (loc,
8209 fold_convert_loc (loc,
8210 build_pointer_type (etype),
8212 ret = build2 (MODIFY_EXPR, etype, var, ret);
8216 return omit_one_operand_loc (loc, type, dest, ret);
8219 /* Fold function call to builtin memset. Return
8220 NULL_TREE if no simplification can be made. */
8223 fold_builtin_bzero (location_t loc, tree dest, tree size, bool ignore)
8225 if (! validate_arg (dest, POINTER_TYPE)
8226 || ! validate_arg (size, INTEGER_TYPE))
8232 /* New argument list transforming bzero(ptr x, int y) to
8233 memset(ptr x, int 0, size_t y). This is done this way
8234 so that if it isn't expanded inline, we fallback to
8235 calling bzero instead of memset. */
8237 return fold_builtin_memset (loc, dest, integer_zero_node,
8238 fold_convert_loc (loc, sizetype, size),
8239 void_type_node, ignore);
8242 /* Fold function call to builtin mem{{,p}cpy,move}. Return
8243 NULL_TREE if no simplification can be made.
8244 If ENDP is 0, return DEST (like memcpy).
8245 If ENDP is 1, return DEST+LEN (like mempcpy).
8246 If ENDP is 2, return DEST+LEN-1 (like stpcpy).
8247 If ENDP is 3, return DEST, additionally *SRC and *DEST may overlap
8251 fold_builtin_memory_op (location_t loc, tree dest, tree src,
8252 tree len, tree type, bool ignore, int endp)
8254 tree destvar, srcvar, expr;
8256 if (! validate_arg (dest, POINTER_TYPE)
8257 || ! validate_arg (src, POINTER_TYPE)
8258 || ! validate_arg (len, INTEGER_TYPE))
8261 /* If the LEN parameter is zero, return DEST. */
8262 if (integer_zerop (len))
8263 return omit_one_operand_loc (loc, type, dest, src);
8265 /* If SRC and DEST are the same (and not volatile), return
8266 DEST{,+LEN,+LEN-1}. */
8267 if (operand_equal_p (src, dest, 0))
8271 tree srctype, desttype;
8272 int src_align, dest_align;
8276 src_align = get_pointer_alignment (src, BIGGEST_ALIGNMENT);
8277 dest_align = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
8279 /* Both DEST and SRC must be pointer types.
8280 ??? This is what old code did. Is the testing for pointer types
8283 If either SRC is readonly or length is 1, we can use memcpy. */
8284 if (!dest_align || !src_align)
8286 if (readonly_data_expr (src)
8287 || (host_integerp (len, 1)
8288 && (MIN (src_align, dest_align) / BITS_PER_UNIT
8289 >= tree_low_cst (len, 1))))
8291 tree fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
8294 return build_call_expr_loc (loc, fn, 3, dest, src, len);
8297 /* If *src and *dest can't overlap, optimize into memcpy as well. */
8298 srcvar = build_fold_indirect_ref_loc (loc, src);
8299 destvar = build_fold_indirect_ref_loc (loc, dest);
8301 && !TREE_THIS_VOLATILE (srcvar)
8303 && !TREE_THIS_VOLATILE (destvar))
8305 tree src_base, dest_base, fn;
8306 HOST_WIDE_INT src_offset = 0, dest_offset = 0;
8307 HOST_WIDE_INT size = -1;
8308 HOST_WIDE_INT maxsize = -1;
8311 if (handled_component_p (src_base))
8312 src_base = get_ref_base_and_extent (src_base, &src_offset,
8314 dest_base = destvar;
8315 if (handled_component_p (dest_base))
8316 dest_base = get_ref_base_and_extent (dest_base, &dest_offset,
8318 if (host_integerp (len, 1))
8320 maxsize = tree_low_cst (len, 1);
8322 > INTTYPE_MAXIMUM (HOST_WIDE_INT) / BITS_PER_UNIT)
8325 maxsize *= BITS_PER_UNIT;
8329 if (SSA_VAR_P (src_base)
8330 && SSA_VAR_P (dest_base))
8332 if (operand_equal_p (src_base, dest_base, 0)
8333 && ranges_overlap_p (src_offset, maxsize,
8334 dest_offset, maxsize))
8337 else if (TREE_CODE (src_base) == INDIRECT_REF
8338 && TREE_CODE (dest_base) == INDIRECT_REF)
8340 if (! operand_equal_p (TREE_OPERAND (src_base, 0),
8341 TREE_OPERAND (dest_base, 0), 0)
8342 || ranges_overlap_p (src_offset, maxsize,
8343 dest_offset, maxsize))
8349 fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
8352 return build_call_expr_loc (loc, fn, 3, dest, src, len);
8357 if (!host_integerp (len, 0))
8360 This logic lose for arguments like (type *)malloc (sizeof (type)),
8361 since we strip the casts of up to VOID return value from malloc.
8362 Perhaps we ought to inherit type from non-VOID argument here? */
8365 /* As we fold (void *)(p + CST) to (void *)p + CST undo this here. */
8366 if (TREE_CODE (src) == POINTER_PLUS_EXPR)
8368 tree tem = TREE_OPERAND (src, 0);
8370 if (tem != TREE_OPERAND (src, 0))
8371 src = build1 (NOP_EXPR, TREE_TYPE (tem), src);
8373 if (TREE_CODE (dest) == POINTER_PLUS_EXPR)
8375 tree tem = TREE_OPERAND (dest, 0);
8377 if (tem != TREE_OPERAND (dest, 0))
8378 dest = build1 (NOP_EXPR, TREE_TYPE (tem), dest);
8380 srctype = TREE_TYPE (TREE_TYPE (src));
8382 && TREE_CODE (srctype) == ARRAY_TYPE
8383 && !tree_int_cst_equal (TYPE_SIZE_UNIT (srctype), len))
8385 srctype = TREE_TYPE (srctype);
8387 src = build1 (NOP_EXPR, build_pointer_type (srctype), src);
8389 desttype = TREE_TYPE (TREE_TYPE (dest));
8391 && TREE_CODE (desttype) == ARRAY_TYPE
8392 && !tree_int_cst_equal (TYPE_SIZE_UNIT (desttype), len))
8394 desttype = TREE_TYPE (desttype);
8396 dest = build1 (NOP_EXPR, build_pointer_type (desttype), dest);
8398 if (!srctype || !desttype
8399 || !TYPE_SIZE_UNIT (srctype)
8400 || !TYPE_SIZE_UNIT (desttype)
8401 || TREE_CODE (TYPE_SIZE_UNIT (srctype)) != INTEGER_CST
8402 || TREE_CODE (TYPE_SIZE_UNIT (desttype)) != INTEGER_CST
8403 || TYPE_VOLATILE (srctype)
8404 || TYPE_VOLATILE (desttype))
8407 src_align = get_pointer_alignment (src, BIGGEST_ALIGNMENT);
8408 dest_align = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
8409 if (dest_align < (int) TYPE_ALIGN (desttype)
8410 || src_align < (int) TYPE_ALIGN (srctype))
8414 dest = builtin_save_expr (dest);
8417 if (tree_int_cst_equal (TYPE_SIZE_UNIT (srctype), len))
8419 srcvar = build_fold_indirect_ref_loc (loc, src);
8420 if (TREE_THIS_VOLATILE (srcvar))
8422 else if (!tree_int_cst_equal (tree_expr_size (srcvar), len))
8424 /* With memcpy, it is possible to bypass aliasing rules, so without
8425 this check i.e. execute/20060930-2.c would be misoptimized,
8426 because it use conflicting alias set to hold argument for the
8427 memcpy call. This check is probably unnecessary with
8428 -fno-strict-aliasing. Similarly for destvar. See also
8430 else if (!var_decl_component_p (srcvar))
8434 destvar = NULL_TREE;
8435 if (tree_int_cst_equal (TYPE_SIZE_UNIT (desttype), len))
8437 destvar = build_fold_indirect_ref_loc (loc, dest);
8438 if (TREE_THIS_VOLATILE (destvar))
8440 else if (!tree_int_cst_equal (tree_expr_size (destvar), len))
8441 destvar = NULL_TREE;
8442 else if (!var_decl_component_p (destvar))
8443 destvar = NULL_TREE;
8446 if (srcvar == NULL_TREE && destvar == NULL_TREE)
8449 if (srcvar == NULL_TREE)
8452 if (TREE_ADDRESSABLE (TREE_TYPE (destvar)))
8455 srctype = build_qualified_type (desttype, 0);
8456 if (src_align < (int) TYPE_ALIGN (srctype))
8458 if (AGGREGATE_TYPE_P (srctype)
8459 || SLOW_UNALIGNED_ACCESS (TYPE_MODE (srctype), src_align))
8462 srctype = build_variant_type_copy (srctype);
8463 TYPE_ALIGN (srctype) = src_align;
8464 TYPE_USER_ALIGN (srctype) = 1;
8465 TYPE_PACKED (srctype) = 1;
8467 srcptype = build_pointer_type_for_mode (srctype, ptr_mode, true);
8468 src = fold_convert_loc (loc, srcptype, src);
8469 srcvar = build_fold_indirect_ref_loc (loc, src);
8471 else if (destvar == NULL_TREE)
8474 if (TREE_ADDRESSABLE (TREE_TYPE (srcvar)))
8477 desttype = build_qualified_type (srctype, 0);
8478 if (dest_align < (int) TYPE_ALIGN (desttype))
8480 if (AGGREGATE_TYPE_P (desttype)
8481 || SLOW_UNALIGNED_ACCESS (TYPE_MODE (desttype), dest_align))
8484 desttype = build_variant_type_copy (desttype);
8485 TYPE_ALIGN (desttype) = dest_align;
8486 TYPE_USER_ALIGN (desttype) = 1;
8487 TYPE_PACKED (desttype) = 1;
8489 destptype = build_pointer_type_for_mode (desttype, ptr_mode, true);
8490 dest = fold_convert_loc (loc, destptype, dest);
8491 destvar = build_fold_indirect_ref_loc (loc, dest);
8494 if (srctype == desttype
8495 || (gimple_in_ssa_p (cfun)
8496 && useless_type_conversion_p (desttype, srctype)))
8498 else if ((INTEGRAL_TYPE_P (TREE_TYPE (srcvar))
8499 || POINTER_TYPE_P (TREE_TYPE (srcvar)))
8500 && (INTEGRAL_TYPE_P (TREE_TYPE (destvar))
8501 || POINTER_TYPE_P (TREE_TYPE (destvar))))
8502 expr = fold_convert_loc (loc, TREE_TYPE (destvar), srcvar);
8504 expr = fold_build1_loc (loc, VIEW_CONVERT_EXPR,
8505 TREE_TYPE (destvar), srcvar);
8506 expr = build2 (MODIFY_EXPR, TREE_TYPE (destvar), destvar, expr);
8512 if (endp == 0 || endp == 3)
8513 return omit_one_operand_loc (loc, type, dest, expr);
8519 len = fold_build2_loc (loc, MINUS_EXPR, TREE_TYPE (len), len,
8522 len = fold_convert_loc (loc, sizetype, len);
8523 dest = fold_build2_loc (loc, POINTER_PLUS_EXPR, TREE_TYPE (dest), dest, len);
8524 dest = fold_convert_loc (loc, type, dest);
8526 dest = omit_one_operand_loc (loc, type, dest, expr);
8530 /* Fold function call to builtin strcpy with arguments DEST and SRC.
8531 If LEN is not NULL, it represents the length of the string to be
8532 copied. Return NULL_TREE if no simplification can be made. */
8535 fold_builtin_strcpy (location_t loc, tree fndecl, tree dest, tree src, tree len)
8539 if (!validate_arg (dest, POINTER_TYPE)
8540 || !validate_arg (src, POINTER_TYPE))
8543 /* If SRC and DEST are the same (and not volatile), return DEST. */
8544 if (operand_equal_p (src, dest, 0))
8545 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest);
8547 if (optimize_function_for_size_p (cfun))
8550 fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
8556 len = c_strlen (src, 1);
8557 if (! len || TREE_SIDE_EFFECTS (len))
8561 len = size_binop_loc (loc, PLUS_EXPR, len, ssize_int (1));
8562 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)),
8563 build_call_expr_loc (loc, fn, 3, dest, src, len));
8566 /* Fold function call to builtin stpcpy with arguments DEST and SRC.
8567 Return NULL_TREE if no simplification can be made. */
8570 fold_builtin_stpcpy (location_t loc, tree fndecl, tree dest, tree src)
8572 tree fn, len, lenp1, call, type;
8574 if (!validate_arg (dest, POINTER_TYPE)
8575 || !validate_arg (src, POINTER_TYPE))
8578 len = c_strlen (src, 1);
8580 || TREE_CODE (len) != INTEGER_CST)
8583 if (optimize_function_for_size_p (cfun)
8584 /* If length is zero it's small enough. */
8585 && !integer_zerop (len))
8588 fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
8592 lenp1 = size_binop_loc (loc, PLUS_EXPR, len, ssize_int (1));
8593 /* We use dest twice in building our expression. Save it from
8594 multiple expansions. */
8595 dest = builtin_save_expr (dest);
8596 call = build_call_expr_loc (loc, fn, 3, dest, src, lenp1);
8598 type = TREE_TYPE (TREE_TYPE (fndecl));
8599 len = fold_convert_loc (loc, sizetype, len);
8600 dest = fold_build2_loc (loc, POINTER_PLUS_EXPR, TREE_TYPE (dest), dest, len);
8601 dest = fold_convert_loc (loc, type, dest);
8602 dest = omit_one_operand_loc (loc, type, dest, call);
8606 /* Fold function call to builtin strncpy with arguments DEST, SRC, and LEN.
8607 If SLEN is not NULL, it represents the length of the source string.
8608 Return NULL_TREE if no simplification can be made. */
8611 fold_builtin_strncpy (location_t loc, tree fndecl, tree dest,
8612 tree src, tree len, tree slen)
8616 if (!validate_arg (dest, POINTER_TYPE)
8617 || !validate_arg (src, POINTER_TYPE)
8618 || !validate_arg (len, INTEGER_TYPE))
8621 /* If the LEN parameter is zero, return DEST. */
8622 if (integer_zerop (len))
8623 return omit_one_operand_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest, src);
8625 /* We can't compare slen with len as constants below if len is not a
8627 if (len == 0 || TREE_CODE (len) != INTEGER_CST)
8631 slen = c_strlen (src, 1);
8633 /* Now, we must be passed a constant src ptr parameter. */
8634 if (slen == 0 || TREE_CODE (slen) != INTEGER_CST)
8637 slen = size_binop_loc (loc, PLUS_EXPR, slen, ssize_int (1));
8639 /* We do not support simplification of this case, though we do
8640 support it when expanding trees into RTL. */
8641 /* FIXME: generate a call to __builtin_memset. */
8642 if (tree_int_cst_lt (slen, len))
8645 /* OK transform into builtin memcpy. */
8646 fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
8649 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)),
8650 build_call_expr_loc (loc, fn, 3, dest, src, len));
8653 /* Fold function call to builtin memchr. ARG1, ARG2 and LEN are the
8654 arguments to the call, and TYPE is its return type.
8655 Return NULL_TREE if no simplification can be made. */
8658 fold_builtin_memchr (location_t loc, tree arg1, tree arg2, tree len, tree type)
8660 if (!validate_arg (arg1, POINTER_TYPE)
8661 || !validate_arg (arg2, INTEGER_TYPE)
8662 || !validate_arg (len, INTEGER_TYPE))
8668 if (TREE_CODE (arg2) != INTEGER_CST
8669 || !host_integerp (len, 1))
8672 p1 = c_getstr (arg1);
8673 if (p1 && compare_tree_int (len, strlen (p1) + 1) <= 0)
8679 if (target_char_cast (arg2, &c))
8682 r = (char *) memchr (p1, c, tree_low_cst (len, 1));
8685 return build_int_cst (TREE_TYPE (arg1), 0);
8687 tem = fold_build2_loc (loc, POINTER_PLUS_EXPR, TREE_TYPE (arg1), arg1,
8689 return fold_convert_loc (loc, type, tem);
8695 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
8696 Return NULL_TREE if no simplification can be made. */
8699 fold_builtin_memcmp (location_t loc, tree arg1, tree arg2, tree len)
8701 const char *p1, *p2;
8703 if (!validate_arg (arg1, POINTER_TYPE)
8704 || !validate_arg (arg2, POINTER_TYPE)
8705 || !validate_arg (len, INTEGER_TYPE))
8708 /* If the LEN parameter is zero, return zero. */
8709 if (integer_zerop (len))
8710 return omit_two_operands_loc (loc, integer_type_node, integer_zero_node,
8713 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8714 if (operand_equal_p (arg1, arg2, 0))
8715 return omit_one_operand_loc (loc, integer_type_node, integer_zero_node, len);
8717 p1 = c_getstr (arg1);
8718 p2 = c_getstr (arg2);
8720 /* If all arguments are constant, and the value of len is not greater
8721 than the lengths of arg1 and arg2, evaluate at compile-time. */
8722 if (host_integerp (len, 1) && p1 && p2
8723 && compare_tree_int (len, strlen (p1) + 1) <= 0
8724 && compare_tree_int (len, strlen (p2) + 1) <= 0)
8726 const int r = memcmp (p1, p2, tree_low_cst (len, 1));
8729 return integer_one_node;
8731 return integer_minus_one_node;
8733 return integer_zero_node;
8736 /* If len parameter is one, return an expression corresponding to
8737 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
8738 if (host_integerp (len, 1) && tree_low_cst (len, 1) == 1)
8740 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
8741 tree cst_uchar_ptr_node
8742 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
8745 = fold_convert_loc (loc, integer_type_node,
8746 build1 (INDIRECT_REF, cst_uchar_node,
8747 fold_convert_loc (loc,
8751 = fold_convert_loc (loc, integer_type_node,
8752 build1 (INDIRECT_REF, cst_uchar_node,
8753 fold_convert_loc (loc,
8756 return fold_build2_loc (loc, MINUS_EXPR, integer_type_node, ind1, ind2);
8762 /* Fold function call to builtin strcmp with arguments ARG1 and ARG2.
8763 Return NULL_TREE if no simplification can be made. */
8766 fold_builtin_strcmp (location_t loc, tree arg1, tree arg2)
8768 const char *p1, *p2;
8770 if (!validate_arg (arg1, POINTER_TYPE)
8771 || !validate_arg (arg2, POINTER_TYPE))
8774 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8775 if (operand_equal_p (arg1, arg2, 0))
8776 return integer_zero_node;
8778 p1 = c_getstr (arg1);
8779 p2 = c_getstr (arg2);
8783 const int i = strcmp (p1, p2);
8785 return integer_minus_one_node;
8787 return integer_one_node;
8789 return integer_zero_node;
8792 /* If the second arg is "", return *(const unsigned char*)arg1. */
8793 if (p2 && *p2 == '\0')
8795 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
8796 tree cst_uchar_ptr_node
8797 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
8799 return fold_convert_loc (loc, integer_type_node,
8800 build1 (INDIRECT_REF, cst_uchar_node,
8801 fold_convert_loc (loc,
8806 /* If the first arg is "", return -*(const unsigned char*)arg2. */
8807 if (p1 && *p1 == '\0')
8809 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
8810 tree cst_uchar_ptr_node
8811 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
8814 = fold_convert_loc (loc, integer_type_node,
8815 build1 (INDIRECT_REF, cst_uchar_node,
8816 fold_convert_loc (loc,
8819 return fold_build1_loc (loc, NEGATE_EXPR, integer_type_node, temp);
8825 /* Fold function call to builtin strncmp with arguments ARG1, ARG2, and LEN.
8826 Return NULL_TREE if no simplification can be made. */
8829 fold_builtin_strncmp (location_t loc, tree arg1, tree arg2, tree len)
8831 const char *p1, *p2;
8833 if (!validate_arg (arg1, POINTER_TYPE)
8834 || !validate_arg (arg2, POINTER_TYPE)
8835 || !validate_arg (len, INTEGER_TYPE))
8838 /* If the LEN parameter is zero, return zero. */
8839 if (integer_zerop (len))
8840 return omit_two_operands_loc (loc, integer_type_node, integer_zero_node,
8843 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8844 if (operand_equal_p (arg1, arg2, 0))
8845 return omit_one_operand_loc (loc, integer_type_node, integer_zero_node, len);
8847 p1 = c_getstr (arg1);
8848 p2 = c_getstr (arg2);
8850 if (host_integerp (len, 1) && p1 && p2)
8852 const int i = strncmp (p1, p2, tree_low_cst (len, 1));
8854 return integer_one_node;
8856 return integer_minus_one_node;
8858 return integer_zero_node;
8861 /* If the second arg is "", and the length is greater than zero,
8862 return *(const unsigned char*)arg1. */
8863 if (p2 && *p2 == '\0'
8864 && TREE_CODE (len) == INTEGER_CST
8865 && tree_int_cst_sgn (len) == 1)
8867 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
8868 tree cst_uchar_ptr_node
8869 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
8871 return fold_convert_loc (loc, integer_type_node,
8872 build1 (INDIRECT_REF, cst_uchar_node,
8873 fold_convert_loc (loc,
8878 /* If the first arg is "", and the length is greater than zero,
8879 return -*(const unsigned char*)arg2. */
8880 if (p1 && *p1 == '\0'
8881 && TREE_CODE (len) == INTEGER_CST
8882 && tree_int_cst_sgn (len) == 1)
8884 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
8885 tree cst_uchar_ptr_node
8886 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
8888 tree temp = fold_convert_loc (loc, integer_type_node,
8889 build1 (INDIRECT_REF, cst_uchar_node,
8890 fold_convert_loc (loc,
8893 return fold_build1_loc (loc, NEGATE_EXPR, integer_type_node, temp);
8896 /* If len parameter is one, return an expression corresponding to
8897 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
8898 if (host_integerp (len, 1) && tree_low_cst (len, 1) == 1)
8900 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
8901 tree cst_uchar_ptr_node
8902 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
8904 tree ind1 = fold_convert_loc (loc, integer_type_node,
8905 build1 (INDIRECT_REF, cst_uchar_node,
8906 fold_convert_loc (loc,
8909 tree ind2 = fold_convert_loc (loc, integer_type_node,
8910 build1 (INDIRECT_REF, cst_uchar_node,
8911 fold_convert_loc (loc,
8914 return fold_build2_loc (loc, MINUS_EXPR, integer_type_node, ind1, ind2);
8920 /* Fold function call to builtin signbit, signbitf or signbitl with argument
8921 ARG. Return NULL_TREE if no simplification can be made. */
8924 fold_builtin_signbit (location_t loc, tree arg, tree type)
8928 if (!validate_arg (arg, REAL_TYPE))
8931 /* If ARG is a compile-time constant, determine the result. */
8932 if (TREE_CODE (arg) == REAL_CST
8933 && !TREE_OVERFLOW (arg))
8937 c = TREE_REAL_CST (arg);
8938 temp = REAL_VALUE_NEGATIVE (c) ? integer_one_node : integer_zero_node;
8939 return fold_convert_loc (loc, type, temp);
8942 /* If ARG is non-negative, the result is always zero. */
8943 if (tree_expr_nonnegative_p (arg))
8944 return omit_one_operand_loc (loc, type, integer_zero_node, arg);
8946 /* If ARG's format doesn't have signed zeros, return "arg < 0.0". */
8947 if (!HONOR_SIGNED_ZEROS (TYPE_MODE (TREE_TYPE (arg))))
8948 return fold_build2_loc (loc, LT_EXPR, type, arg,
8949 build_real (TREE_TYPE (arg), dconst0));
8954 /* Fold function call to builtin copysign, copysignf or copysignl with
8955 arguments ARG1 and ARG2. Return NULL_TREE if no simplification can
8959 fold_builtin_copysign (location_t loc, tree fndecl,
8960 tree arg1, tree arg2, tree type)
8964 if (!validate_arg (arg1, REAL_TYPE)
8965 || !validate_arg (arg2, REAL_TYPE))
8968 /* copysign(X,X) is X. */
8969 if (operand_equal_p (arg1, arg2, 0))
8970 return fold_convert_loc (loc, type, arg1);
8972 /* If ARG1 and ARG2 are compile-time constants, determine the result. */
8973 if (TREE_CODE (arg1) == REAL_CST
8974 && TREE_CODE (arg2) == REAL_CST
8975 && !TREE_OVERFLOW (arg1)
8976 && !TREE_OVERFLOW (arg2))
8978 REAL_VALUE_TYPE c1, c2;
8980 c1 = TREE_REAL_CST (arg1);
8981 c2 = TREE_REAL_CST (arg2);
8982 /* c1.sign := c2.sign. */
8983 real_copysign (&c1, &c2);
8984 return build_real (type, c1);
8987 /* copysign(X, Y) is fabs(X) when Y is always non-negative.
8988 Remember to evaluate Y for side-effects. */
8989 if (tree_expr_nonnegative_p (arg2))
8990 return omit_one_operand_loc (loc, type,
8991 fold_build1_loc (loc, ABS_EXPR, type, arg1),
8994 /* Strip sign changing operations for the first argument. */
8995 tem = fold_strip_sign_ops (arg1);
8997 return build_call_expr_loc (loc, fndecl, 2, tem, arg2);
9002 /* Fold a call to builtin isascii with argument ARG. */
9005 fold_builtin_isascii (location_t loc, tree arg)
9007 if (!validate_arg (arg, INTEGER_TYPE))
9011 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
9012 arg = fold_build2 (BIT_AND_EXPR, integer_type_node, arg,
9013 build_int_cst (NULL_TREE,
9014 ~ (unsigned HOST_WIDE_INT) 0x7f));
9015 return fold_build2_loc (loc, EQ_EXPR, integer_type_node,
9016 arg, integer_zero_node);
9020 /* Fold a call to builtin toascii with argument ARG. */
9023 fold_builtin_toascii (location_t loc, tree arg)
9025 if (!validate_arg (arg, INTEGER_TYPE))
9028 /* Transform toascii(c) -> (c & 0x7f). */
9029 return fold_build2_loc (loc, BIT_AND_EXPR, integer_type_node, arg,
9030 build_int_cst (NULL_TREE, 0x7f));
9033 /* Fold a call to builtin isdigit with argument ARG. */
9036 fold_builtin_isdigit (location_t loc, tree arg)
9038 if (!validate_arg (arg, INTEGER_TYPE))
9042 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
9043 /* According to the C standard, isdigit is unaffected by locale.
9044 However, it definitely is affected by the target character set. */
9045 unsigned HOST_WIDE_INT target_digit0
9046 = lang_hooks.to_target_charset ('0');
9048 if (target_digit0 == 0)
9051 arg = fold_convert_loc (loc, unsigned_type_node, arg);
9052 arg = fold_build2 (MINUS_EXPR, unsigned_type_node, arg,
9053 build_int_cst (unsigned_type_node, target_digit0));
9054 return fold_build2_loc (loc, LE_EXPR, integer_type_node, arg,
9055 build_int_cst (unsigned_type_node, 9));
9059 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
9062 fold_builtin_fabs (location_t loc, tree arg, tree type)
9064 if (!validate_arg (arg, REAL_TYPE))
9067 arg = fold_convert_loc (loc, type, arg);
9068 if (TREE_CODE (arg) == REAL_CST)
9069 return fold_abs_const (arg, type);
9070 return fold_build1_loc (loc, ABS_EXPR, type, arg);
9073 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
9076 fold_builtin_abs (location_t loc, tree arg, tree type)
9078 if (!validate_arg (arg, INTEGER_TYPE))
9081 arg = fold_convert_loc (loc, type, arg);
9082 if (TREE_CODE (arg) == INTEGER_CST)
9083 return fold_abs_const (arg, type);
9084 return fold_build1_loc (loc, ABS_EXPR, type, arg);
9087 /* Fold a call to builtin fmin or fmax. */
9090 fold_builtin_fmin_fmax (location_t loc, tree arg0, tree arg1,
9091 tree type, bool max)
9093 if (validate_arg (arg0, REAL_TYPE) && validate_arg (arg1, REAL_TYPE))
9095 /* Calculate the result when the argument is a constant. */
9096 tree res = do_mpfr_arg2 (arg0, arg1, type, (max ? mpfr_max : mpfr_min));
9101 /* If either argument is NaN, return the other one. Avoid the
9102 transformation if we get (and honor) a signalling NaN. Using
9103 omit_one_operand() ensures we create a non-lvalue. */
9104 if (TREE_CODE (arg0) == REAL_CST
9105 && real_isnan (&TREE_REAL_CST (arg0))
9106 && (! HONOR_SNANS (TYPE_MODE (TREE_TYPE (arg0)))
9107 || ! TREE_REAL_CST (arg0).signalling))
9108 return omit_one_operand_loc (loc, type, arg1, arg0);
9109 if (TREE_CODE (arg1) == REAL_CST
9110 && real_isnan (&TREE_REAL_CST (arg1))
9111 && (! HONOR_SNANS (TYPE_MODE (TREE_TYPE (arg1)))
9112 || ! TREE_REAL_CST (arg1).signalling))
9113 return omit_one_operand_loc (loc, type, arg0, arg1);
9115 /* Transform fmin/fmax(x,x) -> x. */
9116 if (operand_equal_p (arg0, arg1, OEP_PURE_SAME))
9117 return omit_one_operand_loc (loc, type, arg0, arg1);
9119 /* Convert fmin/fmax to MIN_EXPR/MAX_EXPR. C99 requires these
9120 functions to return the numeric arg if the other one is NaN.
9121 These tree codes don't honor that, so only transform if
9122 -ffinite-math-only is set. C99 doesn't require -0.0 to be
9123 handled, so we don't have to worry about it either. */
9124 if (flag_finite_math_only)
9125 return fold_build2_loc (loc, (max ? MAX_EXPR : MIN_EXPR), type,
9126 fold_convert_loc (loc, type, arg0),
9127 fold_convert_loc (loc, type, arg1));
9132 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
9135 fold_builtin_carg (location_t loc, tree arg, tree type)
9137 if (validate_arg (arg, COMPLEX_TYPE)
9138 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) == REAL_TYPE)
9140 tree atan2_fn = mathfn_built_in (type, BUILT_IN_ATAN2);
9144 tree new_arg = builtin_save_expr (arg);
9145 tree r_arg = fold_build1_loc (loc, REALPART_EXPR, type, new_arg);
9146 tree i_arg = fold_build1_loc (loc, IMAGPART_EXPR, type, new_arg);
9147 return build_call_expr_loc (loc, atan2_fn, 2, i_arg, r_arg);
9154 /* Fold a call to builtin logb/ilogb. */
9157 fold_builtin_logb (location_t loc, tree arg, tree rettype)
9159 if (! validate_arg (arg, REAL_TYPE))
9164 if (TREE_CODE (arg) == REAL_CST && ! TREE_OVERFLOW (arg))
9166 const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (arg);
9172 /* If arg is Inf or NaN and we're logb, return it. */
9173 if (TREE_CODE (rettype) == REAL_TYPE)
9174 return fold_convert_loc (loc, rettype, arg);
9175 /* Fall through... */
9177 /* Zero may set errno and/or raise an exception for logb, also
9178 for ilogb we don't know FP_ILOGB0. */
9181 /* For normal numbers, proceed iff radix == 2. In GCC,
9182 normalized significands are in the range [0.5, 1.0). We
9183 want the exponent as if they were [1.0, 2.0) so get the
9184 exponent and subtract 1. */
9185 if (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (arg)))->b == 2)
9186 return fold_convert_loc (loc, rettype,
9187 build_int_cst (NULL_TREE,
9188 REAL_EXP (value)-1));
9196 /* Fold a call to builtin significand, if radix == 2. */
9199 fold_builtin_significand (location_t loc, tree arg, tree rettype)
9201 if (! validate_arg (arg, REAL_TYPE))
9206 if (TREE_CODE (arg) == REAL_CST && ! TREE_OVERFLOW (arg))
9208 const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (arg);
9215 /* If arg is +-0, +-Inf or +-NaN, then return it. */
9216 return fold_convert_loc (loc, rettype, arg);
9218 /* For normal numbers, proceed iff radix == 2. */
9219 if (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (arg)))->b == 2)
9221 REAL_VALUE_TYPE result = *value;
9222 /* In GCC, normalized significands are in the range [0.5,
9223 1.0). We want them to be [1.0, 2.0) so set the
9225 SET_REAL_EXP (&result, 1);
9226 return build_real (rettype, result);
9235 /* Fold a call to builtin frexp, we can assume the base is 2. */
9238 fold_builtin_frexp (location_t loc, tree arg0, tree arg1, tree rettype)
9240 if (! validate_arg (arg0, REAL_TYPE) || ! validate_arg (arg1, POINTER_TYPE))
9245 if (!(TREE_CODE (arg0) == REAL_CST && ! TREE_OVERFLOW (arg0)))
9248 arg1 = build_fold_indirect_ref_loc (loc, arg1);
9250 /* Proceed if a valid pointer type was passed in. */
9251 if (TYPE_MAIN_VARIANT (TREE_TYPE (arg1)) == integer_type_node)
9253 const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (arg0);
9259 /* For +-0, return (*exp = 0, +-0). */
9260 exp = integer_zero_node;
9265 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
9266 return omit_one_operand_loc (loc, rettype, arg0, arg1);
9269 /* Since the frexp function always expects base 2, and in
9270 GCC normalized significands are already in the range
9271 [0.5, 1.0), we have exactly what frexp wants. */
9272 REAL_VALUE_TYPE frac_rvt = *value;
9273 SET_REAL_EXP (&frac_rvt, 0);
9274 frac = build_real (rettype, frac_rvt);
9275 exp = build_int_cst (NULL_TREE, REAL_EXP (value));
9282 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
9283 arg1 = fold_build2_loc (loc, MODIFY_EXPR, rettype, arg1, exp);
9284 TREE_SIDE_EFFECTS (arg1) = 1;
9285 return fold_build2_loc (loc, COMPOUND_EXPR, rettype, arg1, frac);
9291 /* Fold a call to builtin ldexp or scalbn/scalbln. If LDEXP is true
9292 then we can assume the base is two. If it's false, then we have to
9293 check the mode of the TYPE parameter in certain cases. */
9296 fold_builtin_load_exponent (location_t loc, tree arg0, tree arg1,
9297 tree type, bool ldexp)
9299 if (validate_arg (arg0, REAL_TYPE) && validate_arg (arg1, INTEGER_TYPE))
9304 /* If arg0 is 0, Inf or NaN, or if arg1 is 0, then return arg0. */
9305 if (real_zerop (arg0) || integer_zerop (arg1)
9306 || (TREE_CODE (arg0) == REAL_CST
9307 && !real_isfinite (&TREE_REAL_CST (arg0))))
9308 return omit_one_operand_loc (loc, type, arg0, arg1);
9310 /* If both arguments are constant, then try to evaluate it. */
9311 if ((ldexp || REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2)
9312 && TREE_CODE (arg0) == REAL_CST && !TREE_OVERFLOW (arg0)
9313 && host_integerp (arg1, 0))
9315 /* Bound the maximum adjustment to twice the range of the
9316 mode's valid exponents. Use abs to ensure the range is
9317 positive as a sanity check. */
9318 const long max_exp_adj = 2 *
9319 labs (REAL_MODE_FORMAT (TYPE_MODE (type))->emax
9320 - REAL_MODE_FORMAT (TYPE_MODE (type))->emin);
9322 /* Get the user-requested adjustment. */
9323 const HOST_WIDE_INT req_exp_adj = tree_low_cst (arg1, 0);
9325 /* The requested adjustment must be inside this range. This
9326 is a preliminary cap to avoid things like overflow, we
9327 may still fail to compute the result for other reasons. */
9328 if (-max_exp_adj < req_exp_adj && req_exp_adj < max_exp_adj)
9330 REAL_VALUE_TYPE initial_result;
9332 real_ldexp (&initial_result, &TREE_REAL_CST (arg0), req_exp_adj);
9334 /* Ensure we didn't overflow. */
9335 if (! real_isinf (&initial_result))
9337 const REAL_VALUE_TYPE trunc_result
9338 = real_value_truncate (TYPE_MODE (type), initial_result);
9340 /* Only proceed if the target mode can hold the
9342 if (REAL_VALUES_EQUAL (initial_result, trunc_result))
9343 return build_real (type, trunc_result);
9352 /* Fold a call to builtin modf. */
9355 fold_builtin_modf (location_t loc, tree arg0, tree arg1, tree rettype)
9357 if (! validate_arg (arg0, REAL_TYPE) || ! validate_arg (arg1, POINTER_TYPE))
9362 if (!(TREE_CODE (arg0) == REAL_CST && ! TREE_OVERFLOW (arg0)))
9365 arg1 = build_fold_indirect_ref_loc (loc, arg1);
9367 /* Proceed if a valid pointer type was passed in. */
9368 if (TYPE_MAIN_VARIANT (TREE_TYPE (arg1)) == TYPE_MAIN_VARIANT (rettype))
9370 const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (arg0);
9371 REAL_VALUE_TYPE trunc, frac;
9377 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
9378 trunc = frac = *value;
9381 /* For +-Inf, return (*arg1 = arg0, +-0). */
9383 frac.sign = value->sign;
9387 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
9388 real_trunc (&trunc, VOIDmode, value);
9389 real_arithmetic (&frac, MINUS_EXPR, value, &trunc);
9390 /* If the original number was negative and already
9391 integral, then the fractional part is -0.0. */
9392 if (value->sign && frac.cl == rvc_zero)
9393 frac.sign = value->sign;
9397 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
9398 arg1 = fold_build2_loc (loc, MODIFY_EXPR, rettype, arg1,
9399 build_real (rettype, trunc));
9400 TREE_SIDE_EFFECTS (arg1) = 1;
9401 return fold_build2_loc (loc, COMPOUND_EXPR, rettype, arg1,
9402 build_real (rettype, frac));
9408 /* Given a location LOC, an interclass builtin function decl FNDECL
9409 and its single argument ARG, return an folded expression computing
9410 the same, or NULL_TREE if we either couldn't or didn't want to fold
9411 (the latter happen if there's an RTL instruction available). */
9414 fold_builtin_interclass_mathfn (location_t loc, tree fndecl, tree arg)
9416 enum machine_mode mode;
9418 if (!validate_arg (arg, REAL_TYPE))
9421 if (interclass_mathfn_icode (arg, fndecl) != CODE_FOR_nothing)
9424 mode = TYPE_MODE (TREE_TYPE (arg));
9426 /* If there is no optab, try generic code. */
9427 switch (DECL_FUNCTION_CODE (fndecl))
9431 CASE_FLT_FN (BUILT_IN_ISINF):
9433 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
9434 tree const isgr_fn = built_in_decls[BUILT_IN_ISGREATER];
9435 tree const type = TREE_TYPE (arg);
9439 get_max_float (REAL_MODE_FORMAT (mode), buf, sizeof (buf));
9440 real_from_string (&r, buf);
9441 result = build_call_expr (isgr_fn, 2,
9442 fold_build1_loc (loc, ABS_EXPR, type, arg),
9443 build_real (type, r));
9446 CASE_FLT_FN (BUILT_IN_FINITE):
9447 case BUILT_IN_ISFINITE:
9449 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
9450 tree const isle_fn = built_in_decls[BUILT_IN_ISLESSEQUAL];
9451 tree const type = TREE_TYPE (arg);
9455 get_max_float (REAL_MODE_FORMAT (mode), buf, sizeof (buf));
9456 real_from_string (&r, buf);
9457 result = build_call_expr (isle_fn, 2,
9458 fold_build1_loc (loc, ABS_EXPR, type, arg),
9459 build_real (type, r));
9460 /*result = fold_build2_loc (loc, UNGT_EXPR,
9461 TREE_TYPE (TREE_TYPE (fndecl)),
9462 fold_build1_loc (loc, ABS_EXPR, type, arg),
9463 build_real (type, r));
9464 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
9465 TREE_TYPE (TREE_TYPE (fndecl)),
9469 case BUILT_IN_ISNORMAL:
9471 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
9472 islessequal(fabs(x),DBL_MAX). */
9473 tree const isle_fn = built_in_decls[BUILT_IN_ISLESSEQUAL];
9474 tree const isge_fn = built_in_decls[BUILT_IN_ISGREATEREQUAL];
9475 tree const type = TREE_TYPE (arg);
9476 REAL_VALUE_TYPE rmax, rmin;
9479 get_max_float (REAL_MODE_FORMAT (mode), buf, sizeof (buf));
9480 real_from_string (&rmax, buf);
9481 sprintf (buf, "0x1p%d", REAL_MODE_FORMAT (mode)->emin - 1);
9482 real_from_string (&rmin, buf);
9483 arg = builtin_save_expr (fold_build1_loc (loc, ABS_EXPR, type, arg));
9484 result = build_call_expr (isle_fn, 2, arg,
9485 build_real (type, rmax));
9486 result = fold_build2 (BIT_AND_EXPR, integer_type_node, result,
9487 build_call_expr (isge_fn, 2, arg,
9488 build_real (type, rmin)));
9498 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
9499 ARG is the argument for the call. */
9502 fold_builtin_classify (location_t loc, tree fndecl, tree arg, int builtin_index)
9504 tree type = TREE_TYPE (TREE_TYPE (fndecl));
9507 if (!validate_arg (arg, REAL_TYPE))
9510 switch (builtin_index)
9512 case BUILT_IN_ISINF:
9513 if (!HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (arg))))
9514 return omit_one_operand_loc (loc, type, integer_zero_node, arg);
9516 if (TREE_CODE (arg) == REAL_CST)
9518 r = TREE_REAL_CST (arg);
9519 if (real_isinf (&r))
9520 return real_compare (GT_EXPR, &r, &dconst0)
9521 ? integer_one_node : integer_minus_one_node;
9523 return integer_zero_node;
9528 case BUILT_IN_ISINF_SIGN:
9530 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
9531 /* In a boolean context, GCC will fold the inner COND_EXPR to
9532 1. So e.g. "if (isinf_sign(x))" would be folded to just
9533 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
9534 tree signbit_fn = mathfn_built_in_1 (TREE_TYPE (arg), BUILT_IN_SIGNBIT, 0);
9535 tree isinf_fn = built_in_decls[BUILT_IN_ISINF];
9536 tree tmp = NULL_TREE;
9538 arg = builtin_save_expr (arg);
9540 if (signbit_fn && isinf_fn)
9542 tree signbit_call = build_call_expr_loc (loc, signbit_fn, 1, arg);
9543 tree isinf_call = build_call_expr_loc (loc, isinf_fn, 1, arg);
9545 signbit_call = fold_build2_loc (loc, NE_EXPR, integer_type_node,
9546 signbit_call, integer_zero_node);
9547 isinf_call = fold_build2_loc (loc, NE_EXPR, integer_type_node,
9548 isinf_call, integer_zero_node);
9550 tmp = fold_build3_loc (loc, COND_EXPR, integer_type_node, signbit_call,
9551 integer_minus_one_node, integer_one_node);
9552 tmp = fold_build3_loc (loc, COND_EXPR, integer_type_node,
9560 case BUILT_IN_ISFINITE:
9561 if (!HONOR_NANS (TYPE_MODE (TREE_TYPE (arg)))
9562 && !HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (arg))))
9563 return omit_one_operand_loc (loc, type, integer_one_node, arg);
9565 if (TREE_CODE (arg) == REAL_CST)
9567 r = TREE_REAL_CST (arg);
9568 return real_isfinite (&r) ? integer_one_node : integer_zero_node;
9573 case BUILT_IN_ISNAN:
9574 if (!HONOR_NANS (TYPE_MODE (TREE_TYPE (arg))))
9575 return omit_one_operand_loc (loc, type, integer_zero_node, arg);
9577 if (TREE_CODE (arg) == REAL_CST)
9579 r = TREE_REAL_CST (arg);
9580 return real_isnan (&r) ? integer_one_node : integer_zero_node;
9583 arg = builtin_save_expr (arg);
9584 return fold_build2_loc (loc, UNORDERED_EXPR, type, arg, arg);
9591 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
9592 This builtin will generate code to return the appropriate floating
9593 point classification depending on the value of the floating point
9594 number passed in. The possible return values must be supplied as
9595 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
9596 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
9597 one floating point argument which is "type generic". */
9600 fold_builtin_fpclassify (location_t loc, tree exp)
9602 tree fp_nan, fp_infinite, fp_normal, fp_subnormal, fp_zero,
9603 arg, type, res, tmp;
9604 enum machine_mode mode;
9608 /* Verify the required arguments in the original call. */
9609 if (!validate_arglist (exp, INTEGER_TYPE, INTEGER_TYPE,
9610 INTEGER_TYPE, INTEGER_TYPE,
9611 INTEGER_TYPE, REAL_TYPE, VOID_TYPE))
9614 fp_nan = CALL_EXPR_ARG (exp, 0);
9615 fp_infinite = CALL_EXPR_ARG (exp, 1);
9616 fp_normal = CALL_EXPR_ARG (exp, 2);
9617 fp_subnormal = CALL_EXPR_ARG (exp, 3);
9618 fp_zero = CALL_EXPR_ARG (exp, 4);
9619 arg = CALL_EXPR_ARG (exp, 5);
9620 type = TREE_TYPE (arg);
9621 mode = TYPE_MODE (type);
9622 arg = builtin_save_expr (fold_build1_loc (loc, ABS_EXPR, type, arg));
9626 (fabs(x) == Inf ? FP_INFINITE :
9627 (fabs(x) >= DBL_MIN ? FP_NORMAL :
9628 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
9630 tmp = fold_build2_loc (loc, EQ_EXPR, integer_type_node, arg,
9631 build_real (type, dconst0));
9632 res = fold_build3_loc (loc, COND_EXPR, integer_type_node,
9633 tmp, fp_zero, fp_subnormal);
9635 sprintf (buf, "0x1p%d", REAL_MODE_FORMAT (mode)->emin - 1);
9636 real_from_string (&r, buf);
9637 tmp = fold_build2_loc (loc, GE_EXPR, integer_type_node,
9638 arg, build_real (type, r));
9639 res = fold_build3_loc (loc, COND_EXPR, integer_type_node, tmp, fp_normal, res);
9641 if (HONOR_INFINITIES (mode))
9644 tmp = fold_build2_loc (loc, EQ_EXPR, integer_type_node, arg,
9645 build_real (type, r));
9646 res = fold_build3_loc (loc, COND_EXPR, integer_type_node, tmp,
9650 if (HONOR_NANS (mode))
9652 tmp = fold_build2_loc (loc, ORDERED_EXPR, integer_type_node, arg, arg);
9653 res = fold_build3_loc (loc, COND_EXPR, integer_type_node, tmp, res, fp_nan);
9659 /* Fold a call to an unordered comparison function such as
9660 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
9661 being called and ARG0 and ARG1 are the arguments for the call.
9662 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
9663 the opposite of the desired result. UNORDERED_CODE is used
9664 for modes that can hold NaNs and ORDERED_CODE is used for
9668 fold_builtin_unordered_cmp (location_t loc, tree fndecl, tree arg0, tree arg1,
9669 enum tree_code unordered_code,
9670 enum tree_code ordered_code)
9672 tree type = TREE_TYPE (TREE_TYPE (fndecl));
9673 enum tree_code code;
9675 enum tree_code code0, code1;
9676 tree cmp_type = NULL_TREE;
9678 type0 = TREE_TYPE (arg0);
9679 type1 = TREE_TYPE (arg1);
9681 code0 = TREE_CODE (type0);
9682 code1 = TREE_CODE (type1);
9684 if (code0 == REAL_TYPE && code1 == REAL_TYPE)
9685 /* Choose the wider of two real types. */
9686 cmp_type = TYPE_PRECISION (type0) >= TYPE_PRECISION (type1)
9688 else if (code0 == REAL_TYPE && code1 == INTEGER_TYPE)
9690 else if (code0 == INTEGER_TYPE && code1 == REAL_TYPE)
9693 arg0 = fold_convert_loc (loc, cmp_type, arg0);
9694 arg1 = fold_convert_loc (loc, cmp_type, arg1);
9696 if (unordered_code == UNORDERED_EXPR)
9698 if (!HONOR_NANS (TYPE_MODE (TREE_TYPE (arg0))))
9699 return omit_two_operands_loc (loc, type, integer_zero_node, arg0, arg1);
9700 return fold_build2_loc (loc, UNORDERED_EXPR, type, arg0, arg1);
9703 code = HONOR_NANS (TYPE_MODE (TREE_TYPE (arg0))) ? unordered_code
9705 return fold_build1_loc (loc, TRUTH_NOT_EXPR, type,
9706 fold_build2_loc (loc, code, type, arg0, arg1));
9709 /* Fold a call to built-in function FNDECL with 0 arguments.
9710 IGNORE is true if the result of the function call is ignored. This
9711 function returns NULL_TREE if no simplification was possible. */
9714 fold_builtin_0 (location_t loc, tree fndecl, bool ignore ATTRIBUTE_UNUSED)
9716 tree type = TREE_TYPE (TREE_TYPE (fndecl));
9717 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
9720 CASE_FLT_FN (BUILT_IN_INF):
9721 case BUILT_IN_INFD32:
9722 case BUILT_IN_INFD64:
9723 case BUILT_IN_INFD128:
9724 return fold_builtin_inf (loc, type, true);
9726 CASE_FLT_FN (BUILT_IN_HUGE_VAL):
9727 return fold_builtin_inf (loc, type, false);
9729 case BUILT_IN_CLASSIFY_TYPE:
9730 return fold_builtin_classify_type (NULL_TREE);
9738 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
9739 IGNORE is true if the result of the function call is ignored. This
9740 function returns NULL_TREE if no simplification was possible. */
9743 fold_builtin_1 (location_t loc, tree fndecl, tree arg0, bool ignore)
9745 tree type = TREE_TYPE (TREE_TYPE (fndecl));
9746 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
9750 case BUILT_IN_CONSTANT_P:
9752 tree val = fold_builtin_constant_p (arg0);
9754 /* Gimplification will pull the CALL_EXPR for the builtin out of
9755 an if condition. When not optimizing, we'll not CSE it back.
9756 To avoid link error types of regressions, return false now. */
9757 if (!val && !optimize)
9758 val = integer_zero_node;
9763 case BUILT_IN_CLASSIFY_TYPE:
9764 return fold_builtin_classify_type (arg0);
9766 case BUILT_IN_STRLEN:
9767 return fold_builtin_strlen (loc, type, arg0);
9769 CASE_FLT_FN (BUILT_IN_FABS):
9770 return fold_builtin_fabs (loc, arg0, type);
9774 case BUILT_IN_LLABS:
9775 case BUILT_IN_IMAXABS:
9776 return fold_builtin_abs (loc, arg0, type);
9778 CASE_FLT_FN (BUILT_IN_CONJ):
9779 if (validate_arg (arg0, COMPLEX_TYPE)
9780 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
9781 return fold_build1_loc (loc, CONJ_EXPR, type, arg0);
9784 CASE_FLT_FN (BUILT_IN_CREAL):
9785 if (validate_arg (arg0, COMPLEX_TYPE)
9786 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
9787 return non_lvalue_loc (loc, fold_build1_loc (loc, REALPART_EXPR, type, arg0));;
9790 CASE_FLT_FN (BUILT_IN_CIMAG):
9791 if (validate_arg (arg0, COMPLEX_TYPE)
9792 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
9793 return non_lvalue_loc (loc, fold_build1_loc (loc, IMAGPART_EXPR, type, arg0));
9796 CASE_FLT_FN (BUILT_IN_CCOS):
9797 return fold_builtin_ccos(loc, arg0, type, fndecl, /*hyper=*/ false);
9799 CASE_FLT_FN (BUILT_IN_CCOSH):
9800 return fold_builtin_ccos(loc, arg0, type, fndecl, /*hyper=*/ true);
9802 CASE_FLT_FN (BUILT_IN_CSIN):
9803 if (validate_arg (arg0, COMPLEX_TYPE)
9804 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
9805 return do_mpc_arg1 (arg0, type, mpc_sin);
9808 CASE_FLT_FN (BUILT_IN_CSINH):
9809 if (validate_arg (arg0, COMPLEX_TYPE)
9810 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
9811 return do_mpc_arg1 (arg0, type, mpc_sinh);
9814 CASE_FLT_FN (BUILT_IN_CTAN):
9815 if (validate_arg (arg0, COMPLEX_TYPE)
9816 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
9817 return do_mpc_arg1 (arg0, type, mpc_tan);
9820 CASE_FLT_FN (BUILT_IN_CTANH):
9821 if (validate_arg (arg0, COMPLEX_TYPE)
9822 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
9823 return do_mpc_arg1 (arg0, type, mpc_tanh);
9826 CASE_FLT_FN (BUILT_IN_CLOG):
9827 if (validate_arg (arg0, COMPLEX_TYPE)
9828 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
9829 return do_mpc_arg1 (arg0, type, mpc_log);
9832 CASE_FLT_FN (BUILT_IN_CSQRT):
9833 if (validate_arg (arg0, COMPLEX_TYPE)
9834 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
9835 return do_mpc_arg1 (arg0, type, mpc_sqrt);
9838 CASE_FLT_FN (BUILT_IN_CASIN):
9839 if (validate_arg (arg0, COMPLEX_TYPE)
9840 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
9841 return do_mpc_arg1 (arg0, type, mpc_asin);
9844 CASE_FLT_FN (BUILT_IN_CACOS):
9845 if (validate_arg (arg0, COMPLEX_TYPE)
9846 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
9847 return do_mpc_arg1 (arg0, type, mpc_acos);
9850 CASE_FLT_FN (BUILT_IN_CATAN):
9851 if (validate_arg (arg0, COMPLEX_TYPE)
9852 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
9853 return do_mpc_arg1 (arg0, type, mpc_atan);
9856 CASE_FLT_FN (BUILT_IN_CASINH):
9857 if (validate_arg (arg0, COMPLEX_TYPE)
9858 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
9859 return do_mpc_arg1 (arg0, type, mpc_asinh);
9862 CASE_FLT_FN (BUILT_IN_CACOSH):
9863 if (validate_arg (arg0, COMPLEX_TYPE)
9864 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
9865 return do_mpc_arg1 (arg0, type, mpc_acosh);
9868 CASE_FLT_FN (BUILT_IN_CATANH):
9869 if (validate_arg (arg0, COMPLEX_TYPE)
9870 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
9871 return do_mpc_arg1 (arg0, type, mpc_atanh);
9874 CASE_FLT_FN (BUILT_IN_CABS):
9875 return fold_builtin_cabs (loc, arg0, type, fndecl);
9877 CASE_FLT_FN (BUILT_IN_CARG):
9878 return fold_builtin_carg (loc, arg0, type);
9880 CASE_FLT_FN (BUILT_IN_SQRT):
9881 return fold_builtin_sqrt (loc, arg0, type);
9883 CASE_FLT_FN (BUILT_IN_CBRT):
9884 return fold_builtin_cbrt (loc, arg0, type);
9886 CASE_FLT_FN (BUILT_IN_ASIN):
9887 if (validate_arg (arg0, REAL_TYPE))
9888 return do_mpfr_arg1 (arg0, type, mpfr_asin,
9889 &dconstm1, &dconst1, true);
9892 CASE_FLT_FN (BUILT_IN_ACOS):
9893 if (validate_arg (arg0, REAL_TYPE))
9894 return do_mpfr_arg1 (arg0, type, mpfr_acos,
9895 &dconstm1, &dconst1, true);
9898 CASE_FLT_FN (BUILT_IN_ATAN):
9899 if (validate_arg (arg0, REAL_TYPE))
9900 return do_mpfr_arg1 (arg0, type, mpfr_atan, NULL, NULL, 0);
9903 CASE_FLT_FN (BUILT_IN_ASINH):
9904 if (validate_arg (arg0, REAL_TYPE))
9905 return do_mpfr_arg1 (arg0, type, mpfr_asinh, NULL, NULL, 0);
9908 CASE_FLT_FN (BUILT_IN_ACOSH):
9909 if (validate_arg (arg0, REAL_TYPE))
9910 return do_mpfr_arg1 (arg0, type, mpfr_acosh,
9911 &dconst1, NULL, true);
9914 CASE_FLT_FN (BUILT_IN_ATANH):
9915 if (validate_arg (arg0, REAL_TYPE))
9916 return do_mpfr_arg1 (arg0, type, mpfr_atanh,
9917 &dconstm1, &dconst1, false);
9920 CASE_FLT_FN (BUILT_IN_SIN):
9921 if (validate_arg (arg0, REAL_TYPE))
9922 return do_mpfr_arg1 (arg0, type, mpfr_sin, NULL, NULL, 0);
9925 CASE_FLT_FN (BUILT_IN_COS):
9926 return fold_builtin_cos (loc, arg0, type, fndecl);
9928 CASE_FLT_FN (BUILT_IN_TAN):
9929 return fold_builtin_tan (arg0, type);
9931 CASE_FLT_FN (BUILT_IN_CEXP):
9932 return fold_builtin_cexp (loc, arg0, type);
9934 CASE_FLT_FN (BUILT_IN_CEXPI):
9935 if (validate_arg (arg0, REAL_TYPE))
9936 return do_mpfr_sincos (arg0, NULL_TREE, NULL_TREE);
9939 CASE_FLT_FN (BUILT_IN_SINH):
9940 if (validate_arg (arg0, REAL_TYPE))
9941 return do_mpfr_arg1 (arg0, type, mpfr_sinh, NULL, NULL, 0);
9944 CASE_FLT_FN (BUILT_IN_COSH):
9945 return fold_builtin_cosh (loc, arg0, type, fndecl);
9947 CASE_FLT_FN (BUILT_IN_TANH):
9948 if (validate_arg (arg0, REAL_TYPE))
9949 return do_mpfr_arg1 (arg0, type, mpfr_tanh, NULL, NULL, 0);
9952 CASE_FLT_FN (BUILT_IN_ERF):
9953 if (validate_arg (arg0, REAL_TYPE))
9954 return do_mpfr_arg1 (arg0, type, mpfr_erf, NULL, NULL, 0);
9957 CASE_FLT_FN (BUILT_IN_ERFC):
9958 if (validate_arg (arg0, REAL_TYPE))
9959 return do_mpfr_arg1 (arg0, type, mpfr_erfc, NULL, NULL, 0);
9962 CASE_FLT_FN (BUILT_IN_TGAMMA):
9963 if (validate_arg (arg0, REAL_TYPE))
9964 return do_mpfr_arg1 (arg0, type, mpfr_gamma, NULL, NULL, 0);
9967 CASE_FLT_FN (BUILT_IN_EXP):
9968 return fold_builtin_exponent (loc, fndecl, arg0, mpfr_exp);
9970 CASE_FLT_FN (BUILT_IN_EXP2):
9971 return fold_builtin_exponent (loc, fndecl, arg0, mpfr_exp2);
9973 CASE_FLT_FN (BUILT_IN_EXP10):
9974 CASE_FLT_FN (BUILT_IN_POW10):
9975 return fold_builtin_exponent (loc, fndecl, arg0, mpfr_exp10);
9977 CASE_FLT_FN (BUILT_IN_EXPM1):
9978 if (validate_arg (arg0, REAL_TYPE))
9979 return do_mpfr_arg1 (arg0, type, mpfr_expm1, NULL, NULL, 0);
9982 CASE_FLT_FN (BUILT_IN_LOG):
9983 return fold_builtin_logarithm (loc, fndecl, arg0, mpfr_log);
9985 CASE_FLT_FN (BUILT_IN_LOG2):
9986 return fold_builtin_logarithm (loc, fndecl, arg0, mpfr_log2);
9988 CASE_FLT_FN (BUILT_IN_LOG10):
9989 return fold_builtin_logarithm (loc, fndecl, arg0, mpfr_log10);
9991 CASE_FLT_FN (BUILT_IN_LOG1P):
9992 if (validate_arg (arg0, REAL_TYPE))
9993 return do_mpfr_arg1 (arg0, type, mpfr_log1p,
9994 &dconstm1, NULL, false);
9997 CASE_FLT_FN (BUILT_IN_J0):
9998 if (validate_arg (arg0, REAL_TYPE))
9999 return do_mpfr_arg1 (arg0, type, mpfr_j0,
10003 CASE_FLT_FN (BUILT_IN_J1):
10004 if (validate_arg (arg0, REAL_TYPE))
10005 return do_mpfr_arg1 (arg0, type, mpfr_j1,
10009 CASE_FLT_FN (BUILT_IN_Y0):
10010 if (validate_arg (arg0, REAL_TYPE))
10011 return do_mpfr_arg1 (arg0, type, mpfr_y0,
10012 &dconst0, NULL, false);
10015 CASE_FLT_FN (BUILT_IN_Y1):
10016 if (validate_arg (arg0, REAL_TYPE))
10017 return do_mpfr_arg1 (arg0, type, mpfr_y1,
10018 &dconst0, NULL, false);
10021 CASE_FLT_FN (BUILT_IN_NAN):
10022 case BUILT_IN_NAND32:
10023 case BUILT_IN_NAND64:
10024 case BUILT_IN_NAND128:
10025 return fold_builtin_nan (arg0, type, true);
10027 CASE_FLT_FN (BUILT_IN_NANS):
10028 return fold_builtin_nan (arg0, type, false);
10030 CASE_FLT_FN (BUILT_IN_FLOOR):
10031 return fold_builtin_floor (loc, fndecl, arg0);
10033 CASE_FLT_FN (BUILT_IN_CEIL):
10034 return fold_builtin_ceil (loc, fndecl, arg0);
10036 CASE_FLT_FN (BUILT_IN_TRUNC):
10037 return fold_builtin_trunc (loc, fndecl, arg0);
10039 CASE_FLT_FN (BUILT_IN_ROUND):
10040 return fold_builtin_round (loc, fndecl, arg0);
10042 CASE_FLT_FN (BUILT_IN_NEARBYINT):
10043 CASE_FLT_FN (BUILT_IN_RINT):
10044 return fold_trunc_transparent_mathfn (loc, fndecl, arg0);
10046 CASE_FLT_FN (BUILT_IN_LCEIL):
10047 CASE_FLT_FN (BUILT_IN_LLCEIL):
10048 CASE_FLT_FN (BUILT_IN_LFLOOR):
10049 CASE_FLT_FN (BUILT_IN_LLFLOOR):
10050 CASE_FLT_FN (BUILT_IN_LROUND):
10051 CASE_FLT_FN (BUILT_IN_LLROUND):
10052 return fold_builtin_int_roundingfn (loc, fndecl, arg0);
10054 CASE_FLT_FN (BUILT_IN_LRINT):
10055 CASE_FLT_FN (BUILT_IN_LLRINT):
10056 return fold_fixed_mathfn (loc, fndecl, arg0);
10058 case BUILT_IN_BSWAP32:
10059 case BUILT_IN_BSWAP64:
10060 return fold_builtin_bswap (fndecl, arg0);
10062 CASE_INT_FN (BUILT_IN_FFS):
10063 CASE_INT_FN (BUILT_IN_CLZ):
10064 CASE_INT_FN (BUILT_IN_CTZ):
10065 CASE_INT_FN (BUILT_IN_POPCOUNT):
10066 CASE_INT_FN (BUILT_IN_PARITY):
10067 return fold_builtin_bitop (fndecl, arg0);
10069 CASE_FLT_FN (BUILT_IN_SIGNBIT):
10070 return fold_builtin_signbit (loc, arg0, type);
10072 CASE_FLT_FN (BUILT_IN_SIGNIFICAND):
10073 return fold_builtin_significand (loc, arg0, type);
10075 CASE_FLT_FN (BUILT_IN_ILOGB):
10076 CASE_FLT_FN (BUILT_IN_LOGB):
10077 return fold_builtin_logb (loc, arg0, type);
10079 case BUILT_IN_ISASCII:
10080 return fold_builtin_isascii (loc, arg0);
10082 case BUILT_IN_TOASCII:
10083 return fold_builtin_toascii (loc, arg0);
10085 case BUILT_IN_ISDIGIT:
10086 return fold_builtin_isdigit (loc, arg0);
10088 CASE_FLT_FN (BUILT_IN_FINITE):
10089 case BUILT_IN_FINITED32:
10090 case BUILT_IN_FINITED64:
10091 case BUILT_IN_FINITED128:
10092 case BUILT_IN_ISFINITE:
10094 tree ret = fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISFINITE);
10097 return fold_builtin_interclass_mathfn (loc, fndecl, arg0);
10100 CASE_FLT_FN (BUILT_IN_ISINF):
10101 case BUILT_IN_ISINFD32:
10102 case BUILT_IN_ISINFD64:
10103 case BUILT_IN_ISINFD128:
10105 tree ret = fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISINF);
10108 return fold_builtin_interclass_mathfn (loc, fndecl, arg0);
10111 case BUILT_IN_ISNORMAL:
10112 return fold_builtin_interclass_mathfn (loc, fndecl, arg0);
10114 case BUILT_IN_ISINF_SIGN:
10115 return fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISINF_SIGN);
10117 CASE_FLT_FN (BUILT_IN_ISNAN):
10118 case BUILT_IN_ISNAND32:
10119 case BUILT_IN_ISNAND64:
10120 case BUILT_IN_ISNAND128:
10121 return fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISNAN);
10123 case BUILT_IN_PRINTF:
10124 case BUILT_IN_PRINTF_UNLOCKED:
10125 case BUILT_IN_VPRINTF:
10126 return fold_builtin_printf (loc, fndecl, arg0, NULL_TREE, ignore, fcode);
10136 /* Fold a call to built-in function FNDECL with 2 arguments, ARG0 and ARG1.
10137 IGNORE is true if the result of the function call is ignored. This
10138 function returns NULL_TREE if no simplification was possible. */
10141 fold_builtin_2 (location_t loc, tree fndecl, tree arg0, tree arg1, bool ignore)
10143 tree type = TREE_TYPE (TREE_TYPE (fndecl));
10144 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
10148 CASE_FLT_FN (BUILT_IN_JN):
10149 if (validate_arg (arg0, INTEGER_TYPE)
10150 && validate_arg (arg1, REAL_TYPE))
10151 return do_mpfr_bessel_n (arg0, arg1, type, mpfr_jn, NULL, 0);
10154 CASE_FLT_FN (BUILT_IN_YN):
10155 if (validate_arg (arg0, INTEGER_TYPE)
10156 && validate_arg (arg1, REAL_TYPE))
10157 return do_mpfr_bessel_n (arg0, arg1, type, mpfr_yn,
10161 CASE_FLT_FN (BUILT_IN_DREM):
10162 CASE_FLT_FN (BUILT_IN_REMAINDER):
10163 if (validate_arg (arg0, REAL_TYPE)
10164 && validate_arg(arg1, REAL_TYPE))
10165 return do_mpfr_arg2 (arg0, arg1, type, mpfr_remainder);
10168 CASE_FLT_FN_REENT (BUILT_IN_GAMMA): /* GAMMA_R */
10169 CASE_FLT_FN_REENT (BUILT_IN_LGAMMA): /* LGAMMA_R */
10170 if (validate_arg (arg0, REAL_TYPE)
10171 && validate_arg(arg1, POINTER_TYPE))
10172 return do_mpfr_lgamma_r (arg0, arg1, type);
10175 CASE_FLT_FN (BUILT_IN_ATAN2):
10176 if (validate_arg (arg0, REAL_TYPE)
10177 && validate_arg(arg1, REAL_TYPE))
10178 return do_mpfr_arg2 (arg0, arg1, type, mpfr_atan2);
10181 CASE_FLT_FN (BUILT_IN_FDIM):
10182 if (validate_arg (arg0, REAL_TYPE)
10183 && validate_arg(arg1, REAL_TYPE))
10184 return do_mpfr_arg2 (arg0, arg1, type, mpfr_dim);
10187 CASE_FLT_FN (BUILT_IN_HYPOT):
10188 return fold_builtin_hypot (loc, fndecl, arg0, arg1, type);
10190 CASE_FLT_FN (BUILT_IN_CPOW):
10191 if (validate_arg (arg0, COMPLEX_TYPE)
10192 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE
10193 && validate_arg (arg1, COMPLEX_TYPE)
10194 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg1))) == REAL_TYPE)
10195 return do_mpc_arg2 (arg0, arg1, type, /*do_nonfinite=*/ 0, mpc_pow);
10198 CASE_FLT_FN (BUILT_IN_LDEXP):
10199 return fold_builtin_load_exponent (loc, arg0, arg1, type, /*ldexp=*/true);
10200 CASE_FLT_FN (BUILT_IN_SCALBN):
10201 CASE_FLT_FN (BUILT_IN_SCALBLN):
10202 return fold_builtin_load_exponent (loc, arg0, arg1,
10203 type, /*ldexp=*/false);
10205 CASE_FLT_FN (BUILT_IN_FREXP):
10206 return fold_builtin_frexp (loc, arg0, arg1, type);
10208 CASE_FLT_FN (BUILT_IN_MODF):
10209 return fold_builtin_modf (loc, arg0, arg1, type);
10211 case BUILT_IN_BZERO:
10212 return fold_builtin_bzero (loc, arg0, arg1, ignore);
10214 case BUILT_IN_FPUTS:
10215 return fold_builtin_fputs (loc, arg0, arg1, ignore, false, NULL_TREE);
10217 case BUILT_IN_FPUTS_UNLOCKED:
10218 return fold_builtin_fputs (loc, arg0, arg1, ignore, true, NULL_TREE);
10220 case BUILT_IN_STRSTR:
10221 return fold_builtin_strstr (loc, arg0, arg1, type);
10223 case BUILT_IN_STRCAT:
10224 return fold_builtin_strcat (loc, arg0, arg1);
10226 case BUILT_IN_STRSPN:
10227 return fold_builtin_strspn (loc, arg0, arg1);
10229 case BUILT_IN_STRCSPN:
10230 return fold_builtin_strcspn (loc, arg0, arg1);
10232 case BUILT_IN_STRCHR:
10233 case BUILT_IN_INDEX:
10234 return fold_builtin_strchr (loc, arg0, arg1, type);
10236 case BUILT_IN_STRRCHR:
10237 case BUILT_IN_RINDEX:
10238 return fold_builtin_strrchr (loc, arg0, arg1, type);
10240 case BUILT_IN_STRCPY:
10241 return fold_builtin_strcpy (loc, fndecl, arg0, arg1, NULL_TREE);
10243 case BUILT_IN_STPCPY:
10246 tree fn = implicit_built_in_decls[BUILT_IN_STRCPY];
10250 return build_call_expr_loc (loc, fn, 2, arg0, arg1);
10253 return fold_builtin_stpcpy (loc, fndecl, arg0, arg1);
10256 case BUILT_IN_STRCMP:
10257 return fold_builtin_strcmp (loc, arg0, arg1);
10259 case BUILT_IN_STRPBRK:
10260 return fold_builtin_strpbrk (loc, arg0, arg1, type);
10262 case BUILT_IN_EXPECT:
10263 return fold_builtin_expect (loc, arg0, arg1);
10265 CASE_FLT_FN (BUILT_IN_POW):
10266 return fold_builtin_pow (loc, fndecl, arg0, arg1, type);
10268 CASE_FLT_FN (BUILT_IN_POWI):
10269 return fold_builtin_powi (loc, fndecl, arg0, arg1, type);
10271 CASE_FLT_FN (BUILT_IN_COPYSIGN):
10272 return fold_builtin_copysign (loc, fndecl, arg0, arg1, type);
10274 CASE_FLT_FN (BUILT_IN_FMIN):
10275 return fold_builtin_fmin_fmax (loc, arg0, arg1, type, /*max=*/false);
10277 CASE_FLT_FN (BUILT_IN_FMAX):
10278 return fold_builtin_fmin_fmax (loc, arg0, arg1, type, /*max=*/true);
10280 case BUILT_IN_ISGREATER:
10281 return fold_builtin_unordered_cmp (loc, fndecl,
10282 arg0, arg1, UNLE_EXPR, LE_EXPR);
10283 case BUILT_IN_ISGREATEREQUAL:
10284 return fold_builtin_unordered_cmp (loc, fndecl,
10285 arg0, arg1, UNLT_EXPR, LT_EXPR);
10286 case BUILT_IN_ISLESS:
10287 return fold_builtin_unordered_cmp (loc, fndecl,
10288 arg0, arg1, UNGE_EXPR, GE_EXPR);
10289 case BUILT_IN_ISLESSEQUAL:
10290 return fold_builtin_unordered_cmp (loc, fndecl,
10291 arg0, arg1, UNGT_EXPR, GT_EXPR);
10292 case BUILT_IN_ISLESSGREATER:
10293 return fold_builtin_unordered_cmp (loc, fndecl,
10294 arg0, arg1, UNEQ_EXPR, EQ_EXPR);
10295 case BUILT_IN_ISUNORDERED:
10296 return fold_builtin_unordered_cmp (loc, fndecl,
10297 arg0, arg1, UNORDERED_EXPR,
10300 /* We do the folding for va_start in the expander. */
10301 case BUILT_IN_VA_START:
10304 case BUILT_IN_SPRINTF:
10305 return fold_builtin_sprintf (loc, arg0, arg1, NULL_TREE, ignore);
10307 case BUILT_IN_OBJECT_SIZE:
10308 return fold_builtin_object_size (arg0, arg1);
10310 case BUILT_IN_PRINTF:
10311 case BUILT_IN_PRINTF_UNLOCKED:
10312 case BUILT_IN_VPRINTF:
10313 return fold_builtin_printf (loc, fndecl, arg0, arg1, ignore, fcode);
10315 case BUILT_IN_PRINTF_CHK:
10316 case BUILT_IN_VPRINTF_CHK:
10317 if (!validate_arg (arg0, INTEGER_TYPE)
10318 || TREE_SIDE_EFFECTS (arg0))
10321 return fold_builtin_printf (loc, fndecl,
10322 arg1, NULL_TREE, ignore, fcode);
10325 case BUILT_IN_FPRINTF:
10326 case BUILT_IN_FPRINTF_UNLOCKED:
10327 case BUILT_IN_VFPRINTF:
10328 return fold_builtin_fprintf (loc, fndecl, arg0, arg1, NULL_TREE,
10337 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
10338 and ARG2. IGNORE is true if the result of the function call is ignored.
10339 This function returns NULL_TREE if no simplification was possible. */
10342 fold_builtin_3 (location_t loc, tree fndecl,
10343 tree arg0, tree arg1, tree arg2, bool ignore)
10345 tree type = TREE_TYPE (TREE_TYPE (fndecl));
10346 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
10350 CASE_FLT_FN (BUILT_IN_SINCOS):
10351 return fold_builtin_sincos (loc, arg0, arg1, arg2);
10353 CASE_FLT_FN (BUILT_IN_FMA):
10354 if (validate_arg (arg0, REAL_TYPE)
10355 && validate_arg(arg1, REAL_TYPE)
10356 && validate_arg(arg2, REAL_TYPE))
10357 return do_mpfr_arg3 (arg0, arg1, arg2, type, mpfr_fma);
10360 CASE_FLT_FN (BUILT_IN_REMQUO):
10361 if (validate_arg (arg0, REAL_TYPE)
10362 && validate_arg(arg1, REAL_TYPE)
10363 && validate_arg(arg2, POINTER_TYPE))
10364 return do_mpfr_remquo (arg0, arg1, arg2);
10367 case BUILT_IN_MEMSET:
10368 return fold_builtin_memset (loc, arg0, arg1, arg2, type, ignore);
10370 case BUILT_IN_BCOPY:
10371 return fold_builtin_memory_op (loc, arg1, arg0, arg2,
10372 void_type_node, true, /*endp=*/3);
10374 case BUILT_IN_MEMCPY:
10375 return fold_builtin_memory_op (loc, arg0, arg1, arg2,
10376 type, ignore, /*endp=*/0);
10378 case BUILT_IN_MEMPCPY:
10379 return fold_builtin_memory_op (loc, arg0, arg1, arg2,
10380 type, ignore, /*endp=*/1);
10382 case BUILT_IN_MEMMOVE:
10383 return fold_builtin_memory_op (loc, arg0, arg1, arg2,
10384 type, ignore, /*endp=*/3);
10386 case BUILT_IN_STRNCAT:
10387 return fold_builtin_strncat (loc, arg0, arg1, arg2);
10389 case BUILT_IN_STRNCPY:
10390 return fold_builtin_strncpy (loc, fndecl, arg0, arg1, arg2, NULL_TREE);
10392 case BUILT_IN_STRNCMP:
10393 return fold_builtin_strncmp (loc, arg0, arg1, arg2);
10395 case BUILT_IN_MEMCHR:
10396 return fold_builtin_memchr (loc, arg0, arg1, arg2, type);
10398 case BUILT_IN_BCMP:
10399 case BUILT_IN_MEMCMP:
10400 return fold_builtin_memcmp (loc, arg0, arg1, arg2);;
10402 case BUILT_IN_SPRINTF:
10403 return fold_builtin_sprintf (loc, arg0, arg1, arg2, ignore);
10405 case BUILT_IN_STRCPY_CHK:
10406 case BUILT_IN_STPCPY_CHK:
10407 return fold_builtin_stxcpy_chk (loc, fndecl, arg0, arg1, arg2, NULL_TREE,
10410 case BUILT_IN_STRCAT_CHK:
10411 return fold_builtin_strcat_chk (loc, fndecl, arg0, arg1, arg2);
10413 case BUILT_IN_PRINTF_CHK:
10414 case BUILT_IN_VPRINTF_CHK:
10415 if (!validate_arg (arg0, INTEGER_TYPE)
10416 || TREE_SIDE_EFFECTS (arg0))
10419 return fold_builtin_printf (loc, fndecl, arg1, arg2, ignore, fcode);
10422 case BUILT_IN_FPRINTF:
10423 case BUILT_IN_FPRINTF_UNLOCKED:
10424 case BUILT_IN_VFPRINTF:
10425 return fold_builtin_fprintf (loc, fndecl, arg0, arg1, arg2,
10428 case BUILT_IN_FPRINTF_CHK:
10429 case BUILT_IN_VFPRINTF_CHK:
10430 if (!validate_arg (arg1, INTEGER_TYPE)
10431 || TREE_SIDE_EFFECTS (arg1))
10434 return fold_builtin_fprintf (loc, fndecl, arg0, arg2, NULL_TREE,
10443 /* Fold a call to built-in function FNDECL with 4 arguments, ARG0, ARG1,
10444 ARG2, and ARG3. IGNORE is true if the result of the function call is
10445 ignored. This function returns NULL_TREE if no simplification was
10449 fold_builtin_4 (location_t loc, tree fndecl,
10450 tree arg0, tree arg1, tree arg2, tree arg3, bool ignore)
10452 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
10456 case BUILT_IN_MEMCPY_CHK:
10457 case BUILT_IN_MEMPCPY_CHK:
10458 case BUILT_IN_MEMMOVE_CHK:
10459 case BUILT_IN_MEMSET_CHK:
10460 return fold_builtin_memory_chk (loc, fndecl, arg0, arg1, arg2, arg3,
10462 DECL_FUNCTION_CODE (fndecl));
10464 case BUILT_IN_STRNCPY_CHK:
10465 return fold_builtin_strncpy_chk (loc, arg0, arg1, arg2, arg3, NULL_TREE);
10467 case BUILT_IN_STRNCAT_CHK:
10468 return fold_builtin_strncat_chk (loc, fndecl, arg0, arg1, arg2, arg3);
10470 case BUILT_IN_FPRINTF_CHK:
10471 case BUILT_IN_VFPRINTF_CHK:
10472 if (!validate_arg (arg1, INTEGER_TYPE)
10473 || TREE_SIDE_EFFECTS (arg1))
10476 return fold_builtin_fprintf (loc, fndecl, arg0, arg2, arg3,
10486 /* Fold a call to built-in function FNDECL. ARGS is an array of NARGS
10487 arguments, where NARGS <= 4. IGNORE is true if the result of the
10488 function call is ignored. This function returns NULL_TREE if no
10489 simplification was possible. Note that this only folds builtins with
10490 fixed argument patterns. Foldings that do varargs-to-varargs
10491 transformations, or that match calls with more than 4 arguments,
10492 need to be handled with fold_builtin_varargs instead. */
10494 #define MAX_ARGS_TO_FOLD_BUILTIN 4
10497 fold_builtin_n (location_t loc, tree fndecl, tree *args, int nargs, bool ignore)
10499 tree ret = NULL_TREE;
10504 ret = fold_builtin_0 (loc, fndecl, ignore);
10507 ret = fold_builtin_1 (loc, fndecl, args[0], ignore);
10510 ret = fold_builtin_2 (loc, fndecl, args[0], args[1], ignore);
10513 ret = fold_builtin_3 (loc, fndecl, args[0], args[1], args[2], ignore);
10516 ret = fold_builtin_4 (loc, fndecl, args[0], args[1], args[2], args[3],
10524 ret = build1 (NOP_EXPR, TREE_TYPE (ret), ret);
10525 SET_EXPR_LOCATION (ret, loc);
10526 TREE_NO_WARNING (ret) = 1;
10532 /* Builtins with folding operations that operate on "..." arguments
10533 need special handling; we need to store the arguments in a convenient
10534 data structure before attempting any folding. Fortunately there are
10535 only a few builtins that fall into this category. FNDECL is the
10536 function, EXP is the CALL_EXPR for the call, and IGNORE is true if the
10537 result of the function call is ignored. */
10540 fold_builtin_varargs (location_t loc, tree fndecl, tree exp,
10541 bool ignore ATTRIBUTE_UNUSED)
10543 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
10544 tree ret = NULL_TREE;
10548 case BUILT_IN_SPRINTF_CHK:
10549 case BUILT_IN_VSPRINTF_CHK:
10550 ret = fold_builtin_sprintf_chk (loc, exp, fcode);
10553 case BUILT_IN_SNPRINTF_CHK:
10554 case BUILT_IN_VSNPRINTF_CHK:
10555 ret = fold_builtin_snprintf_chk (loc, exp, NULL_TREE, fcode);
10558 case BUILT_IN_FPCLASSIFY:
10559 ret = fold_builtin_fpclassify (loc, exp);
10567 ret = build1 (NOP_EXPR, TREE_TYPE (ret), ret);
10568 SET_EXPR_LOCATION (ret, loc);
10569 TREE_NO_WARNING (ret) = 1;
10575 /* Return true if FNDECL shouldn't be folded right now.
10576 If a built-in function has an inline attribute always_inline
10577 wrapper, defer folding it after always_inline functions have
10578 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
10579 might not be performed. */
10582 avoid_folding_inline_builtin (tree fndecl)
10584 return (DECL_DECLARED_INLINE_P (fndecl)
10585 && DECL_DISREGARD_INLINE_LIMITS (fndecl)
10587 && !cfun->always_inline_functions_inlined
10588 && lookup_attribute ("always_inline", DECL_ATTRIBUTES (fndecl)));
10591 /* A wrapper function for builtin folding that prevents warnings for
10592 "statement without effect" and the like, caused by removing the
10593 call node earlier than the warning is generated. */
10596 fold_call_expr (location_t loc, tree exp, bool ignore)
10598 tree ret = NULL_TREE;
10599 tree fndecl = get_callee_fndecl (exp);
10601 && TREE_CODE (fndecl) == FUNCTION_DECL
10602 && DECL_BUILT_IN (fndecl)
10603 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
10604 yet. Defer folding until we see all the arguments
10605 (after inlining). */
10606 && !CALL_EXPR_VA_ARG_PACK (exp))
10608 int nargs = call_expr_nargs (exp);
10610 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
10611 instead last argument is __builtin_va_arg_pack (). Defer folding
10612 even in that case, until arguments are finalized. */
10613 if (nargs && TREE_CODE (CALL_EXPR_ARG (exp, nargs - 1)) == CALL_EXPR)
10615 tree fndecl2 = get_callee_fndecl (CALL_EXPR_ARG (exp, nargs - 1));
10617 && TREE_CODE (fndecl2) == FUNCTION_DECL
10618 && DECL_BUILT_IN_CLASS (fndecl2) == BUILT_IN_NORMAL
10619 && DECL_FUNCTION_CODE (fndecl2) == BUILT_IN_VA_ARG_PACK)
10623 if (avoid_folding_inline_builtin (fndecl))
10626 /* FIXME: Don't use a list in this interface. */
10627 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
10628 return targetm.fold_builtin (fndecl, CALL_EXPR_ARGS (exp), ignore);
10631 if (nargs <= MAX_ARGS_TO_FOLD_BUILTIN)
10633 tree *args = CALL_EXPR_ARGP (exp);
10634 ret = fold_builtin_n (loc, fndecl, args, nargs, ignore);
10637 ret = fold_builtin_varargs (loc, fndecl, exp, ignore);
10645 /* Conveniently construct a function call expression. FNDECL names the
10646 function to be called and ARGLIST is a TREE_LIST of arguments. */
10649 build_function_call_expr (location_t loc, tree fndecl, tree arglist)
10651 tree fntype = TREE_TYPE (fndecl);
10652 tree fn = build1 (ADDR_EXPR, build_pointer_type (fntype), fndecl);
10653 int n = list_length (arglist);
10654 tree *argarray = (tree *) alloca (n * sizeof (tree));
10657 for (i = 0; i < n; i++, arglist = TREE_CHAIN (arglist))
10658 argarray[i] = TREE_VALUE (arglist);
10659 return fold_builtin_call_array (loc, TREE_TYPE (fntype), fn, n, argarray);
10662 /* Conveniently construct a function call expression. FNDECL names the
10663 function to be called, N is the number of arguments, and the "..."
10664 parameters are the argument expressions. */
10667 build_call_expr_loc (location_t loc, tree fndecl, int n, ...)
10670 tree fntype = TREE_TYPE (fndecl);
10671 tree fn = build1 (ADDR_EXPR, build_pointer_type (fntype), fndecl);
10672 tree *argarray = (tree *) alloca (n * sizeof (tree));
10676 for (i = 0; i < n; i++)
10677 argarray[i] = va_arg (ap, tree);
10679 return fold_builtin_call_array (loc, TREE_TYPE (fntype), fn, n, argarray);
10682 /* Construct a CALL_EXPR with type TYPE with FN as the function expression.
10683 N arguments are passed in the array ARGARRAY. */
10686 fold_builtin_call_array (location_t loc, tree type,
10691 tree ret = NULL_TREE;
10695 if (TREE_CODE (fn) == ADDR_EXPR)
10697 tree fndecl = TREE_OPERAND (fn, 0);
10698 if (TREE_CODE (fndecl) == FUNCTION_DECL
10699 && DECL_BUILT_IN (fndecl))
10701 /* If last argument is __builtin_va_arg_pack (), arguments to this
10702 function are not finalized yet. Defer folding until they are. */
10703 if (n && TREE_CODE (argarray[n - 1]) == CALL_EXPR)
10705 tree fndecl2 = get_callee_fndecl (argarray[n - 1]);
10707 && TREE_CODE (fndecl2) == FUNCTION_DECL
10708 && DECL_BUILT_IN_CLASS (fndecl2) == BUILT_IN_NORMAL
10709 && DECL_FUNCTION_CODE (fndecl2) == BUILT_IN_VA_ARG_PACK)
10710 return build_call_array_loc (loc, type, fn, n, argarray);
10712 if (avoid_folding_inline_builtin (fndecl))
10713 return build_call_array_loc (loc, type, fn, n, argarray);
10714 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
10716 tree arglist = NULL_TREE;
10717 for (i = n - 1; i >= 0; i--)
10718 arglist = tree_cons (NULL_TREE, argarray[i], arglist);
10719 ret = targetm.fold_builtin (fndecl, arglist, false);
10722 return build_call_array_loc (loc, type, fn, n, argarray);
10724 else if (n <= MAX_ARGS_TO_FOLD_BUILTIN)
10726 /* First try the transformations that don't require consing up
10728 ret = fold_builtin_n (loc, fndecl, argarray, n, false);
10733 /* If we got this far, we need to build an exp. */
10734 exp = build_call_array_loc (loc, type, fn, n, argarray);
10735 ret = fold_builtin_varargs (loc, fndecl, exp, false);
10736 return ret ? ret : exp;
10740 return build_call_array_loc (loc, type, fn, n, argarray);
10743 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
10744 along with N new arguments specified as the "..." parameters. SKIP
10745 is the number of arguments in EXP to be omitted. This function is used
10746 to do varargs-to-varargs transformations. */
10749 rewrite_call_expr (location_t loc, tree exp, int skip, tree fndecl, int n, ...)
10751 int oldnargs = call_expr_nargs (exp);
10752 int nargs = oldnargs - skip + n;
10753 tree fntype = TREE_TYPE (fndecl);
10754 tree fn = build1 (ADDR_EXPR, build_pointer_type (fntype), fndecl);
10762 buffer = XALLOCAVEC (tree, nargs);
10764 for (i = 0; i < n; i++)
10765 buffer[i] = va_arg (ap, tree);
10767 for (j = skip; j < oldnargs; j++, i++)
10768 buffer[i] = CALL_EXPR_ARG (exp, j);
10771 buffer = CALL_EXPR_ARGP (exp) + skip;
10773 return fold (build_call_array_loc (loc, TREE_TYPE (exp), fn, nargs, buffer));
10776 /* Validate a single argument ARG against a tree code CODE representing
10780 validate_arg (const_tree arg, enum tree_code code)
10784 else if (code == POINTER_TYPE)
10785 return POINTER_TYPE_P (TREE_TYPE (arg));
10786 else if (code == INTEGER_TYPE)
10787 return INTEGRAL_TYPE_P (TREE_TYPE (arg));
10788 return code == TREE_CODE (TREE_TYPE (arg));
10791 /* This function validates the types of a function call argument list
10792 against a specified list of tree_codes. If the last specifier is a 0,
10793 that represents an ellipses, otherwise the last specifier must be a
10796 This is the GIMPLE version of validate_arglist. Eventually we want to
10797 completely convert builtins.c to work from GIMPLEs and the tree based
10798 validate_arglist will then be removed. */
10801 validate_gimple_arglist (const_gimple call, ...)
10803 enum tree_code code;
10809 va_start (ap, call);
10814 code = (enum tree_code) va_arg (ap, int);
10818 /* This signifies an ellipses, any further arguments are all ok. */
10822 /* This signifies an endlink, if no arguments remain, return
10823 true, otherwise return false. */
10824 res = (i == gimple_call_num_args (call));
10827 /* If no parameters remain or the parameter's code does not
10828 match the specified code, return false. Otherwise continue
10829 checking any remaining arguments. */
10830 arg = gimple_call_arg (call, i++);
10831 if (!validate_arg (arg, code))
10838 /* We need gotos here since we can only have one VA_CLOSE in a
10846 /* This function validates the types of a function call argument list
10847 against a specified list of tree_codes. If the last specifier is a 0,
10848 that represents an ellipses, otherwise the last specifier must be a
10852 validate_arglist (const_tree callexpr, ...)
10854 enum tree_code code;
10857 const_call_expr_arg_iterator iter;
10860 va_start (ap, callexpr);
10861 init_const_call_expr_arg_iterator (callexpr, &iter);
10865 code = (enum tree_code) va_arg (ap, int);
10869 /* This signifies an ellipses, any further arguments are all ok. */
10873 /* This signifies an endlink, if no arguments remain, return
10874 true, otherwise return false. */
10875 res = !more_const_call_expr_args_p (&iter);
10878 /* If no parameters remain or the parameter's code does not
10879 match the specified code, return false. Otherwise continue
10880 checking any remaining arguments. */
10881 arg = next_const_call_expr_arg (&iter);
10882 if (!validate_arg (arg, code))
10889 /* We need gotos here since we can only have one VA_CLOSE in a
10897 /* Default target-specific builtin expander that does nothing. */
10900 default_expand_builtin (tree exp ATTRIBUTE_UNUSED,
10901 rtx target ATTRIBUTE_UNUSED,
10902 rtx subtarget ATTRIBUTE_UNUSED,
10903 enum machine_mode mode ATTRIBUTE_UNUSED,
10904 int ignore ATTRIBUTE_UNUSED)
10909 /* Returns true is EXP represents data that would potentially reside
10910 in a readonly section. */
10913 readonly_data_expr (tree exp)
10917 if (TREE_CODE (exp) != ADDR_EXPR)
10920 exp = get_base_address (TREE_OPERAND (exp, 0));
10924 /* Make sure we call decl_readonly_section only for trees it
10925 can handle (since it returns true for everything it doesn't
10927 if (TREE_CODE (exp) == STRING_CST
10928 || TREE_CODE (exp) == CONSTRUCTOR
10929 || (TREE_CODE (exp) == VAR_DECL && TREE_STATIC (exp)))
10930 return decl_readonly_section (exp, 0);
10935 /* Simplify a call to the strstr builtin. S1 and S2 are the arguments
10936 to the call, and TYPE is its return type.
10938 Return NULL_TREE if no simplification was possible, otherwise return the
10939 simplified form of the call as a tree.
10941 The simplified form may be a constant or other expression which
10942 computes the same value, but in a more efficient manner (including
10943 calls to other builtin functions).
10945 The call may contain arguments which need to be evaluated, but
10946 which are not useful to determine the result of the call. In
10947 this case we return a chain of COMPOUND_EXPRs. The LHS of each
10948 COMPOUND_EXPR will be an argument which must be evaluated.
10949 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
10950 COMPOUND_EXPR in the chain will contain the tree for the simplified
10951 form of the builtin function call. */
10954 fold_builtin_strstr (location_t loc, tree s1, tree s2, tree type)
10956 if (!validate_arg (s1, POINTER_TYPE)
10957 || !validate_arg (s2, POINTER_TYPE))
10962 const char *p1, *p2;
10964 p2 = c_getstr (s2);
10968 p1 = c_getstr (s1);
10971 const char *r = strstr (p1, p2);
10975 return build_int_cst (TREE_TYPE (s1), 0);
10977 /* Return an offset into the constant string argument. */
10978 tem = fold_build2_loc (loc, POINTER_PLUS_EXPR, TREE_TYPE (s1),
10979 s1, size_int (r - p1));
10980 return fold_convert_loc (loc, type, tem);
10983 /* The argument is const char *, and the result is char *, so we need
10984 a type conversion here to avoid a warning. */
10986 return fold_convert_loc (loc, type, s1);
10991 fn = implicit_built_in_decls[BUILT_IN_STRCHR];
10995 /* New argument list transforming strstr(s1, s2) to
10996 strchr(s1, s2[0]). */
10997 return build_call_expr_loc (loc, fn, 2, s1, build_int_cst (NULL_TREE, p2[0]));
11001 /* Simplify a call to the strchr builtin. S1 and S2 are the arguments to
11002 the call, and TYPE is its return type.
11004 Return NULL_TREE if no simplification was possible, otherwise return the
11005 simplified form of the call as a tree.
11007 The simplified form may be a constant or other expression which
11008 computes the same value, but in a more efficient manner (including
11009 calls to other builtin functions).
11011 The call may contain arguments which need to be evaluated, but
11012 which are not useful to determine the result of the call. In
11013 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11014 COMPOUND_EXPR will be an argument which must be evaluated.
11015 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11016 COMPOUND_EXPR in the chain will contain the tree for the simplified
11017 form of the builtin function call. */
11020 fold_builtin_strchr (location_t loc, tree s1, tree s2, tree type)
11022 if (!validate_arg (s1, POINTER_TYPE)
11023 || !validate_arg (s2, INTEGER_TYPE))
11029 if (TREE_CODE (s2) != INTEGER_CST)
11032 p1 = c_getstr (s1);
11039 if (target_char_cast (s2, &c))
11042 r = strchr (p1, c);
11045 return build_int_cst (TREE_TYPE (s1), 0);
11047 /* Return an offset into the constant string argument. */
11048 tem = fold_build2_loc (loc, POINTER_PLUS_EXPR, TREE_TYPE (s1),
11049 s1, size_int (r - p1));
11050 return fold_convert_loc (loc, type, tem);
11056 /* Simplify a call to the strrchr builtin. S1 and S2 are the arguments to
11057 the call, and TYPE is its return type.
11059 Return NULL_TREE if no simplification was possible, otherwise return the
11060 simplified form of the call as a tree.
11062 The simplified form may be a constant or other expression which
11063 computes the same value, but in a more efficient manner (including
11064 calls to other builtin functions).
11066 The call may contain arguments which need to be evaluated, but
11067 which are not useful to determine the result of the call. In
11068 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11069 COMPOUND_EXPR will be an argument which must be evaluated.
11070 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11071 COMPOUND_EXPR in the chain will contain the tree for the simplified
11072 form of the builtin function call. */
11075 fold_builtin_strrchr (location_t loc, tree s1, tree s2, tree type)
11077 if (!validate_arg (s1, POINTER_TYPE)
11078 || !validate_arg (s2, INTEGER_TYPE))
11085 if (TREE_CODE (s2) != INTEGER_CST)
11088 p1 = c_getstr (s1);
11095 if (target_char_cast (s2, &c))
11098 r = strrchr (p1, c);
11101 return build_int_cst (TREE_TYPE (s1), 0);
11103 /* Return an offset into the constant string argument. */
11104 tem = fold_build2_loc (loc, POINTER_PLUS_EXPR, TREE_TYPE (s1),
11105 s1, size_int (r - p1));
11106 return fold_convert_loc (loc, type, tem);
11109 if (! integer_zerop (s2))
11112 fn = implicit_built_in_decls[BUILT_IN_STRCHR];
11116 /* Transform strrchr(s1, '\0') to strchr(s1, '\0'). */
11117 return build_call_expr_loc (loc, fn, 2, s1, s2);
11121 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
11122 to the call, and TYPE is its return type.
11124 Return NULL_TREE if no simplification was possible, otherwise return the
11125 simplified form of the call as a tree.
11127 The simplified form may be a constant or other expression which
11128 computes the same value, but in a more efficient manner (including
11129 calls to other builtin functions).
11131 The call may contain arguments which need to be evaluated, but
11132 which are not useful to determine the result of the call. In
11133 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11134 COMPOUND_EXPR will be an argument which must be evaluated.
11135 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11136 COMPOUND_EXPR in the chain will contain the tree for the simplified
11137 form of the builtin function call. */
11140 fold_builtin_strpbrk (location_t loc, tree s1, tree s2, tree type)
11142 if (!validate_arg (s1, POINTER_TYPE)
11143 || !validate_arg (s2, POINTER_TYPE))
11148 const char *p1, *p2;
11150 p2 = c_getstr (s2);
11154 p1 = c_getstr (s1);
11157 const char *r = strpbrk (p1, p2);
11161 return build_int_cst (TREE_TYPE (s1), 0);
11163 /* Return an offset into the constant string argument. */
11164 tem = fold_build2_loc (loc, POINTER_PLUS_EXPR, TREE_TYPE (s1),
11165 s1, size_int (r - p1));
11166 return fold_convert_loc (loc, type, tem);
11170 /* strpbrk(x, "") == NULL.
11171 Evaluate and ignore s1 in case it had side-effects. */
11172 return omit_one_operand_loc (loc, TREE_TYPE (s1), integer_zero_node, s1);
11175 return NULL_TREE; /* Really call strpbrk. */
11177 fn = implicit_built_in_decls[BUILT_IN_STRCHR];
11181 /* New argument list transforming strpbrk(s1, s2) to
11182 strchr(s1, s2[0]). */
11183 return build_call_expr_loc (loc, fn, 2, s1, build_int_cst (NULL_TREE, p2[0]));
11187 /* Simplify a call to the strcat builtin. DST and SRC are the arguments
11190 Return NULL_TREE if no simplification was possible, otherwise return the
11191 simplified form of the call as a tree.
11193 The simplified form may be a constant or other expression which
11194 computes the same value, but in a more efficient manner (including
11195 calls to other builtin functions).
11197 The call may contain arguments which need to be evaluated, but
11198 which are not useful to determine the result of the call. In
11199 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11200 COMPOUND_EXPR will be an argument which must be evaluated.
11201 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11202 COMPOUND_EXPR in the chain will contain the tree for the simplified
11203 form of the builtin function call. */
11206 fold_builtin_strcat (location_t loc ATTRIBUTE_UNUSED, tree dst, tree src)
11208 if (!validate_arg (dst, POINTER_TYPE)
11209 || !validate_arg (src, POINTER_TYPE))
11213 const char *p = c_getstr (src);
11215 /* If the string length is zero, return the dst parameter. */
11216 if (p && *p == '\0')
11219 if (optimize_insn_for_speed_p ())
11221 /* See if we can store by pieces into (dst + strlen(dst)). */
11223 tree strlen_fn = implicit_built_in_decls[BUILT_IN_STRLEN];
11224 tree strcpy_fn = implicit_built_in_decls[BUILT_IN_STRCPY];
11226 if (!strlen_fn || !strcpy_fn)
11229 /* If we don't have a movstr we don't want to emit an strcpy
11230 call. We have to do that if the length of the source string
11231 isn't computable (in that case we can use memcpy probably
11232 later expanding to a sequence of mov instructions). If we
11233 have movstr instructions we can emit strcpy calls. */
11236 tree len = c_strlen (src, 1);
11237 if (! len || TREE_SIDE_EFFECTS (len))
11241 /* Stabilize the argument list. */
11242 dst = builtin_save_expr (dst);
11244 /* Create strlen (dst). */
11245 newdst = build_call_expr_loc (loc, strlen_fn, 1, dst);
11246 /* Create (dst p+ strlen (dst)). */
11248 newdst = fold_build2_loc (loc, POINTER_PLUS_EXPR,
11249 TREE_TYPE (dst), dst, newdst);
11250 newdst = builtin_save_expr (newdst);
11252 call = build_call_expr_loc (loc, strcpy_fn, 2, newdst, src);
11253 return build2 (COMPOUND_EXPR, TREE_TYPE (dst), call, dst);
11259 /* Simplify a call to the strncat builtin. DST, SRC, and LEN are the
11260 arguments to the call.
11262 Return NULL_TREE if no simplification was possible, otherwise return the
11263 simplified form of the call as a tree.
11265 The simplified form may be a constant or other expression which
11266 computes the same value, but in a more efficient manner (including
11267 calls to other builtin functions).
11269 The call may contain arguments which need to be evaluated, but
11270 which are not useful to determine the result of the call. In
11271 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11272 COMPOUND_EXPR will be an argument which must be evaluated.
11273 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11274 COMPOUND_EXPR in the chain will contain the tree for the simplified
11275 form of the builtin function call. */
11278 fold_builtin_strncat (location_t loc, tree dst, tree src, tree len)
11280 if (!validate_arg (dst, POINTER_TYPE)
11281 || !validate_arg (src, POINTER_TYPE)
11282 || !validate_arg (len, INTEGER_TYPE))
11286 const char *p = c_getstr (src);
11288 /* If the requested length is zero, or the src parameter string
11289 length is zero, return the dst parameter. */
11290 if (integer_zerop (len) || (p && *p == '\0'))
11291 return omit_two_operands_loc (loc, TREE_TYPE (dst), dst, src, len);
11293 /* If the requested len is greater than or equal to the string
11294 length, call strcat. */
11295 if (TREE_CODE (len) == INTEGER_CST && p
11296 && compare_tree_int (len, strlen (p)) >= 0)
11298 tree fn = implicit_built_in_decls[BUILT_IN_STRCAT];
11300 /* If the replacement _DECL isn't initialized, don't do the
11305 return build_call_expr_loc (loc, fn, 2, dst, src);
11311 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
11314 Return NULL_TREE if no simplification was possible, otherwise return the
11315 simplified form of the call as a tree.
11317 The simplified form may be a constant or other expression which
11318 computes the same value, but in a more efficient manner (including
11319 calls to other builtin functions).
11321 The call may contain arguments which need to be evaluated, but
11322 which are not useful to determine the result of the call. In
11323 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11324 COMPOUND_EXPR will be an argument which must be evaluated.
11325 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11326 COMPOUND_EXPR in the chain will contain the tree for the simplified
11327 form of the builtin function call. */
11330 fold_builtin_strspn (location_t loc, tree s1, tree s2)
11332 if (!validate_arg (s1, POINTER_TYPE)
11333 || !validate_arg (s2, POINTER_TYPE))
11337 const char *p1 = c_getstr (s1), *p2 = c_getstr (s2);
11339 /* If both arguments are constants, evaluate at compile-time. */
11342 const size_t r = strspn (p1, p2);
11343 return size_int (r);
11346 /* If either argument is "", return NULL_TREE. */
11347 if ((p1 && *p1 == '\0') || (p2 && *p2 == '\0'))
11348 /* Evaluate and ignore both arguments in case either one has
11350 return omit_two_operands_loc (loc, size_type_node, size_zero_node,
11356 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
11359 Return NULL_TREE if no simplification was possible, otherwise return the
11360 simplified form of the call as a tree.
11362 The simplified form may be a constant or other expression which
11363 computes the same value, but in a more efficient manner (including
11364 calls to other builtin functions).
11366 The call may contain arguments which need to be evaluated, but
11367 which are not useful to determine the result of the call. In
11368 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11369 COMPOUND_EXPR will be an argument which must be evaluated.
11370 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11371 COMPOUND_EXPR in the chain will contain the tree for the simplified
11372 form of the builtin function call. */
11375 fold_builtin_strcspn (location_t loc, tree s1, tree s2)
11377 if (!validate_arg (s1, POINTER_TYPE)
11378 || !validate_arg (s2, POINTER_TYPE))
11382 const char *p1 = c_getstr (s1), *p2 = c_getstr (s2);
11384 /* If both arguments are constants, evaluate at compile-time. */
11387 const size_t r = strcspn (p1, p2);
11388 return size_int (r);
11391 /* If the first argument is "", return NULL_TREE. */
11392 if (p1 && *p1 == '\0')
11394 /* Evaluate and ignore argument s2 in case it has
11396 return omit_one_operand_loc (loc, size_type_node,
11397 size_zero_node, s2);
11400 /* If the second argument is "", return __builtin_strlen(s1). */
11401 if (p2 && *p2 == '\0')
11403 tree fn = implicit_built_in_decls[BUILT_IN_STRLEN];
11405 /* If the replacement _DECL isn't initialized, don't do the
11410 return build_call_expr_loc (loc, fn, 1, s1);
11416 /* Fold a call to the fputs builtin. ARG0 and ARG1 are the arguments
11417 to the call. IGNORE is true if the value returned
11418 by the builtin will be ignored. UNLOCKED is true is true if this
11419 actually a call to fputs_unlocked. If LEN in non-NULL, it represents
11420 the known length of the string. Return NULL_TREE if no simplification
11424 fold_builtin_fputs (location_t loc, tree arg0, tree arg1,
11425 bool ignore, bool unlocked, tree len)
11427 /* If we're using an unlocked function, assume the other unlocked
11428 functions exist explicitly. */
11429 tree const fn_fputc = unlocked ? built_in_decls[BUILT_IN_FPUTC_UNLOCKED]
11430 : implicit_built_in_decls[BUILT_IN_FPUTC];
11431 tree const fn_fwrite = unlocked ? built_in_decls[BUILT_IN_FWRITE_UNLOCKED]
11432 : implicit_built_in_decls[BUILT_IN_FWRITE];
11434 /* If the return value is used, don't do the transformation. */
11438 /* Verify the arguments in the original call. */
11439 if (!validate_arg (arg0, POINTER_TYPE)
11440 || !validate_arg (arg1, POINTER_TYPE))
11444 len = c_strlen (arg0, 0);
11446 /* Get the length of the string passed to fputs. If the length
11447 can't be determined, punt. */
11449 || TREE_CODE (len) != INTEGER_CST)
11452 switch (compare_tree_int (len, 1))
11454 case -1: /* length is 0, delete the call entirely . */
11455 return omit_one_operand_loc (loc, integer_type_node,
11456 integer_zero_node, arg1);;
11458 case 0: /* length is 1, call fputc. */
11460 const char *p = c_getstr (arg0);
11465 return build_call_expr_loc (loc, fn_fputc, 2,
11466 build_int_cst (NULL_TREE, p[0]), arg1);
11472 case 1: /* length is greater than 1, call fwrite. */
11474 /* If optimizing for size keep fputs. */
11475 if (optimize_function_for_size_p (cfun))
11477 /* New argument list transforming fputs(string, stream) to
11478 fwrite(string, 1, len, stream). */
11480 return build_call_expr_loc (loc, fn_fwrite, 4, arg0,
11481 size_one_node, len, arg1);
11486 gcc_unreachable ();
11491 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
11492 produced. False otherwise. This is done so that we don't output the error
11493 or warning twice or three times. */
11496 fold_builtin_next_arg (tree exp, bool va_start_p)
11498 tree fntype = TREE_TYPE (current_function_decl);
11499 int nargs = call_expr_nargs (exp);
11502 if (TYPE_ARG_TYPES (fntype) == 0
11503 || (TREE_VALUE (tree_last (TYPE_ARG_TYPES (fntype)))
11504 == void_type_node))
11506 error ("%<va_start%> used in function with fixed args");
11512 if (va_start_p && (nargs != 2))
11514 error ("wrong number of arguments to function %<va_start%>");
11517 arg = CALL_EXPR_ARG (exp, 1);
11519 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
11520 when we checked the arguments and if needed issued a warning. */
11525 /* Evidently an out of date version of <stdarg.h>; can't validate
11526 va_start's second argument, but can still work as intended. */
11527 warning (0, "%<__builtin_next_arg%> called without an argument");
11530 else if (nargs > 1)
11532 error ("wrong number of arguments to function %<__builtin_next_arg%>");
11535 arg = CALL_EXPR_ARG (exp, 0);
11538 if (TREE_CODE (arg) == SSA_NAME)
11539 arg = SSA_NAME_VAR (arg);
11541 /* We destructively modify the call to be __builtin_va_start (ap, 0)
11542 or __builtin_next_arg (0) the first time we see it, after checking
11543 the arguments and if needed issuing a warning. */
11544 if (!integer_zerop (arg))
11546 tree last_parm = tree_last (DECL_ARGUMENTS (current_function_decl));
11548 /* Strip off all nops for the sake of the comparison. This
11549 is not quite the same as STRIP_NOPS. It does more.
11550 We must also strip off INDIRECT_EXPR for C++ reference
11552 while (CONVERT_EXPR_P (arg)
11553 || TREE_CODE (arg) == INDIRECT_REF)
11554 arg = TREE_OPERAND (arg, 0);
11555 if (arg != last_parm)
11557 /* FIXME: Sometimes with the tree optimizers we can get the
11558 not the last argument even though the user used the last
11559 argument. We just warn and set the arg to be the last
11560 argument so that we will get wrong-code because of
11562 warning (0, "second parameter of %<va_start%> not last named argument");
11565 /* Undefined by C99 7.15.1.4p4 (va_start):
11566 "If the parameter parmN is declared with the register storage
11567 class, with a function or array type, or with a type that is
11568 not compatible with the type that results after application of
11569 the default argument promotions, the behavior is undefined."
11571 else if (DECL_REGISTER (arg))
11572 warning (0, "undefined behaviour when second parameter of "
11573 "%<va_start%> is declared with %<register%> storage");
11575 /* We want to verify the second parameter just once before the tree
11576 optimizers are run and then avoid keeping it in the tree,
11577 as otherwise we could warn even for correct code like:
11578 void foo (int i, ...)
11579 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
11581 CALL_EXPR_ARG (exp, 1) = integer_zero_node;
11583 CALL_EXPR_ARG (exp, 0) = integer_zero_node;
11589 /* Simplify a call to the sprintf builtin with arguments DEST, FMT, and ORIG.
11590 ORIG may be null if this is a 2-argument call. We don't attempt to
11591 simplify calls with more than 3 arguments.
11593 Return NULL_TREE if no simplification was possible, otherwise return the
11594 simplified form of the call as a tree. If IGNORED is true, it means that
11595 the caller does not use the returned value of the function. */
11598 fold_builtin_sprintf (location_t loc, tree dest, tree fmt,
11599 tree orig, int ignored)
11602 const char *fmt_str = NULL;
11604 /* Verify the required arguments in the original call. We deal with two
11605 types of sprintf() calls: 'sprintf (str, fmt)' and
11606 'sprintf (dest, "%s", orig)'. */
11607 if (!validate_arg (dest, POINTER_TYPE)
11608 || !validate_arg (fmt, POINTER_TYPE))
11610 if (orig && !validate_arg (orig, POINTER_TYPE))
11613 /* Check whether the format is a literal string constant. */
11614 fmt_str = c_getstr (fmt);
11615 if (fmt_str == NULL)
11619 retval = NULL_TREE;
11621 if (!init_target_chars ())
11624 /* If the format doesn't contain % args or %%, use strcpy. */
11625 if (strchr (fmt_str, target_percent) == NULL)
11627 tree fn = implicit_built_in_decls[BUILT_IN_STRCPY];
11632 /* Don't optimize sprintf (buf, "abc", ptr++). */
11636 /* Convert sprintf (str, fmt) into strcpy (str, fmt) when
11637 'format' is known to contain no % formats. */
11638 call = build_call_expr_loc (loc, fn, 2, dest, fmt);
11640 retval = build_int_cst (NULL_TREE, strlen (fmt_str));
11643 /* If the format is "%s", use strcpy if the result isn't used. */
11644 else if (fmt_str && strcmp (fmt_str, target_percent_s) == 0)
11647 fn = implicit_built_in_decls[BUILT_IN_STRCPY];
11652 /* Don't crash on sprintf (str1, "%s"). */
11656 /* Convert sprintf (str1, "%s", str2) into strcpy (str1, str2). */
11659 retval = c_strlen (orig, 1);
11660 if (!retval || TREE_CODE (retval) != INTEGER_CST)
11663 call = build_call_expr_loc (loc, fn, 2, dest, orig);
11666 if (call && retval)
11668 retval = fold_convert_loc
11669 (loc, TREE_TYPE (TREE_TYPE (implicit_built_in_decls[BUILT_IN_SPRINTF])),
11671 return build2 (COMPOUND_EXPR, TREE_TYPE (retval), call, retval);
11677 /* Expand a call EXP to __builtin_object_size. */
11680 expand_builtin_object_size (tree exp)
11683 int object_size_type;
11684 tree fndecl = get_callee_fndecl (exp);
11686 if (!validate_arglist (exp, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
11688 error ("%Kfirst argument of %D must be a pointer, second integer constant",
11690 expand_builtin_trap ();
11694 ost = CALL_EXPR_ARG (exp, 1);
11697 if (TREE_CODE (ost) != INTEGER_CST
11698 || tree_int_cst_sgn (ost) < 0
11699 || compare_tree_int (ost, 3) > 0)
11701 error ("%Klast argument of %D is not integer constant between 0 and 3",
11703 expand_builtin_trap ();
11707 object_size_type = tree_low_cst (ost, 0);
11709 return object_size_type < 2 ? constm1_rtx : const0_rtx;
11712 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
11713 FCODE is the BUILT_IN_* to use.
11714 Return NULL_RTX if we failed; the caller should emit a normal call,
11715 otherwise try to get the result in TARGET, if convenient (and in
11716 mode MODE if that's convenient). */
11719 expand_builtin_memory_chk (tree exp, rtx target, enum machine_mode mode,
11720 enum built_in_function fcode)
11722 tree dest, src, len, size;
11724 if (!validate_arglist (exp,
11726 fcode == BUILT_IN_MEMSET_CHK
11727 ? INTEGER_TYPE : POINTER_TYPE,
11728 INTEGER_TYPE, INTEGER_TYPE, VOID_TYPE))
11731 dest = CALL_EXPR_ARG (exp, 0);
11732 src = CALL_EXPR_ARG (exp, 1);
11733 len = CALL_EXPR_ARG (exp, 2);
11734 size = CALL_EXPR_ARG (exp, 3);
11736 if (! host_integerp (size, 1))
11739 if (host_integerp (len, 1) || integer_all_onesp (size))
11743 if (! integer_all_onesp (size) && tree_int_cst_lt (size, len))
11745 warning_at (tree_nonartificial_location (exp),
11746 0, "%Kcall to %D will always overflow destination buffer",
11747 exp, get_callee_fndecl (exp));
11752 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
11753 mem{cpy,pcpy,move,set} is available. */
11756 case BUILT_IN_MEMCPY_CHK:
11757 fn = built_in_decls[BUILT_IN_MEMCPY];
11759 case BUILT_IN_MEMPCPY_CHK:
11760 fn = built_in_decls[BUILT_IN_MEMPCPY];
11762 case BUILT_IN_MEMMOVE_CHK:
11763 fn = built_in_decls[BUILT_IN_MEMMOVE];
11765 case BUILT_IN_MEMSET_CHK:
11766 fn = built_in_decls[BUILT_IN_MEMSET];
11775 fn = build_call_nofold (fn, 3, dest, src, len);
11776 gcc_assert (TREE_CODE (fn) == CALL_EXPR);
11777 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
11778 return expand_expr (fn, target, mode, EXPAND_NORMAL);
11780 else if (fcode == BUILT_IN_MEMSET_CHK)
11784 unsigned int dest_align
11785 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
11787 /* If DEST is not a pointer type, call the normal function. */
11788 if (dest_align == 0)
11791 /* If SRC and DEST are the same (and not volatile), do nothing. */
11792 if (operand_equal_p (src, dest, 0))
11796 if (fcode != BUILT_IN_MEMPCPY_CHK)
11798 /* Evaluate and ignore LEN in case it has side-effects. */
11799 expand_expr (len, const0_rtx, VOIDmode, EXPAND_NORMAL);
11800 return expand_expr (dest, target, mode, EXPAND_NORMAL);
11803 expr = fold_build2 (POINTER_PLUS_EXPR, TREE_TYPE (dest), dest, len);
11804 return expand_expr (expr, target, mode, EXPAND_NORMAL);
11807 /* __memmove_chk special case. */
11808 if (fcode == BUILT_IN_MEMMOVE_CHK)
11810 unsigned int src_align
11811 = get_pointer_alignment (src, BIGGEST_ALIGNMENT);
11813 if (src_align == 0)
11816 /* If src is categorized for a readonly section we can use
11817 normal __memcpy_chk. */
11818 if (readonly_data_expr (src))
11820 tree fn = built_in_decls[BUILT_IN_MEMCPY_CHK];
11823 fn = build_call_nofold (fn, 4, dest, src, len, size);
11824 gcc_assert (TREE_CODE (fn) == CALL_EXPR);
11825 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
11826 return expand_expr (fn, target, mode, EXPAND_NORMAL);
11833 /* Emit warning if a buffer overflow is detected at compile time. */
11836 maybe_emit_chk_warning (tree exp, enum built_in_function fcode)
11840 location_t loc = tree_nonartificial_location (exp);
11844 case BUILT_IN_STRCPY_CHK:
11845 case BUILT_IN_STPCPY_CHK:
11846 /* For __strcat_chk the warning will be emitted only if overflowing
11847 by at least strlen (dest) + 1 bytes. */
11848 case BUILT_IN_STRCAT_CHK:
11849 len = CALL_EXPR_ARG (exp, 1);
11850 size = CALL_EXPR_ARG (exp, 2);
11853 case BUILT_IN_STRNCAT_CHK:
11854 case BUILT_IN_STRNCPY_CHK:
11855 len = CALL_EXPR_ARG (exp, 2);
11856 size = CALL_EXPR_ARG (exp, 3);
11858 case BUILT_IN_SNPRINTF_CHK:
11859 case BUILT_IN_VSNPRINTF_CHK:
11860 len = CALL_EXPR_ARG (exp, 1);
11861 size = CALL_EXPR_ARG (exp, 3);
11864 gcc_unreachable ();
11870 if (! host_integerp (size, 1) || integer_all_onesp (size))
11875 len = c_strlen (len, 1);
11876 if (! len || ! host_integerp (len, 1) || tree_int_cst_lt (len, size))
11879 else if (fcode == BUILT_IN_STRNCAT_CHK)
11881 tree src = CALL_EXPR_ARG (exp, 1);
11882 if (! src || ! host_integerp (len, 1) || tree_int_cst_lt (len, size))
11884 src = c_strlen (src, 1);
11885 if (! src || ! host_integerp (src, 1))
11887 warning_at (loc, 0, "%Kcall to %D might overflow destination buffer",
11888 exp, get_callee_fndecl (exp));
11891 else if (tree_int_cst_lt (src, size))
11894 else if (! host_integerp (len, 1) || ! tree_int_cst_lt (size, len))
11897 warning_at (loc, 0, "%Kcall to %D will always overflow destination buffer",
11898 exp, get_callee_fndecl (exp));
11901 /* Emit warning if a buffer overflow is detected at compile time
11902 in __sprintf_chk/__vsprintf_chk calls. */
11905 maybe_emit_sprintf_chk_warning (tree exp, enum built_in_function fcode)
11907 tree size, len, fmt;
11908 const char *fmt_str;
11909 int nargs = call_expr_nargs (exp);
11911 /* Verify the required arguments in the original call. */
11915 size = CALL_EXPR_ARG (exp, 2);
11916 fmt = CALL_EXPR_ARG (exp, 3);
11918 if (! host_integerp (size, 1) || integer_all_onesp (size))
11921 /* Check whether the format is a literal string constant. */
11922 fmt_str = c_getstr (fmt);
11923 if (fmt_str == NULL)
11926 if (!init_target_chars ())
11929 /* If the format doesn't contain % args or %%, we know its size. */
11930 if (strchr (fmt_str, target_percent) == 0)
11931 len = build_int_cstu (size_type_node, strlen (fmt_str));
11932 /* If the format is "%s" and first ... argument is a string literal,
11934 else if (fcode == BUILT_IN_SPRINTF_CHK
11935 && strcmp (fmt_str, target_percent_s) == 0)
11941 arg = CALL_EXPR_ARG (exp, 4);
11942 if (! POINTER_TYPE_P (TREE_TYPE (arg)))
11945 len = c_strlen (arg, 1);
11946 if (!len || ! host_integerp (len, 1))
11952 if (! tree_int_cst_lt (len, size))
11953 warning_at (tree_nonartificial_location (exp),
11954 0, "%Kcall to %D will always overflow destination buffer",
11955 exp, get_callee_fndecl (exp));
11958 /* Emit warning if a free is called with address of a variable. */
11961 maybe_emit_free_warning (tree exp)
11963 tree arg = CALL_EXPR_ARG (exp, 0);
11966 if (TREE_CODE (arg) != ADDR_EXPR)
11969 arg = get_base_address (TREE_OPERAND (arg, 0));
11970 if (arg == NULL || INDIRECT_REF_P (arg))
11973 if (SSA_VAR_P (arg))
11974 warning_at (tree_nonartificial_location (exp),
11975 0, "%Kattempt to free a non-heap object %qD", exp, arg);
11977 warning_at (tree_nonartificial_location (exp),
11978 0, "%Kattempt to free a non-heap object", exp);
11981 /* Fold a call to __builtin_object_size with arguments PTR and OST,
11985 fold_builtin_object_size (tree ptr, tree ost)
11987 tree ret = NULL_TREE;
11988 int object_size_type;
11990 if (!validate_arg (ptr, POINTER_TYPE)
11991 || !validate_arg (ost, INTEGER_TYPE))
11996 if (TREE_CODE (ost) != INTEGER_CST
11997 || tree_int_cst_sgn (ost) < 0
11998 || compare_tree_int (ost, 3) > 0)
12001 object_size_type = tree_low_cst (ost, 0);
12003 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
12004 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
12005 and (size_t) 0 for types 2 and 3. */
12006 if (TREE_SIDE_EFFECTS (ptr))
12007 return build_int_cst_type (size_type_node, object_size_type < 2 ? -1 : 0);
12009 if (TREE_CODE (ptr) == ADDR_EXPR)
12010 ret = build_int_cstu (size_type_node,
12011 compute_builtin_object_size (ptr, object_size_type));
12013 else if (TREE_CODE (ptr) == SSA_NAME)
12015 unsigned HOST_WIDE_INT bytes;
12017 /* If object size is not known yet, delay folding until
12018 later. Maybe subsequent passes will help determining
12020 bytes = compute_builtin_object_size (ptr, object_size_type);
12021 if (bytes != (unsigned HOST_WIDE_INT) (object_size_type < 2
12023 ret = build_int_cstu (size_type_node, bytes);
12028 unsigned HOST_WIDE_INT low = TREE_INT_CST_LOW (ret);
12029 HOST_WIDE_INT high = TREE_INT_CST_HIGH (ret);
12030 if (fit_double_type (low, high, &low, &high, TREE_TYPE (ret)))
12037 /* Fold a call to the __mem{cpy,pcpy,move,set}_chk builtin.
12038 DEST, SRC, LEN, and SIZE are the arguments to the call.
12039 IGNORE is true, if return value can be ignored. FCODE is the BUILT_IN_*
12040 code of the builtin. If MAXLEN is not NULL, it is maximum length
12041 passed as third argument. */
12044 fold_builtin_memory_chk (location_t loc, tree fndecl,
12045 tree dest, tree src, tree len, tree size,
12046 tree maxlen, bool ignore,
12047 enum built_in_function fcode)
12051 if (!validate_arg (dest, POINTER_TYPE)
12052 || !validate_arg (src,
12053 (fcode == BUILT_IN_MEMSET_CHK
12054 ? INTEGER_TYPE : POINTER_TYPE))
12055 || !validate_arg (len, INTEGER_TYPE)
12056 || !validate_arg (size, INTEGER_TYPE))
12059 /* If SRC and DEST are the same (and not volatile), return DEST
12060 (resp. DEST+LEN for __mempcpy_chk). */
12061 if (fcode != BUILT_IN_MEMSET_CHK && operand_equal_p (src, dest, 0))
12063 if (fcode != BUILT_IN_MEMPCPY_CHK)
12064 return omit_one_operand_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)),
12068 tree temp = fold_build2_loc (loc, POINTER_PLUS_EXPR, TREE_TYPE (dest),
12070 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), temp);
12074 if (! host_integerp (size, 1))
12077 if (! integer_all_onesp (size))
12079 if (! host_integerp (len, 1))
12081 /* If LEN is not constant, try MAXLEN too.
12082 For MAXLEN only allow optimizing into non-_ocs function
12083 if SIZE is >= MAXLEN, never convert to __ocs_fail (). */
12084 if (maxlen == NULL_TREE || ! host_integerp (maxlen, 1))
12086 if (fcode == BUILT_IN_MEMPCPY_CHK && ignore)
12088 /* (void) __mempcpy_chk () can be optimized into
12089 (void) __memcpy_chk (). */
12090 fn = built_in_decls[BUILT_IN_MEMCPY_CHK];
12094 return build_call_expr_loc (loc, fn, 4, dest, src, len, size);
12102 if (tree_int_cst_lt (size, maxlen))
12107 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
12108 mem{cpy,pcpy,move,set} is available. */
12111 case BUILT_IN_MEMCPY_CHK:
12112 fn = built_in_decls[BUILT_IN_MEMCPY];
12114 case BUILT_IN_MEMPCPY_CHK:
12115 fn = built_in_decls[BUILT_IN_MEMPCPY];
12117 case BUILT_IN_MEMMOVE_CHK:
12118 fn = built_in_decls[BUILT_IN_MEMMOVE];
12120 case BUILT_IN_MEMSET_CHK:
12121 fn = built_in_decls[BUILT_IN_MEMSET];
12130 return build_call_expr_loc (loc, fn, 3, dest, src, len);
12133 /* Fold a call to the __st[rp]cpy_chk builtin.
12134 DEST, SRC, and SIZE are the arguments to the call.
12135 IGNORE is true if return value can be ignored. FCODE is the BUILT_IN_*
12136 code of the builtin. If MAXLEN is not NULL, it is maximum length of
12137 strings passed as second argument. */
12140 fold_builtin_stxcpy_chk (location_t loc, tree fndecl, tree dest,
12141 tree src, tree size,
12142 tree maxlen, bool ignore,
12143 enum built_in_function fcode)
12147 if (!validate_arg (dest, POINTER_TYPE)
12148 || !validate_arg (src, POINTER_TYPE)
12149 || !validate_arg (size, INTEGER_TYPE))
12152 /* If SRC and DEST are the same (and not volatile), return DEST. */
12153 if (fcode == BUILT_IN_STRCPY_CHK && operand_equal_p (src, dest, 0))
12154 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest);
12156 if (! host_integerp (size, 1))
12159 if (! integer_all_onesp (size))
12161 len = c_strlen (src, 1);
12162 if (! len || ! host_integerp (len, 1))
12164 /* If LEN is not constant, try MAXLEN too.
12165 For MAXLEN only allow optimizing into non-_ocs function
12166 if SIZE is >= MAXLEN, never convert to __ocs_fail (). */
12167 if (maxlen == NULL_TREE || ! host_integerp (maxlen, 1))
12169 if (fcode == BUILT_IN_STPCPY_CHK)
12174 /* If return value of __stpcpy_chk is ignored,
12175 optimize into __strcpy_chk. */
12176 fn = built_in_decls[BUILT_IN_STRCPY_CHK];
12180 return build_call_expr_loc (loc, fn, 3, dest, src, size);
12183 if (! len || TREE_SIDE_EFFECTS (len))
12186 /* If c_strlen returned something, but not a constant,
12187 transform __strcpy_chk into __memcpy_chk. */
12188 fn = built_in_decls[BUILT_IN_MEMCPY_CHK];
12192 len = size_binop_loc (loc, PLUS_EXPR, len, ssize_int (1));
12193 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)),
12194 build_call_expr_loc (loc, fn, 4,
12195 dest, src, len, size));
12201 if (! tree_int_cst_lt (maxlen, size))
12205 /* If __builtin_st{r,p}cpy_chk is used, assume st{r,p}cpy is available. */
12206 fn = built_in_decls[fcode == BUILT_IN_STPCPY_CHK
12207 ? BUILT_IN_STPCPY : BUILT_IN_STRCPY];
12211 return build_call_expr_loc (loc, fn, 2, dest, src);
12214 /* Fold a call to the __strncpy_chk builtin. DEST, SRC, LEN, and SIZE
12215 are the arguments to the call. If MAXLEN is not NULL, it is maximum
12216 length passed as third argument. */
12219 fold_builtin_strncpy_chk (location_t loc, tree dest, tree src,
12220 tree len, tree size, tree maxlen)
12224 if (!validate_arg (dest, POINTER_TYPE)
12225 || !validate_arg (src, POINTER_TYPE)
12226 || !validate_arg (len, INTEGER_TYPE)
12227 || !validate_arg (size, INTEGER_TYPE))
12230 if (! host_integerp (size, 1))
12233 if (! integer_all_onesp (size))
12235 if (! host_integerp (len, 1))
12237 /* If LEN is not constant, try MAXLEN too.
12238 For MAXLEN only allow optimizing into non-_ocs function
12239 if SIZE is >= MAXLEN, never convert to __ocs_fail (). */
12240 if (maxlen == NULL_TREE || ! host_integerp (maxlen, 1))
12246 if (tree_int_cst_lt (size, maxlen))
12250 /* If __builtin_strncpy_chk is used, assume strncpy is available. */
12251 fn = built_in_decls[BUILT_IN_STRNCPY];
12255 return build_call_expr_loc (loc, fn, 3, dest, src, len);
12258 /* Fold a call to the __strcat_chk builtin FNDECL. DEST, SRC, and SIZE
12259 are the arguments to the call. */
12262 fold_builtin_strcat_chk (location_t loc, tree fndecl, tree dest,
12263 tree src, tree size)
12268 if (!validate_arg (dest, POINTER_TYPE)
12269 || !validate_arg (src, POINTER_TYPE)
12270 || !validate_arg (size, INTEGER_TYPE))
12273 p = c_getstr (src);
12274 /* If the SRC parameter is "", return DEST. */
12275 if (p && *p == '\0')
12276 return omit_one_operand_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest, src);
12278 if (! host_integerp (size, 1) || ! integer_all_onesp (size))
12281 /* If __builtin_strcat_chk is used, assume strcat is available. */
12282 fn = built_in_decls[BUILT_IN_STRCAT];
12286 return build_call_expr_loc (loc, fn, 2, dest, src);
12289 /* Fold a call to the __strncat_chk builtin with arguments DEST, SRC,
12293 fold_builtin_strncat_chk (location_t loc, tree fndecl,
12294 tree dest, tree src, tree len, tree size)
12299 if (!validate_arg (dest, POINTER_TYPE)
12300 || !validate_arg (src, POINTER_TYPE)
12301 || !validate_arg (size, INTEGER_TYPE)
12302 || !validate_arg (size, INTEGER_TYPE))
12305 p = c_getstr (src);
12306 /* If the SRC parameter is "" or if LEN is 0, return DEST. */
12307 if (p && *p == '\0')
12308 return omit_one_operand_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest, len);
12309 else if (integer_zerop (len))
12310 return omit_one_operand_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest, src);
12312 if (! host_integerp (size, 1))
12315 if (! integer_all_onesp (size))
12317 tree src_len = c_strlen (src, 1);
12319 && host_integerp (src_len, 1)
12320 && host_integerp (len, 1)
12321 && ! tree_int_cst_lt (len, src_len))
12323 /* If LEN >= strlen (SRC), optimize into __strcat_chk. */
12324 fn = built_in_decls[BUILT_IN_STRCAT_CHK];
12328 return build_call_expr_loc (loc, fn, 3, dest, src, size);
12333 /* If __builtin_strncat_chk is used, assume strncat is available. */
12334 fn = built_in_decls[BUILT_IN_STRNCAT];
12338 return build_call_expr_loc (loc, fn, 3, dest, src, len);
12341 /* Fold a call EXP to __{,v}sprintf_chk. Return NULL_TREE if
12342 a normal call should be emitted rather than expanding the function
12343 inline. FCODE is either BUILT_IN_SPRINTF_CHK or BUILT_IN_VSPRINTF_CHK. */
12346 fold_builtin_sprintf_chk (location_t loc, tree exp,
12347 enum built_in_function fcode)
12349 tree dest, size, len, fn, fmt, flag;
12350 const char *fmt_str;
12351 int nargs = call_expr_nargs (exp);
12353 /* Verify the required arguments in the original call. */
12356 dest = CALL_EXPR_ARG (exp, 0);
12357 if (!validate_arg (dest, POINTER_TYPE))
12359 flag = CALL_EXPR_ARG (exp, 1);
12360 if (!validate_arg (flag, INTEGER_TYPE))
12362 size = CALL_EXPR_ARG (exp, 2);
12363 if (!validate_arg (size, INTEGER_TYPE))
12365 fmt = CALL_EXPR_ARG (exp, 3);
12366 if (!validate_arg (fmt, POINTER_TYPE))
12369 if (! host_integerp (size, 1))
12374 if (!init_target_chars ())
12377 /* Check whether the format is a literal string constant. */
12378 fmt_str = c_getstr (fmt);
12379 if (fmt_str != NULL)
12381 /* If the format doesn't contain % args or %%, we know the size. */
12382 if (strchr (fmt_str, target_percent) == 0)
12384 if (fcode != BUILT_IN_SPRINTF_CHK || nargs == 4)
12385 len = build_int_cstu (size_type_node, strlen (fmt_str));
12387 /* If the format is "%s" and first ... argument is a string literal,
12388 we know the size too. */
12389 else if (fcode == BUILT_IN_SPRINTF_CHK
12390 && strcmp (fmt_str, target_percent_s) == 0)
12396 arg = CALL_EXPR_ARG (exp, 4);
12397 if (validate_arg (arg, POINTER_TYPE))
12399 len = c_strlen (arg, 1);
12400 if (! len || ! host_integerp (len, 1))
12407 if (! integer_all_onesp (size))
12409 if (! len || ! tree_int_cst_lt (len, size))
12413 /* Only convert __{,v}sprintf_chk to {,v}sprintf if flag is 0
12414 or if format doesn't contain % chars or is "%s". */
12415 if (! integer_zerop (flag))
12417 if (fmt_str == NULL)
12419 if (strchr (fmt_str, target_percent) != NULL
12420 && strcmp (fmt_str, target_percent_s))
12424 /* If __builtin_{,v}sprintf_chk is used, assume {,v}sprintf is available. */
12425 fn = built_in_decls[fcode == BUILT_IN_VSPRINTF_CHK
12426 ? BUILT_IN_VSPRINTF : BUILT_IN_SPRINTF];
12430 return rewrite_call_expr (loc, exp, 4, fn, 2, dest, fmt);
12433 /* Fold a call EXP to {,v}snprintf. Return NULL_TREE if
12434 a normal call should be emitted rather than expanding the function
12435 inline. FCODE is either BUILT_IN_SNPRINTF_CHK or
12436 BUILT_IN_VSNPRINTF_CHK. If MAXLEN is not NULL, it is maximum length
12437 passed as second argument. */
12440 fold_builtin_snprintf_chk (location_t loc, tree exp, tree maxlen,
12441 enum built_in_function fcode)
12443 tree dest, size, len, fn, fmt, flag;
12444 const char *fmt_str;
12446 /* Verify the required arguments in the original call. */
12447 if (call_expr_nargs (exp) < 5)
12449 dest = CALL_EXPR_ARG (exp, 0);
12450 if (!validate_arg (dest, POINTER_TYPE))
12452 len = CALL_EXPR_ARG (exp, 1);
12453 if (!validate_arg (len, INTEGER_TYPE))
12455 flag = CALL_EXPR_ARG (exp, 2);
12456 if (!validate_arg (flag, INTEGER_TYPE))
12458 size = CALL_EXPR_ARG (exp, 3);
12459 if (!validate_arg (size, INTEGER_TYPE))
12461 fmt = CALL_EXPR_ARG (exp, 4);
12462 if (!validate_arg (fmt, POINTER_TYPE))
12465 if (! host_integerp (size, 1))
12468 if (! integer_all_onesp (size))
12470 if (! host_integerp (len, 1))
12472 /* If LEN is not constant, try MAXLEN too.
12473 For MAXLEN only allow optimizing into non-_ocs function
12474 if SIZE is >= MAXLEN, never convert to __ocs_fail (). */
12475 if (maxlen == NULL_TREE || ! host_integerp (maxlen, 1))
12481 if (tree_int_cst_lt (size, maxlen))
12485 if (!init_target_chars ())
12488 /* Only convert __{,v}snprintf_chk to {,v}snprintf if flag is 0
12489 or if format doesn't contain % chars or is "%s". */
12490 if (! integer_zerop (flag))
12492 fmt_str = c_getstr (fmt);
12493 if (fmt_str == NULL)
12495 if (strchr (fmt_str, target_percent) != NULL
12496 && strcmp (fmt_str, target_percent_s))
12500 /* If __builtin_{,v}snprintf_chk is used, assume {,v}snprintf is
12502 fn = built_in_decls[fcode == BUILT_IN_VSNPRINTF_CHK
12503 ? BUILT_IN_VSNPRINTF : BUILT_IN_SNPRINTF];
12507 return rewrite_call_expr (loc, exp, 5, fn, 3, dest, len, fmt);
12510 /* Fold a call to the {,v}printf{,_unlocked} and __{,v}printf_chk builtins.
12511 FMT and ARG are the arguments to the call; we don't fold cases with
12512 more than 2 arguments, and ARG may be null if this is a 1-argument case.
12514 Return NULL_TREE if no simplification was possible, otherwise return the
12515 simplified form of the call as a tree. FCODE is the BUILT_IN_*
12516 code of the function to be simplified. */
12519 fold_builtin_printf (location_t loc, tree fndecl, tree fmt,
12520 tree arg, bool ignore,
12521 enum built_in_function fcode)
12523 tree fn_putchar, fn_puts, newarg, call = NULL_TREE;
12524 const char *fmt_str = NULL;
12526 /* If the return value is used, don't do the transformation. */
12530 /* Verify the required arguments in the original call. */
12531 if (!validate_arg (fmt, POINTER_TYPE))
12534 /* Check whether the format is a literal string constant. */
12535 fmt_str = c_getstr (fmt);
12536 if (fmt_str == NULL)
12539 if (fcode == BUILT_IN_PRINTF_UNLOCKED)
12541 /* If we're using an unlocked function, assume the other
12542 unlocked functions exist explicitly. */
12543 fn_putchar = built_in_decls[BUILT_IN_PUTCHAR_UNLOCKED];
12544 fn_puts = built_in_decls[BUILT_IN_PUTS_UNLOCKED];
12548 fn_putchar = implicit_built_in_decls[BUILT_IN_PUTCHAR];
12549 fn_puts = implicit_built_in_decls[BUILT_IN_PUTS];
12552 if (!init_target_chars ())
12555 if (strcmp (fmt_str, target_percent_s) == 0
12556 || strchr (fmt_str, target_percent) == NULL)
12560 if (strcmp (fmt_str, target_percent_s) == 0)
12562 if (fcode == BUILT_IN_VPRINTF || fcode == BUILT_IN_VPRINTF_CHK)
12565 if (!arg || !validate_arg (arg, POINTER_TYPE))
12568 str = c_getstr (arg);
12574 /* The format specifier doesn't contain any '%' characters. */
12575 if (fcode != BUILT_IN_VPRINTF && fcode != BUILT_IN_VPRINTF_CHK
12581 /* If the string was "", printf does nothing. */
12582 if (str[0] == '\0')
12583 return build_int_cst (TREE_TYPE (TREE_TYPE (fndecl)), 0);
12585 /* If the string has length of 1, call putchar. */
12586 if (str[1] == '\0')
12588 /* Given printf("c"), (where c is any one character,)
12589 convert "c"[0] to an int and pass that to the replacement
12591 newarg = build_int_cst (NULL_TREE, str[0]);
12593 call = build_call_expr_loc (loc, fn_putchar, 1, newarg);
12597 /* If the string was "string\n", call puts("string"). */
12598 size_t len = strlen (str);
12599 if ((unsigned char)str[len - 1] == target_newline)
12601 /* Create a NUL-terminated string that's one char shorter
12602 than the original, stripping off the trailing '\n'. */
12603 char *newstr = XALLOCAVEC (char, len);
12604 memcpy (newstr, str, len - 1);
12605 newstr[len - 1] = 0;
12607 newarg = build_string_literal (len, newstr);
12609 call = build_call_expr_loc (loc, fn_puts, 1, newarg);
12612 /* We'd like to arrange to call fputs(string,stdout) here,
12613 but we need stdout and don't have a way to get it yet. */
12618 /* The other optimizations can be done only on the non-va_list variants. */
12619 else if (fcode == BUILT_IN_VPRINTF || fcode == BUILT_IN_VPRINTF_CHK)
12622 /* If the format specifier was "%s\n", call __builtin_puts(arg). */
12623 else if (strcmp (fmt_str, target_percent_s_newline) == 0)
12625 if (!arg || !validate_arg (arg, POINTER_TYPE))
12628 call = build_call_expr_loc (loc, fn_puts, 1, arg);
12631 /* If the format specifier was "%c", call __builtin_putchar(arg). */
12632 else if (strcmp (fmt_str, target_percent_c) == 0)
12634 if (!arg || !validate_arg (arg, INTEGER_TYPE))
12637 call = build_call_expr_loc (loc, fn_putchar, 1, arg);
12643 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), call);
12646 /* Fold a call to the {,v}fprintf{,_unlocked} and __{,v}printf_chk builtins.
12647 FP, FMT, and ARG are the arguments to the call. We don't fold calls with
12648 more than 3 arguments, and ARG may be null in the 2-argument case.
12650 Return NULL_TREE if no simplification was possible, otherwise return the
12651 simplified form of the call as a tree. FCODE is the BUILT_IN_*
12652 code of the function to be simplified. */
12655 fold_builtin_fprintf (location_t loc, tree fndecl, tree fp,
12656 tree fmt, tree arg, bool ignore,
12657 enum built_in_function fcode)
12659 tree fn_fputc, fn_fputs, call = NULL_TREE;
12660 const char *fmt_str = NULL;
12662 /* If the return value is used, don't do the transformation. */
12666 /* Verify the required arguments in the original call. */
12667 if (!validate_arg (fp, POINTER_TYPE))
12669 if (!validate_arg (fmt, POINTER_TYPE))
12672 /* Check whether the format is a literal string constant. */
12673 fmt_str = c_getstr (fmt);
12674 if (fmt_str == NULL)
12677 if (fcode == BUILT_IN_FPRINTF_UNLOCKED)
12679 /* If we're using an unlocked function, assume the other
12680 unlocked functions exist explicitly. */
12681 fn_fputc = built_in_decls[BUILT_IN_FPUTC_UNLOCKED];
12682 fn_fputs = built_in_decls[BUILT_IN_FPUTS_UNLOCKED];
12686 fn_fputc = implicit_built_in_decls[BUILT_IN_FPUTC];
12687 fn_fputs = implicit_built_in_decls[BUILT_IN_FPUTS];
12690 if (!init_target_chars ())
12693 /* If the format doesn't contain % args or %%, use strcpy. */
12694 if (strchr (fmt_str, target_percent) == NULL)
12696 if (fcode != BUILT_IN_VFPRINTF && fcode != BUILT_IN_VFPRINTF_CHK
12700 /* If the format specifier was "", fprintf does nothing. */
12701 if (fmt_str[0] == '\0')
12703 /* If FP has side-effects, just wait until gimplification is
12705 if (TREE_SIDE_EFFECTS (fp))
12708 return build_int_cst (TREE_TYPE (TREE_TYPE (fndecl)), 0);
12711 /* When "string" doesn't contain %, replace all cases of
12712 fprintf (fp, string) with fputs (string, fp). The fputs
12713 builtin will take care of special cases like length == 1. */
12715 call = build_call_expr_loc (loc, fn_fputs, 2, fmt, fp);
12718 /* The other optimizations can be done only on the non-va_list variants. */
12719 else if (fcode == BUILT_IN_VFPRINTF || fcode == BUILT_IN_VFPRINTF_CHK)
12722 /* If the format specifier was "%s", call __builtin_fputs (arg, fp). */
12723 else if (strcmp (fmt_str, target_percent_s) == 0)
12725 if (!arg || !validate_arg (arg, POINTER_TYPE))
12728 call = build_call_expr_loc (loc, fn_fputs, 2, arg, fp);
12731 /* If the format specifier was "%c", call __builtin_fputc (arg, fp). */
12732 else if (strcmp (fmt_str, target_percent_c) == 0)
12734 if (!arg || !validate_arg (arg, INTEGER_TYPE))
12737 call = build_call_expr_loc (loc, fn_fputc, 2, arg, fp);
12742 return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), call);
12745 /* Initialize format string characters in the target charset. */
12748 init_target_chars (void)
12753 target_newline = lang_hooks.to_target_charset ('\n');
12754 target_percent = lang_hooks.to_target_charset ('%');
12755 target_c = lang_hooks.to_target_charset ('c');
12756 target_s = lang_hooks.to_target_charset ('s');
12757 if (target_newline == 0 || target_percent == 0 || target_c == 0
12761 target_percent_c[0] = target_percent;
12762 target_percent_c[1] = target_c;
12763 target_percent_c[2] = '\0';
12765 target_percent_s[0] = target_percent;
12766 target_percent_s[1] = target_s;
12767 target_percent_s[2] = '\0';
12769 target_percent_s_newline[0] = target_percent;
12770 target_percent_s_newline[1] = target_s;
12771 target_percent_s_newline[2] = target_newline;
12772 target_percent_s_newline[3] = '\0';
12779 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
12780 and no overflow/underflow occurred. INEXACT is true if M was not
12781 exactly calculated. TYPE is the tree type for the result. This
12782 function assumes that you cleared the MPFR flags and then
12783 calculated M to see if anything subsequently set a flag prior to
12784 entering this function. Return NULL_TREE if any checks fail. */
12787 do_mpfr_ckconv (mpfr_srcptr m, tree type, int inexact)
12789 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
12790 overflow/underflow occurred. If -frounding-math, proceed iff the
12791 result of calling FUNC was exact. */
12792 if (mpfr_number_p (m) && !mpfr_overflow_p () && !mpfr_underflow_p ()
12793 && (!flag_rounding_math || !inexact))
12795 REAL_VALUE_TYPE rr;
12797 real_from_mpfr (&rr, m, type, GMP_RNDN);
12798 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
12799 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
12800 but the mpft_t is not, then we underflowed in the
12802 if (real_isfinite (&rr)
12803 && (rr.cl == rvc_zero) == (mpfr_zero_p (m) != 0))
12805 REAL_VALUE_TYPE rmode;
12807 real_convert (&rmode, TYPE_MODE (type), &rr);
12808 /* Proceed iff the specified mode can hold the value. */
12809 if (real_identical (&rmode, &rr))
12810 return build_real (type, rmode);
12816 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
12817 number and no overflow/underflow occurred. INEXACT is true if M
12818 was not exactly calculated. TYPE is the tree type for the result.
12819 This function assumes that you cleared the MPFR flags and then
12820 calculated M to see if anything subsequently set a flag prior to
12821 entering this function. Return NULL_TREE if any checks fail, if
12822 FORCE_CONVERT is true, then bypass the checks. */
12825 do_mpc_ckconv (mpc_srcptr m, tree type, int inexact, int force_convert)
12827 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
12828 overflow/underflow occurred. If -frounding-math, proceed iff the
12829 result of calling FUNC was exact. */
12831 || (mpfr_number_p (mpc_realref (m)) && mpfr_number_p (mpc_imagref (m))
12832 && !mpfr_overflow_p () && !mpfr_underflow_p ()
12833 && (!flag_rounding_math || !inexact)))
12835 REAL_VALUE_TYPE re, im;
12837 real_from_mpfr (&re, mpc_realref (m), TREE_TYPE (type), GMP_RNDN);
12838 real_from_mpfr (&im, mpc_imagref (m), TREE_TYPE (type), GMP_RNDN);
12839 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
12840 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
12841 but the mpft_t is not, then we underflowed in the
12844 || (real_isfinite (&re) && real_isfinite (&im)
12845 && (re.cl == rvc_zero) == (mpfr_zero_p (mpc_realref (m)) != 0)
12846 && (im.cl == rvc_zero) == (mpfr_zero_p (mpc_imagref (m)) != 0)))
12848 REAL_VALUE_TYPE re_mode, im_mode;
12850 real_convert (&re_mode, TYPE_MODE (TREE_TYPE (type)), &re);
12851 real_convert (&im_mode, TYPE_MODE (TREE_TYPE (type)), &im);
12852 /* Proceed iff the specified mode can hold the value. */
12854 || (real_identical (&re_mode, &re)
12855 && real_identical (&im_mode, &im)))
12856 return build_complex (type, build_real (TREE_TYPE (type), re_mode),
12857 build_real (TREE_TYPE (type), im_mode));
12863 /* If argument ARG is a REAL_CST, call the one-argument mpfr function
12864 FUNC on it and return the resulting value as a tree with type TYPE.
12865 If MIN and/or MAX are not NULL, then the supplied ARG must be
12866 within those bounds. If INCLUSIVE is true, then MIN/MAX are
12867 acceptable values, otherwise they are not. The mpfr precision is
12868 set to the precision of TYPE. We assume that function FUNC returns
12869 zero if the result could be calculated exactly within the requested
12873 do_mpfr_arg1 (tree arg, tree type, int (*func)(mpfr_ptr, mpfr_srcptr, mp_rnd_t),
12874 const REAL_VALUE_TYPE *min, const REAL_VALUE_TYPE *max,
12877 tree result = NULL_TREE;
12881 /* To proceed, MPFR must exactly represent the target floating point
12882 format, which only happens when the target base equals two. */
12883 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
12884 && TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg))
12886 const REAL_VALUE_TYPE *const ra = &TREE_REAL_CST (arg);
12888 if (real_isfinite (ra)
12889 && (!min || real_compare (inclusive ? GE_EXPR: GT_EXPR , ra, min))
12890 && (!max || real_compare (inclusive ? LE_EXPR: LT_EXPR , ra, max)))
12892 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
12893 const int prec = fmt->p;
12894 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
12898 mpfr_init2 (m, prec);
12899 mpfr_from_real (m, ra, GMP_RNDN);
12900 mpfr_clear_flags ();
12901 inexact = func (m, m, rnd);
12902 result = do_mpfr_ckconv (m, type, inexact);
12910 /* If argument ARG is a REAL_CST, call the two-argument mpfr function
12911 FUNC on it and return the resulting value as a tree with type TYPE.
12912 The mpfr precision is set to the precision of TYPE. We assume that
12913 function FUNC returns zero if the result could be calculated
12914 exactly within the requested precision. */
12917 do_mpfr_arg2 (tree arg1, tree arg2, tree type,
12918 int (*func)(mpfr_ptr, mpfr_srcptr, mpfr_srcptr, mp_rnd_t))
12920 tree result = NULL_TREE;
12925 /* To proceed, MPFR must exactly represent the target floating point
12926 format, which only happens when the target base equals two. */
12927 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
12928 && TREE_CODE (arg1) == REAL_CST && !TREE_OVERFLOW (arg1)
12929 && TREE_CODE (arg2) == REAL_CST && !TREE_OVERFLOW (arg2))
12931 const REAL_VALUE_TYPE *const ra1 = &TREE_REAL_CST (arg1);
12932 const REAL_VALUE_TYPE *const ra2 = &TREE_REAL_CST (arg2);
12934 if (real_isfinite (ra1) && real_isfinite (ra2))
12936 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
12937 const int prec = fmt->p;
12938 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
12942 mpfr_inits2 (prec, m1, m2, NULL);
12943 mpfr_from_real (m1, ra1, GMP_RNDN);
12944 mpfr_from_real (m2, ra2, GMP_RNDN);
12945 mpfr_clear_flags ();
12946 inexact = func (m1, m1, m2, rnd);
12947 result = do_mpfr_ckconv (m1, type, inexact);
12948 mpfr_clears (m1, m2, NULL);
12955 /* If argument ARG is a REAL_CST, call the three-argument mpfr function
12956 FUNC on it and return the resulting value as a tree with type TYPE.
12957 The mpfr precision is set to the precision of TYPE. We assume that
12958 function FUNC returns zero if the result could be calculated
12959 exactly within the requested precision. */
12962 do_mpfr_arg3 (tree arg1, tree arg2, tree arg3, tree type,
12963 int (*func)(mpfr_ptr, mpfr_srcptr, mpfr_srcptr, mpfr_srcptr, mp_rnd_t))
12965 tree result = NULL_TREE;
12971 /* To proceed, MPFR must exactly represent the target floating point
12972 format, which only happens when the target base equals two. */
12973 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
12974 && TREE_CODE (arg1) == REAL_CST && !TREE_OVERFLOW (arg1)
12975 && TREE_CODE (arg2) == REAL_CST && !TREE_OVERFLOW (arg2)
12976 && TREE_CODE (arg3) == REAL_CST && !TREE_OVERFLOW (arg3))
12978 const REAL_VALUE_TYPE *const ra1 = &TREE_REAL_CST (arg1);
12979 const REAL_VALUE_TYPE *const ra2 = &TREE_REAL_CST (arg2);
12980 const REAL_VALUE_TYPE *const ra3 = &TREE_REAL_CST (arg3);
12982 if (real_isfinite (ra1) && real_isfinite (ra2) && real_isfinite (ra3))
12984 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
12985 const int prec = fmt->p;
12986 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
12990 mpfr_inits2 (prec, m1, m2, m3, NULL);
12991 mpfr_from_real (m1, ra1, GMP_RNDN);
12992 mpfr_from_real (m2, ra2, GMP_RNDN);
12993 mpfr_from_real (m3, ra3, GMP_RNDN);
12994 mpfr_clear_flags ();
12995 inexact = func (m1, m1, m2, m3, rnd);
12996 result = do_mpfr_ckconv (m1, type, inexact);
12997 mpfr_clears (m1, m2, m3, NULL);
13004 /* If argument ARG is a REAL_CST, call mpfr_sin_cos() on it and set
13005 the pointers *(ARG_SINP) and *(ARG_COSP) to the resulting values.
13006 If ARG_SINP and ARG_COSP are NULL then the result is returned
13007 as a complex value.
13008 The type is taken from the type of ARG and is used for setting the
13009 precision of the calculation and results. */
13012 do_mpfr_sincos (tree arg, tree arg_sinp, tree arg_cosp)
13014 tree const type = TREE_TYPE (arg);
13015 tree result = NULL_TREE;
13019 /* To proceed, MPFR must exactly represent the target floating point
13020 format, which only happens when the target base equals two. */
13021 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
13022 && TREE_CODE (arg) == REAL_CST
13023 && !TREE_OVERFLOW (arg))
13025 const REAL_VALUE_TYPE *const ra = &TREE_REAL_CST (arg);
13027 if (real_isfinite (ra))
13029 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
13030 const int prec = fmt->p;
13031 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
13032 tree result_s, result_c;
13036 mpfr_inits2 (prec, m, ms, mc, NULL);
13037 mpfr_from_real (m, ra, GMP_RNDN);
13038 mpfr_clear_flags ();
13039 inexact = mpfr_sin_cos (ms, mc, m, rnd);
13040 result_s = do_mpfr_ckconv (ms, type, inexact);
13041 result_c = do_mpfr_ckconv (mc, type, inexact);
13042 mpfr_clears (m, ms, mc, NULL);
13043 if (result_s && result_c)
13045 /* If we are to return in a complex value do so. */
13046 if (!arg_sinp && !arg_cosp)
13047 return build_complex (build_complex_type (type),
13048 result_c, result_s);
13050 /* Dereference the sin/cos pointer arguments. */
13051 arg_sinp = build_fold_indirect_ref (arg_sinp);
13052 arg_cosp = build_fold_indirect_ref (arg_cosp);
13053 /* Proceed if valid pointer type were passed in. */
13054 if (TYPE_MAIN_VARIANT (TREE_TYPE (arg_sinp)) == TYPE_MAIN_VARIANT (type)
13055 && TYPE_MAIN_VARIANT (TREE_TYPE (arg_cosp)) == TYPE_MAIN_VARIANT (type))
13057 /* Set the values. */
13058 result_s = fold_build2 (MODIFY_EXPR, type, arg_sinp,
13060 TREE_SIDE_EFFECTS (result_s) = 1;
13061 result_c = fold_build2 (MODIFY_EXPR, type, arg_cosp,
13063 TREE_SIDE_EFFECTS (result_c) = 1;
13064 /* Combine the assignments into a compound expr. */
13065 result = non_lvalue (fold_build2 (COMPOUND_EXPR, type,
13066 result_s, result_c));
13074 /* If argument ARG1 is an INTEGER_CST and ARG2 is a REAL_CST, call the
13075 two-argument mpfr order N Bessel function FUNC on them and return
13076 the resulting value as a tree with type TYPE. The mpfr precision
13077 is set to the precision of TYPE. We assume that function FUNC
13078 returns zero if the result could be calculated exactly within the
13079 requested precision. */
13081 do_mpfr_bessel_n (tree arg1, tree arg2, tree type,
13082 int (*func)(mpfr_ptr, long, mpfr_srcptr, mp_rnd_t),
13083 const REAL_VALUE_TYPE *min, bool inclusive)
13085 tree result = NULL_TREE;
13090 /* To proceed, MPFR must exactly represent the target floating point
13091 format, which only happens when the target base equals two. */
13092 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
13093 && host_integerp (arg1, 0)
13094 && TREE_CODE (arg2) == REAL_CST && !TREE_OVERFLOW (arg2))
13096 const HOST_WIDE_INT n = tree_low_cst(arg1, 0);
13097 const REAL_VALUE_TYPE *const ra = &TREE_REAL_CST (arg2);
13100 && real_isfinite (ra)
13101 && (!min || real_compare (inclusive ? GE_EXPR: GT_EXPR , ra, min)))
13103 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
13104 const int prec = fmt->p;
13105 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
13109 mpfr_init2 (m, prec);
13110 mpfr_from_real (m, ra, GMP_RNDN);
13111 mpfr_clear_flags ();
13112 inexact = func (m, n, m, rnd);
13113 result = do_mpfr_ckconv (m, type, inexact);
13121 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
13122 the pointer *(ARG_QUO) and return the result. The type is taken
13123 from the type of ARG0 and is used for setting the precision of the
13124 calculation and results. */
13127 do_mpfr_remquo (tree arg0, tree arg1, tree arg_quo)
13129 tree const type = TREE_TYPE (arg0);
13130 tree result = NULL_TREE;
13135 /* To proceed, MPFR must exactly represent the target floating point
13136 format, which only happens when the target base equals two. */
13137 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
13138 && TREE_CODE (arg0) == REAL_CST && !TREE_OVERFLOW (arg0)
13139 && TREE_CODE (arg1) == REAL_CST && !TREE_OVERFLOW (arg1))
13141 const REAL_VALUE_TYPE *const ra0 = TREE_REAL_CST_PTR (arg0);
13142 const REAL_VALUE_TYPE *const ra1 = TREE_REAL_CST_PTR (arg1);
13144 if (real_isfinite (ra0) && real_isfinite (ra1))
13146 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
13147 const int prec = fmt->p;
13148 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
13153 mpfr_inits2 (prec, m0, m1, NULL);
13154 mpfr_from_real (m0, ra0, GMP_RNDN);
13155 mpfr_from_real (m1, ra1, GMP_RNDN);
13156 mpfr_clear_flags ();
13157 mpfr_remquo (m0, &integer_quo, m0, m1, rnd);
13158 /* Remquo is independent of the rounding mode, so pass
13159 inexact=0 to do_mpfr_ckconv(). */
13160 result_rem = do_mpfr_ckconv (m0, type, /*inexact=*/ 0);
13161 mpfr_clears (m0, m1, NULL);
13164 /* MPFR calculates quo in the host's long so it may
13165 return more bits in quo than the target int can hold
13166 if sizeof(host long) > sizeof(target int). This can
13167 happen even for native compilers in LP64 mode. In
13168 these cases, modulo the quo value with the largest
13169 number that the target int can hold while leaving one
13170 bit for the sign. */
13171 if (sizeof (integer_quo) * CHAR_BIT > INT_TYPE_SIZE)
13172 integer_quo %= (long)(1UL << (INT_TYPE_SIZE - 1));
13174 /* Dereference the quo pointer argument. */
13175 arg_quo = build_fold_indirect_ref (arg_quo);
13176 /* Proceed iff a valid pointer type was passed in. */
13177 if (TYPE_MAIN_VARIANT (TREE_TYPE (arg_quo)) == integer_type_node)
13179 /* Set the value. */
13180 tree result_quo = fold_build2 (MODIFY_EXPR,
13181 TREE_TYPE (arg_quo), arg_quo,
13182 build_int_cst (NULL, integer_quo));
13183 TREE_SIDE_EFFECTS (result_quo) = 1;
13184 /* Combine the quo assignment with the rem. */
13185 result = non_lvalue (fold_build2 (COMPOUND_EXPR, type,
13186 result_quo, result_rem));
13194 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
13195 resulting value as a tree with type TYPE. The mpfr precision is
13196 set to the precision of TYPE. We assume that this mpfr function
13197 returns zero if the result could be calculated exactly within the
13198 requested precision. In addition, the integer pointer represented
13199 by ARG_SG will be dereferenced and set to the appropriate signgam
13203 do_mpfr_lgamma_r (tree arg, tree arg_sg, tree type)
13205 tree result = NULL_TREE;
13209 /* To proceed, MPFR must exactly represent the target floating point
13210 format, which only happens when the target base equals two. Also
13211 verify ARG is a constant and that ARG_SG is an int pointer. */
13212 if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
13213 && TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg)
13214 && TREE_CODE (TREE_TYPE (arg_sg)) == POINTER_TYPE
13215 && TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (arg_sg))) == integer_type_node)
13217 const REAL_VALUE_TYPE *const ra = TREE_REAL_CST_PTR (arg);
13219 /* In addition to NaN and Inf, the argument cannot be zero or a
13220 negative integer. */
13221 if (real_isfinite (ra)
13222 && ra->cl != rvc_zero
13223 && !(real_isneg(ra) && real_isinteger(ra, TYPE_MODE (type))))
13225 const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
13226 const int prec = fmt->p;
13227 const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
13232 mpfr_init2 (m, prec);
13233 mpfr_from_real (m, ra, GMP_RNDN);
13234 mpfr_clear_flags ();
13235 inexact = mpfr_lgamma (m, &sg, m, rnd);
13236 result_lg = do_mpfr_ckconv (m, type, inexact);
13242 /* Dereference the arg_sg pointer argument. */
13243 arg_sg = build_fold_indirect_ref (arg_sg);
13244 /* Assign the signgam value into *arg_sg. */
13245 result_sg = fold_build2 (MODIFY_EXPR,
13246 TREE_TYPE (arg_sg), arg_sg,
13247 build_int_cst (NULL, sg));
13248 TREE_SIDE_EFFECTS (result_sg) = 1;
13249 /* Combine the signgam assignment with the lgamma result. */
13250 result = non_lvalue (fold_build2 (COMPOUND_EXPR, type,
13251 result_sg, result_lg));
13259 /* If argument ARG is a COMPLEX_CST, call the one-argument mpc
13260 function FUNC on it and return the resulting value as a tree with
13261 type TYPE. The mpfr precision is set to the precision of TYPE. We
13262 assume that function FUNC returns zero if the result could be
13263 calculated exactly within the requested precision. */
13266 do_mpc_arg1 (tree arg, tree type, int (*func)(mpc_ptr, mpc_srcptr, mpc_rnd_t))
13268 tree result = NULL_TREE;
13272 /* To proceed, MPFR must exactly represent the target floating point
13273 format, which only happens when the target base equals two. */
13274 if (TREE_CODE (arg) == COMPLEX_CST && !TREE_OVERFLOW (arg)
13275 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) == REAL_TYPE
13276 && REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (TREE_TYPE (arg))))->b == 2)
13278 const REAL_VALUE_TYPE *const re = TREE_REAL_CST_PTR (TREE_REALPART (arg));
13279 const REAL_VALUE_TYPE *const im = TREE_REAL_CST_PTR (TREE_IMAGPART (arg));
13281 if (real_isfinite (re) && real_isfinite (im))
13283 const struct real_format *const fmt =
13284 REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (type)));
13285 const int prec = fmt->p;
13286 const mp_rnd_t rnd = fmt->round_towards_zero ? GMP_RNDZ : GMP_RNDN;
13287 const mpc_rnd_t crnd = fmt->round_towards_zero ? MPC_RNDZZ : MPC_RNDNN;
13291 mpc_init2 (m, prec);
13292 mpfr_from_real (mpc_realref(m), re, rnd);
13293 mpfr_from_real (mpc_imagref(m), im, rnd);
13294 mpfr_clear_flags ();
13295 inexact = func (m, m, crnd);
13296 result = do_mpc_ckconv (m, type, inexact, /*force_convert=*/ 0);
13304 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
13305 mpc function FUNC on it and return the resulting value as a tree
13306 with type TYPE. The mpfr precision is set to the precision of
13307 TYPE. We assume that function FUNC returns zero if the result
13308 could be calculated exactly within the requested precision. If
13309 DO_NONFINITE is true, then fold expressions containing Inf or NaN
13310 in the arguments and/or results. */
13313 do_mpc_arg2 (tree arg0, tree arg1, tree type, int do_nonfinite,
13314 int (*func)(mpc_ptr, mpc_srcptr, mpc_srcptr, mpc_rnd_t))
13316 tree result = NULL_TREE;
13321 /* To proceed, MPFR must exactly represent the target floating point
13322 format, which only happens when the target base equals two. */
13323 if (TREE_CODE (arg0) == COMPLEX_CST && !TREE_OVERFLOW (arg0)
13324 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE
13325 && TREE_CODE (arg1) == COMPLEX_CST && !TREE_OVERFLOW (arg1)
13326 && TREE_CODE (TREE_TYPE (TREE_TYPE (arg1))) == REAL_TYPE
13327 && REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (TREE_TYPE (arg0))))->b == 2)
13329 const REAL_VALUE_TYPE *const re0 = TREE_REAL_CST_PTR (TREE_REALPART (arg0));
13330 const REAL_VALUE_TYPE *const im0 = TREE_REAL_CST_PTR (TREE_IMAGPART (arg0));
13331 const REAL_VALUE_TYPE *const re1 = TREE_REAL_CST_PTR (TREE_REALPART (arg1));
13332 const REAL_VALUE_TYPE *const im1 = TREE_REAL_CST_PTR (TREE_IMAGPART (arg1));
13335 || (real_isfinite (re0) && real_isfinite (im0)
13336 && real_isfinite (re1) && real_isfinite (im1)))
13338 const struct real_format *const fmt =
13339 REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (type)));
13340 const int prec = fmt->p;
13341 const mp_rnd_t rnd = fmt->round_towards_zero ? GMP_RNDZ : GMP_RNDN;
13342 const mpc_rnd_t crnd = fmt->round_towards_zero ? MPC_RNDZZ : MPC_RNDNN;
13346 mpc_init2 (m0, prec);
13347 mpc_init2 (m1, prec);
13348 mpfr_from_real (mpc_realref(m0), re0, rnd);
13349 mpfr_from_real (mpc_imagref(m0), im0, rnd);
13350 mpfr_from_real (mpc_realref(m1), re1, rnd);
13351 mpfr_from_real (mpc_imagref(m1), im1, rnd);
13352 mpfr_clear_flags ();
13353 inexact = func (m0, m0, m1, crnd);
13354 result = do_mpc_ckconv (m0, type, inexact, do_nonfinite);
13364 The functions below provide an alternate interface for folding
13365 builtin function calls presented as GIMPLE_CALL statements rather
13366 than as CALL_EXPRs. The folded result is still expressed as a
13367 tree. There is too much code duplication in the handling of
13368 varargs functions, and a more intrusive re-factoring would permit
13369 better sharing of code between the tree and statement-based
13370 versions of these functions. */
13372 /* Construct a new CALL_EXPR using the tail of the argument list of STMT
13373 along with N new arguments specified as the "..." parameters. SKIP
13374 is the number of arguments in STMT to be omitted. This function is used
13375 to do varargs-to-varargs transformations. */
13378 gimple_rewrite_call_expr (gimple stmt, int skip, tree fndecl, int n, ...)
13380 int oldnargs = gimple_call_num_args (stmt);
13381 int nargs = oldnargs - skip + n;
13382 tree fntype = TREE_TYPE (fndecl);
13383 tree fn = build1 (ADDR_EXPR, build_pointer_type (fntype), fndecl);
13387 location_t loc = gimple_location (stmt);
13389 buffer = XALLOCAVEC (tree, nargs);
13391 for (i = 0; i < n; i++)
13392 buffer[i] = va_arg (ap, tree);
13394 for (j = skip; j < oldnargs; j++, i++)
13395 buffer[i] = gimple_call_arg (stmt, j);
13397 return fold (build_call_array_loc (loc, TREE_TYPE (fntype), fn, nargs, buffer));
13400 /* Fold a call STMT to __{,v}sprintf_chk. Return NULL_TREE if
13401 a normal call should be emitted rather than expanding the function
13402 inline. FCODE is either BUILT_IN_SPRINTF_CHK or BUILT_IN_VSPRINTF_CHK. */
13405 gimple_fold_builtin_sprintf_chk (gimple stmt, enum built_in_function fcode)
13407 tree dest, size, len, fn, fmt, flag;
13408 const char *fmt_str;
13409 int nargs = gimple_call_num_args (stmt);
13411 /* Verify the required arguments in the original call. */
13414 dest = gimple_call_arg (stmt, 0);
13415 if (!validate_arg (dest, POINTER_TYPE))
13417 flag = gimple_call_arg (stmt, 1);
13418 if (!validate_arg (flag, INTEGER_TYPE))
13420 size = gimple_call_arg (stmt, 2);
13421 if (!validate_arg (size, INTEGER_TYPE))
13423 fmt = gimple_call_arg (stmt, 3);
13424 if (!validate_arg (fmt, POINTER_TYPE))
13427 if (! host_integerp (size, 1))
13432 if (!init_target_chars ())
13435 /* Check whether the format is a literal string constant. */
13436 fmt_str = c_getstr (fmt);
13437 if (fmt_str != NULL)
13439 /* If the format doesn't contain % args or %%, we know the size. */
13440 if (strchr (fmt_str, target_percent) == 0)
13442 if (fcode != BUILT_IN_SPRINTF_CHK || nargs == 4)
13443 len = build_int_cstu (size_type_node, strlen (fmt_str));
13445 /* If the format is "%s" and first ... argument is a string literal,
13446 we know the size too. */
13447 else if (fcode == BUILT_IN_SPRINTF_CHK
13448 && strcmp (fmt_str, target_percent_s) == 0)
13454 arg = gimple_call_arg (stmt, 4);
13455 if (validate_arg (arg, POINTER_TYPE))
13457 len = c_strlen (arg, 1);
13458 if (! len || ! host_integerp (len, 1))
13465 if (! integer_all_onesp (size))
13467 if (! len || ! tree_int_cst_lt (len, size))
13471 /* Only convert __{,v}sprintf_chk to {,v}sprintf if flag is 0
13472 or if format doesn't contain % chars or is "%s". */
13473 if (! integer_zerop (flag))
13475 if (fmt_str == NULL)
13477 if (strchr (fmt_str, target_percent) != NULL
13478 && strcmp (fmt_str, target_percent_s))
13482 /* If __builtin_{,v}sprintf_chk is used, assume {,v}sprintf is available. */
13483 fn = built_in_decls[fcode == BUILT_IN_VSPRINTF_CHK
13484 ? BUILT_IN_VSPRINTF : BUILT_IN_SPRINTF];
13488 return gimple_rewrite_call_expr (stmt, 4, fn, 2, dest, fmt);
13491 /* Fold a call STMT to {,v}snprintf. Return NULL_TREE if
13492 a normal call should be emitted rather than expanding the function
13493 inline. FCODE is either BUILT_IN_SNPRINTF_CHK or
13494 BUILT_IN_VSNPRINTF_CHK. If MAXLEN is not NULL, it is maximum length
13495 passed as second argument. */
13498 gimple_fold_builtin_snprintf_chk (gimple stmt, tree maxlen,
13499 enum built_in_function fcode)
13501 tree dest, size, len, fn, fmt, flag;
13502 const char *fmt_str;
13504 /* Verify the required arguments in the original call. */
13505 if (gimple_call_num_args (stmt) < 5)
13507 dest = gimple_call_arg (stmt, 0);
13508 if (!validate_arg (dest, POINTER_TYPE))
13510 len = gimple_call_arg (stmt, 1);
13511 if (!validate_arg (len, INTEGER_TYPE))
13513 flag = gimple_call_arg (stmt, 2);
13514 if (!validate_arg (flag, INTEGER_TYPE))
13516 size = gimple_call_arg (stmt, 3);
13517 if (!validate_arg (size, INTEGER_TYPE))
13519 fmt = gimple_call_arg (stmt, 4);
13520 if (!validate_arg (fmt, POINTER_TYPE))
13523 if (! host_integerp (size, 1))
13526 if (! integer_all_onesp (size))
13528 if (! host_integerp (len, 1))
13530 /* If LEN is not constant, try MAXLEN too.
13531 For MAXLEN only allow optimizing into non-_ocs function
13532 if SIZE is >= MAXLEN, never convert to __ocs_fail (). */
13533 if (maxlen == NULL_TREE || ! host_integerp (maxlen, 1))
13539 if (tree_int_cst_lt (size, maxlen))
13543 if (!init_target_chars ())
13546 /* Only convert __{,v}snprintf_chk to {,v}snprintf if flag is 0
13547 or if format doesn't contain % chars or is "%s". */
13548 if (! integer_zerop (flag))
13550 fmt_str = c_getstr (fmt);
13551 if (fmt_str == NULL)
13553 if (strchr (fmt_str, target_percent) != NULL
13554 && strcmp (fmt_str, target_percent_s))
13558 /* If __builtin_{,v}snprintf_chk is used, assume {,v}snprintf is
13560 fn = built_in_decls[fcode == BUILT_IN_VSNPRINTF_CHK
13561 ? BUILT_IN_VSNPRINTF : BUILT_IN_SNPRINTF];
13565 return gimple_rewrite_call_expr (stmt, 5, fn, 3, dest, len, fmt);
13568 /* Builtins with folding operations that operate on "..." arguments
13569 need special handling; we need to store the arguments in a convenient
13570 data structure before attempting any folding. Fortunately there are
13571 only a few builtins that fall into this category. FNDECL is the
13572 function, EXP is the CALL_EXPR for the call, and IGNORE is true if the
13573 result of the function call is ignored. */
13576 gimple_fold_builtin_varargs (tree fndecl, gimple stmt,
13577 bool ignore ATTRIBUTE_UNUSED)
13579 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
13580 tree ret = NULL_TREE;
13584 case BUILT_IN_SPRINTF_CHK:
13585 case BUILT_IN_VSPRINTF_CHK:
13586 ret = gimple_fold_builtin_sprintf_chk (stmt, fcode);
13589 case BUILT_IN_SNPRINTF_CHK:
13590 case BUILT_IN_VSNPRINTF_CHK:
13591 ret = gimple_fold_builtin_snprintf_chk (stmt, NULL_TREE, fcode);
13598 ret = build1 (NOP_EXPR, TREE_TYPE (ret), ret);
13599 TREE_NO_WARNING (ret) = 1;
13605 /* A wrapper function for builtin folding that prevents warnings for
13606 "statement without effect" and the like, caused by removing the
13607 call node earlier than the warning is generated. */
13610 fold_call_stmt (gimple stmt, bool ignore)
13612 tree ret = NULL_TREE;
13613 tree fndecl = gimple_call_fndecl (stmt);
13614 location_t loc = gimple_location (stmt);
13616 && TREE_CODE (fndecl) == FUNCTION_DECL
13617 && DECL_BUILT_IN (fndecl)
13618 && !gimple_call_va_arg_pack_p (stmt))
13620 int nargs = gimple_call_num_args (stmt);
13622 if (avoid_folding_inline_builtin (fndecl))
13624 /* FIXME: Don't use a list in this interface. */
13625 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
13627 tree arglist = NULL_TREE;
13629 for (i = nargs - 1; i >= 0; i--)
13630 arglist = tree_cons (NULL_TREE, gimple_call_arg (stmt, i), arglist);
13631 return targetm.fold_builtin (fndecl, arglist, ignore);
13635 if (nargs <= MAX_ARGS_TO_FOLD_BUILTIN)
13637 tree args[MAX_ARGS_TO_FOLD_BUILTIN];
13639 for (i = 0; i < nargs; i++)
13640 args[i] = gimple_call_arg (stmt, i);
13641 ret = fold_builtin_n (loc, fndecl, args, nargs, ignore);
13644 ret = gimple_fold_builtin_varargs (fndecl, stmt, ignore);
13647 /* Propagate location information from original call to
13648 expansion of builtin. Otherwise things like
13649 maybe_emit_chk_warning, that operate on the expansion
13650 of a builtin, will use the wrong location information. */
13651 if (gimple_has_location (stmt))
13653 tree realret = ret;
13654 if (TREE_CODE (ret) == NOP_EXPR)
13655 realret = TREE_OPERAND (ret, 0);
13656 if (CAN_HAVE_LOCATION_P (realret)
13657 && !EXPR_HAS_LOCATION (realret))
13658 SET_EXPR_LOCATION (realret, loc);
13668 /* Look up the function in built_in_decls that corresponds to DECL
13669 and set ASMSPEC as its user assembler name. DECL must be a
13670 function decl that declares a builtin. */
13673 set_builtin_user_assembler_name (tree decl, const char *asmspec)
13676 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL
13677 && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
13680 builtin = built_in_decls [DECL_FUNCTION_CODE (decl)];
13681 set_user_assembler_name (builtin, asmspec);
13682 switch (DECL_FUNCTION_CODE (decl))
13684 case BUILT_IN_MEMCPY:
13685 init_block_move_fn (asmspec);
13686 memcpy_libfunc = set_user_assembler_libfunc ("memcpy", asmspec);
13688 case BUILT_IN_MEMSET:
13689 init_block_clear_fn (asmspec);
13690 memset_libfunc = set_user_assembler_libfunc ("memset", asmspec);
13692 case BUILT_IN_MEMMOVE:
13693 memmove_libfunc = set_user_assembler_libfunc ("memmove", asmspec);
13695 case BUILT_IN_MEMCMP:
13696 memcmp_libfunc = set_user_assembler_libfunc ("memcmp", asmspec);
13698 case BUILT_IN_ABORT:
13699 abort_libfunc = set_user_assembler_libfunc ("abort", asmspec);
13702 if (INT_TYPE_SIZE < BITS_PER_WORD)
13704 set_user_assembler_libfunc ("ffs", asmspec);
13705 set_optab_libfunc (ffs_optab, mode_for_size (INT_TYPE_SIZE,
13706 MODE_INT, 0), "ffs");