1 /* Expand builtin functions.
2 Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
3 2000, 2001, 2002, 2003, 2004 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"
50 #define CALLED_AS_BUILT_IN(NODE) \
51 (!strncmp (IDENTIFIER_POINTER (DECL_NAME (NODE)), "__builtin_", 10))
53 #ifndef PAD_VARARGS_DOWN
54 #define PAD_VARARGS_DOWN BYTES_BIG_ENDIAN
57 /* Define the names of the builtin function types and codes. */
58 const char *const built_in_class_names[4]
59 = {"NOT_BUILT_IN", "BUILT_IN_FRONTEND", "BUILT_IN_MD", "BUILT_IN_NORMAL"};
61 #define DEF_BUILTIN(X, N, C, T, LT, B, F, NA, AT, IM) #X,
62 const char *const built_in_names[(int) END_BUILTINS] =
64 #include "builtins.def"
68 /* Setup an array of _DECL trees, make sure each element is
69 initialized to NULL_TREE. */
70 tree built_in_decls[(int) END_BUILTINS];
71 /* Declarations used when constructing the builtin implicitly in the compiler.
72 It may be NULL_TREE when this is invalid (for instance runtime is not
73 required to implement the function call in all cases). */
74 tree implicit_built_in_decls[(int) END_BUILTINS];
76 static int get_pointer_alignment (tree, unsigned int);
77 static const char *c_getstr (tree);
78 static rtx c_readstr (const char *, enum machine_mode);
79 static int target_char_cast (tree, char *);
80 static rtx get_memory_rtx (tree);
81 static tree build_string_literal (int, const char *);
82 static int apply_args_size (void);
83 static int apply_result_size (void);
84 #if defined (HAVE_untyped_call) || defined (HAVE_untyped_return)
85 static rtx result_vector (int, rtx);
87 static rtx expand_builtin_setjmp (tree, rtx);
88 static void expand_builtin_update_setjmp_buf (rtx);
89 static void expand_builtin_prefetch (tree);
90 static rtx expand_builtin_apply_args (void);
91 static rtx expand_builtin_apply_args_1 (void);
92 static rtx expand_builtin_apply (rtx, rtx, rtx);
93 static void expand_builtin_return (rtx);
94 static enum type_class type_to_class (tree);
95 static rtx expand_builtin_classify_type (tree);
96 static void expand_errno_check (tree, rtx);
97 static rtx expand_builtin_mathfn (tree, rtx, rtx);
98 static rtx expand_builtin_mathfn_2 (tree, rtx, rtx);
99 static rtx expand_builtin_mathfn_3 (tree, rtx, rtx);
100 static rtx expand_builtin_args_info (tree);
101 static rtx expand_builtin_next_arg (tree);
102 static rtx expand_builtin_va_start (tree);
103 static rtx expand_builtin_va_end (tree);
104 static rtx expand_builtin_va_copy (tree);
105 static rtx expand_builtin_memcmp (tree, tree, rtx, enum machine_mode);
106 static rtx expand_builtin_strcmp (tree, rtx, enum machine_mode);
107 static rtx expand_builtin_strncmp (tree, rtx, enum machine_mode);
108 static rtx builtin_memcpy_read_str (void *, HOST_WIDE_INT, enum machine_mode);
109 static rtx expand_builtin_strcat (tree, rtx, enum machine_mode);
110 static rtx expand_builtin_strncat (tree, rtx, enum machine_mode);
111 static rtx expand_builtin_strspn (tree, rtx, enum machine_mode);
112 static rtx expand_builtin_strcspn (tree, rtx, enum machine_mode);
113 static rtx expand_builtin_memcpy (tree, rtx, enum machine_mode);
114 static rtx expand_builtin_mempcpy (tree, rtx, enum machine_mode, int);
115 static rtx expand_builtin_memmove (tree, rtx, enum machine_mode);
116 static rtx expand_builtin_bcopy (tree);
117 static rtx expand_builtin_strcpy (tree, rtx, enum machine_mode);
118 static rtx expand_builtin_stpcpy (tree, rtx, enum machine_mode);
119 static rtx builtin_strncpy_read_str (void *, HOST_WIDE_INT, enum machine_mode);
120 static rtx expand_builtin_strncpy (tree, rtx, enum machine_mode);
121 static rtx builtin_memset_read_str (void *, HOST_WIDE_INT, enum machine_mode);
122 static rtx builtin_memset_gen_str (void *, HOST_WIDE_INT, enum machine_mode);
123 static rtx expand_builtin_memset (tree, rtx, enum machine_mode);
124 static rtx expand_builtin_bzero (tree);
125 static rtx expand_builtin_strlen (tree, rtx, enum machine_mode);
126 static rtx expand_builtin_strstr (tree, rtx, enum machine_mode);
127 static rtx expand_builtin_strpbrk (tree, rtx, enum machine_mode);
128 static rtx expand_builtin_strchr (tree, rtx, enum machine_mode);
129 static rtx expand_builtin_strrchr (tree, rtx, enum machine_mode);
130 static rtx expand_builtin_alloca (tree, rtx);
131 static rtx expand_builtin_unop (enum machine_mode, tree, rtx, rtx, optab);
132 static rtx expand_builtin_frame_address (tree, tree);
133 static rtx expand_builtin_fputs (tree, rtx, bool);
134 static rtx expand_builtin_printf (tree, rtx, enum machine_mode, bool);
135 static rtx expand_builtin_fprintf (tree, rtx, enum machine_mode, bool);
136 static rtx expand_builtin_sprintf (tree, rtx, enum machine_mode);
137 static tree stabilize_va_list (tree, int);
138 static rtx expand_builtin_expect (tree, rtx);
139 static tree fold_builtin_constant_p (tree);
140 static tree fold_builtin_classify_type (tree);
141 static tree fold_builtin_inf (tree, int);
142 static tree fold_builtin_nan (tree, tree, int);
143 static int validate_arglist (tree, ...);
144 static bool integer_valued_real_p (tree);
145 static tree fold_trunc_transparent_mathfn (tree);
146 static bool readonly_data_expr (tree);
147 static rtx expand_builtin_fabs (tree, rtx, rtx);
148 static rtx expand_builtin_signbit (tree, rtx);
149 static tree fold_builtin_cabs (tree, tree);
150 static tree fold_builtin_trunc (tree);
151 static tree fold_builtin_floor (tree);
152 static tree fold_builtin_ceil (tree);
153 static tree fold_builtin_round (tree);
154 static tree fold_builtin_bitop (tree);
155 static tree fold_builtin_memcpy (tree);
156 static tree fold_builtin_mempcpy (tree);
157 static tree fold_builtin_memmove (tree);
158 static tree fold_builtin_strchr (tree, bool);
159 static tree fold_builtin_memcmp (tree);
160 static tree fold_builtin_strcmp (tree);
161 static tree fold_builtin_strncmp (tree);
162 static tree fold_builtin_signbit (tree);
163 static tree fold_builtin_copysign (tree, tree);
164 static tree fold_builtin_isascii (tree);
165 static tree fold_builtin_toascii (tree);
166 static tree fold_builtin_isdigit (tree);
167 static tree fold_builtin_fabs (tree, tree);
168 static tree fold_builtin_abs (tree, tree);
169 static tree fold_builtin_unordered_cmp (tree, enum tree_code, enum tree_code);
170 static tree fold_builtin_1 (tree, bool);
172 static tree simplify_builtin_strpbrk (tree);
173 static tree simplify_builtin_strstr (tree);
174 static tree simplify_builtin_strchr (tree);
175 static tree simplify_builtin_strrchr (tree);
176 static tree simplify_builtin_strcat (tree);
177 static tree simplify_builtin_strncat (tree);
178 static tree simplify_builtin_strspn (tree);
179 static tree simplify_builtin_strcspn (tree);
180 static void simplify_builtin_next_arg (tree);
181 static void simplify_builtin_va_start (tree);
182 static tree simplify_builtin_sprintf (tree, int);
185 /* Return the alignment in bits of EXP, a pointer valued expression.
186 But don't return more than MAX_ALIGN no matter what.
187 The alignment returned is, by default, the alignment of the thing that
188 EXP points to. If it is not a POINTER_TYPE, 0 is returned.
190 Otherwise, look at the expression to see if we can do better, i.e., if the
191 expression is actually pointing at an object whose alignment is tighter. */
194 get_pointer_alignment (tree exp, unsigned int max_align)
196 unsigned int align, inner;
198 if (TREE_CODE (TREE_TYPE (exp)) != POINTER_TYPE)
201 align = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (exp)));
202 align = MIN (align, max_align);
206 switch (TREE_CODE (exp))
210 case NON_LVALUE_EXPR:
211 exp = TREE_OPERAND (exp, 0);
212 if (TREE_CODE (TREE_TYPE (exp)) != POINTER_TYPE)
215 inner = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (exp)));
216 align = MIN (inner, max_align);
220 /* If sum of pointer + int, restrict our maximum alignment to that
221 imposed by the integer. If not, we can't do any better than
223 if (! host_integerp (TREE_OPERAND (exp, 1), 1))
226 while (((tree_low_cst (TREE_OPERAND (exp, 1), 1))
227 & (max_align / BITS_PER_UNIT - 1))
231 exp = TREE_OPERAND (exp, 0);
235 /* See what we are pointing at and look at its alignment. */
236 exp = TREE_OPERAND (exp, 0);
237 if (TREE_CODE (exp) == FUNCTION_DECL)
238 align = FUNCTION_BOUNDARY;
239 else if (DECL_P (exp))
240 align = DECL_ALIGN (exp);
241 #ifdef CONSTANT_ALIGNMENT
242 else if (TREE_CODE_CLASS (TREE_CODE (exp)) == 'c')
243 align = CONSTANT_ALIGNMENT (exp, align);
245 return MIN (align, max_align);
253 /* Compute the length of a C string. TREE_STRING_LENGTH is not the right
254 way, because it could contain a zero byte in the middle.
255 TREE_STRING_LENGTH is the size of the character array, not the string.
257 ONLY_VALUE should be nonzero if the result is not going to be emitted
258 into the instruction stream and zero if it is going to be expanded.
259 E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3
260 is returned, otherwise NULL, since
261 len = c_strlen (src, 1); if (len) expand_expr (len, ...); would not
262 evaluate the side-effects.
264 The value returned is of type `ssizetype'.
266 Unfortunately, string_constant can't access the values of const char
267 arrays with initializers, so neither can we do so here. */
270 c_strlen (tree src, int only_value)
273 HOST_WIDE_INT offset;
278 if (TREE_CODE (src) == COND_EXPR
279 && (only_value || !TREE_SIDE_EFFECTS (TREE_OPERAND (src, 0))))
283 len1 = c_strlen (TREE_OPERAND (src, 1), only_value);
284 len2 = c_strlen (TREE_OPERAND (src, 2), only_value);
285 if (tree_int_cst_equal (len1, len2))
289 if (TREE_CODE (src) == COMPOUND_EXPR
290 && (only_value || !TREE_SIDE_EFFECTS (TREE_OPERAND (src, 0))))
291 return c_strlen (TREE_OPERAND (src, 1), only_value);
293 src = string_constant (src, &offset_node);
297 max = TREE_STRING_LENGTH (src) - 1;
298 ptr = TREE_STRING_POINTER (src);
300 if (offset_node && TREE_CODE (offset_node) != INTEGER_CST)
302 /* If the string has an internal zero byte (e.g., "foo\0bar"), we can't
303 compute the offset to the following null if we don't know where to
304 start searching for it. */
307 for (i = 0; i < max; i++)
311 /* We don't know the starting offset, but we do know that the string
312 has no internal zero bytes. We can assume that the offset falls
313 within the bounds of the string; otherwise, the programmer deserves
314 what he gets. Subtract the offset from the length of the string,
315 and return that. This would perhaps not be valid if we were dealing
316 with named arrays in addition to literal string constants. */
318 return size_diffop (size_int (max), offset_node);
321 /* We have a known offset into the string. Start searching there for
322 a null character if we can represent it as a single HOST_WIDE_INT. */
323 if (offset_node == 0)
325 else if (! host_integerp (offset_node, 0))
328 offset = tree_low_cst (offset_node, 0);
330 /* If the offset is known to be out of bounds, warn, and call strlen at
332 if (offset < 0 || offset > max)
334 warning ("offset outside bounds of constant string");
338 /* Use strlen to search for the first zero byte. Since any strings
339 constructed with build_string will have nulls appended, we win even
340 if we get handed something like (char[4])"abcd".
342 Since OFFSET is our starting index into the string, no further
343 calculation is needed. */
344 return ssize_int (strlen (ptr + offset));
347 /* Return a char pointer for a C string if it is a string constant
348 or sum of string constant and integer constant. */
355 src = string_constant (src, &offset_node);
359 if (offset_node == 0)
360 return TREE_STRING_POINTER (src);
361 else if (!host_integerp (offset_node, 1)
362 || compare_tree_int (offset_node, TREE_STRING_LENGTH (src) - 1) > 0)
365 return TREE_STRING_POINTER (src) + tree_low_cst (offset_node, 1);
368 /* Return a CONST_INT or CONST_DOUBLE corresponding to target reading
369 GET_MODE_BITSIZE (MODE) bits from string constant STR. */
372 c_readstr (const char *str, enum machine_mode mode)
378 gcc_assert (GET_MODE_CLASS (mode) == MODE_INT);
383 for (i = 0; i < GET_MODE_SIZE (mode); i++)
386 if (WORDS_BIG_ENDIAN)
387 j = GET_MODE_SIZE (mode) - i - 1;
388 if (BYTES_BIG_ENDIAN != WORDS_BIG_ENDIAN
389 && GET_MODE_SIZE (mode) > UNITS_PER_WORD)
390 j = j + UNITS_PER_WORD - 2 * (j % UNITS_PER_WORD) - 1;
392 gcc_assert (j <= 2 * HOST_BITS_PER_WIDE_INT);
395 ch = (unsigned char) str[i];
396 c[j / HOST_BITS_PER_WIDE_INT] |= ch << (j % HOST_BITS_PER_WIDE_INT);
398 return immed_double_const (c[0], c[1], mode);
401 /* Cast a target constant CST to target CHAR and if that value fits into
402 host char type, return zero and put that value into variable pointed by
406 target_char_cast (tree cst, char *p)
408 unsigned HOST_WIDE_INT val, hostval;
410 if (!host_integerp (cst, 1)
411 || CHAR_TYPE_SIZE > HOST_BITS_PER_WIDE_INT)
414 val = tree_low_cst (cst, 1);
415 if (CHAR_TYPE_SIZE < HOST_BITS_PER_WIDE_INT)
416 val &= (((unsigned HOST_WIDE_INT) 1) << CHAR_TYPE_SIZE) - 1;
419 if (HOST_BITS_PER_CHAR < HOST_BITS_PER_WIDE_INT)
420 hostval &= (((unsigned HOST_WIDE_INT) 1) << HOST_BITS_PER_CHAR) - 1;
429 /* Similar to save_expr, but assumes that arbitrary code is not executed
430 in between the multiple evaluations. In particular, we assume that a
431 non-addressable local variable will not be modified. */
434 builtin_save_expr (tree exp)
436 if (TREE_ADDRESSABLE (exp) == 0
437 && (TREE_CODE (exp) == PARM_DECL
438 || (TREE_CODE (exp) == VAR_DECL && !TREE_STATIC (exp))))
441 return save_expr (exp);
444 /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT
445 times to get the address of either a higher stack frame, or a return
446 address located within it (depending on FNDECL_CODE). */
449 expand_builtin_return_addr (enum built_in_function fndecl_code, int count,
454 /* Some machines need special handling before we can access
455 arbitrary frames. For example, on the sparc, we must first flush
456 all register windows to the stack. */
457 #ifdef SETUP_FRAME_ADDRESSES
459 SETUP_FRAME_ADDRESSES ();
462 /* On the sparc, the return address is not in the frame, it is in a
463 register. There is no way to access it off of the current frame
464 pointer, but it can be accessed off the previous frame pointer by
465 reading the value from the register window save area. */
466 #ifdef RETURN_ADDR_IN_PREVIOUS_FRAME
467 if (fndecl_code == BUILT_IN_RETURN_ADDRESS)
471 /* Scan back COUNT frames to the specified frame. */
472 for (i = 0; i < count; i++)
474 /* Assume the dynamic chain pointer is in the word that the
475 frame address points to, unless otherwise specified. */
476 #ifdef DYNAMIC_CHAIN_ADDRESS
477 tem = DYNAMIC_CHAIN_ADDRESS (tem);
479 tem = memory_address (Pmode, tem);
480 tem = gen_rtx_MEM (Pmode, tem);
481 set_mem_alias_set (tem, get_frame_alias_set ());
482 tem = copy_to_reg (tem);
485 /* For __builtin_frame_address, return what we've got. */
486 if (fndecl_code == BUILT_IN_FRAME_ADDRESS)
489 /* For __builtin_return_address, Get the return address from that
491 #ifdef RETURN_ADDR_RTX
492 tem = RETURN_ADDR_RTX (count, tem);
494 tem = memory_address (Pmode,
495 plus_constant (tem, GET_MODE_SIZE (Pmode)));
496 tem = gen_rtx_MEM (Pmode, tem);
497 set_mem_alias_set (tem, get_frame_alias_set ());
502 /* Alias set used for setjmp buffer. */
503 static HOST_WIDE_INT setjmp_alias_set = -1;
505 /* Construct the leading half of a __builtin_setjmp call. Control will
506 return to RECEIVER_LABEL. This is used directly by sjlj exception
510 expand_builtin_setjmp_setup (rtx buf_addr, rtx receiver_label)
512 enum machine_mode sa_mode = STACK_SAVEAREA_MODE (SAVE_NONLOCAL);
516 if (setjmp_alias_set == -1)
517 setjmp_alias_set = new_alias_set ();
519 buf_addr = convert_memory_address (Pmode, buf_addr);
521 buf_addr = force_reg (Pmode, force_operand (buf_addr, NULL_RTX));
523 /* We store the frame pointer and the address of receiver_label in
524 the buffer and use the rest of it for the stack save area, which
525 is machine-dependent. */
527 mem = gen_rtx_MEM (Pmode, buf_addr);
528 set_mem_alias_set (mem, setjmp_alias_set);
529 emit_move_insn (mem, targetm.builtin_setjmp_frame_value ());
531 mem = gen_rtx_MEM (Pmode, plus_constant (buf_addr, GET_MODE_SIZE (Pmode))),
532 set_mem_alias_set (mem, setjmp_alias_set);
534 emit_move_insn (validize_mem (mem),
535 force_reg (Pmode, gen_rtx_LABEL_REF (Pmode, receiver_label)));
537 stack_save = gen_rtx_MEM (sa_mode,
538 plus_constant (buf_addr,
539 2 * GET_MODE_SIZE (Pmode)));
540 set_mem_alias_set (stack_save, setjmp_alias_set);
541 emit_stack_save (SAVE_NONLOCAL, &stack_save, NULL_RTX);
543 /* If there is further processing to do, do it. */
544 #ifdef HAVE_builtin_setjmp_setup
545 if (HAVE_builtin_setjmp_setup)
546 emit_insn (gen_builtin_setjmp_setup (buf_addr));
549 /* Tell optimize_save_area_alloca that extra work is going to
550 need to go on during alloca. */
551 current_function_calls_setjmp = 1;
553 /* Set this so all the registers get saved in our frame; we need to be
554 able to copy the saved values for any registers from frames we unwind. */
555 current_function_has_nonlocal_label = 1;
558 /* Construct the trailing part of a __builtin_setjmp call.
559 This is used directly by sjlj exception handling code. */
562 expand_builtin_setjmp_receiver (rtx receiver_label ATTRIBUTE_UNUSED)
564 /* Clobber the FP when we get here, so we have to make sure it's
565 marked as used by this function. */
566 emit_insn (gen_rtx_USE (VOIDmode, hard_frame_pointer_rtx));
568 /* Mark the static chain as clobbered here so life information
569 doesn't get messed up for it. */
570 emit_insn (gen_rtx_CLOBBER (VOIDmode, static_chain_rtx));
572 /* Now put in the code to restore the frame pointer, and argument
573 pointer, if needed. */
574 #ifdef HAVE_nonlocal_goto
575 if (! HAVE_nonlocal_goto)
577 emit_move_insn (virtual_stack_vars_rtx, hard_frame_pointer_rtx);
579 #if ARG_POINTER_REGNUM != HARD_FRAME_POINTER_REGNUM
580 if (fixed_regs[ARG_POINTER_REGNUM])
582 #ifdef ELIMINABLE_REGS
584 static const struct elims {const int from, to;} elim_regs[] = ELIMINABLE_REGS;
586 for (i = 0; i < ARRAY_SIZE (elim_regs); i++)
587 if (elim_regs[i].from == ARG_POINTER_REGNUM
588 && elim_regs[i].to == HARD_FRAME_POINTER_REGNUM)
591 if (i == ARRAY_SIZE (elim_regs))
594 /* Now restore our arg pointer from the address at which it
595 was saved in our stack frame. */
596 emit_move_insn (virtual_incoming_args_rtx,
597 copy_to_reg (get_arg_pointer_save_area (cfun)));
602 #ifdef HAVE_builtin_setjmp_receiver
603 if (HAVE_builtin_setjmp_receiver)
604 emit_insn (gen_builtin_setjmp_receiver (receiver_label));
607 #ifdef HAVE_nonlocal_goto_receiver
608 if (HAVE_nonlocal_goto_receiver)
609 emit_insn (gen_nonlocal_goto_receiver ());
614 /* @@@ This is a kludge. Not all machine descriptions define a blockage
615 insn, but we must not allow the code we just generated to be reordered
616 by scheduling. Specifically, the update of the frame pointer must
617 happen immediately, not later. So emit an ASM_INPUT to act as blockage
619 emit_insn (gen_rtx_ASM_INPUT (VOIDmode, ""));
622 /* __builtin_setjmp is passed a pointer to an array of five words (not
623 all will be used on all machines). It operates similarly to the C
624 library function of the same name, but is more efficient. Much of
625 the code below (and for longjmp) is copied from the handling of
628 NOTE: This is intended for use by GNAT and the exception handling
629 scheme in the compiler and will only work in the method used by
633 expand_builtin_setjmp (tree arglist, rtx target)
635 rtx buf_addr, next_lab, cont_lab;
637 if (!validate_arglist (arglist, POINTER_TYPE, VOID_TYPE))
640 if (target == 0 || !REG_P (target)
641 || REGNO (target) < FIRST_PSEUDO_REGISTER)
642 target = gen_reg_rtx (TYPE_MODE (integer_type_node));
644 buf_addr = expand_expr (TREE_VALUE (arglist), NULL_RTX, VOIDmode, 0);
646 next_lab = gen_label_rtx ();
647 cont_lab = gen_label_rtx ();
649 expand_builtin_setjmp_setup (buf_addr, next_lab);
651 /* Set TARGET to zero and branch to the continue label. Use emit_jump to
652 ensure that pending stack adjustments are flushed. */
653 emit_move_insn (target, const0_rtx);
654 emit_jump (cont_lab);
656 emit_label (next_lab);
658 expand_builtin_setjmp_receiver (next_lab);
660 /* Set TARGET to one. */
661 emit_move_insn (target, const1_rtx);
662 emit_label (cont_lab);
664 /* Tell flow about the strange goings on. Putting `next_lab' on
665 `nonlocal_goto_handler_labels' to indicates that function
666 calls may traverse the arc back to this label. */
668 current_function_has_nonlocal_label = 1;
669 nonlocal_goto_handler_labels
670 = gen_rtx_EXPR_LIST (VOIDmode, next_lab, nonlocal_goto_handler_labels);
675 /* __builtin_longjmp is passed a pointer to an array of five words (not
676 all will be used on all machines). It operates similarly to the C
677 library function of the same name, but is more efficient. Much of
678 the code below is copied from the handling of non-local gotos.
680 NOTE: This is intended for use by GNAT and the exception handling
681 scheme in the compiler and will only work in the method used by
685 expand_builtin_longjmp (rtx buf_addr, rtx value)
687 rtx fp, lab, stack, insn, last;
688 enum machine_mode sa_mode = STACK_SAVEAREA_MODE (SAVE_NONLOCAL);
690 if (setjmp_alias_set == -1)
691 setjmp_alias_set = new_alias_set ();
693 buf_addr = convert_memory_address (Pmode, buf_addr);
695 buf_addr = force_reg (Pmode, buf_addr);
697 /* We used to store value in static_chain_rtx, but that fails if pointers
698 are smaller than integers. We instead require that the user must pass
699 a second argument of 1, because that is what builtin_setjmp will
700 return. This also makes EH slightly more efficient, since we are no
701 longer copying around a value that we don't care about. */
702 gcc_assert (value == const1_rtx);
704 current_function_calls_longjmp = 1;
706 last = get_last_insn ();
707 #ifdef HAVE_builtin_longjmp
708 if (HAVE_builtin_longjmp)
709 emit_insn (gen_builtin_longjmp (buf_addr));
713 fp = gen_rtx_MEM (Pmode, buf_addr);
714 lab = gen_rtx_MEM (Pmode, plus_constant (buf_addr,
715 GET_MODE_SIZE (Pmode)));
717 stack = gen_rtx_MEM (sa_mode, plus_constant (buf_addr,
718 2 * GET_MODE_SIZE (Pmode)));
719 set_mem_alias_set (fp, setjmp_alias_set);
720 set_mem_alias_set (lab, setjmp_alias_set);
721 set_mem_alias_set (stack, setjmp_alias_set);
723 /* Pick up FP, label, and SP from the block and jump. This code is
724 from expand_goto in stmt.c; see there for detailed comments. */
725 #if HAVE_nonlocal_goto
726 if (HAVE_nonlocal_goto)
727 /* We have to pass a value to the nonlocal_goto pattern that will
728 get copied into the static_chain pointer, but it does not matter
729 what that value is, because builtin_setjmp does not use it. */
730 emit_insn (gen_nonlocal_goto (value, lab, stack, fp));
734 lab = copy_to_reg (lab);
736 emit_insn (gen_rtx_CLOBBER (VOIDmode,
737 gen_rtx_MEM (BLKmode,
738 gen_rtx_SCRATCH (VOIDmode))));
739 emit_insn (gen_rtx_CLOBBER (VOIDmode,
740 gen_rtx_MEM (BLKmode,
741 hard_frame_pointer_rtx)));
743 emit_move_insn (hard_frame_pointer_rtx, fp);
744 emit_stack_restore (SAVE_NONLOCAL, stack, NULL_RTX);
746 emit_insn (gen_rtx_USE (VOIDmode, hard_frame_pointer_rtx));
747 emit_insn (gen_rtx_USE (VOIDmode, stack_pointer_rtx));
748 emit_indirect_jump (lab);
752 /* Search backwards and mark the jump insn as a non-local goto.
753 Note that this precludes the use of __builtin_longjmp to a
754 __builtin_setjmp target in the same function. However, we've
755 already cautioned the user that these functions are for
756 internal exception handling use only. */
757 for (insn = get_last_insn (); insn; insn = PREV_INSN (insn))
759 gcc_assert (insn != last);
763 REG_NOTES (insn) = alloc_EXPR_LIST (REG_NON_LOCAL_GOTO, const0_rtx,
767 else if (CALL_P (insn))
772 /* Expand a call to __builtin_nonlocal_goto. We're passed the target label
773 and the address of the save area. */
776 expand_builtin_nonlocal_goto (tree arglist)
778 tree t_label, t_save_area;
779 rtx r_label, r_save_area, r_fp, r_sp, insn;
781 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
784 t_label = TREE_VALUE (arglist);
785 arglist = TREE_CHAIN (arglist);
786 t_save_area = TREE_VALUE (arglist);
788 r_label = expand_expr (t_label, NULL_RTX, VOIDmode, 0);
789 r_label = convert_memory_address (Pmode, r_label);
790 r_save_area = expand_expr (t_save_area, NULL_RTX, VOIDmode, 0);
791 r_save_area = convert_memory_address (Pmode, r_save_area);
792 r_fp = gen_rtx_MEM (Pmode, r_save_area);
793 r_sp = gen_rtx_MEM (STACK_SAVEAREA_MODE (SAVE_NONLOCAL),
794 plus_constant (r_save_area, GET_MODE_SIZE (Pmode)));
796 current_function_has_nonlocal_goto = 1;
798 #if HAVE_nonlocal_goto
799 /* ??? We no longer need to pass the static chain value, afaik. */
800 if (HAVE_nonlocal_goto)
801 emit_insn (gen_nonlocal_goto (const0_rtx, r_label, r_sp, r_fp));
805 r_label = copy_to_reg (r_label);
807 emit_insn (gen_rtx_CLOBBER (VOIDmode,
808 gen_rtx_MEM (BLKmode,
809 gen_rtx_SCRATCH (VOIDmode))));
811 emit_insn (gen_rtx_CLOBBER (VOIDmode,
812 gen_rtx_MEM (BLKmode,
813 hard_frame_pointer_rtx)));
815 /* Restore frame pointer for containing function.
816 This sets the actual hard register used for the frame pointer
817 to the location of the function's incoming static chain info.
818 The non-local goto handler will then adjust it to contain the
819 proper value and reload the argument pointer, if needed. */
820 emit_move_insn (hard_frame_pointer_rtx, r_fp);
821 emit_stack_restore (SAVE_NONLOCAL, r_sp, NULL_RTX);
823 /* USE of hard_frame_pointer_rtx added for consistency;
824 not clear if really needed. */
825 emit_insn (gen_rtx_USE (VOIDmode, hard_frame_pointer_rtx));
826 emit_insn (gen_rtx_USE (VOIDmode, stack_pointer_rtx));
827 emit_indirect_jump (r_label);
830 /* Search backwards to the jump insn and mark it as a
832 for (insn = get_last_insn (); insn; insn = PREV_INSN (insn))
836 REG_NOTES (insn) = alloc_EXPR_LIST (REG_NON_LOCAL_GOTO,
837 const0_rtx, REG_NOTES (insn));
840 else if (CALL_P (insn))
847 /* __builtin_update_setjmp_buf is passed a pointer to an array of five words
848 (not all will be used on all machines) that was passed to __builtin_setjmp.
849 It updates the stack pointer in that block to correspond to the current
853 expand_builtin_update_setjmp_buf (rtx buf_addr)
855 enum machine_mode sa_mode = Pmode;
859 #ifdef HAVE_save_stack_nonlocal
860 if (HAVE_save_stack_nonlocal)
861 sa_mode = insn_data[(int) CODE_FOR_save_stack_nonlocal].operand[0].mode;
863 #ifdef STACK_SAVEAREA_MODE
864 sa_mode = STACK_SAVEAREA_MODE (SAVE_NONLOCAL);
868 = gen_rtx_MEM (sa_mode,
871 plus_constant (buf_addr, 2 * GET_MODE_SIZE (Pmode))));
875 emit_insn (gen_setjmp ());
878 emit_stack_save (SAVE_NONLOCAL, &stack_save, NULL_RTX);
881 /* Expand a call to __builtin_prefetch. For a target that does not support
882 data prefetch, evaluate the memory address argument in case it has side
886 expand_builtin_prefetch (tree arglist)
888 tree arg0, arg1, arg2;
891 if (!validate_arglist (arglist, POINTER_TYPE, 0))
894 arg0 = TREE_VALUE (arglist);
895 /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
896 zero (read) and argument 2 (locality) defaults to 3 (high degree of
898 if (TREE_CHAIN (arglist))
900 arg1 = TREE_VALUE (TREE_CHAIN (arglist));
901 if (TREE_CHAIN (TREE_CHAIN (arglist)))
902 arg2 = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
904 arg2 = build_int_cst (NULL_TREE, 3);
908 arg1 = integer_zero_node;
909 arg2 = build_int_cst (NULL_TREE, 3);
912 /* Argument 0 is an address. */
913 op0 = expand_expr (arg0, NULL_RTX, Pmode, EXPAND_NORMAL);
915 /* Argument 1 (read/write flag) must be a compile-time constant int. */
916 if (TREE_CODE (arg1) != INTEGER_CST)
918 error ("second arg to `__builtin_prefetch' must be a constant");
919 arg1 = integer_zero_node;
921 op1 = expand_expr (arg1, NULL_RTX, VOIDmode, 0);
922 /* Argument 1 must be either zero or one. */
923 if (INTVAL (op1) != 0 && INTVAL (op1) != 1)
925 warning ("invalid second arg to __builtin_prefetch; using zero");
929 /* Argument 2 (locality) must be a compile-time constant int. */
930 if (TREE_CODE (arg2) != INTEGER_CST)
932 error ("third arg to `__builtin_prefetch' must be a constant");
933 arg2 = integer_zero_node;
935 op2 = expand_expr (arg2, NULL_RTX, VOIDmode, 0);
936 /* Argument 2 must be 0, 1, 2, or 3. */
937 if (INTVAL (op2) < 0 || INTVAL (op2) > 3)
939 warning ("invalid third arg to __builtin_prefetch; using zero");
946 if ((! (*insn_data[(int) CODE_FOR_prefetch].operand[0].predicate)
948 insn_data[(int) CODE_FOR_prefetch].operand[0].mode))
949 || (GET_MODE (op0) != Pmode))
951 op0 = convert_memory_address (Pmode, op0);
952 op0 = force_reg (Pmode, op0);
954 emit_insn (gen_prefetch (op0, op1, op2));
958 /* Don't do anything with direct references to volatile memory, but
959 generate code to handle other side effects. */
960 if (!MEM_P (op0) && side_effects_p (op0))
964 /* Get a MEM rtx for expression EXP which is the address of an operand
965 to be used to be used in a string instruction (cmpstrsi, movmemsi, ..). */
968 get_memory_rtx (tree exp)
970 rtx addr = expand_expr (exp, NULL_RTX, ptr_mode, EXPAND_SUM);
973 addr = convert_memory_address (Pmode, addr);
975 mem = gen_rtx_MEM (BLKmode, memory_address (BLKmode, addr));
977 /* Get an expression we can use to find the attributes to assign to MEM.
978 If it is an ADDR_EXPR, use the operand. Otherwise, dereference it if
979 we can. First remove any nops. */
980 while ((TREE_CODE (exp) == NOP_EXPR || TREE_CODE (exp) == CONVERT_EXPR
981 || TREE_CODE (exp) == NON_LVALUE_EXPR)
982 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (exp, 0))))
983 exp = TREE_OPERAND (exp, 0);
985 if (TREE_CODE (exp) == ADDR_EXPR)
987 exp = TREE_OPERAND (exp, 0);
988 set_mem_attributes (mem, exp, 0);
990 else if (POINTER_TYPE_P (TREE_TYPE (exp)))
992 exp = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (exp)), exp);
993 /* memcpy, memset and other builtin stringops can alias with anything. */
994 set_mem_alias_set (mem, 0);
1000 /* Built-in functions to perform an untyped call and return. */
1002 /* For each register that may be used for calling a function, this
1003 gives a mode used to copy the register's value. VOIDmode indicates
1004 the register is not used for calling a function. If the machine
1005 has register windows, this gives only the outbound registers.
1006 INCOMING_REGNO gives the corresponding inbound register. */
1007 static enum machine_mode apply_args_mode[FIRST_PSEUDO_REGISTER];
1009 /* For each register that may be used for returning values, this gives
1010 a mode used to copy the register's value. VOIDmode indicates the
1011 register is not used for returning values. If the machine has
1012 register windows, this gives only the outbound registers.
1013 INCOMING_REGNO gives the corresponding inbound register. */
1014 static enum machine_mode apply_result_mode[FIRST_PSEUDO_REGISTER];
1016 /* For each register that may be used for calling a function, this
1017 gives the offset of that register into the block returned by
1018 __builtin_apply_args. 0 indicates that the register is not
1019 used for calling a function. */
1020 static int apply_args_reg_offset[FIRST_PSEUDO_REGISTER];
1022 /* Return the size required for the block returned by __builtin_apply_args,
1023 and initialize apply_args_mode. */
1026 apply_args_size (void)
1028 static int size = -1;
1031 enum machine_mode mode;
1033 /* The values computed by this function never change. */
1036 /* The first value is the incoming arg-pointer. */
1037 size = GET_MODE_SIZE (Pmode);
1039 /* The second value is the structure value address unless this is
1040 passed as an "invisible" first argument. */
1041 if (targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0))
1042 size += GET_MODE_SIZE (Pmode);
1044 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1045 if (FUNCTION_ARG_REGNO_P (regno))
1047 mode = reg_raw_mode[regno];
1049 gcc_assert (mode != VOIDmode);
1051 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1052 if (size % align != 0)
1053 size = CEIL (size, align) * align;
1054 apply_args_reg_offset[regno] = size;
1055 size += GET_MODE_SIZE (mode);
1056 apply_args_mode[regno] = mode;
1060 apply_args_mode[regno] = VOIDmode;
1061 apply_args_reg_offset[regno] = 0;
1067 /* Return the size required for the block returned by __builtin_apply,
1068 and initialize apply_result_mode. */
1071 apply_result_size (void)
1073 static int size = -1;
1075 enum machine_mode mode;
1077 /* The values computed by this function never change. */
1082 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1083 if (FUNCTION_VALUE_REGNO_P (regno))
1085 mode = reg_raw_mode[regno];
1087 gcc_assert (mode != VOIDmode);
1089 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1090 if (size % align != 0)
1091 size = CEIL (size, align) * align;
1092 size += GET_MODE_SIZE (mode);
1093 apply_result_mode[regno] = mode;
1096 apply_result_mode[regno] = VOIDmode;
1098 /* Allow targets that use untyped_call and untyped_return to override
1099 the size so that machine-specific information can be stored here. */
1100 #ifdef APPLY_RESULT_SIZE
1101 size = APPLY_RESULT_SIZE;
1107 #if defined (HAVE_untyped_call) || defined (HAVE_untyped_return)
1108 /* Create a vector describing the result block RESULT. If SAVEP is true,
1109 the result block is used to save the values; otherwise it is used to
1110 restore the values. */
1113 result_vector (int savep, rtx result)
1115 int regno, size, align, nelts;
1116 enum machine_mode mode;
1118 rtx *savevec = alloca (FIRST_PSEUDO_REGISTER * sizeof (rtx));
1121 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1122 if ((mode = apply_result_mode[regno]) != VOIDmode)
1124 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1125 if (size % align != 0)
1126 size = CEIL (size, align) * align;
1127 reg = gen_rtx_REG (mode, savep ? regno : INCOMING_REGNO (regno));
1128 mem = adjust_address (result, mode, size);
1129 savevec[nelts++] = (savep
1130 ? gen_rtx_SET (VOIDmode, mem, reg)
1131 : gen_rtx_SET (VOIDmode, reg, mem));
1132 size += GET_MODE_SIZE (mode);
1134 return gen_rtx_PARALLEL (VOIDmode, gen_rtvec_v (nelts, savevec));
1136 #endif /* HAVE_untyped_call or HAVE_untyped_return */
1138 /* Save the state required to perform an untyped call with the same
1139 arguments as were passed to the current function. */
1142 expand_builtin_apply_args_1 (void)
1145 int size, align, regno;
1146 enum machine_mode mode;
1147 rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1149 /* Create a block where the arg-pointer, structure value address,
1150 and argument registers can be saved. */
1151 registers = assign_stack_local (BLKmode, apply_args_size (), -1);
1153 /* Walk past the arg-pointer and structure value address. */
1154 size = GET_MODE_SIZE (Pmode);
1155 if (targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0))
1156 size += GET_MODE_SIZE (Pmode);
1158 /* Save each register used in calling a function to the block. */
1159 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1160 if ((mode = apply_args_mode[regno]) != VOIDmode)
1162 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1163 if (size % align != 0)
1164 size = CEIL (size, align) * align;
1166 tem = gen_rtx_REG (mode, INCOMING_REGNO (regno));
1168 emit_move_insn (adjust_address (registers, mode, size), tem);
1169 size += GET_MODE_SIZE (mode);
1172 /* Save the arg pointer to the block. */
1173 tem = copy_to_reg (virtual_incoming_args_rtx);
1174 #ifdef STACK_GROWS_DOWNWARD
1175 /* We need the pointer as the caller actually passed them to us, not
1176 as we might have pretended they were passed. Make sure it's a valid
1177 operand, as emit_move_insn isn't expected to handle a PLUS. */
1179 = force_operand (plus_constant (tem, current_function_pretend_args_size),
1182 emit_move_insn (adjust_address (registers, Pmode, 0), tem);
1184 size = GET_MODE_SIZE (Pmode);
1186 /* Save the structure value address unless this is passed as an
1187 "invisible" first argument. */
1188 if (struct_incoming_value)
1190 emit_move_insn (adjust_address (registers, Pmode, size),
1191 copy_to_reg (struct_incoming_value));
1192 size += GET_MODE_SIZE (Pmode);
1195 /* Return the address of the block. */
1196 return copy_addr_to_reg (XEXP (registers, 0));
1199 /* __builtin_apply_args returns block of memory allocated on
1200 the stack into which is stored the arg pointer, structure
1201 value address, static chain, and all the registers that might
1202 possibly be used in performing a function call. The code is
1203 moved to the start of the function so the incoming values are
1207 expand_builtin_apply_args (void)
1209 /* Don't do __builtin_apply_args more than once in a function.
1210 Save the result of the first call and reuse it. */
1211 if (apply_args_value != 0)
1212 return apply_args_value;
1214 /* When this function is called, it means that registers must be
1215 saved on entry to this function. So we migrate the
1216 call to the first insn of this function. */
1221 temp = expand_builtin_apply_args_1 ();
1225 apply_args_value = temp;
1227 /* Put the insns after the NOTE that starts the function.
1228 If this is inside a start_sequence, make the outer-level insn
1229 chain current, so the code is placed at the start of the
1231 push_topmost_sequence ();
1232 emit_insn_before (seq, NEXT_INSN (entry_of_function ()));
1233 pop_topmost_sequence ();
1238 /* Perform an untyped call and save the state required to perform an
1239 untyped return of whatever value was returned by the given function. */
1242 expand_builtin_apply (rtx function, rtx arguments, rtx argsize)
1244 int size, align, regno;
1245 enum machine_mode mode;
1246 rtx incoming_args, result, reg, dest, src, call_insn;
1247 rtx old_stack_level = 0;
1248 rtx call_fusage = 0;
1249 rtx struct_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0);
1251 arguments = convert_memory_address (Pmode, arguments);
1253 /* Create a block where the return registers can be saved. */
1254 result = assign_stack_local (BLKmode, apply_result_size (), -1);
1256 /* Fetch the arg pointer from the ARGUMENTS block. */
1257 incoming_args = gen_reg_rtx (Pmode);
1258 emit_move_insn (incoming_args, gen_rtx_MEM (Pmode, arguments));
1259 #ifndef STACK_GROWS_DOWNWARD
1260 incoming_args = expand_simple_binop (Pmode, MINUS, incoming_args, argsize,
1261 incoming_args, 0, OPTAB_LIB_WIDEN);
1264 /* Push a new argument block and copy the arguments. Do not allow
1265 the (potential) memcpy call below to interfere with our stack
1267 do_pending_stack_adjust ();
1270 /* Save the stack with nonlocal if available. */
1271 #ifdef HAVE_save_stack_nonlocal
1272 if (HAVE_save_stack_nonlocal)
1273 emit_stack_save (SAVE_NONLOCAL, &old_stack_level, NULL_RTX);
1276 emit_stack_save (SAVE_BLOCK, &old_stack_level, NULL_RTX);
1278 /* Allocate a block of memory onto the stack and copy the memory
1279 arguments to the outgoing arguments address. */
1280 allocate_dynamic_stack_space (argsize, 0, BITS_PER_UNIT);
1281 dest = virtual_outgoing_args_rtx;
1282 #ifndef STACK_GROWS_DOWNWARD
1283 if (GET_CODE (argsize) == CONST_INT)
1284 dest = plus_constant (dest, -INTVAL (argsize));
1286 dest = gen_rtx_PLUS (Pmode, dest, negate_rtx (Pmode, argsize));
1288 dest = gen_rtx_MEM (BLKmode, dest);
1289 set_mem_align (dest, PARM_BOUNDARY);
1290 src = gen_rtx_MEM (BLKmode, incoming_args);
1291 set_mem_align (src, PARM_BOUNDARY);
1292 emit_block_move (dest, src, argsize, BLOCK_OP_NORMAL);
1294 /* Refer to the argument block. */
1296 arguments = gen_rtx_MEM (BLKmode, arguments);
1297 set_mem_align (arguments, PARM_BOUNDARY);
1299 /* Walk past the arg-pointer and structure value address. */
1300 size = GET_MODE_SIZE (Pmode);
1302 size += GET_MODE_SIZE (Pmode);
1304 /* Restore each of the registers previously saved. Make USE insns
1305 for each of these registers for use in making the call. */
1306 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1307 if ((mode = apply_args_mode[regno]) != VOIDmode)
1309 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1310 if (size % align != 0)
1311 size = CEIL (size, align) * align;
1312 reg = gen_rtx_REG (mode, regno);
1313 emit_move_insn (reg, adjust_address (arguments, mode, size));
1314 use_reg (&call_fusage, reg);
1315 size += GET_MODE_SIZE (mode);
1318 /* Restore the structure value address unless this is passed as an
1319 "invisible" first argument. */
1320 size = GET_MODE_SIZE (Pmode);
1323 rtx value = gen_reg_rtx (Pmode);
1324 emit_move_insn (value, adjust_address (arguments, Pmode, size));
1325 emit_move_insn (struct_value, value);
1326 if (REG_P (struct_value))
1327 use_reg (&call_fusage, struct_value);
1328 size += GET_MODE_SIZE (Pmode);
1331 /* All arguments and registers used for the call are set up by now! */
1332 function = prepare_call_address (function, NULL, &call_fusage, 0, 0);
1334 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1335 and we don't want to load it into a register as an optimization,
1336 because prepare_call_address already did it if it should be done. */
1337 if (GET_CODE (function) != SYMBOL_REF)
1338 function = memory_address (FUNCTION_MODE, function);
1340 /* Generate the actual call instruction and save the return value. */
1341 #ifdef HAVE_untyped_call
1342 if (HAVE_untyped_call)
1343 emit_call_insn (gen_untyped_call (gen_rtx_MEM (FUNCTION_MODE, function),
1344 result, result_vector (1, result)));
1347 #ifdef HAVE_call_value
1348 if (HAVE_call_value)
1352 /* Locate the unique return register. It is not possible to
1353 express a call that sets more than one return register using
1354 call_value; use untyped_call for that. In fact, untyped_call
1355 only needs to save the return registers in the given block. */
1356 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1357 if ((mode = apply_result_mode[regno]) != VOIDmode)
1359 gcc_assert (!valreg); /* HAVE_untyped_call required. */
1361 valreg = gen_rtx_REG (mode, regno);
1364 emit_call_insn (GEN_CALL_VALUE (valreg,
1365 gen_rtx_MEM (FUNCTION_MODE, function),
1366 const0_rtx, NULL_RTX, const0_rtx));
1368 emit_move_insn (adjust_address (result, GET_MODE (valreg), 0), valreg);
1374 /* Find the CALL insn we just emitted, and attach the register usage
1376 call_insn = last_call_insn ();
1377 add_function_usage_to (call_insn, call_fusage);
1379 /* Restore the stack. */
1380 #ifdef HAVE_save_stack_nonlocal
1381 if (HAVE_save_stack_nonlocal)
1382 emit_stack_restore (SAVE_NONLOCAL, old_stack_level, NULL_RTX);
1385 emit_stack_restore (SAVE_BLOCK, old_stack_level, NULL_RTX);
1389 /* Return the address of the result block. */
1390 result = copy_addr_to_reg (XEXP (result, 0));
1391 return convert_memory_address (ptr_mode, result);
1394 /* Perform an untyped return. */
1397 expand_builtin_return (rtx result)
1399 int size, align, regno;
1400 enum machine_mode mode;
1402 rtx call_fusage = 0;
1404 result = convert_memory_address (Pmode, result);
1406 apply_result_size ();
1407 result = gen_rtx_MEM (BLKmode, result);
1409 #ifdef HAVE_untyped_return
1410 if (HAVE_untyped_return)
1412 emit_jump_insn (gen_untyped_return (result, result_vector (0, result)));
1418 /* Restore the return value and note that each value is used. */
1420 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1421 if ((mode = apply_result_mode[regno]) != VOIDmode)
1423 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1424 if (size % align != 0)
1425 size = CEIL (size, align) * align;
1426 reg = gen_rtx_REG (mode, INCOMING_REGNO (regno));
1427 emit_move_insn (reg, adjust_address (result, mode, size));
1429 push_to_sequence (call_fusage);
1430 emit_insn (gen_rtx_USE (VOIDmode, reg));
1431 call_fusage = get_insns ();
1433 size += GET_MODE_SIZE (mode);
1436 /* Put the USE insns before the return. */
1437 emit_insn (call_fusage);
1439 /* Return whatever values was restored by jumping directly to the end
1441 expand_naked_return ();
1444 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1446 static enum type_class
1447 type_to_class (tree type)
1449 switch (TREE_CODE (type))
1451 case VOID_TYPE: return void_type_class;
1452 case INTEGER_TYPE: return integer_type_class;
1453 case CHAR_TYPE: return char_type_class;
1454 case ENUMERAL_TYPE: return enumeral_type_class;
1455 case BOOLEAN_TYPE: return boolean_type_class;
1456 case POINTER_TYPE: return pointer_type_class;
1457 case REFERENCE_TYPE: return reference_type_class;
1458 case OFFSET_TYPE: return offset_type_class;
1459 case REAL_TYPE: return real_type_class;
1460 case COMPLEX_TYPE: return complex_type_class;
1461 case FUNCTION_TYPE: return function_type_class;
1462 case METHOD_TYPE: return method_type_class;
1463 case RECORD_TYPE: return record_type_class;
1465 case QUAL_UNION_TYPE: return union_type_class;
1466 case ARRAY_TYPE: return (TYPE_STRING_FLAG (type)
1467 ? string_type_class : array_type_class);
1468 case SET_TYPE: return set_type_class;
1469 case FILE_TYPE: return file_type_class;
1470 case LANG_TYPE: return lang_type_class;
1471 default: return no_type_class;
1475 /* Expand a call to __builtin_classify_type with arguments found in
1479 expand_builtin_classify_type (tree arglist)
1482 return GEN_INT (type_to_class (TREE_TYPE (TREE_VALUE (arglist))));
1483 return GEN_INT (no_type_class);
1486 /* This helper macro, meant to be used in mathfn_built_in below,
1487 determines which among a set of three builtin math functions is
1488 appropriate for a given type mode. The `F' and `L' cases are
1489 automatically generated from the `double' case. */
1490 #define CASE_MATHFN(BUILT_IN_MATHFN) \
1491 case BUILT_IN_MATHFN: case BUILT_IN_MATHFN##F: case BUILT_IN_MATHFN##L: \
1492 fcode = BUILT_IN_MATHFN; fcodef = BUILT_IN_MATHFN##F ; \
1493 fcodel = BUILT_IN_MATHFN##L ; break;
1495 /* Return mathematic function equivalent to FN but operating directly
1496 on TYPE, if available. If we can't do the conversion, return zero. */
1498 mathfn_built_in (tree type, enum built_in_function fn)
1500 enum built_in_function fcode, fcodef, fcodel;
1504 CASE_MATHFN (BUILT_IN_ACOS)
1505 CASE_MATHFN (BUILT_IN_ACOSH)
1506 CASE_MATHFN (BUILT_IN_ASIN)
1507 CASE_MATHFN (BUILT_IN_ASINH)
1508 CASE_MATHFN (BUILT_IN_ATAN)
1509 CASE_MATHFN (BUILT_IN_ATAN2)
1510 CASE_MATHFN (BUILT_IN_ATANH)
1511 CASE_MATHFN (BUILT_IN_CBRT)
1512 CASE_MATHFN (BUILT_IN_CEIL)
1513 CASE_MATHFN (BUILT_IN_COPYSIGN)
1514 CASE_MATHFN (BUILT_IN_COS)
1515 CASE_MATHFN (BUILT_IN_COSH)
1516 CASE_MATHFN (BUILT_IN_DREM)
1517 CASE_MATHFN (BUILT_IN_ERF)
1518 CASE_MATHFN (BUILT_IN_ERFC)
1519 CASE_MATHFN (BUILT_IN_EXP)
1520 CASE_MATHFN (BUILT_IN_EXP10)
1521 CASE_MATHFN (BUILT_IN_EXP2)
1522 CASE_MATHFN (BUILT_IN_EXPM1)
1523 CASE_MATHFN (BUILT_IN_FABS)
1524 CASE_MATHFN (BUILT_IN_FDIM)
1525 CASE_MATHFN (BUILT_IN_FLOOR)
1526 CASE_MATHFN (BUILT_IN_FMA)
1527 CASE_MATHFN (BUILT_IN_FMAX)
1528 CASE_MATHFN (BUILT_IN_FMIN)
1529 CASE_MATHFN (BUILT_IN_FMOD)
1530 CASE_MATHFN (BUILT_IN_FREXP)
1531 CASE_MATHFN (BUILT_IN_GAMMA)
1532 CASE_MATHFN (BUILT_IN_HUGE_VAL)
1533 CASE_MATHFN (BUILT_IN_HYPOT)
1534 CASE_MATHFN (BUILT_IN_ILOGB)
1535 CASE_MATHFN (BUILT_IN_INF)
1536 CASE_MATHFN (BUILT_IN_J0)
1537 CASE_MATHFN (BUILT_IN_J1)
1538 CASE_MATHFN (BUILT_IN_JN)
1539 CASE_MATHFN (BUILT_IN_LDEXP)
1540 CASE_MATHFN (BUILT_IN_LGAMMA)
1541 CASE_MATHFN (BUILT_IN_LLRINT)
1542 CASE_MATHFN (BUILT_IN_LLROUND)
1543 CASE_MATHFN (BUILT_IN_LOG)
1544 CASE_MATHFN (BUILT_IN_LOG10)
1545 CASE_MATHFN (BUILT_IN_LOG1P)
1546 CASE_MATHFN (BUILT_IN_LOG2)
1547 CASE_MATHFN (BUILT_IN_LOGB)
1548 CASE_MATHFN (BUILT_IN_LRINT)
1549 CASE_MATHFN (BUILT_IN_LROUND)
1550 CASE_MATHFN (BUILT_IN_MODF)
1551 CASE_MATHFN (BUILT_IN_NAN)
1552 CASE_MATHFN (BUILT_IN_NANS)
1553 CASE_MATHFN (BUILT_IN_NEARBYINT)
1554 CASE_MATHFN (BUILT_IN_NEXTAFTER)
1555 CASE_MATHFN (BUILT_IN_NEXTTOWARD)
1556 CASE_MATHFN (BUILT_IN_POW)
1557 CASE_MATHFN (BUILT_IN_POW10)
1558 CASE_MATHFN (BUILT_IN_REMAINDER)
1559 CASE_MATHFN (BUILT_IN_REMQUO)
1560 CASE_MATHFN (BUILT_IN_RINT)
1561 CASE_MATHFN (BUILT_IN_ROUND)
1562 CASE_MATHFN (BUILT_IN_SCALB)
1563 CASE_MATHFN (BUILT_IN_SCALBLN)
1564 CASE_MATHFN (BUILT_IN_SCALBN)
1565 CASE_MATHFN (BUILT_IN_SIGNIFICAND)
1566 CASE_MATHFN (BUILT_IN_SIN)
1567 CASE_MATHFN (BUILT_IN_SINCOS)
1568 CASE_MATHFN (BUILT_IN_SINH)
1569 CASE_MATHFN (BUILT_IN_SQRT)
1570 CASE_MATHFN (BUILT_IN_TAN)
1571 CASE_MATHFN (BUILT_IN_TANH)
1572 CASE_MATHFN (BUILT_IN_TGAMMA)
1573 CASE_MATHFN (BUILT_IN_TRUNC)
1574 CASE_MATHFN (BUILT_IN_Y0)
1575 CASE_MATHFN (BUILT_IN_Y1)
1576 CASE_MATHFN (BUILT_IN_YN)
1582 if (TYPE_MAIN_VARIANT (type) == double_type_node)
1583 return implicit_built_in_decls[fcode];
1584 else if (TYPE_MAIN_VARIANT (type) == float_type_node)
1585 return implicit_built_in_decls[fcodef];
1586 else if (TYPE_MAIN_VARIANT (type) == long_double_type_node)
1587 return implicit_built_in_decls[fcodel];
1592 /* If errno must be maintained, expand the RTL to check if the result,
1593 TARGET, of a built-in function call, EXP, is NaN, and if so set
1597 expand_errno_check (tree exp, rtx target)
1599 rtx lab = gen_label_rtx ();
1601 /* Test the result; if it is NaN, set errno=EDOM because
1602 the argument was not in the domain. */
1603 emit_cmp_and_jump_insns (target, target, EQ, 0, GET_MODE (target),
1607 /* If this built-in doesn't throw an exception, set errno directly. */
1608 if (TREE_NOTHROW (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
1610 #ifdef GEN_ERRNO_RTX
1611 rtx errno_rtx = GEN_ERRNO_RTX;
1614 = gen_rtx_MEM (word_mode, gen_rtx_SYMBOL_REF (Pmode, "errno"));
1616 emit_move_insn (errno_rtx, GEN_INT (TARGET_EDOM));
1622 /* We can't set errno=EDOM directly; let the library call do it.
1623 Pop the arguments right away in case the call gets deleted. */
1625 expand_call (exp, target, 0);
1631 /* Expand a call to one of the builtin math functions (sqrt, exp, or log).
1632 Return 0 if a normal call should be emitted rather than expanding the
1633 function in-line. EXP is the expression that is a call to the builtin
1634 function; if convenient, the result should be placed in TARGET.
1635 SUBTARGET may be used as the target for computing one of EXP's operands. */
1638 expand_builtin_mathfn (tree exp, rtx target, rtx subtarget)
1640 optab builtin_optab;
1641 rtx op0, insns, before_call;
1642 tree fndecl = get_callee_fndecl (exp);
1643 tree arglist = TREE_OPERAND (exp, 1);
1644 enum machine_mode mode;
1645 bool errno_set = false;
1648 if (!validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
1651 arg = TREE_VALUE (arglist);
1653 switch (DECL_FUNCTION_CODE (fndecl))
1656 case BUILT_IN_SQRTF:
1657 case BUILT_IN_SQRTL:
1658 errno_set = ! tree_expr_nonnegative_p (arg);
1659 builtin_optab = sqrt_optab;
1664 errno_set = true; builtin_optab = exp_optab; break;
1665 case BUILT_IN_EXP10:
1666 case BUILT_IN_EXP10F:
1667 case BUILT_IN_EXP10L:
1668 case BUILT_IN_POW10:
1669 case BUILT_IN_POW10F:
1670 case BUILT_IN_POW10L:
1671 errno_set = true; builtin_optab = exp10_optab; break;
1673 case BUILT_IN_EXP2F:
1674 case BUILT_IN_EXP2L:
1675 errno_set = true; builtin_optab = exp2_optab; break;
1676 case BUILT_IN_EXPM1:
1677 case BUILT_IN_EXPM1F:
1678 case BUILT_IN_EXPM1L:
1679 errno_set = true; builtin_optab = expm1_optab; break;
1681 case BUILT_IN_LOGBF:
1682 case BUILT_IN_LOGBL:
1683 errno_set = true; builtin_optab = logb_optab; break;
1684 case BUILT_IN_ILOGB:
1685 case BUILT_IN_ILOGBF:
1686 case BUILT_IN_ILOGBL:
1687 errno_set = true; builtin_optab = ilogb_optab; break;
1691 errno_set = true; builtin_optab = log_optab; break;
1692 case BUILT_IN_LOG10:
1693 case BUILT_IN_LOG10F:
1694 case BUILT_IN_LOG10L:
1695 errno_set = true; builtin_optab = log10_optab; break;
1697 case BUILT_IN_LOG2F:
1698 case BUILT_IN_LOG2L:
1699 errno_set = true; builtin_optab = log2_optab; break;
1700 case BUILT_IN_LOG1P:
1701 case BUILT_IN_LOG1PF:
1702 case BUILT_IN_LOG1PL:
1703 errno_set = true; builtin_optab = log1p_optab; break;
1705 case BUILT_IN_ASINF:
1706 case BUILT_IN_ASINL:
1707 builtin_optab = asin_optab; break;
1709 case BUILT_IN_ACOSF:
1710 case BUILT_IN_ACOSL:
1711 builtin_optab = acos_optab; break;
1715 builtin_optab = tan_optab; break;
1717 case BUILT_IN_ATANF:
1718 case BUILT_IN_ATANL:
1719 builtin_optab = atan_optab; break;
1720 case BUILT_IN_FLOOR:
1721 case BUILT_IN_FLOORF:
1722 case BUILT_IN_FLOORL:
1723 builtin_optab = floor_optab; break;
1725 case BUILT_IN_CEILF:
1726 case BUILT_IN_CEILL:
1727 builtin_optab = ceil_optab; break;
1728 case BUILT_IN_TRUNC:
1729 case BUILT_IN_TRUNCF:
1730 case BUILT_IN_TRUNCL:
1731 builtin_optab = btrunc_optab; break;
1732 case BUILT_IN_ROUND:
1733 case BUILT_IN_ROUNDF:
1734 case BUILT_IN_ROUNDL:
1735 builtin_optab = round_optab; break;
1736 case BUILT_IN_NEARBYINT:
1737 case BUILT_IN_NEARBYINTF:
1738 case BUILT_IN_NEARBYINTL:
1739 builtin_optab = nearbyint_optab; break;
1741 case BUILT_IN_RINTF:
1742 case BUILT_IN_RINTL:
1743 builtin_optab = rint_optab; break;
1748 /* Make a suitable register to place result in. */
1749 mode = TYPE_MODE (TREE_TYPE (exp));
1751 if (! flag_errno_math || ! HONOR_NANS (mode))
1754 /* Before working hard, check whether the instruction is available. */
1755 if (builtin_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
1757 target = gen_reg_rtx (mode);
1759 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
1760 need to expand the argument again. This way, we will not perform
1761 side-effects more the once. */
1762 narg = builtin_save_expr (arg);
1765 arglist = build_tree_list (NULL_TREE, arg);
1766 exp = build_function_call_expr (fndecl, arglist);
1769 op0 = expand_expr (arg, subtarget, VOIDmode, 0);
1773 /* Compute into TARGET.
1774 Set TARGET to wherever the result comes back. */
1775 target = expand_unop (mode, builtin_optab, op0, target, 0);
1780 expand_errno_check (exp, target);
1782 /* Output the entire sequence. */
1783 insns = get_insns ();
1789 /* If we were unable to expand via the builtin, stop the sequence
1790 (without outputting the insns) and call to the library function
1791 with the stabilized argument list. */
1795 before_call = get_last_insn ();
1797 target = expand_call (exp, target, target == const0_rtx);
1799 /* If this is a sqrt operation and we don't care about errno, try to
1800 attach a REG_EQUAL note with a SQRT rtx to the emitted libcall.
1801 This allows the semantics of the libcall to be visible to the RTL
1803 if (builtin_optab == sqrt_optab && !errno_set)
1805 /* Search backwards through the insns emitted by expand_call looking
1806 for the instruction with the REG_RETVAL note. */
1807 rtx last = get_last_insn ();
1808 while (last != before_call)
1810 if (find_reg_note (last, REG_RETVAL, NULL))
1812 rtx note = find_reg_note (last, REG_EQUAL, NULL);
1813 /* Check that the REQ_EQUAL note is an EXPR_LIST with
1814 two elements, i.e. symbol_ref(sqrt) and the operand. */
1816 && GET_CODE (note) == EXPR_LIST
1817 && GET_CODE (XEXP (note, 0)) == EXPR_LIST
1818 && XEXP (XEXP (note, 0), 1) != NULL_RTX
1819 && XEXP (XEXP (XEXP (note, 0), 1), 1) == NULL_RTX)
1821 rtx operand = XEXP (XEXP (XEXP (note, 0), 1), 0);
1822 /* Check operand is a register with expected mode. */
1825 && GET_MODE (operand) == mode)
1827 /* Replace the REG_EQUAL note with a SQRT rtx. */
1828 rtx equiv = gen_rtx_SQRT (mode, operand);
1829 set_unique_reg_note (last, REG_EQUAL, equiv);
1834 last = PREV_INSN (last);
1841 /* Expand a call to the builtin binary math functions (pow and atan2).
1842 Return 0 if a normal call should be emitted rather than expanding the
1843 function in-line. EXP is the expression that is a call to the builtin
1844 function; if convenient, the result should be placed in TARGET.
1845 SUBTARGET may be used as the target for computing one of EXP's
1849 expand_builtin_mathfn_2 (tree exp, rtx target, rtx subtarget)
1851 optab builtin_optab;
1852 rtx op0, op1, insns;
1853 tree fndecl = get_callee_fndecl (exp);
1854 tree arglist = TREE_OPERAND (exp, 1);
1855 tree arg0, arg1, temp, narg;
1856 enum machine_mode mode;
1857 bool errno_set = true;
1860 if (!validate_arglist (arglist, REAL_TYPE, REAL_TYPE, VOID_TYPE))
1863 arg0 = TREE_VALUE (arglist);
1864 arg1 = TREE_VALUE (TREE_CHAIN (arglist));
1866 switch (DECL_FUNCTION_CODE (fndecl))
1871 builtin_optab = pow_optab; break;
1872 case BUILT_IN_ATAN2:
1873 case BUILT_IN_ATAN2F:
1874 case BUILT_IN_ATAN2L:
1875 builtin_optab = atan2_optab; break;
1877 case BUILT_IN_FMODF:
1878 case BUILT_IN_FMODL:
1879 builtin_optab = fmod_optab; break;
1881 case BUILT_IN_DREMF:
1882 case BUILT_IN_DREML:
1883 builtin_optab = drem_optab; break;
1888 /* Make a suitable register to place result in. */
1889 mode = TYPE_MODE (TREE_TYPE (exp));
1891 /* Before working hard, check whether the instruction is available. */
1892 if (builtin_optab->handlers[(int) mode].insn_code == CODE_FOR_nothing)
1895 target = gen_reg_rtx (mode);
1897 if (! flag_errno_math || ! HONOR_NANS (mode))
1900 /* Always stabilize the argument list. */
1901 narg = builtin_save_expr (arg1);
1904 temp = build_tree_list (NULL_TREE, narg);
1908 temp = TREE_CHAIN (arglist);
1910 narg = builtin_save_expr (arg0);
1913 arglist = tree_cons (NULL_TREE, narg, temp);
1917 arglist = tree_cons (NULL_TREE, arg0, temp);
1920 exp = build_function_call_expr (fndecl, arglist);
1922 op0 = expand_expr (arg0, subtarget, VOIDmode, 0);
1923 op1 = expand_expr (arg1, 0, VOIDmode, 0);
1927 /* Compute into TARGET.
1928 Set TARGET to wherever the result comes back. */
1929 target = expand_binop (mode, builtin_optab, op0, op1,
1930 target, 0, OPTAB_DIRECT);
1932 /* If we were unable to expand via the builtin, stop the sequence
1933 (without outputting the insns) and call to the library function
1934 with the stabilized argument list. */
1938 return expand_call (exp, target, target == const0_rtx);
1942 expand_errno_check (exp, target);
1944 /* Output the entire sequence. */
1945 insns = get_insns ();
1952 /* Expand a call to the builtin sin and cos math functions.
1953 Return 0 if a normal call should be emitted rather than expanding the
1954 function in-line. EXP is the expression that is a call to the builtin
1955 function; if convenient, the result should be placed in TARGET.
1956 SUBTARGET may be used as the target for computing one of EXP's
1960 expand_builtin_mathfn_3 (tree exp, rtx target, rtx subtarget)
1962 optab builtin_optab;
1963 rtx op0, insns, before_call;
1964 tree fndecl = get_callee_fndecl (exp);
1965 tree arglist = TREE_OPERAND (exp, 1);
1966 enum machine_mode mode;
1967 bool errno_set = false;
1970 if (!validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
1973 arg = TREE_VALUE (arglist);
1975 switch (DECL_FUNCTION_CODE (fndecl))
1983 builtin_optab = sincos_optab; break;
1988 /* Make a suitable register to place result in. */
1989 mode = TYPE_MODE (TREE_TYPE (exp));
1991 if (! flag_errno_math || ! HONOR_NANS (mode))
1994 /* Check if sincos insn is available, otherwise fallback
1995 to sin or cos insn. */
1996 if (builtin_optab->handlers[(int) mode].insn_code == CODE_FOR_nothing) {
1997 switch (DECL_FUNCTION_CODE (fndecl))
2002 builtin_optab = sin_optab; break;
2006 builtin_optab = cos_optab; break;
2012 /* Before working hard, check whether the instruction is available. */
2013 if (builtin_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
2015 target = gen_reg_rtx (mode);
2017 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2018 need to expand the argument again. This way, we will not perform
2019 side-effects more the once. */
2020 narg = save_expr (arg);
2023 arglist = build_tree_list (NULL_TREE, arg);
2024 exp = build_function_call_expr (fndecl, arglist);
2027 op0 = expand_expr (arg, subtarget, VOIDmode, 0);
2031 /* Compute into TARGET.
2032 Set TARGET to wherever the result comes back. */
2033 if (builtin_optab == sincos_optab)
2037 switch (DECL_FUNCTION_CODE (fndecl))
2042 result = expand_twoval_unop (builtin_optab, op0, 0, target, 0);
2047 result = expand_twoval_unop (builtin_optab, op0, target, 0, 0);
2052 gcc_assert (result);
2056 target = expand_unop (mode, builtin_optab, op0, target, 0);
2062 expand_errno_check (exp, target);
2064 /* Output the entire sequence. */
2065 insns = get_insns ();
2071 /* If we were unable to expand via the builtin, stop the sequence
2072 (without outputting the insns) and call to the library function
2073 with the stabilized argument list. */
2077 before_call = get_last_insn ();
2079 target = expand_call (exp, target, target == const0_rtx);
2084 /* To evaluate powi(x,n), the floating point value x raised to the
2085 constant integer exponent n, we use a hybrid algorithm that
2086 combines the "window method" with look-up tables. For an
2087 introduction to exponentiation algorithms and "addition chains",
2088 see section 4.6.3, "Evaluation of Powers" of Donald E. Knuth,
2089 "Seminumerical Algorithms", Vol. 2, "The Art of Computer Programming",
2090 3rd Edition, 1998, and Daniel M. Gordon, "A Survey of Fast Exponentiation
2091 Methods", Journal of Algorithms, Vol. 27, pp. 129-146, 1998. */
2093 /* Provide a default value for POWI_MAX_MULTS, the maximum number of
2094 multiplications to inline before calling the system library's pow
2095 function. powi(x,n) requires at worst 2*bits(n)-2 multiplications,
2096 so this default never requires calling pow, powf or powl. */
2098 #ifndef POWI_MAX_MULTS
2099 #define POWI_MAX_MULTS (2*HOST_BITS_PER_WIDE_INT-2)
2102 /* The size of the "optimal power tree" lookup table. All
2103 exponents less than this value are simply looked up in the
2104 powi_table below. This threshold is also used to size the
2105 cache of pseudo registers that hold intermediate results. */
2106 #define POWI_TABLE_SIZE 256
2108 /* The size, in bits of the window, used in the "window method"
2109 exponentiation algorithm. This is equivalent to a radix of
2110 (1<<POWI_WINDOW_SIZE) in the corresponding "m-ary method". */
2111 #define POWI_WINDOW_SIZE 3
2113 /* The following table is an efficient representation of an
2114 "optimal power tree". For each value, i, the corresponding
2115 value, j, in the table states than an optimal evaluation
2116 sequence for calculating pow(x,i) can be found by evaluating
2117 pow(x,j)*pow(x,i-j). An optimal power tree for the first
2118 100 integers is given in Knuth's "Seminumerical algorithms". */
2120 static const unsigned char powi_table[POWI_TABLE_SIZE] =
2122 0, 1, 1, 2, 2, 3, 3, 4, /* 0 - 7 */
2123 4, 6, 5, 6, 6, 10, 7, 9, /* 8 - 15 */
2124 8, 16, 9, 16, 10, 12, 11, 13, /* 16 - 23 */
2125 12, 17, 13, 18, 14, 24, 15, 26, /* 24 - 31 */
2126 16, 17, 17, 19, 18, 33, 19, 26, /* 32 - 39 */
2127 20, 25, 21, 40, 22, 27, 23, 44, /* 40 - 47 */
2128 24, 32, 25, 34, 26, 29, 27, 44, /* 48 - 55 */
2129 28, 31, 29, 34, 30, 60, 31, 36, /* 56 - 63 */
2130 32, 64, 33, 34, 34, 46, 35, 37, /* 64 - 71 */
2131 36, 65, 37, 50, 38, 48, 39, 69, /* 72 - 79 */
2132 40, 49, 41, 43, 42, 51, 43, 58, /* 80 - 87 */
2133 44, 64, 45, 47, 46, 59, 47, 76, /* 88 - 95 */
2134 48, 65, 49, 66, 50, 67, 51, 66, /* 96 - 103 */
2135 52, 70, 53, 74, 54, 104, 55, 74, /* 104 - 111 */
2136 56, 64, 57, 69, 58, 78, 59, 68, /* 112 - 119 */
2137 60, 61, 61, 80, 62, 75, 63, 68, /* 120 - 127 */
2138 64, 65, 65, 128, 66, 129, 67, 90, /* 128 - 135 */
2139 68, 73, 69, 131, 70, 94, 71, 88, /* 136 - 143 */
2140 72, 128, 73, 98, 74, 132, 75, 121, /* 144 - 151 */
2141 76, 102, 77, 124, 78, 132, 79, 106, /* 152 - 159 */
2142 80, 97, 81, 160, 82, 99, 83, 134, /* 160 - 167 */
2143 84, 86, 85, 95, 86, 160, 87, 100, /* 168 - 175 */
2144 88, 113, 89, 98, 90, 107, 91, 122, /* 176 - 183 */
2145 92, 111, 93, 102, 94, 126, 95, 150, /* 184 - 191 */
2146 96, 128, 97, 130, 98, 133, 99, 195, /* 192 - 199 */
2147 100, 128, 101, 123, 102, 164, 103, 138, /* 200 - 207 */
2148 104, 145, 105, 146, 106, 109, 107, 149, /* 208 - 215 */
2149 108, 200, 109, 146, 110, 170, 111, 157, /* 216 - 223 */
2150 112, 128, 113, 130, 114, 182, 115, 132, /* 224 - 231 */
2151 116, 200, 117, 132, 118, 158, 119, 206, /* 232 - 239 */
2152 120, 240, 121, 162, 122, 147, 123, 152, /* 240 - 247 */
2153 124, 166, 125, 214, 126, 138, 127, 153, /* 248 - 255 */
2157 /* Return the number of multiplications required to calculate
2158 powi(x,n) where n is less than POWI_TABLE_SIZE. This is a
2159 subroutine of powi_cost. CACHE is an array indicating
2160 which exponents have already been calculated. */
2163 powi_lookup_cost (unsigned HOST_WIDE_INT n, bool *cache)
2165 /* If we've already calculated this exponent, then this evaluation
2166 doesn't require any additional multiplications. */
2171 return powi_lookup_cost (n - powi_table[n], cache)
2172 + powi_lookup_cost (powi_table[n], cache) + 1;
2175 /* Return the number of multiplications required to calculate
2176 powi(x,n) for an arbitrary x, given the exponent N. This
2177 function needs to be kept in sync with expand_powi below. */
2180 powi_cost (HOST_WIDE_INT n)
2182 bool cache[POWI_TABLE_SIZE];
2183 unsigned HOST_WIDE_INT digit;
2184 unsigned HOST_WIDE_INT val;
2190 /* Ignore the reciprocal when calculating the cost. */
2191 val = (n < 0) ? -n : n;
2193 /* Initialize the exponent cache. */
2194 memset (cache, 0, POWI_TABLE_SIZE * sizeof (bool));
2199 while (val >= POWI_TABLE_SIZE)
2203 digit = val & ((1 << POWI_WINDOW_SIZE) - 1);
2204 result += powi_lookup_cost (digit, cache)
2205 + POWI_WINDOW_SIZE + 1;
2206 val >>= POWI_WINDOW_SIZE;
2215 return result + powi_lookup_cost (val, cache);
2218 /* Recursive subroutine of expand_powi. This function takes the array,
2219 CACHE, of already calculated exponents and an exponent N and returns
2220 an RTX that corresponds to CACHE[1]**N, as calculated in mode MODE. */
2223 expand_powi_1 (enum machine_mode mode, unsigned HOST_WIDE_INT n, rtx *cache)
2225 unsigned HOST_WIDE_INT digit;
2229 if (n < POWI_TABLE_SIZE)
2234 target = gen_reg_rtx (mode);
2237 op0 = expand_powi_1 (mode, n - powi_table[n], cache);
2238 op1 = expand_powi_1 (mode, powi_table[n], cache);
2242 target = gen_reg_rtx (mode);
2243 digit = n & ((1 << POWI_WINDOW_SIZE) - 1);
2244 op0 = expand_powi_1 (mode, n - digit, cache);
2245 op1 = expand_powi_1 (mode, digit, cache);
2249 target = gen_reg_rtx (mode);
2250 op0 = expand_powi_1 (mode, n >> 1, cache);
2254 result = expand_mult (mode, op0, op1, target, 0);
2255 if (result != target)
2256 emit_move_insn (target, result);
2260 /* Expand the RTL to evaluate powi(x,n) in mode MODE. X is the
2261 floating point operand in mode MODE, and N is the exponent. This
2262 function needs to be kept in sync with powi_cost above. */
2265 expand_powi (rtx x, enum machine_mode mode, HOST_WIDE_INT n)
2267 unsigned HOST_WIDE_INT val;
2268 rtx cache[POWI_TABLE_SIZE];
2272 return CONST1_RTX (mode);
2274 val = (n < 0) ? -n : n;
2276 memset (cache, 0, sizeof (cache));
2279 result = expand_powi_1 (mode, (n < 0) ? -n : n, cache);
2281 /* If the original exponent was negative, reciprocate the result. */
2283 result = expand_binop (mode, sdiv_optab, CONST1_RTX (mode),
2284 result, NULL_RTX, 0, OPTAB_LIB_WIDEN);
2289 /* Expand a call to the pow built-in mathematical function. Return 0 if
2290 a normal call should be emitted rather than expanding the function
2291 in-line. EXP is the expression that is a call to the builtin
2292 function; if convenient, the result should be placed in TARGET. */
2295 expand_builtin_pow (tree exp, rtx target, rtx subtarget)
2297 tree arglist = TREE_OPERAND (exp, 1);
2300 if (! validate_arglist (arglist, REAL_TYPE, REAL_TYPE, VOID_TYPE))
2303 arg0 = TREE_VALUE (arglist);
2304 arg1 = TREE_VALUE (TREE_CHAIN (arglist));
2306 if (TREE_CODE (arg1) == REAL_CST
2307 && ! TREE_CONSTANT_OVERFLOW (arg1))
2309 REAL_VALUE_TYPE cint;
2313 c = TREE_REAL_CST (arg1);
2314 n = real_to_integer (&c);
2315 real_from_integer (&cint, VOIDmode, n, n < 0 ? -1 : 0, 0);
2316 if (real_identical (&c, &cint))
2318 /* If the exponent is -1, 0, 1 or 2, then expand_powi is exact.
2319 Otherwise, check the number of multiplications required.
2320 Note that pow never sets errno for an integer exponent. */
2321 if ((n >= -1 && n <= 2)
2322 || (flag_unsafe_math_optimizations
2324 && powi_cost (n) <= POWI_MAX_MULTS))
2326 enum machine_mode mode = TYPE_MODE (TREE_TYPE (exp));
2327 rtx op = expand_expr (arg0, subtarget, VOIDmode, 0);
2328 op = force_reg (mode, op);
2329 return expand_powi (op, mode, n);
2334 if (! flag_unsafe_math_optimizations)
2336 return expand_builtin_mathfn_2 (exp, target, subtarget);
2339 /* Expand expression EXP which is a call to the strlen builtin. Return 0
2340 if we failed the caller should emit a normal call, otherwise
2341 try to get the result in TARGET, if convenient. */
2344 expand_builtin_strlen (tree arglist, rtx target,
2345 enum machine_mode target_mode)
2347 if (!validate_arglist (arglist, POINTER_TYPE, VOID_TYPE))
2352 tree len, src = TREE_VALUE (arglist);
2353 rtx result, src_reg, char_rtx, before_strlen;
2354 enum machine_mode insn_mode = target_mode, char_mode;
2355 enum insn_code icode = CODE_FOR_nothing;
2358 /* If the length can be computed at compile-time, return it. */
2359 len = c_strlen (src, 0);
2361 return expand_expr (len, target, target_mode, EXPAND_NORMAL);
2363 /* If the length can be computed at compile-time and is constant
2364 integer, but there are side-effects in src, evaluate
2365 src for side-effects, then return len.
2366 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
2367 can be optimized into: i++; x = 3; */
2368 len = c_strlen (src, 1);
2369 if (len && TREE_CODE (len) == INTEGER_CST)
2371 expand_expr (src, const0_rtx, VOIDmode, EXPAND_NORMAL);
2372 return expand_expr (len, target, target_mode, EXPAND_NORMAL);
2375 align = get_pointer_alignment (src, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
2377 /* If SRC is not a pointer type, don't do this operation inline. */
2381 /* Bail out if we can't compute strlen in the right mode. */
2382 while (insn_mode != VOIDmode)
2384 icode = strlen_optab->handlers[(int) insn_mode].insn_code;
2385 if (icode != CODE_FOR_nothing)
2388 insn_mode = GET_MODE_WIDER_MODE (insn_mode);
2390 if (insn_mode == VOIDmode)
2393 /* Make a place to write the result of the instruction. */
2397 && GET_MODE (result) == insn_mode
2398 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
2399 result = gen_reg_rtx (insn_mode);
2401 /* Make a place to hold the source address. We will not expand
2402 the actual source until we are sure that the expansion will
2403 not fail -- there are trees that cannot be expanded twice. */
2404 src_reg = gen_reg_rtx (Pmode);
2406 /* Mark the beginning of the strlen sequence so we can emit the
2407 source operand later. */
2408 before_strlen = get_last_insn ();
2410 char_rtx = const0_rtx;
2411 char_mode = insn_data[(int) icode].operand[2].mode;
2412 if (! (*insn_data[(int) icode].operand[2].predicate) (char_rtx,
2414 char_rtx = copy_to_mode_reg (char_mode, char_rtx);
2416 pat = GEN_FCN (icode) (result, gen_rtx_MEM (BLKmode, src_reg),
2417 char_rtx, GEN_INT (align));
2422 /* Now that we are assured of success, expand the source. */
2424 pat = memory_address (BLKmode,
2425 expand_expr (src, src_reg, ptr_mode, EXPAND_SUM));
2427 emit_move_insn (src_reg, pat);
2432 emit_insn_after (pat, before_strlen);
2434 emit_insn_before (pat, get_insns ());
2436 /* Return the value in the proper mode for this function. */
2437 if (GET_MODE (result) == target_mode)
2439 else if (target != 0)
2440 convert_move (target, result, 0);
2442 target = convert_to_mode (target_mode, result, 0);
2448 /* Expand a call to the strstr builtin. Return 0 if we failed the
2449 caller should emit a normal call, otherwise try to get the result
2450 in TARGET, if convenient (and in mode MODE if that's convenient). */
2453 expand_builtin_strstr (tree arglist, rtx target, enum machine_mode mode)
2455 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
2459 tree s1 = TREE_VALUE (arglist), s2 = TREE_VALUE (TREE_CHAIN (arglist));
2461 const char *p1, *p2;
2470 const char *r = strstr (p1, p2);
2475 /* Return an offset into the constant string argument. */
2476 tmp = fold (build2 (PLUS_EXPR, TREE_TYPE (s1), s1,
2477 fold_convert (TREE_TYPE (s1),
2478 ssize_int (r - p1))));
2479 return expand_expr (tmp, target, mode, EXPAND_NORMAL);
2483 return expand_expr (s1, target, mode, EXPAND_NORMAL);
2488 fn = implicit_built_in_decls[BUILT_IN_STRCHR];
2492 /* New argument list transforming strstr(s1, s2) to
2493 strchr(s1, s2[0]). */
2494 arglist = build_tree_list (NULL_TREE,
2495 build_int_cst (NULL_TREE, p2[0]));
2496 arglist = tree_cons (NULL_TREE, s1, arglist);
2497 return expand_expr (build_function_call_expr (fn, arglist),
2498 target, mode, EXPAND_NORMAL);
2502 /* Expand a call to the strchr builtin. Return 0 if we failed the
2503 caller should emit a normal call, otherwise try to get the result
2504 in TARGET, if convenient (and in mode MODE if that's convenient). */
2507 expand_builtin_strchr (tree arglist, rtx target, enum machine_mode mode)
2509 if (!validate_arglist (arglist, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
2513 tree s1 = TREE_VALUE (arglist), s2 = TREE_VALUE (TREE_CHAIN (arglist));
2516 if (TREE_CODE (s2) != INTEGER_CST)
2526 if (target_char_cast (s2, &c))
2534 /* Return an offset into the constant string argument. */
2535 tmp = fold (build2 (PLUS_EXPR, TREE_TYPE (s1), s1,
2536 fold_convert (TREE_TYPE (s1),
2537 ssize_int (r - p1))));
2538 return expand_expr (tmp, target, mode, EXPAND_NORMAL);
2541 /* FIXME: Should use here strchrM optab so that ports can optimize
2547 /* Expand a call to the strrchr builtin. Return 0 if we failed the
2548 caller should emit a normal call, otherwise try to get the result
2549 in TARGET, if convenient (and in mode MODE if that's convenient). */
2552 expand_builtin_strrchr (tree arglist, rtx target, enum machine_mode mode)
2554 if (!validate_arglist (arglist, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
2558 tree s1 = TREE_VALUE (arglist), s2 = TREE_VALUE (TREE_CHAIN (arglist));
2562 if (TREE_CODE (s2) != INTEGER_CST)
2571 if (target_char_cast (s2, &c))
2574 r = strrchr (p1, c);
2579 /* Return an offset into the constant string argument. */
2580 tmp = fold (build2 (PLUS_EXPR, TREE_TYPE (s1), s1,
2581 fold_convert (TREE_TYPE (s1),
2582 ssize_int (r - p1))));
2583 return expand_expr (tmp, target, mode, EXPAND_NORMAL);
2586 if (! integer_zerop (s2))
2589 fn = implicit_built_in_decls[BUILT_IN_STRCHR];
2593 /* Transform strrchr(s1, '\0') to strchr(s1, '\0'). */
2594 return expand_expr (build_function_call_expr (fn, arglist),
2595 target, mode, EXPAND_NORMAL);
2599 /* Expand a call to the strpbrk builtin. Return 0 if we failed the
2600 caller should emit a normal call, otherwise try to get the result
2601 in TARGET, if convenient (and in mode MODE if that's convenient). */
2604 expand_builtin_strpbrk (tree arglist, rtx target, enum machine_mode mode)
2606 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
2610 tree s1 = TREE_VALUE (arglist), s2 = TREE_VALUE (TREE_CHAIN (arglist));
2612 const char *p1, *p2;
2621 const char *r = strpbrk (p1, p2);
2626 /* Return an offset into the constant string argument. */
2627 tmp = fold (build2 (PLUS_EXPR, TREE_TYPE (s1), s1,
2628 fold_convert (TREE_TYPE (s1),
2629 ssize_int (r - p1))));
2630 return expand_expr (tmp, target, mode, EXPAND_NORMAL);
2635 /* strpbrk(x, "") == NULL.
2636 Evaluate and ignore the arguments in case they had
2638 expand_expr (s1, const0_rtx, VOIDmode, EXPAND_NORMAL);
2643 return 0; /* Really call strpbrk. */
2645 fn = implicit_built_in_decls[BUILT_IN_STRCHR];
2649 /* New argument list transforming strpbrk(s1, s2) to
2650 strchr(s1, s2[0]). */
2651 arglist = build_tree_list (NULL_TREE,
2652 build_int_cst (NULL_TREE, p2[0]));
2653 arglist = tree_cons (NULL_TREE, s1, arglist);
2654 return expand_expr (build_function_call_expr (fn, arglist),
2655 target, mode, EXPAND_NORMAL);
2659 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
2660 bytes from constant string DATA + OFFSET and return it as target
2664 builtin_memcpy_read_str (void *data, HOST_WIDE_INT offset,
2665 enum machine_mode mode)
2667 const char *str = (const char *) data;
2669 gcc_assert (offset >= 0
2670 && ((unsigned HOST_WIDE_INT) offset + GET_MODE_SIZE (mode)
2671 <= strlen (str) + 1));
2673 return c_readstr (str + offset, mode);
2676 /* Expand a call to the memcpy builtin, with arguments in ARGLIST.
2677 Return 0 if we failed, the caller should emit a normal call,
2678 otherwise try to get the result in TARGET, if convenient (and in
2679 mode MODE if that's convenient). */
2681 expand_builtin_memcpy (tree arglist, rtx target, enum machine_mode mode)
2683 if (!validate_arglist (arglist,
2684 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
2688 tree dest = TREE_VALUE (arglist);
2689 tree src = TREE_VALUE (TREE_CHAIN (arglist));
2690 tree len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
2691 const char *src_str;
2692 unsigned int src_align = get_pointer_alignment (src, BIGGEST_ALIGNMENT);
2693 unsigned int dest_align
2694 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
2695 rtx dest_mem, src_mem, dest_addr, len_rtx;
2697 /* If DEST is not a pointer type, call the normal function. */
2698 if (dest_align == 0)
2701 /* If the LEN parameter is zero, return DEST. */
2702 if (integer_zerop (len))
2704 /* Evaluate and ignore SRC in case it has side-effects. */
2705 expand_expr (src, const0_rtx, VOIDmode, EXPAND_NORMAL);
2706 return expand_expr (dest, target, mode, EXPAND_NORMAL);
2709 /* If SRC and DEST are the same (and not volatile), return DEST. */
2710 if (operand_equal_p (src, dest, 0))
2712 /* Evaluate and ignore LEN in case it has side-effects. */
2713 expand_expr (len, const0_rtx, VOIDmode, EXPAND_NORMAL);
2714 return expand_expr (dest, target, mode, EXPAND_NORMAL);
2717 /* If either SRC is not a pointer type, don't do this
2718 operation in-line. */
2722 dest_mem = get_memory_rtx (dest);
2723 set_mem_align (dest_mem, dest_align);
2724 len_rtx = expand_expr (len, NULL_RTX, VOIDmode, 0);
2725 src_str = c_getstr (src);
2727 /* If SRC is a string constant and block move would be done
2728 by pieces, we can avoid loading the string from memory
2729 and only stored the computed constants. */
2731 && GET_CODE (len_rtx) == CONST_INT
2732 && (unsigned HOST_WIDE_INT) INTVAL (len_rtx) <= strlen (src_str) + 1
2733 && can_store_by_pieces (INTVAL (len_rtx), builtin_memcpy_read_str,
2734 (void *) src_str, dest_align))
2736 dest_mem = store_by_pieces (dest_mem, INTVAL (len_rtx),
2737 builtin_memcpy_read_str,
2738 (void *) src_str, dest_align, 0);
2739 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
2740 dest_mem = convert_memory_address (ptr_mode, dest_mem);
2744 src_mem = get_memory_rtx (src);
2745 set_mem_align (src_mem, src_align);
2747 /* Copy word part most expediently. */
2748 dest_addr = emit_block_move (dest_mem, src_mem, len_rtx,
2753 dest_addr = force_operand (XEXP (dest_mem, 0), NULL_RTX);
2754 dest_addr = convert_memory_address (ptr_mode, dest_addr);
2760 /* Expand a call to the mempcpy builtin, with arguments in ARGLIST.
2761 Return 0 if we failed the caller should emit a normal call,
2762 otherwise try to get the result in TARGET, if convenient (and in
2763 mode MODE if that's convenient). If ENDP is 0 return the
2764 destination pointer, if ENDP is 1 return the end pointer ala
2765 mempcpy, and if ENDP is 2 return the end pointer minus one ala
2769 expand_builtin_mempcpy (tree arglist, rtx target, enum machine_mode mode,
2772 if (!validate_arglist (arglist,
2773 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
2775 /* If return value is ignored, transform mempcpy into memcpy. */
2776 else if (target == const0_rtx)
2778 tree fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
2783 return expand_expr (build_function_call_expr (fn, arglist),
2784 target, mode, EXPAND_NORMAL);
2788 tree dest = TREE_VALUE (arglist);
2789 tree src = TREE_VALUE (TREE_CHAIN (arglist));
2790 tree len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
2791 const char *src_str;
2792 unsigned int src_align = get_pointer_alignment (src, BIGGEST_ALIGNMENT);
2793 unsigned int dest_align
2794 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
2795 rtx dest_mem, src_mem, len_rtx;
2797 /* If DEST is not a pointer type, call the normal function. */
2798 if (dest_align == 0)
2801 /* If SRC and DEST are the same (and not volatile), do nothing. */
2802 if (operand_equal_p (src, dest, 0))
2808 /* Evaluate and ignore LEN in case it has side-effects. */
2809 expand_expr (len, const0_rtx, VOIDmode, EXPAND_NORMAL);
2810 return expand_expr (dest, target, mode, EXPAND_NORMAL);
2814 len = fold (build2 (MINUS_EXPR, TREE_TYPE (len), len,
2816 len = fold_convert (TREE_TYPE (dest), len);
2817 expr = fold (build2 (PLUS_EXPR, TREE_TYPE (dest), dest, len));
2818 return expand_expr (expr, target, mode, EXPAND_NORMAL);
2821 /* If LEN is not constant, call the normal function. */
2822 if (! host_integerp (len, 1))
2825 /* If the LEN parameter is zero, return DEST. */
2826 if (tree_low_cst (len, 1) == 0)
2828 /* Evaluate and ignore SRC in case it has side-effects. */
2829 expand_expr (src, const0_rtx, VOIDmode, EXPAND_NORMAL);
2830 return expand_expr (dest, target, mode, EXPAND_NORMAL);
2833 /* If either SRC is not a pointer type, don't do this
2834 operation in-line. */
2838 len_rtx = expand_expr (len, NULL_RTX, VOIDmode, 0);
2839 src_str = c_getstr (src);
2841 /* If SRC is a string constant and block move would be done
2842 by pieces, we can avoid loading the string from memory
2843 and only stored the computed constants. */
2845 && GET_CODE (len_rtx) == CONST_INT
2846 && (unsigned HOST_WIDE_INT) INTVAL (len_rtx) <= strlen (src_str) + 1
2847 && can_store_by_pieces (INTVAL (len_rtx), builtin_memcpy_read_str,
2848 (void *) src_str, dest_align))
2850 dest_mem = get_memory_rtx (dest);
2851 set_mem_align (dest_mem, dest_align);
2852 dest_mem = store_by_pieces (dest_mem, INTVAL (len_rtx),
2853 builtin_memcpy_read_str,
2854 (void *) src_str, dest_align, endp);
2855 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
2856 dest_mem = convert_memory_address (ptr_mode, dest_mem);
2860 if (GET_CODE (len_rtx) == CONST_INT
2861 && can_move_by_pieces (INTVAL (len_rtx),
2862 MIN (dest_align, src_align)))
2864 dest_mem = get_memory_rtx (dest);
2865 set_mem_align (dest_mem, dest_align);
2866 src_mem = get_memory_rtx (src);
2867 set_mem_align (src_mem, src_align);
2868 dest_mem = move_by_pieces (dest_mem, src_mem, INTVAL (len_rtx),
2869 MIN (dest_align, src_align), endp);
2870 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
2871 dest_mem = convert_memory_address (ptr_mode, dest_mem);
2879 /* Expand expression EXP, which is a call to the memmove builtin. Return 0
2880 if we failed the caller should emit a normal call. */
2883 expand_builtin_memmove (tree arglist, rtx target, enum machine_mode mode)
2885 if (!validate_arglist (arglist,
2886 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
2890 tree dest = TREE_VALUE (arglist);
2891 tree src = TREE_VALUE (TREE_CHAIN (arglist));
2892 tree len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
2894 unsigned int src_align = get_pointer_alignment (src, BIGGEST_ALIGNMENT);
2895 unsigned int dest_align
2896 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
2898 /* If DEST is not a pointer type, call the normal function. */
2899 if (dest_align == 0)
2902 /* If the LEN parameter is zero, return DEST. */
2903 if (integer_zerop (len))
2905 /* Evaluate and ignore SRC in case it has side-effects. */
2906 expand_expr (src, const0_rtx, VOIDmode, EXPAND_NORMAL);
2907 return expand_expr (dest, target, mode, EXPAND_NORMAL);
2910 /* If SRC and DEST are the same (and not volatile), return DEST. */
2911 if (operand_equal_p (src, dest, 0))
2913 /* Evaluate and ignore LEN in case it has side-effects. */
2914 expand_expr (len, const0_rtx, VOIDmode, EXPAND_NORMAL);
2915 return expand_expr (dest, target, mode, EXPAND_NORMAL);
2918 /* If either SRC is not a pointer type, don't do this
2919 operation in-line. */
2923 /* If src is categorized for a readonly section we can use
2925 if (readonly_data_expr (src))
2927 tree const fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
2930 return expand_expr (build_function_call_expr (fn, arglist),
2931 target, mode, EXPAND_NORMAL);
2934 /* Otherwise, call the normal function. */
2939 /* Expand expression EXP, which is a call to the bcopy builtin. Return 0
2940 if we failed the caller should emit a normal call. */
2943 expand_builtin_bcopy (tree arglist)
2945 tree src, dest, size, newarglist;
2947 if (!validate_arglist (arglist,
2948 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
2951 src = TREE_VALUE (arglist);
2952 dest = TREE_VALUE (TREE_CHAIN (arglist));
2953 size = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
2955 /* New argument list transforming bcopy(ptr x, ptr y, int z) to
2956 memmove(ptr y, ptr x, size_t z). This is done this way
2957 so that if it isn't expanded inline, we fallback to
2958 calling bcopy instead of memmove. */
2960 newarglist = build_tree_list (NULL_TREE, fold_convert (sizetype, size));
2961 newarglist = tree_cons (NULL_TREE, src, newarglist);
2962 newarglist = tree_cons (NULL_TREE, dest, newarglist);
2964 return expand_builtin_memmove (newarglist, const0_rtx, VOIDmode);
2968 # define HAVE_movstr 0
2969 # define CODE_FOR_movstr CODE_FOR_nothing
2972 /* Expand into a movstr instruction, if one is available. Return 0 if
2973 we failed, the caller should emit a normal call, otherwise try to
2974 get the result in TARGET, if convenient. If ENDP is 0 return the
2975 destination pointer, if ENDP is 1 return the end pointer ala
2976 mempcpy, and if ENDP is 2 return the end pointer minus one ala
2980 expand_movstr (tree dest, tree src, rtx target, int endp)
2986 const struct insn_data * data;
2991 dest_mem = get_memory_rtx (dest);
2992 src_mem = get_memory_rtx (src);
2995 target = force_reg (Pmode, XEXP (dest_mem, 0));
2996 dest_mem = replace_equiv_address (dest_mem, target);
2997 end = gen_reg_rtx (Pmode);
3001 if (target == 0 || target == const0_rtx)
3003 end = gen_reg_rtx (Pmode);
3011 data = insn_data + CODE_FOR_movstr;
3013 if (data->operand[0].mode != VOIDmode)
3014 end = gen_lowpart (data->operand[0].mode, end);
3016 insn = data->genfun (end, dest_mem, src_mem);
3022 /* movstr is supposed to set end to the address of the NUL
3023 terminator. If the caller requested a mempcpy-like return value,
3025 if (endp == 1 && target != const0_rtx)
3026 emit_move_insn (target, plus_constant (gen_lowpart (GET_MODE (target),
3032 /* Expand expression EXP, which is a call to the strcpy builtin. Return 0
3033 if we failed the caller should emit a normal call, otherwise try to get
3034 the result in TARGET, if convenient (and in mode MODE if that's
3038 expand_builtin_strcpy (tree arglist, rtx target, enum machine_mode mode)
3040 tree fn, len, src, dst;
3042 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3045 src = TREE_VALUE (TREE_CHAIN (arglist));
3046 dst = TREE_VALUE (arglist);
3048 /* If SRC and DST are equal (and not volatile), return DST. */
3049 if (operand_equal_p (src, dst, 0))
3050 return expand_expr (dst, target, mode, EXPAND_NORMAL);
3052 len = c_strlen (src, 1);
3053 if (len == 0 || TREE_SIDE_EFFECTS (len))
3054 return expand_movstr (TREE_VALUE (arglist),
3055 TREE_VALUE (TREE_CHAIN (arglist)),
3056 target, /*endp=*/0);
3058 fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
3062 len = size_binop (PLUS_EXPR, len, ssize_int (1));
3063 arglist = build_tree_list (NULL_TREE, len);
3064 arglist = tree_cons (NULL_TREE, src, arglist);
3065 arglist = tree_cons (NULL_TREE, dst, arglist);
3066 return expand_expr (build_function_call_expr (fn, arglist),
3067 target, mode, EXPAND_NORMAL);
3070 /* Expand a call to the stpcpy builtin, with arguments in ARGLIST.
3071 Return 0 if we failed the caller should emit a normal call,
3072 otherwise try to get the result in TARGET, if convenient (and in
3073 mode MODE if that's convenient). */
3076 expand_builtin_stpcpy (tree arglist, rtx target, enum machine_mode mode)
3078 /* If return value is ignored, transform stpcpy into strcpy. */
3079 if (target == const0_rtx)
3081 tree fn = implicit_built_in_decls[BUILT_IN_STRCPY];
3085 return expand_expr (build_function_call_expr (fn, arglist),
3086 target, mode, EXPAND_NORMAL);
3089 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3093 tree dst, src, len, lenp1;
3097 /* Ensure we get an actual string whose length can be evaluated at
3098 compile-time, not an expression containing a string. This is
3099 because the latter will potentially produce pessimized code
3100 when used to produce the return value. */
3101 src = TREE_VALUE (TREE_CHAIN (arglist));
3102 if (! c_getstr (src) || ! (len = c_strlen (src, 0)))
3103 return expand_movstr (TREE_VALUE (arglist),
3104 TREE_VALUE (TREE_CHAIN (arglist)),
3105 target, /*endp=*/2);
3107 dst = TREE_VALUE (arglist);
3108 lenp1 = size_binop (PLUS_EXPR, len, ssize_int (1));
3109 narglist = build_tree_list (NULL_TREE, lenp1);
3110 narglist = tree_cons (NULL_TREE, src, narglist);
3111 narglist = tree_cons (NULL_TREE, dst, narglist);
3112 ret = expand_builtin_mempcpy (narglist, target, mode, /*endp=*/2);
3117 if (TREE_CODE (len) == INTEGER_CST)
3119 rtx len_rtx = expand_expr (len, NULL_RTX, VOIDmode, 0);
3121 if (GET_CODE (len_rtx) == CONST_INT)
3123 ret = expand_builtin_strcpy (arglist, target, mode);
3129 if (mode != VOIDmode)
3130 target = gen_reg_rtx (mode);
3132 target = gen_reg_rtx (GET_MODE (ret));
3134 if (GET_MODE (target) != GET_MODE (ret))
3135 ret = gen_lowpart (GET_MODE (target), ret);
3137 ret = emit_move_insn (target,
3147 return expand_movstr (TREE_VALUE (arglist),
3148 TREE_VALUE (TREE_CHAIN (arglist)),
3149 target, /*endp=*/2);
3153 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3154 bytes from constant string DATA + OFFSET and return it as target
3158 builtin_strncpy_read_str (void *data, HOST_WIDE_INT offset,
3159 enum machine_mode mode)
3161 const char *str = (const char *) data;
3163 if ((unsigned HOST_WIDE_INT) offset > strlen (str))
3166 return c_readstr (str + offset, mode);
3169 /* Expand expression EXP, which is a call to the strncpy builtin. Return 0
3170 if we failed the caller should emit a normal call. */
3173 expand_builtin_strncpy (tree arglist, rtx target, enum machine_mode mode)
3175 if (!validate_arglist (arglist,
3176 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3180 tree slen = c_strlen (TREE_VALUE (TREE_CHAIN (arglist)), 1);
3181 tree len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
3184 /* We must be passed a constant len parameter. */
3185 if (TREE_CODE (len) != INTEGER_CST)
3188 /* If the len parameter is zero, return the dst parameter. */
3189 if (integer_zerop (len))
3191 /* Evaluate and ignore the src argument in case it has
3193 expand_expr (TREE_VALUE (TREE_CHAIN (arglist)), const0_rtx,
3194 VOIDmode, EXPAND_NORMAL);
3195 /* Return the dst parameter. */
3196 return expand_expr (TREE_VALUE (arglist), target, mode,
3200 /* Now, we must be passed a constant src ptr parameter. */
3201 if (slen == 0 || TREE_CODE (slen) != INTEGER_CST)
3204 slen = size_binop (PLUS_EXPR, slen, ssize_int (1));
3206 /* We're required to pad with trailing zeros if the requested
3207 len is greater than strlen(s2)+1. In that case try to
3208 use store_by_pieces, if it fails, punt. */
3209 if (tree_int_cst_lt (slen, len))
3211 tree dest = TREE_VALUE (arglist);
3212 unsigned int dest_align
3213 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
3214 const char *p = c_getstr (TREE_VALUE (TREE_CHAIN (arglist)));
3217 if (!p || dest_align == 0 || !host_integerp (len, 1)
3218 || !can_store_by_pieces (tree_low_cst (len, 1),
3219 builtin_strncpy_read_str,
3220 (void *) p, dest_align))
3223 dest_mem = get_memory_rtx (dest);
3224 store_by_pieces (dest_mem, tree_low_cst (len, 1),
3225 builtin_strncpy_read_str,
3226 (void *) p, dest_align, 0);
3227 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3228 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3232 /* OK transform into builtin memcpy. */
3233 fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
3236 return expand_expr (build_function_call_expr (fn, arglist),
3237 target, mode, EXPAND_NORMAL);
3241 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3242 bytes from constant string DATA + OFFSET and return it as target
3246 builtin_memset_read_str (void *data, HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
3247 enum machine_mode mode)
3249 const char *c = (const char *) data;
3250 char *p = alloca (GET_MODE_SIZE (mode));
3252 memset (p, *c, GET_MODE_SIZE (mode));
3254 return c_readstr (p, mode);
3257 /* Callback routine for store_by_pieces. Return the RTL of a register
3258 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
3259 char value given in the RTL register data. For example, if mode is
3260 4 bytes wide, return the RTL for 0x01010101*data. */
3263 builtin_memset_gen_str (void *data, HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
3264 enum machine_mode mode)
3270 size = GET_MODE_SIZE (mode);
3275 memset (p, 1, size);
3276 coeff = c_readstr (p, mode);
3278 target = convert_to_mode (mode, (rtx) data, 1);
3279 target = expand_mult (mode, target, coeff, NULL_RTX, 1);
3280 return force_reg (mode, target);
3283 /* Expand expression EXP, which is a call to the memset builtin. Return 0
3284 if we failed the caller should emit a normal call, otherwise try to get
3285 the result in TARGET, if convenient (and in mode MODE if that's
3289 expand_builtin_memset (tree arglist, rtx target, enum machine_mode mode)
3291 if (!validate_arglist (arglist,
3292 POINTER_TYPE, INTEGER_TYPE, INTEGER_TYPE, VOID_TYPE))
3296 tree dest = TREE_VALUE (arglist);
3297 tree val = TREE_VALUE (TREE_CHAIN (arglist));
3298 tree len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
3301 unsigned int dest_align
3302 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
3303 rtx dest_mem, dest_addr, len_rtx;
3305 /* If DEST is not a pointer type, don't do this
3306 operation in-line. */
3307 if (dest_align == 0)
3310 /* If the LEN parameter is zero, return DEST. */
3311 if (integer_zerop (len))
3313 /* Evaluate and ignore VAL in case it has side-effects. */
3314 expand_expr (val, const0_rtx, VOIDmode, EXPAND_NORMAL);
3315 return expand_expr (dest, target, mode, EXPAND_NORMAL);
3318 if (TREE_CODE (val) != INTEGER_CST)
3322 if (!host_integerp (len, 1))
3325 if (optimize_size && tree_low_cst (len, 1) > 1)
3328 /* Assume that we can memset by pieces if we can store the
3329 * the coefficients by pieces (in the required modes).
3330 * We can't pass builtin_memset_gen_str as that emits RTL. */
3332 if (!can_store_by_pieces (tree_low_cst (len, 1),
3333 builtin_memset_read_str,
3337 val = fold (build1 (CONVERT_EXPR, unsigned_char_type_node, val));
3338 val_rtx = expand_expr (val, NULL_RTX, VOIDmode, 0);
3339 val_rtx = force_reg (TYPE_MODE (unsigned_char_type_node),
3341 dest_mem = get_memory_rtx (dest);
3342 store_by_pieces (dest_mem, tree_low_cst (len, 1),
3343 builtin_memset_gen_str,
3344 val_rtx, dest_align, 0);
3345 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3346 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3350 if (target_char_cast (val, &c))
3355 if (!host_integerp (len, 1))
3357 if (!can_store_by_pieces (tree_low_cst (len, 1),
3358 builtin_memset_read_str, &c,
3362 dest_mem = get_memory_rtx (dest);
3363 store_by_pieces (dest_mem, tree_low_cst (len, 1),
3364 builtin_memset_read_str,
3366 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3367 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3371 len_rtx = expand_expr (len, NULL_RTX, VOIDmode, 0);
3373 dest_mem = get_memory_rtx (dest);
3374 set_mem_align (dest_mem, dest_align);
3375 dest_addr = clear_storage (dest_mem, len_rtx);
3379 dest_addr = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3380 dest_addr = convert_memory_address (ptr_mode, dest_addr);
3387 /* Expand expression EXP, which is a call to the bzero builtin. Return 0
3388 if we failed the caller should emit a normal call. */
3391 expand_builtin_bzero (tree arglist)
3393 tree dest, size, newarglist;
3395 if (!validate_arglist (arglist, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3398 dest = TREE_VALUE (arglist);
3399 size = TREE_VALUE (TREE_CHAIN (arglist));
3401 /* New argument list transforming bzero(ptr x, int y) to
3402 memset(ptr x, int 0, size_t y). This is done this way
3403 so that if it isn't expanded inline, we fallback to
3404 calling bzero instead of memset. */
3406 newarglist = build_tree_list (NULL_TREE, fold_convert (sizetype, size));
3407 newarglist = tree_cons (NULL_TREE, integer_zero_node, newarglist);
3408 newarglist = tree_cons (NULL_TREE, dest, newarglist);
3410 return expand_builtin_memset (newarglist, const0_rtx, VOIDmode);
3413 /* Expand expression EXP, which is a call to the memcmp built-in function.
3414 ARGLIST is the argument list for this call. Return 0 if we failed and the
3415 caller should emit a normal call, otherwise try to get the result in
3416 TARGET, if convenient (and in mode MODE, if that's convenient). */
3419 expand_builtin_memcmp (tree exp ATTRIBUTE_UNUSED, tree arglist, rtx target,
3420 enum machine_mode mode)
3422 tree arg1, arg2, len;
3423 const char *p1, *p2;
3425 if (!validate_arglist (arglist,
3426 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3429 arg1 = TREE_VALUE (arglist);
3430 arg2 = TREE_VALUE (TREE_CHAIN (arglist));
3431 len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
3433 /* If the len parameter is zero, return zero. */
3434 if (integer_zerop (len))
3436 /* Evaluate and ignore arg1 and arg2 in case they have
3438 expand_expr (arg1, const0_rtx, VOIDmode, EXPAND_NORMAL);
3439 expand_expr (arg2, const0_rtx, VOIDmode, EXPAND_NORMAL);
3443 /* If both arguments are equal (and not volatile), return zero. */
3444 if (operand_equal_p (arg1, arg2, 0))
3446 /* Evaluate and ignore len in case it has side-effects. */
3447 expand_expr (len, const0_rtx, VOIDmode, EXPAND_NORMAL);
3451 p1 = c_getstr (arg1);
3452 p2 = c_getstr (arg2);
3454 /* If all arguments are constant, and the value of len is not greater
3455 than the lengths of arg1 and arg2, evaluate at compile-time. */
3456 if (host_integerp (len, 1) && p1 && p2
3457 && compare_tree_int (len, strlen (p1) + 1) <= 0
3458 && compare_tree_int (len, strlen (p2) + 1) <= 0)
3460 const int r = memcmp (p1, p2, tree_low_cst (len, 1));
3462 return (r < 0 ? constm1_rtx : (r > 0 ? const1_rtx : const0_rtx));
3465 /* If len parameter is one, return an expression corresponding to
3466 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
3467 if (integer_onep (len))
3469 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
3470 tree cst_uchar_ptr_node = build_pointer_type (cst_uchar_node);
3472 fold (build1 (CONVERT_EXPR, integer_type_node,
3473 build1 (INDIRECT_REF, cst_uchar_node,
3474 fold_convert (cst_uchar_ptr_node, arg1))));
3476 fold (build1 (CONVERT_EXPR, integer_type_node,
3477 build1 (INDIRECT_REF, cst_uchar_node,
3478 fold_convert (cst_uchar_ptr_node, arg2))));
3479 tree result = fold (build2 (MINUS_EXPR, integer_type_node, ind1, ind2));
3480 return expand_expr (result, target, mode, EXPAND_NORMAL);
3483 #if defined HAVE_cmpmemsi || defined HAVE_cmpstrsi
3485 rtx arg1_rtx, arg2_rtx, arg3_rtx;
3490 = get_pointer_alignment (arg1, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3492 = get_pointer_alignment (arg2, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3493 enum machine_mode insn_mode;
3495 #ifdef HAVE_cmpmemsi
3497 insn_mode = insn_data[(int) CODE_FOR_cmpmemsi].operand[0].mode;
3500 #ifdef HAVE_cmpstrsi
3502 insn_mode = insn_data[(int) CODE_FOR_cmpstrsi].operand[0].mode;
3507 /* If we don't have POINTER_TYPE, call the function. */
3508 if (arg1_align == 0 || arg2_align == 0)
3511 /* Make a place to write the result of the instruction. */
3514 && REG_P (result) && GET_MODE (result) == insn_mode
3515 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
3516 result = gen_reg_rtx (insn_mode);
3518 arg1_rtx = get_memory_rtx (arg1);
3519 arg2_rtx = get_memory_rtx (arg2);
3520 arg3_rtx = expand_expr (len, NULL_RTX, VOIDmode, 0);
3521 #ifdef HAVE_cmpmemsi
3523 insn = gen_cmpmemsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
3524 GEN_INT (MIN (arg1_align, arg2_align)));
3527 #ifdef HAVE_cmpstrsi
3529 insn = gen_cmpstrsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
3530 GEN_INT (MIN (arg1_align, arg2_align)));
3538 emit_library_call_value (memcmp_libfunc, result, LCT_PURE_MAKE_BLOCK,
3539 TYPE_MODE (integer_type_node), 3,
3540 XEXP (arg1_rtx, 0), Pmode,
3541 XEXP (arg2_rtx, 0), Pmode,
3542 convert_to_mode (TYPE_MODE (sizetype), arg3_rtx,
3543 TYPE_UNSIGNED (sizetype)),
3544 TYPE_MODE (sizetype));
3546 /* Return the value in the proper mode for this function. */
3547 mode = TYPE_MODE (TREE_TYPE (exp));
3548 if (GET_MODE (result) == mode)
3550 else if (target != 0)
3552 convert_move (target, result, 0);
3556 return convert_to_mode (mode, result, 0);
3563 /* Expand expression EXP, which is a call to the strcmp builtin. Return 0
3564 if we failed the caller should emit a normal call, otherwise try to get
3565 the result in TARGET, if convenient. */
3568 expand_builtin_strcmp (tree exp, rtx target, enum machine_mode mode)
3570 tree arglist = TREE_OPERAND (exp, 1);
3572 const char *p1, *p2;
3574 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3577 arg1 = TREE_VALUE (arglist);
3578 arg2 = TREE_VALUE (TREE_CHAIN (arglist));
3580 /* If both arguments are equal (and not volatile), return zero. */
3581 if (operand_equal_p (arg1, arg2, 0))
3584 p1 = c_getstr (arg1);
3585 p2 = c_getstr (arg2);
3589 const int i = strcmp (p1, p2);
3590 return (i < 0 ? constm1_rtx : (i > 0 ? const1_rtx : const0_rtx));
3593 /* If either arg is "", return an expression corresponding to
3594 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
3595 if ((p1 && *p1 == '\0') || (p2 && *p2 == '\0'))
3597 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
3598 tree cst_uchar_ptr_node = build_pointer_type (cst_uchar_node);
3600 fold (build1 (CONVERT_EXPR, integer_type_node,
3601 build1 (INDIRECT_REF, cst_uchar_node,
3602 fold_convert (cst_uchar_ptr_node, arg1))));
3604 fold (build1 (CONVERT_EXPR, integer_type_node,
3605 build1 (INDIRECT_REF, cst_uchar_node,
3606 fold_convert (cst_uchar_ptr_node, arg2))));
3607 tree result = fold (build2 (MINUS_EXPR, integer_type_node, ind1, ind2));
3608 return expand_expr (result, target, mode, EXPAND_NORMAL);
3611 #ifdef HAVE_cmpstrsi
3614 tree len, len1, len2;
3615 rtx arg1_rtx, arg2_rtx, arg3_rtx;
3620 = get_pointer_alignment (arg1, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3622 = get_pointer_alignment (arg2, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3623 enum machine_mode insn_mode
3624 = insn_data[(int) CODE_FOR_cmpstrsi].operand[0].mode;
3626 len1 = c_strlen (arg1, 1);
3627 len2 = c_strlen (arg2, 1);
3630 len1 = size_binop (PLUS_EXPR, ssize_int (1), len1);
3632 len2 = size_binop (PLUS_EXPR, ssize_int (1), len2);
3634 /* If we don't have a constant length for the first, use the length
3635 of the second, if we know it. We don't require a constant for
3636 this case; some cost analysis could be done if both are available
3637 but neither is constant. For now, assume they're equally cheap,
3638 unless one has side effects. If both strings have constant lengths,
3645 else if (TREE_SIDE_EFFECTS (len1))
3647 else if (TREE_SIDE_EFFECTS (len2))
3649 else if (TREE_CODE (len1) != INTEGER_CST)
3651 else if (TREE_CODE (len2) != INTEGER_CST)
3653 else if (tree_int_cst_lt (len1, len2))
3658 /* If both arguments have side effects, we cannot optimize. */
3659 if (!len || TREE_SIDE_EFFECTS (len))
3662 /* If we don't have POINTER_TYPE, call the function. */
3663 if (arg1_align == 0 || arg2_align == 0)
3666 /* Make a place to write the result of the instruction. */
3669 && REG_P (result) && GET_MODE (result) == insn_mode
3670 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
3671 result = gen_reg_rtx (insn_mode);
3673 /* Stabilize the arguments in case gen_cmpstrsi fails. */
3674 arg1 = builtin_save_expr (arg1);
3675 arg2 = builtin_save_expr (arg2);
3677 arg1_rtx = get_memory_rtx (arg1);
3678 arg2_rtx = get_memory_rtx (arg2);
3679 arg3_rtx = expand_expr (len, NULL_RTX, VOIDmode, 0);
3680 insn = gen_cmpstrsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
3681 GEN_INT (MIN (arg1_align, arg2_align)));
3686 /* Return the value in the proper mode for this function. */
3687 mode = TYPE_MODE (TREE_TYPE (exp));
3688 if (GET_MODE (result) == mode)
3691 return convert_to_mode (mode, result, 0);
3692 convert_move (target, result, 0);
3696 /* Expand the library call ourselves using a stabilized argument
3697 list to avoid re-evaluating the function's arguments twice. */
3698 arglist = build_tree_list (NULL_TREE, arg2);
3699 arglist = tree_cons (NULL_TREE, arg1, arglist);
3700 fndecl = get_callee_fndecl (exp);
3701 exp = build_function_call_expr (fndecl, arglist);
3702 return expand_call (exp, target, target == const0_rtx);
3708 /* Expand expression EXP, which is a call to the strncmp builtin. Return 0
3709 if we failed the caller should emit a normal call, otherwise try to get
3710 the result in TARGET, if convenient. */
3713 expand_builtin_strncmp (tree exp, rtx target, enum machine_mode mode)
3715 tree arglist = TREE_OPERAND (exp, 1);
3716 tree arg1, arg2, arg3;
3717 const char *p1, *p2;
3719 if (!validate_arglist (arglist,
3720 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3723 arg1 = TREE_VALUE (arglist);
3724 arg2 = TREE_VALUE (TREE_CHAIN (arglist));
3725 arg3 = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
3727 /* If the len parameter is zero, return zero. */
3728 if (integer_zerop (arg3))
3730 /* Evaluate and ignore arg1 and arg2 in case they have
3732 expand_expr (arg1, const0_rtx, VOIDmode, EXPAND_NORMAL);
3733 expand_expr (arg2, const0_rtx, VOIDmode, EXPAND_NORMAL);
3737 /* If arg1 and arg2 are equal (and not volatile), return zero. */
3738 if (operand_equal_p (arg1, arg2, 0))
3740 /* Evaluate and ignore arg3 in case it has side-effects. */
3741 expand_expr (arg3, const0_rtx, VOIDmode, EXPAND_NORMAL);
3745 p1 = c_getstr (arg1);
3746 p2 = c_getstr (arg2);
3748 /* If all arguments are constant, evaluate at compile-time. */
3749 if (host_integerp (arg3, 1) && p1 && p2)
3751 const int r = strncmp (p1, p2, tree_low_cst (arg3, 1));
3752 return (r < 0 ? constm1_rtx : (r > 0 ? const1_rtx : const0_rtx));
3755 /* If len == 1 or (either string parameter is "" and (len >= 1)),
3756 return (*(const u_char*)arg1 - *(const u_char*)arg2). */
3757 if (host_integerp (arg3, 1)
3758 && (tree_low_cst (arg3, 1) == 1
3759 || (tree_low_cst (arg3, 1) > 1
3760 && ((p1 && *p1 == '\0') || (p2 && *p2 == '\0')))))
3762 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
3763 tree cst_uchar_ptr_node = build_pointer_type (cst_uchar_node);
3765 fold (build1 (CONVERT_EXPR, integer_type_node,
3766 build1 (INDIRECT_REF, cst_uchar_node,
3767 fold_convert (cst_uchar_ptr_node, arg1))));
3769 fold (build1 (CONVERT_EXPR, integer_type_node,
3770 build1 (INDIRECT_REF, cst_uchar_node,
3771 fold_convert (cst_uchar_ptr_node, arg2))));
3772 tree result = fold (build2 (MINUS_EXPR, integer_type_node, ind1, ind2));
3773 return expand_expr (result, target, mode, EXPAND_NORMAL);
3776 /* If c_strlen can determine an expression for one of the string
3777 lengths, and it doesn't have side effects, then emit cmpstrsi
3778 using length MIN(strlen(string)+1, arg3). */
3779 #ifdef HAVE_cmpstrsi
3782 tree len, len1, len2;
3783 rtx arg1_rtx, arg2_rtx, arg3_rtx;
3788 = get_pointer_alignment (arg1, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3790 = get_pointer_alignment (arg2, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3791 enum machine_mode insn_mode
3792 = insn_data[(int) CODE_FOR_cmpstrsi].operand[0].mode;
3794 len1 = c_strlen (arg1, 1);
3795 len2 = c_strlen (arg2, 1);
3798 len1 = size_binop (PLUS_EXPR, ssize_int (1), len1);
3800 len2 = size_binop (PLUS_EXPR, ssize_int (1), len2);
3802 /* If we don't have a constant length for the first, use the length
3803 of the second, if we know it. We don't require a constant for
3804 this case; some cost analysis could be done if both are available
3805 but neither is constant. For now, assume they're equally cheap,
3806 unless one has side effects. If both strings have constant lengths,
3813 else if (TREE_SIDE_EFFECTS (len1))
3815 else if (TREE_SIDE_EFFECTS (len2))
3817 else if (TREE_CODE (len1) != INTEGER_CST)
3819 else if (TREE_CODE (len2) != INTEGER_CST)
3821 else if (tree_int_cst_lt (len1, len2))
3826 /* If both arguments have side effects, we cannot optimize. */
3827 if (!len || TREE_SIDE_EFFECTS (len))
3830 /* The actual new length parameter is MIN(len,arg3). */
3831 len = fold (build2 (MIN_EXPR, TREE_TYPE (len), len,
3832 fold_convert (TREE_TYPE (len), arg3)));
3834 /* If we don't have POINTER_TYPE, call the function. */
3835 if (arg1_align == 0 || arg2_align == 0)
3838 /* Make a place to write the result of the instruction. */
3841 && REG_P (result) && GET_MODE (result) == insn_mode
3842 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
3843 result = gen_reg_rtx (insn_mode);
3845 /* Stabilize the arguments in case gen_cmpstrsi fails. */
3846 arg1 = builtin_save_expr (arg1);
3847 arg2 = builtin_save_expr (arg2);
3848 len = builtin_save_expr (len);
3850 arg1_rtx = get_memory_rtx (arg1);
3851 arg2_rtx = get_memory_rtx (arg2);
3852 arg3_rtx = expand_expr (len, NULL_RTX, VOIDmode, 0);
3853 insn = gen_cmpstrsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
3854 GEN_INT (MIN (arg1_align, arg2_align)));
3859 /* Return the value in the proper mode for this function. */
3860 mode = TYPE_MODE (TREE_TYPE (exp));
3861 if (GET_MODE (result) == mode)
3864 return convert_to_mode (mode, result, 0);
3865 convert_move (target, result, 0);
3869 /* Expand the library call ourselves using a stabilized argument
3870 list to avoid re-evaluating the function's arguments twice. */
3871 arglist = build_tree_list (NULL_TREE, len);
3872 arglist = tree_cons (NULL_TREE, arg2, arglist);
3873 arglist = tree_cons (NULL_TREE, arg1, arglist);
3874 fndecl = get_callee_fndecl (exp);
3875 exp = build_function_call_expr (fndecl, arglist);
3876 return expand_call (exp, target, target == const0_rtx);
3882 /* Expand expression EXP, which is a call to the strcat builtin.
3883 Return 0 if we failed the caller should emit a normal call,
3884 otherwise try to get the result in TARGET, if convenient. */
3887 expand_builtin_strcat (tree arglist, rtx target, enum machine_mode mode)
3889 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3893 tree dst = TREE_VALUE (arglist),
3894 src = TREE_VALUE (TREE_CHAIN (arglist));
3895 const char *p = c_getstr (src);
3899 /* If the string length is zero, return the dst parameter. */
3901 return expand_expr (dst, target, mode, EXPAND_NORMAL);
3902 else if (!optimize_size)
3904 /* Otherwise if !optimize_size, see if we can store by
3905 pieces into (dst + strlen(dst)). */
3906 tree newdst, arglist,
3907 strlen_fn = implicit_built_in_decls[BUILT_IN_STRLEN];
3909 /* This is the length argument. */
3910 arglist = build_tree_list (NULL_TREE,
3911 fold (size_binop (PLUS_EXPR,
3914 /* Prepend src argument. */
3915 arglist = tree_cons (NULL_TREE, src, arglist);
3917 /* We're going to use dst more than once. */
3918 dst = builtin_save_expr (dst);
3920 /* Create strlen (dst). */
3922 fold (build_function_call_expr (strlen_fn,
3923 build_tree_list (NULL_TREE,
3925 /* Create (dst + strlen (dst)). */
3926 newdst = fold (build2 (PLUS_EXPR, TREE_TYPE (dst), dst, newdst));
3928 /* Prepend the new dst argument. */
3929 arglist = tree_cons (NULL_TREE, newdst, arglist);
3931 /* We don't want to get turned into a memcpy if the
3932 target is const0_rtx, i.e. when the return value
3933 isn't used. That would produce pessimized code so
3934 pass in a target of zero, it should never actually be
3935 used. If this was successful return the original
3936 dst, not the result of mempcpy. */
3937 if (expand_builtin_mempcpy (arglist, /*target=*/0, mode, /*endp=*/0))
3938 return expand_expr (dst, target, mode, EXPAND_NORMAL);
3948 /* Expand expression EXP, which is a call to the strncat builtin.
3949 Return 0 if we failed the caller should emit a normal call,
3950 otherwise try to get the result in TARGET, if convenient. */
3953 expand_builtin_strncat (tree arglist, rtx target, enum machine_mode mode)
3955 if (!validate_arglist (arglist,
3956 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3960 tree dst = TREE_VALUE (arglist),
3961 src = TREE_VALUE (TREE_CHAIN (arglist)),
3962 len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
3963 const char *p = c_getstr (src);
3965 /* If the requested length is zero, or the src parameter string
3966 length is zero, return the dst parameter. */
3967 if (integer_zerop (len) || (p && *p == '\0'))
3969 /* Evaluate and ignore the src and len parameters in case
3970 they have side-effects. */
3971 expand_expr (src, const0_rtx, VOIDmode, EXPAND_NORMAL);
3972 expand_expr (len, const0_rtx, VOIDmode, EXPAND_NORMAL);
3973 return expand_expr (dst, target, mode, EXPAND_NORMAL);
3976 /* If the requested len is greater than or equal to the string
3977 length, call strcat. */
3978 if (TREE_CODE (len) == INTEGER_CST && p
3979 && compare_tree_int (len, strlen (p)) >= 0)
3982 = tree_cons (NULL_TREE, dst, build_tree_list (NULL_TREE, src));
3983 tree fn = implicit_built_in_decls[BUILT_IN_STRCAT];
3985 /* If the replacement _DECL isn't initialized, don't do the
3990 return expand_expr (build_function_call_expr (fn, newarglist),
3991 target, mode, EXPAND_NORMAL);
3997 /* Expand expression EXP, which is a call to the strspn builtin.
3998 Return 0 if we failed the caller should emit a normal call,
3999 otherwise try to get the result in TARGET, if convenient. */
4002 expand_builtin_strspn (tree arglist, rtx target, enum machine_mode mode)
4004 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
4008 tree s1 = TREE_VALUE (arglist), s2 = TREE_VALUE (TREE_CHAIN (arglist));
4009 const char *p1 = c_getstr (s1), *p2 = c_getstr (s2);
4011 /* If both arguments are constants, evaluate at compile-time. */
4014 const size_t r = strspn (p1, p2);
4015 return expand_expr (size_int (r), target, mode, EXPAND_NORMAL);
4018 /* If either argument is "", return 0. */
4019 if ((p1 && *p1 == '\0') || (p2 && *p2 == '\0'))
4021 /* Evaluate and ignore both arguments in case either one has
4023 expand_expr (s1, const0_rtx, VOIDmode, EXPAND_NORMAL);
4024 expand_expr (s2, const0_rtx, VOIDmode, EXPAND_NORMAL);
4031 /* Expand expression EXP, which is a call to the strcspn builtin.
4032 Return 0 if we failed the caller should emit a normal call,
4033 otherwise try to get the result in TARGET, if convenient. */
4036 expand_builtin_strcspn (tree arglist, rtx target, enum machine_mode mode)
4038 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
4042 tree s1 = TREE_VALUE (arglist), s2 = TREE_VALUE (TREE_CHAIN (arglist));
4043 const char *p1 = c_getstr (s1), *p2 = c_getstr (s2);
4045 /* If both arguments are constants, evaluate at compile-time. */
4048 const size_t r = strcspn (p1, p2);
4049 return expand_expr (size_int (r), target, mode, EXPAND_NORMAL);
4052 /* If the first argument is "", return 0. */
4053 if (p1 && *p1 == '\0')
4055 /* Evaluate and ignore argument s2 in case it has
4057 expand_expr (s2, const0_rtx, VOIDmode, EXPAND_NORMAL);
4061 /* If the second argument is "", return __builtin_strlen(s1). */
4062 if (p2 && *p2 == '\0')
4064 tree newarglist = build_tree_list (NULL_TREE, s1),
4065 fn = implicit_built_in_decls[BUILT_IN_STRLEN];
4067 /* If the replacement _DECL isn't initialized, don't do the
4072 return expand_expr (build_function_call_expr (fn, newarglist),
4073 target, mode, EXPAND_NORMAL);
4079 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
4080 if that's convenient. */
4083 expand_builtin_saveregs (void)
4087 /* Don't do __builtin_saveregs more than once in a function.
4088 Save the result of the first call and reuse it. */
4089 if (saveregs_value != 0)
4090 return saveregs_value;
4092 /* When this function is called, it means that registers must be
4093 saved on entry to this function. So we migrate the call to the
4094 first insn of this function. */
4098 /* Do whatever the machine needs done in this case. */
4099 val = targetm.calls.expand_builtin_saveregs ();
4104 saveregs_value = val;
4106 /* Put the insns after the NOTE that starts the function. If this
4107 is inside a start_sequence, make the outer-level insn chain current, so
4108 the code is placed at the start of the function. */
4109 push_topmost_sequence ();
4110 emit_insn_after (seq, entry_of_function ());
4111 pop_topmost_sequence ();
4116 /* __builtin_args_info (N) returns word N of the arg space info
4117 for the current function. The number and meanings of words
4118 is controlled by the definition of CUMULATIVE_ARGS. */
4121 expand_builtin_args_info (tree arglist)
4123 int nwords = sizeof (CUMULATIVE_ARGS) / sizeof (int);
4124 int *word_ptr = (int *) ¤t_function_args_info;
4126 gcc_assert (sizeof (CUMULATIVE_ARGS) % sizeof (int) == 0);
4130 if (!host_integerp (TREE_VALUE (arglist), 0))
4131 error ("argument of `__builtin_args_info' must be constant");
4134 HOST_WIDE_INT wordnum = tree_low_cst (TREE_VALUE (arglist), 0);
4136 if (wordnum < 0 || wordnum >= nwords)
4137 error ("argument of `__builtin_args_info' out of range");
4139 return GEN_INT (word_ptr[wordnum]);
4143 error ("missing argument in `__builtin_args_info'");
4148 /* Expand ARGLIST, from a call to __builtin_next_arg. */
4151 expand_builtin_next_arg (tree arglist)
4153 tree fntype = TREE_TYPE (current_function_decl);
4155 if (TYPE_ARG_TYPES (fntype) == 0
4156 || (TREE_VALUE (tree_last (TYPE_ARG_TYPES (fntype)))
4159 error ("`va_start' used in function with fixed args");
4165 tree last_parm = tree_last (DECL_ARGUMENTS (current_function_decl));
4166 tree arg = TREE_VALUE (arglist);
4168 /* Strip off all nops for the sake of the comparison. This
4169 is not quite the same as STRIP_NOPS. It does more.
4170 We must also strip off INDIRECT_EXPR for C++ reference
4172 while (TREE_CODE (arg) == NOP_EXPR
4173 || TREE_CODE (arg) == CONVERT_EXPR
4174 || TREE_CODE (arg) == NON_LVALUE_EXPR
4175 || TREE_CODE (arg) == INDIRECT_REF)
4176 arg = TREE_OPERAND (arg, 0);
4177 if (arg != last_parm)
4178 warning ("second parameter of `va_start' not last named argument");
4181 /* Evidently an out of date version of <stdarg.h>; can't validate
4182 va_start's second argument, but can still work as intended. */
4183 warning ("`__builtin_next_arg' called without an argument");
4185 return expand_binop (Pmode, add_optab,
4186 current_function_internal_arg_pointer,
4187 current_function_arg_offset_rtx,
4188 NULL_RTX, 0, OPTAB_LIB_WIDEN);
4191 /* Make it easier for the backends by protecting the valist argument
4192 from multiple evaluations. */
4195 stabilize_va_list (tree valist, int needs_lvalue)
4197 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
4199 if (TREE_SIDE_EFFECTS (valist))
4200 valist = save_expr (valist);
4202 /* For this case, the backends will be expecting a pointer to
4203 TREE_TYPE (va_list_type_node), but it's possible we've
4204 actually been given an array (an actual va_list_type_node).
4206 if (TREE_CODE (TREE_TYPE (valist)) == ARRAY_TYPE)
4208 tree p1 = build_pointer_type (TREE_TYPE (va_list_type_node));
4209 valist = build_fold_addr_expr_with_type (valist, p1);
4218 if (! TREE_SIDE_EFFECTS (valist))
4221 pt = build_pointer_type (va_list_type_node);
4222 valist = fold (build1 (ADDR_EXPR, pt, valist));
4223 TREE_SIDE_EFFECTS (valist) = 1;
4226 if (TREE_SIDE_EFFECTS (valist))
4227 valist = save_expr (valist);
4228 valist = build_fold_indirect_ref (valist);
4234 /* The "standard" definition of va_list is void*. */
4237 std_build_builtin_va_list (void)
4239 return ptr_type_node;
4242 /* The "standard" implementation of va_start: just assign `nextarg' to
4246 std_expand_builtin_va_start (tree valist, rtx nextarg)
4250 t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist,
4251 make_tree (ptr_type_node, nextarg));
4252 TREE_SIDE_EFFECTS (t) = 1;
4254 expand_expr (t, const0_rtx, VOIDmode, EXPAND_NORMAL);
4257 /* Expand ARGLIST, from a call to __builtin_va_start. */
4260 expand_builtin_va_start (tree arglist)
4265 chain = TREE_CHAIN (arglist);
4267 if (TREE_CHAIN (chain))
4268 error ("too many arguments to function `va_start'");
4270 nextarg = expand_builtin_next_arg (chain);
4271 valist = stabilize_va_list (TREE_VALUE (arglist), 1);
4273 #ifdef EXPAND_BUILTIN_VA_START
4274 EXPAND_BUILTIN_VA_START (valist, nextarg);
4276 std_expand_builtin_va_start (valist, nextarg);
4282 /* The "standard" implementation of va_arg: read the value from the
4283 current (padded) address and increment by the (padded) size. */
4286 std_gimplify_va_arg_expr (tree valist, tree type, tree *pre_p, tree *post_p)
4288 tree addr, t, type_size, rounded_size, valist_tmp;
4289 unsigned HOST_WIDE_INT align, boundary;
4292 #ifdef ARGS_GROW_DOWNWARD
4293 /* All of the alignment and movement below is for args-grow-up machines.
4294 As of 2004, there are only 3 ARGS_GROW_DOWNWARD targets, and they all
4295 implement their own specialized gimplify_va_arg_expr routines. */
4299 indirect = pass_by_reference (NULL, TYPE_MODE (type), type, false);
4301 type = build_pointer_type (type);
4303 align = PARM_BOUNDARY / BITS_PER_UNIT;
4304 boundary = FUNCTION_ARG_BOUNDARY (TYPE_MODE (type), type) / BITS_PER_UNIT;
4306 /* Hoist the valist value into a temporary for the moment. */
4307 valist_tmp = get_initialized_tmp_var (valist, pre_p, NULL);
4309 /* va_list pointer is aligned to PARM_BOUNDARY. If argument actually
4310 requires greater alignment, we must perform dynamic alignment. */
4311 if (boundary > align)
4313 t = fold_convert (TREE_TYPE (valist), size_int (boundary - 1));
4314 t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist_tmp,
4315 build2 (PLUS_EXPR, TREE_TYPE (valist), valist_tmp, t));
4316 gimplify_and_add (t, pre_p);
4318 t = fold_convert (TREE_TYPE (valist), size_int (-boundary));
4319 t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist_tmp,
4320 build2 (BIT_AND_EXPR, TREE_TYPE (valist), valist_tmp, t));
4321 gimplify_and_add (t, pre_p);
4324 /* Compute the rounded size of the type. */
4325 type_size = size_in_bytes (type);
4326 rounded_size = round_up (type_size, align);
4328 /* Reduce rounded_size so it's sharable with the postqueue. */
4329 gimplify_expr (&rounded_size, pre_p, post_p, is_gimple_val, fb_rvalue);
4333 if (PAD_VARARGS_DOWN && !integer_zerop (rounded_size))
4335 /* Small args are padded downward. */
4336 t = fold (build2 (GT_EXPR, sizetype, rounded_size, size_int (align)));
4337 t = fold (build3 (COND_EXPR, sizetype, t, size_zero_node,
4338 size_binop (MINUS_EXPR, rounded_size, type_size)));
4339 t = fold_convert (TREE_TYPE (addr), t);
4340 addr = fold (build2 (PLUS_EXPR, TREE_TYPE (addr), addr, t));
4343 /* Compute new value for AP. */
4344 t = fold_convert (TREE_TYPE (valist), rounded_size);
4345 t = build2 (PLUS_EXPR, TREE_TYPE (valist), valist_tmp, t);
4346 t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist, t);
4347 gimplify_and_add (t, pre_p);
4349 addr = fold_convert (build_pointer_type (type), addr);
4353 addr = build_fold_indirect_ref (addr);
4354 if (flag_mudflap) /* Don't instrument va_arg INDIRECT_REF. */
4358 addr = build_fold_indirect_ref (addr);
4359 if (flag_mudflap) /* Don't instrument va_arg INDIRECT_REF. */
4365 /* Return a dummy expression of type TYPE in order to keep going after an
4369 dummy_object (tree type)
4371 tree t = convert (build_pointer_type (type), null_pointer_node);
4372 return build1 (INDIRECT_REF, type, t);
4375 /* Gimplify __builtin_va_arg, aka VA_ARG_EXPR, which is not really a
4376 builtin function, but a very special sort of operator. */
4378 enum gimplify_status
4379 gimplify_va_arg_expr (tree *expr_p, tree *pre_p, tree *post_p)
4381 tree promoted_type, want_va_type, have_va_type;
4382 tree valist = TREE_OPERAND (*expr_p, 0);
4383 tree type = TREE_TYPE (*expr_p);
4386 /* Verify that valist is of the proper type. */
4387 want_va_type = va_list_type_node;
4388 have_va_type = TREE_TYPE (valist);
4390 if (have_va_type == error_mark_node)
4393 if (TREE_CODE (want_va_type) == ARRAY_TYPE)
4395 /* If va_list is an array type, the argument may have decayed
4396 to a pointer type, e.g. by being passed to another function.
4397 In that case, unwrap both types so that we can compare the
4398 underlying records. */
4399 if (TREE_CODE (have_va_type) == ARRAY_TYPE
4400 || TREE_CODE (have_va_type) == POINTER_TYPE)
4402 want_va_type = TREE_TYPE (want_va_type);
4403 have_va_type = TREE_TYPE (have_va_type);
4407 if (TYPE_MAIN_VARIANT (want_va_type) != TYPE_MAIN_VARIANT (have_va_type))
4409 error ("first argument to `va_arg' not of type `va_list'");
4413 /* Generate a diagnostic for requesting data of a type that cannot
4414 be passed through `...' due to type promotion at the call site. */
4415 else if ((promoted_type = lang_hooks.types.type_promotes_to (type))
4418 static bool gave_help;
4420 /* Unfortunately, this is merely undefined, rather than a constraint
4421 violation, so we cannot make this an error. If this call is never
4422 executed, the program is still strictly conforming. */
4423 warning ("`%T' is promoted to `%T' when passed through `...'",
4424 type, promoted_type);
4428 warning ("(so you should pass `%T' not `%T' to `va_arg')",
4429 promoted_type, type);
4432 /* We can, however, treat "undefined" any way we please.
4433 Call abort to encourage the user to fix the program. */
4434 inform ("if this code is reached, the program will abort");
4435 t = build_function_call_expr (implicit_built_in_decls[BUILT_IN_TRAP],
4437 append_to_statement_list (t, pre_p);
4439 /* This is dead code, but go ahead and finish so that the
4440 mode of the result comes out right. */
4441 *expr_p = dummy_object (type);
4446 /* Make it easier for the backends by protecting the valist argument
4447 from multiple evaluations. */
4448 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
4450 /* For this case, the backends will be expecting a pointer to
4451 TREE_TYPE (va_list_type_node), but it's possible we've
4452 actually been given an array (an actual va_list_type_node).
4454 if (TREE_CODE (TREE_TYPE (valist)) == ARRAY_TYPE)
4456 tree p1 = build_pointer_type (TREE_TYPE (va_list_type_node));
4457 valist = build_fold_addr_expr_with_type (valist, p1);
4459 gimplify_expr (&valist, pre_p, post_p, is_gimple_val, fb_rvalue);
4462 gimplify_expr (&valist, pre_p, post_p, is_gimple_min_lval, fb_lvalue);
4464 if (!targetm.gimplify_va_arg_expr)
4465 /* Once most targets are converted this should abort. */
4468 *expr_p = targetm.gimplify_va_arg_expr (valist, type, pre_p, post_p);
4473 /* Expand ARGLIST, from a call to __builtin_va_end. */
4476 expand_builtin_va_end (tree arglist)
4478 tree valist = TREE_VALUE (arglist);
4480 /* Evaluate for side effects, if needed. I hate macros that don't
4482 if (TREE_SIDE_EFFECTS (valist))
4483 expand_expr (valist, const0_rtx, VOIDmode, EXPAND_NORMAL);
4488 /* Expand ARGLIST, from a call to __builtin_va_copy. We do this as a
4489 builtin rather than just as an assignment in stdarg.h because of the
4490 nastiness of array-type va_list types. */
4493 expand_builtin_va_copy (tree arglist)
4497 dst = TREE_VALUE (arglist);
4498 src = TREE_VALUE (TREE_CHAIN (arglist));
4500 dst = stabilize_va_list (dst, 1);
4501 src = stabilize_va_list (src, 0);
4503 if (TREE_CODE (va_list_type_node) != ARRAY_TYPE)
4505 t = build2 (MODIFY_EXPR, va_list_type_node, dst, src);
4506 TREE_SIDE_EFFECTS (t) = 1;
4507 expand_expr (t, const0_rtx, VOIDmode, EXPAND_NORMAL);
4511 rtx dstb, srcb, size;
4513 /* Evaluate to pointers. */
4514 dstb = expand_expr (dst, NULL_RTX, Pmode, EXPAND_NORMAL);
4515 srcb = expand_expr (src, NULL_RTX, Pmode, EXPAND_NORMAL);
4516 size = expand_expr (TYPE_SIZE_UNIT (va_list_type_node), NULL_RTX,
4517 VOIDmode, EXPAND_NORMAL);
4519 dstb = convert_memory_address (Pmode, dstb);
4520 srcb = convert_memory_address (Pmode, srcb);
4522 /* "Dereference" to BLKmode memories. */
4523 dstb = gen_rtx_MEM (BLKmode, dstb);
4524 set_mem_alias_set (dstb, get_alias_set (TREE_TYPE (TREE_TYPE (dst))));
4525 set_mem_align (dstb, TYPE_ALIGN (va_list_type_node));
4526 srcb = gen_rtx_MEM (BLKmode, srcb);
4527 set_mem_alias_set (srcb, get_alias_set (TREE_TYPE (TREE_TYPE (src))));
4528 set_mem_align (srcb, TYPE_ALIGN (va_list_type_node));
4531 emit_block_move (dstb, srcb, size, BLOCK_OP_NORMAL);
4537 /* Expand a call to one of the builtin functions __builtin_frame_address or
4538 __builtin_return_address. */
4541 expand_builtin_frame_address (tree fndecl, tree arglist)
4543 /* The argument must be a nonnegative integer constant.
4544 It counts the number of frames to scan up the stack.
4545 The value is the return address saved in that frame. */
4547 /* Warning about missing arg was already issued. */
4549 else if (! host_integerp (TREE_VALUE (arglist), 1))
4551 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS)
4552 error ("invalid arg to `__builtin_frame_address'");
4554 error ("invalid arg to `__builtin_return_address'");
4560 = expand_builtin_return_addr (DECL_FUNCTION_CODE (fndecl),
4561 tree_low_cst (TREE_VALUE (arglist), 1),
4562 hard_frame_pointer_rtx);
4564 /* Some ports cannot access arbitrary stack frames. */
4567 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS)
4568 warning ("unsupported arg to `__builtin_frame_address'");
4570 warning ("unsupported arg to `__builtin_return_address'");
4574 /* For __builtin_frame_address, return what we've got. */
4575 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS)
4579 && ! CONSTANT_P (tem))
4580 tem = copy_to_mode_reg (Pmode, tem);
4585 /* Expand a call to the alloca builtin, with arguments ARGLIST. Return 0 if
4586 we failed and the caller should emit a normal call, otherwise try to get
4587 the result in TARGET, if convenient. */
4590 expand_builtin_alloca (tree arglist, rtx target)
4595 /* In -fmudflap-instrumented code, alloca() and __builtin_alloca()
4596 should always expand to function calls. These can be intercepted
4601 if (!validate_arglist (arglist, INTEGER_TYPE, VOID_TYPE))
4604 /* Compute the argument. */
4605 op0 = expand_expr (TREE_VALUE (arglist), NULL_RTX, VOIDmode, 0);
4607 /* Allocate the desired space. */
4608 result = allocate_dynamic_stack_space (op0, target, BITS_PER_UNIT);
4609 result = convert_memory_address (ptr_mode, result);
4614 /* Expand a call to a unary builtin. The arguments are in ARGLIST.
4615 Return 0 if a normal call should be emitted rather than expanding the
4616 function in-line. If convenient, the result should be placed in TARGET.
4617 SUBTARGET may be used as the target for computing one of EXP's operands. */
4620 expand_builtin_unop (enum machine_mode target_mode, tree arglist, rtx target,
4621 rtx subtarget, optab op_optab)
4624 if (!validate_arglist (arglist, INTEGER_TYPE, VOID_TYPE))
4627 /* Compute the argument. */
4628 op0 = expand_expr (TREE_VALUE (arglist), subtarget, VOIDmode, 0);
4629 /* Compute op, into TARGET if possible.
4630 Set TARGET to wherever the result comes back. */
4631 target = expand_unop (TYPE_MODE (TREE_TYPE (TREE_VALUE (arglist))),
4632 op_optab, op0, target, 1);
4633 gcc_assert (target);
4635 return convert_to_mode (target_mode, target, 0);
4638 /* If the string passed to fputs is a constant and is one character
4639 long, we attempt to transform this call into __builtin_fputc(). */
4642 expand_builtin_fputs (tree arglist, rtx target, bool unlocked)
4645 tree fn_fputc = unlocked ? implicit_built_in_decls[BUILT_IN_FPUTC_UNLOCKED]
4646 : implicit_built_in_decls[BUILT_IN_FPUTC];
4647 tree fn_fwrite = unlocked ? implicit_built_in_decls[BUILT_IN_FWRITE_UNLOCKED]
4648 : implicit_built_in_decls[BUILT_IN_FWRITE];
4650 /* If the return value is used, or the replacement _DECL isn't
4651 initialized, don't do the transformation. */
4652 if (target != const0_rtx || !fn_fputc || !fn_fwrite)
4655 /* Verify the arguments in the original call. */
4656 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
4659 /* Get the length of the string passed to fputs. If the length
4660 can't be determined, punt. */
4661 if (!(len = c_strlen (TREE_VALUE (arglist), 1))
4662 || TREE_CODE (len) != INTEGER_CST)
4665 switch (compare_tree_int (len, 1))
4667 case -1: /* length is 0, delete the call entirely . */
4669 /* Evaluate and ignore the argument in case it has
4671 expand_expr (TREE_VALUE (TREE_CHAIN (arglist)), const0_rtx,
4672 VOIDmode, EXPAND_NORMAL);
4675 case 0: /* length is 1, call fputc. */
4677 const char *p = c_getstr (TREE_VALUE (arglist));
4681 /* New argument list transforming fputs(string, stream) to
4682 fputc(string[0], stream). */
4683 arglist = build_tree_list (NULL_TREE,
4684 TREE_VALUE (TREE_CHAIN (arglist)));
4685 arglist = tree_cons (NULL_TREE,
4686 build_int_cst (NULL_TREE, p[0]),
4693 case 1: /* length is greater than 1, call fwrite. */
4697 /* If optimizing for size keep fputs. */
4700 string_arg = TREE_VALUE (arglist);
4701 /* New argument list transforming fputs(string, stream) to
4702 fwrite(string, 1, len, stream). */
4703 arglist = build_tree_list (NULL_TREE, TREE_VALUE (TREE_CHAIN (arglist)));
4704 arglist = tree_cons (NULL_TREE, len, arglist);
4705 arglist = tree_cons (NULL_TREE, size_one_node, arglist);
4706 arglist = tree_cons (NULL_TREE, string_arg, arglist);
4714 return expand_expr (build_function_call_expr (fn, arglist),
4715 const0_rtx, VOIDmode, EXPAND_NORMAL);
4718 /* Expand a call to __builtin_expect. We return our argument and emit a
4719 NOTE_INSN_EXPECTED_VALUE note. This is the expansion of __builtin_expect in
4720 a non-jump context. */
4723 expand_builtin_expect (tree arglist, rtx target)
4728 if (arglist == NULL_TREE
4729 || TREE_CHAIN (arglist) == NULL_TREE)
4731 exp = TREE_VALUE (arglist);
4732 c = TREE_VALUE (TREE_CHAIN (arglist));
4734 if (TREE_CODE (c) != INTEGER_CST)
4736 error ("second arg to `__builtin_expect' must be a constant");
4737 c = integer_zero_node;
4740 target = expand_expr (exp, target, VOIDmode, EXPAND_NORMAL);
4742 /* Don't bother with expected value notes for integral constants. */
4743 if (flag_guess_branch_prob && GET_CODE (target) != CONST_INT)
4745 /* We do need to force this into a register so that we can be
4746 moderately sure to be able to correctly interpret the branch
4748 target = force_reg (GET_MODE (target), target);
4750 rtx_c = expand_expr (c, NULL_RTX, GET_MODE (target), EXPAND_NORMAL);
4752 note = emit_note (NOTE_INSN_EXPECTED_VALUE);
4753 NOTE_EXPECTED_VALUE (note) = gen_rtx_EQ (VOIDmode, target, rtx_c);
4759 /* Like expand_builtin_expect, except do this in a jump context. This is
4760 called from do_jump if the conditional is a __builtin_expect. Return either
4761 a list of insns to emit the jump or NULL if we cannot optimize
4762 __builtin_expect. We need to optimize this at jump time so that machines
4763 like the PowerPC don't turn the test into a SCC operation, and then jump
4764 based on the test being 0/1. */
4767 expand_builtin_expect_jump (tree exp, rtx if_false_label, rtx if_true_label)
4769 tree arglist = TREE_OPERAND (exp, 1);
4770 tree arg0 = TREE_VALUE (arglist);
4771 tree arg1 = TREE_VALUE (TREE_CHAIN (arglist));
4774 /* Only handle __builtin_expect (test, 0) and
4775 __builtin_expect (test, 1). */
4776 if (TREE_CODE (TREE_TYPE (arg1)) == INTEGER_TYPE
4777 && (integer_zerop (arg1) || integer_onep (arg1)))
4779 rtx insn, drop_through_label, temp;
4781 /* Expand the jump insns. */
4783 do_jump (arg0, if_false_label, if_true_label);
4786 drop_through_label = get_last_insn ();
4787 if (drop_through_label && NOTE_P (drop_through_label))
4788 drop_through_label = prev_nonnote_insn (drop_through_label);
4789 if (drop_through_label && !LABEL_P (drop_through_label))
4790 drop_through_label = NULL_RTX;
4793 if (! if_true_label)
4794 if_true_label = drop_through_label;
4795 if (! if_false_label)
4796 if_false_label = drop_through_label;
4798 /* Go through and add the expect's to each of the conditional jumps. */
4800 while (insn != NULL_RTX)
4802 rtx next = NEXT_INSN (insn);
4804 if (JUMP_P (insn) && any_condjump_p (insn))
4806 rtx ifelse = SET_SRC (pc_set (insn));
4807 rtx then_dest = XEXP (ifelse, 1);
4808 rtx else_dest = XEXP (ifelse, 2);
4811 /* First check if we recognize any of the labels. */
4812 if (GET_CODE (then_dest) == LABEL_REF
4813 && XEXP (then_dest, 0) == if_true_label)
4815 else if (GET_CODE (then_dest) == LABEL_REF
4816 && XEXP (then_dest, 0) == if_false_label)
4818 else if (GET_CODE (else_dest) == LABEL_REF
4819 && XEXP (else_dest, 0) == if_false_label)
4821 else if (GET_CODE (else_dest) == LABEL_REF
4822 && XEXP (else_dest, 0) == if_true_label)
4824 /* Otherwise check where we drop through. */
4825 else if (else_dest == pc_rtx)
4827 if (next && NOTE_P (next))
4828 next = next_nonnote_insn (next);
4830 if (next && JUMP_P (next)
4831 && any_uncondjump_p (next))
4832 temp = XEXP (SET_SRC (pc_set (next)), 0);
4836 /* TEMP is either a CODE_LABEL, NULL_RTX or something
4837 else that can't possibly match either target label. */
4838 if (temp == if_false_label)
4840 else if (temp == if_true_label)
4843 else if (then_dest == pc_rtx)
4845 if (next && NOTE_P (next))
4846 next = next_nonnote_insn (next);
4848 if (next && JUMP_P (next)
4849 && any_uncondjump_p (next))
4850 temp = XEXP (SET_SRC (pc_set (next)), 0);
4854 if (temp == if_false_label)
4856 else if (temp == if_true_label)
4862 /* If the test is expected to fail, reverse the
4864 if (integer_zerop (arg1))
4866 predict_insn_def (insn, PRED_BUILTIN_EXPECT, taken);
4878 expand_builtin_trap (void)
4882 emit_insn (gen_trap ());
4885 emit_library_call (abort_libfunc, LCT_NORETURN, VOIDmode, 0);
4889 /* Expand a call to fabs, fabsf or fabsl with arguments ARGLIST.
4890 Return 0 if a normal call should be emitted rather than expanding
4891 the function inline. If convenient, the result should be placed
4892 in TARGET. SUBTARGET may be used as the target for computing
4896 expand_builtin_fabs (tree arglist, rtx target, rtx subtarget)
4898 enum machine_mode mode;
4902 if (!validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
4905 arg = TREE_VALUE (arglist);
4906 mode = TYPE_MODE (TREE_TYPE (arg));
4907 op0 = expand_expr (arg, subtarget, VOIDmode, 0);
4908 return expand_abs (mode, op0, target, 0, safe_from_p (target, arg, 1));
4911 /* Create a new constant string literal and return a char* pointer to it.
4912 The STRING_CST value is the LEN characters at STR. */
4914 build_string_literal (int len, const char *str)
4916 tree t, elem, index, type;
4918 t = build_string (len, str);
4919 elem = build_type_variant (char_type_node, 1, 0);
4920 index = build_index_type (build_int_cst (NULL_TREE, len - 1));
4921 type = build_array_type (elem, index);
4922 TREE_TYPE (t) = type;
4923 TREE_CONSTANT (t) = 1;
4924 TREE_INVARIANT (t) = 1;
4925 TREE_READONLY (t) = 1;
4926 TREE_STATIC (t) = 1;
4928 type = build_pointer_type (type);
4929 t = build1 (ADDR_EXPR, type, t);
4931 type = build_pointer_type (elem);
4932 t = build1 (NOP_EXPR, type, t);
4936 /* Expand a call to printf or printf_unlocked with argument list ARGLIST.
4937 Return 0 if a normal call should be emitted rather than transforming
4938 the function inline. If convenient, the result should be placed in
4939 TARGET with mode MODE. UNLOCKED indicates this is a printf_unlocked
4942 expand_builtin_printf (tree arglist, rtx target, enum machine_mode mode,
4945 tree fn_putchar = unlocked
4946 ? implicit_built_in_decls[BUILT_IN_PUTCHAR_UNLOCKED]
4947 : implicit_built_in_decls[BUILT_IN_PUTCHAR];
4948 tree fn_puts = unlocked ? implicit_built_in_decls[BUILT_IN_PUTS_UNLOCKED]
4949 : implicit_built_in_decls[BUILT_IN_PUTS];
4950 const char *fmt_str;
4953 /* If the return value is used, don't do the transformation. */
4954 if (target != const0_rtx)
4957 /* Verify the required arguments in the original call. */
4960 fmt = TREE_VALUE (arglist);
4961 if (TREE_CODE (TREE_TYPE (fmt)) != POINTER_TYPE)
4963 arglist = TREE_CHAIN (arglist);
4965 /* Check whether the format is a literal string constant. */
4966 fmt_str = c_getstr (fmt);
4967 if (fmt_str == NULL)
4970 /* If the format specifier was "%s\n", call __builtin_puts(arg). */
4971 if (strcmp (fmt_str, "%s\n") == 0)
4974 || TREE_CODE (TREE_TYPE (TREE_VALUE (arglist))) != POINTER_TYPE
4975 || TREE_CHAIN (arglist))
4979 /* If the format specifier was "%c", call __builtin_putchar(arg). */
4980 else if (strcmp (fmt_str, "%c") == 0)
4983 || TREE_CODE (TREE_TYPE (TREE_VALUE (arglist))) != INTEGER_TYPE
4984 || TREE_CHAIN (arglist))
4990 /* We can't handle anything else with % args or %% ... yet. */
4991 if (strchr (fmt_str, '%'))
4997 /* If the format specifier was "", printf does nothing. */
4998 if (fmt_str[0] == '\0')
5000 /* If the format specifier has length of 1, call putchar. */
5001 if (fmt_str[1] == '\0')
5003 /* Given printf("c"), (where c is any one character,)
5004 convert "c"[0] to an int and pass that to the replacement
5006 arg = build_int_cst (NULL_TREE, fmt_str[0]);
5007 arglist = build_tree_list (NULL_TREE, arg);
5012 /* If the format specifier was "string\n", call puts("string"). */
5013 size_t len = strlen (fmt_str);
5014 if (fmt_str[len - 1] == '\n')
5016 /* Create a NUL-terminated string that's one char shorter
5017 than the original, stripping off the trailing '\n'. */
5018 char *newstr = alloca (len);
5019 memcpy (newstr, fmt_str, len - 1);
5020 newstr[len - 1] = 0;
5022 arg = build_string_literal (len, newstr);
5023 arglist = build_tree_list (NULL_TREE, arg);
5027 /* We'd like to arrange to call fputs(string,stdout) here,
5028 but we need stdout and don't have a way to get it yet. */
5035 return expand_expr (build_function_call_expr (fn, arglist),
5036 target, mode, EXPAND_NORMAL);
5039 /* Expand a call to fprintf or fprintf_unlocked with argument list ARGLIST.
5040 Return 0 if a normal call should be emitted rather than transforming
5041 the function inline. If convenient, the result should be placed in
5042 TARGET with mode MODE. UNLOCKED indicates this is a fprintf_unlocked
5045 expand_builtin_fprintf (tree arglist, rtx target, enum machine_mode mode,
5048 tree fn_fputc = unlocked ? implicit_built_in_decls[BUILT_IN_FPUTC_UNLOCKED]
5049 : implicit_built_in_decls[BUILT_IN_FPUTC];
5050 tree fn_fputs = unlocked ? implicit_built_in_decls[BUILT_IN_FPUTS_UNLOCKED]
5051 : implicit_built_in_decls[BUILT_IN_FPUTS];
5052 const char *fmt_str;
5053 tree fn, fmt, fp, arg;
5055 /* If the return value is used, don't do the transformation. */
5056 if (target != const0_rtx)
5059 /* Verify the required arguments in the original call. */
5062 fp = TREE_VALUE (arglist);
5063 if (TREE_CODE (TREE_TYPE (fp)) != POINTER_TYPE)
5065 arglist = TREE_CHAIN (arglist);
5068 fmt = TREE_VALUE (arglist);
5069 if (TREE_CODE (TREE_TYPE (fmt)) != POINTER_TYPE)
5071 arglist = TREE_CHAIN (arglist);
5073 /* Check whether the format is a literal string constant. */
5074 fmt_str = c_getstr (fmt);
5075 if (fmt_str == NULL)
5078 /* If the format specifier was "%s", call __builtin_fputs(arg,fp). */
5079 if (strcmp (fmt_str, "%s") == 0)
5082 || TREE_CODE (TREE_TYPE (TREE_VALUE (arglist))) != POINTER_TYPE
5083 || TREE_CHAIN (arglist))
5085 arg = TREE_VALUE (arglist);
5086 arglist = build_tree_list (NULL_TREE, fp);
5087 arglist = tree_cons (NULL_TREE, arg, arglist);
5090 /* If the format specifier was "%c", call __builtin_fputc(arg,fp). */
5091 else if (strcmp (fmt_str, "%c") == 0)
5094 || TREE_CODE (TREE_TYPE (TREE_VALUE (arglist))) != INTEGER_TYPE
5095 || TREE_CHAIN (arglist))
5097 arg = TREE_VALUE (arglist);
5098 arglist = build_tree_list (NULL_TREE, fp);
5099 arglist = tree_cons (NULL_TREE, arg, arglist);
5104 /* We can't handle anything else with % args or %% ... yet. */
5105 if (strchr (fmt_str, '%'))
5111 /* If the format specifier was "", fprintf does nothing. */
5112 if (fmt_str[0] == '\0')
5114 /* Evaluate and ignore FILE* argument for side-effects. */
5115 expand_expr (fp, const0_rtx, VOIDmode, EXPAND_NORMAL);
5119 /* When "string" doesn't contain %, replace all cases of
5120 fprintf(stream,string) with fputs(string,stream). The fputs
5121 builtin will take care of special cases like length == 1. */
5122 arglist = build_tree_list (NULL_TREE, fp);
5123 arglist = tree_cons (NULL_TREE, fmt, arglist);
5129 return expand_expr (build_function_call_expr (fn, arglist),
5130 target, mode, EXPAND_NORMAL);
5133 /* Expand a call to sprintf with argument list ARGLIST. Return 0 if
5134 a normal call should be emitted rather than expanding the function
5135 inline. If convenient, the result should be placed in TARGET with
5139 expand_builtin_sprintf (tree arglist, rtx target, enum machine_mode mode)
5141 tree orig_arglist, dest, fmt;
5142 const char *fmt_str;
5144 orig_arglist = arglist;
5146 /* Verify the required arguments in the original call. */
5149 dest = TREE_VALUE (arglist);
5150 if (TREE_CODE (TREE_TYPE (dest)) != POINTER_TYPE)
5152 arglist = TREE_CHAIN (arglist);
5155 fmt = TREE_VALUE (arglist);
5156 if (TREE_CODE (TREE_TYPE (fmt)) != POINTER_TYPE)
5158 arglist = TREE_CHAIN (arglist);
5160 /* Check whether the format is a literal string constant. */
5161 fmt_str = c_getstr (fmt);
5162 if (fmt_str == NULL)
5165 /* If the format doesn't contain % args or %%, use strcpy. */
5166 if (strchr (fmt_str, '%') == 0)
5168 tree fn = implicit_built_in_decls[BUILT_IN_STRCPY];
5171 if (arglist || ! fn)
5173 expand_expr (build_function_call_expr (fn, orig_arglist),
5174 const0_rtx, VOIDmode, EXPAND_NORMAL);
5175 if (target == const0_rtx)
5177 exp = build_int_cst (NULL_TREE, strlen (fmt_str));
5178 return expand_expr (exp, target, mode, EXPAND_NORMAL);
5180 /* If the format is "%s", use strcpy if the result isn't used. */
5181 else if (strcmp (fmt_str, "%s") == 0)
5184 fn = implicit_built_in_decls[BUILT_IN_STRCPY];
5189 if (! arglist || TREE_CHAIN (arglist))
5191 arg = TREE_VALUE (arglist);
5192 if (TREE_CODE (TREE_TYPE (arg)) != POINTER_TYPE)
5195 if (target != const0_rtx)
5197 len = c_strlen (arg, 1);
5198 if (! len || TREE_CODE (len) != INTEGER_CST)
5204 arglist = build_tree_list (NULL_TREE, arg);
5205 arglist = tree_cons (NULL_TREE, dest, arglist);
5206 expand_expr (build_function_call_expr (fn, arglist),
5207 const0_rtx, VOIDmode, EXPAND_NORMAL);
5209 if (target == const0_rtx)
5211 return expand_expr (len, target, mode, EXPAND_NORMAL);
5217 /* Expand a call to either the entry or exit function profiler. */
5220 expand_builtin_profile_func (bool exitp)
5224 this = DECL_RTL (current_function_decl);
5225 gcc_assert (MEM_P (this));
5226 this = XEXP (this, 0);
5229 which = profile_function_exit_libfunc;
5231 which = profile_function_entry_libfunc;
5233 emit_library_call (which, LCT_NORMAL, VOIDmode, 2, this, Pmode,
5234 expand_builtin_return_addr (BUILT_IN_RETURN_ADDRESS,
5235 0, hard_frame_pointer_rtx),
5241 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
5244 round_trampoline_addr (rtx tramp)
5246 rtx temp, addend, mask;
5248 /* If we don't need too much alignment, we'll have been guaranteed
5249 proper alignment by get_trampoline_type. */
5250 if (TRAMPOLINE_ALIGNMENT <= STACK_BOUNDARY)
5253 /* Round address up to desired boundary. */
5254 temp = gen_reg_rtx (Pmode);
5255 addend = GEN_INT (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT - 1);
5256 mask = GEN_INT (-TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT);
5258 temp = expand_simple_binop (Pmode, PLUS, tramp, addend,
5259 temp, 0, OPTAB_LIB_WIDEN);
5260 tramp = expand_simple_binop (Pmode, AND, temp, mask,
5261 temp, 0, OPTAB_LIB_WIDEN);
5267 expand_builtin_init_trampoline (tree arglist)
5269 tree t_tramp, t_func, t_chain;
5270 rtx r_tramp, r_func, r_chain;
5271 #ifdef TRAMPOLINE_TEMPLATE
5275 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE,
5276 POINTER_TYPE, VOID_TYPE))
5279 t_tramp = TREE_VALUE (arglist);
5280 arglist = TREE_CHAIN (arglist);
5281 t_func = TREE_VALUE (arglist);
5282 arglist = TREE_CHAIN (arglist);
5283 t_chain = TREE_VALUE (arglist);
5285 r_tramp = expand_expr (t_tramp, NULL_RTX, VOIDmode, 0);
5286 r_func = expand_expr (t_func, NULL_RTX, VOIDmode, 0);
5287 r_chain = expand_expr (t_chain, NULL_RTX, VOIDmode, 0);
5289 /* Generate insns to initialize the trampoline. */
5290 r_tramp = round_trampoline_addr (r_tramp);
5291 #ifdef TRAMPOLINE_TEMPLATE
5292 blktramp = gen_rtx_MEM (BLKmode, r_tramp);
5293 set_mem_align (blktramp, TRAMPOLINE_ALIGNMENT);
5294 emit_block_move (blktramp, assemble_trampoline_template (),
5295 GEN_INT (TRAMPOLINE_SIZE), BLOCK_OP_NORMAL);
5297 trampolines_created = 1;
5298 INITIALIZE_TRAMPOLINE (r_tramp, r_func, r_chain);
5304 expand_builtin_adjust_trampoline (tree arglist)
5308 if (!validate_arglist (arglist, POINTER_TYPE, VOID_TYPE))
5311 tramp = expand_expr (TREE_VALUE (arglist), NULL_RTX, VOIDmode, 0);
5312 tramp = round_trampoline_addr (tramp);
5313 #ifdef TRAMPOLINE_ADJUST_ADDRESS
5314 TRAMPOLINE_ADJUST_ADDRESS (tramp);
5320 /* Expand a call to the built-in signbit, signbitf or signbitl function.
5321 Return NULL_RTX if a normal call should be emitted rather than expanding
5322 the function in-line. EXP is the expression that is a call to the builtin
5323 function; if convenient, the result should be placed in TARGET. */
5326 expand_builtin_signbit (tree exp, rtx target)
5328 const struct real_format *fmt;
5329 enum machine_mode fmode, imode, rmode;
5330 HOST_WIDE_INT hi, lo;
5335 arglist = TREE_OPERAND (exp, 1);
5336 if (!validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
5339 arg = TREE_VALUE (arglist);
5340 fmode = TYPE_MODE (TREE_TYPE (arg));
5341 rmode = TYPE_MODE (TREE_TYPE (exp));
5342 fmt = REAL_MODE_FORMAT (fmode);
5344 /* For floating point formats without a sign bit, implement signbit
5346 if (fmt->signbit < 0)
5348 /* But we can't do this if the format supports signed zero. */
5349 if (fmt->has_signed_zero && HONOR_SIGNED_ZEROS (fmode))
5352 arg = fold (build2 (LT_EXPR, TREE_TYPE (exp), arg,
5353 build_real (TREE_TYPE (arg), dconst0)));
5354 return expand_expr (arg, target, VOIDmode, EXPAND_NORMAL);
5357 imode = int_mode_for_mode (fmode);
5358 if (imode == BLKmode)
5361 bitpos = fmt->signbit;
5362 /* Handle targets with different FP word orders. */
5363 if (FLOAT_WORDS_BIG_ENDIAN != WORDS_BIG_ENDIAN)
5365 int nwords = GET_MODE_BITSIZE (fmode) / BITS_PER_WORD;
5366 int word = nwords - (bitpos / BITS_PER_WORD) - 1;
5367 bitpos = word * BITS_PER_WORD + bitpos % BITS_PER_WORD;
5370 /* If the sign bit is not in the lowpart and the floating point format
5371 is wider than an integer, check that is twice the size of an integer
5372 so that we can use gen_highpart below. */
5373 if (bitpos >= GET_MODE_BITSIZE (rmode)
5374 && GET_MODE_BITSIZE (imode) != 2 * GET_MODE_BITSIZE (rmode))
5377 temp = expand_expr (arg, NULL_RTX, VOIDmode, 0);
5378 temp = gen_lowpart (imode, temp);
5380 if (GET_MODE_BITSIZE (imode) > GET_MODE_BITSIZE (rmode))
5382 if (BYTES_BIG_ENDIAN)
5383 bitpos = GET_MODE_BITSIZE (imode) - 1 - bitpos;
5384 temp = copy_to_mode_reg (imode, temp);
5385 temp = extract_bit_field (temp, 1, bitpos, 1,
5386 NULL_RTX, rmode, rmode);
5390 if (GET_MODE_BITSIZE (imode) < GET_MODE_BITSIZE (rmode))
5391 temp = gen_lowpart (rmode, temp);
5392 if (bitpos < HOST_BITS_PER_WIDE_INT)
5395 lo = (HOST_WIDE_INT) 1 << bitpos;
5399 hi = (HOST_WIDE_INT) 1 << (bitpos - HOST_BITS_PER_WIDE_INT);
5403 temp = force_reg (rmode, temp);
5404 temp = expand_binop (rmode, and_optab, temp,
5405 immed_double_const (lo, hi, rmode),
5406 target, 1, OPTAB_LIB_WIDEN);
5411 /* Expand fork or exec calls. TARGET is the desired target of the
5412 call. ARGLIST is the list of arguments of the call. FN is the
5413 identificator of the actual function. IGNORE is nonzero if the
5414 value is to be ignored. */
5417 expand_builtin_fork_or_exec (tree fn, tree arglist, rtx target, int ignore)
5422 /* If we are not profiling, just call the function. */
5423 if (!profile_arc_flag)
5426 /* Otherwise call the wrapper. This should be equivalent for the rest of
5427 compiler, so the code does not diverge, and the wrapper may run the
5428 code necessary for keeping the profiling sane. */
5430 switch (DECL_FUNCTION_CODE (fn))
5433 id = get_identifier ("__gcov_fork");
5436 case BUILT_IN_EXECL:
5437 id = get_identifier ("__gcov_execl");
5440 case BUILT_IN_EXECV:
5441 id = get_identifier ("__gcov_execv");
5444 case BUILT_IN_EXECLP:
5445 id = get_identifier ("__gcov_execlp");
5448 case BUILT_IN_EXECLE:
5449 id = get_identifier ("__gcov_execle");
5452 case BUILT_IN_EXECVP:
5453 id = get_identifier ("__gcov_execvp");
5456 case BUILT_IN_EXECVE:
5457 id = get_identifier ("__gcov_execve");
5464 decl = build_decl (FUNCTION_DECL, id, TREE_TYPE (fn));
5465 DECL_EXTERNAL (decl) = 1;
5466 TREE_PUBLIC (decl) = 1;
5467 DECL_ARTIFICIAL (decl) = 1;
5468 TREE_NOTHROW (decl) = 1;
5469 call = build_function_call_expr (decl, arglist);
5471 return expand_call (call, target, ignore);
5474 /* Expand an expression EXP that calls a built-in function,
5475 with result going to TARGET if that's convenient
5476 (and in mode MODE if that's convenient).
5477 SUBTARGET may be used as the target for computing one of EXP's operands.
5478 IGNORE is nonzero if the value is to be ignored. */
5481 expand_builtin (tree exp, rtx target, rtx subtarget, enum machine_mode mode,
5484 tree fndecl = get_callee_fndecl (exp);
5485 tree arglist = TREE_OPERAND (exp, 1);
5486 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
5487 enum machine_mode target_mode = TYPE_MODE (TREE_TYPE (exp));
5489 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
5490 return targetm.expand_builtin (exp, target, subtarget, mode, ignore);
5492 /* When not optimizing, generate calls to library functions for a certain
5495 && !CALLED_AS_BUILT_IN (fndecl)
5496 && DECL_ASSEMBLER_NAME_SET_P (fndecl)
5497 && fcode != BUILT_IN_ALLOCA)
5498 return expand_call (exp, target, ignore);
5500 /* The built-in function expanders test for target == const0_rtx
5501 to determine whether the function's result will be ignored. */
5503 target = const0_rtx;
5505 /* If the result of a pure or const built-in function is ignored, and
5506 none of its arguments are volatile, we can avoid expanding the
5507 built-in call and just evaluate the arguments for side-effects. */
5508 if (target == const0_rtx
5509 && (DECL_IS_PURE (fndecl) || TREE_READONLY (fndecl)))
5511 bool volatilep = false;
5514 for (arg = arglist; arg; arg = TREE_CHAIN (arg))
5515 if (TREE_THIS_VOLATILE (TREE_VALUE (arg)))
5523 for (arg = arglist; arg; arg = TREE_CHAIN (arg))
5524 expand_expr (TREE_VALUE (arg), const0_rtx,
5525 VOIDmode, EXPAND_NORMAL);
5533 case BUILT_IN_FABSF:
5534 case BUILT_IN_FABSL:
5535 target = expand_builtin_fabs (arglist, target, subtarget);
5540 /* Just do a normal library call if we were unable to fold
5543 case BUILT_IN_CABSF:
5544 case BUILT_IN_CABSL:
5550 case BUILT_IN_EXP10:
5551 case BUILT_IN_EXP10F:
5552 case BUILT_IN_EXP10L:
5553 case BUILT_IN_POW10:
5554 case BUILT_IN_POW10F:
5555 case BUILT_IN_POW10L:
5557 case BUILT_IN_EXP2F:
5558 case BUILT_IN_EXP2L:
5559 case BUILT_IN_EXPM1:
5560 case BUILT_IN_EXPM1F:
5561 case BUILT_IN_EXPM1L:
5563 case BUILT_IN_LOGBF:
5564 case BUILT_IN_LOGBL:
5565 case BUILT_IN_ILOGB:
5566 case BUILT_IN_ILOGBF:
5567 case BUILT_IN_ILOGBL:
5571 case BUILT_IN_LOG10:
5572 case BUILT_IN_LOG10F:
5573 case BUILT_IN_LOG10L:
5575 case BUILT_IN_LOG2F:
5576 case BUILT_IN_LOG2L:
5577 case BUILT_IN_LOG1P:
5578 case BUILT_IN_LOG1PF:
5579 case BUILT_IN_LOG1PL:
5584 case BUILT_IN_ASINF:
5585 case BUILT_IN_ASINL:
5587 case BUILT_IN_ACOSF:
5588 case BUILT_IN_ACOSL:
5590 case BUILT_IN_ATANF:
5591 case BUILT_IN_ATANL:
5592 /* Treat these like sqrt only if unsafe math optimizations are allowed,
5593 because of possible accuracy problems. */
5594 if (! flag_unsafe_math_optimizations)
5597 case BUILT_IN_SQRTF:
5598 case BUILT_IN_SQRTL:
5599 case BUILT_IN_FLOOR:
5600 case BUILT_IN_FLOORF:
5601 case BUILT_IN_FLOORL:
5603 case BUILT_IN_CEILF:
5604 case BUILT_IN_CEILL:
5605 case BUILT_IN_TRUNC:
5606 case BUILT_IN_TRUNCF:
5607 case BUILT_IN_TRUNCL:
5608 case BUILT_IN_ROUND:
5609 case BUILT_IN_ROUNDF:
5610 case BUILT_IN_ROUNDL:
5611 case BUILT_IN_NEARBYINT:
5612 case BUILT_IN_NEARBYINTF:
5613 case BUILT_IN_NEARBYINTL:
5615 case BUILT_IN_RINTF:
5616 case BUILT_IN_RINTL:
5617 target = expand_builtin_mathfn (exp, target, subtarget);
5625 target = expand_builtin_pow (exp, target, subtarget);
5630 case BUILT_IN_ATAN2:
5631 case BUILT_IN_ATAN2F:
5632 case BUILT_IN_ATAN2L:
5634 case BUILT_IN_FMODF:
5635 case BUILT_IN_FMODL:
5637 case BUILT_IN_DREMF:
5638 case BUILT_IN_DREML:
5639 if (! flag_unsafe_math_optimizations)
5641 target = expand_builtin_mathfn_2 (exp, target, subtarget);
5652 if (! flag_unsafe_math_optimizations)
5654 target = expand_builtin_mathfn_3 (exp, target, subtarget);
5659 case BUILT_IN_APPLY_ARGS:
5660 return expand_builtin_apply_args ();
5662 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
5663 FUNCTION with a copy of the parameters described by
5664 ARGUMENTS, and ARGSIZE. It returns a block of memory
5665 allocated on the stack into which is stored all the registers
5666 that might possibly be used for returning the result of a
5667 function. ARGUMENTS is the value returned by
5668 __builtin_apply_args. ARGSIZE is the number of bytes of
5669 arguments that must be copied. ??? How should this value be
5670 computed? We'll also need a safe worst case value for varargs
5672 case BUILT_IN_APPLY:
5673 if (!validate_arglist (arglist, POINTER_TYPE,
5674 POINTER_TYPE, INTEGER_TYPE, VOID_TYPE)
5675 && !validate_arglist (arglist, REFERENCE_TYPE,
5676 POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
5684 for (t = arglist, i = 0; t; t = TREE_CHAIN (t), i++)
5685 ops[i] = expand_expr (TREE_VALUE (t), NULL_RTX, VOIDmode, 0);
5687 return expand_builtin_apply (ops[0], ops[1], ops[2]);
5690 /* __builtin_return (RESULT) causes the function to return the
5691 value described by RESULT. RESULT is address of the block of
5692 memory returned by __builtin_apply. */
5693 case BUILT_IN_RETURN:
5694 if (validate_arglist (arglist, POINTER_TYPE, VOID_TYPE))
5695 expand_builtin_return (expand_expr (TREE_VALUE (arglist),
5696 NULL_RTX, VOIDmode, 0));
5699 case BUILT_IN_SAVEREGS:
5700 return expand_builtin_saveregs ();
5702 case BUILT_IN_ARGS_INFO:
5703 return expand_builtin_args_info (arglist);
5705 /* Return the address of the first anonymous stack arg. */
5706 case BUILT_IN_NEXT_ARG:
5707 simplify_builtin_next_arg (arglist);
5708 return expand_builtin_next_arg (arglist);
5710 case BUILT_IN_CLASSIFY_TYPE:
5711 return expand_builtin_classify_type (arglist);
5713 case BUILT_IN_CONSTANT_P:
5716 case BUILT_IN_FRAME_ADDRESS:
5717 case BUILT_IN_RETURN_ADDRESS:
5718 return expand_builtin_frame_address (fndecl, arglist);
5720 /* Returns the address of the area where the structure is returned.
5722 case BUILT_IN_AGGREGATE_INCOMING_ADDRESS:
5724 || ! AGGREGATE_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl)))
5725 || !MEM_P (DECL_RTL (DECL_RESULT (current_function_decl))))
5728 return XEXP (DECL_RTL (DECL_RESULT (current_function_decl)), 0);
5730 case BUILT_IN_ALLOCA:
5731 target = expand_builtin_alloca (arglist, target);
5736 case BUILT_IN_STACK_SAVE:
5737 return expand_stack_save ();
5739 case BUILT_IN_STACK_RESTORE:
5740 expand_stack_restore (TREE_VALUE (arglist));
5745 case BUILT_IN_FFSLL:
5746 case BUILT_IN_FFSIMAX:
5747 target = expand_builtin_unop (target_mode, arglist, target,
5748 subtarget, ffs_optab);
5755 case BUILT_IN_CLZLL:
5756 case BUILT_IN_CLZIMAX:
5757 target = expand_builtin_unop (target_mode, arglist, target,
5758 subtarget, clz_optab);
5765 case BUILT_IN_CTZLL:
5766 case BUILT_IN_CTZIMAX:
5767 target = expand_builtin_unop (target_mode, arglist, target,
5768 subtarget, ctz_optab);
5773 case BUILT_IN_POPCOUNT:
5774 case BUILT_IN_POPCOUNTL:
5775 case BUILT_IN_POPCOUNTLL:
5776 case BUILT_IN_POPCOUNTIMAX:
5777 target = expand_builtin_unop (target_mode, arglist, target,
5778 subtarget, popcount_optab);
5783 case BUILT_IN_PARITY:
5784 case BUILT_IN_PARITYL:
5785 case BUILT_IN_PARITYLL:
5786 case BUILT_IN_PARITYIMAX:
5787 target = expand_builtin_unop (target_mode, arglist, target,
5788 subtarget, parity_optab);
5793 case BUILT_IN_STRLEN:
5794 target = expand_builtin_strlen (arglist, target, target_mode);
5799 case BUILT_IN_STRCPY:
5800 target = expand_builtin_strcpy (arglist, target, mode);
5805 case BUILT_IN_STRNCPY:
5806 target = expand_builtin_strncpy (arglist, target, mode);
5811 case BUILT_IN_STPCPY:
5812 target = expand_builtin_stpcpy (arglist, target, mode);
5817 case BUILT_IN_STRCAT:
5818 target = expand_builtin_strcat (arglist, target, mode);
5823 case BUILT_IN_STRNCAT:
5824 target = expand_builtin_strncat (arglist, target, mode);
5829 case BUILT_IN_STRSPN:
5830 target = expand_builtin_strspn (arglist, target, mode);
5835 case BUILT_IN_STRCSPN:
5836 target = expand_builtin_strcspn (arglist, target, mode);
5841 case BUILT_IN_STRSTR:
5842 target = expand_builtin_strstr (arglist, target, mode);
5847 case BUILT_IN_STRPBRK:
5848 target = expand_builtin_strpbrk (arglist, target, mode);
5853 case BUILT_IN_INDEX:
5854 case BUILT_IN_STRCHR:
5855 target = expand_builtin_strchr (arglist, target, mode);
5860 case BUILT_IN_RINDEX:
5861 case BUILT_IN_STRRCHR:
5862 target = expand_builtin_strrchr (arglist, target, mode);
5867 case BUILT_IN_MEMCPY:
5868 target = expand_builtin_memcpy (arglist, target, mode);
5873 case BUILT_IN_MEMPCPY:
5874 target = expand_builtin_mempcpy (arglist, target, mode, /*endp=*/ 1);
5879 case BUILT_IN_MEMMOVE:
5880 target = expand_builtin_memmove (arglist, target, mode);
5885 case BUILT_IN_BCOPY:
5886 target = expand_builtin_bcopy (arglist);
5891 case BUILT_IN_MEMSET:
5892 target = expand_builtin_memset (arglist, target, mode);
5897 case BUILT_IN_BZERO:
5898 target = expand_builtin_bzero (arglist);
5903 case BUILT_IN_STRCMP:
5904 target = expand_builtin_strcmp (exp, target, mode);
5909 case BUILT_IN_STRNCMP:
5910 target = expand_builtin_strncmp (exp, target, mode);
5916 case BUILT_IN_MEMCMP:
5917 target = expand_builtin_memcmp (exp, arglist, target, mode);
5922 case BUILT_IN_SETJMP:
5923 target = expand_builtin_setjmp (arglist, target);
5928 /* __builtin_longjmp is passed a pointer to an array of five words.
5929 It's similar to the C library longjmp function but works with
5930 __builtin_setjmp above. */
5931 case BUILT_IN_LONGJMP:
5932 if (!validate_arglist (arglist, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
5936 rtx buf_addr = expand_expr (TREE_VALUE (arglist), subtarget,
5938 rtx value = expand_expr (TREE_VALUE (TREE_CHAIN (arglist)),
5939 NULL_RTX, VOIDmode, 0);
5941 if (value != const1_rtx)
5943 error ("__builtin_longjmp second argument must be 1");
5947 expand_builtin_longjmp (buf_addr, value);
5951 case BUILT_IN_NONLOCAL_GOTO:
5952 target = expand_builtin_nonlocal_goto (arglist);
5957 /* This updates the setjmp buffer that is its argument with the value
5958 of the current stack pointer. */
5959 case BUILT_IN_UPDATE_SETJMP_BUF:
5960 if (validate_arglist (arglist, POINTER_TYPE, VOID_TYPE))
5963 = expand_expr (TREE_VALUE (arglist), NULL_RTX, VOIDmode, 0);
5965 expand_builtin_update_setjmp_buf (buf_addr);
5971 expand_builtin_trap ();
5974 case BUILT_IN_PRINTF:
5975 target = expand_builtin_printf (arglist, target, mode, false);
5980 case BUILT_IN_PRINTF_UNLOCKED:
5981 target = expand_builtin_printf (arglist, target, mode, true);
5986 case BUILT_IN_FPUTS:
5987 target = expand_builtin_fputs (arglist, target, false);
5991 case BUILT_IN_FPUTS_UNLOCKED:
5992 target = expand_builtin_fputs (arglist, target, true);
5997 case BUILT_IN_FPRINTF:
5998 target = expand_builtin_fprintf (arglist, target, mode, false);
6003 case BUILT_IN_FPRINTF_UNLOCKED:
6004 target = expand_builtin_fprintf (arglist, target, mode, true);
6009 case BUILT_IN_SPRINTF:
6010 target = expand_builtin_sprintf (arglist, target, mode);
6015 case BUILT_IN_SIGNBIT:
6016 case BUILT_IN_SIGNBITF:
6017 case BUILT_IN_SIGNBITL:
6018 target = expand_builtin_signbit (exp, target);
6023 /* Various hooks for the DWARF 2 __throw routine. */
6024 case BUILT_IN_UNWIND_INIT:
6025 expand_builtin_unwind_init ();
6027 case BUILT_IN_DWARF_CFA:
6028 return virtual_cfa_rtx;
6029 #ifdef DWARF2_UNWIND_INFO
6030 case BUILT_IN_DWARF_SP_COLUMN:
6031 return expand_builtin_dwarf_sp_column ();
6032 case BUILT_IN_INIT_DWARF_REG_SIZES:
6033 expand_builtin_init_dwarf_reg_sizes (TREE_VALUE (arglist));
6036 case BUILT_IN_FROB_RETURN_ADDR:
6037 return expand_builtin_frob_return_addr (TREE_VALUE (arglist));
6038 case BUILT_IN_EXTRACT_RETURN_ADDR:
6039 return expand_builtin_extract_return_addr (TREE_VALUE (arglist));
6040 case BUILT_IN_EH_RETURN:
6041 expand_builtin_eh_return (TREE_VALUE (arglist),
6042 TREE_VALUE (TREE_CHAIN (arglist)));
6044 #ifdef EH_RETURN_DATA_REGNO
6045 case BUILT_IN_EH_RETURN_DATA_REGNO:
6046 return expand_builtin_eh_return_data_regno (arglist);
6048 case BUILT_IN_EXTEND_POINTER:
6049 return expand_builtin_extend_pointer (TREE_VALUE (arglist));
6051 case BUILT_IN_VA_START:
6052 case BUILT_IN_STDARG_START:
6053 return expand_builtin_va_start (arglist);
6054 case BUILT_IN_VA_END:
6055 return expand_builtin_va_end (arglist);
6056 case BUILT_IN_VA_COPY:
6057 return expand_builtin_va_copy (arglist);
6058 case BUILT_IN_EXPECT:
6059 return expand_builtin_expect (arglist, target);
6060 case BUILT_IN_PREFETCH:
6061 expand_builtin_prefetch (arglist);
6064 case BUILT_IN_PROFILE_FUNC_ENTER:
6065 return expand_builtin_profile_func (false);
6066 case BUILT_IN_PROFILE_FUNC_EXIT:
6067 return expand_builtin_profile_func (true);
6069 case BUILT_IN_INIT_TRAMPOLINE:
6070 return expand_builtin_init_trampoline (arglist);
6071 case BUILT_IN_ADJUST_TRAMPOLINE:
6072 return expand_builtin_adjust_trampoline (arglist);
6075 case BUILT_IN_EXECL:
6076 case BUILT_IN_EXECV:
6077 case BUILT_IN_EXECLP:
6078 case BUILT_IN_EXECLE:
6079 case BUILT_IN_EXECVP:
6080 case BUILT_IN_EXECVE:
6081 target = expand_builtin_fork_or_exec (fndecl, arglist, target, ignore);
6086 default: /* just do library call, if unknown builtin */
6090 /* The switch statement above can drop through to cause the function
6091 to be called normally. */
6092 return expand_call (exp, target, ignore);
6095 /* Determine whether a tree node represents a call to a built-in
6096 function. If the tree T is a call to a built-in function with
6097 the right number of arguments of the appropriate types, return
6098 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
6099 Otherwise the return value is END_BUILTINS. */
6101 enum built_in_function
6102 builtin_mathfn_code (tree t)
6104 tree fndecl, arglist, parmlist;
6105 tree argtype, parmtype;
6107 if (TREE_CODE (t) != CALL_EXPR
6108 || TREE_CODE (TREE_OPERAND (t, 0)) != ADDR_EXPR)
6109 return END_BUILTINS;
6111 fndecl = get_callee_fndecl (t);
6112 if (fndecl == NULL_TREE
6113 || TREE_CODE (fndecl) != FUNCTION_DECL
6114 || ! DECL_BUILT_IN (fndecl)
6115 || DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
6116 return END_BUILTINS;
6118 arglist = TREE_OPERAND (t, 1);
6119 parmlist = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
6120 for (; parmlist; parmlist = TREE_CHAIN (parmlist))
6122 /* If a function doesn't take a variable number of arguments,
6123 the last element in the list will have type `void'. */
6124 parmtype = TREE_VALUE (parmlist);
6125 if (VOID_TYPE_P (parmtype))
6128 return END_BUILTINS;
6129 return DECL_FUNCTION_CODE (fndecl);
6133 return END_BUILTINS;
6135 argtype = TREE_TYPE (TREE_VALUE (arglist));
6137 if (SCALAR_FLOAT_TYPE_P (parmtype))
6139 if (! SCALAR_FLOAT_TYPE_P (argtype))
6140 return END_BUILTINS;
6142 else if (COMPLEX_FLOAT_TYPE_P (parmtype))
6144 if (! COMPLEX_FLOAT_TYPE_P (argtype))
6145 return END_BUILTINS;
6147 else if (POINTER_TYPE_P (parmtype))
6149 if (! POINTER_TYPE_P (argtype))
6150 return END_BUILTINS;
6152 else if (INTEGRAL_TYPE_P (parmtype))
6154 if (! INTEGRAL_TYPE_P (argtype))
6155 return END_BUILTINS;
6158 return END_BUILTINS;
6160 arglist = TREE_CHAIN (arglist);
6163 /* Variable-length argument list. */
6164 return DECL_FUNCTION_CODE (fndecl);
6167 /* Fold a call to __builtin_constant_p, if we know it will evaluate to a
6168 constant. ARGLIST is the argument list of the call. */
6171 fold_builtin_constant_p (tree arglist)
6176 arglist = TREE_VALUE (arglist);
6178 /* We return 1 for a numeric type that's known to be a constant
6179 value at compile-time or for an aggregate type that's a
6180 literal constant. */
6181 STRIP_NOPS (arglist);
6183 /* If we know this is a constant, emit the constant of one. */
6184 if (TREE_CODE_CLASS (TREE_CODE (arglist)) == 'c'
6185 || (TREE_CODE (arglist) == CONSTRUCTOR
6186 && TREE_CONSTANT (arglist))
6187 || (TREE_CODE (arglist) == ADDR_EXPR
6188 && TREE_CODE (TREE_OPERAND (arglist, 0)) == STRING_CST))
6189 return integer_one_node;
6191 /* If this expression has side effects, show we don't know it to be a
6192 constant. Likewise if it's a pointer or aggregate type since in
6193 those case we only want literals, since those are only optimized
6194 when generating RTL, not later.
6195 And finally, if we are compiling an initializer, not code, we
6196 need to return a definite result now; there's not going to be any
6197 more optimization done. */
6198 if (TREE_SIDE_EFFECTS (arglist)
6199 || AGGREGATE_TYPE_P (TREE_TYPE (arglist))
6200 || POINTER_TYPE_P (TREE_TYPE (arglist))
6202 return integer_zero_node;
6207 /* Fold a call to __builtin_expect, if we expect that a comparison against
6208 the argument will fold to a constant. In practice, this means a true
6209 constant or the address of a non-weak symbol. ARGLIST is the argument
6210 list of the call. */
6213 fold_builtin_expect (tree arglist)
6220 arg = TREE_VALUE (arglist);
6222 /* If the argument isn't invariant, then there's nothing we can do. */
6223 if (!TREE_INVARIANT (arg))
6226 /* If we're looking at an address of a weak decl, then do not fold. */
6229 if (TREE_CODE (inner) == ADDR_EXPR)
6233 inner = TREE_OPERAND (inner, 0);
6235 while (TREE_CODE (inner) == COMPONENT_REF
6236 || TREE_CODE (inner) == ARRAY_REF);
6237 if (DECL_P (inner) && DECL_WEAK (inner))
6241 /* Otherwise, ARG already has the proper type for the return value. */
6245 /* Fold a call to __builtin_classify_type. */
6248 fold_builtin_classify_type (tree arglist)
6251 return build_int_cst (NULL_TREE, no_type_class);
6253 return build_int_cst (NULL_TREE,
6254 type_to_class (TREE_TYPE (TREE_VALUE (arglist))));
6257 /* Fold a call to __builtin_inf or __builtin_huge_val. */
6260 fold_builtin_inf (tree type, int warn)
6262 REAL_VALUE_TYPE real;
6264 if (!MODE_HAS_INFINITIES (TYPE_MODE (type)) && warn)
6265 warning ("target format does not support infinity");
6268 return build_real (type, real);
6271 /* Fold a call to __builtin_nan or __builtin_nans. */
6274 fold_builtin_nan (tree arglist, tree type, int quiet)
6276 REAL_VALUE_TYPE real;
6279 if (!validate_arglist (arglist, POINTER_TYPE, VOID_TYPE))
6281 str = c_getstr (TREE_VALUE (arglist));
6285 if (!real_nan (&real, str, quiet, TYPE_MODE (type)))
6288 return build_real (type, real);
6291 /* Return true if the floating point expression T has an integer value.
6292 We also allow +Inf, -Inf and NaN to be considered integer values. */
6295 integer_valued_real_p (tree t)
6297 switch (TREE_CODE (t))
6304 case NON_LVALUE_EXPR:
6305 return integer_valued_real_p (TREE_OPERAND (t, 0));
6310 return integer_valued_real_p (TREE_OPERAND (t, 1));
6317 return integer_valued_real_p (TREE_OPERAND (t, 0))
6318 && integer_valued_real_p (TREE_OPERAND (t, 1));
6321 return integer_valued_real_p (TREE_OPERAND (t, 1))
6322 && integer_valued_real_p (TREE_OPERAND (t, 2));
6325 if (! TREE_CONSTANT_OVERFLOW (t))
6327 REAL_VALUE_TYPE c, cint;
6329 c = TREE_REAL_CST (t);
6330 real_trunc (&cint, TYPE_MODE (TREE_TYPE (t)), &c);
6331 return real_identical (&c, &cint);
6336 tree type = TREE_TYPE (TREE_OPERAND (t, 0));
6337 if (TREE_CODE (type) == INTEGER_TYPE)
6339 if (TREE_CODE (type) == REAL_TYPE)
6340 return integer_valued_real_p (TREE_OPERAND (t, 0));
6345 switch (builtin_mathfn_code (t))
6348 case BUILT_IN_CEILF:
6349 case BUILT_IN_CEILL:
6350 case BUILT_IN_FLOOR:
6351 case BUILT_IN_FLOORF:
6352 case BUILT_IN_FLOORL:
6353 case BUILT_IN_NEARBYINT:
6354 case BUILT_IN_NEARBYINTF:
6355 case BUILT_IN_NEARBYINTL:
6357 case BUILT_IN_RINTF:
6358 case BUILT_IN_RINTL:
6359 case BUILT_IN_ROUND:
6360 case BUILT_IN_ROUNDF:
6361 case BUILT_IN_ROUNDL:
6362 case BUILT_IN_TRUNC:
6363 case BUILT_IN_TRUNCF:
6364 case BUILT_IN_TRUNCL:
6378 /* EXP is assumed to be builtin call where truncation can be propagated
6379 across (for instance floor((double)f) == (double)floorf (f).
6380 Do the transformation. */
6383 fold_trunc_transparent_mathfn (tree exp)
6385 tree fndecl = get_callee_fndecl (exp);
6386 tree arglist = TREE_OPERAND (exp, 1);
6387 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
6390 if (! validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
6393 arg = TREE_VALUE (arglist);
6394 /* Integer rounding functions are idempotent. */
6395 if (fcode == builtin_mathfn_code (arg))
6398 /* If argument is already integer valued, and we don't need to worry
6399 about setting errno, there's no need to perform rounding. */
6400 if (! flag_errno_math && integer_valued_real_p (arg))
6405 tree arg0 = strip_float_extensions (arg);
6406 tree ftype = TREE_TYPE (exp);
6407 tree newtype = TREE_TYPE (arg0);
6410 if (TYPE_PRECISION (newtype) < TYPE_PRECISION (ftype)
6411 && (decl = mathfn_built_in (newtype, fcode)))
6414 build_tree_list (NULL_TREE, fold_convert (newtype, arg0));
6415 return fold_convert (ftype,
6416 build_function_call_expr (decl, arglist));
6422 /* EXP is assumed to be builtin call which can narrow the FP type of
6423 the argument, for instance lround((double)f) -> lroundf (f). */
6426 fold_fixed_mathfn (tree exp)
6428 tree fndecl = get_callee_fndecl (exp);
6429 tree arglist = TREE_OPERAND (exp, 1);
6430 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
6433 if (! validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
6436 arg = TREE_VALUE (arglist);
6438 /* If argument is already integer valued, and we don't need to worry
6439 about setting errno, there's no need to perform rounding. */
6440 if (! flag_errno_math && integer_valued_real_p (arg))
6441 return fold (build1 (FIX_TRUNC_EXPR, TREE_TYPE (exp), arg));
6445 tree ftype = TREE_TYPE (arg);
6446 tree arg0 = strip_float_extensions (arg);
6447 tree newtype = TREE_TYPE (arg0);
6450 if (TYPE_PRECISION (newtype) < TYPE_PRECISION (ftype)
6451 && (decl = mathfn_built_in (newtype, fcode)))
6454 build_tree_list (NULL_TREE, fold_convert (newtype, arg0));
6455 return build_function_call_expr (decl, arglist);
6461 /* Fold function call to builtin cabs, cabsf or cabsl. ARGLIST
6462 is the argument list and TYPE is the return type. Return
6463 NULL_TREE if no if no simplification can be made. */
6466 fold_builtin_cabs (tree arglist, tree type)
6470 if (!arglist || TREE_CHAIN (arglist))
6473 arg = TREE_VALUE (arglist);
6474 if (TREE_CODE (TREE_TYPE (arg)) != COMPLEX_TYPE
6475 || TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) != REAL_TYPE)
6478 /* Evaluate cabs of a constant at compile-time. */
6479 if (flag_unsafe_math_optimizations
6480 && TREE_CODE (arg) == COMPLEX_CST
6481 && TREE_CODE (TREE_REALPART (arg)) == REAL_CST
6482 && TREE_CODE (TREE_IMAGPART (arg)) == REAL_CST
6483 && ! TREE_CONSTANT_OVERFLOW (TREE_REALPART (arg))
6484 && ! TREE_CONSTANT_OVERFLOW (TREE_IMAGPART (arg)))
6486 REAL_VALUE_TYPE r, i;
6488 r = TREE_REAL_CST (TREE_REALPART (arg));
6489 i = TREE_REAL_CST (TREE_IMAGPART (arg));
6491 real_arithmetic (&r, MULT_EXPR, &r, &r);
6492 real_arithmetic (&i, MULT_EXPR, &i, &i);
6493 real_arithmetic (&r, PLUS_EXPR, &r, &i);
6494 if (real_sqrt (&r, TYPE_MODE (type), &r)
6495 || ! flag_trapping_math)
6496 return build_real (type, r);
6499 /* If either part is zero, cabs is fabs of the other. */
6500 if (TREE_CODE (arg) == COMPLEX_EXPR
6501 && real_zerop (TREE_OPERAND (arg, 0)))
6502 return fold (build1 (ABS_EXPR, type, TREE_OPERAND (arg, 1)));
6503 if (TREE_CODE (arg) == COMPLEX_EXPR
6504 && real_zerop (TREE_OPERAND (arg, 1)))
6505 return fold (build1 (ABS_EXPR, type, TREE_OPERAND (arg, 0)));
6507 /* Don't do this when optimizing for size. */
6508 if (flag_unsafe_math_optimizations
6509 && optimize && !optimize_size)
6511 tree sqrtfn = mathfn_built_in (type, BUILT_IN_SQRT);
6513 if (sqrtfn != NULL_TREE)
6515 tree rpart, ipart, result, arglist;
6517 arg = builtin_save_expr (arg);
6519 rpart = fold (build1 (REALPART_EXPR, type, arg));
6520 ipart = fold (build1 (IMAGPART_EXPR, type, arg));
6522 rpart = builtin_save_expr (rpart);
6523 ipart = builtin_save_expr (ipart);
6525 result = fold (build2 (PLUS_EXPR, type,
6526 fold (build2 (MULT_EXPR, type,
6528 fold (build2 (MULT_EXPR, type,
6531 arglist = build_tree_list (NULL_TREE, result);
6532 return build_function_call_expr (sqrtfn, arglist);
6539 /* Fold function call to builtin trunc, truncf or truncl. Return
6540 NULL_TREE if no simplification can be made. */
6543 fold_builtin_trunc (tree exp)
6545 tree arglist = TREE_OPERAND (exp, 1);
6548 if (! validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
6551 /* Optimize trunc of constant value. */
6552 arg = TREE_VALUE (arglist);
6553 if (TREE_CODE (arg) == REAL_CST && ! TREE_CONSTANT_OVERFLOW (arg))
6555 REAL_VALUE_TYPE r, x;
6556 tree type = TREE_TYPE (exp);
6558 x = TREE_REAL_CST (arg);
6559 real_trunc (&r, TYPE_MODE (type), &x);
6560 return build_real (type, r);
6563 return fold_trunc_transparent_mathfn (exp);
6566 /* Fold function call to builtin floor, floorf or floorl. Return
6567 NULL_TREE if no simplification can be made. */
6570 fold_builtin_floor (tree exp)
6572 tree arglist = TREE_OPERAND (exp, 1);
6575 if (! validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
6578 /* Optimize floor of constant value. */
6579 arg = TREE_VALUE (arglist);
6580 if (TREE_CODE (arg) == REAL_CST && ! TREE_CONSTANT_OVERFLOW (arg))
6584 x = TREE_REAL_CST (arg);
6585 if (! REAL_VALUE_ISNAN (x) || ! flag_errno_math)
6587 tree type = TREE_TYPE (exp);
6590 real_floor (&r, TYPE_MODE (type), &x);
6591 return build_real (type, r);
6595 return fold_trunc_transparent_mathfn (exp);
6598 /* Fold function call to builtin ceil, ceilf or ceill. Return
6599 NULL_TREE if no simplification can be made. */
6602 fold_builtin_ceil (tree exp)
6604 tree arglist = TREE_OPERAND (exp, 1);
6607 if (! validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
6610 /* Optimize ceil of constant value. */
6611 arg = TREE_VALUE (arglist);
6612 if (TREE_CODE (arg) == REAL_CST && ! TREE_CONSTANT_OVERFLOW (arg))
6616 x = TREE_REAL_CST (arg);
6617 if (! REAL_VALUE_ISNAN (x) || ! flag_errno_math)
6619 tree type = TREE_TYPE (exp);
6622 real_ceil (&r, TYPE_MODE (type), &x);
6623 return build_real (type, r);
6627 return fold_trunc_transparent_mathfn (exp);
6630 /* Fold function call to builtin round, roundf or roundl. Return
6631 NULL_TREE if no simplification can be made. */
6634 fold_builtin_round (tree exp)
6636 tree arglist = TREE_OPERAND (exp, 1);
6639 if (! validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
6642 /* Optimize round of constant value. */
6643 arg = TREE_VALUE (arglist);
6644 if (TREE_CODE (arg) == REAL_CST && ! TREE_CONSTANT_OVERFLOW (arg))
6648 x = TREE_REAL_CST (arg);
6649 if (! REAL_VALUE_ISNAN (x) || ! flag_errno_math)
6651 tree type = TREE_TYPE (exp);
6654 real_round (&r, TYPE_MODE (type), &x);
6655 return build_real (type, r);
6659 return fold_trunc_transparent_mathfn (exp);
6662 /* Fold function call to builtin lround, lroundf or lroundl (or the
6663 corresponding long long versions). Return NULL_TREE if no
6664 simplification can be made. */
6667 fold_builtin_lround (tree exp)
6669 tree arglist = TREE_OPERAND (exp, 1);
6672 if (! validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
6675 /* Optimize lround of constant value. */
6676 arg = TREE_VALUE (arglist);
6677 if (TREE_CODE (arg) == REAL_CST && ! TREE_CONSTANT_OVERFLOW (arg))
6679 const REAL_VALUE_TYPE x = TREE_REAL_CST (arg);
6681 if (! REAL_VALUE_ISNAN (x) && ! REAL_VALUE_ISINF (x))
6683 tree itype = TREE_TYPE (exp), ftype = TREE_TYPE (arg), result;
6684 HOST_WIDE_INT hi, lo;
6687 real_round (&r, TYPE_MODE (ftype), &x);
6688 REAL_VALUE_TO_INT (&lo, &hi, r);
6689 result = build_int_cst_wide (NULL_TREE, lo, hi);
6690 if (int_fits_type_p (result, itype))
6691 return fold_convert (itype, result);
6695 return fold_fixed_mathfn (exp);
6698 /* Fold function call to builtin ffs, clz, ctz, popcount and parity
6699 and their long and long long variants (i.e. ffsl and ffsll).
6700 Return NULL_TREE if no simplification can be made. */
6703 fold_builtin_bitop (tree exp)
6705 tree fndecl = get_callee_fndecl (exp);
6706 tree arglist = TREE_OPERAND (exp, 1);
6709 if (! validate_arglist (arglist, INTEGER_TYPE, VOID_TYPE))
6712 /* Optimize for constant argument. */
6713 arg = TREE_VALUE (arglist);
6714 if (TREE_CODE (arg) == INTEGER_CST && ! TREE_CONSTANT_OVERFLOW (arg))
6716 HOST_WIDE_INT hi, width, result;
6717 unsigned HOST_WIDE_INT lo;
6720 type = TREE_TYPE (arg);
6721 width = TYPE_PRECISION (type);
6722 lo = TREE_INT_CST_LOW (arg);
6724 /* Clear all the bits that are beyond the type's precision. */
6725 if (width > HOST_BITS_PER_WIDE_INT)
6727 hi = TREE_INT_CST_HIGH (arg);
6728 if (width < 2 * HOST_BITS_PER_WIDE_INT)
6729 hi &= ~((HOST_WIDE_INT) (-1) >> (width - HOST_BITS_PER_WIDE_INT));
6734 if (width < HOST_BITS_PER_WIDE_INT)
6735 lo &= ~((unsigned HOST_WIDE_INT) (-1) << width);
6738 switch (DECL_FUNCTION_CODE (fndecl))
6742 case BUILT_IN_FFSLL:
6744 result = exact_log2 (lo & -lo) + 1;
6746 result = HOST_BITS_PER_WIDE_INT + exact_log2 (hi & -hi) + 1;
6753 case BUILT_IN_CLZLL:
6755 result = width - floor_log2 (hi) - 1 - HOST_BITS_PER_WIDE_INT;
6757 result = width - floor_log2 (lo) - 1;
6758 else if (! CLZ_DEFINED_VALUE_AT_ZERO (TYPE_MODE (type), result))
6764 case BUILT_IN_CTZLL:
6766 result = exact_log2 (lo & -lo);
6768 result = HOST_BITS_PER_WIDE_INT + exact_log2 (hi & -hi);
6769 else if (! CTZ_DEFINED_VALUE_AT_ZERO (TYPE_MODE (type), result))
6773 case BUILT_IN_POPCOUNT:
6774 case BUILT_IN_POPCOUNTL:
6775 case BUILT_IN_POPCOUNTLL:
6778 result++, lo &= lo - 1;
6780 result++, hi &= hi - 1;
6783 case BUILT_IN_PARITY:
6784 case BUILT_IN_PARITYL:
6785 case BUILT_IN_PARITYLL:
6788 result++, lo &= lo - 1;
6790 result++, hi &= hi - 1;
6798 return build_int_cst (TREE_TYPE (exp), result);
6804 /* Return true if EXPR is the real constant contained in VALUE. */
6807 real_dconstp (tree expr, const REAL_VALUE_TYPE *value)
6811 return ((TREE_CODE (expr) == REAL_CST
6812 && ! TREE_CONSTANT_OVERFLOW (expr)
6813 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), *value))
6814 || (TREE_CODE (expr) == COMPLEX_CST
6815 && real_dconstp (TREE_REALPART (expr), value)
6816 && real_zerop (TREE_IMAGPART (expr))));
6819 /* A subroutine of fold_builtin to fold the various logarithmic
6820 functions. EXP is the CALL_EXPR of a call to a builtin logN
6821 function. VALUE is the base of the logN function. */
6824 fold_builtin_logarithm (tree exp, const REAL_VALUE_TYPE *value)
6826 tree arglist = TREE_OPERAND (exp, 1);
6828 if (validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
6830 tree fndecl = get_callee_fndecl (exp);
6831 tree type = TREE_TYPE (TREE_TYPE (fndecl));
6832 tree arg = TREE_VALUE (arglist);
6833 const enum built_in_function fcode = builtin_mathfn_code (arg);
6835 /* Optimize logN(1.0) = 0.0. */
6836 if (real_onep (arg))
6837 return build_real (type, dconst0);
6839 /* Optimize logN(N) = 1.0. If N can't be truncated to MODE
6840 exactly, then only do this if flag_unsafe_math_optimizations. */
6841 if (exact_real_truncate (TYPE_MODE (type), value)
6842 || flag_unsafe_math_optimizations)
6844 const REAL_VALUE_TYPE value_truncate =
6845 real_value_truncate (TYPE_MODE (type), *value);
6846 if (real_dconstp (arg, &value_truncate))
6847 return build_real (type, dconst1);
6850 /* Special case, optimize logN(expN(x)) = x. */
6851 if (flag_unsafe_math_optimizations
6852 && ((value == &dconste
6853 && (fcode == BUILT_IN_EXP
6854 || fcode == BUILT_IN_EXPF
6855 || fcode == BUILT_IN_EXPL))
6856 || (value == &dconst2
6857 && (fcode == BUILT_IN_EXP2
6858 || fcode == BUILT_IN_EXP2F
6859 || fcode == BUILT_IN_EXP2L))
6860 || (value == &dconst10 && (BUILTIN_EXP10_P (fcode)))))
6861 return fold_convert (type, TREE_VALUE (TREE_OPERAND (arg, 1)));
6863 /* Optimize logN(func()) for various exponential functions. We
6864 want to determine the value "x" and the power "exponent" in
6865 order to transform logN(x**exponent) into exponent*logN(x). */
6866 if (flag_unsafe_math_optimizations)
6868 tree exponent = 0, x = 0;
6875 /* Prepare to do logN(exp(exponent) -> exponent*logN(e). */
6876 x = build_real (type,
6877 real_value_truncate (TYPE_MODE (type), dconste));
6878 exponent = TREE_VALUE (TREE_OPERAND (arg, 1));
6881 case BUILT_IN_EXP2F:
6882 case BUILT_IN_EXP2L:
6883 /* Prepare to do logN(exp2(exponent) -> exponent*logN(2). */
6884 x = build_real (type, dconst2);
6885 exponent = TREE_VALUE (TREE_OPERAND (arg, 1));
6887 case BUILT_IN_EXP10:
6888 case BUILT_IN_EXP10F:
6889 case BUILT_IN_EXP10L:
6890 case BUILT_IN_POW10:
6891 case BUILT_IN_POW10F:
6892 case BUILT_IN_POW10L:
6893 /* Prepare to do logN(exp10(exponent) -> exponent*logN(10). */
6894 x = build_real (type, dconst10);
6895 exponent = TREE_VALUE (TREE_OPERAND (arg, 1));
6898 case BUILT_IN_SQRTF:
6899 case BUILT_IN_SQRTL:
6900 /* Prepare to do logN(sqrt(x) -> 0.5*logN(x). */
6901 x = TREE_VALUE (TREE_OPERAND (arg, 1));
6902 exponent = build_real (type, dconsthalf);
6905 case BUILT_IN_CBRTF:
6906 case BUILT_IN_CBRTL:
6907 /* Prepare to do logN(cbrt(x) -> (1/3)*logN(x). */
6908 x = TREE_VALUE (TREE_OPERAND (arg, 1));
6909 exponent = build_real (type, real_value_truncate (TYPE_MODE (type),
6915 /* Prepare to do logN(pow(x,exponent) -> exponent*logN(x). */
6916 x = TREE_VALUE (TREE_OPERAND (arg, 1));
6917 exponent = TREE_VALUE (TREE_CHAIN (TREE_OPERAND (arg, 1)));
6923 /* Now perform the optimization. */
6927 arglist = build_tree_list (NULL_TREE, x);
6928 logfn = build_function_call_expr (fndecl, arglist);
6929 return fold (build2 (MULT_EXPR, type, exponent, logfn));
6937 /* A subroutine of fold_builtin to fold the various exponent
6938 functions. EXP is the CALL_EXPR of a call to a builtin function.
6939 VALUE is the value which will be raised to a power. */
6942 fold_builtin_exponent (tree exp, const REAL_VALUE_TYPE *value)
6944 tree arglist = TREE_OPERAND (exp, 1);
6946 if (validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
6948 tree fndecl = get_callee_fndecl (exp);
6949 tree type = TREE_TYPE (TREE_TYPE (fndecl));
6950 tree arg = TREE_VALUE (arglist);
6952 /* Optimize exp*(0.0) = 1.0. */
6953 if (real_zerop (arg))
6954 return build_real (type, dconst1);
6956 /* Optimize expN(1.0) = N. */
6957 if (real_onep (arg))
6959 REAL_VALUE_TYPE cst;
6961 real_convert (&cst, TYPE_MODE (type), value);
6962 return build_real (type, cst);
6965 /* Attempt to evaluate expN(integer) at compile-time. */
6966 if (flag_unsafe_math_optimizations
6967 && TREE_CODE (arg) == REAL_CST
6968 && ! TREE_CONSTANT_OVERFLOW (arg))
6970 REAL_VALUE_TYPE cint;
6974 c = TREE_REAL_CST (arg);
6975 n = real_to_integer (&c);
6976 real_from_integer (&cint, VOIDmode, n,
6978 if (real_identical (&c, &cint))
6982 real_powi (&x, TYPE_MODE (type), value, n);
6983 return build_real (type, x);
6987 /* Optimize expN(logN(x)) = x. */
6988 if (flag_unsafe_math_optimizations)
6990 const enum built_in_function fcode = builtin_mathfn_code (arg);
6992 if ((value == &dconste
6993 && (fcode == BUILT_IN_LOG
6994 || fcode == BUILT_IN_LOGF
6995 || fcode == BUILT_IN_LOGL))
6996 || (value == &dconst2
6997 && (fcode == BUILT_IN_LOG2
6998 || fcode == BUILT_IN_LOG2F
6999 || fcode == BUILT_IN_LOG2L))
7000 || (value == &dconst10
7001 && (fcode == BUILT_IN_LOG10
7002 || fcode == BUILT_IN_LOG10F
7003 || fcode == BUILT_IN_LOG10L)))
7004 return fold_convert (type, TREE_VALUE (TREE_OPERAND (arg, 1)));
7011 /* Fold function call to builtin memcpy. Return
7012 NULL_TREE if no simplification can be made. */
7015 fold_builtin_memcpy (tree exp)
7017 tree arglist = TREE_OPERAND (exp, 1);
7018 tree dest, src, len;
7020 if (!validate_arglist (arglist,
7021 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
7024 dest = TREE_VALUE (arglist);
7025 src = TREE_VALUE (TREE_CHAIN (arglist));
7026 len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
7028 /* If the LEN parameter is zero, return DEST. */
7029 if (integer_zerop (len))
7030 return omit_one_operand (TREE_TYPE (exp), dest, src);
7032 /* If SRC and DEST are the same (and not volatile), return DEST. */
7033 if (operand_equal_p (src, dest, 0))
7034 return omit_one_operand (TREE_TYPE (exp), dest, len);
7039 /* Fold function call to builtin mempcpy. Return
7040 NULL_TREE if no simplification can be made. */
7043 fold_builtin_mempcpy (tree exp)
7045 tree arglist = TREE_OPERAND (exp, 1);
7046 tree dest, src, len;
7048 if (!validate_arglist (arglist,
7049 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
7052 dest = TREE_VALUE (arglist);
7053 src = TREE_VALUE (TREE_CHAIN (arglist));
7054 len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
7056 /* If the LEN parameter is zero, return DEST. */
7057 if (integer_zerop (len))
7058 return omit_one_operand (TREE_TYPE (exp), dest, src);
7060 /* If SRC and DEST are the same (and not volatile), return DEST+LEN. */
7061 if (operand_equal_p (src, dest, 0))
7063 tree temp = fold_convert (TREE_TYPE (dest), len);
7064 temp = fold (build2 (PLUS_EXPR, TREE_TYPE (dest), dest, temp));
7065 return fold_convert (TREE_TYPE (exp), temp);
7071 /* Fold function call to builtin memmove. Return
7072 NULL_TREE if no simplification can be made. */
7075 fold_builtin_memmove (tree exp)
7077 tree arglist = TREE_OPERAND (exp, 1);
7078 tree dest, src, len;
7080 if (!validate_arglist (arglist,
7081 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
7084 dest = TREE_VALUE (arglist);
7085 src = TREE_VALUE (TREE_CHAIN (arglist));
7086 len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
7088 /* If the LEN parameter is zero, return DEST. */
7089 if (integer_zerop (len))
7090 return omit_one_operand (TREE_TYPE (exp), dest, src);
7092 /* If SRC and DEST are the same (and not volatile), return DEST. */
7093 if (operand_equal_p (src, dest, 0))
7094 return omit_one_operand (TREE_TYPE (exp), dest, len);
7099 /* Fold function call to builtin strcpy. If LEN is not NULL, it represents
7100 the length of the string to be copied. Return NULL_TREE if no
7101 simplification can be made. */
7104 fold_builtin_strcpy (tree exp, tree len)
7106 tree arglist = TREE_OPERAND (exp, 1);
7109 if (!validate_arglist (arglist,
7110 POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
7113 dest = TREE_VALUE (arglist);
7114 src = TREE_VALUE (TREE_CHAIN (arglist));
7116 /* If SRC and DEST are the same (and not volatile), return DEST. */
7117 if (operand_equal_p (src, dest, 0))
7118 return fold_convert (TREE_TYPE (exp), dest);
7123 fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
7129 len = c_strlen (src, 1);
7130 if (! len || TREE_SIDE_EFFECTS (len))
7134 len = size_binop (PLUS_EXPR, len, ssize_int (1));
7135 arglist = build_tree_list (NULL_TREE, len);
7136 arglist = tree_cons (NULL_TREE, src, arglist);
7137 arglist = tree_cons (NULL_TREE, dest, arglist);
7138 return fold_convert (TREE_TYPE (exp),
7139 build_function_call_expr (fn, arglist));
7142 /* Fold function call to builtin strncpy. If SLEN is not NULL, it represents
7143 the length of the source string. Return NULL_TREE if no simplification
7147 fold_builtin_strncpy (tree exp, tree slen)
7149 tree arglist = TREE_OPERAND (exp, 1);
7150 tree dest, src, len, fn;
7152 if (!validate_arglist (arglist,
7153 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
7156 dest = TREE_VALUE (arglist);
7157 src = TREE_VALUE (TREE_CHAIN (arglist));
7158 len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
7160 /* If the LEN parameter is zero, return DEST. */
7161 if (integer_zerop (len))
7162 return omit_one_operand (TREE_TYPE (exp), dest, src);
7164 /* We can't compare slen with len as constants below if len is not a
7166 if (len == 0 || TREE_CODE (len) != INTEGER_CST)
7170 slen = c_strlen (src, 1);
7172 /* Now, we must be passed a constant src ptr parameter. */
7173 if (slen == 0 || TREE_CODE (slen) != INTEGER_CST)
7176 slen = size_binop (PLUS_EXPR, slen, ssize_int (1));
7178 /* We do not support simplification of this case, though we do
7179 support it when expanding trees into RTL. */
7180 /* FIXME: generate a call to __builtin_memset. */
7181 if (tree_int_cst_lt (slen, len))
7184 /* OK transform into builtin memcpy. */
7185 fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
7188 return fold_convert (TREE_TYPE (exp),
7189 build_function_call_expr (fn, arglist));
7192 /* Fold function call to builtin strchr and strrchr.
7193 Return NULL_TREE if no simplification can be made. */
7196 fold_builtin_strchr (tree exp, bool actually_strrchr)
7198 tree arglist = TREE_OPERAND (exp, 1);
7199 if (!validate_arglist (arglist, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
7203 tree s1 = TREE_VALUE (arglist), s2 = TREE_VALUE (TREE_CHAIN (arglist));
7206 if (TREE_CODE (s2) != INTEGER_CST)
7215 if (target_char_cast (s2, &c))
7218 r = actually_strrchr ? strrchr (p1, c) : strchr (p1, c);
7221 return build_int_cst (TREE_TYPE (s1), 0);
7223 /* Return an offset into the constant string argument. */
7224 return fold (build2 (PLUS_EXPR, TREE_TYPE (s1),
7225 s1, build_int_cst (TREE_TYPE (s1), r - p1)));
7228 if (actually_strrchr)
7232 if (!integer_zerop (s2))
7235 fn = implicit_built_in_decls[BUILT_IN_STRCHR];
7239 /* Transform strrchr(s1, '\0') to strchr(s1, '\0'). */
7240 return build_function_call_expr (fn, arglist);
7247 /* Fold function call to builtin memcmp. Return
7248 NULL_TREE if no simplification can be made. */
7251 fold_builtin_memcmp (tree arglist)
7253 tree arg1, arg2, len;
7254 const char *p1, *p2;
7256 if (!validate_arglist (arglist,
7257 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
7260 arg1 = TREE_VALUE (arglist);
7261 arg2 = TREE_VALUE (TREE_CHAIN (arglist));
7262 len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
7264 /* If the LEN parameter is zero, return zero. */
7265 if (integer_zerop (len))
7266 return omit_two_operands (integer_type_node, integer_zero_node,
7269 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
7270 if (operand_equal_p (arg1, arg2, 0))
7271 return omit_one_operand (integer_type_node, integer_zero_node, len);
7273 p1 = c_getstr (arg1);
7274 p2 = c_getstr (arg2);
7276 /* If all arguments are constant, and the value of len is not greater
7277 than the lengths of arg1 and arg2, evaluate at compile-time. */
7278 if (host_integerp (len, 1) && p1 && p2
7279 && compare_tree_int (len, strlen (p1) + 1) <= 0
7280 && compare_tree_int (len, strlen (p2) + 1) <= 0)
7282 const int r = memcmp (p1, p2, tree_low_cst (len, 1));
7285 return integer_one_node;
7287 return integer_minus_one_node;
7289 return integer_zero_node;
7292 /* If len parameter is one, return an expression corresponding to
7293 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
7294 if (host_integerp (len, 1) && tree_low_cst (len, 1) == 1)
7296 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
7297 tree cst_uchar_ptr_node = build_pointer_type (cst_uchar_node);
7298 tree ind1 = fold_convert (integer_type_node,
7299 build1 (INDIRECT_REF, cst_uchar_node,
7300 fold_convert (cst_uchar_ptr_node,
7302 tree ind2 = fold_convert (integer_type_node,
7303 build1 (INDIRECT_REF, cst_uchar_node,
7304 fold_convert (cst_uchar_ptr_node,
7306 return fold (build2 (MINUS_EXPR, integer_type_node, ind1, ind2));
7312 /* Fold function call to builtin strcmp. Return
7313 NULL_TREE if no simplification can be made. */
7316 fold_builtin_strcmp (tree arglist)
7319 const char *p1, *p2;
7321 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
7324 arg1 = TREE_VALUE (arglist);
7325 arg2 = TREE_VALUE (TREE_CHAIN (arglist));
7327 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
7328 if (operand_equal_p (arg1, arg2, 0))
7329 return integer_zero_node;
7331 p1 = c_getstr (arg1);
7332 p2 = c_getstr (arg2);
7336 const int i = strcmp (p1, p2);
7338 return integer_minus_one_node;
7340 return integer_one_node;
7342 return integer_zero_node;
7345 /* If the second arg is "", return *(const unsigned char*)arg1. */
7346 if (p2 && *p2 == '\0')
7348 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
7349 tree cst_uchar_ptr_node = build_pointer_type (cst_uchar_node);
7350 return fold_convert (integer_type_node,
7351 build1 (INDIRECT_REF, cst_uchar_node,
7352 fold_convert (cst_uchar_ptr_node,
7356 /* If the first arg is "", return -*(const unsigned char*)arg2. */
7357 if (p1 && *p1 == '\0')
7359 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
7360 tree cst_uchar_ptr_node = build_pointer_type (cst_uchar_node);
7361 tree temp = fold_convert (integer_type_node,
7362 build1 (INDIRECT_REF, cst_uchar_node,
7363 fold_convert (cst_uchar_ptr_node,
7365 return fold (build1 (NEGATE_EXPR, integer_type_node, temp));
7371 /* Fold function call to builtin strncmp. Return
7372 NULL_TREE if no simplification can be made. */
7375 fold_builtin_strncmp (tree arglist)
7377 tree arg1, arg2, len;
7378 const char *p1, *p2;
7380 if (!validate_arglist (arglist,
7381 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
7384 arg1 = TREE_VALUE (arglist);
7385 arg2 = TREE_VALUE (TREE_CHAIN (arglist));
7386 len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
7388 /* If the LEN parameter is zero, return zero. */
7389 if (integer_zerop (len))
7390 return omit_two_operands (integer_type_node, integer_zero_node,
7393 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
7394 if (operand_equal_p (arg1, arg2, 0))
7395 return omit_one_operand (integer_type_node, integer_zero_node, len);
7397 p1 = c_getstr (arg1);
7398 p2 = c_getstr (arg2);
7400 if (host_integerp (len, 1) && p1 && p2)
7402 const int i = strncmp (p1, p2, tree_low_cst (len, 1));
7404 return integer_one_node;
7406 return integer_minus_one_node;
7408 return integer_zero_node;
7411 /* If the second arg is "", and the length is greater than zero,
7412 return *(const unsigned char*)arg1. */
7413 if (p2 && *p2 == '\0'
7414 && TREE_CODE (len) == INTEGER_CST
7415 && tree_int_cst_sgn (len) == 1)
7417 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
7418 tree cst_uchar_ptr_node = build_pointer_type (cst_uchar_node);
7419 return fold_convert (integer_type_node,
7420 build1 (INDIRECT_REF, cst_uchar_node,
7421 fold_convert (cst_uchar_ptr_node,
7425 /* If the first arg is "", and the length is greater than zero,
7426 return -*(const unsigned char*)arg2. */
7427 if (p1 && *p1 == '\0'
7428 && TREE_CODE (len) == INTEGER_CST
7429 && tree_int_cst_sgn (len) == 1)
7431 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
7432 tree cst_uchar_ptr_node = build_pointer_type (cst_uchar_node);
7433 tree temp = fold_convert (integer_type_node,
7434 build1 (INDIRECT_REF, cst_uchar_node,
7435 fold_convert (cst_uchar_ptr_node,
7437 return fold (build1 (NEGATE_EXPR, integer_type_node, temp));
7440 /* If len parameter is one, return an expression corresponding to
7441 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
7442 if (host_integerp (len, 1) && tree_low_cst (len, 1) == 1)
7444 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
7445 tree cst_uchar_ptr_node = build_pointer_type (cst_uchar_node);
7446 tree ind1 = fold_convert (integer_type_node,
7447 build1 (INDIRECT_REF, cst_uchar_node,
7448 fold_convert (cst_uchar_ptr_node,
7450 tree ind2 = fold_convert (integer_type_node,
7451 build1 (INDIRECT_REF, cst_uchar_node,
7452 fold_convert (cst_uchar_ptr_node,
7454 return fold (build2 (MINUS_EXPR, integer_type_node, ind1, ind2));
7460 /* Fold function call to builtin signbit, signbitf or signbitl. Return
7461 NULL_TREE if no simplification can be made. */
7464 fold_builtin_signbit (tree exp)
7466 tree arglist = TREE_OPERAND (exp, 1);
7469 if (!validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
7472 arg = TREE_VALUE (arglist);
7474 /* If ARG is a compile-time constant, determine the result. */
7475 if (TREE_CODE (arg) == REAL_CST
7476 && !TREE_CONSTANT_OVERFLOW (arg))
7480 c = TREE_REAL_CST (arg);
7481 temp = REAL_VALUE_NEGATIVE (c) ? integer_one_node : integer_zero_node;
7482 return fold_convert (TREE_TYPE (exp), temp);
7485 /* If ARG is non-negative, the result is always zero. */
7486 if (tree_expr_nonnegative_p (arg))
7487 return omit_one_operand (TREE_TYPE (exp), integer_zero_node, arg);
7489 /* If ARG's format doesn't have signed zeros, return "arg < 0.0". */
7490 if (!HONOR_SIGNED_ZEROS (TYPE_MODE (TREE_TYPE (arg))))
7491 return fold (build2 (LT_EXPR, TREE_TYPE (exp), arg,
7492 build_real (TREE_TYPE (arg), dconst0)));
7497 /* Fold function call to builtin copysign, copysignf or copysignl.
7498 Return NULL_TREE if no simplification can be made. */
7501 fold_builtin_copysign (tree arglist, tree type)
7505 if (!validate_arglist (arglist, REAL_TYPE, REAL_TYPE, VOID_TYPE))
7508 arg1 = TREE_VALUE (arglist);
7509 arg2 = TREE_VALUE (TREE_CHAIN (arglist));
7511 /* copysign(X,X) is X. */
7512 if (operand_equal_p (arg1, arg2, 0))
7513 return fold_convert (type, arg1);
7515 /* If ARG1 and ARG2 are compile-time constants, determine the result. */
7516 if (TREE_CODE (arg1) == REAL_CST
7517 && TREE_CODE (arg2) == REAL_CST
7518 && !TREE_CONSTANT_OVERFLOW (arg1)
7519 && !TREE_CONSTANT_OVERFLOW (arg2))
7521 REAL_VALUE_TYPE c1, c2;
7523 c1 = TREE_REAL_CST (arg1);
7524 c2 = TREE_REAL_CST (arg2);
7525 real_copysign (&c1, &c2);
7526 return build_real (type, c1);
7530 /* copysign(X, Y) is fabs(X) when Y is always non-negative.
7531 Remember to evaluate Y for side-effects. */
7532 if (tree_expr_nonnegative_p (arg2))
7533 return omit_one_operand (type,
7534 fold (build1 (ABS_EXPR, type, arg1)),
7540 /* Fold a call to builtin isascii. */
7543 fold_builtin_isascii (tree arglist)
7545 if (! validate_arglist (arglist, INTEGER_TYPE, VOID_TYPE))
7549 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
7550 tree arg = TREE_VALUE (arglist);
7552 arg = build2 (BIT_AND_EXPR, integer_type_node, arg,
7553 build_int_cst (NULL_TREE,
7554 ~ (unsigned HOST_WIDE_INT) 0x7f));
7555 arg = fold (build2 (EQ_EXPR, integer_type_node,
7556 arg, integer_zero_node));
7558 if (in_gimple_form && !TREE_CONSTANT (arg))
7565 /* Fold a call to builtin toascii. */
7568 fold_builtin_toascii (tree arglist)
7570 if (! validate_arglist (arglist, INTEGER_TYPE, VOID_TYPE))
7574 /* Transform toascii(c) -> (c & 0x7f). */
7575 tree arg = TREE_VALUE (arglist);
7577 return fold (build2 (BIT_AND_EXPR, integer_type_node, arg,
7578 build_int_cst (NULL_TREE, 0x7f)));
7582 /* Fold a call to builtin isdigit. */
7585 fold_builtin_isdigit (tree arglist)
7587 if (! validate_arglist (arglist, INTEGER_TYPE, VOID_TYPE))
7591 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
7592 /* According to the C standard, isdigit is unaffected by locale. */
7593 tree arg = TREE_VALUE (arglist);
7594 arg = fold_convert (unsigned_type_node, arg);
7595 arg = build2 (MINUS_EXPR, unsigned_type_node, arg,
7596 build_int_cst (unsigned_type_node, TARGET_DIGIT0));
7597 arg = build2 (LE_EXPR, integer_type_node, arg,
7598 build_int_cst (unsigned_type_node, 9));
7600 if (in_gimple_form && !TREE_CONSTANT (arg))
7607 /* Fold a call to fabs, fabsf or fabsl. */
7610 fold_builtin_fabs (tree arglist, tree type)
7614 if (!validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
7617 arg = TREE_VALUE (arglist);
7618 if (TREE_CODE (arg) == REAL_CST)
7619 return fold_abs_const (arg, type);
7620 return fold (build1 (ABS_EXPR, type, arg));
7623 /* Fold a call to abs, labs, llabs or imaxabs. */
7626 fold_builtin_abs (tree arglist, tree type)
7630 if (!validate_arglist (arglist, INTEGER_TYPE, VOID_TYPE))
7633 arg = TREE_VALUE (arglist);
7634 if (TREE_CODE (arg) == INTEGER_CST)
7635 return fold_abs_const (arg, type);
7636 return fold (build1 (ABS_EXPR, type, arg));
7639 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
7640 EXP is the CALL_EXPR for the call. */
7643 fold_builtin_classify (tree exp, int builtin_index)
7645 tree fndecl = get_callee_fndecl (exp);
7646 tree arglist = TREE_OPERAND (exp, 1);
7647 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7651 if (!validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
7653 /* Check that we have exactly one argument. */
7656 error ("too few arguments to function `%s'",
7657 IDENTIFIER_POINTER (DECL_NAME (fndecl)));
7658 return error_mark_node;
7660 else if (TREE_CHAIN (arglist) != 0)
7662 error ("too many arguments to function `%s'",
7663 IDENTIFIER_POINTER (DECL_NAME (fndecl)));
7664 return error_mark_node;
7668 error ("non-floating-point argument to function `%s'",
7669 IDENTIFIER_POINTER (DECL_NAME (fndecl)));
7670 return error_mark_node;
7674 arg = TREE_VALUE (arglist);
7675 switch (builtin_index)
7677 case BUILT_IN_ISINF:
7678 if (!MODE_HAS_INFINITIES (TYPE_MODE (TREE_TYPE (arg))))
7679 return omit_one_operand (type, integer_zero_node, arg);
7681 if (TREE_CODE (arg) == REAL_CST)
7683 r = TREE_REAL_CST (arg);
7684 if (real_isinf (&r))
7685 return real_compare (GT_EXPR, &r, &dconst0)
7686 ? integer_one_node : integer_minus_one_node;
7688 return integer_zero_node;
7693 case BUILT_IN_FINITE:
7694 if (!MODE_HAS_NANS (TYPE_MODE (TREE_TYPE (arg)))
7695 && !MODE_HAS_INFINITIES (TYPE_MODE (TREE_TYPE (arg))))
7696 return omit_one_operand (type, integer_zero_node, arg);
7698 if (TREE_CODE (arg) == REAL_CST)
7700 r = TREE_REAL_CST (arg);
7701 return real_isinf (&r) || real_isnan (&r)
7702 ? integer_zero_node : integer_one_node;
7707 case BUILT_IN_ISNAN:
7708 if (!MODE_HAS_NANS (TYPE_MODE (TREE_TYPE (arg))))
7709 return omit_one_operand (type, integer_zero_node, arg);
7711 if (TREE_CODE (arg) == REAL_CST)
7713 r = TREE_REAL_CST (arg);
7714 return real_isnan (&r) ? integer_one_node : integer_zero_node;
7717 arg = builtin_save_expr (arg);
7718 return fold (build2 (UNORDERED_EXPR, type, arg, arg));
7725 /* Fold a call to an unordered comparison function such as
7726 __builtin_isgreater(). EXP is the CALL_EXPR for the call.
7727 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
7728 the opposite of the desired result. UNORDERED_CODE is used
7729 for modes that can hold NaNs and ORDERED_CODE is used for
7733 fold_builtin_unordered_cmp (tree exp,
7734 enum tree_code unordered_code,
7735 enum tree_code ordered_code)
7737 tree fndecl = get_callee_fndecl (exp);
7738 tree arglist = TREE_OPERAND (exp, 1);
7739 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7740 enum tree_code code;
7743 if (!validate_arglist (arglist, REAL_TYPE, REAL_TYPE, VOID_TYPE))
7745 enum tree_code code0, code1;
7749 /* Check that we have exactly two arguments. */
7750 if (arglist == 0 || TREE_CHAIN (arglist) == 0)
7752 error ("too few arguments to function `%s'",
7753 IDENTIFIER_POINTER (DECL_NAME (fndecl)));
7754 return error_mark_node;
7756 else if (TREE_CHAIN (TREE_CHAIN (arglist)) != 0)
7758 error ("too many arguments to function `%s'",
7759 IDENTIFIER_POINTER (DECL_NAME (fndecl)));
7760 return error_mark_node;
7763 arg0 = TREE_VALUE (arglist);
7764 arg1 = TREE_VALUE (TREE_CHAIN (arglist));
7766 type0 = TREE_TYPE (arg0);
7767 type1 = TREE_TYPE (arg1);
7769 code0 = TREE_CODE (type0);
7770 code1 = TREE_CODE (type1);
7772 if (code0 == REAL_TYPE && code1 == REAL_TYPE)
7773 /* Choose the wider of two real types. */
7774 cmp_type = TYPE_PRECISION (type0) >= TYPE_PRECISION (type1)
7776 else if (code0 == REAL_TYPE && code1 == INTEGER_TYPE)
7778 else if (code0 == INTEGER_TYPE && code1 == REAL_TYPE)
7782 error ("non-floating-point argument to function `%s'",
7783 IDENTIFIER_POINTER (DECL_NAME (fndecl)));
7784 return error_mark_node;
7787 arg0 = fold_convert (cmp_type, arg0);
7788 arg1 = fold_convert (cmp_type, arg1);
7792 arg0 = TREE_VALUE (arglist);
7793 arg1 = TREE_VALUE (TREE_CHAIN (arglist));
7796 if (unordered_code == UNORDERED_EXPR)
7798 if (!MODE_HAS_NANS (TYPE_MODE (TREE_TYPE (arg0))))
7799 return omit_two_operands (type, integer_zero_node, arg0, arg1);
7800 return fold (build2 (UNORDERED_EXPR, type, arg0, arg1));
7803 code = MODE_HAS_NANS (TYPE_MODE (TREE_TYPE (arg0))) ? unordered_code
7805 return fold (build1 (TRUTH_NOT_EXPR, type,
7806 fold (build2 (code, type, arg0, arg1))));
7809 /* Used by constant folding to simplify calls to builtin functions. EXP is
7810 the CALL_EXPR of a call to a builtin function. IGNORE is true if the
7811 result of the function call is ignored. This function returns NULL_TREE
7812 if no simplification was possible. */
7815 fold_builtin_1 (tree exp, bool ignore)
7817 tree fndecl = get_callee_fndecl (exp);
7818 tree arglist = TREE_OPERAND (exp, 1);
7819 tree type = TREE_TYPE (TREE_TYPE (fndecl));
7821 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
7824 switch (DECL_FUNCTION_CODE (fndecl))
7826 case BUILT_IN_CONSTANT_P:
7827 return fold_builtin_constant_p (arglist);
7829 case BUILT_IN_EXPECT:
7830 return fold_builtin_expect (arglist);
7832 case BUILT_IN_CLASSIFY_TYPE:
7833 return fold_builtin_classify_type (arglist);
7835 case BUILT_IN_STRLEN:
7836 if (validate_arglist (arglist, POINTER_TYPE, VOID_TYPE))
7838 tree len = c_strlen (TREE_VALUE (arglist), 0);
7841 /* Convert from the internal "sizetype" type to "size_t". */
7843 len = fold_convert (size_type_node, len);
7850 case BUILT_IN_FABSF:
7851 case BUILT_IN_FABSL:
7852 return fold_builtin_fabs (arglist, type);
7856 case BUILT_IN_LLABS:
7857 case BUILT_IN_IMAXABS:
7858 return fold_builtin_abs (arglist, type);
7861 case BUILT_IN_CONJF:
7862 case BUILT_IN_CONJL:
7863 if (validate_arglist (arglist, COMPLEX_TYPE, VOID_TYPE))
7864 return fold (build1 (CONJ_EXPR, type, TREE_VALUE (arglist)));
7867 case BUILT_IN_CREAL:
7868 case BUILT_IN_CREALF:
7869 case BUILT_IN_CREALL:
7870 if (validate_arglist (arglist, COMPLEX_TYPE, VOID_TYPE))
7871 return non_lvalue (fold (build1 (REALPART_EXPR, type,
7872 TREE_VALUE (arglist))));
7875 case BUILT_IN_CIMAG:
7876 case BUILT_IN_CIMAGF:
7877 case BUILT_IN_CIMAGL:
7878 if (validate_arglist (arglist, COMPLEX_TYPE, VOID_TYPE))
7879 return non_lvalue (fold (build1 (IMAGPART_EXPR, type,
7880 TREE_VALUE (arglist))));
7884 case BUILT_IN_CABSF:
7885 case BUILT_IN_CABSL:
7886 return fold_builtin_cabs (arglist, type);
7889 case BUILT_IN_SQRTF:
7890 case BUILT_IN_SQRTL:
7891 if (validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
7893 enum built_in_function fcode;
7894 tree arg = TREE_VALUE (arglist);
7896 /* Optimize sqrt of constant value. */
7897 if (TREE_CODE (arg) == REAL_CST
7898 && ! TREE_CONSTANT_OVERFLOW (arg))
7900 REAL_VALUE_TYPE r, x;
7902 x = TREE_REAL_CST (arg);
7903 if (real_sqrt (&r, TYPE_MODE (type), &x)
7904 || (!flag_trapping_math && !flag_errno_math))
7905 return build_real (type, r);
7908 /* Optimize sqrt(expN(x)) = expN(x*0.5). */
7909 fcode = builtin_mathfn_code (arg);
7910 if (flag_unsafe_math_optimizations && BUILTIN_EXPONENT_P (fcode))
7912 tree expfn = TREE_OPERAND (TREE_OPERAND (arg, 0), 0);
7913 arg = fold (build2 (MULT_EXPR, type,
7914 TREE_VALUE (TREE_OPERAND (arg, 1)),
7915 build_real (type, dconsthalf)));
7916 arglist = build_tree_list (NULL_TREE, arg);
7917 return build_function_call_expr (expfn, arglist);
7920 /* Optimize sqrt(Nroot(x)) -> pow(x,1/(2*N)). */
7921 if (flag_unsafe_math_optimizations && BUILTIN_ROOT_P (fcode))
7923 tree powfn = mathfn_built_in (type, BUILT_IN_POW);
7927 tree arg0 = TREE_VALUE (TREE_OPERAND (arg, 1));
7929 /* The inner root was either sqrt or cbrt. */
7930 REAL_VALUE_TYPE dconstroot =
7931 BUILTIN_SQRT_P (fcode) ? dconsthalf : dconstthird;
7933 /* Adjust for the outer root. */
7934 SET_REAL_EXP (&dconstroot, REAL_EXP (&dconstroot) - 1);
7935 dconstroot = real_value_truncate (TYPE_MODE (type), dconstroot);
7936 tree_root = build_real (type, dconstroot);
7937 arglist = tree_cons (NULL_TREE, arg0,
7938 build_tree_list (NULL_TREE, tree_root));
7939 return build_function_call_expr (powfn, arglist);
7943 /* Optimize sqrt(pow(x,y)) = pow(x,y*0.5). */
7944 if (flag_unsafe_math_optimizations
7945 && (fcode == BUILT_IN_POW
7946 || fcode == BUILT_IN_POWF
7947 || fcode == BUILT_IN_POWL))
7949 tree powfn = TREE_OPERAND (TREE_OPERAND (arg, 0), 0);
7950 tree arg0 = TREE_VALUE (TREE_OPERAND (arg, 1));
7951 tree arg1 = TREE_VALUE (TREE_CHAIN (TREE_OPERAND (arg, 1)));
7952 tree narg1 = fold (build2 (MULT_EXPR, type, arg1,
7953 build_real (type, dconsthalf)));
7954 arglist = tree_cons (NULL_TREE, arg0,
7955 build_tree_list (NULL_TREE, narg1));
7956 return build_function_call_expr (powfn, arglist);
7962 case BUILT_IN_CBRTF:
7963 case BUILT_IN_CBRTL:
7964 if (validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
7966 tree arg = TREE_VALUE (arglist);
7967 const enum built_in_function fcode = builtin_mathfn_code (arg);
7969 /* Optimize cbrt of constant value. */
7970 if (real_zerop (arg) || real_onep (arg) || real_minus_onep (arg))
7973 /* Optimize cbrt(expN(x)) -> expN(x/3). */
7974 if (flag_unsafe_math_optimizations && BUILTIN_EXPONENT_P (fcode))
7976 tree expfn = TREE_OPERAND (TREE_OPERAND (arg, 0), 0);
7977 const REAL_VALUE_TYPE third_trunc =
7978 real_value_truncate (TYPE_MODE (type), dconstthird);
7979 arg = fold (build2 (MULT_EXPR, type,
7980 TREE_VALUE (TREE_OPERAND (arg, 1)),
7981 build_real (type, third_trunc)));
7982 arglist = build_tree_list (NULL_TREE, arg);
7983 return build_function_call_expr (expfn, arglist);
7986 /* Optimize cbrt(sqrt(x)) -> pow(x,1/6). */
7987 /* We don't optimize cbrt(cbrt(x)) -> pow(x,1/9) because if
7988 x is negative pow will error but cbrt won't. */
7989 if (flag_unsafe_math_optimizations && BUILTIN_SQRT_P (fcode))
7991 tree powfn = mathfn_built_in (type, BUILT_IN_POW);
7995 tree arg0 = TREE_VALUE (TREE_OPERAND (arg, 1));
7997 REAL_VALUE_TYPE dconstroot = dconstthird;
7999 SET_REAL_EXP (&dconstroot, REAL_EXP (&dconstroot) - 1);
8000 dconstroot = real_value_truncate (TYPE_MODE (type), dconstroot);
8001 tree_root = build_real (type, dconstroot);
8002 arglist = tree_cons (NULL_TREE, arg0,
8003 build_tree_list (NULL_TREE, tree_root));
8004 return build_function_call_expr (powfn, arglist);
8014 if (validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
8016 tree arg = TREE_VALUE (arglist);
8018 /* Optimize sin(0.0) = 0.0. */
8019 if (real_zerop (arg))
8027 if (validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
8029 tree arg = TREE_VALUE (arglist);
8031 /* Optimize cos(0.0) = 1.0. */
8032 if (real_zerop (arg))
8033 return build_real (type, dconst1);
8035 /* Optimize cos(-x) into cos(x). */
8036 if (TREE_CODE (arg) == NEGATE_EXPR)
8038 tree arglist = build_tree_list (NULL_TREE,
8039 TREE_OPERAND (arg, 0));
8040 return build_function_call_expr (fndecl, arglist);
8048 return fold_builtin_exponent (exp, &dconste);
8051 case BUILT_IN_EXP2F:
8052 case BUILT_IN_EXP2L:
8053 return fold_builtin_exponent (exp, &dconst2);
8055 case BUILT_IN_EXP10:
8056 case BUILT_IN_EXP10F:
8057 case BUILT_IN_EXP10L:
8058 case BUILT_IN_POW10:
8059 case BUILT_IN_POW10F:
8060 case BUILT_IN_POW10L:
8061 return fold_builtin_exponent (exp, &dconst10);
8066 return fold_builtin_logarithm (exp, &dconste);
8069 case BUILT_IN_LOG2F:
8070 case BUILT_IN_LOG2L:
8071 return fold_builtin_logarithm (exp, &dconst2);
8073 case BUILT_IN_LOG10:
8074 case BUILT_IN_LOG10F:
8075 case BUILT_IN_LOG10L:
8076 return fold_builtin_logarithm (exp, &dconst10);
8081 if (validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
8083 enum built_in_function fcode;
8084 tree arg = TREE_VALUE (arglist);
8086 /* Optimize tan(0.0) = 0.0. */
8087 if (real_zerop (arg))
8090 /* Optimize tan(atan(x)) = x. */
8091 fcode = builtin_mathfn_code (arg);
8092 if (flag_unsafe_math_optimizations
8093 && (fcode == BUILT_IN_ATAN
8094 || fcode == BUILT_IN_ATANF
8095 || fcode == BUILT_IN_ATANL))
8096 return TREE_VALUE (TREE_OPERAND (arg, 1));
8101 case BUILT_IN_ATANF:
8102 case BUILT_IN_ATANL:
8103 if (validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
8105 tree arg = TREE_VALUE (arglist);
8107 /* Optimize atan(0.0) = 0.0. */
8108 if (real_zerop (arg))
8111 /* Optimize atan(1.0) = pi/4. */
8112 if (real_onep (arg))
8114 REAL_VALUE_TYPE cst;
8116 real_convert (&cst, TYPE_MODE (type), &dconstpi);
8117 SET_REAL_EXP (&cst, REAL_EXP (&cst) - 2);
8118 return build_real (type, cst);
8126 if (validate_arglist (arglist, REAL_TYPE, REAL_TYPE, VOID_TYPE))
8128 enum built_in_function fcode;
8129 tree arg0 = TREE_VALUE (arglist);
8130 tree arg1 = TREE_VALUE (TREE_CHAIN (arglist));
8132 /* Optimize pow(1.0,y) = 1.0. */
8133 if (real_onep (arg0))
8134 return omit_one_operand (type, build_real (type, dconst1), arg1);
8136 if (TREE_CODE (arg1) == REAL_CST
8137 && ! TREE_CONSTANT_OVERFLOW (arg1))
8140 c = TREE_REAL_CST (arg1);
8142 /* Optimize pow(x,0.0) = 1.0. */
8143 if (REAL_VALUES_EQUAL (c, dconst0))
8144 return omit_one_operand (type, build_real (type, dconst1),
8147 /* Optimize pow(x,1.0) = x. */
8148 if (REAL_VALUES_EQUAL (c, dconst1))
8151 /* Optimize pow(x,-1.0) = 1.0/x. */
8152 if (REAL_VALUES_EQUAL (c, dconstm1))
8153 return fold (build2 (RDIV_EXPR, type,
8154 build_real (type, dconst1), arg0));
8156 /* Optimize pow(x,0.5) = sqrt(x). */
8157 if (flag_unsafe_math_optimizations
8158 && REAL_VALUES_EQUAL (c, dconsthalf))
8160 tree sqrtfn = mathfn_built_in (type, BUILT_IN_SQRT);
8162 if (sqrtfn != NULL_TREE)
8164 tree arglist = build_tree_list (NULL_TREE, arg0);
8165 return build_function_call_expr (sqrtfn, arglist);
8169 /* Attempt to evaluate pow at compile-time. */
8170 if (TREE_CODE (arg0) == REAL_CST
8171 && ! TREE_CONSTANT_OVERFLOW (arg0))
8173 REAL_VALUE_TYPE cint;
8176 n = real_to_integer (&c);
8177 real_from_integer (&cint, VOIDmode, n,
8179 if (real_identical (&c, &cint))
8184 x = TREE_REAL_CST (arg0);
8185 inexact = real_powi (&x, TYPE_MODE (type), &x, n);
8186 if (flag_unsafe_math_optimizations || !inexact)
8187 return build_real (type, x);
8192 /* Optimize pow(expN(x),y) = expN(x*y). */
8193 fcode = builtin_mathfn_code (arg0);
8194 if (flag_unsafe_math_optimizations && BUILTIN_EXPONENT_P (fcode))
8196 tree expfn = TREE_OPERAND (TREE_OPERAND (arg0, 0), 0);
8197 tree arg = TREE_VALUE (TREE_OPERAND (arg0, 1));
8198 arg = fold (build2 (MULT_EXPR, type, arg, arg1));
8199 arglist = build_tree_list (NULL_TREE, arg);
8200 return build_function_call_expr (expfn, arglist);
8203 /* Optimize pow(sqrt(x),y) = pow(x,y*0.5). */
8204 if (flag_unsafe_math_optimizations && BUILTIN_SQRT_P (fcode))
8206 tree narg0 = TREE_VALUE (TREE_OPERAND (arg0, 1));
8207 tree narg1 = fold (build2 (MULT_EXPR, type, arg1,
8208 build_real (type, dconsthalf)));
8210 arglist = tree_cons (NULL_TREE, narg0,
8211 build_tree_list (NULL_TREE, narg1));
8212 return build_function_call_expr (fndecl, arglist);
8215 /* Optimize pow(pow(x,y),z) = pow(x,y*z). */
8216 if (flag_unsafe_math_optimizations
8217 && (fcode == BUILT_IN_POW
8218 || fcode == BUILT_IN_POWF
8219 || fcode == BUILT_IN_POWL))
8221 tree arg00 = TREE_VALUE (TREE_OPERAND (arg0, 1));
8222 tree arg01 = TREE_VALUE (TREE_CHAIN (TREE_OPERAND (arg0, 1)));
8223 tree narg1 = fold (build2 (MULT_EXPR, type, arg01, arg1));
8224 arglist = tree_cons (NULL_TREE, arg00,
8225 build_tree_list (NULL_TREE, narg1));
8226 return build_function_call_expr (fndecl, arglist);
8234 return fold_builtin_inf (type, true);
8236 case BUILT_IN_HUGE_VAL:
8237 case BUILT_IN_HUGE_VALF:
8238 case BUILT_IN_HUGE_VALL:
8239 return fold_builtin_inf (type, false);
8244 return fold_builtin_nan (arglist, type, true);
8247 case BUILT_IN_NANSF:
8248 case BUILT_IN_NANSL:
8249 return fold_builtin_nan (arglist, type, false);
8251 case BUILT_IN_FLOOR:
8252 case BUILT_IN_FLOORF:
8253 case BUILT_IN_FLOORL:
8254 return fold_builtin_floor (exp);
8257 case BUILT_IN_CEILF:
8258 case BUILT_IN_CEILL:
8259 return fold_builtin_ceil (exp);
8261 case BUILT_IN_TRUNC:
8262 case BUILT_IN_TRUNCF:
8263 case BUILT_IN_TRUNCL:
8264 return fold_builtin_trunc (exp);
8266 case BUILT_IN_ROUND:
8267 case BUILT_IN_ROUNDF:
8268 case BUILT_IN_ROUNDL:
8269 return fold_builtin_round (exp);
8271 case BUILT_IN_NEARBYINT:
8272 case BUILT_IN_NEARBYINTF:
8273 case BUILT_IN_NEARBYINTL:
8275 case BUILT_IN_RINTF:
8276 case BUILT_IN_RINTL:
8277 return fold_trunc_transparent_mathfn (exp);
8279 case BUILT_IN_LROUND:
8280 case BUILT_IN_LROUNDF:
8281 case BUILT_IN_LROUNDL:
8282 case BUILT_IN_LLROUND:
8283 case BUILT_IN_LLROUNDF:
8284 case BUILT_IN_LLROUNDL:
8285 return fold_builtin_lround (exp);
8287 case BUILT_IN_LRINT:
8288 case BUILT_IN_LRINTF:
8289 case BUILT_IN_LRINTL:
8290 case BUILT_IN_LLRINT:
8291 case BUILT_IN_LLRINTF:
8292 case BUILT_IN_LLRINTL:
8293 return fold_fixed_mathfn (exp);
8297 case BUILT_IN_FFSLL:
8300 case BUILT_IN_CLZLL:
8303 case BUILT_IN_CTZLL:
8304 case BUILT_IN_POPCOUNT:
8305 case BUILT_IN_POPCOUNTL:
8306 case BUILT_IN_POPCOUNTLL:
8307 case BUILT_IN_PARITY:
8308 case BUILT_IN_PARITYL:
8309 case BUILT_IN_PARITYLL:
8310 return fold_builtin_bitop (exp);
8312 case BUILT_IN_MEMCPY:
8313 return fold_builtin_memcpy (exp);
8315 case BUILT_IN_MEMPCPY:
8316 return fold_builtin_mempcpy (exp);
8318 case BUILT_IN_MEMMOVE:
8319 return fold_builtin_memmove (exp);
8321 case BUILT_IN_STRCPY:
8322 return fold_builtin_strcpy (exp, NULL_TREE);
8324 case BUILT_IN_STRNCPY:
8325 return fold_builtin_strncpy (exp, NULL_TREE);
8327 case BUILT_IN_INDEX:
8328 case BUILT_IN_STRCHR:
8329 return fold_builtin_strchr (exp, false);
8331 case BUILT_IN_RINDEX:
8332 case BUILT_IN_STRRCHR:
8333 return fold_builtin_strchr (exp, true);
8335 case BUILT_IN_MEMCMP:
8336 return fold_builtin_memcmp (arglist);
8338 case BUILT_IN_STRCMP:
8339 return fold_builtin_strcmp (arglist);
8341 case BUILT_IN_STRNCMP:
8342 return fold_builtin_strncmp (arglist);
8344 case BUILT_IN_SIGNBIT:
8345 case BUILT_IN_SIGNBITF:
8346 case BUILT_IN_SIGNBITL:
8347 return fold_builtin_signbit (exp);
8349 case BUILT_IN_ISASCII:
8350 return fold_builtin_isascii (arglist);
8352 case BUILT_IN_TOASCII:
8353 return fold_builtin_toascii (arglist);
8355 case BUILT_IN_ISDIGIT:
8356 return fold_builtin_isdigit (arglist);
8358 case BUILT_IN_COPYSIGN:
8359 case BUILT_IN_COPYSIGNF:
8360 case BUILT_IN_COPYSIGNL:
8361 return fold_builtin_copysign (arglist, type);
8363 case BUILT_IN_FINITE:
8364 case BUILT_IN_FINITEF:
8365 case BUILT_IN_FINITEL:
8366 return fold_builtin_classify (exp, BUILT_IN_FINITE);
8368 case BUILT_IN_ISINF:
8369 case BUILT_IN_ISINFF:
8370 case BUILT_IN_ISINFL:
8371 return fold_builtin_classify (exp, BUILT_IN_ISINF);
8373 case BUILT_IN_ISNAN:
8374 case BUILT_IN_ISNANF:
8375 case BUILT_IN_ISNANL:
8376 return fold_builtin_classify (exp, BUILT_IN_ISNAN);
8378 case BUILT_IN_ISGREATER:
8379 return fold_builtin_unordered_cmp (exp, UNLE_EXPR, LE_EXPR);
8380 case BUILT_IN_ISGREATEREQUAL:
8381 return fold_builtin_unordered_cmp (exp, UNLT_EXPR, LT_EXPR);
8382 case BUILT_IN_ISLESS:
8383 return fold_builtin_unordered_cmp (exp, UNGE_EXPR, GE_EXPR);
8384 case BUILT_IN_ISLESSEQUAL:
8385 return fold_builtin_unordered_cmp (exp, UNGT_EXPR, GT_EXPR);
8386 case BUILT_IN_ISLESSGREATER:
8387 return fold_builtin_unordered_cmp (exp, UNEQ_EXPR, EQ_EXPR);
8388 case BUILT_IN_ISUNORDERED:
8389 return fold_builtin_unordered_cmp (exp, UNORDERED_EXPR, NOP_EXPR);
8391 case BUILT_IN_FPUTS:
8392 return fold_builtin_fputs (arglist, ignore, false, NULL_TREE);
8394 case BUILT_IN_FPUTS_UNLOCKED:
8395 return fold_builtin_fputs (arglist, ignore, true, NULL_TREE);
8404 /* A wrapper function for builtin folding that prevents warnings for
8405 "statement without effect" and the like, caused by removing the
8406 call node earlier than the warning is generated. */
8409 fold_builtin (tree exp, bool ignore)
8411 exp = fold_builtin_1 (exp, ignore);
8414 /* ??? Don't clobber shared nodes such as integer_zero_node. */
8415 if (TREE_CODE_CLASS (TREE_CODE (exp)) == 'c')
8416 exp = build1 (NOP_EXPR, TREE_TYPE (exp), exp);
8417 TREE_NO_WARNING (exp) = 1;
8422 /* Conveniently construct a function call expression. */
8425 build_function_call_expr (tree fn, tree arglist)
8429 call_expr = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn);
8430 call_expr = build3 (CALL_EXPR, TREE_TYPE (TREE_TYPE (fn)),
8431 call_expr, arglist, NULL_TREE);
8432 return fold (call_expr);
8435 /* This function validates the types of a function call argument list
8436 represented as a tree chain of parameters against a specified list
8437 of tree_codes. If the last specifier is a 0, that represents an
8438 ellipses, otherwise the last specifier must be a VOID_TYPE. */
8441 validate_arglist (tree arglist, ...)
8443 enum tree_code code;
8447 va_start (ap, arglist);
8451 code = va_arg (ap, enum tree_code);
8455 /* This signifies an ellipses, any further arguments are all ok. */
8459 /* This signifies an endlink, if no arguments remain, return
8460 true, otherwise return false. */
8464 /* If no parameters remain or the parameter's code does not
8465 match the specified code, return false. Otherwise continue
8466 checking any remaining arguments. */
8468 || code != TREE_CODE (TREE_TYPE (TREE_VALUE (arglist))))
8472 arglist = TREE_CHAIN (arglist);
8476 /* We need gotos here since we can only have one VA_CLOSE in a
8484 /* Default target-specific builtin expander that does nothing. */
8487 default_expand_builtin (tree exp ATTRIBUTE_UNUSED,
8488 rtx target ATTRIBUTE_UNUSED,
8489 rtx subtarget ATTRIBUTE_UNUSED,
8490 enum machine_mode mode ATTRIBUTE_UNUSED,
8491 int ignore ATTRIBUTE_UNUSED)
8496 /* Returns true is EXP represents data that would potentially reside
8497 in a readonly section. */
8500 readonly_data_expr (tree exp)
8504 if (TREE_CODE (exp) != ADDR_EXPR)
8507 exp = get_base_address (TREE_OPERAND (exp, 0));
8511 /* Make sure we call decl_readonly_section only for trees it
8512 can handle (since it returns true for everything it doesn't
8514 if (TREE_CODE (exp) == STRING_CST
8515 || TREE_CODE (exp) == CONSTRUCTOR
8516 || (TREE_CODE (exp) == VAR_DECL && TREE_STATIC (exp)))
8517 return decl_readonly_section (exp, 0);
8522 /* Front-end to the simplify_builtin_XXX routines.
8524 EXP is a call to a builtin function. If possible try to simplify
8525 that into a constant, expression or call to a more efficient
8528 If IGNORE is nonzero, then the result of this builtin function
8531 If simplification is possible, return the simplified tree, otherwise
8532 return NULL_TREE. */
8535 simplify_builtin (tree exp, int ignore)
8537 tree fndecl = TREE_OPERAND (TREE_OPERAND (exp, 0), 0);
8538 tree arglist = TREE_OPERAND (exp, 1);
8539 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
8544 case BUILT_IN_FPUTS:
8545 val = fold_builtin_fputs (arglist, ignore, false, NULL_TREE);
8547 case BUILT_IN_FPUTS_UNLOCKED:
8548 val = fold_builtin_fputs (arglist, ignore, true, NULL_TREE);
8550 case BUILT_IN_STRSTR:
8551 val = simplify_builtin_strstr (arglist);
8553 case BUILT_IN_STRCAT:
8554 val = simplify_builtin_strcat (arglist);
8556 case BUILT_IN_STRNCAT:
8557 val = simplify_builtin_strncat (arglist);
8559 case BUILT_IN_STRSPN:
8560 val = simplify_builtin_strspn (arglist);
8562 case BUILT_IN_STRCSPN:
8563 val = simplify_builtin_strcspn (arglist);
8565 case BUILT_IN_STRCHR:
8566 case BUILT_IN_INDEX:
8567 val = simplify_builtin_strchr (arglist);
8569 case BUILT_IN_STRRCHR:
8570 case BUILT_IN_RINDEX:
8571 val = simplify_builtin_strrchr (arglist);
8573 case BUILT_IN_STRCPY:
8574 val = fold_builtin_strcpy (exp, NULL_TREE);
8576 case BUILT_IN_STRNCPY:
8577 val = fold_builtin_strncpy (exp, NULL_TREE);
8579 case BUILT_IN_STRCMP:
8580 val = fold_builtin_strcmp (arglist);
8582 case BUILT_IN_STRNCMP:
8583 val = fold_builtin_strncmp (arglist);
8585 case BUILT_IN_STRPBRK:
8586 val = simplify_builtin_strpbrk (arglist);
8589 case BUILT_IN_MEMCMP:
8590 val = fold_builtin_memcmp (arglist);
8592 case BUILT_IN_VA_START:
8593 simplify_builtin_va_start (arglist);
8596 case BUILT_IN_SPRINTF:
8597 val = simplify_builtin_sprintf (arglist, ignore);
8599 case BUILT_IN_CONSTANT_P:
8600 val = fold_builtin_constant_p (arglist);
8601 /* Gimplification will pull the CALL_EXPR for the builtin out of
8602 an if condition. When not optimizing, we'll not CSE it back.
8603 To avoid link error types of regressions, return false now. */
8604 if (!val && !optimize)
8605 val = integer_zero_node;
8613 val = fold_convert (TREE_TYPE (exp), val);
8617 /* Simplify a call to the strstr 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 simplify_builtin_strstr (tree arglist)
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 = strstr (p1, p2);
8655 return build_int_cst (TREE_TYPE (s1), 0);
8657 /* Return an offset into the constant string argument. */
8658 return fold (build2 (PLUS_EXPR, TREE_TYPE (s1),
8659 s1, build_int_cst (TREE_TYPE (s1), r - p1)));
8668 fn = implicit_built_in_decls[BUILT_IN_STRCHR];
8672 /* New argument list transforming strstr(s1, s2) to
8673 strchr(s1, s2[0]). */
8674 arglist = build_tree_list (NULL_TREE,
8675 build_int_cst (NULL_TREE, p2[0]));
8676 arglist = tree_cons (NULL_TREE, s1, arglist);
8677 return build_function_call_expr (fn, arglist);
8681 /* Simplify a call to the strstr builtin.
8683 Return 0 if no simplification was possible, otherwise return the
8684 simplified form of the call as a tree.
8686 The simplified form may be a constant or other expression which
8687 computes the same value, but in a more efficient manner (including
8688 calls to other builtin functions).
8690 The call may contain arguments which need to be evaluated, but
8691 which are not useful to determine the result of the call. In
8692 this case we return a chain of COMPOUND_EXPRs. The LHS of each
8693 COMPOUND_EXPR will be an argument which must be evaluated.
8694 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
8695 COMPOUND_EXPR in the chain will contain the tree for the simplified
8696 form of the builtin function call. */
8699 simplify_builtin_strchr (tree arglist)
8701 if (!validate_arglist (arglist, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
8705 tree s1 = TREE_VALUE (arglist), s2 = TREE_VALUE (TREE_CHAIN (arglist));
8708 if (TREE_CODE (s2) != INTEGER_CST)
8717 if (target_char_cast (s2, &c))
8723 return build_int_cst (TREE_TYPE (s1), 0);
8725 /* Return an offset into the constant string argument. */
8726 return fold (build2 (PLUS_EXPR, TREE_TYPE (s1),
8727 s1, build_int_cst (TREE_TYPE (s1), r - p1)));
8730 /* FIXME: Should use here strchrM optab so that ports can optimize
8736 /* Simplify a call to the strrchr builtin.
8738 Return 0 if no simplification was possible, otherwise return the
8739 simplified form of the call as a tree.
8741 The simplified form may be a constant or other expression which
8742 computes the same value, but in a more efficient manner (including
8743 calls to other builtin functions).
8745 The call may contain arguments which need to be evaluated, but
8746 which are not useful to determine the result of the call. In
8747 this case we return a chain of COMPOUND_EXPRs. The LHS of each
8748 COMPOUND_EXPR will be an argument which must be evaluated.
8749 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
8750 COMPOUND_EXPR in the chain will contain the tree for the simplified
8751 form of the builtin function call. */
8754 simplify_builtin_strrchr (tree arglist)
8756 if (!validate_arglist (arglist, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
8760 tree s1 = TREE_VALUE (arglist), s2 = TREE_VALUE (TREE_CHAIN (arglist));
8764 if (TREE_CODE (s2) != INTEGER_CST)
8773 if (target_char_cast (s2, &c))
8776 r = strrchr (p1, c);
8779 return build_int_cst (TREE_TYPE (s1), 0);
8781 /* Return an offset into the constant string argument. */
8782 return fold (build2 (PLUS_EXPR, TREE_TYPE (s1),
8783 s1, build_int_cst (TREE_TYPE (s1), r - p1)));
8786 if (! integer_zerop (s2))
8789 fn = implicit_built_in_decls[BUILT_IN_STRCHR];
8793 /* Transform strrchr(s1, '\0') to strchr(s1, '\0'). */
8794 return build_function_call_expr (fn, arglist);
8798 /* Simplify a call to the strpbrk builtin.
8800 Return 0 if no simplification was possible, otherwise return the
8801 simplified form of the call as a tree.
8803 The simplified form may be a constant or other expression which
8804 computes the same value, but in a more efficient manner (including
8805 calls to other builtin functions).
8807 The call may contain arguments which need to be evaluated, but
8808 which are not useful to determine the result of the call. In
8809 this case we return a chain of COMPOUND_EXPRs. The LHS of each
8810 COMPOUND_EXPR will be an argument which must be evaluated.
8811 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
8812 COMPOUND_EXPR in the chain will contain the tree for the simplified
8813 form of the builtin function call. */
8816 simplify_builtin_strpbrk (tree arglist)
8818 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
8822 tree s1 = TREE_VALUE (arglist), s2 = TREE_VALUE (TREE_CHAIN (arglist));
8824 const char *p1, *p2;
8833 const char *r = strpbrk (p1, p2);
8836 return build_int_cst (TREE_TYPE (s1), 0);
8838 /* Return an offset into the constant string argument. */
8839 return fold (build2 (PLUS_EXPR, TREE_TYPE (s1),
8840 s1, build_int_cst (TREE_TYPE (s1), r - p1)));
8844 /* strpbrk(x, "") == NULL.
8845 Evaluate and ignore s1 in case it had side-effects. */
8846 return omit_one_operand (TREE_TYPE (s1), integer_zero_node, s1);
8849 return 0; /* Really call strpbrk. */
8851 fn = implicit_built_in_decls[BUILT_IN_STRCHR];
8855 /* New argument list transforming strpbrk(s1, s2) to
8856 strchr(s1, s2[0]). */
8857 arglist = build_tree_list (NULL_TREE,
8858 build_int_cst (NULL_TREE, p2[0]));
8859 arglist = tree_cons (NULL_TREE, s1, arglist);
8860 return build_function_call_expr (fn, arglist);
8864 /* Simplify a call to the strcat builtin.
8866 Return 0 if no simplification was possible, otherwise return the
8867 simplified form of the call as a tree.
8869 The simplified form may be a constant or other expression which
8870 computes the same value, but in a more efficient manner (including
8871 calls to other builtin functions).
8873 The call may contain arguments which need to be evaluated, but
8874 which are not useful to determine the result of the call. In
8875 this case we return a chain of COMPOUND_EXPRs. The LHS of each
8876 COMPOUND_EXPR will be an argument which must be evaluated.
8877 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
8878 COMPOUND_EXPR in the chain will contain the tree for the simplified
8879 form of the builtin function call. */
8882 simplify_builtin_strcat (tree arglist)
8884 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
8888 tree dst = TREE_VALUE (arglist),
8889 src = TREE_VALUE (TREE_CHAIN (arglist));
8890 const char *p = c_getstr (src);
8892 /* If the string length is zero, return the dst parameter. */
8893 if (p && *p == '\0')
8900 /* Simplify a call to the strncat builtin.
8902 Return 0 if no simplification was possible, otherwise return the
8903 simplified form of the call as a tree.
8905 The simplified form may be a constant or other expression which
8906 computes the same value, but in a more efficient manner (including
8907 calls to other builtin functions).
8909 The call may contain arguments which need to be evaluated, but
8910 which are not useful to determine the result of the call. In
8911 this case we return a chain of COMPOUND_EXPRs. The LHS of each
8912 COMPOUND_EXPR will be an argument which must be evaluated.
8913 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
8914 COMPOUND_EXPR in the chain will contain the tree for the simplified
8915 form of the builtin function call. */
8918 simplify_builtin_strncat (tree arglist)
8920 if (!validate_arglist (arglist,
8921 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
8925 tree dst = TREE_VALUE (arglist);
8926 tree src = TREE_VALUE (TREE_CHAIN (arglist));
8927 tree len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
8928 const char *p = c_getstr (src);
8930 /* If the requested length is zero, or the src parameter string
8931 length is zero, return the dst parameter. */
8932 if (integer_zerop (len) || (p && *p == '\0'))
8933 return omit_two_operands (TREE_TYPE (dst), dst, src, len);
8935 /* If the requested len is greater than or equal to the string
8936 length, call strcat. */
8937 if (TREE_CODE (len) == INTEGER_CST && p
8938 && compare_tree_int (len, strlen (p)) >= 0)
8941 = tree_cons (NULL_TREE, dst, build_tree_list (NULL_TREE, src));
8942 tree fn = implicit_built_in_decls[BUILT_IN_STRCAT];
8944 /* If the replacement _DECL isn't initialized, don't do the
8949 return build_function_call_expr (fn, newarglist);
8955 /* Simplify a call to the strspn builtin.
8957 Return 0 if no simplification was possible, otherwise return the
8958 simplified form of the call as a tree.
8960 The simplified form may be a constant or other expression which
8961 computes the same value, but in a more efficient manner (including
8962 calls to other builtin functions).
8964 The call may contain arguments which need to be evaluated, but
8965 which are not useful to determine the result of the call. In
8966 this case we return a chain of COMPOUND_EXPRs. The LHS of each
8967 COMPOUND_EXPR will be an argument which must be evaluated.
8968 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
8969 COMPOUND_EXPR in the chain will contain the tree for the simplified
8970 form of the builtin function call. */
8973 simplify_builtin_strspn (tree arglist)
8975 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
8979 tree s1 = TREE_VALUE (arglist), s2 = TREE_VALUE (TREE_CHAIN (arglist));
8980 const char *p1 = c_getstr (s1), *p2 = c_getstr (s2);
8982 /* If both arguments are constants, evaluate at compile-time. */
8985 const size_t r = strspn (p1, p2);
8986 return size_int (r);
8989 /* If either argument is "", return 0. */
8990 if ((p1 && *p1 == '\0') || (p2 && *p2 == '\0'))
8991 /* Evaluate and ignore both arguments in case either one has
8993 return omit_two_operands (integer_type_node, integer_zero_node,
8999 /* Simplify a call to the strcspn builtin.
9001 Return 0 if no simplification was possible, otherwise return the
9002 simplified form of the call as a tree.
9004 The simplified form may be a constant or other expression which
9005 computes the same value, but in a more efficient manner (including
9006 calls to other builtin functions).
9008 The call may contain arguments which need to be evaluated, but
9009 which are not useful to determine the result of the call. In
9010 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9011 COMPOUND_EXPR will be an argument which must be evaluated.
9012 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9013 COMPOUND_EXPR in the chain will contain the tree for the simplified
9014 form of the builtin function call. */
9017 simplify_builtin_strcspn (tree arglist)
9019 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
9023 tree s1 = TREE_VALUE (arglist), s2 = TREE_VALUE (TREE_CHAIN (arglist));
9024 const char *p1 = c_getstr (s1), *p2 = c_getstr (s2);
9026 /* If both arguments are constants, evaluate at compile-time. */
9029 const size_t r = strcspn (p1, p2);
9030 return size_int (r);
9033 /* If the first argument is "", return 0. */
9034 if (p1 && *p1 == '\0')
9036 /* Evaluate and ignore argument s2 in case it has
9038 return omit_one_operand (integer_type_node,
9039 integer_zero_node, s2);
9042 /* If the second argument is "", return __builtin_strlen(s1). */
9043 if (p2 && *p2 == '\0')
9045 tree newarglist = build_tree_list (NULL_TREE, s1),
9046 fn = implicit_built_in_decls[BUILT_IN_STRLEN];
9048 /* If the replacement _DECL isn't initialized, don't do the
9053 return build_function_call_expr (fn, newarglist);
9059 /* Fold a call to the fputs builtin. IGNORE is true if the value returned
9060 by the builtin will be ignored. UNLOCKED is true is true if this
9061 actually a call to fputs_unlocked. If LEN in non-NULL, it represents
9062 the known length of the string. Return NULL_TREE if no simplification
9066 fold_builtin_fputs (tree arglist, bool ignore, bool unlocked, tree len)
9069 tree fn_fputc = unlocked ? implicit_built_in_decls[BUILT_IN_FPUTC_UNLOCKED]
9070 : implicit_built_in_decls[BUILT_IN_FPUTC];
9071 tree fn_fwrite = unlocked ? implicit_built_in_decls[BUILT_IN_FWRITE_UNLOCKED]
9072 : implicit_built_in_decls[BUILT_IN_FWRITE];
9074 /* If the return value is used, or the replacement _DECL isn't
9075 initialized, don't do the transformation. */
9076 if (!ignore || !fn_fputc || !fn_fwrite)
9079 /* Verify the arguments in the original call. */
9080 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
9084 len = c_strlen (TREE_VALUE (arglist), 0);
9086 /* Get the length of the string passed to fputs. If the length
9087 can't be determined, punt. */
9089 || TREE_CODE (len) != INTEGER_CST)
9092 switch (compare_tree_int (len, 1))
9094 case -1: /* length is 0, delete the call entirely . */
9095 return omit_one_operand (integer_type_node, integer_zero_node,
9096 TREE_VALUE (TREE_CHAIN (arglist)));
9098 case 0: /* length is 1, call fputc. */
9100 const char *p = c_getstr (TREE_VALUE (arglist));
9104 /* New argument list transforming fputs(string, stream) to
9105 fputc(string[0], stream). */
9106 arglist = build_tree_list (NULL_TREE,
9107 TREE_VALUE (TREE_CHAIN (arglist)));
9108 arglist = tree_cons (NULL_TREE,
9109 build_int_cst (NULL_TREE, p[0]),
9116 case 1: /* length is greater than 1, call fwrite. */
9120 /* If optimizing for size keep fputs. */
9123 string_arg = TREE_VALUE (arglist);
9124 /* New argument list transforming fputs(string, stream) to
9125 fwrite(string, 1, len, stream). */
9126 arglist = build_tree_list (NULL_TREE,
9127 TREE_VALUE (TREE_CHAIN (arglist)));
9128 arglist = tree_cons (NULL_TREE, len, arglist);
9129 arglist = tree_cons (NULL_TREE, size_one_node, arglist);
9130 arglist = tree_cons (NULL_TREE, string_arg, arglist);
9138 /* These optimizations are only performed when the result is ignored,
9139 hence there's no need to cast the result to integer_type_node. */
9140 return build_function_call_expr (fn, arglist);
9144 simplify_builtin_va_start (tree arglist)
9146 tree chain = TREE_CHAIN (arglist);
9148 if (TREE_CHAIN (chain))
9149 error ("too many arguments to function `va_start'");
9151 simplify_builtin_next_arg (chain);
9155 simplify_builtin_next_arg (tree arglist)
9157 tree fntype = TREE_TYPE (current_function_decl);
9159 if (TYPE_ARG_TYPES (fntype) == 0
9160 || (TREE_VALUE (tree_last (TYPE_ARG_TYPES (fntype)))
9162 error ("`va_start' used in function with fixed args");
9165 tree last_parm = tree_last (DECL_ARGUMENTS (current_function_decl));
9166 tree arg = TREE_VALUE (arglist);
9168 /* Strip off all nops for the sake of the comparison. This
9169 is not quite the same as STRIP_NOPS. It does more.
9170 We must also strip off INDIRECT_EXPR for C++ reference
9172 while (TREE_CODE (arg) == NOP_EXPR
9173 || TREE_CODE (arg) == CONVERT_EXPR
9174 || TREE_CODE (arg) == NON_LVALUE_EXPR
9175 || TREE_CODE (arg) == INDIRECT_REF)
9176 arg = TREE_OPERAND (arg, 0);
9177 if (arg != last_parm)
9178 warning ("second parameter of `va_start' not last named argument");
9179 TREE_VALUE (arglist) = arg;
9182 /* Evidently an out of date version of <stdarg.h>; can't validate
9183 va_start's second argument, but can still work as intended. */
9184 warning ("`__builtin_next_arg' called without an argument");
9188 /* Simplify a call to the sprintf builtin.
9190 Return 0 if no simplification was possible, otherwise return the
9191 simplified form of the call as a tree. If IGNORED is true, it means that
9192 the caller does not use the returned value of the function. */
9195 simplify_builtin_sprintf (tree arglist, int ignored)
9197 tree call, retval, dest, fmt;
9198 const char *fmt_str = NULL;
9200 /* Verify the required arguments in the original call. We deal with two
9201 types of sprintf() calls: 'sprintf (str, fmt)' and
9202 'sprintf (dest, "%s", orig)'. */
9203 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE)
9204 && !validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, POINTER_TYPE,
9208 /* Get the destination string and the format specifier. */
9209 dest = TREE_VALUE (arglist);
9210 fmt = TREE_VALUE (TREE_CHAIN (arglist));
9212 /* Check whether the format is a literal string constant. */
9213 fmt_str = c_getstr (fmt);
9214 if (fmt_str == NULL)
9220 /* If the format doesn't contain % args or %%, use strcpy. */
9221 if (strchr (fmt_str, '%') == NULL)
9223 tree fn = implicit_built_in_decls[BUILT_IN_STRCPY];
9228 /* Convert sprintf (str, fmt) into strcpy (str, fmt) when
9229 'format' is known to contain no % formats. */
9230 arglist = build_tree_list (NULL_TREE, fmt);
9231 arglist = tree_cons (NULL_TREE, dest, arglist);
9232 call = build_function_call_expr (fn, arglist);
9234 retval = build_int_cst (NULL_TREE, strlen (fmt_str));
9237 /* If the format is "%s", use strcpy if the result isn't used. */
9238 else if (fmt_str && strcmp (fmt_str, "%s") == 0)
9241 fn = implicit_built_in_decls[BUILT_IN_STRCPY];
9246 /* Convert sprintf (str1, "%s", str2) into strcpy (str1, str2). */
9247 orig = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
9248 arglist = build_tree_list (NULL_TREE, orig);
9249 arglist = tree_cons (NULL_TREE, dest, arglist);
9252 retval = c_strlen (orig, 1);
9253 if (!retval || TREE_CODE (retval) != INTEGER_CST)
9256 call = build_function_call_expr (fn, arglist);
9262 (TREE_TYPE (TREE_TYPE (implicit_built_in_decls[BUILT_IN_SPRINTF])),
9264 return build2 (COMPOUND_EXPR, TREE_TYPE (retval), call, retval);