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"
32 #include "hard-reg-set.h"
35 #include "insn-config.h"
41 #include "typeclass.h"
46 #include "langhooks.h"
48 #define CALLED_AS_BUILT_IN(NODE) \
49 (!strncmp (IDENTIFIER_POINTER (DECL_NAME (NODE)), "__builtin_", 10))
51 /* Register mappings for target machines without register windows. */
52 #ifndef INCOMING_REGNO
53 #define INCOMING_REGNO(OUT) (OUT)
55 #ifndef OUTGOING_REGNO
56 #define OUTGOING_REGNO(IN) (IN)
59 #ifndef PAD_VARARGS_DOWN
60 #define PAD_VARARGS_DOWN BYTES_BIG_ENDIAN
63 /* Define the names of the builtin function types and codes. */
64 const char *const built_in_class_names[4]
65 = {"NOT_BUILT_IN", "BUILT_IN_FRONTEND", "BUILT_IN_MD", "BUILT_IN_NORMAL"};
67 #define DEF_BUILTIN(X, N, C, T, LT, B, F, NA, AT, IM) #X,
68 const char *const built_in_names[(int) END_BUILTINS] =
70 #include "builtins.def"
74 /* Setup an array of _DECL trees, make sure each element is
75 initialized to NULL_TREE. */
76 tree built_in_decls[(int) END_BUILTINS];
77 /* Declarations used when constructing the builtin implicitly in the compiler.
78 It may be NULL_TREE when this is invalid (for instance runtime is not
79 required to implement the function call in all cases. */
80 tree implicit_built_in_decls[(int) END_BUILTINS];
82 static int get_pointer_alignment (tree, unsigned int);
83 static tree c_strlen (tree, int);
84 static const char *c_getstr (tree);
85 static rtx c_readstr (const char *, enum machine_mode);
86 static int target_char_cast (tree, char *);
87 static rtx get_memory_rtx (tree);
88 static tree build_string_literal (int, const char *);
89 static int apply_args_size (void);
90 static int apply_result_size (void);
91 #if defined (HAVE_untyped_call) || defined (HAVE_untyped_return)
92 static rtx result_vector (int, rtx);
94 static rtx expand_builtin_setjmp (tree, rtx);
95 static void expand_builtin_prefetch (tree);
96 static rtx expand_builtin_apply_args (void);
97 static rtx expand_builtin_apply_args_1 (void);
98 static rtx expand_builtin_apply (rtx, rtx, rtx);
99 static void expand_builtin_return (rtx);
100 static enum type_class type_to_class (tree);
101 static rtx expand_builtin_classify_type (tree);
102 static void expand_errno_check (tree, rtx);
103 static rtx expand_builtin_mathfn (tree, rtx, rtx);
104 static rtx expand_builtin_mathfn_2 (tree, rtx, rtx);
105 static rtx expand_builtin_constant_p (tree, enum machine_mode);
106 static rtx expand_builtin_args_info (tree);
107 static rtx expand_builtin_next_arg (tree);
108 static rtx expand_builtin_va_start (tree);
109 static rtx expand_builtin_va_end (tree);
110 static rtx expand_builtin_va_copy (tree);
111 static rtx expand_builtin_memcmp (tree, tree, rtx, enum machine_mode);
112 static rtx expand_builtin_strcmp (tree, rtx, enum machine_mode);
113 static rtx expand_builtin_strncmp (tree, rtx, enum machine_mode);
114 static rtx builtin_memcpy_read_str (void *, HOST_WIDE_INT, enum machine_mode);
115 static rtx expand_builtin_strcat (tree, rtx, enum machine_mode);
116 static rtx expand_builtin_strncat (tree, rtx, enum machine_mode);
117 static rtx expand_builtin_strspn (tree, rtx, enum machine_mode);
118 static rtx expand_builtin_strcspn (tree, rtx, enum machine_mode);
119 static rtx expand_builtin_memcpy (tree, rtx, enum machine_mode);
120 static rtx expand_builtin_mempcpy (tree, rtx, enum machine_mode, int);
121 static rtx expand_builtin_memmove (tree, rtx, enum machine_mode);
122 static rtx expand_builtin_bcopy (tree);
123 static rtx expand_builtin_strcpy (tree, rtx, enum machine_mode);
124 static rtx expand_builtin_stpcpy (tree, rtx, enum machine_mode);
125 static rtx builtin_strncpy_read_str (void *, HOST_WIDE_INT, enum machine_mode);
126 static rtx expand_builtin_strncpy (tree, rtx, enum machine_mode);
127 static rtx builtin_memset_read_str (void *, HOST_WIDE_INT, enum machine_mode);
128 static rtx builtin_memset_gen_str (void *, HOST_WIDE_INT, enum machine_mode);
129 static rtx expand_builtin_memset (tree, rtx, enum machine_mode);
130 static rtx expand_builtin_bzero (tree);
131 static rtx expand_builtin_strlen (tree, rtx, enum machine_mode);
132 static rtx expand_builtin_strstr (tree, rtx, enum machine_mode);
133 static rtx expand_builtin_strpbrk (tree, rtx, enum machine_mode);
134 static rtx expand_builtin_strchr (tree, rtx, enum machine_mode);
135 static rtx expand_builtin_strrchr (tree, rtx, enum machine_mode);
136 static rtx expand_builtin_alloca (tree, rtx);
137 static rtx expand_builtin_unop (enum machine_mode, tree, rtx, rtx, optab);
138 static rtx expand_builtin_frame_address (tree, tree);
139 static rtx expand_builtin_fputs (tree, rtx, bool);
140 static rtx expand_builtin_printf (tree, rtx, enum machine_mode, bool);
141 static rtx expand_builtin_fprintf (tree, rtx, enum machine_mode, bool);
142 static rtx expand_builtin_sprintf (tree, rtx, enum machine_mode);
143 static tree stabilize_va_list (tree, int);
144 static rtx expand_builtin_expect (tree, rtx);
145 static tree fold_builtin_constant_p (tree);
146 static tree fold_builtin_classify_type (tree);
147 static tree fold_builtin_inf (tree, int);
148 static tree fold_builtin_nan (tree, tree, int);
149 static int validate_arglist (tree, ...);
150 static bool integer_valued_real_p (tree);
151 static tree fold_trunc_transparent_mathfn (tree);
152 static bool readonly_data_expr (tree);
153 static rtx expand_builtin_fabs (tree, rtx, rtx);
154 static rtx expand_builtin_cabs (tree, rtx);
155 static tree fold_builtin_cabs (tree, tree, tree);
156 static tree fold_builtin_trunc (tree);
157 static tree fold_builtin_floor (tree);
158 static tree fold_builtin_ceil (tree);
159 static tree fold_builtin_bitop (tree);
160 static tree fold_builtin_memcpy (tree);
161 static tree fold_builtin_mempcpy (tree);
162 static tree fold_builtin_memmove (tree);
163 static tree fold_builtin_strcpy (tree);
164 static tree fold_builtin_strncpy (tree);
165 static tree fold_builtin_memcmp (tree);
166 static tree fold_builtin_strcmp (tree);
167 static tree fold_builtin_strncmp (tree);
169 /* Return the alignment in bits of EXP, a pointer valued expression.
170 But don't return more than MAX_ALIGN no matter what.
171 The alignment returned is, by default, the alignment of the thing that
172 EXP points to. If it is not a POINTER_TYPE, 0 is returned.
174 Otherwise, look at the expression to see if we can do better, i.e., if the
175 expression is actually pointing at an object whose alignment is tighter. */
178 get_pointer_alignment (tree exp, unsigned int max_align)
180 unsigned int align, inner;
182 if (TREE_CODE (TREE_TYPE (exp)) != POINTER_TYPE)
185 align = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (exp)));
186 align = MIN (align, max_align);
190 switch (TREE_CODE (exp))
194 case NON_LVALUE_EXPR:
195 exp = TREE_OPERAND (exp, 0);
196 if (TREE_CODE (TREE_TYPE (exp)) != POINTER_TYPE)
199 inner = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (exp)));
200 align = MIN (inner, max_align);
204 /* If sum of pointer + int, restrict our maximum alignment to that
205 imposed by the integer. If not, we can't do any better than
207 if (! host_integerp (TREE_OPERAND (exp, 1), 1))
210 while (((tree_low_cst (TREE_OPERAND (exp, 1), 1))
211 & (max_align / BITS_PER_UNIT - 1))
215 exp = TREE_OPERAND (exp, 0);
219 /* See what we are pointing at and look at its alignment. */
220 exp = TREE_OPERAND (exp, 0);
221 if (TREE_CODE (exp) == FUNCTION_DECL)
222 align = FUNCTION_BOUNDARY;
223 else if (DECL_P (exp))
224 align = DECL_ALIGN (exp);
225 #ifdef CONSTANT_ALIGNMENT
226 else if (TREE_CODE_CLASS (TREE_CODE (exp)) == 'c')
227 align = CONSTANT_ALIGNMENT (exp, align);
229 return MIN (align, max_align);
237 /* Compute the length of a C string. TREE_STRING_LENGTH is not the right
238 way, because it could contain a zero byte in the middle.
239 TREE_STRING_LENGTH is the size of the character array, not the string.
241 ONLY_VALUE should be nonzero if the result is not going to be emitted
242 into the instruction stream and zero if it is going to be expanded.
243 E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3
244 is returned, otherwise NULL, since
245 len = c_strlen (src, 1); if (len) expand_expr (len, ...); would not
246 evaluate the side-effects.
248 The value returned is of type `ssizetype'.
250 Unfortunately, string_constant can't access the values of const char
251 arrays with initializers, so neither can we do so here. */
254 c_strlen (tree src, int only_value)
257 HOST_WIDE_INT offset;
262 if (TREE_CODE (src) == COND_EXPR
263 && (only_value || !TREE_SIDE_EFFECTS (TREE_OPERAND (src, 0))))
267 len1 = c_strlen (TREE_OPERAND (src, 1), only_value);
268 len2 = c_strlen (TREE_OPERAND (src, 2), only_value);
269 if (tree_int_cst_equal (len1, len2))
273 if (TREE_CODE (src) == COMPOUND_EXPR
274 && (only_value || !TREE_SIDE_EFFECTS (TREE_OPERAND (src, 0))))
275 return c_strlen (TREE_OPERAND (src, 1), only_value);
277 src = string_constant (src, &offset_node);
281 max = TREE_STRING_LENGTH (src) - 1;
282 ptr = TREE_STRING_POINTER (src);
284 if (offset_node && TREE_CODE (offset_node) != INTEGER_CST)
286 /* If the string has an internal zero byte (e.g., "foo\0bar"), we can't
287 compute the offset to the following null if we don't know where to
288 start searching for it. */
291 for (i = 0; i < max; i++)
295 /* We don't know the starting offset, but we do know that the string
296 has no internal zero bytes. We can assume that the offset falls
297 within the bounds of the string; otherwise, the programmer deserves
298 what he gets. Subtract the offset from the length of the string,
299 and return that. This would perhaps not be valid if we were dealing
300 with named arrays in addition to literal string constants. */
302 return size_diffop (size_int (max), offset_node);
305 /* We have a known offset into the string. Start searching there for
306 a null character if we can represent it as a single HOST_WIDE_INT. */
307 if (offset_node == 0)
309 else if (! host_integerp (offset_node, 0))
312 offset = tree_low_cst (offset_node, 0);
314 /* If the offset is known to be out of bounds, warn, and call strlen at
316 if (offset < 0 || offset > max)
318 warning ("offset outside bounds of constant string");
322 /* Use strlen to search for the first zero byte. Since any strings
323 constructed with build_string will have nulls appended, we win even
324 if we get handed something like (char[4])"abcd".
326 Since OFFSET is our starting index into the string, no further
327 calculation is needed. */
328 return ssize_int (strlen (ptr + offset));
331 /* Return a char pointer for a C string if it is a string constant
332 or sum of string constant and integer constant. */
339 src = string_constant (src, &offset_node);
343 if (offset_node == 0)
344 return TREE_STRING_POINTER (src);
345 else if (!host_integerp (offset_node, 1)
346 || compare_tree_int (offset_node, TREE_STRING_LENGTH (src) - 1) > 0)
349 return TREE_STRING_POINTER (src) + tree_low_cst (offset_node, 1);
352 /* Return a CONST_INT or CONST_DOUBLE corresponding to target reading
353 GET_MODE_BITSIZE (MODE) bits from string constant STR. */
356 c_readstr (const char *str, enum machine_mode mode)
362 if (GET_MODE_CLASS (mode) != MODE_INT)
367 for (i = 0; i < GET_MODE_SIZE (mode); i++)
370 if (WORDS_BIG_ENDIAN)
371 j = GET_MODE_SIZE (mode) - i - 1;
372 if (BYTES_BIG_ENDIAN != WORDS_BIG_ENDIAN
373 && GET_MODE_SIZE (mode) > UNITS_PER_WORD)
374 j = j + UNITS_PER_WORD - 2 * (j % UNITS_PER_WORD) - 1;
376 if (j > 2 * HOST_BITS_PER_WIDE_INT)
379 ch = (unsigned char) str[i];
380 c[j / HOST_BITS_PER_WIDE_INT] |= ch << (j % HOST_BITS_PER_WIDE_INT);
382 return immed_double_const (c[0], c[1], mode);
385 /* Cast a target constant CST to target CHAR and if that value fits into
386 host char type, return zero and put that value into variable pointed by
390 target_char_cast (tree cst, char *p)
392 unsigned HOST_WIDE_INT val, hostval;
394 if (!host_integerp (cst, 1)
395 || CHAR_TYPE_SIZE > HOST_BITS_PER_WIDE_INT)
398 val = tree_low_cst (cst, 1);
399 if (CHAR_TYPE_SIZE < HOST_BITS_PER_WIDE_INT)
400 val &= (((unsigned HOST_WIDE_INT) 1) << CHAR_TYPE_SIZE) - 1;
403 if (HOST_BITS_PER_CHAR < HOST_BITS_PER_WIDE_INT)
404 hostval &= (((unsigned HOST_WIDE_INT) 1) << HOST_BITS_PER_CHAR) - 1;
413 /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT
414 times to get the address of either a higher stack frame, or a return
415 address located within it (depending on FNDECL_CODE). */
418 expand_builtin_return_addr (enum built_in_function fndecl_code, int count,
423 /* Some machines need special handling before we can access
424 arbitrary frames. For example, on the sparc, we must first flush
425 all register windows to the stack. */
426 #ifdef SETUP_FRAME_ADDRESSES
428 SETUP_FRAME_ADDRESSES ();
431 /* On the sparc, the return address is not in the frame, it is in a
432 register. There is no way to access it off of the current frame
433 pointer, but it can be accessed off the previous frame pointer by
434 reading the value from the register window save area. */
435 #ifdef RETURN_ADDR_IN_PREVIOUS_FRAME
436 if (fndecl_code == BUILT_IN_RETURN_ADDRESS)
440 /* Scan back COUNT frames to the specified frame. */
441 for (i = 0; i < count; i++)
443 /* Assume the dynamic chain pointer is in the word that the
444 frame address points to, unless otherwise specified. */
445 #ifdef DYNAMIC_CHAIN_ADDRESS
446 tem = DYNAMIC_CHAIN_ADDRESS (tem);
448 tem = memory_address (Pmode, tem);
449 tem = gen_rtx_MEM (Pmode, tem);
450 set_mem_alias_set (tem, get_frame_alias_set ());
451 tem = copy_to_reg (tem);
454 /* For __builtin_frame_address, return what we've got. */
455 if (fndecl_code == BUILT_IN_FRAME_ADDRESS)
458 /* For __builtin_return_address, Get the return address from that
460 #ifdef RETURN_ADDR_RTX
461 tem = RETURN_ADDR_RTX (count, tem);
463 tem = memory_address (Pmode,
464 plus_constant (tem, GET_MODE_SIZE (Pmode)));
465 tem = gen_rtx_MEM (Pmode, tem);
466 set_mem_alias_set (tem, get_frame_alias_set ());
471 /* Alias set used for setjmp buffer. */
472 static HOST_WIDE_INT setjmp_alias_set = -1;
474 /* Construct the leading half of a __builtin_setjmp call. Control will
475 return to RECEIVER_LABEL. This is used directly by sjlj exception
479 expand_builtin_setjmp_setup (rtx buf_addr, rtx receiver_label)
481 enum machine_mode sa_mode = STACK_SAVEAREA_MODE (SAVE_NONLOCAL);
485 if (setjmp_alias_set == -1)
486 setjmp_alias_set = new_alias_set ();
488 buf_addr = convert_memory_address (Pmode, buf_addr);
490 buf_addr = force_reg (Pmode, force_operand (buf_addr, NULL_RTX));
494 /* We store the frame pointer and the address of receiver_label in
495 the buffer and use the rest of it for the stack save area, which
496 is machine-dependent. */
498 #ifndef BUILTIN_SETJMP_FRAME_VALUE
499 #define BUILTIN_SETJMP_FRAME_VALUE virtual_stack_vars_rtx
502 mem = gen_rtx_MEM (Pmode, buf_addr);
503 set_mem_alias_set (mem, setjmp_alias_set);
504 emit_move_insn (mem, BUILTIN_SETJMP_FRAME_VALUE);
506 mem = gen_rtx_MEM (Pmode, plus_constant (buf_addr, GET_MODE_SIZE (Pmode))),
507 set_mem_alias_set (mem, setjmp_alias_set);
509 emit_move_insn (validize_mem (mem),
510 force_reg (Pmode, gen_rtx_LABEL_REF (Pmode, receiver_label)));
512 stack_save = gen_rtx_MEM (sa_mode,
513 plus_constant (buf_addr,
514 2 * GET_MODE_SIZE (Pmode)));
515 set_mem_alias_set (stack_save, setjmp_alias_set);
516 emit_stack_save (SAVE_NONLOCAL, &stack_save, NULL_RTX);
518 /* If there is further processing to do, do it. */
519 #ifdef HAVE_builtin_setjmp_setup
520 if (HAVE_builtin_setjmp_setup)
521 emit_insn (gen_builtin_setjmp_setup (buf_addr));
524 /* Tell optimize_save_area_alloca that extra work is going to
525 need to go on during alloca. */
526 current_function_calls_setjmp = 1;
528 /* Set this so all the registers get saved in our frame; we need to be
529 able to copy the saved values for any registers from frames we unwind. */
530 current_function_has_nonlocal_label = 1;
533 /* Construct the trailing part of a __builtin_setjmp call.
534 This is used directly by sjlj exception handling code. */
537 expand_builtin_setjmp_receiver (rtx receiver_label ATTRIBUTE_UNUSED)
539 /* Clobber the FP when we get here, so we have to make sure it's
540 marked as used by this function. */
541 emit_insn (gen_rtx_USE (VOIDmode, hard_frame_pointer_rtx));
543 /* Mark the static chain as clobbered here so life information
544 doesn't get messed up for it. */
545 emit_insn (gen_rtx_CLOBBER (VOIDmode, static_chain_rtx));
547 /* Now put in the code to restore the frame pointer, and argument
548 pointer, if needed. The code below is from expand_end_bindings
549 in stmt.c; see detailed documentation there. */
550 #ifdef HAVE_nonlocal_goto
551 if (! HAVE_nonlocal_goto)
553 emit_move_insn (virtual_stack_vars_rtx, hard_frame_pointer_rtx);
555 #if ARG_POINTER_REGNUM != HARD_FRAME_POINTER_REGNUM
556 if (fixed_regs[ARG_POINTER_REGNUM])
558 #ifdef ELIMINABLE_REGS
560 static const struct elims {const int from, to;} elim_regs[] = ELIMINABLE_REGS;
562 for (i = 0; i < ARRAY_SIZE (elim_regs); i++)
563 if (elim_regs[i].from == ARG_POINTER_REGNUM
564 && elim_regs[i].to == HARD_FRAME_POINTER_REGNUM)
567 if (i == ARRAY_SIZE (elim_regs))
570 /* Now restore our arg pointer from the address at which it
571 was saved in our stack frame. */
572 emit_move_insn (virtual_incoming_args_rtx,
573 copy_to_reg (get_arg_pointer_save_area (cfun)));
578 #ifdef HAVE_builtin_setjmp_receiver
579 if (HAVE_builtin_setjmp_receiver)
580 emit_insn (gen_builtin_setjmp_receiver (receiver_label));
583 #ifdef HAVE_nonlocal_goto_receiver
584 if (HAVE_nonlocal_goto_receiver)
585 emit_insn (gen_nonlocal_goto_receiver ());
590 /* @@@ This is a kludge. Not all machine descriptions define a blockage
591 insn, but we must not allow the code we just generated to be reordered
592 by scheduling. Specifically, the update of the frame pointer must
593 happen immediately, not later. So emit an ASM_INPUT to act as blockage
595 emit_insn (gen_rtx_ASM_INPUT (VOIDmode, ""));
598 /* __builtin_setjmp is passed a pointer to an array of five words (not
599 all will be used on all machines). It operates similarly to the C
600 library function of the same name, but is more efficient. Much of
601 the code below (and for longjmp) is copied from the handling of
604 NOTE: This is intended for use by GNAT and the exception handling
605 scheme in the compiler and will only work in the method used by
609 expand_builtin_setjmp (tree arglist, rtx target)
611 rtx buf_addr, next_lab, cont_lab;
613 if (!validate_arglist (arglist, POINTER_TYPE, VOID_TYPE))
616 if (target == 0 || GET_CODE (target) != REG
617 || REGNO (target) < FIRST_PSEUDO_REGISTER)
618 target = gen_reg_rtx (TYPE_MODE (integer_type_node));
620 buf_addr = expand_expr (TREE_VALUE (arglist), NULL_RTX, VOIDmode, 0);
622 next_lab = gen_label_rtx ();
623 cont_lab = gen_label_rtx ();
625 expand_builtin_setjmp_setup (buf_addr, next_lab);
627 /* Set TARGET to zero and branch to the continue label. Use emit_jump to
628 ensure that pending stack adjustments are flushed. */
629 emit_move_insn (target, const0_rtx);
630 emit_jump (cont_lab);
632 emit_label (next_lab);
634 expand_builtin_setjmp_receiver (next_lab);
636 /* Set TARGET to one. */
637 emit_move_insn (target, const1_rtx);
638 emit_label (cont_lab);
640 /* Tell flow about the strange goings on. Putting `next_lab' on
641 `nonlocal_goto_handler_labels' to indicates that function
642 calls may traverse the arc back to this label. */
644 current_function_has_nonlocal_label = 1;
645 nonlocal_goto_handler_labels
646 = gen_rtx_EXPR_LIST (VOIDmode, next_lab, nonlocal_goto_handler_labels);
651 /* __builtin_longjmp is passed a pointer to an array of five words (not
652 all will be used on all machines). It operates similarly to the C
653 library function of the same name, but is more efficient. Much of
654 the code below is copied from the handling of non-local gotos.
656 NOTE: This is intended for use by GNAT and the exception handling
657 scheme in the compiler and will only work in the method used by
661 expand_builtin_longjmp (rtx buf_addr, rtx value)
663 rtx fp, lab, stack, insn, last;
664 enum machine_mode sa_mode = STACK_SAVEAREA_MODE (SAVE_NONLOCAL);
666 if (setjmp_alias_set == -1)
667 setjmp_alias_set = new_alias_set ();
669 buf_addr = convert_memory_address (Pmode, buf_addr);
671 buf_addr = force_reg (Pmode, buf_addr);
673 /* We used to store value in static_chain_rtx, but that fails if pointers
674 are smaller than integers. We instead require that the user must pass
675 a second argument of 1, because that is what builtin_setjmp will
676 return. This also makes EH slightly more efficient, since we are no
677 longer copying around a value that we don't care about. */
678 if (value != const1_rtx)
681 current_function_calls_longjmp = 1;
683 last = get_last_insn ();
684 #ifdef HAVE_builtin_longjmp
685 if (HAVE_builtin_longjmp)
686 emit_insn (gen_builtin_longjmp (buf_addr));
690 fp = gen_rtx_MEM (Pmode, buf_addr);
691 lab = gen_rtx_MEM (Pmode, plus_constant (buf_addr,
692 GET_MODE_SIZE (Pmode)));
694 stack = gen_rtx_MEM (sa_mode, plus_constant (buf_addr,
695 2 * GET_MODE_SIZE (Pmode)));
696 set_mem_alias_set (fp, setjmp_alias_set);
697 set_mem_alias_set (lab, setjmp_alias_set);
698 set_mem_alias_set (stack, setjmp_alias_set);
700 /* Pick up FP, label, and SP from the block and jump. This code is
701 from expand_goto in stmt.c; see there for detailed comments. */
702 #if HAVE_nonlocal_goto
703 if (HAVE_nonlocal_goto)
704 /* We have to pass a value to the nonlocal_goto pattern that will
705 get copied into the static_chain pointer, but it does not matter
706 what that value is, because builtin_setjmp does not use it. */
707 emit_insn (gen_nonlocal_goto (value, lab, stack, fp));
711 lab = copy_to_reg (lab);
713 emit_insn (gen_rtx_CLOBBER (VOIDmode,
714 gen_rtx_MEM (BLKmode,
715 gen_rtx_SCRATCH (VOIDmode))));
716 emit_insn (gen_rtx_CLOBBER (VOIDmode,
717 gen_rtx_MEM (BLKmode,
718 hard_frame_pointer_rtx)));
720 emit_move_insn (hard_frame_pointer_rtx, fp);
721 emit_stack_restore (SAVE_NONLOCAL, stack, NULL_RTX);
723 emit_insn (gen_rtx_USE (VOIDmode, hard_frame_pointer_rtx));
724 emit_insn (gen_rtx_USE (VOIDmode, stack_pointer_rtx));
725 emit_indirect_jump (lab);
729 /* Search backwards and mark the jump insn as a non-local goto.
730 Note that this precludes the use of __builtin_longjmp to a
731 __builtin_setjmp target in the same function. However, we've
732 already cautioned the user that these functions are for
733 internal exception handling use only. */
734 for (insn = get_last_insn (); insn; insn = PREV_INSN (insn))
738 if (GET_CODE (insn) == JUMP_INSN)
740 REG_NOTES (insn) = alloc_EXPR_LIST (REG_NON_LOCAL_GOTO, const0_rtx,
744 else if (GET_CODE (insn) == CALL_INSN)
749 /* Expand a call to __builtin_prefetch. For a target that does not support
750 data prefetch, evaluate the memory address argument in case it has side
754 expand_builtin_prefetch (tree arglist)
756 tree arg0, arg1, arg2;
759 if (!validate_arglist (arglist, POINTER_TYPE, 0))
762 arg0 = TREE_VALUE (arglist);
763 /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
764 zero (read) and argument 2 (locality) defaults to 3 (high degree of
766 if (TREE_CHAIN (arglist))
768 arg1 = TREE_VALUE (TREE_CHAIN (arglist));
769 if (TREE_CHAIN (TREE_CHAIN (arglist)))
770 arg2 = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
772 arg2 = build_int_2 (3, 0);
776 arg1 = integer_zero_node;
777 arg2 = build_int_2 (3, 0);
780 /* Argument 0 is an address. */
781 op0 = expand_expr (arg0, NULL_RTX, Pmode, EXPAND_NORMAL);
783 /* Argument 1 (read/write flag) must be a compile-time constant int. */
784 if (TREE_CODE (arg1) != INTEGER_CST)
786 error ("second arg to `__builtin_prefetch' must be a constant");
787 arg1 = integer_zero_node;
789 op1 = expand_expr (arg1, NULL_RTX, VOIDmode, 0);
790 /* Argument 1 must be either zero or one. */
791 if (INTVAL (op1) != 0 && INTVAL (op1) != 1)
793 warning ("invalid second arg to __builtin_prefetch; using zero");
797 /* Argument 2 (locality) must be a compile-time constant int. */
798 if (TREE_CODE (arg2) != INTEGER_CST)
800 error ("third arg to `__builtin_prefetch' must be a constant");
801 arg2 = integer_zero_node;
803 op2 = expand_expr (arg2, NULL_RTX, VOIDmode, 0);
804 /* Argument 2 must be 0, 1, 2, or 3. */
805 if (INTVAL (op2) < 0 || INTVAL (op2) > 3)
807 warning ("invalid third arg to __builtin_prefetch; using zero");
814 if ((! (*insn_data[(int) CODE_FOR_prefetch].operand[0].predicate)
816 insn_data[(int) CODE_FOR_prefetch].operand[0].mode))
817 || (GET_MODE (op0) != Pmode))
819 op0 = convert_memory_address (Pmode, op0);
820 op0 = force_reg (Pmode, op0);
822 emit_insn (gen_prefetch (op0, op1, op2));
826 op0 = protect_from_queue (op0, 0);
827 /* Don't do anything with direct references to volatile memory, but
828 generate code to handle other side effects. */
829 if (GET_CODE (op0) != MEM && side_effects_p (op0))
833 /* Get a MEM rtx for expression EXP which is the address of an operand
834 to be used to be used in a string instruction (cmpstrsi, movstrsi, ..). */
837 get_memory_rtx (tree exp)
839 rtx addr = expand_expr (exp, NULL_RTX, ptr_mode, EXPAND_SUM);
842 addr = convert_memory_address (Pmode, addr);
844 mem = gen_rtx_MEM (BLKmode, memory_address (BLKmode, addr));
846 /* Get an expression we can use to find the attributes to assign to MEM.
847 If it is an ADDR_EXPR, use the operand. Otherwise, dereference it if
848 we can. First remove any nops. */
849 while ((TREE_CODE (exp) == NOP_EXPR || TREE_CODE (exp) == CONVERT_EXPR
850 || TREE_CODE (exp) == NON_LVALUE_EXPR)
851 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (exp, 0))))
852 exp = TREE_OPERAND (exp, 0);
854 if (TREE_CODE (exp) == ADDR_EXPR)
856 exp = TREE_OPERAND (exp, 0);
857 set_mem_attributes (mem, exp, 0);
859 else if (POINTER_TYPE_P (TREE_TYPE (exp)))
861 exp = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (exp)), exp);
862 /* memcpy, memset and other builtin stringops can alias with anything. */
863 set_mem_alias_set (mem, 0);
869 /* Built-in functions to perform an untyped call and return. */
871 /* For each register that may be used for calling a function, this
872 gives a mode used to copy the register's value. VOIDmode indicates
873 the register is not used for calling a function. If the machine
874 has register windows, this gives only the outbound registers.
875 INCOMING_REGNO gives the corresponding inbound register. */
876 static enum machine_mode apply_args_mode[FIRST_PSEUDO_REGISTER];
878 /* For each register that may be used for returning values, this gives
879 a mode used to copy the register's value. VOIDmode indicates the
880 register is not used for returning values. If the machine has
881 register windows, this gives only the outbound registers.
882 INCOMING_REGNO gives the corresponding inbound register. */
883 static enum machine_mode apply_result_mode[FIRST_PSEUDO_REGISTER];
885 /* For each register that may be used for calling a function, this
886 gives the offset of that register into the block returned by
887 __builtin_apply_args. 0 indicates that the register is not
888 used for calling a function. */
889 static int apply_args_reg_offset[FIRST_PSEUDO_REGISTER];
891 /* Return the offset of register REGNO into the block returned by
892 __builtin_apply_args. This is not declared static, since it is
893 needed in objc-act.c. */
896 apply_args_register_offset (int regno)
900 /* Arguments are always put in outgoing registers (in the argument
901 block) if such make sense. */
902 #ifdef OUTGOING_REGNO
903 regno = OUTGOING_REGNO (regno);
905 return apply_args_reg_offset[regno];
908 /* Return the size required for the block returned by __builtin_apply_args,
909 and initialize apply_args_mode. */
912 apply_args_size (void)
914 static int size = -1;
917 enum machine_mode mode;
919 /* The values computed by this function never change. */
922 /* The first value is the incoming arg-pointer. */
923 size = GET_MODE_SIZE (Pmode);
925 /* The second value is the structure value address unless this is
926 passed as an "invisible" first argument. */
927 if (targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0))
928 size += GET_MODE_SIZE (Pmode);
930 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
931 if (FUNCTION_ARG_REGNO_P (regno))
933 /* Search for the proper mode for copying this register's
934 value. I'm not sure this is right, but it works so far. */
935 enum machine_mode best_mode = VOIDmode;
937 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT);
939 mode = GET_MODE_WIDER_MODE (mode))
940 if (HARD_REGNO_MODE_OK (regno, mode)
941 && HARD_REGNO_NREGS (regno, mode) == 1)
944 if (best_mode == VOIDmode)
945 for (mode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT);
947 mode = GET_MODE_WIDER_MODE (mode))
948 if (HARD_REGNO_MODE_OK (regno, mode)
949 && have_insn_for (SET, mode))
952 if (best_mode == VOIDmode)
953 for (mode = GET_CLASS_NARROWEST_MODE (MODE_VECTOR_FLOAT);
955 mode = GET_MODE_WIDER_MODE (mode))
956 if (HARD_REGNO_MODE_OK (regno, mode)
957 && have_insn_for (SET, mode))
960 if (best_mode == VOIDmode)
961 for (mode = GET_CLASS_NARROWEST_MODE (MODE_VECTOR_INT);
963 mode = GET_MODE_WIDER_MODE (mode))
964 if (HARD_REGNO_MODE_OK (regno, mode)
965 && have_insn_for (SET, mode))
969 if (mode == VOIDmode)
972 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
973 if (size % align != 0)
974 size = CEIL (size, align) * align;
975 apply_args_reg_offset[regno] = size;
976 size += GET_MODE_SIZE (mode);
977 apply_args_mode[regno] = mode;
981 apply_args_mode[regno] = VOIDmode;
982 apply_args_reg_offset[regno] = 0;
988 /* Return the size required for the block returned by __builtin_apply,
989 and initialize apply_result_mode. */
992 apply_result_size (void)
994 static int size = -1;
996 enum machine_mode mode;
998 /* The values computed by this function never change. */
1003 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1004 if (FUNCTION_VALUE_REGNO_P (regno))
1006 /* Search for the proper mode for copying this register's
1007 value. I'm not sure this is right, but it works so far. */
1008 enum machine_mode best_mode = VOIDmode;
1010 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT);
1012 mode = GET_MODE_WIDER_MODE (mode))
1013 if (HARD_REGNO_MODE_OK (regno, mode))
1016 if (best_mode == VOIDmode)
1017 for (mode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT);
1019 mode = GET_MODE_WIDER_MODE (mode))
1020 if (HARD_REGNO_MODE_OK (regno, mode)
1021 && have_insn_for (SET, mode))
1024 if (best_mode == VOIDmode)
1025 for (mode = GET_CLASS_NARROWEST_MODE (MODE_VECTOR_FLOAT);
1027 mode = GET_MODE_WIDER_MODE (mode))
1028 if (HARD_REGNO_MODE_OK (regno, mode)
1029 && have_insn_for (SET, mode))
1032 if (best_mode == VOIDmode)
1033 for (mode = GET_CLASS_NARROWEST_MODE (MODE_VECTOR_INT);
1035 mode = GET_MODE_WIDER_MODE (mode))
1036 if (HARD_REGNO_MODE_OK (regno, mode)
1037 && have_insn_for (SET, mode))
1041 if (mode == VOIDmode)
1044 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1045 if (size % align != 0)
1046 size = CEIL (size, align) * align;
1047 size += GET_MODE_SIZE (mode);
1048 apply_result_mode[regno] = mode;
1051 apply_result_mode[regno] = VOIDmode;
1053 /* Allow targets that use untyped_call and untyped_return to override
1054 the size so that machine-specific information can be stored here. */
1055 #ifdef APPLY_RESULT_SIZE
1056 size = APPLY_RESULT_SIZE;
1062 #if defined (HAVE_untyped_call) || defined (HAVE_untyped_return)
1063 /* Create a vector describing the result block RESULT. If SAVEP is true,
1064 the result block is used to save the values; otherwise it is used to
1065 restore the values. */
1068 result_vector (int savep, rtx result)
1070 int regno, size, align, nelts;
1071 enum machine_mode mode;
1073 rtx *savevec = alloca (FIRST_PSEUDO_REGISTER * sizeof (rtx));
1076 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1077 if ((mode = apply_result_mode[regno]) != VOIDmode)
1079 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1080 if (size % align != 0)
1081 size = CEIL (size, align) * align;
1082 reg = gen_rtx_REG (mode, savep ? regno : INCOMING_REGNO (regno));
1083 mem = adjust_address (result, mode, size);
1084 savevec[nelts++] = (savep
1085 ? gen_rtx_SET (VOIDmode, mem, reg)
1086 : gen_rtx_SET (VOIDmode, reg, mem));
1087 size += GET_MODE_SIZE (mode);
1089 return gen_rtx_PARALLEL (VOIDmode, gen_rtvec_v (nelts, savevec));
1091 #endif /* HAVE_untyped_call or HAVE_untyped_return */
1093 /* Save the state required to perform an untyped call with the same
1094 arguments as were passed to the current function. */
1097 expand_builtin_apply_args_1 (void)
1100 int size, align, regno;
1101 enum machine_mode mode;
1102 rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1104 /* Create a block where the arg-pointer, structure value address,
1105 and argument registers can be saved. */
1106 registers = assign_stack_local (BLKmode, apply_args_size (), -1);
1108 /* Walk past the arg-pointer and structure value address. */
1109 size = GET_MODE_SIZE (Pmode);
1110 if (targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0))
1111 size += GET_MODE_SIZE (Pmode);
1113 /* Save each register used in calling a function to the block. */
1114 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1115 if ((mode = apply_args_mode[regno]) != VOIDmode)
1117 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1118 if (size % align != 0)
1119 size = CEIL (size, align) * align;
1121 tem = gen_rtx_REG (mode, INCOMING_REGNO (regno));
1123 emit_move_insn (adjust_address (registers, mode, size), tem);
1124 size += GET_MODE_SIZE (mode);
1127 /* Save the arg pointer to the block. */
1128 tem = copy_to_reg (virtual_incoming_args_rtx);
1129 #ifdef STACK_GROWS_DOWNWARD
1130 /* We need the pointer as the caller actually passed them to us, not
1131 as we might have pretended they were passed. Make sure it's a valid
1132 operand, as emit_move_insn isn't expected to handle a PLUS. */
1134 = force_operand (plus_constant (tem, current_function_pretend_args_size),
1137 emit_move_insn (adjust_address (registers, Pmode, 0), tem);
1139 size = GET_MODE_SIZE (Pmode);
1141 /* Save the structure value address unless this is passed as an
1142 "invisible" first argument. */
1143 if (struct_incoming_value)
1145 emit_move_insn (adjust_address (registers, Pmode, size),
1146 copy_to_reg (struct_incoming_value));
1147 size += GET_MODE_SIZE (Pmode);
1150 /* Return the address of the block. */
1151 return copy_addr_to_reg (XEXP (registers, 0));
1154 /* __builtin_apply_args returns block of memory allocated on
1155 the stack into which is stored the arg pointer, structure
1156 value address, static chain, and all the registers that might
1157 possibly be used in performing a function call. The code is
1158 moved to the start of the function so the incoming values are
1162 expand_builtin_apply_args (void)
1164 /* Don't do __builtin_apply_args more than once in a function.
1165 Save the result of the first call and reuse it. */
1166 if (apply_args_value != 0)
1167 return apply_args_value;
1169 /* When this function is called, it means that registers must be
1170 saved on entry to this function. So we migrate the
1171 call to the first insn of this function. */
1176 temp = expand_builtin_apply_args_1 ();
1180 apply_args_value = temp;
1182 /* Put the insns after the NOTE that starts the function.
1183 If this is inside a start_sequence, make the outer-level insn
1184 chain current, so the code is placed at the start of the
1186 push_topmost_sequence ();
1187 emit_insn_before (seq, NEXT_INSN (get_insns ()));
1188 pop_topmost_sequence ();
1193 /* Perform an untyped call and save the state required to perform an
1194 untyped return of whatever value was returned by the given function. */
1197 expand_builtin_apply (rtx function, rtx arguments, rtx argsize)
1199 int size, align, regno;
1200 enum machine_mode mode;
1201 rtx incoming_args, result, reg, dest, src, call_insn;
1202 rtx old_stack_level = 0;
1203 rtx call_fusage = 0;
1204 rtx struct_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0);
1206 arguments = convert_memory_address (Pmode, arguments);
1208 /* Create a block where the return registers can be saved. */
1209 result = assign_stack_local (BLKmode, apply_result_size (), -1);
1211 /* Fetch the arg pointer from the ARGUMENTS block. */
1212 incoming_args = gen_reg_rtx (Pmode);
1213 emit_move_insn (incoming_args, gen_rtx_MEM (Pmode, arguments));
1214 #ifndef STACK_GROWS_DOWNWARD
1215 incoming_args = expand_simple_binop (Pmode, MINUS, incoming_args, argsize,
1216 incoming_args, 0, OPTAB_LIB_WIDEN);
1219 /* Perform postincrements before actually calling the function. */
1222 /* Push a new argument block and copy the arguments. Do not allow
1223 the (potential) memcpy call below to interfere with our stack
1225 do_pending_stack_adjust ();
1228 /* Save the stack with nonlocal if available. */
1229 #ifdef HAVE_save_stack_nonlocal
1230 if (HAVE_save_stack_nonlocal)
1231 emit_stack_save (SAVE_NONLOCAL, &old_stack_level, NULL_RTX);
1234 emit_stack_save (SAVE_BLOCK, &old_stack_level, NULL_RTX);
1236 /* Allocate a block of memory onto the stack and copy the memory
1237 arguments to the outgoing arguments address. */
1238 allocate_dynamic_stack_space (argsize, 0, BITS_PER_UNIT);
1239 dest = virtual_outgoing_args_rtx;
1240 #ifndef STACK_GROWS_DOWNWARD
1241 if (GET_CODE (argsize) == CONST_INT)
1242 dest = plus_constant (dest, -INTVAL (argsize));
1244 dest = gen_rtx_PLUS (Pmode, dest, negate_rtx (Pmode, argsize));
1246 dest = gen_rtx_MEM (BLKmode, dest);
1247 set_mem_align (dest, PARM_BOUNDARY);
1248 src = gen_rtx_MEM (BLKmode, incoming_args);
1249 set_mem_align (src, PARM_BOUNDARY);
1250 emit_block_move (dest, src, argsize, BLOCK_OP_NORMAL);
1252 /* Refer to the argument block. */
1254 arguments = gen_rtx_MEM (BLKmode, arguments);
1255 set_mem_align (arguments, PARM_BOUNDARY);
1257 /* Walk past the arg-pointer and structure value address. */
1258 size = GET_MODE_SIZE (Pmode);
1260 size += GET_MODE_SIZE (Pmode);
1262 /* Restore each of the registers previously saved. Make USE insns
1263 for each of these registers for use in making the call. */
1264 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1265 if ((mode = apply_args_mode[regno]) != VOIDmode)
1267 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1268 if (size % align != 0)
1269 size = CEIL (size, align) * align;
1270 reg = gen_rtx_REG (mode, regno);
1271 emit_move_insn (reg, adjust_address (arguments, mode, size));
1272 use_reg (&call_fusage, reg);
1273 size += GET_MODE_SIZE (mode);
1276 /* Restore the structure value address unless this is passed as an
1277 "invisible" first argument. */
1278 size = GET_MODE_SIZE (Pmode);
1281 rtx value = gen_reg_rtx (Pmode);
1282 emit_move_insn (value, adjust_address (arguments, Pmode, size));
1283 emit_move_insn (struct_value, value);
1284 if (GET_CODE (struct_value) == REG)
1285 use_reg (&call_fusage, struct_value);
1286 size += GET_MODE_SIZE (Pmode);
1289 /* All arguments and registers used for the call are set up by now! */
1290 function = prepare_call_address (function, NULL_TREE, &call_fusage, 0, 0);
1292 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1293 and we don't want to load it into a register as an optimization,
1294 because prepare_call_address already did it if it should be done. */
1295 if (GET_CODE (function) != SYMBOL_REF)
1296 function = memory_address (FUNCTION_MODE, function);
1298 /* Generate the actual call instruction and save the return value. */
1299 #ifdef HAVE_untyped_call
1300 if (HAVE_untyped_call)
1301 emit_call_insn (gen_untyped_call (gen_rtx_MEM (FUNCTION_MODE, function),
1302 result, result_vector (1, result)));
1305 #ifdef HAVE_call_value
1306 if (HAVE_call_value)
1310 /* Locate the unique return register. It is not possible to
1311 express a call that sets more than one return register using
1312 call_value; use untyped_call for that. In fact, untyped_call
1313 only needs to save the return registers in the given block. */
1314 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1315 if ((mode = apply_result_mode[regno]) != VOIDmode)
1318 abort (); /* HAVE_untyped_call required. */
1319 valreg = gen_rtx_REG (mode, regno);
1322 emit_call_insn (GEN_CALL_VALUE (valreg,
1323 gen_rtx_MEM (FUNCTION_MODE, function),
1324 const0_rtx, NULL_RTX, const0_rtx));
1326 emit_move_insn (adjust_address (result, GET_MODE (valreg), 0), valreg);
1332 /* Find the CALL insn we just emitted, and attach the register usage
1334 call_insn = last_call_insn ();
1335 add_function_usage_to (call_insn, call_fusage);
1337 /* Restore the stack. */
1338 #ifdef HAVE_save_stack_nonlocal
1339 if (HAVE_save_stack_nonlocal)
1340 emit_stack_restore (SAVE_NONLOCAL, old_stack_level, NULL_RTX);
1343 emit_stack_restore (SAVE_BLOCK, old_stack_level, NULL_RTX);
1347 /* Return the address of the result block. */
1348 result = copy_addr_to_reg (XEXP (result, 0));
1349 return convert_memory_address (ptr_mode, result);
1352 /* Perform an untyped return. */
1355 expand_builtin_return (rtx result)
1357 int size, align, regno;
1358 enum machine_mode mode;
1360 rtx call_fusage = 0;
1362 result = convert_memory_address (Pmode, result);
1364 apply_result_size ();
1365 result = gen_rtx_MEM (BLKmode, result);
1367 #ifdef HAVE_untyped_return
1368 if (HAVE_untyped_return)
1370 emit_jump_insn (gen_untyped_return (result, result_vector (0, result)));
1376 /* Restore the return value and note that each value is used. */
1378 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1379 if ((mode = apply_result_mode[regno]) != VOIDmode)
1381 align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1382 if (size % align != 0)
1383 size = CEIL (size, align) * align;
1384 reg = gen_rtx_REG (mode, INCOMING_REGNO (regno));
1385 emit_move_insn (reg, adjust_address (result, mode, size));
1387 push_to_sequence (call_fusage);
1388 emit_insn (gen_rtx_USE (VOIDmode, reg));
1389 call_fusage = get_insns ();
1391 size += GET_MODE_SIZE (mode);
1394 /* Put the USE insns before the return. */
1395 emit_insn (call_fusage);
1397 /* Return whatever values was restored by jumping directly to the end
1399 expand_naked_return ();
1402 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1404 static enum type_class
1405 type_to_class (tree type)
1407 switch (TREE_CODE (type))
1409 case VOID_TYPE: return void_type_class;
1410 case INTEGER_TYPE: return integer_type_class;
1411 case CHAR_TYPE: return char_type_class;
1412 case ENUMERAL_TYPE: return enumeral_type_class;
1413 case BOOLEAN_TYPE: return boolean_type_class;
1414 case POINTER_TYPE: return pointer_type_class;
1415 case REFERENCE_TYPE: return reference_type_class;
1416 case OFFSET_TYPE: return offset_type_class;
1417 case REAL_TYPE: return real_type_class;
1418 case COMPLEX_TYPE: return complex_type_class;
1419 case FUNCTION_TYPE: return function_type_class;
1420 case METHOD_TYPE: return method_type_class;
1421 case RECORD_TYPE: return record_type_class;
1423 case QUAL_UNION_TYPE: return union_type_class;
1424 case ARRAY_TYPE: return (TYPE_STRING_FLAG (type)
1425 ? string_type_class : array_type_class);
1426 case SET_TYPE: return set_type_class;
1427 case FILE_TYPE: return file_type_class;
1428 case LANG_TYPE: return lang_type_class;
1429 default: return no_type_class;
1433 /* Expand a call to __builtin_classify_type with arguments found in
1437 expand_builtin_classify_type (tree arglist)
1440 return GEN_INT (type_to_class (TREE_TYPE (TREE_VALUE (arglist))));
1441 return GEN_INT (no_type_class);
1444 /* Expand expression EXP, which is a call to __builtin_constant_p. */
1447 expand_builtin_constant_p (tree arglist, enum machine_mode target_mode)
1453 arglist = TREE_VALUE (arglist);
1455 /* We have taken care of the easy cases during constant folding. This
1456 case is not obvious, so emit (constant_p_rtx (ARGLIST)) and let CSE
1457 get a chance to see if it can deduce whether ARGLIST is constant.
1458 If CSE isn't going to run, of course, don't bother waiting. */
1460 if (cse_not_expected)
1463 current_function_calls_constant_p = 1;
1465 tmp = expand_expr (arglist, NULL_RTX, VOIDmode, 0);
1466 tmp = gen_rtx_CONSTANT_P_RTX (target_mode, tmp);
1470 /* This helper macro, meant to be used in mathfn_built_in below,
1471 determines which among a set of three builtin math functions is
1472 appropriate for a given type mode. The `F' and `L' cases are
1473 automatically generated from the `double' case. */
1474 #define CASE_MATHFN(BUILT_IN_MATHFN) \
1475 case BUILT_IN_MATHFN: case BUILT_IN_MATHFN##F: case BUILT_IN_MATHFN##L: \
1476 fcode = BUILT_IN_MATHFN; fcodef = BUILT_IN_MATHFN##F ; \
1477 fcodel = BUILT_IN_MATHFN##L ; break;
1479 /* Return mathematic function equivalent to FN but operating directly
1480 on TYPE, if available. If we can't do the conversion, return zero. */
1482 mathfn_built_in (tree type, enum built_in_function fn)
1484 const enum machine_mode type_mode = TYPE_MODE (type);
1485 enum built_in_function fcode, fcodef, fcodel;
1489 CASE_MATHFN (BUILT_IN_ACOS)
1490 CASE_MATHFN (BUILT_IN_ACOSH)
1491 CASE_MATHFN (BUILT_IN_ASIN)
1492 CASE_MATHFN (BUILT_IN_ASINH)
1493 CASE_MATHFN (BUILT_IN_ATAN)
1494 CASE_MATHFN (BUILT_IN_ATAN2)
1495 CASE_MATHFN (BUILT_IN_ATANH)
1496 CASE_MATHFN (BUILT_IN_CBRT)
1497 CASE_MATHFN (BUILT_IN_CEIL)
1498 CASE_MATHFN (BUILT_IN_COPYSIGN)
1499 CASE_MATHFN (BUILT_IN_COS)
1500 CASE_MATHFN (BUILT_IN_COSH)
1501 CASE_MATHFN (BUILT_IN_DREM)
1502 CASE_MATHFN (BUILT_IN_ERF)
1503 CASE_MATHFN (BUILT_IN_ERFC)
1504 CASE_MATHFN (BUILT_IN_EXP)
1505 CASE_MATHFN (BUILT_IN_EXP10)
1506 CASE_MATHFN (BUILT_IN_EXP2)
1507 CASE_MATHFN (BUILT_IN_EXPM1)
1508 CASE_MATHFN (BUILT_IN_FABS)
1509 CASE_MATHFN (BUILT_IN_FDIM)
1510 CASE_MATHFN (BUILT_IN_FLOOR)
1511 CASE_MATHFN (BUILT_IN_FMA)
1512 CASE_MATHFN (BUILT_IN_FMAX)
1513 CASE_MATHFN (BUILT_IN_FMIN)
1514 CASE_MATHFN (BUILT_IN_FMOD)
1515 CASE_MATHFN (BUILT_IN_FREXP)
1516 CASE_MATHFN (BUILT_IN_GAMMA)
1517 CASE_MATHFN (BUILT_IN_HUGE_VAL)
1518 CASE_MATHFN (BUILT_IN_HYPOT)
1519 CASE_MATHFN (BUILT_IN_ILOGB)
1520 CASE_MATHFN (BUILT_IN_INF)
1521 CASE_MATHFN (BUILT_IN_J0)
1522 CASE_MATHFN (BUILT_IN_J1)
1523 CASE_MATHFN (BUILT_IN_JN)
1524 CASE_MATHFN (BUILT_IN_LDEXP)
1525 CASE_MATHFN (BUILT_IN_LGAMMA)
1526 CASE_MATHFN (BUILT_IN_LLRINT)
1527 CASE_MATHFN (BUILT_IN_LLROUND)
1528 CASE_MATHFN (BUILT_IN_LOG)
1529 CASE_MATHFN (BUILT_IN_LOG10)
1530 CASE_MATHFN (BUILT_IN_LOG1P)
1531 CASE_MATHFN (BUILT_IN_LOG2)
1532 CASE_MATHFN (BUILT_IN_LOGB)
1533 CASE_MATHFN (BUILT_IN_LRINT)
1534 CASE_MATHFN (BUILT_IN_LROUND)
1535 CASE_MATHFN (BUILT_IN_MODF)
1536 CASE_MATHFN (BUILT_IN_NAN)
1537 CASE_MATHFN (BUILT_IN_NANS)
1538 CASE_MATHFN (BUILT_IN_NEARBYINT)
1539 CASE_MATHFN (BUILT_IN_NEXTAFTER)
1540 CASE_MATHFN (BUILT_IN_NEXTTOWARD)
1541 CASE_MATHFN (BUILT_IN_POW)
1542 CASE_MATHFN (BUILT_IN_POW10)
1543 CASE_MATHFN (BUILT_IN_REMAINDER)
1544 CASE_MATHFN (BUILT_IN_REMQUO)
1545 CASE_MATHFN (BUILT_IN_RINT)
1546 CASE_MATHFN (BUILT_IN_ROUND)
1547 CASE_MATHFN (BUILT_IN_SCALB)
1548 CASE_MATHFN (BUILT_IN_SCALBLN)
1549 CASE_MATHFN (BUILT_IN_SCALBN)
1550 CASE_MATHFN (BUILT_IN_SIGNIFICAND)
1551 CASE_MATHFN (BUILT_IN_SIN)
1552 CASE_MATHFN (BUILT_IN_SINCOS)
1553 CASE_MATHFN (BUILT_IN_SINH)
1554 CASE_MATHFN (BUILT_IN_SQRT)
1555 CASE_MATHFN (BUILT_IN_TAN)
1556 CASE_MATHFN (BUILT_IN_TANH)
1557 CASE_MATHFN (BUILT_IN_TGAMMA)
1558 CASE_MATHFN (BUILT_IN_TRUNC)
1559 CASE_MATHFN (BUILT_IN_Y0)
1560 CASE_MATHFN (BUILT_IN_Y1)
1561 CASE_MATHFN (BUILT_IN_YN)
1567 if (type_mode == TYPE_MODE (double_type_node))
1568 return implicit_built_in_decls[fcode];
1569 else if (type_mode == TYPE_MODE (float_type_node))
1570 return implicit_built_in_decls[fcodef];
1571 else if (type_mode == TYPE_MODE (long_double_type_node))
1572 return implicit_built_in_decls[fcodel];
1577 /* If errno must be maintained, expand the RTL to check if the result,
1578 TARGET, of a built-in function call, EXP, is NaN, and if so set
1582 expand_errno_check (tree exp, rtx target)
1584 rtx lab = gen_label_rtx ();
1586 /* Test the result; if it is NaN, set errno=EDOM because
1587 the argument was not in the domain. */
1588 emit_cmp_and_jump_insns (target, target, EQ, 0, GET_MODE (target),
1592 /* If this built-in doesn't throw an exception, set errno directly. */
1593 if (TREE_NOTHROW (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
1595 #ifdef GEN_ERRNO_RTX
1596 rtx errno_rtx = GEN_ERRNO_RTX;
1599 = gen_rtx_MEM (word_mode, gen_rtx_SYMBOL_REF (Pmode, "errno"));
1601 emit_move_insn (errno_rtx, GEN_INT (TARGET_EDOM));
1607 /* We can't set errno=EDOM directly; let the library call do it.
1608 Pop the arguments right away in case the call gets deleted. */
1610 expand_call (exp, target, 0);
1616 /* Expand a call to one of the builtin math functions (sin, cos, or sqrt).
1617 Return 0 if a normal call should be emitted rather than expanding the
1618 function in-line. EXP is the expression that is a call to the builtin
1619 function; if convenient, the result should be placed in TARGET.
1620 SUBTARGET may be used as the target for computing one of EXP's operands. */
1623 expand_builtin_mathfn (tree exp, rtx target, rtx subtarget)
1625 optab builtin_optab;
1626 rtx op0, insns, before_call;
1627 tree fndecl = get_callee_fndecl (exp);
1628 tree arglist = TREE_OPERAND (exp, 1);
1629 enum machine_mode mode;
1630 bool errno_set = false;
1633 if (!validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
1636 arg = TREE_VALUE (arglist);
1638 switch (DECL_FUNCTION_CODE (fndecl))
1643 builtin_optab = sin_optab; break;
1647 builtin_optab = cos_optab; break;
1649 case BUILT_IN_SQRTF:
1650 case BUILT_IN_SQRTL:
1651 errno_set = ! tree_expr_nonnegative_p (arg);
1652 builtin_optab = sqrt_optab;
1657 errno_set = true; builtin_optab = exp_optab; break;
1661 errno_set = true; builtin_optab = log_optab; break;
1665 builtin_optab = tan_optab; break;
1667 case BUILT_IN_ATANF:
1668 case BUILT_IN_ATANL:
1669 builtin_optab = atan_optab; break;
1670 case BUILT_IN_FLOOR:
1671 case BUILT_IN_FLOORF:
1672 case BUILT_IN_FLOORL:
1673 builtin_optab = floor_optab; break;
1675 case BUILT_IN_CEILF:
1676 case BUILT_IN_CEILL:
1677 builtin_optab = ceil_optab; break;
1678 case BUILT_IN_TRUNC:
1679 case BUILT_IN_TRUNCF:
1680 case BUILT_IN_TRUNCL:
1681 builtin_optab = btrunc_optab; break;
1682 case BUILT_IN_ROUND:
1683 case BUILT_IN_ROUNDF:
1684 case BUILT_IN_ROUNDL:
1685 builtin_optab = round_optab; break;
1686 case BUILT_IN_NEARBYINT:
1687 case BUILT_IN_NEARBYINTF:
1688 case BUILT_IN_NEARBYINTL:
1689 builtin_optab = nearbyint_optab; break;
1694 /* Make a suitable register to place result in. */
1695 mode = TYPE_MODE (TREE_TYPE (exp));
1697 if (! flag_errno_math || ! HONOR_NANS (mode))
1700 /* Before working hard, check whether the instruction is available. */
1701 if (builtin_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
1703 target = gen_reg_rtx (mode);
1705 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
1706 need to expand the argument again. This way, we will not perform
1707 side-effects more the once. */
1708 narg = save_expr (arg);
1711 arglist = build_tree_list (NULL_TREE, arg);
1712 exp = build_function_call_expr (fndecl, arglist);
1715 op0 = expand_expr (arg, subtarget, VOIDmode, 0);
1720 /* Compute into TARGET.
1721 Set TARGET to wherever the result comes back. */
1722 target = expand_unop (mode, builtin_optab, op0, target, 0);
1727 expand_errno_check (exp, target);
1729 /* Output the entire sequence. */
1730 insns = get_insns ();
1736 /* If we were unable to expand via the builtin, stop the sequence
1737 (without outputting the insns) and call to the library function
1738 with the stabilized argument list. */
1742 before_call = get_last_insn ();
1744 target = expand_call (exp, target, target == const0_rtx);
1746 /* If this is a sqrt operation and we don't care about errno, try to
1747 attach a REG_EQUAL note with a SQRT rtx to the emitted libcall.
1748 This allows the semantics of the libcall to be visible to the RTL
1750 if (builtin_optab == sqrt_optab && !errno_set)
1752 /* Search backwards through the insns emitted by expand_call looking
1753 for the instruction with the REG_RETVAL note. */
1754 rtx last = get_last_insn ();
1755 while (last != before_call)
1757 if (find_reg_note (last, REG_RETVAL, NULL))
1759 rtx note = find_reg_note (last, REG_EQUAL, NULL);
1760 /* Check that the REQ_EQUAL note is an EXPR_LIST with
1761 two elements, i.e. symbol_ref(sqrt) and the operand. */
1763 && GET_CODE (note) == EXPR_LIST
1764 && GET_CODE (XEXP (note, 0)) == EXPR_LIST
1765 && XEXP (XEXP (note, 0), 1) != NULL_RTX
1766 && XEXP (XEXP (XEXP (note, 0), 1), 1) == NULL_RTX)
1768 rtx operand = XEXP (XEXP (XEXP (note, 0), 1), 0);
1769 /* Check operand is a register with expected mode. */
1771 && GET_CODE (operand) == REG
1772 && GET_MODE (operand) == mode)
1774 /* Replace the REG_EQUAL note with a SQRT rtx. */
1775 rtx equiv = gen_rtx_SQRT (mode, operand);
1776 set_unique_reg_note (last, REG_EQUAL, equiv);
1781 last = PREV_INSN (last);
1788 /* Expand a call to the builtin binary math functions (pow and atan2).
1789 Return 0 if a normal call should be emitted rather than expanding the
1790 function in-line. EXP is the expression that is a call to the builtin
1791 function; if convenient, the result should be placed in TARGET.
1792 SUBTARGET may be used as the target for computing one of EXP's
1796 expand_builtin_mathfn_2 (tree exp, rtx target, rtx subtarget)
1798 optab builtin_optab;
1799 rtx op0, op1, insns;
1800 tree fndecl = get_callee_fndecl (exp);
1801 tree arglist = TREE_OPERAND (exp, 1);
1802 tree arg0, arg1, temp, narg;
1803 enum machine_mode mode;
1804 bool errno_set = true;
1807 if (!validate_arglist (arglist, REAL_TYPE, REAL_TYPE, VOID_TYPE))
1810 arg0 = TREE_VALUE (arglist);
1811 arg1 = TREE_VALUE (TREE_CHAIN (arglist));
1813 switch (DECL_FUNCTION_CODE (fndecl))
1818 builtin_optab = pow_optab; break;
1819 case BUILT_IN_ATAN2:
1820 case BUILT_IN_ATAN2F:
1821 case BUILT_IN_ATAN2L:
1822 builtin_optab = atan2_optab; break;
1827 /* Make a suitable register to place result in. */
1828 mode = TYPE_MODE (TREE_TYPE (exp));
1830 /* Before working hard, check whether the instruction is available. */
1831 if (builtin_optab->handlers[(int) mode].insn_code == CODE_FOR_nothing)
1834 target = gen_reg_rtx (mode);
1836 if (! flag_errno_math || ! HONOR_NANS (mode))
1839 /* Alway stabilize the argument list. */
1840 narg = save_expr (arg1);
1843 temp = build_tree_list (NULL_TREE, narg);
1847 temp = TREE_CHAIN (arglist);
1849 narg = save_expr (arg0);
1852 arglist = tree_cons (NULL_TREE, narg, temp);
1856 arglist = tree_cons (NULL_TREE, arg0, temp);
1859 exp = build_function_call_expr (fndecl, arglist);
1861 op0 = expand_expr (arg0, subtarget, VOIDmode, 0);
1862 op1 = expand_expr (arg1, 0, VOIDmode, 0);
1867 /* Compute into TARGET.
1868 Set TARGET to wherever the result comes back. */
1869 target = expand_binop (mode, builtin_optab, op0, op1,
1870 target, 0, OPTAB_DIRECT);
1872 /* If we were unable to expand via the builtin, stop the sequence
1873 (without outputting the insns) and call to the library function
1874 with the stabilized argument list. */
1878 return expand_call (exp, target, target == const0_rtx);
1882 expand_errno_check (exp, target);
1884 /* Output the entire sequence. */
1885 insns = get_insns ();
1892 /* To evaluate powi(x,n), the floating point value x raised to the
1893 constant integer exponent n, we use a hybrid algorithm that
1894 combines the "window method" with look-up tables. For an
1895 introduction to exponentiation algorithms and "addition chains",
1896 see section 4.6.3, "Evaluation of Powers" of Donald E. Knuth,
1897 "Seminumerical Algorithms", Vol. 2, "The Art of Computer Programming",
1898 3rd Edition, 1998, and Daniel M. Gordon, "A Survey of Fast Exponentiation
1899 Methods", Journal of Algorithms, Vol. 27, pp. 129-146, 1998. */
1901 /* Provide a default value for POWI_MAX_MULTS, the maximum number of
1902 multiplications to inline before calling the system library's pow
1903 function. powi(x,n) requires at worst 2*bits(n)-2 multiplications,
1904 so this default never requires calling pow, powf or powl. */
1906 #ifndef POWI_MAX_MULTS
1907 #define POWI_MAX_MULTS (2*HOST_BITS_PER_WIDE_INT-2)
1910 /* The size of the "optimal power tree" lookup table. All
1911 exponents less than this value are simply looked up in the
1912 powi_table below. This threshold is also used to size the
1913 cache of pseudo registers that hold intermediate results. */
1914 #define POWI_TABLE_SIZE 256
1916 /* The size, in bits of the window, used in the "window method"
1917 exponentiation algorithm. This is equivalent to a radix of
1918 (1<<POWI_WINDOW_SIZE) in the corresponding "m-ary method". */
1919 #define POWI_WINDOW_SIZE 3
1921 /* The following table is an efficient representation of an
1922 "optimal power tree". For each value, i, the corresponding
1923 value, j, in the table states than an optimal evaluation
1924 sequence for calculating pow(x,i) can be found by evaluating
1925 pow(x,j)*pow(x,i-j). An optimal power tree for the first
1926 100 integers is given in Knuth's "Seminumerical algorithms". */
1928 static const unsigned char powi_table[POWI_TABLE_SIZE] =
1930 0, 1, 1, 2, 2, 3, 3, 4, /* 0 - 7 */
1931 4, 6, 5, 6, 6, 10, 7, 9, /* 8 - 15 */
1932 8, 16, 9, 16, 10, 12, 11, 13, /* 16 - 23 */
1933 12, 17, 13, 18, 14, 24, 15, 26, /* 24 - 31 */
1934 16, 17, 17, 19, 18, 33, 19, 26, /* 32 - 39 */
1935 20, 25, 21, 40, 22, 27, 23, 44, /* 40 - 47 */
1936 24, 32, 25, 34, 26, 29, 27, 44, /* 48 - 55 */
1937 28, 31, 29, 34, 30, 60, 31, 36, /* 56 - 63 */
1938 32, 64, 33, 34, 34, 46, 35, 37, /* 64 - 71 */
1939 36, 65, 37, 50, 38, 48, 39, 69, /* 72 - 79 */
1940 40, 49, 41, 43, 42, 51, 43, 58, /* 80 - 87 */
1941 44, 64, 45, 47, 46, 59, 47, 76, /* 88 - 95 */
1942 48, 65, 49, 66, 50, 67, 51, 66, /* 96 - 103 */
1943 52, 70, 53, 74, 54, 104, 55, 74, /* 104 - 111 */
1944 56, 64, 57, 69, 58, 78, 59, 68, /* 112 - 119 */
1945 60, 61, 61, 80, 62, 75, 63, 68, /* 120 - 127 */
1946 64, 65, 65, 128, 66, 129, 67, 90, /* 128 - 135 */
1947 68, 73, 69, 131, 70, 94, 71, 88, /* 136 - 143 */
1948 72, 128, 73, 98, 74, 132, 75, 121, /* 144 - 151 */
1949 76, 102, 77, 124, 78, 132, 79, 106, /* 152 - 159 */
1950 80, 97, 81, 160, 82, 99, 83, 134, /* 160 - 167 */
1951 84, 86, 85, 95, 86, 160, 87, 100, /* 168 - 175 */
1952 88, 113, 89, 98, 90, 107, 91, 122, /* 176 - 183 */
1953 92, 111, 93, 102, 94, 126, 95, 150, /* 184 - 191 */
1954 96, 128, 97, 130, 98, 133, 99, 195, /* 192 - 199 */
1955 100, 128, 101, 123, 102, 164, 103, 138, /* 200 - 207 */
1956 104, 145, 105, 146, 106, 109, 107, 149, /* 208 - 215 */
1957 108, 200, 109, 146, 110, 170, 111, 157, /* 216 - 223 */
1958 112, 128, 113, 130, 114, 182, 115, 132, /* 224 - 231 */
1959 116, 200, 117, 132, 118, 158, 119, 206, /* 232 - 239 */
1960 120, 240, 121, 162, 122, 147, 123, 152, /* 240 - 247 */
1961 124, 166, 125, 214, 126, 138, 127, 153, /* 248 - 255 */
1965 /* Return the number of multiplications required to calculate
1966 powi(x,n) where n is less than POWI_TABLE_SIZE. This is a
1967 subroutine of powi_cost. CACHE is an array indicating
1968 which exponents have already been calculated. */
1971 powi_lookup_cost (unsigned HOST_WIDE_INT n, bool *cache)
1973 /* If we've already calculated this exponent, then this evaluation
1974 doesn't require any additional multiplications. */
1979 return powi_lookup_cost (n - powi_table[n], cache)
1980 + powi_lookup_cost (powi_table[n], cache) + 1;
1983 /* Return the number of multiplications required to calculate
1984 powi(x,n) for an arbitrary x, given the exponent N. This
1985 function needs to be kept in sync with expand_powi below. */
1988 powi_cost (HOST_WIDE_INT n)
1990 bool cache[POWI_TABLE_SIZE];
1991 unsigned HOST_WIDE_INT digit;
1992 unsigned HOST_WIDE_INT val;
1998 /* Ignore the reciprocal when calculating the cost. */
1999 val = (n < 0) ? -n : n;
2001 /* Initialize the exponent cache. */
2002 memset (cache, 0, POWI_TABLE_SIZE * sizeof (bool));
2007 while (val >= POWI_TABLE_SIZE)
2011 digit = val & ((1 << POWI_WINDOW_SIZE) - 1);
2012 result += powi_lookup_cost (digit, cache)
2013 + POWI_WINDOW_SIZE + 1;
2014 val >>= POWI_WINDOW_SIZE;
2023 return result + powi_lookup_cost (val, cache);
2026 /* Recursive subroutine of expand_powi. This function takes the array,
2027 CACHE, of already calculated exponents and an exponent N and returns
2028 an RTX that corresponds to CACHE[1]**N, as calculated in mode MODE. */
2031 expand_powi_1 (enum machine_mode mode, unsigned HOST_WIDE_INT n, rtx *cache)
2033 unsigned HOST_WIDE_INT digit;
2037 if (n < POWI_TABLE_SIZE)
2042 target = gen_reg_rtx (mode);
2045 op0 = expand_powi_1 (mode, n - powi_table[n], cache);
2046 op1 = expand_powi_1 (mode, powi_table[n], cache);
2050 target = gen_reg_rtx (mode);
2051 digit = n & ((1 << POWI_WINDOW_SIZE) - 1);
2052 op0 = expand_powi_1 (mode, n - digit, cache);
2053 op1 = expand_powi_1 (mode, digit, cache);
2057 target = gen_reg_rtx (mode);
2058 op0 = expand_powi_1 (mode, n >> 1, cache);
2062 result = expand_mult (mode, op0, op1, target, 0);
2063 if (result != target)
2064 emit_move_insn (target, result);
2068 /* Expand the RTL to evaluate powi(x,n) in mode MODE. X is the
2069 floating point operand in mode MODE, and N is the exponent. This
2070 function needs to be kept in sync with powi_cost above. */
2073 expand_powi (rtx x, enum machine_mode mode, HOST_WIDE_INT n)
2075 unsigned HOST_WIDE_INT val;
2076 rtx cache[POWI_TABLE_SIZE];
2080 return CONST1_RTX (mode);
2082 val = (n < 0) ? -n : n;
2084 memset (cache, 0, sizeof (cache));
2087 result = expand_powi_1 (mode, (n < 0) ? -n : n, cache);
2089 /* If the original exponent was negative, reciprocate the result. */
2091 result = expand_binop (mode, sdiv_optab, CONST1_RTX (mode),
2092 result, NULL_RTX, 0, OPTAB_LIB_WIDEN);
2097 /* Expand a call to the pow built-in mathematical function. Return 0 if
2098 a normal call should be emitted rather than expanding the function
2099 in-line. EXP is the expression that is a call to the builtin
2100 function; if convenient, the result should be placed in TARGET. */
2103 expand_builtin_pow (tree exp, rtx target, rtx subtarget)
2105 tree arglist = TREE_OPERAND (exp, 1);
2108 if (! validate_arglist (arglist, REAL_TYPE, REAL_TYPE, VOID_TYPE))
2111 arg0 = TREE_VALUE (arglist);
2112 arg1 = TREE_VALUE (TREE_CHAIN (arglist));
2114 if (TREE_CODE (arg1) == REAL_CST
2115 && ! TREE_CONSTANT_OVERFLOW (arg1))
2117 REAL_VALUE_TYPE cint;
2121 c = TREE_REAL_CST (arg1);
2122 n = real_to_integer (&c);
2123 real_from_integer (&cint, VOIDmode, n, n < 0 ? -1 : 0, 0);
2124 if (real_identical (&c, &cint))
2126 /* If the exponent is -1, 0, 1 or 2, then expand_powi is exact.
2127 Otherwise, check the number of multiplications required.
2128 Note that pow never sets errno for an integer exponent. */
2129 if ((n >= -1 && n <= 2)
2130 || (flag_unsafe_math_optimizations
2132 && powi_cost (n) <= POWI_MAX_MULTS))
2134 enum machine_mode mode = TYPE_MODE (TREE_TYPE (exp));
2135 rtx op = expand_expr (arg0, subtarget, VOIDmode, 0);
2136 op = force_reg (mode, op);
2137 return expand_powi (op, mode, n);
2141 return expand_builtin_mathfn_2 (exp, target, NULL_RTX);
2144 /* Expand expression EXP which is a call to the strlen builtin. Return 0
2145 if we failed the caller should emit a normal call, otherwise
2146 try to get the result in TARGET, if convenient. */
2149 expand_builtin_strlen (tree arglist, rtx target,
2150 enum machine_mode target_mode)
2152 if (!validate_arglist (arglist, POINTER_TYPE, VOID_TYPE))
2157 tree len, src = TREE_VALUE (arglist);
2158 rtx result, src_reg, char_rtx, before_strlen;
2159 enum machine_mode insn_mode = target_mode, char_mode;
2160 enum insn_code icode = CODE_FOR_nothing;
2163 /* If the length can be computed at compile-time, return it. */
2164 len = c_strlen (src, 0);
2166 return expand_expr (len, target, target_mode, EXPAND_NORMAL);
2168 /* If the length can be computed at compile-time and is constant
2169 integer, but there are side-effects in src, evaluate
2170 src for side-effects, then return len.
2171 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
2172 can be optimized into: i++; x = 3; */
2173 len = c_strlen (src, 1);
2174 if (len && TREE_CODE (len) == INTEGER_CST)
2176 expand_expr (src, const0_rtx, VOIDmode, EXPAND_NORMAL);
2177 return expand_expr (len, target, target_mode, EXPAND_NORMAL);
2180 align = get_pointer_alignment (src, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
2182 /* If SRC is not a pointer type, don't do this operation inline. */
2186 /* Bail out if we can't compute strlen in the right mode. */
2187 while (insn_mode != VOIDmode)
2189 icode = strlen_optab->handlers[(int) insn_mode].insn_code;
2190 if (icode != CODE_FOR_nothing)
2193 insn_mode = GET_MODE_WIDER_MODE (insn_mode);
2195 if (insn_mode == VOIDmode)
2198 /* Make a place to write the result of the instruction. */
2201 && GET_CODE (result) == REG
2202 && GET_MODE (result) == insn_mode
2203 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
2204 result = gen_reg_rtx (insn_mode);
2206 /* Make a place to hold the source address. We will not expand
2207 the actual source until we are sure that the expansion will
2208 not fail -- there are trees that cannot be expanded twice. */
2209 src_reg = gen_reg_rtx (Pmode);
2211 /* Mark the beginning of the strlen sequence so we can emit the
2212 source operand later. */
2213 before_strlen = get_last_insn ();
2215 char_rtx = const0_rtx;
2216 char_mode = insn_data[(int) icode].operand[2].mode;
2217 if (! (*insn_data[(int) icode].operand[2].predicate) (char_rtx,
2219 char_rtx = copy_to_mode_reg (char_mode, char_rtx);
2221 pat = GEN_FCN (icode) (result, gen_rtx_MEM (BLKmode, src_reg),
2222 char_rtx, GEN_INT (align));
2227 /* Now that we are assured of success, expand the source. */
2229 pat = memory_address (BLKmode,
2230 expand_expr (src, src_reg, ptr_mode, EXPAND_SUM));
2232 emit_move_insn (src_reg, pat);
2237 emit_insn_after (pat, before_strlen);
2239 emit_insn_before (pat, get_insns ());
2241 /* Return the value in the proper mode for this function. */
2242 if (GET_MODE (result) == target_mode)
2244 else if (target != 0)
2245 convert_move (target, result, 0);
2247 target = convert_to_mode (target_mode, result, 0);
2253 /* Expand a call to the strstr builtin. Return 0 if we failed the
2254 caller should emit a normal call, otherwise try to get the result
2255 in TARGET, if convenient (and in mode MODE if that's convenient). */
2258 expand_builtin_strstr (tree arglist, rtx target, enum machine_mode mode)
2260 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
2264 tree s1 = TREE_VALUE (arglist), s2 = TREE_VALUE (TREE_CHAIN (arglist));
2266 const char *p1, *p2;
2275 const char *r = strstr (p1, p2);
2280 /* Return an offset into the constant string argument. */
2281 return expand_expr (fold (build (PLUS_EXPR, TREE_TYPE (s1),
2282 s1, convert (TREE_TYPE (s1),
2283 ssize_int (r - p1)))),
2284 target, mode, EXPAND_NORMAL);
2288 return expand_expr (s1, target, mode, EXPAND_NORMAL);
2293 fn = implicit_built_in_decls[BUILT_IN_STRCHR];
2297 /* New argument list transforming strstr(s1, s2) to
2298 strchr(s1, s2[0]). */
2300 build_tree_list (NULL_TREE, build_int_2 (p2[0], 0));
2301 arglist = tree_cons (NULL_TREE, s1, arglist);
2302 return expand_expr (build_function_call_expr (fn, arglist),
2303 target, mode, EXPAND_NORMAL);
2307 /* Expand a call to the strchr builtin. Return 0 if we failed the
2308 caller should emit a normal call, otherwise try to get the result
2309 in TARGET, if convenient (and in mode MODE if that's convenient). */
2312 expand_builtin_strchr (tree arglist, rtx target, enum machine_mode mode)
2314 if (!validate_arglist (arglist, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
2318 tree s1 = TREE_VALUE (arglist), s2 = TREE_VALUE (TREE_CHAIN (arglist));
2321 if (TREE_CODE (s2) != INTEGER_CST)
2330 if (target_char_cast (s2, &c))
2338 /* Return an offset into the constant string argument. */
2339 return expand_expr (fold (build (PLUS_EXPR, TREE_TYPE (s1),
2340 s1, convert (TREE_TYPE (s1),
2341 ssize_int (r - p1)))),
2342 target, mode, EXPAND_NORMAL);
2345 /* FIXME: Should use here strchrM optab so that ports can optimize
2351 /* Expand a call to the strrchr builtin. Return 0 if we failed the
2352 caller should emit a normal call, otherwise try to get the result
2353 in TARGET, if convenient (and in mode MODE if that's convenient). */
2356 expand_builtin_strrchr (tree arglist, rtx target, enum machine_mode mode)
2358 if (!validate_arglist (arglist, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
2362 tree s1 = TREE_VALUE (arglist), s2 = TREE_VALUE (TREE_CHAIN (arglist));
2366 if (TREE_CODE (s2) != INTEGER_CST)
2375 if (target_char_cast (s2, &c))
2378 r = strrchr (p1, c);
2383 /* Return an offset into the constant string argument. */
2384 return expand_expr (fold (build (PLUS_EXPR, TREE_TYPE (s1),
2385 s1, convert (TREE_TYPE (s1),
2386 ssize_int (r - p1)))),
2387 target, mode, EXPAND_NORMAL);
2390 if (! integer_zerop (s2))
2393 fn = implicit_built_in_decls[BUILT_IN_STRCHR];
2397 /* Transform strrchr(s1, '\0') to strchr(s1, '\0'). */
2398 return expand_expr (build_function_call_expr (fn, arglist),
2399 target, mode, EXPAND_NORMAL);
2403 /* Expand a call to the strpbrk builtin. Return 0 if we failed the
2404 caller should emit a normal call, otherwise try to get the result
2405 in TARGET, if convenient (and in mode MODE if that's convenient). */
2408 expand_builtin_strpbrk (tree arglist, rtx target, enum machine_mode mode)
2410 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
2414 tree s1 = TREE_VALUE (arglist), s2 = TREE_VALUE (TREE_CHAIN (arglist));
2416 const char *p1, *p2;
2425 const char *r = strpbrk (p1, p2);
2430 /* Return an offset into the constant string argument. */
2431 return expand_expr (fold (build (PLUS_EXPR, TREE_TYPE (s1),
2432 s1, convert (TREE_TYPE (s1),
2433 ssize_int (r - p1)))),
2434 target, mode, EXPAND_NORMAL);
2439 /* strpbrk(x, "") == NULL.
2440 Evaluate and ignore the arguments in case they had
2442 expand_expr (s1, const0_rtx, VOIDmode, EXPAND_NORMAL);
2447 return 0; /* Really call strpbrk. */
2449 fn = implicit_built_in_decls[BUILT_IN_STRCHR];
2453 /* New argument list transforming strpbrk(s1, s2) to
2454 strchr(s1, s2[0]). */
2456 build_tree_list (NULL_TREE, build_int_2 (p2[0], 0));
2457 arglist = tree_cons (NULL_TREE, s1, arglist);
2458 return expand_expr (build_function_call_expr (fn, arglist),
2459 target, mode, EXPAND_NORMAL);
2463 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
2464 bytes from constant string DATA + OFFSET and return it as target
2468 builtin_memcpy_read_str (void *data, HOST_WIDE_INT offset,
2469 enum machine_mode mode)
2471 const char *str = (const char *) data;
2474 || ((unsigned HOST_WIDE_INT) offset + GET_MODE_SIZE (mode)
2475 > strlen (str) + 1))
2476 abort (); /* Attempt to read past the end of constant string. */
2478 return c_readstr (str + offset, mode);
2481 /* Expand a call to the memcpy builtin, with arguments in ARGLIST.
2482 Return 0 if we failed, the caller should emit a normal call,
2483 otherwise try to get the result in TARGET, if convenient (and in
2484 mode MODE if that's convenient). */
2486 expand_builtin_memcpy (tree arglist, rtx target, enum machine_mode mode)
2488 if (!validate_arglist (arglist,
2489 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
2493 tree dest = TREE_VALUE (arglist);
2494 tree src = TREE_VALUE (TREE_CHAIN (arglist));
2495 tree len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
2496 const char *src_str;
2497 unsigned int src_align = get_pointer_alignment (src, BIGGEST_ALIGNMENT);
2498 unsigned int dest_align
2499 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
2500 rtx dest_mem, src_mem, dest_addr, len_rtx;
2502 /* If DEST is not a pointer type, call the normal function. */
2503 if (dest_align == 0)
2506 /* If the LEN parameter is zero, return DEST. */
2507 if (integer_zerop (len))
2509 /* Evaluate and ignore SRC in case it has side-effects. */
2510 expand_expr (src, const0_rtx, VOIDmode, EXPAND_NORMAL);
2511 return expand_expr (dest, target, mode, EXPAND_NORMAL);
2514 /* If SRC and DEST are the same (and not volatile), return DEST. */
2515 if (operand_equal_p (src, dest, 0))
2517 /* Evaluate and ignore LEN in case it has side-effects. */
2518 expand_expr (len, const0_rtx, VOIDmode, EXPAND_NORMAL);
2519 return expand_expr (dest, target, mode, EXPAND_NORMAL);
2522 /* If either SRC is not a pointer type, don't do this
2523 operation in-line. */
2527 dest_mem = get_memory_rtx (dest);
2528 set_mem_align (dest_mem, dest_align);
2529 len_rtx = expand_expr (len, NULL_RTX, VOIDmode, 0);
2530 src_str = c_getstr (src);
2532 /* If SRC is a string constant and block move would be done
2533 by pieces, we can avoid loading the string from memory
2534 and only stored the computed constants. */
2536 && GET_CODE (len_rtx) == CONST_INT
2537 && (unsigned HOST_WIDE_INT) INTVAL (len_rtx) <= strlen (src_str) + 1
2538 && can_store_by_pieces (INTVAL (len_rtx), builtin_memcpy_read_str,
2539 (void *) src_str, dest_align))
2541 dest_mem = store_by_pieces (dest_mem, INTVAL (len_rtx),
2542 builtin_memcpy_read_str,
2543 (void *) src_str, dest_align, 0);
2544 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
2545 dest_mem = convert_memory_address (ptr_mode, dest_mem);
2549 src_mem = get_memory_rtx (src);
2550 set_mem_align (src_mem, src_align);
2552 /* Copy word part most expediently. */
2553 dest_addr = emit_block_move (dest_mem, src_mem, len_rtx,
2558 dest_addr = force_operand (XEXP (dest_mem, 0), NULL_RTX);
2559 dest_addr = convert_memory_address (ptr_mode, dest_addr);
2565 /* Expand a call to the mempcpy builtin, with arguments in ARGLIST.
2566 Return 0 if we failed the caller should emit a normal call,
2567 otherwise try to get the result in TARGET, if convenient (and in
2568 mode MODE if that's convenient). If ENDP is 0 return the
2569 destination pointer, if ENDP is 1 return the end pointer ala
2570 mempcpy, and if ENDP is 2 return the end pointer minus one ala
2574 expand_builtin_mempcpy (tree arglist, rtx target, enum machine_mode mode,
2577 if (!validate_arglist (arglist,
2578 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
2580 /* If return value is ignored, transform mempcpy into memcpy. */
2581 else if (target == const0_rtx)
2583 tree fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
2588 return expand_expr (build_function_call_expr (fn, arglist),
2589 target, mode, EXPAND_NORMAL);
2593 tree dest = TREE_VALUE (arglist);
2594 tree src = TREE_VALUE (TREE_CHAIN (arglist));
2595 tree len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
2596 const char *src_str;
2597 unsigned int src_align = get_pointer_alignment (src, BIGGEST_ALIGNMENT);
2598 unsigned int dest_align
2599 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
2600 rtx dest_mem, src_mem, len_rtx;
2602 /* If DEST is not a pointer type, call the normal function. */
2603 if (dest_align == 0)
2606 /* If SRC and DEST are the same (and not volatile), do nothing. */
2607 if (operand_equal_p (src, dest, 0))
2613 /* Evaluate and ignore LEN in case it has side-effects. */
2614 expand_expr (len, const0_rtx, VOIDmode, EXPAND_NORMAL);
2615 return expand_expr (dest, target, mode, EXPAND_NORMAL);
2619 len = fold (build (MINUS_EXPR, TREE_TYPE (len), dest,
2621 len = convert (TREE_TYPE (dest), len);
2622 expr = fold (build (PLUS_EXPR, TREE_TYPE (dest), dest, len));
2623 return expand_expr (expr, target, mode, EXPAND_NORMAL);
2626 /* If LEN is not constant, call the normal function. */
2627 if (! host_integerp (len, 1))
2630 /* If the LEN parameter is zero, return DEST. */
2631 if (tree_low_cst (len, 1) == 0)
2633 /* Evaluate and ignore SRC in case it has side-effects. */
2634 expand_expr (src, const0_rtx, VOIDmode, EXPAND_NORMAL);
2635 return expand_expr (dest, target, mode, EXPAND_NORMAL);
2638 /* If either SRC is not a pointer type, don't do this
2639 operation in-line. */
2643 len_rtx = expand_expr (len, NULL_RTX, VOIDmode, 0);
2644 src_str = c_getstr (src);
2646 /* If SRC is a string constant and block move would be done
2647 by pieces, we can avoid loading the string from memory
2648 and only stored the computed constants. */
2650 && GET_CODE (len_rtx) == CONST_INT
2651 && (unsigned HOST_WIDE_INT) INTVAL (len_rtx) <= strlen (src_str) + 1
2652 && can_store_by_pieces (INTVAL (len_rtx), builtin_memcpy_read_str,
2653 (void *) src_str, dest_align))
2655 dest_mem = get_memory_rtx (dest);
2656 set_mem_align (dest_mem, dest_align);
2657 dest_mem = store_by_pieces (dest_mem, INTVAL (len_rtx),
2658 builtin_memcpy_read_str,
2659 (void *) src_str, dest_align, endp);
2660 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
2661 dest_mem = convert_memory_address (ptr_mode, dest_mem);
2665 if (GET_CODE (len_rtx) == CONST_INT
2666 && can_move_by_pieces (INTVAL (len_rtx),
2667 MIN (dest_align, src_align)))
2669 dest_mem = get_memory_rtx (dest);
2670 set_mem_align (dest_mem, dest_align);
2671 src_mem = get_memory_rtx (src);
2672 set_mem_align (src_mem, src_align);
2673 dest_mem = move_by_pieces (dest_mem, src_mem, INTVAL (len_rtx),
2674 MIN (dest_align, src_align), endp);
2675 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
2676 dest_mem = convert_memory_address (ptr_mode, dest_mem);
2684 /* Expand expression EXP, which is a call to the memmove builtin. Return 0
2685 if we failed the caller should emit a normal call. */
2688 expand_builtin_memmove (tree arglist, rtx target, enum machine_mode mode)
2690 if (!validate_arglist (arglist,
2691 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
2695 tree dest = TREE_VALUE (arglist);
2696 tree src = TREE_VALUE (TREE_CHAIN (arglist));
2697 tree len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
2699 unsigned int src_align = get_pointer_alignment (src, BIGGEST_ALIGNMENT);
2700 unsigned int dest_align
2701 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
2703 /* If DEST is not a pointer type, call the normal function. */
2704 if (dest_align == 0)
2707 /* If the LEN parameter is zero, return DEST. */
2708 if (integer_zerop (len))
2710 /* Evaluate and ignore SRC in case it has side-effects. */
2711 expand_expr (src, const0_rtx, VOIDmode, EXPAND_NORMAL);
2712 return expand_expr (dest, target, mode, EXPAND_NORMAL);
2715 /* If SRC and DEST are the same (and not volatile), return DEST. */
2716 if (operand_equal_p (src, dest, 0))
2718 /* Evaluate and ignore LEN in case it has side-effects. */
2719 expand_expr (len, const0_rtx, VOIDmode, EXPAND_NORMAL);
2720 return expand_expr (dest, target, mode, EXPAND_NORMAL);
2723 /* If either SRC is not a pointer type, don't do this
2724 operation in-line. */
2728 /* If src is categorized for a readonly section we can use
2730 if (readonly_data_expr (src))
2732 tree const fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
2735 return expand_expr (build_function_call_expr (fn, arglist),
2736 target, mode, EXPAND_NORMAL);
2739 /* Otherwise, call the normal function. */
2744 /* Expand expression EXP, which is a call to the bcopy builtin. Return 0
2745 if we failed the caller should emit a normal call. */
2748 expand_builtin_bcopy (tree arglist)
2750 tree src, dest, size, newarglist;
2752 if (!validate_arglist (arglist,
2753 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
2756 src = TREE_VALUE (arglist);
2757 dest = TREE_VALUE (TREE_CHAIN (arglist));
2758 size = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
2760 /* New argument list transforming bcopy(ptr x, ptr y, int z) to
2761 memmove(ptr y, ptr x, size_t z). This is done this way
2762 so that if it isn't expanded inline, we fallback to
2763 calling bcopy instead of memmove. */
2765 newarglist = build_tree_list (NULL_TREE, convert (sizetype, size));
2766 newarglist = tree_cons (NULL_TREE, src, newarglist);
2767 newarglist = tree_cons (NULL_TREE, dest, newarglist);
2769 return expand_builtin_memmove (newarglist, const0_rtx, VOIDmode);
2772 /* Expand expression EXP, which is a call to the strcpy builtin. Return 0
2773 if we failed the caller should emit a normal call, otherwise try to get
2774 the result in TARGET, if convenient (and in mode MODE if that's
2778 expand_builtin_strcpy (tree arglist, rtx target, enum machine_mode mode)
2780 tree fn, len, src, dst;
2782 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
2785 src = TREE_VALUE (TREE_CHAIN (arglist));
2786 dst = TREE_VALUE (arglist);
2788 /* If SRC and DST are equal (and not volatile), return DST. */
2789 if (operand_equal_p (src, dst, 0))
2790 return expand_expr (dst, target, mode, EXPAND_NORMAL);
2792 fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
2796 len = c_strlen (src, 1);
2797 if (len == 0 || TREE_SIDE_EFFECTS (len))
2800 len = size_binop (PLUS_EXPR, len, ssize_int (1));
2801 arglist = build_tree_list (NULL_TREE, len);
2802 arglist = tree_cons (NULL_TREE, src, arglist);
2803 arglist = tree_cons (NULL_TREE, dst, arglist);
2804 return expand_expr (build_function_call_expr (fn, arglist),
2805 target, mode, EXPAND_NORMAL);
2808 /* Expand a call to the stpcpy builtin, with arguments in ARGLIST.
2809 Return 0 if we failed the caller should emit a normal call,
2810 otherwise try to get the result in TARGET, if convenient (and in
2811 mode MODE if that's convenient). */
2814 expand_builtin_stpcpy (tree arglist, rtx target, enum machine_mode mode)
2816 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
2822 /* If return value is ignored, transform stpcpy into strcpy. */
2823 if (target == const0_rtx)
2825 tree fn = implicit_built_in_decls[BUILT_IN_STRCPY];
2829 return expand_expr (build_function_call_expr (fn, arglist),
2830 target, mode, EXPAND_NORMAL);
2833 /* Ensure we get an actual string whose length can be evaluated at
2834 compile-time, not an expression containing a string. This is
2835 because the latter will potentially produce pessimized code
2836 when used to produce the return value. */
2837 src = TREE_VALUE (TREE_CHAIN (arglist));
2838 if (! c_getstr (src) || ! (len = c_strlen (src, 0)))
2841 dst = TREE_VALUE (arglist);
2842 len = fold (size_binop (PLUS_EXPR, len, ssize_int (1)));
2843 arglist = build_tree_list (NULL_TREE, len);
2844 arglist = tree_cons (NULL_TREE, src, arglist);
2845 arglist = tree_cons (NULL_TREE, dst, arglist);
2846 return expand_builtin_mempcpy (arglist, target, mode, /*endp=*/2);
2850 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
2851 bytes from constant string DATA + OFFSET and return it as target
2855 builtin_strncpy_read_str (void *data, HOST_WIDE_INT offset,
2856 enum machine_mode mode)
2858 const char *str = (const char *) data;
2860 if ((unsigned HOST_WIDE_INT) offset > strlen (str))
2863 return c_readstr (str + offset, mode);
2866 /* Expand expression EXP, which is a call to the strncpy builtin. Return 0
2867 if we failed the caller should emit a normal call. */
2870 expand_builtin_strncpy (tree arglist, rtx target, enum machine_mode mode)
2872 if (!validate_arglist (arglist,
2873 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
2877 tree slen = c_strlen (TREE_VALUE (TREE_CHAIN (arglist)), 1);
2878 tree len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
2881 /* We must be passed a constant len parameter. */
2882 if (TREE_CODE (len) != INTEGER_CST)
2885 /* If the len parameter is zero, return the dst parameter. */
2886 if (integer_zerop (len))
2888 /* Evaluate and ignore the src argument in case it has
2890 expand_expr (TREE_VALUE (TREE_CHAIN (arglist)), const0_rtx,
2891 VOIDmode, EXPAND_NORMAL);
2892 /* Return the dst parameter. */
2893 return expand_expr (TREE_VALUE (arglist), target, mode,
2897 /* Now, we must be passed a constant src ptr parameter. */
2898 if (slen == 0 || TREE_CODE (slen) != INTEGER_CST)
2901 slen = size_binop (PLUS_EXPR, slen, ssize_int (1));
2903 /* We're required to pad with trailing zeros if the requested
2904 len is greater than strlen(s2)+1. In that case try to
2905 use store_by_pieces, if it fails, punt. */
2906 if (tree_int_cst_lt (slen, len))
2908 tree dest = TREE_VALUE (arglist);
2909 unsigned int dest_align
2910 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
2911 const char *p = c_getstr (TREE_VALUE (TREE_CHAIN (arglist)));
2914 if (!p || dest_align == 0 || !host_integerp (len, 1)
2915 || !can_store_by_pieces (tree_low_cst (len, 1),
2916 builtin_strncpy_read_str,
2917 (void *) p, dest_align))
2920 dest_mem = get_memory_rtx (dest);
2921 store_by_pieces (dest_mem, tree_low_cst (len, 1),
2922 builtin_strncpy_read_str,
2923 (void *) p, dest_align, 0);
2924 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
2925 dest_mem = convert_memory_address (ptr_mode, dest_mem);
2929 /* OK transform into builtin memcpy. */
2930 fn = implicit_built_in_decls[BUILT_IN_MEMCPY];
2933 return expand_expr (build_function_call_expr (fn, arglist),
2934 target, mode, EXPAND_NORMAL);
2938 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
2939 bytes from constant string DATA + OFFSET and return it as target
2943 builtin_memset_read_str (void *data, HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
2944 enum machine_mode mode)
2946 const char *c = (const char *) data;
2947 char *p = alloca (GET_MODE_SIZE (mode));
2949 memset (p, *c, GET_MODE_SIZE (mode));
2951 return c_readstr (p, mode);
2954 /* Callback routine for store_by_pieces. Return the RTL of a register
2955 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
2956 char value given in the RTL register data. For example, if mode is
2957 4 bytes wide, return the RTL for 0x01010101*data. */
2960 builtin_memset_gen_str (void *data, HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
2961 enum machine_mode mode)
2967 size = GET_MODE_SIZE (mode);
2972 memset (p, 1, size);
2973 coeff = c_readstr (p, mode);
2975 target = convert_to_mode (mode, (rtx) data, 1);
2976 target = expand_mult (mode, target, coeff, NULL_RTX, 1);
2977 return force_reg (mode, target);
2980 /* Expand expression EXP, which is a call to the memset builtin. Return 0
2981 if we failed the caller should emit a normal call, otherwise try to get
2982 the result in TARGET, if convenient (and in mode MODE if that's
2986 expand_builtin_memset (tree arglist, rtx target, enum machine_mode mode)
2988 if (!validate_arglist (arglist,
2989 POINTER_TYPE, INTEGER_TYPE, INTEGER_TYPE, VOID_TYPE))
2993 tree dest = TREE_VALUE (arglist);
2994 tree val = TREE_VALUE (TREE_CHAIN (arglist));
2995 tree len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
2998 unsigned int dest_align
2999 = get_pointer_alignment (dest, BIGGEST_ALIGNMENT);
3000 rtx dest_mem, dest_addr, len_rtx;
3002 /* If DEST is not a pointer type, don't do this
3003 operation in-line. */
3004 if (dest_align == 0)
3007 /* If the LEN parameter is zero, return DEST. */
3008 if (integer_zerop (len))
3010 /* Evaluate and ignore VAL in case it has side-effects. */
3011 expand_expr (val, const0_rtx, VOIDmode, EXPAND_NORMAL);
3012 return expand_expr (dest, target, mode, EXPAND_NORMAL);
3015 if (TREE_CODE (val) != INTEGER_CST)
3019 if (!host_integerp (len, 1))
3022 if (optimize_size && tree_low_cst (len, 1) > 1)
3025 /* Assume that we can memset by pieces if we can store the
3026 * the coefficients by pieces (in the required modes).
3027 * We can't pass builtin_memset_gen_str as that emits RTL. */
3029 if (!can_store_by_pieces (tree_low_cst (len, 1),
3030 builtin_memset_read_str,
3034 val = fold (build1 (CONVERT_EXPR, unsigned_char_type_node, val));
3035 val_rtx = expand_expr (val, NULL_RTX, VOIDmode, 0);
3036 val_rtx = force_reg (TYPE_MODE (unsigned_char_type_node),
3038 dest_mem = get_memory_rtx (dest);
3039 store_by_pieces (dest_mem, tree_low_cst (len, 1),
3040 builtin_memset_gen_str,
3041 val_rtx, dest_align, 0);
3042 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3043 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3047 if (target_char_cast (val, &c))
3052 if (!host_integerp (len, 1))
3054 if (!can_store_by_pieces (tree_low_cst (len, 1),
3055 builtin_memset_read_str, &c,
3059 dest_mem = get_memory_rtx (dest);
3060 store_by_pieces (dest_mem, tree_low_cst (len, 1),
3061 builtin_memset_read_str,
3063 dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3064 dest_mem = convert_memory_address (ptr_mode, dest_mem);
3068 len_rtx = expand_expr (len, NULL_RTX, VOIDmode, 0);
3070 dest_mem = get_memory_rtx (dest);
3071 set_mem_align (dest_mem, dest_align);
3072 dest_addr = clear_storage (dest_mem, len_rtx);
3076 dest_addr = force_operand (XEXP (dest_mem, 0), NULL_RTX);
3077 dest_addr = convert_memory_address (ptr_mode, dest_addr);
3084 /* Expand expression EXP, which is a call to the bzero builtin. Return 0
3085 if we failed the caller should emit a normal call. */
3088 expand_builtin_bzero (tree arglist)
3090 tree dest, size, newarglist;
3092 if (!validate_arglist (arglist, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3095 dest = TREE_VALUE (arglist);
3096 size = TREE_VALUE (TREE_CHAIN (arglist));
3098 /* New argument list transforming bzero(ptr x, int y) to
3099 memset(ptr x, int 0, size_t y). This is done this way
3100 so that if it isn't expanded inline, we fallback to
3101 calling bzero instead of memset. */
3103 newarglist = build_tree_list (NULL_TREE, convert (sizetype, size));
3104 newarglist = tree_cons (NULL_TREE, integer_zero_node, newarglist);
3105 newarglist = tree_cons (NULL_TREE, dest, newarglist);
3107 return expand_builtin_memset (newarglist, const0_rtx, VOIDmode);
3110 /* Expand expression EXP, which is a call to the memcmp built-in function.
3111 ARGLIST is the argument list for this call. Return 0 if we failed and the
3112 caller should emit a normal call, otherwise try to get the result in
3113 TARGET, if convenient (and in mode MODE, if that's convenient). */
3116 expand_builtin_memcmp (tree exp ATTRIBUTE_UNUSED, tree arglist, rtx target,
3117 enum machine_mode mode)
3119 tree arg1, arg2, len;
3120 const char *p1, *p2;
3122 if (!validate_arglist (arglist,
3123 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3126 arg1 = TREE_VALUE (arglist);
3127 arg2 = TREE_VALUE (TREE_CHAIN (arglist));
3128 len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
3130 /* If the len parameter is zero, return zero. */
3131 if (integer_zerop (len))
3133 /* Evaluate and ignore arg1 and arg2 in case they have
3135 expand_expr (arg1, const0_rtx, VOIDmode, EXPAND_NORMAL);
3136 expand_expr (arg2, const0_rtx, VOIDmode, EXPAND_NORMAL);
3140 /* If both arguments are equal (and not volatile), return zero. */
3141 if (operand_equal_p (arg1, arg2, 0))
3143 /* Evaluate and ignore len in case it has side-effects. */
3144 expand_expr (len, const0_rtx, VOIDmode, EXPAND_NORMAL);
3148 p1 = c_getstr (arg1);
3149 p2 = c_getstr (arg2);
3151 /* If all arguments are constant, and the value of len is not greater
3152 than the lengths of arg1 and arg2, evaluate at compile-time. */
3153 if (host_integerp (len, 1) && p1 && p2
3154 && compare_tree_int (len, strlen (p1) + 1) <= 0
3155 && compare_tree_int (len, strlen (p2) + 1) <= 0)
3157 const int r = memcmp (p1, p2, tree_low_cst (len, 1));
3159 return (r < 0 ? constm1_rtx : (r > 0 ? const1_rtx : const0_rtx));
3162 /* If len parameter is one, return an expression corresponding to
3163 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
3164 if (integer_onep (len))
3166 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
3167 tree cst_uchar_ptr_node = build_pointer_type (cst_uchar_node);
3169 fold (build1 (CONVERT_EXPR, integer_type_node,
3170 build1 (INDIRECT_REF, cst_uchar_node,
3171 build1 (NOP_EXPR, cst_uchar_ptr_node, arg1))));
3173 fold (build1 (CONVERT_EXPR, integer_type_node,
3174 build1 (INDIRECT_REF, cst_uchar_node,
3175 build1 (NOP_EXPR, cst_uchar_ptr_node, arg2))));
3176 tree result = fold (build (MINUS_EXPR, integer_type_node, ind1, ind2));
3177 return expand_expr (result, target, mode, EXPAND_NORMAL);
3180 #if defined HAVE_cmpmemsi || defined HAVE_cmpstrsi
3182 rtx arg1_rtx, arg2_rtx, arg3_rtx;
3187 = get_pointer_alignment (arg1, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3189 = get_pointer_alignment (arg2, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3190 enum machine_mode insn_mode;
3192 #ifdef HAVE_cmpmemsi
3194 insn_mode = insn_data[(int) CODE_FOR_cmpmemsi].operand[0].mode;
3197 #ifdef HAVE_cmpstrsi
3199 insn_mode = insn_data[(int) CODE_FOR_cmpstrsi].operand[0].mode;
3204 /* If we don't have POINTER_TYPE, call the function. */
3205 if (arg1_align == 0 || arg2_align == 0)
3208 /* Make a place to write the result of the instruction. */
3211 && GET_CODE (result) == REG && GET_MODE (result) == insn_mode
3212 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
3213 result = gen_reg_rtx (insn_mode);
3215 arg1_rtx = get_memory_rtx (arg1);
3216 arg2_rtx = get_memory_rtx (arg2);
3217 arg3_rtx = expand_expr (len, NULL_RTX, VOIDmode, 0);
3218 #ifdef HAVE_cmpmemsi
3220 insn = gen_cmpmemsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
3221 GEN_INT (MIN (arg1_align, arg2_align)));
3224 #ifdef HAVE_cmpstrsi
3226 insn = gen_cmpstrsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
3227 GEN_INT (MIN (arg1_align, arg2_align)));
3235 emit_library_call_value (memcmp_libfunc, result, LCT_PURE_MAKE_BLOCK,
3236 TYPE_MODE (integer_type_node), 3,
3237 XEXP (arg1_rtx, 0), Pmode,
3238 XEXP (arg2_rtx, 0), Pmode,
3239 convert_to_mode (TYPE_MODE (sizetype), arg3_rtx,
3240 TREE_UNSIGNED (sizetype)),
3241 TYPE_MODE (sizetype));
3243 /* Return the value in the proper mode for this function. */
3244 mode = TYPE_MODE (TREE_TYPE (exp));
3245 if (GET_MODE (result) == mode)
3247 else if (target != 0)
3249 convert_move (target, result, 0);
3253 return convert_to_mode (mode, result, 0);
3260 /* Expand expression EXP, which is a call to the strcmp builtin. Return 0
3261 if we failed the caller should emit a normal call, otherwise try to get
3262 the result in TARGET, if convenient. */
3265 expand_builtin_strcmp (tree exp, rtx target, enum machine_mode mode)
3267 tree arglist = TREE_OPERAND (exp, 1);
3269 const char *p1, *p2;
3271 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3274 arg1 = TREE_VALUE (arglist);
3275 arg2 = TREE_VALUE (TREE_CHAIN (arglist));
3277 /* If both arguments are equal (and not volatile), return zero. */
3278 if (operand_equal_p (arg1, arg2, 0))
3281 p1 = c_getstr (arg1);
3282 p2 = c_getstr (arg2);
3286 const int i = strcmp (p1, p2);
3287 return (i < 0 ? constm1_rtx : (i > 0 ? const1_rtx : const0_rtx));
3290 /* If either arg is "", return an expression corresponding to
3291 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
3292 if ((p1 && *p1 == '\0') || (p2 && *p2 == '\0'))
3294 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
3295 tree cst_uchar_ptr_node = build_pointer_type (cst_uchar_node);
3297 fold (build1 (CONVERT_EXPR, integer_type_node,
3298 build1 (INDIRECT_REF, cst_uchar_node,
3299 build1 (NOP_EXPR, cst_uchar_ptr_node, arg1))));
3301 fold (build1 (CONVERT_EXPR, integer_type_node,
3302 build1 (INDIRECT_REF, cst_uchar_node,
3303 build1 (NOP_EXPR, cst_uchar_ptr_node, arg2))));
3304 tree result = fold (build (MINUS_EXPR, integer_type_node, ind1, ind2));
3305 return expand_expr (result, target, mode, EXPAND_NORMAL);
3308 #ifdef HAVE_cmpstrsi
3311 tree len, len1, len2;
3312 rtx arg1_rtx, arg2_rtx, arg3_rtx;
3317 = get_pointer_alignment (arg1, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3319 = get_pointer_alignment (arg2, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3320 enum machine_mode insn_mode
3321 = insn_data[(int) CODE_FOR_cmpstrsi].operand[0].mode;
3323 len1 = c_strlen (arg1, 1);
3324 len2 = c_strlen (arg2, 1);
3327 len1 = size_binop (PLUS_EXPR, ssize_int (1), len1);
3329 len2 = size_binop (PLUS_EXPR, ssize_int (1), len2);
3331 /* If we don't have a constant length for the first, use the length
3332 of the second, if we know it. We don't require a constant for
3333 this case; some cost analysis could be done if both are available
3334 but neither is constant. For now, assume they're equally cheap,
3335 unless one has side effects. If both strings have constant lengths,
3342 else if (TREE_SIDE_EFFECTS (len1))
3344 else if (TREE_SIDE_EFFECTS (len2))
3346 else if (TREE_CODE (len1) != INTEGER_CST)
3348 else if (TREE_CODE (len2) != INTEGER_CST)
3350 else if (tree_int_cst_lt (len1, len2))
3355 /* If both arguments have side effects, we cannot optimize. */
3356 if (!len || TREE_SIDE_EFFECTS (len))
3359 /* If we don't have POINTER_TYPE, call the function. */
3360 if (arg1_align == 0 || arg2_align == 0)
3363 /* Make a place to write the result of the instruction. */
3366 && GET_CODE (result) == REG && GET_MODE (result) == insn_mode
3367 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
3368 result = gen_reg_rtx (insn_mode);
3370 /* Stabilize the arguments in case gen_cmpstrsi fails. */
3371 arg1 = save_expr (arg1);
3372 arg2 = save_expr (arg2);
3374 arg1_rtx = get_memory_rtx (arg1);
3375 arg2_rtx = get_memory_rtx (arg2);
3376 arg3_rtx = expand_expr (len, NULL_RTX, VOIDmode, 0);
3377 insn = gen_cmpstrsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
3378 GEN_INT (MIN (arg1_align, arg2_align)));
3383 /* Return the value in the proper mode for this function. */
3384 mode = TYPE_MODE (TREE_TYPE (exp));
3385 if (GET_MODE (result) == mode)
3388 return convert_to_mode (mode, result, 0);
3389 convert_move (target, result, 0);
3393 /* Expand the library call ourselves using a stabilized argument
3394 list to avoid re-evaluating the function's arguments twice. */
3395 arglist = build_tree_list (NULL_TREE, arg2);
3396 arglist = tree_cons (NULL_TREE, arg1, arglist);
3397 fndecl = get_callee_fndecl (exp);
3398 exp = build_function_call_expr (fndecl, arglist);
3399 return expand_call (exp, target, target == const0_rtx);
3405 /* Expand expression EXP, which is a call to the strncmp builtin. Return 0
3406 if we failed the caller should emit a normal call, otherwise try to get
3407 the result in TARGET, if convenient. */
3410 expand_builtin_strncmp (tree exp, rtx target, enum machine_mode mode)
3412 tree arglist = TREE_OPERAND (exp, 1);
3413 tree arg1, arg2, arg3;
3414 const char *p1, *p2;
3416 if (!validate_arglist (arglist,
3417 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3420 arg1 = TREE_VALUE (arglist);
3421 arg2 = TREE_VALUE (TREE_CHAIN (arglist));
3422 arg3 = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
3424 /* If the len parameter is zero, return zero. */
3425 if (integer_zerop (arg3))
3427 /* Evaluate and ignore arg1 and arg2 in case they have
3429 expand_expr (arg1, const0_rtx, VOIDmode, EXPAND_NORMAL);
3430 expand_expr (arg2, const0_rtx, VOIDmode, EXPAND_NORMAL);
3434 /* If arg1 and arg2 are equal (and not volatile), return zero. */
3435 if (operand_equal_p (arg1, arg2, 0))
3437 /* Evaluate and ignore arg3 in case it has side-effects. */
3438 expand_expr (arg3, const0_rtx, VOIDmode, EXPAND_NORMAL);
3442 p1 = c_getstr (arg1);
3443 p2 = c_getstr (arg2);
3445 /* If all arguments are constant, evaluate at compile-time. */
3446 if (host_integerp (arg3, 1) && p1 && p2)
3448 const int r = strncmp (p1, p2, tree_low_cst (arg3, 1));
3449 return (r < 0 ? constm1_rtx : (r > 0 ? const1_rtx : const0_rtx));
3452 /* If len == 1 or (either string parameter is "" and (len >= 1)),
3453 return (*(const u_char*)arg1 - *(const u_char*)arg2). */
3454 if (host_integerp (arg3, 1)
3455 && (tree_low_cst (arg3, 1) == 1
3456 || (tree_low_cst (arg3, 1) > 1
3457 && ((p1 && *p1 == '\0') || (p2 && *p2 == '\0')))))
3459 tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
3460 tree cst_uchar_ptr_node = build_pointer_type (cst_uchar_node);
3462 fold (build1 (CONVERT_EXPR, integer_type_node,
3463 build1 (INDIRECT_REF, cst_uchar_node,
3464 build1 (NOP_EXPR, cst_uchar_ptr_node, arg1))));
3466 fold (build1 (CONVERT_EXPR, integer_type_node,
3467 build1 (INDIRECT_REF, cst_uchar_node,
3468 build1 (NOP_EXPR, cst_uchar_ptr_node, arg2))));
3469 tree result = fold (build (MINUS_EXPR, integer_type_node, ind1, ind2));
3470 return expand_expr (result, target, mode, EXPAND_NORMAL);
3473 /* If c_strlen can determine an expression for one of the string
3474 lengths, and it doesn't have side effects, then emit cmpstrsi
3475 using length MIN(strlen(string)+1, arg3). */
3476 #ifdef HAVE_cmpstrsi
3479 tree len, len1, len2;
3480 rtx arg1_rtx, arg2_rtx, arg3_rtx;
3485 = get_pointer_alignment (arg1, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3487 = get_pointer_alignment (arg2, BIGGEST_ALIGNMENT) / BITS_PER_UNIT;
3488 enum machine_mode insn_mode
3489 = insn_data[(int) CODE_FOR_cmpstrsi].operand[0].mode;
3491 len1 = c_strlen (arg1, 1);
3492 len2 = c_strlen (arg2, 1);
3495 len1 = size_binop (PLUS_EXPR, ssize_int (1), len1);
3497 len2 = size_binop (PLUS_EXPR, ssize_int (1), len2);
3499 /* If we don't have a constant length for the first, use the length
3500 of the second, if we know it. We don't require a constant for
3501 this case; some cost analysis could be done if both are available
3502 but neither is constant. For now, assume they're equally cheap,
3503 unless one has side effects. If both strings have constant lengths,
3510 else if (TREE_SIDE_EFFECTS (len1))
3512 else if (TREE_SIDE_EFFECTS (len2))
3514 else if (TREE_CODE (len1) != INTEGER_CST)
3516 else if (TREE_CODE (len2) != INTEGER_CST)
3518 else if (tree_int_cst_lt (len1, len2))
3523 /* If both arguments have side effects, we cannot optimize. */
3524 if (!len || TREE_SIDE_EFFECTS (len))
3527 /* The actual new length parameter is MIN(len,arg3). */
3528 len = fold (build (MIN_EXPR, TREE_TYPE (len), len, arg3));
3530 /* If we don't have POINTER_TYPE, call the function. */
3531 if (arg1_align == 0 || arg2_align == 0)
3534 /* Make a place to write the result of the instruction. */
3537 && GET_CODE (result) == REG && GET_MODE (result) == insn_mode
3538 && REGNO (result) >= FIRST_PSEUDO_REGISTER))
3539 result = gen_reg_rtx (insn_mode);
3541 /* Stabilize the arguments in case gen_cmpstrsi fails. */
3542 arg1 = save_expr (arg1);
3543 arg2 = save_expr (arg2);
3544 len = save_expr (len);
3546 arg1_rtx = get_memory_rtx (arg1);
3547 arg2_rtx = get_memory_rtx (arg2);
3548 arg3_rtx = expand_expr (len, NULL_RTX, VOIDmode, 0);
3549 insn = gen_cmpstrsi (result, arg1_rtx, arg2_rtx, arg3_rtx,
3550 GEN_INT (MIN (arg1_align, arg2_align)));
3555 /* Return the value in the proper mode for this function. */
3556 mode = TYPE_MODE (TREE_TYPE (exp));
3557 if (GET_MODE (result) == mode)
3560 return convert_to_mode (mode, result, 0);
3561 convert_move (target, result, 0);
3565 /* Expand the library call ourselves using a stabilized argument
3566 list to avoid re-evaluating the function's arguments twice. */
3567 arglist = build_tree_list (NULL_TREE, len);
3568 arglist = tree_cons (NULL_TREE, arg2, arglist);
3569 arglist = tree_cons (NULL_TREE, arg1, arglist);
3570 fndecl = get_callee_fndecl (exp);
3571 exp = build_function_call_expr (fndecl, arglist);
3572 return expand_call (exp, target, target == const0_rtx);
3578 /* Expand expression EXP, which is a call to the strcat builtin.
3579 Return 0 if we failed the caller should emit a normal call,
3580 otherwise try to get the result in TARGET, if convenient. */
3583 expand_builtin_strcat (tree arglist, rtx target, enum machine_mode mode)
3585 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3589 tree dst = TREE_VALUE (arglist),
3590 src = TREE_VALUE (TREE_CHAIN (arglist));
3591 const char *p = c_getstr (src);
3595 /* If the string length is zero, return the dst parameter. */
3597 return expand_expr (dst, target, mode, EXPAND_NORMAL);
3598 else if (!optimize_size)
3600 /* Otherwise if !optimize_size, see if we can store by
3601 pieces into (dst + strlen(dst)). */
3602 tree newdst, arglist,
3603 strlen_fn = implicit_built_in_decls[BUILT_IN_STRLEN];
3605 /* This is the length argument. */
3606 arglist = build_tree_list (NULL_TREE,
3607 fold (size_binop (PLUS_EXPR,
3610 /* Prepend src argument. */
3611 arglist = tree_cons (NULL_TREE, src, arglist);
3613 /* We're going to use dst more than once. */
3614 dst = save_expr (dst);
3616 /* Create strlen (dst). */
3618 fold (build_function_call_expr (strlen_fn,
3619 build_tree_list (NULL_TREE,
3621 /* Create (dst + strlen (dst)). */
3622 newdst = fold (build (PLUS_EXPR, TREE_TYPE (dst), dst, newdst));
3624 /* Prepend the new dst argument. */
3625 arglist = tree_cons (NULL_TREE, newdst, arglist);
3627 /* We don't want to get turned into a memcpy if the
3628 target is const0_rtx, i.e. when the return value
3629 isn't used. That would produce pessimized code so
3630 pass in a target of zero, it should never actually be
3631 used. If this was successful return the original
3632 dst, not the result of mempcpy. */
3633 if (expand_builtin_mempcpy (arglist, /*target=*/0, mode, /*endp=*/0))
3634 return expand_expr (dst, target, mode, EXPAND_NORMAL);
3644 /* Expand expression EXP, which is a call to the strncat builtin.
3645 Return 0 if we failed the caller should emit a normal call,
3646 otherwise try to get the result in TARGET, if convenient. */
3649 expand_builtin_strncat (tree arglist, rtx target, enum machine_mode mode)
3651 if (!validate_arglist (arglist,
3652 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3656 tree dst = TREE_VALUE (arglist),
3657 src = TREE_VALUE (TREE_CHAIN (arglist)),
3658 len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
3659 const char *p = c_getstr (src);
3661 /* If the requested length is zero, or the src parameter string
3662 length is zero, return the dst parameter. */
3663 if (integer_zerop (len) || (p && *p == '\0'))
3665 /* Evaluate and ignore the src and len parameters in case
3666 they have side-effects. */
3667 expand_expr (src, const0_rtx, VOIDmode, EXPAND_NORMAL);
3668 expand_expr (len, const0_rtx, VOIDmode, EXPAND_NORMAL);
3669 return expand_expr (dst, target, mode, EXPAND_NORMAL);
3672 /* If the requested len is greater than or equal to the string
3673 length, call strcat. */
3674 if (TREE_CODE (len) == INTEGER_CST && p
3675 && compare_tree_int (len, strlen (p)) >= 0)
3678 = tree_cons (NULL_TREE, dst, build_tree_list (NULL_TREE, src));
3679 tree fn = implicit_built_in_decls[BUILT_IN_STRCAT];
3681 /* If the replacement _DECL isn't initialized, don't do the
3686 return expand_expr (build_function_call_expr (fn, newarglist),
3687 target, mode, EXPAND_NORMAL);
3693 /* Expand expression EXP, which is a call to the strspn builtin.
3694 Return 0 if we failed the caller should emit a normal call,
3695 otherwise try to get the result in TARGET, if convenient. */
3698 expand_builtin_strspn (tree arglist, rtx target, enum machine_mode mode)
3700 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3704 tree s1 = TREE_VALUE (arglist), s2 = TREE_VALUE (TREE_CHAIN (arglist));
3705 const char *p1 = c_getstr (s1), *p2 = c_getstr (s2);
3707 /* If both arguments are constants, evaluate at compile-time. */
3710 const size_t r = strspn (p1, p2);
3711 return expand_expr (size_int (r), target, mode, EXPAND_NORMAL);
3714 /* If either argument is "", return 0. */
3715 if ((p1 && *p1 == '\0') || (p2 && *p2 == '\0'))
3717 /* Evaluate and ignore both arguments in case either one has
3719 expand_expr (s1, const0_rtx, VOIDmode, EXPAND_NORMAL);
3720 expand_expr (s2, const0_rtx, VOIDmode, EXPAND_NORMAL);
3727 /* Expand expression EXP, which is a call to the strcspn builtin.
3728 Return 0 if we failed the caller should emit a normal call,
3729 otherwise try to get the result in TARGET, if convenient. */
3732 expand_builtin_strcspn (tree arglist, rtx target, enum machine_mode mode)
3734 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3738 tree s1 = TREE_VALUE (arglist), s2 = TREE_VALUE (TREE_CHAIN (arglist));
3739 const char *p1 = c_getstr (s1), *p2 = c_getstr (s2);
3741 /* If both arguments are constants, evaluate at compile-time. */
3744 const size_t r = strcspn (p1, p2);
3745 return expand_expr (size_int (r), target, mode, EXPAND_NORMAL);
3748 /* If the first argument is "", return 0. */
3749 if (p1 && *p1 == '\0')
3751 /* Evaluate and ignore argument s2 in case it has
3753 expand_expr (s2, const0_rtx, VOIDmode, EXPAND_NORMAL);
3757 /* If the second argument is "", return __builtin_strlen(s1). */
3758 if (p2 && *p2 == '\0')
3760 tree newarglist = build_tree_list (NULL_TREE, s1),
3761 fn = implicit_built_in_decls[BUILT_IN_STRLEN];
3763 /* If the replacement _DECL isn't initialized, don't do the
3768 return expand_expr (build_function_call_expr (fn, newarglist),
3769 target, mode, EXPAND_NORMAL);
3775 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
3776 if that's convenient. */
3779 expand_builtin_saveregs (void)
3783 /* Don't do __builtin_saveregs more than once in a function.
3784 Save the result of the first call and reuse it. */
3785 if (saveregs_value != 0)
3786 return saveregs_value;
3788 /* When this function is called, it means that registers must be
3789 saved on entry to this function. So we migrate the call to the
3790 first insn of this function. */
3794 /* Do whatever the machine needs done in this case. */
3795 val = targetm.calls.expand_builtin_saveregs ();
3800 saveregs_value = val;
3802 /* Put the insns after the NOTE that starts the function. If this
3803 is inside a start_sequence, make the outer-level insn chain current, so
3804 the code is placed at the start of the function. */
3805 push_topmost_sequence ();
3806 emit_insn_after (seq, get_insns ());
3807 pop_topmost_sequence ();
3812 /* __builtin_args_info (N) returns word N of the arg space info
3813 for the current function. The number and meanings of words
3814 is controlled by the definition of CUMULATIVE_ARGS. */
3817 expand_builtin_args_info (tree arglist)
3819 int nwords = sizeof (CUMULATIVE_ARGS) / sizeof (int);
3820 int *word_ptr = (int *) ¤t_function_args_info;
3822 if (sizeof (CUMULATIVE_ARGS) % sizeof (int) != 0)
3827 if (!host_integerp (TREE_VALUE (arglist), 0))
3828 error ("argument of `__builtin_args_info' must be constant");
3831 HOST_WIDE_INT wordnum = tree_low_cst (TREE_VALUE (arglist), 0);
3833 if (wordnum < 0 || wordnum >= nwords)
3834 error ("argument of `__builtin_args_info' out of range");
3836 return GEN_INT (word_ptr[wordnum]);
3840 error ("missing argument in `__builtin_args_info'");
3845 /* Expand ARGLIST, from a call to __builtin_next_arg. */
3848 expand_builtin_next_arg (tree arglist)
3850 tree fntype = TREE_TYPE (current_function_decl);
3852 if (TYPE_ARG_TYPES (fntype) == 0
3853 || (TREE_VALUE (tree_last (TYPE_ARG_TYPES (fntype)))
3856 error ("`va_start' used in function with fixed args");
3862 tree last_parm = tree_last (DECL_ARGUMENTS (current_function_decl));
3863 tree arg = TREE_VALUE (arglist);
3865 /* Strip off all nops for the sake of the comparison. This
3866 is not quite the same as STRIP_NOPS. It does more.
3867 We must also strip off INDIRECT_EXPR for C++ reference
3869 while (TREE_CODE (arg) == NOP_EXPR
3870 || TREE_CODE (arg) == CONVERT_EXPR
3871 || TREE_CODE (arg) == NON_LVALUE_EXPR
3872 || TREE_CODE (arg) == INDIRECT_REF)
3873 arg = TREE_OPERAND (arg, 0);
3874 if (arg != last_parm)
3875 warning ("second parameter of `va_start' not last named argument");
3878 /* Evidently an out of date version of <stdarg.h>; can't validate
3879 va_start's second argument, but can still work as intended. */
3880 warning ("`__builtin_next_arg' called without an argument");
3882 return expand_binop (Pmode, add_optab,
3883 current_function_internal_arg_pointer,
3884 current_function_arg_offset_rtx,
3885 NULL_RTX, 0, OPTAB_LIB_WIDEN);
3888 /* Make it easier for the backends by protecting the valist argument
3889 from multiple evaluations. */
3892 stabilize_va_list (tree valist, int needs_lvalue)
3894 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
3896 if (TREE_SIDE_EFFECTS (valist))
3897 valist = save_expr (valist);
3899 /* For this case, the backends will be expecting a pointer to
3900 TREE_TYPE (va_list_type_node), but it's possible we've
3901 actually been given an array (an actual va_list_type_node).
3903 if (TREE_CODE (TREE_TYPE (valist)) == ARRAY_TYPE)
3905 tree p1 = build_pointer_type (TREE_TYPE (va_list_type_node));
3906 tree p2 = build_pointer_type (va_list_type_node);
3908 valist = build1 (ADDR_EXPR, p2, valist);
3909 valist = fold (build1 (NOP_EXPR, p1, valist));
3918 if (! TREE_SIDE_EFFECTS (valist))
3921 pt = build_pointer_type (va_list_type_node);
3922 valist = fold (build1 (ADDR_EXPR, pt, valist));
3923 TREE_SIDE_EFFECTS (valist) = 1;
3926 if (TREE_SIDE_EFFECTS (valist))
3927 valist = save_expr (valist);
3928 valist = fold (build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (valist)),
3935 /* The "standard" definition of va_list is void*. */
3938 std_build_builtin_va_list (void)
3940 return ptr_type_node;
3943 /* The "standard" implementation of va_start: just assign `nextarg' to
3947 std_expand_builtin_va_start (tree valist, rtx nextarg)
3951 t = build (MODIFY_EXPR, TREE_TYPE (valist), valist,
3952 make_tree (ptr_type_node, nextarg));
3953 TREE_SIDE_EFFECTS (t) = 1;
3955 expand_expr (t, const0_rtx, VOIDmode, EXPAND_NORMAL);
3958 /* Expand ARGLIST, from a call to __builtin_va_start. */
3961 expand_builtin_va_start (tree arglist)
3966 chain = TREE_CHAIN (arglist);
3968 if (TREE_CHAIN (chain))
3969 error ("too many arguments to function `va_start'");
3971 nextarg = expand_builtin_next_arg (chain);
3972 valist = stabilize_va_list (TREE_VALUE (arglist), 1);
3974 #ifdef EXPAND_BUILTIN_VA_START
3975 EXPAND_BUILTIN_VA_START (valist, nextarg);
3977 std_expand_builtin_va_start (valist, nextarg);
3983 /* The "standard" implementation of va_arg: read the value from the
3984 current (padded) address and increment by the (padded) size. */
3987 std_expand_builtin_va_arg (tree valist, tree type)
3989 tree addr_tree, t, type_size = NULL;
3990 tree align, alignm1;
3994 /* Compute the rounded size of the type. */
3995 align = size_int (PARM_BOUNDARY / BITS_PER_UNIT);
3996 alignm1 = size_int (PARM_BOUNDARY / BITS_PER_UNIT - 1);
3997 if (type == error_mark_node
3998 || (type_size = TYPE_SIZE_UNIT (TYPE_MAIN_VARIANT (type))) == NULL
3999 || TREE_OVERFLOW (type_size))
4000 rounded_size = size_zero_node;
4002 rounded_size = fold (build (MULT_EXPR, sizetype,
4003 fold (build (TRUNC_DIV_EXPR, sizetype,
4004 fold (build (PLUS_EXPR, sizetype,
4005 type_size, alignm1)),
4011 if (PAD_VARARGS_DOWN && ! integer_zerop (rounded_size))
4013 /* Small args are padded downward. */
4014 addr_tree = fold (build (PLUS_EXPR, TREE_TYPE (addr_tree), addr_tree,
4015 fold (build (COND_EXPR, sizetype,
4016 fold (build (GT_EXPR, sizetype,
4020 fold (build (MINUS_EXPR, sizetype,
4025 addr = expand_expr (addr_tree, NULL_RTX, Pmode, EXPAND_NORMAL);
4026 addr = copy_to_reg (addr);
4028 /* Compute new value for AP. */
4029 if (! integer_zerop (rounded_size))
4031 t = build (MODIFY_EXPR, TREE_TYPE (valist), valist,
4032 build (PLUS_EXPR, TREE_TYPE (valist), valist,
4034 TREE_SIDE_EFFECTS (t) = 1;
4035 expand_expr (t, const0_rtx, VOIDmode, EXPAND_NORMAL);
4041 /* Expand __builtin_va_arg, which is not really a builtin function, but
4042 a very special sort of operator. */
4045 expand_builtin_va_arg (tree valist, tree type)
4048 tree promoted_type, want_va_type, have_va_type;
4050 /* Verify that valist is of the proper type. */
4052 want_va_type = va_list_type_node;
4053 have_va_type = TREE_TYPE (valist);
4054 if (TREE_CODE (want_va_type) == ARRAY_TYPE)
4056 /* If va_list is an array type, the argument may have decayed
4057 to a pointer type, e.g. by being passed to another function.
4058 In that case, unwrap both types so that we can compare the
4059 underlying records. */
4060 if (TREE_CODE (have_va_type) == ARRAY_TYPE
4061 || TREE_CODE (have_va_type) == POINTER_TYPE)
4063 want_va_type = TREE_TYPE (want_va_type);
4064 have_va_type = TREE_TYPE (have_va_type);
4067 if (TYPE_MAIN_VARIANT (want_va_type) != TYPE_MAIN_VARIANT (have_va_type))
4069 error ("first argument to `va_arg' not of type `va_list'");
4073 /* Generate a diagnostic for requesting data of a type that cannot
4074 be passed through `...' due to type promotion at the call site. */
4075 else if ((promoted_type = (*lang_hooks.types.type_promotes_to) (type))
4078 const char *name = "<anonymous type>", *pname = 0;
4079 static bool gave_help;
4081 if (TYPE_NAME (type))
4083 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
4084 name = IDENTIFIER_POINTER (TYPE_NAME (type));
4085 else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
4086 && DECL_NAME (TYPE_NAME (type)))
4087 name = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type)));
4089 if (TYPE_NAME (promoted_type))
4091 if (TREE_CODE (TYPE_NAME (promoted_type)) == IDENTIFIER_NODE)
4092 pname = IDENTIFIER_POINTER (TYPE_NAME (promoted_type));
4093 else if (TREE_CODE (TYPE_NAME (promoted_type)) == TYPE_DECL
4094 && DECL_NAME (TYPE_NAME (promoted_type)))
4095 pname = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (promoted_type)));
4098 /* Unfortunately, this is merely undefined, rather than a constraint
4099 violation, so we cannot make this an error. If this call is never
4100 executed, the program is still strictly conforming. */
4101 warning ("`%s' is promoted to `%s' when passed through `...'",
4106 warning ("(so you should pass `%s' not `%s' to `va_arg')",
4110 /* We can, however, treat "undefined" any way we please.
4111 Call abort to encourage the user to fix the program. */
4112 expand_builtin_trap ();
4114 /* This is dead code, but go ahead and finish so that the
4115 mode of the result comes out right. */
4120 /* Make it easier for the backends by protecting the valist argument
4121 from multiple evaluations. */
4122 valist = stabilize_va_list (valist, 0);
4124 #ifdef EXPAND_BUILTIN_VA_ARG
4125 addr = EXPAND_BUILTIN_VA_ARG (valist, type);
4127 addr = std_expand_builtin_va_arg (valist, type);
4131 addr = convert_memory_address (Pmode, addr);
4133 result = gen_rtx_MEM (TYPE_MODE (type), addr);
4134 set_mem_alias_set (result, get_varargs_alias_set ());
4139 /* Expand ARGLIST, from a call to __builtin_va_end. */
4142 expand_builtin_va_end (tree arglist)
4144 tree valist = TREE_VALUE (arglist);
4146 #ifdef EXPAND_BUILTIN_VA_END
4147 valist = stabilize_va_list (valist, 0);
4148 EXPAND_BUILTIN_VA_END (arglist);
4150 /* Evaluate for side effects, if needed. I hate macros that don't
4152 if (TREE_SIDE_EFFECTS (valist))
4153 expand_expr (valist, const0_rtx, VOIDmode, EXPAND_NORMAL);
4159 /* Expand ARGLIST, from a call to __builtin_va_copy. We do this as a
4160 builtin rather than just as an assignment in stdarg.h because of the
4161 nastiness of array-type va_list types. */
4164 expand_builtin_va_copy (tree arglist)
4168 dst = TREE_VALUE (arglist);
4169 src = TREE_VALUE (TREE_CHAIN (arglist));
4171 dst = stabilize_va_list (dst, 1);
4172 src = stabilize_va_list (src, 0);
4174 if (TREE_CODE (va_list_type_node) != ARRAY_TYPE)
4176 t = build (MODIFY_EXPR, va_list_type_node, dst, src);
4177 TREE_SIDE_EFFECTS (t) = 1;
4178 expand_expr (t, const0_rtx, VOIDmode, EXPAND_NORMAL);
4182 rtx dstb, srcb, size;
4184 /* Evaluate to pointers. */
4185 dstb = expand_expr (dst, NULL_RTX, Pmode, EXPAND_NORMAL);
4186 srcb = expand_expr (src, NULL_RTX, Pmode, EXPAND_NORMAL);
4187 size = expand_expr (TYPE_SIZE_UNIT (va_list_type_node), NULL_RTX,
4188 VOIDmode, EXPAND_NORMAL);
4190 dstb = convert_memory_address (Pmode, dstb);
4191 srcb = convert_memory_address (Pmode, srcb);
4193 /* "Dereference" to BLKmode memories. */
4194 dstb = gen_rtx_MEM (BLKmode, dstb);
4195 set_mem_alias_set (dstb, get_alias_set (TREE_TYPE (TREE_TYPE (dst))));
4196 set_mem_align (dstb, TYPE_ALIGN (va_list_type_node));
4197 srcb = gen_rtx_MEM (BLKmode, srcb);
4198 set_mem_alias_set (srcb, get_alias_set (TREE_TYPE (TREE_TYPE (src))));
4199 set_mem_align (srcb, TYPE_ALIGN (va_list_type_node));
4202 emit_block_move (dstb, srcb, size, BLOCK_OP_NORMAL);
4208 /* Expand a call to one of the builtin functions __builtin_frame_address or
4209 __builtin_return_address. */
4212 expand_builtin_frame_address (tree fndecl, tree arglist)
4214 /* The argument must be a nonnegative integer constant.
4215 It counts the number of frames to scan up the stack.
4216 The value is the return address saved in that frame. */
4218 /* Warning about missing arg was already issued. */
4220 else if (! host_integerp (TREE_VALUE (arglist), 1))
4222 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS)
4223 error ("invalid arg to `__builtin_frame_address'");
4225 error ("invalid arg to `__builtin_return_address'");
4231 = expand_builtin_return_addr (DECL_FUNCTION_CODE (fndecl),
4232 tree_low_cst (TREE_VALUE (arglist), 1),
4233 hard_frame_pointer_rtx);
4235 /* Some ports cannot access arbitrary stack frames. */
4238 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS)
4239 warning ("unsupported arg to `__builtin_frame_address'");
4241 warning ("unsupported arg to `__builtin_return_address'");
4245 /* For __builtin_frame_address, return what we've got. */
4246 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS)
4249 if (GET_CODE (tem) != REG
4250 && ! CONSTANT_P (tem))
4251 tem = copy_to_mode_reg (Pmode, tem);
4256 /* Expand a call to the alloca builtin, with arguments ARGLIST. Return 0 if
4257 we failed and the caller should emit a normal call, otherwise try to get
4258 the result in TARGET, if convenient. */
4261 expand_builtin_alloca (tree arglist, rtx target)
4266 if (!validate_arglist (arglist, INTEGER_TYPE, VOID_TYPE))
4269 /* Compute the argument. */
4270 op0 = expand_expr (TREE_VALUE (arglist), NULL_RTX, VOIDmode, 0);
4272 /* Allocate the desired space. */
4273 result = allocate_dynamic_stack_space (op0, target, BITS_PER_UNIT);
4274 result = convert_memory_address (ptr_mode, result);
4279 /* Expand a call to a unary builtin. The arguments are in ARGLIST.
4280 Return 0 if a normal call should be emitted rather than expanding the
4281 function in-line. If convenient, the result should be placed in TARGET.
4282 SUBTARGET may be used as the target for computing one of EXP's operands. */
4285 expand_builtin_unop (enum machine_mode target_mode, tree arglist, rtx target,
4286 rtx subtarget, optab op_optab)
4289 if (!validate_arglist (arglist, INTEGER_TYPE, VOID_TYPE))
4292 /* Compute the argument. */
4293 op0 = expand_expr (TREE_VALUE (arglist), subtarget, VOIDmode, 0);
4294 /* Compute op, into TARGET if possible.
4295 Set TARGET to wherever the result comes back. */
4296 target = expand_unop (TYPE_MODE (TREE_TYPE (TREE_VALUE (arglist))),
4297 op_optab, op0, target, 1);
4301 return convert_to_mode (target_mode, target, 0);
4304 /* If the string passed to fputs is a constant and is one character
4305 long, we attempt to transform this call into __builtin_fputc(). */
4308 expand_builtin_fputs (tree arglist, rtx target, bool unlocked)
4311 tree fn_fputc = unlocked ? implicit_built_in_decls[BUILT_IN_FPUTC_UNLOCKED]
4312 : implicit_built_in_decls[BUILT_IN_FPUTC];
4313 tree fn_fwrite = unlocked ? implicit_built_in_decls[BUILT_IN_FWRITE_UNLOCKED]
4314 : implicit_built_in_decls[BUILT_IN_FWRITE];
4316 /* If the return value is used, or the replacement _DECL isn't
4317 initialized, don't do the transformation. */
4318 if (target != const0_rtx || !fn_fputc || !fn_fwrite)
4321 /* Verify the arguments in the original call. */
4322 if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
4325 /* Get the length of the string passed to fputs. If the length
4326 can't be determined, punt. */
4327 if (!(len = c_strlen (TREE_VALUE (arglist), 1))
4328 || TREE_CODE (len) != INTEGER_CST)
4331 switch (compare_tree_int (len, 1))
4333 case -1: /* length is 0, delete the call entirely . */
4335 /* Evaluate and ignore the argument in case it has
4337 expand_expr (TREE_VALUE (TREE_CHAIN (arglist)), const0_rtx,
4338 VOIDmode, EXPAND_NORMAL);
4341 case 0: /* length is 1, call fputc. */
4343 const char *p = c_getstr (TREE_VALUE (arglist));
4347 /* New argument list transforming fputs(string, stream) to
4348 fputc(string[0], stream). */
4350 build_tree_list (NULL_TREE, TREE_VALUE (TREE_CHAIN (arglist)));
4352 tree_cons (NULL_TREE, build_int_2 (p[0], 0), arglist);
4358 case 1: /* length is greater than 1, call fwrite. */
4362 /* If optimizing for size keep fputs. */
4365 string_arg = TREE_VALUE (arglist);
4366 /* New argument list transforming fputs(string, stream) to
4367 fwrite(string, 1, len, stream). */
4368 arglist = build_tree_list (NULL_TREE, TREE_VALUE (TREE_CHAIN (arglist)));
4369 arglist = tree_cons (NULL_TREE, len, arglist);
4370 arglist = tree_cons (NULL_TREE, size_one_node, arglist);
4371 arglist = tree_cons (NULL_TREE, string_arg, arglist);
4379 return expand_expr (build_function_call_expr (fn, arglist),
4380 const0_rtx, VOIDmode, EXPAND_NORMAL);
4383 /* Expand a call to __builtin_expect. We return our argument and emit a
4384 NOTE_INSN_EXPECTED_VALUE note. This is the expansion of __builtin_expect in
4385 a non-jump context. */
4388 expand_builtin_expect (tree arglist, rtx target)
4393 if (arglist == NULL_TREE
4394 || TREE_CHAIN (arglist) == NULL_TREE)
4396 exp = TREE_VALUE (arglist);
4397 c = TREE_VALUE (TREE_CHAIN (arglist));
4399 if (TREE_CODE (c) != INTEGER_CST)
4401 error ("second arg to `__builtin_expect' must be a constant");
4402 c = integer_zero_node;
4405 target = expand_expr (exp, target, VOIDmode, EXPAND_NORMAL);
4407 /* Don't bother with expected value notes for integral constants. */
4408 if (flag_guess_branch_prob && GET_CODE (target) != CONST_INT)
4410 /* We do need to force this into a register so that we can be
4411 moderately sure to be able to correctly interpret the branch
4413 target = force_reg (GET_MODE (target), target);
4415 rtx_c = expand_expr (c, NULL_RTX, GET_MODE (target), EXPAND_NORMAL);
4417 note = emit_note (NOTE_INSN_EXPECTED_VALUE);
4418 NOTE_EXPECTED_VALUE (note) = gen_rtx_EQ (VOIDmode, target, rtx_c);
4424 /* Like expand_builtin_expect, except do this in a jump context. This is
4425 called from do_jump if the conditional is a __builtin_expect. Return either
4426 a list of insns to emit the jump or NULL if we cannot optimize
4427 __builtin_expect. We need to optimize this at jump time so that machines
4428 like the PowerPC don't turn the test into a SCC operation, and then jump
4429 based on the test being 0/1. */
4432 expand_builtin_expect_jump (tree exp, rtx if_false_label, rtx if_true_label)
4434 tree arglist = TREE_OPERAND (exp, 1);
4435 tree arg0 = TREE_VALUE (arglist);
4436 tree arg1 = TREE_VALUE (TREE_CHAIN (arglist));
4439 /* Only handle __builtin_expect (test, 0) and
4440 __builtin_expect (test, 1). */
4441 if (TREE_CODE (TREE_TYPE (arg1)) == INTEGER_TYPE
4442 && (integer_zerop (arg1) || integer_onep (arg1)))
4444 rtx insn, drop_through_label;
4446 /* Expand the jump insns. */
4448 do_jump (arg0, if_false_label, if_true_label);
4451 drop_through_label = get_last_insn ();
4452 if (drop_through_label && GET_CODE (drop_through_label) == NOTE)
4453 drop_through_label = prev_nonnote_insn (drop_through_label);
4454 if (drop_through_label && GET_CODE (drop_through_label) != CODE_LABEL)
4455 drop_through_label = NULL_RTX;
4458 if (! if_true_label)
4459 if_true_label = drop_through_label;
4460 if (! if_false_label)
4461 if_false_label = drop_through_label;
4463 /* Go through and add the expect's to each of the conditional jumps. */
4465 while (insn != NULL_RTX)
4467 rtx next = NEXT_INSN (insn);
4469 if (GET_CODE (insn) == JUMP_INSN && any_condjump_p (insn))
4471 rtx ifelse = SET_SRC (pc_set (insn));
4472 rtx then_dest = XEXP (ifelse, 1);
4473 rtx else_dest = XEXP (ifelse, 2);
4476 /* First check if we recognize any of the labels. */
4477 if (GET_CODE (then_dest) == LABEL_REF
4478 && XEXP (then_dest, 1) == if_true_label)
4480 else if (GET_CODE (then_dest) == LABEL_REF
4481 && XEXP (then_dest, 1) == if_false_label)
4483 else if (GET_CODE (else_dest) == LABEL_REF
4484 && XEXP (else_dest, 1) == if_false_label)
4486 else if (GET_CODE (else_dest) == LABEL_REF
4487 && XEXP (else_dest, 1) == if_true_label)
4489 /* Otherwise check where we drop through. */
4490 else if (else_dest == pc_rtx)
4492 if (next && GET_CODE (next) == NOTE)
4493 next = next_nonnote_insn (next);
4495 if (next && GET_CODE (next) == JUMP_INSN
4496 && any_uncondjump_p (next))
4497 next = XEXP (SET_SRC (pc_set (next)), 1);
4499 /* NEXT is either a CODE_LABEL, NULL_RTX or something
4500 else that can't possibly match either target label. */
4501 if (next == if_false_label)
4503 else if (next == if_true_label)
4506 else if (then_dest == pc_rtx)
4508 if (next && GET_CODE (next) == NOTE)
4509 next = next_nonnote_insn (next);
4511 if (next && GET_CODE (next) == JUMP_INSN
4512 && any_uncondjump_p (next))
4513 next = XEXP (SET_SRC (pc_set (next)), 1);
4515 if (next == if_false_label)
4517 else if (next == if_true_label)
4523 /* If the test is expected to fail, reverse the
4525 if (integer_zerop (arg1))
4527 predict_insn_def (insn, PRED_BUILTIN_EXPECT, taken);
4539 expand_builtin_trap (void)
4543 emit_insn (gen_trap ());
4546 emit_library_call (abort_libfunc, LCT_NORETURN, VOIDmode, 0);
4550 /* Expand a call to fabs, fabsf or fabsl with arguments ARGLIST.
4551 Return 0 if a normal call should be emitted rather than expanding
4552 the function inline. If convenient, the result should be placed
4553 in TARGET. SUBTARGET may be used as the target for computing
4557 expand_builtin_fabs (tree arglist, rtx target, rtx subtarget)
4559 enum machine_mode mode;
4563 if (!validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
4566 arg = TREE_VALUE (arglist);
4567 mode = TYPE_MODE (TREE_TYPE (arg));
4568 op0 = expand_expr (arg, subtarget, VOIDmode, 0);
4569 return expand_abs (mode, op0, target, 0, safe_from_p (target, arg, 1));
4572 /* Expand a call to cabs, cabsf or cabsl with arguments ARGLIST.
4573 Return 0 if a normal call should be emitted rather than expanding
4574 the function inline. If convenient, the result should be placed
4578 expand_builtin_cabs (tree arglist, rtx target)
4580 enum machine_mode mode;
4584 if (arglist == 0 || TREE_CHAIN (arglist))
4586 arg = TREE_VALUE (arglist);
4587 if (TREE_CODE (TREE_TYPE (arg)) != COMPLEX_TYPE
4588 || TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) != REAL_TYPE)
4591 mode = TYPE_MODE (TREE_TYPE (arg));
4592 op0 = expand_expr (arg, NULL_RTX, VOIDmode, 0);
4593 return expand_complex_abs (mode, op0, target, 0);
4596 /* Create a new constant string literal and return a char* pointer to it.
4597 The STRING_CST value is the LEN characters at STR. */
4599 build_string_literal (int len, const char *str)
4601 tree t, elem, index, type;
4603 t = build_string (len, str);
4604 elem = build_type_variant (char_type_node, 1, 0);
4605 index = build_index_type (build_int_2 (len - 1, 0));
4606 type = build_array_type (elem, index);
4607 TREE_TYPE (t) = type;
4608 TREE_CONSTANT (t) = 1;
4609 TREE_READONLY (t) = 1;
4610 TREE_STATIC (t) = 1;
4612 type = build_pointer_type (type);
4613 t = build1 (ADDR_EXPR, type, t);
4615 type = build_pointer_type (elem);
4616 t = build1 (NOP_EXPR, type, t);
4620 /* Expand a call to printf or printf_unlocked with argument list ARGLIST.
4621 Return 0 if a normal call should be emitted rather than transforming
4622 the function inline. If convenient, the result should be placed in
4623 TARGET with mode MODE. UNLOCKED indicates this is a printf_unlocked
4626 expand_builtin_printf (tree arglist, rtx target, enum machine_mode mode,
4629 tree fn_putchar = unlocked
4630 ? implicit_built_in_decls[BUILT_IN_PUTCHAR_UNLOCKED]
4631 : implicit_built_in_decls[BUILT_IN_PUTCHAR];
4632 tree fn_puts = unlocked ? implicit_built_in_decls[BUILT_IN_PUTS_UNLOCKED]
4633 : implicit_built_in_decls[BUILT_IN_PUTS];
4634 const char *fmt_str;
4637 /* If the return value is used, don't do the transformation. */
4638 if (target != const0_rtx)
4641 /* Verify the required arguments in the original call. */
4644 fmt = TREE_VALUE (arglist);
4645 if (TREE_CODE (TREE_TYPE (fmt)) != POINTER_TYPE)
4647 arglist = TREE_CHAIN (arglist);
4649 /* Check whether the format is a literal string constant. */
4650 fmt_str = c_getstr (fmt);
4651 if (fmt_str == NULL)
4654 /* If the format specifier was "%s\n", call __builtin_puts(arg). */
4655 if (strcmp (fmt_str, "%s\n") == 0)
4658 || TREE_CODE (TREE_TYPE (TREE_VALUE (arglist))) != POINTER_TYPE
4659 || TREE_CHAIN (arglist))
4663 /* If the format specifier was "%c", call __builtin_putchar(arg). */
4664 else if (strcmp (fmt_str, "%c") == 0)
4667 || TREE_CODE (TREE_TYPE (TREE_VALUE (arglist))) != INTEGER_TYPE
4668 || TREE_CHAIN (arglist))
4674 /* We can't handle anything else with % args or %% ... yet. */
4675 if (strchr (fmt_str, '%'))
4681 /* If the format specifier was "", printf does nothing. */
4682 if (fmt_str[0] == '\0')
4684 /* If the format specifier has length of 1, call putchar. */
4685 if (fmt_str[1] == '\0')
4687 /* Given printf("c"), (where c is any one character,)
4688 convert "c"[0] to an int and pass that to the replacement
4690 arg = build_int_2 (fmt_str[0], 0);
4691 arglist = build_tree_list (NULL_TREE, arg);
4696 /* If the format specifier was "string\n", call puts("string"). */
4697 size_t len = strlen (fmt_str);
4698 if (fmt_str[len - 1] == '\n')
4700 /* Create a NUL-terminated string that's one char shorter
4701 than the original, stripping off the trailing '\n'. */
4702 char *newstr = (char *) alloca (len);
4703 memcpy (newstr, fmt_str, len - 1);
4704 newstr[len - 1] = 0;
4706 arg = build_string_literal (len, newstr);
4707 arglist = build_tree_list (NULL_TREE, arg);
4711 /* We'd like to arrange to call fputs(string,stdout) here,
4712 but we need stdout and don't have a way to get it yet. */
4719 return expand_expr (build_function_call_expr (fn, arglist),
4720 target, mode, EXPAND_NORMAL);
4723 /* Expand a call to fprintf or fprintf_unlocked with argument list ARGLIST.
4724 Return 0 if a normal call should be emitted rather than transforming
4725 the function inline. If convenient, the result should be placed in
4726 TARGET with mode MODE. UNLOCKED indicates this is a fprintf_unlocked
4729 expand_builtin_fprintf (tree arglist, rtx target, enum machine_mode mode,
4732 tree fn_fputc = unlocked ? implicit_built_in_decls[BUILT_IN_FPUTC_UNLOCKED]
4733 : implicit_built_in_decls[BUILT_IN_FPUTC];
4734 tree fn_fputs = unlocked ? implicit_built_in_decls[BUILT_IN_FPUTS_UNLOCKED]
4735 : implicit_built_in_decls[BUILT_IN_FPUTS];
4736 const char *fmt_str;
4737 tree fn, fmt, fp, arg;
4739 /* If the return value is used, don't do the transformation. */
4740 if (target != const0_rtx)
4743 /* Verify the required arguments in the original call. */
4746 fp = TREE_VALUE (arglist);
4747 if (TREE_CODE (TREE_TYPE (fp)) != POINTER_TYPE)
4749 arglist = TREE_CHAIN (arglist);
4752 fmt = TREE_VALUE (arglist);
4753 if (TREE_CODE (TREE_TYPE (fmt)) != POINTER_TYPE)
4755 arglist = TREE_CHAIN (arglist);
4757 /* Check whether the format is a literal string constant. */
4758 fmt_str = c_getstr (fmt);
4759 if (fmt_str == NULL)
4762 /* If the format specifier was "%s", call __builtin_fputs(arg,fp). */
4763 if (strcmp (fmt_str, "%s") == 0)
4766 || TREE_CODE (TREE_TYPE (TREE_VALUE (arglist))) != POINTER_TYPE
4767 || TREE_CHAIN (arglist))
4769 arg = TREE_VALUE (arglist);
4770 arglist = build_tree_list (NULL_TREE, fp);
4771 arglist = tree_cons (NULL_TREE, arg, arglist);
4774 /* If the format specifier was "%c", call __builtin_fputc(arg,fp). */
4775 else if (strcmp (fmt_str, "%c") == 0)
4778 || TREE_CODE (TREE_TYPE (TREE_VALUE (arglist))) != INTEGER_TYPE
4779 || TREE_CHAIN (arglist))
4781 arg = TREE_VALUE (arglist);
4782 arglist = build_tree_list (NULL_TREE, fp);
4783 arglist = tree_cons (NULL_TREE, arg, arglist);
4788 /* We can't handle anything else with % args or %% ... yet. */
4789 if (strchr (fmt_str, '%'))
4795 /* If the format specifier was "", fprintf does nothing. */
4796 if (fmt_str[0] == '\0')
4798 /* Evaluate and ignore FILE* argument for side-effects. */
4799 expand_expr (fp, const0_rtx, VOIDmode, EXPAND_NORMAL);
4803 /* When "string" doesn't contain %, replace all cases of
4804 fprintf(stream,string) with fputs(string,stream). The fputs
4805 builtin will take care of special cases like length == 1. */
4806 arglist = build_tree_list (NULL_TREE, fp);
4807 arglist = tree_cons (NULL_TREE, fmt, arglist);
4813 return expand_expr (build_function_call_expr (fn, arglist),
4814 target, mode, EXPAND_NORMAL);
4817 /* Expand a call to sprintf with argument list ARGLIST. Return 0 if
4818 a normal call should be emitted rather than expanding the function
4819 inline. If convenient, the result should be placed in TARGET with
4823 expand_builtin_sprintf (tree arglist, rtx target, enum machine_mode mode)
4825 tree orig_arglist, dest, fmt;
4826 const char *fmt_str;
4828 orig_arglist = arglist;
4830 /* Verify the required arguments in the original call. */
4833 dest = TREE_VALUE (arglist);
4834 if (TREE_CODE (TREE_TYPE (dest)) != POINTER_TYPE)
4836 arglist = TREE_CHAIN (arglist);
4839 fmt = TREE_VALUE (arglist);
4840 if (TREE_CODE (TREE_TYPE (fmt)) != POINTER_TYPE)
4842 arglist = TREE_CHAIN (arglist);
4844 /* Check whether the format is a literal string constant. */
4845 fmt_str = c_getstr (fmt);
4846 if (fmt_str == NULL)
4849 /* If the format doesn't contain % args or %%, use strcpy. */
4850 if (strchr (fmt_str, '%') == 0)
4852 tree fn = implicit_built_in_decls[BUILT_IN_STRCPY];
4855 if (arglist || ! fn)
4857 expand_expr (build_function_call_expr (fn, orig_arglist),
4858 const0_rtx, VOIDmode, EXPAND_NORMAL);
4859 if (target == const0_rtx)
4861 exp = build_int_2 (strlen (fmt_str), 0);
4862 exp = fold (build1 (NOP_EXPR, integer_type_node, exp));
4863 return expand_expr (exp, target, mode, EXPAND_NORMAL);
4865 /* If the format is "%s", use strcpy if the result isn't used. */
4866 else if (strcmp (fmt_str, "%s") == 0)
4869 fn = implicit_built_in_decls[BUILT_IN_STRCPY];
4874 if (! arglist || TREE_CHAIN (arglist))
4876 arg = TREE_VALUE (arglist);
4877 if (TREE_CODE (TREE_TYPE (arg)) != POINTER_TYPE)
4880 if (target != const0_rtx)
4882 len = c_strlen (arg, 1);
4883 if (! len || TREE_CODE (len) != INTEGER_CST)
4889 arglist = build_tree_list (NULL_TREE, arg);
4890 arglist = tree_cons (NULL_TREE, dest, arglist);
4891 expand_expr (build_function_call_expr (fn, arglist),
4892 const0_rtx, VOIDmode, EXPAND_NORMAL);
4894 if (target == const0_rtx)
4896 return expand_expr (len, target, mode, EXPAND_NORMAL);
4902 /* Expand an expression EXP that calls a built-in function,
4903 with result going to TARGET if that's convenient
4904 (and in mode MODE if that's convenient).
4905 SUBTARGET may be used as the target for computing one of EXP's operands.
4906 IGNORE is nonzero if the value is to be ignored. */
4909 expand_builtin (tree exp, rtx target, rtx subtarget, enum machine_mode mode,
4912 tree fndecl = get_callee_fndecl (exp);
4913 tree arglist = TREE_OPERAND (exp, 1);
4914 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
4915 enum machine_mode target_mode = TYPE_MODE (TREE_TYPE (exp));
4917 /* Perform postincrements before expanding builtin functions. */
4920 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
4921 return (*targetm.expand_builtin) (exp, target, subtarget, mode, ignore);
4923 /* When not optimizing, generate calls to library functions for a certain
4926 && !CALLED_AS_BUILT_IN (fndecl)
4927 && DECL_ASSEMBLER_NAME_SET_P (fndecl)
4928 && fcode != BUILT_IN_ALLOCA)
4929 return expand_call (exp, target, ignore);
4931 /* The built-in function expanders test for target == const0_rtx
4932 to determine whether the function's result will be ignored. */
4934 target = const0_rtx;
4936 /* If the result of a pure or const built-in function is ignored, and
4937 none of its arguments are volatile, we can avoid expanding the
4938 built-in call and just evaluate the arguments for side-effects. */
4939 if (target == const0_rtx
4940 && (DECL_IS_PURE (fndecl) || TREE_READONLY (fndecl)))
4942 bool volatilep = false;
4945 for (arg = arglist; arg; arg = TREE_CHAIN (arg))
4946 if (TREE_THIS_VOLATILE (TREE_VALUE (arg)))
4954 for (arg = arglist; arg; arg = TREE_CHAIN (arg))
4955 expand_expr (TREE_VALUE (arg), const0_rtx,
4956 VOIDmode, EXPAND_NORMAL);
4965 case BUILT_IN_LLABS:
4966 case BUILT_IN_IMAXABS:
4967 /* build_function_call changes these into ABS_EXPR. */
4971 case BUILT_IN_FABSF:
4972 case BUILT_IN_FABSL:
4973 target = expand_builtin_fabs (arglist, target, subtarget);
4979 case BUILT_IN_CABSF:
4980 case BUILT_IN_CABSL:
4981 if (flag_unsafe_math_optimizations)
4983 target = expand_builtin_cabs (arglist, target);
4990 case BUILT_IN_CONJF:
4991 case BUILT_IN_CONJL:
4992 case BUILT_IN_CREAL:
4993 case BUILT_IN_CREALF:
4994 case BUILT_IN_CREALL:
4995 case BUILT_IN_CIMAG:
4996 case BUILT_IN_CIMAGF:
4997 case BUILT_IN_CIMAGL:
4998 /* expand_tree_builtin changes these into CONJ_EXPR, REALPART_EXPR
4999 and IMAGPART_EXPR. */
5018 case BUILT_IN_ATANF:
5019 case BUILT_IN_ATANL:
5020 /* Treat these like sqrt only if unsafe math optimizations are allowed,
5021 because of possible accuracy problems. */
5022 if (! flag_unsafe_math_optimizations)
5025 case BUILT_IN_SQRTF:
5026 case BUILT_IN_SQRTL:
5027 case BUILT_IN_FLOOR:
5028 case BUILT_IN_FLOORF:
5029 case BUILT_IN_FLOORL:
5031 case BUILT_IN_CEILF:
5032 case BUILT_IN_CEILL:
5033 case BUILT_IN_TRUNC:
5034 case BUILT_IN_TRUNCF:
5035 case BUILT_IN_TRUNCL:
5036 case BUILT_IN_ROUND:
5037 case BUILT_IN_ROUNDF:
5038 case BUILT_IN_ROUNDL:
5039 case BUILT_IN_NEARBYINT:
5040 case BUILT_IN_NEARBYINTF:
5041 case BUILT_IN_NEARBYINTL:
5042 target = expand_builtin_mathfn (exp, target, subtarget);
5050 if (! flag_unsafe_math_optimizations)
5052 target = expand_builtin_pow (exp, target, subtarget);
5057 case BUILT_IN_ATAN2:
5058 case BUILT_IN_ATAN2F:
5059 case BUILT_IN_ATAN2L:
5060 if (! flag_unsafe_math_optimizations)
5062 target = expand_builtin_mathfn_2 (exp, target, subtarget);
5067 case BUILT_IN_APPLY_ARGS:
5068 return expand_builtin_apply_args ();
5070 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
5071 FUNCTION with a copy of the parameters described by
5072 ARGUMENTS, and ARGSIZE. It returns a block of memory
5073 allocated on the stack into which is stored all the registers
5074 that might possibly be used for returning the result of a
5075 function. ARGUMENTS is the value returned by
5076 __builtin_apply_args. ARGSIZE is the number of bytes of
5077 arguments that must be copied. ??? How should this value be
5078 computed? We'll also need a safe worst case value for varargs
5080 case BUILT_IN_APPLY:
5081 if (!validate_arglist (arglist, POINTER_TYPE,
5082 POINTER_TYPE, INTEGER_TYPE, VOID_TYPE)
5083 && !validate_arglist (arglist, REFERENCE_TYPE,
5084 POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
5092 for (t = arglist, i = 0; t; t = TREE_CHAIN (t), i++)
5093 ops[i] = expand_expr (TREE_VALUE (t), NULL_RTX, VOIDmode, 0);
5095 return expand_builtin_apply (ops[0], ops[1], ops[2]);
5098 /* __builtin_return (RESULT) causes the function to return the
5099 value described by RESULT. RESULT is address of the block of
5100 memory returned by __builtin_apply. */
5101 case BUILT_IN_RETURN:
5102 if (validate_arglist (arglist, POINTER_TYPE, VOID_TYPE))
5103 expand_builtin_return (expand_expr (TREE_VALUE (arglist),
5104 NULL_RTX, VOIDmode, 0));
5107 case BUILT_IN_SAVEREGS:
5108 return expand_builtin_saveregs ();
5110 case BUILT_IN_ARGS_INFO:
5111 return expand_builtin_args_info (arglist);
5113 /* Return the address of the first anonymous stack arg. */
5114 case BUILT_IN_NEXT_ARG:
5115 return expand_builtin_next_arg (arglist);
5117 case BUILT_IN_CLASSIFY_TYPE:
5118 return expand_builtin_classify_type (arglist);
5120 case BUILT_IN_CONSTANT_P:
5121 return expand_builtin_constant_p (arglist, target_mode);
5123 case BUILT_IN_FRAME_ADDRESS:
5124 case BUILT_IN_RETURN_ADDRESS:
5125 return expand_builtin_frame_address (fndecl, arglist);
5127 /* Returns the address of the area where the structure is returned.
5129 case BUILT_IN_AGGREGATE_INCOMING_ADDRESS:
5131 || ! AGGREGATE_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl)))
5132 || GET_CODE (DECL_RTL (DECL_RESULT (current_function_decl))) != MEM)
5135 return XEXP (DECL_RTL (DECL_RESULT (current_function_decl)), 0);
5137 case BUILT_IN_ALLOCA:
5138 target = expand_builtin_alloca (arglist, target);
5145 case BUILT_IN_FFSLL:
5146 target = expand_builtin_unop (target_mode, arglist, target,
5147 subtarget, ffs_optab);
5154 case BUILT_IN_CLZLL:
5155 target = expand_builtin_unop (target_mode, arglist, target,
5156 subtarget, clz_optab);
5163 case BUILT_IN_CTZLL:
5164 target = expand_builtin_unop (target_mode, arglist, target,
5165 subtarget, ctz_optab);
5170 case BUILT_IN_POPCOUNT:
5171 case BUILT_IN_POPCOUNTL:
5172 case BUILT_IN_POPCOUNTLL:
5173 target = expand_builtin_unop (target_mode, arglist, target,
5174 subtarget, popcount_optab);
5179 case BUILT_IN_PARITY:
5180 case BUILT_IN_PARITYL:
5181 case BUILT_IN_PARITYLL:
5182 target = expand_builtin_unop (target_mode, arglist, target,
5183 subtarget, parity_optab);
5188 case BUILT_IN_STRLEN:
5189 target = expand_builtin_strlen (arglist, target, target_mode);
5194 case BUILT_IN_STRCPY:
5195 target = expand_builtin_strcpy (arglist, target, mode);
5200 case BUILT_IN_STRNCPY:
5201 target = expand_builtin_strncpy (arglist, target, mode);
5206 case BUILT_IN_STPCPY:
5207 target = expand_builtin_stpcpy (arglist, target, mode);
5212 case BUILT_IN_STRCAT:
5213 target = expand_builtin_strcat (arglist, target, mode);
5218 case BUILT_IN_STRNCAT:
5219 target = expand_builtin_strncat (arglist, target, mode);
5224 case BUILT_IN_STRSPN:
5225 target = expand_builtin_strspn (arglist, target, mode);
5230 case BUILT_IN_STRCSPN:
5231 target = expand_builtin_strcspn (arglist, target, mode);
5236 case BUILT_IN_STRSTR:
5237 target = expand_builtin_strstr (arglist, target, mode);
5242 case BUILT_IN_STRPBRK:
5243 target = expand_builtin_strpbrk (arglist, target, mode);
5248 case BUILT_IN_INDEX:
5249 case BUILT_IN_STRCHR:
5250 target = expand_builtin_strchr (arglist, target, mode);
5255 case BUILT_IN_RINDEX:
5256 case BUILT_IN_STRRCHR:
5257 target = expand_builtin_strrchr (arglist, target, mode);
5262 case BUILT_IN_MEMCPY:
5263 target = expand_builtin_memcpy (arglist, target, mode);
5268 case BUILT_IN_MEMPCPY:
5269 target = expand_builtin_mempcpy (arglist, target, mode, /*endp=*/ 1);
5274 case BUILT_IN_MEMMOVE:
5275 target = expand_builtin_memmove (arglist, target, mode);
5280 case BUILT_IN_BCOPY:
5281 target = expand_builtin_bcopy (arglist);
5286 case BUILT_IN_MEMSET:
5287 target = expand_builtin_memset (arglist, target, mode);
5292 case BUILT_IN_BZERO:
5293 target = expand_builtin_bzero (arglist);
5298 case BUILT_IN_STRCMP:
5299 target = expand_builtin_strcmp (exp, target, mode);
5304 case BUILT_IN_STRNCMP:
5305 target = expand_builtin_strncmp (exp, target, mode);
5311 case BUILT_IN_MEMCMP:
5312 target = expand_builtin_memcmp (exp, arglist, target, mode);
5317 case BUILT_IN_SETJMP:
5318 target = expand_builtin_setjmp (arglist, target);
5323 /* __builtin_longjmp is passed a pointer to an array of five words.
5324 It's similar to the C library longjmp function but works with
5325 __builtin_setjmp above. */
5326 case BUILT_IN_LONGJMP:
5327 if (!validate_arglist (arglist, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
5331 rtx buf_addr = expand_expr (TREE_VALUE (arglist), subtarget,
5333 rtx value = expand_expr (TREE_VALUE (TREE_CHAIN (arglist)),
5334 NULL_RTX, VOIDmode, 0);
5336 if (value != const1_rtx)
5338 error ("__builtin_longjmp second argument must be 1");
5342 expand_builtin_longjmp (buf_addr, value);
5347 expand_builtin_trap ();
5350 case BUILT_IN_PRINTF:
5351 target = expand_builtin_printf (arglist, target, mode, false);
5356 case BUILT_IN_PRINTF_UNLOCKED:
5357 target = expand_builtin_printf (arglist, target, mode, true);
5362 case BUILT_IN_FPUTS:
5363 target = expand_builtin_fputs (arglist, target, false);
5368 case BUILT_IN_FPUTS_UNLOCKED:
5369 target = expand_builtin_fputs (arglist, target, true);
5374 case BUILT_IN_FPRINTF:
5375 target = expand_builtin_fprintf (arglist, target, mode, false);
5380 case BUILT_IN_FPRINTF_UNLOCKED:
5381 target = expand_builtin_fprintf (arglist, target, mode, true);
5386 case BUILT_IN_SPRINTF:
5387 target = expand_builtin_sprintf (arglist, target, mode);
5392 /* Various hooks for the DWARF 2 __throw routine. */
5393 case BUILT_IN_UNWIND_INIT:
5394 expand_builtin_unwind_init ();
5396 case BUILT_IN_DWARF_CFA:
5397 return virtual_cfa_rtx;
5398 #ifdef DWARF2_UNWIND_INFO
5399 case BUILT_IN_DWARF_SP_COLUMN:
5400 return expand_builtin_dwarf_sp_column ();
5401 case BUILT_IN_INIT_DWARF_REG_SIZES:
5402 expand_builtin_init_dwarf_reg_sizes (TREE_VALUE (arglist));
5405 case BUILT_IN_FROB_RETURN_ADDR:
5406 return expand_builtin_frob_return_addr (TREE_VALUE (arglist));
5407 case BUILT_IN_EXTRACT_RETURN_ADDR:
5408 return expand_builtin_extract_return_addr (TREE_VALUE (arglist));
5409 case BUILT_IN_EH_RETURN:
5410 expand_builtin_eh_return (TREE_VALUE (arglist),
5411 TREE_VALUE (TREE_CHAIN (arglist)));
5413 #ifdef EH_RETURN_DATA_REGNO
5414 case BUILT_IN_EH_RETURN_DATA_REGNO:
5415 return expand_builtin_eh_return_data_regno (arglist);
5417 case BUILT_IN_VA_START:
5418 case BUILT_IN_STDARG_START:
5419 return expand_builtin_va_start (arglist);
5420 case BUILT_IN_VA_END:
5421 return expand_builtin_va_end (arglist);
5422 case BUILT_IN_VA_COPY:
5423 return expand_builtin_va_copy (arglist);
5424 case BUILT_IN_EXPECT:
5425 return expand_builtin_expect (arglist, target);
5426 case BUILT_IN_PREFETCH:
5427 expand_builtin_prefetch (arglist);
5431 default: /* just do library call, if unknown builtin */
5432 if (!DECL_ASSEMBLER_NAME_SET_P (fndecl))
5433 error ("built-in function `%s' not currently supported",
5434 IDENTIFIER_POINTER (DECL_NAME (fndecl)));
5437 /* The switch statement above can drop through to cause the function
5438 to be called normally. */
5439 return expand_call (exp, target, ignore);
5442 /* Determine whether a tree node represents a call to a built-in
5443 function. If the tree T is a call to a built-in function with
5444 the right number of arguments of the appropriate types, return
5445 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
5446 Otherwise the return value is END_BUILTINS. */
5448 enum built_in_function
5449 builtin_mathfn_code (tree t)
5451 tree fndecl, arglist, parmlist;
5452 tree argtype, parmtype;
5454 if (TREE_CODE (t) != CALL_EXPR
5455 || TREE_CODE (TREE_OPERAND (t, 0)) != ADDR_EXPR)
5456 return END_BUILTINS;
5458 fndecl = get_callee_fndecl (t);
5459 if (fndecl == NULL_TREE
5460 || TREE_CODE (fndecl) != FUNCTION_DECL
5461 || ! DECL_BUILT_IN (fndecl)
5462 || DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
5463 return END_BUILTINS;
5465 arglist = TREE_OPERAND (t, 1);
5466 parmlist = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
5467 for (; parmlist; parmlist = TREE_CHAIN (parmlist))
5469 /* If a function doesn't take a variable number of arguments,
5470 the last element in the list will have type `void'. */
5471 parmtype = TREE_VALUE (parmlist);
5472 if (VOID_TYPE_P (parmtype))
5475 return END_BUILTINS;
5476 return DECL_FUNCTION_CODE (fndecl);
5480 return END_BUILTINS;
5482 argtype = TREE_TYPE (TREE_VALUE (arglist));
5484 if (SCALAR_FLOAT_TYPE_P (parmtype))
5486 if (! SCALAR_FLOAT_TYPE_P (argtype))
5487 return END_BUILTINS;
5489 else if (COMPLEX_FLOAT_TYPE_P (parmtype))
5491 if (! COMPLEX_FLOAT_TYPE_P (argtype))
5492 return END_BUILTINS;
5494 else if (POINTER_TYPE_P (parmtype))
5496 if (! POINTER_TYPE_P (argtype))
5497 return END_BUILTINS;
5499 else if (INTEGRAL_TYPE_P (parmtype))
5501 if (! INTEGRAL_TYPE_P (argtype))
5502 return END_BUILTINS;
5505 return END_BUILTINS;
5507 arglist = TREE_CHAIN (arglist);
5510 /* Variable-length argument list. */
5511 return DECL_FUNCTION_CODE (fndecl);
5514 /* Fold a call to __builtin_constant_p, if we know it will evaluate to a
5515 constant. ARGLIST is the argument list of the call. */
5518 fold_builtin_constant_p (tree arglist)
5523 arglist = TREE_VALUE (arglist);
5525 /* We return 1 for a numeric type that's known to be a constant
5526 value at compile-time or for an aggregate type that's a
5527 literal constant. */
5528 STRIP_NOPS (arglist);
5530 /* If we know this is a constant, emit the constant of one. */
5531 if (TREE_CODE_CLASS (TREE_CODE (arglist)) == 'c'
5532 || (TREE_CODE (arglist) == CONSTRUCTOR
5533 && TREE_CONSTANT (arglist))
5534 || (TREE_CODE (arglist) == ADDR_EXPR
5535 && TREE_CODE (TREE_OPERAND (arglist, 0)) == STRING_CST))
5536 return integer_one_node;
5538 /* If this expression has side effects, show we don't know it to be a
5539 constant. Likewise if it's a pointer or aggregate type since in
5540 those case we only want literals, since those are only optimized
5541 when generating RTL, not later.
5542 And finally, if we are compiling an initializer, not code, we
5543 need to return a definite result now; there's not going to be any
5544 more optimization done. */
5545 if (TREE_SIDE_EFFECTS (arglist)
5546 || AGGREGATE_TYPE_P (TREE_TYPE (arglist))
5547 || POINTER_TYPE_P (TREE_TYPE (arglist))
5549 return integer_zero_node;
5554 /* Fold a call to __builtin_classify_type. */
5557 fold_builtin_classify_type (tree arglist)
5560 return build_int_2 (no_type_class, 0);
5562 return build_int_2 (type_to_class (TREE_TYPE (TREE_VALUE (arglist))), 0);
5565 /* Fold a call to __builtin_inf or __builtin_huge_val. */
5568 fold_builtin_inf (tree type, int warn)
5570 REAL_VALUE_TYPE real;
5572 if (!MODE_HAS_INFINITIES (TYPE_MODE (type)) && warn)
5573 warning ("target format does not support infinity");
5576 return build_real (type, real);
5579 /* Fold a call to __builtin_nan or __builtin_nans. */
5582 fold_builtin_nan (tree arglist, tree type, int quiet)
5584 REAL_VALUE_TYPE real;
5587 if (!validate_arglist (arglist, POINTER_TYPE, VOID_TYPE))
5589 str = c_getstr (TREE_VALUE (arglist));
5593 if (!real_nan (&real, str, quiet, TYPE_MODE (type)))
5596 return build_real (type, real);
5599 /* Return true if the floating point expression T has an integer value.
5600 We also allow +Inf, -Inf and NaN to be considered integer values. */
5603 integer_valued_real_p (tree t)
5605 switch (TREE_CODE (t))
5612 case NON_LVALUE_EXPR:
5613 return integer_valued_real_p (TREE_OPERAND (t, 0));
5618 return integer_valued_real_p (TREE_OPERAND (t, 1));
5625 return integer_valued_real_p (TREE_OPERAND (t, 0))
5626 && integer_valued_real_p (TREE_OPERAND (t, 1));
5629 return integer_valued_real_p (TREE_OPERAND (t, 1))
5630 && integer_valued_real_p (TREE_OPERAND (t, 2));
5633 if (! TREE_CONSTANT_OVERFLOW (t))
5635 REAL_VALUE_TYPE c, cint;
5637 c = TREE_REAL_CST (t);
5638 real_trunc (&cint, TYPE_MODE (TREE_TYPE (t)), &c);
5639 return real_identical (&c, &cint);
5644 tree type = TREE_TYPE (TREE_OPERAND (t, 0));
5645 if (TREE_CODE (type) == INTEGER_TYPE)
5647 if (TREE_CODE (type) == REAL_TYPE)
5648 return integer_valued_real_p (TREE_OPERAND (t, 0));
5653 switch (builtin_mathfn_code (t))
5656 case BUILT_IN_CEILF:
5657 case BUILT_IN_CEILL:
5658 case BUILT_IN_FLOOR:
5659 case BUILT_IN_FLOORF:
5660 case BUILT_IN_FLOORL:
5661 case BUILT_IN_NEARBYINT:
5662 case BUILT_IN_NEARBYINTF:
5663 case BUILT_IN_NEARBYINTL:
5664 case BUILT_IN_ROUND:
5665 case BUILT_IN_ROUNDF:
5666 case BUILT_IN_ROUNDL:
5667 case BUILT_IN_TRUNC:
5668 case BUILT_IN_TRUNCF:
5669 case BUILT_IN_TRUNCL:
5683 /* EXP is assumed to be builtin call where truncation can be propagated
5684 across (for instance floor((double)f) == (double)floorf (f).
5685 Do the transformation. */
5688 fold_trunc_transparent_mathfn (tree exp)
5690 tree fndecl = get_callee_fndecl (exp);
5691 tree arglist = TREE_OPERAND (exp, 1);
5692 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
5695 if (! validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
5698 arg = TREE_VALUE (arglist);
5699 /* Integer rounding functions are idempotent. */
5700 if (fcode == builtin_mathfn_code (arg))
5703 /* If argument is already integer valued, and we don't need to worry
5704 about setting errno, there's no need to perform rounding. */
5705 if (! flag_errno_math && integer_valued_real_p (arg))
5710 tree arg0 = strip_float_extensions (arg);
5711 tree ftype = TREE_TYPE (exp);
5712 tree newtype = TREE_TYPE (arg0);
5715 if (TYPE_PRECISION (newtype) < TYPE_PRECISION (ftype)
5716 && (decl = mathfn_built_in (newtype, fcode)))
5719 build_tree_list (NULL_TREE, fold (convert (newtype, arg0)));
5720 return convert (ftype,
5721 build_function_call_expr (decl, arglist));
5727 /* Fold function call to builtin cabs, cabsf or cabsl. FNDECL is the
5728 function's DECL, ARGLIST is the argument list and TYPE is the return
5729 type. Return NULL_TREE if no simplification can be made. */
5732 fold_builtin_cabs (tree fndecl, tree arglist, tree type)
5736 if (!arglist || TREE_CHAIN (arglist))
5739 arg = TREE_VALUE (arglist);
5740 if (TREE_CODE (TREE_TYPE (arg)) != COMPLEX_TYPE
5741 || TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) != REAL_TYPE)
5744 /* Evaluate cabs of a constant at compile-time. */
5745 if (flag_unsafe_math_optimizations
5746 && TREE_CODE (arg) == COMPLEX_CST
5747 && TREE_CODE (TREE_REALPART (arg)) == REAL_CST
5748 && TREE_CODE (TREE_IMAGPART (arg)) == REAL_CST
5749 && ! TREE_CONSTANT_OVERFLOW (TREE_REALPART (arg))
5750 && ! TREE_CONSTANT_OVERFLOW (TREE_IMAGPART (arg)))
5752 REAL_VALUE_TYPE r, i;
5754 r = TREE_REAL_CST (TREE_REALPART (arg));
5755 i = TREE_REAL_CST (TREE_IMAGPART (arg));
5757 real_arithmetic (&r, MULT_EXPR, &r, &r);
5758 real_arithmetic (&i, MULT_EXPR, &i, &i);
5759 real_arithmetic (&r, PLUS_EXPR, &r, &i);
5760 if (real_sqrt (&r, TYPE_MODE (type), &r)
5761 || ! flag_trapping_math)
5762 return build_real (type, r);
5765 /* If either part is zero, cabs is fabs of the other. */
5766 if (TREE_CODE (arg) == COMPLEX_EXPR
5767 && real_zerop (TREE_OPERAND (arg, 0)))
5768 return fold (build1 (ABS_EXPR, type, TREE_OPERAND (arg, 1)));
5769 if (TREE_CODE (arg) == COMPLEX_EXPR
5770 && real_zerop (TREE_OPERAND (arg, 1)))
5771 return fold (build1 (ABS_EXPR, type, TREE_OPERAND (arg, 0)));
5773 if (flag_unsafe_math_optimizations)
5775 enum built_in_function fcode;
5778 fcode = DECL_FUNCTION_CODE (fndecl);
5779 if (fcode == BUILT_IN_CABS)
5780 sqrtfn = implicit_built_in_decls[BUILT_IN_SQRT];
5781 else if (fcode == BUILT_IN_CABSF)
5782 sqrtfn = implicit_built_in_decls[BUILT_IN_SQRTF];
5783 else if (fcode == BUILT_IN_CABSL)
5784 sqrtfn = implicit_built_in_decls[BUILT_IN_SQRTL];
5788 if (sqrtfn != NULL_TREE)
5790 tree rpart, ipart, result, arglist;
5792 arg = save_expr (arg);
5794 rpart = fold (build1 (REALPART_EXPR, type, arg));
5795 ipart = fold (build1 (IMAGPART_EXPR, type, arg));
5797 rpart = save_expr (rpart);
5798 ipart = save_expr (ipart);
5800 result = fold (build (PLUS_EXPR, type,
5801 fold (build (MULT_EXPR, type,
5803 fold (build (MULT_EXPR, type,
5806 arglist = build_tree_list (NULL_TREE, result);
5807 return build_function_call_expr (sqrtfn, arglist);
5814 /* Fold function call to builtin trunc, truncf or truncl. Return
5815 NULL_TREE if no simplification can be made. */
5818 fold_builtin_trunc (tree exp)
5820 tree arglist = TREE_OPERAND (exp, 1);
5823 if (! validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
5826 /* Optimize trunc of constant value. */
5827 arg = TREE_VALUE (arglist);
5828 if (TREE_CODE (arg) == REAL_CST && ! TREE_CONSTANT_OVERFLOW (arg))
5830 REAL_VALUE_TYPE r, x;
5831 tree type = TREE_TYPE (exp);
5833 x = TREE_REAL_CST (arg);
5834 real_trunc (&r, TYPE_MODE (type), &x);
5835 return build_real (type, r);
5838 return fold_trunc_transparent_mathfn (exp);
5841 /* Fold function call to builtin floor, floorf or floorl. Return
5842 NULL_TREE if no simplification can be made. */
5845 fold_builtin_floor (tree exp)
5847 tree arglist = TREE_OPERAND (exp, 1);
5850 if (! validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
5853 /* Optimize floor of constant value. */
5854 arg = TREE_VALUE (arglist);
5855 if (TREE_CODE (arg) == REAL_CST && ! TREE_CONSTANT_OVERFLOW (arg))
5859 x = TREE_REAL_CST (arg);
5860 if (! REAL_VALUE_ISNAN (x) || ! flag_errno_math)
5862 tree type = TREE_TYPE (exp);
5865 real_floor (&r, TYPE_MODE (type), &x);
5866 return build_real (type, r);
5870 return fold_trunc_transparent_mathfn (exp);
5873 /* Fold function call to builtin ceil, ceilf or ceill. Return
5874 NULL_TREE if no simplification can be made. */
5877 fold_builtin_ceil (tree exp)
5879 tree arglist = TREE_OPERAND (exp, 1);
5882 if (! validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
5885 /* Optimize ceil of constant value. */
5886 arg = TREE_VALUE (arglist);
5887 if (TREE_CODE (arg) == REAL_CST && ! TREE_CONSTANT_OVERFLOW (arg))
5891 x = TREE_REAL_CST (arg);
5892 if (! REAL_VALUE_ISNAN (x) || ! flag_errno_math)
5894 tree type = TREE_TYPE (exp);
5897 real_ceil (&r, TYPE_MODE (type), &x);
5898 return build_real (type, r);
5902 return fold_trunc_transparent_mathfn (exp);
5905 /* Fold function call to builtin ffs, clz, ctz, popcount and parity
5906 and their long and long long variants (i.e. ffsl and ffsll).
5907 Return NULL_TREE if no simplification can be made. */
5910 fold_builtin_bitop (tree exp)
5912 tree fndecl = get_callee_fndecl (exp);
5913 tree arglist = TREE_OPERAND (exp, 1);
5916 if (! validate_arglist (arglist, INTEGER_TYPE, VOID_TYPE))
5919 /* Optimize for constant argument. */
5920 arg = TREE_VALUE (arglist);
5921 if (TREE_CODE (arg) == INTEGER_CST && ! TREE_CONSTANT_OVERFLOW (arg))
5923 HOST_WIDE_INT hi, width, result;
5924 unsigned HOST_WIDE_INT lo;
5927 type = TREE_TYPE (arg);
5928 width = TYPE_PRECISION (type);
5929 lo = TREE_INT_CST_LOW (arg);
5931 /* Clear all the bits that are beyond the type's precision. */
5932 if (width > HOST_BITS_PER_WIDE_INT)
5934 hi = TREE_INT_CST_HIGH (arg);
5935 if (width < 2 * HOST_BITS_PER_WIDE_INT)
5936 hi &= ~((HOST_WIDE_INT) (-1) >> (width - HOST_BITS_PER_WIDE_INT));
5941 if (width < HOST_BITS_PER_WIDE_INT)
5942 lo &= ~((unsigned HOST_WIDE_INT) (-1) << width);
5945 switch (DECL_FUNCTION_CODE (fndecl))
5949 case BUILT_IN_FFSLL:
5951 result = exact_log2 (lo & -lo) + 1;
5953 result = HOST_BITS_PER_WIDE_INT + exact_log2 (hi & -hi) + 1;
5960 case BUILT_IN_CLZLL:
5962 result = width - floor_log2 (hi) - 1 - HOST_BITS_PER_WIDE_INT;
5964 result = width - floor_log2 (lo) - 1;
5965 else if (! CLZ_DEFINED_VALUE_AT_ZERO (TYPE_MODE (type), result))
5971 case BUILT_IN_CTZLL:
5973 result = exact_log2 (lo & -lo);
5975 result = HOST_BITS_PER_WIDE_INT + exact_log2 (hi & -hi);
5976 else if (! CTZ_DEFINED_VALUE_AT_ZERO (TYPE_MODE (type), result))
5980 case BUILT_IN_POPCOUNT:
5981 case BUILT_IN_POPCOUNTL:
5982 case BUILT_IN_POPCOUNTLL:
5985 result++, lo &= lo - 1;
5987 result++, hi &= hi - 1;
5990 case BUILT_IN_PARITY:
5991 case BUILT_IN_PARITYL:
5992 case BUILT_IN_PARITYLL:
5995 result++, lo &= lo - 1;
5997 result++, hi &= hi - 1;
6005 t = build_int_2 (result, 0);
6006 TREE_TYPE (t) = TREE_TYPE (exp);
6013 /* Return true if EXPR is the real constant contained in VALUE. */
6016 real_dconstp (tree expr, const REAL_VALUE_TYPE *value)
6020 return ((TREE_CODE (expr) == REAL_CST
6021 && ! TREE_CONSTANT_OVERFLOW (expr)
6022 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), *value))
6023 || (TREE_CODE (expr) == COMPLEX_CST
6024 && real_dconstp (TREE_REALPART (expr), value)
6025 && real_zerop (TREE_IMAGPART (expr))));
6028 /* A subroutine of fold_builtin to fold the various logarithmic
6029 functions. EXP is the CALL_EXPR of a call to a builtin log*
6030 function. VALUE is the base of the log* function. */
6033 fold_builtin_logarithm (tree exp, const REAL_VALUE_TYPE *value)
6035 tree arglist = TREE_OPERAND (exp, 1);
6037 if (validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
6039 tree fndecl = get_callee_fndecl (exp);
6040 tree type = TREE_TYPE (TREE_TYPE (fndecl));
6041 tree arg = TREE_VALUE (arglist);
6042 const enum built_in_function fcode = builtin_mathfn_code (arg);
6044 /* Optimize log*(1.0) = 0.0. */
6045 if (real_onep (arg))
6046 return build_real (type, dconst0);
6048 /* Optimize logN(N) = 1.0. If N can't be truncated to MODE
6049 exactly, then only do this if flag_unsafe_math_optimizations. */
6050 if (exact_real_truncate (TYPE_MODE (type), value)
6051 || flag_unsafe_math_optimizations)
6053 const REAL_VALUE_TYPE value_truncate =
6054 real_value_truncate (TYPE_MODE (type), *value);
6055 if (real_dconstp (arg, &value_truncate))
6056 return build_real (type, dconst1);
6059 /* Special case, optimize logN(expN(x)) = x. */
6060 if (flag_unsafe_math_optimizations
6061 && ((value == &dconste
6062 && (fcode == BUILT_IN_EXP
6063 || fcode == BUILT_IN_EXPF
6064 || fcode == BUILT_IN_EXPL))
6065 || (value == &dconst2
6066 && (fcode == BUILT_IN_EXP2
6067 || fcode == BUILT_IN_EXP2F
6068 || fcode == BUILT_IN_EXP2L))
6069 || (value == &dconst10
6070 && (fcode == BUILT_IN_EXP10
6071 || fcode == BUILT_IN_EXP10F
6072 || fcode == BUILT_IN_EXP10L))))
6073 return convert (type, TREE_VALUE (TREE_OPERAND (arg, 1)));
6075 /* Optimize log*(func()) for various exponential functions. We
6076 want to determine the value "x" and the power "exponent" in
6077 order to transform logN(x**exponent) into exponent*logN(x). */
6078 if (flag_unsafe_math_optimizations)
6080 tree exponent = 0, x = 0;
6087 /* Prepare to do logN(exp(exponent) -> exponent*logN(e). */
6088 x = build_real (type,
6089 real_value_truncate (TYPE_MODE (type), dconste));
6090 exponent = TREE_VALUE (TREE_OPERAND (arg, 1));
6093 case BUILT_IN_EXP2F:
6094 case BUILT_IN_EXP2L:
6095 /* Prepare to do logN(exp2(exponent) -> exponent*logN(2). */
6096 x = build_real (type, dconst2);
6097 exponent = TREE_VALUE (TREE_OPERAND (arg, 1));
6099 case BUILT_IN_EXP10:
6100 case BUILT_IN_EXP10F:
6101 case BUILT_IN_EXP10L:
6102 case BUILT_IN_POW10:
6103 case BUILT_IN_POW10F:
6104 case BUILT_IN_POW10L:
6105 /* Prepare to do logN(exp10(exponent) -> exponent*logN(10). */
6106 x = build_real (type, dconst10);
6107 exponent = TREE_VALUE (TREE_OPERAND (arg, 1));
6110 case BUILT_IN_SQRTF:
6111 case BUILT_IN_SQRTL:
6112 /* Prepare to do logN(sqrt(x) -> 0.5*logN(x). */
6113 x = TREE_VALUE (TREE_OPERAND (arg, 1));
6114 exponent = build_real (type, dconsthalf);
6117 case BUILT_IN_CBRTF:
6118 case BUILT_IN_CBRTL:
6119 /* Prepare to do logN(cbrt(x) -> (1/3)*logN(x). */
6120 x = TREE_VALUE (TREE_OPERAND (arg, 1));
6121 exponent = build_real (type, real_value_truncate (TYPE_MODE (type),
6127 /* Prepare to do logN(pow(x,exponent) -> exponent*logN(x). */
6128 x = TREE_VALUE (TREE_OPERAND (arg, 1));
6129 exponent = TREE_VALUE (TREE_CHAIN (TREE_OPERAND (arg, 1)));
6135 /* Now perform the optimization. */
6139 arglist = build_tree_list (NULL_TREE, x);
6140 logfn = build_function_call_expr (fndecl, arglist);
6141 return fold (build (MULT_EXPR, type, exponent, logfn));
6149 /* A subroutine of fold_builtin to fold the various exponent
6150 functions. EXP is the CALL_EXPR of a call to a builtin function.
6151 VALUE is the value which will be raised to a power. */
6154 fold_builtin_exponent (tree exp, const REAL_VALUE_TYPE *value)
6156 tree arglist = TREE_OPERAND (exp, 1);
6158 if (validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
6160 tree fndecl = get_callee_fndecl (exp);
6161 tree type = TREE_TYPE (TREE_TYPE (fndecl));
6162 tree arg = TREE_VALUE (arglist);
6164 /* Optimize exp*(0.0) = 1.0. */
6165 if (real_zerop (arg))
6166 return build_real (type, dconst1);
6168 /* Optimize expN(1.0) = N. */
6169 if (real_onep (arg))
6171 REAL_VALUE_TYPE cst;
6173 real_convert (&cst, TYPE_MODE (type), value);
6174 return build_real (type, cst);
6177 /* Attempt to evaluate expN(integer) at compile-time. */
6178 if (flag_unsafe_math_optimizations
6179 && TREE_CODE (arg) == REAL_CST
6180 && ! TREE_CONSTANT_OVERFLOW (arg))
6182 REAL_VALUE_TYPE cint;
6186 c = TREE_REAL_CST (arg);
6187 n = real_to_integer (&c);
6188 real_from_integer (&cint, VOIDmode, n,
6190 if (real_identical (&c, &cint))
6194 real_powi (&x, TYPE_MODE (type), value, n);
6195 return build_real (type, x);
6199 /* Optimize expN(logN(x)) = x. */
6200 if (flag_unsafe_math_optimizations)
6202 const enum built_in_function fcode = builtin_mathfn_code (arg);
6204 if ((value == &dconste
6205 && (fcode == BUILT_IN_LOG
6206 || fcode == BUILT_IN_LOGF
6207 || fcode == BUILT_IN_LOGL))
6208 || (value == &dconst2
6209 && (fcode == BUILT_IN_LOG2
6210 || fcode == BUILT_IN_LOG2F
6211 || fcode == BUILT_IN_LOG2L))
6212 || (value == &dconst10
6213 && (fcode == BUILT_IN_LOG10
6214 || fcode == BUILT_IN_LOG10F
6215 || fcode == BUILT_IN_LOG10L)))
6216 return convert (type, TREE_VALUE (TREE_OPERAND (arg, 1)));
6223 /* Fold function call to builtin memcpy. Return
6224 NULL_TREE if no simplification can be made. */
6227 fold_builtin_memcpy (tree exp)
6229 tree arglist = TREE_OPERAND (exp, 1);
6230 tree dest, src, len;
6232 if (!validate_arglist (arglist,
6233 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
6236 dest = TREE_VALUE (arglist);
6237 src = TREE_VALUE (TREE_CHAIN (arglist));
6238 len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
6240 /* If the LEN parameter is zero, return DEST. */
6241 if (integer_zerop (len))
6242 return omit_one_operand (TREE_TYPE (exp), dest, src);
6244 /* If SRC and DEST are the same (and not volatile), return DEST. */
6245 if (operand_equal_p (src, dest, 0))
6246 return omit_one_operand (TREE_TYPE (exp), dest, len);
6251 /* Fold function call to builtin mempcpy. Return
6252 NULL_TREE if no simplification can be made. */
6255 fold_builtin_mempcpy (tree exp)
6257 tree arglist = TREE_OPERAND (exp, 1);
6258 tree dest, src, len;
6260 if (!validate_arglist (arglist,
6261 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
6264 dest = TREE_VALUE (arglist);
6265 src = TREE_VALUE (TREE_CHAIN (arglist));
6266 len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
6268 /* If the LEN parameter is zero, return DEST. */
6269 if (integer_zerop (len))
6270 return omit_one_operand (TREE_TYPE (exp), dest, src);
6272 /* If SRC and DEST are the same (and not volatile), return DEST+LEN. */
6273 if (operand_equal_p (src, dest, 0))
6275 tree temp = convert (TREE_TYPE (dest), len);
6276 temp = fold (build (PLUS_EXPR, TREE_TYPE (dest), dest, len));
6277 return convert (TREE_TYPE (exp), temp);
6283 /* Fold function call to builtin memmove. Return
6284 NULL_TREE if no simplification can be made. */
6287 fold_builtin_memmove (tree exp)
6289 tree arglist = TREE_OPERAND (exp, 1);
6290 tree dest, src, len;
6292 if (!validate_arglist (arglist,
6293 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
6296 dest = TREE_VALUE (arglist);
6297 src = TREE_VALUE (TREE_CHAIN (arglist));
6298 len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
6300 /* If the LEN parameter is zero, return DEST. */
6301 if (integer_zerop (len))
6302 return omit_one_operand (TREE_TYPE (exp), dest, src);
6304 /* If SRC and DEST are the same (and not volatile), return DEST. */
6305 if (operand_equal_p (src, dest, 0))
6306 return omit_one_operand (TREE_TYPE (exp), dest, len);
6311 /* Fold function call to builtin strcpy. Return
6312 NULL_TREE if no simplification can be made. */
6315 fold_builtin_strcpy (tree exp)
6317 tree arglist = TREE_OPERAND (exp, 1);
6320 if (!validate_arglist (arglist,
6321 POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
6324 dest = TREE_VALUE (arglist);
6325 src = TREE_VALUE (TREE_CHAIN (arglist));
6327 /* If SRC and DEST are the same (and not volatile), return DEST. */
6328 if (operand_equal_p (src, dest, 0))
6329 return convert (TREE_TYPE (exp), dest);
6334 /* Fold function call to builtin strncpy. Return
6335 NULL_TREE if no simplification can be made. */
6338 fold_builtin_strncpy (tree exp)
6340 tree arglist = TREE_OPERAND (exp, 1);
6341 tree dest, src, len;
6343 if (!validate_arglist (arglist,
6344 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
6347 dest = TREE_VALUE (arglist);
6348 src = TREE_VALUE (TREE_CHAIN (arglist));
6349 len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
6351 /* If the LEN parameter is zero, return DEST. */
6352 if (integer_zerop (len))
6353 return omit_one_operand (TREE_TYPE (exp), dest, src);
6358 /* Fold function call to builtin memcmp. Return
6359 NULL_TREE if no simplification can be made. */
6362 fold_builtin_memcmp (tree exp)
6364 tree arglist = TREE_OPERAND (exp, 1);
6365 tree arg1, arg2, len;
6367 if (!validate_arglist (arglist,
6368 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
6371 arg1 = TREE_VALUE (arglist);
6372 arg2 = TREE_VALUE (TREE_CHAIN (arglist));
6373 len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
6375 /* If the LEN parameter is zero, return zero. */
6376 if (integer_zerop (len))
6378 tree temp = omit_one_operand (TREE_TYPE (exp), integer_zero_node, arg2);
6379 return omit_one_operand (TREE_TYPE (exp), temp, arg1);
6382 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
6383 if (operand_equal_p (arg1, arg2, 0))
6384 return omit_one_operand (TREE_TYPE (exp), integer_zero_node, len);
6389 /* Fold function call to builtin strcmp. Return
6390 NULL_TREE if no simplification can be made. */
6393 fold_builtin_strcmp (tree exp)
6395 tree arglist = TREE_OPERAND (exp, 1);
6397 const char *p1, *p2;
6399 if (!validate_arglist (arglist,
6400 POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
6403 arg1 = TREE_VALUE (arglist);
6404 arg2 = TREE_VALUE (TREE_CHAIN (arglist));
6406 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
6407 if (operand_equal_p (arg1, arg2, 0))
6408 return convert (TREE_TYPE (exp), integer_zero_node);
6410 p1 = c_getstr (arg1);
6411 p2 = c_getstr (arg2);
6416 const int i = strcmp (p1, p2);
6418 temp = integer_minus_one_node;
6420 temp = integer_one_node;
6422 temp = integer_zero_node;
6423 return convert (TREE_TYPE (exp), temp);
6429 /* Fold function call to builtin strncmp. Return
6430 NULL_TREE if no simplification can be made. */
6433 fold_builtin_strncmp (tree exp)
6435 tree arglist = TREE_OPERAND (exp, 1);
6436 tree arg1, arg2, len;
6437 const char *p1, *p2;
6439 if (!validate_arglist (arglist,
6440 POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
6443 arg1 = TREE_VALUE (arglist);
6444 arg2 = TREE_VALUE (TREE_CHAIN (arglist));
6445 len = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist)));
6447 /* If the LEN parameter is zero, return zero. */
6448 if (integer_zerop (len))
6450 tree temp = omit_one_operand (TREE_TYPE (exp), integer_zero_node, arg2);
6451 return omit_one_operand (TREE_TYPE (exp), temp, arg1);
6454 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
6455 if (operand_equal_p (arg1, arg2, 0))
6456 return omit_one_operand (TREE_TYPE (exp), integer_zero_node, len);
6458 p1 = c_getstr (arg1);
6459 p2 = c_getstr (arg2);
6461 if (host_integerp (len, 1) && p1 && p2)
6464 const int i = strncmp (p1, p2, tree_low_cst (len, 1));
6466 temp = integer_minus_one_node;
6468 temp = integer_one_node;
6470 temp = integer_zero_node;
6471 return convert (TREE_TYPE (exp), temp);
6477 /* Used by constant folding to eliminate some builtin calls early. EXP is
6478 the CALL_EXPR of a call to a builtin function. */
6481 fold_builtin (tree exp)
6483 tree fndecl = get_callee_fndecl (exp);
6484 tree arglist = TREE_OPERAND (exp, 1);
6485 tree type = TREE_TYPE (TREE_TYPE (fndecl));
6487 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
6490 switch (DECL_FUNCTION_CODE (fndecl))
6492 case BUILT_IN_CONSTANT_P:
6493 return fold_builtin_constant_p (arglist);
6495 case BUILT_IN_CLASSIFY_TYPE:
6496 return fold_builtin_classify_type (arglist);
6498 case BUILT_IN_STRLEN:
6499 if (validate_arglist (arglist, POINTER_TYPE, VOID_TYPE))
6501 tree len = c_strlen (TREE_VALUE (arglist), 0);
6504 /* Convert from the internal "sizetype" type to "size_t". */
6506 len = convert (size_type_node, len);
6513 case BUILT_IN_FABSF:
6514 case BUILT_IN_FABSL:
6515 if (validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
6516 return fold (build1 (ABS_EXPR, type, TREE_VALUE (arglist)));
6520 case BUILT_IN_CABSF:
6521 case BUILT_IN_CABSL:
6522 return fold_builtin_cabs (fndecl, arglist, type);
6525 case BUILT_IN_SQRTF:
6526 case BUILT_IN_SQRTL:
6527 if (validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
6529 enum built_in_function fcode;
6530 tree arg = TREE_VALUE (arglist);
6532 /* Optimize sqrt of constant value. */
6533 if (TREE_CODE (arg) == REAL_CST
6534 && ! TREE_CONSTANT_OVERFLOW (arg))
6536 REAL_VALUE_TYPE r, x;
6538 x = TREE_REAL_CST (arg);
6539 if (real_sqrt (&r, TYPE_MODE (type), &x)
6540 || (!flag_trapping_math && !flag_errno_math))
6541 return build_real (type, r);
6544 /* Optimize sqrt(exp(x)) = exp(x*0.5). */
6545 fcode = builtin_mathfn_code (arg);
6546 if (flag_unsafe_math_optimizations
6547 && (fcode == BUILT_IN_EXP
6548 || fcode == BUILT_IN_EXPF
6549 || fcode == BUILT_IN_EXPL))
6551 tree expfn = TREE_OPERAND (TREE_OPERAND (arg, 0), 0);
6552 arg = fold (build (MULT_EXPR, type,
6553 TREE_VALUE (TREE_OPERAND (arg, 1)),
6554 build_real (type, dconsthalf)));
6555 arglist = build_tree_list (NULL_TREE, arg);
6556 return build_function_call_expr (expfn, arglist);
6559 /* Optimize sqrt(pow(x,y)) = pow(x,y*0.5). */
6560 if (flag_unsafe_math_optimizations
6561 && (fcode == BUILT_IN_POW
6562 || fcode == BUILT_IN_POWF
6563 || fcode == BUILT_IN_POWL))
6565 tree powfn = TREE_OPERAND (TREE_OPERAND (arg, 0), 0);
6566 tree arg0 = TREE_VALUE (TREE_OPERAND (arg, 1));
6567 tree arg1 = TREE_VALUE (TREE_CHAIN (TREE_OPERAND (arg, 1)));
6568 tree narg1 = fold (build (MULT_EXPR, type, arg1,
6569 build_real (type, dconsthalf)));
6570 arglist = tree_cons (NULL_TREE, arg0,
6571 build_tree_list (NULL_TREE, narg1));
6572 return build_function_call_expr (powfn, arglist);
6580 if (validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
6582 tree arg = TREE_VALUE (arglist);
6584 /* Optimize sin(0.0) = 0.0. */
6585 if (real_zerop (arg))
6593 if (validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
6595 tree arg = TREE_VALUE (arglist);
6597 /* Optimize cos(0.0) = 1.0. */
6598 if (real_zerop (arg))
6599 return build_real (type, dconst1);
6601 /* Optimize cos(-x) into cos(x). */
6602 if (TREE_CODE (arg) == NEGATE_EXPR)
6604 tree arglist = build_tree_list (NULL_TREE,
6605 TREE_OPERAND (arg, 0));
6606 return build_function_call_expr (fndecl, arglist);
6614 return fold_builtin_exponent (exp, &dconste);
6616 case BUILT_IN_EXP2F:
6617 case BUILT_IN_EXP2L:
6618 return fold_builtin_exponent (exp, &dconst2);
6619 case BUILT_IN_EXP10:
6620 case BUILT_IN_EXP10F:
6621 case BUILT_IN_EXP10L:
6622 case BUILT_IN_POW10:
6623 case BUILT_IN_POW10F:
6624 case BUILT_IN_POW10L:
6625 return fold_builtin_exponent (exp, &dconst10);
6629 return fold_builtin_logarithm (exp, &dconste);
6632 case BUILT_IN_LOG2F:
6633 case BUILT_IN_LOG2L:
6634 return fold_builtin_logarithm (exp, &dconst2);
6636 case BUILT_IN_LOG10:
6637 case BUILT_IN_LOG10F:
6638 case BUILT_IN_LOG10L:
6639 return fold_builtin_logarithm (exp, &dconst10);
6645 if (validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
6647 enum built_in_function fcode;
6648 tree arg = TREE_VALUE (arglist);
6650 /* Optimize tan(0.0) = 0.0. */
6651 if (real_zerop (arg))
6654 /* Optimize tan(atan(x)) = x. */
6655 fcode = builtin_mathfn_code (arg);
6656 if (flag_unsafe_math_optimizations
6657 && (fcode == BUILT_IN_ATAN
6658 || fcode == BUILT_IN_ATANF
6659 || fcode == BUILT_IN_ATANL))
6660 return TREE_VALUE (TREE_OPERAND (arg, 1));
6665 case BUILT_IN_ATANF:
6666 case BUILT_IN_ATANL:
6667 if (validate_arglist (arglist, REAL_TYPE, VOID_TYPE))
6669 tree arg = TREE_VALUE (arglist);
6671 /* Optimize atan(0.0) = 0.0. */
6672 if (real_zerop (arg))
6675 /* Optimize atan(1.0) = pi/4. */
6676 if (real_onep (arg))
6678 REAL_VALUE_TYPE cst;
6680 real_convert (&cst, TYPE_MODE (type), &dconstpi);
6682 return build_real (type, cst);
6690 if (validate_arglist (arglist, REAL_TYPE, REAL_TYPE, VOID_TYPE))
6692 enum built_in_function fcode;
6693 tree arg0 = TREE_VALUE (arglist);
6694 tree arg1 = TREE_VALUE (TREE_CHAIN (arglist));
6696 /* Optimize pow(1.0,y) = 1.0. */
6697 if (real_onep (arg0))
6698 return omit_one_operand (type, build_real (type, dconst1), arg1);
6700 if (TREE_CODE (arg1) == REAL_CST
6701 && ! TREE_CONSTANT_OVERFLOW (arg1))
6704 c = TREE_REAL_CST (arg1);
6706 /* Optimize pow(x,0.0) = 1.0. */
6707 if (REAL_VALUES_EQUAL (c, dconst0))
6708 return omit_one_operand (type, build_real (type, dconst1),
6711 /* Optimize pow(x,1.0) = x. */
6712 if (REAL_VALUES_EQUAL (c, dconst1))
6715 /* Optimize pow(x,-1.0) = 1.0/x. */
6716 if (REAL_VALUES_EQUAL (c, dconstm1))
6717 return fold (build (RDIV_EXPR, type,
6718 build_real (type, dconst1),
6721 /* Optimize pow(x,0.5) = sqrt(x). */
6722 if (flag_unsafe_math_optimizations
6723 && REAL_VALUES_EQUAL (c, dconsthalf))
6727 fcode = DECL_FUNCTION_CODE (fndecl);
6728 if (fcode == BUILT_IN_POW)
6729 sqrtfn = implicit_built_in_decls[BUILT_IN_SQRT];
6730 else if (fcode == BUILT_IN_POWF)
6731 sqrtfn = implicit_built_in_decls[BUILT_IN_SQRTF];
6732 else if (fcode == BUILT_IN_POWL)
6733 sqrtfn = implicit_built_in_decls[BUILT_IN_SQRTL];
6737 if (sqrtfn != NULL_TREE)
6739 tree arglist = build_tree_list (NULL_TREE, arg0);
6740 return build_function_call_expr (sqrtfn, arglist);
6744 /* Attempt to evaluate pow at compile-time. */
6745 if (TREE_CODE (arg0) == REAL_CST
6746 && ! TREE_CONSTANT_OVERFLOW (arg0))
6748 REAL_VALUE_TYPE cint;
6751 n = real_to_integer (&c);
6752 real_from_integer (&cint, VOIDmode, n,
6754 if (real_identical (&c, &cint))
6759 x = TREE_REAL_CST (arg0);
6760 inexact = real_powi (&x, TYPE_MODE (type), &x, n);
6761 if (flag_unsafe_math_optimizations || !inexact)
6762 return build_real (type, x);
6767 /* Optimize pow(exp(x),y) = exp(x*y). */
6768 fcode = builtin_mathfn_code (arg0);
6769 if (flag_unsafe_math_optimizations
6770 && (fcode == BUILT_IN_EXP
6771 || fcode == BUILT_IN_EXPF
6772 || fcode == BUILT_IN_EXPL))
6774 tree expfn = TREE_OPERAND (TREE_OPERAND (arg0, 0), 0);
6775 tree arg = TREE_VALUE (TREE_OPERAND (arg0, 1));
6776 arg = fold (build (MULT_EXPR, type, arg, arg1));
6777 arglist = build_tree_list (NULL_TREE, arg);
6778 return build_function_call_expr (expfn, arglist);
6781 /* Optimize pow(sqrt(x),y) = pow(x,y*0.5). */
6782 if (flag_unsafe_math_optimizations
6783 && (fcode == BUILT_IN_SQRT
6784 || fcode == BUILT_IN_SQRTF
6785 || fcode == BUILT_IN_SQRTL))
6787 tree narg0 = TREE_VALUE (TREE_OPERAND (arg0, 1));
6788 tree narg1 = fold (build (MULT_EXPR, type, arg1,
6789 build_real (type, dconsthalf)));
6791 arglist = tree_cons (NULL_TREE, narg0,
6792 build_tree_list (NULL_TREE, narg1));
6793 return build_function_call_expr (fndecl, arglist);
6796 /* Optimize pow(pow(x,y),z) = pow(x,y*z). */
6797 if (flag_unsafe_math_optimizations
6798 && (fcode == BUILT_IN_POW
6799 || fcode == BUILT_IN_POWF
6800 || fcode == BUILT_IN_POWL))
6802 tree arg00 = TREE_VALUE (TREE_OPERAND (arg0, 1));
6803 tree arg01 = TREE_VALUE (TREE_CHAIN (TREE_OPERAND (arg0, 1)));
6804 tree narg1 = fold (build (MULT_EXPR, type, arg01, arg1));
6805 arglist = tree_cons (NULL_TREE, arg00,
6806 build_tree_list (NULL_TREE, narg1));
6807 return build_function_call_expr (fndecl, arglist);
6815 return fold_builtin_inf (type, true);
6817 case BUILT_IN_HUGE_VAL:
6818 case BUILT_IN_HUGE_VALF:
6819 case BUILT_IN_HUGE_VALL:
6820 return fold_builtin_inf (type, false);
6825 return fold_builtin_nan (arglist, type, true);
6828 case BUILT_IN_NANSF:
6829 case BUILT_IN_NANSL:
6830 return fold_builtin_nan (arglist, type, false);
6832 case BUILT_IN_FLOOR:
6833 case BUILT_IN_FLOORF:
6834 case BUILT_IN_FLOORL:
6835 return fold_builtin_floor (exp);
6838 case BUILT_IN_CEILF:
6839 case BUILT_IN_CEILL:
6840 return fold_builtin_ceil (exp);
6842 case BUILT_IN_TRUNC:
6843 case BUILT_IN_TRUNCF:
6844 case BUILT_IN_TRUNCL:
6845 return fold_builtin_trunc (exp);
6847 case BUILT_IN_ROUND:
6848 case BUILT_IN_ROUNDF:
6849 case BUILT_IN_ROUNDL:
6850 case BUILT_IN_NEARBYINT:
6851 case BUILT_IN_NEARBYINTF:
6852 case BUILT_IN_NEARBYINTL:
6853 return fold_trunc_transparent_mathfn (exp);
6857 case BUILT_IN_FFSLL:
6860 case BUILT_IN_CLZLL:
6863 case BUILT_IN_CTZLL:
6864 case BUILT_IN_POPCOUNT:
6865 case BUILT_IN_POPCOUNTL:
6866 case BUILT_IN_POPCOUNTLL:
6867 case BUILT_IN_PARITY:
6868 case BUILT_IN_PARITYL:
6869 case BUILT_IN_PARITYLL:
6870 return fold_builtin_bitop (exp);
6872 case BUILT_IN_MEMCPY:
6873 return fold_builtin_memcpy (exp);
6875 case BUILT_IN_MEMPCPY:
6876 return fold_builtin_mempcpy (exp);
6878 case BUILT_IN_MEMMOVE:
6879 return fold_builtin_memmove (exp);
6881 case BUILT_IN_STRCPY:
6882 return fold_builtin_strcpy (exp);
6884 case BUILT_IN_STRNCPY:
6885 return fold_builtin_strncpy (exp);
6887 case BUILT_IN_MEMCMP:
6888 return fold_builtin_memcmp (exp);
6890 case BUILT_IN_STRCMP:
6891 return fold_builtin_strcmp (exp);
6893 case BUILT_IN_STRNCMP:
6894 return fold_builtin_strncmp (exp);
6903 /* Conveniently construct a function call expression. */
6906 build_function_call_expr (tree fn, tree arglist)
6910 call_expr = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn);
6911 call_expr = build (CALL_EXPR, TREE_TYPE (TREE_TYPE (fn)),
6912 call_expr, arglist);
6913 return fold (call_expr);
6916 /* This function validates the types of a function call argument list
6917 represented as a tree chain of parameters against a specified list
6918 of tree_codes. If the last specifier is a 0, that represents an
6919 ellipses, otherwise the last specifier must be a VOID_TYPE. */
6922 validate_arglist (tree arglist, ...)
6924 enum tree_code code;
6928 va_start (ap, arglist);
6932 code = va_arg (ap, enum tree_code);
6936 /* This signifies an ellipses, any further arguments are all ok. */
6940 /* This signifies an endlink, if no arguments remain, return
6941 true, otherwise return false. */
6945 /* If no parameters remain or the parameter's code does not
6946 match the specified code, return false. Otherwise continue
6947 checking any remaining arguments. */
6949 || code != TREE_CODE (TREE_TYPE (TREE_VALUE (arglist))))
6953 arglist = TREE_CHAIN (arglist);
6957 /* We need gotos here since we can only have one VA_CLOSE in a
6965 /* Default target-specific builtin expander that does nothing. */
6968 default_expand_builtin (tree exp ATTRIBUTE_UNUSED,
6969 rtx target ATTRIBUTE_UNUSED,
6970 rtx subtarget ATTRIBUTE_UNUSED,
6971 enum machine_mode mode ATTRIBUTE_UNUSED,
6972 int ignore ATTRIBUTE_UNUSED)
6977 /* Instantiate all remaining CONSTANT_P_RTX nodes. */
6980 purge_builtin_constant_p (void)
6982 rtx insn, set, arg, new, note;
6984 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
6986 && (set = single_set (insn)) != NULL_RTX
6987 && (GET_CODE (arg = SET_SRC (set)) == CONSTANT_P_RTX
6988 || (GET_CODE (arg) == SUBREG
6989 && (GET_CODE (arg = SUBREG_REG (arg))
6990 == CONSTANT_P_RTX))))
6992 arg = XEXP (arg, 0);
6993 new = CONSTANT_P (arg) ? const1_rtx : const0_rtx;
6994 validate_change (insn, &SET_SRC (set), new, 0);
6996 /* Remove the REG_EQUAL note from the insn. */
6997 if ((note = find_reg_note (insn, REG_EQUAL, NULL_RTX)) != 0)
6998 remove_note (insn, note);
7002 /* Returns true is EXP represents data that would potentially reside
7003 in a readonly section. */
7006 readonly_data_expr (tree exp)
7010 if (TREE_CODE (exp) == ADDR_EXPR)
7011 return decl_readonly_section (TREE_OPERAND (exp, 0), 0);