1 /* Expand builtin functions.
2 Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
3 2000, 2001, 2002, 2003, 2004, 2005 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, 59 Temple Place - Suite 330, 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 #define CALLED_AS_BUILT_IN(NODE) \
52 (!strncmp (IDENTIFIER_POINTER (DECL_NAME (NODE)), "__builtin_", 10))
54 #ifndef PAD_VARARGS_DOWN
55 #define PAD_VARARGS_DOWN BYTES_BIG_ENDIAN
58 /* Define the names of the builtin function types and codes. */
59 const char *const built_in_class_names[4]
60 = {"NOT_BUILT_IN", "BUILT_IN_FRONTEND", "BUILT_IN_MD", "BUILT_IN_NORMAL"};
62 #define DEF_BUILTIN(X, N, C, T, LT, B, F, NA, AT, IM, COND) #X,
63 const char * built_in_names[(int) END_BUILTINS] =
65 #include "builtins.def"
69 /* Setup an array of _DECL trees, make sure each element is
70 initialized to NULL_TREE. */
71 tree built_in_decls[(int) END_BUILTINS];
72 /* Declarations used when constructing the builtin implicitly in the compiler.
73 It may be NULL_TREE when this is invalid (for instance runtime is not
74 required to implement the function call in all cases). */
75 tree implicit_built_in_decls[(int) END_BUILTINS];
77 static int get_pointer_alignment (tree, unsigned int);
78 static const char *c_getstr (tree);
79 static rtx c_readstr (const char *, enum machine_mode);
80 static int target_char_cast (tree, char *);
81 static rtx get_memory_rtx (tree);
82 static tree build_string_literal (int, const char *);
83 static int apply_args_size (void);
84 static int apply_result_size (void);
85 #if defined (HAVE_untyped_call) || defined (HAVE_untyped_return)
86 static rtx result_vector (int, rtx);
88 static rtx expand_builtin_setjmp (tree, rtx);
89 static void expand_builtin_update_setjmp_buf (rtx);
90 static void expand_builtin_prefetch (tree);
91 static rtx expand_builtin_apply_args (void);
92 static rtx expand_builtin_apply_args_1 (void);
93 static rtx expand_builtin_apply (rtx, rtx, rtx);
94 static void expand_builtin_return (rtx);
95 static enum type_class type_to_class (tree);
96 static rtx expand_builtin_classify_type (tree);
97 static void expand_errno_check (tree, rtx);
98 static rtx expand_builtin_mathfn (tree, rtx, rtx);
99 static rtx expand_builtin_mathfn_2 (tree, rtx, rtx);
100 static rtx expand_builtin_mathfn_3 (tree, rtx, rtx);
101 static rtx expand_builtin_args_info (tree);
102 static rtx expand_builtin_next_arg (void);
103 static rtx expand_builtin_va_start (tree);
104 static rtx expand_builtin_va_end (tree);
105 static rtx expand_builtin_va_copy (tree);
106 static rtx expand_builtin_memcmp (tree, tree, rtx, enum machine_mode);
107 static rtx expand_builtin_strcmp (tree, rtx, enum machine_mode);
108 static rtx expand_builtin_strncmp (tree, rtx, enum machine_mode);
109 static rtx builtin_memcpy_read_str (void *, HOST_WIDE_INT, enum machine_mode);
110 static rtx expand_builtin_strcat (tree, tree, rtx, enum machine_mode);
111 static rtx expand_builtin_strncat (tree, rtx, enum machine_mode);
112 static rtx expand_builtin_strspn (tree, rtx, enum machine_mode);
113 static rtx expand_builtin_strcspn (tree, rtx, enum machine_mode);
114 static rtx expand_builtin_memcpy (tree, rtx, enum machine_mode);
115 static rtx expand_builtin_mempcpy (tree, tree, rtx, enum machine_mode, int);
116 static rtx expand_builtin_memmove (tree, tree, rtx, enum machine_mode);
117 static rtx expand_builtin_bcopy (tree, tree);
118 static rtx expand_builtin_strcpy (tree, rtx, enum machine_mode);
119 static rtx expand_builtin_stpcpy (tree, rtx, enum machine_mode);
120 static rtx builtin_strncpy_read_str (void *, HOST_WIDE_INT, enum machine_mode);
121 static rtx expand_builtin_strncpy (tree, rtx, enum machine_mode);
122 static rtx builtin_memset_read_str (void *, HOST_WIDE_INT, enum machine_mode);
123 static rtx builtin_memset_gen_str (void *, HOST_WIDE_INT, enum machine_mode);
124 static rtx expand_builtin_memset (tree, rtx, enum machine_mode);
125 static rtx expand_builtin_bzero (tree);
126 static rtx expand_builtin_strlen (tree, rtx, enum machine_mode);
127 static rtx expand_builtin_strstr (tree, tree, rtx, enum machine_mode);
128 static rtx expand_builtin_strpbrk (tree, tree, rtx, enum machine_mode);
129 static rtx expand_builtin_strchr (tree, tree, rtx, enum machine_mode);
130 static rtx expand_builtin_strrchr (tree, tree, rtx, enum machine_mode);
131 static rtx expand_builtin_alloca (tree, rtx);
132 static rtx expand_builtin_unop (enum machine_mode, tree, rtx, rtx, optab);
133 static rtx expand_builtin_frame_address (tree, tree);
134 static rtx expand_builtin_fputs (tree, rtx, bool);
135 static rtx expand_builtin_printf (tree, rtx, enum machine_mode, bool);
136 static rtx expand_builtin_fprintf (tree, rtx, enum machine_mode, bool);
137 static rtx expand_builtin_sprintf (tree, rtx, enum machine_mode);
138 static tree stabilize_va_list (tree, int);
139 static rtx expand_builtin_expect (tree, rtx);
140 static tree fold_builtin_constant_p (tree);
141 static tree fold_builtin_classify_type (tree);
142 static tree fold_builtin_strlen (tree);
143 static tree fold_builtin_inf (tree, int);
144 static tree fold_builtin_nan (tree, tree, int);
145 static int validate_arglist (tree, ...);
146 static bool integer_valued_real_p (tree);
147 static tree fold_trunc_transparent_mathfn (tree, tree);
148 static bool readonly_data_expr (tree);
149 static rtx expand_builtin_fabs (tree, rtx, rtx);
150 static rtx expand_builtin_signbit (tree, rtx);
151 static tree fold_builtin_cabs (tree, tree);
152 static tree fold_builtin_sqrt (tree, tree);
153 static tree fold_builtin_cbrt (tree, tree);
154 static tree fold_builtin_pow (tree, tree, tree);
155 static tree fold_builtin_powi (tree, tree, tree);
156 static tree fold_builtin_sin (tree);
157 static tree fold_builtin_cos (tree, tree, tree);
158 static tree fold_builtin_tan (tree);
159 static tree fold_builtin_atan (tree, tree);
160 static tree fold_builtin_trunc (tree);
161 static tree fold_builtin_floor (tree);
162 static tree fold_builtin_ceil (tree);
163 static tree fold_builtin_round (tree);
164 static tree fold_builtin_bitop (tree, tree);
165 static tree fold_builtin_memcpy (tree, tree);
166 static tree fold_builtin_mempcpy (tree, tree, int);
167 static tree fold_builtin_memmove (tree, tree);
168 static tree fold_builtin_strchr (tree, tree);
169 static tree fold_builtin_memcmp (tree);
170 static tree fold_builtin_strcmp (tree);
171 static tree fold_builtin_strncmp (tree);
172 static tree fold_builtin_signbit (tree, tree);
173 static tree fold_builtin_copysign (tree, tree, tree);
174 static tree fold_builtin_isascii (tree);
175 static tree fold_builtin_toascii (tree);
176 static tree fold_builtin_isdigit (tree);
177 static tree fold_builtin_fabs (tree, tree);
178 static tree fold_builtin_abs (tree, tree);
179 static tree fold_builtin_unordered_cmp (tree, tree, enum tree_code,
181 static tree fold_builtin_1 (tree, bool);
183 static tree fold_builtin_strpbrk (tree, tree);
184 static tree fold_builtin_strstr (tree, tree);
185 static tree fold_builtin_strrchr (tree, tree);
186 static tree fold_builtin_strcat (tree);
187 static tree fold_builtin_strncat (tree);
188 static tree fold_builtin_strspn (tree);
189 static tree fold_builtin_strcspn (tree);
190 static tree fold_builtin_sprintf (tree, int);
193 /* Return the alignment in bits of EXP, a pointer valued expression.
194 But don't return more than MAX_ALIGN no matter what.
195 The alignment returned is, by default, the alignment of the thing that
196 EXP points to. If it is not a POINTER_TYPE, 0 is returned.
198 Otherwise, look at the expression to see if we can do better, i.e., if the
199 expression is actually pointing at an object whose alignment is tighter. */
202 get_pointer_alignment (tree exp, unsigned int max_align)
204 unsigned int align, inner;
206 if (! POINTER_TYPE_P (TREE_TYPE (exp)))
209 align = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (exp)));
210 align = MIN (align, max_align);
214 switch (TREE_CODE (exp))
218 case NON_LVALUE_EXPR:
219 exp = TREE_OPERAND (exp, 0);
220 if (! POINTER_TYPE_P (TREE_TYPE (exp)))
223 inner = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (exp)));
224 align = MIN (inner, max_align);
228 /* If sum of pointer + int, restrict our maximum alignment to that
229 imposed by the integer. If not, we can't do any better than
231 if (! host_integerp (TREE_OPERAND (exp, 1), 1))
234 while (((tree_low_cst (TREE_OPERAND (exp, 1), 1))
235 & (max_align / BITS_PER_UNIT - 1))
239 exp = TREE_OPERAND (exp, 0);
243 /* See what we are pointing at and look at its alignment. */
244 exp = TREE_OPERAND (exp, 0);
245 if (TREE_CODE (exp) == FUNCTION_DECL)
246 align = FUNCTION_BOUNDARY;
247 else if (DECL_P (exp))
248 align = DECL_ALIGN (exp);
249 #ifdef CONSTANT_ALIGNMENT
250 else if (CONSTANT_CLASS_P (exp))
251 align = CONSTANT_ALIGNMENT (exp, align);
253 return MIN (align, max_align);
261 /* Compute the length of a C string. TREE_STRING_LENGTH is not the right
262 way, because it could contain a zero byte in the middle.
263 TREE_STRING_LENGTH is the size of the character array, not the string.
265 ONLY_VALUE should be nonzero if the result is not going to be emitted
266 into the instruction stream and zero if it is going to be expanded.
267 E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3
268 is returned, otherwise NULL, since
269 len = c_strlen (src, 1); if (len) expand_expr (len, ...); would not
270 evaluate the side-effects.
272 The value returned is of type `ssizetype'.
274 Unfortunately, string_constant can't access the values of const char
275 arrays with initializers, so neither can we do so here. */
278 c_strlen (tree src, int only_value)
281 HOST_WIDE_INT offset;
286 if (TREE_CODE (src) == COND_EXPR
287 && (only_value || !TREE_SIDE_EFFECTS (TREE_OPERAND (src, 0))))
291 len1 = c_strlen (TREE_OPERAND (src, 1), only_value);
292 len2 = c_strlen (TREE_OPERAND (src, 2), only_value);
293 if (tree_int_cst_equal (len1, len2))
297 if (TREE_CODE (src) == COMPOUND_EXPR
298 && (only_value || !TREE_SIDE_EFFECTS (TREE_OPERAND (src, 0))))
299 return c_strlen (TREE_OPERAND (src, 1), only_value);
301 src = string_constant (src, &offset_node);
305 max = TREE_STRING_LENGTH (src) - 1;
306 ptr = TREE_STRING_POINTER (src);
308 if (offset_node && TREE_CODE (offset_node) != INTEGER_CST)
310 /* If the string has an internal zero byte (e.g., "foo\0bar"), we can't
311 compute the offset to the following null if we don't know where to
312 start searching for it. */
315 for (i = 0; i < max; i++)
319 /* We don't know the starting offset, but we do know that the string
320 has no internal zero bytes. We can assume that the offset falls
321 within the bounds of the string; otherwise, the programmer deserves
322 what he gets. Subtract the offset from the length of the string,
323 and return that. This would perhaps not be valid if we were dealing
324 with named arrays in addition to literal string constants. */
326 return size_diffop (size_int (max), offset_node);
329 /* We have a known offset into the string. Start searching there for
330 a null character if we can represent it as a single HOST_WIDE_INT. */
331 if (offset_node == 0)
333 else if (! host_integerp (offset_node, 0))
336 offset = tree_low_cst (offset_node, 0);
338 /* If the offset is known to be out of bounds, warn, and call strlen at
340 if (offset < 0 || offset > max)
342 warning ("offset outside bounds of constant string");
346 /* Use strlen to search for the first zero byte. Since any strings
347 constructed with build_string will have nulls appended, we win even
348 if we get handed something like (char[4])"abcd".
350 Since OFFSET is our starting index into the string, no further
351 calculation is needed. */
352 return ssize_int (strlen (ptr + offset));
355 /* Return a char pointer for a C string if it is a string constant
356 or sum of string constant and integer constant. */
363 src = string_constant (src, &offset_node);
367 if (offset_node == 0)
368 return TREE_STRING_POINTER (src);
369 else if (!host_integerp (offset_node, 1)
370 || compare_tree_int (offset_node, TREE_STRING_LENGTH (src) - 1) > 0)
373 return TREE_STRING_POINTER (src) + tree_low_cst (offset_node, 1);
376 /* Return a CONST_INT or CONST_DOUBLE corresponding to target reading
377 GET_MODE_BITSIZE (MODE) bits from string constant STR. */
380 c_readstr (const char *str, enum machine_mode mode)
386 gcc_assert (GET_MODE_CLASS (mode) == MODE_INT);
391 for (i = 0; i < GET_MODE_SIZE (mode); i++)
394 if (WORDS_BIG_ENDIAN)
395 j = GET_MODE_SIZE (mode) - i - 1;
396 if (BYTES_BIG_ENDIAN != WORDS_BIG_ENDIAN
397 && GET_MODE_SIZE (mode) > UNITS_PER_WORD)
398 j = j + UNITS_PER_WORD - 2 * (j % UNITS_PER_WORD) - 1;
400 gcc_assert (j <= 2 * HOST_BITS_PER_WIDE_INT);
403 ch = (unsigned char) str[i];
404 c[j / HOST_BITS_PER_WIDE_INT] |= ch << (j % HOST_BITS_PER_WIDE_INT);
406 return immed_double_const (c[0], c[1], mode);
409 /* Cast a target constant CST to target CHAR and if that value fits into
410 host char type, return zero and put that value into variable pointed by
414 target_char_cast (tree cst, char *p)
416 unsigned HOST_WIDE_INT val, hostval;
418 if (!host_integerp (cst, 1)
419 || CHAR_TYPE_SIZE > HOST_BITS_PER_WIDE_INT)
422 val = tree_low_cst (cst, 1);
423 if (CHAR_TYPE_SIZE < HOST_BITS_PER_WIDE_INT)
424 val &= (((unsigned HOST_WIDE_INT) 1) << CHAR_TYPE_SIZE) - 1;
427 if (HOST_BITS_PER_CHAR < HOST_BITS_PER_WIDE_INT)
428 hostval &= (((unsigned HOST_WIDE_INT) 1) << HOST_BITS_PER_CHAR) - 1;
437 /* Similar to save_expr, but assumes that arbitrary code is not executed
438 in between the multiple evaluations. In particular, we assume that a
439 non-addressable local variable will not be modified. */
442 builtin_save_expr (tree exp)
444 if (TREE_ADDRESSABLE (exp) == 0
445 && (TREE_CODE (exp) == PARM_DECL
446 || (TREE_CODE (exp) == VAR_DECL && !TREE_STATIC (exp))))
449 return save_expr (exp);
452 /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT
453 times to get the address of either a higher stack frame, or a return
454 address located within it (depending on FNDECL_CODE). */
457 expand_builtin_return_addr (enum built_in_function fndecl_code, int count)
461 #ifdef INITIAL_FRAME_ADDRESS_RTX
462 rtx tem = INITIAL_FRAME_ADDRESS_RTX;
464 rtx tem = hard_frame_pointer_rtx;
467 /* Some machines need special handling before we can access
468 arbitrary frames. For example, on the sparc, we must first flush
469 all register windows to the stack. */
470 #ifdef SETUP_FRAME_ADDRESSES
472 SETUP_FRAME_ADDRESSES ();
475 /* On the sparc, the return address is not in the frame, it is in a
476 register. There is no way to access it off of the current frame
477 pointer, but it can be accessed off the previous frame pointer by
478 reading the value from the register window save area. */
479 #ifdef RETURN_ADDR_IN_PREVIOUS_FRAME
480 if (fndecl_code == BUILT_IN_RETURN_ADDRESS)
484 /* Scan back COUNT frames to the specified frame. */
485 for (i = 0; i < count; i++)
487 /* Assume the dynamic chain pointer is in the word that the
488 frame address points to, unless otherwise specified. */
489 #ifdef DYNAMIC_CHAIN_ADDRESS
490 tem = DYNAMIC_CHAIN_ADDRESS (tem);
492 tem = memory_address (Pmode, tem);
493 tem = gen_rtx_MEM (Pmode, tem);
494 set_mem_alias_set (tem, get_frame_alias_set ());
495 tem = copy_to_reg (tem);
498 /* For __builtin_frame_address, return what we've got. */
499 if (fndecl_code == BUILT_IN_FRAME_ADDRESS)
502 /* For __builtin_return_address, Get the return address from that
504 #ifdef RETURN_ADDR_RTX
505 tem = RETURN_ADDR_RTX (count, tem);
507 tem = memory_address (Pmode,
508 plus_constant (tem, GET_MODE_SIZE (Pmode)));
509 tem = gen_rtx_MEM (Pmode, tem);
510 set_mem_alias_set (tem, get_frame_alias_set ());
515 /* Alias set used for setjmp buffer. */
516 static HOST_WIDE_INT setjmp_alias_set = -1;
518 /* Construct the leading half of a __builtin_setjmp call. Control will
519 return to RECEIVER_LABEL. This is used directly by sjlj exception
523 expand_builtin_setjmp_setup (rtx buf_addr, rtx receiver_label)
525 enum machine_mode sa_mode = STACK_SAVEAREA_MODE (SAVE_NONLOCAL);
529 if (setjmp_alias_set == -1)
530 setjmp_alias_set = new_alias_set ();
532 buf_addr = convert_memory_address (Pmode, buf_addr);
534 buf_addr = force_reg (Pmode, force_operand (buf_addr, NULL_RTX));
536 /* We store the frame pointer and the address of receiver_label in
537 the buffer and use the rest of it for the stack save area, which
538 is machine-dependent. */
540 mem = gen_rtx_MEM (Pmode, buf_addr);
541 set_mem_alias_set (mem, setjmp_alias_set);
542 emit_move_insn (mem, targetm.builtin_setjmp_frame_value ());
544 mem = gen_rtx_MEM (Pmode, plus_constant (buf_addr, GET_MODE_SIZE (Pmode))),
545 set_mem_alias_set (mem, setjmp_alias_set);
547 emit_move_insn (validize_mem (mem),
548 force_reg (Pmode, gen_rtx_LABEL_REF (Pmode, receiver_label)));
550 stack_save = gen_rtx_MEM (sa_mode,
551 plus_constant (buf_addr,
552 2 * GET_MODE_SIZE (Pmode)));
553 set_mem_alias_set (stack_save, setjmp_alias_set);
554 emit_stack_save (SAVE_NONLOCAL, &stack_save, NULL_RTX);
556 /* If there is further processing to do, do it. */
557 #ifdef HAVE_builtin_setjmp_setup
558 if (HAVE_builtin_setjmp_setup)
559 emit_insn (gen_builtin_setjmp_setup (buf_addr));
562 /* Tell optimize_save_area_alloca that extra work is going to
563 need to go on during alloca. */
564 current_function_calls_setjmp = 1;
566 /* Set this so all the registers get saved in our frame; we need to be
567 able to copy the saved values for any registers from frames we unwind. */
568 current_function_has_nonlocal_label = 1;
571 /* Construct the trailing part of a __builtin_setjmp call.
572 This is used directly by sjlj exception handling code. */
575 expand_builtin_setjmp_receiver (rtx receiver_label ATTRIBUTE_UNUSED)
577 /* Clobber the FP when we get here, so we have to make sure it's
578 marked as used by this function. */
579 emit_insn (gen_rtx_USE (VOIDmode, hard_frame_pointer_rtx));
581 /* Mark the static chain as clobbered here so life information
582 doesn't get messed up for it. */
583 emit_insn (gen_rtx_CLOBBER (VOIDmode, static_chain_rtx));
585 /* Now put in the code to restore the frame pointer, and argument
586 pointer, if needed. */
587 #ifdef HAVE_nonlocal_goto
588 if (! HAVE_nonlocal_goto)
590 emit_move_insn (virtual_stack_vars_rtx, hard_frame_pointer_rtx);
592 #if ARG_POINTER_REGNUM != HARD_FRAME_POINTER_REGNUM
593 if (fixed_regs[ARG_POINTER_REGNUM])
595 #ifdef ELIMINABLE_REGS
597 static const struct elims {const int from, to;} elim_regs[] = ELIMINABLE_REGS;
599 for (i = 0; i < ARRAY_SIZE (elim_regs); i++)
600 if (elim_regs[i].from == ARG_POINTER_REGNUM
601 && elim_regs[i].to == HARD_FRAME_POINTER_REGNUM)
604 if (i == ARRAY_SIZE (elim_regs))
607 /* Now restore our arg pointer from the address at which it
608 was saved in our stack frame. */
609 emit_move_insn (virtual_incoming_args_rtx,
610 copy_to_reg (get_arg_pointer_save_area (cfun)));
615 #ifdef HAVE_builtin_setjmp_receiver
616 if (HAVE_builtin_setjmp_receiver)
617 emit_insn (gen_builtin_setjmp_receiver (receiver_label));
620 #ifdef HAVE_nonlocal_goto_receiver
621 if (HAVE_nonlocal_goto_receiver)
622 emit_insn (gen_nonlocal_goto_receiver ());
627 /* @@@ This is a kludge. Not all machine descriptions define a blockage
628 insn, but we must not allow the code we just generated to be reordered
629 by scheduling. Specifically, the update of the frame pointer must
630 happen immediately, not later. So emit an ASM_INPUT to act as blockage
632 emit_insn (gen_rtx_ASM_INPUT (VOIDmode, ""));
635 /* __builtin_setjmp is passed a pointer to an array of five words (not
636 all will be used on all machines). It operates similarly to the C
637 library function of the same name, but is more efficient. Much of
638 the code below (and for longjmp) is copied from the handling of
641 NOTE: This is intended for use by GNAT and the exception handling
642 scheme in the compiler and will only work in the method used by
646 expand_builtin_setjmp (tree arglist, rtx target)
648 rtx buf_addr, next_lab, cont_lab;
650 if (!validate_arglist (arglist, POINTER_TYPE, VOID_TYPE))
653 if (target == 0 || !REG_P (target)
654 || REGNO (target) < FIRST_PSEUDO_REGISTER)
655 target = gen_reg_rtx (TYPE_MODE (integer_type_node));
657 buf_addr = expand_expr (TREE_VALUE (arglist), NULL_RTX, VOIDmode, 0);
659 next_lab = gen_label_rtx ();
660 cont_lab = gen_label_rtx ();
662 expand_builtin_setjmp_setup (buf_addr, next_lab);
664 /* Set TARGET to zero and branch to the continue label. Use emit_jump to
665 ensure that pending stack adjustments are flushed. */
666 emit_move_insn (target, const0_rtx);
667 emit_jump (cont_lab);
669 emit_label (next_lab);
671 expand_builtin_setjmp_receiver (next_lab);
673 /* Set TARGET to one. */
674 emit_move_insn (target, const1_rtx);
675 emit_label (cont_lab);
677 /* Tell flow about the strange goings on. Putting `next_lab' on
678 `nonlocal_goto_handler_labels' to indicates that function
679 calls may traverse the arc back to this label. */
681 current_function_has_nonlocal_label = 1;
682 nonlocal_goto_handler_labels
683 = gen_rtx_EXPR_LIST (VOIDmode, next_lab, nonlocal_goto_handler_labels);
688 /* __builtin_longjmp is passed a pointer to an array of five words (not
689 all will be used on all machines). It operates similarly to the C
690 library function of the same name, but is more efficient. Much of
691 the code below is copied from the handling of non-local gotos.
693 NOTE: This is intended for use by GNAT and the exception handling
694 scheme in the compiler and will only work in the method used by
698 expand_builtin_longjmp (rtx buf_addr, rtx value)
700 rtx fp, lab, stack, insn, last;
701 enum machine_mode sa_mode = STACK_SAVEAREA_MODE (SAVE_NONLOCAL);
703 if (setjmp_alias_set == -1)
704 setjmp_alias_set = new_alias_set ();
706 buf_addr = convert_memory_address (Pmode, buf_addr);
708 buf_addr = force_reg (Pmode, buf_addr);
710 /* We used to store value in static_chain_rtx, but that fails if pointers
711 are smaller than integers. We instead require that the user must pass
712 a second argument of 1, because that is what builtin_setjmp will
713 return. This also makes EH slightly more efficient, since we are no
714 longer copying around a value that we don't care about. */
715 gcc_assert (value == const1_rtx);
717 last = get_last_insn ();
718 #ifdef HAVE_builtin_longjmp
719 if (HAVE_builtin_longjmp)
720 emit_insn (gen_builtin_longjmp (buf_addr));
724 fp = gen_rtx_MEM (Pmode, buf_addr);
725 lab = gen_rtx_MEM (Pmode, plus_constant (buf_addr,
726 GET_MODE_SIZE (Pmode)));
728 stack = gen_rtx_MEM (sa_mode, plus_constant (buf_addr,
729 2 * GET_MODE_SIZE (Pmode)));
730 set_mem_alias_set (fp, setjmp_alias_set);
731 set_mem_alias_set (lab, setjmp_alias_set);
732 set_mem_alias_set (stack, setjmp_alias_set);
734 /* Pick up FP, label, and SP from the block and jump. This code is
735 from expand_goto in stmt.c; see there for detailed comments. */
736 #if HAVE_nonlocal_goto
737 if (HAVE_nonlocal_goto)
738 /* We have to pass a value to the nonlocal_goto pattern that will
739 get copied into the static_chain pointer, but it does not matter
740 what that value is, because builtin_setjmp does not use it. */
741 emit_insn (gen_nonlocal_goto (value, lab, stack, fp));
745 lab = copy_to_reg (lab);
747 emit_insn (gen_rtx_CLOBBER (VOIDmode,
748 gen_rtx_MEM (BLKmode,
749 gen_rtx_SCRATCH (VOIDmode))));
750 emit_insn (gen_rtx_CLOBBER (VOIDmode,
751 gen_rtx_MEM (BLKmode,
752 hard_frame_pointer_rtx)));
754 emit_move_insn (hard_frame_pointer_rtx, fp);
755 emit_stack_restore (SAVE_NONLOCAL, stack, NULL_RTX);
757 emit_insn (gen_rtx_USE (VOIDmode, hard_frame_pointer_rtx));
758 emit_insn (gen_rtx_USE (VOIDmode, stack_pointer_rtx));
759 emit_indirect_jump (lab);
763 /* Search backwards and mark the jump insn as a non-local goto.
764 Note that this precludes the use of __builtin_longjmp to a
765 __builtin_setjmp target in the same function. However, we've
766 already cautioned the user that these functions are for
767 internal exception handling use only. */
768 for (insn = get_last_insn (); insn; insn = PREV_INSN (insn))
770 gcc_assert (insn != last);
774 REG_NOTES (insn) = alloc_EXPR_LIST (REG_NON_LOCAL_GOTO, const0_rtx,
778 else if (CALL_P (insn))
783 /* Expand a call to __builtin_nonlocal_goto. We're passed the target label
784 and the address of the save area. */
787 expand_builtin_nonlocal_goto (tree arglist)
789 tree t_label, t_save_area;
790 rtx r_label, r_save_area, r_fp, r_sp, insn;
792 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
795 t_label = TREE_VALUE (arglist);
796 arglist = TREE_CHAIN (arglist);
797 t_save_area = TREE_VALUE (arglist);
799 r_label = expand_expr (t_label, NULL_RTX, VOIDmode, 0);
800 r_label = convert_memory_address (Pmode, r_label);
801 r_save_area = expand_expr (t_save_area, NULL_RTX, VOIDmode, 0);
802 r_save_area = convert_memory_address (Pmode, r_save_area);
803 r_fp = gen_rtx_MEM (Pmode, r_save_area);
804 r_sp = gen_rtx_MEM (STACK_SAVEAREA_MODE (SAVE_NONLOCAL),
805 plus_constant (r_save_area, GET_MODE_SIZE (Pmode)));
807 current_function_has_nonlocal_goto = 1;
809 #if HAVE_nonlocal_goto
810 /* ??? We no longer need to pass the static chain value, afaik. */
811 if (HAVE_nonlocal_goto)
812 emit_insn (gen_nonlocal_goto (const0_rtx, r_label, r_sp, r_fp));
816 r_label = copy_to_reg (r_label);
818 emit_insn (gen_rtx_CLOBBER (VOIDmode,
819 gen_rtx_MEM (BLKmode,
820 gen_rtx_SCRATCH (VOIDmode))));
822 emit_insn (gen_rtx_CLOBBER (VOIDmode,
823 gen_rtx_MEM (BLKmode,
824 hard_frame_pointer_rtx)));
826 /* Restore frame pointer for containing function.
827 This sets the actual hard register used for the frame pointer
828 to the location of the function's incoming static chain info.
829 The non-local goto handler will then adjust it to contain the
830 proper value and reload the argument pointer, if needed. */
831 emit_move_insn (hard_frame_pointer_rtx, r_fp);
832 emit_stack_restore (SAVE_NONLOCAL, r_sp, NULL_RTX);
834 /* USE of hard_frame_pointer_rtx added for consistency;
835 not clear if really needed. */
836 emit_insn (gen_rtx_USE (VOIDmode, hard_frame_pointer_rtx));
837 emit_insn (gen_rtx_USE (VOIDmode, stack_pointer_rtx));
838 emit_indirect_jump (r_label);
841 /* Search backwards to the jump insn and mark it as a
843 for (insn = get_last_insn (); insn; insn = PREV_INSN (insn))
847 REG_NOTES (insn) = alloc_EXPR_LIST (REG_NON_LOCAL_GOTO,
848 const0_rtx, REG_NOTES (insn));
851 else if (CALL_P (insn))
858 /* __builtin_update_setjmp_buf is passed a pointer to an array of five words
859 (not all will be used on all machines) that was passed to __builtin_setjmp.
860 It updates the stack pointer in that block to correspond to the current
864 expand_builtin_update_setjmp_buf (rtx buf_addr)
866 enum machine_mode sa_mode = Pmode;
870 #ifdef HAVE_save_stack_nonlocal
871 if (HAVE_save_stack_nonlocal)
872 sa_mode = insn_data[(int) CODE_FOR_save_stack_nonlocal].operand[0].mode;
874 #ifdef STACK_SAVEAREA_MODE
875 sa_mode = STACK_SAVEAREA_MODE (SAVE_NONLOCAL);
879 = gen_rtx_MEM (sa_mode,
882 plus_constant (buf_addr, 2 * GET_MODE_SIZE (Pmode))));
886 emit_insn (gen_setjmp ());
889 emit_stack_save (SAVE_NONLOCAL, &stack_save, NULL_RTX);
892 /* Expand a call to __builtin_prefetch. For a target that does not support
893 data prefetch, evaluate the memory address argument in case it has side
897 expand_builtin_prefetch (tree arglist)
899 tree arg0, arg1, arg2;
902 if (!validate_arglist (arglist, POINTER_TYPE, 0))
905 arg0 = TREE_VALUE (arglist);
906 /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
907 zero (read) and argument 2 (locality) defaults to 3 (high degree of
909 if (TREE_CHAIN (arglist))
911 arg1 = TREE_VALUE (TREE_CHAIN (arglist));
912 if (TREE_CHAIN (TREE_CHAIN (arglist)))
913 arg2 = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
915 arg2 = build_int_cst (NULL_TREE, 3);
919 arg1 = integer_zero_node;
920 arg2 = build_int_cst (NULL_TREE, 3);
923 /* Argument 0 is an address. */
924 op0 = expand_expr (arg0, NULL_RTX, Pmode, EXPAND_NORMAL);
926 /* Argument 1 (read/write flag) must be a compile-time constant int. */
927 if (TREE_CODE (arg1) != INTEGER_CST)
929 error ("second argument to %<__builtin_prefetch%> must be a constant");
930 arg1 = integer_zero_node;
932 op1 = expand_expr (arg1, NULL_RTX, VOIDmode, 0);
933 /* Argument 1 must be either zero or one. */
934 if (INTVAL (op1) != 0 && INTVAL (op1) != 1)
936 warning ("invalid second argument to %<__builtin_prefetch%>;"
941 /* Argument 2 (locality) must be a compile-time constant int. */
942 if (TREE_CODE (arg2) != INTEGER_CST)
944 error ("third argument to %<__builtin_prefetch%> must be a constant");
945 arg2 = integer_zero_node;
947 op2 = expand_expr (arg2, NULL_RTX, VOIDmode, 0);
948 /* Argument 2 must be 0, 1, 2, or 3. */
949 if (INTVAL (op2) < 0 || INTVAL (op2) > 3)
951 warning ("invalid third argument to %<__builtin_prefetch%>; using zero");
958 if ((! (*insn_data[(int) CODE_FOR_prefetch].operand[0].predicate)
960 insn_data[(int) CODE_FOR_prefetch].operand[0].mode))
961 || (GET_MODE (op0) != Pmode))
963 op0 = convert_memory_address (Pmode, op0);
964 op0 = force_reg (Pmode, op0);
966 emit_insn (gen_prefetch (op0, op1, op2));
970 /* Don't do anything with direct references to volatile memory, but
971 generate code to handle other side effects. */
972 if (!MEM_P (op0) && side_effects_p (op0))
976 /* Get a MEM rtx for expression EXP which is the address of an operand
977 to be used to be used in a string instruction (cmpstrsi, movmemsi, ..). */
980 get_memory_rtx (tree exp)
982 rtx addr = expand_expr (exp, NULL_RTX, ptr_mode, EXPAND_SUM);
985 addr = convert_memory_address (Pmode, addr);
987 mem = gen_rtx_MEM (BLKmode, memory_address (BLKmode, addr));
989 /* Get an expression we can use to find the attributes to assign to MEM.
990 If it is an ADDR_EXPR, use the operand. Otherwise, dereference it if
991 we can. First remove any nops. */
992 while ((TREE_CODE (exp) == NOP_EXPR || TREE_CODE (exp) == CONVERT_EXPR
993 || TREE_CODE (exp) == NON_LVALUE_EXPR)
994 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (exp, 0))))
995 exp = TREE_OPERAND (exp, 0);
997 if (TREE_CODE (exp) == ADDR_EXPR)
998 exp = TREE_OPERAND (exp, 0);
999 else if (POINTER_TYPE_P (TREE_TYPE (exp)))
1000 exp = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (exp)), exp);
1004 /* Honor attributes derived from exp, except for the alias set
1005 (as builtin stringops may alias with anything) and the size
1006 (as stringops may access multiple array elements). */
1009 set_mem_attributes (mem, exp, 0);
1010 set_mem_alias_set (mem, 0);
1011 set_mem_size (mem, NULL_RTX);
1017 /* Built-in functions to perform an untyped call and return. */
1019 /* For each register that may be used for calling a function, this
1020 gives a mode used to copy the register's value. VOIDmode indicates
1021 the register is not used for calling a function. If the machine
1022 has register windows, this gives only the outbound registers.
1023 INCOMING_REGNO gives the corresponding inbound register. */
1024 static enum machine_mode apply_args_mode[FIRST_PSEUDO_REGISTER];
1026 /* For each register that may be used for returning values, this gives
1027 a mode used to copy the register's value. VOIDmode indicates the
1028 register is not used for returning values. If the machine has
1029 register windows, this gives only the outbound registers.
1030 INCOMING_REGNO gives the corresponding inbound register. */
1031 static enum machine_mode apply_result_mode[FIRST_PSEUDO_REGISTER];
1033 /* For each register that may be used for calling a function, this
1034 gives the offset of that register into the block returned by
1035 __builtin_apply_args. 0 indicates that the register is not
1036 used for calling a function. */
1037 static int apply_args_reg_offset[FIRST_PSEUDO_REGISTER];
1039 /* Return the size required for the block returned by __builtin_apply_args,
1040 and initialize apply_args_mode. */
1043 apply_args_size (void)
1045 static int size = -1;
1048 enum machine_mode mode;
1050 /* The values computed by this function never change. */
1053 /* The first value is the incoming arg-pointer. */
1054 size = GET_MODE_SIZE (Pmode);
1056 /* The second value is the structure value address unless this is
1057 passed as an "invisible" first argument. */
1058 if (targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0))
1059 size += GET_MODE_SIZE (Pmode);
1061 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1062 if (FUNCTION_ARG_REGNO_P (regno))
1064 mode = reg_raw_mode[regno];
1066 gcc_assert (mode != VOIDmode);
1068 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1069 if (size % align != 0)
1070 size = CEIL (size, align) * align;
1071 apply_args_reg_offset[regno] = size;
1072 size += GET_MODE_SIZE (mode);
1073 apply_args_mode[regno] = mode;
1077 apply_args_mode[regno] = VOIDmode;
1078 apply_args_reg_offset[regno] = 0;
1084 /* Return the size required for the block returned by __builtin_apply,
1085 and initialize apply_result_mode. */
1088 apply_result_size (void)
1090 static int size = -1;
1092 enum machine_mode mode;
1094 /* The values computed by this function never change. */
1099 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1100 if (FUNCTION_VALUE_REGNO_P (regno))
1102 mode = reg_raw_mode[regno];
1104 gcc_assert (mode != VOIDmode);
1106 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1107 if (size % align != 0)
1108 size = CEIL (size, align) * align;
1109 size += GET_MODE_SIZE (mode);
1110 apply_result_mode[regno] = mode;
1113 apply_result_mode[regno] = VOIDmode;
1115 /* Allow targets that use untyped_call and untyped_return to override
1116 the size so that machine-specific information can be stored here. */
1117 #ifdef APPLY_RESULT_SIZE
1118 size = APPLY_RESULT_SIZE;
1124 #if defined (HAVE_untyped_call) || defined (HAVE_untyped_return)
1125 /* Create a vector describing the result block RESULT. If SAVEP is true,
1126 the result block is used to save the values; otherwise it is used to
1127 restore the values. */
1130 result_vector (int savep, rtx result)
1132 int regno, size, align, nelts;
1133 enum machine_mode mode;
1135 rtx *savevec = alloca (FIRST_PSEUDO_REGISTER * sizeof (rtx));
1138 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1139 if ((mode = apply_result_mode[regno]) != VOIDmode)
1141 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1142 if (size % align != 0)
1143 size = CEIL (size, align) * align;
1144 reg = gen_rtx_REG (mode, savep ? regno : INCOMING_REGNO (regno));
1145 mem = adjust_address (result, mode, size);
1146 savevec[nelts++] = (savep
1147 ? gen_rtx_SET (VOIDmode, mem, reg)
1148 : gen_rtx_SET (VOIDmode, reg, mem));
1149 size += GET_MODE_SIZE (mode);
1151 return gen_rtx_PARALLEL (VOIDmode, gen_rtvec_v (nelts, savevec));
1153 #endif /* HAVE_untyped_call or HAVE_untyped_return */
1155 /* Save the state required to perform an untyped call with the same
1156 arguments as were passed to the current function. */
1159 expand_builtin_apply_args_1 (void)
1162 int size, align, regno;
1163 enum machine_mode mode;
1164 rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1166 /* Create a block where the arg-pointer, structure value address,
1167 and argument registers can be saved. */
1168 registers = assign_stack_local (BLKmode, apply_args_size (), -1);
1170 /* Walk past the arg-pointer and structure value address. */
1171 size = GET_MODE_SIZE (Pmode);
1172 if (targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0))
1173 size += GET_MODE_SIZE (Pmode);
1175 /* Save each register used in calling a function to the block. */
1176 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1177 if ((mode = apply_args_mode[regno]) != VOIDmode)
1179 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1180 if (size % align != 0)
1181 size = CEIL (size, align) * align;
1183 tem = gen_rtx_REG (mode, INCOMING_REGNO (regno));
1185 emit_move_insn (adjust_address (registers, mode, size), tem);
1186 size += GET_MODE_SIZE (mode);
1189 /* Save the arg pointer to the block. */
1190 tem = copy_to_reg (virtual_incoming_args_rtx);
1191 #ifdef STACK_GROWS_DOWNWARD
1192 /* We need the pointer as the caller actually passed them to us, not
1193 as we might have pretended they were passed. Make sure it's a valid
1194 operand, as emit_move_insn isn't expected to handle a PLUS. */
1196 = force_operand (plus_constant (tem, current_function_pretend_args_size),
1199 emit_move_insn (adjust_address (registers, Pmode, 0), tem);
1201 size = GET_MODE_SIZE (Pmode);
1203 /* Save the structure value address unless this is passed as an
1204 "invisible" first argument. */
1205 if (struct_incoming_value)
1207 emit_move_insn (adjust_address (registers, Pmode, size),
1208 copy_to_reg (struct_incoming_value));
1209 size += GET_MODE_SIZE (Pmode);
1212 /* Return the address of the block. */
1213 return copy_addr_to_reg (XEXP (registers, 0));
1216 /* __builtin_apply_args returns block of memory allocated on
1217 the stack into which is stored the arg pointer, structure
1218 value address, static chain, and all the registers that might
1219 possibly be used in performing a function call. The code is
1220 moved to the start of the function so the incoming values are
1224 expand_builtin_apply_args (void)
1226 /* Don't do __builtin_apply_args more than once in a function.
1227 Save the result of the first call and reuse it. */
1228 if (apply_args_value != 0)
1229 return apply_args_value;
1231 /* When this function is called, it means that registers must be
1232 saved on entry to this function. So we migrate the
1233 call to the first insn of this function. */
1238 temp = expand_builtin_apply_args_1 ();
1242 apply_args_value = temp;
1244 /* Put the insns after the NOTE that starts the function.
1245 If this is inside a start_sequence, make the outer-level insn
1246 chain current, so the code is placed at the start of the
1248 push_topmost_sequence ();
1249 emit_insn_before (seq, NEXT_INSN (entry_of_function ()));
1250 pop_topmost_sequence ();
1255 /* Perform an untyped call and save the state required to perform an
1256 untyped return of whatever value was returned by the given function. */
1259 expand_builtin_apply (rtx function, rtx arguments, rtx argsize)
1261 int size, align, regno;
1262 enum machine_mode mode;
1263 rtx incoming_args, result, reg, dest, src, call_insn;
1264 rtx old_stack_level = 0;
1265 rtx call_fusage = 0;
1266 rtx struct_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0);
1268 arguments = convert_memory_address (Pmode, arguments);
1270 /* Create a block where the return registers can be saved. */
1271 result = assign_stack_local (BLKmode, apply_result_size (), -1);
1273 /* Fetch the arg pointer from the ARGUMENTS block. */
1274 incoming_args = gen_reg_rtx (Pmode);
1275 emit_move_insn (incoming_args, gen_rtx_MEM (Pmode, arguments));
1276 #ifndef STACK_GROWS_DOWNWARD
1277 incoming_args = expand_simple_binop (Pmode, MINUS, incoming_args, argsize,
1278 incoming_args, 0, OPTAB_LIB_WIDEN);
1281 /* Push a new argument block and copy the arguments. Do not allow
1282 the (potential) memcpy call below to interfere with our stack
1284 do_pending_stack_adjust ();
1287 /* Save the stack with nonlocal if available. */
1288 #ifdef HAVE_save_stack_nonlocal
1289 if (HAVE_save_stack_nonlocal)
1290 emit_stack_save (SAVE_NONLOCAL, &old_stack_level, NULL_RTX);
1293 emit_stack_save (SAVE_BLOCK, &old_stack_level, NULL_RTX);
1295 /* Allocate a block of memory onto the stack and copy the memory
1296 arguments to the outgoing arguments address. */
1297 allocate_dynamic_stack_space (argsize, 0, BITS_PER_UNIT);
1298 dest = virtual_outgoing_args_rtx;
1299 #ifndef STACK_GROWS_DOWNWARD
1300 if (GET_CODE (argsize) == CONST_INT)
1301 dest = plus_constant (dest, -INTVAL (argsize));
1303 dest = gen_rtx_PLUS (Pmode, dest, negate_rtx (Pmode, argsize));
1305 dest = gen_rtx_MEM (BLKmode, dest);
1306 set_mem_align (dest, PARM_BOUNDARY);
1307 src = gen_rtx_MEM (BLKmode, incoming_args);
1308 set_mem_align (src, PARM_BOUNDARY);
1309 emit_block_move (dest, src, argsize, BLOCK_OP_NORMAL);
1311 /* Refer to the argument block. */
1313 arguments = gen_rtx_MEM (BLKmode, arguments);
1314 set_mem_align (arguments, PARM_BOUNDARY);
1316 /* Walk past the arg-pointer and structure value address. */
1317 size = GET_MODE_SIZE (Pmode);
1319 size += GET_MODE_SIZE (Pmode);
1321 /* Restore each of the registers previously saved. Make USE insns
1322 for each of these registers for use in making the call. */
1323 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1324 if ((mode = apply_args_mode[regno]) != VOIDmode)
1326 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1327 if (size % align != 0)
1328 size = CEIL (size, align) * align;
1329 reg = gen_rtx_REG (mode, regno);
1330 emit_move_insn (reg, adjust_address (arguments, mode, size));
1331 use_reg (&call_fusage, reg);
1332 size += GET_MODE_SIZE (mode);
1335 /* Restore the structure value address unless this is passed as an
1336 "invisible" first argument. */
1337 size = GET_MODE_SIZE (Pmode);
1340 rtx value = gen_reg_rtx (Pmode);
1341 emit_move_insn (value, adjust_address (arguments, Pmode, size));
1342 emit_move_insn (struct_value, value);
1343 if (REG_P (struct_value))
1344 use_reg (&call_fusage, struct_value);
1345 size += GET_MODE_SIZE (Pmode);
1348 /* All arguments and registers used for the call are set up by now! */
1349 function = prepare_call_address (function, NULL, &call_fusage, 0, 0);
1351 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1352 and we don't want to load it into a register as an optimization,
1353 because prepare_call_address already did it if it should be done. */
1354 if (GET_CODE (function) != SYMBOL_REF)
1355 function = memory_address (FUNCTION_MODE, function);
1357 /* Generate the actual call instruction and save the return value. */
1358 #ifdef HAVE_untyped_call
1359 if (HAVE_untyped_call)
1360 emit_call_insn (gen_untyped_call (gen_rtx_MEM (FUNCTION_MODE, function),
1361 result, result_vector (1, result)));
1364 #ifdef HAVE_call_value
1365 if (HAVE_call_value)
1369 /* Locate the unique return register. It is not possible to
1370 express a call that sets more than one return register using
1371 call_value; use untyped_call for that. In fact, untyped_call
1372 only needs to save the return registers in the given block. */
1373 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1374 if ((mode = apply_result_mode[regno]) != VOIDmode)
1376 gcc_assert (!valreg); /* HAVE_untyped_call required. */
1378 valreg = gen_rtx_REG (mode, regno);
1381 emit_call_insn (GEN_CALL_VALUE (valreg,
1382 gen_rtx_MEM (FUNCTION_MODE, function),
1383 const0_rtx, NULL_RTX, const0_rtx));
1385 emit_move_insn (adjust_address (result, GET_MODE (valreg), 0), valreg);
1391 /* Find the CALL insn we just emitted, and attach the register usage
1393 call_insn = last_call_insn ();
1394 add_function_usage_to (call_insn, call_fusage);
1396 /* Restore the stack. */
1397 #ifdef HAVE_save_stack_nonlocal
1398 if (HAVE_save_stack_nonlocal)
1399 emit_stack_restore (SAVE_NONLOCAL, old_stack_level, NULL_RTX);
1402 emit_stack_restore (SAVE_BLOCK, old_stack_level, NULL_RTX);
1406 /* Return the address of the result block. */
1407 result = copy_addr_to_reg (XEXP (result, 0));
1408 return convert_memory_address (ptr_mode, result);
1411 /* Perform an untyped return. */
1414 expand_builtin_return (rtx result)
1416 int size, align, regno;
1417 enum machine_mode mode;
1419 rtx call_fusage = 0;
1421 result = convert_memory_address (Pmode, result);
1423 apply_result_size ();
1424 result = gen_rtx_MEM (BLKmode, result);
1426 #ifdef HAVE_untyped_return
1427 if (HAVE_untyped_return)
1429 emit_jump_insn (gen_untyped_return (result, result_vector (0, result)));
1435 /* Restore the return value and note that each value is used. */
1437 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1438 if ((mode = apply_result_mode[regno]) != VOIDmode)
1440 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1441 if (size % align != 0)
1442 size = CEIL (size, align) * align;
1443 reg = gen_rtx_REG (mode, INCOMING_REGNO (regno));
1444 emit_move_insn (reg, adjust_address (result, mode, size));
1446 push_to_sequence (call_fusage);
1447 emit_insn (gen_rtx_USE (VOIDmode, reg));
1448 call_fusage = get_insns ();
1450 size += GET_MODE_SIZE (mode);
1453 /* Put the USE insns before the return. */
1454 emit_insn (call_fusage);
1456 /* Return whatever values was restored by jumping directly to the end
1458 expand_naked_return ();
1461 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1463 static enum type_class
1464 type_to_class (tree type)
1466 switch (TREE_CODE (type))
1468 case VOID_TYPE: return void_type_class;
1469 case INTEGER_TYPE: return integer_type_class;
1470 case CHAR_TYPE: return char_type_class;
1471 case ENUMERAL_TYPE: return enumeral_type_class;
1472 case BOOLEAN_TYPE: return boolean_type_class;
1473 case POINTER_TYPE: return pointer_type_class;
1474 case REFERENCE_TYPE: return reference_type_class;
1475 case OFFSET_TYPE: return offset_type_class;
1476 case REAL_TYPE: return real_type_class;
1477 case COMPLEX_TYPE: return complex_type_class;
1478 case FUNCTION_TYPE: return function_type_class;
1479 case METHOD_TYPE: return method_type_class;
1480 case RECORD_TYPE: return record_type_class;
1482 case QUAL_UNION_TYPE: return union_type_class;
1483 case ARRAY_TYPE: return (TYPE_STRING_FLAG (type)
1484 ? string_type_class : array_type_class);
1485 case FILE_TYPE: return file_type_class;
1486 case LANG_TYPE: return lang_type_class;
1487 default: return no_type_class;
1491 /* Expand a call to __builtin_classify_type with arguments found in
1495 expand_builtin_classify_type (tree arglist)
1498 return GEN_INT (type_to_class (TREE_TYPE (TREE_VALUE (arglist))));
1499 return GEN_INT (no_type_class);
1502 /* This helper macro, meant to be used in mathfn_built_in below,
1503 determines which among a set of three builtin math functions is
1504 appropriate for a given type mode. The `F' and `L' cases are
1505 automatically generated from the `double' case. */
1506 #define CASE_MATHFN(BUILT_IN_MATHFN) \
1507 case BUILT_IN_MATHFN: case BUILT_IN_MATHFN##F: case BUILT_IN_MATHFN##L: \
1508 fcode = BUILT_IN_MATHFN; fcodef = BUILT_IN_MATHFN##F ; \
1509 fcodel = BUILT_IN_MATHFN##L ; break;
1511 /* Return mathematic function equivalent to FN but operating directly
1512 on TYPE, if available. If we can't do the conversion, return zero. */
1514 mathfn_built_in (tree type, enum built_in_function fn)
1516 enum built_in_function fcode, fcodef, fcodel;
1520 CASE_MATHFN (BUILT_IN_ACOS)
1521 CASE_MATHFN (BUILT_IN_ACOSH)
1522 CASE_MATHFN (BUILT_IN_ASIN)
1523 CASE_MATHFN (BUILT_IN_ASINH)
1524 CASE_MATHFN (BUILT_IN_ATAN)
1525 CASE_MATHFN (BUILT_IN_ATAN2)
1526 CASE_MATHFN (BUILT_IN_ATANH)
1527 CASE_MATHFN (BUILT_IN_CBRT)
1528 CASE_MATHFN (BUILT_IN_CEIL)
1529 CASE_MATHFN (BUILT_IN_COPYSIGN)
1530 CASE_MATHFN (BUILT_IN_COS)
1531 CASE_MATHFN (BUILT_IN_COSH)
1532 CASE_MATHFN (BUILT_IN_DREM)
1533 CASE_MATHFN (BUILT_IN_ERF)
1534 CASE_MATHFN (BUILT_IN_ERFC)
1535 CASE_MATHFN (BUILT_IN_EXP)
1536 CASE_MATHFN (BUILT_IN_EXP10)
1537 CASE_MATHFN (BUILT_IN_EXP2)
1538 CASE_MATHFN (BUILT_IN_EXPM1)
1539 CASE_MATHFN (BUILT_IN_FABS)
1540 CASE_MATHFN (BUILT_IN_FDIM)
1541 CASE_MATHFN (BUILT_IN_FLOOR)
1542 CASE_MATHFN (BUILT_IN_FMA)
1543 CASE_MATHFN (BUILT_IN_FMAX)
1544 CASE_MATHFN (BUILT_IN_FMIN)
1545 CASE_MATHFN (BUILT_IN_FMOD)
1546 CASE_MATHFN (BUILT_IN_FREXP)
1547 CASE_MATHFN (BUILT_IN_GAMMA)
1548 CASE_MATHFN (BUILT_IN_HUGE_VAL)
1549 CASE_MATHFN (BUILT_IN_HYPOT)
1550 CASE_MATHFN (BUILT_IN_ILOGB)
1551 CASE_MATHFN (BUILT_IN_INF)
1552 CASE_MATHFN (BUILT_IN_J0)
1553 CASE_MATHFN (BUILT_IN_J1)
1554 CASE_MATHFN (BUILT_IN_JN)
1555 CASE_MATHFN (BUILT_IN_LDEXP)
1556 CASE_MATHFN (BUILT_IN_LGAMMA)
1557 CASE_MATHFN (BUILT_IN_LLRINT)
1558 CASE_MATHFN (BUILT_IN_LLROUND)
1559 CASE_MATHFN (BUILT_IN_LOG)
1560 CASE_MATHFN (BUILT_IN_LOG10)
1561 CASE_MATHFN (BUILT_IN_LOG1P)
1562 CASE_MATHFN (BUILT_IN_LOG2)
1563 CASE_MATHFN (BUILT_IN_LOGB)
1564 CASE_MATHFN (BUILT_IN_LRINT)
1565 CASE_MATHFN (BUILT_IN_LROUND)
1566 CASE_MATHFN (BUILT_IN_MODF)
1567 CASE_MATHFN (BUILT_IN_NAN)
1568 CASE_MATHFN (BUILT_IN_NANS)
1569 CASE_MATHFN (BUILT_IN_NEARBYINT)
1570 CASE_MATHFN (BUILT_IN_NEXTAFTER)
1571 CASE_MATHFN (BUILT_IN_NEXTTOWARD)
1572 CASE_MATHFN (BUILT_IN_POW)
1573 CASE_MATHFN (BUILT_IN_POWI)
1574 CASE_MATHFN (BUILT_IN_POW10)
1575 CASE_MATHFN (BUILT_IN_REMAINDER)
1576 CASE_MATHFN (BUILT_IN_REMQUO)
1577 CASE_MATHFN (BUILT_IN_RINT)
1578 CASE_MATHFN (BUILT_IN_ROUND)
1579 CASE_MATHFN (BUILT_IN_SCALB)
1580 CASE_MATHFN (BUILT_IN_SCALBLN)
1581 CASE_MATHFN (BUILT_IN_SCALBN)
1582 CASE_MATHFN (BUILT_IN_SIGNIFICAND)
1583 CASE_MATHFN (BUILT_IN_SIN)
1584 CASE_MATHFN (BUILT_IN_SINCOS)
1585 CASE_MATHFN (BUILT_IN_SINH)
1586 CASE_MATHFN (BUILT_IN_SQRT)
1587 CASE_MATHFN (BUILT_IN_TAN)
1588 CASE_MATHFN (BUILT_IN_TANH)
1589 CASE_MATHFN (BUILT_IN_TGAMMA)
1590 CASE_MATHFN (BUILT_IN_TRUNC)
1591 CASE_MATHFN (BUILT_IN_Y0)
1592 CASE_MATHFN (BUILT_IN_Y1)
1593 CASE_MATHFN (BUILT_IN_YN)
1599 if (TYPE_MAIN_VARIANT (type) == double_type_node)
1600 return implicit_built_in_decls[fcode];
1601 else if (TYPE_MAIN_VARIANT (type) == float_type_node)
1602 return implicit_built_in_decls[fcodef];
1603 else if (TYPE_MAIN_VARIANT (type) == long_double_type_node)
1604 return implicit_built_in_decls[fcodel];
1609 /* If errno must be maintained, expand the RTL to check if the result,
1610 TARGET, of a built-in function call, EXP, is NaN, and if so set
1614 expand_errno_check (tree exp, rtx target)
1616 rtx lab = gen_label_rtx ();
1618 /* Test the result; if it is NaN, set errno=EDOM because
1619 the argument was not in the domain. */
1620 emit_cmp_and_jump_insns (target, target, EQ, 0, GET_MODE (target),
1624 /* If this built-in doesn't throw an exception, set errno directly. */
1625 if (TREE_NOTHROW (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
1627 #ifdef GEN_ERRNO_RTX
1628 rtx errno_rtx = GEN_ERRNO_RTX;
1631 = gen_rtx_MEM (word_mode, gen_rtx_SYMBOL_REF (Pmode, "errno"));
1633 emit_move_insn (errno_rtx, GEN_INT (TARGET_EDOM));
1639 /* We can't set errno=EDOM directly; let the library call do it.
1640 Pop the arguments right away in case the call gets deleted. */
1642 expand_call (exp, target, 0);
1648 /* Expand a call to one of the builtin math functions (sqrt, exp, or log).
1649 Return 0 if a normal call should be emitted rather than expanding the
1650 function in-line. EXP is the expression that is a call to the builtin
1651 function; if convenient, the result should be placed in TARGET.
1652 SUBTARGET may be used as the target for computing one of EXP's operands. */
1655 expand_builtin_mathfn (tree exp, rtx target, rtx subtarget)
1657 optab builtin_optab;
1658 rtx op0, insns, before_call;
1659 tree fndecl = get_callee_fndecl (exp);
1660 tree arglist = TREE_OPERAND (exp, 1);
1661 enum machine_mode mode;
1662 bool errno_set = false;
1665 if (!validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
1668 arg = TREE_VALUE (arglist);
1670 switch (DECL_FUNCTION_CODE (fndecl))
1673 case BUILT_IN_SQRTF:
1674 case BUILT_IN_SQRTL:
1675 errno_set = ! tree_expr_nonnegative_p (arg);
1676 builtin_optab = sqrt_optab;
1681 errno_set = true; builtin_optab = exp_optab; break;
1682 case BUILT_IN_EXP10:
1683 case BUILT_IN_EXP10F:
1684 case BUILT_IN_EXP10L:
1685 case BUILT_IN_POW10:
1686 case BUILT_IN_POW10F:
1687 case BUILT_IN_POW10L:
1688 errno_set = true; builtin_optab = exp10_optab; break;
1690 case BUILT_IN_EXP2F:
1691 case BUILT_IN_EXP2L:
1692 errno_set = true; builtin_optab = exp2_optab; break;
1693 case BUILT_IN_EXPM1:
1694 case BUILT_IN_EXPM1F:
1695 case BUILT_IN_EXPM1L:
1696 errno_set = true; builtin_optab = expm1_optab; break;
1698 case BUILT_IN_LOGBF:
1699 case BUILT_IN_LOGBL:
1700 errno_set = true; builtin_optab = logb_optab; break;
1701 case BUILT_IN_ILOGB:
1702 case BUILT_IN_ILOGBF:
1703 case BUILT_IN_ILOGBL:
1704 errno_set = true; builtin_optab = ilogb_optab; break;
1708 errno_set = true; builtin_optab = log_optab; break;
1709 case BUILT_IN_LOG10:
1710 case BUILT_IN_LOG10F:
1711 case BUILT_IN_LOG10L:
1712 errno_set = true; builtin_optab = log10_optab; break;
1714 case BUILT_IN_LOG2F:
1715 case BUILT_IN_LOG2L:
1716 errno_set = true; builtin_optab = log2_optab; break;
1717 case BUILT_IN_LOG1P:
1718 case BUILT_IN_LOG1PF:
1719 case BUILT_IN_LOG1PL:
1720 errno_set = true; builtin_optab = log1p_optab; break;
1722 case BUILT_IN_ASINF:
1723 case BUILT_IN_ASINL:
1724 builtin_optab = asin_optab; break;
1726 case BUILT_IN_ACOSF:
1727 case BUILT_IN_ACOSL:
1728 builtin_optab = acos_optab; break;
1732 builtin_optab = tan_optab; break;
1734 case BUILT_IN_ATANF:
1735 case BUILT_IN_ATANL:
1736 builtin_optab = atan_optab; break;
1737 case BUILT_IN_FLOOR:
1738 case BUILT_IN_FLOORF:
1739 case BUILT_IN_FLOORL:
1740 builtin_optab = floor_optab; break;
1742 case BUILT_IN_CEILF:
1743 case BUILT_IN_CEILL:
1744 builtin_optab = ceil_optab; break;
1745 case BUILT_IN_TRUNC:
1746 case BUILT_IN_TRUNCF:
1747 case BUILT_IN_TRUNCL:
1748 builtin_optab = btrunc_optab; break;
1749 case BUILT_IN_ROUND:
1750 case BUILT_IN_ROUNDF:
1751 case BUILT_IN_ROUNDL:
1752 builtin_optab = round_optab; break;
1753 case BUILT_IN_NEARBYINT:
1754 case BUILT_IN_NEARBYINTF:
1755 case BUILT_IN_NEARBYINTL:
1756 builtin_optab = nearbyint_optab; break;
1758 case BUILT_IN_RINTF:
1759 case BUILT_IN_RINTL:
1760 builtin_optab = rint_optab; break;
1765 /* Make a suitable register to place result in. */
1766 mode = TYPE_MODE (TREE_TYPE (exp));
1768 if (! flag_errno_math || ! HONOR_NANS (mode))
1771 /* Before working hard, check whether the instruction is available. */
1772 if (builtin_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
1774 target = gen_reg_rtx (mode);
1776 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
1777 need to expand the argument again. This way, we will not perform
1778 side-effects more the once. */
1779 narg = builtin_save_expr (arg);
1783 arglist = build_tree_list (NULL_TREE, arg);
1784 exp = build_function_call_expr (fndecl, arglist);
1787 op0 = expand_expr (arg, subtarget, VOIDmode, 0);
1791 /* Compute into TARGET.
1792 Set TARGET to wherever the result comes back. */
1793 target = expand_unop (mode, builtin_optab, op0, target, 0);
1798 expand_errno_check (exp, target);
1800 /* Output the entire sequence. */
1801 insns = get_insns ();
1807 /* If we were unable to expand via the builtin, stop the sequence
1808 (without outputting the insns) and call to the library function
1809 with the stabilized argument list. */
1813 before_call = get_last_insn ();
1815 target = expand_call (exp, target, target == const0_rtx);
1817 /* If this is a sqrt operation and we don't care about errno, try to
1818 attach a REG_EQUAL note with a SQRT rtx to the emitted libcall.
1819 This allows the semantics of the libcall to be visible to the RTL
1821 if (builtin_optab == sqrt_optab && !errno_set)
1823 /* Search backwards through the insns emitted by expand_call looking
1824 for the instruction with the REG_RETVAL note. */
1825 rtx last = get_last_insn ();
1826 while (last != before_call)
1828 if (find_reg_note (last, REG_RETVAL, NULL))
1830 rtx note = find_reg_note (last, REG_EQUAL, NULL);
1831 /* Check that the REQ_EQUAL note is an EXPR_LIST with
1832 two elements, i.e. symbol_ref(sqrt) and the operand. */
1834 && GET_CODE (note) == EXPR_LIST
1835 && GET_CODE (XEXP (note, 0)) == EXPR_LIST
1836 && XEXP (XEXP (note, 0), 1) != NULL_RTX
1837 && XEXP (XEXP (XEXP (note, 0), 1), 1) == NULL_RTX)
1839 rtx operand = XEXP (XEXP (XEXP (note, 0), 1), 0);
1840 /* Check operand is a register with expected mode. */
1843 && GET_MODE (operand) == mode)
1845 /* Replace the REG_EQUAL note with a SQRT rtx. */
1846 rtx equiv = gen_rtx_SQRT (mode, operand);
1847 set_unique_reg_note (last, REG_EQUAL, equiv);
1852 last = PREV_INSN (last);
1859 /* Expand a call to the builtin binary math functions (pow and atan2).
1860 Return 0 if a normal call should be emitted rather than expanding the
1861 function in-line. EXP is the expression that is a call to the builtin
1862 function; if convenient, the result should be placed in TARGET.
1863 SUBTARGET may be used as the target for computing one of EXP's
1867 expand_builtin_mathfn_2 (tree exp, rtx target, rtx subtarget)
1869 optab builtin_optab;
1870 rtx op0, op1, insns;
1871 int op1_type = REAL_TYPE;
1872 tree fndecl = get_callee_fndecl (exp);
1873 tree arglist = TREE_OPERAND (exp, 1);
1874 tree arg0, arg1, temp, narg;
1875 enum machine_mode mode;
1876 bool errno_set = true;
1879 if ((DECL_FUNCTION_CODE (fndecl) == BUILT_IN_LDEXP)
1880 || (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_LDEXPF)
1881 || (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_LDEXPL))
1882 op1_type = INTEGER_TYPE;
1884 if (!validate_arglist (arglist, REAL_TYPE, op1_type, VOID_TYPE))
1887 arg0 = TREE_VALUE (arglist);
1888 arg1 = TREE_VALUE (TREE_CHAIN (arglist));
1890 switch (DECL_FUNCTION_CODE (fndecl))
1895 builtin_optab = pow_optab; break;
1896 case BUILT_IN_ATAN2:
1897 case BUILT_IN_ATAN2F:
1898 case BUILT_IN_ATAN2L:
1899 builtin_optab = atan2_optab; break;
1900 case BUILT_IN_LDEXP:
1901 case BUILT_IN_LDEXPF:
1902 case BUILT_IN_LDEXPL:
1903 builtin_optab = ldexp_optab; break;
1905 case BUILT_IN_FMODF:
1906 case BUILT_IN_FMODL:
1907 builtin_optab = fmod_optab; break;
1909 case BUILT_IN_DREMF:
1910 case BUILT_IN_DREML:
1911 builtin_optab = drem_optab; break;
1916 /* Make a suitable register to place result in. */
1917 mode = TYPE_MODE (TREE_TYPE (exp));
1919 /* Before working hard, check whether the instruction is available. */
1920 if (builtin_optab->handlers[(int) mode].insn_code == CODE_FOR_nothing)
1923 target = gen_reg_rtx (mode);
1925 if (! flag_errno_math || ! HONOR_NANS (mode))
1928 /* Always stabilize the argument list. */
1929 narg = builtin_save_expr (arg1);
1933 temp = build_tree_list (NULL_TREE, narg);
1937 temp = TREE_CHAIN (arglist);
1939 narg = builtin_save_expr (arg0);
1943 arglist = tree_cons (NULL_TREE, narg, temp);
1947 arglist = tree_cons (NULL_TREE, arg0, temp);
1950 exp = build_function_call_expr (fndecl, arglist);
1952 op0 = expand_expr (arg0, subtarget, VOIDmode, 0);
1953 op1 = expand_expr (arg1, 0, VOIDmode, 0);
1957 /* Compute into TARGET.
1958 Set TARGET to wherever the result comes back. */
1959 target = expand_binop (mode, builtin_optab, op0, op1,
1960 target, 0, OPTAB_DIRECT);
1962 /* If we were unable to expand via the builtin, stop the sequence
1963 (without outputting the insns) and call to the library function
1964 with the stabilized argument list. */
1968 return expand_call (exp, target, target == const0_rtx);
1972 expand_errno_check (exp, target);
1974 /* Output the entire sequence. */
1975 insns = get_insns ();
1982 /* Expand a call to the builtin sin and cos math functions.
1983 Return 0 if a normal call should be emitted rather than expanding the
1984 function in-line. EXP is the expression that is a call to the builtin
1985 function; if convenient, the result should be placed in TARGET.
1986 SUBTARGET may be used as the target for computing one of EXP's
1990 expand_builtin_mathfn_3 (tree exp, rtx target, rtx subtarget)
1992 optab builtin_optab;
1994 tree fndecl = get_callee_fndecl (exp);
1995 tree arglist = TREE_OPERAND (exp, 1);
1996 enum machine_mode mode;
1997 bool errno_set = false;
2000 if (!validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
2003 arg = TREE_VALUE (arglist);
2005 switch (DECL_FUNCTION_CODE (fndecl))
2013 builtin_optab = sincos_optab; break;
2018 /* Make a suitable register to place result in. */
2019 mode = TYPE_MODE (TREE_TYPE (exp));
2021 if (! flag_errno_math || ! HONOR_NANS (mode))
2024 /* Check if sincos insn is available, otherwise fallback
2025 to sin or cos insn. */
2026 if (builtin_optab->handlers[(int) mode].insn_code == CODE_FOR_nothing) {
2027 switch (DECL_FUNCTION_CODE (fndecl))
2032 builtin_optab = sin_optab; break;
2036 builtin_optab = cos_optab; break;
2042 /* Before working hard, check whether the instruction is available. */
2043 if (builtin_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
2045 target = gen_reg_rtx (mode);
2047 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2048 need to expand the argument again. This way, we will not perform
2049 side-effects more the once. */
2050 narg = save_expr (arg);
2054 arglist = build_tree_list (NULL_TREE, arg);
2055 exp = build_function_call_expr (fndecl, arglist);
2058 op0 = expand_expr (arg, subtarget, VOIDmode, 0);
2062 /* Compute into TARGET.
2063 Set TARGET to wherever the result comes back. */
2064 if (builtin_optab == sincos_optab)
2068 switch (DECL_FUNCTION_CODE (fndecl))
2073 result = expand_twoval_unop (builtin_optab, op0, 0, target, 0);
2078 result = expand_twoval_unop (builtin_optab, op0, target, 0, 0);
2083 gcc_assert (result);
2087 target = expand_unop (mode, builtin_optab, op0, target, 0);
2093 expand_errno_check (exp, target);
2095 /* Output the entire sequence. */
2096 insns = get_insns ();
2102 /* If we were unable to expand via the builtin, stop the sequence
2103 (without outputting the insns) and call to the library function
2104 with the stabilized argument list. */
2108 target = expand_call (exp, target, target == const0_rtx);
2113 /* To evaluate powi(x,n), the floating point value x raised to the
2114 constant integer exponent n, we use a hybrid algorithm that
2115 combines the "window method" with look-up tables. For an
2116 introduction to exponentiation algorithms and "addition chains",
2117 see section 4.6.3, "Evaluation of Powers" of Donald E. Knuth,
2118 "Seminumerical Algorithms", Vol. 2, "The Art of Computer Programming",
2119 3rd Edition, 1998, and Daniel M. Gordon, "A Survey of Fast Exponentiation
2120 Methods", Journal of Algorithms, Vol. 27, pp. 129-146, 1998. */
2122 /* Provide a default value for POWI_MAX_MULTS, the maximum number of
2123 multiplications to inline before calling the system library's pow
2124 function. powi(x,n) requires at worst 2*bits(n)-2 multiplications,
2125 so this default never requires calling pow, powf or powl. */
2127 #ifndef POWI_MAX_MULTS
2128 #define POWI_MAX_MULTS (2*HOST_BITS_PER_WIDE_INT-2)
2131 /* The size of the "optimal power tree" lookup table. All
2132 exponents less than this value are simply looked up in the
2133 powi_table below. This threshold is also used to size the
2134 cache of pseudo registers that hold intermediate results. */
2135 #define POWI_TABLE_SIZE 256
2137 /* The size, in bits of the window, used in the "window method"
2138 exponentiation algorithm. This is equivalent to a radix of
2139 (1<<POWI_WINDOW_SIZE) in the corresponding "m-ary method". */
2140 #define POWI_WINDOW_SIZE 3
2142 /* The following table is an efficient representation of an
2143 "optimal power tree". For each value, i, the corresponding
2144 value, j, in the table states than an optimal evaluation
2145 sequence for calculating pow(x,i) can be found by evaluating
2146 pow(x,j)*pow(x,i-j). An optimal power tree for the first
2147 100 integers is given in Knuth's "Seminumerical algorithms". */
2149 static const unsigned char powi_table[POWI_TABLE_SIZE] =
2151 0, 1, 1, 2, 2, 3, 3, 4, /* 0 - 7 */
2152 4, 6, 5, 6, 6, 10, 7, 9, /* 8 - 15 */
2153 8, 16, 9, 16, 10, 12, 11, 13, /* 16 - 23 */
2154 12, 17, 13, 18, 14, 24, 15, 26, /* 24 - 31 */
2155 16, 17, 17, 19, 18, 33, 19, 26, /* 32 - 39 */
2156 20, 25, 21, 40, 22, 27, 23, 44, /* 40 - 47 */
2157 24, 32, 25, 34, 26, 29, 27, 44, /* 48 - 55 */
2158 28, 31, 29, 34, 30, 60, 31, 36, /* 56 - 63 */
2159 32, 64, 33, 34, 34, 46, 35, 37, /* 64 - 71 */
2160 36, 65, 37, 50, 38, 48, 39, 69, /* 72 - 79 */
2161 40, 49, 41, 43, 42, 51, 43, 58, /* 80 - 87 */
2162 44, 64, 45, 47, 46, 59, 47, 76, /* 88 - 95 */
2163 48, 65, 49, 66, 50, 67, 51, 66, /* 96 - 103 */
2164 52, 70, 53, 74, 54, 104, 55, 74, /* 104 - 111 */
2165 56, 64, 57, 69, 58, 78, 59, 68, /* 112 - 119 */
2166 60, 61, 61, 80, 62, 75, 63, 68, /* 120 - 127 */
2167 64, 65, 65, 128, 66, 129, 67, 90, /* 128 - 135 */
2168 68, 73, 69, 131, 70, 94, 71, 88, /* 136 - 143 */
2169 72, 128, 73, 98, 74, 132, 75, 121, /* 144 - 151 */
2170 76, 102, 77, 124, 78, 132, 79, 106, /* 152 - 159 */
2171 80, 97, 81, 160, 82, 99, 83, 134, /* 160 - 167 */
2172 84, 86, 85, 95, 86, 160, 87, 100, /* 168 - 175 */
2173 88, 113, 89, 98, 90, 107, 91, 122, /* 176 - 183 */
2174 92, 111, 93, 102, 94, 126, 95, 150, /* 184 - 191 */
2175 96, 128, 97, 130, 98, 133, 99, 195, /* 192 - 199 */
2176 100, 128, 101, 123, 102, 164, 103, 138, /* 200 - 207 */
2177 104, 145, 105, 146, 106, 109, 107, 149, /* 208 - 215 */
2178 108, 200, 109, 146, 110, 170, 111, 157, /* 216 - 223 */
2179 112, 128, 113, 130, 114, 182, 115, 132, /* 224 - 231 */
2180 116, 200, 117, 132, 118, 158, 119, 206, /* 232 - 239 */
2181 120, 240, 121, 162, 122, 147, 123, 152, /* 240 - 247 */
2182 124, 166, 125, 214, 126, 138, 127, 153, /* 248 - 255 */
2186 /* Return the number of multiplications required to calculate
2187 powi(x,n) where n is less than POWI_TABLE_SIZE. This is a
2188 subroutine of powi_cost. CACHE is an array indicating
2189 which exponents have already been calculated. */
2192 powi_lookup_cost (unsigned HOST_WIDE_INT n, bool *cache)
2194 /* If we've already calculated this exponent, then this evaluation
2195 doesn't require any additional multiplications. */
2200 return powi_lookup_cost (n - powi_table[n], cache)
2201 + powi_lookup_cost (powi_table[n], cache) + 1;
2204 /* Return the number of multiplications required to calculate
2205 powi(x,n) for an arbitrary x, given the exponent N. This
2206 function needs to be kept in sync with expand_powi below. */
2209 powi_cost (HOST_WIDE_INT n)
2211 bool cache[POWI_TABLE_SIZE];
2212 unsigned HOST_WIDE_INT digit;
2213 unsigned HOST_WIDE_INT val;
2219 /* Ignore the reciprocal when calculating the cost. */
2220 val = (n < 0) ? -n : n;
2222 /* Initialize the exponent cache. */
2223 memset (cache, 0, POWI_TABLE_SIZE * sizeof (bool));
2228 while (val >= POWI_TABLE_SIZE)
2232 digit = val & ((1 << POWI_WINDOW_SIZE) - 1);
2233 result += powi_lookup_cost (digit, cache)
2234 + POWI_WINDOW_SIZE + 1;
2235 val >>= POWI_WINDOW_SIZE;
2244 return result + powi_lookup_cost (val, cache);
2247 /* Recursive subroutine of expand_powi. This function takes the array,
2248 CACHE, of already calculated exponents and an exponent N and returns
2249 an RTX that corresponds to CACHE[1]**N, as calculated in mode MODE. */
2252 expand_powi_1 (enum machine_mode mode, unsigned HOST_WIDE_INT n, rtx *cache)
2254 unsigned HOST_WIDE_INT digit;
2258 if (n < POWI_TABLE_SIZE)
2263 target = gen_reg_rtx (mode);
2266 op0 = expand_powi_1 (mode, n - powi_table[n], cache);
2267 op1 = expand_powi_1 (mode, powi_table[n], cache);
2271 target = gen_reg_rtx (mode);
2272 digit = n & ((1 << POWI_WINDOW_SIZE) - 1);
2273 op0 = expand_powi_1 (mode, n - digit, cache);
2274 op1 = expand_powi_1 (mode, digit, cache);
2278 target = gen_reg_rtx (mode);
2279 op0 = expand_powi_1 (mode, n >> 1, cache);
2283 result = expand_mult (mode, op0, op1, target, 0);
2284 if (result != target)
2285 emit_move_insn (target, result);
2289 /* Expand the RTL to evaluate powi(x,n) in mode MODE. X is the
2290 floating point operand in mode MODE, and N is the exponent. This
2291 function needs to be kept in sync with powi_cost above. */
2294 expand_powi (rtx x, enum machine_mode mode, HOST_WIDE_INT n)
2296 unsigned HOST_WIDE_INT val;
2297 rtx cache[POWI_TABLE_SIZE];
2301 return CONST1_RTX (mode);
2303 val = (n < 0) ? -n : n;
2305 memset (cache, 0, sizeof (cache));
2308 result = expand_powi_1 (mode, (n < 0) ? -n : n, cache);
2310 /* If the original exponent was negative, reciprocate the result. */
2312 result = expand_binop (mode, sdiv_optab, CONST1_RTX (mode),
2313 result, NULL_RTX, 0, OPTAB_LIB_WIDEN);
2318 /* Expand a call to the pow built-in mathematical function. Return 0 if
2319 a normal call should be emitted rather than expanding the function
2320 in-line. EXP is the expression that is a call to the builtin
2321 function; if convenient, the result should be placed in TARGET. */
2324 expand_builtin_pow (tree exp, rtx target, rtx subtarget)
2326 tree arglist = TREE_OPERAND (exp, 1);
2329 if (! validate_arglist (arglist, REAL_TYPE, REAL_TYPE, VOID_TYPE))
2332 arg0 = TREE_VALUE (arglist);
2333 arg1 = TREE_VALUE (TREE_CHAIN (arglist));
2335 if (TREE_CODE (arg1) == REAL_CST
2336 && ! TREE_CONSTANT_OVERFLOW (arg1))
2338 REAL_VALUE_TYPE cint;
2342 c = TREE_REAL_CST (arg1);
2343 n = real_to_integer (&c);
2344 real_from_integer (&cint, VOIDmode, n, n < 0 ? -1 : 0, 0);
2345 if (real_identical (&c, &cint))
2347 /* If the exponent is -1, 0, 1 or 2, then expand_powi is exact.
2348 Otherwise, check the number of multiplications required.
2349 Note that pow never sets errno for an integer exponent. */
2350 if ((n >= -1 && n <= 2)
2351 || (flag_unsafe_math_optimizations
2353 && powi_cost (n) <= POWI_MAX_MULTS))
2355 enum machine_mode mode = TYPE_MODE (TREE_TYPE (exp));
2356 rtx op = expand_expr (arg0, subtarget, VOIDmode, 0);
2357 op = force_reg (mode, op);
2358 return expand_powi (op, mode, n);
2363 if (! flag_unsafe_math_optimizations)
2365 return expand_builtin_mathfn_2 (exp, target, subtarget);
2368 /* Expand a call to the powi built-in mathematical function. Return 0 if
2369 a normal call should be emitted rather than expanding the function
2370 in-line. EXP is the expression that is a call to the builtin
2371 function; if convenient, the result should be placed in TARGET. */
2374 expand_builtin_powi (tree exp, rtx target, rtx subtarget)
2376 tree arglist = TREE_OPERAND (exp, 1);
2379 enum machine_mode mode;
2381 if (! validate_arglist (arglist, REAL_TYPE, INTEGER_TYPE, VOID_TYPE))
2384 arg0 = TREE_VALUE (arglist);
2385 arg1 = TREE_VALUE (TREE_CHAIN (arglist));
2386 mode = TYPE_MODE (TREE_TYPE (exp));
2388 /* Handle constant power. */
2390 if (TREE_CODE (arg1) == INTEGER_CST
2391 && ! TREE_CONSTANT_OVERFLOW (arg1))
2393 HOST_WIDE_INT n = TREE_INT_CST_LOW (arg1);
2395 /* If the exponent is -1, 0, 1 or 2, then expand_powi is exact.
2396 Otherwise, check the number of multiplications required. */
2397 if ((TREE_INT_CST_HIGH (arg1) == 0
2398 || TREE_INT_CST_HIGH (arg1) == -1)
2399 && ((n >= -1 && n <= 2)
2401 && powi_cost (n) <= POWI_MAX_MULTS)))
2403 op0 = expand_expr (arg0, subtarget, VOIDmode, 0);
2404 op0 = force_reg (mode, op0);
2405 return expand_powi (op0, mode, n);
2409 /* Emit a libcall to libgcc. */
2411 if (target == NULL_RTX)
2412 target = gen_reg_rtx (mode);
2414 op0 = expand_expr (arg0, subtarget, mode, 0);
2415 if (GET_MODE (op0) != mode)
2416 op0 = convert_to_mode (mode, op0, 0);
2417 op1 = expand_expr (arg1, 0, word_mode, 0);
2418 if (GET_MODE (op1) != word_mode)
2419 op1 = convert_to_mode (word_mode, op1, 0);
2421 target = emit_library_call_value (powi_optab->handlers[(int) mode].libfunc,
2422 target, LCT_CONST_MAKE_BLOCK, mode, 2,
2423 op0, mode, op1, word_mode);
2428 /* Expand expression EXP which is a call to the strlen builtin. Return 0
2429 if we failed the caller should emit a normal call, otherwise
2430 try to get the result in TARGET, if convenient. */
2433 expand_builtin_strlen (tree arglist, rtx target,
2434 enum machine_mode target_mode)
2436 if (!validate_arglist (arglist, POINTER_TYPE, VOID_TYPE))
2441 tree len, src = TREE_VALUE (arglist);
2442 rtx result, src_reg, char_rtx, before_strlen;
2443 enum machine_mode insn_mode = target_mode, char_mode;
2444 enum insn_code icode = CODE_FOR_nothing;
2447 /* If the length can be computed at compile-time, return it. */
2448 len = c_strlen (src, 0);
2450 return expand_expr (len, target, target_mode, EXPAND_NORMAL);
2452 /* If the length can be computed at compile-time and is constant
2453 integer, but there are side-effects in src, evaluate
2454 src for side-effects, then return len.
2455 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
2456 can be optimized into: i++; x = 3; */
2457 len = c_strlen (src, 1);
2458 if (len && TREE_CODE (len) == INTEGER_CST)
2460 expand_expr (src, const0_rtx, VOIDmode, EXPAND_NORMAL);
2461 return expand_expr (len, target, target_mode, EXPAND_NORMAL);
2464 align = get_pointer_alignment (src, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
2466 /* If SRC is not a pointer type, don't do this operation inline. */
2470 /* Bail out if we can't compute strlen in the right mode. */
2471 while (insn_mode != VOIDmode)
2473 icode = strlen_optab->handlers[(int) insn_mode].insn_code;
2474 if (icode != CODE_FOR_nothing)
2477 insn_mode = GET_MODE_WIDER_MODE (insn_mode);
2479 if (insn_mode == VOIDmode)
2482 /* Make a place to write the result of the instruction. */
2486 && GET_MODE (result) == insn_mode
2487 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
2488 result = gen_reg_rtx (insn_mode);
2490 /* Make a place to hold the source address. We will not expand
2491 the actual source until we are sure that the expansion will
2492 not fail -- there are trees that cannot be expanded twice. */
2493 src_reg = gen_reg_rtx (Pmode);
2495 /* Mark the beginning of the strlen sequence so we can emit the
2496 source operand later. */
2497 before_strlen = get_last_insn ();
2499 char_rtx = const0_rtx;
2500 char_mode = insn_data[(int) icode].operand[2].mode;
2501 if (! (*insn_data[(int) icode].operand[2].predicate) (char_rtx,
2503 char_rtx = copy_to_mode_reg (char_mode, char_rtx);
2505 pat = GEN_FCN (icode) (result, gen_rtx_MEM (BLKmode, src_reg),
2506 char_rtx, GEN_INT (align));
2511 /* Now that we are assured of success, expand the source. */
2513 pat = expand_expr (src, src_reg, ptr_mode, EXPAND_NORMAL);
2515 emit_move_insn (src_reg, pat);
2520 emit_insn_after (pat, before_strlen);
2522 emit_insn_before (pat, get_insns ());
2524 /* Return the value in the proper mode for this function. */
2525 if (GET_MODE (result) == target_mode)
2527 else if (target != 0)
2528 convert_move (target, result, 0);
2530 target = convert_to_mode (target_mode, result, 0);
2536 /* Expand a call to the strstr builtin. Return 0 if we failed the
2537 caller should emit a normal call, otherwise try to get the result
2538 in TARGET, if convenient (and in mode MODE if that's convenient). */
2541 expand_builtin_strstr (tree arglist, tree type, rtx target, enum machine_mode mode)
2543 if (validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
2545 tree result = fold_builtin_strstr (arglist, type);
2547 return expand_expr (result, target, mode, EXPAND_NORMAL);
2552 /* Expand a call to the strchr builtin. Return 0 if we failed the
2553 caller should emit a normal call, otherwise try to get the result
2554 in TARGET, if convenient (and in mode MODE if that's convenient). */
2557 expand_builtin_strchr (tree arglist, tree type, rtx target, enum machine_mode mode)
2559 if (validate_arglist (arglist, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
2561 tree result = fold_builtin_strchr (arglist, type);
2563 return expand_expr (result, target, mode, EXPAND_NORMAL);
2565 /* FIXME: Should use strchrM optab so that ports can optimize this. */
2570 /* Expand a call to the strrchr builtin. Return 0 if we failed the
2571 caller should emit a normal call, otherwise try to get the result
2572 in TARGET, if convenient (and in mode MODE if that's convenient). */
2575 expand_builtin_strrchr (tree arglist, tree type, rtx target, enum machine_mode mode)
2577 if (validate_arglist (arglist, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
2579 tree result = fold_builtin_strrchr (arglist, type);
2581 return expand_expr (result, target, mode, EXPAND_NORMAL);
2586 /* Expand a call to the strpbrk builtin. Return 0 if we failed the
2587 caller should emit a normal call, otherwise try to get the result
2588 in TARGET, if convenient (and in mode MODE if that's convenient). */
2591 expand_builtin_strpbrk (tree arglist, tree type, rtx target, enum machine_mode mode)
2593 if (validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
2595 tree result = fold_builtin_strpbrk (arglist, type);
2597 return expand_expr (result, target, mode, EXPAND_NORMAL);
2602 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
2603 bytes from constant string DATA + OFFSET and return it as target
2607 builtin_memcpy_read_str (void *data, HOST_WIDE_INT offset,
2608 enum machine_mode mode)
2610 const char *str = (const char *) data;
2612 gcc_assert (offset >= 0
2613 && ((unsigned HOST_WIDE_INT) offset + GET_MODE_SIZE (mode)
2614 <= strlen (str) + 1));
2616 return c_readstr (str + offset, mode);
2619 /* Expand a call to the memcpy builtin, with arguments in ARGLIST.
2620 Return 0 if we failed, the caller should emit a normal call,
2621 otherwise try to get the result in TARGET, if convenient (and in
2622 mode MODE if that's convenient). */
2624 expand_builtin_memcpy (tree exp, rtx target, enum machine_mode mode)
2626 tree fndecl = get_callee_fndecl (exp);
2627 tree arglist = TREE_OPERAND (exp, 1);
2628 if (!validate_arglist (arglist,
2629 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
2633 tree dest = TREE_VALUE (arglist);
2634 tree src = TREE_VALUE (TREE_CHAIN (arglist));
2635 tree len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
2636 const char *src_str;
2637 unsigned int src_align = get_pointer_alignment (src, BIGGEST_ALIGNMENT);
2638 unsigned int dest_align
2639 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
2640 rtx dest_mem, src_mem, dest_addr, len_rtx;
2641 tree result = fold_builtin_memcpy (fndecl, arglist);
2644 return expand_expr (result, target, mode, EXPAND_NORMAL);
2646 /* If DEST is not a pointer type, call the normal function. */
2647 if (dest_align == 0)
2650 /* If either SRC is not a pointer type, don't do this
2651 operation in-line. */
2655 dest_mem = get_memory_rtx (dest);
2656 set_mem_align (dest_mem, dest_align);
2657 len_rtx = expand_expr (len, NULL_RTX, VOIDmode, 0);
2658 src_str = c_getstr (src);
2660 /* If SRC is a string constant and block move would be done
2661 by pieces, we can avoid loading the string from memory
2662 and only stored the computed constants. */
2664 && GET_CODE (len_rtx) == CONST_INT
2665 && (unsigned HOST_WIDE_INT) INTVAL (len_rtx) <= strlen (src_str) + 1
2666 && can_store_by_pieces (INTVAL (len_rtx), builtin_memcpy_read_str,
2667 (void *) src_str, dest_align))
2669 dest_mem = store_by_pieces (dest_mem, INTVAL (len_rtx),
2670 builtin_memcpy_read_str,
2671 (void *) src_str, dest_align, 0);
2672 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
2673 dest_mem = convert_memory_address (ptr_mode, dest_mem);
2677 src_mem = get_memory_rtx (src);
2678 set_mem_align (src_mem, src_align);
2680 /* Copy word part most expediently. */
2681 dest_addr = emit_block_move (dest_mem, src_mem, len_rtx,
2686 dest_addr = force_operand (XEXP (dest_mem, 0), NULL_RTX);
2687 dest_addr = convert_memory_address (ptr_mode, dest_addr);
2693 /* Expand a call to the mempcpy builtin, with arguments in ARGLIST.
2694 Return 0 if we failed the caller should emit a normal call,
2695 otherwise try to get the result in TARGET, if convenient (and in
2696 mode MODE if that's convenient). If ENDP is 0 return the
2697 destination pointer, if ENDP is 1 return the end pointer ala
2698 mempcpy, and if ENDP is 2 return the end pointer minus one ala
2702 expand_builtin_mempcpy (tree arglist, tree type, rtx target, enum machine_mode mode,
2705 if (!validate_arglist (arglist,
2706 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
2708 /* If return value is ignored, transform mempcpy into memcpy. */
2709 else if (target == const0_rtx)
2711 tree fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
2716 return expand_expr (build_function_call_expr (fn, arglist),
2717 target, mode, EXPAND_NORMAL);
2721 tree dest = TREE_VALUE (arglist);
2722 tree src = TREE_VALUE (TREE_CHAIN (arglist));
2723 tree len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
2724 const char *src_str;
2725 unsigned int src_align = get_pointer_alignment (src, BIGGEST_ALIGNMENT);
2726 unsigned int dest_align
2727 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
2728 rtx dest_mem, src_mem, len_rtx;
2729 tree result = fold_builtin_mempcpy (arglist, type, endp);
2732 return expand_expr (result, target, mode, EXPAND_NORMAL);
2734 /* If either SRC or DEST is not a pointer type, don't do this
2735 operation in-line. */
2736 if (dest_align == 0 || src_align == 0)
2739 /* If LEN is not constant, call the normal function. */
2740 if (! host_integerp (len, 1))
2743 len_rtx = expand_expr (len, NULL_RTX, VOIDmode, 0);
2744 src_str = c_getstr (src);
2746 /* If SRC is a string constant and block move would be done
2747 by pieces, we can avoid loading the string from memory
2748 and only stored the computed constants. */
2750 && GET_CODE (len_rtx) == CONST_INT
2751 && (unsigned HOST_WIDE_INT) INTVAL (len_rtx) <= strlen (src_str) + 1
2752 && can_store_by_pieces (INTVAL (len_rtx), builtin_memcpy_read_str,
2753 (void *) src_str, dest_align))
2755 dest_mem = get_memory_rtx (dest);
2756 set_mem_align (dest_mem, dest_align);
2757 dest_mem = store_by_pieces (dest_mem, INTVAL (len_rtx),
2758 builtin_memcpy_read_str,
2759 (void *) src_str, dest_align, endp);
2760 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
2761 dest_mem = convert_memory_address (ptr_mode, dest_mem);
2765 if (GET_CODE (len_rtx) == CONST_INT
2766 && can_move_by_pieces (INTVAL (len_rtx),
2767 MIN (dest_align, src_align)))
2769 dest_mem = get_memory_rtx (dest);
2770 set_mem_align (dest_mem, dest_align);
2771 src_mem = get_memory_rtx (src);
2772 set_mem_align (src_mem, src_align);
2773 dest_mem = move_by_pieces (dest_mem, src_mem, INTVAL (len_rtx),
2774 MIN (dest_align, src_align), endp);
2775 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
2776 dest_mem = convert_memory_address (ptr_mode, dest_mem);
2784 /* Expand expression EXP, which is a call to the memmove builtin. Return 0
2785 if we failed the caller should emit a normal call. */
2788 expand_builtin_memmove (tree arglist, tree type, rtx target,
2789 enum machine_mode mode)
2791 if (!validate_arglist (arglist,
2792 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
2796 tree dest = TREE_VALUE (arglist);
2797 tree src = TREE_VALUE (TREE_CHAIN (arglist));
2798 tree len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
2800 unsigned int src_align = get_pointer_alignment (src, BIGGEST_ALIGNMENT);
2801 unsigned int dest_align
2802 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
2803 tree result = fold_builtin_memmove (arglist, type);
2806 return expand_expr (result, target, mode, EXPAND_NORMAL);
2808 /* If DEST is not a pointer type, call the normal function. */
2809 if (dest_align == 0)
2812 /* If either SRC is not a pointer type, don't do this
2813 operation in-line. */
2817 /* If src is categorized for a readonly section we can use
2819 if (readonly_data_expr (src))
2821 tree const fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
2824 return expand_expr (build_function_call_expr (fn, arglist),
2825 target, mode, EXPAND_NORMAL);
2828 /* If length is 1 and we can expand memcpy call inline,
2829 it is ok to use memcpy as well. */
2830 if (integer_onep (len))
2832 rtx ret = expand_builtin_mempcpy (arglist, type, target, mode,
2838 /* Otherwise, call the normal function. */
2843 /* Expand expression EXP, which is a call to the bcopy builtin. Return 0
2844 if we failed the caller should emit a normal call. */
2847 expand_builtin_bcopy (tree arglist, tree type)
2849 tree src, dest, size, newarglist;
2851 if (!validate_arglist (arglist,
2852 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
2855 src = TREE_VALUE (arglist);
2856 dest = TREE_VALUE (TREE_CHAIN (arglist));
2857 size = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
2859 /* New argument list transforming bcopy(ptr x, ptr y, int z) to
2860 memmove(ptr y, ptr x, size_t z). This is done this way
2861 so that if it isn't expanded inline, we fallback to
2862 calling bcopy instead of memmove. */
2864 newarglist = build_tree_list (NULL_TREE, fold_convert (sizetype, size));
2865 newarglist = tree_cons (NULL_TREE, src, newarglist);
2866 newarglist = tree_cons (NULL_TREE, dest, newarglist);
2868 return expand_builtin_memmove (newarglist, type, const0_rtx, VOIDmode);
2872 # define HAVE_movstr 0
2873 # define CODE_FOR_movstr CODE_FOR_nothing
2876 /* Expand into a movstr instruction, if one is available. Return 0 if
2877 we failed, the caller should emit a normal call, otherwise try to
2878 get the result in TARGET, if convenient. If ENDP is 0 return the
2879 destination pointer, if ENDP is 1 return the end pointer ala
2880 mempcpy, and if ENDP is 2 return the end pointer minus one ala
2884 expand_movstr (tree dest, tree src, rtx target, int endp)
2890 const struct insn_data * data;
2895 dest_mem = get_memory_rtx (dest);
2896 src_mem = get_memory_rtx (src);
2899 target = force_reg (Pmode, XEXP (dest_mem, 0));
2900 dest_mem = replace_equiv_address (dest_mem, target);
2901 end = gen_reg_rtx (Pmode);
2905 if (target == 0 || target == const0_rtx)
2907 end = gen_reg_rtx (Pmode);
2915 data = insn_data + CODE_FOR_movstr;
2917 if (data->operand[0].mode != VOIDmode)
2918 end = gen_lowpart (data->operand[0].mode, end);
2920 insn = data->genfun (end, dest_mem, src_mem);
2926 /* movstr is supposed to set end to the address of the NUL
2927 terminator. If the caller requested a mempcpy-like return value,
2929 if (endp == 1 && target != const0_rtx)
2931 rtx tem = plus_constant (gen_lowpart (GET_MODE (target), end), 1);
2932 emit_move_insn (target, force_operand (tem, NULL_RTX));
2938 /* Expand expression EXP, which is a call to the strcpy builtin. Return 0
2939 if we failed the caller should emit a normal call, otherwise try to get
2940 the result in TARGET, if convenient (and in mode MODE if that's
2944 expand_builtin_strcpy (tree exp, rtx target, enum machine_mode mode)
2946 tree fndecl = get_callee_fndecl (exp);
2947 tree arglist = TREE_OPERAND (exp, 1);
2948 if (validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
2950 tree result = fold_builtin_strcpy (fndecl, arglist, 0);
2952 return expand_expr (result, target, mode, EXPAND_NORMAL);
2954 return expand_movstr (TREE_VALUE (arglist),
2955 TREE_VALUE (TREE_CHAIN (arglist)),
2956 target, /*endp=*/0);
2961 /* Expand a call to the stpcpy builtin, with arguments in ARGLIST.
2962 Return 0 if we failed the caller should emit a normal call,
2963 otherwise try to get the result in TARGET, if convenient (and in
2964 mode MODE if that's convenient). */
2967 expand_builtin_stpcpy (tree exp, rtx target, enum machine_mode mode)
2969 tree arglist = TREE_OPERAND (exp, 1);
2970 /* If return value is ignored, transform stpcpy into strcpy. */
2971 if (target == const0_rtx)
2973 tree fn = implicit_built_in_decls[BUILT_IN_STRCPY];
2977 return expand_expr (build_function_call_expr (fn, arglist),
2978 target, mode, EXPAND_NORMAL);
2981 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
2985 tree dst, src, len, lenp1;
2989 /* Ensure we get an actual string whose length can be evaluated at
2990 compile-time, not an expression containing a string. This is
2991 because the latter will potentially produce pessimized code
2992 when used to produce the return value. */
2993 src = TREE_VALUE (TREE_CHAIN (arglist));
2994 if (! c_getstr (src) || ! (len = c_strlen (src, 0)))
2995 return expand_movstr (TREE_VALUE (arglist),
2996 TREE_VALUE (TREE_CHAIN (arglist)),
2997 target, /*endp=*/2);
2999 dst = TREE_VALUE (arglist);
3000 lenp1 = size_binop (PLUS_EXPR, len, ssize_int (1));
3001 narglist = build_tree_list (NULL_TREE, lenp1);
3002 narglist = tree_cons (NULL_TREE, src, narglist);
3003 narglist = tree_cons (NULL_TREE, dst, narglist);
3004 ret = expand_builtin_mempcpy (narglist, TREE_TYPE (exp),
3005 target, mode, /*endp=*/2);
3010 if (TREE_CODE (len) == INTEGER_CST)
3012 rtx len_rtx = expand_expr (len, NULL_RTX, VOIDmode, 0);
3014 if (GET_CODE (len_rtx) == CONST_INT)
3016 ret = expand_builtin_strcpy (exp, target, mode);
3022 if (mode != VOIDmode)
3023 target = gen_reg_rtx (mode);
3025 target = gen_reg_rtx (GET_MODE (ret));
3027 if (GET_MODE (target) != GET_MODE (ret))
3028 ret = gen_lowpart (GET_MODE (target), ret);
3030 ret = plus_constant (ret, INTVAL (len_rtx));
3031 ret = emit_move_insn (target, force_operand (ret, NULL_RTX));
3039 return expand_movstr (TREE_VALUE (arglist),
3040 TREE_VALUE (TREE_CHAIN (arglist)),
3041 target, /*endp=*/2);
3045 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3046 bytes from constant string DATA + OFFSET and return it as target
3050 builtin_strncpy_read_str (void *data, HOST_WIDE_INT offset,
3051 enum machine_mode mode)
3053 const char *str = (const char *) data;
3055 if ((unsigned HOST_WIDE_INT) offset > strlen (str))
3058 return c_readstr (str + offset, mode);
3061 /* Expand expression EXP, which is a call to the strncpy builtin. Return 0
3062 if we failed the caller should emit a normal call. */
3065 expand_builtin_strncpy (tree exp, rtx target, enum machine_mode mode)
3067 tree fndecl = get_callee_fndecl (exp);
3068 tree arglist = TREE_OPERAND (exp, 1);
3069 if (validate_arglist (arglist,
3070 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3072 tree slen = c_strlen (TREE_VALUE (TREE_CHAIN (arglist)), 1);
3073 tree len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
3074 tree result = fold_builtin_strncpy (fndecl, arglist, slen);
3077 return expand_expr (result, target, mode, EXPAND_NORMAL);
3079 /* We must be passed a constant len and src parameter. */
3080 if (!host_integerp (len, 1) || !slen || !host_integerp (slen, 1))
3083 slen = size_binop (PLUS_EXPR, slen, ssize_int (1));
3085 /* We're required to pad with trailing zeros if the requested
3086 len is greater than strlen(s2)+1. In that case try to
3087 use store_by_pieces, if it fails, punt. */
3088 if (tree_int_cst_lt (slen, len))
3090 tree dest = TREE_VALUE (arglist);
3091 unsigned int dest_align
3092 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
3093 const char *p = c_getstr (TREE_VALUE (TREE_CHAIN (arglist)));
3096 if (!p || dest_align == 0 || !host_integerp (len, 1)
3097 || !can_store_by_pieces (tree_low_cst (len, 1),
3098 builtin_strncpy_read_str,
3099 (void *) p, dest_align))
3102 dest_mem = get_memory_rtx (dest);
3103 store_by_pieces (dest_mem, tree_low_cst (len, 1),
3104 builtin_strncpy_read_str,
3105 (void *) p, dest_align, 0);
3106 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3107 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3114 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3115 bytes from constant string DATA + OFFSET and return it as target
3119 builtin_memset_read_str (void *data, HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
3120 enum machine_mode mode)
3122 const char *c = (const char *) data;
3123 char *p = alloca (GET_MODE_SIZE (mode));
3125 memset (p, *c, GET_MODE_SIZE (mode));
3127 return c_readstr (p, mode);
3130 /* Callback routine for store_by_pieces. Return the RTL of a register
3131 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
3132 char value given in the RTL register data. For example, if mode is
3133 4 bytes wide, return the RTL for 0x01010101*data. */
3136 builtin_memset_gen_str (void *data, HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
3137 enum machine_mode mode)
3143 size = GET_MODE_SIZE (mode);
3148 memset (p, 1, size);
3149 coeff = c_readstr (p, mode);
3151 target = convert_to_mode (mode, (rtx) data, 1);
3152 target = expand_mult (mode, target, coeff, NULL_RTX, 1);
3153 return force_reg (mode, target);
3156 /* Expand expression EXP, which is a call to the memset builtin. Return 0
3157 if we failed the caller should emit a normal call, otherwise try to get
3158 the result in TARGET, if convenient (and in mode MODE if that's
3162 expand_builtin_memset (tree arglist, rtx target, enum machine_mode mode)
3164 if (!validate_arglist (arglist,
3165 POINTER_TYPE, INTEGER_TYPE, INTEGER_TYPE, VOID_TYPE))
3169 tree dest = TREE_VALUE (arglist);
3170 tree val = TREE_VALUE (TREE_CHAIN (arglist));
3171 tree len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
3174 unsigned int dest_align
3175 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
3176 rtx dest_mem, dest_addr, len_rtx;
3178 /* If DEST is not a pointer type, don't do this
3179 operation in-line. */
3180 if (dest_align == 0)
3183 /* If the LEN parameter is zero, return DEST. */
3184 if (integer_zerop (len))
3186 /* Evaluate and ignore VAL in case it has side-effects. */
3187 expand_expr (val, const0_rtx, VOIDmode, EXPAND_NORMAL);
3188 return expand_expr (dest, target, mode, EXPAND_NORMAL);
3191 if (TREE_CODE (val) != INTEGER_CST)
3195 if (!host_integerp (len, 1))
3198 if (optimize_size && tree_low_cst (len, 1) > 1)
3201 /* Assume that we can memset by pieces if we can store the
3202 * the coefficients by pieces (in the required modes).
3203 * We can't pass builtin_memset_gen_str as that emits RTL. */
3205 if (!can_store_by_pieces (tree_low_cst (len, 1),
3206 builtin_memset_read_str,
3210 val = fold (build1 (CONVERT_EXPR, unsigned_char_type_node, val));
3211 val_rtx = expand_expr (val, NULL_RTX, VOIDmode, 0);
3212 val_rtx = force_reg (TYPE_MODE (unsigned_char_type_node),
3214 dest_mem = get_memory_rtx (dest);
3215 store_by_pieces (dest_mem, tree_low_cst (len, 1),
3216 builtin_memset_gen_str,
3217 val_rtx, dest_align, 0);
3218 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3219 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3223 if (target_char_cast (val, &c))
3228 if (!host_integerp (len, 1))
3230 if (!can_store_by_pieces (tree_low_cst (len, 1),
3231 builtin_memset_read_str, &c,
3235 dest_mem = get_memory_rtx (dest);
3236 store_by_pieces (dest_mem, tree_low_cst (len, 1),
3237 builtin_memset_read_str,
3239 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3240 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3244 len_rtx = expand_expr (len, NULL_RTX, VOIDmode, 0);
3246 dest_mem = get_memory_rtx (dest);
3247 set_mem_align (dest_mem, dest_align);
3248 dest_addr = clear_storage (dest_mem, len_rtx);
3252 dest_addr = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3253 dest_addr = convert_memory_address (ptr_mode, dest_addr);
3260 /* Expand expression EXP, which is a call to the bzero builtin. Return 0
3261 if we failed the caller should emit a normal call. */
3264 expand_builtin_bzero (tree arglist)
3266 tree dest, size, newarglist;
3268 if (!validate_arglist (arglist, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3271 dest = TREE_VALUE (arglist);
3272 size = TREE_VALUE (TREE_CHAIN (arglist));
3274 /* New argument list transforming bzero(ptr x, int y) to
3275 memset(ptr x, int 0, size_t y). This is done this way
3276 so that if it isn't expanded inline, we fallback to
3277 calling bzero instead of memset. */
3279 newarglist = build_tree_list (NULL_TREE, fold_convert (sizetype, size));
3280 newarglist = tree_cons (NULL_TREE, integer_zero_node, newarglist);
3281 newarglist = tree_cons (NULL_TREE, dest, newarglist);
3283 return expand_builtin_memset (newarglist, const0_rtx, VOIDmode);
3286 /* Expand expression EXP, which is a call to the memcmp built-in function.
3287 ARGLIST is the argument list for this call. Return 0 if we failed and the
3288 caller should emit a normal call, otherwise try to get the result in
3289 TARGET, if convenient (and in mode MODE, if that's convenient). */
3292 expand_builtin_memcmp (tree exp ATTRIBUTE_UNUSED, tree arglist, rtx target,
3293 enum machine_mode mode)
3295 if (!validate_arglist (arglist,
3296 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3300 tree result = fold_builtin_memcmp (arglist);
3302 return expand_expr (result, target, mode, EXPAND_NORMAL);
3305 #if defined HAVE_cmpmemsi || defined HAVE_cmpstrsi
3307 tree arg1 = TREE_VALUE (arglist);
3308 tree arg2 = TREE_VALUE (TREE_CHAIN (arglist));
3309 tree len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
3310 rtx arg1_rtx, arg2_rtx, arg3_rtx;
3315 = get_pointer_alignment (arg1, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3317 = get_pointer_alignment (arg2, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3318 enum machine_mode insn_mode;
3320 #ifdef HAVE_cmpmemsi
3322 insn_mode = insn_data[(int) CODE_FOR_cmpmemsi].operand[0].mode;
3325 #ifdef HAVE_cmpstrsi
3327 insn_mode = insn_data[(int) CODE_FOR_cmpstrsi].operand[0].mode;
3332 /* If we don't have POINTER_TYPE, call the function. */
3333 if (arg1_align == 0 || arg2_align == 0)
3336 /* Make a place to write the result of the instruction. */
3339 && REG_P (result) && GET_MODE (result) == insn_mode
3340 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
3341 result = gen_reg_rtx (insn_mode);
3343 arg1_rtx = get_memory_rtx (arg1);
3344 arg2_rtx = get_memory_rtx (arg2);
3345 arg3_rtx = expand_expr (len, NULL_RTX, VOIDmode, 0);
3347 /* Set MEM_SIZE as appropriate. */
3348 if (GET_CODE (arg3_rtx) == CONST_INT)
3350 set_mem_size (arg1_rtx, arg3_rtx);
3351 set_mem_size (arg2_rtx, arg3_rtx);
3354 #ifdef HAVE_cmpmemsi
3356 insn = gen_cmpmemsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
3357 GEN_INT (MIN (arg1_align, arg2_align)));
3360 #ifdef HAVE_cmpstrsi
3362 insn = gen_cmpstrsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
3363 GEN_INT (MIN (arg1_align, arg2_align)));
3371 emit_library_call_value (memcmp_libfunc, result, LCT_PURE_MAKE_BLOCK,
3372 TYPE_MODE (integer_type_node), 3,
3373 XEXP (arg1_rtx, 0), Pmode,
3374 XEXP (arg2_rtx, 0), Pmode,
3375 convert_to_mode (TYPE_MODE (sizetype), arg3_rtx,
3376 TYPE_UNSIGNED (sizetype)),
3377 TYPE_MODE (sizetype));
3379 /* Return the value in the proper mode for this function. */
3380 mode = TYPE_MODE (TREE_TYPE (exp));
3381 if (GET_MODE (result) == mode)
3383 else if (target != 0)
3385 convert_move (target, result, 0);
3389 return convert_to_mode (mode, result, 0);
3396 /* Expand expression EXP, which is a call to the strcmp builtin. Return 0
3397 if we failed the caller should emit a normal call, otherwise try to get
3398 the result in TARGET, if convenient. */
3401 expand_builtin_strcmp (tree exp, rtx target, enum machine_mode mode)
3403 tree arglist = TREE_OPERAND (exp, 1);
3405 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3409 tree result = fold_builtin_strcmp (arglist);
3411 return expand_expr (result, target, mode, EXPAND_NORMAL);
3414 #ifdef HAVE_cmpstrsi
3417 tree arg1 = TREE_VALUE (arglist);
3418 tree arg2 = TREE_VALUE (TREE_CHAIN (arglist));
3419 tree len, len1, len2;
3420 rtx arg1_rtx, arg2_rtx, arg3_rtx;
3425 = get_pointer_alignment (arg1, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3427 = get_pointer_alignment (arg2, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3428 enum machine_mode insn_mode
3429 = insn_data[(int) CODE_FOR_cmpstrsi].operand[0].mode;
3431 len1 = c_strlen (arg1, 1);
3432 len2 = c_strlen (arg2, 1);
3435 len1 = size_binop (PLUS_EXPR, ssize_int (1), len1);
3437 len2 = size_binop (PLUS_EXPR, ssize_int (1), len2);
3439 /* If we don't have a constant length for the first, use the length
3440 of the second, if we know it. We don't require a constant for
3441 this case; some cost analysis could be done if both are available
3442 but neither is constant. For now, assume they're equally cheap,
3443 unless one has side effects. If both strings have constant lengths,
3450 else if (TREE_SIDE_EFFECTS (len1))
3452 else if (TREE_SIDE_EFFECTS (len2))
3454 else if (TREE_CODE (len1) != INTEGER_CST)
3456 else if (TREE_CODE (len2) != INTEGER_CST)
3458 else if (tree_int_cst_lt (len1, len2))
3463 /* If both arguments have side effects, we cannot optimize. */
3464 if (!len || TREE_SIDE_EFFECTS (len))
3467 /* If we don't have POINTER_TYPE, call the function. */
3468 if (arg1_align == 0 || arg2_align == 0)
3471 /* Make a place to write the result of the instruction. */
3474 && REG_P (result) && GET_MODE (result) == insn_mode
3475 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
3476 result = gen_reg_rtx (insn_mode);
3478 /* Stabilize the arguments in case gen_cmpstrsi fails. */
3479 arg1 = builtin_save_expr (arg1);
3480 arg2 = builtin_save_expr (arg2);
3482 arg1_rtx = get_memory_rtx (arg1);
3483 arg2_rtx = get_memory_rtx (arg2);
3484 arg3_rtx = expand_expr (len, NULL_RTX, VOIDmode, 0);
3485 insn = gen_cmpstrsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
3486 GEN_INT (MIN (arg1_align, arg2_align)));
3491 /* Return the value in the proper mode for this function. */
3492 mode = TYPE_MODE (TREE_TYPE (exp));
3493 if (GET_MODE (result) == mode)
3496 return convert_to_mode (mode, result, 0);
3497 convert_move (target, result, 0);
3501 /* Expand the library call ourselves using a stabilized argument
3502 list to avoid re-evaluating the function's arguments twice. */
3503 arglist = build_tree_list (NULL_TREE, arg2);
3504 arglist = tree_cons (NULL_TREE, arg1, arglist);
3505 fndecl = get_callee_fndecl (exp);
3506 exp = build_function_call_expr (fndecl, arglist);
3507 return expand_call (exp, target, target == const0_rtx);
3513 /* Expand expression EXP, which is a call to the strncmp builtin. Return 0
3514 if we failed the caller should emit a normal call, otherwise try to get
3515 the result in TARGET, if convenient. */
3518 expand_builtin_strncmp (tree exp, rtx target, enum machine_mode mode)
3520 tree arglist = TREE_OPERAND (exp, 1);
3522 if (!validate_arglist (arglist,
3523 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3527 tree result = fold_builtin_strncmp (arglist);
3529 return expand_expr (result, target, mode, EXPAND_NORMAL);
3532 /* If c_strlen can determine an expression for one of the string
3533 lengths, and it doesn't have side effects, then emit cmpstrsi
3534 using length MIN(strlen(string)+1, arg3). */
3535 #ifdef HAVE_cmpstrsi
3538 tree arg1 = TREE_VALUE (arglist);
3539 tree arg2 = TREE_VALUE (TREE_CHAIN (arglist));
3540 tree arg3 = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
3541 tree len, len1, len2;
3542 rtx arg1_rtx, arg2_rtx, arg3_rtx;
3547 = get_pointer_alignment (arg1, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3549 = get_pointer_alignment (arg2, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3550 enum machine_mode insn_mode
3551 = insn_data[(int) CODE_FOR_cmpstrsi].operand[0].mode;
3553 len1 = c_strlen (arg1, 1);
3554 len2 = c_strlen (arg2, 1);
3557 len1 = size_binop (PLUS_EXPR, ssize_int (1), len1);
3559 len2 = size_binop (PLUS_EXPR, ssize_int (1), len2);
3561 /* If we don't have a constant length for the first, use the length
3562 of the second, if we know it. We don't require a constant for
3563 this case; some cost analysis could be done if both are available
3564 but neither is constant. For now, assume they're equally cheap,
3565 unless one has side effects. If both strings have constant lengths,
3572 else if (TREE_SIDE_EFFECTS (len1))
3574 else if (TREE_SIDE_EFFECTS (len2))
3576 else if (TREE_CODE (len1) != INTEGER_CST)
3578 else if (TREE_CODE (len2) != INTEGER_CST)
3580 else if (tree_int_cst_lt (len1, len2))
3585 /* If both arguments have side effects, we cannot optimize. */
3586 if (!len || TREE_SIDE_EFFECTS (len))
3589 /* The actual new length parameter is MIN(len,arg3). */
3590 len = fold (build2 (MIN_EXPR, TREE_TYPE (len), len,
3591 fold_convert (TREE_TYPE (len), arg3)));
3593 /* If we don't have POINTER_TYPE, call the function. */
3594 if (arg1_align == 0 || arg2_align == 0)
3597 /* Make a place to write the result of the instruction. */
3600 && REG_P (result) && GET_MODE (result) == insn_mode
3601 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
3602 result = gen_reg_rtx (insn_mode);
3604 /* Stabilize the arguments in case gen_cmpstrsi fails. */
3605 arg1 = builtin_save_expr (arg1);
3606 arg2 = builtin_save_expr (arg2);
3607 len = builtin_save_expr (len);
3609 arg1_rtx = get_memory_rtx (arg1);
3610 arg2_rtx = get_memory_rtx (arg2);
3611 arg3_rtx = expand_expr (len, NULL_RTX, VOIDmode, 0);
3612 insn = gen_cmpstrsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
3613 GEN_INT (MIN (arg1_align, arg2_align)));
3618 /* Return the value in the proper mode for this function. */
3619 mode = TYPE_MODE (TREE_TYPE (exp));
3620 if (GET_MODE (result) == mode)
3623 return convert_to_mode (mode, result, 0);
3624 convert_move (target, result, 0);
3628 /* Expand the library call ourselves using a stabilized argument
3629 list to avoid re-evaluating the function's arguments twice. */
3630 arglist = build_tree_list (NULL_TREE, len);
3631 arglist = tree_cons (NULL_TREE, arg2, arglist);
3632 arglist = tree_cons (NULL_TREE, arg1, arglist);
3633 fndecl = get_callee_fndecl (exp);
3634 exp = build_function_call_expr (fndecl, arglist);
3635 return expand_call (exp, target, target == const0_rtx);
3641 /* Expand expression EXP, which is a call to the strcat builtin.
3642 Return 0 if we failed the caller should emit a normal call,
3643 otherwise try to get the result in TARGET, if convenient. */
3646 expand_builtin_strcat (tree arglist, tree type, rtx target, enum machine_mode mode)
3648 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3652 tree dst = TREE_VALUE (arglist),
3653 src = TREE_VALUE (TREE_CHAIN (arglist));
3654 const char *p = c_getstr (src);
3658 /* If the string length is zero, return the dst parameter. */
3660 return expand_expr (dst, target, mode, EXPAND_NORMAL);
3661 else if (!optimize_size)
3663 /* Otherwise if !optimize_size, see if we can store by
3664 pieces into (dst + strlen(dst)). */
3665 tree newdst, arglist,
3666 strlen_fn = implicit_built_in_decls[BUILT_IN_STRLEN];
3668 /* This is the length argument. */
3669 arglist = build_tree_list (NULL_TREE,
3670 fold (size_binop (PLUS_EXPR,
3673 /* Prepend src argument. */
3674 arglist = tree_cons (NULL_TREE, src, arglist);
3676 /* We're going to use dst more than once. */
3677 dst = builtin_save_expr (dst);
3679 /* Create strlen (dst). */
3681 fold (build_function_call_expr (strlen_fn,
3682 build_tree_list (NULL_TREE,
3684 /* Create (dst + strlen (dst)). */
3685 newdst = fold (build2 (PLUS_EXPR, TREE_TYPE (dst), dst, newdst));
3687 /* Prepend the new dst argument. */
3688 arglist = tree_cons (NULL_TREE, newdst, arglist);
3690 /* We don't want to get turned into a memcpy if the
3691 target is const0_rtx, i.e. when the return value
3692 isn't used. That would produce pessimized code so
3693 pass in a target of zero, it should never actually be
3694 used. If this was successful return the original
3695 dst, not the result of mempcpy. */
3696 if (expand_builtin_mempcpy (arglist, type, /*target=*/0, mode, /*endp=*/0))
3697 return expand_expr (dst, target, mode, EXPAND_NORMAL);
3707 /* Expand expression EXP, which is a call to the strncat builtin.
3708 Return 0 if we failed the caller should emit a normal call,
3709 otherwise try to get the result in TARGET, if convenient. */
3712 expand_builtin_strncat (tree arglist, rtx target, enum machine_mode mode)
3714 if (validate_arglist (arglist,
3715 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3717 tree result = fold_builtin_strncat (arglist);
3719 return expand_expr (result, target, mode, EXPAND_NORMAL);
3724 /* Expand expression EXP, which is a call to the strspn builtin.
3725 Return 0 if we failed the caller should emit a normal call,
3726 otherwise try to get the result in TARGET, if convenient. */
3729 expand_builtin_strspn (tree arglist, rtx target, enum machine_mode mode)
3731 if (validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3733 tree result = fold_builtin_strspn (arglist);
3735 return expand_expr (result, target, mode, EXPAND_NORMAL);
3740 /* Expand expression EXP, which is a call to the strcspn builtin.
3741 Return 0 if we failed the caller should emit a normal call,
3742 otherwise try to get the result in TARGET, if convenient. */
3745 expand_builtin_strcspn (tree arglist, rtx target, enum machine_mode mode)
3747 if (validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3749 tree result = fold_builtin_strcspn (arglist);
3751 return expand_expr (result, target, mode, EXPAND_NORMAL);
3756 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
3757 if that's convenient. */
3760 expand_builtin_saveregs (void)
3764 /* Don't do __builtin_saveregs more than once in a function.
3765 Save the result of the first call and reuse it. */
3766 if (saveregs_value != 0)
3767 return saveregs_value;
3769 /* When this function is called, it means that registers must be
3770 saved on entry to this function. So we migrate the call to the
3771 first insn of this function. */
3775 /* Do whatever the machine needs done in this case. */
3776 val = targetm.calls.expand_builtin_saveregs ();
3781 saveregs_value = val;
3783 /* Put the insns after the NOTE that starts the function. If this
3784 is inside a start_sequence, make the outer-level insn chain current, so
3785 the code is placed at the start of the function. */
3786 push_topmost_sequence ();
3787 emit_insn_after (seq, entry_of_function ());
3788 pop_topmost_sequence ();
3793 /* __builtin_args_info (N) returns word N of the arg space info
3794 for the current function. The number and meanings of words
3795 is controlled by the definition of CUMULATIVE_ARGS. */
3798 expand_builtin_args_info (tree arglist)
3800 int nwords = sizeof (CUMULATIVE_ARGS) / sizeof (int);
3801 int *word_ptr = (int *) ¤t_function_args_info;
3803 gcc_assert (sizeof (CUMULATIVE_ARGS) % sizeof (int) == 0);
3807 if (!host_integerp (TREE_VALUE (arglist), 0))
3808 error ("argument of %<__builtin_args_info%> must be constant");
3811 HOST_WIDE_INT wordnum = tree_low_cst (TREE_VALUE (arglist), 0);
3813 if (wordnum < 0 || wordnum >= nwords)
3814 error ("argument of %<__builtin_args_info%> out of range");
3816 return GEN_INT (word_ptr[wordnum]);
3820 error ("missing argument in %<__builtin_args_info%>");
3825 /* Expand a call to __builtin_next_arg. */
3828 expand_builtin_next_arg (void)
3830 /* Checking arguments is already done in fold_builtin_next_arg
3831 that must be called before this function. */
3832 return expand_binop (Pmode, add_optab,
3833 current_function_internal_arg_pointer,
3834 current_function_arg_offset_rtx,
3835 NULL_RTX, 0, OPTAB_LIB_WIDEN);
3838 /* Make it easier for the backends by protecting the valist argument
3839 from multiple evaluations. */
3842 stabilize_va_list (tree valist, int needs_lvalue)
3844 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
3846 if (TREE_SIDE_EFFECTS (valist))
3847 valist = save_expr (valist);
3849 /* For this case, the backends will be expecting a pointer to
3850 TREE_TYPE (va_list_type_node), but it's possible we've
3851 actually been given an array (an actual va_list_type_node).
3853 if (TREE_CODE (TREE_TYPE (valist)) == ARRAY_TYPE)
3855 tree p1 = build_pointer_type (TREE_TYPE (va_list_type_node));
3856 valist = build_fold_addr_expr_with_type (valist, p1);
3865 if (! TREE_SIDE_EFFECTS (valist))
3868 pt = build_pointer_type (va_list_type_node);
3869 valist = fold (build1 (ADDR_EXPR, pt, valist));
3870 TREE_SIDE_EFFECTS (valist) = 1;
3873 if (TREE_SIDE_EFFECTS (valist))
3874 valist = save_expr (valist);
3875 valist = build_fold_indirect_ref (valist);
3881 /* The "standard" definition of va_list is void*. */
3884 std_build_builtin_va_list (void)
3886 return ptr_type_node;
3889 /* The "standard" implementation of va_start: just assign `nextarg' to
3893 std_expand_builtin_va_start (tree valist, rtx nextarg)
3897 t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist,
3898 make_tree (ptr_type_node, nextarg));
3899 TREE_SIDE_EFFECTS (t) = 1;
3901 expand_expr (t, const0_rtx, VOIDmode, EXPAND_NORMAL);
3904 /* Expand ARGLIST, from a call to __builtin_va_start. */
3907 expand_builtin_va_start (tree arglist)
3912 chain = TREE_CHAIN (arglist);
3916 error ("too few arguments to function %<va_start%>");
3920 if (fold_builtin_next_arg (chain))
3923 nextarg = expand_builtin_next_arg ();
3924 valist = stabilize_va_list (TREE_VALUE (arglist), 1);
3926 #ifdef EXPAND_BUILTIN_VA_START
3927 EXPAND_BUILTIN_VA_START (valist, nextarg);
3929 std_expand_builtin_va_start (valist, nextarg);
3935 /* The "standard" implementation of va_arg: read the value from the
3936 current (padded) address and increment by the (padded) size. */
3939 std_gimplify_va_arg_expr (tree valist, tree type, tree *pre_p, tree *post_p)
3941 tree addr, t, type_size, rounded_size, valist_tmp;
3942 unsigned HOST_WIDE_INT align, boundary;
3945 #ifdef ARGS_GROW_DOWNWARD
3946 /* All of the alignment and movement below is for args-grow-up machines.
3947 As of 2004, there are only 3 ARGS_GROW_DOWNWARD targets, and they all
3948 implement their own specialized gimplify_va_arg_expr routines. */
3952 indirect = pass_by_reference (NULL, TYPE_MODE (type), type, false);
3954 type = build_pointer_type (type);
3956 align = PARM_BOUNDARY / BITS_PER_UNIT;
3957 boundary = FUNCTION_ARG_BOUNDARY (TYPE_MODE (type), type) / BITS_PER_UNIT;
3959 /* Hoist the valist value into a temporary for the moment. */
3960 valist_tmp = get_initialized_tmp_var (valist, pre_p, NULL);
3962 /* va_list pointer is aligned to PARM_BOUNDARY. If argument actually
3963 requires greater alignment, we must perform dynamic alignment. */
3964 if (boundary > align)
3966 t = fold_convert (TREE_TYPE (valist), size_int (boundary - 1));
3967 t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist_tmp,
3968 build2 (PLUS_EXPR, TREE_TYPE (valist), valist_tmp, t));
3969 gimplify_and_add (t, pre_p);
3971 t = fold_convert (TREE_TYPE (valist), size_int (-boundary));
3972 t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist_tmp,
3973 build2 (BIT_AND_EXPR, TREE_TYPE (valist), valist_tmp, t));
3974 gimplify_and_add (t, pre_p);
3979 /* If the actual alignment is less than the alignment of the type,
3980 adjust the type accordingly so that we don't assume strict alignment
3981 when deferencing the pointer. */
3982 boundary *= BITS_PER_UNIT;
3983 if (boundary < TYPE_ALIGN (type))
3985 type = build_variant_type_copy (type);
3986 TYPE_ALIGN (type) = boundary;
3989 /* Compute the rounded size of the type. */
3990 type_size = size_in_bytes (type);
3991 rounded_size = round_up (type_size, align);
3993 /* Reduce rounded_size so it's sharable with the postqueue. */
3994 gimplify_expr (&rounded_size, pre_p, post_p, is_gimple_val, fb_rvalue);
3998 if (PAD_VARARGS_DOWN && !integer_zerop (rounded_size))
4000 /* Small args are padded downward. */
4001 t = fold (build2 (GT_EXPR, sizetype, rounded_size, size_int (align)));
4002 t = fold (build3 (COND_EXPR, sizetype, t, size_zero_node,
4003 size_binop (MINUS_EXPR, rounded_size, type_size)));
4004 t = fold_convert (TREE_TYPE (addr), t);
4005 addr = fold (build2 (PLUS_EXPR, TREE_TYPE (addr), addr, t));
4008 /* Compute new value for AP. */
4009 t = fold_convert (TREE_TYPE (valist), rounded_size);
4010 t = build2 (PLUS_EXPR, TREE_TYPE (valist), valist_tmp, t);
4011 t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist, t);
4012 gimplify_and_add (t, pre_p);
4014 addr = fold_convert (build_pointer_type (type), addr);
4017 addr = build_va_arg_indirect_ref (addr);
4019 return build_va_arg_indirect_ref (addr);
4022 /* Build an indirect-ref expression over the given TREE, which represents a
4023 piece of a va_arg() expansion. */
4025 build_va_arg_indirect_ref (tree addr)
4027 addr = build_fold_indirect_ref (addr);
4029 if (flag_mudflap) /* Don't instrument va_arg INDIRECT_REF. */
4035 /* Return a dummy expression of type TYPE in order to keep going after an
4039 dummy_object (tree type)
4041 tree t = convert (build_pointer_type (type), null_pointer_node);
4042 return build1 (INDIRECT_REF, type, t);
4045 /* Gimplify __builtin_va_arg, aka VA_ARG_EXPR, which is not really a
4046 builtin function, but a very special sort of operator. */
4048 enum gimplify_status
4049 gimplify_va_arg_expr (tree *expr_p, tree *pre_p, tree *post_p)
4051 tree promoted_type, want_va_type, have_va_type;
4052 tree valist = TREE_OPERAND (*expr_p, 0);
4053 tree type = TREE_TYPE (*expr_p);
4056 /* Verify that valist is of the proper type. */
4057 want_va_type = va_list_type_node;
4058 have_va_type = TREE_TYPE (valist);
4060 if (have_va_type == error_mark_node)
4063 if (TREE_CODE (want_va_type) == ARRAY_TYPE)
4065 /* If va_list is an array type, the argument may have decayed
4066 to a pointer type, e.g. by being passed to another function.
4067 In that case, unwrap both types so that we can compare the
4068 underlying records. */
4069 if (TREE_CODE (have_va_type) == ARRAY_TYPE
4070 || POINTER_TYPE_P (have_va_type))
4072 want_va_type = TREE_TYPE (want_va_type);
4073 have_va_type = TREE_TYPE (have_va_type);
4077 if (TYPE_MAIN_VARIANT (want_va_type) != TYPE_MAIN_VARIANT (have_va_type))
4079 error ("first argument to %<va_arg%> not of type %<va_list%>");
4083 /* Generate a diagnostic for requesting data of a type that cannot
4084 be passed through `...' due to type promotion at the call site. */
4085 else if ((promoted_type = lang_hooks.types.type_promotes_to (type))
4088 static bool gave_help;
4090 /* Unfortunately, this is merely undefined, rather than a constraint
4091 violation, so we cannot make this an error. If this call is never
4092 executed, the program is still strictly conforming. */
4093 warning ("%qT is promoted to %qT when passed through %<...%>",
4094 type, promoted_type);
4098 warning ("(so you should pass %qT not %qT to %<va_arg%>)",
4099 promoted_type, type);
4102 /* We can, however, treat "undefined" any way we please.
4103 Call abort to encourage the user to fix the program. */
4104 inform ("if this code is reached, the program will abort");
4105 t = build_function_call_expr (implicit_built_in_decls[BUILT_IN_TRAP],
4107 append_to_statement_list (t, pre_p);
4109 /* This is dead code, but go ahead and finish so that the
4110 mode of the result comes out right. */
4111 *expr_p = dummy_object (type);
4116 /* Make it easier for the backends by protecting the valist argument
4117 from multiple evaluations. */
4118 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
4120 /* For this case, the backends will be expecting a pointer to
4121 TREE_TYPE (va_list_type_node), but it's possible we've
4122 actually been given an array (an actual va_list_type_node).
4124 if (TREE_CODE (TREE_TYPE (valist)) == ARRAY_TYPE)
4126 tree p1 = build_pointer_type (TREE_TYPE (va_list_type_node));
4127 valist = build_fold_addr_expr_with_type (valist, p1);
4129 gimplify_expr (&valist, pre_p, post_p, is_gimple_val, fb_rvalue);
4132 gimplify_expr (&valist, pre_p, post_p, is_gimple_min_lval, fb_lvalue);
4134 if (!targetm.gimplify_va_arg_expr)
4135 /* Once most targets are converted this should abort. */
4138 *expr_p = targetm.gimplify_va_arg_expr (valist, type, pre_p, post_p);
4143 /* Expand ARGLIST, from a call to __builtin_va_end. */
4146 expand_builtin_va_end (tree arglist)
4148 tree valist = TREE_VALUE (arglist);
4150 /* Evaluate for side effects, if needed. I hate macros that don't
4152 if (TREE_SIDE_EFFECTS (valist))
4153 expand_expr (valist, const0_rtx, VOIDmode, EXPAND_NORMAL);
4158 /* Expand ARGLIST, from a call to __builtin_va_copy. We do this as a
4159 builtin rather than just as an assignment in stdarg.h because of the
4160 nastiness of array-type va_list types. */
4163 expand_builtin_va_copy (tree arglist)
4167 dst = TREE_VALUE (arglist);
4168 src = TREE_VALUE (TREE_CHAIN (arglist));
4170 dst = stabilize_va_list (dst, 1);
4171 src = stabilize_va_list (src, 0);
4173 if (TREE_CODE (va_list_type_node) != ARRAY_TYPE)
4175 t = build2 (MODIFY_EXPR, va_list_type_node, dst, src);
4176 TREE_SIDE_EFFECTS (t) = 1;
4177 expand_expr (t, const0_rtx, VOIDmode, EXPAND_NORMAL);
4181 rtx dstb, srcb, size;
4183 /* Evaluate to pointers. */
4184 dstb = expand_expr (dst, NULL_RTX, Pmode, EXPAND_NORMAL);
4185 srcb = expand_expr (src, NULL_RTX, Pmode, EXPAND_NORMAL);
4186 size = expand_expr (TYPE_SIZE_UNIT (va_list_type_node), NULL_RTX,
4187 VOIDmode, EXPAND_NORMAL);
4189 dstb = convert_memory_address (Pmode, dstb);
4190 srcb = convert_memory_address (Pmode, srcb);
4192 /* "Dereference" to BLKmode memories. */
4193 dstb = gen_rtx_MEM (BLKmode, dstb);
4194 set_mem_alias_set (dstb, get_alias_set (TREE_TYPE (TREE_TYPE (dst))));
4195 set_mem_align (dstb, TYPE_ALIGN (va_list_type_node));
4196 srcb = gen_rtx_MEM (BLKmode, srcb);
4197 set_mem_alias_set (srcb, get_alias_set (TREE_TYPE (TREE_TYPE (src))));
4198 set_mem_align (srcb, TYPE_ALIGN (va_list_type_node));
4201 emit_block_move (dstb, srcb, size, BLOCK_OP_NORMAL);
4207 /* Expand a call to one of the builtin functions __builtin_frame_address or
4208 __builtin_return_address. */
4211 expand_builtin_frame_address (tree fndecl, tree arglist)
4213 /* The argument must be a nonnegative integer constant.
4214 It counts the number of frames to scan up the stack.
4215 The value is the return address saved in that frame. */
4217 /* Warning about missing arg was already issued. */
4219 else if (! host_integerp (TREE_VALUE (arglist), 1))
4221 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS)
4222 error ("invalid argument to %<__builtin_frame_address%>");
4224 error ("invalid argument to %<__builtin_return_address%>");
4230 = expand_builtin_return_addr (DECL_FUNCTION_CODE (fndecl),
4231 tree_low_cst (TREE_VALUE (arglist), 1));
4233 /* Some ports cannot access arbitrary stack frames. */
4236 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS)
4237 warning ("unsupported argument to %<__builtin_frame_address%>");
4239 warning ("unsupported argument to %<__builtin_return_address%>");
4243 /* For __builtin_frame_address, return what we've got. */
4244 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS)
4248 && ! CONSTANT_P (tem))
4249 tem = copy_to_mode_reg (Pmode, tem);
4254 /* Expand a call to the alloca builtin, with arguments ARGLIST. Return 0 if
4255 we failed and the caller should emit a normal call, otherwise try to get
4256 the result in TARGET, if convenient. */
4259 expand_builtin_alloca (tree arglist, rtx target)
4264 /* In -fmudflap-instrumented code, alloca() and __builtin_alloca()
4265 should always expand to function calls. These can be intercepted
4270 if (!validate_arglist (arglist, INTEGER_TYPE, VOID_TYPE))
4273 /* Compute the argument. */
4274 op0 = expand_expr (TREE_VALUE (arglist), NULL_RTX, VOIDmode, 0);
4276 /* Allocate the desired space. */
4277 result = allocate_dynamic_stack_space (op0, target, BITS_PER_UNIT);
4278 result = convert_memory_address (ptr_mode, result);
4283 /* Expand a call to a unary builtin. The arguments are in ARGLIST.
4284 Return 0 if a normal call should be emitted rather than expanding the
4285 function in-line. If convenient, the result should be placed in TARGET.
4286 SUBTARGET may be used as the target for computing one of EXP's operands. */
4289 expand_builtin_unop (enum machine_mode target_mode, tree arglist, rtx target,
4290 rtx subtarget, optab op_optab)
4293 if (!validate_arglist (arglist, INTEGER_TYPE, VOID_TYPE))
4296 /* Compute the argument. */
4297 op0 = expand_expr (TREE_VALUE (arglist), subtarget, VOIDmode, 0);
4298 /* Compute op, into TARGET if possible.
4299 Set TARGET to wherever the result comes back. */
4300 target = expand_unop (TYPE_MODE (TREE_TYPE (TREE_VALUE (arglist))),
4301 op_optab, op0, target, 1);
4302 gcc_assert (target);
4304 return convert_to_mode (target_mode, target, 0);
4307 /* If the string passed to fputs is a constant and is one character
4308 long, we attempt to transform this call into __builtin_fputc(). */
4311 expand_builtin_fputs (tree arglist, rtx target, bool unlocked)
4313 /* Verify the arguments in the original call. */
4314 if (validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
4316 tree result = fold_builtin_fputs (arglist, (target == const0_rtx),
4317 unlocked, NULL_TREE);
4319 return expand_expr (result, target, VOIDmode, EXPAND_NORMAL);
4324 /* Expand a call to __builtin_expect. We return our argument and emit a
4325 NOTE_INSN_EXPECTED_VALUE note. This is the expansion of __builtin_expect in
4326 a non-jump context. */
4329 expand_builtin_expect (tree arglist, rtx target)
4334 if (arglist == NULL_TREE
4335 || TREE_CHAIN (arglist) == NULL_TREE)
4337 exp = TREE_VALUE (arglist);
4338 c = TREE_VALUE (TREE_CHAIN (arglist));
4340 if (TREE_CODE (c) != INTEGER_CST)
4342 error ("second argument to %<__builtin_expect%> must be a constant");
4343 c = integer_zero_node;
4346 target = expand_expr (exp, target, VOIDmode, EXPAND_NORMAL);
4348 /* Don't bother with expected value notes for integral constants. */
4349 if (flag_guess_branch_prob && GET_CODE (target) != CONST_INT)
4351 /* We do need to force this into a register so that we can be
4352 moderately sure to be able to correctly interpret the branch
4354 target = force_reg (GET_MODE (target), target);
4356 rtx_c = expand_expr (c, NULL_RTX, GET_MODE (target), EXPAND_NORMAL);
4358 note = emit_note (NOTE_INSN_EXPECTED_VALUE);
4359 NOTE_EXPECTED_VALUE (note) = gen_rtx_EQ (VOIDmode, target, rtx_c);
4365 /* Like expand_builtin_expect, except do this in a jump context. This is
4366 called from do_jump if the conditional is a __builtin_expect. Return either
4367 a list of insns to emit the jump or NULL if we cannot optimize
4368 __builtin_expect. We need to optimize this at jump time so that machines
4369 like the PowerPC don't turn the test into a SCC operation, and then jump
4370 based on the test being 0/1. */
4373 expand_builtin_expect_jump (tree exp, rtx if_false_label, rtx if_true_label)
4375 tree arglist = TREE_OPERAND (exp, 1);
4376 tree arg0 = TREE_VALUE (arglist);
4377 tree arg1 = TREE_VALUE (TREE_CHAIN (arglist));
4380 /* Only handle __builtin_expect (test, 0) and
4381 __builtin_expect (test, 1). */
4382 if (TREE_CODE (TREE_TYPE (arg1)) == INTEGER_TYPE
4383 && (integer_zerop (arg1) || integer_onep (arg1)))
4385 rtx insn, drop_through_label, temp;
4387 /* Expand the jump insns. */
4389 do_jump (arg0, if_false_label, if_true_label);
4392 drop_through_label = get_last_insn ();
4393 if (drop_through_label && NOTE_P (drop_through_label))
4394 drop_through_label = prev_nonnote_insn (drop_through_label);
4395 if (drop_through_label && !LABEL_P (drop_through_label))
4396 drop_through_label = NULL_RTX;
4399 if (! if_true_label)
4400 if_true_label = drop_through_label;
4401 if (! if_false_label)
4402 if_false_label = drop_through_label;
4404 /* Go through and add the expect's to each of the conditional jumps. */
4406 while (insn != NULL_RTX)
4408 rtx next = NEXT_INSN (insn);
4410 if (JUMP_P (insn) && any_condjump_p (insn))
4412 rtx ifelse = SET_SRC (pc_set (insn));
4413 rtx then_dest = XEXP (ifelse, 1);
4414 rtx else_dest = XEXP (ifelse, 2);
4417 /* First check if we recognize any of the labels. */
4418 if (GET_CODE (then_dest) == LABEL_REF
4419 && XEXP (then_dest, 0) == if_true_label)
4421 else if (GET_CODE (then_dest) == LABEL_REF
4422 && XEXP (then_dest, 0) == if_false_label)
4424 else if (GET_CODE (else_dest) == LABEL_REF
4425 && XEXP (else_dest, 0) == if_false_label)
4427 else if (GET_CODE (else_dest) == LABEL_REF
4428 && XEXP (else_dest, 0) == if_true_label)
4430 /* Otherwise check where we drop through. */
4431 else if (else_dest == pc_rtx)
4433 if (next && NOTE_P (next))
4434 next = next_nonnote_insn (next);
4436 if (next && JUMP_P (next)
4437 && any_uncondjump_p (next))
4438 temp = XEXP (SET_SRC (pc_set (next)), 0);
4442 /* TEMP is either a CODE_LABEL, NULL_RTX or something
4443 else that can't possibly match either target label. */
4444 if (temp == if_false_label)
4446 else if (temp == if_true_label)
4449 else if (then_dest == pc_rtx)
4451 if (next && NOTE_P (next))
4452 next = next_nonnote_insn (next);
4454 if (next && JUMP_P (next)
4455 && any_uncondjump_p (next))
4456 temp = XEXP (SET_SRC (pc_set (next)), 0);
4460 if (temp == if_false_label)
4462 else if (temp == if_true_label)
4468 /* If the test is expected to fail, reverse the
4470 if (integer_zerop (arg1))
4472 predict_insn_def (insn, PRED_BUILTIN_EXPECT, taken);
4484 expand_builtin_trap (void)
4488 emit_insn (gen_trap ());
4491 emit_library_call (abort_libfunc, LCT_NORETURN, VOIDmode, 0);
4495 /* Expand a call to fabs, fabsf or fabsl with arguments ARGLIST.
4496 Return 0 if a normal call should be emitted rather than expanding
4497 the function inline. If convenient, the result should be placed
4498 in TARGET. SUBTARGET may be used as the target for computing
4502 expand_builtin_fabs (tree arglist, rtx target, rtx subtarget)
4504 enum machine_mode mode;
4508 if (!validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
4511 arg = TREE_VALUE (arglist);
4512 mode = TYPE_MODE (TREE_TYPE (arg));
4513 op0 = expand_expr (arg, subtarget, VOIDmode, 0);
4514 return expand_abs (mode, op0, target, 0, safe_from_p (target, arg, 1));
4517 /* Expand a call to copysign, copysignf, or copysignl with arguments ARGLIST.
4518 Return NULL is a normal call should be emitted rather than expanding the
4519 function inline. If convenient, the result should be placed in TARGET.
4520 SUBTARGET may be used as the target for computing the operand. */
4523 expand_builtin_copysign (tree arglist, rtx target, rtx subtarget)
4528 if (!validate_arglist (arglist, REAL_TYPE, REAL_TYPE, VOID_TYPE))
4531 arg = TREE_VALUE (arglist);
4532 op0 = expand_expr (arg, subtarget, VOIDmode, 0);
4534 arg = TREE_VALUE (TREE_CHAIN (arglist));
4535 op1 = expand_expr (arg, NULL, VOIDmode, 0);
4537 return expand_copysign (op0, op1, target);
4540 /* Create a new constant string literal and return a char* pointer to it.
4541 The STRING_CST value is the LEN characters at STR. */
4543 build_string_literal (int len, const char *str)
4545 tree t, elem, index, type;
4547 t = build_string (len, str);
4548 elem = build_type_variant (char_type_node, 1, 0);
4549 index = build_index_type (build_int_cst (NULL_TREE, len - 1));
4550 type = build_array_type (elem, index);
4551 TREE_TYPE (t) = type;
4552 TREE_CONSTANT (t) = 1;
4553 TREE_INVARIANT (t) = 1;
4554 TREE_READONLY (t) = 1;
4555 TREE_STATIC (t) = 1;
4557 type = build_pointer_type (type);
4558 t = build1 (ADDR_EXPR, type, t);
4560 type = build_pointer_type (elem);
4561 t = build1 (NOP_EXPR, type, t);
4565 /* Expand a call to printf or printf_unlocked with argument list ARGLIST.
4566 Return 0 if a normal call should be emitted rather than transforming
4567 the function inline. If convenient, the result should be placed in
4568 TARGET with mode MODE. UNLOCKED indicates this is a printf_unlocked
4571 expand_builtin_printf (tree arglist, rtx target, enum machine_mode mode,
4574 tree fn_putchar = unlocked
4575 ? implicit_built_in_decls[BUILT_IN_PUTCHAR_UNLOCKED]
4576 : implicit_built_in_decls[BUILT_IN_PUTCHAR];
4577 tree fn_puts = unlocked ? implicit_built_in_decls[BUILT_IN_PUTS_UNLOCKED]
4578 : implicit_built_in_decls[BUILT_IN_PUTS];
4579 const char *fmt_str;
4582 /* If the return value is used, don't do the transformation. */
4583 if (target != const0_rtx)
4586 /* Verify the required arguments in the original call. */
4589 fmt = TREE_VALUE (arglist);
4590 if (! POINTER_TYPE_P (TREE_TYPE (fmt)))
4592 arglist = TREE_CHAIN (arglist);
4594 /* Check whether the format is a literal string constant. */
4595 fmt_str = c_getstr (fmt);
4596 if (fmt_str == NULL)
4599 /* If the format specifier was "%s\n", call __builtin_puts(arg). */
4600 if (strcmp (fmt_str, "%s\n") == 0)
4603 || ! POINTER_TYPE_P (TREE_TYPE (TREE_VALUE (arglist)))
4604 || TREE_CHAIN (arglist))
4608 /* If the format specifier was "%c", call __builtin_putchar(arg). */
4609 else if (strcmp (fmt_str, "%c") == 0)
4612 || TREE_CODE (TREE_TYPE (TREE_VALUE (arglist))) != INTEGER_TYPE
4613 || TREE_CHAIN (arglist))
4619 /* We can't handle anything else with % args or %% ... yet. */
4620 if (strchr (fmt_str, '%'))
4626 /* If the format specifier was "", printf does nothing. */
4627 if (fmt_str[0] == '\0')
4629 /* If the format specifier has length of 1, call putchar. */
4630 if (fmt_str[1] == '\0')
4632 /* Given printf("c"), (where c is any one character,)
4633 convert "c"[0] to an int and pass that to the replacement
4635 arg = build_int_cst (NULL_TREE, fmt_str[0]);
4636 arglist = build_tree_list (NULL_TREE, arg);
4641 /* If the format specifier was "string\n", call puts("string"). */
4642 size_t len = strlen (fmt_str);
4643 if (fmt_str[len - 1] == '\n')
4645 /* Create a NUL-terminated string that's one char shorter
4646 than the original, stripping off the trailing '\n'. */
4647 char *newstr = alloca (len);
4648 memcpy (newstr, fmt_str, len - 1);
4649 newstr[len - 1] = 0;
4651 arg = build_string_literal (len, newstr);
4652 arglist = build_tree_list (NULL_TREE, arg);
4656 /* We'd like to arrange to call fputs(string,stdout) here,
4657 but we need stdout and don't have a way to get it yet. */
4664 return expand_expr (build_function_call_expr (fn, arglist),
4665 target, mode, EXPAND_NORMAL);
4668 /* Expand a call to fprintf or fprintf_unlocked with argument list ARGLIST.
4669 Return 0 if a normal call should be emitted rather than transforming
4670 the function inline. If convenient, the result should be placed in
4671 TARGET with mode MODE. UNLOCKED indicates this is a fprintf_unlocked
4674 expand_builtin_fprintf (tree arglist, rtx target, enum machine_mode mode,
4677 tree fn_fputc = unlocked ? implicit_built_in_decls[BUILT_IN_FPUTC_UNLOCKED]
4678 : implicit_built_in_decls[BUILT_IN_FPUTC];
4679 tree fn_fputs = unlocked ? implicit_built_in_decls[BUILT_IN_FPUTS_UNLOCKED]
4680 : implicit_built_in_decls[BUILT_IN_FPUTS];
4681 const char *fmt_str;
4682 tree fn, fmt, fp, arg;
4684 /* If the return value is used, don't do the transformation. */
4685 if (target != const0_rtx)
4688 /* Verify the required arguments in the original call. */
4691 fp = TREE_VALUE (arglist);
4692 if (! POINTER_TYPE_P (TREE_TYPE (fp)))
4694 arglist = TREE_CHAIN (arglist);
4697 fmt = TREE_VALUE (arglist);
4698 if (! POINTER_TYPE_P (TREE_TYPE (fmt)))
4700 arglist = TREE_CHAIN (arglist);
4702 /* Check whether the format is a literal string constant. */
4703 fmt_str = c_getstr (fmt);
4704 if (fmt_str == NULL)
4707 /* If the format specifier was "%s", call __builtin_fputs(arg,fp). */
4708 if (strcmp (fmt_str, "%s") == 0)
4711 || ! POINTER_TYPE_P (TREE_TYPE (TREE_VALUE (arglist)))
4712 || TREE_CHAIN (arglist))
4714 arg = TREE_VALUE (arglist);
4715 arglist = build_tree_list (NULL_TREE, fp);
4716 arglist = tree_cons (NULL_TREE, arg, arglist);
4719 /* If the format specifier was "%c", call __builtin_fputc(arg,fp). */
4720 else if (strcmp (fmt_str, "%c") == 0)
4723 || TREE_CODE (TREE_TYPE (TREE_VALUE (arglist))) != INTEGER_TYPE
4724 || TREE_CHAIN (arglist))
4726 arg = TREE_VALUE (arglist);
4727 arglist = build_tree_list (NULL_TREE, fp);
4728 arglist = tree_cons (NULL_TREE, arg, arglist);
4733 /* We can't handle anything else with % args or %% ... yet. */
4734 if (strchr (fmt_str, '%'))
4740 /* If the format specifier was "", fprintf does nothing. */
4741 if (fmt_str[0] == '\0')
4743 /* Evaluate and ignore FILE* argument for side-effects. */
4744 expand_expr (fp, const0_rtx, VOIDmode, EXPAND_NORMAL);
4748 /* When "string" doesn't contain %, replace all cases of
4749 fprintf(stream,string) with fputs(string,stream). The fputs
4750 builtin will take care of special cases like length == 1. */
4751 arglist = build_tree_list (NULL_TREE, fp);
4752 arglist = tree_cons (NULL_TREE, fmt, arglist);
4758 return expand_expr (build_function_call_expr (fn, arglist),
4759 target, mode, EXPAND_NORMAL);
4762 /* Expand a call to sprintf with argument list ARGLIST. Return 0 if
4763 a normal call should be emitted rather than expanding the function
4764 inline. If convenient, the result should be placed in TARGET with
4768 expand_builtin_sprintf (tree arglist, rtx target, enum machine_mode mode)
4770 tree orig_arglist, dest, fmt;
4771 const char *fmt_str;
4773 orig_arglist = arglist;
4775 /* Verify the required arguments in the original call. */
4778 dest = TREE_VALUE (arglist);
4779 if (! POINTER_TYPE_P (TREE_TYPE (dest)))
4781 arglist = TREE_CHAIN (arglist);
4784 fmt = TREE_VALUE (arglist);
4785 if (! POINTER_TYPE_P (TREE_TYPE (fmt)))
4787 arglist = TREE_CHAIN (arglist);
4789 /* Check whether the format is a literal string constant. */
4790 fmt_str = c_getstr (fmt);
4791 if (fmt_str == NULL)
4794 /* If the format doesn't contain % args or %%, use strcpy. */
4795 if (strchr (fmt_str, '%') == 0)
4797 tree fn = implicit_built_in_decls[BUILT_IN_STRCPY];
4800 if (arglist || ! fn)
4802 expand_expr (build_function_call_expr (fn, orig_arglist),
4803 const0_rtx, VOIDmode, EXPAND_NORMAL);
4804 if (target == const0_rtx)
4806 exp = build_int_cst (NULL_TREE, strlen (fmt_str));
4807 return expand_expr (exp, target, mode, EXPAND_NORMAL);
4809 /* If the format is "%s", use strcpy if the result isn't used. */
4810 else if (strcmp (fmt_str, "%s") == 0)
4813 fn = implicit_built_in_decls[BUILT_IN_STRCPY];
4818 if (! arglist || TREE_CHAIN (arglist))
4820 arg = TREE_VALUE (arglist);
4821 if (! POINTER_TYPE_P (TREE_TYPE (arg)))
4824 if (target != const0_rtx)
4826 len = c_strlen (arg, 1);
4827 if (! len || TREE_CODE (len) != INTEGER_CST)
4833 arglist = build_tree_list (NULL_TREE, arg);
4834 arglist = tree_cons (NULL_TREE, dest, arglist);
4835 expand_expr (build_function_call_expr (fn, arglist),
4836 const0_rtx, VOIDmode, EXPAND_NORMAL);
4838 if (target == const0_rtx)
4840 return expand_expr (len, target, mode, EXPAND_NORMAL);
4846 /* Expand a call to either the entry or exit function profiler. */
4849 expand_builtin_profile_func (bool exitp)
4853 this = DECL_RTL (current_function_decl);
4854 gcc_assert (MEM_P (this));
4855 this = XEXP (this, 0);
4858 which = profile_function_exit_libfunc;
4860 which = profile_function_entry_libfunc;
4862 emit_library_call (which, LCT_NORMAL, VOIDmode, 2, this, Pmode,
4863 expand_builtin_return_addr (BUILT_IN_RETURN_ADDRESS,
4870 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
4873 round_trampoline_addr (rtx tramp)
4875 rtx temp, addend, mask;
4877 /* If we don't need too much alignment, we'll have been guaranteed
4878 proper alignment by get_trampoline_type. */
4879 if (TRAMPOLINE_ALIGNMENT <= STACK_BOUNDARY)
4882 /* Round address up to desired boundary. */
4883 temp = gen_reg_rtx (Pmode);
4884 addend = GEN_INT (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT - 1);
4885 mask = GEN_INT (-TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT);
4887 temp = expand_simple_binop (Pmode, PLUS, tramp, addend,
4888 temp, 0, OPTAB_LIB_WIDEN);
4889 tramp = expand_simple_binop (Pmode, AND, temp, mask,
4890 temp, 0, OPTAB_LIB_WIDEN);
4896 expand_builtin_init_trampoline (tree arglist)
4898 tree t_tramp, t_func, t_chain;
4899 rtx r_tramp, r_func, r_chain;
4900 #ifdef TRAMPOLINE_TEMPLATE
4904 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE,
4905 POINTER_TYPE, VOID_TYPE))
4908 t_tramp = TREE_VALUE (arglist);
4909 arglist = TREE_CHAIN (arglist);
4910 t_func = TREE_VALUE (arglist);
4911 arglist = TREE_CHAIN (arglist);
4912 t_chain = TREE_VALUE (arglist);
4914 r_tramp = expand_expr (t_tramp, NULL_RTX, VOIDmode, 0);
4915 r_func = expand_expr (t_func, NULL_RTX, VOIDmode, 0);
4916 r_chain = expand_expr (t_chain, NULL_RTX, VOIDmode, 0);
4918 /* Generate insns to initialize the trampoline. */
4919 r_tramp = round_trampoline_addr (r_tramp);
4920 #ifdef TRAMPOLINE_TEMPLATE
4921 blktramp = gen_rtx_MEM (BLKmode, r_tramp);
4922 set_mem_align (blktramp, TRAMPOLINE_ALIGNMENT);
4923 emit_block_move (blktramp, assemble_trampoline_template (),
4924 GEN_INT (TRAMPOLINE_SIZE), BLOCK_OP_NORMAL);
4926 trampolines_created = 1;
4927 INITIALIZE_TRAMPOLINE (r_tramp, r_func, r_chain);
4933 expand_builtin_adjust_trampoline (tree arglist)
4937 if (!validate_arglist (arglist, POINTER_TYPE, VOID_TYPE))
4940 tramp = expand_expr (TREE_VALUE (arglist), NULL_RTX, VOIDmode, 0);
4941 tramp = round_trampoline_addr (tramp);
4942 #ifdef TRAMPOLINE_ADJUST_ADDRESS
4943 TRAMPOLINE_ADJUST_ADDRESS (tramp);
4949 /* Expand a call to the built-in signbit, signbitf or signbitl function.
4950 Return NULL_RTX if a normal call should be emitted rather than expanding
4951 the function in-line. EXP is the expression that is a call to the builtin
4952 function; if convenient, the result should be placed in TARGET. */
4955 expand_builtin_signbit (tree exp, rtx target)
4957 const struct real_format *fmt;
4958 enum machine_mode fmode, imode, rmode;
4959 HOST_WIDE_INT hi, lo;
4964 arglist = TREE_OPERAND (exp, 1);
4965 if (!validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
4968 arg = TREE_VALUE (arglist);
4969 fmode = TYPE_MODE (TREE_TYPE (arg));
4970 rmode = TYPE_MODE (TREE_TYPE (exp));
4971 fmt = REAL_MODE_FORMAT (fmode);
4973 /* For floating point formats without a sign bit, implement signbit
4975 bitpos = fmt->signbit_ro;
4978 /* But we can't do this if the format supports signed zero. */
4979 if (fmt->has_signed_zero && HONOR_SIGNED_ZEROS (fmode))
4982 arg = fold (build2 (LT_EXPR, TREE_TYPE (exp), arg,
4983 build_real (TREE_TYPE (arg), dconst0)));
4984 return expand_expr (arg, target, VOIDmode, EXPAND_NORMAL);
4987 temp = expand_expr (arg, NULL_RTX, VOIDmode, 0);
4988 if (GET_MODE_SIZE (fmode) <= UNITS_PER_WORD)
4990 imode = int_mode_for_mode (fmode);
4991 if (imode == BLKmode)
4993 temp = gen_lowpart (imode, temp);
4998 /* Handle targets with different FP word orders. */
4999 if (FLOAT_WORDS_BIG_ENDIAN)
5000 word = (GET_MODE_BITSIZE (fmode) - bitpos) / BITS_PER_WORD;
5002 word = bitpos / BITS_PER_WORD;
5003 temp = operand_subword_force (temp, word, fmode);
5004 bitpos = bitpos % BITS_PER_WORD;
5007 /* Force the intermediate word_mode (or narrower) result into a
5008 register. This avoids attempting to create paradoxical SUBREGs
5009 of floating point modes below. */
5010 temp = force_reg (imode, temp);
5012 /* If the bitpos is within the "result mode" lowpart, the operation
5013 can be implement with a single bitwise AND. Otherwise, we need
5014 a right shift and an AND. */
5016 if (bitpos < GET_MODE_BITSIZE (rmode))
5018 if (bitpos < HOST_BITS_PER_WIDE_INT)
5021 lo = (HOST_WIDE_INT) 1 << bitpos;
5025 hi = (HOST_WIDE_INT) 1 << (bitpos - HOST_BITS_PER_WIDE_INT);
5030 temp = gen_lowpart (rmode, temp);
5031 temp = expand_binop (rmode, and_optab, temp,
5032 immed_double_const (lo, hi, rmode),
5033 NULL_RTX, 1, OPTAB_LIB_WIDEN);
5037 /* Perform a logical right shift to place the signbit in the least
5038 significant bit, then truncate the result to the desired mode
5039 and mask just this bit. */
5040 temp = expand_shift (RSHIFT_EXPR, imode, temp,
5041 build_int_cst (NULL_TREE, bitpos), NULL_RTX, 1);
5042 temp = gen_lowpart (rmode, temp);
5043 temp = expand_binop (rmode, and_optab, temp, const1_rtx,
5044 NULL_RTX, 1, OPTAB_LIB_WIDEN);
5050 /* Expand fork or exec calls. TARGET is the desired target of the
5051 call. ARGLIST is the list of arguments of the call. FN is the
5052 identificator of the actual function. IGNORE is nonzero if the
5053 value is to be ignored. */
5056 expand_builtin_fork_or_exec (tree fn, tree arglist, rtx target, int ignore)
5061 /* If we are not profiling, just call the function. */
5062 if (!profile_arc_flag)
5065 /* Otherwise call the wrapper. This should be equivalent for the rest of
5066 compiler, so the code does not diverge, and the wrapper may run the
5067 code necessary for keeping the profiling sane. */
5069 switch (DECL_FUNCTION_CODE (fn))
5072 id = get_identifier ("__gcov_fork");
5075 case BUILT_IN_EXECL:
5076 id = get_identifier ("__gcov_execl");
5079 case BUILT_IN_EXECV:
5080 id = get_identifier ("__gcov_execv");
5083 case BUILT_IN_EXECLP:
5084 id = get_identifier ("__gcov_execlp");
5087 case BUILT_IN_EXECLE:
5088 id = get_identifier ("__gcov_execle");
5091 case BUILT_IN_EXECVP:
5092 id = get_identifier ("__gcov_execvp");
5095 case BUILT_IN_EXECVE:
5096 id = get_identifier ("__gcov_execve");
5103 decl = build_decl (FUNCTION_DECL, id, TREE_TYPE (fn));
5104 DECL_EXTERNAL (decl) = 1;
5105 TREE_PUBLIC (decl) = 1;
5106 DECL_ARTIFICIAL (decl) = 1;
5107 TREE_NOTHROW (decl) = 1;
5108 call = build_function_call_expr (decl, arglist);
5110 return expand_call (call, target, ignore);
5113 /* Expand an expression EXP that calls a built-in function,
5114 with result going to TARGET if that's convenient
5115 (and in mode MODE if that's convenient).
5116 SUBTARGET may be used as the target for computing one of EXP's operands.
5117 IGNORE is nonzero if the value is to be ignored. */
5120 expand_builtin (tree exp, rtx target, rtx subtarget, enum machine_mode mode,
5123 tree fndecl = get_callee_fndecl (exp);
5124 tree arglist = TREE_OPERAND (exp, 1);
5125 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
5126 enum machine_mode target_mode = TYPE_MODE (TREE_TYPE (exp));
5128 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
5129 return targetm.expand_builtin (exp, target, subtarget, mode, ignore);
5131 /* When not optimizing, generate calls to library functions for a certain
5134 && !CALLED_AS_BUILT_IN (fndecl)
5135 && DECL_ASSEMBLER_NAME_SET_P (fndecl)
5136 && fcode != BUILT_IN_ALLOCA)
5137 return expand_call (exp, target, ignore);
5139 /* The built-in function expanders test for target == const0_rtx
5140 to determine whether the function's result will be ignored. */
5142 target = const0_rtx;
5144 /* If the result of a pure or const built-in function is ignored, and
5145 none of its arguments are volatile, we can avoid expanding the
5146 built-in call and just evaluate the arguments for side-effects. */
5147 if (target == const0_rtx
5148 && (DECL_IS_PURE (fndecl) || TREE_READONLY (fndecl)))
5150 bool volatilep = false;
5153 for (arg = arglist; arg; arg = TREE_CHAIN (arg))
5154 if (TREE_THIS_VOLATILE (TREE_VALUE (arg)))
5162 for (arg = arglist; arg; arg = TREE_CHAIN (arg))
5163 expand_expr (TREE_VALUE (arg), const0_rtx,
5164 VOIDmode, EXPAND_NORMAL);
5172 case BUILT_IN_FABSF:
5173 case BUILT_IN_FABSL:
5174 target = expand_builtin_fabs (arglist, target, subtarget);
5179 case BUILT_IN_COPYSIGN:
5180 case BUILT_IN_COPYSIGNF:
5181 case BUILT_IN_COPYSIGNL:
5182 target = expand_builtin_copysign (arglist, target, subtarget);
5187 /* Just do a normal library call if we were unable to fold
5190 case BUILT_IN_CABSF:
5191 case BUILT_IN_CABSL:
5197 case BUILT_IN_EXP10:
5198 case BUILT_IN_EXP10F:
5199 case BUILT_IN_EXP10L:
5200 case BUILT_IN_POW10:
5201 case BUILT_IN_POW10F:
5202 case BUILT_IN_POW10L:
5204 case BUILT_IN_EXP2F:
5205 case BUILT_IN_EXP2L:
5206 case BUILT_IN_EXPM1:
5207 case BUILT_IN_EXPM1F:
5208 case BUILT_IN_EXPM1L:
5210 case BUILT_IN_LOGBF:
5211 case BUILT_IN_LOGBL:
5212 case BUILT_IN_ILOGB:
5213 case BUILT_IN_ILOGBF:
5214 case BUILT_IN_ILOGBL:
5218 case BUILT_IN_LOG10:
5219 case BUILT_IN_LOG10F:
5220 case BUILT_IN_LOG10L:
5222 case BUILT_IN_LOG2F:
5223 case BUILT_IN_LOG2L:
5224 case BUILT_IN_LOG1P:
5225 case BUILT_IN_LOG1PF:
5226 case BUILT_IN_LOG1PL:
5231 case BUILT_IN_ASINF:
5232 case BUILT_IN_ASINL:
5234 case BUILT_IN_ACOSF:
5235 case BUILT_IN_ACOSL:
5237 case BUILT_IN_ATANF:
5238 case BUILT_IN_ATANL:
5239 /* Treat these like sqrt only if unsafe math optimizations are allowed,
5240 because of possible accuracy problems. */
5241 if (! flag_unsafe_math_optimizations)
5244 case BUILT_IN_SQRTF:
5245 case BUILT_IN_SQRTL:
5246 case BUILT_IN_FLOOR:
5247 case BUILT_IN_FLOORF:
5248 case BUILT_IN_FLOORL:
5250 case BUILT_IN_CEILF:
5251 case BUILT_IN_CEILL:
5252 case BUILT_IN_TRUNC:
5253 case BUILT_IN_TRUNCF:
5254 case BUILT_IN_TRUNCL:
5255 case BUILT_IN_ROUND:
5256 case BUILT_IN_ROUNDF:
5257 case BUILT_IN_ROUNDL:
5258 case BUILT_IN_NEARBYINT:
5259 case BUILT_IN_NEARBYINTF:
5260 case BUILT_IN_NEARBYINTL:
5262 case BUILT_IN_RINTF:
5263 case BUILT_IN_RINTL:
5264 target = expand_builtin_mathfn (exp, target, subtarget);
5272 target = expand_builtin_pow (exp, target, subtarget);
5278 case BUILT_IN_POWIF:
5279 case BUILT_IN_POWIL:
5280 target = expand_builtin_powi (exp, target, subtarget);
5285 case BUILT_IN_ATAN2:
5286 case BUILT_IN_ATAN2F:
5287 case BUILT_IN_ATAN2L:
5288 case BUILT_IN_LDEXP:
5289 case BUILT_IN_LDEXPF:
5290 case BUILT_IN_LDEXPL:
5292 case BUILT_IN_FMODF:
5293 case BUILT_IN_FMODL:
5295 case BUILT_IN_DREMF:
5296 case BUILT_IN_DREML:
5297 if (! flag_unsafe_math_optimizations)
5299 target = expand_builtin_mathfn_2 (exp, target, subtarget);
5310 if (! flag_unsafe_math_optimizations)
5312 target = expand_builtin_mathfn_3 (exp, target, subtarget);
5317 case BUILT_IN_APPLY_ARGS:
5318 return expand_builtin_apply_args ();
5320 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
5321 FUNCTION with a copy of the parameters described by
5322 ARGUMENTS, and ARGSIZE. It returns a block of memory
5323 allocated on the stack into which is stored all the registers
5324 that might possibly be used for returning the result of a
5325 function. ARGUMENTS is the value returned by
5326 __builtin_apply_args. ARGSIZE is the number of bytes of
5327 arguments that must be copied. ??? How should this value be
5328 computed? We'll also need a safe worst case value for varargs
5330 case BUILT_IN_APPLY:
5331 if (!validate_arglist (arglist, POINTER_TYPE,
5332 POINTER_TYPE, INTEGER_TYPE, VOID_TYPE)
5333 && !validate_arglist (arglist, REFERENCE_TYPE,
5334 POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
5342 for (t = arglist, i = 0; t; t = TREE_CHAIN (t), i++)
5343 ops[i] = expand_expr (TREE_VALUE (t), NULL_RTX, VOIDmode, 0);
5345 return expand_builtin_apply (ops[0], ops[1], ops[2]);
5348 /* __builtin_return (RESULT) causes the function to return the
5349 value described by RESULT. RESULT is address of the block of
5350 memory returned by __builtin_apply. */
5351 case BUILT_IN_RETURN:
5352 if (validate_arglist (arglist, POINTER_TYPE, VOID_TYPE))
5353 expand_builtin_return (expand_expr (TREE_VALUE (arglist),
5354 NULL_RTX, VOIDmode, 0));
5357 case BUILT_IN_SAVEREGS:
5358 return expand_builtin_saveregs ();
5360 case BUILT_IN_ARGS_INFO:
5361 return expand_builtin_args_info (arglist);
5363 /* Return the address of the first anonymous stack arg. */
5364 case BUILT_IN_NEXT_ARG:
5365 if (fold_builtin_next_arg (arglist))
5367 return expand_builtin_next_arg ();
5369 case BUILT_IN_CLASSIFY_TYPE:
5370 return expand_builtin_classify_type (arglist);
5372 case BUILT_IN_CONSTANT_P:
5375 case BUILT_IN_FRAME_ADDRESS:
5376 case BUILT_IN_RETURN_ADDRESS:
5377 return expand_builtin_frame_address (fndecl, arglist);
5379 /* Returns the address of the area where the structure is returned.
5381 case BUILT_IN_AGGREGATE_INCOMING_ADDRESS:
5383 || ! AGGREGATE_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl)))
5384 || !MEM_P (DECL_RTL (DECL_RESULT (current_function_decl))))
5387 return XEXP (DECL_RTL (DECL_RESULT (current_function_decl)), 0);
5389 case BUILT_IN_ALLOCA:
5390 target = expand_builtin_alloca (arglist, target);
5395 case BUILT_IN_STACK_SAVE:
5396 return expand_stack_save ();
5398 case BUILT_IN_STACK_RESTORE:
5399 expand_stack_restore (TREE_VALUE (arglist));
5404 case BUILT_IN_FFSLL:
5405 case BUILT_IN_FFSIMAX:
5406 target = expand_builtin_unop (target_mode, arglist, target,
5407 subtarget, ffs_optab);
5414 case BUILT_IN_CLZLL:
5415 case BUILT_IN_CLZIMAX:
5416 target = expand_builtin_unop (target_mode, arglist, target,
5417 subtarget, clz_optab);
5424 case BUILT_IN_CTZLL:
5425 case BUILT_IN_CTZIMAX:
5426 target = expand_builtin_unop (target_mode, arglist, target,
5427 subtarget, ctz_optab);
5432 case BUILT_IN_POPCOUNT:
5433 case BUILT_IN_POPCOUNTL:
5434 case BUILT_IN_POPCOUNTLL:
5435 case BUILT_IN_POPCOUNTIMAX:
5436 target = expand_builtin_unop (target_mode, arglist, target,
5437 subtarget, popcount_optab);
5442 case BUILT_IN_PARITY:
5443 case BUILT_IN_PARITYL:
5444 case BUILT_IN_PARITYLL:
5445 case BUILT_IN_PARITYIMAX:
5446 target = expand_builtin_unop (target_mode, arglist, target,
5447 subtarget, parity_optab);
5452 case BUILT_IN_STRLEN:
5453 target = expand_builtin_strlen (arglist, target, target_mode);
5458 case BUILT_IN_STRCPY:
5459 target = expand_builtin_strcpy (exp, target, mode);
5464 case BUILT_IN_STRNCPY:
5465 target = expand_builtin_strncpy (exp, target, mode);
5470 case BUILT_IN_STPCPY:
5471 target = expand_builtin_stpcpy (exp, target, mode);
5476 case BUILT_IN_STRCAT:
5477 target = expand_builtin_strcat (arglist, TREE_TYPE (exp), target, mode);
5482 case BUILT_IN_STRNCAT:
5483 target = expand_builtin_strncat (arglist, target, mode);
5488 case BUILT_IN_STRSPN:
5489 target = expand_builtin_strspn (arglist, target, mode);
5494 case BUILT_IN_STRCSPN:
5495 target = expand_builtin_strcspn (arglist, target, mode);
5500 case BUILT_IN_STRSTR:
5501 target = expand_builtin_strstr (arglist, TREE_TYPE (exp), target, mode);
5506 case BUILT_IN_STRPBRK:
5507 target = expand_builtin_strpbrk (arglist, TREE_TYPE (exp), target, mode);
5512 case BUILT_IN_INDEX:
5513 case BUILT_IN_STRCHR:
5514 target = expand_builtin_strchr (arglist, TREE_TYPE (exp), target, mode);
5519 case BUILT_IN_RINDEX:
5520 case BUILT_IN_STRRCHR:
5521 target = expand_builtin_strrchr (arglist, TREE_TYPE (exp), target, mode);
5526 case BUILT_IN_MEMCPY:
5527 target = expand_builtin_memcpy (exp, target, mode);
5532 case BUILT_IN_MEMPCPY:
5533 target = expand_builtin_mempcpy (arglist, TREE_TYPE (exp), target, mode, /*endp=*/ 1);
5538 case BUILT_IN_MEMMOVE:
5539 target = expand_builtin_memmove (arglist, TREE_TYPE (exp), target, mode);
5544 case BUILT_IN_BCOPY:
5545 target = expand_builtin_bcopy (arglist, TREE_TYPE (exp));
5550 case BUILT_IN_MEMSET:
5551 target = expand_builtin_memset (arglist, target, mode);
5556 case BUILT_IN_BZERO:
5557 target = expand_builtin_bzero (arglist);
5562 case BUILT_IN_STRCMP:
5563 target = expand_builtin_strcmp (exp, target, mode);
5568 case BUILT_IN_STRNCMP:
5569 target = expand_builtin_strncmp (exp, target, mode);
5575 case BUILT_IN_MEMCMP:
5576 target = expand_builtin_memcmp (exp, arglist, target, mode);
5581 case BUILT_IN_SETJMP:
5582 target = expand_builtin_setjmp (arglist, target);
5587 /* __builtin_longjmp is passed a pointer to an array of five words.
5588 It's similar to the C library longjmp function but works with
5589 __builtin_setjmp above. */
5590 case BUILT_IN_LONGJMP:
5591 if (!validate_arglist (arglist, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
5595 rtx buf_addr = expand_expr (TREE_VALUE (arglist), subtarget,
5597 rtx value = expand_expr (TREE_VALUE (TREE_CHAIN (arglist)),
5598 NULL_RTX, VOIDmode, 0);
5600 if (value != const1_rtx)
5602 error ("%<__builtin_longjmp%> second argument must be 1");
5606 expand_builtin_longjmp (buf_addr, value);
5610 case BUILT_IN_NONLOCAL_GOTO:
5611 target = expand_builtin_nonlocal_goto (arglist);
5616 /* This updates the setjmp buffer that is its argument with the value
5617 of the current stack pointer. */
5618 case BUILT_IN_UPDATE_SETJMP_BUF:
5619 if (validate_arglist (arglist, POINTER_TYPE, VOID_TYPE))
5622 = expand_expr (TREE_VALUE (arglist), NULL_RTX, VOIDmode, 0);
5624 expand_builtin_update_setjmp_buf (buf_addr);
5630 expand_builtin_trap ();
5633 case BUILT_IN_PRINTF:
5634 target = expand_builtin_printf (arglist, target, mode, false);
5639 case BUILT_IN_PRINTF_UNLOCKED:
5640 target = expand_builtin_printf (arglist, target, mode, true);
5645 case BUILT_IN_FPUTS:
5646 target = expand_builtin_fputs (arglist, target, false);
5650 case BUILT_IN_FPUTS_UNLOCKED:
5651 target = expand_builtin_fputs (arglist, target, true);
5656 case BUILT_IN_FPRINTF:
5657 target = expand_builtin_fprintf (arglist, target, mode, false);
5662 case BUILT_IN_FPRINTF_UNLOCKED:
5663 target = expand_builtin_fprintf (arglist, target, mode, true);
5668 case BUILT_IN_SPRINTF:
5669 target = expand_builtin_sprintf (arglist, target, mode);
5674 case BUILT_IN_SIGNBIT:
5675 case BUILT_IN_SIGNBITF:
5676 case BUILT_IN_SIGNBITL:
5677 target = expand_builtin_signbit (exp, target);
5682 /* Various hooks for the DWARF 2 __throw routine. */
5683 case BUILT_IN_UNWIND_INIT:
5684 expand_builtin_unwind_init ();
5686 case BUILT_IN_DWARF_CFA:
5687 return virtual_cfa_rtx;
5688 #ifdef DWARF2_UNWIND_INFO
5689 case BUILT_IN_DWARF_SP_COLUMN:
5690 return expand_builtin_dwarf_sp_column ();
5691 case BUILT_IN_INIT_DWARF_REG_SIZES:
5692 expand_builtin_init_dwarf_reg_sizes (TREE_VALUE (arglist));
5695 case BUILT_IN_FROB_RETURN_ADDR:
5696 return expand_builtin_frob_return_addr (TREE_VALUE (arglist));
5697 case BUILT_IN_EXTRACT_RETURN_ADDR:
5698 return expand_builtin_extract_return_addr (TREE_VALUE (arglist));
5699 case BUILT_IN_EH_RETURN:
5700 expand_builtin_eh_return (TREE_VALUE (arglist),
5701 TREE_VALUE (TREE_CHAIN (arglist)));
5703 #ifdef EH_RETURN_DATA_REGNO
5704 case BUILT_IN_EH_RETURN_DATA_REGNO:
5705 return expand_builtin_eh_return_data_regno (arglist);
5707 case BUILT_IN_EXTEND_POINTER:
5708 return expand_builtin_extend_pointer (TREE_VALUE (arglist));
5710 case BUILT_IN_VA_START:
5711 case BUILT_IN_STDARG_START:
5712 return expand_builtin_va_start (arglist);
5713 case BUILT_IN_VA_END:
5714 return expand_builtin_va_end (arglist);
5715 case BUILT_IN_VA_COPY:
5716 return expand_builtin_va_copy (arglist);
5717 case BUILT_IN_EXPECT:
5718 return expand_builtin_expect (arglist, target);
5719 case BUILT_IN_PREFETCH:
5720 expand_builtin_prefetch (arglist);
5723 case BUILT_IN_PROFILE_FUNC_ENTER:
5724 return expand_builtin_profile_func (false);
5725 case BUILT_IN_PROFILE_FUNC_EXIT:
5726 return expand_builtin_profile_func (true);
5728 case BUILT_IN_INIT_TRAMPOLINE:
5729 return expand_builtin_init_trampoline (arglist);
5730 case BUILT_IN_ADJUST_TRAMPOLINE:
5731 return expand_builtin_adjust_trampoline (arglist);
5734 case BUILT_IN_EXECL:
5735 case BUILT_IN_EXECV:
5736 case BUILT_IN_EXECLP:
5737 case BUILT_IN_EXECLE:
5738 case BUILT_IN_EXECVP:
5739 case BUILT_IN_EXECVE:
5740 target = expand_builtin_fork_or_exec (fndecl, arglist, target, ignore);
5745 default: /* just do library call, if unknown builtin */
5749 /* The switch statement above can drop through to cause the function
5750 to be called normally. */
5751 return expand_call (exp, target, ignore);
5754 /* Determine whether a tree node represents a call to a built-in
5755 function. If the tree T is a call to a built-in function with
5756 the right number of arguments of the appropriate types, return
5757 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
5758 Otherwise the return value is END_BUILTINS. */
5760 enum built_in_function
5761 builtin_mathfn_code (tree t)
5763 tree fndecl, arglist, parmlist;
5764 tree argtype, parmtype;
5766 if (TREE_CODE (t) != CALL_EXPR
5767 || TREE_CODE (TREE_OPERAND (t, 0)) != ADDR_EXPR)
5768 return END_BUILTINS;
5770 fndecl = get_callee_fndecl (t);
5771 if (fndecl == NULL_TREE
5772 || TREE_CODE (fndecl) != FUNCTION_DECL
5773 || ! DECL_BUILT_IN (fndecl)
5774 || DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
5775 return END_BUILTINS;
5777 arglist = TREE_OPERAND (t, 1);
5778 parmlist = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
5779 for (; parmlist; parmlist = TREE_CHAIN (parmlist))
5781 /* If a function doesn't take a variable number of arguments,
5782 the last element in the list will have type `void'. */
5783 parmtype = TREE_VALUE (parmlist);
5784 if (VOID_TYPE_P (parmtype))
5787 return END_BUILTINS;
5788 return DECL_FUNCTION_CODE (fndecl);
5792 return END_BUILTINS;
5794 argtype = TREE_TYPE (TREE_VALUE (arglist));
5796 if (SCALAR_FLOAT_TYPE_P (parmtype))
5798 if (! SCALAR_FLOAT_TYPE_P (argtype))
5799 return END_BUILTINS;
5801 else if (COMPLEX_FLOAT_TYPE_P (parmtype))
5803 if (! COMPLEX_FLOAT_TYPE_P (argtype))
5804 return END_BUILTINS;
5806 else if (POINTER_TYPE_P (parmtype))
5808 if (! POINTER_TYPE_P (argtype))
5809 return END_BUILTINS;
5811 else if (INTEGRAL_TYPE_P (parmtype))
5813 if (! INTEGRAL_TYPE_P (argtype))
5814 return END_BUILTINS;
5817 return END_BUILTINS;
5819 arglist = TREE_CHAIN (arglist);
5822 /* Variable-length argument list. */
5823 return DECL_FUNCTION_CODE (fndecl);
5826 /* Fold a call to __builtin_constant_p, if we know it will evaluate to a
5827 constant. ARGLIST is the argument list of the call. */
5830 fold_builtin_constant_p (tree arglist)
5835 arglist = TREE_VALUE (arglist);
5837 /* We return 1 for a numeric type that's known to be a constant
5838 value at compile-time or for an aggregate type that's a
5839 literal constant. */
5840 STRIP_NOPS (arglist);
5842 /* If we know this is a constant, emit the constant of one. */
5843 if (CONSTANT_CLASS_P (arglist)
5844 || (TREE_CODE (arglist) == CONSTRUCTOR
5845 && TREE_CONSTANT (arglist))
5846 || (TREE_CODE (arglist) == ADDR_EXPR
5847 && TREE_CODE (TREE_OPERAND (arglist, 0)) == STRING_CST))
5848 return integer_one_node;
5850 /* If this expression has side effects, show we don't know it to be a
5851 constant. Likewise if it's a pointer or aggregate type since in
5852 those case we only want literals, since those are only optimized
5853 when generating RTL, not later.
5854 And finally, if we are compiling an initializer, not code, we
5855 need to return a definite result now; there's not going to be any
5856 more optimization done. */
5857 if (TREE_SIDE_EFFECTS (arglist)
5858 || AGGREGATE_TYPE_P (TREE_TYPE (arglist))
5859 || POINTER_TYPE_P (TREE_TYPE (arglist))
5861 return integer_zero_node;
5866 /* Fold a call to __builtin_expect, if we expect that a comparison against
5867 the argument will fold to a constant. In practice, this means a true
5868 constant or the address of a non-weak symbol. ARGLIST is the argument
5869 list of the call. */
5872 fold_builtin_expect (tree arglist)
5879 arg = TREE_VALUE (arglist);
5881 /* If the argument isn't invariant, then there's nothing we can do. */
5882 if (!TREE_INVARIANT (arg))
5885 /* If we're looking at an address of a weak decl, then do not fold. */
5888 if (TREE_CODE (inner) == ADDR_EXPR)
5892 inner = TREE_OPERAND (inner, 0);
5894 while (TREE_CODE (inner) == COMPONENT_REF
5895 || TREE_CODE (inner) == ARRAY_REF);
5896 if (DECL_P (inner) && DECL_WEAK (inner))
5900 /* Otherwise, ARG already has the proper type for the return value. */
5904 /* Fold a call to __builtin_classify_type. */
5907 fold_builtin_classify_type (tree arglist)
5910 return build_int_cst (NULL_TREE, no_type_class);
5912 return build_int_cst (NULL_TREE,
5913 type_to_class (TREE_TYPE (TREE_VALUE (arglist))));
5916 /* Fold a call to __builtin_strlen. */
5919 fold_builtin_strlen (tree arglist)
5921 if (!validate_arglist (arglist, POINTER_TYPE, VOID_TYPE))
5925 tree len = c_strlen (TREE_VALUE (arglist), 0);
5929 /* Convert from the internal "sizetype" type to "size_t". */
5931 len = fold_convert (size_type_node, len);
5939 /* Fold a call to __builtin_inf or __builtin_huge_val. */
5942 fold_builtin_inf (tree type, int warn)
5944 REAL_VALUE_TYPE real;
5946 /* __builtin_inff is intended to be usable to define INFINITY on all
5947 targets. If an infinity is not available, INFINITY expands "to a
5948 positive constant of type float that overflows at translation
5949 time", footnote "In this case, using INFINITY will violate the
5950 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
5951 Thus we pedwarn to ensure this constraint violation is
5953 if (!MODE_HAS_INFINITIES (TYPE_MODE (type)) && warn)
5954 pedwarn ("target format does not support infinity");
5957 return build_real (type, real);
5960 /* Fold a call to __builtin_nan or __builtin_nans. */
5963 fold_builtin_nan (tree arglist, tree type, int quiet)
5965 REAL_VALUE_TYPE real;
5968 if (!validate_arglist (arglist, POINTER_TYPE, VOID_TYPE))
5970 str = c_getstr (TREE_VALUE (arglist));
5974 if (!real_nan (&real, str, quiet, TYPE_MODE (type)))
5977 return build_real (type, real);
5980 /* Return true if the floating point expression T has an integer value.
5981 We also allow +Inf, -Inf and NaN to be considered integer values. */
5984 integer_valued_real_p (tree t)
5986 switch (TREE_CODE (t))
5993 case NON_LVALUE_EXPR:
5994 return integer_valued_real_p (TREE_OPERAND (t, 0));
5999 return integer_valued_real_p (TREE_OPERAND (t, 1));
6006 return integer_valued_real_p (TREE_OPERAND (t, 0))
6007 && integer_valued_real_p (TREE_OPERAND (t, 1));
6010 return integer_valued_real_p (TREE_OPERAND (t, 1))
6011 && integer_valued_real_p (TREE_OPERAND (t, 2));
6014 if (! TREE_CONSTANT_OVERFLOW (t))
6016 REAL_VALUE_TYPE c, cint;
6018 c = TREE_REAL_CST (t);
6019 real_trunc (&cint, TYPE_MODE (TREE_TYPE (t)), &c);
6020 return real_identical (&c, &cint);
6025 tree type = TREE_TYPE (TREE_OPERAND (t, 0));
6026 if (TREE_CODE (type) == INTEGER_TYPE)
6028 if (TREE_CODE (type) == REAL_TYPE)
6029 return integer_valued_real_p (TREE_OPERAND (t, 0));
6034 switch (builtin_mathfn_code (t))
6037 case BUILT_IN_CEILF:
6038 case BUILT_IN_CEILL:
6039 case BUILT_IN_FLOOR:
6040 case BUILT_IN_FLOORF:
6041 case BUILT_IN_FLOORL:
6042 case BUILT_IN_NEARBYINT:
6043 case BUILT_IN_NEARBYINTF:
6044 case BUILT_IN_NEARBYINTL:
6046 case BUILT_IN_RINTF:
6047 case BUILT_IN_RINTL:
6048 case BUILT_IN_ROUND:
6049 case BUILT_IN_ROUNDF:
6050 case BUILT_IN_ROUNDL:
6051 case BUILT_IN_TRUNC:
6052 case BUILT_IN_TRUNCF:
6053 case BUILT_IN_TRUNCL:
6067 /* EXP is assumed to be builtin call where truncation can be propagated
6068 across (for instance floor((double)f) == (double)floorf (f).
6069 Do the transformation. */
6072 fold_trunc_transparent_mathfn (tree fndecl, tree arglist)
6074 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
6077 if (! validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
6080 arg = TREE_VALUE (arglist);
6081 /* Integer rounding functions are idempotent. */
6082 if (fcode == builtin_mathfn_code (arg))
6085 /* If argument is already integer valued, and we don't need to worry
6086 about setting errno, there's no need to perform rounding. */
6087 if (! flag_errno_math && integer_valued_real_p (arg))
6092 tree arg0 = strip_float_extensions (arg);
6093 tree ftype = TREE_TYPE (TREE_TYPE (fndecl));
6094 tree newtype = TREE_TYPE (arg0);
6097 if (TYPE_PRECISION (newtype) < TYPE_PRECISION (ftype)
6098 && (decl = mathfn_built_in (newtype, fcode)))
6101 build_tree_list (NULL_TREE, fold_convert (newtype, arg0));
6102 return fold_convert (ftype,
6103 build_function_call_expr (decl, arglist));
6109 /* EXP is assumed to be builtin call which can narrow the FP type of
6110 the argument, for instance lround((double)f) -> lroundf (f). */
6113 fold_fixed_mathfn (tree exp)
6115 tree fndecl = get_callee_fndecl (exp);
6116 tree arglist = TREE_OPERAND (exp, 1);
6117 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
6120 if (! validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
6123 arg = TREE_VALUE (arglist);
6125 /* If argument is already integer valued, and we don't need to worry
6126 about setting errno, there's no need to perform rounding. */
6127 if (! flag_errno_math && integer_valued_real_p (arg))
6128 return fold (build1 (FIX_TRUNC_EXPR, TREE_TYPE (TREE_TYPE (fndecl)), arg));
6132 tree ftype = TREE_TYPE (arg);
6133 tree arg0 = strip_float_extensions (arg);
6134 tree newtype = TREE_TYPE (arg0);
6137 if (TYPE_PRECISION (newtype) < TYPE_PRECISION (ftype)
6138 && (decl = mathfn_built_in (newtype, fcode)))
6141 build_tree_list (NULL_TREE, fold_convert (newtype, arg0));
6142 return build_function_call_expr (decl, arglist);
6148 /* Fold function call to builtin cabs, cabsf or cabsl. ARGLIST
6149 is the argument list and TYPE is the return type. Return
6150 NULL_TREE if no if no simplification can be made. */
6153 fold_builtin_cabs (tree arglist, tree type)
6157 if (!arglist || TREE_CHAIN (arglist))
6160 arg = TREE_VALUE (arglist);
6161 if (TREE_CODE (TREE_TYPE (arg)) != COMPLEX_TYPE
6162 || TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) != REAL_TYPE)
6165 /* Evaluate cabs of a constant at compile-time. */
6166 if (flag_unsafe_math_optimizations
6167 && TREE_CODE (arg) == COMPLEX_CST
6168 && TREE_CODE (TREE_REALPART (arg)) == REAL_CST
6169 && TREE_CODE (TREE_IMAGPART (arg)) == REAL_CST
6170 && ! TREE_CONSTANT_OVERFLOW (TREE_REALPART (arg))
6171 && ! TREE_CONSTANT_OVERFLOW (TREE_IMAGPART (arg)))
6173 REAL_VALUE_TYPE r, i;
6175 r = TREE_REAL_CST (TREE_REALPART (arg));
6176 i = TREE_REAL_CST (TREE_IMAGPART (arg));
6178 real_arithmetic (&r, MULT_EXPR, &r, &r);
6179 real_arithmetic (&i, MULT_EXPR, &i, &i);
6180 real_arithmetic (&r, PLUS_EXPR, &r, &i);
6181 if (real_sqrt (&r, TYPE_MODE (type), &r)
6182 || ! flag_trapping_math)
6183 return build_real (type, r);
6186 /* If either part is zero, cabs is fabs of the other. */
6187 if (TREE_CODE (arg) == COMPLEX_EXPR
6188 && real_zerop (TREE_OPERAND (arg, 0)))
6189 return fold (build1 (ABS_EXPR, type, TREE_OPERAND (arg, 1)));
6190 if (TREE_CODE (arg) == COMPLEX_EXPR
6191 && real_zerop (TREE_OPERAND (arg, 1)))
6192 return fold (build1 (ABS_EXPR, type, TREE_OPERAND (arg, 0)));
6194 /* Don't do this when optimizing for size. */
6195 if (flag_unsafe_math_optimizations
6196 && optimize && !optimize_size)
6198 tree sqrtfn = mathfn_built_in (type, BUILT_IN_SQRT);
6200 if (sqrtfn != NULL_TREE)
6202 tree rpart, ipart, result, arglist;
6204 arg = builtin_save_expr (arg);
6206 rpart = fold (build1 (REALPART_EXPR, type, arg));
6207 ipart = fold (build1 (IMAGPART_EXPR, type, arg));
6209 rpart = builtin_save_expr (rpart);
6210 ipart = builtin_save_expr (ipart);
6212 result = fold (build2 (PLUS_EXPR, type,
6213 fold (build2 (MULT_EXPR, type,
6215 fold (build2 (MULT_EXPR, type,
6218 arglist = build_tree_list (NULL_TREE, result);
6219 return build_function_call_expr (sqrtfn, arglist);
6226 /* Fold a builtin function call to sqrt, sqrtf, or sqrtl. Return
6227 NULL_TREE if no simplification can be made. */
6230 fold_builtin_sqrt (tree arglist, tree type)
6233 enum built_in_function fcode;
6234 tree arg = TREE_VALUE (arglist);
6236 if (!validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
6239 /* Optimize sqrt of constant value. */
6240 if (TREE_CODE (arg) == REAL_CST
6241 && ! TREE_CONSTANT_OVERFLOW (arg))
6243 REAL_VALUE_TYPE r, x;
6245 x = TREE_REAL_CST (arg);
6246 if (real_sqrt (&r, TYPE_MODE (type), &x)
6247 || (!flag_trapping_math && !flag_errno_math))
6248 return build_real (type, r);
6251 /* Optimize sqrt(expN(x)) = expN(x*0.5). */
6252 fcode = builtin_mathfn_code (arg);
6253 if (flag_unsafe_math_optimizations && BUILTIN_EXPONENT_P (fcode))
6255 tree expfn = TREE_OPERAND (TREE_OPERAND (arg, 0), 0);
6256 arg = fold (build2 (MULT_EXPR, type,
6257 TREE_VALUE (TREE_OPERAND (arg, 1)),
6258 build_real (type, dconsthalf)));
6259 arglist = build_tree_list (NULL_TREE, arg);
6260 return build_function_call_expr (expfn, arglist);
6263 /* Optimize sqrt(Nroot(x)) -> pow(x,1/(2*N)). */
6264 if (flag_unsafe_math_optimizations && BUILTIN_ROOT_P (fcode))
6266 tree powfn = mathfn_built_in (type, BUILT_IN_POW);
6270 tree arg0 = TREE_VALUE (TREE_OPERAND (arg, 1));
6272 /* The inner root was either sqrt or cbrt. */
6273 REAL_VALUE_TYPE dconstroot =
6274 BUILTIN_SQRT_P (fcode) ? dconsthalf : dconstthird;
6276 /* Adjust for the outer root. */
6277 SET_REAL_EXP (&dconstroot, REAL_EXP (&dconstroot) - 1);
6278 dconstroot = real_value_truncate (TYPE_MODE (type), dconstroot);
6279 tree_root = build_real (type, dconstroot);
6280 arglist = tree_cons (NULL_TREE, arg0,
6281 build_tree_list (NULL_TREE, tree_root));
6282 return build_function_call_expr (powfn, arglist);
6286 /* Optimize sqrt(pow(x,y)) = pow(|x|,y*0.5). */
6287 if (flag_unsafe_math_optimizations
6288 && (fcode == BUILT_IN_POW
6289 || fcode == BUILT_IN_POWF
6290 || fcode == BUILT_IN_POWL))
6292 tree powfn = TREE_OPERAND (TREE_OPERAND (arg, 0), 0);
6293 tree arg0 = TREE_VALUE (TREE_OPERAND (arg, 1));
6294 tree arg1 = TREE_VALUE (TREE_CHAIN (TREE_OPERAND (arg, 1)));
6296 if (!tree_expr_nonnegative_p (arg0))
6297 arg0 = build1 (ABS_EXPR, type, arg0);
6298 narg1 = fold (build2 (MULT_EXPR, type, arg1,
6299 build_real (type, dconsthalf)));
6300 arglist = tree_cons (NULL_TREE, arg0,
6301 build_tree_list (NULL_TREE, narg1));
6302 return build_function_call_expr (powfn, arglist);
6308 /* Fold a builtin function call to cbrt, cbrtf, or cbrtl. Return
6309 NULL_TREE if no simplification can be made. */
6311 fold_builtin_cbrt (tree arglist, tree type)
6313 tree arg = TREE_VALUE (arglist);
6314 const enum built_in_function fcode = builtin_mathfn_code (arg);
6316 if (!validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
6319 /* Optimize cbrt of constant value. */
6320 if (real_zerop (arg) || real_onep (arg) || real_minus_onep (arg))
6323 if (flag_unsafe_math_optimizations)
6325 /* Optimize cbrt(expN(x)) -> expN(x/3). */
6326 if (BUILTIN_EXPONENT_P (fcode))
6328 tree expfn = TREE_OPERAND (TREE_OPERAND (arg, 0), 0);
6329 const REAL_VALUE_TYPE third_trunc =
6330 real_value_truncate (TYPE_MODE (type), dconstthird);
6331 arg = fold (build2 (MULT_EXPR, type,
6332 TREE_VALUE (TREE_OPERAND (arg, 1)),
6333 build_real (type, third_trunc)));
6334 arglist = build_tree_list (NULL_TREE, arg);
6335 return build_function_call_expr (expfn, arglist);
6338 /* Optimize cbrt(sqrt(x)) -> pow(x,1/6). */
6339 if (BUILTIN_SQRT_P (fcode))
6341 tree powfn = mathfn_built_in (type, BUILT_IN_POW);
6345 tree arg0 = TREE_VALUE (TREE_OPERAND (arg, 1));
6347 REAL_VALUE_TYPE dconstroot = dconstthird;
6349 SET_REAL_EXP (&dconstroot, REAL_EXP (&dconstroot) - 1);
6350 dconstroot = real_value_truncate (TYPE_MODE (type), dconstroot);
6351 tree_root = build_real (type, dconstroot);
6352 arglist = tree_cons (NULL_TREE, arg0,
6353 build_tree_list (NULL_TREE, tree_root));
6354 return build_function_call_expr (powfn, arglist);
6358 /* Optimize cbrt(cbrt(x)) -> pow(x,1/9) iff x is nonnegative. */
6359 if (BUILTIN_CBRT_P (fcode))
6361 tree arg0 = TREE_VALUE (TREE_OPERAND (arg, 1));
6362 if (tree_expr_nonnegative_p (arg0))
6364 tree powfn = mathfn_built_in (type, BUILT_IN_POW);
6369 REAL_VALUE_TYPE dconstroot;
6371 real_arithmetic (&dconstroot, MULT_EXPR, &dconstthird, &dconstthird);
6372 dconstroot = real_value_truncate (TYPE_MODE (type), dconstroot);
6373 tree_root = build_real (type, dconstroot);
6374 arglist = tree_cons (NULL_TREE, arg0,
6375 build_tree_list (NULL_TREE, tree_root));
6376 return build_function_call_expr (powfn, arglist);
6381 /* Optimize cbrt(pow(x,y)) -> pow(x,y/3) iff x is nonnegative. */
6382 if (fcode == BUILT_IN_POW || fcode == BUILT_IN_POWF
6383 || fcode == BUILT_IN_POWL)
6385 tree arg00 = TREE_VALUE (TREE_OPERAND (arg, 1));
6386 tree arg01 = TREE_VALUE (TREE_CHAIN (TREE_OPERAND (arg, 1)));
6387 if (tree_expr_nonnegative_p (arg00))
6389 tree powfn = TREE_OPERAND (TREE_OPERAND (arg, 0), 0);
6390 const REAL_VALUE_TYPE dconstroot
6391 = real_value_truncate (TYPE_MODE (type), dconstthird);
6392 tree narg01 = fold (build2 (MULT_EXPR, type, arg01,
6393 build_real (type, dconstroot)));
6394 arglist = tree_cons (NULL_TREE, arg00,
6395 build_tree_list (NULL_TREE, narg01));
6396 return build_function_call_expr (powfn, arglist);
6403 /* Fold function call to builtin sin, sinf, or sinl. Return
6404 NULL_TREE if no simplification can be made. */
6406 fold_builtin_sin (tree arglist)
6408 tree arg = TREE_VALUE (arglist);
6410 if (!validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
6413 /* Optimize sin (0.0) = 0.0. */
6414 if (real_zerop (arg))
6420 /* Fold function call to builtin cos, cosf, or cosl. Return
6421 NULL_TREE if no simplification can be made. */
6423 fold_builtin_cos (tree arglist, tree type, tree fndecl)
6425 tree arg = TREE_VALUE (arglist);
6427 if (!validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
6430 /* Optimize cos (0.0) = 1.0. */
6431 if (real_zerop (arg))
6432 return build_real (type, dconst1);
6434 /* Optimize cos(-x) into cos (x). */
6435 if (TREE_CODE (arg) == NEGATE_EXPR)
6437 tree args = build_tree_list (NULL_TREE,
6438 TREE_OPERAND (arg, 0));
6439 return build_function_call_expr (fndecl, args);
6445 /* Fold function call to builtin tan, tanf, or tanl. Return
6446 NULL_TREE if no simplification can be made. */
6448 fold_builtin_tan (tree arglist)
6450 enum built_in_function fcode;
6451 tree arg = TREE_VALUE (arglist);
6453 if (!validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
6456 /* Optimize tan(0.0) = 0.0. */
6457 if (real_zerop (arg))
6460 /* Optimize tan(atan(x)) = x. */
6461 fcode = builtin_mathfn_code (arg);
6462 if (flag_unsafe_math_optimizations
6463 && (fcode == BUILT_IN_ATAN
6464 || fcode == BUILT_IN_ATANF
6465 || fcode == BUILT_IN_ATANL))
6466 return TREE_VALUE (TREE_OPERAND (arg, 1));
6471 /* Fold function call to builtin atan, atanf, or atanl. Return
6472 NULL_TREE if no simplification can be made. */
6475 fold_builtin_atan (tree arglist, tree type)
6478 tree arg = TREE_VALUE (arglist);
6480 if (!validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
6483 /* Optimize atan(0.0) = 0.0. */
6484 if (real_zerop (arg))
6487 /* Optimize atan(1.0) = pi/4. */
6488 if (real_onep (arg))
6490 REAL_VALUE_TYPE cst;
6492 real_convert (&cst, TYPE_MODE (type), &dconstpi);
6493 SET_REAL_EXP (&cst, REAL_EXP (&cst) - 2);
6494 return build_real (type, cst);
6500 /* Fold function call to builtin trunc, truncf or truncl. Return
6501 NULL_TREE if no simplification can be made. */
6504 fold_builtin_trunc (tree exp)
6506 tree fndecl = get_callee_fndecl (exp);
6507 tree arglist = TREE_OPERAND (exp, 1);
6510 if (! validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
6513 /* Optimize trunc of constant value. */
6514 arg = TREE_VALUE (arglist);
6515 if (TREE_CODE (arg) == REAL_CST && ! TREE_CONSTANT_OVERFLOW (arg))
6517 REAL_VALUE_TYPE r, x;
6518 tree type = TREE_TYPE (TREE_TYPE (fndecl));
6520 x = TREE_REAL_CST (arg);
6521 real_trunc (&r, TYPE_MODE (type), &x);
6522 return build_real (type, r);
6525 return fold_trunc_transparent_mathfn (fndecl, arglist);
6528 /* Fold function call to builtin floor, floorf or floorl. Return
6529 NULL_TREE if no simplification can be made. */
6532 fold_builtin_floor (tree exp)
6534 tree fndecl = get_callee_fndecl (exp);
6535 tree arglist = TREE_OPERAND (exp, 1);
6538 if (! validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
6541 /* Optimize floor of constant value. */
6542 arg = TREE_VALUE (arglist);
6543 if (TREE_CODE (arg) == REAL_CST && ! TREE_CONSTANT_OVERFLOW (arg))
6547 x = TREE_REAL_CST (arg);
6548 if (! REAL_VALUE_ISNAN (x) || ! flag_errno_math)
6550 tree type = TREE_TYPE (TREE_TYPE (fndecl));
6553 real_floor (&r, TYPE_MODE (type), &x);
6554 return build_real (type, r);
6558 return fold_trunc_transparent_mathfn (fndecl, arglist);
6561 /* Fold function call to builtin ceil, ceilf or ceill. Return
6562 NULL_TREE if no simplification can be made. */
6565 fold_builtin_ceil (tree exp)
6567 tree fndecl = get_callee_fndecl (exp);
6568 tree arglist = TREE_OPERAND (exp, 1);
6571 if (! validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
6574 /* Optimize ceil of constant value. */
6575 arg = TREE_VALUE (arglist);
6576 if (TREE_CODE (arg) == REAL_CST && ! TREE_CONSTANT_OVERFLOW (arg))
6580 x = TREE_REAL_CST (arg);
6581 if (! REAL_VALUE_ISNAN (x) || ! flag_errno_math)
6583 tree type = TREE_TYPE (TREE_TYPE (fndecl));
6586 real_ceil (&r, TYPE_MODE (type), &x);
6587 return build_real (type, r);
6591 return fold_trunc_transparent_mathfn (fndecl, arglist);
6594 /* Fold function call to builtin round, roundf or roundl. Return
6595 NULL_TREE if no simplification can be made. */
6598 fold_builtin_round (tree exp)
6600 tree fndecl = get_callee_fndecl (exp);
6601 tree arglist = TREE_OPERAND (exp, 1);
6604 if (! validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
6607 /* Optimize round of constant value. */
6608 arg = TREE_VALUE (arglist);
6609 if (TREE_CODE (arg) == REAL_CST && ! TREE_CONSTANT_OVERFLOW (arg))
6613 x = TREE_REAL_CST (arg);
6614 if (! REAL_VALUE_ISNAN (x) || ! flag_errno_math)
6616 tree type = TREE_TYPE (TREE_TYPE (fndecl));
6619 real_round (&r, TYPE_MODE (type), &x);
6620 return build_real (type, r);
6624 return fold_trunc_transparent_mathfn (fndecl, arglist);
6627 /* Fold function call to builtin lround, lroundf or lroundl (or the
6628 corresponding long long versions). Return NULL_TREE if no
6629 simplification can be made. */
6632 fold_builtin_lround (tree exp)
6634 tree fndecl = get_callee_fndecl (exp);
6635 tree arglist = TREE_OPERAND (exp, 1);
6638 if (! validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
6641 /* Optimize lround of constant value. */
6642 arg = TREE_VALUE (arglist);
6643 if (TREE_CODE (arg) == REAL_CST && ! TREE_CONSTANT_OVERFLOW (arg))
6645 const REAL_VALUE_TYPE x = TREE_REAL_CST (arg);
6647 if (! REAL_VALUE_ISNAN (x) && ! REAL_VALUE_ISINF (x))
6649 tree itype = TREE_TYPE (TREE_TYPE (fndecl));
6650 tree ftype = TREE_TYPE (arg), result;
6651 HOST_WIDE_INT hi, lo;
6654 real_round (&r, TYPE_MODE (ftype), &x);
6655 REAL_VALUE_TO_INT (&lo, &hi, r);
6656 result = build_int_cst_wide (NULL_TREE, lo, hi);
6657 if (int_fits_type_p (result, itype))
6658 return fold_convert (itype, result);
6662 return fold_fixed_mathfn (exp);
6665 /* Fold function call to builtin ffs, clz, ctz, popcount and parity
6666 and their long and long long variants (i.e. ffsl and ffsll).
6667 Return NULL_TREE if no simplification can be made. */
6670 fold_builtin_bitop (tree fndecl, tree arglist)
6674 if (! validate_arglist (arglist, INTEGER_TYPE, VOID_TYPE))
6677 /* Optimize for constant argument. */
6678 arg = TREE_VALUE (arglist);
6679 if (TREE_CODE (arg) == INTEGER_CST && ! TREE_CONSTANT_OVERFLOW (arg))
6681 HOST_WIDE_INT hi, width, result;
6682 unsigned HOST_WIDE_INT lo;
6685 type = TREE_TYPE (arg);
6686 width = TYPE_PRECISION (type);
6687 lo = TREE_INT_CST_LOW (arg);
6689 /* Clear all the bits that are beyond the type's precision. */
6690 if (width > HOST_BITS_PER_WIDE_INT)
6692 hi = TREE_INT_CST_HIGH (arg);
6693 if (width < 2 * HOST_BITS_PER_WIDE_INT)
6694 hi &= ~((HOST_WIDE_INT) (-1) >> (width - HOST_BITS_PER_WIDE_INT));
6699 if (width < HOST_BITS_PER_WIDE_INT)
6700 lo &= ~((unsigned HOST_WIDE_INT) (-1) << width);
6703 switch (DECL_FUNCTION_CODE (fndecl))
6707 case BUILT_IN_FFSLL:
6709 result = exact_log2 (lo & -lo) + 1;
6711 result = HOST_BITS_PER_WIDE_INT + exact_log2 (hi & -hi) + 1;
6718 case BUILT_IN_CLZLL:
6720 result = width - floor_log2 (hi) - 1 - HOST_BITS_PER_WIDE_INT;
6722 result = width - floor_log2 (lo) - 1;
6723 else if (! CLZ_DEFINED_VALUE_AT_ZERO (TYPE_MODE (type), result))
6729 case BUILT_IN_CTZLL:
6731 result = exact_log2 (lo & -lo);
6733 result = HOST_BITS_PER_WIDE_INT + exact_log2 (hi & -hi);
6734 else if (! CTZ_DEFINED_VALUE_AT_ZERO (TYPE_MODE (type), result))
6738 case BUILT_IN_POPCOUNT:
6739 case BUILT_IN_POPCOUNTL:
6740 case BUILT_IN_POPCOUNTLL:
6743 result++, lo &= lo - 1;
6745 result++, hi &= hi - 1;
6748 case BUILT_IN_PARITY:
6749 case BUILT_IN_PARITYL:
6750 case BUILT_IN_PARITYLL:
6753 result++, lo &= lo - 1;
6755 result++, hi &= hi - 1;
6763 return build_int_cst (TREE_TYPE (TREE_TYPE (fndecl)), result);
6769 /* Return true if EXPR is the real constant contained in VALUE. */
6772 real_dconstp (tree expr, const REAL_VALUE_TYPE *value)
6776 return ((TREE_CODE (expr) == REAL_CST
6777 && ! TREE_CONSTANT_OVERFLOW (expr)
6778 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), *value))
6779 || (TREE_CODE (expr) == COMPLEX_CST
6780 && real_dconstp (TREE_REALPART (expr), value)
6781 && real_zerop (TREE_IMAGPART (expr))));
6784 /* A subroutine of fold_builtin to fold the various logarithmic
6785 functions. EXP is the CALL_EXPR of a call to a builtin logN
6786 function. VALUE is the base of the logN function. */
6789 fold_builtin_logarithm (tree fndecl, tree arglist,
6790 const REAL_VALUE_TYPE *value)
6792 if (validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
6794 tree type = TREE_TYPE (TREE_TYPE (fndecl));
6795 tree arg = TREE_VALUE (arglist);
6796 const enum built_in_function fcode = builtin_mathfn_code (arg);
6798 /* Optimize logN(1.0) = 0.0. */
6799 if (real_onep (arg))
6800 return build_real (type, dconst0);
6802 /* Optimize logN(N) = 1.0. If N can't be truncated to MODE
6803 exactly, then only do this if flag_unsafe_math_optimizations. */
6804 if (exact_real_truncate (TYPE_MODE (type), value)
6805 || flag_unsafe_math_optimizations)
6807 const REAL_VALUE_TYPE value_truncate =
6808 real_value_truncate (TYPE_MODE (type), *value);
6809 if (real_dconstp (arg, &value_truncate))
6810 return build_real (type, dconst1);
6813 /* Special case, optimize logN(expN(x)) = x. */
6814 if (flag_unsafe_math_optimizations
6815 && ((value == &dconste
6816 && (fcode == BUILT_IN_EXP
6817 || fcode == BUILT_IN_EXPF
6818 || fcode == BUILT_IN_EXPL))
6819 || (value == &dconst2
6820 && (fcode == BUILT_IN_EXP2
6821 || fcode == BUILT_IN_EXP2F
6822 || fcode == BUILT_IN_EXP2L))
6823 || (value == &dconst10 && (BUILTIN_EXP10_P (fcode)))))
6824 return fold_convert (type, TREE_VALUE (TREE_OPERAND (arg, 1)));
6826 /* Optimize logN(func()) for various exponential functions. We
6827 want to determine the value "x" and the power "exponent" in
6828 order to transform logN(x**exponent) into exponent*logN(x). */
6829 if (flag_unsafe_math_optimizations)
6831 tree exponent = 0, x = 0;
6838 /* Prepare to do logN(exp(exponent) -> exponent*logN(e). */
6839 x = build_real (type,
6840 real_value_truncate (TYPE_MODE (type), dconste));
6841 exponent = TREE_VALUE (TREE_OPERAND (arg, 1));
6844 case BUILT_IN_EXP2F:
6845 case BUILT_IN_EXP2L:
6846 /* Prepare to do logN(exp2(exponent) -> exponent*logN(2). */
6847 x = build_real (type, dconst2);
6848 exponent = TREE_VALUE (TREE_OPERAND (arg, 1));
6850 case BUILT_IN_EXP10:
6851 case BUILT_IN_EXP10F:
6852 case BUILT_IN_EXP10L:
6853 case BUILT_IN_POW10:
6854 case BUILT_IN_POW10F:
6855 case BUILT_IN_POW10L:
6856 /* Prepare to do logN(exp10(exponent) -> exponent*logN(10). */
6857 x = build_real (type, dconst10);
6858 exponent = TREE_VALUE (TREE_OPERAND (arg, 1));
6861 case BUILT_IN_SQRTF:
6862 case BUILT_IN_SQRTL:
6863 /* Prepare to do logN(sqrt(x) -> 0.5*logN(x). */
6864 x = TREE_VALUE (TREE_OPERAND (arg, 1));
6865 exponent = build_real (type, dconsthalf);
6868 case BUILT_IN_CBRTF:
6869 case BUILT_IN_CBRTL:
6870 /* Prepare to do logN(cbrt(x) -> (1/3)*logN(x). */
6871 x = TREE_VALUE (TREE_OPERAND (arg, 1));
6872 exponent = build_real (type, real_value_truncate (TYPE_MODE (type),
6878 /* Prepare to do logN(pow(x,exponent) -> exponent*logN(x). */
6879 x = TREE_VALUE (TREE_OPERAND (arg, 1));
6880 exponent = TREE_VALUE (TREE_CHAIN (TREE_OPERAND (arg, 1)));
6886 /* Now perform the optimization. */
6890 arglist = build_tree_list (NULL_TREE, x);
6891 logfn = build_function_call_expr (fndecl, arglist);
6892 return fold (build2 (MULT_EXPR, type, exponent, logfn));
6900 /* Fold a builtin function call to pow, powf, or powl. Return
6901 NULL_TREE if no simplification can be made. */
6903 fold_builtin_pow (tree fndecl, tree arglist, tree type)
6905 tree arg0 = TREE_VALUE (arglist);
6906 tree arg1 = TREE_VALUE (TREE_CHAIN (arglist));
6908 if (!validate_arglist (arglist, REAL_TYPE, REAL_TYPE, VOID_TYPE))
6911 /* Optimize pow(1.0,y) = 1.0. */
6912 if (real_onep (arg0))
6913 return omit_one_operand (type, build_real (type, dconst1), arg1);
6915 if (TREE_CODE (arg1) == REAL_CST
6916 && ! TREE_CONSTANT_OVERFLOW (arg1))
6918 REAL_VALUE_TYPE cint;
6922 c = TREE_REAL_CST (arg1);
6924 /* Optimize pow(x,0.0) = 1.0. */
6925 if (REAL_VALUES_EQUAL (c, dconst0))
6926 return omit_one_operand (type, build_real (type, dconst1),
6929 /* Optimize pow(x,1.0) = x. */
6930 if (REAL_VALUES_EQUAL (c, dconst1))
6933 /* Optimize pow(x,-1.0) = 1.0/x. */
6934 if (REAL_VALUES_EQUAL (c, dconstm1))
6935 return fold (build2 (RDIV_EXPR, type,
6936 build_real (type, dconst1), arg0));
6938 /* Optimize pow(x,0.5) = sqrt(x). */
6939 if (flag_unsafe_math_optimizations
6940 && REAL_VALUES_EQUAL (c, dconsthalf))
6942 tree sqrtfn = mathfn_built_in (type, BUILT_IN_SQRT);
6944 if (sqrtfn != NULL_TREE)
6946 tree arglist = build_tree_list (NULL_TREE, arg0);
6947 return build_function_call_expr (sqrtfn, arglist);
6951 /* Check for an integer exponent. */
6952 n = real_to_integer (&c);
6953 real_from_integer (&cint, VOIDmode, n, n < 0 ? -1 : 0, 0);
6954 if (real_identical (&c, &cint))
6956 /* Attempt to evaluate pow at compile-time. */
6957 if (TREE_CODE (arg0) == REAL_CST
6958 && ! TREE_CONSTANT_OVERFLOW (arg0))
6963 x = TREE_REAL_CST (arg0);
6964 inexact = real_powi (&x, TYPE_MODE (type), &x, n);
6965 if (flag_unsafe_math_optimizations || !inexact)
6966 return build_real (type, x);
6969 /* Strip sign ops from even integer powers. */
6970 if ((n & 1) == 0 && flag_unsafe_math_optimizations)
6972 tree narg0 = fold_strip_sign_ops (arg0);
6975 arglist = build_tree_list (NULL_TREE, arg1);
6976 arglist = tree_cons (NULL_TREE, narg0, arglist);
6977 return build_function_call_expr (fndecl, arglist);
6983 if (flag_unsafe_math_optimizations)
6985 const enum built_in_function fcode = builtin_mathfn_code (arg0);
6987 /* Optimize pow(expN(x),y) = expN(x*y). */
6988 if (BUILTIN_EXPONENT_P (fcode))
6990 tree expfn = TREE_OPERAND (TREE_OPERAND (arg0, 0), 0);
6991 tree arg = TREE_VALUE (TREE_OPERAND (arg0, 1));
6992 arg = fold (build2 (MULT_EXPR, type, arg, arg1));
6993 arglist = build_tree_list (NULL_TREE, arg);
6994 return build_function_call_expr (expfn, arglist);
6997 /* Optimize pow(sqrt(x),y) = pow(x,y*0.5). */
6998 if (BUILTIN_SQRT_P (fcode))
7000 tree narg0 = TREE_VALUE (TREE_OPERAND (arg0, 1));
7001 tree narg1 = fold (build2 (MULT_EXPR, type, arg1,
7002 build_real (type, dconsthalf)));
7004 arglist = tree_cons (NULL_TREE, narg0,
7005 build_tree_list (NULL_TREE, narg1));
7006 return build_function_call_expr (fndecl, arglist);
7009 /* Optimize pow(cbrt(x),y) = pow(x,y/3) iff x is nonnegative. */
7010 if (BUILTIN_CBRT_P (fcode))
7012 tree arg = TREE_VALUE (TREE_OPERAND (arg0, 1));
7013 if (tree_expr_nonnegative_p (arg))
7015 const REAL_VALUE_TYPE dconstroot
7016 = real_value_truncate (TYPE_MODE (type), dconstthird);
7017 tree narg1 = fold (build2 (MULT_EXPR, type, arg1,
7018 build_real (type, dconstroot)));
7019 arglist = tree_cons (NULL_TREE, arg,
7020 build_tree_list (NULL_TREE, narg1));
7021 return build_function_call_expr (fndecl, arglist);
7025 /* Optimize pow(pow(x,y),z) = pow(x,y*z). */
7026 if (fcode == BUILT_IN_POW || fcode == BUILT_IN_POWF
7027 || fcode == BUILT_IN_POWL)
7029 tree arg00 = TREE_VALUE (TREE_OPERAND (arg0, 1));
7030 tree arg01 = TREE_VALUE (TREE_CHAIN (TREE_OPERAND (arg0, 1)));
7031 tree narg1 = fold (build2 (MULT_EXPR, type, arg01, arg1));
7032 arglist = tree_cons (NULL_TREE, arg00,
7033 build_tree_list (NULL_TREE, narg1));
7034 return build_function_call_expr (fndecl, arglist);
7041 /* Fold a builtin function call to powi, powif, or powil. Return
7042 NULL_TREE if no simplification can be made. */
7044 fold_builtin_powi (tree fndecl ATTRIBUTE_UNUSED, tree arglist, tree type)
7046 tree arg0 = TREE_VALUE (arglist);
7047 tree arg1 = TREE_VALUE (TREE_CHAIN (arglist));
7049 if (!validate_arglist (arglist, REAL_TYPE, INTEGER_TYPE, VOID_TYPE))
7052 /* Optimize pow(1.0,y) = 1.0. */
7053 if (real_onep (arg0))
7054 return omit_one_operand (type, build_real (type, dconst1), arg1);
7056 if (host_integerp (arg1, 0))
7058 HOST_WIDE_INT c = TREE_INT_CST_LOW (arg1);
7060 /* Evaluate powi at compile-time. */
7061 if (TREE_CODE (arg0) == REAL_CST
7062 && ! TREE_CONSTANT_OVERFLOW (arg0))
7065 x = TREE_REAL_CST (arg0);
7066 real_powi (&x, TYPE_MODE (type), &x, c);
7067 return build_real (type, x);
7070 /* Optimize pow(x,0) = 1.0. */
7072 return omit_one_operand (type, build_real (type, dconst1),
7075 /* Optimize pow(x,1) = x. */
7079 /* Optimize pow(x,-1) = 1.0/x. */
7081 return fold (build2 (RDIV_EXPR, type,
7082 build_real (type, dconst1), arg0));
7088 /* A subroutine of fold_builtin to fold the various exponent
7089 functions. EXP is the CALL_EXPR of a call to a builtin function.
7090 VALUE is the value which will be raised to a power. */
7093 fold_builtin_exponent (tree fndecl, tree arglist,
7094 const REAL_VALUE_TYPE *value)
7096 if (validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
7098 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7099 tree arg = TREE_VALUE (arglist);
7101 /* Optimize exp*(0.0) = 1.0. */
7102 if (real_zerop (arg))
7103 return build_real (type, dconst1);
7105 /* Optimize expN(1.0) = N. */
7106 if (real_onep (arg))
7108 REAL_VALUE_TYPE cst;
7110 real_convert (&cst, TYPE_MODE (type), value);
7111 return build_real (type, cst);
7114 /* Attempt to evaluate expN(integer) at compile-time. */
7115 if (flag_unsafe_math_optimizations
7116 && TREE_CODE (arg) == REAL_CST
7117 && ! TREE_CONSTANT_OVERFLOW (arg))
7119 REAL_VALUE_TYPE cint;
7123 c = TREE_REAL_CST (arg);
7124 n = real_to_integer (&c);
7125 real_from_integer (&cint, VOIDmode, n,
7127 if (real_identical (&c, &cint))
7131 real_powi (&x, TYPE_MODE (type), value, n);
7132 return build_real (type, x);
7136 /* Optimize expN(logN(x)) = x. */
7137 if (flag_unsafe_math_optimizations)
7139 const enum built_in_function fcode = builtin_mathfn_code (arg);
7141 if ((value == &dconste
7142 && (fcode == BUILT_IN_LOG
7143 || fcode == BUILT_IN_LOGF
7144 || fcode == BUILT_IN_LOGL))
7145 || (value == &dconst2
7146 && (fcode == BUILT_IN_LOG2
7147 || fcode == BUILT_IN_LOG2F
7148 || fcode == BUILT_IN_LOG2L))
7149 || (value == &dconst10
7150 && (fcode == BUILT_IN_LOG10
7151 || fcode == BUILT_IN_LOG10F
7152 || fcode == BUILT_IN_LOG10L)))
7153 return fold_convert (type, TREE_VALUE (TREE_OPERAND (arg, 1)));
7160 /* Fold function call to builtin memcpy. Return
7161 NULL_TREE if no simplification can be made. */
7164 fold_builtin_memcpy (tree fndecl, tree arglist)
7166 tree dest, src, len;
7168 if (!validate_arglist (arglist,
7169 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
7172 dest = TREE_VALUE (arglist);
7173 src = TREE_VALUE (TREE_CHAIN (arglist));
7174 len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
7176 /* If the LEN parameter is zero, return DEST. */
7177 if (integer_zerop (len))
7178 return omit_one_operand (TREE_TYPE (TREE_TYPE (fndecl)), dest, src);
7180 /* If SRC and DEST are the same (and not volatile), return DEST. */
7181 if (operand_equal_p (src, dest, 0))
7182 return omit_one_operand (TREE_TYPE (TREE_TYPE (fndecl)), dest, len);
7187 /* Fold function call to builtin mempcpy. Return
7188 NULL_TREE if no simplification can be made. */
7191 fold_builtin_mempcpy (tree arglist, tree type, int endp)
7193 if (validate_arglist (arglist,
7194 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
7196 tree dest = TREE_VALUE (arglist);
7197 tree src = TREE_VALUE (TREE_CHAIN (arglist));
7198 tree len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
7200 /* If the LEN parameter is zero, return DEST. */
7201 if (integer_zerop (len))
7202 return omit_one_operand (type, dest, src);
7204 /* If SRC and DEST are the same (and not volatile), return DEST+LEN. */
7205 if (operand_equal_p (src, dest, 0))
7208 return omit_one_operand (type, dest, len);
7211 len = fold (build2 (MINUS_EXPR, TREE_TYPE (len), len,
7214 len = fold_convert (TREE_TYPE (dest), len);
7215 len = fold (build2 (PLUS_EXPR, TREE_TYPE (dest), dest, len));
7216 return fold_convert (type, len);
7222 /* Fold function call to builtin memmove. Return
7223 NULL_TREE if no simplification can be made. */
7226 fold_builtin_memmove (tree arglist, tree type)
7228 tree dest, src, len;
7230 if (!validate_arglist (arglist,
7231 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
7234 dest = TREE_VALUE (arglist);
7235 src = TREE_VALUE (TREE_CHAIN (arglist));
7236 len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
7238 /* If the LEN parameter is zero, return DEST. */
7239 if (integer_zerop (len))
7240 return omit_one_operand (type, dest, src);
7242 /* If SRC and DEST are the same (and not volatile), return DEST. */
7243 if (operand_equal_p (src, dest, 0))
7244 return omit_one_operand (type, dest, len);
7249 /* Fold function call to builtin strcpy. If LEN is not NULL, it represents
7250 the length of the string to be copied. Return NULL_TREE if no
7251 simplification can be made. */
7254 fold_builtin_strcpy (tree fndecl, tree arglist, tree len)
7258 if (!validate_arglist (arglist,
7259 POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
7262 dest = TREE_VALUE (arglist);
7263 src = TREE_VALUE (TREE_CHAIN (arglist));
7265 /* If SRC and DEST are the same (and not volatile), return DEST. */
7266 if (operand_equal_p (src, dest, 0))
7267 return fold_convert (TREE_TYPE (TREE_TYPE (fndecl)), dest);
7272 fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
7278 len = c_strlen (src, 1);
7279 if (! len || TREE_SIDE_EFFECTS (len))
7283 len = size_binop (PLUS_EXPR, len, ssize_int (1));
7284 arglist = build_tree_list (NULL_TREE, len);
7285 arglist = tree_cons (NULL_TREE, src, arglist);
7286 arglist = tree_cons (NULL_TREE, dest, arglist);
7287 return fold_convert (TREE_TYPE (TREE_TYPE (fndecl)),
7288 build_function_call_expr (fn, arglist));
7291 /* Fold function call to builtin strncpy. If SLEN is not NULL, it represents
7292 the length of the source string. Return NULL_TREE if no simplification
7296 fold_builtin_strncpy (tree fndecl, tree arglist, tree slen)
7298 tree dest, src, len, fn;
7300 if (!validate_arglist (arglist,
7301 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
7304 dest = TREE_VALUE (arglist);
7305 src = TREE_VALUE (TREE_CHAIN (arglist));
7306 len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
7308 /* If the LEN parameter is zero, return DEST. */
7309 if (integer_zerop (len))
7310 return omit_one_operand (TREE_TYPE (TREE_TYPE (fndecl)), dest, src);
7312 /* We can't compare slen with len as constants below if len is not a
7314 if (len == 0 || TREE_CODE (len) != INTEGER_CST)
7318 slen = c_strlen (src, 1);
7320 /* Now, we must be passed a constant src ptr parameter. */
7321 if (slen == 0 || TREE_CODE (slen) != INTEGER_CST)
7324 slen = size_binop (PLUS_EXPR, slen, ssize_int (1));
7326 /* We do not support simplification of this case, though we do
7327 support it when expanding trees into RTL. */
7328 /* FIXME: generate a call to __builtin_memset. */
7329 if (tree_int_cst_lt (slen, len))
7332 /* OK transform into builtin memcpy. */
7333 fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
7336 return fold_convert (TREE_TYPE (TREE_TYPE (fndecl)),
7337 build_function_call_expr (fn, arglist));
7340 /* Fold function call to builtin memcmp. Return
7341 NULL_TREE if no simplification can be made. */
7344 fold_builtin_memcmp (tree arglist)
7346 tree arg1, arg2, len;
7347 const char *p1, *p2;
7349 if (!validate_arglist (arglist,
7350 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
7353 arg1 = TREE_VALUE (arglist);
7354 arg2 = TREE_VALUE (TREE_CHAIN (arglist));
7355 len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
7357 /* If the LEN parameter is zero, return zero. */
7358 if (integer_zerop (len))
7359 return omit_two_operands (integer_type_node, integer_zero_node,
7362 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
7363 if (operand_equal_p (arg1, arg2, 0))
7364 return omit_one_operand (integer_type_node, integer_zero_node, len);
7366 p1 = c_getstr (arg1);
7367 p2 = c_getstr (arg2);
7369 /* If all arguments are constant, and the value of len is not greater
7370 than the lengths of arg1 and arg2, evaluate at compile-time. */
7371 if (host_integerp (len, 1) && p1 && p2
7372 && compare_tree_int (len, strlen (p1) + 1) <= 0
7373 && compare_tree_int (len, strlen (p2) + 1) <= 0)
7375 const int r = memcmp (p1, p2, tree_low_cst (len, 1));
7378 return integer_one_node;
7380 return integer_minus_one_node;
7382 return integer_zero_node;
7385 /* If len parameter is one, return an expression corresponding to
7386 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
7387 if (host_integerp (len, 1) && tree_low_cst (len, 1) == 1)
7389 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
7390 tree cst_uchar_ptr_node = build_pointer_type (cst_uchar_node);
7391 tree ind1 = fold_convert (integer_type_node,
7392 build1 (INDIRECT_REF, cst_uchar_node,
7393 fold_convert (cst_uchar_ptr_node,
7395 tree ind2 = fold_convert (integer_type_node,
7396 build1 (INDIRECT_REF, cst_uchar_node,
7397 fold_convert (cst_uchar_ptr_node,
7399 return fold (build2 (MINUS_EXPR, integer_type_node, ind1, ind2));
7405 /* Fold function call to builtin strcmp. Return
7406 NULL_TREE if no simplification can be made. */
7409 fold_builtin_strcmp (tree arglist)
7412 const char *p1, *p2;
7414 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
7417 arg1 = TREE_VALUE (arglist);
7418 arg2 = TREE_VALUE (TREE_CHAIN (arglist));
7420 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
7421 if (operand_equal_p (arg1, arg2, 0))
7422 return integer_zero_node;
7424 p1 = c_getstr (arg1);
7425 p2 = c_getstr (arg2);
7429 const int i = strcmp (p1, p2);
7431 return integer_minus_one_node;
7433 return integer_one_node;
7435 return integer_zero_node;
7438 /* If the second arg is "", return *(const unsigned char*)arg1. */
7439 if (p2 && *p2 == '\0')
7441 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
7442 tree cst_uchar_ptr_node = build_pointer_type (cst_uchar_node);
7443 return fold_convert (integer_type_node,
7444 build1 (INDIRECT_REF, cst_uchar_node,
7445 fold_convert (cst_uchar_ptr_node,
7449 /* If the first arg is "", return -*(const unsigned char*)arg2. */
7450 if (p1 && *p1 == '\0')
7452 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
7453 tree cst_uchar_ptr_node = build_pointer_type (cst_uchar_node);
7454 tree temp = fold_convert (integer_type_node,
7455 build1 (INDIRECT_REF, cst_uchar_node,
7456 fold_convert (cst_uchar_ptr_node,
7458 return fold (build1 (NEGATE_EXPR, integer_type_node, temp));
7464 /* Fold function call to builtin strncmp. Return
7465 NULL_TREE if no simplification can be made. */
7468 fold_builtin_strncmp (tree arglist)
7470 tree arg1, arg2, len;
7471 const char *p1, *p2;
7473 if (!validate_arglist (arglist,
7474 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
7477 arg1 = TREE_VALUE (arglist);
7478 arg2 = TREE_VALUE (TREE_CHAIN (arglist));
7479 len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
7481 /* If the LEN parameter is zero, return zero. */
7482 if (integer_zerop (len))
7483 return omit_two_operands (integer_type_node, integer_zero_node,
7486 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
7487 if (operand_equal_p (arg1, arg2, 0))
7488 return omit_one_operand (integer_type_node, integer_zero_node, len);
7490 p1 = c_getstr (arg1);
7491 p2 = c_getstr (arg2);
7493 if (host_integerp (len, 1) && p1 && p2)
7495 const int i = strncmp (p1, p2, tree_low_cst (len, 1));
7497 return integer_one_node;
7499 return integer_minus_one_node;
7501 return integer_zero_node;
7504 /* If the second arg is "", and the length is greater than zero,
7505 return *(const unsigned char*)arg1. */
7506 if (p2 && *p2 == '\0'
7507 && TREE_CODE (len) == INTEGER_CST
7508 && tree_int_cst_sgn (len) == 1)
7510 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
7511 tree cst_uchar_ptr_node = build_pointer_type (cst_uchar_node);
7512 return fold_convert (integer_type_node,
7513 build1 (INDIRECT_REF, cst_uchar_node,
7514 fold_convert (cst_uchar_ptr_node,
7518 /* If the first arg is "", and the length is greater than zero,
7519 return -*(const unsigned char*)arg2. */
7520 if (p1 && *p1 == '\0'
7521 && TREE_CODE (len) == INTEGER_CST
7522 && tree_int_cst_sgn (len) == 1)
7524 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
7525 tree cst_uchar_ptr_node = build_pointer_type (cst_uchar_node);
7526 tree temp = fold_convert (integer_type_node,
7527 build1 (INDIRECT_REF, cst_uchar_node,
7528 fold_convert (cst_uchar_ptr_node,
7530 return fold (build1 (NEGATE_EXPR, integer_type_node, temp));
7533 /* If len parameter is one, return an expression corresponding to
7534 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
7535 if (host_integerp (len, 1) && tree_low_cst (len, 1) == 1)
7537 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
7538 tree cst_uchar_ptr_node = build_pointer_type (cst_uchar_node);
7539 tree ind1 = fold_convert (integer_type_node,
7540 build1 (INDIRECT_REF, cst_uchar_node,
7541 fold_convert (cst_uchar_ptr_node,
7543 tree ind2 = fold_convert (integer_type_node,
7544 build1 (INDIRECT_REF, cst_uchar_node,
7545 fold_convert (cst_uchar_ptr_node,
7547 return fold (build2 (MINUS_EXPR, integer_type_node, ind1, ind2));
7553 /* Fold function call to builtin signbit, signbitf or signbitl. Return
7554 NULL_TREE if no simplification can be made. */
7557 fold_builtin_signbit (tree fndecl, tree arglist)
7559 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7562 if (!validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
7565 arg = TREE_VALUE (arglist);
7567 /* If ARG is a compile-time constant, determine the result. */
7568 if (TREE_CODE (arg) == REAL_CST
7569 && !TREE_CONSTANT_OVERFLOW (arg))
7573 c = TREE_REAL_CST (arg);
7574 temp = REAL_VALUE_NEGATIVE (c) ? integer_one_node : integer_zero_node;
7575 return fold_convert (type, temp);
7578 /* If ARG is non-negative, the result is always zero. */
7579 if (tree_expr_nonnegative_p (arg))
7580 return omit_one_operand (type, integer_zero_node, arg);
7582 /* If ARG's format doesn't have signed zeros, return "arg < 0.0". */
7583 if (!HONOR_SIGNED_ZEROS (TYPE_MODE (TREE_TYPE (arg))))
7584 return fold (build2 (LT_EXPR, type, arg,
7585 build_real (TREE_TYPE (arg), dconst0)));
7590 /* Fold function call to builtin copysign, copysignf or copysignl.
7591 Return NULL_TREE if no simplification can be made. */
7594 fold_builtin_copysign (tree fndecl, tree arglist, tree type)
7596 tree arg1, arg2, tem;
7598 if (!validate_arglist (arglist, REAL_TYPE, REAL_TYPE, VOID_TYPE))
7601 arg1 = TREE_VALUE (arglist);
7602 arg2 = TREE_VALUE (TREE_CHAIN (arglist));
7604 /* copysign(X,X) is X. */
7605 if (operand_equal_p (arg1, arg2, 0))
7606 return fold_convert (type, arg1);
7608 /* If ARG1 and ARG2 are compile-time constants, determine the result. */
7609 if (TREE_CODE (arg1) == REAL_CST
7610 && TREE_CODE (arg2) == REAL_CST
7611 && !TREE_CONSTANT_OVERFLOW (arg1)
7612 && !TREE_CONSTANT_OVERFLOW (arg2))
7614 REAL_VALUE_TYPE c1, c2;
7616 c1 = TREE_REAL_CST (arg1);
7617 c2 = TREE_REAL_CST (arg2);
7618 real_copysign (&c1, &c2);
7619 return build_real (type, c1);
7623 /* copysign(X, Y) is fabs(X) when Y is always non-negative.
7624 Remember to evaluate Y for side-effects. */
7625 if (tree_expr_nonnegative_p (arg2))
7626 return omit_one_operand (type,
7627 fold (build1 (ABS_EXPR, type, arg1)),
7630 /* Strip sign changing operations for the first argument. */
7631 tem = fold_strip_sign_ops (arg1);
7634 arglist = tree_cons (NULL_TREE, tem, TREE_CHAIN (arglist));
7635 return build_function_call_expr (fndecl, arglist);
7641 /* Fold a call to builtin isascii. */
7644 fold_builtin_isascii (tree arglist)
7646 if (! validate_arglist (arglist, INTEGER_TYPE, VOID_TYPE))
7650 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
7651 tree arg = TREE_VALUE (arglist);
7653 arg = build2 (BIT_AND_EXPR, integer_type_node, arg,
7654 build_int_cst (NULL_TREE,
7655 ~ (unsigned HOST_WIDE_INT) 0x7f));
7656 arg = fold (build2 (EQ_EXPR, integer_type_node,
7657 arg, integer_zero_node));
7659 if (in_gimple_form && !TREE_CONSTANT (arg))
7666 /* Fold a call to builtin toascii. */
7669 fold_builtin_toascii (tree arglist)
7671 if (! validate_arglist (arglist, INTEGER_TYPE, VOID_TYPE))
7675 /* Transform toascii(c) -> (c & 0x7f). */
7676 tree arg = TREE_VALUE (arglist);
7678 return fold (build2 (BIT_AND_EXPR, integer_type_node, arg,
7679 build_int_cst (NULL_TREE, 0x7f)));
7683 /* Fold a call to builtin isdigit. */
7686 fold_builtin_isdigit (tree arglist)
7688 if (! validate_arglist (arglist, INTEGER_TYPE, VOID_TYPE))
7692 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
7693 /* According to the C standard, isdigit is unaffected by locale.
7694 However, it definitely is affected by the target character set. */
7696 unsigned HOST_WIDE_INT target_digit0
7697 = lang_hooks.to_target_charset ('0');
7699 if (target_digit0 == 0)
7702 arg = fold_convert (unsigned_type_node, TREE_VALUE (arglist));
7703 arg = build2 (MINUS_EXPR, unsigned_type_node, arg,
7704 build_int_cst (unsigned_type_node, target_digit0));
7705 arg = build2 (LE_EXPR, integer_type_node, arg,
7706 build_int_cst (unsigned_type_node, 9));
7708 if (in_gimple_form && !TREE_CONSTANT (arg))
7715 /* Fold a call to fabs, fabsf or fabsl. */
7718 fold_builtin_fabs (tree arglist, tree type)
7722 if (!validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
7725 arg = TREE_VALUE (arglist);
7726 arg = fold_convert (type, arg);
7727 if (TREE_CODE (arg) == REAL_CST)
7728 return fold_abs_const (arg, type);
7729 return fold (build1 (ABS_EXPR, type, arg));
7732 /* Fold a call to abs, labs, llabs or imaxabs. */
7735 fold_builtin_abs (tree arglist, tree type)
7739 if (!validate_arglist (arglist, INTEGER_TYPE, VOID_TYPE))
7742 arg = TREE_VALUE (arglist);
7743 arg = fold_convert (type, arg);
7744 if (TREE_CODE (arg) == INTEGER_CST)
7745 return fold_abs_const (arg, type);
7746 return fold (build1 (ABS_EXPR, type, arg));
7749 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
7750 EXP is the CALL_EXPR for the call. */
7753 fold_builtin_classify (tree fndecl, tree arglist, int builtin_index)
7755 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7759 if (!validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
7761 /* Check that we have exactly one argument. */
7764 error ("too few arguments to function %qs",
7765 IDENTIFIER_POINTER (DECL_NAME (fndecl)));
7766 return error_mark_node;
7768 else if (TREE_CHAIN (arglist) != 0)
7770 error ("too many arguments to function %qs",
7771 IDENTIFIER_POINTER (DECL_NAME (fndecl)));
7772 return error_mark_node;
7776 error ("non-floating-point argument to function %qs",
7777 IDENTIFIER_POINTER (DECL_NAME (fndecl)));
7778 return error_mark_node;
7782 arg = TREE_VALUE (arglist);
7783 switch (builtin_index)
7785 case BUILT_IN_ISINF:
7786 if (!MODE_HAS_INFINITIES (TYPE_MODE (TREE_TYPE (arg))))
7787 return omit_one_operand (type, integer_zero_node, arg);
7789 if (TREE_CODE (arg) == REAL_CST)
7791 r = TREE_REAL_CST (arg);
7792 if (real_isinf (&r))
7793 return real_compare (GT_EXPR, &r, &dconst0)
7794 ? integer_one_node : integer_minus_one_node;
7796 return integer_zero_node;
7801 case BUILT_IN_FINITE:
7802 if (!MODE_HAS_NANS (TYPE_MODE (TREE_TYPE (arg)))
7803 && !MODE_HAS_INFINITIES (TYPE_MODE (TREE_TYPE (arg))))
7804 return omit_one_operand (type, integer_zero_node, arg);
7806 if (TREE_CODE (arg) == REAL_CST)
7808 r = TREE_REAL_CST (arg);
7809 return real_isinf (&r) || real_isnan (&r)
7810 ? integer_zero_node : integer_one_node;
7815 case BUILT_IN_ISNAN:
7816 if (!MODE_HAS_NANS (TYPE_MODE (TREE_TYPE (arg))))
7817 return omit_one_operand (type, integer_zero_node, arg);
7819 if (TREE_CODE (arg) == REAL_CST)
7821 r = TREE_REAL_CST (arg);
7822 return real_isnan (&r) ? integer_one_node : integer_zero_node;
7825 arg = builtin_save_expr (arg);
7826 return fold (build2 (UNORDERED_EXPR, type, arg, arg));
7833 /* Fold a call to an unordered comparison function such as
7834 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
7835 being called and ARGLIST is the argument list for the call.
7836 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
7837 the opposite of the desired result. UNORDERED_CODE is used
7838 for modes that can hold NaNs and ORDERED_CODE is used for
7842 fold_builtin_unordered_cmp (tree fndecl, tree arglist,
7843 enum tree_code unordered_code,
7844 enum tree_code ordered_code)
7846 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7847 enum tree_code code;
7850 enum tree_code code0, code1;
7851 tree cmp_type = NULL_TREE;
7853 if (!validate_arglist (arglist, REAL_TYPE, REAL_TYPE, VOID_TYPE))
7855 /* Check that we have exactly two arguments. */
7856 if (arglist == 0 || TREE_CHAIN (arglist) == 0)
7858 error ("too few arguments to function %qs",
7859 IDENTIFIER_POINTER (DECL_NAME (fndecl)));
7860 return error_mark_node;
7862 else if (TREE_CHAIN (TREE_CHAIN (arglist)) != 0)
7864 error ("too many arguments to function %qs",
7865 IDENTIFIER_POINTER (DECL_NAME (fndecl)));
7866 return error_mark_node;
7870 arg0 = TREE_VALUE (arglist);
7871 arg1 = TREE_VALUE (TREE_CHAIN (arglist));
7873 type0 = TREE_TYPE (arg0);
7874 type1 = TREE_TYPE (arg1);
7876 code0 = TREE_CODE (type0);
7877 code1 = TREE_CODE (type1);
7879 if (code0 == REAL_TYPE && code1 == REAL_TYPE)
7880 /* Choose the wider of two real types. */
7881 cmp_type = TYPE_PRECISION (type0) >= TYPE_PRECISION (type1)
7883 else if (code0 == REAL_TYPE && code1 == INTEGER_TYPE)
7885 else if (code0 == INTEGER_TYPE && code1 == REAL_TYPE)
7889 error ("non-floating-point argument to function %qs",
7890 IDENTIFIER_POINTER (DECL_NAME (fndecl)));
7891 return error_mark_node;
7894 arg0 = fold_convert (cmp_type, arg0);
7895 arg1 = fold_convert (cmp_type, arg1);
7897 if (unordered_code == UNORDERED_EXPR)
7899 if (!MODE_HAS_NANS (TYPE_MODE (TREE_TYPE (arg0))))
7900 return omit_two_operands (type, integer_zero_node, arg0, arg1);
7901 return fold (build2 (UNORDERED_EXPR, type, arg0, arg1));
7904 code = MODE_HAS_NANS (TYPE_MODE (TREE_TYPE (arg0))) ? unordered_code
7906 return fold (build1 (TRUTH_NOT_EXPR, type,
7907 fold (build2 (code, type, arg0, arg1))));
7910 /* Fold a call to one of the external complex multiply libcalls. */
7913 fold_builtin_complex_mul (tree type, tree arglist)
7915 tree ar, ai, br, bi;
7917 if (!validate_arglist (arglist, REAL_TYPE, REAL_TYPE, REAL_TYPE,
7918 REAL_TYPE, VOID_TYPE))
7921 ar = TREE_VALUE (arglist); arglist = TREE_CHAIN (arglist);
7922 ai = TREE_VALUE (arglist); arglist = TREE_CHAIN (arglist);
7923 br = TREE_VALUE (arglist); arglist = TREE_CHAIN (arglist);
7924 bi = TREE_VALUE (arglist);
7926 return fold_complex_mult_parts (type, ar, ai, br, bi);
7929 /* Fold a call to one of the external complex division libcalls. */
7932 fold_builtin_complex_div (tree type, tree arglist)
7934 tree ar, ai, br, bi;
7936 if (!validate_arglist (arglist, REAL_TYPE, REAL_TYPE, REAL_TYPE,
7937 REAL_TYPE, VOID_TYPE))
7940 ar = TREE_VALUE (arglist); arglist = TREE_CHAIN (arglist);
7941 ai = TREE_VALUE (arglist); arglist = TREE_CHAIN (arglist);
7942 br = TREE_VALUE (arglist); arglist = TREE_CHAIN (arglist);
7943 bi = TREE_VALUE (arglist);
7945 return fold_complex_div_parts (type, ar, ai, br, bi, RDIV_EXPR);
7948 /* Used by constant folding to simplify calls to builtin functions. EXP is
7949 the CALL_EXPR of a call to a builtin function. IGNORE is true if the
7950 result of the function call is ignored. This function returns NULL_TREE
7951 if no simplification was possible. */
7954 fold_builtin_1 (tree exp, bool ignore)
7956 tree fndecl = get_callee_fndecl (exp);
7957 tree arglist = TREE_OPERAND (exp, 1);
7958 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7959 enum built_in_function fcode;
7961 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
7962 return targetm.fold_builtin (exp, ignore);
7964 fcode = DECL_FUNCTION_CODE (fndecl);
7967 case BUILT_IN_FPUTS:
7968 return fold_builtin_fputs (arglist, ignore, false, NULL_TREE);
7970 case BUILT_IN_FPUTS_UNLOCKED:
7971 return fold_builtin_fputs (arglist, ignore, true, NULL_TREE);
7973 case BUILT_IN_STRSTR:
7974 return fold_builtin_strstr (arglist, type);
7976 case BUILT_IN_STRCAT:
7977 return fold_builtin_strcat (arglist);
7979 case BUILT_IN_STRNCAT:
7980 return fold_builtin_strncat (arglist);
7982 case BUILT_IN_STRSPN:
7983 return fold_builtin_strspn (arglist);
7985 case BUILT_IN_STRCSPN:
7986 return fold_builtin_strcspn (arglist);
7988 case BUILT_IN_STRCHR:
7989 case BUILT_IN_INDEX:
7990 return fold_builtin_strchr (arglist, type);
7992 case BUILT_IN_STRRCHR:
7993 case BUILT_IN_RINDEX:
7994 return fold_builtin_strrchr (arglist, type);
7996 case BUILT_IN_STRCPY:
7997 return fold_builtin_strcpy (fndecl, arglist, NULL_TREE);
7999 case BUILT_IN_STRNCPY:
8000 return fold_builtin_strncpy (fndecl, arglist, NULL_TREE);
8002 case BUILT_IN_STRCMP:
8003 return fold_builtin_strcmp (arglist);
8005 case BUILT_IN_STRNCMP:
8006 return fold_builtin_strncmp (arglist);
8008 case BUILT_IN_STRPBRK:
8009 return fold_builtin_strpbrk (arglist, type);
8012 case BUILT_IN_MEMCMP:
8013 return fold_builtin_memcmp (arglist);
8015 case BUILT_IN_SPRINTF:
8016 return fold_builtin_sprintf (arglist, ignore);
8018 case BUILT_IN_CONSTANT_P:
8022 val = fold_builtin_constant_p (arglist);
8023 /* Gimplification will pull the CALL_EXPR for the builtin out of
8024 an if condition. When not optimizing, we'll not CSE it back.
8025 To avoid link error types of regressions, return false now. */
8026 if (!val && !optimize)
8027 val = integer_zero_node;
8032 case BUILT_IN_EXPECT:
8033 return fold_builtin_expect (arglist);
8035 case BUILT_IN_CLASSIFY_TYPE:
8036 return fold_builtin_classify_type (arglist);
8038 case BUILT_IN_STRLEN:
8039 return fold_builtin_strlen (arglist);
8042 case BUILT_IN_FABSF:
8043 case BUILT_IN_FABSL:
8044 return fold_builtin_fabs (arglist, type);
8048 case BUILT_IN_LLABS:
8049 case BUILT_IN_IMAXABS:
8050 return fold_builtin_abs (arglist, type);
8053 case BUILT_IN_CONJF:
8054 case BUILT_IN_CONJL:
8055 if (validate_arglist (arglist, COMPLEX_TYPE, VOID_TYPE))
8056 return fold (build1 (CONJ_EXPR, type, TREE_VALUE (arglist)));
8059 case BUILT_IN_CREAL:
8060 case BUILT_IN_CREALF:
8061 case BUILT_IN_CREALL:
8062 if (validate_arglist (arglist, COMPLEX_TYPE, VOID_TYPE))
8063 return non_lvalue (fold (build1 (REALPART_EXPR, type,
8064 TREE_VALUE (arglist))));
8067 case BUILT_IN_CIMAG:
8068 case BUILT_IN_CIMAGF:
8069 case BUILT_IN_CIMAGL:
8070 if (validate_arglist (arglist, COMPLEX_TYPE, VOID_TYPE))
8071 return non_lvalue (fold (build1 (IMAGPART_EXPR, type,
8072 TREE_VALUE (arglist))));
8076 case BUILT_IN_CABSF:
8077 case BUILT_IN_CABSL:
8078 return fold_builtin_cabs (arglist, type);
8081 case BUILT_IN_SQRTF:
8082 case BUILT_IN_SQRTL:
8083 return fold_builtin_sqrt (arglist, type);
8086 case BUILT_IN_CBRTF:
8087 case BUILT_IN_CBRTL:
8088 return fold_builtin_cbrt (arglist, type);
8093 return fold_builtin_sin (arglist);
8098 return fold_builtin_cos (arglist, type, fndecl);
8103 return fold_builtin_exponent (fndecl, arglist, &dconste);
8106 case BUILT_IN_EXP2F:
8107 case BUILT_IN_EXP2L:
8108 return fold_builtin_exponent (fndecl, arglist, &dconst2);
8110 case BUILT_IN_EXP10:
8111 case BUILT_IN_EXP10F:
8112 case BUILT_IN_EXP10L:
8113 case BUILT_IN_POW10:
8114 case BUILT_IN_POW10F:
8115 case BUILT_IN_POW10L:
8116 return fold_builtin_exponent (fndecl, arglist, &dconst10);
8121 return fold_builtin_logarithm (fndecl, arglist, &dconste);
8124 case BUILT_IN_LOG2F:
8125 case BUILT_IN_LOG2L:
8126 return fold_builtin_logarithm (fndecl, arglist, &dconst2);
8128 case BUILT_IN_LOG10:
8129 case BUILT_IN_LOG10F:
8130 case BUILT_IN_LOG10L:
8131 return fold_builtin_logarithm (fndecl, arglist, &dconst10);
8136 return fold_builtin_tan (arglist);
8139 case BUILT_IN_ATANF:
8140 case BUILT_IN_ATANL:
8141 return fold_builtin_atan (arglist, type);
8146 return fold_builtin_pow (fndecl, arglist, type);
8149 case BUILT_IN_POWIF:
8150 case BUILT_IN_POWIL:
8151 return fold_builtin_powi (fndecl, arglist, type);
8156 return fold_builtin_inf (type, true);
8158 case BUILT_IN_HUGE_VAL:
8159 case BUILT_IN_HUGE_VALF:
8160 case BUILT_IN_HUGE_VALL:
8161 return fold_builtin_inf (type, false);
8166 return fold_builtin_nan (arglist, type, true);
8169 case BUILT_IN_NANSF:
8170 case BUILT_IN_NANSL:
8171 return fold_builtin_nan (arglist, type, false);
8173 case BUILT_IN_FLOOR:
8174 case BUILT_IN_FLOORF:
8175 case BUILT_IN_FLOORL:
8176 return fold_builtin_floor (exp);
8179 case BUILT_IN_CEILF:
8180 case BUILT_IN_CEILL:
8181 return fold_builtin_ceil (exp);
8183 case BUILT_IN_TRUNC:
8184 case BUILT_IN_TRUNCF:
8185 case BUILT_IN_TRUNCL:
8186 return fold_builtin_trunc (exp);
8188 case BUILT_IN_ROUND:
8189 case BUILT_IN_ROUNDF:
8190 case BUILT_IN_ROUNDL:
8191 return fold_builtin_round (exp);
8193 case BUILT_IN_NEARBYINT:
8194 case BUILT_IN_NEARBYINTF:
8195 case BUILT_IN_NEARBYINTL:
8197 case BUILT_IN_RINTF:
8198 case BUILT_IN_RINTL:
8199 return fold_trunc_transparent_mathfn (fndecl, arglist);
8201 case BUILT_IN_LROUND:
8202 case BUILT_IN_LROUNDF:
8203 case BUILT_IN_LROUNDL:
8204 case BUILT_IN_LLROUND:
8205 case BUILT_IN_LLROUNDF:
8206 case BUILT_IN_LLROUNDL:
8207 return fold_builtin_lround (exp);
8209 case BUILT_IN_LRINT:
8210 case BUILT_IN_LRINTF:
8211 case BUILT_IN_LRINTL:
8212 case BUILT_IN_LLRINT:
8213 case BUILT_IN_LLRINTF:
8214 case BUILT_IN_LLRINTL:
8215 return fold_fixed_mathfn (exp);
8219 case BUILT_IN_FFSLL:
8222 case BUILT_IN_CLZLL:
8225 case BUILT_IN_CTZLL:
8226 case BUILT_IN_POPCOUNT:
8227 case BUILT_IN_POPCOUNTL:
8228 case BUILT_IN_POPCOUNTLL:
8229 case BUILT_IN_PARITY:
8230 case BUILT_IN_PARITYL:
8231 case BUILT_IN_PARITYLL:
8232 return fold_builtin_bitop (fndecl, arglist);
8234 case BUILT_IN_MEMCPY:
8235 return fold_builtin_memcpy (fndecl, arglist);
8237 case BUILT_IN_MEMPCPY:
8238 return fold_builtin_mempcpy (arglist, type, /*endp=*/1);
8240 case BUILT_IN_MEMMOVE:
8241 return fold_builtin_memmove (arglist, type);
8243 case BUILT_IN_SIGNBIT:
8244 case BUILT_IN_SIGNBITF:
8245 case BUILT_IN_SIGNBITL:
8246 return fold_builtin_signbit (fndecl, arglist);
8248 case BUILT_IN_ISASCII:
8249 return fold_builtin_isascii (arglist);
8251 case BUILT_IN_TOASCII:
8252 return fold_builtin_toascii (arglist);
8254 case BUILT_IN_ISDIGIT:
8255 return fold_builtin_isdigit (arglist);
8257 case BUILT_IN_COPYSIGN:
8258 case BUILT_IN_COPYSIGNF:
8259 case BUILT_IN_COPYSIGNL:
8260 return fold_builtin_copysign (fndecl, arglist, type);
8262 case BUILT_IN_FINITE:
8263 case BUILT_IN_FINITEF:
8264 case BUILT_IN_FINITEL:
8265 return fold_builtin_classify (fndecl, arglist, BUILT_IN_FINITE);
8267 case BUILT_IN_ISINF:
8268 case BUILT_IN_ISINFF:
8269 case BUILT_IN_ISINFL:
8270 return fold_builtin_classify (fndecl, arglist, BUILT_IN_ISINF);
8272 case BUILT_IN_ISNAN:
8273 case BUILT_IN_ISNANF:
8274 case BUILT_IN_ISNANL:
8275 return fold_builtin_classify (fndecl, arglist, BUILT_IN_ISNAN);
8277 case BUILT_IN_ISGREATER:
8278 return fold_builtin_unordered_cmp (fndecl, arglist, UNLE_EXPR, LE_EXPR);
8279 case BUILT_IN_ISGREATEREQUAL:
8280 return fold_builtin_unordered_cmp (fndecl, arglist, UNLT_EXPR, LT_EXPR);
8281 case BUILT_IN_ISLESS:
8282 return fold_builtin_unordered_cmp (fndecl, arglist, UNGE_EXPR, GE_EXPR);
8283 case BUILT_IN_ISLESSEQUAL:
8284 return fold_builtin_unordered_cmp (fndecl, arglist, UNGT_EXPR, GT_EXPR);
8285 case BUILT_IN_ISLESSGREATER:
8286 return fold_builtin_unordered_cmp (fndecl, arglist, UNEQ_EXPR, EQ_EXPR);
8287 case BUILT_IN_ISUNORDERED:
8288 return fold_builtin_unordered_cmp (fndecl, arglist, UNORDERED_EXPR,
8291 /* We do the folding for va_start in the expander. */
8292 case BUILT_IN_VA_START:
8296 if (fcode >= BUILT_IN_COMPLEX_MUL_MIN
8297 && fcode <= BUILT_IN_COMPLEX_MUL_MAX)
8298 return fold_builtin_complex_mul (type, arglist);
8299 if (fcode >= BUILT_IN_COMPLEX_DIV_MIN
8300 && fcode <= BUILT_IN_COMPLEX_DIV_MAX)
8301 return fold_builtin_complex_div (type, arglist);
8308 /* A wrapper function for builtin folding that prevents warnings for
8309 "statement without effect" and the like, caused by removing the
8310 call node earlier than the warning is generated. */
8313 fold_builtin (tree exp, bool ignore)
8315 exp = fold_builtin_1 (exp, ignore);
8318 /* ??? Don't clobber shared nodes such as integer_zero_node. */
8319 if (CONSTANT_CLASS_P (exp))
8320 exp = build1 (NOP_EXPR, TREE_TYPE (exp), exp);
8321 TREE_NO_WARNING (exp) = 1;
8327 /* Conveniently construct a function call expression. */
8330 build_function_call_expr (tree fn, tree arglist)
8334 call_expr = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn);
8335 call_expr = build3 (CALL_EXPR, TREE_TYPE (TREE_TYPE (fn)),
8336 call_expr, arglist, NULL_TREE);
8337 return fold (call_expr);
8340 /* This function validates the types of a function call argument list
8341 represented as a tree chain of parameters against a specified list
8342 of tree_codes. If the last specifier is a 0, that represents an
8343 ellipses, otherwise the last specifier must be a VOID_TYPE. */
8346 validate_arglist (tree arglist, ...)
8348 enum tree_code code;
8352 va_start (ap, arglist);
8356 code = va_arg (ap, enum tree_code);
8360 /* This signifies an ellipses, any further arguments are all ok. */
8364 /* This signifies an endlink, if no arguments remain, return
8365 true, otherwise return false. */
8369 /* If no parameters remain or the parameter's code does not
8370 match the specified code, return false. Otherwise continue
8371 checking any remaining arguments. */
8374 if (code == POINTER_TYPE)
8376 if (! POINTER_TYPE_P (TREE_TYPE (TREE_VALUE (arglist))))
8379 else if (code != TREE_CODE (TREE_TYPE (TREE_VALUE (arglist))))
8383 arglist = TREE_CHAIN (arglist);
8387 /* We need gotos here since we can only have one VA_CLOSE in a
8395 /* Default target-specific builtin expander that does nothing. */
8398 default_expand_builtin (tree exp ATTRIBUTE_UNUSED,
8399 rtx target ATTRIBUTE_UNUSED,
8400 rtx subtarget ATTRIBUTE_UNUSED,
8401 enum machine_mode mode ATTRIBUTE_UNUSED,
8402 int ignore ATTRIBUTE_UNUSED)
8407 /* Returns true is EXP represents data that would potentially reside
8408 in a readonly section. */
8411 readonly_data_expr (tree exp)
8415 if (TREE_CODE (exp) != ADDR_EXPR)
8418 exp = get_base_address (TREE_OPERAND (exp, 0));
8422 /* Make sure we call decl_readonly_section only for trees it
8423 can handle (since it returns true for everything it doesn't
8425 if (TREE_CODE (exp) == STRING_CST
8426 || TREE_CODE (exp) == CONSTRUCTOR
8427 || (TREE_CODE (exp) == VAR_DECL && TREE_STATIC (exp)))
8428 return decl_readonly_section (exp, 0);
8433 /* Simplify a call to the strstr builtin.
8435 Return 0 if no simplification was possible, otherwise return the
8436 simplified form of the call as a tree.
8438 The simplified form may be a constant or other expression which
8439 computes the same value, but in a more efficient manner (including
8440 calls to other builtin functions).
8442 The call may contain arguments which need to be evaluated, but
8443 which are not useful to determine the result of the call. In
8444 this case we return a chain of COMPOUND_EXPRs. The LHS of each
8445 COMPOUND_EXPR will be an argument which must be evaluated.
8446 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
8447 COMPOUND_EXPR in the chain will contain the tree for the simplified
8448 form of the builtin function call. */
8451 fold_builtin_strstr (tree arglist, tree type)
8453 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
8457 tree s1 = TREE_VALUE (arglist), s2 = TREE_VALUE (TREE_CHAIN (arglist));
8459 const char *p1, *p2;
8468 const char *r = strstr (p1, p2);
8472 return build_int_cst (TREE_TYPE (s1), 0);
8474 /* Return an offset into the constant string argument. */
8475 tem = fold (build2 (PLUS_EXPR, TREE_TYPE (s1),
8476 s1, build_int_cst (TREE_TYPE (s1), r - p1)));
8477 return fold_convert (type, tem);
8486 fn = implicit_built_in_decls[BUILT_IN_STRCHR];
8490 /* New argument list transforming strstr(s1, s2) to
8491 strchr(s1, s2[0]). */
8492 arglist = build_tree_list (NULL_TREE,
8493 build_int_cst (NULL_TREE, p2[0]));
8494 arglist = tree_cons (NULL_TREE, s1, arglist);
8495 return build_function_call_expr (fn, arglist);
8499 /* Simplify a call to the strchr builtin.
8501 Return 0 if no simplification was possible, otherwise return the
8502 simplified form of the call as a tree.
8504 The simplified form may be a constant or other expression which
8505 computes the same value, but in a more efficient manner (including
8506 calls to other builtin functions).
8508 The call may contain arguments which need to be evaluated, but
8509 which are not useful to determine the result of the call. In
8510 this case we return a chain of COMPOUND_EXPRs. The LHS of each
8511 COMPOUND_EXPR will be an argument which must be evaluated.
8512 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
8513 COMPOUND_EXPR in the chain will contain the tree for the simplified
8514 form of the builtin function call. */
8517 fold_builtin_strchr (tree arglist, tree type)
8519 if (!validate_arglist (arglist, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
8523 tree s1 = TREE_VALUE (arglist), s2 = TREE_VALUE (TREE_CHAIN (arglist));
8526 if (TREE_CODE (s2) != INTEGER_CST)
8536 if (target_char_cast (s2, &c))
8542 return build_int_cst (TREE_TYPE (s1), 0);
8544 /* Return an offset into the constant string argument. */
8545 tem = fold (build2 (PLUS_EXPR, TREE_TYPE (s1),
8546 s1, build_int_cst (TREE_TYPE (s1), r - p1)));
8547 return fold_convert (type, tem);
8553 /* Simplify a call to the strrchr builtin.
8555 Return 0 if no simplification was possible, otherwise return the
8556 simplified form of the call as a tree.
8558 The simplified form may be a constant or other expression which
8559 computes the same value, but in a more efficient manner (including
8560 calls to other builtin functions).
8562 The call may contain arguments which need to be evaluated, but
8563 which are not useful to determine the result of the call. In
8564 this case we return a chain of COMPOUND_EXPRs. The LHS of each
8565 COMPOUND_EXPR will be an argument which must be evaluated.
8566 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
8567 COMPOUND_EXPR in the chain will contain the tree for the simplified
8568 form of the builtin function call. */
8571 fold_builtin_strrchr (tree arglist, tree type)
8573 if (!validate_arglist (arglist, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
8577 tree s1 = TREE_VALUE (arglist), s2 = TREE_VALUE (TREE_CHAIN (arglist));
8581 if (TREE_CODE (s2) != INTEGER_CST)
8591 if (target_char_cast (s2, &c))
8594 r = strrchr (p1, c);
8597 return build_int_cst (TREE_TYPE (s1), 0);
8599 /* Return an offset into the constant string argument. */
8600 tem = fold (build2 (PLUS_EXPR, TREE_TYPE (s1),
8601 s1, build_int_cst (TREE_TYPE (s1), r - p1)));
8602 return fold_convert (type, tem);
8605 if (! integer_zerop (s2))
8608 fn = implicit_built_in_decls[BUILT_IN_STRCHR];
8612 /* Transform strrchr(s1, '\0') to strchr(s1, '\0'). */
8613 return build_function_call_expr (fn, arglist);
8617 /* Simplify a call to the strpbrk builtin.
8619 Return 0 if no simplification was possible, otherwise return the
8620 simplified form of the call as a tree.
8622 The simplified form may be a constant or other expression which
8623 computes the same value, but in a more efficient manner (including
8624 calls to other builtin functions).
8626 The call may contain arguments which need to be evaluated, but
8627 which are not useful to determine the result of the call. In
8628 this case we return a chain of COMPOUND_EXPRs. The LHS of each
8629 COMPOUND_EXPR will be an argument which must be evaluated.
8630 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
8631 COMPOUND_EXPR in the chain will contain the tree for the simplified
8632 form of the builtin function call. */
8635 fold_builtin_strpbrk (tree arglist, tree type)
8637 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
8641 tree s1 = TREE_VALUE (arglist), s2 = TREE_VALUE (TREE_CHAIN (arglist));
8643 const char *p1, *p2;
8652 const char *r = strpbrk (p1, p2);
8656 return build_int_cst (TREE_TYPE (s1), 0);
8658 /* Return an offset into the constant string argument. */
8659 tem = fold (build2 (PLUS_EXPR, TREE_TYPE (s1),
8660 s1, build_int_cst (TREE_TYPE (s1), r - p1)));
8661 return fold_convert (type, tem);
8665 /* strpbrk(x, "") == NULL.
8666 Evaluate and ignore s1 in case it had side-effects. */
8667 return omit_one_operand (TREE_TYPE (s1), integer_zero_node, s1);
8670 return 0; /* Really call strpbrk. */
8672 fn = implicit_built_in_decls[BUILT_IN_STRCHR];
8676 /* New argument list transforming strpbrk(s1, s2) to
8677 strchr(s1, s2[0]). */
8678 arglist = build_tree_list (NULL_TREE,
8679 build_int_cst (NULL_TREE, p2[0]));
8680 arglist = tree_cons (NULL_TREE, s1, arglist);
8681 return build_function_call_expr (fn, arglist);
8685 /* Simplify a call to the strcat builtin.
8687 Return 0 if no simplification was possible, otherwise return the
8688 simplified form of the call as a tree.
8690 The simplified form may be a constant or other expression which
8691 computes the same value, but in a more efficient manner (including
8692 calls to other builtin functions).
8694 The call may contain arguments which need to be evaluated, but
8695 which are not useful to determine the result of the call. In
8696 this case we return a chain of COMPOUND_EXPRs. The LHS of each
8697 COMPOUND_EXPR will be an argument which must be evaluated.
8698 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
8699 COMPOUND_EXPR in the chain will contain the tree for the simplified
8700 form of the builtin function call. */
8703 fold_builtin_strcat (tree arglist)
8705 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
8709 tree dst = TREE_VALUE (arglist),
8710 src = TREE_VALUE (TREE_CHAIN (arglist));
8711 const char *p = c_getstr (src);
8713 /* If the string length is zero, return the dst parameter. */
8714 if (p && *p == '\0')
8721 /* Simplify a call to the strncat builtin.
8723 Return 0 if no simplification was possible, otherwise return the
8724 simplified form of the call as a tree.
8726 The simplified form may be a constant or other expression which
8727 computes the same value, but in a more efficient manner (including
8728 calls to other builtin functions).
8730 The call may contain arguments which need to be evaluated, but
8731 which are not useful to determine the result of the call. In
8732 this case we return a chain of COMPOUND_EXPRs. The LHS of each
8733 COMPOUND_EXPR will be an argument which must be evaluated.
8734 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
8735 COMPOUND_EXPR in the chain will contain the tree for the simplified
8736 form of the builtin function call. */
8739 fold_builtin_strncat (tree arglist)
8741 if (!validate_arglist (arglist,
8742 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
8746 tree dst = TREE_VALUE (arglist);
8747 tree src = TREE_VALUE (TREE_CHAIN (arglist));
8748 tree len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
8749 const char *p = c_getstr (src);
8751 /* If the requested length is zero, or the src parameter string
8752 length is zero, return the dst parameter. */
8753 if (integer_zerop (len) || (p && *p == '\0'))
8754 return omit_two_operands (TREE_TYPE (dst), dst, src, len);
8756 /* If the requested len is greater than or equal to the string
8757 length, call strcat. */
8758 if (TREE_CODE (len) == INTEGER_CST && p
8759 && compare_tree_int (len, strlen (p)) >= 0)
8762 = tree_cons (NULL_TREE, dst, build_tree_list (NULL_TREE, src));
8763 tree fn = implicit_built_in_decls[BUILT_IN_STRCAT];
8765 /* If the replacement _DECL isn't initialized, don't do the
8770 return build_function_call_expr (fn, newarglist);
8776 /* Simplify a call to the strspn builtin.
8778 Return 0 if no simplification was possible, otherwise return the
8779 simplified form of the call as a tree.
8781 The simplified form may be a constant or other expression which
8782 computes the same value, but in a more efficient manner (including
8783 calls to other builtin functions).
8785 The call may contain arguments which need to be evaluated, but
8786 which are not useful to determine the result of the call. In
8787 this case we return a chain of COMPOUND_EXPRs. The LHS of each
8788 COMPOUND_EXPR will be an argument which must be evaluated.
8789 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
8790 COMPOUND_EXPR in the chain will contain the tree for the simplified
8791 form of the builtin function call. */
8794 fold_builtin_strspn (tree arglist)
8796 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
8800 tree s1 = TREE_VALUE (arglist), s2 = TREE_VALUE (TREE_CHAIN (arglist));
8801 const char *p1 = c_getstr (s1), *p2 = c_getstr (s2);
8803 /* If both arguments are constants, evaluate at compile-time. */
8806 const size_t r = strspn (p1, p2);
8807 return size_int (r);
8810 /* If either argument is "", return 0. */
8811 if ((p1 && *p1 == '\0') || (p2 && *p2 == '\0'))
8812 /* Evaluate and ignore both arguments in case either one has
8814 return omit_two_operands (integer_type_node, integer_zero_node,
8820 /* Simplify a call to the strcspn builtin.
8822 Return 0 if no simplification was possible, otherwise return the
8823 simplified form of the call as a tree.
8825 The simplified form may be a constant or other expression which
8826 computes the same value, but in a more efficient manner (including
8827 calls to other builtin functions).
8829 The call may contain arguments which need to be evaluated, but
8830 which are not useful to determine the result of the call. In
8831 this case we return a chain of COMPOUND_EXPRs. The LHS of each
8832 COMPOUND_EXPR will be an argument which must be evaluated.
8833 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
8834 COMPOUND_EXPR in the chain will contain the tree for the simplified
8835 form of the builtin function call. */
8838 fold_builtin_strcspn (tree arglist)
8840 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
8844 tree s1 = TREE_VALUE (arglist), s2 = TREE_VALUE (TREE_CHAIN (arglist));
8845 const char *p1 = c_getstr (s1), *p2 = c_getstr (s2);
8847 /* If both arguments are constants, evaluate at compile-time. */
8850 const size_t r = strcspn (p1, p2);
8851 return size_int (r);
8854 /* If the first argument is "", return 0. */
8855 if (p1 && *p1 == '\0')
8857 /* Evaluate and ignore argument s2 in case it has
8859 return omit_one_operand (integer_type_node,
8860 integer_zero_node, s2);
8863 /* If the second argument is "", return __builtin_strlen(s1). */
8864 if (p2 && *p2 == '\0')
8866 tree newarglist = build_tree_list (NULL_TREE, s1),
8867 fn = implicit_built_in_decls[BUILT_IN_STRLEN];
8869 /* If the replacement _DECL isn't initialized, don't do the
8874 return build_function_call_expr (fn, newarglist);
8880 /* Fold a call to the fputs builtin. IGNORE is true if the value returned
8881 by the builtin will be ignored. UNLOCKED is true is true if this
8882 actually a call to fputs_unlocked. If LEN in non-NULL, it represents
8883 the known length of the string. Return NULL_TREE if no simplification
8887 fold_builtin_fputs (tree arglist, bool ignore, bool unlocked, tree len)
8890 tree fn_fputc = unlocked ? implicit_built_in_decls[BUILT_IN_FPUTC_UNLOCKED]
8891 : implicit_built_in_decls[BUILT_IN_FPUTC];
8892 tree fn_fwrite = unlocked ? implicit_built_in_decls[BUILT_IN_FWRITE_UNLOCKED]
8893 : implicit_built_in_decls[BUILT_IN_FWRITE];
8895 /* If the return value is used, or the replacement _DECL isn't
8896 initialized, don't do the transformation. */
8897 if (!ignore || !fn_fputc || !fn_fwrite)
8900 /* Verify the arguments in the original call. */
8901 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
8905 len = c_strlen (TREE_VALUE (arglist), 0);
8907 /* Get the length of the string passed to fputs. If the length
8908 can't be determined, punt. */
8910 || TREE_CODE (len) != INTEGER_CST)
8913 switch (compare_tree_int (len, 1))
8915 case -1: /* length is 0, delete the call entirely . */
8916 return omit_one_operand (integer_type_node, integer_zero_node,
8917 TREE_VALUE (TREE_CHAIN (arglist)));
8919 case 0: /* length is 1, call fputc. */
8921 const char *p = c_getstr (TREE_VALUE (arglist));
8925 /* New argument list transforming fputs(string, stream) to
8926 fputc(string[0], stream). */
8927 arglist = build_tree_list (NULL_TREE,
8928 TREE_VALUE (TREE_CHAIN (arglist)));
8929 arglist = tree_cons (NULL_TREE,
8930 build_int_cst (NULL_TREE, p[0]),
8937 case 1: /* length is greater than 1, call fwrite. */
8941 /* If optimizing for size keep fputs. */
8944 string_arg = TREE_VALUE (arglist);
8945 /* New argument list transforming fputs(string, stream) to
8946 fwrite(string, 1, len, stream). */
8947 arglist = build_tree_list (NULL_TREE,
8948 TREE_VALUE (TREE_CHAIN (arglist)));
8949 arglist = tree_cons (NULL_TREE, len, arglist);
8950 arglist = tree_cons (NULL_TREE, size_one_node, arglist);
8951 arglist = tree_cons (NULL_TREE, string_arg, arglist);
8959 /* These optimizations are only performed when the result is ignored,
8960 hence there's no need to cast the result to integer_type_node. */
8961 return build_function_call_expr (fn, arglist);
8964 /* Fold the new_arg's arguments (ARGLIST). Returns true if there was an error
8965 produced. False otherwise. This is done so that we don't output the error
8966 or warning twice or three times. */
8968 fold_builtin_next_arg (tree arglist)
8970 tree fntype = TREE_TYPE (current_function_decl);
8972 if (TYPE_ARG_TYPES (fntype) == 0
8973 || (TREE_VALUE (tree_last (TYPE_ARG_TYPES (fntype)))
8976 error ("%<va_start%> used in function with fixed args");
8981 /* Evidently an out of date version of <stdarg.h>; can't validate
8982 va_start's second argument, but can still work as intended. */
8983 warning ("%<__builtin_next_arg%> called without an argument");
8986 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
8987 when we checked the arguments and if needed issued a warning. */
8988 else if (!TREE_CHAIN (arglist)
8989 || !integer_zerop (TREE_VALUE (arglist))
8990 || !integer_zerop (TREE_VALUE (TREE_CHAIN (arglist)))
8991 || TREE_CHAIN (TREE_CHAIN (arglist)))
8993 tree last_parm = tree_last (DECL_ARGUMENTS (current_function_decl));
8994 tree arg = TREE_VALUE (arglist);
8996 if (TREE_CHAIN (arglist))
8998 error ("%<va_start%> used with too many arguments");
9002 /* Strip off all nops for the sake of the comparison. This
9003 is not quite the same as STRIP_NOPS. It does more.
9004 We must also strip off INDIRECT_EXPR for C++ reference
9006 while (TREE_CODE (arg) == NOP_EXPR
9007 || TREE_CODE (arg) == CONVERT_EXPR
9008 || TREE_CODE (arg) == NON_LVALUE_EXPR
9009 || TREE_CODE (arg) == INDIRECT_REF)
9010 arg = TREE_OPERAND (arg, 0);
9011 if (arg != last_parm)
9013 /* FIXME: Sometimes with the tree optimizers we can get the
9014 not the last argument even though the user used the last
9015 argument. We just warn and set the arg to be the last
9016 argument so that we will get wrong-code because of
9018 warning ("second parameter of %<va_start%> not last named argument");
9020 /* We want to verify the second parameter just once before the tree
9021 optimizers are run and then avoid keeping it in the tree,
9022 as otherwise we could warn even for correct code like:
9023 void foo (int i, ...)
9024 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
9025 TREE_VALUE (arglist) = integer_zero_node;
9026 TREE_CHAIN (arglist) = build_tree_list (NULL, integer_zero_node);
9032 /* Simplify a call to the sprintf builtin.
9034 Return 0 if no simplification was possible, otherwise return the
9035 simplified form of the call as a tree. If IGNORED is true, it means that
9036 the caller does not use the returned value of the function. */
9039 fold_builtin_sprintf (tree arglist, int ignored)
9041 tree call, retval, dest, fmt;
9042 const char *fmt_str = NULL;
9044 /* Verify the required arguments in the original call. We deal with two
9045 types of sprintf() calls: 'sprintf (str, fmt)' and
9046 'sprintf (dest, "%s", orig)'. */
9047 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE)
9048 && !validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, POINTER_TYPE,
9052 /* Get the destination string and the format specifier. */
9053 dest = TREE_VALUE (arglist);
9054 fmt = TREE_VALUE (TREE_CHAIN (arglist));
9056 /* Check whether the format is a literal string constant. */
9057 fmt_str = c_getstr (fmt);
9058 if (fmt_str == NULL)
9064 /* If the format doesn't contain % args or %%, use strcpy. */
9065 if (strchr (fmt_str, '%') == NULL)
9067 tree fn = implicit_built_in_decls[BUILT_IN_STRCPY];
9072 /* Convert sprintf (str, fmt) into strcpy (str, fmt) when
9073 'format' is known to contain no % formats. */
9074 arglist = build_tree_list (NULL_TREE, fmt);
9075 arglist = tree_cons (NULL_TREE, dest, arglist);
9076 call = build_function_call_expr (fn, arglist);
9078 retval = build_int_cst (NULL_TREE, strlen (fmt_str));
9081 /* If the format is "%s", use strcpy if the result isn't used. */
9082 else if (fmt_str && strcmp (fmt_str, "%s") == 0)
9085 fn = implicit_built_in_decls[BUILT_IN_STRCPY];
9090 /* Convert sprintf (str1, "%s", str2) into strcpy (str1, str2). */
9091 orig = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
9092 arglist = build_tree_list (NULL_TREE, orig);
9093 arglist = tree_cons (NULL_TREE, dest, arglist);
9096 retval = c_strlen (orig, 1);
9097 if (!retval || TREE_CODE (retval) != INTEGER_CST)
9100 call = build_function_call_expr (fn, arglist);
9106 (TREE_TYPE (TREE_TYPE (implicit_built_in_decls[BUILT_IN_SPRINTF])),
9108 return build2 (COMPOUND_EXPR, TREE_TYPE (retval), call, retval);