1 /* Expand builtin functions.
2 Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
3 2000, 2001, 2002, 2003, 2004, 2005, 2006 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
24 #include "coretypes.h"
30 #include "tree-gimple.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"
51 #ifndef PAD_VARARGS_DOWN
52 #define PAD_VARARGS_DOWN BYTES_BIG_ENDIAN
55 /* Define the names of the builtin function types and codes. */
56 const char *const built_in_class_names[4]
57 = {"NOT_BUILT_IN", "BUILT_IN_FRONTEND", "BUILT_IN_MD", "BUILT_IN_NORMAL"};
59 #define DEF_BUILTIN(X, N, C, T, LT, B, F, NA, AT, IM, COND) #X,
60 const char * built_in_names[(int) END_BUILTINS] =
62 #include "builtins.def"
66 /* Setup an array of _DECL trees, make sure each element is
67 initialized to NULL_TREE. */
68 tree built_in_decls[(int) END_BUILTINS];
69 /* Declarations used when constructing the builtin implicitly in the compiler.
70 It may be NULL_TREE when this is invalid (for instance runtime is not
71 required to implement the function call in all cases). */
72 tree implicit_built_in_decls[(int) END_BUILTINS];
74 static int get_pointer_alignment (tree, unsigned int);
75 static const char *c_getstr (tree);
76 static rtx c_readstr (const char *, enum machine_mode);
77 static int target_char_cast (tree, char *);
78 static rtx get_memory_rtx (tree, tree);
79 static int apply_args_size (void);
80 static int apply_result_size (void);
81 #if defined (HAVE_untyped_call) || defined (HAVE_untyped_return)
82 static rtx result_vector (int, rtx);
84 static void expand_builtin_update_setjmp_buf (rtx);
85 static void expand_builtin_prefetch (tree);
86 static rtx expand_builtin_apply_args (void);
87 static rtx expand_builtin_apply_args_1 (void);
88 static rtx expand_builtin_apply (rtx, rtx, rtx);
89 static void expand_builtin_return (rtx);
90 static enum type_class type_to_class (tree);
91 static rtx expand_builtin_classify_type (tree);
92 static void expand_errno_check (tree, rtx);
93 static rtx expand_builtin_mathfn (tree, rtx, rtx);
94 static rtx expand_builtin_mathfn_2 (tree, rtx, rtx);
95 static rtx expand_builtin_mathfn_3 (tree, rtx, rtx);
96 static rtx expand_builtin_sincos (tree);
97 static rtx expand_builtin_int_roundingfn (tree, rtx, rtx);
98 static rtx expand_builtin_int_roundingfn_2 (tree, rtx, rtx);
99 static rtx expand_builtin_args_info (tree);
100 static rtx expand_builtin_next_arg (void);
101 static rtx expand_builtin_va_start (tree);
102 static rtx expand_builtin_va_end (tree);
103 static rtx expand_builtin_va_copy (tree);
104 static rtx expand_builtin_memcmp (tree, tree, rtx, enum machine_mode);
105 static rtx expand_builtin_strcmp (tree, rtx, enum machine_mode);
106 static rtx expand_builtin_strncmp (tree, rtx, enum machine_mode);
107 static rtx builtin_memcpy_read_str (void *, HOST_WIDE_INT, enum machine_mode);
108 static rtx expand_builtin_strcat (tree, tree, rtx, enum machine_mode);
109 static rtx expand_builtin_strncat (tree, rtx, enum machine_mode);
110 static rtx expand_builtin_strspn (tree, rtx, enum machine_mode);
111 static rtx expand_builtin_strcspn (tree, rtx, enum machine_mode);
112 static rtx expand_builtin_memcpy (tree, rtx, enum machine_mode);
113 static rtx expand_builtin_mempcpy (tree, tree, rtx, enum machine_mode, int);
114 static rtx expand_builtin_memmove (tree, tree, rtx, enum machine_mode);
115 static rtx expand_builtin_bcopy (tree);
116 static rtx expand_builtin_strcpy (tree, tree, rtx, enum machine_mode);
117 static rtx expand_builtin_stpcpy (tree, rtx, enum machine_mode);
118 static rtx builtin_strncpy_read_str (void *, HOST_WIDE_INT, enum machine_mode);
119 static rtx expand_builtin_strncpy (tree, rtx, enum machine_mode);
120 static rtx builtin_memset_read_str (void *, HOST_WIDE_INT, enum machine_mode);
121 static rtx builtin_memset_gen_str (void *, HOST_WIDE_INT, enum machine_mode);
122 static rtx expand_builtin_memset (tree, rtx, enum machine_mode, tree);
123 static rtx expand_builtin_bzero (tree);
124 static rtx expand_builtin_strlen (tree, rtx, enum machine_mode);
125 static rtx expand_builtin_strstr (tree, tree, rtx, enum machine_mode);
126 static rtx expand_builtin_strpbrk (tree, tree, rtx, enum machine_mode);
127 static rtx expand_builtin_strchr (tree, tree, rtx, enum machine_mode);
128 static rtx expand_builtin_strrchr (tree, tree, rtx, enum machine_mode);
129 static rtx expand_builtin_alloca (tree, rtx);
130 static rtx expand_builtin_unop (enum machine_mode, tree, rtx, rtx, optab);
131 static rtx expand_builtin_frame_address (tree, tree);
132 static rtx expand_builtin_fputs (tree, rtx, bool);
133 static rtx expand_builtin_printf (tree, rtx, enum machine_mode, bool);
134 static rtx expand_builtin_fprintf (tree, rtx, enum machine_mode, bool);
135 static rtx expand_builtin_sprintf (tree, rtx, enum machine_mode);
136 static tree stabilize_va_list (tree, int);
137 static rtx expand_builtin_expect (tree, rtx);
138 static tree fold_builtin_constant_p (tree);
139 static tree fold_builtin_classify_type (tree);
140 static tree fold_builtin_strlen (tree);
141 static tree fold_builtin_inf (tree, int);
142 static tree fold_builtin_nan (tree, tree, int);
143 static int validate_arglist (tree, ...);
144 static bool integer_valued_real_p (tree);
145 static tree fold_trunc_transparent_mathfn (tree, tree);
146 static bool readonly_data_expr (tree);
147 static rtx expand_builtin_fabs (tree, rtx, rtx);
148 static rtx expand_builtin_signbit (tree, rtx);
149 static tree fold_builtin_sqrt (tree, tree);
150 static tree fold_builtin_cbrt (tree, tree);
151 static tree fold_builtin_pow (tree, tree, tree);
152 static tree fold_builtin_powi (tree, tree, tree);
153 static tree fold_builtin_cos (tree, tree, tree);
154 static tree fold_builtin_tan (tree, tree);
155 static tree fold_builtin_trunc (tree, tree);
156 static tree fold_builtin_floor (tree, tree);
157 static tree fold_builtin_ceil (tree, tree);
158 static tree fold_builtin_round (tree, tree);
159 static tree fold_builtin_int_roundingfn (tree, tree);
160 static tree fold_builtin_bitop (tree, tree);
161 static tree fold_builtin_memory_op (tree, tree, bool, int);
162 static tree fold_builtin_strchr (tree, tree);
163 static tree fold_builtin_memcmp (tree);
164 static tree fold_builtin_strcmp (tree);
165 static tree fold_builtin_strncmp (tree);
166 static tree fold_builtin_signbit (tree, tree);
167 static tree fold_builtin_copysign (tree, tree, tree);
168 static tree fold_builtin_isascii (tree);
169 static tree fold_builtin_toascii (tree);
170 static tree fold_builtin_isdigit (tree);
171 static tree fold_builtin_fabs (tree, tree);
172 static tree fold_builtin_abs (tree, tree);
173 static tree fold_builtin_unordered_cmp (tree, tree, enum tree_code,
175 static tree fold_builtin_1 (tree, tree, bool);
177 static tree fold_builtin_strpbrk (tree, tree);
178 static tree fold_builtin_strstr (tree, tree);
179 static tree fold_builtin_strrchr (tree, tree);
180 static tree fold_builtin_strcat (tree);
181 static tree fold_builtin_strncat (tree);
182 static tree fold_builtin_strspn (tree);
183 static tree fold_builtin_strcspn (tree);
184 static tree fold_builtin_sprintf (tree, int);
186 static rtx expand_builtin_object_size (tree);
187 static rtx expand_builtin_memory_chk (tree, rtx, enum machine_mode,
188 enum built_in_function);
189 static void maybe_emit_chk_warning (tree, enum built_in_function);
190 static void maybe_emit_sprintf_chk_warning (tree, enum built_in_function);
191 static tree fold_builtin_object_size (tree);
192 static tree fold_builtin_strcat_chk (tree, tree);
193 static tree fold_builtin_strncat_chk (tree, tree);
194 static tree fold_builtin_sprintf_chk (tree, enum built_in_function);
195 static tree fold_builtin_printf (tree, tree, bool, enum built_in_function);
196 static tree fold_builtin_fprintf (tree, tree, bool, enum built_in_function);
197 static bool init_target_chars (void);
199 static unsigned HOST_WIDE_INT target_newline;
200 static unsigned HOST_WIDE_INT target_percent;
201 static unsigned HOST_WIDE_INT target_c;
202 static unsigned HOST_WIDE_INT target_s;
203 static char target_percent_c[3];
204 static char target_percent_s[3];
205 static char target_percent_s_newline[4];
206 static tree do_mpfr_arg1 (tree, tree, int (*)(mpfr_ptr, mpfr_srcptr, mp_rnd_t),
207 const REAL_VALUE_TYPE *, const REAL_VALUE_TYPE *, bool);
208 static tree do_mpfr_arg2 (tree, tree, tree,
209 int (*)(mpfr_ptr, mpfr_srcptr, mpfr_srcptr, mp_rnd_t));
211 /* Return true if NODE should be considered for inline expansion regardless
212 of the optimization level. This means whenever a function is invoked with
213 its "internal" name, which normally contains the prefix "__builtin". */
215 static bool called_as_built_in (tree node)
217 const char *name = IDENTIFIER_POINTER (DECL_NAME (node));
218 if (strncmp (name, "__builtin_", 10) == 0)
220 if (strncmp (name, "__sync_", 7) == 0)
225 /* Return the alignment in bits of EXP, a pointer valued expression.
226 But don't return more than MAX_ALIGN no matter what.
227 The alignment returned is, by default, the alignment of the thing that
228 EXP points to. If it is not a POINTER_TYPE, 0 is returned.
230 Otherwise, look at the expression to see if we can do better, i.e., if the
231 expression is actually pointing at an object whose alignment is tighter. */
234 get_pointer_alignment (tree exp, unsigned int max_align)
236 unsigned int align, inner;
238 /* We rely on TER to compute accurate alignment information. */
239 if (!(optimize && flag_tree_ter))
242 if (!POINTER_TYPE_P (TREE_TYPE (exp)))
245 align = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (exp)));
246 align = MIN (align, max_align);
250 switch (TREE_CODE (exp))
254 case NON_LVALUE_EXPR:
255 exp = TREE_OPERAND (exp, 0);
256 if (! POINTER_TYPE_P (TREE_TYPE (exp)))
259 inner = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (exp)));
260 align = MIN (inner, max_align);
264 /* If sum of pointer + int, restrict our maximum alignment to that
265 imposed by the integer. If not, we can't do any better than
267 if (! host_integerp (TREE_OPERAND (exp, 1), 1))
270 while (((tree_low_cst (TREE_OPERAND (exp, 1), 1))
271 & (max_align / BITS_PER_UNIT - 1))
275 exp = TREE_OPERAND (exp, 0);
279 /* See what we are pointing at and look at its alignment. */
280 exp = TREE_OPERAND (exp, 0);
282 if (handled_component_p (exp))
284 HOST_WIDE_INT bitsize, bitpos;
286 enum machine_mode mode;
287 int unsignedp, volatilep;
289 exp = get_inner_reference (exp, &bitsize, &bitpos, &offset,
290 &mode, &unsignedp, &volatilep, true);
292 inner = MIN (inner, (unsigned) (bitpos & -bitpos));
293 if (offset && TREE_CODE (offset) == PLUS_EXPR
294 && host_integerp (TREE_OPERAND (offset, 1), 1))
296 /* Any overflow in calculating offset_bits won't change
299 = ((unsigned) tree_low_cst (TREE_OPERAND (offset, 1), 1)
303 inner = MIN (inner, (offset_bits & -offset_bits));
304 offset = TREE_OPERAND (offset, 0);
306 if (offset && 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));
319 inner = MIN (inner, BITS_PER_UNIT);
321 if (TREE_CODE (exp) == FUNCTION_DECL)
322 align = FUNCTION_BOUNDARY;
323 else if (DECL_P (exp))
324 align = MIN (inner, DECL_ALIGN (exp));
325 #ifdef CONSTANT_ALIGNMENT
326 else if (CONSTANT_CLASS_P (exp))
327 align = MIN (inner, (unsigned)CONSTANT_ALIGNMENT (exp, align));
329 else if (TREE_CODE (exp) == VIEW_CONVERT_EXPR
330 || TREE_CODE (exp) == INDIRECT_REF)
331 align = MIN (TYPE_ALIGN (TREE_TYPE (exp)), inner);
333 align = MIN (align, inner);
334 return MIN (align, max_align);
342 /* Compute the length of a C string. TREE_STRING_LENGTH is not the right
343 way, because it could contain a zero byte in the middle.
344 TREE_STRING_LENGTH is the size of the character array, not the string.
346 ONLY_VALUE should be nonzero if the result is not going to be emitted
347 into the instruction stream and zero if it is going to be expanded.
348 E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3
349 is returned, otherwise NULL, since
350 len = c_strlen (src, 1); if (len) expand_expr (len, ...); would not
351 evaluate the side-effects.
353 The value returned is of type `ssizetype'.
355 Unfortunately, string_constant can't access the values of const char
356 arrays with initializers, so neither can we do so here. */
359 c_strlen (tree src, int only_value)
362 HOST_WIDE_INT offset;
367 if (TREE_CODE (src) == COND_EXPR
368 && (only_value || !TREE_SIDE_EFFECTS (TREE_OPERAND (src, 0))))
372 len1 = c_strlen (TREE_OPERAND (src, 1), only_value);
373 len2 = c_strlen (TREE_OPERAND (src, 2), only_value);
374 if (tree_int_cst_equal (len1, len2))
378 if (TREE_CODE (src) == COMPOUND_EXPR
379 && (only_value || !TREE_SIDE_EFFECTS (TREE_OPERAND (src, 0))))
380 return c_strlen (TREE_OPERAND (src, 1), only_value);
382 src = string_constant (src, &offset_node);
386 max = TREE_STRING_LENGTH (src) - 1;
387 ptr = TREE_STRING_POINTER (src);
389 if (offset_node && TREE_CODE (offset_node) != INTEGER_CST)
391 /* If the string has an internal zero byte (e.g., "foo\0bar"), we can't
392 compute the offset to the following null if we don't know where to
393 start searching for it. */
396 for (i = 0; i < max; i++)
400 /* We don't know the starting offset, but we do know that the string
401 has no internal zero bytes. We can assume that the offset falls
402 within the bounds of the string; otherwise, the programmer deserves
403 what he gets. Subtract the offset from the length of the string,
404 and return that. This would perhaps not be valid if we were dealing
405 with named arrays in addition to literal string constants. */
407 return size_diffop (size_int (max), offset_node);
410 /* We have a known offset into the string. Start searching there for
411 a null character if we can represent it as a single HOST_WIDE_INT. */
412 if (offset_node == 0)
414 else if (! host_integerp (offset_node, 0))
417 offset = tree_low_cst (offset_node, 0);
419 /* If the offset is known to be out of bounds, warn, and call strlen at
421 if (offset < 0 || offset > max)
423 warning (0, "offset outside bounds of constant string");
427 /* Use strlen to search for the first zero byte. Since any strings
428 constructed with build_string will have nulls appended, we win even
429 if we get handed something like (char[4])"abcd".
431 Since OFFSET is our starting index into the string, no further
432 calculation is needed. */
433 return ssize_int (strlen (ptr + offset));
436 /* Return a char pointer for a C string if it is a string constant
437 or sum of string constant and integer constant. */
444 src = string_constant (src, &offset_node);
448 if (offset_node == 0)
449 return TREE_STRING_POINTER (src);
450 else if (!host_integerp (offset_node, 1)
451 || compare_tree_int (offset_node, TREE_STRING_LENGTH (src) - 1) > 0)
454 return TREE_STRING_POINTER (src) + tree_low_cst (offset_node, 1);
457 /* Return a CONST_INT or CONST_DOUBLE corresponding to target reading
458 GET_MODE_BITSIZE (MODE) bits from string constant STR. */
461 c_readstr (const char *str, enum machine_mode mode)
467 gcc_assert (GET_MODE_CLASS (mode) == MODE_INT);
472 for (i = 0; i < GET_MODE_SIZE (mode); i++)
475 if (WORDS_BIG_ENDIAN)
476 j = GET_MODE_SIZE (mode) - i - 1;
477 if (BYTES_BIG_ENDIAN != WORDS_BIG_ENDIAN
478 && GET_MODE_SIZE (mode) > UNITS_PER_WORD)
479 j = j + UNITS_PER_WORD - 2 * (j % UNITS_PER_WORD) - 1;
481 gcc_assert (j <= 2 * HOST_BITS_PER_WIDE_INT);
484 ch = (unsigned char) str[i];
485 c[j / HOST_BITS_PER_WIDE_INT] |= ch << (j % HOST_BITS_PER_WIDE_INT);
487 return immed_double_const (c[0], c[1], mode);
490 /* Cast a target constant CST to target CHAR and if that value fits into
491 host char type, return zero and put that value into variable pointed to by
495 target_char_cast (tree cst, char *p)
497 unsigned HOST_WIDE_INT val, hostval;
499 if (!host_integerp (cst, 1)
500 || CHAR_TYPE_SIZE > HOST_BITS_PER_WIDE_INT)
503 val = tree_low_cst (cst, 1);
504 if (CHAR_TYPE_SIZE < HOST_BITS_PER_WIDE_INT)
505 val &= (((unsigned HOST_WIDE_INT) 1) << CHAR_TYPE_SIZE) - 1;
508 if (HOST_BITS_PER_CHAR < HOST_BITS_PER_WIDE_INT)
509 hostval &= (((unsigned HOST_WIDE_INT) 1) << HOST_BITS_PER_CHAR) - 1;
518 /* Similar to save_expr, but assumes that arbitrary code is not executed
519 in between the multiple evaluations. In particular, we assume that a
520 non-addressable local variable will not be modified. */
523 builtin_save_expr (tree exp)
525 if (TREE_ADDRESSABLE (exp) == 0
526 && (TREE_CODE (exp) == PARM_DECL
527 || (TREE_CODE (exp) == VAR_DECL && !TREE_STATIC (exp))))
530 return save_expr (exp);
533 /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT
534 times to get the address of either a higher stack frame, or a return
535 address located within it (depending on FNDECL_CODE). */
538 expand_builtin_return_addr (enum built_in_function fndecl_code, int count)
542 #ifdef INITIAL_FRAME_ADDRESS_RTX
543 rtx tem = INITIAL_FRAME_ADDRESS_RTX;
547 /* For a zero count with __builtin_return_address, we don't care what
548 frame address we return, because target-specific definitions will
549 override us. Therefore frame pointer elimination is OK, and using
550 the soft frame pointer is OK.
552 For a non-zero count, or a zero count with __builtin_frame_address,
553 we require a stable offset from the current frame pointer to the
554 previous one, so we must use the hard frame pointer, and
555 we must disable frame pointer elimination. */
556 if (count == 0 && fndecl_code == BUILT_IN_RETURN_ADDRESS)
557 tem = frame_pointer_rtx;
560 tem = hard_frame_pointer_rtx;
562 /* Tell reload not to eliminate the frame pointer. */
563 current_function_accesses_prior_frames = 1;
567 /* Some machines need special handling before we can access
568 arbitrary frames. For example, on the SPARC, we must first flush
569 all register windows to the stack. */
570 #ifdef SETUP_FRAME_ADDRESSES
572 SETUP_FRAME_ADDRESSES ();
575 /* On the SPARC, the return address is not in the frame, it is in a
576 register. There is no way to access it off of the current frame
577 pointer, but it can be accessed off the previous frame pointer by
578 reading the value from the register window save area. */
579 #ifdef RETURN_ADDR_IN_PREVIOUS_FRAME
580 if (fndecl_code == BUILT_IN_RETURN_ADDRESS)
584 /* Scan back COUNT frames to the specified frame. */
585 for (i = 0; i < count; i++)
587 /* Assume the dynamic chain pointer is in the word that the
588 frame address points to, unless otherwise specified. */
589 #ifdef DYNAMIC_CHAIN_ADDRESS
590 tem = DYNAMIC_CHAIN_ADDRESS (tem);
592 tem = memory_address (Pmode, tem);
593 tem = gen_frame_mem (Pmode, tem);
594 tem = copy_to_reg (tem);
597 /* For __builtin_frame_address, return what we've got. But, on
598 the SPARC for example, we may have to add a bias. */
599 if (fndecl_code == BUILT_IN_FRAME_ADDRESS)
600 #ifdef FRAME_ADDR_RTX
601 return FRAME_ADDR_RTX (tem);
606 /* For __builtin_return_address, get the return address from that frame. */
607 #ifdef RETURN_ADDR_RTX
608 tem = RETURN_ADDR_RTX (count, tem);
610 tem = memory_address (Pmode,
611 plus_constant (tem, GET_MODE_SIZE (Pmode)));
612 tem = gen_frame_mem (Pmode, tem);
617 /* Alias set used for setjmp buffer. */
618 static HOST_WIDE_INT setjmp_alias_set = -1;
620 /* Construct the leading half of a __builtin_setjmp call. Control will
621 return to RECEIVER_LABEL. This is also called directly by the SJLJ
622 exception handling code. */
625 expand_builtin_setjmp_setup (rtx buf_addr, rtx receiver_label)
627 enum machine_mode sa_mode = STACK_SAVEAREA_MODE (SAVE_NONLOCAL);
631 if (setjmp_alias_set == -1)
632 setjmp_alias_set = new_alias_set ();
634 buf_addr = convert_memory_address (Pmode, buf_addr);
636 buf_addr = force_reg (Pmode, force_operand (buf_addr, NULL_RTX));
638 /* We store the frame pointer and the address of receiver_label in
639 the buffer and use the rest of it for the stack save area, which
640 is machine-dependent. */
642 mem = gen_rtx_MEM (Pmode, buf_addr);
643 set_mem_alias_set (mem, setjmp_alias_set);
644 emit_move_insn (mem, targetm.builtin_setjmp_frame_value ());
646 mem = gen_rtx_MEM (Pmode, plus_constant (buf_addr, GET_MODE_SIZE (Pmode))),
647 set_mem_alias_set (mem, setjmp_alias_set);
649 emit_move_insn (validize_mem (mem),
650 force_reg (Pmode, gen_rtx_LABEL_REF (Pmode, receiver_label)));
652 stack_save = gen_rtx_MEM (sa_mode,
653 plus_constant (buf_addr,
654 2 * GET_MODE_SIZE (Pmode)));
655 set_mem_alias_set (stack_save, setjmp_alias_set);
656 emit_stack_save (SAVE_NONLOCAL, &stack_save, NULL_RTX);
658 /* If there is further processing to do, do it. */
659 #ifdef HAVE_builtin_setjmp_setup
660 if (HAVE_builtin_setjmp_setup)
661 emit_insn (gen_builtin_setjmp_setup (buf_addr));
664 /* Tell optimize_save_area_alloca that extra work is going to
665 need to go on during alloca. */
666 current_function_calls_setjmp = 1;
668 /* Set this so all the registers get saved in our frame; we need to be
669 able to copy the saved values for any registers from frames we unwind. */
670 current_function_has_nonlocal_label = 1;
673 /* Construct the trailing part of a __builtin_setjmp call. This is
674 also called directly by the SJLJ exception handling code. */
677 expand_builtin_setjmp_receiver (rtx receiver_label ATTRIBUTE_UNUSED)
679 /* Clobber the FP when we get here, so we have to make sure it's
680 marked as used by this function. */
681 emit_insn (gen_rtx_USE (VOIDmode, hard_frame_pointer_rtx));
683 /* Mark the static chain as clobbered here so life information
684 doesn't get messed up for it. */
685 emit_insn (gen_rtx_CLOBBER (VOIDmode, static_chain_rtx));
687 /* Now put in the code to restore the frame pointer, and argument
688 pointer, if needed. */
689 #ifdef HAVE_nonlocal_goto
690 if (! HAVE_nonlocal_goto)
693 emit_move_insn (virtual_stack_vars_rtx, hard_frame_pointer_rtx);
694 /* This might change the hard frame pointer in ways that aren't
695 apparent to early optimization passes, so force a clobber. */
696 emit_insn (gen_rtx_CLOBBER (VOIDmode, hard_frame_pointer_rtx));
699 #if ARG_POINTER_REGNUM != HARD_FRAME_POINTER_REGNUM
700 if (fixed_regs[ARG_POINTER_REGNUM])
702 #ifdef ELIMINABLE_REGS
704 static const struct elims {const int from, to;} elim_regs[] = ELIMINABLE_REGS;
706 for (i = 0; i < ARRAY_SIZE (elim_regs); i++)
707 if (elim_regs[i].from == ARG_POINTER_REGNUM
708 && elim_regs[i].to == HARD_FRAME_POINTER_REGNUM)
711 if (i == ARRAY_SIZE (elim_regs))
714 /* Now restore our arg pointer from the address at which it
715 was saved in our stack frame. */
716 emit_move_insn (virtual_incoming_args_rtx,
717 copy_to_reg (get_arg_pointer_save_area (cfun)));
722 #ifdef HAVE_builtin_setjmp_receiver
723 if (HAVE_builtin_setjmp_receiver)
724 emit_insn (gen_builtin_setjmp_receiver (receiver_label));
727 #ifdef HAVE_nonlocal_goto_receiver
728 if (HAVE_nonlocal_goto_receiver)
729 emit_insn (gen_nonlocal_goto_receiver ());
734 /* @@@ This is a kludge. Not all machine descriptions define a blockage
735 insn, but we must not allow the code we just generated to be reordered
736 by scheduling. Specifically, the update of the frame pointer must
737 happen immediately, not later. So emit an ASM_INPUT to act as blockage
739 emit_insn (gen_rtx_ASM_INPUT (VOIDmode, ""));
742 /* __builtin_longjmp is passed a pointer to an array of five words (not
743 all will be used on all machines). It operates similarly to the C
744 library function of the same name, but is more efficient. Much of
745 the code below is copied from the handling of non-local gotos. */
748 expand_builtin_longjmp (rtx buf_addr, rtx value)
750 rtx fp, lab, stack, insn, last;
751 enum machine_mode sa_mode = STACK_SAVEAREA_MODE (SAVE_NONLOCAL);
753 if (setjmp_alias_set == -1)
754 setjmp_alias_set = new_alias_set ();
756 buf_addr = convert_memory_address (Pmode, buf_addr);
758 buf_addr = force_reg (Pmode, buf_addr);
760 /* We used to store value in static_chain_rtx, but that fails if pointers
761 are smaller than integers. We instead require that the user must pass
762 a second argument of 1, because that is what builtin_setjmp will
763 return. This also makes EH slightly more efficient, since we are no
764 longer copying around a value that we don't care about. */
765 gcc_assert (value == const1_rtx);
767 last = get_last_insn ();
768 #ifdef HAVE_builtin_longjmp
769 if (HAVE_builtin_longjmp)
770 emit_insn (gen_builtin_longjmp (buf_addr));
774 fp = gen_rtx_MEM (Pmode, buf_addr);
775 lab = gen_rtx_MEM (Pmode, plus_constant (buf_addr,
776 GET_MODE_SIZE (Pmode)));
778 stack = gen_rtx_MEM (sa_mode, plus_constant (buf_addr,
779 2 * GET_MODE_SIZE (Pmode)));
780 set_mem_alias_set (fp, setjmp_alias_set);
781 set_mem_alias_set (lab, setjmp_alias_set);
782 set_mem_alias_set (stack, setjmp_alias_set);
784 /* Pick up FP, label, and SP from the block and jump. This code is
785 from expand_goto in stmt.c; see there for detailed comments. */
786 #ifdef HAVE_nonlocal_goto
787 if (HAVE_nonlocal_goto)
788 /* We have to pass a value to the nonlocal_goto pattern that will
789 get copied into the static_chain pointer, but it does not matter
790 what that value is, because builtin_setjmp does not use it. */
791 emit_insn (gen_nonlocal_goto (value, lab, stack, fp));
795 lab = copy_to_reg (lab);
797 emit_insn (gen_rtx_CLOBBER (VOIDmode,
798 gen_rtx_MEM (BLKmode,
799 gen_rtx_SCRATCH (VOIDmode))));
800 emit_insn (gen_rtx_CLOBBER (VOIDmode,
801 gen_rtx_MEM (BLKmode,
802 hard_frame_pointer_rtx)));
804 emit_move_insn (hard_frame_pointer_rtx, fp);
805 emit_stack_restore (SAVE_NONLOCAL, stack, NULL_RTX);
807 emit_insn (gen_rtx_USE (VOIDmode, hard_frame_pointer_rtx));
808 emit_insn (gen_rtx_USE (VOIDmode, stack_pointer_rtx));
809 emit_indirect_jump (lab);
813 /* Search backwards and mark the jump insn as a non-local goto.
814 Note that this precludes the use of __builtin_longjmp to a
815 __builtin_setjmp target in the same function. However, we've
816 already cautioned the user that these functions are for
817 internal exception handling use only. */
818 for (insn = get_last_insn (); insn; insn = PREV_INSN (insn))
820 gcc_assert (insn != last);
824 REG_NOTES (insn) = alloc_EXPR_LIST (REG_NON_LOCAL_GOTO, const0_rtx,
828 else if (CALL_P (insn))
833 /* Expand a call to __builtin_nonlocal_goto. We're passed the target label
834 and the address of the save area. */
837 expand_builtin_nonlocal_goto (tree arglist)
839 tree t_label, t_save_area;
840 rtx r_label, r_save_area, r_fp, r_sp, insn;
842 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
845 t_label = TREE_VALUE (arglist);
846 arglist = TREE_CHAIN (arglist);
847 t_save_area = TREE_VALUE (arglist);
849 r_label = expand_normal (t_label);
850 r_label = convert_memory_address (Pmode, r_label);
851 r_save_area = expand_normal (t_save_area);
852 r_save_area = convert_memory_address (Pmode, r_save_area);
853 r_fp = gen_rtx_MEM (Pmode, r_save_area);
854 r_sp = gen_rtx_MEM (STACK_SAVEAREA_MODE (SAVE_NONLOCAL),
855 plus_constant (r_save_area, GET_MODE_SIZE (Pmode)));
857 current_function_has_nonlocal_goto = 1;
859 #ifdef HAVE_nonlocal_goto
860 /* ??? We no longer need to pass the static chain value, afaik. */
861 if (HAVE_nonlocal_goto)
862 emit_insn (gen_nonlocal_goto (const0_rtx, r_label, r_sp, r_fp));
866 r_label = copy_to_reg (r_label);
868 emit_insn (gen_rtx_CLOBBER (VOIDmode,
869 gen_rtx_MEM (BLKmode,
870 gen_rtx_SCRATCH (VOIDmode))));
872 emit_insn (gen_rtx_CLOBBER (VOIDmode,
873 gen_rtx_MEM (BLKmode,
874 hard_frame_pointer_rtx)));
876 /* Restore frame pointer for containing function.
877 This sets the actual hard register used for the frame pointer
878 to the location of the function's incoming static chain info.
879 The non-local goto handler will then adjust it to contain the
880 proper value and reload the argument pointer, if needed. */
881 emit_move_insn (hard_frame_pointer_rtx, r_fp);
882 emit_stack_restore (SAVE_NONLOCAL, r_sp, NULL_RTX);
884 /* USE of hard_frame_pointer_rtx added for consistency;
885 not clear if really needed. */
886 emit_insn (gen_rtx_USE (VOIDmode, hard_frame_pointer_rtx));
887 emit_insn (gen_rtx_USE (VOIDmode, stack_pointer_rtx));
888 emit_indirect_jump (r_label);
891 /* Search backwards to the jump insn and mark it as a
893 for (insn = get_last_insn (); insn; insn = PREV_INSN (insn))
897 REG_NOTES (insn) = alloc_EXPR_LIST (REG_NON_LOCAL_GOTO,
898 const0_rtx, REG_NOTES (insn));
901 else if (CALL_P (insn))
908 /* __builtin_update_setjmp_buf is passed a pointer to an array of five words
909 (not all will be used on all machines) that was passed to __builtin_setjmp.
910 It updates the stack pointer in that block to correspond to the current
914 expand_builtin_update_setjmp_buf (rtx buf_addr)
916 enum machine_mode sa_mode = Pmode;
920 #ifdef HAVE_save_stack_nonlocal
921 if (HAVE_save_stack_nonlocal)
922 sa_mode = insn_data[(int) CODE_FOR_save_stack_nonlocal].operand[0].mode;
924 #ifdef STACK_SAVEAREA_MODE
925 sa_mode = STACK_SAVEAREA_MODE (SAVE_NONLOCAL);
929 = gen_rtx_MEM (sa_mode,
932 plus_constant (buf_addr, 2 * GET_MODE_SIZE (Pmode))));
936 emit_insn (gen_setjmp ());
939 emit_stack_save (SAVE_NONLOCAL, &stack_save, NULL_RTX);
942 /* Expand a call to __builtin_prefetch. For a target that does not support
943 data prefetch, evaluate the memory address argument in case it has side
947 expand_builtin_prefetch (tree arglist)
949 tree arg0, arg1, arg2;
952 if (!validate_arglist (arglist, POINTER_TYPE, 0))
955 arg0 = TREE_VALUE (arglist);
956 /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
957 zero (read) and argument 2 (locality) defaults to 3 (high degree of
959 if (TREE_CHAIN (arglist))
961 arg1 = TREE_VALUE (TREE_CHAIN (arglist));
962 if (TREE_CHAIN (TREE_CHAIN (arglist)))
963 arg2 = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
965 arg2 = build_int_cst (NULL_TREE, 3);
969 arg1 = integer_zero_node;
970 arg2 = build_int_cst (NULL_TREE, 3);
973 /* Argument 0 is an address. */
974 op0 = expand_expr (arg0, NULL_RTX, Pmode, EXPAND_NORMAL);
976 /* Argument 1 (read/write flag) must be a compile-time constant int. */
977 if (TREE_CODE (arg1) != INTEGER_CST)
979 error ("second argument to %<__builtin_prefetch%> must be a constant");
980 arg1 = integer_zero_node;
982 op1 = expand_normal (arg1);
983 /* Argument 1 must be either zero or one. */
984 if (INTVAL (op1) != 0 && INTVAL (op1) != 1)
986 warning (0, "invalid second argument to %<__builtin_prefetch%>;"
991 /* Argument 2 (locality) must be a compile-time constant int. */
992 if (TREE_CODE (arg2) != INTEGER_CST)
994 error ("third argument to %<__builtin_prefetch%> must be a constant");
995 arg2 = integer_zero_node;
997 op2 = expand_normal (arg2);
998 /* Argument 2 must be 0, 1, 2, or 3. */
999 if (INTVAL (op2) < 0 || INTVAL (op2) > 3)
1001 warning (0, "invalid third argument to %<__builtin_prefetch%>; using zero");
1005 #ifdef HAVE_prefetch
1008 if ((! (*insn_data[(int) CODE_FOR_prefetch].operand[0].predicate)
1010 insn_data[(int) CODE_FOR_prefetch].operand[0].mode))
1011 || (GET_MODE (op0) != Pmode))
1013 op0 = convert_memory_address (Pmode, op0);
1014 op0 = force_reg (Pmode, op0);
1016 emit_insn (gen_prefetch (op0, op1, op2));
1020 /* Don't do anything with direct references to volatile memory, but
1021 generate code to handle other side effects. */
1022 if (!MEM_P (op0) && side_effects_p (op0))
1026 /* Get a MEM rtx for expression EXP which is the address of an operand
1027 to be used in a string instruction (cmpstrsi, movmemsi, ..). LEN is
1028 the maximum length of the block of memory that might be accessed or
1032 get_memory_rtx (tree exp, tree len)
1034 rtx addr = expand_expr (exp, NULL_RTX, ptr_mode, EXPAND_NORMAL);
1035 rtx mem = gen_rtx_MEM (BLKmode, memory_address (BLKmode, addr));
1037 /* Get an expression we can use to find the attributes to assign to MEM.
1038 If it is an ADDR_EXPR, use the operand. Otherwise, dereference it if
1039 we can. First remove any nops. */
1040 while ((TREE_CODE (exp) == NOP_EXPR || TREE_CODE (exp) == CONVERT_EXPR
1041 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1042 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (exp, 0))))
1043 exp = TREE_OPERAND (exp, 0);
1045 if (TREE_CODE (exp) == ADDR_EXPR)
1046 exp = TREE_OPERAND (exp, 0);
1047 else if (POINTER_TYPE_P (TREE_TYPE (exp)))
1048 exp = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (exp)), exp);
1052 /* Honor attributes derived from exp, except for the alias set
1053 (as builtin stringops may alias with anything) and the size
1054 (as stringops may access multiple array elements). */
1057 set_mem_attributes (mem, exp, 0);
1059 /* Allow the string and memory builtins to overflow from one
1060 field into another, see http://gcc.gnu.org/PR23561.
1061 Thus avoid COMPONENT_REFs in MEM_EXPR unless we know the whole
1062 memory accessed by the string or memory builtin will fit
1063 within the field. */
1064 if (MEM_EXPR (mem) && TREE_CODE (MEM_EXPR (mem)) == COMPONENT_REF)
1066 tree mem_expr = MEM_EXPR (mem);
1067 HOST_WIDE_INT offset = -1, length = -1;
1070 while (TREE_CODE (inner) == ARRAY_REF
1071 || TREE_CODE (inner) == NOP_EXPR
1072 || TREE_CODE (inner) == CONVERT_EXPR
1073 || TREE_CODE (inner) == NON_LVALUE_EXPR
1074 || TREE_CODE (inner) == VIEW_CONVERT_EXPR
1075 || TREE_CODE (inner) == SAVE_EXPR)
1076 inner = TREE_OPERAND (inner, 0);
1078 gcc_assert (TREE_CODE (inner) == COMPONENT_REF);
1080 if (MEM_OFFSET (mem)
1081 && GET_CODE (MEM_OFFSET (mem)) == CONST_INT)
1082 offset = INTVAL (MEM_OFFSET (mem));
1084 if (offset >= 0 && len && host_integerp (len, 0))
1085 length = tree_low_cst (len, 0);
1087 while (TREE_CODE (inner) == COMPONENT_REF)
1089 tree field = TREE_OPERAND (inner, 1);
1090 gcc_assert (! DECL_BIT_FIELD (field));
1091 gcc_assert (TREE_CODE (mem_expr) == COMPONENT_REF);
1092 gcc_assert (field == TREE_OPERAND (mem_expr, 1));
1095 && TYPE_SIZE_UNIT (TREE_TYPE (inner))
1096 && host_integerp (TYPE_SIZE_UNIT (TREE_TYPE (inner)), 0))
1099 = tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (inner)), 0);
1100 /* If we can prove the memory starting at XEXP (mem, 0)
1101 and ending at XEXP (mem, 0) + LENGTH will fit into
1102 this field, we can keep that COMPONENT_REF in MEM_EXPR. */
1105 && offset + length <= size)
1110 && host_integerp (DECL_FIELD_OFFSET (field), 0))
1111 offset += tree_low_cst (DECL_FIELD_OFFSET (field), 0)
1112 + tree_low_cst (DECL_FIELD_BIT_OFFSET (field), 1)
1120 mem_expr = TREE_OPERAND (mem_expr, 0);
1121 inner = TREE_OPERAND (inner, 0);
1124 if (mem_expr == NULL)
1126 if (mem_expr != MEM_EXPR (mem))
1128 set_mem_expr (mem, mem_expr);
1129 set_mem_offset (mem, offset >= 0 ? GEN_INT (offset) : NULL_RTX);
1132 set_mem_alias_set (mem, 0);
1133 set_mem_size (mem, NULL_RTX);
1139 /* Built-in functions to perform an untyped call and return. */
1141 /* For each register that may be used for calling a function, this
1142 gives a mode used to copy the register's value. VOIDmode indicates
1143 the register is not used for calling a function. If the machine
1144 has register windows, this gives only the outbound registers.
1145 INCOMING_REGNO gives the corresponding inbound register. */
1146 static enum machine_mode apply_args_mode[FIRST_PSEUDO_REGISTER];
1148 /* For each register that may be used for returning values, this gives
1149 a mode used to copy the register's value. VOIDmode indicates the
1150 register is not used for returning values. If the machine has
1151 register windows, this gives only the outbound registers.
1152 INCOMING_REGNO gives the corresponding inbound register. */
1153 static enum machine_mode apply_result_mode[FIRST_PSEUDO_REGISTER];
1155 /* For each register that may be used for calling a function, this
1156 gives the offset of that register into the block returned by
1157 __builtin_apply_args. 0 indicates that the register is not
1158 used for calling a function. */
1159 static int apply_args_reg_offset[FIRST_PSEUDO_REGISTER];
1161 /* Return the size required for the block returned by __builtin_apply_args,
1162 and initialize apply_args_mode. */
1165 apply_args_size (void)
1167 static int size = -1;
1170 enum machine_mode mode;
1172 /* The values computed by this function never change. */
1175 /* The first value is the incoming arg-pointer. */
1176 size = GET_MODE_SIZE (Pmode);
1178 /* The second value is the structure value address unless this is
1179 passed as an "invisible" first argument. */
1180 if (targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0))
1181 size += GET_MODE_SIZE (Pmode);
1183 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1184 if (FUNCTION_ARG_REGNO_P (regno))
1186 mode = reg_raw_mode[regno];
1188 gcc_assert (mode != VOIDmode);
1190 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1191 if (size % align != 0)
1192 size = CEIL (size, align) * align;
1193 apply_args_reg_offset[regno] = size;
1194 size += GET_MODE_SIZE (mode);
1195 apply_args_mode[regno] = mode;
1199 apply_args_mode[regno] = VOIDmode;
1200 apply_args_reg_offset[regno] = 0;
1206 /* Return the size required for the block returned by __builtin_apply,
1207 and initialize apply_result_mode. */
1210 apply_result_size (void)
1212 static int size = -1;
1214 enum machine_mode mode;
1216 /* The values computed by this function never change. */
1221 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1222 if (FUNCTION_VALUE_REGNO_P (regno))
1224 mode = reg_raw_mode[regno];
1226 gcc_assert (mode != VOIDmode);
1228 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1229 if (size % align != 0)
1230 size = CEIL (size, align) * align;
1231 size += GET_MODE_SIZE (mode);
1232 apply_result_mode[regno] = mode;
1235 apply_result_mode[regno] = VOIDmode;
1237 /* Allow targets that use untyped_call and untyped_return to override
1238 the size so that machine-specific information can be stored here. */
1239 #ifdef APPLY_RESULT_SIZE
1240 size = APPLY_RESULT_SIZE;
1246 #if defined (HAVE_untyped_call) || defined (HAVE_untyped_return)
1247 /* Create a vector describing the result block RESULT. If SAVEP is true,
1248 the result block is used to save the values; otherwise it is used to
1249 restore the values. */
1252 result_vector (int savep, rtx result)
1254 int regno, size, align, nelts;
1255 enum machine_mode mode;
1257 rtx *savevec = alloca (FIRST_PSEUDO_REGISTER * sizeof (rtx));
1260 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1261 if ((mode = apply_result_mode[regno]) != VOIDmode)
1263 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1264 if (size % align != 0)
1265 size = CEIL (size, align) * align;
1266 reg = gen_rtx_REG (mode, savep ? regno : INCOMING_REGNO (regno));
1267 mem = adjust_address (result, mode, size);
1268 savevec[nelts++] = (savep
1269 ? gen_rtx_SET (VOIDmode, mem, reg)
1270 : gen_rtx_SET (VOIDmode, reg, mem));
1271 size += GET_MODE_SIZE (mode);
1273 return gen_rtx_PARALLEL (VOIDmode, gen_rtvec_v (nelts, savevec));
1275 #endif /* HAVE_untyped_call or HAVE_untyped_return */
1277 /* Save the state required to perform an untyped call with the same
1278 arguments as were passed to the current function. */
1281 expand_builtin_apply_args_1 (void)
1284 int size, align, regno;
1285 enum machine_mode mode;
1286 rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1288 /* Create a block where the arg-pointer, structure value address,
1289 and argument registers can be saved. */
1290 registers = assign_stack_local (BLKmode, apply_args_size (), -1);
1292 /* Walk past the arg-pointer and structure value address. */
1293 size = GET_MODE_SIZE (Pmode);
1294 if (targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0))
1295 size += GET_MODE_SIZE (Pmode);
1297 /* Save each register used in calling a function to the block. */
1298 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1299 if ((mode = apply_args_mode[regno]) != VOIDmode)
1301 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1302 if (size % align != 0)
1303 size = CEIL (size, align) * align;
1305 tem = gen_rtx_REG (mode, INCOMING_REGNO (regno));
1307 emit_move_insn (adjust_address (registers, mode, size), tem);
1308 size += GET_MODE_SIZE (mode);
1311 /* Save the arg pointer to the block. */
1312 tem = copy_to_reg (virtual_incoming_args_rtx);
1313 #ifdef STACK_GROWS_DOWNWARD
1314 /* We need the pointer as the caller actually passed them to us, not
1315 as we might have pretended they were passed. Make sure it's a valid
1316 operand, as emit_move_insn isn't expected to handle a PLUS. */
1318 = force_operand (plus_constant (tem, current_function_pretend_args_size),
1321 emit_move_insn (adjust_address (registers, Pmode, 0), tem);
1323 size = GET_MODE_SIZE (Pmode);
1325 /* Save the structure value address unless this is passed as an
1326 "invisible" first argument. */
1327 if (struct_incoming_value)
1329 emit_move_insn (adjust_address (registers, Pmode, size),
1330 copy_to_reg (struct_incoming_value));
1331 size += GET_MODE_SIZE (Pmode);
1334 /* Return the address of the block. */
1335 return copy_addr_to_reg (XEXP (registers, 0));
1338 /* __builtin_apply_args returns block of memory allocated on
1339 the stack into which is stored the arg pointer, structure
1340 value address, static chain, and all the registers that might
1341 possibly be used in performing a function call. The code is
1342 moved to the start of the function so the incoming values are
1346 expand_builtin_apply_args (void)
1348 /* Don't do __builtin_apply_args more than once in a function.
1349 Save the result of the first call and reuse it. */
1350 if (apply_args_value != 0)
1351 return apply_args_value;
1353 /* When this function is called, it means that registers must be
1354 saved on entry to this function. So we migrate the
1355 call to the first insn of this function. */
1360 temp = expand_builtin_apply_args_1 ();
1364 apply_args_value = temp;
1366 /* Put the insns after the NOTE that starts the function.
1367 If this is inside a start_sequence, make the outer-level insn
1368 chain current, so the code is placed at the start of the
1370 push_topmost_sequence ();
1371 emit_insn_before (seq, NEXT_INSN (entry_of_function ()));
1372 pop_topmost_sequence ();
1377 /* Perform an untyped call and save the state required to perform an
1378 untyped return of whatever value was returned by the given function. */
1381 expand_builtin_apply (rtx function, rtx arguments, rtx argsize)
1383 int size, align, regno;
1384 enum machine_mode mode;
1385 rtx incoming_args, result, reg, dest, src, call_insn;
1386 rtx old_stack_level = 0;
1387 rtx call_fusage = 0;
1388 rtx struct_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0);
1390 arguments = convert_memory_address (Pmode, arguments);
1392 /* Create a block where the return registers can be saved. */
1393 result = assign_stack_local (BLKmode, apply_result_size (), -1);
1395 /* Fetch the arg pointer from the ARGUMENTS block. */
1396 incoming_args = gen_reg_rtx (Pmode);
1397 emit_move_insn (incoming_args, gen_rtx_MEM (Pmode, arguments));
1398 #ifndef STACK_GROWS_DOWNWARD
1399 incoming_args = expand_simple_binop (Pmode, MINUS, incoming_args, argsize,
1400 incoming_args, 0, OPTAB_LIB_WIDEN);
1403 /* Push a new argument block and copy the arguments. Do not allow
1404 the (potential) memcpy call below to interfere with our stack
1406 do_pending_stack_adjust ();
1409 /* Save the stack with nonlocal if available. */
1410 #ifdef HAVE_save_stack_nonlocal
1411 if (HAVE_save_stack_nonlocal)
1412 emit_stack_save (SAVE_NONLOCAL, &old_stack_level, NULL_RTX);
1415 emit_stack_save (SAVE_BLOCK, &old_stack_level, NULL_RTX);
1417 /* Allocate a block of memory onto the stack and copy the memory
1418 arguments to the outgoing arguments address. */
1419 allocate_dynamic_stack_space (argsize, 0, BITS_PER_UNIT);
1420 dest = virtual_outgoing_args_rtx;
1421 #ifndef STACK_GROWS_DOWNWARD
1422 if (GET_CODE (argsize) == CONST_INT)
1423 dest = plus_constant (dest, -INTVAL (argsize));
1425 dest = gen_rtx_PLUS (Pmode, dest, negate_rtx (Pmode, argsize));
1427 dest = gen_rtx_MEM (BLKmode, dest);
1428 set_mem_align (dest, PARM_BOUNDARY);
1429 src = gen_rtx_MEM (BLKmode, incoming_args);
1430 set_mem_align (src, PARM_BOUNDARY);
1431 emit_block_move (dest, src, argsize, BLOCK_OP_NORMAL);
1433 /* Refer to the argument block. */
1435 arguments = gen_rtx_MEM (BLKmode, arguments);
1436 set_mem_align (arguments, PARM_BOUNDARY);
1438 /* Walk past the arg-pointer and structure value address. */
1439 size = GET_MODE_SIZE (Pmode);
1441 size += GET_MODE_SIZE (Pmode);
1443 /* Restore each of the registers previously saved. Make USE insns
1444 for each of these registers for use in making the call. */
1445 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1446 if ((mode = apply_args_mode[regno]) != VOIDmode)
1448 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1449 if (size % align != 0)
1450 size = CEIL (size, align) * align;
1451 reg = gen_rtx_REG (mode, regno);
1452 emit_move_insn (reg, adjust_address (arguments, mode, size));
1453 use_reg (&call_fusage, reg);
1454 size += GET_MODE_SIZE (mode);
1457 /* Restore the structure value address unless this is passed as an
1458 "invisible" first argument. */
1459 size = GET_MODE_SIZE (Pmode);
1462 rtx value = gen_reg_rtx (Pmode);
1463 emit_move_insn (value, adjust_address (arguments, Pmode, size));
1464 emit_move_insn (struct_value, value);
1465 if (REG_P (struct_value))
1466 use_reg (&call_fusage, struct_value);
1467 size += GET_MODE_SIZE (Pmode);
1470 /* All arguments and registers used for the call are set up by now! */
1471 function = prepare_call_address (function, NULL, &call_fusage, 0, 0);
1473 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1474 and we don't want to load it into a register as an optimization,
1475 because prepare_call_address already did it if it should be done. */
1476 if (GET_CODE (function) != SYMBOL_REF)
1477 function = memory_address (FUNCTION_MODE, function);
1479 /* Generate the actual call instruction and save the return value. */
1480 #ifdef HAVE_untyped_call
1481 if (HAVE_untyped_call)
1482 emit_call_insn (gen_untyped_call (gen_rtx_MEM (FUNCTION_MODE, function),
1483 result, result_vector (1, result)));
1486 #ifdef HAVE_call_value
1487 if (HAVE_call_value)
1491 /* Locate the unique return register. It is not possible to
1492 express a call that sets more than one return register using
1493 call_value; use untyped_call for that. In fact, untyped_call
1494 only needs to save the return registers in the given block. */
1495 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1496 if ((mode = apply_result_mode[regno]) != VOIDmode)
1498 gcc_assert (!valreg); /* HAVE_untyped_call required. */
1500 valreg = gen_rtx_REG (mode, regno);
1503 emit_call_insn (GEN_CALL_VALUE (valreg,
1504 gen_rtx_MEM (FUNCTION_MODE, function),
1505 const0_rtx, NULL_RTX, const0_rtx));
1507 emit_move_insn (adjust_address (result, GET_MODE (valreg), 0), valreg);
1513 /* Find the CALL insn we just emitted, and attach the register usage
1515 call_insn = last_call_insn ();
1516 add_function_usage_to (call_insn, call_fusage);
1518 /* Restore the stack. */
1519 #ifdef HAVE_save_stack_nonlocal
1520 if (HAVE_save_stack_nonlocal)
1521 emit_stack_restore (SAVE_NONLOCAL, old_stack_level, NULL_RTX);
1524 emit_stack_restore (SAVE_BLOCK, old_stack_level, NULL_RTX);
1528 /* Return the address of the result block. */
1529 result = copy_addr_to_reg (XEXP (result, 0));
1530 return convert_memory_address (ptr_mode, result);
1533 /* Perform an untyped return. */
1536 expand_builtin_return (rtx result)
1538 int size, align, regno;
1539 enum machine_mode mode;
1541 rtx call_fusage = 0;
1543 result = convert_memory_address (Pmode, result);
1545 apply_result_size ();
1546 result = gen_rtx_MEM (BLKmode, result);
1548 #ifdef HAVE_untyped_return
1549 if (HAVE_untyped_return)
1551 emit_jump_insn (gen_untyped_return (result, result_vector (0, result)));
1557 /* Restore the return value and note that each value is used. */
1559 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1560 if ((mode = apply_result_mode[regno]) != VOIDmode)
1562 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1563 if (size % align != 0)
1564 size = CEIL (size, align) * align;
1565 reg = gen_rtx_REG (mode, INCOMING_REGNO (regno));
1566 emit_move_insn (reg, adjust_address (result, mode, size));
1568 push_to_sequence (call_fusage);
1569 emit_insn (gen_rtx_USE (VOIDmode, reg));
1570 call_fusage = get_insns ();
1572 size += GET_MODE_SIZE (mode);
1575 /* Put the USE insns before the return. */
1576 emit_insn (call_fusage);
1578 /* Return whatever values was restored by jumping directly to the end
1580 expand_naked_return ();
1583 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1585 static enum type_class
1586 type_to_class (tree type)
1588 switch (TREE_CODE (type))
1590 case VOID_TYPE: return void_type_class;
1591 case INTEGER_TYPE: return integer_type_class;
1592 case ENUMERAL_TYPE: return enumeral_type_class;
1593 case BOOLEAN_TYPE: return boolean_type_class;
1594 case POINTER_TYPE: return pointer_type_class;
1595 case REFERENCE_TYPE: return reference_type_class;
1596 case OFFSET_TYPE: return offset_type_class;
1597 case REAL_TYPE: return real_type_class;
1598 case COMPLEX_TYPE: return complex_type_class;
1599 case FUNCTION_TYPE: return function_type_class;
1600 case METHOD_TYPE: return method_type_class;
1601 case RECORD_TYPE: return record_type_class;
1603 case QUAL_UNION_TYPE: return union_type_class;
1604 case ARRAY_TYPE: return (TYPE_STRING_FLAG (type)
1605 ? string_type_class : array_type_class);
1606 case LANG_TYPE: return lang_type_class;
1607 default: return no_type_class;
1611 /* Expand a call to __builtin_classify_type with arguments found in
1615 expand_builtin_classify_type (tree arglist)
1618 return GEN_INT (type_to_class (TREE_TYPE (TREE_VALUE (arglist))));
1619 return GEN_INT (no_type_class);
1622 /* This helper macro, meant to be used in mathfn_built_in below,
1623 determines which among a set of three builtin math functions is
1624 appropriate for a given type mode. The `F' and `L' cases are
1625 automatically generated from the `double' case. */
1626 #define CASE_MATHFN(BUILT_IN_MATHFN) \
1627 case BUILT_IN_MATHFN: case BUILT_IN_MATHFN##F: case BUILT_IN_MATHFN##L: \
1628 fcode = BUILT_IN_MATHFN; fcodef = BUILT_IN_MATHFN##F ; \
1629 fcodel = BUILT_IN_MATHFN##L ; break;
1631 /* Return mathematic function equivalent to FN but operating directly
1632 on TYPE, if available. If we can't do the conversion, return zero. */
1634 mathfn_built_in (tree type, enum built_in_function fn)
1636 enum built_in_function fcode, fcodef, fcodel;
1640 CASE_MATHFN (BUILT_IN_ACOS)
1641 CASE_MATHFN (BUILT_IN_ACOSH)
1642 CASE_MATHFN (BUILT_IN_ASIN)
1643 CASE_MATHFN (BUILT_IN_ASINH)
1644 CASE_MATHFN (BUILT_IN_ATAN)
1645 CASE_MATHFN (BUILT_IN_ATAN2)
1646 CASE_MATHFN (BUILT_IN_ATANH)
1647 CASE_MATHFN (BUILT_IN_CBRT)
1648 CASE_MATHFN (BUILT_IN_CEIL)
1649 CASE_MATHFN (BUILT_IN_COPYSIGN)
1650 CASE_MATHFN (BUILT_IN_COS)
1651 CASE_MATHFN (BUILT_IN_COSH)
1652 CASE_MATHFN (BUILT_IN_DREM)
1653 CASE_MATHFN (BUILT_IN_ERF)
1654 CASE_MATHFN (BUILT_IN_ERFC)
1655 CASE_MATHFN (BUILT_IN_EXP)
1656 CASE_MATHFN (BUILT_IN_EXP10)
1657 CASE_MATHFN (BUILT_IN_EXP2)
1658 CASE_MATHFN (BUILT_IN_EXPM1)
1659 CASE_MATHFN (BUILT_IN_FABS)
1660 CASE_MATHFN (BUILT_IN_FDIM)
1661 CASE_MATHFN (BUILT_IN_FLOOR)
1662 CASE_MATHFN (BUILT_IN_FMA)
1663 CASE_MATHFN (BUILT_IN_FMAX)
1664 CASE_MATHFN (BUILT_IN_FMIN)
1665 CASE_MATHFN (BUILT_IN_FMOD)
1666 CASE_MATHFN (BUILT_IN_FREXP)
1667 CASE_MATHFN (BUILT_IN_GAMMA)
1668 CASE_MATHFN (BUILT_IN_HUGE_VAL)
1669 CASE_MATHFN (BUILT_IN_HYPOT)
1670 CASE_MATHFN (BUILT_IN_ILOGB)
1671 CASE_MATHFN (BUILT_IN_INF)
1672 CASE_MATHFN (BUILT_IN_J0)
1673 CASE_MATHFN (BUILT_IN_J1)
1674 CASE_MATHFN (BUILT_IN_JN)
1675 CASE_MATHFN (BUILT_IN_LCEIL)
1676 CASE_MATHFN (BUILT_IN_LDEXP)
1677 CASE_MATHFN (BUILT_IN_LFLOOR)
1678 CASE_MATHFN (BUILT_IN_LGAMMA)
1679 CASE_MATHFN (BUILT_IN_LLCEIL)
1680 CASE_MATHFN (BUILT_IN_LLFLOOR)
1681 CASE_MATHFN (BUILT_IN_LLRINT)
1682 CASE_MATHFN (BUILT_IN_LLROUND)
1683 CASE_MATHFN (BUILT_IN_LOG)
1684 CASE_MATHFN (BUILT_IN_LOG10)
1685 CASE_MATHFN (BUILT_IN_LOG1P)
1686 CASE_MATHFN (BUILT_IN_LOG2)
1687 CASE_MATHFN (BUILT_IN_LOGB)
1688 CASE_MATHFN (BUILT_IN_LRINT)
1689 CASE_MATHFN (BUILT_IN_LROUND)
1690 CASE_MATHFN (BUILT_IN_MODF)
1691 CASE_MATHFN (BUILT_IN_NAN)
1692 CASE_MATHFN (BUILT_IN_NANS)
1693 CASE_MATHFN (BUILT_IN_NEARBYINT)
1694 CASE_MATHFN (BUILT_IN_NEXTAFTER)
1695 CASE_MATHFN (BUILT_IN_NEXTTOWARD)
1696 CASE_MATHFN (BUILT_IN_POW)
1697 CASE_MATHFN (BUILT_IN_POWI)
1698 CASE_MATHFN (BUILT_IN_POW10)
1699 CASE_MATHFN (BUILT_IN_REMAINDER)
1700 CASE_MATHFN (BUILT_IN_REMQUO)
1701 CASE_MATHFN (BUILT_IN_RINT)
1702 CASE_MATHFN (BUILT_IN_ROUND)
1703 CASE_MATHFN (BUILT_IN_SCALB)
1704 CASE_MATHFN (BUILT_IN_SCALBLN)
1705 CASE_MATHFN (BUILT_IN_SCALBN)
1706 CASE_MATHFN (BUILT_IN_SIGNIFICAND)
1707 CASE_MATHFN (BUILT_IN_SIN)
1708 CASE_MATHFN (BUILT_IN_SINCOS)
1709 CASE_MATHFN (BUILT_IN_SINH)
1710 CASE_MATHFN (BUILT_IN_SQRT)
1711 CASE_MATHFN (BUILT_IN_TAN)
1712 CASE_MATHFN (BUILT_IN_TANH)
1713 CASE_MATHFN (BUILT_IN_TGAMMA)
1714 CASE_MATHFN (BUILT_IN_TRUNC)
1715 CASE_MATHFN (BUILT_IN_Y0)
1716 CASE_MATHFN (BUILT_IN_Y1)
1717 CASE_MATHFN (BUILT_IN_YN)
1723 if (TYPE_MAIN_VARIANT (type) == double_type_node)
1724 return implicit_built_in_decls[fcode];
1725 else if (TYPE_MAIN_VARIANT (type) == float_type_node)
1726 return implicit_built_in_decls[fcodef];
1727 else if (TYPE_MAIN_VARIANT (type) == long_double_type_node)
1728 return implicit_built_in_decls[fcodel];
1733 /* If errno must be maintained, expand the RTL to check if the result,
1734 TARGET, of a built-in function call, EXP, is NaN, and if so set
1738 expand_errno_check (tree exp, rtx target)
1740 rtx lab = gen_label_rtx ();
1742 /* Test the result; if it is NaN, set errno=EDOM because
1743 the argument was not in the domain. */
1744 emit_cmp_and_jump_insns (target, target, EQ, 0, GET_MODE (target),
1748 /* If this built-in doesn't throw an exception, set errno directly. */
1749 if (TREE_NOTHROW (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
1751 #ifdef GEN_ERRNO_RTX
1752 rtx errno_rtx = GEN_ERRNO_RTX;
1755 = gen_rtx_MEM (word_mode, gen_rtx_SYMBOL_REF (Pmode, "errno"));
1757 emit_move_insn (errno_rtx, GEN_INT (TARGET_EDOM));
1763 /* We can't set errno=EDOM directly; let the library call do it.
1764 Pop the arguments right away in case the call gets deleted. */
1766 expand_call (exp, target, 0);
1772 /* Expand a call to one of the builtin math functions (sqrt, exp, or log).
1773 Return 0 if a normal call should be emitted rather than expanding the
1774 function in-line. EXP is the expression that is a call to the builtin
1775 function; if convenient, the result should be placed in TARGET.
1776 SUBTARGET may be used as the target for computing one of EXP's operands. */
1779 expand_builtin_mathfn (tree exp, rtx target, rtx subtarget)
1781 optab builtin_optab;
1782 rtx op0, insns, before_call;
1783 tree fndecl = get_callee_fndecl (exp);
1784 tree arglist = TREE_OPERAND (exp, 1);
1785 enum machine_mode mode;
1786 bool errno_set = false;
1789 if (!validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
1792 arg = TREE_VALUE (arglist);
1794 switch (DECL_FUNCTION_CODE (fndecl))
1796 CASE_FLT_FN (BUILT_IN_SQRT):
1797 errno_set = ! tree_expr_nonnegative_p (arg);
1798 builtin_optab = sqrt_optab;
1800 CASE_FLT_FN (BUILT_IN_EXP):
1801 errno_set = true; builtin_optab = exp_optab; break;
1802 CASE_FLT_FN (BUILT_IN_EXP10):
1803 CASE_FLT_FN (BUILT_IN_POW10):
1804 errno_set = true; builtin_optab = exp10_optab; break;
1805 CASE_FLT_FN (BUILT_IN_EXP2):
1806 errno_set = true; builtin_optab = exp2_optab; break;
1807 CASE_FLT_FN (BUILT_IN_EXPM1):
1808 errno_set = true; builtin_optab = expm1_optab; break;
1809 CASE_FLT_FN (BUILT_IN_LOGB):
1810 errno_set = true; builtin_optab = logb_optab; break;
1811 CASE_FLT_FN (BUILT_IN_ILOGB):
1812 errno_set = true; builtin_optab = ilogb_optab; break;
1813 CASE_FLT_FN (BUILT_IN_LOG):
1814 errno_set = true; builtin_optab = log_optab; break;
1815 CASE_FLT_FN (BUILT_IN_LOG10):
1816 errno_set = true; builtin_optab = log10_optab; break;
1817 CASE_FLT_FN (BUILT_IN_LOG2):
1818 errno_set = true; builtin_optab = log2_optab; break;
1819 CASE_FLT_FN (BUILT_IN_LOG1P):
1820 errno_set = true; builtin_optab = log1p_optab; break;
1821 CASE_FLT_FN (BUILT_IN_ASIN):
1822 builtin_optab = asin_optab; break;
1823 CASE_FLT_FN (BUILT_IN_ACOS):
1824 builtin_optab = acos_optab; break;
1825 CASE_FLT_FN (BUILT_IN_TAN):
1826 builtin_optab = tan_optab; break;
1827 CASE_FLT_FN (BUILT_IN_ATAN):
1828 builtin_optab = atan_optab; break;
1829 CASE_FLT_FN (BUILT_IN_FLOOR):
1830 builtin_optab = floor_optab; break;
1831 CASE_FLT_FN (BUILT_IN_CEIL):
1832 builtin_optab = ceil_optab; break;
1833 CASE_FLT_FN (BUILT_IN_TRUNC):
1834 builtin_optab = btrunc_optab; break;
1835 CASE_FLT_FN (BUILT_IN_ROUND):
1836 builtin_optab = round_optab; break;
1837 CASE_FLT_FN (BUILT_IN_NEARBYINT):
1838 builtin_optab = nearbyint_optab; break;
1839 CASE_FLT_FN (BUILT_IN_RINT):
1840 builtin_optab = rint_optab; break;
1845 /* Make a suitable register to place result in. */
1846 mode = TYPE_MODE (TREE_TYPE (exp));
1848 if (! flag_errno_math || ! HONOR_NANS (mode))
1851 /* Before working hard, check whether the instruction is available. */
1852 if (builtin_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
1854 target = gen_reg_rtx (mode);
1856 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
1857 need to expand the argument again. This way, we will not perform
1858 side-effects more the once. */
1859 narg = builtin_save_expr (arg);
1863 arglist = build_tree_list (NULL_TREE, arg);
1864 exp = build_function_call_expr (fndecl, arglist);
1867 op0 = expand_expr (arg, subtarget, VOIDmode, 0);
1871 /* Compute into TARGET.
1872 Set TARGET to wherever the result comes back. */
1873 target = expand_unop (mode, builtin_optab, op0, target, 0);
1878 expand_errno_check (exp, target);
1880 /* Output the entire sequence. */
1881 insns = get_insns ();
1887 /* If we were unable to expand via the builtin, stop the sequence
1888 (without outputting the insns) and call to the library function
1889 with the stabilized argument list. */
1893 before_call = get_last_insn ();
1895 target = expand_call (exp, target, target == const0_rtx);
1897 /* If this is a sqrt operation and we don't care about errno, try to
1898 attach a REG_EQUAL note with a SQRT rtx to the emitted libcall.
1899 This allows the semantics of the libcall to be visible to the RTL
1901 if (builtin_optab == sqrt_optab && !errno_set)
1903 /* Search backwards through the insns emitted by expand_call looking
1904 for the instruction with the REG_RETVAL note. */
1905 rtx last = get_last_insn ();
1906 while (last != before_call)
1908 if (find_reg_note (last, REG_RETVAL, NULL))
1910 rtx note = find_reg_note (last, REG_EQUAL, NULL);
1911 /* Check that the REQ_EQUAL note is an EXPR_LIST with
1912 two elements, i.e. symbol_ref(sqrt) and the operand. */
1914 && GET_CODE (note) == EXPR_LIST
1915 && GET_CODE (XEXP (note, 0)) == EXPR_LIST
1916 && XEXP (XEXP (note, 0), 1) != NULL_RTX
1917 && XEXP (XEXP (XEXP (note, 0), 1), 1) == NULL_RTX)
1919 rtx operand = XEXP (XEXP (XEXP (note, 0), 1), 0);
1920 /* Check operand is a register with expected mode. */
1923 && GET_MODE (operand) == mode)
1925 /* Replace the REG_EQUAL note with a SQRT rtx. */
1926 rtx equiv = gen_rtx_SQRT (mode, operand);
1927 set_unique_reg_note (last, REG_EQUAL, equiv);
1932 last = PREV_INSN (last);
1939 /* Expand a call to the builtin binary math functions (pow and atan2).
1940 Return 0 if a normal call should be emitted rather than expanding the
1941 function in-line. EXP is the expression that is a call to the builtin
1942 function; if convenient, the result should be placed in TARGET.
1943 SUBTARGET may be used as the target for computing one of EXP's
1947 expand_builtin_mathfn_2 (tree exp, rtx target, rtx subtarget)
1949 optab builtin_optab;
1950 rtx op0, op1, insns;
1951 int op1_type = REAL_TYPE;
1952 tree fndecl = get_callee_fndecl (exp);
1953 tree arglist = TREE_OPERAND (exp, 1);
1954 tree arg0, arg1, temp, narg;
1955 enum machine_mode mode;
1956 bool errno_set = true;
1959 if ((DECL_FUNCTION_CODE (fndecl) == BUILT_IN_LDEXP)
1960 || (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_LDEXPF)
1961 || (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_LDEXPL))
1962 op1_type = INTEGER_TYPE;
1964 if (!validate_arglist (arglist, REAL_TYPE, op1_type, VOID_TYPE))
1967 arg0 = TREE_VALUE (arglist);
1968 arg1 = TREE_VALUE (TREE_CHAIN (arglist));
1970 switch (DECL_FUNCTION_CODE (fndecl))
1972 CASE_FLT_FN (BUILT_IN_POW):
1973 builtin_optab = pow_optab; break;
1974 CASE_FLT_FN (BUILT_IN_ATAN2):
1975 builtin_optab = atan2_optab; break;
1976 CASE_FLT_FN (BUILT_IN_LDEXP):
1977 builtin_optab = ldexp_optab; break;
1978 CASE_FLT_FN (BUILT_IN_FMOD):
1979 builtin_optab = fmod_optab; break;
1980 CASE_FLT_FN (BUILT_IN_REMAINDER):
1981 CASE_FLT_FN (BUILT_IN_DREM):
1982 builtin_optab = remainder_optab; break;
1987 /* Make a suitable register to place result in. */
1988 mode = TYPE_MODE (TREE_TYPE (exp));
1990 /* Before working hard, check whether the instruction is available. */
1991 if (builtin_optab->handlers[(int) mode].insn_code == CODE_FOR_nothing)
1994 target = gen_reg_rtx (mode);
1996 if (! flag_errno_math || ! HONOR_NANS (mode))
1999 /* Always stabilize the argument list. */
2000 narg = builtin_save_expr (arg1);
2004 temp = build_tree_list (NULL_TREE, narg);
2008 temp = TREE_CHAIN (arglist);
2010 narg = builtin_save_expr (arg0);
2014 arglist = tree_cons (NULL_TREE, narg, temp);
2018 arglist = tree_cons (NULL_TREE, arg0, temp);
2021 exp = build_function_call_expr (fndecl, arglist);
2023 op0 = expand_expr (arg0, subtarget, VOIDmode, EXPAND_NORMAL);
2024 op1 = expand_normal (arg1);
2028 /* Compute into TARGET.
2029 Set TARGET to wherever the result comes back. */
2030 target = expand_binop (mode, builtin_optab, op0, op1,
2031 target, 0, OPTAB_DIRECT);
2033 /* If we were unable to expand via the builtin, stop the sequence
2034 (without outputting the insns) and call to the library function
2035 with the stabilized argument list. */
2039 return expand_call (exp, target, target == const0_rtx);
2043 expand_errno_check (exp, target);
2045 /* Output the entire sequence. */
2046 insns = get_insns ();
2053 /* Expand a call to the builtin sin and cos math functions.
2054 Return 0 if a normal call should be emitted rather than expanding the
2055 function in-line. EXP is the expression that is a call to the builtin
2056 function; if convenient, the result should be placed in TARGET.
2057 SUBTARGET may be used as the target for computing one of EXP's
2061 expand_builtin_mathfn_3 (tree exp, rtx target, rtx subtarget)
2063 optab builtin_optab;
2065 tree fndecl = get_callee_fndecl (exp);
2066 tree arglist = TREE_OPERAND (exp, 1);
2067 enum machine_mode mode;
2070 if (!validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
2073 arg = TREE_VALUE (arglist);
2075 switch (DECL_FUNCTION_CODE (fndecl))
2077 CASE_FLT_FN (BUILT_IN_SIN):
2078 CASE_FLT_FN (BUILT_IN_COS):
2079 builtin_optab = sincos_optab; break;
2084 /* Make a suitable register to place result in. */
2085 mode = TYPE_MODE (TREE_TYPE (exp));
2087 /* Check if sincos insn is available, otherwise fallback
2088 to sin or cos insn. */
2089 if (builtin_optab->handlers[(int) mode].insn_code == CODE_FOR_nothing) {
2090 switch (DECL_FUNCTION_CODE (fndecl))
2092 CASE_FLT_FN (BUILT_IN_SIN):
2093 builtin_optab = sin_optab; break;
2094 CASE_FLT_FN (BUILT_IN_COS):
2095 builtin_optab = cos_optab; break;
2101 /* Before working hard, check whether the instruction is available. */
2102 if (builtin_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
2104 target = gen_reg_rtx (mode);
2106 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2107 need to expand the argument again. This way, we will not perform
2108 side-effects more the once. */
2109 narg = save_expr (arg);
2113 arglist = build_tree_list (NULL_TREE, arg);
2114 exp = build_function_call_expr (fndecl, arglist);
2117 op0 = expand_expr (arg, subtarget, VOIDmode, 0);
2121 /* Compute into TARGET.
2122 Set TARGET to wherever the result comes back. */
2123 if (builtin_optab == sincos_optab)
2127 switch (DECL_FUNCTION_CODE (fndecl))
2129 CASE_FLT_FN (BUILT_IN_SIN):
2130 result = expand_twoval_unop (builtin_optab, op0, 0, target, 0);
2132 CASE_FLT_FN (BUILT_IN_COS):
2133 result = expand_twoval_unop (builtin_optab, op0, target, 0, 0);
2138 gcc_assert (result);
2142 target = expand_unop (mode, builtin_optab, op0, target, 0);
2147 /* Output the entire sequence. */
2148 insns = get_insns ();
2154 /* If we were unable to expand via the builtin, stop the sequence
2155 (without outputting the insns) and call to the library function
2156 with the stabilized argument list. */
2160 target = expand_call (exp, target, target == const0_rtx);
2165 /* Expand a call to the builtin sincos math function.
2166 Return 0 if a normal call should be emitted rather than expanding the
2167 function in-line. EXP is the expression that is a call to the builtin
2171 expand_builtin_sincos (tree exp)
2173 rtx op0, op1, op2, target1, target2;
2174 tree arglist = TREE_OPERAND (exp, 1);
2175 enum machine_mode mode;
2176 tree arg, sinp, cosp;
2179 if (!validate_arglist (arglist, REAL_TYPE,
2180 POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
2183 arg = TREE_VALUE (arglist);
2184 sinp = TREE_VALUE (TREE_CHAIN (arglist));
2185 cosp = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
2187 /* Make a suitable register to place result in. */
2188 mode = TYPE_MODE (TREE_TYPE (arg));
2190 /* Check if sincos insn is available, otherwise emit the call. */
2191 if (sincos_optab->handlers[(int) mode].insn_code == CODE_FOR_nothing)
2194 target1 = gen_reg_rtx (mode);
2195 target2 = gen_reg_rtx (mode);
2197 op0 = expand_normal (arg);
2198 op1 = expand_normal (build_fold_indirect_ref (sinp));
2199 op2 = expand_normal (build_fold_indirect_ref (cosp));
2201 /* Compute into target1 and target2.
2202 Set TARGET to wherever the result comes back. */
2203 result = expand_twoval_unop (sincos_optab, op0, target2, target1, 0);
2204 gcc_assert (result);
2206 /* Move target1 and target2 to the memory locations indicated
2208 emit_move_insn (op1, target1);
2209 emit_move_insn (op2, target2);
2214 /* Expand a call to one of the builtin rounding functions gcc defines
2215 as an extension (lfloor and lceil). As these are gcc extensions we
2216 do not need to worry about setting errno to EDOM.
2217 If expanding via optab fails, lower expression to (int)(floor(x)).
2218 EXP is the expression that is a call to the builtin function;
2219 if convenient, the result should be placed in TARGET. SUBTARGET may
2220 be used as the target for computing one of EXP's operands. */
2223 expand_builtin_int_roundingfn (tree exp, rtx target, rtx subtarget)
2225 convert_optab builtin_optab;
2226 rtx op0, insns, tmp;
2227 tree fndecl = get_callee_fndecl (exp);
2228 tree arglist = TREE_OPERAND (exp, 1);
2229 enum built_in_function fallback_fn;
2230 tree fallback_fndecl;
2231 enum machine_mode mode;
2234 if (!validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
2237 arg = TREE_VALUE (arglist);
2239 switch (DECL_FUNCTION_CODE (fndecl))
2241 CASE_FLT_FN (BUILT_IN_LCEIL):
2242 CASE_FLT_FN (BUILT_IN_LLCEIL):
2243 builtin_optab = lceil_optab;
2244 fallback_fn = BUILT_IN_CEIL;
2247 CASE_FLT_FN (BUILT_IN_LFLOOR):
2248 CASE_FLT_FN (BUILT_IN_LLFLOOR):
2249 builtin_optab = lfloor_optab;
2250 fallback_fn = BUILT_IN_FLOOR;
2257 /* Make a suitable register to place result in. */
2258 mode = TYPE_MODE (TREE_TYPE (exp));
2260 target = gen_reg_rtx (mode);
2262 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2263 need to expand the argument again. This way, we will not perform
2264 side-effects more the once. */
2265 narg = builtin_save_expr (arg);
2269 arglist = build_tree_list (NULL_TREE, arg);
2270 exp = build_function_call_expr (fndecl, arglist);
2273 op0 = expand_expr (arg, subtarget, VOIDmode, 0);
2277 /* Compute into TARGET. */
2278 if (expand_sfix_optab (target, op0, builtin_optab))
2280 /* Output the entire sequence. */
2281 insns = get_insns ();
2287 /* If we were unable to expand via the builtin, stop the sequence
2288 (without outputting the insns). */
2291 /* Fall back to floating point rounding optab. */
2292 fallback_fndecl = mathfn_built_in (TREE_TYPE (arg), fallback_fn);
2293 /* We shouldn't get here on targets without TARGET_C99_FUNCTIONS.
2294 ??? Perhaps convert (int)floorf(x) into (int)floor((double)x). */
2295 gcc_assert (fallback_fndecl != NULL_TREE);
2296 exp = build_function_call_expr (fallback_fndecl, arglist);
2298 tmp = expand_normal (exp);
2300 /* Truncate the result of floating point optab to integer
2301 via expand_fix (). */
2302 target = gen_reg_rtx (mode);
2303 expand_fix (target, tmp, 0);
2308 /* Expand a call to one of the builtin math functions doing integer
2310 Return 0 if a normal call should be emitted rather than expanding the
2311 function in-line. EXP is the expression that is a call to the builtin
2312 function; if convenient, the result should be placed in TARGET.
2313 SUBTARGET may be used as the target for computing one of EXP's operands. */
2316 expand_builtin_int_roundingfn_2 (tree exp, rtx target, rtx subtarget)
2318 convert_optab builtin_optab;
2320 tree fndecl = get_callee_fndecl (exp);
2321 tree arglist = TREE_OPERAND (exp, 1);
2322 enum machine_mode mode;
2325 /* There's no easy way to detect the case we need to set EDOM. */
2326 if (flag_errno_math)
2329 if (!validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
2332 arg = TREE_VALUE (arglist);
2334 switch (DECL_FUNCTION_CODE (fndecl))
2336 CASE_FLT_FN (BUILT_IN_LRINT):
2337 CASE_FLT_FN (BUILT_IN_LLRINT):
2338 builtin_optab = lrint_optab; break;
2339 CASE_FLT_FN (BUILT_IN_LROUND):
2340 CASE_FLT_FN (BUILT_IN_LLROUND):
2341 builtin_optab = lround_optab; break;
2346 /* Make a suitable register to place result in. */
2347 mode = TYPE_MODE (TREE_TYPE (exp));
2349 target = gen_reg_rtx (mode);
2351 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2352 need to expand the argument again. This way, we will not perform
2353 side-effects more the once. */
2354 narg = builtin_save_expr (arg);
2358 arglist = build_tree_list (NULL_TREE, arg);
2359 exp = build_function_call_expr (fndecl, arglist);
2362 op0 = expand_expr (arg, subtarget, VOIDmode, 0);
2366 if (expand_sfix_optab (target, op0, builtin_optab))
2368 /* Output the entire sequence. */
2369 insns = get_insns ();
2375 /* If we were unable to expand via the builtin, stop the sequence
2376 (without outputting the insns) and call to the library function
2377 with the stabilized argument list. */
2380 target = expand_call (exp, target, target == const0_rtx);
2385 /* To evaluate powi(x,n), the floating point value x raised to the
2386 constant integer exponent n, we use a hybrid algorithm that
2387 combines the "window method" with look-up tables. For an
2388 introduction to exponentiation algorithms and "addition chains",
2389 see section 4.6.3, "Evaluation of Powers" of Donald E. Knuth,
2390 "Seminumerical Algorithms", Vol. 2, "The Art of Computer Programming",
2391 3rd Edition, 1998, and Daniel M. Gordon, "A Survey of Fast Exponentiation
2392 Methods", Journal of Algorithms, Vol. 27, pp. 129-146, 1998. */
2394 /* Provide a default value for POWI_MAX_MULTS, the maximum number of
2395 multiplications to inline before calling the system library's pow
2396 function. powi(x,n) requires at worst 2*bits(n)-2 multiplications,
2397 so this default never requires calling pow, powf or powl. */
2399 #ifndef POWI_MAX_MULTS
2400 #define POWI_MAX_MULTS (2*HOST_BITS_PER_WIDE_INT-2)
2403 /* The size of the "optimal power tree" lookup table. All
2404 exponents less than this value are simply looked up in the
2405 powi_table below. This threshold is also used to size the
2406 cache of pseudo registers that hold intermediate results. */
2407 #define POWI_TABLE_SIZE 256
2409 /* The size, in bits of the window, used in the "window method"
2410 exponentiation algorithm. This is equivalent to a radix of
2411 (1<<POWI_WINDOW_SIZE) in the corresponding "m-ary method". */
2412 #define POWI_WINDOW_SIZE 3
2414 /* The following table is an efficient representation of an
2415 "optimal power tree". For each value, i, the corresponding
2416 value, j, in the table states than an optimal evaluation
2417 sequence for calculating pow(x,i) can be found by evaluating
2418 pow(x,j)*pow(x,i-j). An optimal power tree for the first
2419 100 integers is given in Knuth's "Seminumerical algorithms". */
2421 static const unsigned char powi_table[POWI_TABLE_SIZE] =
2423 0, 1, 1, 2, 2, 3, 3, 4, /* 0 - 7 */
2424 4, 6, 5, 6, 6, 10, 7, 9, /* 8 - 15 */
2425 8, 16, 9, 16, 10, 12, 11, 13, /* 16 - 23 */
2426 12, 17, 13, 18, 14, 24, 15, 26, /* 24 - 31 */
2427 16, 17, 17, 19, 18, 33, 19, 26, /* 32 - 39 */
2428 20, 25, 21, 40, 22, 27, 23, 44, /* 40 - 47 */
2429 24, 32, 25, 34, 26, 29, 27, 44, /* 48 - 55 */
2430 28, 31, 29, 34, 30, 60, 31, 36, /* 56 - 63 */
2431 32, 64, 33, 34, 34, 46, 35, 37, /* 64 - 71 */
2432 36, 65, 37, 50, 38, 48, 39, 69, /* 72 - 79 */
2433 40, 49, 41, 43, 42, 51, 43, 58, /* 80 - 87 */
2434 44, 64, 45, 47, 46, 59, 47, 76, /* 88 - 95 */
2435 48, 65, 49, 66, 50, 67, 51, 66, /* 96 - 103 */
2436 52, 70, 53, 74, 54, 104, 55, 74, /* 104 - 111 */
2437 56, 64, 57, 69, 58, 78, 59, 68, /* 112 - 119 */
2438 60, 61, 61, 80, 62, 75, 63, 68, /* 120 - 127 */
2439 64, 65, 65, 128, 66, 129, 67, 90, /* 128 - 135 */
2440 68, 73, 69, 131, 70, 94, 71, 88, /* 136 - 143 */
2441 72, 128, 73, 98, 74, 132, 75, 121, /* 144 - 151 */
2442 76, 102, 77, 124, 78, 132, 79, 106, /* 152 - 159 */
2443 80, 97, 81, 160, 82, 99, 83, 134, /* 160 - 167 */
2444 84, 86, 85, 95, 86, 160, 87, 100, /* 168 - 175 */
2445 88, 113, 89, 98, 90, 107, 91, 122, /* 176 - 183 */
2446 92, 111, 93, 102, 94, 126, 95, 150, /* 184 - 191 */
2447 96, 128, 97, 130, 98, 133, 99, 195, /* 192 - 199 */
2448 100, 128, 101, 123, 102, 164, 103, 138, /* 200 - 207 */
2449 104, 145, 105, 146, 106, 109, 107, 149, /* 208 - 215 */
2450 108, 200, 109, 146, 110, 170, 111, 157, /* 216 - 223 */
2451 112, 128, 113, 130, 114, 182, 115, 132, /* 224 - 231 */
2452 116, 200, 117, 132, 118, 158, 119, 206, /* 232 - 239 */
2453 120, 240, 121, 162, 122, 147, 123, 152, /* 240 - 247 */
2454 124, 166, 125, 214, 126, 138, 127, 153, /* 248 - 255 */
2458 /* Return the number of multiplications required to calculate
2459 powi(x,n) where n is less than POWI_TABLE_SIZE. This is a
2460 subroutine of powi_cost. CACHE is an array indicating
2461 which exponents have already been calculated. */
2464 powi_lookup_cost (unsigned HOST_WIDE_INT n, bool *cache)
2466 /* If we've already calculated this exponent, then this evaluation
2467 doesn't require any additional multiplications. */
2472 return powi_lookup_cost (n - powi_table[n], cache)
2473 + powi_lookup_cost (powi_table[n], cache) + 1;
2476 /* Return the number of multiplications required to calculate
2477 powi(x,n) for an arbitrary x, given the exponent N. This
2478 function needs to be kept in sync with expand_powi below. */
2481 powi_cost (HOST_WIDE_INT n)
2483 bool cache[POWI_TABLE_SIZE];
2484 unsigned HOST_WIDE_INT digit;
2485 unsigned HOST_WIDE_INT val;
2491 /* Ignore the reciprocal when calculating the cost. */
2492 val = (n < 0) ? -n : n;
2494 /* Initialize the exponent cache. */
2495 memset (cache, 0, POWI_TABLE_SIZE * sizeof (bool));
2500 while (val >= POWI_TABLE_SIZE)
2504 digit = val & ((1 << POWI_WINDOW_SIZE) - 1);
2505 result += powi_lookup_cost (digit, cache)
2506 + POWI_WINDOW_SIZE + 1;
2507 val >>= POWI_WINDOW_SIZE;
2516 return result + powi_lookup_cost (val, cache);
2519 /* Recursive subroutine of expand_powi. This function takes the array,
2520 CACHE, of already calculated exponents and an exponent N and returns
2521 an RTX that corresponds to CACHE[1]**N, as calculated in mode MODE. */
2524 expand_powi_1 (enum machine_mode mode, unsigned HOST_WIDE_INT n, rtx *cache)
2526 unsigned HOST_WIDE_INT digit;
2530 if (n < POWI_TABLE_SIZE)
2535 target = gen_reg_rtx (mode);
2538 op0 = expand_powi_1 (mode, n - powi_table[n], cache);
2539 op1 = expand_powi_1 (mode, powi_table[n], cache);
2543 target = gen_reg_rtx (mode);
2544 digit = n & ((1 << POWI_WINDOW_SIZE) - 1);
2545 op0 = expand_powi_1 (mode, n - digit, cache);
2546 op1 = expand_powi_1 (mode, digit, cache);
2550 target = gen_reg_rtx (mode);
2551 op0 = expand_powi_1 (mode, n >> 1, cache);
2555 result = expand_mult (mode, op0, op1, target, 0);
2556 if (result != target)
2557 emit_move_insn (target, result);
2561 /* Expand the RTL to evaluate powi(x,n) in mode MODE. X is the
2562 floating point operand in mode MODE, and N is the exponent. This
2563 function needs to be kept in sync with powi_cost above. */
2566 expand_powi (rtx x, enum machine_mode mode, HOST_WIDE_INT n)
2568 unsigned HOST_WIDE_INT val;
2569 rtx cache[POWI_TABLE_SIZE];
2573 return CONST1_RTX (mode);
2575 val = (n < 0) ? -n : n;
2577 memset (cache, 0, sizeof (cache));
2580 result = expand_powi_1 (mode, (n < 0) ? -n : n, cache);
2582 /* If the original exponent was negative, reciprocate the result. */
2584 result = expand_binop (mode, sdiv_optab, CONST1_RTX (mode),
2585 result, NULL_RTX, 0, OPTAB_LIB_WIDEN);
2590 /* Expand a call to the pow built-in mathematical function. Return 0 if
2591 a normal call should be emitted rather than expanding the function
2592 in-line. EXP is the expression that is a call to the builtin
2593 function; if convenient, the result should be placed in TARGET. */
2596 expand_builtin_pow (tree exp, rtx target, rtx subtarget)
2598 tree arglist = TREE_OPERAND (exp, 1);
2601 if (! validate_arglist (arglist, REAL_TYPE, REAL_TYPE, VOID_TYPE))
2604 arg0 = TREE_VALUE (arglist);
2605 arg1 = TREE_VALUE (TREE_CHAIN (arglist));
2607 if (TREE_CODE (arg1) == REAL_CST
2608 && ! TREE_CONSTANT_OVERFLOW (arg1))
2610 REAL_VALUE_TYPE cint;
2614 c = TREE_REAL_CST (arg1);
2615 n = real_to_integer (&c);
2616 real_from_integer (&cint, VOIDmode, n, n < 0 ? -1 : 0, 0);
2617 if (real_identical (&c, &cint))
2619 /* If the exponent is -1, 0, 1 or 2, then expand_powi is exact.
2620 Otherwise, check the number of multiplications required.
2621 Note that pow never sets errno for an integer exponent. */
2622 if ((n >= -1 && n <= 2)
2623 || (flag_unsafe_math_optimizations
2625 && powi_cost (n) <= POWI_MAX_MULTS))
2627 enum machine_mode mode = TYPE_MODE (TREE_TYPE (exp));
2628 rtx op = expand_expr (arg0, subtarget, VOIDmode, 0);
2629 op = force_reg (mode, op);
2630 return expand_powi (op, mode, n);
2635 if (! flag_unsafe_math_optimizations)
2637 return expand_builtin_mathfn_2 (exp, target, subtarget);
2640 /* Expand a call to the powi built-in mathematical function. Return 0 if
2641 a normal call should be emitted rather than expanding the function
2642 in-line. EXP is the expression that is a call to the builtin
2643 function; if convenient, the result should be placed in TARGET. */
2646 expand_builtin_powi (tree exp, rtx target, rtx subtarget)
2648 tree arglist = TREE_OPERAND (exp, 1);
2651 enum machine_mode mode;
2652 enum machine_mode mode2;
2654 if (! validate_arglist (arglist, REAL_TYPE, INTEGER_TYPE, VOID_TYPE))
2657 arg0 = TREE_VALUE (arglist);
2658 arg1 = TREE_VALUE (TREE_CHAIN (arglist));
2659 mode = TYPE_MODE (TREE_TYPE (exp));
2661 /* Handle constant power. */
2663 if (TREE_CODE (arg1) == INTEGER_CST
2664 && ! TREE_CONSTANT_OVERFLOW (arg1))
2666 HOST_WIDE_INT n = TREE_INT_CST_LOW (arg1);
2668 /* If the exponent is -1, 0, 1 or 2, then expand_powi is exact.
2669 Otherwise, check the number of multiplications required. */
2670 if ((TREE_INT_CST_HIGH (arg1) == 0
2671 || TREE_INT_CST_HIGH (arg1) == -1)
2672 && ((n >= -1 && n <= 2)
2674 && powi_cost (n) <= POWI_MAX_MULTS)))
2676 op0 = expand_expr (arg0, subtarget, VOIDmode, 0);
2677 op0 = force_reg (mode, op0);
2678 return expand_powi (op0, mode, n);
2682 /* Emit a libcall to libgcc. */
2684 /* Mode of the 2nd argument must match that of an int. */
2685 mode2 = mode_for_size (INT_TYPE_SIZE, MODE_INT, 0);
2687 if (target == NULL_RTX)
2688 target = gen_reg_rtx (mode);
2690 op0 = expand_expr (arg0, subtarget, mode, 0);
2691 if (GET_MODE (op0) != mode)
2692 op0 = convert_to_mode (mode, op0, 0);
2693 op1 = expand_expr (arg1, 0, mode2, 0);
2694 if (GET_MODE (op1) != mode2)
2695 op1 = convert_to_mode (mode2, op1, 0);
2697 target = emit_library_call_value (powi_optab->handlers[(int) mode].libfunc,
2698 target, LCT_CONST_MAKE_BLOCK, mode, 2,
2699 op0, mode, op1, mode2);
2704 /* Expand expression EXP which is a call to the strlen builtin. Return 0
2705 if we failed the caller should emit a normal call, otherwise
2706 try to get the result in TARGET, if convenient. */
2709 expand_builtin_strlen (tree arglist, rtx target,
2710 enum machine_mode target_mode)
2712 if (!validate_arglist (arglist, POINTER_TYPE, VOID_TYPE))
2717 tree len, src = TREE_VALUE (arglist);
2718 rtx result, src_reg, char_rtx, before_strlen;
2719 enum machine_mode insn_mode = target_mode, char_mode;
2720 enum insn_code icode = CODE_FOR_nothing;
2723 /* If the length can be computed at compile-time, return it. */
2724 len = c_strlen (src, 0);
2726 return expand_expr (len, target, target_mode, EXPAND_NORMAL);
2728 /* If the length can be computed at compile-time and is constant
2729 integer, but there are side-effects in src, evaluate
2730 src for side-effects, then return len.
2731 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
2732 can be optimized into: i++; x = 3; */
2733 len = c_strlen (src, 1);
2734 if (len && TREE_CODE (len) == INTEGER_CST)
2736 expand_expr (src, const0_rtx, VOIDmode, EXPAND_NORMAL);
2737 return expand_expr (len, target, target_mode, EXPAND_NORMAL);
2740 align = get_pointer_alignment (src, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
2742 /* If SRC is not a pointer type, don't do this operation inline. */
2746 /* Bail out if we can't compute strlen in the right mode. */
2747 while (insn_mode != VOIDmode)
2749 icode = strlen_optab->handlers[(int) insn_mode].insn_code;
2750 if (icode != CODE_FOR_nothing)
2753 insn_mode = GET_MODE_WIDER_MODE (insn_mode);
2755 if (insn_mode == VOIDmode)
2758 /* Make a place to write the result of the instruction. */
2762 && GET_MODE (result) == insn_mode
2763 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
2764 result = gen_reg_rtx (insn_mode);
2766 /* Make a place to hold the source address. We will not expand
2767 the actual source until we are sure that the expansion will
2768 not fail -- there are trees that cannot be expanded twice. */
2769 src_reg = gen_reg_rtx (Pmode);
2771 /* Mark the beginning of the strlen sequence so we can emit the
2772 source operand later. */
2773 before_strlen = get_last_insn ();
2775 char_rtx = const0_rtx;
2776 char_mode = insn_data[(int) icode].operand[2].mode;
2777 if (! (*insn_data[(int) icode].operand[2].predicate) (char_rtx,
2779 char_rtx = copy_to_mode_reg (char_mode, char_rtx);
2781 pat = GEN_FCN (icode) (result, gen_rtx_MEM (BLKmode, src_reg),
2782 char_rtx, GEN_INT (align));
2787 /* Now that we are assured of success, expand the source. */
2789 pat = expand_expr (src, src_reg, ptr_mode, EXPAND_NORMAL);
2791 emit_move_insn (src_reg, pat);
2796 emit_insn_after (pat, before_strlen);
2798 emit_insn_before (pat, get_insns ());
2800 /* Return the value in the proper mode for this function. */
2801 if (GET_MODE (result) == target_mode)
2803 else if (target != 0)
2804 convert_move (target, result, 0);
2806 target = convert_to_mode (target_mode, result, 0);
2812 /* Expand a call to the strstr builtin. Return 0 if we failed the
2813 caller should emit a normal call, otherwise try to get the result
2814 in TARGET, if convenient (and in mode MODE if that's convenient). */
2817 expand_builtin_strstr (tree arglist, tree type, rtx target, enum machine_mode mode)
2819 if (validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
2821 tree result = fold_builtin_strstr (arglist, type);
2823 return expand_expr (result, target, mode, EXPAND_NORMAL);
2828 /* Expand a call to the strchr builtin. Return 0 if we failed the
2829 caller should emit a normal call, otherwise try to get the result
2830 in TARGET, if convenient (and in mode MODE if that's convenient). */
2833 expand_builtin_strchr (tree arglist, tree type, rtx target, enum machine_mode mode)
2835 if (validate_arglist (arglist, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
2837 tree result = fold_builtin_strchr (arglist, type);
2839 return expand_expr (result, target, mode, EXPAND_NORMAL);
2841 /* FIXME: Should use strchrM optab so that ports can optimize this. */
2846 /* Expand a call to the strrchr builtin. Return 0 if we failed the
2847 caller should emit a normal call, otherwise try to get the result
2848 in TARGET, if convenient (and in mode MODE if that's convenient). */
2851 expand_builtin_strrchr (tree arglist, tree type, rtx target, enum machine_mode mode)
2853 if (validate_arglist (arglist, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
2855 tree result = fold_builtin_strrchr (arglist, type);
2857 return expand_expr (result, target, mode, EXPAND_NORMAL);
2862 /* Expand a call to the strpbrk builtin. Return 0 if we failed the
2863 caller should emit a normal call, otherwise try to get the result
2864 in TARGET, if convenient (and in mode MODE if that's convenient). */
2867 expand_builtin_strpbrk (tree arglist, tree type, rtx target, enum machine_mode mode)
2869 if (validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
2871 tree result = fold_builtin_strpbrk (arglist, type);
2873 return expand_expr (result, target, mode, EXPAND_NORMAL);
2878 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
2879 bytes from constant string DATA + OFFSET and return it as target
2883 builtin_memcpy_read_str (void *data, HOST_WIDE_INT offset,
2884 enum machine_mode mode)
2886 const char *str = (const char *) data;
2888 gcc_assert (offset >= 0
2889 && ((unsigned HOST_WIDE_INT) offset + GET_MODE_SIZE (mode)
2890 <= strlen (str) + 1));
2892 return c_readstr (str + offset, mode);
2895 /* Expand a call to the memcpy builtin, with arguments in ARGLIST.
2896 Return 0 if we failed, the caller should emit a normal call,
2897 otherwise try to get the result in TARGET, if convenient (and in
2898 mode MODE if that's convenient). */
2900 expand_builtin_memcpy (tree exp, rtx target, enum machine_mode mode)
2902 tree fndecl = get_callee_fndecl (exp);
2903 tree arglist = TREE_OPERAND (exp, 1);
2904 if (!validate_arglist (arglist,
2905 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
2909 tree dest = TREE_VALUE (arglist);
2910 tree src = TREE_VALUE (TREE_CHAIN (arglist));
2911 tree len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
2912 const char *src_str;
2913 unsigned int src_align = get_pointer_alignment (src, BIGGEST_ALIGNMENT);
2914 unsigned int dest_align
2915 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
2916 rtx dest_mem, src_mem, dest_addr, len_rtx;
2917 tree result = fold_builtin_memory_op (arglist, TREE_TYPE (TREE_TYPE (fndecl)),
2922 while (TREE_CODE (result) == COMPOUND_EXPR)
2924 expand_expr (TREE_OPERAND (result, 0), const0_rtx, VOIDmode,
2926 result = TREE_OPERAND (result, 1);
2928 return expand_expr (result, target, mode, EXPAND_NORMAL);
2931 /* If DEST is not a pointer type, call the normal function. */
2932 if (dest_align == 0)
2935 /* If either SRC is not a pointer type, don't do this
2936 operation in-line. */
2940 dest_mem = get_memory_rtx (dest, len);
2941 set_mem_align (dest_mem, dest_align);
2942 len_rtx = expand_normal (len);
2943 src_str = c_getstr (src);
2945 /* If SRC is a string constant and block move would be done
2946 by pieces, we can avoid loading the string from memory
2947 and only stored the computed constants. */
2949 && GET_CODE (len_rtx) == CONST_INT
2950 && (unsigned HOST_WIDE_INT) INTVAL (len_rtx) <= strlen (src_str) + 1
2951 && can_store_by_pieces (INTVAL (len_rtx), builtin_memcpy_read_str,
2952 (void *) src_str, dest_align))
2954 dest_mem = store_by_pieces (dest_mem, INTVAL (len_rtx),
2955 builtin_memcpy_read_str,
2956 (void *) src_str, dest_align, 0);
2957 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
2958 dest_mem = convert_memory_address (ptr_mode, dest_mem);
2962 src_mem = get_memory_rtx (src, len);
2963 set_mem_align (src_mem, src_align);
2965 /* Copy word part most expediently. */
2966 dest_addr = emit_block_move (dest_mem, src_mem, len_rtx,
2967 CALL_EXPR_TAILCALL (exp)
2968 ? BLOCK_OP_TAILCALL : BLOCK_OP_NORMAL);
2972 dest_addr = force_operand (XEXP (dest_mem, 0), NULL_RTX);
2973 dest_addr = convert_memory_address (ptr_mode, dest_addr);
2979 /* Expand a call to the mempcpy builtin, with arguments in ARGLIST.
2980 Return 0 if we failed; the caller should emit a normal call,
2981 otherwise try to get the result in TARGET, if convenient (and in
2982 mode MODE if that's convenient). If ENDP is 0 return the
2983 destination pointer, if ENDP is 1 return the end pointer ala
2984 mempcpy, and if ENDP is 2 return the end pointer minus one ala
2988 expand_builtin_mempcpy (tree arglist, tree type, rtx target, enum machine_mode mode,
2991 if (!validate_arglist (arglist,
2992 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
2994 /* If return value is ignored, transform mempcpy into memcpy. */
2995 else if (target == const0_rtx)
2997 tree fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
3002 return expand_expr (build_function_call_expr (fn, arglist),
3003 target, mode, EXPAND_NORMAL);
3007 tree dest = TREE_VALUE (arglist);
3008 tree src = TREE_VALUE (TREE_CHAIN (arglist));
3009 tree len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
3010 const char *src_str;
3011 unsigned int src_align = get_pointer_alignment (src, BIGGEST_ALIGNMENT);
3012 unsigned int dest_align
3013 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
3014 rtx dest_mem, src_mem, len_rtx;
3015 tree result = fold_builtin_memory_op (arglist, type, false, endp);
3019 while (TREE_CODE (result) == COMPOUND_EXPR)
3021 expand_expr (TREE_OPERAND (result, 0), const0_rtx, VOIDmode,
3023 result = TREE_OPERAND (result, 1);
3025 return expand_expr (result, target, mode, EXPAND_NORMAL);
3028 /* If either SRC or DEST is not a pointer type, don't do this
3029 operation in-line. */
3030 if (dest_align == 0 || src_align == 0)
3033 /* If LEN is not constant, call the normal function. */
3034 if (! host_integerp (len, 1))
3037 len_rtx = expand_normal (len);
3038 src_str = c_getstr (src);
3040 /* If SRC is a string constant and block move would be done
3041 by pieces, we can avoid loading the string from memory
3042 and only stored the computed constants. */
3044 && GET_CODE (len_rtx) == CONST_INT
3045 && (unsigned HOST_WIDE_INT) INTVAL (len_rtx) <= strlen (src_str) + 1
3046 && can_store_by_pieces (INTVAL (len_rtx), builtin_memcpy_read_str,
3047 (void *) src_str, dest_align))
3049 dest_mem = get_memory_rtx (dest, len);
3050 set_mem_align (dest_mem, dest_align);
3051 dest_mem = store_by_pieces (dest_mem, INTVAL (len_rtx),
3052 builtin_memcpy_read_str,
3053 (void *) src_str, dest_align, endp);
3054 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3055 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3059 if (GET_CODE (len_rtx) == CONST_INT
3060 && can_move_by_pieces (INTVAL (len_rtx),
3061 MIN (dest_align, src_align)))
3063 dest_mem = get_memory_rtx (dest, len);
3064 set_mem_align (dest_mem, dest_align);
3065 src_mem = get_memory_rtx (src, len);
3066 set_mem_align (src_mem, src_align);
3067 dest_mem = move_by_pieces (dest_mem, src_mem, INTVAL (len_rtx),
3068 MIN (dest_align, src_align), endp);
3069 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3070 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3078 /* Expand expression EXP, which is a call to the memmove builtin. Return 0
3079 if we failed; the caller should emit a normal call. */
3082 expand_builtin_memmove (tree arglist, tree type, rtx target,
3083 enum machine_mode mode)
3085 if (!validate_arglist (arglist,
3086 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3090 tree result = fold_builtin_memory_op (arglist, type, false, /*endp=*/3);
3094 while (TREE_CODE (result) == COMPOUND_EXPR)
3096 expand_expr (TREE_OPERAND (result, 0), const0_rtx, VOIDmode,
3098 result = TREE_OPERAND (result, 1);
3100 return expand_expr (result, target, mode, EXPAND_NORMAL);
3103 /* Otherwise, call the normal function. */
3108 /* Expand expression EXP, which is a call to the bcopy builtin. Return 0
3109 if we failed the caller should emit a normal call. */
3112 expand_builtin_bcopy (tree exp)
3114 tree arglist = TREE_OPERAND (exp, 1);
3115 tree type = TREE_TYPE (exp);
3116 tree src, dest, size, newarglist;
3118 if (!validate_arglist (arglist,
3119 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3122 src = TREE_VALUE (arglist);
3123 dest = TREE_VALUE (TREE_CHAIN (arglist));
3124 size = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
3126 /* New argument list transforming bcopy(ptr x, ptr y, int z) to
3127 memmove(ptr y, ptr x, size_t z). This is done this way
3128 so that if it isn't expanded inline, we fallback to
3129 calling bcopy instead of memmove. */
3131 newarglist = build_tree_list (NULL_TREE, fold_convert (sizetype, size));
3132 newarglist = tree_cons (NULL_TREE, src, newarglist);
3133 newarglist = tree_cons (NULL_TREE, dest, newarglist);
3135 return expand_builtin_memmove (newarglist, type, const0_rtx, VOIDmode);
3139 # define HAVE_movstr 0
3140 # define CODE_FOR_movstr CODE_FOR_nothing
3143 /* Expand into a movstr instruction, if one is available. Return 0 if
3144 we failed, the caller should emit a normal call, otherwise try to
3145 get the result in TARGET, if convenient. If ENDP is 0 return the
3146 destination pointer, if ENDP is 1 return the end pointer ala
3147 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3151 expand_movstr (tree dest, tree src, rtx target, int endp)
3157 const struct insn_data * data;
3162 dest_mem = get_memory_rtx (dest, NULL);
3163 src_mem = get_memory_rtx (src, NULL);
3166 target = force_reg (Pmode, XEXP (dest_mem, 0));
3167 dest_mem = replace_equiv_address (dest_mem, target);
3168 end = gen_reg_rtx (Pmode);
3172 if (target == 0 || target == const0_rtx)
3174 end = gen_reg_rtx (Pmode);
3182 data = insn_data + CODE_FOR_movstr;
3184 if (data->operand[0].mode != VOIDmode)
3185 end = gen_lowpart (data->operand[0].mode, end);
3187 insn = data->genfun (end, dest_mem, src_mem);
3193 /* movstr is supposed to set end to the address of the NUL
3194 terminator. If the caller requested a mempcpy-like return value,
3196 if (endp == 1 && target != const0_rtx)
3198 rtx tem = plus_constant (gen_lowpart (GET_MODE (target), end), 1);
3199 emit_move_insn (target, force_operand (tem, NULL_RTX));
3205 /* Expand expression EXP, which is a call to the strcpy builtin. Return 0
3206 if we failed the caller should emit a normal call, otherwise try to get
3207 the result in TARGET, if convenient (and in mode MODE if that's
3211 expand_builtin_strcpy (tree fndecl, tree arglist, rtx target, enum machine_mode mode)
3213 if (validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3215 tree result = fold_builtin_strcpy (fndecl, arglist, 0);
3218 while (TREE_CODE (result) == COMPOUND_EXPR)
3220 expand_expr (TREE_OPERAND (result, 0), const0_rtx, VOIDmode,
3222 result = TREE_OPERAND (result, 1);
3224 return expand_expr (result, target, mode, EXPAND_NORMAL);
3227 return expand_movstr (TREE_VALUE (arglist),
3228 TREE_VALUE (TREE_CHAIN (arglist)),
3229 target, /*endp=*/0);
3234 /* Expand a call to the stpcpy builtin, with arguments in ARGLIST.
3235 Return 0 if we failed the caller should emit a normal call,
3236 otherwise try to get the result in TARGET, if convenient (and in
3237 mode MODE if that's convenient). */
3240 expand_builtin_stpcpy (tree exp, rtx target, enum machine_mode mode)
3242 tree arglist = TREE_OPERAND (exp, 1);
3243 /* If return value is ignored, transform stpcpy into strcpy. */
3244 if (target == const0_rtx)
3246 tree fn = implicit_built_in_decls[BUILT_IN_STRCPY];
3250 return expand_expr (build_function_call_expr (fn, arglist),
3251 target, mode, EXPAND_NORMAL);
3254 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3258 tree dst, src, len, lenp1;
3262 /* Ensure we get an actual string whose length can be evaluated at
3263 compile-time, not an expression containing a string. This is
3264 because the latter will potentially produce pessimized code
3265 when used to produce the return value. */
3266 src = TREE_VALUE (TREE_CHAIN (arglist));
3267 if (! c_getstr (src) || ! (len = c_strlen (src, 0)))
3268 return expand_movstr (TREE_VALUE (arglist),
3269 TREE_VALUE (TREE_CHAIN (arglist)),
3270 target, /*endp=*/2);
3272 dst = TREE_VALUE (arglist);
3273 lenp1 = size_binop (PLUS_EXPR, len, ssize_int (1));
3274 narglist = build_tree_list (NULL_TREE, lenp1);
3275 narglist = tree_cons (NULL_TREE, src, narglist);
3276 narglist = tree_cons (NULL_TREE, dst, narglist);
3277 ret = expand_builtin_mempcpy (narglist, TREE_TYPE (exp),
3278 target, mode, /*endp=*/2);
3283 if (TREE_CODE (len) == INTEGER_CST)
3285 rtx len_rtx = expand_normal (len);
3287 if (GET_CODE (len_rtx) == CONST_INT)
3289 ret = expand_builtin_strcpy (get_callee_fndecl (exp),
3290 arglist, target, mode);
3296 if (mode != VOIDmode)
3297 target = gen_reg_rtx (mode);
3299 target = gen_reg_rtx (GET_MODE (ret));
3301 if (GET_MODE (target) != GET_MODE (ret))
3302 ret = gen_lowpart (GET_MODE (target), ret);
3304 ret = plus_constant (ret, INTVAL (len_rtx));
3305 ret = emit_move_insn (target, force_operand (ret, NULL_RTX));
3313 return expand_movstr (TREE_VALUE (arglist),
3314 TREE_VALUE (TREE_CHAIN (arglist)),
3315 target, /*endp=*/2);
3319 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3320 bytes from constant string DATA + OFFSET and return it as target
3324 builtin_strncpy_read_str (void *data, HOST_WIDE_INT offset,
3325 enum machine_mode mode)
3327 const char *str = (const char *) data;
3329 if ((unsigned HOST_WIDE_INT) offset > strlen (str))
3332 return c_readstr (str + offset, mode);
3335 /* Expand expression EXP, which is a call to the strncpy builtin. Return 0
3336 if we failed the caller should emit a normal call. */
3339 expand_builtin_strncpy (tree exp, rtx target, enum machine_mode mode)
3341 tree fndecl = get_callee_fndecl (exp);
3342 tree arglist = TREE_OPERAND (exp, 1);
3343 if (validate_arglist (arglist,
3344 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3346 tree slen = c_strlen (TREE_VALUE (TREE_CHAIN (arglist)), 1);
3347 tree len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
3348 tree result = fold_builtin_strncpy (fndecl, arglist, slen);
3352 while (TREE_CODE (result) == COMPOUND_EXPR)
3354 expand_expr (TREE_OPERAND (result, 0), const0_rtx, VOIDmode,
3356 result = TREE_OPERAND (result, 1);
3358 return expand_expr (result, target, mode, EXPAND_NORMAL);
3361 /* We must be passed a constant len and src parameter. */
3362 if (!host_integerp (len, 1) || !slen || !host_integerp (slen, 1))
3365 slen = size_binop (PLUS_EXPR, slen, ssize_int (1));
3367 /* We're required to pad with trailing zeros if the requested
3368 len is greater than strlen(s2)+1. In that case try to
3369 use store_by_pieces, if it fails, punt. */
3370 if (tree_int_cst_lt (slen, len))
3372 tree dest = TREE_VALUE (arglist);
3373 unsigned int dest_align
3374 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
3375 const char *p = c_getstr (TREE_VALUE (TREE_CHAIN (arglist)));
3378 if (!p || dest_align == 0 || !host_integerp (len, 1)
3379 || !can_store_by_pieces (tree_low_cst (len, 1),
3380 builtin_strncpy_read_str,
3381 (void *) p, dest_align))
3384 dest_mem = get_memory_rtx (dest, len);
3385 store_by_pieces (dest_mem, tree_low_cst (len, 1),
3386 builtin_strncpy_read_str,
3387 (void *) p, dest_align, 0);
3388 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3389 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3396 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3397 bytes from constant string DATA + OFFSET and return it as target
3401 builtin_memset_read_str (void *data, HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
3402 enum machine_mode mode)
3404 const char *c = (const char *) data;
3405 char *p = alloca (GET_MODE_SIZE (mode));
3407 memset (p, *c, GET_MODE_SIZE (mode));
3409 return c_readstr (p, mode);
3412 /* Callback routine for store_by_pieces. Return the RTL of a register
3413 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
3414 char value given in the RTL register data. For example, if mode is
3415 4 bytes wide, return the RTL for 0x01010101*data. */
3418 builtin_memset_gen_str (void *data, HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
3419 enum machine_mode mode)
3425 size = GET_MODE_SIZE (mode);
3430 memset (p, 1, size);
3431 coeff = c_readstr (p, mode);
3433 target = convert_to_mode (mode, (rtx) data, 1);
3434 target = expand_mult (mode, target, coeff, NULL_RTX, 1);
3435 return force_reg (mode, target);
3438 /* Expand expression EXP, which is a call to the memset builtin. Return 0
3439 if we failed the caller should emit a normal call, otherwise try to get
3440 the result in TARGET, if convenient (and in mode MODE if that's
3444 expand_builtin_memset (tree arglist, rtx target, enum machine_mode mode,
3447 if (!validate_arglist (arglist,
3448 POINTER_TYPE, INTEGER_TYPE, INTEGER_TYPE, VOID_TYPE))
3452 tree dest = TREE_VALUE (arglist);
3453 tree val = TREE_VALUE (TREE_CHAIN (arglist));
3454 tree len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
3456 enum built_in_function fcode;
3458 unsigned int dest_align;
3459 rtx dest_mem, dest_addr, len_rtx;
3461 dest_align = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
3463 /* If DEST is not a pointer type, don't do this
3464 operation in-line. */
3465 if (dest_align == 0)
3468 /* If the LEN parameter is zero, return DEST. */
3469 if (integer_zerop (len))
3471 /* Evaluate and ignore VAL in case it has side-effects. */
3472 expand_expr (val, const0_rtx, VOIDmode, EXPAND_NORMAL);
3473 return expand_expr (dest, target, mode, EXPAND_NORMAL);
3476 /* Stabilize the arguments in case we fail. */
3477 dest = builtin_save_expr (dest);
3478 val = builtin_save_expr (val);
3479 len = builtin_save_expr (len);
3481 len_rtx = expand_normal (len);
3482 dest_mem = get_memory_rtx (dest, len);
3484 if (TREE_CODE (val) != INTEGER_CST)
3488 val_rtx = expand_normal (val);
3489 val_rtx = convert_to_mode (TYPE_MODE (unsigned_char_type_node),
3492 /* Assume that we can memset by pieces if we can store the
3493 * the coefficients by pieces (in the required modes).
3494 * We can't pass builtin_memset_gen_str as that emits RTL. */
3496 if (host_integerp (len, 1)
3497 && !(optimize_size && tree_low_cst (len, 1) > 1)
3498 && can_store_by_pieces (tree_low_cst (len, 1),
3499 builtin_memset_read_str, &c, dest_align))
3501 val_rtx = force_reg (TYPE_MODE (unsigned_char_type_node),
3503 store_by_pieces (dest_mem, tree_low_cst (len, 1),
3504 builtin_memset_gen_str, val_rtx, dest_align, 0);
3506 else if (!set_storage_via_setmem (dest_mem, len_rtx, val_rtx,
3510 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3511 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3515 if (target_char_cast (val, &c))
3520 if (host_integerp (len, 1)
3521 && !(optimize_size && tree_low_cst (len, 1) > 1)
3522 && can_store_by_pieces (tree_low_cst (len, 1),
3523 builtin_memset_read_str, &c, dest_align))
3524 store_by_pieces (dest_mem, tree_low_cst (len, 1),
3525 builtin_memset_read_str, &c, dest_align, 0);
3526 else if (!set_storage_via_setmem (dest_mem, len_rtx, GEN_INT (c),
3530 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3531 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3535 set_mem_align (dest_mem, dest_align);
3536 dest_addr = clear_storage (dest_mem, len_rtx,
3537 CALL_EXPR_TAILCALL (orig_exp)
3538 ? BLOCK_OP_TAILCALL : BLOCK_OP_NORMAL);
3542 dest_addr = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3543 dest_addr = convert_memory_address (ptr_mode, dest_addr);
3549 fndecl = get_callee_fndecl (orig_exp);
3550 fcode = DECL_FUNCTION_CODE (fndecl);
3551 gcc_assert (fcode == BUILT_IN_MEMSET || fcode == BUILT_IN_BZERO);
3552 arglist = build_tree_list (NULL_TREE, len);
3553 if (fcode == BUILT_IN_MEMSET)
3554 arglist = tree_cons (NULL_TREE, val, arglist);
3555 arglist = tree_cons (NULL_TREE, dest, arglist);
3556 fn = build_function_call_expr (fndecl, arglist);
3557 if (TREE_CODE (fn) == CALL_EXPR)
3558 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (orig_exp);
3559 return expand_call (fn, target, target == const0_rtx);
3563 /* Expand expression EXP, which is a call to the bzero builtin. Return 0
3564 if we failed the caller should emit a normal call. */
3567 expand_builtin_bzero (tree exp)
3569 tree arglist = TREE_OPERAND (exp, 1);
3570 tree dest, size, newarglist;
3572 if (!validate_arglist (arglist, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3575 dest = TREE_VALUE (arglist);
3576 size = TREE_VALUE (TREE_CHAIN (arglist));
3578 /* New argument list transforming bzero(ptr x, int y) to
3579 memset(ptr x, int 0, size_t y). This is done this way
3580 so that if it isn't expanded inline, we fallback to
3581 calling bzero instead of memset. */
3583 newarglist = build_tree_list (NULL_TREE, fold_convert (sizetype, size));
3584 newarglist = tree_cons (NULL_TREE, integer_zero_node, newarglist);
3585 newarglist = tree_cons (NULL_TREE, dest, newarglist);
3587 return expand_builtin_memset (newarglist, const0_rtx, VOIDmode, exp);
3590 /* Expand expression EXP, which is a call to the memcmp built-in function.
3591 ARGLIST is the argument list for this call. Return 0 if we failed and the
3592 caller should emit a normal call, otherwise try to get the result in
3593 TARGET, if convenient (and in mode MODE, if that's convenient). */
3596 expand_builtin_memcmp (tree exp ATTRIBUTE_UNUSED, tree arglist, rtx target,
3597 enum machine_mode mode)
3599 if (!validate_arglist (arglist,
3600 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3604 tree result = fold_builtin_memcmp (arglist);
3606 return expand_expr (result, target, mode, EXPAND_NORMAL);
3609 #if defined HAVE_cmpmemsi || defined HAVE_cmpstrnsi
3611 tree arg1 = TREE_VALUE (arglist);
3612 tree arg2 = TREE_VALUE (TREE_CHAIN (arglist));
3613 tree len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
3614 rtx arg1_rtx, arg2_rtx, arg3_rtx;
3619 = get_pointer_alignment (arg1, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3621 = get_pointer_alignment (arg2, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3622 enum machine_mode insn_mode;
3624 #ifdef HAVE_cmpmemsi
3626 insn_mode = insn_data[(int) CODE_FOR_cmpmemsi].operand[0].mode;
3629 #ifdef HAVE_cmpstrnsi
3631 insn_mode = insn_data[(int) CODE_FOR_cmpstrnsi].operand[0].mode;
3636 /* If we don't have POINTER_TYPE, call the function. */
3637 if (arg1_align == 0 || arg2_align == 0)
3640 /* Make a place to write the result of the instruction. */
3643 && REG_P (result) && GET_MODE (result) == insn_mode
3644 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
3645 result = gen_reg_rtx (insn_mode);
3647 arg1_rtx = get_memory_rtx (arg1, len);
3648 arg2_rtx = get_memory_rtx (arg2, len);
3649 arg3_rtx = expand_normal (len);
3651 /* Set MEM_SIZE as appropriate. */
3652 if (GET_CODE (arg3_rtx) == CONST_INT)
3654 set_mem_size (arg1_rtx, arg3_rtx);
3655 set_mem_size (arg2_rtx, arg3_rtx);
3658 #ifdef HAVE_cmpmemsi
3660 insn = gen_cmpmemsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
3661 GEN_INT (MIN (arg1_align, arg2_align)));
3664 #ifdef HAVE_cmpstrnsi
3666 insn = gen_cmpstrnsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
3667 GEN_INT (MIN (arg1_align, arg2_align)));
3675 emit_library_call_value (memcmp_libfunc, result, LCT_PURE_MAKE_BLOCK,
3676 TYPE_MODE (integer_type_node), 3,
3677 XEXP (arg1_rtx, 0), Pmode,
3678 XEXP (arg2_rtx, 0), Pmode,
3679 convert_to_mode (TYPE_MODE (sizetype), arg3_rtx,
3680 TYPE_UNSIGNED (sizetype)),
3681 TYPE_MODE (sizetype));
3683 /* Return the value in the proper mode for this function. */
3684 mode = TYPE_MODE (TREE_TYPE (exp));
3685 if (GET_MODE (result) == mode)
3687 else if (target != 0)
3689 convert_move (target, result, 0);
3693 return convert_to_mode (mode, result, 0);
3700 /* Expand expression EXP, which is a call to the strcmp builtin. Return 0
3701 if we failed the caller should emit a normal call, otherwise try to get
3702 the result in TARGET, if convenient. */
3705 expand_builtin_strcmp (tree exp, rtx target, enum machine_mode mode)
3707 tree arglist = TREE_OPERAND (exp, 1);
3709 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3713 tree result = fold_builtin_strcmp (arglist);
3715 return expand_expr (result, target, mode, EXPAND_NORMAL);
3718 #if defined HAVE_cmpstrsi || defined HAVE_cmpstrnsi
3719 if (cmpstr_optab[SImode] != CODE_FOR_nothing
3720 || cmpstrn_optab[SImode] != CODE_FOR_nothing)
3722 rtx arg1_rtx, arg2_rtx;
3723 rtx result, insn = NULL_RTX;
3726 tree arg1 = TREE_VALUE (arglist);
3727 tree arg2 = TREE_VALUE (TREE_CHAIN (arglist));
3729 = get_pointer_alignment (arg1, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3731 = get_pointer_alignment (arg2, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3733 /* If we don't have POINTER_TYPE, call the function. */
3734 if (arg1_align == 0 || arg2_align == 0)
3737 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
3738 arg1 = builtin_save_expr (arg1);
3739 arg2 = builtin_save_expr (arg2);
3741 arg1_rtx = get_memory_rtx (arg1, NULL);
3742 arg2_rtx = get_memory_rtx (arg2, NULL);
3744 #ifdef HAVE_cmpstrsi
3745 /* Try to call cmpstrsi. */
3748 enum machine_mode insn_mode
3749 = insn_data[(int) CODE_FOR_cmpstrsi].operand[0].mode;
3751 /* Make a place to write the result of the instruction. */
3754 && REG_P (result) && GET_MODE (result) == insn_mode
3755 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
3756 result = gen_reg_rtx (insn_mode);
3758 insn = gen_cmpstrsi (result, arg1_rtx, arg2_rtx,
3759 GEN_INT (MIN (arg1_align, arg2_align)));
3762 #ifdef HAVE_cmpstrnsi
3763 /* Try to determine at least one length and call cmpstrnsi. */
3764 if (!insn && HAVE_cmpstrnsi)
3769 enum machine_mode insn_mode
3770 = insn_data[(int) CODE_FOR_cmpstrnsi].operand[0].mode;
3771 tree len1 = c_strlen (arg1, 1);
3772 tree len2 = c_strlen (arg2, 1);
3775 len1 = size_binop (PLUS_EXPR, ssize_int (1), len1);
3777 len2 = size_binop (PLUS_EXPR, ssize_int (1), len2);
3779 /* If we don't have a constant length for the first, use the length
3780 of the second, if we know it. We don't require a constant for
3781 this case; some cost analysis could be done if both are available
3782 but neither is constant. For now, assume they're equally cheap,
3783 unless one has side effects. If both strings have constant lengths,
3790 else if (TREE_SIDE_EFFECTS (len1))
3792 else if (TREE_SIDE_EFFECTS (len2))
3794 else if (TREE_CODE (len1) != INTEGER_CST)
3796 else if (TREE_CODE (len2) != INTEGER_CST)
3798 else if (tree_int_cst_lt (len1, len2))
3803 /* If both arguments have side effects, we cannot optimize. */
3804 if (!len || TREE_SIDE_EFFECTS (len))
3807 arg3_rtx = expand_normal (len);
3809 /* Make a place to write the result of the instruction. */
3812 && REG_P (result) && GET_MODE (result) == insn_mode
3813 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
3814 result = gen_reg_rtx (insn_mode);
3816 insn = gen_cmpstrnsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
3817 GEN_INT (MIN (arg1_align, arg2_align)));
3825 /* Return the value in the proper mode for this function. */
3826 mode = TYPE_MODE (TREE_TYPE (exp));
3827 if (GET_MODE (result) == mode)
3830 return convert_to_mode (mode, result, 0);
3831 convert_move (target, result, 0);
3835 /* Expand the library call ourselves using a stabilized argument
3836 list to avoid re-evaluating the function's arguments twice. */
3837 #ifdef HAVE_cmpstrnsi
3840 arglist = build_tree_list (NULL_TREE, arg2);
3841 arglist = tree_cons (NULL_TREE, arg1, arglist);
3842 fndecl = get_callee_fndecl (exp);
3843 fn = build_function_call_expr (fndecl, arglist);
3844 if (TREE_CODE (fn) == CALL_EXPR)
3845 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
3846 return expand_call (fn, target, target == const0_rtx);
3852 /* Expand expression EXP, which is a call to the strncmp builtin. Return 0
3853 if we failed the caller should emit a normal call, otherwise try to get
3854 the result in TARGET, if convenient. */
3857 expand_builtin_strncmp (tree exp, rtx target, enum machine_mode mode)
3859 tree arglist = TREE_OPERAND (exp, 1);
3861 if (!validate_arglist (arglist,
3862 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3866 tree result = fold_builtin_strncmp (arglist);
3868 return expand_expr (result, target, mode, EXPAND_NORMAL);
3871 /* If c_strlen can determine an expression for one of the string
3872 lengths, and it doesn't have side effects, then emit cmpstrnsi
3873 using length MIN(strlen(string)+1, arg3). */
3874 #ifdef HAVE_cmpstrnsi
3877 tree arg1 = TREE_VALUE (arglist);
3878 tree arg2 = TREE_VALUE (TREE_CHAIN (arglist));
3879 tree arg3 = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
3880 tree len, len1, len2;
3881 rtx arg1_rtx, arg2_rtx, arg3_rtx;
3886 = get_pointer_alignment (arg1, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3888 = get_pointer_alignment (arg2, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3889 enum machine_mode insn_mode
3890 = insn_data[(int) CODE_FOR_cmpstrnsi].operand[0].mode;
3892 len1 = c_strlen (arg1, 1);
3893 len2 = c_strlen (arg2, 1);
3896 len1 = size_binop (PLUS_EXPR, ssize_int (1), len1);
3898 len2 = size_binop (PLUS_EXPR, ssize_int (1), len2);
3900 /* If we don't have a constant length for the first, use the length
3901 of the second, if we know it. We don't require a constant for
3902 this case; some cost analysis could be done if both are available
3903 but neither is constant. For now, assume they're equally cheap,
3904 unless one has side effects. If both strings have constant lengths,
3911 else if (TREE_SIDE_EFFECTS (len1))
3913 else if (TREE_SIDE_EFFECTS (len2))
3915 else if (TREE_CODE (len1) != INTEGER_CST)
3917 else if (TREE_CODE (len2) != INTEGER_CST)
3919 else if (tree_int_cst_lt (len1, len2))
3924 /* If both arguments have side effects, we cannot optimize. */
3925 if (!len || TREE_SIDE_EFFECTS (len))
3928 /* The actual new length parameter is MIN(len,arg3). */
3929 len = fold_build2 (MIN_EXPR, TREE_TYPE (len), len,
3930 fold_convert (TREE_TYPE (len), arg3));
3932 /* If we don't have POINTER_TYPE, call the function. */
3933 if (arg1_align == 0 || arg2_align == 0)
3936 /* Make a place to write the result of the instruction. */
3939 && REG_P (result) && GET_MODE (result) == insn_mode
3940 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
3941 result = gen_reg_rtx (insn_mode);
3943 /* Stabilize the arguments in case gen_cmpstrnsi fails. */
3944 arg1 = builtin_save_expr (arg1);
3945 arg2 = builtin_save_expr (arg2);
3946 len = builtin_save_expr (len);
3948 arg1_rtx = get_memory_rtx (arg1, len);
3949 arg2_rtx = get_memory_rtx (arg2, len);
3950 arg3_rtx = expand_normal (len);
3951 insn = gen_cmpstrnsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
3952 GEN_INT (MIN (arg1_align, arg2_align)));
3957 /* Return the value in the proper mode for this function. */
3958 mode = TYPE_MODE (TREE_TYPE (exp));
3959 if (GET_MODE (result) == mode)
3962 return convert_to_mode (mode, result, 0);
3963 convert_move (target, result, 0);
3967 /* Expand the library call ourselves using a stabilized argument
3968 list to avoid re-evaluating the function's arguments twice. */
3969 arglist = build_tree_list (NULL_TREE, len);
3970 arglist = tree_cons (NULL_TREE, arg2, arglist);
3971 arglist = tree_cons (NULL_TREE, arg1, arglist);
3972 fndecl = get_callee_fndecl (exp);
3973 fn = build_function_call_expr (fndecl, arglist);
3974 if (TREE_CODE (fn) == CALL_EXPR)
3975 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
3976 return expand_call (fn, target, target == const0_rtx);
3982 /* Expand expression EXP, which is a call to the strcat builtin.
3983 Return 0 if we failed the caller should emit a normal call,
3984 otherwise try to get the result in TARGET, if convenient. */
3987 expand_builtin_strcat (tree fndecl, tree arglist, rtx target, enum machine_mode mode)
3989 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3993 tree dst = TREE_VALUE (arglist),
3994 src = TREE_VALUE (TREE_CHAIN (arglist));
3995 const char *p = c_getstr (src);
3997 /* If the string length is zero, return the dst parameter. */
3998 if (p && *p == '\0')
3999 return expand_expr (dst, target, mode, EXPAND_NORMAL);
4003 /* See if we can store by pieces into (dst + strlen(dst)). */
4004 tree newsrc, newdst,
4005 strlen_fn = implicit_built_in_decls[BUILT_IN_STRLEN];
4008 /* Stabilize the argument list. */
4009 newsrc = builtin_save_expr (src);
4011 arglist = build_tree_list (NULL_TREE, newsrc);
4013 arglist = TREE_CHAIN (arglist); /* Reusing arglist if safe. */
4015 dst = builtin_save_expr (dst);
4019 /* Create strlen (dst). */
4021 build_function_call_expr (strlen_fn,
4022 build_tree_list (NULL_TREE, dst));
4023 /* Create (dst + (cast) strlen (dst)). */
4024 newdst = fold_convert (TREE_TYPE (dst), newdst);
4025 newdst = fold_build2 (PLUS_EXPR, TREE_TYPE (dst), dst, newdst);
4027 newdst = builtin_save_expr (newdst);
4028 arglist = tree_cons (NULL_TREE, newdst, arglist);
4030 if (!expand_builtin_strcpy (fndecl, arglist, target, mode))
4032 end_sequence (); /* Stop sequence. */
4036 /* Output the entire sequence. */
4037 insns = get_insns ();
4041 return expand_expr (dst, target, mode, EXPAND_NORMAL);
4048 /* Expand expression EXP, which is a call to the strncat builtin.
4049 Return 0 if we failed the caller should emit a normal call,
4050 otherwise try to get the result in TARGET, if convenient. */
4053 expand_builtin_strncat (tree arglist, rtx target, enum machine_mode mode)
4055 if (validate_arglist (arglist,
4056 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
4058 tree result = fold_builtin_strncat (arglist);
4060 return expand_expr (result, target, mode, EXPAND_NORMAL);
4065 /* Expand expression EXP, which is a call to the strspn builtin.
4066 Return 0 if we failed the caller should emit a normal call,
4067 otherwise try to get the result in TARGET, if convenient. */
4070 expand_builtin_strspn (tree arglist, rtx target, enum machine_mode mode)
4072 if (validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
4074 tree result = fold_builtin_strspn (arglist);
4076 return expand_expr (result, target, mode, EXPAND_NORMAL);
4081 /* Expand expression EXP, which is a call to the strcspn builtin.
4082 Return 0 if we failed the caller should emit a normal call,
4083 otherwise try to get the result in TARGET, if convenient. */
4086 expand_builtin_strcspn (tree arglist, rtx target, enum machine_mode mode)
4088 if (validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
4090 tree result = fold_builtin_strcspn (arglist);
4092 return expand_expr (result, target, mode, EXPAND_NORMAL);
4097 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
4098 if that's convenient. */
4101 expand_builtin_saveregs (void)
4105 /* Don't do __builtin_saveregs more than once in a function.
4106 Save the result of the first call and reuse it. */
4107 if (saveregs_value != 0)
4108 return saveregs_value;
4110 /* When this function is called, it means that registers must be
4111 saved on entry to this function. So we migrate the call to the
4112 first insn of this function. */
4116 /* Do whatever the machine needs done in this case. */
4117 val = targetm.calls.expand_builtin_saveregs ();
4122 saveregs_value = val;
4124 /* Put the insns after the NOTE that starts the function. If this
4125 is inside a start_sequence, make the outer-level insn chain current, so
4126 the code is placed at the start of the function. */
4127 push_topmost_sequence ();
4128 emit_insn_after (seq, entry_of_function ());
4129 pop_topmost_sequence ();
4134 /* __builtin_args_info (N) returns word N of the arg space info
4135 for the current function. The number and meanings of words
4136 is controlled by the definition of CUMULATIVE_ARGS. */
4139 expand_builtin_args_info (tree arglist)
4141 int nwords = sizeof (CUMULATIVE_ARGS) / sizeof (int);
4142 int *word_ptr = (int *) ¤t_function_args_info;
4144 gcc_assert (sizeof (CUMULATIVE_ARGS) % sizeof (int) == 0);
4148 if (!host_integerp (TREE_VALUE (arglist), 0))
4149 error ("argument of %<__builtin_args_info%> must be constant");
4152 HOST_WIDE_INT wordnum = tree_low_cst (TREE_VALUE (arglist), 0);
4154 if (wordnum < 0 || wordnum >= nwords)
4155 error ("argument of %<__builtin_args_info%> out of range");
4157 return GEN_INT (word_ptr[wordnum]);
4161 error ("missing argument in %<__builtin_args_info%>");
4166 /* Expand a call to __builtin_next_arg. */
4169 expand_builtin_next_arg (void)
4171 /* Checking arguments is already done in fold_builtin_next_arg
4172 that must be called before this function. */
4173 return expand_binop (Pmode, add_optab,
4174 current_function_internal_arg_pointer,
4175 current_function_arg_offset_rtx,
4176 NULL_RTX, 0, OPTAB_LIB_WIDEN);
4179 /* Make it easier for the backends by protecting the valist argument
4180 from multiple evaluations. */
4183 stabilize_va_list (tree valist, int needs_lvalue)
4185 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
4187 if (TREE_SIDE_EFFECTS (valist))
4188 valist = save_expr (valist);
4190 /* For this case, the backends will be expecting a pointer to
4191 TREE_TYPE (va_list_type_node), but it's possible we've
4192 actually been given an array (an actual va_list_type_node).
4194 if (TREE_CODE (TREE_TYPE (valist)) == ARRAY_TYPE)
4196 tree p1 = build_pointer_type (TREE_TYPE (va_list_type_node));
4197 valist = build_fold_addr_expr_with_type (valist, p1);
4206 if (! TREE_SIDE_EFFECTS (valist))
4209 pt = build_pointer_type (va_list_type_node);
4210 valist = fold_build1 (ADDR_EXPR, pt, valist);
4211 TREE_SIDE_EFFECTS (valist) = 1;
4214 if (TREE_SIDE_EFFECTS (valist))
4215 valist = save_expr (valist);
4216 valist = build_fold_indirect_ref (valist);
4222 /* The "standard" definition of va_list is void*. */
4225 std_build_builtin_va_list (void)
4227 return ptr_type_node;
4230 /* The "standard" implementation of va_start: just assign `nextarg' to
4234 std_expand_builtin_va_start (tree valist, rtx nextarg)
4238 t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist,
4239 make_tree (ptr_type_node, nextarg));
4240 TREE_SIDE_EFFECTS (t) = 1;
4242 expand_expr (t, const0_rtx, VOIDmode, EXPAND_NORMAL);
4245 /* Expand ARGLIST, from a call to __builtin_va_start. */
4248 expand_builtin_va_start (tree arglist)
4253 chain = TREE_CHAIN (arglist);
4257 error ("too few arguments to function %<va_start%>");
4261 if (fold_builtin_next_arg (chain))
4264 nextarg = expand_builtin_next_arg ();
4265 valist = stabilize_va_list (TREE_VALUE (arglist), 1);
4267 #ifdef EXPAND_BUILTIN_VA_START
4268 EXPAND_BUILTIN_VA_START (valist, nextarg);
4270 std_expand_builtin_va_start (valist, nextarg);
4276 /* The "standard" implementation of va_arg: read the value from the
4277 current (padded) address and increment by the (padded) size. */
4280 std_gimplify_va_arg_expr (tree valist, tree type, tree *pre_p, tree *post_p)
4282 tree addr, t, type_size, rounded_size, valist_tmp;
4283 unsigned HOST_WIDE_INT align, boundary;
4286 #ifdef ARGS_GROW_DOWNWARD
4287 /* All of the alignment and movement below is for args-grow-up machines.
4288 As of 2004, there are only 3 ARGS_GROW_DOWNWARD targets, and they all
4289 implement their own specialized gimplify_va_arg_expr routines. */
4293 indirect = pass_by_reference (NULL, TYPE_MODE (type), type, false);
4295 type = build_pointer_type (type);
4297 align = PARM_BOUNDARY / BITS_PER_UNIT;
4298 boundary = FUNCTION_ARG_BOUNDARY (TYPE_MODE (type), type) / BITS_PER_UNIT;
4300 /* Hoist the valist value into a temporary for the moment. */
4301 valist_tmp = get_initialized_tmp_var (valist, pre_p, NULL);
4303 /* va_list pointer is aligned to PARM_BOUNDARY. If argument actually
4304 requires greater alignment, we must perform dynamic alignment. */
4305 if (boundary > align
4306 && !integer_zerop (TYPE_SIZE (type)))
4308 t = fold_convert (TREE_TYPE (valist), size_int (boundary - 1));
4309 t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist_tmp,
4310 build2 (PLUS_EXPR, TREE_TYPE (valist), valist_tmp, t));
4311 gimplify_and_add (t, pre_p);
4313 t = fold_convert (TREE_TYPE (valist), size_int (-boundary));
4314 t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist_tmp,
4315 build2 (BIT_AND_EXPR, TREE_TYPE (valist), valist_tmp, t));
4316 gimplify_and_add (t, pre_p);
4321 /* If the actual alignment is less than the alignment of the type,
4322 adjust the type accordingly so that we don't assume strict alignment
4323 when deferencing the pointer. */
4324 boundary *= BITS_PER_UNIT;
4325 if (boundary < TYPE_ALIGN (type))
4327 type = build_variant_type_copy (type);
4328 TYPE_ALIGN (type) = boundary;
4331 /* Compute the rounded size of the type. */
4332 type_size = size_in_bytes (type);
4333 rounded_size = round_up (type_size, align);
4335 /* Reduce rounded_size so it's sharable with the postqueue. */
4336 gimplify_expr (&rounded_size, pre_p, post_p, is_gimple_val, fb_rvalue);
4340 if (PAD_VARARGS_DOWN && !integer_zerop (rounded_size))
4342 /* Small args are padded downward. */
4343 t = fold_build2 (GT_EXPR, sizetype, rounded_size, size_int (align));
4344 t = fold_build3 (COND_EXPR, sizetype, t, size_zero_node,
4345 size_binop (MINUS_EXPR, rounded_size, type_size));
4346 t = fold_convert (TREE_TYPE (addr), t);
4347 addr = fold_build2 (PLUS_EXPR, TREE_TYPE (addr), addr, t);
4350 /* Compute new value for AP. */
4351 t = fold_convert (TREE_TYPE (valist), rounded_size);
4352 t = build2 (PLUS_EXPR, TREE_TYPE (valist), valist_tmp, t);
4353 t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist, t);
4354 gimplify_and_add (t, pre_p);
4356 addr = fold_convert (build_pointer_type (type), addr);
4359 addr = build_va_arg_indirect_ref (addr);
4361 return build_va_arg_indirect_ref (addr);
4364 /* Build an indirect-ref expression over the given TREE, which represents a
4365 piece of a va_arg() expansion. */
4367 build_va_arg_indirect_ref (tree addr)
4369 addr = build_fold_indirect_ref (addr);
4371 if (flag_mudflap) /* Don't instrument va_arg INDIRECT_REF. */
4377 /* Return a dummy expression of type TYPE in order to keep going after an
4381 dummy_object (tree type)
4383 tree t = build_int_cst (build_pointer_type (type), 0);
4384 return build1 (INDIRECT_REF, type, t);
4387 /* Gimplify __builtin_va_arg, aka VA_ARG_EXPR, which is not really a
4388 builtin function, but a very special sort of operator. */
4390 enum gimplify_status
4391 gimplify_va_arg_expr (tree *expr_p, tree *pre_p, tree *post_p)
4393 tree promoted_type, want_va_type, have_va_type;
4394 tree valist = TREE_OPERAND (*expr_p, 0);
4395 tree type = TREE_TYPE (*expr_p);
4398 /* Verify that valist is of the proper type. */
4399 want_va_type = va_list_type_node;
4400 have_va_type = TREE_TYPE (valist);
4402 if (have_va_type == error_mark_node)
4405 if (TREE_CODE (want_va_type) == ARRAY_TYPE)
4407 /* If va_list is an array type, the argument may have decayed
4408 to a pointer type, e.g. by being passed to another function.
4409 In that case, unwrap both types so that we can compare the
4410 underlying records. */
4411 if (TREE_CODE (have_va_type) == ARRAY_TYPE
4412 || POINTER_TYPE_P (have_va_type))
4414 want_va_type = TREE_TYPE (want_va_type);
4415 have_va_type = TREE_TYPE (have_va_type);
4419 if (TYPE_MAIN_VARIANT (want_va_type) != TYPE_MAIN_VARIANT (have_va_type))
4421 error ("first argument to %<va_arg%> not of type %<va_list%>");
4425 /* Generate a diagnostic for requesting data of a type that cannot
4426 be passed through `...' due to type promotion at the call site. */
4427 else if ((promoted_type = lang_hooks.types.type_promotes_to (type))
4430 static bool gave_help;
4432 /* Unfortunately, this is merely undefined, rather than a constraint
4433 violation, so we cannot make this an error. If this call is never
4434 executed, the program is still strictly conforming. */
4435 warning (0, "%qT is promoted to %qT when passed through %<...%>",
4436 type, promoted_type);
4440 warning (0, "(so you should pass %qT not %qT to %<va_arg%>)",
4441 promoted_type, type);
4444 /* We can, however, treat "undefined" any way we please.
4445 Call abort to encourage the user to fix the program. */
4446 inform ("if this code is reached, the program will abort");
4447 t = build_function_call_expr (implicit_built_in_decls[BUILT_IN_TRAP],
4449 append_to_statement_list (t, pre_p);
4451 /* This is dead code, but go ahead and finish so that the
4452 mode of the result comes out right. */
4453 *expr_p = dummy_object (type);
4458 /* Make it easier for the backends by protecting the valist argument
4459 from multiple evaluations. */
4460 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
4462 /* For this case, the backends will be expecting a pointer to
4463 TREE_TYPE (va_list_type_node), but it's possible we've
4464 actually been given an array (an actual va_list_type_node).
4466 if (TREE_CODE (TREE_TYPE (valist)) == ARRAY_TYPE)
4468 tree p1 = build_pointer_type (TREE_TYPE (va_list_type_node));
4469 valist = build_fold_addr_expr_with_type (valist, p1);
4471 gimplify_expr (&valist, pre_p, post_p, is_gimple_val, fb_rvalue);
4474 gimplify_expr (&valist, pre_p, post_p, is_gimple_min_lval, fb_lvalue);
4476 if (!targetm.gimplify_va_arg_expr)
4477 /* FIXME:Once most targets are converted we should merely
4478 assert this is non-null. */
4481 *expr_p = targetm.gimplify_va_arg_expr (valist, type, pre_p, post_p);
4486 /* Expand ARGLIST, from a call to __builtin_va_end. */
4489 expand_builtin_va_end (tree arglist)
4491 tree valist = TREE_VALUE (arglist);
4493 /* Evaluate for side effects, if needed. I hate macros that don't
4495 if (TREE_SIDE_EFFECTS (valist))
4496 expand_expr (valist, const0_rtx, VOIDmode, EXPAND_NORMAL);
4501 /* Expand ARGLIST, from a call to __builtin_va_copy. We do this as a
4502 builtin rather than just as an assignment in stdarg.h because of the
4503 nastiness of array-type va_list types. */
4506 expand_builtin_va_copy (tree arglist)
4510 dst = TREE_VALUE (arglist);
4511 src = TREE_VALUE (TREE_CHAIN (arglist));
4513 dst = stabilize_va_list (dst, 1);
4514 src = stabilize_va_list (src, 0);
4516 if (TREE_CODE (va_list_type_node) != ARRAY_TYPE)
4518 t = build2 (MODIFY_EXPR, va_list_type_node, dst, src);
4519 TREE_SIDE_EFFECTS (t) = 1;
4520 expand_expr (t, const0_rtx, VOIDmode, EXPAND_NORMAL);
4524 rtx dstb, srcb, size;
4526 /* Evaluate to pointers. */
4527 dstb = expand_expr (dst, NULL_RTX, Pmode, EXPAND_NORMAL);
4528 srcb = expand_expr (src, NULL_RTX, Pmode, EXPAND_NORMAL);
4529 size = expand_expr (TYPE_SIZE_UNIT (va_list_type_node), NULL_RTX,
4530 VOIDmode, EXPAND_NORMAL);
4532 dstb = convert_memory_address (Pmode, dstb);
4533 srcb = convert_memory_address (Pmode, srcb);
4535 /* "Dereference" to BLKmode memories. */
4536 dstb = gen_rtx_MEM (BLKmode, dstb);
4537 set_mem_alias_set (dstb, get_alias_set (TREE_TYPE (TREE_TYPE (dst))));
4538 set_mem_align (dstb, TYPE_ALIGN (va_list_type_node));
4539 srcb = gen_rtx_MEM (BLKmode, srcb);
4540 set_mem_alias_set (srcb, get_alias_set (TREE_TYPE (TREE_TYPE (src))));
4541 set_mem_align (srcb, TYPE_ALIGN (va_list_type_node));
4544 emit_block_move (dstb, srcb, size, BLOCK_OP_NORMAL);
4550 /* Expand a call to one of the builtin functions __builtin_frame_address or
4551 __builtin_return_address. */
4554 expand_builtin_frame_address (tree fndecl, tree arglist)
4556 /* The argument must be a nonnegative integer constant.
4557 It counts the number of frames to scan up the stack.
4558 The value is the return address saved in that frame. */
4560 /* Warning about missing arg was already issued. */
4562 else if (! host_integerp (TREE_VALUE (arglist), 1))
4564 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS)
4565 error ("invalid argument to %<__builtin_frame_address%>");
4567 error ("invalid argument to %<__builtin_return_address%>");
4573 = expand_builtin_return_addr (DECL_FUNCTION_CODE (fndecl),
4574 tree_low_cst (TREE_VALUE (arglist), 1));
4576 /* Some ports cannot access arbitrary stack frames. */
4579 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS)
4580 warning (0, "unsupported argument to %<__builtin_frame_address%>");
4582 warning (0, "unsupported argument to %<__builtin_return_address%>");
4586 /* For __builtin_frame_address, return what we've got. */
4587 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS)
4591 && ! CONSTANT_P (tem))
4592 tem = copy_to_mode_reg (Pmode, tem);
4597 /* Expand a call to the alloca builtin, with arguments ARGLIST. Return 0 if
4598 we failed and the caller should emit a normal call, otherwise try to get
4599 the result in TARGET, if convenient. */
4602 expand_builtin_alloca (tree arglist, rtx target)
4607 /* In -fmudflap-instrumented code, alloca() and __builtin_alloca()
4608 should always expand to function calls. These can be intercepted
4613 if (!validate_arglist (arglist, INTEGER_TYPE, VOID_TYPE))
4616 /* Compute the argument. */
4617 op0 = expand_normal (TREE_VALUE (arglist));
4619 /* Allocate the desired space. */
4620 result = allocate_dynamic_stack_space (op0, target, BITS_PER_UNIT);
4621 result = convert_memory_address (ptr_mode, result);
4626 /* Expand a call to a unary builtin. The arguments are in ARGLIST.
4627 Return 0 if a normal call should be emitted rather than expanding the
4628 function in-line. If convenient, the result should be placed in TARGET.
4629 SUBTARGET may be used as the target for computing one of EXP's operands. */
4632 expand_builtin_unop (enum machine_mode target_mode, tree arglist, rtx target,
4633 rtx subtarget, optab op_optab)
4636 if (!validate_arglist (arglist, INTEGER_TYPE, VOID_TYPE))
4639 /* Compute the argument. */
4640 op0 = expand_expr (TREE_VALUE (arglist), subtarget, VOIDmode, 0);
4641 /* Compute op, into TARGET if possible.
4642 Set TARGET to wherever the result comes back. */
4643 target = expand_unop (TYPE_MODE (TREE_TYPE (TREE_VALUE (arglist))),
4644 op_optab, op0, target, 1);
4645 gcc_assert (target);
4647 return convert_to_mode (target_mode, target, 0);
4650 /* If the string passed to fputs is a constant and is one character
4651 long, we attempt to transform this call into __builtin_fputc(). */
4654 expand_builtin_fputs (tree arglist, rtx target, bool unlocked)
4656 /* Verify the arguments in the original call. */
4657 if (validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
4659 tree result = fold_builtin_fputs (arglist, (target == const0_rtx),
4660 unlocked, NULL_TREE);
4662 return expand_expr (result, target, VOIDmode, EXPAND_NORMAL);
4667 /* Expand a call to __builtin_expect. We return our argument and emit a
4668 NOTE_INSN_EXPECTED_VALUE note. This is the expansion of __builtin_expect in
4669 a non-jump context. */
4672 expand_builtin_expect (tree arglist, rtx target)
4677 if (arglist == NULL_TREE
4678 || TREE_CHAIN (arglist) == NULL_TREE)
4680 exp = TREE_VALUE (arglist);
4681 c = TREE_VALUE (TREE_CHAIN (arglist));
4683 if (TREE_CODE (c) != INTEGER_CST)
4685 error ("second argument to %<__builtin_expect%> must be a constant");
4686 c = integer_zero_node;
4689 target = expand_expr (exp, target, VOIDmode, EXPAND_NORMAL);
4691 /* Don't bother with expected value notes for integral constants. */
4692 if (flag_guess_branch_prob && GET_CODE (target) != CONST_INT)
4694 /* We do need to force this into a register so that we can be
4695 moderately sure to be able to correctly interpret the branch
4697 target = force_reg (GET_MODE (target), target);
4699 rtx_c = expand_expr (c, NULL_RTX, GET_MODE (target), EXPAND_NORMAL);
4701 note = emit_note (NOTE_INSN_EXPECTED_VALUE);
4702 NOTE_EXPECTED_VALUE (note) = gen_rtx_EQ (VOIDmode, target, rtx_c);
4708 /* Like expand_builtin_expect, except do this in a jump context. This is
4709 called from do_jump if the conditional is a __builtin_expect. Return either
4710 a list of insns to emit the jump or NULL if we cannot optimize
4711 __builtin_expect. We need to optimize this at jump time so that machines
4712 like the PowerPC don't turn the test into a SCC operation, and then jump
4713 based on the test being 0/1. */
4716 expand_builtin_expect_jump (tree exp, rtx if_false_label, rtx if_true_label)
4718 tree arglist = TREE_OPERAND (exp, 1);
4719 tree arg0 = TREE_VALUE (arglist);
4720 tree arg1 = TREE_VALUE (TREE_CHAIN (arglist));
4723 /* Only handle __builtin_expect (test, 0) and
4724 __builtin_expect (test, 1). */
4725 if (TREE_CODE (TREE_TYPE (arg1)) == INTEGER_TYPE
4726 && (integer_zerop (arg1) || integer_onep (arg1)))
4728 rtx insn, drop_through_label, temp;
4730 /* Expand the jump insns. */
4732 do_jump (arg0, if_false_label, if_true_label);
4735 drop_through_label = get_last_insn ();
4736 if (drop_through_label && NOTE_P (drop_through_label))
4737 drop_through_label = prev_nonnote_insn (drop_through_label);
4738 if (drop_through_label && !LABEL_P (drop_through_label))
4739 drop_through_label = NULL_RTX;
4742 if (! if_true_label)
4743 if_true_label = drop_through_label;
4744 if (! if_false_label)
4745 if_false_label = drop_through_label;
4747 /* Go through and add the expect's to each of the conditional jumps. */
4749 while (insn != NULL_RTX)
4751 rtx next = NEXT_INSN (insn);
4753 if (JUMP_P (insn) && any_condjump_p (insn))
4755 rtx ifelse = SET_SRC (pc_set (insn));
4756 rtx then_dest = XEXP (ifelse, 1);
4757 rtx else_dest = XEXP (ifelse, 2);
4760 /* First check if we recognize any of the labels. */
4761 if (GET_CODE (then_dest) == LABEL_REF
4762 && XEXP (then_dest, 0) == if_true_label)
4764 else if (GET_CODE (then_dest) == LABEL_REF
4765 && XEXP (then_dest, 0) == if_false_label)
4767 else if (GET_CODE (else_dest) == LABEL_REF
4768 && XEXP (else_dest, 0) == if_false_label)
4770 else if (GET_CODE (else_dest) == LABEL_REF
4771 && XEXP (else_dest, 0) == if_true_label)
4773 /* Otherwise check where we drop through. */
4774 else if (else_dest == pc_rtx)
4776 if (next && NOTE_P (next))
4777 next = next_nonnote_insn (next);
4779 if (next && JUMP_P (next)
4780 && any_uncondjump_p (next))
4781 temp = XEXP (SET_SRC (pc_set (next)), 0);
4785 /* TEMP is either a CODE_LABEL, NULL_RTX or something
4786 else that can't possibly match either target label. */
4787 if (temp == if_false_label)
4789 else if (temp == if_true_label)
4792 else if (then_dest == pc_rtx)
4794 if (next && NOTE_P (next))
4795 next = next_nonnote_insn (next);
4797 if (next && JUMP_P (next)
4798 && any_uncondjump_p (next))
4799 temp = XEXP (SET_SRC (pc_set (next)), 0);
4803 if (temp == if_false_label)
4805 else if (temp == if_true_label)
4811 /* If the test is expected to fail, reverse the
4813 if (integer_zerop (arg1))
4815 predict_insn_def (insn, PRED_BUILTIN_EXPECT, taken);
4827 expand_builtin_trap (void)
4831 emit_insn (gen_trap ());
4834 emit_library_call (abort_libfunc, LCT_NORETURN, VOIDmode, 0);
4838 /* Expand a call to fabs, fabsf or fabsl with arguments ARGLIST.
4839 Return 0 if a normal call should be emitted rather than expanding
4840 the function inline. If convenient, the result should be placed
4841 in TARGET. SUBTARGET may be used as the target for computing
4845 expand_builtin_fabs (tree arglist, rtx target, rtx subtarget)
4847 enum machine_mode mode;
4851 if (!validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
4854 arg = TREE_VALUE (arglist);
4855 mode = TYPE_MODE (TREE_TYPE (arg));
4856 op0 = expand_expr (arg, subtarget, VOIDmode, 0);
4857 return expand_abs (mode, op0, target, 0, safe_from_p (target, arg, 1));
4860 /* Expand a call to copysign, copysignf, or copysignl with arguments ARGLIST.
4861 Return NULL is a normal call should be emitted rather than expanding the
4862 function inline. If convenient, the result should be placed in TARGET.
4863 SUBTARGET may be used as the target for computing the operand. */
4866 expand_builtin_copysign (tree arglist, rtx target, rtx subtarget)
4871 if (!validate_arglist (arglist, REAL_TYPE, REAL_TYPE, VOID_TYPE))
4874 arg = TREE_VALUE (arglist);
4875 op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
4877 arg = TREE_VALUE (TREE_CHAIN (arglist));
4878 op1 = expand_normal (arg);
4880 return expand_copysign (op0, op1, target);
4883 /* Create a new constant string literal and return a char* pointer to it.
4884 The STRING_CST value is the LEN characters at STR. */
4886 build_string_literal (int len, const char *str)
4888 tree t, elem, index, type;
4890 t = build_string (len, str);
4891 elem = build_type_variant (char_type_node, 1, 0);
4892 index = build_index_type (build_int_cst (NULL_TREE, len - 1));
4893 type = build_array_type (elem, index);
4894 TREE_TYPE (t) = type;
4895 TREE_CONSTANT (t) = 1;
4896 TREE_INVARIANT (t) = 1;
4897 TREE_READONLY (t) = 1;
4898 TREE_STATIC (t) = 1;
4900 type = build_pointer_type (type);
4901 t = build1 (ADDR_EXPR, type, t);
4903 type = build_pointer_type (elem);
4904 t = build1 (NOP_EXPR, type, t);
4908 /* Expand EXP, a call to printf or printf_unlocked.
4909 Return 0 if a normal call should be emitted rather than transforming
4910 the function inline. If convenient, the result should be placed in
4911 TARGET with mode MODE. UNLOCKED indicates this is a printf_unlocked
4914 expand_builtin_printf (tree exp, rtx target, enum machine_mode mode,
4917 tree arglist = TREE_OPERAND (exp, 1);
4918 /* If we're using an unlocked function, assume the other unlocked
4919 functions exist explicitly. */
4920 tree const fn_putchar = unlocked ? built_in_decls[BUILT_IN_PUTCHAR_UNLOCKED]
4921 : implicit_built_in_decls[BUILT_IN_PUTCHAR];
4922 tree const fn_puts = unlocked ? built_in_decls[BUILT_IN_PUTS_UNLOCKED]
4923 : implicit_built_in_decls[BUILT_IN_PUTS];
4924 const char *fmt_str;
4927 /* If the return value is used, don't do the transformation. */
4928 if (target != const0_rtx)
4931 /* Verify the required arguments in the original call. */
4934 fmt = TREE_VALUE (arglist);
4935 if (! POINTER_TYPE_P (TREE_TYPE (fmt)))
4937 arglist = TREE_CHAIN (arglist);
4939 /* Check whether the format is a literal string constant. */
4940 fmt_str = c_getstr (fmt);
4941 if (fmt_str == NULL)
4944 if (!init_target_chars())
4947 /* If the format specifier was "%s\n", call __builtin_puts(arg). */
4948 if (strcmp (fmt_str, target_percent_s_newline) == 0)
4951 || ! POINTER_TYPE_P (TREE_TYPE (TREE_VALUE (arglist)))
4952 || TREE_CHAIN (arglist))
4956 /* If the format specifier was "%c", call __builtin_putchar(arg). */
4957 else if (strcmp (fmt_str, target_percent_c) == 0)
4960 || TREE_CODE (TREE_TYPE (TREE_VALUE (arglist))) != INTEGER_TYPE
4961 || TREE_CHAIN (arglist))
4967 /* We can't handle anything else with % args or %% ... yet. */
4968 if (strchr (fmt_str, target_percent))
4974 /* If the format specifier was "", printf does nothing. */
4975 if (fmt_str[0] == '\0')
4977 /* If the format specifier has length of 1, call putchar. */
4978 if (fmt_str[1] == '\0')
4980 /* Given printf("c"), (where c is any one character,)
4981 convert "c"[0] to an int and pass that to the replacement
4983 arg = build_int_cst (NULL_TREE, fmt_str[0]);
4984 arglist = build_tree_list (NULL_TREE, arg);
4989 /* If the format specifier was "string\n", call puts("string"). */
4990 size_t len = strlen (fmt_str);
4991 if ((unsigned char)fmt_str[len - 1] == target_newline)
4993 /* Create a NUL-terminated string that's one char shorter
4994 than the original, stripping off the trailing '\n'. */
4995 char *newstr = alloca (len);
4996 memcpy (newstr, fmt_str, len - 1);
4997 newstr[len - 1] = 0;
4999 arg = build_string_literal (len, newstr);
5000 arglist = build_tree_list (NULL_TREE, arg);
5004 /* We'd like to arrange to call fputs(string,stdout) here,
5005 but we need stdout and don't have a way to get it yet. */
5012 fn = build_function_call_expr (fn, arglist);
5013 if (TREE_CODE (fn) == CALL_EXPR)
5014 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
5015 return expand_expr (fn, target, mode, EXPAND_NORMAL);
5018 /* Expand EXP, a call to fprintf or fprintf_unlocked.
5019 Return 0 if a normal call should be emitted rather than transforming
5020 the function inline. If convenient, the result should be placed in
5021 TARGET with mode MODE. UNLOCKED indicates this is a fprintf_unlocked
5024 expand_builtin_fprintf (tree exp, rtx target, enum machine_mode mode,
5027 tree arglist = TREE_OPERAND (exp, 1);
5028 /* If we're using an unlocked function, assume the other unlocked
5029 functions exist explicitly. */
5030 tree const fn_fputc = unlocked ? built_in_decls[BUILT_IN_FPUTC_UNLOCKED]
5031 : implicit_built_in_decls[BUILT_IN_FPUTC];
5032 tree const fn_fputs = unlocked ? built_in_decls[BUILT_IN_FPUTS_UNLOCKED]
5033 : implicit_built_in_decls[BUILT_IN_FPUTS];
5034 const char *fmt_str;
5035 tree fn, fmt, fp, arg;
5037 /* If the return value is used, don't do the transformation. */
5038 if (target != const0_rtx)
5041 /* Verify the required arguments in the original call. */
5044 fp = TREE_VALUE (arglist);
5045 if (! POINTER_TYPE_P (TREE_TYPE (fp)))
5047 arglist = TREE_CHAIN (arglist);
5050 fmt = TREE_VALUE (arglist);
5051 if (! POINTER_TYPE_P (TREE_TYPE (fmt)))
5053 arglist = TREE_CHAIN (arglist);
5055 /* Check whether the format is a literal string constant. */
5056 fmt_str = c_getstr (fmt);
5057 if (fmt_str == NULL)
5060 if (!init_target_chars())
5063 /* If the format specifier was "%s", call __builtin_fputs(arg,fp). */
5064 if (strcmp (fmt_str, target_percent_s) == 0)
5067 || ! POINTER_TYPE_P (TREE_TYPE (TREE_VALUE (arglist)))
5068 || TREE_CHAIN (arglist))
5070 arg = TREE_VALUE (arglist);
5071 arglist = build_tree_list (NULL_TREE, fp);
5072 arglist = tree_cons (NULL_TREE, arg, arglist);
5075 /* If the format specifier was "%c", call __builtin_fputc(arg,fp). */
5076 else if (strcmp (fmt_str, target_percent_c) == 0)
5079 || TREE_CODE (TREE_TYPE (TREE_VALUE (arglist))) != INTEGER_TYPE
5080 || TREE_CHAIN (arglist))
5082 arg = TREE_VALUE (arglist);
5083 arglist = build_tree_list (NULL_TREE, fp);
5084 arglist = tree_cons (NULL_TREE, arg, arglist);
5089 /* We can't handle anything else with % args or %% ... yet. */
5090 if (strchr (fmt_str, target_percent))
5096 /* If the format specifier was "", fprintf does nothing. */
5097 if (fmt_str[0] == '\0')
5099 /* Evaluate and ignore FILE* argument for side-effects. */
5100 expand_expr (fp, const0_rtx, VOIDmode, EXPAND_NORMAL);
5104 /* When "string" doesn't contain %, replace all cases of
5105 fprintf(stream,string) with fputs(string,stream). The fputs
5106 builtin will take care of special cases like length == 1. */
5107 arglist = build_tree_list (NULL_TREE, fp);
5108 arglist = tree_cons (NULL_TREE, fmt, arglist);
5114 fn = build_function_call_expr (fn, arglist);
5115 if (TREE_CODE (fn) == CALL_EXPR)
5116 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
5117 return expand_expr (fn, target, mode, EXPAND_NORMAL);
5120 /* Expand a call to sprintf with argument list ARGLIST. Return 0 if
5121 a normal call should be emitted rather than expanding the function
5122 inline. If convenient, the result should be placed in TARGET with
5126 expand_builtin_sprintf (tree arglist, rtx target, enum machine_mode mode)
5128 tree orig_arglist, dest, fmt;
5129 const char *fmt_str;
5131 orig_arglist = arglist;
5133 /* Verify the required arguments in the original call. */
5136 dest = TREE_VALUE (arglist);
5137 if (! POINTER_TYPE_P (TREE_TYPE (dest)))
5139 arglist = TREE_CHAIN (arglist);
5142 fmt = TREE_VALUE (arglist);
5143 if (! POINTER_TYPE_P (TREE_TYPE (fmt)))
5145 arglist = TREE_CHAIN (arglist);
5147 /* Check whether the format is a literal string constant. */
5148 fmt_str = c_getstr (fmt);
5149 if (fmt_str == NULL)
5152 if (!init_target_chars())
5155 /* If the format doesn't contain % args or %%, use strcpy. */
5156 if (strchr (fmt_str, target_percent) == 0)
5158 tree fn = implicit_built_in_decls[BUILT_IN_STRCPY];
5161 if (arglist || ! fn)
5163 expand_expr (build_function_call_expr (fn, orig_arglist),
5164 const0_rtx, VOIDmode, EXPAND_NORMAL);
5165 if (target == const0_rtx)
5167 exp = build_int_cst (NULL_TREE, strlen (fmt_str));
5168 return expand_expr (exp, target, mode, EXPAND_NORMAL);
5170 /* If the format is "%s", use strcpy if the result isn't used. */
5171 else if (strcmp (fmt_str, target_percent_s) == 0)
5174 fn = implicit_built_in_decls[BUILT_IN_STRCPY];
5179 if (! arglist || TREE_CHAIN (arglist))
5181 arg = TREE_VALUE (arglist);
5182 if (! POINTER_TYPE_P (TREE_TYPE (arg)))
5185 if (target != const0_rtx)
5187 len = c_strlen (arg, 1);
5188 if (! len || TREE_CODE (len) != INTEGER_CST)
5194 arglist = build_tree_list (NULL_TREE, arg);
5195 arglist = tree_cons (NULL_TREE, dest, arglist);
5196 expand_expr (build_function_call_expr (fn, arglist),
5197 const0_rtx, VOIDmode, EXPAND_NORMAL);
5199 if (target == const0_rtx)
5201 return expand_expr (len, target, mode, EXPAND_NORMAL);
5207 /* Expand a call to either the entry or exit function profiler. */
5210 expand_builtin_profile_func (bool exitp)
5214 this = DECL_RTL (current_function_decl);
5215 gcc_assert (MEM_P (this));
5216 this = XEXP (this, 0);
5219 which = profile_function_exit_libfunc;
5221 which = profile_function_entry_libfunc;
5223 emit_library_call (which, LCT_NORMAL, VOIDmode, 2, this, Pmode,
5224 expand_builtin_return_addr (BUILT_IN_RETURN_ADDRESS,
5231 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
5234 round_trampoline_addr (rtx tramp)
5236 rtx temp, addend, mask;
5238 /* If we don't need too much alignment, we'll have been guaranteed
5239 proper alignment by get_trampoline_type. */
5240 if (TRAMPOLINE_ALIGNMENT <= STACK_BOUNDARY)
5243 /* Round address up to desired boundary. */
5244 temp = gen_reg_rtx (Pmode);
5245 addend = GEN_INT (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT - 1);
5246 mask = GEN_INT (-TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT);
5248 temp = expand_simple_binop (Pmode, PLUS, tramp, addend,
5249 temp, 0, OPTAB_LIB_WIDEN);
5250 tramp = expand_simple_binop (Pmode, AND, temp, mask,
5251 temp, 0, OPTAB_LIB_WIDEN);
5257 expand_builtin_init_trampoline (tree arglist)
5259 tree t_tramp, t_func, t_chain;
5260 rtx r_tramp, r_func, r_chain;
5261 #ifdef TRAMPOLINE_TEMPLATE
5265 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE,
5266 POINTER_TYPE, VOID_TYPE))
5269 t_tramp = TREE_VALUE (arglist);
5270 arglist = TREE_CHAIN (arglist);
5271 t_func = TREE_VALUE (arglist);
5272 arglist = TREE_CHAIN (arglist);
5273 t_chain = TREE_VALUE (arglist);
5275 r_tramp = expand_normal (t_tramp);
5276 r_func = expand_normal (t_func);
5277 r_chain = expand_normal (t_chain);
5279 /* Generate insns to initialize the trampoline. */
5280 r_tramp = round_trampoline_addr (r_tramp);
5281 #ifdef TRAMPOLINE_TEMPLATE
5282 blktramp = gen_rtx_MEM (BLKmode, r_tramp);
5283 set_mem_align (blktramp, TRAMPOLINE_ALIGNMENT);
5284 emit_block_move (blktramp, assemble_trampoline_template (),
5285 GEN_INT (TRAMPOLINE_SIZE), BLOCK_OP_NORMAL);
5287 trampolines_created = 1;
5288 INITIALIZE_TRAMPOLINE (r_tramp, r_func, r_chain);
5294 expand_builtin_adjust_trampoline (tree arglist)
5298 if (!validate_arglist (arglist, POINTER_TYPE, VOID_TYPE))
5301 tramp = expand_normal (TREE_VALUE (arglist));
5302 tramp = round_trampoline_addr (tramp);
5303 #ifdef TRAMPOLINE_ADJUST_ADDRESS
5304 TRAMPOLINE_ADJUST_ADDRESS (tramp);
5310 /* Expand a call to the built-in signbit, signbitf or signbitl function.
5311 Return NULL_RTX if a normal call should be emitted rather than expanding
5312 the function in-line. EXP is the expression that is a call to the builtin
5313 function; if convenient, the result should be placed in TARGET. */
5316 expand_builtin_signbit (tree exp, rtx target)
5318 const struct real_format *fmt;
5319 enum machine_mode fmode, imode, rmode;
5320 HOST_WIDE_INT hi, lo;
5325 arglist = TREE_OPERAND (exp, 1);
5326 if (!validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
5329 arg = TREE_VALUE (arglist);
5330 fmode = TYPE_MODE (TREE_TYPE (arg));
5331 rmode = TYPE_MODE (TREE_TYPE (exp));
5332 fmt = REAL_MODE_FORMAT (fmode);
5334 /* For floating point formats without a sign bit, implement signbit
5336 bitpos = fmt->signbit_ro;
5339 /* But we can't do this if the format supports signed zero. */
5340 if (fmt->has_signed_zero && HONOR_SIGNED_ZEROS (fmode))
5343 arg = fold_build2 (LT_EXPR, TREE_TYPE (exp), arg,
5344 build_real (TREE_TYPE (arg), dconst0));
5345 return expand_expr (arg, target, VOIDmode, EXPAND_NORMAL);
5348 temp = expand_normal (arg);
5349 if (GET_MODE_SIZE (fmode) <= UNITS_PER_WORD)
5351 imode = int_mode_for_mode (fmode);
5352 if (imode == BLKmode)
5354 temp = gen_lowpart (imode, temp);
5359 /* Handle targets with different FP word orders. */
5360 if (FLOAT_WORDS_BIG_ENDIAN)
5361 word = (GET_MODE_BITSIZE (fmode) - bitpos) / BITS_PER_WORD;
5363 word = bitpos / BITS_PER_WORD;
5364 temp = operand_subword_force (temp, word, fmode);
5365 bitpos = bitpos % BITS_PER_WORD;
5368 /* Force the intermediate word_mode (or narrower) result into a
5369 register. This avoids attempting to create paradoxical SUBREGs
5370 of floating point modes below. */
5371 temp = force_reg (imode, temp);
5373 /* If the bitpos is within the "result mode" lowpart, the operation
5374 can be implement with a single bitwise AND. Otherwise, we need
5375 a right shift and an AND. */
5377 if (bitpos < GET_MODE_BITSIZE (rmode))
5379 if (bitpos < HOST_BITS_PER_WIDE_INT)
5382 lo = (HOST_WIDE_INT) 1 << bitpos;
5386 hi = (HOST_WIDE_INT) 1 << (bitpos - HOST_BITS_PER_WIDE_INT);
5391 temp = gen_lowpart (rmode, temp);
5392 temp = expand_binop (rmode, and_optab, temp,
5393 immed_double_const (lo, hi, rmode),
5394 NULL_RTX, 1, OPTAB_LIB_WIDEN);
5398 /* Perform a logical right shift to place the signbit in the least
5399 significant bit, then truncate the result to the desired mode
5400 and mask just this bit. */
5401 temp = expand_shift (RSHIFT_EXPR, imode, temp,
5402 build_int_cst (NULL_TREE, bitpos), NULL_RTX, 1);
5403 temp = gen_lowpart (rmode, temp);
5404 temp = expand_binop (rmode, and_optab, temp, const1_rtx,
5405 NULL_RTX, 1, OPTAB_LIB_WIDEN);
5411 /* Expand fork or exec calls. TARGET is the desired target of the
5412 call. ARGLIST is the list of arguments of the call. FN is the
5413 identificator of the actual function. IGNORE is nonzero if the
5414 value is to be ignored. */
5417 expand_builtin_fork_or_exec (tree fn, tree arglist, rtx target, int ignore)
5422 /* If we are not profiling, just call the function. */
5423 if (!profile_arc_flag)
5426 /* Otherwise call the wrapper. This should be equivalent for the rest of
5427 compiler, so the code does not diverge, and the wrapper may run the
5428 code necessary for keeping the profiling sane. */
5430 switch (DECL_FUNCTION_CODE (fn))
5433 id = get_identifier ("__gcov_fork");
5436 case BUILT_IN_EXECL:
5437 id = get_identifier ("__gcov_execl");
5440 case BUILT_IN_EXECV:
5441 id = get_identifier ("__gcov_execv");
5444 case BUILT_IN_EXECLP:
5445 id = get_identifier ("__gcov_execlp");
5448 case BUILT_IN_EXECLE:
5449 id = get_identifier ("__gcov_execle");
5452 case BUILT_IN_EXECVP:
5453 id = get_identifier ("__gcov_execvp");
5456 case BUILT_IN_EXECVE:
5457 id = get_identifier ("__gcov_execve");
5464 decl = build_decl (FUNCTION_DECL, id, TREE_TYPE (fn));
5465 DECL_EXTERNAL (decl) = 1;
5466 TREE_PUBLIC (decl) = 1;
5467 DECL_ARTIFICIAL (decl) = 1;
5468 TREE_NOTHROW (decl) = 1;
5469 DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT;
5470 DECL_VISIBILITY_SPECIFIED (decl) = 1;
5471 call = build_function_call_expr (decl, arglist);
5473 return expand_call (call, target, ignore);
5477 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
5478 the pointer in these functions is void*, the tree optimizers may remove
5479 casts. The mode computed in expand_builtin isn't reliable either, due
5480 to __sync_bool_compare_and_swap.
5482 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
5483 group of builtins. This gives us log2 of the mode size. */
5485 static inline enum machine_mode
5486 get_builtin_sync_mode (int fcode_diff)
5488 /* The size is not negotiable, so ask not to get BLKmode in return
5489 if the target indicates that a smaller size would be better. */
5490 return mode_for_size (BITS_PER_UNIT << fcode_diff, MODE_INT, 0);
5493 /* Expand the memory expression LOC and return the appropriate memory operand
5494 for the builtin_sync operations. */
5497 get_builtin_sync_mem (tree loc, enum machine_mode mode)
5501 addr = expand_expr (loc, NULL, Pmode, EXPAND_SUM);
5503 /* Note that we explicitly do not want any alias information for this
5504 memory, so that we kill all other live memories. Otherwise we don't
5505 satisfy the full barrier semantics of the intrinsic. */
5506 mem = validize_mem (gen_rtx_MEM (mode, addr));
5508 set_mem_align (mem, get_pointer_alignment (loc, BIGGEST_ALIGNMENT));
5509 set_mem_alias_set (mem, ALIAS_SET_MEMORY_BARRIER);
5510 MEM_VOLATILE_P (mem) = 1;
5515 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
5516 ARGLIST is the operands list to the function. CODE is the rtx code
5517 that corresponds to the arithmetic or logical operation from the name;
5518 an exception here is that NOT actually means NAND. TARGET is an optional
5519 place for us to store the results; AFTER is true if this is the
5520 fetch_and_xxx form. IGNORE is true if we don't actually care about
5521 the result of the operation at all. */
5524 expand_builtin_sync_operation (enum machine_mode mode, tree arglist,
5525 enum rtx_code code, bool after,
5526 rtx target, bool ignore)
5530 /* Expand the operands. */
5531 mem = get_builtin_sync_mem (TREE_VALUE (arglist), mode);
5533 arglist = TREE_CHAIN (arglist);
5534 val = expand_expr (TREE_VALUE (arglist), NULL, mode, EXPAND_NORMAL);
5535 /* If VAL is promoted to a wider mode, convert it back to MODE. */
5536 val = convert_to_mode (mode, val, 1);
5539 return expand_sync_operation (mem, val, code);
5541 return expand_sync_fetch_operation (mem, val, code, after, target);
5544 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
5545 intrinsics. ARGLIST is the operands list to the function. IS_BOOL is
5546 true if this is the boolean form. TARGET is a place for us to store the
5547 results; this is NOT optional if IS_BOOL is true. */
5550 expand_builtin_compare_and_swap (enum machine_mode mode, tree arglist,
5551 bool is_bool, rtx target)
5553 rtx old_val, new_val, mem;
5555 /* Expand the operands. */
5556 mem = get_builtin_sync_mem (TREE_VALUE (arglist), mode);
5558 arglist = TREE_CHAIN (arglist);
5559 old_val = expand_expr (TREE_VALUE (arglist), NULL, mode, EXPAND_NORMAL);
5560 /* If OLD_VAL is promoted to a wider mode, convert it back to MODE. */
5561 old_val = convert_to_mode (mode, old_val, 1);
5563 arglist = TREE_CHAIN (arglist);
5564 new_val = expand_expr (TREE_VALUE (arglist), NULL, mode, EXPAND_NORMAL);
5565 /* If NEW_VAL is promoted to a wider mode, convert it back to MODE. */
5566 new_val = convert_to_mode (mode, new_val, 1);
5569 return expand_bool_compare_and_swap (mem, old_val, new_val, target);
5571 return expand_val_compare_and_swap (mem, old_val, new_val, target);
5574 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
5575 general form is actually an atomic exchange, and some targets only
5576 support a reduced form with the second argument being a constant 1.
5577 ARGLIST is the operands list to the function; TARGET is an optional
5578 place for us to store the results. */
5581 expand_builtin_lock_test_and_set (enum machine_mode mode, tree arglist,
5586 /* Expand the operands. */
5587 mem = get_builtin_sync_mem (TREE_VALUE (arglist), mode);
5589 arglist = TREE_CHAIN (arglist);
5590 val = expand_expr (TREE_VALUE (arglist), NULL, mode, EXPAND_NORMAL);
5591 /* If VAL is promoted to a wider mode, convert it back to MODE. */
5592 val = convert_to_mode (mode, val, 1);
5594 return expand_sync_lock_test_and_set (mem, val, target);
5597 /* Expand the __sync_synchronize intrinsic. */
5600 expand_builtin_synchronize (void)
5604 #ifdef HAVE_memory_barrier
5605 if (HAVE_memory_barrier)
5607 emit_insn (gen_memory_barrier ());
5612 /* If no explicit memory barrier instruction is available, create an
5613 empty asm stmt with a memory clobber. */
5614 x = build4 (ASM_EXPR, void_type_node, build_string (0, ""), NULL, NULL,
5615 tree_cons (NULL, build_string (6, "memory"), NULL));
5616 ASM_VOLATILE_P (x) = 1;
5617 expand_asm_expr (x);
5620 /* Expand the __sync_lock_release intrinsic. ARGLIST is the operands list
5624 expand_builtin_lock_release (enum machine_mode mode, tree arglist)
5626 enum insn_code icode;
5628 rtx val = const0_rtx;
5630 /* Expand the operands. */
5631 mem = get_builtin_sync_mem (TREE_VALUE (arglist), mode);
5633 /* If there is an explicit operation in the md file, use it. */
5634 icode = sync_lock_release[mode];
5635 if (icode != CODE_FOR_nothing)
5637 if (!insn_data[icode].operand[1].predicate (val, mode))
5638 val = force_reg (mode, val);
5640 insn = GEN_FCN (icode) (mem, val);
5648 /* Otherwise we can implement this operation by emitting a barrier
5649 followed by a store of zero. */
5650 expand_builtin_synchronize ();
5651 emit_move_insn (mem, val);
5654 /* Expand an expression EXP that calls a built-in function,
5655 with result going to TARGET if that's convenient
5656 (and in mode MODE if that's convenient).
5657 SUBTARGET may be used as the target for computing one of EXP's operands.
5658 IGNORE is nonzero if the value is to be ignored. */
5661 expand_builtin (tree exp, rtx target, rtx subtarget, enum machine_mode mode,
5664 tree fndecl = get_callee_fndecl (exp);
5665 tree arglist = TREE_OPERAND (exp, 1);
5666 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
5667 enum machine_mode target_mode = TYPE_MODE (TREE_TYPE (exp));
5669 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
5670 return targetm.expand_builtin (exp, target, subtarget, mode, ignore);
5672 /* When not optimizing, generate calls to library functions for a certain
5675 && !called_as_built_in (fndecl)
5676 && DECL_ASSEMBLER_NAME_SET_P (fndecl)
5677 && fcode != BUILT_IN_ALLOCA)
5678 return expand_call (exp, target, ignore);
5680 /* The built-in function expanders test for target == const0_rtx
5681 to determine whether the function's result will be ignored. */
5683 target = const0_rtx;
5685 /* If the result of a pure or const built-in function is ignored, and
5686 none of its arguments are volatile, we can avoid expanding the
5687 built-in call and just evaluate the arguments for side-effects. */
5688 if (target == const0_rtx
5689 && (DECL_IS_PURE (fndecl) || TREE_READONLY (fndecl)))
5691 bool volatilep = false;
5694 for (arg = arglist; arg; arg = TREE_CHAIN (arg))
5695 if (TREE_THIS_VOLATILE (TREE_VALUE (arg)))
5703 for (arg = arglist; arg; arg = TREE_CHAIN (arg))
5704 expand_expr (TREE_VALUE (arg), const0_rtx,
5705 VOIDmode, EXPAND_NORMAL);
5712 CASE_FLT_FN (BUILT_IN_FABS):
5713 target = expand_builtin_fabs (arglist, target, subtarget);
5718 CASE_FLT_FN (BUILT_IN_COPYSIGN):
5719 target = expand_builtin_copysign (arglist, target, subtarget);
5724 /* Just do a normal library call if we were unable to fold
5726 CASE_FLT_FN (BUILT_IN_CABS):
5729 CASE_FLT_FN (BUILT_IN_EXP):
5730 CASE_FLT_FN (BUILT_IN_EXP10):
5731 CASE_FLT_FN (BUILT_IN_POW10):
5732 CASE_FLT_FN (BUILT_IN_EXP2):
5733 CASE_FLT_FN (BUILT_IN_EXPM1):
5734 CASE_FLT_FN (BUILT_IN_LOGB):
5735 CASE_FLT_FN (BUILT_IN_ILOGB):
5736 CASE_FLT_FN (BUILT_IN_LOG):
5737 CASE_FLT_FN (BUILT_IN_LOG10):
5738 CASE_FLT_FN (BUILT_IN_LOG2):
5739 CASE_FLT_FN (BUILT_IN_LOG1P):
5740 CASE_FLT_FN (BUILT_IN_TAN):
5741 CASE_FLT_FN (BUILT_IN_ASIN):
5742 CASE_FLT_FN (BUILT_IN_ACOS):
5743 CASE_FLT_FN (BUILT_IN_ATAN):
5744 /* Treat these like sqrt only if unsafe math optimizations are allowed,
5745 because of possible accuracy problems. */
5746 if (! flag_unsafe_math_optimizations)
5748 CASE_FLT_FN (BUILT_IN_SQRT):
5749 CASE_FLT_FN (BUILT_IN_FLOOR):
5750 CASE_FLT_FN (BUILT_IN_CEIL):
5751 CASE_FLT_FN (BUILT_IN_TRUNC):
5752 CASE_FLT_FN (BUILT_IN_ROUND):
5753 CASE_FLT_FN (BUILT_IN_NEARBYINT):
5754 CASE_FLT_FN (BUILT_IN_RINT):
5755 target = expand_builtin_mathfn (exp, target, subtarget);
5760 CASE_FLT_FN (BUILT_IN_LCEIL):
5761 CASE_FLT_FN (BUILT_IN_LLCEIL):
5762 CASE_FLT_FN (BUILT_IN_LFLOOR):
5763 CASE_FLT_FN (BUILT_IN_LLFLOOR):
5764 target = expand_builtin_int_roundingfn (exp, target, subtarget);
5769 CASE_FLT_FN (BUILT_IN_LRINT):
5770 CASE_FLT_FN (BUILT_IN_LLRINT):
5771 CASE_FLT_FN (BUILT_IN_LROUND):
5772 CASE_FLT_FN (BUILT_IN_LLROUND):
5773 target = expand_builtin_int_roundingfn_2 (exp, target, subtarget);
5778 CASE_FLT_FN (BUILT_IN_POW):
5779 target = expand_builtin_pow (exp, target, subtarget);
5784 CASE_FLT_FN (BUILT_IN_POWI):
5785 target = expand_builtin_powi (exp, target, subtarget);
5790 CASE_FLT_FN (BUILT_IN_ATAN2):
5791 CASE_FLT_FN (BUILT_IN_LDEXP):
5792 if (! flag_unsafe_math_optimizations)
5795 CASE_FLT_FN (BUILT_IN_FMOD):
5796 CASE_FLT_FN (BUILT_IN_REMAINDER):
5797 CASE_FLT_FN (BUILT_IN_DREM):
5798 target = expand_builtin_mathfn_2 (exp, target, subtarget);
5803 CASE_FLT_FN (BUILT_IN_SIN):
5804 CASE_FLT_FN (BUILT_IN_COS):
5805 if (! flag_unsafe_math_optimizations)
5807 target = expand_builtin_mathfn_3 (exp, target, subtarget);
5812 CASE_FLT_FN (BUILT_IN_SINCOS):
5813 if (! flag_unsafe_math_optimizations)
5815 target = expand_builtin_sincos (exp);
5820 case BUILT_IN_APPLY_ARGS:
5821 return expand_builtin_apply_args ();
5823 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
5824 FUNCTION with a copy of the parameters described by
5825 ARGUMENTS, and ARGSIZE. It returns a block of memory
5826 allocated on the stack into which is stored all the registers
5827 that might possibly be used for returning the result of a
5828 function. ARGUMENTS is the value returned by
5829 __builtin_apply_args. ARGSIZE is the number of bytes of
5830 arguments that must be copied. ??? How should this value be
5831 computed? We'll also need a safe worst case value for varargs
5833 case BUILT_IN_APPLY:
5834 if (!validate_arglist (arglist, POINTER_TYPE,
5835 POINTER_TYPE, INTEGER_TYPE, VOID_TYPE)
5836 && !validate_arglist (arglist, REFERENCE_TYPE,
5837 POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
5845 for (t = arglist, i = 0; t; t = TREE_CHAIN (t), i++)
5846 ops[i] = expand_normal (TREE_VALUE (t));
5848 return expand_builtin_apply (ops[0], ops[1], ops[2]);
5851 /* __builtin_return (RESULT) causes the function to return the
5852 value described by RESULT. RESULT is address of the block of
5853 memory returned by __builtin_apply. */
5854 case BUILT_IN_RETURN:
5855 if (validate_arglist (arglist, POINTER_TYPE, VOID_TYPE))
5856 expand_builtin_return (expand_normal (TREE_VALUE (arglist)));
5859 case BUILT_IN_SAVEREGS:
5860 return expand_builtin_saveregs ();
5862 case BUILT_IN_ARGS_INFO:
5863 return expand_builtin_args_info (arglist);
5865 /* Return the address of the first anonymous stack arg. */
5866 case BUILT_IN_NEXT_ARG:
5867 if (fold_builtin_next_arg (arglist))
5869 return expand_builtin_next_arg ();
5871 case BUILT_IN_CLASSIFY_TYPE:
5872 return expand_builtin_classify_type (arglist);
5874 case BUILT_IN_CONSTANT_P:
5877 case BUILT_IN_FRAME_ADDRESS:
5878 case BUILT_IN_RETURN_ADDRESS:
5879 return expand_builtin_frame_address (fndecl, arglist);
5881 /* Returns the address of the area where the structure is returned.
5883 case BUILT_IN_AGGREGATE_INCOMING_ADDRESS:
5885 || ! AGGREGATE_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl)))
5886 || !MEM_P (DECL_RTL (DECL_RESULT (current_function_decl))))
5889 return XEXP (DECL_RTL (DECL_RESULT (current_function_decl)), 0);
5891 case BUILT_IN_ALLOCA:
5892 target = expand_builtin_alloca (arglist, target);
5897 case BUILT_IN_STACK_SAVE:
5898 return expand_stack_save ();
5900 case BUILT_IN_STACK_RESTORE:
5901 expand_stack_restore (TREE_VALUE (arglist));
5904 CASE_INT_FN (BUILT_IN_FFS):
5905 case BUILT_IN_FFSIMAX:
5906 target = expand_builtin_unop (target_mode, arglist, target,
5907 subtarget, ffs_optab);
5912 CASE_INT_FN (BUILT_IN_CLZ):
5913 case BUILT_IN_CLZIMAX:
5914 target = expand_builtin_unop (target_mode, arglist, target,
5915 subtarget, clz_optab);
5920 CASE_INT_FN (BUILT_IN_CTZ):
5921 case BUILT_IN_CTZIMAX:
5922 target = expand_builtin_unop (target_mode, arglist, target,
5923 subtarget, ctz_optab);
5928 CASE_INT_FN (BUILT_IN_POPCOUNT):
5929 case BUILT_IN_POPCOUNTIMAX:
5930 target = expand_builtin_unop (target_mode, arglist, target,
5931 subtarget, popcount_optab);
5936 CASE_INT_FN (BUILT_IN_PARITY):
5937 case BUILT_IN_PARITYIMAX:
5938 target = expand_builtin_unop (target_mode, arglist, target,
5939 subtarget, parity_optab);
5944 case BUILT_IN_STRLEN:
5945 target = expand_builtin_strlen (arglist, target, target_mode);
5950 case BUILT_IN_STRCPY:
5951 target = expand_builtin_strcpy (fndecl, arglist, target, mode);
5956 case BUILT_IN_STRNCPY:
5957 target = expand_builtin_strncpy (exp, target, mode);
5962 case BUILT_IN_STPCPY:
5963 target = expand_builtin_stpcpy (exp, target, mode);
5968 case BUILT_IN_STRCAT:
5969 target = expand_builtin_strcat (fndecl, arglist, target, mode);
5974 case BUILT_IN_STRNCAT:
5975 target = expand_builtin_strncat (arglist, target, mode);
5980 case BUILT_IN_STRSPN:
5981 target = expand_builtin_strspn (arglist, target, mode);
5986 case BUILT_IN_STRCSPN:
5987 target = expand_builtin_strcspn (arglist, target, mode);
5992 case BUILT_IN_STRSTR:
5993 target = expand_builtin_strstr (arglist, TREE_TYPE (exp), target, mode);
5998 case BUILT_IN_STRPBRK:
5999 target = expand_builtin_strpbrk (arglist, TREE_TYPE (exp), target, mode);
6004 case BUILT_IN_INDEX:
6005 case BUILT_IN_STRCHR:
6006 target = expand_builtin_strchr (arglist, TREE_TYPE (exp), target, mode);
6011 case BUILT_IN_RINDEX:
6012 case BUILT_IN_STRRCHR:
6013 target = expand_builtin_strrchr (arglist, TREE_TYPE (exp), target, mode);
6018 case BUILT_IN_MEMCPY:
6019 target = expand_builtin_memcpy (exp, target, mode);
6024 case BUILT_IN_MEMPCPY:
6025 target = expand_builtin_mempcpy (arglist, TREE_TYPE (exp), target, mode, /*endp=*/ 1);
6030 case BUILT_IN_MEMMOVE:
6031 target = expand_builtin_memmove (arglist, TREE_TYPE (exp), target,
6037 case BUILT_IN_BCOPY:
6038 target = expand_builtin_bcopy (exp);
6043 case BUILT_IN_MEMSET:
6044 target = expand_builtin_memset (arglist, target, mode, exp);
6049 case BUILT_IN_BZERO:
6050 target = expand_builtin_bzero (exp);
6055 case BUILT_IN_STRCMP:
6056 target = expand_builtin_strcmp (exp, target, mode);
6061 case BUILT_IN_STRNCMP:
6062 target = expand_builtin_strncmp (exp, target, mode);
6068 case BUILT_IN_MEMCMP:
6069 target = expand_builtin_memcmp (exp, arglist, target, mode);
6074 case BUILT_IN_SETJMP:
6075 /* This should have been lowered to the builtins below. */
6078 case BUILT_IN_SETJMP_SETUP:
6079 /* __builtin_setjmp_setup is passed a pointer to an array of five words
6080 and the receiver label. */
6081 if (validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
6083 rtx buf_addr = expand_expr (TREE_VALUE (arglist), subtarget,
6084 VOIDmode, EXPAND_NORMAL);
6085 tree label = TREE_OPERAND (TREE_VALUE (TREE_CHAIN (arglist)), 0);
6086 rtx label_r = label_rtx (label);
6088 /* This is copied from the handling of non-local gotos. */
6089 expand_builtin_setjmp_setup (buf_addr, label_r);
6090 nonlocal_goto_handler_labels
6091 = gen_rtx_EXPR_LIST (VOIDmode, label_r,
6092 nonlocal_goto_handler_labels);
6093 /* ??? Do not let expand_label treat us as such since we would
6094 not want to be both on the list of non-local labels and on
6095 the list of forced labels. */
6096 FORCED_LABEL (label) = 0;
6101 case BUILT_IN_SETJMP_DISPATCHER:
6102 /* __builtin_setjmp_dispatcher is passed the dispatcher label. */
6103 if (validate_arglist (arglist, POINTER_TYPE, VOID_TYPE))
6105 tree label = TREE_OPERAND (TREE_VALUE (arglist), 0);
6106 rtx label_r = label_rtx (label);
6108 /* Remove the dispatcher label from the list of non-local labels
6109 since the receiver labels have been added to it above. */
6110 remove_node_from_expr_list (label_r, &nonlocal_goto_handler_labels);
6115 case BUILT_IN_SETJMP_RECEIVER:
6116 /* __builtin_setjmp_receiver is passed the receiver label. */
6117 if (validate_arglist (arglist, POINTER_TYPE, VOID_TYPE))
6119 tree label = TREE_OPERAND (TREE_VALUE (arglist), 0);
6120 rtx label_r = label_rtx (label);
6122 expand_builtin_setjmp_receiver (label_r);
6127 /* __builtin_longjmp is passed a pointer to an array of five words.
6128 It's similar to the C library longjmp function but works with
6129 __builtin_setjmp above. */
6130 case BUILT_IN_LONGJMP:
6131 if (validate_arglist (arglist, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
6133 rtx buf_addr = expand_expr (TREE_VALUE (arglist), subtarget,
6134 VOIDmode, EXPAND_NORMAL);
6135 rtx value = expand_normal (TREE_VALUE (TREE_CHAIN (arglist)));
6137 if (value != const1_rtx)
6139 error ("%<__builtin_longjmp%> second argument must be 1");
6143 expand_builtin_longjmp (buf_addr, value);
6148 case BUILT_IN_NONLOCAL_GOTO:
6149 target = expand_builtin_nonlocal_goto (arglist);
6154 /* This updates the setjmp buffer that is its argument with the value
6155 of the current stack pointer. */
6156 case BUILT_IN_UPDATE_SETJMP_BUF:
6157 if (validate_arglist (arglist, POINTER_TYPE, VOID_TYPE))
6160 = expand_normal (TREE_VALUE (arglist));
6162 expand_builtin_update_setjmp_buf (buf_addr);
6168 expand_builtin_trap ();
6171 case BUILT_IN_PRINTF:
6172 target = expand_builtin_printf (exp, target, mode, false);
6177 case BUILT_IN_PRINTF_UNLOCKED:
6178 target = expand_builtin_printf (exp, target, mode, true);
6183 case BUILT_IN_FPUTS:
6184 target = expand_builtin_fputs (arglist, target, false);
6188 case BUILT_IN_FPUTS_UNLOCKED:
6189 target = expand_builtin_fputs (arglist, target, true);
6194 case BUILT_IN_FPRINTF:
6195 target = expand_builtin_fprintf (exp, target, mode, false);
6200 case BUILT_IN_FPRINTF_UNLOCKED:
6201 target = expand_builtin_fprintf (exp, target, mode, true);
6206 case BUILT_IN_SPRINTF:
6207 target = expand_builtin_sprintf (arglist, target, mode);
6212 CASE_FLT_FN (BUILT_IN_SIGNBIT):
6213 target = expand_builtin_signbit (exp, target);
6218 /* Various hooks for the DWARF 2 __throw routine. */
6219 case BUILT_IN_UNWIND_INIT:
6220 expand_builtin_unwind_init ();
6222 case BUILT_IN_DWARF_CFA:
6223 return virtual_cfa_rtx;
6224 #ifdef DWARF2_UNWIND_INFO
6225 case BUILT_IN_DWARF_SP_COLUMN:
6226 return expand_builtin_dwarf_sp_column ();
6227 case BUILT_IN_INIT_DWARF_REG_SIZES:
6228 expand_builtin_init_dwarf_reg_sizes (TREE_VALUE (arglist));
6231 case BUILT_IN_FROB_RETURN_ADDR:
6232 return expand_builtin_frob_return_addr (TREE_VALUE (arglist));
6233 case BUILT_IN_EXTRACT_RETURN_ADDR:
6234 return expand_builtin_extract_return_addr (TREE_VALUE (arglist));
6235 case BUILT_IN_EH_RETURN:
6236 expand_builtin_eh_return (TREE_VALUE (arglist),
6237 TREE_VALUE (TREE_CHAIN (arglist)));
6239 #ifdef EH_RETURN_DATA_REGNO
6240 case BUILT_IN_EH_RETURN_DATA_REGNO:
6241 return expand_builtin_eh_return_data_regno (arglist);
6243 case BUILT_IN_EXTEND_POINTER:
6244 return expand_builtin_extend_pointer (TREE_VALUE (arglist));
6246 case BUILT_IN_VA_START:
6247 case BUILT_IN_STDARG_START:
6248 return expand_builtin_va_start (arglist);
6249 case BUILT_IN_VA_END:
6250 return expand_builtin_va_end (arglist);
6251 case BUILT_IN_VA_COPY:
6252 return expand_builtin_va_copy (arglist);
6253 case BUILT_IN_EXPECT:
6254 return expand_builtin_expect (arglist, target);
6255 case BUILT_IN_PREFETCH:
6256 expand_builtin_prefetch (arglist);
6259 case BUILT_IN_PROFILE_FUNC_ENTER:
6260 return expand_builtin_profile_func (false);
6261 case BUILT_IN_PROFILE_FUNC_EXIT:
6262 return expand_builtin_profile_func (true);
6264 case BUILT_IN_INIT_TRAMPOLINE:
6265 return expand_builtin_init_trampoline (arglist);
6266 case BUILT_IN_ADJUST_TRAMPOLINE:
6267 return expand_builtin_adjust_trampoline (arglist);
6270 case BUILT_IN_EXECL:
6271 case BUILT_IN_EXECV:
6272 case BUILT_IN_EXECLP:
6273 case BUILT_IN_EXECLE:
6274 case BUILT_IN_EXECVP:
6275 case BUILT_IN_EXECVE:
6276 target = expand_builtin_fork_or_exec (fndecl, arglist, target, ignore);
6281 case BUILT_IN_FETCH_AND_ADD_1:
6282 case BUILT_IN_FETCH_AND_ADD_2:
6283 case BUILT_IN_FETCH_AND_ADD_4:
6284 case BUILT_IN_FETCH_AND_ADD_8:
6285 case BUILT_IN_FETCH_AND_ADD_16:
6286 mode = get_builtin_sync_mode (fcode - BUILT_IN_FETCH_AND_ADD_1);
6287 target = expand_builtin_sync_operation (mode, arglist, PLUS,
6288 false, target, ignore);
6293 case BUILT_IN_FETCH_AND_SUB_1:
6294 case BUILT_IN_FETCH_AND_SUB_2:
6295 case BUILT_IN_FETCH_AND_SUB_4:
6296 case BUILT_IN_FETCH_AND_SUB_8:
6297 case BUILT_IN_FETCH_AND_SUB_16:
6298 mode = get_builtin_sync_mode (fcode - BUILT_IN_FETCH_AND_SUB_1);
6299 target = expand_builtin_sync_operation (mode, arglist, MINUS,
6300 false, target, ignore);
6305 case BUILT_IN_FETCH_AND_OR_1:
6306 case BUILT_IN_FETCH_AND_OR_2:
6307 case BUILT_IN_FETCH_AND_OR_4:
6308 case BUILT_IN_FETCH_AND_OR_8:
6309 case BUILT_IN_FETCH_AND_OR_16:
6310 mode = get_builtin_sync_mode (fcode - BUILT_IN_FETCH_AND_OR_1);
6311 target = expand_builtin_sync_operation (mode, arglist, IOR,
6312 false, target, ignore);
6317 case BUILT_IN_FETCH_AND_AND_1:
6318 case BUILT_IN_FETCH_AND_AND_2:
6319 case BUILT_IN_FETCH_AND_AND_4:
6320 case BUILT_IN_FETCH_AND_AND_8:
6321 case BUILT_IN_FETCH_AND_AND_16:
6322 mode = get_builtin_sync_mode (fcode - BUILT_IN_FETCH_AND_AND_1);
6323 target = expand_builtin_sync_operation (mode, arglist, AND,
6324 false, target, ignore);
6329 case BUILT_IN_FETCH_AND_XOR_1:
6330 case BUILT_IN_FETCH_AND_XOR_2:
6331 case BUILT_IN_FETCH_AND_XOR_4:
6332 case BUILT_IN_FETCH_AND_XOR_8:
6333 case BUILT_IN_FETCH_AND_XOR_16:
6334 mode = get_builtin_sync_mode (fcode - BUILT_IN_FETCH_AND_XOR_1);
6335 target = expand_builtin_sync_operation (mode, arglist, XOR,
6336 false, target, ignore);
6341 case BUILT_IN_FETCH_AND_NAND_1:
6342 case BUILT_IN_FETCH_AND_NAND_2:
6343 case BUILT_IN_FETCH_AND_NAND_4:
6344 case BUILT_IN_FETCH_AND_NAND_8:
6345 case BUILT_IN_FETCH_AND_NAND_16:
6346 mode = get_builtin_sync_mode (fcode - BUILT_IN_FETCH_AND_NAND_1);
6347 target = expand_builtin_sync_operation (mode, arglist, NOT,
6348 false, target, ignore);
6353 case BUILT_IN_ADD_AND_FETCH_1:
6354 case BUILT_IN_ADD_AND_FETCH_2:
6355 case BUILT_IN_ADD_AND_FETCH_4:
6356 case BUILT_IN_ADD_AND_FETCH_8:
6357 case BUILT_IN_ADD_AND_FETCH_16:
6358 mode = get_builtin_sync_mode (fcode - BUILT_IN_ADD_AND_FETCH_1);
6359 target = expand_builtin_sync_operation (mode, arglist, PLUS,
6360 true, target, ignore);
6365 case BUILT_IN_SUB_AND_FETCH_1:
6366 case BUILT_IN_SUB_AND_FETCH_2:
6367 case BUILT_IN_SUB_AND_FETCH_4:
6368 case BUILT_IN_SUB_AND_FETCH_8:
6369 case BUILT_IN_SUB_AND_FETCH_16:
6370 mode = get_builtin_sync_mode (fcode - BUILT_IN_SUB_AND_FETCH_1);
6371 target = expand_builtin_sync_operation (mode, arglist, MINUS,
6372 true, target, ignore);
6377 case BUILT_IN_OR_AND_FETCH_1:
6378 case BUILT_IN_OR_AND_FETCH_2:
6379 case BUILT_IN_OR_AND_FETCH_4:
6380 case BUILT_IN_OR_AND_FETCH_8:
6381 case BUILT_IN_OR_AND_FETCH_16:
6382 mode = get_builtin_sync_mode (fcode - BUILT_IN_OR_AND_FETCH_1);
6383 target = expand_builtin_sync_operation (mode, arglist, IOR,
6384 true, target, ignore);
6389 case BUILT_IN_AND_AND_FETCH_1:
6390 case BUILT_IN_AND_AND_FETCH_2:
6391 case BUILT_IN_AND_AND_FETCH_4:
6392 case BUILT_IN_AND_AND_FETCH_8:
6393 case BUILT_IN_AND_AND_FETCH_16:
6394 mode = get_builtin_sync_mode (fcode - BUILT_IN_AND_AND_FETCH_1);
6395 target = expand_builtin_sync_operation (mode, arglist, AND,
6396 true, target, ignore);
6401 case BUILT_IN_XOR_AND_FETCH_1:
6402 case BUILT_IN_XOR_AND_FETCH_2:
6403 case BUILT_IN_XOR_AND_FETCH_4:
6404 case BUILT_IN_XOR_AND_FETCH_8:
6405 case BUILT_IN_XOR_AND_FETCH_16:
6406 mode = get_builtin_sync_mode (fcode - BUILT_IN_XOR_AND_FETCH_1);
6407 target = expand_builtin_sync_operation (mode, arglist, XOR,
6408 true, target, ignore);
6413 case BUILT_IN_NAND_AND_FETCH_1:
6414 case BUILT_IN_NAND_AND_FETCH_2:
6415 case BUILT_IN_NAND_AND_FETCH_4:
6416 case BUILT_IN_NAND_AND_FETCH_8:
6417 case BUILT_IN_NAND_AND_FETCH_16:
6418 mode = get_builtin_sync_mode (fcode - BUILT_IN_NAND_AND_FETCH_1);
6419 target = expand_builtin_sync_operation (mode, arglist, NOT,
6420 true, target, ignore);
6425 case BUILT_IN_BOOL_COMPARE_AND_SWAP_1:
6426 case BUILT_IN_BOOL_COMPARE_AND_SWAP_2:
6427 case BUILT_IN_BOOL_COMPARE_AND_SWAP_4:
6428 case BUILT_IN_BOOL_COMPARE_AND_SWAP_8:
6429 case BUILT_IN_BOOL_COMPARE_AND_SWAP_16:
6430 if (mode == VOIDmode)
6431 mode = TYPE_MODE (boolean_type_node);
6432 if (!target || !register_operand (target, mode))
6433 target = gen_reg_rtx (mode);
6435 mode = get_builtin_sync_mode (fcode - BUILT_IN_BOOL_COMPARE_AND_SWAP_1);
6436 target = expand_builtin_compare_and_swap (mode, arglist, true, target);
6441 case BUILT_IN_VAL_COMPARE_AND_SWAP_1:
6442 case BUILT_IN_VAL_COMPARE_AND_SWAP_2:
6443 case BUILT_IN_VAL_COMPARE_AND_SWAP_4:
6444 case BUILT_IN_VAL_COMPARE_AND_SWAP_8:
6445 case BUILT_IN_VAL_COMPARE_AND_SWAP_16:
6446 mode = get_builtin_sync_mode (fcode - BUILT_IN_VAL_COMPARE_AND_SWAP_1);
6447 target = expand_builtin_compare_and_swap (mode, arglist, false, target);
6452 case BUILT_IN_LOCK_TEST_AND_SET_1:
6453 case BUILT_IN_LOCK_TEST_AND_SET_2:
6454 case BUILT_IN_LOCK_TEST_AND_SET_4:
6455 case BUILT_IN_LOCK_TEST_AND_SET_8:
6456 case BUILT_IN_LOCK_TEST_AND_SET_16:
6457 mode = get_builtin_sync_mode (fcode - BUILT_IN_LOCK_TEST_AND_SET_1);
6458 target = expand_builtin_lock_test_and_set (mode, arglist, target);
6463 case BUILT_IN_LOCK_RELEASE_1:
6464 case BUILT_IN_LOCK_RELEASE_2:
6465 case BUILT_IN_LOCK_RELEASE_4:
6466 case BUILT_IN_LOCK_RELEASE_8:
6467 case BUILT_IN_LOCK_RELEASE_16:
6468 mode = get_builtin_sync_mode (fcode - BUILT_IN_LOCK_RELEASE_1);
6469 expand_builtin_lock_release (mode, arglist);
6472 case BUILT_IN_SYNCHRONIZE:
6473 expand_builtin_synchronize ();
6476 case BUILT_IN_OBJECT_SIZE:
6477 return expand_builtin_object_size (exp);
6479 case BUILT_IN_MEMCPY_CHK:
6480 case BUILT_IN_MEMPCPY_CHK:
6481 case BUILT_IN_MEMMOVE_CHK:
6482 case BUILT_IN_MEMSET_CHK:
6483 target = expand_builtin_memory_chk (exp, target, mode, fcode);
6488 case BUILT_IN_STRCPY_CHK:
6489 case BUILT_IN_STPCPY_CHK:
6490 case BUILT_IN_STRNCPY_CHK:
6491 case BUILT_IN_STRCAT_CHK:
6492 case BUILT_IN_STRNCAT_CHK:
6493 case BUILT_IN_SNPRINTF_CHK:
6494 case BUILT_IN_VSNPRINTF_CHK:
6495 maybe_emit_chk_warning (exp, fcode);
6498 case BUILT_IN_SPRINTF_CHK:
6499 case BUILT_IN_VSPRINTF_CHK:
6500 maybe_emit_sprintf_chk_warning (exp, fcode);
6503 default: /* just do library call, if unknown builtin */
6507 /* The switch statement above can drop through to cause the function
6508 to be called normally. */
6509 return expand_call (exp, target, ignore);
6512 /* Determine whether a tree node represents a call to a built-in
6513 function. If the tree T is a call to a built-in function with
6514 the right number of arguments of the appropriate types, return
6515 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
6516 Otherwise the return value is END_BUILTINS. */
6518 enum built_in_function
6519 builtin_mathfn_code (tree t)
6521 tree fndecl, arglist, parmlist;
6522 tree argtype, parmtype;
6524 if (TREE_CODE (t) != CALL_EXPR
6525 || TREE_CODE (TREE_OPERAND (t, 0)) != ADDR_EXPR)
6526 return END_BUILTINS;
6528 fndecl = get_callee_fndecl (t);
6529 if (fndecl == NULL_TREE
6530 || TREE_CODE (fndecl) != FUNCTION_DECL
6531 || ! DECL_BUILT_IN (fndecl)
6532 || DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
6533 return END_BUILTINS;
6535 arglist = TREE_OPERAND (t, 1);
6536 parmlist = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
6537 for (; parmlist; parmlist = TREE_CHAIN (parmlist))
6539 /* If a function doesn't take a variable number of arguments,
6540 the last element in the list will have type `void'. */
6541 parmtype = TREE_VALUE (parmlist);
6542 if (VOID_TYPE_P (parmtype))
6545 return END_BUILTINS;
6546 return DECL_FUNCTION_CODE (fndecl);
6550 return END_BUILTINS;
6552 argtype = TREE_TYPE (TREE_VALUE (arglist));
6554 if (SCALAR_FLOAT_TYPE_P (parmtype))
6556 if (! SCALAR_FLOAT_TYPE_P (argtype))
6557 return END_BUILTINS;
6559 else if (COMPLEX_FLOAT_TYPE_P (parmtype))
6561 if (! COMPLEX_FLOAT_TYPE_P (argtype))
6562 return END_BUILTINS;
6564 else if (POINTER_TYPE_P (parmtype))
6566 if (! POINTER_TYPE_P (argtype))
6567 return END_BUILTINS;
6569 else if (INTEGRAL_TYPE_P (parmtype))
6571 if (! INTEGRAL_TYPE_P (argtype))
6572 return END_BUILTINS;
6575 return END_BUILTINS;
6577 arglist = TREE_CHAIN (arglist);
6580 /* Variable-length argument list. */
6581 return DECL_FUNCTION_CODE (fndecl);
6584 /* Fold a call to __builtin_constant_p, if we know it will evaluate to a
6585 constant. ARGLIST is the argument list of the call. */
6588 fold_builtin_constant_p (tree arglist)
6593 arglist = TREE_VALUE (arglist);
6595 /* We return 1 for a numeric type that's known to be a constant
6596 value at compile-time or for an aggregate type that's a
6597 literal constant. */
6598 STRIP_NOPS (arglist);
6600 /* If we know this is a constant, emit the constant of one. */
6601 if (CONSTANT_CLASS_P (arglist)
6602 || (TREE_CODE (arglist) == CONSTRUCTOR
6603 && TREE_CONSTANT (arglist)))
6604 return integer_one_node;
6605 if (TREE_CODE (arglist) == ADDR_EXPR)
6607 tree op = TREE_OPERAND (arglist, 0);
6608 if (TREE_CODE (op) == STRING_CST
6609 || (TREE_CODE (op) == ARRAY_REF
6610 && integer_zerop (TREE_OPERAND (op, 1))
6611 && TREE_CODE (TREE_OPERAND (op, 0)) == STRING_CST))
6612 return integer_one_node;
6615 /* If this expression has side effects, show we don't know it to be a
6616 constant. Likewise if it's a pointer or aggregate type since in
6617 those case we only want literals, since those are only optimized
6618 when generating RTL, not later.
6619 And finally, if we are compiling an initializer, not code, we
6620 need to return a definite result now; there's not going to be any
6621 more optimization done. */
6622 if (TREE_SIDE_EFFECTS (arglist)
6623 || AGGREGATE_TYPE_P (TREE_TYPE (arglist))
6624 || POINTER_TYPE_P (TREE_TYPE (arglist))
6626 || folding_initializer)
6627 return integer_zero_node;
6632 /* Fold a call to __builtin_expect, if we expect that a comparison against
6633 the argument will fold to a constant. In practice, this means a true
6634 constant or the address of a non-weak symbol. ARGLIST is the argument
6635 list of the call. */
6638 fold_builtin_expect (tree arglist)
6645 arg = TREE_VALUE (arglist);
6647 /* If the argument isn't invariant, then there's nothing we can do. */
6648 if (!TREE_INVARIANT (arg))
6651 /* If we're looking at an address of a weak decl, then do not fold. */
6654 if (TREE_CODE (inner) == ADDR_EXPR)
6658 inner = TREE_OPERAND (inner, 0);
6660 while (TREE_CODE (inner) == COMPONENT_REF
6661 || TREE_CODE (inner) == ARRAY_REF);
6662 if (DECL_P (inner) && DECL_WEAK (inner))
6666 /* Otherwise, ARG already has the proper type for the return value. */
6670 /* Fold a call to __builtin_classify_type. */
6673 fold_builtin_classify_type (tree arglist)
6676 return build_int_cst (NULL_TREE, no_type_class);
6678 return build_int_cst (NULL_TREE,
6679 type_to_class (TREE_TYPE (TREE_VALUE (arglist))));
6682 /* Fold a call to __builtin_strlen. */
6685 fold_builtin_strlen (tree arglist)
6687 if (!validate_arglist (arglist, POINTER_TYPE, VOID_TYPE))
6691 tree len = c_strlen (TREE_VALUE (arglist), 0);
6695 /* Convert from the internal "sizetype" type to "size_t". */
6697 len = fold_convert (size_type_node, len);
6705 /* Fold a call to __builtin_inf or __builtin_huge_val. */
6708 fold_builtin_inf (tree type, int warn)
6710 REAL_VALUE_TYPE real;
6712 /* __builtin_inff is intended to be usable to define INFINITY on all
6713 targets. If an infinity is not available, INFINITY expands "to a
6714 positive constant of type float that overflows at translation
6715 time", footnote "In this case, using INFINITY will violate the
6716 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
6717 Thus we pedwarn to ensure this constraint violation is
6719 if (!MODE_HAS_INFINITIES (TYPE_MODE (type)) && warn)
6720 pedwarn ("target format does not support infinity");
6723 return build_real (type, real);
6726 /* Fold a call to __builtin_nan or __builtin_nans. */
6729 fold_builtin_nan (tree arglist, tree type, int quiet)
6731 REAL_VALUE_TYPE real;
6734 if (!validate_arglist (arglist, POINTER_TYPE, VOID_TYPE))
6736 str = c_getstr (TREE_VALUE (arglist));
6740 if (!real_nan (&real, str, quiet, TYPE_MODE (type)))
6743 return build_real (type, real);
6746 /* Return true if the floating point expression T has an integer value.
6747 We also allow +Inf, -Inf and NaN to be considered integer values. */
6750 integer_valued_real_p (tree t)
6752 switch (TREE_CODE (t))
6759 case NON_LVALUE_EXPR:
6760 return integer_valued_real_p (TREE_OPERAND (t, 0));
6765 return integer_valued_real_p (TREE_OPERAND (t, 1));
6772 return integer_valued_real_p (TREE_OPERAND (t, 0))
6773 && integer_valued_real_p (TREE_OPERAND (t, 1));
6776 return integer_valued_real_p (TREE_OPERAND (t, 1))
6777 && integer_valued_real_p (TREE_OPERAND (t, 2));
6780 if (! TREE_CONSTANT_OVERFLOW (t))
6782 REAL_VALUE_TYPE c, cint;
6784 c = TREE_REAL_CST (t);
6785 real_trunc (&cint, TYPE_MODE (TREE_TYPE (t)), &c);
6786 return real_identical (&c, &cint);
6792 tree type = TREE_TYPE (TREE_OPERAND (t, 0));
6793 if (TREE_CODE (type) == INTEGER_TYPE)
6795 if (TREE_CODE (type) == REAL_TYPE)
6796 return integer_valued_real_p (TREE_OPERAND (t, 0));
6801 switch (builtin_mathfn_code (t))
6803 CASE_FLT_FN (BUILT_IN_CEIL):
6804 CASE_FLT_FN (BUILT_IN_FLOOR):
6805 CASE_FLT_FN (BUILT_IN_NEARBYINT):
6806 CASE_FLT_FN (BUILT_IN_RINT):
6807 CASE_FLT_FN (BUILT_IN_ROUND):
6808 CASE_FLT_FN (BUILT_IN_TRUNC):
6822 /* EXP is assumed to be builtin call where truncation can be propagated
6823 across (for instance floor((double)f) == (double)floorf (f).
6824 Do the transformation. */
6827 fold_trunc_transparent_mathfn (tree fndecl, tree arglist)
6829 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
6832 if (! validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
6835 arg = TREE_VALUE (arglist);
6836 /* Integer rounding functions are idempotent. */
6837 if (fcode == builtin_mathfn_code (arg))
6840 /* If argument is already integer valued, and we don't need to worry
6841 about setting errno, there's no need to perform rounding. */
6842 if (! flag_errno_math && integer_valued_real_p (arg))
6847 tree arg0 = strip_float_extensions (arg);
6848 tree ftype = TREE_TYPE (TREE_TYPE (fndecl));
6849 tree newtype = TREE_TYPE (arg0);
6852 if (TYPE_PRECISION (newtype) < TYPE_PRECISION (ftype)
6853 && (decl = mathfn_built_in (newtype, fcode)))
6856 build_tree_list (NULL_TREE, fold_convert (newtype, arg0));
6857 return fold_convert (ftype,
6858 build_function_call_expr (decl, arglist));
6864 /* EXP is assumed to be builtin call which can narrow the FP type of
6865 the argument, for instance lround((double)f) -> lroundf (f). */
6868 fold_fixed_mathfn (tree fndecl, tree arglist)
6870 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
6873 if (! validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
6876 arg = TREE_VALUE (arglist);
6878 /* If argument is already integer valued, and we don't need to worry
6879 about setting errno, there's no need to perform rounding. */
6880 if (! flag_errno_math && integer_valued_real_p (arg))
6881 return fold_build1 (FIX_TRUNC_EXPR, TREE_TYPE (TREE_TYPE (fndecl)), arg);
6885 tree ftype = TREE_TYPE (arg);
6886 tree arg0 = strip_float_extensions (arg);
6887 tree newtype = TREE_TYPE (arg0);
6890 if (TYPE_PRECISION (newtype) < TYPE_PRECISION (ftype)
6891 && (decl = mathfn_built_in (newtype, fcode)))
6894 build_tree_list (NULL_TREE, fold_convert (newtype, arg0));
6895 return build_function_call_expr (decl, arglist);
6899 /* Canonicalize llround (x) to lround (x) on LP64 targets where
6900 sizeof (long long) == sizeof (long). */
6901 if (TYPE_PRECISION (long_long_integer_type_node)
6902 == TYPE_PRECISION (long_integer_type_node))
6904 tree newfn = NULL_TREE;
6907 CASE_FLT_FN (BUILT_IN_LLCEIL):
6908 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LCEIL);
6911 CASE_FLT_FN (BUILT_IN_LLFLOOR):
6912 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LFLOOR);
6915 CASE_FLT_FN (BUILT_IN_LLROUND):
6916 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LROUND);
6919 CASE_FLT_FN (BUILT_IN_LLRINT):
6920 newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LRINT);
6929 tree newcall = build_function_call_expr (newfn, arglist);
6930 return fold_convert (TREE_TYPE (TREE_TYPE (fndecl)), newcall);
6937 /* Fold function call to builtin cabs, cabsf or cabsl. ARGLIST
6938 is the argument list, TYPE is the return type and FNDECL is the
6939 original function DECL. Return NULL_TREE if no if no simplification
6943 fold_builtin_cabs (tree arglist, tree type, tree fndecl)
6947 if (!arglist || TREE_CHAIN (arglist))
6950 arg = TREE_VALUE (arglist);
6951 if (TREE_CODE (TREE_TYPE (arg)) != COMPLEX_TYPE
6952 || TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) != REAL_TYPE)
6955 /* Evaluate cabs of a constant at compile-time. */
6956 if (flag_unsafe_math_optimizations
6957 && TREE_CODE (arg) == COMPLEX_CST
6958 && TREE_CODE (TREE_REALPART (arg)) == REAL_CST
6959 && TREE_CODE (TREE_IMAGPART (arg)) == REAL_CST
6960 && ! TREE_CONSTANT_OVERFLOW (TREE_REALPART (arg))
6961 && ! TREE_CONSTANT_OVERFLOW (TREE_IMAGPART (arg)))
6963 REAL_VALUE_TYPE r, i;
6965 r = TREE_REAL_CST (TREE_REALPART (arg));
6966 i = TREE_REAL_CST (TREE_IMAGPART (arg));
6968 real_arithmetic (&r, MULT_EXPR, &r, &r);
6969 real_arithmetic (&i, MULT_EXPR, &i, &i);
6970 real_arithmetic (&r, PLUS_EXPR, &r, &i);
6971 if (real_sqrt (&r, TYPE_MODE (type), &r)
6972 || ! flag_trapping_math)
6973 return build_real (type, r);
6976 /* If either part is zero, cabs is fabs of the other. */
6977 if (TREE_CODE (arg) == COMPLEX_EXPR
6978 && real_zerop (TREE_OPERAND (arg, 0)))
6979 return fold_build1 (ABS_EXPR, type, TREE_OPERAND (arg, 1));
6980 if (TREE_CODE (arg) == COMPLEX_EXPR
6981 && real_zerop (TREE_OPERAND (arg, 1)))
6982 return fold_build1 (ABS_EXPR, type, TREE_OPERAND (arg, 0));
6984 /* Optimize cabs(-z) and cabs(conj(z)) as cabs(z). */
6985 if (TREE_CODE (arg) == NEGATE_EXPR
6986 || TREE_CODE (arg) == CONJ_EXPR)
6988 tree arglist = build_tree_list (NULL_TREE, TREE_OPERAND (arg, 0));
6989 return build_function_call_expr (fndecl, arglist);
6992 /* Don't do this when optimizing for size. */
6993 if (flag_unsafe_math_optimizations
6994 && optimize && !optimize_size)
6996 tree sqrtfn = mathfn_built_in (type, BUILT_IN_SQRT);
6998 if (sqrtfn != NULL_TREE)
7000 tree rpart, ipart, result, arglist;
7002 arg = builtin_save_expr (arg);
7004 rpart = fold_build1 (REALPART_EXPR, type, arg);
7005 ipart = fold_build1 (IMAGPART_EXPR, type, arg);
7007 rpart = builtin_save_expr (rpart);
7008 ipart = builtin_save_expr (ipart);
7010 result = fold_build2 (PLUS_EXPR, type,
7011 fold_build2 (MULT_EXPR, type,
7013 fold_build2 (MULT_EXPR, type,
7016 arglist = build_tree_list (NULL_TREE, result);
7017 return build_function_call_expr (sqrtfn, arglist);
7024 /* Fold a builtin function call to sqrt, sqrtf, or sqrtl. Return
7025 NULL_TREE if no simplification can be made. */
7028 fold_builtin_sqrt (tree arglist, tree type)
7031 enum built_in_function fcode;
7032 tree arg = TREE_VALUE (arglist);
7034 if (!validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
7037 /* Optimize sqrt of constant value. */
7038 if (TREE_CODE (arg) == REAL_CST
7039 && ! TREE_CONSTANT_OVERFLOW (arg))
7041 REAL_VALUE_TYPE r, x;
7043 x = TREE_REAL_CST (arg);
7044 if (real_sqrt (&r, TYPE_MODE (type), &x)
7045 || (!flag_trapping_math && !flag_errno_math))
7046 return build_real (type, r);
7049 /* Optimize sqrt(expN(x)) = expN(x*0.5). */
7050 fcode = builtin_mathfn_code (arg);
7051 if (flag_unsafe_math_optimizations && BUILTIN_EXPONENT_P (fcode))
7053 tree expfn = TREE_OPERAND (TREE_OPERAND (arg, 0), 0);
7054 arg = fold_build2 (MULT_EXPR, type,
7055 TREE_VALUE (TREE_OPERAND (arg, 1)),
7056 build_real (type, dconsthalf));
7057 arglist = build_tree_list (NULL_TREE, arg);
7058 return build_function_call_expr (expfn, arglist);
7061 /* Optimize sqrt(Nroot(x)) -> pow(x,1/(2*N)). */
7062 if (flag_unsafe_math_optimizations && BUILTIN_ROOT_P (fcode))
7064 tree powfn = mathfn_built_in (type, BUILT_IN_POW);
7068 tree arg0 = TREE_VALUE (TREE_OPERAND (arg, 1));
7070 /* The inner root was either sqrt or cbrt. */
7071 REAL_VALUE_TYPE dconstroot =
7072 BUILTIN_SQRT_P (fcode) ? dconsthalf : dconstthird;
7074 /* Adjust for the outer root. */
7075 SET_REAL_EXP (&dconstroot, REAL_EXP (&dconstroot) - 1);
7076 dconstroot = real_value_truncate (TYPE_MODE (type), dconstroot);
7077 tree_root = build_real (type, dconstroot);
7078 arglist = tree_cons (NULL_TREE, arg0,
7079 build_tree_list (NULL_TREE, tree_root));
7080 return build_function_call_expr (powfn, arglist);
7084 /* Optimize sqrt(pow(x,y)) = pow(|x|,y*0.5). */
7085 if (flag_unsafe_math_optimizations
7086 && (fcode == BUILT_IN_POW
7087 || fcode == BUILT_IN_POWF
7088 || fcode == BUILT_IN_POWL))
7090 tree powfn = TREE_OPERAND (TREE_OPERAND (arg, 0), 0);
7091 tree arg0 = TREE_VALUE (TREE_OPERAND (arg, 1));
7092 tree arg1 = TREE_VALUE (TREE_CHAIN (TREE_OPERAND (arg, 1)));
7094 if (!tree_expr_nonnegative_p (arg0))
7095 arg0 = build1 (ABS_EXPR, type, arg0);
7096 narg1 = fold_build2 (MULT_EXPR, type, arg1,
7097 build_real (type, dconsthalf));
7098 arglist = tree_cons (NULL_TREE, arg0,
7099 build_tree_list (NULL_TREE, narg1));
7100 return build_function_call_expr (powfn, arglist);
7106 /* Fold a builtin function call to cbrt, cbrtf, or cbrtl. Return
7107 NULL_TREE if no simplification can be made. */
7109 fold_builtin_cbrt (tree arglist, tree type)
7111 tree arg = TREE_VALUE (arglist);
7112 const enum built_in_function fcode = builtin_mathfn_code (arg);
7115 if (!validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
7118 /* Calculate the result when the argument is a constant. */
7119 if ((res = do_mpfr_arg1 (arg, type, mpfr_cbrt, NULL, NULL, 0)))
7122 if (flag_unsafe_math_optimizations)
7124 /* Optimize cbrt(expN(x)) -> expN(x/3). */
7125 if (BUILTIN_EXPONENT_P (fcode))
7127 tree expfn = TREE_OPERAND (TREE_OPERAND (arg, 0), 0);
7128 const REAL_VALUE_TYPE third_trunc =
7129 real_value_truncate (TYPE_MODE (type), dconstthird);
7130 arg = fold_build2 (MULT_EXPR, type,
7131 TREE_VALUE (TREE_OPERAND (arg, 1)),
7132 build_real (type, third_trunc));
7133 arglist = build_tree_list (NULL_TREE, arg);
7134 return build_function_call_expr (expfn, arglist);
7137 /* Optimize cbrt(sqrt(x)) -> pow(x,1/6). */
7138 if (BUILTIN_SQRT_P (fcode))
7140 tree powfn = mathfn_built_in (type, BUILT_IN_POW);
7144 tree arg0 = TREE_VALUE (TREE_OPERAND (arg, 1));
7146 REAL_VALUE_TYPE dconstroot = dconstthird;
7148 SET_REAL_EXP (&dconstroot, REAL_EXP (&dconstroot) - 1);
7149 dconstroot = real_value_truncate (TYPE_MODE (type), dconstroot);
7150 tree_root = build_real (type, dconstroot);
7151 arglist = tree_cons (NULL_TREE, arg0,
7152 build_tree_list (NULL_TREE, tree_root));
7153 return build_function_call_expr (powfn, arglist);
7157 /* Optimize cbrt(cbrt(x)) -> pow(x,1/9) iff x is nonnegative. */
7158 if (BUILTIN_CBRT_P (fcode))
7160 tree arg0 = TREE_VALUE (TREE_OPERAND (arg, 1));
7161 if (tree_expr_nonnegative_p (arg0))
7163 tree powfn = mathfn_built_in (type, BUILT_IN_POW);
7168 REAL_VALUE_TYPE dconstroot;
7170 real_arithmetic (&dconstroot, MULT_EXPR, &dconstthird, &dconstthird);
7171 dconstroot = real_value_truncate (TYPE_MODE (type), dconstroot);
7172 tree_root = build_real (type, dconstroot);
7173 arglist = tree_cons (NULL_TREE, arg0,
7174 build_tree_list (NULL_TREE, tree_root));
7175 return build_function_call_expr (powfn, arglist);
7180 /* Optimize cbrt(pow(x,y)) -> pow(x,y/3) iff x is nonnegative. */
7181 if (fcode == BUILT_IN_POW || fcode == BUILT_IN_POWF
7182 || fcode == BUILT_IN_POWL)
7184 tree arg00 = TREE_VALUE (TREE_OPERAND (arg, 1));
7185 tree arg01 = TREE_VALUE (TREE_CHAIN (TREE_OPERAND (arg, 1)));
7186 if (tree_expr_nonnegative_p (arg00))
7188 tree powfn = TREE_OPERAND (TREE_OPERAND (arg, 0), 0);
7189 const REAL_VALUE_TYPE dconstroot
7190 = real_value_truncate (TYPE_MODE (type), dconstthird);
7191 tree narg01 = fold_build2 (MULT_EXPR, type, arg01,
7192 build_real (type, dconstroot));
7193 arglist = tree_cons (NULL_TREE, arg00,
7194 build_tree_list (NULL_TREE, narg01));
7195 return build_function_call_expr (powfn, arglist);
7202 /* Fold function call to builtin cos, cosf, or cosl. Return
7203 NULL_TREE if no simplification can be made. */
7205 fold_builtin_cos (tree arglist, tree type, tree fndecl)
7207 tree arg = TREE_VALUE (arglist);
7210 if (!validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
7213 /* Calculate the result when the argument is a constant. */
7214 if ((res = do_mpfr_arg1 (arg, type, mpfr_cos, NULL, NULL, 0)))
7217 /* Optimize cos(-x) into cos (x). */
7218 if (TREE_CODE (arg) == NEGATE_EXPR)
7220 tree args = build_tree_list (NULL_TREE,
7221 TREE_OPERAND (arg, 0));
7222 return build_function_call_expr (fndecl, args);
7228 /* Fold function call to builtin tan, tanf, or tanl. Return
7229 NULL_TREE if no simplification can be made. */
7231 fold_builtin_tan (tree arglist, tree type)
7233 enum built_in_function fcode;
7234 tree arg = TREE_VALUE (arglist);
7237 if (!validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
7240 /* Calculate the result when the argument is a constant. */
7241 if ((res = do_mpfr_arg1 (arg, type, mpfr_tan, NULL, NULL, 0)))
7244 /* Optimize tan(atan(x)) = x. */
7245 fcode = builtin_mathfn_code (arg);
7246 if (flag_unsafe_math_optimizations
7247 && (fcode == BUILT_IN_ATAN
7248 || fcode == BUILT_IN_ATANF
7249 || fcode == BUILT_IN_ATANL))
7250 return TREE_VALUE (TREE_OPERAND (arg, 1));
7255 /* Fold function call to builtin trunc, truncf or truncl. Return
7256 NULL_TREE if no simplification can be made. */
7259 fold_builtin_trunc (tree fndecl, tree arglist)
7263 if (! validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
7266 /* Optimize trunc of constant value. */
7267 arg = TREE_VALUE (arglist);
7268 if (TREE_CODE (arg) == REAL_CST && ! TREE_CONSTANT_OVERFLOW (arg))
7270 REAL_VALUE_TYPE r, x;
7271 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7273 x = TREE_REAL_CST (arg);
7274 real_trunc (&r, TYPE_MODE (type), &x);
7275 return build_real (type, r);
7278 return fold_trunc_transparent_mathfn (fndecl, arglist);
7281 /* Fold function call to builtin floor, floorf or floorl. Return
7282 NULL_TREE if no simplification can be made. */
7285 fold_builtin_floor (tree fndecl, tree arglist)
7289 if (! validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
7292 /* Optimize floor of constant value. */
7293 arg = TREE_VALUE (arglist);
7294 if (TREE_CODE (arg) == REAL_CST && ! TREE_CONSTANT_OVERFLOW (arg))
7298 x = TREE_REAL_CST (arg);
7299 if (! REAL_VALUE_ISNAN (x) || ! flag_errno_math)
7301 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7304 real_floor (&r, TYPE_MODE (type), &x);
7305 return build_real (type, r);
7309 /* Fold floor (x) where x is nonnegative to trunc (x). */
7310 if (tree_expr_nonnegative_p (arg))
7311 return build_function_call_expr (mathfn_built_in (TREE_TYPE (arg),
7315 return fold_trunc_transparent_mathfn (fndecl, arglist);
7318 /* Fold function call to builtin ceil, ceilf or ceill. Return
7319 NULL_TREE if no simplification can be made. */
7322 fold_builtin_ceil (tree fndecl, tree arglist)
7326 if (! validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
7329 /* Optimize ceil of constant value. */
7330 arg = TREE_VALUE (arglist);
7331 if (TREE_CODE (arg) == REAL_CST && ! TREE_CONSTANT_OVERFLOW (arg))
7335 x = TREE_REAL_CST (arg);
7336 if (! REAL_VALUE_ISNAN (x) || ! flag_errno_math)
7338 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7341 real_ceil (&r, TYPE_MODE (type), &x);
7342 return build_real (type, r);
7346 return fold_trunc_transparent_mathfn (fndecl, arglist);
7349 /* Fold function call to builtin round, roundf or roundl. Return
7350 NULL_TREE if no simplification can be made. */
7353 fold_builtin_round (tree fndecl, tree arglist)
7357 if (! validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
7360 /* Optimize round of constant value. */
7361 arg = TREE_VALUE (arglist);
7362 if (TREE_CODE (arg) == REAL_CST && ! TREE_CONSTANT_OVERFLOW (arg))
7366 x = TREE_REAL_CST (arg);
7367 if (! REAL_VALUE_ISNAN (x) || ! flag_errno_math)
7369 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7372 real_round (&r, TYPE_MODE (type), &x);
7373 return build_real (type, r);
7377 return fold_trunc_transparent_mathfn (fndecl, arglist);
7380 /* Fold function call to builtin lround, lroundf or lroundl (or the
7381 corresponding long long versions) and other rounding functions.
7382 Return NULL_TREE if no simplification can be made. */
7385 fold_builtin_int_roundingfn (tree fndecl, tree arglist)
7389 if (! validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
7392 /* Optimize lround of constant value. */
7393 arg = TREE_VALUE (arglist);
7394 if (TREE_CODE (arg) == REAL_CST && ! TREE_CONSTANT_OVERFLOW (arg))
7396 const REAL_VALUE_TYPE x = TREE_REAL_CST (arg);
7398 if (! REAL_VALUE_ISNAN (x) && ! REAL_VALUE_ISINF (x))
7400 tree itype = TREE_TYPE (TREE_TYPE (fndecl));
7401 tree ftype = TREE_TYPE (arg), result;
7402 HOST_WIDE_INT hi, lo;
7405 switch (DECL_FUNCTION_CODE (fndecl))
7407 CASE_FLT_FN (BUILT_IN_LFLOOR):
7408 CASE_FLT_FN (BUILT_IN_LLFLOOR):
7409 real_floor (&r, TYPE_MODE (ftype), &x);
7412 CASE_FLT_FN (BUILT_IN_LCEIL):
7413 CASE_FLT_FN (BUILT_IN_LLCEIL):
7414 real_ceil (&r, TYPE_MODE (ftype), &x);
7417 CASE_FLT_FN (BUILT_IN_LROUND):
7418 CASE_FLT_FN (BUILT_IN_LLROUND):
7419 real_round (&r, TYPE_MODE (ftype), &x);
7426 REAL_VALUE_TO_INT (&lo, &hi, r);
7427 result = build_int_cst_wide (NULL_TREE, lo, hi);
7428 if (int_fits_type_p (result, itype))
7429 return fold_convert (itype, result);
7433 switch (DECL_FUNCTION_CODE (fndecl))
7435 CASE_FLT_FN (BUILT_IN_LFLOOR):
7436 CASE_FLT_FN (BUILT_IN_LLFLOOR):
7437 /* Fold lfloor (x) where x is nonnegative to FIX_TRUNC (x). */
7438 if (tree_expr_nonnegative_p (arg))
7439 return fold_build1 (FIX_TRUNC_EXPR, TREE_TYPE (TREE_TYPE (fndecl)),
7445 return fold_fixed_mathfn (fndecl, arglist);
7448 /* Fold function call to builtin ffs, clz, ctz, popcount and parity
7449 and their long and long long variants (i.e. ffsl and ffsll).
7450 Return NULL_TREE if no simplification can be made. */
7453 fold_builtin_bitop (tree fndecl, tree arglist)
7457 if (! validate_arglist (arglist, INTEGER_TYPE, VOID_TYPE))
7460 /* Optimize for constant argument. */
7461 arg = TREE_VALUE (arglist);
7462 if (TREE_CODE (arg) == INTEGER_CST && ! TREE_CONSTANT_OVERFLOW (arg))
7464 HOST_WIDE_INT hi, width, result;
7465 unsigned HOST_WIDE_INT lo;
7468 type = TREE_TYPE (arg);
7469 width = TYPE_PRECISION (type);
7470 lo = TREE_INT_CST_LOW (arg);
7472 /* Clear all the bits that are beyond the type's precision. */
7473 if (width > HOST_BITS_PER_WIDE_INT)
7475 hi = TREE_INT_CST_HIGH (arg);
7476 if (width < 2 * HOST_BITS_PER_WIDE_INT)
7477 hi &= ~((HOST_WIDE_INT) (-1) >> (width - HOST_BITS_PER_WIDE_INT));
7482 if (width < HOST_BITS_PER_WIDE_INT)
7483 lo &= ~((unsigned HOST_WIDE_INT) (-1) << width);
7486 switch (DECL_FUNCTION_CODE (fndecl))
7488 CASE_INT_FN (BUILT_IN_FFS):
7490 result = exact_log2 (lo & -lo) + 1;
7492 result = HOST_BITS_PER_WIDE_INT + exact_log2 (hi & -hi) + 1;
7497 CASE_INT_FN (BUILT_IN_CLZ):
7499 result = width - floor_log2 (hi) - 1 - HOST_BITS_PER_WIDE_INT;
7501 result = width - floor_log2 (lo) - 1;
7502 else if (! CLZ_DEFINED_VALUE_AT_ZERO (TYPE_MODE (type), result))
7506 CASE_INT_FN (BUILT_IN_CTZ):
7508 result = exact_log2 (lo & -lo);
7510 result = HOST_BITS_PER_WIDE_INT + exact_log2 (hi & -hi);
7511 else if (! CTZ_DEFINED_VALUE_AT_ZERO (TYPE_MODE (type), result))
7515 CASE_INT_FN (BUILT_IN_POPCOUNT):
7518 result++, lo &= lo - 1;
7520 result++, hi &= hi - 1;
7523 CASE_INT_FN (BUILT_IN_PARITY):
7526 result++, lo &= lo - 1;
7528 result++, hi &= hi - 1;
7536 return build_int_cst (TREE_TYPE (TREE_TYPE (fndecl)), result);
7542 /* Return true if EXPR is the real constant contained in VALUE. */
7545 real_dconstp (tree expr, const REAL_VALUE_TYPE *value)
7549 return ((TREE_CODE (expr) == REAL_CST
7550 && ! TREE_CONSTANT_OVERFLOW (expr)
7551 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), *value))
7552 || (TREE_CODE (expr) == COMPLEX_CST
7553 && real_dconstp (TREE_REALPART (expr), value)
7554 && real_zerop (TREE_IMAGPART (expr))));
7557 /* A subroutine of fold_builtin to fold the various logarithmic
7558 functions. Return NULL_TREE if no simplification can me made.
7559 FUNC is the corresponding MPFR logarithm function. */
7562 fold_builtin_logarithm (tree fndecl, tree arglist,
7563 int (*func)(mpfr_ptr, mpfr_srcptr, mp_rnd_t))
7565 if (validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
7567 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7568 tree arg = TREE_VALUE (arglist);
7570 const enum built_in_function fcode = builtin_mathfn_code (arg);
7572 /* Optimize log(e) = 1.0. We're never passed an exact 'e',
7573 instead we'll look for 'e' truncated to MODE. So only do
7574 this if flag_unsafe_math_optimizations is set. */
7575 if (flag_unsafe_math_optimizations && func == mpfr_log)
7577 const REAL_VALUE_TYPE e_truncated =
7578 real_value_truncate (TYPE_MODE (type), dconste);
7579 if (real_dconstp (arg, &e_truncated))
7580 return build_real (type, dconst1);
7583 /* Calculate the result when the argument is a constant. */
7584 if ((res = do_mpfr_arg1 (arg, type, func, &dconst0, NULL, false)))
7587 /* Special case, optimize logN(expN(x)) = x. */
7588 if (flag_unsafe_math_optimizations
7589 && ((func == mpfr_log
7590 && (fcode == BUILT_IN_EXP
7591 || fcode == BUILT_IN_EXPF
7592 || fcode == BUILT_IN_EXPL))
7593 || (func == mpfr_log2
7594 && (fcode == BUILT_IN_EXP2
7595 || fcode == BUILT_IN_EXP2F
7596 || fcode == BUILT_IN_EXP2L))
7597 || (func == mpfr_log10 && (BUILTIN_EXP10_P (fcode)))))
7598 return fold_convert (type, TREE_VALUE (TREE_OPERAND (arg, 1)));
7600 /* Optimize logN(func()) for various exponential functions. We
7601 want to determine the value "x" and the power "exponent" in
7602 order to transform logN(x**exponent) into exponent*logN(x). */
7603 if (flag_unsafe_math_optimizations)
7605 tree exponent = 0, x = 0;
7609 CASE_FLT_FN (BUILT_IN_EXP):
7610 /* Prepare to do logN(exp(exponent) -> exponent*logN(e). */
7611 x = build_real (type,
7612 real_value_truncate (TYPE_MODE (type), dconste));
7613 exponent = TREE_VALUE (TREE_OPERAND (arg, 1));
7615 CASE_FLT_FN (BUILT_IN_EXP2):
7616 /* Prepare to do logN(exp2(exponent) -> exponent*logN(2). */
7617 x = build_real (type, dconst2);
7618 exponent = TREE_VALUE (TREE_OPERAND (arg, 1));
7620 CASE_FLT_FN (BUILT_IN_EXP10):
7621 CASE_FLT_FN (BUILT_IN_POW10):
7622 /* Prepare to do logN(exp10(exponent) -> exponent*logN(10). */
7623 x = build_real (type, dconst10);
7624 exponent = TREE_VALUE (TREE_OPERAND (arg, 1));
7626 CASE_FLT_FN (BUILT_IN_SQRT):
7627 /* Prepare to do logN(sqrt(x) -> 0.5*logN(x). */
7628 x = TREE_VALUE (TREE_OPERAND (arg, 1));
7629 exponent = build_real (type, dconsthalf);
7631 CASE_FLT_FN (BUILT_IN_CBRT):
7632 /* Prepare to do logN(cbrt(x) -> (1/3)*logN(x). */
7633 x = TREE_VALUE (TREE_OPERAND (arg, 1));
7634 exponent = build_real (type, real_value_truncate (TYPE_MODE (type),
7637 CASE_FLT_FN (BUILT_IN_POW):
7638 /* Prepare to do logN(pow(x,exponent) -> exponent*logN(x). */
7639 x = TREE_VALUE (TREE_OPERAND (arg, 1));
7640 exponent = TREE_VALUE (TREE_CHAIN (TREE_OPERAND (arg, 1)));
7646 /* Now perform the optimization. */
7650 arglist = build_tree_list (NULL_TREE, x);
7651 logfn = build_function_call_expr (fndecl, arglist);
7652 return fold_build2 (MULT_EXPR, type, exponent, logfn);
7660 /* Fold a builtin function call to hypot, hypotf, or hypotl. Return
7661 NULL_TREE if no simplification can be made. */
7664 fold_builtin_hypot (tree fndecl, tree arglist, tree type)
7666 tree arg0 = TREE_VALUE (arglist);
7667 tree arg1 = TREE_VALUE (TREE_CHAIN (arglist));
7670 if (!validate_arglist (arglist, REAL_TYPE, REAL_TYPE, VOID_TYPE))
7673 /* Calculate the result when the argument is a constant. */
7674 if ((res = do_mpfr_arg2 (arg0, arg1, type, mpfr_hypot)))
7677 /* If either argument is zero, hypot is fabs of the other. */
7678 if (real_zerop (arg0))
7679 return fold_build1 (ABS_EXPR, type, arg1);
7680 else if (real_zerop (arg1))
7681 return fold_build1 (ABS_EXPR, type, arg0);
7683 /* hypot(x,x) -> x*sqrt(2). */
7684 if (operand_equal_p (arg0, arg1, OEP_PURE_SAME))
7686 REAL_VALUE_TYPE sqrt2;
7688 real_sqrt (&sqrt2, TYPE_MODE (type), &dconst2);
7689 return fold_build2 (MULT_EXPR, type, arg0,
7690 build_real (type, sqrt2));
7693 /* Transform hypot(-x,y) or hypot(x,-y) or hypot(-x,-y) into
7695 if (TREE_CODE (arg0) == NEGATE_EXPR || TREE_CODE (arg1) == NEGATE_EXPR)
7697 tree narg0 = (TREE_CODE (arg0) == NEGATE_EXPR)
7698 ? TREE_OPERAND (arg0, 0) : arg0;
7699 tree narg1 = (TREE_CODE (arg1) == NEGATE_EXPR)
7700 ? TREE_OPERAND (arg1, 0) : arg1;
7701 tree narglist = tree_cons (NULL_TREE, narg0,
7702 build_tree_list (NULL_TREE, narg1));
7703 return build_function_call_expr (fndecl, narglist);
7710 /* Fold a builtin function call to pow, powf, or powl. Return
7711 NULL_TREE if no simplification can be made. */
7713 fold_builtin_pow (tree fndecl, tree arglist, tree type)
7715 tree arg0 = TREE_VALUE (arglist);
7716 tree arg1 = TREE_VALUE (TREE_CHAIN (arglist));
7719 if (!validate_arglist (arglist, REAL_TYPE, REAL_TYPE, VOID_TYPE))
7722 /* Calculate the result when the argument is a constant. */
7723 if ((res = do_mpfr_arg2 (arg0, arg1, type, mpfr_pow)))
7726 /* Optimize pow(1.0,y) = 1.0. */
7727 if (real_onep (arg0))
7728 return omit_one_operand (type, build_real (type, dconst1), arg1);
7730 if (TREE_CODE (arg1) == REAL_CST
7731 && ! TREE_CONSTANT_OVERFLOW (arg1))
7733 REAL_VALUE_TYPE cint;
7737 c = TREE_REAL_CST (arg1);
7739 /* Optimize pow(x,0.0) = 1.0. */
7740 if (REAL_VALUES_EQUAL (c, dconst0))
7741 return omit_one_operand (type, build_real (type, dconst1),
7744 /* Optimize pow(x,1.0) = x. */
7745 if (REAL_VALUES_EQUAL (c, dconst1))
7748 /* Optimize pow(x,-1.0) = 1.0/x. */
7749 if (REAL_VALUES_EQUAL (c, dconstm1))
7750 return fold_build2 (RDIV_EXPR, type,
7751 build_real (type, dconst1), arg0);
7753 /* Optimize pow(x,0.5) = sqrt(x). */
7754 if (flag_unsafe_math_optimizations
7755 && REAL_VALUES_EQUAL (c, dconsthalf))
7757 tree sqrtfn = mathfn_built_in (type, BUILT_IN_SQRT);
7759 if (sqrtfn != NULL_TREE)
7761 tree arglist = build_tree_list (NULL_TREE, arg0);
7762 return build_function_call_expr (sqrtfn, arglist);
7766 /* Optimize pow(x,1.0/3.0) = cbrt(x). */
7767 if (flag_unsafe_math_optimizations)
7769 const REAL_VALUE_TYPE dconstroot
7770 = real_value_truncate (TYPE_MODE (type), dconstthird);
7772 if (REAL_VALUES_EQUAL (c, dconstroot))
7774 tree cbrtfn = mathfn_built_in (type, BUILT_IN_CBRT);
7775 if (cbrtfn != NULL_TREE)
7777 tree arglist = build_tree_list (NULL_TREE, arg0);
7778 return build_function_call_expr (cbrtfn, arglist);
7783 /* Check for an integer exponent. */
7784 n = real_to_integer (&c);
7785 real_from_integer (&cint, VOIDmode, n, n < 0 ? -1 : 0, 0);
7786 if (real_identical (&c, &cint))
7788 /* Attempt to evaluate pow at compile-time. */
7789 if (TREE_CODE (arg0) == REAL_CST
7790 && ! TREE_CONSTANT_OVERFLOW (arg0))
7795 x = TREE_REAL_CST (arg0);
7796 inexact = real_powi (&x, TYPE_MODE (type), &x, n);
7797 if (flag_unsafe_math_optimizations || !inexact)
7798 return build_real (type, x);
7801 /* Strip sign ops from even integer powers. */
7802 if ((n & 1) == 0 && flag_unsafe_math_optimizations)
7804 tree narg0 = fold_strip_sign_ops (arg0);
7807 arglist = build_tree_list (NULL_TREE, arg1);
7808 arglist = tree_cons (NULL_TREE, narg0, arglist);
7809 return build_function_call_expr (fndecl, arglist);
7815 if (flag_unsafe_math_optimizations)
7817 const enum built_in_function fcode = builtin_mathfn_code (arg0);
7819 /* Optimize pow(expN(x),y) = expN(x*y). */
7820 if (BUILTIN_EXPONENT_P (fcode))
7822 tree expfn = TREE_OPERAND (TREE_OPERAND (arg0, 0), 0);
7823 tree arg = TREE_VALUE (TREE_OPERAND (arg0, 1));
7824 arg = fold_build2 (MULT_EXPR, type, arg, arg1);
7825 arglist = build_tree_list (NULL_TREE, arg);
7826 return build_function_call_expr (expfn, arglist);
7829 /* Optimize pow(sqrt(x),y) = pow(x,y*0.5). */
7830 if (BUILTIN_SQRT_P (fcode))
7832 tree narg0 = TREE_VALUE (TREE_OPERAND (arg0, 1));
7833 tree narg1 = fold_build2 (MULT_EXPR, type, arg1,
7834 build_real (type, dconsthalf));
7836 arglist = tree_cons (NULL_TREE, narg0,
7837 build_tree_list (NULL_TREE, narg1));
7838 return build_function_call_expr (fndecl, arglist);
7841 /* Optimize pow(cbrt(x),y) = pow(x,y/3) iff x is nonnegative. */
7842 if (BUILTIN_CBRT_P (fcode))
7844 tree arg = TREE_VALUE (TREE_OPERAND (arg0, 1));
7845 if (tree_expr_nonnegative_p (arg))
7847 const REAL_VALUE_TYPE dconstroot
7848 = real_value_truncate (TYPE_MODE (type), dconstthird);
7849 tree narg1 = fold_build2 (MULT_EXPR, type, arg1,
7850 build_real (type, dconstroot));
7851 arglist = tree_cons (NULL_TREE, arg,
7852 build_tree_list (NULL_TREE, narg1));
7853 return build_function_call_expr (fndecl, arglist);
7857 /* Optimize pow(pow(x,y),z) = pow(x,y*z). */
7858 if (fcode == BUILT_IN_POW || fcode == BUILT_IN_POWF
7859 || fcode == BUILT_IN_POWL)
7861 tree arg00 = TREE_VALUE (TREE_OPERAND (arg0, 1));
7862 tree arg01 = TREE_VALUE (TREE_CHAIN (TREE_OPERAND (arg0, 1)));
7863 tree narg1 = fold_build2 (MULT_EXPR, type, arg01, arg1);
7864 arglist = tree_cons (NULL_TREE, arg00,
7865 build_tree_list (NULL_TREE, narg1));
7866 return build_function_call_expr (fndecl, arglist);
7873 /* Fold a builtin function call to powi, powif, or powil. Return
7874 NULL_TREE if no simplification can be made. */
7876 fold_builtin_powi (tree fndecl ATTRIBUTE_UNUSED, tree arglist, tree type)
7878 tree arg0 = TREE_VALUE (arglist);
7879 tree arg1 = TREE_VALUE (TREE_CHAIN (arglist));
7881 if (!validate_arglist (arglist, REAL_TYPE, INTEGER_TYPE, VOID_TYPE))
7884 /* Optimize pow(1.0,y) = 1.0. */
7885 if (real_onep (arg0))
7886 return omit_one_operand (type, build_real (type, dconst1), arg1);
7888 if (host_integerp (arg1, 0))
7890 HOST_WIDE_INT c = TREE_INT_CST_LOW (arg1);
7892 /* Evaluate powi at compile-time. */
7893 if (TREE_CODE (arg0) == REAL_CST
7894 && ! TREE_CONSTANT_OVERFLOW (arg0))
7897 x = TREE_REAL_CST (arg0);
7898 real_powi (&x, TYPE_MODE (type), &x, c);
7899 return build_real (type, x);
7902 /* Optimize pow(x,0) = 1.0. */
7904 return omit_one_operand (type, build_real (type, dconst1),
7907 /* Optimize pow(x,1) = x. */
7911 /* Optimize pow(x,-1) = 1.0/x. */
7913 return fold_build2 (RDIV_EXPR, type,
7914 build_real (type, dconst1), arg0);
7920 /* A subroutine of fold_builtin to fold the various exponent
7921 functions. Return NULL_TREE if no simplification can me made.
7922 FUNC is the corresponding MPFR exponent function. */
7925 fold_builtin_exponent (tree fndecl, tree arglist,
7926 int (*func)(mpfr_ptr, mpfr_srcptr, mp_rnd_t))
7928 if (validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
7930 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7931 tree arg = TREE_VALUE (arglist);
7934 /* Calculate the result when the argument is a constant. */
7935 if ((res = do_mpfr_arg1 (arg, type, func, NULL, NULL, 0)))
7938 /* Optimize expN(logN(x)) = x. */
7939 if (flag_unsafe_math_optimizations)
7941 const enum built_in_function fcode = builtin_mathfn_code (arg);
7943 if ((func == mpfr_exp
7944 && (fcode == BUILT_IN_LOG
7945 || fcode == BUILT_IN_LOGF
7946 || fcode == BUILT_IN_LOGL))
7947 || (func == mpfr_exp2
7948 && (fcode == BUILT_IN_LOG2
7949 || fcode == BUILT_IN_LOG2F
7950 || fcode == BUILT_IN_LOG2L))
7951 || (func == mpfr_exp10
7952 && (fcode == BUILT_IN_LOG10
7953 || fcode == BUILT_IN_LOG10F
7954 || fcode == BUILT_IN_LOG10L)))
7955 return fold_convert (type, TREE_VALUE (TREE_OPERAND (arg, 1)));
7962 /* Return true if VAR is a VAR_DECL or a component thereof. */
7965 var_decl_component_p (tree var)
7968 while (handled_component_p (inner))
7969 inner = TREE_OPERAND (inner, 0);
7970 return SSA_VAR_P (inner);
7973 /* Fold function call to builtin memset. Return
7974 NULL_TREE if no simplification can be made. */
7977 fold_builtin_memset (tree arglist, tree type, bool ignore)
7979 tree dest, c, len, var, ret;
7980 unsigned HOST_WIDE_INT length, cval;
7982 if (!validate_arglist (arglist,
7983 POINTER_TYPE, INTEGER_TYPE, INTEGER_TYPE, VOID_TYPE))
7986 dest = TREE_VALUE (arglist);
7987 c = TREE_VALUE (TREE_CHAIN (arglist));
7988 len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
7990 if (! host_integerp (len, 1))
7993 /* If the LEN parameter is zero, return DEST. */
7994 if (integer_zerop (len))
7995 return omit_one_operand (type, dest, c);
7997 if (! host_integerp (c, 1) || TREE_SIDE_EFFECTS (dest))
8002 if (TREE_CODE (var) != ADDR_EXPR)
8005 var = TREE_OPERAND (var, 0);
8006 if (TREE_THIS_VOLATILE (var))
8009 if (!INTEGRAL_TYPE_P (TREE_TYPE (var))
8010 && !POINTER_TYPE_P (TREE_TYPE (var)))
8013 if (! var_decl_component_p (var))
8016 length = tree_low_cst (len, 1);
8017 if (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (var))) != length
8018 || get_pointer_alignment (dest, BIGGEST_ALIGNMENT) / BITS_PER_UNIT
8022 if (length > HOST_BITS_PER_WIDE_INT / BITS_PER_UNIT)
8025 if (integer_zerop (c))
8029 if (CHAR_BIT != 8 || BITS_PER_UNIT != 8 || HOST_BITS_PER_WIDE_INT > 64)
8032 cval = tree_low_cst (c, 1);
8036 cval |= (cval << 31) << 1;
8039 ret = build_int_cst_type (TREE_TYPE (var), cval);
8040 ret = build2 (MODIFY_EXPR, TREE_TYPE (var), var, ret);
8044 return omit_one_operand (type, dest, ret);
8047 /* Fold function call to builtin memset. Return
8048 NULL_TREE if no simplification can be made. */
8051 fold_builtin_bzero (tree arglist, bool ignore)
8053 tree dest, size, newarglist;
8055 if (!validate_arglist (arglist, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
8061 dest = TREE_VALUE (arglist);
8062 size = TREE_VALUE (TREE_CHAIN (arglist));
8064 /* New argument list transforming bzero(ptr x, int y) to
8065 memset(ptr x, int 0, size_t y). This is done this way
8066 so that if it isn't expanded inline, we fallback to
8067 calling bzero instead of memset. */
8069 newarglist = build_tree_list (NULL_TREE, fold_convert (sizetype, size));
8070 newarglist = tree_cons (NULL_TREE, integer_zero_node, newarglist);
8071 newarglist = tree_cons (NULL_TREE, dest, newarglist);
8072 return fold_builtin_memset (newarglist, void_type_node, ignore);
8075 /* Fold function call to builtin mem{{,p}cpy,move}. Return
8076 NULL_TREE if no simplification can be made.
8077 If ENDP is 0, return DEST (like memcpy).
8078 If ENDP is 1, return DEST+LEN (like mempcpy).
8079 If ENDP is 2, return DEST+LEN-1 (like stpcpy).
8080 If ENDP is 3, return DEST, additionally *SRC and *DEST may overlap
8084 fold_builtin_memory_op (tree arglist, tree type, bool ignore, int endp)
8086 tree dest, src, len, destvar, srcvar, expr;
8087 unsigned HOST_WIDE_INT length;
8089 if (! validate_arglist (arglist,
8090 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
8093 dest = TREE_VALUE (arglist);
8094 src = TREE_VALUE (TREE_CHAIN (arglist));
8095 len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
8097 /* If the LEN parameter is zero, return DEST. */
8098 if (integer_zerop (len))
8099 return omit_one_operand (type, dest, src);
8101 /* If SRC and DEST are the same (and not volatile), return
8102 DEST{,+LEN,+LEN-1}. */
8103 if (operand_equal_p (src, dest, 0))
8109 unsigned int src_align
8110 = get_pointer_alignment (src, BIGGEST_ALIGNMENT);
8111 unsigned int dest_align
8112 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
8113 /* Both DEST and SRC must be pointer types.
8114 ??? This is what old code did. Is the testing for pointer types
8117 If either SRC is readonly or length is 1, we can use memcpy. */
8118 if (dest_align && src_align
8119 && (readonly_data_expr (src)
8120 || integer_onep (len)))
8122 tree fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
8125 return build_function_call_expr (fn, arglist);
8128 if (! host_integerp (len, 1))
8131 if (TREE_SIDE_EFFECTS (dest) || TREE_SIDE_EFFECTS (src))
8135 STRIP_NOPS (destvar);
8136 if (TREE_CODE (destvar) != ADDR_EXPR)
8139 destvar = TREE_OPERAND (destvar, 0);
8140 if (TREE_THIS_VOLATILE (destvar))
8143 if (!INTEGRAL_TYPE_P (TREE_TYPE (destvar))
8144 && !POINTER_TYPE_P (TREE_TYPE (destvar))
8145 && !SCALAR_FLOAT_TYPE_P (TREE_TYPE (destvar)))
8148 if (! var_decl_component_p (destvar))
8152 STRIP_NOPS (srcvar);
8153 if (TREE_CODE (srcvar) != ADDR_EXPR)
8156 srcvar = TREE_OPERAND (srcvar, 0);
8157 if (TREE_THIS_VOLATILE (srcvar))
8160 if (!INTEGRAL_TYPE_P (TREE_TYPE (srcvar))
8161 && !POINTER_TYPE_P (TREE_TYPE (srcvar))
8162 && !SCALAR_FLOAT_TYPE_P (TREE_TYPE (srcvar)))
8165 if (! var_decl_component_p (srcvar))
8168 length = tree_low_cst (len, 1);
8169 if (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (destvar))) != length
8170 || get_pointer_alignment (dest, BIGGEST_ALIGNMENT) / BITS_PER_UNIT
8172 || GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (srcvar))) != length
8173 || get_pointer_alignment (src, BIGGEST_ALIGNMENT) / BITS_PER_UNIT
8177 if ((INTEGRAL_TYPE_P (TREE_TYPE (srcvar))
8178 || POINTER_TYPE_P (TREE_TYPE (srcvar)))
8179 && (INTEGRAL_TYPE_P (TREE_TYPE (destvar))
8180 || POINTER_TYPE_P (TREE_TYPE (destvar))))
8181 expr = fold_convert (TREE_TYPE (destvar), srcvar);
8183 expr = fold_build1 (VIEW_CONVERT_EXPR, TREE_TYPE (destvar), srcvar);
8184 expr = build2 (MODIFY_EXPR, TREE_TYPE (destvar), destvar, expr);
8190 if (endp == 0 || endp == 3)
8191 return omit_one_operand (type, dest, expr);
8197 len = fold_build2 (MINUS_EXPR, TREE_TYPE (len), len,
8200 len = fold_convert (TREE_TYPE (dest), len);
8201 dest = fold_build2 (PLUS_EXPR, TREE_TYPE (dest), dest, len);
8202 dest = fold_convert (type, dest);
8204 dest = omit_one_operand (type, dest, expr);
8208 /* Fold function call to builtin bcopy. Return NULL_TREE if no
8209 simplification can be made. */
8212 fold_builtin_bcopy (tree arglist, bool ignore)
8214 tree src, dest, size, newarglist;
8216 if (!validate_arglist (arglist,
8217 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
8223 src = TREE_VALUE (arglist);
8224 dest = TREE_VALUE (TREE_CHAIN (arglist));
8225 size = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
8227 /* New argument list transforming bcopy(ptr x, ptr y, int z) to
8228 memmove(ptr y, ptr x, size_t z). This is done this way
8229 so that if it isn't expanded inline, we fallback to
8230 calling bcopy instead of memmove. */
8232 newarglist = build_tree_list (NULL_TREE, fold_convert (sizetype, size));
8233 newarglist = tree_cons (NULL_TREE, src, newarglist);
8234 newarglist = tree_cons (NULL_TREE, dest, newarglist);
8236 return fold_builtin_memory_op (newarglist, void_type_node, true, /*endp=*/3);
8239 /* Fold function call to builtin strcpy. If LEN is not NULL, it represents
8240 the length of the string to be copied. Return NULL_TREE if no
8241 simplification can be made. */
8244 fold_builtin_strcpy (tree fndecl, tree arglist, tree len)
8248 if (!validate_arglist (arglist,
8249 POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
8252 dest = TREE_VALUE (arglist);
8253 src = TREE_VALUE (TREE_CHAIN (arglist));
8255 /* If SRC and DEST are the same (and not volatile), return DEST. */
8256 if (operand_equal_p (src, dest, 0))
8257 return fold_convert (TREE_TYPE (TREE_TYPE (fndecl)), dest);
8262 fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
8268 len = c_strlen (src, 1);
8269 if (! len || TREE_SIDE_EFFECTS (len))
8273 len = size_binop (PLUS_EXPR, len, ssize_int (1));
8274 arglist = build_tree_list (NULL_TREE, len);
8275 arglist = tree_cons (NULL_TREE, src, arglist);
8276 arglist = tree_cons (NULL_TREE, dest, arglist);
8277 return fold_convert (TREE_TYPE (TREE_TYPE (fndecl)),
8278 build_function_call_expr (fn, arglist));
8281 /* Fold function call to builtin strncpy. If SLEN is not NULL, it represents
8282 the length of the source string. Return NULL_TREE if no simplification
8286 fold_builtin_strncpy (tree fndecl, tree arglist, tree slen)
8288 tree dest, src, len, fn;
8290 if (!validate_arglist (arglist,
8291 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
8294 dest = TREE_VALUE (arglist);
8295 src = TREE_VALUE (TREE_CHAIN (arglist));
8296 len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
8298 /* If the LEN parameter is zero, return DEST. */
8299 if (integer_zerop (len))
8300 return omit_one_operand (TREE_TYPE (TREE_TYPE (fndecl)), dest, src);
8302 /* We can't compare slen with len as constants below if len is not a
8304 if (len == 0 || TREE_CODE (len) != INTEGER_CST)
8308 slen = c_strlen (src, 1);
8310 /* Now, we must be passed a constant src ptr parameter. */
8311 if (slen == 0 || TREE_CODE (slen) != INTEGER_CST)
8314 slen = size_binop (PLUS_EXPR, slen, ssize_int (1));
8316 /* We do not support simplification of this case, though we do
8317 support it when expanding trees into RTL. */
8318 /* FIXME: generate a call to __builtin_memset. */
8319 if (tree_int_cst_lt (slen, len))
8322 /* OK transform into builtin memcpy. */
8323 fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
8326 return fold_convert (TREE_TYPE (TREE_TYPE (fndecl)),
8327 build_function_call_expr (fn, arglist));
8330 /* Fold function call to builtin memcmp. Return
8331 NULL_TREE if no simplification can be made. */
8334 fold_builtin_memcmp (tree arglist)
8336 tree arg1, arg2, len;
8337 const char *p1, *p2;
8339 if (!validate_arglist (arglist,
8340 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
8343 arg1 = TREE_VALUE (arglist);
8344 arg2 = TREE_VALUE (TREE_CHAIN (arglist));
8345 len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
8347 /* If the LEN parameter is zero, return zero. */
8348 if (integer_zerop (len))
8349 return omit_two_operands (integer_type_node, integer_zero_node,
8352 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8353 if (operand_equal_p (arg1, arg2, 0))
8354 return omit_one_operand (integer_type_node, integer_zero_node, len);
8356 p1 = c_getstr (arg1);
8357 p2 = c_getstr (arg2);
8359 /* If all arguments are constant, and the value of len is not greater
8360 than the lengths of arg1 and arg2, evaluate at compile-time. */
8361 if (host_integerp (len, 1) && p1 && p2
8362 && compare_tree_int (len, strlen (p1) + 1) <= 0
8363 && compare_tree_int (len, strlen (p2) + 1) <= 0)
8365 const int r = memcmp (p1, p2, tree_low_cst (len, 1));
8368 return integer_one_node;
8370 return integer_minus_one_node;
8372 return integer_zero_node;
8375 /* If len parameter is one, return an expression corresponding to
8376 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
8377 if (host_integerp (len, 1) && tree_low_cst (len, 1) == 1)
8379 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
8380 tree cst_uchar_ptr_node
8381 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
8383 tree ind1 = fold_convert (integer_type_node,
8384 build1 (INDIRECT_REF, cst_uchar_node,
8385 fold_convert (cst_uchar_ptr_node,
8387 tree ind2 = fold_convert (integer_type_node,
8388 build1 (INDIRECT_REF, cst_uchar_node,
8389 fold_convert (cst_uchar_ptr_node,
8391 return fold_build2 (MINUS_EXPR, integer_type_node, ind1, ind2);
8397 /* Fold function call to builtin strcmp. Return
8398 NULL_TREE if no simplification can be made. */
8401 fold_builtin_strcmp (tree arglist)
8404 const char *p1, *p2;
8406 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
8409 arg1 = TREE_VALUE (arglist);
8410 arg2 = TREE_VALUE (TREE_CHAIN (arglist));
8412 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8413 if (operand_equal_p (arg1, arg2, 0))
8414 return integer_zero_node;
8416 p1 = c_getstr (arg1);
8417 p2 = c_getstr (arg2);
8421 const int i = strcmp (p1, p2);
8423 return integer_minus_one_node;
8425 return integer_one_node;
8427 return integer_zero_node;
8430 /* If the second arg is "", return *(const unsigned char*)arg1. */
8431 if (p2 && *p2 == '\0')
8433 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
8434 tree cst_uchar_ptr_node
8435 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
8437 return fold_convert (integer_type_node,
8438 build1 (INDIRECT_REF, cst_uchar_node,
8439 fold_convert (cst_uchar_ptr_node,
8443 /* If the first arg is "", return -*(const unsigned char*)arg2. */
8444 if (p1 && *p1 == '\0')
8446 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
8447 tree cst_uchar_ptr_node
8448 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
8450 tree temp = fold_convert (integer_type_node,
8451 build1 (INDIRECT_REF, cst_uchar_node,
8452 fold_convert (cst_uchar_ptr_node,
8454 return fold_build1 (NEGATE_EXPR, integer_type_node, temp);
8460 /* Fold function call to builtin strncmp. Return
8461 NULL_TREE if no simplification can be made. */
8464 fold_builtin_strncmp (tree arglist)
8466 tree arg1, arg2, len;
8467 const char *p1, *p2;
8469 if (!validate_arglist (arglist,
8470 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
8473 arg1 = TREE_VALUE (arglist);
8474 arg2 = TREE_VALUE (TREE_CHAIN (arglist));
8475 len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
8477 /* If the LEN parameter is zero, return zero. */
8478 if (integer_zerop (len))
8479 return omit_two_operands (integer_type_node, integer_zero_node,
8482 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8483 if (operand_equal_p (arg1, arg2, 0))
8484 return omit_one_operand (integer_type_node, integer_zero_node, len);
8486 p1 = c_getstr (arg1);
8487 p2 = c_getstr (arg2);
8489 if (host_integerp (len, 1) && p1 && p2)
8491 const int i = strncmp (p1, p2, tree_low_cst (len, 1));
8493 return integer_one_node;
8495 return integer_minus_one_node;
8497 return integer_zero_node;
8500 /* If the second arg is "", and the length is greater than zero,
8501 return *(const unsigned char*)arg1. */
8502 if (p2 && *p2 == '\0'
8503 && TREE_CODE (len) == INTEGER_CST
8504 && tree_int_cst_sgn (len) == 1)
8506 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
8507 tree cst_uchar_ptr_node
8508 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
8510 return fold_convert (integer_type_node,
8511 build1 (INDIRECT_REF, cst_uchar_node,
8512 fold_convert (cst_uchar_ptr_node,
8516 /* If the first arg is "", and the length is greater than zero,
8517 return -*(const unsigned char*)arg2. */
8518 if (p1 && *p1 == '\0'
8519 && TREE_CODE (len) == INTEGER_CST
8520 && tree_int_cst_sgn (len) == 1)
8522 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
8523 tree cst_uchar_ptr_node
8524 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
8526 tree temp = fold_convert (integer_type_node,
8527 build1 (INDIRECT_REF, cst_uchar_node,
8528 fold_convert (cst_uchar_ptr_node,
8530 return fold_build1 (NEGATE_EXPR, integer_type_node, temp);
8533 /* If len parameter is one, return an expression corresponding to
8534 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
8535 if (host_integerp (len, 1) && tree_low_cst (len, 1) == 1)
8537 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
8538 tree cst_uchar_ptr_node
8539 = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
8541 tree ind1 = fold_convert (integer_type_node,
8542 build1 (INDIRECT_REF, cst_uchar_node,
8543 fold_convert (cst_uchar_ptr_node,
8545 tree ind2 = fold_convert (integer_type_node,
8546 build1 (INDIRECT_REF, cst_uchar_node,
8547 fold_convert (cst_uchar_ptr_node,
8549 return fold_build2 (MINUS_EXPR, integer_type_node, ind1, ind2);
8555 /* Fold function call to builtin signbit, signbitf or signbitl. Return
8556 NULL_TREE if no simplification can be made. */
8559 fold_builtin_signbit (tree fndecl, tree arglist)
8561 tree type = TREE_TYPE (TREE_TYPE (fndecl));
8564 if (!validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
8567 arg = TREE_VALUE (arglist);
8569 /* If ARG is a compile-time constant, determine the result. */
8570 if (TREE_CODE (arg) == REAL_CST
8571 && !TREE_CONSTANT_OVERFLOW (arg))
8575 c = TREE_REAL_CST (arg);
8576 temp = REAL_VALUE_NEGATIVE (c) ? integer_one_node : integer_zero_node;
8577 return fold_convert (type, temp);
8580 /* If ARG is non-negative, the result is always zero. */
8581 if (tree_expr_nonnegative_p (arg))
8582 return omit_one_operand (type, integer_zero_node, arg);
8584 /* If ARG's format doesn't have signed zeros, return "arg < 0.0". */
8585 if (!HONOR_SIGNED_ZEROS (TYPE_MODE (TREE_TYPE (arg))))
8586 return fold_build2 (LT_EXPR, type, arg,
8587 build_real (TREE_TYPE (arg), dconst0));
8592 /* Fold function call to builtin copysign, copysignf or copysignl.
8593 Return NULL_TREE if no simplification can be made. */
8596 fold_builtin_copysign (tree fndecl, tree arglist, tree type)
8598 tree arg1, arg2, tem;
8600 if (!validate_arglist (arglist, REAL_TYPE, REAL_TYPE, VOID_TYPE))
8603 arg1 = TREE_VALUE (arglist);
8604 arg2 = TREE_VALUE (TREE_CHAIN (arglist));
8606 /* copysign(X,X) is X. */
8607 if (operand_equal_p (arg1, arg2, 0))
8608 return fold_convert (type, arg1);
8610 /* If ARG1 and ARG2 are compile-time constants, determine the result. */
8611 if (TREE_CODE (arg1) == REAL_CST
8612 && TREE_CODE (arg2) == REAL_CST
8613 && !TREE_CONSTANT_OVERFLOW (arg1)
8614 && !TREE_CONSTANT_OVERFLOW (arg2))
8616 REAL_VALUE_TYPE c1, c2;
8618 c1 = TREE_REAL_CST (arg1);
8619 c2 = TREE_REAL_CST (arg2);
8620 /* c1.sign := c2.sign. */
8621 real_copysign (&c1, &c2);
8622 return build_real (type, c1);
8625 /* copysign(X, Y) is fabs(X) when Y is always non-negative.
8626 Remember to evaluate Y for side-effects. */
8627 if (tree_expr_nonnegative_p (arg2))
8628 return omit_one_operand (type,
8629 fold_build1 (ABS_EXPR, type, arg1),
8632 /* Strip sign changing operations for the first argument. */
8633 tem = fold_strip_sign_ops (arg1);
8636 arglist = tree_cons (NULL_TREE, tem, TREE_CHAIN (arglist));
8637 return build_function_call_expr (fndecl, arglist);
8643 /* Fold a call to builtin isascii. */
8646 fold_builtin_isascii (tree arglist)
8648 if (! validate_arglist (arglist, INTEGER_TYPE, VOID_TYPE))
8652 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
8653 tree arg = TREE_VALUE (arglist);
8655 arg = build2 (BIT_AND_EXPR, integer_type_node, arg,
8656 build_int_cst (NULL_TREE,
8657 ~ (unsigned HOST_WIDE_INT) 0x7f));
8658 arg = fold_build2 (EQ_EXPR, integer_type_node,
8659 arg, integer_zero_node);
8661 if (in_gimple_form && !TREE_CONSTANT (arg))
8668 /* Fold a call to builtin toascii. */
8671 fold_builtin_toascii (tree arglist)
8673 if (! validate_arglist (arglist, INTEGER_TYPE, VOID_TYPE))
8677 /* Transform toascii(c) -> (c & 0x7f). */
8678 tree arg = TREE_VALUE (arglist);
8680 return fold_build2 (BIT_AND_EXPR, integer_type_node, arg,
8681 build_int_cst (NULL_TREE, 0x7f));
8685 /* Fold a call to builtin isdigit. */
8688 fold_builtin_isdigit (tree arglist)
8690 if (! validate_arglist (arglist, INTEGER_TYPE, VOID_TYPE))
8694 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
8695 /* According to the C standard, isdigit is unaffected by locale.
8696 However, it definitely is affected by the target character set. */
8698 unsigned HOST_WIDE_INT target_digit0
8699 = lang_hooks.to_target_charset ('0');
8701 if (target_digit0 == 0)
8704 arg = fold_convert (unsigned_type_node, TREE_VALUE (arglist));
8705 arg = build2 (MINUS_EXPR, unsigned_type_node, arg,
8706 build_int_cst (unsigned_type_node, target_digit0));
8707 arg = fold_build2 (LE_EXPR, integer_type_node, arg,
8708 build_int_cst (unsigned_type_node, 9));
8709 if (in_gimple_form && !TREE_CONSTANT (arg))
8716 /* Fold a call to fabs, fabsf or fabsl. */
8719 fold_builtin_fabs (tree arglist, tree type)
8723 if (!validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
8726 arg = TREE_VALUE (arglist);
8727 arg = fold_convert (type, arg);
8728 if (TREE_CODE (arg) == REAL_CST)
8729 return fold_abs_const (arg, type);
8730 return fold_build1 (ABS_EXPR, type, arg);
8733 /* Fold a call to abs, labs, llabs or imaxabs. */
8736 fold_builtin_abs (tree arglist, tree type)
8740 if (!validate_arglist (arglist, INTEGER_TYPE, VOID_TYPE))
8743 arg = TREE_VALUE (arglist);
8744 arg = fold_convert (type, arg);
8745 if (TREE_CODE (arg) == INTEGER_CST)
8746 return fold_abs_const (arg, type);
8747 return fold_build1 (ABS_EXPR, type, arg);
8750 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
8751 EXP is the CALL_EXPR for the call. */
8754 fold_builtin_classify (tree fndecl, tree arglist, int builtin_index)
8756 tree type = TREE_TYPE (TREE_TYPE (fndecl));
8760 if (!validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
8762 /* Check that we have exactly one argument. */
8765 error ("too few arguments to function %qs",
8766 IDENTIFIER_POINTER (DECL_NAME (fndecl)));
8767 return error_mark_node;
8769 else if (TREE_CHAIN (arglist) != 0)
8771 error ("too many arguments to function %qs",
8772 IDENTIFIER_POINTER (DECL_NAME (fndecl)));
8773 return error_mark_node;
8777 error ("non-floating-point argument to function %qs",
8778 IDENTIFIER_POINTER (DECL_NAME (fndecl)));
8779 return error_mark_node;
8783 arg = TREE_VALUE (arglist);
8784 switch (builtin_index)
8786 case BUILT_IN_ISINF:
8787 if (!HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (arg))))
8788 return omit_one_operand (type, integer_zero_node, arg);
8790 if (TREE_CODE (arg) == REAL_CST)
8792 r = TREE_REAL_CST (arg);
8793 if (real_isinf (&r))
8794 return real_compare (GT_EXPR, &r, &dconst0)
8795 ? integer_one_node : integer_minus_one_node;
8797 return integer_zero_node;
8802 case BUILT_IN_FINITE:
8803 if (!HONOR_NANS (TYPE_MODE (TREE_TYPE (arg)))
8804 && !HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (arg))))
8805 return omit_one_operand (type, integer_one_node, arg);
8807 if (TREE_CODE (arg) == REAL_CST)
8809 r = TREE_REAL_CST (arg);
8810 return real_isinf (&r) || real_isnan (&r)
8811 ? integer_zero_node : integer_one_node;
8816 case BUILT_IN_ISNAN:
8817 if (!HONOR_NANS (TYPE_MODE (TREE_TYPE (arg))))
8818 return omit_one_operand (type, integer_zero_node, arg);
8820 if (TREE_CODE (arg) == REAL_CST)
8822 r = TREE_REAL_CST (arg);
8823 return real_isnan (&r) ? integer_one_node : integer_zero_node;
8826 arg = builtin_save_expr (arg);
8827 return fold_build2 (UNORDERED_EXPR, type, arg, arg);
8834 /* Fold a call to an unordered comparison function such as
8835 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
8836 being called and ARGLIST is the argument list for the call.
8837 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
8838 the opposite of the desired result. UNORDERED_CODE is used
8839 for modes that can hold NaNs and ORDERED_CODE is used for
8843 fold_builtin_unordered_cmp (tree fndecl, tree arglist,
8844 enum tree_code unordered_code,
8845 enum tree_code ordered_code)
8847 tree type = TREE_TYPE (TREE_TYPE (fndecl));
8848 enum tree_code code;
8851 enum tree_code code0, code1;
8852 tree cmp_type = NULL_TREE;
8854 if (!validate_arglist (arglist, REAL_TYPE, REAL_TYPE, VOID_TYPE))
8856 /* Check that we have exactly two arguments. */
8857 if (arglist == 0 || TREE_CHAIN (arglist) == 0)
8859 error ("too few arguments to function %qs",
8860 IDENTIFIER_POINTER (DECL_NAME (fndecl)));
8861 return error_mark_node;
8863 else if (TREE_CHAIN (TREE_CHAIN (arglist)) != 0)
8865 error ("too many arguments to function %qs",
8866 IDENTIFIER_POINTER (DECL_NAME (fndecl)));
8867 return error_mark_node;
8871 arg0 = TREE_VALUE (arglist);
8872 arg1 = TREE_VALUE (TREE_CHAIN (arglist));
8874 type0 = TREE_TYPE (arg0);
8875 type1 = TREE_TYPE (arg1);
8877 code0 = TREE_CODE (type0);
8878 code1 = TREE_CODE (type1);
8880 if (code0 == REAL_TYPE && code1 == REAL_TYPE)
8881 /* Choose the wider of two real types. */
8882 cmp_type = TYPE_PRECISION (type0) >= TYPE_PRECISION (type1)
8884 else if (code0 == REAL_TYPE && code1 == INTEGER_TYPE)
8886 else if (code0 == INTEGER_TYPE && code1 == REAL_TYPE)
8890 error ("non-floating-point argument to function %qs",
8891 IDENTIFIER_POINTER (DECL_NAME (fndecl)));
8892 return error_mark_node;
8895 arg0 = fold_convert (cmp_type, arg0);
8896 arg1 = fold_convert (cmp_type, arg1);
8898 if (unordered_code == UNORDERED_EXPR)
8900 if (!HONOR_NANS (TYPE_MODE (TREE_TYPE (arg0))))
8901 return omit_two_operands (type, integer_zero_node, arg0, arg1);
8902 return fold_build2 (UNORDERED_EXPR, type, arg0, arg1);
8905 code = HONOR_NANS (TYPE_MODE (TREE_TYPE (arg0))) ? unordered_code
8907 return fold_build1 (TRUTH_NOT_EXPR, type,
8908 fold_build2 (code, type, arg0, arg1));
8911 /* Used by constant folding to simplify calls to builtin functions. EXP is
8912 the CALL_EXPR of a call to a builtin function. IGNORE is true if the
8913 result of the function call is ignored. This function returns NULL_TREE
8914 if no simplification was possible. */
8917 fold_builtin_1 (tree fndecl, tree arglist, bool ignore)
8919 tree type = TREE_TYPE (TREE_TYPE (fndecl));
8920 enum built_in_function fcode;
8922 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
8923 return targetm.fold_builtin (fndecl, arglist, ignore);
8925 fcode = DECL_FUNCTION_CODE (fndecl);
8928 case BUILT_IN_FPUTS:
8929 return fold_builtin_fputs (arglist, ignore, false, NULL_TREE);
8931 case BUILT_IN_FPUTS_UNLOCKED:
8932 return fold_builtin_fputs (arglist, ignore, true, NULL_TREE);
8934 case BUILT_IN_STRSTR:
8935 return fold_builtin_strstr (arglist, type);
8937 case BUILT_IN_STRCAT:
8938 return fold_builtin_strcat (arglist);
8940 case BUILT_IN_STRNCAT:
8941 return fold_builtin_strncat (arglist);
8943 case BUILT_IN_STRSPN:
8944 return fold_builtin_strspn (arglist);
8946 case BUILT_IN_STRCSPN:
8947 return fold_builtin_strcspn (arglist);
8949 case BUILT_IN_STRCHR:
8950 case BUILT_IN_INDEX:
8951 return fold_builtin_strchr (arglist, type);
8953 case BUILT_IN_STRRCHR:
8954 case BUILT_IN_RINDEX:
8955 return fold_builtin_strrchr (arglist, type);
8957 case BUILT_IN_STRCPY:
8958 return fold_builtin_strcpy (fndecl, arglist, NULL_TREE);
8960 case BUILT_IN_STRNCPY:
8961 return fold_builtin_strncpy (fndecl, arglist, NULL_TREE);
8963 case BUILT_IN_STRCMP:
8964 return fold_builtin_strcmp (arglist);
8966 case BUILT_IN_STRNCMP:
8967 return fold_builtin_strncmp (arglist);
8969 case BUILT_IN_STRPBRK:
8970 return fold_builtin_strpbrk (arglist, type);
8973 case BUILT_IN_MEMCMP:
8974 return fold_builtin_memcmp (arglist);
8976 case BUILT_IN_SPRINTF:
8977 return fold_builtin_sprintf (arglist, ignore);
8979 case BUILT_IN_CONSTANT_P:
8983 val = fold_builtin_constant_p (arglist);
8984 /* Gimplification will pull the CALL_EXPR for the builtin out of
8985 an if condition. When not optimizing, we'll not CSE it back.
8986 To avoid link error types of regressions, return false now. */
8987 if (!val && !optimize)
8988 val = integer_zero_node;
8993 case BUILT_IN_EXPECT:
8994 return fold_builtin_expect (arglist);
8996 case BUILT_IN_CLASSIFY_TYPE:
8997 return fold_builtin_classify_type (arglist);
8999 case BUILT_IN_STRLEN:
9000 return fold_builtin_strlen (arglist);
9002 CASE_FLT_FN (BUILT_IN_FABS):
9003 return fold_builtin_fabs (arglist, type);
9007 case BUILT_IN_LLABS:
9008 case BUILT_IN_IMAXABS:
9009 return fold_builtin_abs (arglist, type);
9011 CASE_FLT_FN (BUILT_IN_CONJ):
9012 if (validate_arglist (arglist, COMPLEX_TYPE, VOID_TYPE))
9013 return fold_build1 (CONJ_EXPR, type, TREE_VALUE (arglist));
9016 CASE_FLT_FN (BUILT_IN_CREAL):
9017 if (validate_arglist (arglist, COMPLEX_TYPE, VOID_TYPE))
9018 return non_lvalue (fold_build1 (REALPART_EXPR, type,
9019 TREE_VALUE (arglist)));
9022 CASE_FLT_FN (BUILT_IN_CIMAG):
9023 if (validate_arglist (arglist, COMPLEX_TYPE, VOID_TYPE))
9024 return non_lvalue (fold_build1 (IMAGPART_EXPR, type,
9025 TREE_VALUE (arglist)));
9028 CASE_FLT_FN (BUILT_IN_CABS):
9029 return fold_builtin_cabs (arglist, type, fndecl);
9031 CASE_FLT_FN (BUILT_IN_SQRT):
9032 return fold_builtin_sqrt (arglist, type);
9034 CASE_FLT_FN (BUILT_IN_CBRT):
9035 return fold_builtin_cbrt (arglist, type);
9037 CASE_FLT_FN (BUILT_IN_ASIN):
9038 if (validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
9039 return do_mpfr_arg1 (TREE_VALUE (arglist), type, mpfr_asin,
9040 &dconstm1, &dconst1, true);
9043 CASE_FLT_FN (BUILT_IN_ACOS):
9044 if (validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
9045 return do_mpfr_arg1 (TREE_VALUE (arglist), type, mpfr_acos,
9046 &dconstm1, &dconst1, true);
9049 CASE_FLT_FN (BUILT_IN_ATAN):
9050 if (validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
9051 return do_mpfr_arg1 (TREE_VALUE (arglist), type, mpfr_atan,
9055 CASE_FLT_FN (BUILT_IN_ASINH):
9056 if (validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
9057 return do_mpfr_arg1 (TREE_VALUE (arglist), type, mpfr_asinh,
9061 CASE_FLT_FN (BUILT_IN_ACOSH):
9062 if (validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
9063 return do_mpfr_arg1 (TREE_VALUE (arglist), type, mpfr_acosh,
9064 &dconst1, NULL, true);
9067 CASE_FLT_FN (BUILT_IN_ATANH):
9068 if (validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
9069 return do_mpfr_arg1 (TREE_VALUE (arglist), type, mpfr_atanh,
9070 &dconstm1, &dconst1, false);
9073 CASE_FLT_FN (BUILT_IN_SIN):
9074 if (validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
9075 return do_mpfr_arg1 (TREE_VALUE (arglist), type, mpfr_sin,
9079 CASE_FLT_FN (BUILT_IN_COS):
9080 return fold_builtin_cos (arglist, type, fndecl);
9082 CASE_FLT_FN (BUILT_IN_TAN):
9083 return fold_builtin_tan (arglist, type);
9085 CASE_FLT_FN (BUILT_IN_SINH):
9086 if (validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
9087 return do_mpfr_arg1 (TREE_VALUE (arglist), type, mpfr_sinh,
9091 CASE_FLT_FN (BUILT_IN_COSH):
9092 if (validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
9093 return do_mpfr_arg1 (TREE_VALUE (arglist), type, mpfr_cosh,
9097 CASE_FLT_FN (BUILT_IN_TANH):
9098 if (validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
9099 return do_mpfr_arg1 (TREE_VALUE (arglist), type, mpfr_tanh,
9103 CASE_FLT_FN (BUILT_IN_ERF):
9104 if (validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
9105 return do_mpfr_arg1 (TREE_VALUE (arglist), type, mpfr_erf,
9109 CASE_FLT_FN (BUILT_IN_ERFC):
9110 if (validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
9111 return do_mpfr_arg1 (TREE_VALUE (arglist), type, mpfr_erfc,
9115 CASE_FLT_FN (BUILT_IN_EXP):
9116 return fold_builtin_exponent (fndecl, arglist, mpfr_exp);
9118 CASE_FLT_FN (BUILT_IN_EXP2):
9119 return fold_builtin_exponent (fndecl, arglist, mpfr_exp2);
9121 CASE_FLT_FN (BUILT_IN_EXP10):
9122 CASE_FLT_FN (BUILT_IN_POW10):
9123 return fold_builtin_exponent (fndecl, arglist, mpfr_exp10);
9125 CASE_FLT_FN (BUILT_IN_EXPM1):
9126 if (validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
9127 return do_mpfr_arg1 (TREE_VALUE (arglist), type, mpfr_expm1,
9131 CASE_FLT_FN (BUILT_IN_LOG):
9132 return fold_builtin_logarithm (fndecl, arglist, mpfr_log);
9134 CASE_FLT_FN (BUILT_IN_LOG2):
9135 return fold_builtin_logarithm (fndecl, arglist, mpfr_log2);
9137 CASE_FLT_FN (BUILT_IN_LOG10):
9138 return fold_builtin_logarithm (fndecl, arglist, mpfr_log10);
9140 CASE_FLT_FN (BUILT_IN_LOG1P):
9141 if (validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
9142 return do_mpfr_arg1 (TREE_VALUE (arglist), type, mpfr_log1p,
9143 &dconstm1, NULL, false);
9146 CASE_FLT_FN (BUILT_IN_ATAN2):
9147 if (validate_arglist (arglist, REAL_TYPE, REAL_TYPE, VOID_TYPE))
9148 return do_mpfr_arg2 (TREE_VALUE (arglist),
9149 TREE_VALUE (TREE_CHAIN (arglist)),
9153 CASE_FLT_FN (BUILT_IN_HYPOT):
9154 return fold_builtin_hypot (fndecl, arglist, type);
9156 CASE_FLT_FN (BUILT_IN_POW):
9157 return fold_builtin_pow (fndecl, arglist, type);
9159 CASE_FLT_FN (BUILT_IN_POWI):
9160 return fold_builtin_powi (fndecl, arglist, type);
9162 CASE_FLT_FN (BUILT_IN_INF):
9163 case BUILT_IN_INFD32:
9164 case BUILT_IN_INFD64:
9165 case BUILT_IN_INFD128:
9166 return fold_builtin_inf (type, true);
9168 CASE_FLT_FN (BUILT_IN_HUGE_VAL):
9169 return fold_builtin_inf (type, false);
9171 CASE_FLT_FN (BUILT_IN_NAN):
9172 case BUILT_IN_NAND32:
9173 case BUILT_IN_NAND64:
9174 case BUILT_IN_NAND128:
9175 return fold_builtin_nan (arglist, type, true);
9177 CASE_FLT_FN (BUILT_IN_NANS):
9178 return fold_builtin_nan (arglist, type, false);
9180 CASE_FLT_FN (BUILT_IN_FLOOR):
9181 return fold_builtin_floor (fndecl, arglist);
9183 CASE_FLT_FN (BUILT_IN_CEIL):
9184 return fold_builtin_ceil (fndecl, arglist);
9186 CASE_FLT_FN (BUILT_IN_TRUNC):
9187 return fold_builtin_trunc (fndecl, arglist);
9189 CASE_FLT_FN (BUILT_IN_ROUND):
9190 return fold_builtin_round (fndecl, arglist);
9192 CASE_FLT_FN (BUILT_IN_NEARBYINT):
9193 CASE_FLT_FN (BUILT_IN_RINT):
9194 return fold_trunc_transparent_mathfn (fndecl, arglist);
9196 CASE_FLT_FN (BUILT_IN_LCEIL):
9197 CASE_FLT_FN (BUILT_IN_LLCEIL):
9198 CASE_FLT_FN (BUILT_IN_LFLOOR):
9199 CASE_FLT_FN (BUILT_IN_LLFLOOR):
9200 CASE_FLT_FN (BUILT_IN_LROUND):
9201 CASE_FLT_FN (BUILT_IN_LLROUND):
9202 return fold_builtin_int_roundingfn (fndecl, arglist);
9204 CASE_FLT_FN (BUILT_IN_LRINT):
9205 CASE_FLT_FN (BUILT_IN_LLRINT):
9206 return fold_fixed_mathfn (fndecl, arglist);
9208 CASE_INT_FN (BUILT_IN_FFS):
9209 CASE_INT_FN (BUILT_IN_CLZ):
9210 CASE_INT_FN (BUILT_IN_CTZ):
9211 CASE_INT_FN (BUILT_IN_POPCOUNT):
9212 CASE_INT_FN (BUILT_IN_PARITY):
9213 return fold_builtin_bitop (fndecl, arglist);
9215 case BUILT_IN_MEMSET:
9216 return fold_builtin_memset (arglist, type, ignore);
9218 case BUILT_IN_MEMCPY:
9219 return fold_builtin_memory_op (arglist, type, ignore, /*endp=*/0);
9221 case BUILT_IN_MEMPCPY:
9222 return fold_builtin_memory_op (arglist, type, ignore, /*endp=*/1);
9224 case BUILT_IN_MEMMOVE:
9225 return fold_builtin_memory_op (arglist, type, ignore, /*endp=*/3);
9227 case BUILT_IN_BZERO:
9228 return fold_builtin_bzero (arglist, ignore);
9230 case BUILT_IN_BCOPY:
9231 return fold_builtin_bcopy (arglist, ignore);
9233 CASE_FLT_FN (BUILT_IN_SIGNBIT):
9234 return fold_builtin_signbit (fndecl, arglist);
9236 case BUILT_IN_ISASCII:
9237 return fold_builtin_isascii (arglist);
9239 case BUILT_IN_TOASCII:
9240 return fold_builtin_toascii (arglist);
9242 case BUILT_IN_ISDIGIT:
9243 return fold_builtin_isdigit (arglist);
9245 CASE_FLT_FN (BUILT_IN_COPYSIGN):
9246 return fold_builtin_copysign (fndecl, arglist, type);
9248 CASE_FLT_FN (BUILT_IN_FINITE):
9249 case BUILT_IN_FINITED32:
9250 case BUILT_IN_FINITED64:
9251 case BUILT_IN_FINITED128:
9252 return fold_builtin_classify (fndecl, arglist, BUILT_IN_FINITE);
9254 CASE_FLT_FN (BUILT_IN_ISINF):
9255 case BUILT_IN_ISINFD32:
9256 case BUILT_IN_ISINFD64:
9257 case BUILT_IN_ISINFD128:
9258 return fold_builtin_classify (fndecl, arglist, BUILT_IN_ISINF);
9260 CASE_FLT_FN (BUILT_IN_ISNAN):
9261 case BUILT_IN_ISNAND32:
9262 case BUILT_IN_ISNAND64:
9263 case BUILT_IN_ISNAND128:
9264 return fold_builtin_classify (fndecl, arglist, BUILT_IN_ISNAN);
9266 case BUILT_IN_ISGREATER:
9267 return fold_builtin_unordered_cmp (fndecl, arglist, UNLE_EXPR, LE_EXPR);
9268 case BUILT_IN_ISGREATEREQUAL:
9269 return fold_builtin_unordered_cmp (fndecl, arglist, UNLT_EXPR, LT_EXPR);
9270 case BUILT_IN_ISLESS:
9271 return fold_builtin_unordered_cmp (fndecl, arglist, UNGE_EXPR, GE_EXPR);
9272 case BUILT_IN_ISLESSEQUAL:
9273 return fold_builtin_unordered_cmp (fndecl, arglist, UNGT_EXPR, GT_EXPR);
9274 case BUILT_IN_ISLESSGREATER:
9275 return fold_builtin_unordered_cmp (fndecl, arglist, UNEQ_EXPR, EQ_EXPR);
9276 case BUILT_IN_ISUNORDERED:
9277 return fold_builtin_unordered_cmp (fndecl, arglist, UNORDERED_EXPR,
9280 /* We do the folding for va_start in the expander. */
9281 case BUILT_IN_VA_START:
9284 case BUILT_IN_OBJECT_SIZE:
9285 return fold_builtin_object_size (arglist);
9286 case BUILT_IN_MEMCPY_CHK:
9287 case BUILT_IN_MEMPCPY_CHK:
9288 case BUILT_IN_MEMMOVE_CHK:
9289 case BUILT_IN_MEMSET_CHK:
9290 return fold_builtin_memory_chk (fndecl, arglist, NULL_TREE, ignore,
9291 DECL_FUNCTION_CODE (fndecl));
9292 case BUILT_IN_STRCPY_CHK:
9293 case BUILT_IN_STPCPY_CHK:
9294 return fold_builtin_stxcpy_chk (fndecl, arglist, NULL_TREE, ignore,
9295 DECL_FUNCTION_CODE (fndecl));
9296 case BUILT_IN_STRNCPY_CHK:
9297 return fold_builtin_strncpy_chk (arglist, NULL_TREE);
9298 case BUILT_IN_STRCAT_CHK:
9299 return fold_builtin_strcat_chk (fndecl, arglist);
9300 case BUILT_IN_STRNCAT_CHK:
9301 return fold_builtin_strncat_chk (fndecl, arglist);
9302 case BUILT_IN_SPRINTF_CHK:
9303 case BUILT_IN_VSPRINTF_CHK:
9304 return fold_builtin_sprintf_chk (arglist, DECL_FUNCTION_CODE (fndecl));
9305 case BUILT_IN_SNPRINTF_CHK:
9306 case BUILT_IN_VSNPRINTF_CHK:
9307 return fold_builtin_snprintf_chk (arglist, NULL_TREE,
9308 DECL_FUNCTION_CODE (fndecl));
9310 case BUILT_IN_PRINTF:
9311 case BUILT_IN_PRINTF_UNLOCKED:
9312 case BUILT_IN_VPRINTF:
9313 case BUILT_IN_PRINTF_CHK:
9314 case BUILT_IN_VPRINTF_CHK:
9315 return fold_builtin_printf (fndecl, arglist, ignore,
9316 DECL_FUNCTION_CODE (fndecl));
9318 case BUILT_IN_FPRINTF:
9319 case BUILT_IN_FPRINTF_UNLOCKED:
9320 case BUILT_IN_VFPRINTF:
9321 case BUILT_IN_FPRINTF_CHK:
9322 case BUILT_IN_VFPRINTF_CHK:
9323 return fold_builtin_fprintf (fndecl, arglist, ignore,
9324 DECL_FUNCTION_CODE (fndecl));
9333 /* A wrapper function for builtin folding that prevents warnings for
9334 "statement without effect" and the like, caused by removing the
9335 call node earlier than the warning is generated. */
9338 fold_builtin (tree fndecl, tree arglist, bool ignore)
9340 tree exp = fold_builtin_1 (fndecl, arglist, ignore);
9343 exp = build1 (NOP_EXPR, TREE_TYPE (exp), exp);
9344 TREE_NO_WARNING (exp) = 1;
9350 /* Conveniently construct a function call expression. */
9353 build_function_call_expr (tree fn, tree arglist)
9357 call_expr = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn);
9358 return fold_build3 (CALL_EXPR, TREE_TYPE (TREE_TYPE (fn)),
9359 call_expr, arglist, NULL_TREE);
9362 /* This function validates the types of a function call argument list
9363 represented as a tree chain of parameters against a specified list
9364 of tree_codes. If the last specifier is a 0, that represents an
9365 ellipses, otherwise the last specifier must be a VOID_TYPE. */
9368 validate_arglist (tree arglist, ...)
9370 enum tree_code code;
9374 va_start (ap, arglist);
9378 code = va_arg (ap, enum tree_code);
9382 /* This signifies an ellipses, any further arguments are all ok. */
9386 /* This signifies an endlink, if no arguments remain, return
9387 true, otherwise return false. */
9391 /* If no parameters remain or the parameter's code does not
9392 match the specified code, return false. Otherwise continue
9393 checking any remaining arguments. */
9396 if (code == POINTER_TYPE)
9398 if (! POINTER_TYPE_P (TREE_TYPE (TREE_VALUE (arglist))))
9401 else if (code != TREE_CODE (TREE_TYPE (TREE_VALUE (arglist))))
9405 arglist = TREE_CHAIN (arglist);
9409 /* We need gotos here since we can only have one VA_CLOSE in a
9417 /* Default target-specific builtin expander that does nothing. */
9420 default_expand_builtin (tree exp ATTRIBUTE_UNUSED,
9421 rtx target ATTRIBUTE_UNUSED,
9422 rtx subtarget ATTRIBUTE_UNUSED,
9423 enum machine_mode mode ATTRIBUTE_UNUSED,
9424 int ignore ATTRIBUTE_UNUSED)
9429 /* Returns true is EXP represents data that would potentially reside
9430 in a readonly section. */
9433 readonly_data_expr (tree exp)
9437 if (TREE_CODE (exp) != ADDR_EXPR)
9440 exp = get_base_address (TREE_OPERAND (exp, 0));
9444 /* Make sure we call decl_readonly_section only for trees it
9445 can handle (since it returns true for everything it doesn't
9447 if (TREE_CODE (exp) == STRING_CST
9448 || TREE_CODE (exp) == CONSTRUCTOR
9449 || (TREE_CODE (exp) == VAR_DECL && TREE_STATIC (exp)))
9450 return decl_readonly_section (exp, 0);
9455 /* Simplify a call to the strstr builtin.
9457 Return 0 if no simplification was possible, otherwise return the
9458 simplified form of the call as a tree.
9460 The simplified form may be a constant or other expression which
9461 computes the same value, but in a more efficient manner (including
9462 calls to other builtin functions).
9464 The call may contain arguments which need to be evaluated, but
9465 which are not useful to determine the result of the call. In
9466 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9467 COMPOUND_EXPR will be an argument which must be evaluated.
9468 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9469 COMPOUND_EXPR in the chain will contain the tree for the simplified
9470 form of the builtin function call. */
9473 fold_builtin_strstr (tree arglist, tree type)
9475 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
9479 tree s1 = TREE_VALUE (arglist), s2 = TREE_VALUE (TREE_CHAIN (arglist));
9481 const char *p1, *p2;
9490 const char *r = strstr (p1, p2);
9494 return build_int_cst (TREE_TYPE (s1), 0);
9496 /* Return an offset into the constant string argument. */
9497 tem = fold_build2 (PLUS_EXPR, TREE_TYPE (s1),
9498 s1, build_int_cst (TREE_TYPE (s1), r - p1));
9499 return fold_convert (type, tem);
9502 /* The argument is const char *, and the result is char *, so we need
9503 a type conversion here to avoid a warning. */
9505 return fold_convert (type, s1);
9510 fn = implicit_built_in_decls[BUILT_IN_STRCHR];
9514 /* New argument list transforming strstr(s1, s2) to
9515 strchr(s1, s2[0]). */
9516 arglist = build_tree_list (NULL_TREE,
9517 build_int_cst (NULL_TREE, p2[0]));
9518 arglist = tree_cons (NULL_TREE, s1, arglist);
9519 return build_function_call_expr (fn, arglist);
9523 /* Simplify a call to the strchr builtin.
9525 Return 0 if no simplification was possible, otherwise return the
9526 simplified form of the call as a tree.
9528 The simplified form may be a constant or other expression which
9529 computes the same value, but in a more efficient manner (including
9530 calls to other builtin functions).
9532 The call may contain arguments which need to be evaluated, but
9533 which are not useful to determine the result of the call. In
9534 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9535 COMPOUND_EXPR will be an argument which must be evaluated.
9536 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9537 COMPOUND_EXPR in the chain will contain the tree for the simplified
9538 form of the builtin function call. */
9541 fold_builtin_strchr (tree arglist, tree type)
9543 if (!validate_arglist (arglist, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
9547 tree s1 = TREE_VALUE (arglist), s2 = TREE_VALUE (TREE_CHAIN (arglist));
9550 if (TREE_CODE (s2) != INTEGER_CST)
9560 if (target_char_cast (s2, &c))
9566 return build_int_cst (TREE_TYPE (s1), 0);
9568 /* Return an offset into the constant string argument. */
9569 tem = fold_build2 (PLUS_EXPR, TREE_TYPE (s1),
9570 s1, build_int_cst (TREE_TYPE (s1), r - p1));
9571 return fold_convert (type, tem);
9577 /* Simplify a call to the strrchr builtin.
9579 Return 0 if no simplification was possible, otherwise return the
9580 simplified form of the call as a tree.
9582 The simplified form may be a constant or other expression which
9583 computes the same value, but in a more efficient manner (including
9584 calls to other builtin functions).
9586 The call may contain arguments which need to be evaluated, but
9587 which are not useful to determine the result of the call. In
9588 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9589 COMPOUND_EXPR will be an argument which must be evaluated.
9590 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9591 COMPOUND_EXPR in the chain will contain the tree for the simplified
9592 form of the builtin function call. */
9595 fold_builtin_strrchr (tree arglist, tree type)
9597 if (!validate_arglist (arglist, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
9601 tree s1 = TREE_VALUE (arglist), s2 = TREE_VALUE (TREE_CHAIN (arglist));
9605 if (TREE_CODE (s2) != INTEGER_CST)
9615 if (target_char_cast (s2, &c))
9618 r = strrchr (p1, c);
9621 return build_int_cst (TREE_TYPE (s1), 0);
9623 /* Return an offset into the constant string argument. */
9624 tem = fold_build2 (PLUS_EXPR, TREE_TYPE (s1),
9625 s1, build_int_cst (TREE_TYPE (s1), r - p1));
9626 return fold_convert (type, tem);
9629 if (! integer_zerop (s2))
9632 fn = implicit_built_in_decls[BUILT_IN_STRCHR];
9636 /* Transform strrchr(s1, '\0') to strchr(s1, '\0'). */
9637 return build_function_call_expr (fn, arglist);
9641 /* Simplify a call to the strpbrk builtin.
9643 Return 0 if no simplification was possible, otherwise return the
9644 simplified form of the call as a tree.
9646 The simplified form may be a constant or other expression which
9647 computes the same value, but in a more efficient manner (including
9648 calls to other builtin functions).
9650 The call may contain arguments which need to be evaluated, but
9651 which are not useful to determine the result of the call. In
9652 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9653 COMPOUND_EXPR will be an argument which must be evaluated.
9654 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9655 COMPOUND_EXPR in the chain will contain the tree for the simplified
9656 form of the builtin function call. */
9659 fold_builtin_strpbrk (tree arglist, tree type)
9661 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
9665 tree s1 = TREE_VALUE (arglist), s2 = TREE_VALUE (TREE_CHAIN (arglist));
9667 const char *p1, *p2;
9676 const char *r = strpbrk (p1, p2);
9680 return build_int_cst (TREE_TYPE (s1), 0);
9682 /* Return an offset into the constant string argument. */
9683 tem = fold_build2 (PLUS_EXPR, TREE_TYPE (s1),
9684 s1, build_int_cst (TREE_TYPE (s1), r - p1));
9685 return fold_convert (type, tem);
9689 /* strpbrk(x, "") == NULL.
9690 Evaluate and ignore s1 in case it had side-effects. */
9691 return omit_one_operand (TREE_TYPE (s1), integer_zero_node, s1);
9694 return 0; /* Really call strpbrk. */
9696 fn = implicit_built_in_decls[BUILT_IN_STRCHR];
9700 /* New argument list transforming strpbrk(s1, s2) to
9701 strchr(s1, s2[0]). */
9702 arglist = build_tree_list (NULL_TREE,
9703 build_int_cst (NULL_TREE, p2[0]));
9704 arglist = tree_cons (NULL_TREE, s1, arglist);
9705 return build_function_call_expr (fn, arglist);
9709 /* Simplify a call to the strcat builtin.
9711 Return 0 if no simplification was possible, otherwise return the
9712 simplified form of the call as a tree.
9714 The simplified form may be a constant or other expression which
9715 computes the same value, but in a more efficient manner (including
9716 calls to other builtin functions).
9718 The call may contain arguments which need to be evaluated, but
9719 which are not useful to determine the result of the call. In
9720 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9721 COMPOUND_EXPR will be an argument which must be evaluated.
9722 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9723 COMPOUND_EXPR in the chain will contain the tree for the simplified
9724 form of the builtin function call. */
9727 fold_builtin_strcat (tree arglist)
9729 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
9733 tree dst = TREE_VALUE (arglist),
9734 src = TREE_VALUE (TREE_CHAIN (arglist));
9735 const char *p = c_getstr (src);
9737 /* If the string length is zero, return the dst parameter. */
9738 if (p && *p == '\0')
9745 /* Simplify a call to the strncat builtin.
9747 Return 0 if no simplification was possible, otherwise return the
9748 simplified form of the call as a tree.
9750 The simplified form may be a constant or other expression which
9751 computes the same value, but in a more efficient manner (including
9752 calls to other builtin functions).
9754 The call may contain arguments which need to be evaluated, but
9755 which are not useful to determine the result of the call. In
9756 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9757 COMPOUND_EXPR will be an argument which must be evaluated.
9758 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9759 COMPOUND_EXPR in the chain will contain the tree for the simplified
9760 form of the builtin function call. */
9763 fold_builtin_strncat (tree arglist)
9765 if (!validate_arglist (arglist,
9766 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
9770 tree dst = TREE_VALUE (arglist);
9771 tree src = TREE_VALUE (TREE_CHAIN (arglist));
9772 tree len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
9773 const char *p = c_getstr (src);
9775 /* If the requested length is zero, or the src parameter string
9776 length is zero, return the dst parameter. */
9777 if (integer_zerop (len) || (p && *p == '\0'))
9778 return omit_two_operands (TREE_TYPE (dst), dst, src, len);
9780 /* If the requested len is greater than or equal to the string
9781 length, call strcat. */
9782 if (TREE_CODE (len) == INTEGER_CST && p
9783 && compare_tree_int (len, strlen (p)) >= 0)
9786 = tree_cons (NULL_TREE, dst, build_tree_list (NULL_TREE, src));
9787 tree fn = implicit_built_in_decls[BUILT_IN_STRCAT];
9789 /* If the replacement _DECL isn't initialized, don't do the
9794 return build_function_call_expr (fn, newarglist);
9800 /* Simplify a call to the strspn builtin.
9802 Return 0 if no simplification was possible, otherwise return the
9803 simplified form of the call as a tree.
9805 The simplified form may be a constant or other expression which
9806 computes the same value, but in a more efficient manner (including
9807 calls to other builtin functions).
9809 The call may contain arguments which need to be evaluated, but
9810 which are not useful to determine the result of the call. In
9811 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9812 COMPOUND_EXPR will be an argument which must be evaluated.
9813 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9814 COMPOUND_EXPR in the chain will contain the tree for the simplified
9815 form of the builtin function call. */
9818 fold_builtin_strspn (tree arglist)
9820 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
9824 tree s1 = TREE_VALUE (arglist), s2 = TREE_VALUE (TREE_CHAIN (arglist));
9825 const char *p1 = c_getstr (s1), *p2 = c_getstr (s2);
9827 /* If both arguments are constants, evaluate at compile-time. */
9830 const size_t r = strspn (p1, p2);
9831 return size_int (r);
9834 /* If either argument is "", return 0. */
9835 if ((p1 && *p1 == '\0') || (p2 && *p2 == '\0'))
9836 /* Evaluate and ignore both arguments in case either one has
9838 return omit_two_operands (integer_type_node, integer_zero_node,
9844 /* Simplify a call to the strcspn builtin.
9846 Return 0 if no simplification was possible, otherwise return the
9847 simplified form of the call as a tree.
9849 The simplified form may be a constant or other expression which
9850 computes the same value, but in a more efficient manner (including
9851 calls to other builtin functions).
9853 The call may contain arguments which need to be evaluated, but
9854 which are not useful to determine the result of the call. In
9855 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9856 COMPOUND_EXPR will be an argument which must be evaluated.
9857 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9858 COMPOUND_EXPR in the chain will contain the tree for the simplified
9859 form of the builtin function call. */
9862 fold_builtin_strcspn (tree arglist)
9864 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
9868 tree s1 = TREE_VALUE (arglist), s2 = TREE_VALUE (TREE_CHAIN (arglist));
9869 const char *p1 = c_getstr (s1), *p2 = c_getstr (s2);
9871 /* If both arguments are constants, evaluate at compile-time. */
9874 const size_t r = strcspn (p1, p2);
9875 return size_int (r);
9878 /* If the first argument is "", return 0. */
9879 if (p1 && *p1 == '\0')
9881 /* Evaluate and ignore argument s2 in case it has
9883 return omit_one_operand (integer_type_node,
9884 integer_zero_node, s2);
9887 /* If the second argument is "", return __builtin_strlen(s1). */
9888 if (p2 && *p2 == '\0')
9890 tree newarglist = build_tree_list (NULL_TREE, s1),
9891 fn = implicit_built_in_decls[BUILT_IN_STRLEN];
9893 /* If the replacement _DECL isn't initialized, don't do the
9898 return build_function_call_expr (fn, newarglist);
9904 /* Fold a call to the fputs builtin. IGNORE is true if the value returned
9905 by the builtin will be ignored. UNLOCKED is true is true if this
9906 actually a call to fputs_unlocked. If LEN in non-NULL, it represents
9907 the known length of the string. Return NULL_TREE if no simplification
9911 fold_builtin_fputs (tree arglist, bool ignore, bool unlocked, tree len)
9914 /* If we're using an unlocked function, assume the other unlocked
9915 functions exist explicitly. */
9916 tree const fn_fputc = unlocked ? built_in_decls[BUILT_IN_FPUTC_UNLOCKED]
9917 : implicit_built_in_decls[BUILT_IN_FPUTC];
9918 tree const fn_fwrite = unlocked ? built_in_decls[BUILT_IN_FWRITE_UNLOCKED]
9919 : implicit_built_in_decls[BUILT_IN_FWRITE];
9921 /* If the return value is used, don't do the transformation. */
9925 /* Verify the arguments in the original call. */
9926 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
9930 len = c_strlen (TREE_VALUE (arglist), 0);
9932 /* Get the length of the string passed to fputs. If the length
9933 can't be determined, punt. */
9935 || TREE_CODE (len) != INTEGER_CST)
9938 switch (compare_tree_int (len, 1))
9940 case -1: /* length is 0, delete the call entirely . */
9941 return omit_one_operand (integer_type_node, integer_zero_node,
9942 TREE_VALUE (TREE_CHAIN (arglist)));
9944 case 0: /* length is 1, call fputc. */
9946 const char *p = c_getstr (TREE_VALUE (arglist));
9950 /* New argument list transforming fputs(string, stream) to
9951 fputc(string[0], stream). */
9952 arglist = build_tree_list (NULL_TREE,
9953 TREE_VALUE (TREE_CHAIN (arglist)));
9954 arglist = tree_cons (NULL_TREE,
9955 build_int_cst (NULL_TREE, p[0]),
9962 case 1: /* length is greater than 1, call fwrite. */
9966 /* If optimizing for size keep fputs. */
9969 string_arg = TREE_VALUE (arglist);
9970 /* New argument list transforming fputs(string, stream) to
9971 fwrite(string, 1, len, stream). */
9972 arglist = build_tree_list (NULL_TREE,
9973 TREE_VALUE (TREE_CHAIN (arglist)));
9974 arglist = tree_cons (NULL_TREE, len, arglist);
9975 arglist = tree_cons (NULL_TREE, size_one_node, arglist);
9976 arglist = tree_cons (NULL_TREE, string_arg, arglist);
9984 /* If the replacement _DECL isn't initialized, don't do the
9989 /* These optimizations are only performed when the result is ignored,
9990 hence there's no need to cast the result to integer_type_node. */
9991 return build_function_call_expr (fn, arglist);
9994 /* Fold the new_arg's arguments (ARGLIST). Returns true if there was an error
9995 produced. False otherwise. This is done so that we don't output the error
9996 or warning twice or three times. */
9998 fold_builtin_next_arg (tree arglist)
10000 tree fntype = TREE_TYPE (current_function_decl);
10002 if (TYPE_ARG_TYPES (fntype) == 0
10003 || (TREE_VALUE (tree_last (TYPE_ARG_TYPES (fntype)))
10004 == void_type_node))
10006 error ("%<va_start%> used in function with fixed args");
10011 /* Evidently an out of date version of <stdarg.h>; can't validate
10012 va_start's second argument, but can still work as intended. */
10013 warning (0, "%<__builtin_next_arg%> called without an argument");
10016 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
10017 when we checked the arguments and if needed issued a warning. */
10018 else if (!TREE_CHAIN (arglist)
10019 || !integer_zerop (TREE_VALUE (arglist))
10020 || !integer_zerop (TREE_VALUE (TREE_CHAIN (arglist)))
10021 || TREE_CHAIN (TREE_CHAIN (arglist)))
10023 tree last_parm = tree_last (DECL_ARGUMENTS (current_function_decl));
10024 tree arg = TREE_VALUE (arglist);
10026 if (TREE_CHAIN (arglist))
10028 error ("%<va_start%> used with too many arguments");
10032 /* Strip off all nops for the sake of the comparison. This
10033 is not quite the same as STRIP_NOPS. It does more.
10034 We must also strip off INDIRECT_EXPR for C++ reference
10036 while (TREE_CODE (arg) == NOP_EXPR
10037 || TREE_CODE (arg) == CONVERT_EXPR
10038 || TREE_CODE (arg) == NON_LVALUE_EXPR
10039 || TREE_CODE (arg) == INDIRECT_REF)
10040 arg = TREE_OPERAND (arg, 0);
10041 if (arg != last_parm)
10043 /* FIXME: Sometimes with the tree optimizers we can get the
10044 not the last argument even though the user used the last
10045 argument. We just warn and set the arg to be the last
10046 argument so that we will get wrong-code because of
10048 warning (0, "second parameter of %<va_start%> not last named argument");
10050 /* We want to verify the second parameter just once before the tree
10051 optimizers are run and then avoid keeping it in the tree,
10052 as otherwise we could warn even for correct code like:
10053 void foo (int i, ...)
10054 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
10055 TREE_VALUE (arglist) = integer_zero_node;
10056 TREE_CHAIN (arglist) = build_tree_list (NULL, integer_zero_node);
10062 /* Simplify a call to the sprintf builtin.
10064 Return 0 if no simplification was possible, otherwise return the
10065 simplified form of the call as a tree. If IGNORED is true, it means that
10066 the caller does not use the returned value of the function. */
10069 fold_builtin_sprintf (tree arglist, int ignored)
10071 tree call, retval, dest, fmt;
10072 const char *fmt_str = NULL;
10074 /* Verify the required arguments in the original call. We deal with two
10075 types of sprintf() calls: 'sprintf (str, fmt)' and
10076 'sprintf (dest, "%s", orig)'. */
10077 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE)
10078 && !validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, POINTER_TYPE,
10082 /* Get the destination string and the format specifier. */
10083 dest = TREE_VALUE (arglist);
10084 fmt = TREE_VALUE (TREE_CHAIN (arglist));
10086 /* Check whether the format is a literal string constant. */
10087 fmt_str = c_getstr (fmt);
10088 if (fmt_str == NULL)
10092 retval = NULL_TREE;
10094 if (!init_target_chars())
10097 /* If the format doesn't contain % args or %%, use strcpy. */
10098 if (strchr (fmt_str, target_percent) == NULL)
10100 tree fn = implicit_built_in_decls[BUILT_IN_STRCPY];
10105 /* Convert sprintf (str, fmt) into strcpy (str, fmt) when
10106 'format' is known to contain no % formats. */
10107 arglist = build_tree_list (NULL_TREE, fmt);
10108 arglist = tree_cons (NULL_TREE, dest, arglist);
10109 call = build_function_call_expr (fn, arglist);
10111 retval = build_int_cst (NULL_TREE, strlen (fmt_str));
10114 /* If the format is "%s", use strcpy if the result isn't used. */
10115 else if (fmt_str && strcmp (fmt_str, target_percent_s) == 0)
10118 fn = implicit_built_in_decls[BUILT_IN_STRCPY];
10123 /* Convert sprintf (str1, "%s", str2) into strcpy (str1, str2). */
10124 orig = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
10125 arglist = build_tree_list (NULL_TREE, orig);
10126 arglist = tree_cons (NULL_TREE, dest, arglist);
10129 retval = c_strlen (orig, 1);
10130 if (!retval || TREE_CODE (retval) != INTEGER_CST)
10133 call = build_function_call_expr (fn, arglist);
10136 if (call && retval)
10138 retval = fold_convert
10139 (TREE_TYPE (TREE_TYPE (implicit_built_in_decls[BUILT_IN_SPRINTF])),
10141 return build2 (COMPOUND_EXPR, TREE_TYPE (retval), call, retval);
10147 /* Expand a call to __builtin_object_size. */
10150 expand_builtin_object_size (tree exp)
10153 int object_size_type;
10154 tree fndecl = get_callee_fndecl (exp);
10155 tree arglist = TREE_OPERAND (exp, 1);
10156 location_t locus = EXPR_LOCATION (exp);
10158 if (!validate_arglist (arglist, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
10160 error ("%Hfirst argument of %D must be a pointer, second integer constant",
10162 expand_builtin_trap ();
10166 ost = TREE_VALUE (TREE_CHAIN (arglist));
10169 if (TREE_CODE (ost) != INTEGER_CST
10170 || tree_int_cst_sgn (ost) < 0
10171 || compare_tree_int (ost, 3) > 0)
10173 error ("%Hlast argument of %D is not integer constant between 0 and 3",
10175 expand_builtin_trap ();
10179 object_size_type = tree_low_cst (ost, 0);
10181 return object_size_type < 2 ? constm1_rtx : const0_rtx;
10184 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
10185 FCODE is the BUILT_IN_* to use.
10186 Return 0 if we failed; the caller should emit a normal call,
10187 otherwise try to get the result in TARGET, if convenient (and in
10188 mode MODE if that's convenient). */
10191 expand_builtin_memory_chk (tree exp, rtx target, enum machine_mode mode,
10192 enum built_in_function fcode)
10194 tree arglist = TREE_OPERAND (exp, 1);
10195 tree dest, src, len, size;
10197 if (!validate_arglist (arglist,
10199 fcode == BUILT_IN_MEMSET_CHK
10200 ? INTEGER_TYPE : POINTER_TYPE,
10201 INTEGER_TYPE, INTEGER_TYPE, VOID_TYPE))
10204 dest = TREE_VALUE (arglist);
10205 src = TREE_VALUE (TREE_CHAIN (arglist));
10206 len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
10207 size = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (TREE_CHAIN (arglist))));
10209 if (! host_integerp (size, 1))
10212 if (host_integerp (len, 1) || integer_all_onesp (size))
10216 if (! integer_all_onesp (size) && tree_int_cst_lt (size, len))
10218 location_t locus = EXPR_LOCATION (exp);
10219 warning (0, "%Hcall to %D will always overflow destination buffer",
10220 &locus, get_callee_fndecl (exp));
10224 arglist = build_tree_list (NULL_TREE, len);
10225 arglist = tree_cons (NULL_TREE, src, arglist);
10226 arglist = tree_cons (NULL_TREE, dest, arglist);
10229 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
10230 mem{cpy,pcpy,move,set} is available. */
10233 case BUILT_IN_MEMCPY_CHK:
10234 fn = built_in_decls[BUILT_IN_MEMCPY];
10236 case BUILT_IN_MEMPCPY_CHK:
10237 fn = built_in_decls[BUILT_IN_MEMPCPY];
10239 case BUILT_IN_MEMMOVE_CHK:
10240 fn = built_in_decls[BUILT_IN_MEMMOVE];
10242 case BUILT_IN_MEMSET_CHK:
10243 fn = built_in_decls[BUILT_IN_MEMSET];
10252 fn = build_function_call_expr (fn, arglist);
10253 if (TREE_CODE (fn) == CALL_EXPR)
10254 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
10255 return expand_expr (fn, target, mode, EXPAND_NORMAL);
10257 else if (fcode == BUILT_IN_MEMSET_CHK)
10261 unsigned int dest_align
10262 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
10264 /* If DEST is not a pointer type, call the normal function. */
10265 if (dest_align == 0)
10268 /* If SRC and DEST are the same (and not volatile), do nothing. */
10269 if (operand_equal_p (src, dest, 0))
10273 if (fcode != BUILT_IN_MEMPCPY_CHK)
10275 /* Evaluate and ignore LEN in case it has side-effects. */
10276 expand_expr (len, const0_rtx, VOIDmode, EXPAND_NORMAL);
10277 return expand_expr (dest, target, mode, EXPAND_NORMAL);
10280 len = fold_convert (TREE_TYPE (dest), len);
10281 expr = fold_build2 (PLUS_EXPR, TREE_TYPE (dest), dest, len);
10282 return expand_expr (expr, target, mode, EXPAND_NORMAL);
10285 /* __memmove_chk special case. */
10286 if (fcode == BUILT_IN_MEMMOVE_CHK)
10288 unsigned int src_align
10289 = get_pointer_alignment (src, BIGGEST_ALIGNMENT);
10291 if (src_align == 0)
10294 /* If src is categorized for a readonly section we can use
10295 normal __memcpy_chk. */
10296 if (readonly_data_expr (src))
10298 tree fn = built_in_decls[BUILT_IN_MEMCPY_CHK];
10301 fn = build_function_call_expr (fn, arglist);
10302 if (TREE_CODE (fn) == CALL_EXPR)
10303 CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
10304 return expand_expr (fn, target, mode, EXPAND_NORMAL);
10311 /* Emit warning if a buffer overflow is detected at compile time. */
10314 maybe_emit_chk_warning (tree exp, enum built_in_function fcode)
10316 int arg_mask, is_strlen = 0;
10317 tree arglist = TREE_OPERAND (exp, 1), a;
10323 case BUILT_IN_STRCPY_CHK:
10324 case BUILT_IN_STPCPY_CHK:
10325 /* For __strcat_chk the warning will be emitted only if overflowing
10326 by at least strlen (dest) + 1 bytes. */
10327 case BUILT_IN_STRCAT_CHK:
10331 case BUILT_IN_STRNCAT_CHK:
10332 /* For __strncat_chk the warning will be emitted only if overflowing
10333 by at least strlen (dest) + 1 bytes. */
10336 case BUILT_IN_STRNCPY_CHK:
10339 case BUILT_IN_SNPRINTF_CHK:
10340 case BUILT_IN_VSNPRINTF_CHK:
10344 gcc_unreachable ();
10349 for (a = arglist; a && arg_mask; a = TREE_CHAIN (a), arg_mask >>= 1)
10361 len = TREE_VALUE (len);
10362 size = TREE_VALUE (size);
10364 if (! host_integerp (size, 1) || integer_all_onesp (size))
10369 len = c_strlen (len, 1);
10370 if (! len || ! host_integerp (len, 1) || tree_int_cst_lt (len, size))
10373 else if (fcode == BUILT_IN_STRNCAT_CHK)
10375 tree src = TREE_VALUE (TREE_CHAIN (arglist));
10376 if (! src || ! host_integerp (len, 1) || tree_int_cst_lt (len, size))
10378 src = c_strlen (src, 1);
10379 if (! src || ! host_integerp (src, 1))
10381 locus = EXPR_LOCATION (exp);
10382 warning (0, "%Hcall to %D might overflow destination buffer",
10383 &locus, get_callee_fndecl (exp));
10386 else if (tree_int_cst_lt (src, size))
10389 else if (! host_integerp (len, 1) || ! tree_int_cst_lt (size, len))
10392 locus = EXPR_LOCATION (exp);
10393 warning (0, "%Hcall to %D will always overflow destination buffer",
10394 &locus, get_callee_fndecl (exp));
10397 /* Emit warning if a buffer overflow is detected at compile time
10398 in __sprintf_chk/__vsprintf_chk calls. */
10401 maybe_emit_sprintf_chk_warning (tree exp, enum built_in_function fcode)
10403 tree arglist = TREE_OPERAND (exp, 1);
10404 tree dest, size, len, fmt, flag;
10405 const char *fmt_str;
10407 /* Verify the required arguments in the original call. */
10410 dest = TREE_VALUE (arglist);
10411 arglist = TREE_CHAIN (arglist);
10414 flag = TREE_VALUE (arglist);
10415 arglist = TREE_CHAIN (arglist);
10418 size = TREE_VALUE (arglist);
10419 arglist = TREE_CHAIN (arglist);
10422 fmt = TREE_VALUE (arglist);
10423 arglist = TREE_CHAIN (arglist);
10425 if (! host_integerp (size, 1) || integer_all_onesp (size))
10428 /* Check whether the format is a literal string constant. */
10429 fmt_str = c_getstr (fmt);
10430 if (fmt_str == NULL)
10433 if (!init_target_chars())
10436 /* If the format doesn't contain % args or %%, we know its size. */
10437 if (strchr (fmt_str, target_percent) == 0)
10438 len = build_int_cstu (size_type_node, strlen (fmt_str));
10439 /* If the format is "%s" and first ... argument is a string literal,
10441 else if (fcode == BUILT_IN_SPRINTF_CHK && strcmp (fmt_str, target_percent_s) == 0)
10447 arg = TREE_VALUE (arglist);
10448 if (! POINTER_TYPE_P (TREE_TYPE (arg)))
10451 len = c_strlen (arg, 1);
10452 if (!len || ! host_integerp (len, 1))
10458 if (! tree_int_cst_lt (len, size))
10460 location_t locus = EXPR_LOCATION (exp);
10461 warning (0, "%Hcall to %D will always overflow destination buffer",
10462 &locus, get_callee_fndecl (exp));
10466 /* Fold a call to __builtin_object_size, if possible. */
10469 fold_builtin_object_size (tree arglist)
10471 tree ptr, ost, ret = 0;
10472 int object_size_type;
10474 if (!validate_arglist (arglist, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
10477 ptr = TREE_VALUE (arglist);
10478 ost = TREE_VALUE (TREE_CHAIN (arglist));
10481 if (TREE_CODE (ost) != INTEGER_CST
10482 || tree_int_cst_sgn (ost) < 0
10483 || compare_tree_int (ost, 3) > 0)
10486 object_size_type = tree_low_cst (ost, 0);
10488 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
10489 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
10490 and (size_t) 0 for types 2 and 3. */
10491 if (TREE_SIDE_EFFECTS (ptr))
10492 return fold_convert (size_type_node,
10493 object_size_type < 2
10494 ? integer_minus_one_node : integer_zero_node);
10496 if (TREE_CODE (ptr) == ADDR_EXPR)
10497 ret = build_int_cstu (size_type_node,
10498 compute_builtin_object_size (ptr, object_size_type));
10500 else if (TREE_CODE (ptr) == SSA_NAME)
10502 unsigned HOST_WIDE_INT bytes;
10504 /* If object size is not known yet, delay folding until
10505 later. Maybe subsequent passes will help determining
10507 bytes = compute_builtin_object_size (ptr, object_size_type);
10508 if (bytes != (unsigned HOST_WIDE_INT) (object_size_type < 2
10510 ret = build_int_cstu (size_type_node, bytes);
10515 ret = force_fit_type (ret, -1, false, false);
10516 if (TREE_CONSTANT_OVERFLOW (ret))
10523 /* Fold a call to the __mem{cpy,pcpy,move,set}_chk builtin.
10524 IGNORE is true, if return value can be ignored. FCODE is the BUILT_IN_*
10525 code of the builtin. If MAXLEN is not NULL, it is maximum length
10526 passed as third argument. */
10529 fold_builtin_memory_chk (tree fndecl, tree arglist, tree maxlen, bool ignore,
10530 enum built_in_function fcode)
10532 tree dest, src, len, size, fn;
10534 if (!validate_arglist (arglist,
10536 fcode == BUILT_IN_MEMSET_CHK
10537 ? INTEGER_TYPE : POINTER_TYPE,
10538 INTEGER_TYPE, INTEGER_TYPE, VOID_TYPE))
10541 dest = TREE_VALUE (arglist);
10542 /* Actually val for __memset_chk, but it doesn't matter. */
10543 src = TREE_VALUE (TREE_CHAIN (arglist));
10544 len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
10545 size = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (TREE_CHAIN (arglist))));
10547 /* If SRC and DEST are the same (and not volatile), return DEST
10548 (resp. DEST+LEN for __mempcpy_chk). */
10549 if (fcode != BUILT_IN_MEMSET_CHK && operand_equal_p (src, dest, 0))
10551 if (fcode != BUILT_IN_MEMPCPY_CHK)
10552 return omit_one_operand (TREE_TYPE (TREE_TYPE (fndecl)), dest, len);
10555 tree temp = fold_convert (TREE_TYPE (dest), len);
10556 temp = fold_build2 (PLUS_EXPR, TREE_TYPE (dest), dest, temp);
10557 return fold_convert (TREE_TYPE (TREE_TYPE (fndecl)), temp);
10561 if (! host_integerp (size, 1))
10564 if (! integer_all_onesp (size))
10566 if (! host_integerp (len, 1))
10568 /* If LEN is not constant, try MAXLEN too.
10569 For MAXLEN only allow optimizing into non-_ocs function
10570 if SIZE is >= MAXLEN, never convert to __ocs_fail (). */
10571 if (maxlen == NULL_TREE || ! host_integerp (maxlen, 1))
10573 if (fcode == BUILT_IN_MEMPCPY_CHK && ignore)
10575 /* (void) __mempcpy_chk () can be optimized into
10576 (void) __memcpy_chk (). */
10577 fn = built_in_decls[BUILT_IN_MEMCPY_CHK];
10581 return build_function_call_expr (fn, arglist);
10589 if (tree_int_cst_lt (size, maxlen))
10593 arglist = build_tree_list (NULL_TREE, len);
10594 arglist = tree_cons (NULL_TREE, src, arglist);
10595 arglist = tree_cons (NULL_TREE, dest, arglist);
10598 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
10599 mem{cpy,pcpy,move,set} is available. */
10602 case BUILT_IN_MEMCPY_CHK:
10603 fn = built_in_decls[BUILT_IN_MEMCPY];
10605 case BUILT_IN_MEMPCPY_CHK:
10606 fn = built_in_decls[BUILT_IN_MEMPCPY];
10608 case BUILT_IN_MEMMOVE_CHK:
10609 fn = built_in_decls[BUILT_IN_MEMMOVE];
10611 case BUILT_IN_MEMSET_CHK:
10612 fn = built_in_decls[BUILT_IN_MEMSET];
10621 return build_function_call_expr (fn, arglist);
10624 /* Fold a call to the __st[rp]cpy_chk builtin.
10625 IGNORE is true, if return value can be ignored. FCODE is the BUILT_IN_*
10626 code of the builtin. If MAXLEN is not NULL, it is maximum length of
10627 strings passed as second argument. */
10630 fold_builtin_stxcpy_chk (tree fndecl, tree arglist, tree maxlen, bool ignore,
10631 enum built_in_function fcode)
10633 tree dest, src, size, len, fn;
10635 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE,
10639 dest = TREE_VALUE (arglist);
10640 src = TREE_VALUE (TREE_CHAIN (arglist));
10641 size = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
10643 /* If SRC and DEST are the same (and not volatile), return DEST. */
10644 if (fcode == BUILT_IN_STRCPY_CHK && operand_equal_p (src, dest, 0))
10645 return fold_convert (TREE_TYPE (TREE_TYPE (fndecl)), dest);
10647 if (! host_integerp (size, 1))
10650 if (! integer_all_onesp (size))
10652 len = c_strlen (src, 1);
10653 if (! len || ! host_integerp (len, 1))
10655 /* If LEN is not constant, try MAXLEN too.
10656 For MAXLEN only allow optimizing into non-_ocs function
10657 if SIZE is >= MAXLEN, never convert to __ocs_fail (). */
10658 if (maxlen == NULL_TREE || ! host_integerp (maxlen, 1))
10660 if (fcode == BUILT_IN_STPCPY_CHK)
10665 /* If return value of __stpcpy_chk is ignored,
10666 optimize into __strcpy_chk. */
10667 fn = built_in_decls[BUILT_IN_STRCPY_CHK];
10671 return build_function_call_expr (fn, arglist);
10674 if (! len || TREE_SIDE_EFFECTS (len))
10677 /* If c_strlen returned something, but not a constant,
10678 transform __strcpy_chk into __memcpy_chk. */
10679 fn = built_in_decls[BUILT_IN_MEMCPY_CHK];
10683 len = size_binop (PLUS_EXPR, len, ssize_int (1));
10684 arglist = build_tree_list (NULL_TREE, size);
10685 arglist = tree_cons (NULL_TREE, len, arglist);
10686 arglist = tree_cons (NULL_TREE, src, arglist);
10687 arglist = tree_cons (NULL_TREE, dest, arglist);
10688 return fold_convert (TREE_TYPE (TREE_TYPE (fndecl)),
10689 build_function_call_expr (fn, arglist));
10695 if (! tree_int_cst_lt (maxlen, size))
10699 arglist = build_tree_list (NULL_TREE, src);
10700 arglist = tree_cons (NULL_TREE, dest, arglist);
10702 /* If __builtin_st{r,p}cpy_chk is used, assume st{r,p}cpy is available. */
10703 fn = built_in_decls[fcode == BUILT_IN_STPCPY_CHK
10704 ? BUILT_IN_STPCPY : BUILT_IN_STRCPY];
10708 return build_function_call_expr (fn, arglist);
10711 /* Fold a call to the __strncpy_chk builtin.
10712 If MAXLEN is not NULL, it is maximum length passed as third argument. */
10715 fold_builtin_strncpy_chk (tree arglist, tree maxlen)
10717 tree dest, src, size, len, fn;
10719 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE,
10720 INTEGER_TYPE, VOID_TYPE))
10723 dest = TREE_VALUE (arglist);
10724 src = TREE_VALUE (TREE_CHAIN (arglist));
10725 len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
10726 size = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (TREE_CHAIN (arglist))));
10728 if (! host_integerp (size, 1))
10731 if (! integer_all_onesp (size))
10733 if (! host_integerp (len, 1))
10735 /* If LEN is not constant, try MAXLEN too.
10736 For MAXLEN only allow optimizing into non-_ocs function
10737 if SIZE is >= MAXLEN, never convert to __ocs_fail (). */
10738 if (maxlen == NULL_TREE || ! host_integerp (maxlen, 1))
10744 if (tree_int_cst_lt (size, maxlen))
10748 arglist = build_tree_list (NULL_TREE, len);
10749 arglist = tree_cons (NULL_TREE, src, arglist);
10750 arglist = tree_cons (NULL_TREE, dest, arglist);
10752 /* If __builtin_strncpy_chk is used, assume strncpy is available. */
10753 fn = built_in_decls[BUILT_IN_STRNCPY];
10757 return build_function_call_expr (fn, arglist);
10760 /* Fold a call to the __strcat_chk builtin FNDECL with ARGLIST. */
10763 fold_builtin_strcat_chk (tree fndecl, tree arglist)
10765 tree dest, src, size, fn;
10768 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE,
10772 dest = TREE_VALUE (arglist);
10773 src = TREE_VALUE (TREE_CHAIN (arglist));
10774 size = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
10776 p = c_getstr (src);
10777 /* If the SRC parameter is "", return DEST. */
10778 if (p && *p == '\0')
10779 return omit_one_operand (TREE_TYPE (TREE_TYPE (fndecl)), dest, src);
10781 if (! host_integerp (size, 1) || ! integer_all_onesp (size))
10784 arglist = build_tree_list (NULL_TREE, src);
10785 arglist = tree_cons (NULL_TREE, dest, arglist);
10787 /* If __builtin_strcat_chk is used, assume strcat is available. */
10788 fn = built_in_decls[BUILT_IN_STRCAT];
10792 return build_function_call_expr (fn, arglist);
10795 /* Fold a call to the __strncat_chk builtin EXP. */
10798 fold_builtin_strncat_chk (tree fndecl, tree arglist)
10800 tree dest, src, size, len, fn;
10803 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE,
10804 INTEGER_TYPE, VOID_TYPE))
10807 dest = TREE_VALUE (arglist);
10808 src = TREE_VALUE (TREE_CHAIN (arglist));
10809 len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
10810 size = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (TREE_CHAIN (arglist))));
10812 p = c_getstr (src);
10813 /* If the SRC parameter is "" or if LEN is 0, return DEST. */
10814 if (p && *p == '\0')
10815 return omit_one_operand (TREE_TYPE (TREE_TYPE (fndecl)), dest, len);
10816 else if (integer_zerop (len))
10817 return omit_one_operand (TREE_TYPE (TREE_TYPE (fndecl)), dest, src);
10819 if (! host_integerp (size, 1))
10822 if (! integer_all_onesp (size))
10824 tree src_len = c_strlen (src, 1);
10826 && host_integerp (src_len, 1)
10827 && host_integerp (len, 1)
10828 && ! tree_int_cst_lt (len, src_len))
10830 /* If LEN >= strlen (SRC), optimize into __strcat_chk. */
10831 fn = built_in_decls[BUILT_IN_STRCAT_CHK];
10835 arglist = build_tree_list (NULL_TREE, size);
10836 arglist = tree_cons (NULL_TREE, src, arglist);
10837 arglist = tree_cons (NULL_TREE, dest, arglist);
10838 return build_function_call_expr (fn, arglist);
10843 arglist = build_tree_list (NULL_TREE, len);
10844 arglist = tree_cons (NULL_TREE, src, arglist);
10845 arglist = tree_cons (NULL_TREE, dest, arglist);
10847 /* If __builtin_strncat_chk is used, assume strncat is available. */
10848 fn = built_in_decls[BUILT_IN_STRNCAT];
10852 return build_function_call_expr (fn, arglist);
10855 /* Fold a call to __{,v}sprintf_chk with argument list ARGLIST. Return 0 if
10856 a normal call should be emitted rather than expanding the function
10857 inline. FCODE is either BUILT_IN_SPRINTF_CHK or BUILT_IN_VSPRINTF_CHK. */
10860 fold_builtin_sprintf_chk (tree arglist, enum built_in_function fcode)
10862 tree dest, size, len, fn, fmt, flag;
10863 const char *fmt_str;
10865 /* Verify the required arguments in the original call. */
10868 dest = TREE_VALUE (arglist);
10869 if (! POINTER_TYPE_P (TREE_TYPE (dest)))
10871 arglist = TREE_CHAIN (arglist);
10874 flag = TREE_VALUE (arglist);
10875 if (TREE_CODE (TREE_TYPE (flag)) != INTEGER_TYPE)
10877 arglist = TREE_CHAIN (arglist);
10880 size = TREE_VALUE (arglist);
10881 if (TREE_CODE (TREE_TYPE (size)) != INTEGER_TYPE)
10883 arglist = TREE_CHAIN (arglist);
10886 fmt = TREE_VALUE (arglist);
10887 if (! POINTER_TYPE_P (TREE_TYPE (fmt)))
10889 arglist = TREE_CHAIN (arglist);
10891 if (! host_integerp (size, 1))
10896 if (!init_target_chars())
10899 /* Check whether the format is a literal string constant. */
10900 fmt_str = c_getstr (fmt);
10901 if (fmt_str != NULL)
10903 /* If the format doesn't contain % args or %%, we know the size. */
10904 if (strchr (fmt_str, target_percent) == 0)
10906 if (fcode != BUILT_IN_SPRINTF_CHK || arglist == NULL_TREE)
10907 len = build_int_cstu (size_type_node, strlen (fmt_str));
10909 /* If the format is "%s" and first ... argument is a string literal,
10910 we know the size too. */
10911 else if (fcode == BUILT_IN_SPRINTF_CHK && strcmp (fmt_str, target_percent_s) == 0)
10915 if (arglist && !TREE_CHAIN (arglist))
10917 arg = TREE_VALUE (arglist);
10918 if (POINTER_TYPE_P (TREE_TYPE (arg)))
10920 len = c_strlen (arg, 1);
10921 if (! len || ! host_integerp (len, 1))
10928 if (! integer_all_onesp (size))
10930 if (! len || ! tree_int_cst_lt (len, size))
10934 /* Only convert __{,v}sprintf_chk to {,v}sprintf if flag is 0
10935 or if format doesn't contain % chars or is "%s". */
10936 if (! integer_zerop (flag))
10938 if (fmt_str == NULL)
10940 if (strchr (fmt_str, target_percent) != NULL && strcmp (fmt_str, target_percent_s))
10944 arglist = tree_cons (NULL_TREE, fmt, arglist);
10945 arglist = tree_cons (NULL_TREE, dest, arglist);
10947 /* If __builtin_{,v}sprintf_chk is used, assume {,v}sprintf is available. */
10948 fn = built_in_decls[fcode == BUILT_IN_VSPRINTF_CHK
10949 ? BUILT_IN_VSPRINTF : BUILT_IN_SPRINTF];
10953 return build_function_call_expr (fn, arglist);
10956 /* Fold a call to {,v}snprintf with argument list ARGLIST. Return 0 if
10957 a normal call should be emitted rather than expanding the function
10958 inline. FCODE is either BUILT_IN_SNPRINTF_CHK or
10959 BUILT_IN_VSNPRINTF_CHK. If MAXLEN is not NULL, it is maximum length
10960 passed as second argument. */
10963 fold_builtin_snprintf_chk (tree arglist, tree maxlen,
10964 enum built_in_function fcode)
10966 tree dest, size, len, fn, fmt, flag;
10967 const char *fmt_str;
10969 /* Verify the required arguments in the original call. */
10972 dest = TREE_VALUE (arglist);
10973 if (! POINTER_TYPE_P (TREE_TYPE (dest)))
10975 arglist = TREE_CHAIN (arglist);
10978 len = TREE_VALUE (arglist);
10979 if (TREE_CODE (TREE_TYPE (len)) != INTEGER_TYPE)
10981 arglist = TREE_CHAIN (arglist);
10984 flag = TREE_VALUE (arglist);
10985 if (TREE_CODE (TREE_TYPE (len)) != INTEGER_TYPE)
10987 arglist = TREE_CHAIN (arglist);
10990 size = TREE_VALUE (arglist);
10991 if (TREE_CODE (TREE_TYPE (size)) != INTEGER_TYPE)
10993 arglist = TREE_CHAIN (arglist);
10996 fmt = TREE_VALUE (arglist);
10997 if (! POINTER_TYPE_P (TREE_TYPE (fmt)))
10999 arglist = TREE_CHAIN (arglist);
11001 if (! host_integerp (size, 1))
11004 if (! integer_all_onesp (size))
11006 if (! host_integerp (len, 1))
11008 /* If LEN is not constant, try MAXLEN too.
11009 For MAXLEN only allow optimizing into non-_ocs function
11010 if SIZE is >= MAXLEN, never convert to __ocs_fail (). */
11011 if (maxlen == NULL_TREE || ! host_integerp (maxlen, 1))
11017 if (tree_int_cst_lt (size, maxlen))
11021 if (!init_target_chars())
11024 /* Only convert __{,v}snprintf_chk to {,v}snprintf if flag is 0
11025 or if format doesn't contain % chars or is "%s". */
11026 if (! integer_zerop (flag))
11028 fmt_str = c_getstr (fmt);
11029 if (fmt_str == NULL)
11031 if (strchr (fmt_str, target_percent) != NULL && strcmp (fmt_str, target_percent_s))
11035 arglist = tree_cons (NULL_TREE, fmt, arglist);
11036 arglist = tree_cons (NULL_TREE, len, arglist);
11037 arglist = tree_cons (NULL_TREE, dest, arglist);
11039 /* If __builtin_{,v}snprintf_chk is used, assume {,v}snprintf is
11041 fn = built_in_decls[fcode == BUILT_IN_VSNPRINTF_CHK
11042 ? BUILT_IN_VSNPRINTF : BUILT_IN_SNPRINTF];
11046 return build_function_call_expr (fn, arglist);
11049 /* Fold a call to the {,v}printf{,_unlocked} and __{,v}printf_chk builtins.
11051 Return 0 if no simplification was possible, otherwise return the
11052 simplified form of the call as a tree. FCODE is the BUILT_IN_*
11053 code of the function to be simplified. */
11056 fold_builtin_printf (tree fndecl, tree arglist, bool ignore,
11057 enum built_in_function fcode)
11059 tree fmt, fn = NULL_TREE, fn_putchar, fn_puts, arg, call;
11060 const char *fmt_str = NULL;
11062 /* If the return value is used, don't do the transformation. */
11066 /* Verify the required arguments in the original call. */
11067 if (fcode == BUILT_IN_PRINTF_CHK || fcode == BUILT_IN_VPRINTF_CHK)
11073 flag = TREE_VALUE (arglist);
11074 if (TREE_CODE (TREE_TYPE (flag)) != INTEGER_TYPE
11075 || TREE_SIDE_EFFECTS (flag))
11077 arglist = TREE_CHAIN (arglist);
11082 fmt = TREE_VALUE (arglist);
11083 if (! POINTER_TYPE_P (TREE_TYPE (fmt)))
11085 arglist = TREE_CHAIN (arglist);
11087 /* Check whether the format is a literal string constant. */
11088 fmt_str = c_getstr (fmt);
11089 if (fmt_str == NULL)
11092 if (fcode == BUILT_IN_PRINTF_UNLOCKED)
11094 /* If we're using an unlocked function, assume the other
11095 unlocked functions exist explicitly. */
11096 fn_putchar = built_in_decls[BUILT_IN_PUTCHAR_UNLOCKED];
11097 fn_puts = built_in_decls[BUILT_IN_PUTS_UNLOCKED];
11101 fn_putchar = implicit_built_in_decls[BUILT_IN_PUTCHAR];
11102 fn_puts = implicit_built_in_decls[BUILT_IN_PUTS];
11105 if (!init_target_chars())
11108 if (strcmp (fmt_str, target_percent_s) == 0 || strchr (fmt_str, target_percent) == NULL)
11112 if (strcmp (fmt_str, target_percent_s) == 0)
11114 if (fcode == BUILT_IN_VPRINTF || fcode == BUILT_IN_VPRINTF_CHK)
11118 || ! POINTER_TYPE_P (TREE_TYPE (TREE_VALUE (arglist)))
11119 || TREE_CHAIN (arglist))
11122 str = c_getstr (TREE_VALUE (arglist));
11128 /* The format specifier doesn't contain any '%' characters. */
11129 if (fcode != BUILT_IN_VPRINTF && fcode != BUILT_IN_VPRINTF_CHK
11135 /* If the string was "", printf does nothing. */
11136 if (str[0] == '\0')
11137 return build_int_cst (TREE_TYPE (TREE_TYPE (fndecl)), 0);
11139 /* If the string has length of 1, call putchar. */
11140 if (str[1] == '\0')
11142 /* Given printf("c"), (where c is any one character,)
11143 convert "c"[0] to an int and pass that to the replacement
11145 arg = build_int_cst (NULL_TREE, str[0]);
11146 arglist = build_tree_list (NULL_TREE, arg);
11151 /* If the string was "string\n", call puts("string"). */
11152 size_t len = strlen (str);
11153 if ((unsigned char)str[len - 1] == target_newline)
11155 /* Create a NUL-terminated string that's one char shorter
11156 than the original, stripping off the trailing '\n'. */
11157 char *newstr = alloca (len);
11158 memcpy (newstr, str, len - 1);
11159 newstr[len - 1] = 0;
11161 arg = build_string_literal (len, newstr);
11162 arglist = build_tree_list (NULL_TREE, arg);
11166 /* We'd like to arrange to call fputs(string,stdout) here,
11167 but we need stdout and don't have a way to get it yet. */
11172 /* The other optimizations can be done only on the non-va_list variants. */
11173 else if (fcode == BUILT_IN_VPRINTF || fcode == BUILT_IN_VPRINTF_CHK)
11176 /* If the format specifier was "%s\n", call __builtin_puts(arg). */
11177 else if (strcmp (fmt_str, target_percent_s_newline) == 0)
11180 || ! POINTER_TYPE_P (TREE_TYPE (TREE_VALUE (arglist)))
11181 || TREE_CHAIN (arglist))
11186 /* If the format specifier was "%c", call __builtin_putchar(arg). */
11187 else if (strcmp (fmt_str, target_percent_c) == 0)
11190 || TREE_CODE (TREE_TYPE (TREE_VALUE (arglist))) != INTEGER_TYPE
11191 || TREE_CHAIN (arglist))
11199 call = build_function_call_expr (fn, arglist);
11200 return fold_convert (TREE_TYPE (TREE_TYPE (fndecl)), call);
11203 /* Fold a call to the {,v}fprintf{,_unlocked} and __{,v}printf_chk builtins.
11205 Return 0 if no simplification was possible, otherwise return the
11206 simplified form of the call as a tree. FCODE is the BUILT_IN_*
11207 code of the function to be simplified. */
11210 fold_builtin_fprintf (tree fndecl, tree arglist, bool ignore,
11211 enum built_in_function fcode)
11213 tree fp, fmt, fn = NULL_TREE, fn_fputc, fn_fputs, arg, call;
11214 const char *fmt_str = NULL;
11216 /* If the return value is used, don't do the transformation. */
11220 /* Verify the required arguments in the original call. */
11223 fp = TREE_VALUE (arglist);
11224 if (! POINTER_TYPE_P (TREE_TYPE (fp)))
11226 arglist = TREE_CHAIN (arglist);
11228 if (fcode == BUILT_IN_FPRINTF_CHK || fcode == BUILT_IN_VFPRINTF_CHK)
11234 flag = TREE_VALUE (arglist);
11235 if (TREE_CODE (TREE_TYPE (flag)) != INTEGER_TYPE
11236 || TREE_SIDE_EFFECTS (flag))
11238 arglist = TREE_CHAIN (arglist);
11243 fmt = TREE_VALUE (arglist);
11244 if (! POINTER_TYPE_P (TREE_TYPE (fmt)))
11246 arglist = TREE_CHAIN (arglist);
11248 /* Check whether the format is a literal string constant. */
11249 fmt_str = c_getstr (fmt);
11250 if (fmt_str == NULL)
11253 if (fcode == BUILT_IN_FPRINTF_UNLOCKED)
11255 /* If we're using an unlocked function, assume the other
11256 unlocked functions exist explicitly. */
11257 fn_fputc = built_in_decls[BUILT_IN_FPUTC_UNLOCKED];
11258 fn_fputs = built_in_decls[BUILT_IN_FPUTS_UNLOCKED];
11262 fn_fputc = implicit_built_in_decls[BUILT_IN_FPUTC];
11263 fn_fputs = implicit_built_in_decls[BUILT_IN_FPUTS];
11266 if (!init_target_chars())
11269 /* If the format doesn't contain % args or %%, use strcpy. */
11270 if (strchr (fmt_str, target_percent) == NULL)
11272 if (fcode != BUILT_IN_VFPRINTF && fcode != BUILT_IN_VFPRINTF_CHK
11276 /* If the format specifier was "", fprintf does nothing. */
11277 if (fmt_str[0] == '\0')
11279 /* If FP has side-effects, just wait until gimplification is
11281 if (TREE_SIDE_EFFECTS (fp))
11284 return build_int_cst (TREE_TYPE (TREE_TYPE (fndecl)), 0);
11287 /* When "string" doesn't contain %, replace all cases of
11288 fprintf (fp, string) with fputs (string, fp). The fputs
11289 builtin will take care of special cases like length == 1. */
11290 arglist = build_tree_list (NULL_TREE, fp);
11291 arglist = tree_cons (NULL_TREE, fmt, arglist);
11295 /* The other optimizations can be done only on the non-va_list variants. */
11296 else if (fcode == BUILT_IN_VFPRINTF || fcode == BUILT_IN_VFPRINTF_CHK)
11299 /* If the format specifier was "%s", call __builtin_fputs (arg, fp). */
11300 else if (strcmp (fmt_str, target_percent_s) == 0)
11303 || ! POINTER_TYPE_P (TREE_TYPE (TREE_VALUE (arglist)))
11304 || TREE_CHAIN (arglist))
11306 arg = TREE_VALUE (arglist);
11307 arglist = build_tree_list (NULL_TREE, fp);
11308 arglist = tree_cons (NULL_TREE, arg, arglist);
11312 /* If the format specifier was "%c", call __builtin_fputc (arg, fp). */
11313 else if (strcmp (fmt_str, target_percent_c) == 0)
11316 || TREE_CODE (TREE_TYPE (TREE_VALUE (arglist))) != INTEGER_TYPE
11317 || TREE_CHAIN (arglist))
11319 arg = TREE_VALUE (arglist);
11320 arglist = build_tree_list (NULL_TREE, fp);
11321 arglist = tree_cons (NULL_TREE, arg, arglist);
11328 call = build_function_call_expr (fn, arglist);
11329 return fold_convert (TREE_TYPE (TREE_TYPE (fndecl)), call);
11332 /* Initialize format string characters in the target charset. */
11335 init_target_chars (void)
11340 target_newline = lang_hooks.to_target_charset ('\n');
11341 target_percent = lang_hooks.to_target_charset ('%');
11342 target_c = lang_hooks.to_target_charset ('c');
11343 target_s = lang_hooks.to_target_charset ('s');
11344 if (target_newline == 0 || target_percent == 0 || target_c == 0
11348 target_percent_c[0] = target_percent;
11349 target_percent_c[1] = target_c;
11350 target_percent_c[2] = '\0';
11352 target_percent_s[0] = target_percent;
11353 target_percent_s[1] = target_s;
11354 target_percent_s[2] = '\0';
11356 target_percent_s_newline[0] = target_percent;
11357 target_percent_s_newline[1] = target_s;
11358 target_percent_s_newline[2] = target_newline;
11359 target_percent_s_newline[3] = '\0';
11366 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
11367 and no overflow/underflow occurred. INEXACT is true if M was not
11368 exacly calculated. TYPE is the tree type for the result. This
11369 function assumes that you cleared the MPFR flags and then
11370 calculated M to see if anything subsequently set a flag prior to
11371 entering this function. Return NULL_TREE if any checks fail. */
11374 do_mpfr_ckconv(mpfr_srcptr m, tree type, int inexact)
11376 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
11377 overflow/underflow occurred. If -frounding-math, proceed iff the
11378 result of calling FUNC was exact. */
11379 if (mpfr_number_p (m) && !mpfr_overflow_p() && !mpfr_underflow_p()
11380 && (!flag_rounding_math || !inexact))
11382 REAL_VALUE_TYPE rr;
11384 real_from_mpfr (&rr, m);
11385 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
11386 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
11387 but the mpft_t is not, then we underflowed in the
11389 if (!real_isnan (&rr) && !real_isinf (&rr)
11390 && (rr.cl == rvc_zero) == (mpfr_zero_p (m) != 0))
11392 REAL_VALUE_TYPE rmode;
11394 real_convert (&rmode, TYPE_MODE (type), &rr);
11395 /* Proceed iff the specified mode can hold the value. */
11396 if (real_identical (&rmode, &rr))
11397 return build_real (type, rmode);
11403 /* If argument ARG is a REAL_CST, call the one-argument mpfr function
11404 FUNC on it and return the resulting value as a tree with type TYPE.
11405 If MIN and/or MAX are not NULL, then the supplied ARG must be
11406 within those bounds. If INCLUSIVE is true, then MIN/MAX are
11407 acceptable values, otherwise they are not. The mpfr precision is
11408 set to the precision of TYPE. We assume that function FUNC returns
11409 zero if the result could be calculated exactly within the requested
11413 do_mpfr_arg1 (tree arg, tree type, int (*func)(mpfr_ptr, mpfr_srcptr, mp_rnd_t),
11414 const REAL_VALUE_TYPE *min, const REAL_VALUE_TYPE *max,
11417 tree result = NULL_TREE;
11421 if (TREE_CODE (arg) == REAL_CST && ! TREE_CONSTANT_OVERFLOW (arg))
11423 const REAL_VALUE_TYPE *const ra = &TREE_REAL_CST (arg);
11425 if (!real_isnan (ra) && !real_isinf (ra)
11426 && (!min || real_compare (inclusive ? GE_EXPR: GT_EXPR , ra, min))
11427 && (!max || real_compare (inclusive ? LE_EXPR: LT_EXPR , ra, max)))
11429 const int prec = REAL_MODE_FORMAT (TYPE_MODE (type))->p;
11433 mpfr_init2 (m, prec);
11434 mpfr_from_real (m, ra);
11435 mpfr_clear_flags();
11436 inexact = func (m, m, GMP_RNDN);
11437 result = do_mpfr_ckconv (m, type, inexact);
11445 /* If argument ARG is a REAL_CST, call the two-argument mpfr function
11446 FUNC on it and return the resulting value as a tree with type TYPE.
11447 The mpfr precision is set to the precision of TYPE. We assume that
11448 function FUNC returns zero if the result could be calculated
11449 exactly within the requested precision. */
11452 do_mpfr_arg2 (tree arg1, tree arg2, tree type,
11453 int (*func)(mpfr_ptr, mpfr_srcptr, mpfr_srcptr, mp_rnd_t))
11455 tree result = NULL_TREE;
11460 if (TREE_CODE (arg1) == REAL_CST && ! TREE_CONSTANT_OVERFLOW (arg1)
11461 && TREE_CODE (arg2) == REAL_CST && ! TREE_CONSTANT_OVERFLOW (arg2))
11463 const REAL_VALUE_TYPE *const ra1 = &TREE_REAL_CST (arg1);
11464 const REAL_VALUE_TYPE *const ra2 = &TREE_REAL_CST (arg2);
11466 if (!real_isnan (ra1) && !real_isinf (ra1)
11467 && !real_isnan (ra2) && !real_isinf (ra2))
11469 const int prec = REAL_MODE_FORMAT (TYPE_MODE (type))->p;
11473 mpfr_inits2 (prec, m1, m2, NULL);
11474 mpfr_from_real (m1, ra1);
11475 mpfr_from_real (m2, ra2);
11476 mpfr_clear_flags();
11477 inexact = func (m1, m1, m2, GMP_RNDN);
11478 result = do_mpfr_ckconv (m1, type, inexact);
11479 mpfr_clears (m1, m2, NULL);