1 /* Expand builtin functions.
2 Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
3 2000, 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
24 #include "coretypes.h"
30 #include "tree-gimple.h"
33 #include "hard-reg-set.h"
36 #include "insn-config.h"
42 #include "typeclass.h"
47 #include "langhooks.h"
48 #include "basic-block.h"
49 #include "tree-mudflap.h"
51 #ifndef PAD_VARARGS_DOWN
52 #define PAD_VARARGS_DOWN BYTES_BIG_ENDIAN
55 /* Define the names of the builtin function types and codes. */
56 const char *const built_in_class_names
[4]
57 = {"NOT_BUILT_IN", "BUILT_IN_FRONTEND", "BUILT_IN_MD", "BUILT_IN_NORMAL"};
59 #define DEF_BUILTIN(X, N, C, T, LT, B, F, NA, AT, IM, COND) #X,
60 const char * built_in_names
[(int) END_BUILTINS
] =
62 #include "builtins.def"
66 /* Setup an array of _DECL trees, make sure each element is
67 initialized to NULL_TREE. */
68 tree built_in_decls
[(int) END_BUILTINS
];
69 /* Declarations used when constructing the builtin implicitly in the compiler.
70 It may be NULL_TREE when this is invalid (for instance runtime is not
71 required to implement the function call in all cases). */
72 tree implicit_built_in_decls
[(int) END_BUILTINS
];
74 static int get_pointer_alignment (tree
, unsigned int);
75 static const char *c_getstr (tree
);
76 static rtx
c_readstr (const char *, enum machine_mode
);
77 static int target_char_cast (tree
, char *);
78 static rtx
get_memory_rtx (tree
);
79 static tree
build_string_literal (int, const char *);
80 static int apply_args_size (void);
81 static int apply_result_size (void);
82 #if defined (HAVE_untyped_call) || defined (HAVE_untyped_return)
83 static rtx
result_vector (int, rtx
);
85 static rtx
expand_builtin_setjmp (tree
, rtx
);
86 static void expand_builtin_update_setjmp_buf (rtx
);
87 static void expand_builtin_prefetch (tree
);
88 static rtx
expand_builtin_apply_args (void);
89 static rtx
expand_builtin_apply_args_1 (void);
90 static rtx
expand_builtin_apply (rtx
, rtx
, rtx
);
91 static void expand_builtin_return (rtx
);
92 static enum type_class
type_to_class (tree
);
93 static rtx
expand_builtin_classify_type (tree
);
94 static void expand_errno_check (tree
, rtx
);
95 static rtx
expand_builtin_mathfn (tree
, rtx
, rtx
);
96 static rtx
expand_builtin_mathfn_2 (tree
, rtx
, rtx
);
97 static rtx
expand_builtin_mathfn_3 (tree
, rtx
, rtx
);
98 static rtx
expand_builtin_int_roundingfn (tree
, rtx
, rtx
);
99 static rtx
expand_builtin_args_info (tree
);
100 static rtx
expand_builtin_next_arg (void);
101 static rtx
expand_builtin_va_start (tree
);
102 static rtx
expand_builtin_va_end (tree
);
103 static rtx
expand_builtin_va_copy (tree
);
104 static rtx
expand_builtin_memcmp (tree
, tree
, rtx
, enum machine_mode
);
105 static rtx
expand_builtin_strcmp (tree
, rtx
, enum machine_mode
);
106 static rtx
expand_builtin_strncmp (tree
, rtx
, enum machine_mode
);
107 static rtx
builtin_memcpy_read_str (void *, HOST_WIDE_INT
, enum machine_mode
);
108 static rtx
expand_builtin_strcat (tree
, tree
, rtx
, enum machine_mode
);
109 static rtx
expand_builtin_strncat (tree
, rtx
, enum machine_mode
);
110 static rtx
expand_builtin_strspn (tree
, rtx
, enum machine_mode
);
111 static rtx
expand_builtin_strcspn (tree
, rtx
, enum machine_mode
);
112 static rtx
expand_builtin_memcpy (tree
, rtx
, enum machine_mode
);
113 static rtx
expand_builtin_mempcpy (tree
, tree
, rtx
, enum machine_mode
, int);
114 static rtx
expand_builtin_memmove (tree
, tree
, rtx
, enum machine_mode
, tree
);
115 static rtx
expand_builtin_bcopy (tree
);
116 static rtx
expand_builtin_strcpy (tree
, rtx
, enum machine_mode
);
117 static rtx
expand_builtin_stpcpy (tree
, rtx
, enum machine_mode
);
118 static rtx
builtin_strncpy_read_str (void *, HOST_WIDE_INT
, enum machine_mode
);
119 static rtx
expand_builtin_strncpy (tree
, rtx
, enum machine_mode
);
120 static rtx
builtin_memset_read_str (void *, HOST_WIDE_INT
, enum machine_mode
);
121 static rtx
builtin_memset_gen_str (void *, HOST_WIDE_INT
, enum machine_mode
);
122 static rtx
expand_builtin_memset (tree
, rtx
, enum machine_mode
, tree
);
123 static rtx
expand_builtin_bzero (tree
);
124 static rtx
expand_builtin_strlen (tree
, rtx
, enum machine_mode
);
125 static rtx
expand_builtin_strstr (tree
, tree
, rtx
, enum machine_mode
);
126 static rtx
expand_builtin_strpbrk (tree
, tree
, rtx
, enum machine_mode
);
127 static rtx
expand_builtin_strchr (tree
, tree
, rtx
, enum machine_mode
);
128 static rtx
expand_builtin_strrchr (tree
, tree
, rtx
, enum machine_mode
);
129 static rtx
expand_builtin_alloca (tree
, rtx
);
130 static rtx
expand_builtin_unop (enum machine_mode
, tree
, rtx
, rtx
, optab
);
131 static rtx
expand_builtin_frame_address (tree
, tree
);
132 static rtx
expand_builtin_fputs (tree
, rtx
, bool);
133 static rtx
expand_builtin_printf (tree
, rtx
, enum machine_mode
, bool);
134 static rtx
expand_builtin_fprintf (tree
, rtx
, enum machine_mode
, bool);
135 static rtx
expand_builtin_sprintf (tree
, rtx
, enum machine_mode
);
136 static tree
stabilize_va_list (tree
, int);
137 static rtx
expand_builtin_expect (tree
, rtx
);
138 static tree
fold_builtin_constant_p (tree
);
139 static tree
fold_builtin_classify_type (tree
);
140 static tree
fold_builtin_strlen (tree
);
141 static tree
fold_builtin_inf (tree
, int);
142 static tree
fold_builtin_nan (tree
, tree
, int);
143 static int validate_arglist (tree
, ...);
144 static bool integer_valued_real_p (tree
);
145 static tree
fold_trunc_transparent_mathfn (tree
, tree
);
146 static bool readonly_data_expr (tree
);
147 static rtx
expand_builtin_fabs (tree
, rtx
, rtx
);
148 static rtx
expand_builtin_signbit (tree
, rtx
);
149 static tree
fold_builtin_cabs (tree
, tree
);
150 static tree
fold_builtin_sqrt (tree
, tree
);
151 static tree
fold_builtin_cbrt (tree
, tree
);
152 static tree
fold_builtin_pow (tree
, tree
, tree
);
153 static tree
fold_builtin_powi (tree
, tree
, tree
);
154 static tree
fold_builtin_sin (tree
);
155 static tree
fold_builtin_cos (tree
, tree
, tree
);
156 static tree
fold_builtin_tan (tree
);
157 static tree
fold_builtin_atan (tree
, tree
);
158 static tree
fold_builtin_trunc (tree
, tree
);
159 static tree
fold_builtin_floor (tree
, tree
);
160 static tree
fold_builtin_ceil (tree
, tree
);
161 static tree
fold_builtin_round (tree
, tree
);
162 static tree
fold_builtin_int_roundingfn (tree
, tree
);
163 static tree
fold_builtin_bitop (tree
, tree
);
164 static tree
fold_builtin_memcpy (tree
, tree
);
165 static tree
fold_builtin_mempcpy (tree
, tree
, int);
166 static tree
fold_builtin_memmove (tree
, tree
);
167 static tree
fold_builtin_strchr (tree
, tree
);
168 static tree
fold_builtin_memcmp (tree
);
169 static tree
fold_builtin_strcmp (tree
);
170 static tree
fold_builtin_strncmp (tree
);
171 static tree
fold_builtin_signbit (tree
, tree
);
172 static tree
fold_builtin_copysign (tree
, tree
, tree
);
173 static tree
fold_builtin_isascii (tree
);
174 static tree
fold_builtin_toascii (tree
);
175 static tree
fold_builtin_isdigit (tree
);
176 static tree
fold_builtin_fabs (tree
, tree
);
177 static tree
fold_builtin_abs (tree
, tree
);
178 static tree
fold_builtin_unordered_cmp (tree
, tree
, enum tree_code
,
180 static tree
fold_builtin_1 (tree
, tree
, bool);
182 static tree
fold_builtin_strpbrk (tree
, tree
);
183 static tree
fold_builtin_strstr (tree
, tree
);
184 static tree
fold_builtin_strrchr (tree
, tree
);
185 static tree
fold_builtin_strcat (tree
);
186 static tree
fold_builtin_strncat (tree
);
187 static tree
fold_builtin_strspn (tree
);
188 static tree
fold_builtin_strcspn (tree
);
189 static tree
fold_builtin_sprintf (tree
, int);
191 /* Return true if NODE should be considered for inline expansion regardless
192 of the optimization level. This means whenever a function is invoked with
193 its "internal" name, which normally contains the prefix "__builtin". */
195 static bool called_as_built_in (tree node
)
197 const char *name
= IDENTIFIER_POINTER (DECL_NAME (node
));
198 if (strncmp (name
, "__builtin_", 10) == 0)
200 if (strncmp (name
, "__sync_", 7) == 0)
205 /* Return the alignment in bits of EXP, a pointer valued expression.
206 But don't return more than MAX_ALIGN no matter what.
207 The alignment returned is, by default, the alignment of the thing that
208 EXP points to. If it is not a POINTER_TYPE, 0 is returned.
210 Otherwise, look at the expression to see if we can do better, i.e., if the
211 expression is actually pointing at an object whose alignment is tighter. */
214 get_pointer_alignment (tree exp
, unsigned int max_align
)
216 unsigned int align
, inner
;
218 if (! POINTER_TYPE_P (TREE_TYPE (exp
)))
221 align
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (exp
)));
222 align
= MIN (align
, max_align
);
226 switch (TREE_CODE (exp
))
230 case NON_LVALUE_EXPR
:
231 exp
= TREE_OPERAND (exp
, 0);
232 if (! POINTER_TYPE_P (TREE_TYPE (exp
)))
235 inner
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (exp
)));
236 align
= MIN (inner
, max_align
);
240 /* If sum of pointer + int, restrict our maximum alignment to that
241 imposed by the integer. If not, we can't do any better than
243 if (! host_integerp (TREE_OPERAND (exp
, 1), 1))
246 while (((tree_low_cst (TREE_OPERAND (exp
, 1), 1))
247 & (max_align
/ BITS_PER_UNIT
- 1))
251 exp
= TREE_OPERAND (exp
, 0);
255 /* See what we are pointing at and look at its alignment. */
256 exp
= TREE_OPERAND (exp
, 0);
257 if (TREE_CODE (exp
) == FUNCTION_DECL
)
258 align
= FUNCTION_BOUNDARY
;
259 else if (DECL_P (exp
))
260 align
= DECL_ALIGN (exp
);
261 #ifdef CONSTANT_ALIGNMENT
262 else if (CONSTANT_CLASS_P (exp
))
263 align
= CONSTANT_ALIGNMENT (exp
, align
);
265 return MIN (align
, max_align
);
273 /* Compute the length of a C string. TREE_STRING_LENGTH is not the right
274 way, because it could contain a zero byte in the middle.
275 TREE_STRING_LENGTH is the size of the character array, not the string.
277 ONLY_VALUE should be nonzero if the result is not going to be emitted
278 into the instruction stream and zero if it is going to be expanded.
279 E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3
280 is returned, otherwise NULL, since
281 len = c_strlen (src, 1); if (len) expand_expr (len, ...); would not
282 evaluate the side-effects.
284 The value returned is of type `ssizetype'.
286 Unfortunately, string_constant can't access the values of const char
287 arrays with initializers, so neither can we do so here. */
290 c_strlen (tree src
, int only_value
)
293 HOST_WIDE_INT offset
;
298 if (TREE_CODE (src
) == COND_EXPR
299 && (only_value
|| !TREE_SIDE_EFFECTS (TREE_OPERAND (src
, 0))))
303 len1
= c_strlen (TREE_OPERAND (src
, 1), only_value
);
304 len2
= c_strlen (TREE_OPERAND (src
, 2), only_value
);
305 if (tree_int_cst_equal (len1
, len2
))
309 if (TREE_CODE (src
) == COMPOUND_EXPR
310 && (only_value
|| !TREE_SIDE_EFFECTS (TREE_OPERAND (src
, 0))))
311 return c_strlen (TREE_OPERAND (src
, 1), only_value
);
313 src
= string_constant (src
, &offset_node
);
317 max
= TREE_STRING_LENGTH (src
) - 1;
318 ptr
= TREE_STRING_POINTER (src
);
320 if (offset_node
&& TREE_CODE (offset_node
) != INTEGER_CST
)
322 /* If the string has an internal zero byte (e.g., "foo\0bar"), we can't
323 compute the offset to the following null if we don't know where to
324 start searching for it. */
327 for (i
= 0; i
< max
; i
++)
331 /* We don't know the starting offset, but we do know that the string
332 has no internal zero bytes. We can assume that the offset falls
333 within the bounds of the string; otherwise, the programmer deserves
334 what he gets. Subtract the offset from the length of the string,
335 and return that. This would perhaps not be valid if we were dealing
336 with named arrays in addition to literal string constants. */
338 return size_diffop (size_int (max
), offset_node
);
341 /* We have a known offset into the string. Start searching there for
342 a null character if we can represent it as a single HOST_WIDE_INT. */
343 if (offset_node
== 0)
345 else if (! host_integerp (offset_node
, 0))
348 offset
= tree_low_cst (offset_node
, 0);
350 /* If the offset is known to be out of bounds, warn, and call strlen at
352 if (offset
< 0 || offset
> max
)
354 warning (0, "offset outside bounds of constant string");
358 /* Use strlen to search for the first zero byte. Since any strings
359 constructed with build_string will have nulls appended, we win even
360 if we get handed something like (char[4])"abcd".
362 Since OFFSET is our starting index into the string, no further
363 calculation is needed. */
364 return ssize_int (strlen (ptr
+ offset
));
367 /* Return a char pointer for a C string if it is a string constant
368 or sum of string constant and integer constant. */
375 src
= string_constant (src
, &offset_node
);
379 if (offset_node
== 0)
380 return TREE_STRING_POINTER (src
);
381 else if (!host_integerp (offset_node
, 1)
382 || compare_tree_int (offset_node
, TREE_STRING_LENGTH (src
) - 1) > 0)
385 return TREE_STRING_POINTER (src
) + tree_low_cst (offset_node
, 1);
388 /* Return a CONST_INT or CONST_DOUBLE corresponding to target reading
389 GET_MODE_BITSIZE (MODE) bits from string constant STR. */
392 c_readstr (const char *str
, enum machine_mode mode
)
398 gcc_assert (GET_MODE_CLASS (mode
) == MODE_INT
);
403 for (i
= 0; i
< GET_MODE_SIZE (mode
); i
++)
406 if (WORDS_BIG_ENDIAN
)
407 j
= GET_MODE_SIZE (mode
) - i
- 1;
408 if (BYTES_BIG_ENDIAN
!= WORDS_BIG_ENDIAN
409 && GET_MODE_SIZE (mode
) > UNITS_PER_WORD
)
410 j
= j
+ UNITS_PER_WORD
- 2 * (j
% UNITS_PER_WORD
) - 1;
412 gcc_assert (j
<= 2 * HOST_BITS_PER_WIDE_INT
);
415 ch
= (unsigned char) str
[i
];
416 c
[j
/ HOST_BITS_PER_WIDE_INT
] |= ch
<< (j
% HOST_BITS_PER_WIDE_INT
);
418 return immed_double_const (c
[0], c
[1], mode
);
421 /* Cast a target constant CST to target CHAR and if that value fits into
422 host char type, return zero and put that value into variable pointed by
426 target_char_cast (tree cst
, char *p
)
428 unsigned HOST_WIDE_INT val
, hostval
;
430 if (!host_integerp (cst
, 1)
431 || CHAR_TYPE_SIZE
> HOST_BITS_PER_WIDE_INT
)
434 val
= tree_low_cst (cst
, 1);
435 if (CHAR_TYPE_SIZE
< HOST_BITS_PER_WIDE_INT
)
436 val
&= (((unsigned HOST_WIDE_INT
) 1) << CHAR_TYPE_SIZE
) - 1;
439 if (HOST_BITS_PER_CHAR
< HOST_BITS_PER_WIDE_INT
)
440 hostval
&= (((unsigned HOST_WIDE_INT
) 1) << HOST_BITS_PER_CHAR
) - 1;
449 /* Similar to save_expr, but assumes that arbitrary code is not executed
450 in between the multiple evaluations. In particular, we assume that a
451 non-addressable local variable will not be modified. */
454 builtin_save_expr (tree exp
)
456 if (TREE_ADDRESSABLE (exp
) == 0
457 && (TREE_CODE (exp
) == PARM_DECL
458 || (TREE_CODE (exp
) == VAR_DECL
&& !TREE_STATIC (exp
))))
461 return save_expr (exp
);
464 /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT
465 times to get the address of either a higher stack frame, or a return
466 address located within it (depending on FNDECL_CODE). */
469 expand_builtin_return_addr (enum built_in_function fndecl_code
, int count
)
473 #ifdef INITIAL_FRAME_ADDRESS_RTX
474 rtx tem
= INITIAL_FRAME_ADDRESS_RTX
;
476 rtx tem
= hard_frame_pointer_rtx
;
479 /* Some machines need special handling before we can access
480 arbitrary frames. For example, on the sparc, we must first flush
481 all register windows to the stack. */
482 #ifdef SETUP_FRAME_ADDRESSES
484 SETUP_FRAME_ADDRESSES ();
487 /* On the sparc, the return address is not in the frame, it is in a
488 register. There is no way to access it off of the current frame
489 pointer, but it can be accessed off the previous frame pointer by
490 reading the value from the register window save area. */
491 #ifdef RETURN_ADDR_IN_PREVIOUS_FRAME
492 if (fndecl_code
== BUILT_IN_RETURN_ADDRESS
)
496 /* Scan back COUNT frames to the specified frame. */
497 for (i
= 0; i
< count
; i
++)
499 /* Assume the dynamic chain pointer is in the word that the
500 frame address points to, unless otherwise specified. */
501 #ifdef DYNAMIC_CHAIN_ADDRESS
502 tem
= DYNAMIC_CHAIN_ADDRESS (tem
);
504 tem
= memory_address (Pmode
, tem
);
505 tem
= gen_rtx_MEM (Pmode
, tem
);
506 set_mem_alias_set (tem
, get_frame_alias_set ());
507 tem
= copy_to_reg (tem
);
510 /* For __builtin_frame_address, return what we've got. */
511 if (fndecl_code
== BUILT_IN_FRAME_ADDRESS
)
514 /* For __builtin_return_address, Get the return address from that
516 #ifdef RETURN_ADDR_RTX
517 tem
= RETURN_ADDR_RTX (count
, tem
);
519 tem
= memory_address (Pmode
,
520 plus_constant (tem
, GET_MODE_SIZE (Pmode
)));
521 tem
= gen_rtx_MEM (Pmode
, tem
);
522 set_mem_alias_set (tem
, get_frame_alias_set ());
527 /* Alias set used for setjmp buffer. */
528 static HOST_WIDE_INT setjmp_alias_set
= -1;
530 /* Construct the leading half of a __builtin_setjmp call. Control will
531 return to RECEIVER_LABEL. This is used directly by sjlj exception
535 expand_builtin_setjmp_setup (rtx buf_addr
, rtx receiver_label
)
537 enum machine_mode sa_mode
= STACK_SAVEAREA_MODE (SAVE_NONLOCAL
);
541 if (setjmp_alias_set
== -1)
542 setjmp_alias_set
= new_alias_set ();
544 buf_addr
= convert_memory_address (Pmode
, buf_addr
);
546 buf_addr
= force_reg (Pmode
, force_operand (buf_addr
, NULL_RTX
));
548 /* We store the frame pointer and the address of receiver_label in
549 the buffer and use the rest of it for the stack save area, which
550 is machine-dependent. */
552 mem
= gen_rtx_MEM (Pmode
, buf_addr
);
553 set_mem_alias_set (mem
, setjmp_alias_set
);
554 emit_move_insn (mem
, targetm
.builtin_setjmp_frame_value ());
556 mem
= gen_rtx_MEM (Pmode
, plus_constant (buf_addr
, GET_MODE_SIZE (Pmode
))),
557 set_mem_alias_set (mem
, setjmp_alias_set
);
559 emit_move_insn (validize_mem (mem
),
560 force_reg (Pmode
, gen_rtx_LABEL_REF (Pmode
, receiver_label
)));
562 stack_save
= gen_rtx_MEM (sa_mode
,
563 plus_constant (buf_addr
,
564 2 * GET_MODE_SIZE (Pmode
)));
565 set_mem_alias_set (stack_save
, setjmp_alias_set
);
566 emit_stack_save (SAVE_NONLOCAL
, &stack_save
, NULL_RTX
);
568 /* If there is further processing to do, do it. */
569 #ifdef HAVE_builtin_setjmp_setup
570 if (HAVE_builtin_setjmp_setup
)
571 emit_insn (gen_builtin_setjmp_setup (buf_addr
));
574 /* Tell optimize_save_area_alloca that extra work is going to
575 need to go on during alloca. */
576 current_function_calls_setjmp
= 1;
578 /* Set this so all the registers get saved in our frame; we need to be
579 able to copy the saved values for any registers from frames we unwind. */
580 current_function_has_nonlocal_label
= 1;
583 /* Construct the trailing part of a __builtin_setjmp call.
584 This is used directly by sjlj exception handling code. */
587 expand_builtin_setjmp_receiver (rtx receiver_label ATTRIBUTE_UNUSED
)
589 /* Clobber the FP when we get here, so we have to make sure it's
590 marked as used by this function. */
591 emit_insn (gen_rtx_USE (VOIDmode
, hard_frame_pointer_rtx
));
593 /* Mark the static chain as clobbered here so life information
594 doesn't get messed up for it. */
595 emit_insn (gen_rtx_CLOBBER (VOIDmode
, static_chain_rtx
));
597 /* Now put in the code to restore the frame pointer, and argument
598 pointer, if needed. */
599 #ifdef HAVE_nonlocal_goto
600 if (! HAVE_nonlocal_goto
)
602 emit_move_insn (virtual_stack_vars_rtx
, hard_frame_pointer_rtx
);
604 #if ARG_POINTER_REGNUM != HARD_FRAME_POINTER_REGNUM
605 if (fixed_regs
[ARG_POINTER_REGNUM
])
607 #ifdef ELIMINABLE_REGS
609 static const struct elims
{const int from
, to
;} elim_regs
[] = ELIMINABLE_REGS
;
611 for (i
= 0; i
< ARRAY_SIZE (elim_regs
); i
++)
612 if (elim_regs
[i
].from
== ARG_POINTER_REGNUM
613 && elim_regs
[i
].to
== HARD_FRAME_POINTER_REGNUM
)
616 if (i
== ARRAY_SIZE (elim_regs
))
619 /* Now restore our arg pointer from the address at which it
620 was saved in our stack frame. */
621 emit_move_insn (virtual_incoming_args_rtx
,
622 copy_to_reg (get_arg_pointer_save_area (cfun
)));
627 #ifdef HAVE_builtin_setjmp_receiver
628 if (HAVE_builtin_setjmp_receiver
)
629 emit_insn (gen_builtin_setjmp_receiver (receiver_label
));
632 #ifdef HAVE_nonlocal_goto_receiver
633 if (HAVE_nonlocal_goto_receiver
)
634 emit_insn (gen_nonlocal_goto_receiver ());
639 /* @@@ This is a kludge. Not all machine descriptions define a blockage
640 insn, but we must not allow the code we just generated to be reordered
641 by scheduling. Specifically, the update of the frame pointer must
642 happen immediately, not later. So emit an ASM_INPUT to act as blockage
644 emit_insn (gen_rtx_ASM_INPUT (VOIDmode
, ""));
647 /* __builtin_setjmp is passed a pointer to an array of five words (not
648 all will be used on all machines). It operates similarly to the C
649 library function of the same name, but is more efficient. Much of
650 the code below (and for longjmp) is copied from the handling of
653 NOTE: This is intended for use by GNAT and the exception handling
654 scheme in the compiler and will only work in the method used by
658 expand_builtin_setjmp (tree arglist
, rtx target
)
660 rtx buf_addr
, next_lab
, cont_lab
;
662 if (!validate_arglist (arglist
, POINTER_TYPE
, VOID_TYPE
))
665 if (target
== 0 || !REG_P (target
)
666 || REGNO (target
) < FIRST_PSEUDO_REGISTER
)
667 target
= gen_reg_rtx (TYPE_MODE (integer_type_node
));
669 buf_addr
= expand_expr (TREE_VALUE (arglist
), NULL_RTX
, VOIDmode
, 0);
671 next_lab
= gen_label_rtx ();
672 cont_lab
= gen_label_rtx ();
674 expand_builtin_setjmp_setup (buf_addr
, next_lab
);
676 /* Set TARGET to zero and branch to the continue label. Use emit_jump to
677 ensure that pending stack adjustments are flushed. */
678 emit_move_insn (target
, const0_rtx
);
679 emit_jump (cont_lab
);
681 emit_label (next_lab
);
683 expand_builtin_setjmp_receiver (next_lab
);
685 /* Set TARGET to one. */
686 emit_move_insn (target
, const1_rtx
);
687 emit_label (cont_lab
);
689 /* Tell flow about the strange goings on. Putting `next_lab' on
690 `nonlocal_goto_handler_labels' to indicates that function
691 calls may traverse the arc back to this label. */
693 current_function_has_nonlocal_label
= 1;
694 nonlocal_goto_handler_labels
695 = gen_rtx_EXPR_LIST (VOIDmode
, next_lab
, nonlocal_goto_handler_labels
);
700 /* __builtin_longjmp is passed a pointer to an array of five words (not
701 all will be used on all machines). It operates similarly to the C
702 library function of the same name, but is more efficient. Much of
703 the code below is copied from the handling of non-local gotos.
705 NOTE: This is intended for use by GNAT and the exception handling
706 scheme in the compiler and will only work in the method used by
710 expand_builtin_longjmp (rtx buf_addr
, rtx value
)
712 rtx fp
, lab
, stack
, insn
, last
;
713 enum machine_mode sa_mode
= STACK_SAVEAREA_MODE (SAVE_NONLOCAL
);
715 if (setjmp_alias_set
== -1)
716 setjmp_alias_set
= new_alias_set ();
718 buf_addr
= convert_memory_address (Pmode
, buf_addr
);
720 buf_addr
= force_reg (Pmode
, buf_addr
);
722 /* We used to store value in static_chain_rtx, but that fails if pointers
723 are smaller than integers. We instead require that the user must pass
724 a second argument of 1, because that is what builtin_setjmp will
725 return. This also makes EH slightly more efficient, since we are no
726 longer copying around a value that we don't care about. */
727 gcc_assert (value
== const1_rtx
);
729 last
= get_last_insn ();
730 #ifdef HAVE_builtin_longjmp
731 if (HAVE_builtin_longjmp
)
732 emit_insn (gen_builtin_longjmp (buf_addr
));
736 fp
= gen_rtx_MEM (Pmode
, buf_addr
);
737 lab
= gen_rtx_MEM (Pmode
, plus_constant (buf_addr
,
738 GET_MODE_SIZE (Pmode
)));
740 stack
= gen_rtx_MEM (sa_mode
, plus_constant (buf_addr
,
741 2 * GET_MODE_SIZE (Pmode
)));
742 set_mem_alias_set (fp
, setjmp_alias_set
);
743 set_mem_alias_set (lab
, setjmp_alias_set
);
744 set_mem_alias_set (stack
, setjmp_alias_set
);
746 /* Pick up FP, label, and SP from the block and jump. This code is
747 from expand_goto in stmt.c; see there for detailed comments. */
748 #if HAVE_nonlocal_goto
749 if (HAVE_nonlocal_goto
)
750 /* We have to pass a value to the nonlocal_goto pattern that will
751 get copied into the static_chain pointer, but it does not matter
752 what that value is, because builtin_setjmp does not use it. */
753 emit_insn (gen_nonlocal_goto (value
, lab
, stack
, fp
));
757 lab
= copy_to_reg (lab
);
759 emit_insn (gen_rtx_CLOBBER (VOIDmode
,
760 gen_rtx_MEM (BLKmode
,
761 gen_rtx_SCRATCH (VOIDmode
))));
762 emit_insn (gen_rtx_CLOBBER (VOIDmode
,
763 gen_rtx_MEM (BLKmode
,
764 hard_frame_pointer_rtx
)));
766 emit_move_insn (hard_frame_pointer_rtx
, fp
);
767 emit_stack_restore (SAVE_NONLOCAL
, stack
, NULL_RTX
);
769 emit_insn (gen_rtx_USE (VOIDmode
, hard_frame_pointer_rtx
));
770 emit_insn (gen_rtx_USE (VOIDmode
, stack_pointer_rtx
));
771 emit_indirect_jump (lab
);
775 /* Search backwards and mark the jump insn as a non-local goto.
776 Note that this precludes the use of __builtin_longjmp to a
777 __builtin_setjmp target in the same function. However, we've
778 already cautioned the user that these functions are for
779 internal exception handling use only. */
780 for (insn
= get_last_insn (); insn
; insn
= PREV_INSN (insn
))
782 gcc_assert (insn
!= last
);
786 REG_NOTES (insn
) = alloc_EXPR_LIST (REG_NON_LOCAL_GOTO
, const0_rtx
,
790 else if (CALL_P (insn
))
795 /* Expand a call to __builtin_nonlocal_goto. We're passed the target label
796 and the address of the save area. */
799 expand_builtin_nonlocal_goto (tree arglist
)
801 tree t_label
, t_save_area
;
802 rtx r_label
, r_save_area
, r_fp
, r_sp
, insn
;
804 if (!validate_arglist (arglist
, POINTER_TYPE
, POINTER_TYPE
, VOID_TYPE
))
807 t_label
= TREE_VALUE (arglist
);
808 arglist
= TREE_CHAIN (arglist
);
809 t_save_area
= TREE_VALUE (arglist
);
811 r_label
= expand_expr (t_label
, NULL_RTX
, VOIDmode
, 0);
812 r_label
= convert_memory_address (Pmode
, r_label
);
813 r_save_area
= expand_expr (t_save_area
, NULL_RTX
, VOIDmode
, 0);
814 r_save_area
= convert_memory_address (Pmode
, r_save_area
);
815 r_fp
= gen_rtx_MEM (Pmode
, r_save_area
);
816 r_sp
= gen_rtx_MEM (STACK_SAVEAREA_MODE (SAVE_NONLOCAL
),
817 plus_constant (r_save_area
, GET_MODE_SIZE (Pmode
)));
819 current_function_has_nonlocal_goto
= 1;
821 #if HAVE_nonlocal_goto
822 /* ??? We no longer need to pass the static chain value, afaik. */
823 if (HAVE_nonlocal_goto
)
824 emit_insn (gen_nonlocal_goto (const0_rtx
, r_label
, r_sp
, r_fp
));
828 r_label
= copy_to_reg (r_label
);
830 emit_insn (gen_rtx_CLOBBER (VOIDmode
,
831 gen_rtx_MEM (BLKmode
,
832 gen_rtx_SCRATCH (VOIDmode
))));
834 emit_insn (gen_rtx_CLOBBER (VOIDmode
,
835 gen_rtx_MEM (BLKmode
,
836 hard_frame_pointer_rtx
)));
838 /* Restore frame pointer for containing function.
839 This sets the actual hard register used for the frame pointer
840 to the location of the function's incoming static chain info.
841 The non-local goto handler will then adjust it to contain the
842 proper value and reload the argument pointer, if needed. */
843 emit_move_insn (hard_frame_pointer_rtx
, r_fp
);
844 emit_stack_restore (SAVE_NONLOCAL
, r_sp
, NULL_RTX
);
846 /* USE of hard_frame_pointer_rtx added for consistency;
847 not clear if really needed. */
848 emit_insn (gen_rtx_USE (VOIDmode
, hard_frame_pointer_rtx
));
849 emit_insn (gen_rtx_USE (VOIDmode
, stack_pointer_rtx
));
850 emit_indirect_jump (r_label
);
853 /* Search backwards to the jump insn and mark it as a
855 for (insn
= get_last_insn (); insn
; insn
= PREV_INSN (insn
))
859 REG_NOTES (insn
) = alloc_EXPR_LIST (REG_NON_LOCAL_GOTO
,
860 const0_rtx
, REG_NOTES (insn
));
863 else if (CALL_P (insn
))
870 /* __builtin_update_setjmp_buf is passed a pointer to an array of five words
871 (not all will be used on all machines) that was passed to __builtin_setjmp.
872 It updates the stack pointer in that block to correspond to the current
876 expand_builtin_update_setjmp_buf (rtx buf_addr
)
878 enum machine_mode sa_mode
= Pmode
;
882 #ifdef HAVE_save_stack_nonlocal
883 if (HAVE_save_stack_nonlocal
)
884 sa_mode
= insn_data
[(int) CODE_FOR_save_stack_nonlocal
].operand
[0].mode
;
886 #ifdef STACK_SAVEAREA_MODE
887 sa_mode
= STACK_SAVEAREA_MODE (SAVE_NONLOCAL
);
891 = gen_rtx_MEM (sa_mode
,
894 plus_constant (buf_addr
, 2 * GET_MODE_SIZE (Pmode
))));
898 emit_insn (gen_setjmp ());
901 emit_stack_save (SAVE_NONLOCAL
, &stack_save
, NULL_RTX
);
904 /* Expand a call to __builtin_prefetch. For a target that does not support
905 data prefetch, evaluate the memory address argument in case it has side
909 expand_builtin_prefetch (tree arglist
)
911 tree arg0
, arg1
, arg2
;
914 if (!validate_arglist (arglist
, POINTER_TYPE
, 0))
917 arg0
= TREE_VALUE (arglist
);
918 /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
919 zero (read) and argument 2 (locality) defaults to 3 (high degree of
921 if (TREE_CHAIN (arglist
))
923 arg1
= TREE_VALUE (TREE_CHAIN (arglist
));
924 if (TREE_CHAIN (TREE_CHAIN (arglist
)))
925 arg2
= TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist
)));
927 arg2
= build_int_cst (NULL_TREE
, 3);
931 arg1
= integer_zero_node
;
932 arg2
= build_int_cst (NULL_TREE
, 3);
935 /* Argument 0 is an address. */
936 op0
= expand_expr (arg0
, NULL_RTX
, Pmode
, EXPAND_NORMAL
);
938 /* Argument 1 (read/write flag) must be a compile-time constant int. */
939 if (TREE_CODE (arg1
) != INTEGER_CST
)
941 error ("second argument to %<__builtin_prefetch%> must be a constant");
942 arg1
= integer_zero_node
;
944 op1
= expand_expr (arg1
, NULL_RTX
, VOIDmode
, 0);
945 /* Argument 1 must be either zero or one. */
946 if (INTVAL (op1
) != 0 && INTVAL (op1
) != 1)
948 warning (0, "invalid second argument to %<__builtin_prefetch%>;"
953 /* Argument 2 (locality) must be a compile-time constant int. */
954 if (TREE_CODE (arg2
) != INTEGER_CST
)
956 error ("third argument to %<__builtin_prefetch%> must be a constant");
957 arg2
= integer_zero_node
;
959 op2
= expand_expr (arg2
, NULL_RTX
, VOIDmode
, 0);
960 /* Argument 2 must be 0, 1, 2, or 3. */
961 if (INTVAL (op2
) < 0 || INTVAL (op2
) > 3)
963 warning (0, "invalid third argument to %<__builtin_prefetch%>; using zero");
970 if ((! (*insn_data
[(int) CODE_FOR_prefetch
].operand
[0].predicate
)
972 insn_data
[(int) CODE_FOR_prefetch
].operand
[0].mode
))
973 || (GET_MODE (op0
) != Pmode
))
975 op0
= convert_memory_address (Pmode
, op0
);
976 op0
= force_reg (Pmode
, op0
);
978 emit_insn (gen_prefetch (op0
, op1
, op2
));
982 /* Don't do anything with direct references to volatile memory, but
983 generate code to handle other side effects. */
984 if (!MEM_P (op0
) && side_effects_p (op0
))
988 /* Get a MEM rtx for expression EXP which is the address of an operand
989 to be used to be used in a string instruction (cmpstrsi, movmemsi, ..). */
992 get_memory_rtx (tree exp
)
994 rtx addr
= expand_expr (exp
, NULL_RTX
, ptr_mode
, EXPAND_NORMAL
);
995 rtx mem
= gen_rtx_MEM (BLKmode
, memory_address (BLKmode
, addr
));
997 /* Get an expression we can use to find the attributes to assign to MEM.
998 If it is an ADDR_EXPR, use the operand. Otherwise, dereference it if
999 we can. First remove any nops. */
1000 while ((TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
1001 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
1002 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (exp
, 0))))
1003 exp
= TREE_OPERAND (exp
, 0);
1005 if (TREE_CODE (exp
) == ADDR_EXPR
)
1006 exp
= TREE_OPERAND (exp
, 0);
1007 else if (POINTER_TYPE_P (TREE_TYPE (exp
)))
1008 exp
= build1 (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (exp
)), exp
);
1012 /* Honor attributes derived from exp, except for the alias set
1013 (as builtin stringops may alias with anything) and the size
1014 (as stringops may access multiple array elements). */
1017 set_mem_attributes (mem
, exp
, 0);
1018 set_mem_alias_set (mem
, 0);
1019 set_mem_size (mem
, NULL_RTX
);
1025 /* Built-in functions to perform an untyped call and return. */
1027 /* For each register that may be used for calling a function, this
1028 gives a mode used to copy the register's value. VOIDmode indicates
1029 the register is not used for calling a function. If the machine
1030 has register windows, this gives only the outbound registers.
1031 INCOMING_REGNO gives the corresponding inbound register. */
1032 static enum machine_mode apply_args_mode
[FIRST_PSEUDO_REGISTER
];
1034 /* For each register that may be used for returning values, this gives
1035 a mode used to copy the register's value. VOIDmode indicates the
1036 register is not used for returning values. If the machine has
1037 register windows, this gives only the outbound registers.
1038 INCOMING_REGNO gives the corresponding inbound register. */
1039 static enum machine_mode apply_result_mode
[FIRST_PSEUDO_REGISTER
];
1041 /* For each register that may be used for calling a function, this
1042 gives the offset of that register into the block returned by
1043 __builtin_apply_args. 0 indicates that the register is not
1044 used for calling a function. */
1045 static int apply_args_reg_offset
[FIRST_PSEUDO_REGISTER
];
1047 /* Return the size required for the block returned by __builtin_apply_args,
1048 and initialize apply_args_mode. */
1051 apply_args_size (void)
1053 static int size
= -1;
1056 enum machine_mode mode
;
1058 /* The values computed by this function never change. */
1061 /* The first value is the incoming arg-pointer. */
1062 size
= GET_MODE_SIZE (Pmode
);
1064 /* The second value is the structure value address unless this is
1065 passed as an "invisible" first argument. */
1066 if (targetm
.calls
.struct_value_rtx (cfun
? TREE_TYPE (cfun
->decl
) : 0, 0))
1067 size
+= GET_MODE_SIZE (Pmode
);
1069 for (regno
= 0; regno
< FIRST_PSEUDO_REGISTER
; regno
++)
1070 if (FUNCTION_ARG_REGNO_P (regno
))
1072 mode
= reg_raw_mode
[regno
];
1074 gcc_assert (mode
!= VOIDmode
);
1076 align
= GET_MODE_ALIGNMENT (mode
) / BITS_PER_UNIT
;
1077 if (size
% align
!= 0)
1078 size
= CEIL (size
, align
) * align
;
1079 apply_args_reg_offset
[regno
] = size
;
1080 size
+= GET_MODE_SIZE (mode
);
1081 apply_args_mode
[regno
] = mode
;
1085 apply_args_mode
[regno
] = VOIDmode
;
1086 apply_args_reg_offset
[regno
] = 0;
1092 /* Return the size required for the block returned by __builtin_apply,
1093 and initialize apply_result_mode. */
1096 apply_result_size (void)
1098 static int size
= -1;
1100 enum machine_mode mode
;
1102 /* The values computed by this function never change. */
1107 for (regno
= 0; regno
< FIRST_PSEUDO_REGISTER
; regno
++)
1108 if (FUNCTION_VALUE_REGNO_P (regno
))
1110 mode
= reg_raw_mode
[regno
];
1112 gcc_assert (mode
!= VOIDmode
);
1114 align
= GET_MODE_ALIGNMENT (mode
) / BITS_PER_UNIT
;
1115 if (size
% align
!= 0)
1116 size
= CEIL (size
, align
) * align
;
1117 size
+= GET_MODE_SIZE (mode
);
1118 apply_result_mode
[regno
] = mode
;
1121 apply_result_mode
[regno
] = VOIDmode
;
1123 /* Allow targets that use untyped_call and untyped_return to override
1124 the size so that machine-specific information can be stored here. */
1125 #ifdef APPLY_RESULT_SIZE
1126 size
= APPLY_RESULT_SIZE
;
1132 #if defined (HAVE_untyped_call) || defined (HAVE_untyped_return)
1133 /* Create a vector describing the result block RESULT. If SAVEP is true,
1134 the result block is used to save the values; otherwise it is used to
1135 restore the values. */
1138 result_vector (int savep
, rtx result
)
1140 int regno
, size
, align
, nelts
;
1141 enum machine_mode mode
;
1143 rtx
*savevec
= alloca (FIRST_PSEUDO_REGISTER
* sizeof (rtx
));
1146 for (regno
= 0; regno
< FIRST_PSEUDO_REGISTER
; regno
++)
1147 if ((mode
= apply_result_mode
[regno
]) != VOIDmode
)
1149 align
= GET_MODE_ALIGNMENT (mode
) / BITS_PER_UNIT
;
1150 if (size
% align
!= 0)
1151 size
= CEIL (size
, align
) * align
;
1152 reg
= gen_rtx_REG (mode
, savep
? regno
: INCOMING_REGNO (regno
));
1153 mem
= adjust_address (result
, mode
, size
);
1154 savevec
[nelts
++] = (savep
1155 ? gen_rtx_SET (VOIDmode
, mem
, reg
)
1156 : gen_rtx_SET (VOIDmode
, reg
, mem
));
1157 size
+= GET_MODE_SIZE (mode
);
1159 return gen_rtx_PARALLEL (VOIDmode
, gen_rtvec_v (nelts
, savevec
));
1161 #endif /* HAVE_untyped_call or HAVE_untyped_return */
1163 /* Save the state required to perform an untyped call with the same
1164 arguments as were passed to the current function. */
1167 expand_builtin_apply_args_1 (void)
1170 int size
, align
, regno
;
1171 enum machine_mode mode
;
1172 rtx struct_incoming_value
= targetm
.calls
.struct_value_rtx (cfun
? TREE_TYPE (cfun
->decl
) : 0, 1);
1174 /* Create a block where the arg-pointer, structure value address,
1175 and argument registers can be saved. */
1176 registers
= assign_stack_local (BLKmode
, apply_args_size (), -1);
1178 /* Walk past the arg-pointer and structure value address. */
1179 size
= GET_MODE_SIZE (Pmode
);
1180 if (targetm
.calls
.struct_value_rtx (cfun
? TREE_TYPE (cfun
->decl
) : 0, 0))
1181 size
+= GET_MODE_SIZE (Pmode
);
1183 /* Save each register used in calling a function to the block. */
1184 for (regno
= 0; regno
< FIRST_PSEUDO_REGISTER
; regno
++)
1185 if ((mode
= apply_args_mode
[regno
]) != VOIDmode
)
1187 align
= GET_MODE_ALIGNMENT (mode
) / BITS_PER_UNIT
;
1188 if (size
% align
!= 0)
1189 size
= CEIL (size
, align
) * align
;
1191 tem
= gen_rtx_REG (mode
, INCOMING_REGNO (regno
));
1193 emit_move_insn (adjust_address (registers
, mode
, size
), tem
);
1194 size
+= GET_MODE_SIZE (mode
);
1197 /* Save the arg pointer to the block. */
1198 tem
= copy_to_reg (virtual_incoming_args_rtx
);
1199 #ifdef STACK_GROWS_DOWNWARD
1200 /* We need the pointer as the caller actually passed them to us, not
1201 as we might have pretended they were passed. Make sure it's a valid
1202 operand, as emit_move_insn isn't expected to handle a PLUS. */
1204 = force_operand (plus_constant (tem
, current_function_pretend_args_size
),
1207 emit_move_insn (adjust_address (registers
, Pmode
, 0), tem
);
1209 size
= GET_MODE_SIZE (Pmode
);
1211 /* Save the structure value address unless this is passed as an
1212 "invisible" first argument. */
1213 if (struct_incoming_value
)
1215 emit_move_insn (adjust_address (registers
, Pmode
, size
),
1216 copy_to_reg (struct_incoming_value
));
1217 size
+= GET_MODE_SIZE (Pmode
);
1220 /* Return the address of the block. */
1221 return copy_addr_to_reg (XEXP (registers
, 0));
1224 /* __builtin_apply_args returns block of memory allocated on
1225 the stack into which is stored the arg pointer, structure
1226 value address, static chain, and all the registers that might
1227 possibly be used in performing a function call. The code is
1228 moved to the start of the function so the incoming values are
1232 expand_builtin_apply_args (void)
1234 /* Don't do __builtin_apply_args more than once in a function.
1235 Save the result of the first call and reuse it. */
1236 if (apply_args_value
!= 0)
1237 return apply_args_value
;
1239 /* When this function is called, it means that registers must be
1240 saved on entry to this function. So we migrate the
1241 call to the first insn of this function. */
1246 temp
= expand_builtin_apply_args_1 ();
1250 apply_args_value
= temp
;
1252 /* Put the insns after the NOTE that starts the function.
1253 If this is inside a start_sequence, make the outer-level insn
1254 chain current, so the code is placed at the start of the
1256 push_topmost_sequence ();
1257 emit_insn_before (seq
, NEXT_INSN (entry_of_function ()));
1258 pop_topmost_sequence ();
1263 /* Perform an untyped call and save the state required to perform an
1264 untyped return of whatever value was returned by the given function. */
1267 expand_builtin_apply (rtx function
, rtx arguments
, rtx argsize
)
1269 int size
, align
, regno
;
1270 enum machine_mode mode
;
1271 rtx incoming_args
, result
, reg
, dest
, src
, call_insn
;
1272 rtx old_stack_level
= 0;
1273 rtx call_fusage
= 0;
1274 rtx struct_value
= targetm
.calls
.struct_value_rtx (cfun
? TREE_TYPE (cfun
->decl
) : 0, 0);
1276 arguments
= convert_memory_address (Pmode
, arguments
);
1278 /* Create a block where the return registers can be saved. */
1279 result
= assign_stack_local (BLKmode
, apply_result_size (), -1);
1281 /* Fetch the arg pointer from the ARGUMENTS block. */
1282 incoming_args
= gen_reg_rtx (Pmode
);
1283 emit_move_insn (incoming_args
, gen_rtx_MEM (Pmode
, arguments
));
1284 #ifndef STACK_GROWS_DOWNWARD
1285 incoming_args
= expand_simple_binop (Pmode
, MINUS
, incoming_args
, argsize
,
1286 incoming_args
, 0, OPTAB_LIB_WIDEN
);
1289 /* Push a new argument block and copy the arguments. Do not allow
1290 the (potential) memcpy call below to interfere with our stack
1292 do_pending_stack_adjust ();
1295 /* Save the stack with nonlocal if available. */
1296 #ifdef HAVE_save_stack_nonlocal
1297 if (HAVE_save_stack_nonlocal
)
1298 emit_stack_save (SAVE_NONLOCAL
, &old_stack_level
, NULL_RTX
);
1301 emit_stack_save (SAVE_BLOCK
, &old_stack_level
, NULL_RTX
);
1303 /* Allocate a block of memory onto the stack and copy the memory
1304 arguments to the outgoing arguments address. */
1305 allocate_dynamic_stack_space (argsize
, 0, BITS_PER_UNIT
);
1306 dest
= virtual_outgoing_args_rtx
;
1307 #ifndef STACK_GROWS_DOWNWARD
1308 if (GET_CODE (argsize
) == CONST_INT
)
1309 dest
= plus_constant (dest
, -INTVAL (argsize
));
1311 dest
= gen_rtx_PLUS (Pmode
, dest
, negate_rtx (Pmode
, argsize
));
1313 dest
= gen_rtx_MEM (BLKmode
, dest
);
1314 set_mem_align (dest
, PARM_BOUNDARY
);
1315 src
= gen_rtx_MEM (BLKmode
, incoming_args
);
1316 set_mem_align (src
, PARM_BOUNDARY
);
1317 emit_block_move (dest
, src
, argsize
, BLOCK_OP_NORMAL
);
1319 /* Refer to the argument block. */
1321 arguments
= gen_rtx_MEM (BLKmode
, arguments
);
1322 set_mem_align (arguments
, PARM_BOUNDARY
);
1324 /* Walk past the arg-pointer and structure value address. */
1325 size
= GET_MODE_SIZE (Pmode
);
1327 size
+= GET_MODE_SIZE (Pmode
);
1329 /* Restore each of the registers previously saved. Make USE insns
1330 for each of these registers for use in making the call. */
1331 for (regno
= 0; regno
< FIRST_PSEUDO_REGISTER
; regno
++)
1332 if ((mode
= apply_args_mode
[regno
]) != VOIDmode
)
1334 align
= GET_MODE_ALIGNMENT (mode
) / BITS_PER_UNIT
;
1335 if (size
% align
!= 0)
1336 size
= CEIL (size
, align
) * align
;
1337 reg
= gen_rtx_REG (mode
, regno
);
1338 emit_move_insn (reg
, adjust_address (arguments
, mode
, size
));
1339 use_reg (&call_fusage
, reg
);
1340 size
+= GET_MODE_SIZE (mode
);
1343 /* Restore the structure value address unless this is passed as an
1344 "invisible" first argument. */
1345 size
= GET_MODE_SIZE (Pmode
);
1348 rtx value
= gen_reg_rtx (Pmode
);
1349 emit_move_insn (value
, adjust_address (arguments
, Pmode
, size
));
1350 emit_move_insn (struct_value
, value
);
1351 if (REG_P (struct_value
))
1352 use_reg (&call_fusage
, struct_value
);
1353 size
+= GET_MODE_SIZE (Pmode
);
1356 /* All arguments and registers used for the call are set up by now! */
1357 function
= prepare_call_address (function
, NULL
, &call_fusage
, 0, 0);
1359 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1360 and we don't want to load it into a register as an optimization,
1361 because prepare_call_address already did it if it should be done. */
1362 if (GET_CODE (function
) != SYMBOL_REF
)
1363 function
= memory_address (FUNCTION_MODE
, function
);
1365 /* Generate the actual call instruction and save the return value. */
1366 #ifdef HAVE_untyped_call
1367 if (HAVE_untyped_call
)
1368 emit_call_insn (gen_untyped_call (gen_rtx_MEM (FUNCTION_MODE
, function
),
1369 result
, result_vector (1, result
)));
1372 #ifdef HAVE_call_value
1373 if (HAVE_call_value
)
1377 /* Locate the unique return register. It is not possible to
1378 express a call that sets more than one return register using
1379 call_value; use untyped_call for that. In fact, untyped_call
1380 only needs to save the return registers in the given block. */
1381 for (regno
= 0; regno
< FIRST_PSEUDO_REGISTER
; regno
++)
1382 if ((mode
= apply_result_mode
[regno
]) != VOIDmode
)
1384 gcc_assert (!valreg
); /* HAVE_untyped_call required. */
1386 valreg
= gen_rtx_REG (mode
, regno
);
1389 emit_call_insn (GEN_CALL_VALUE (valreg
,
1390 gen_rtx_MEM (FUNCTION_MODE
, function
),
1391 const0_rtx
, NULL_RTX
, const0_rtx
));
1393 emit_move_insn (adjust_address (result
, GET_MODE (valreg
), 0), valreg
);
1399 /* Find the CALL insn we just emitted, and attach the register usage
1401 call_insn
= last_call_insn ();
1402 add_function_usage_to (call_insn
, call_fusage
);
1404 /* Restore the stack. */
1405 #ifdef HAVE_save_stack_nonlocal
1406 if (HAVE_save_stack_nonlocal
)
1407 emit_stack_restore (SAVE_NONLOCAL
, old_stack_level
, NULL_RTX
);
1410 emit_stack_restore (SAVE_BLOCK
, old_stack_level
, NULL_RTX
);
1414 /* Return the address of the result block. */
1415 result
= copy_addr_to_reg (XEXP (result
, 0));
1416 return convert_memory_address (ptr_mode
, result
);
1419 /* Perform an untyped return. */
1422 expand_builtin_return (rtx result
)
1424 int size
, align
, regno
;
1425 enum machine_mode mode
;
1427 rtx call_fusage
= 0;
1429 result
= convert_memory_address (Pmode
, result
);
1431 apply_result_size ();
1432 result
= gen_rtx_MEM (BLKmode
, result
);
1434 #ifdef HAVE_untyped_return
1435 if (HAVE_untyped_return
)
1437 emit_jump_insn (gen_untyped_return (result
, result_vector (0, result
)));
1443 /* Restore the return value and note that each value is used. */
1445 for (regno
= 0; regno
< FIRST_PSEUDO_REGISTER
; regno
++)
1446 if ((mode
= apply_result_mode
[regno
]) != VOIDmode
)
1448 align
= GET_MODE_ALIGNMENT (mode
) / BITS_PER_UNIT
;
1449 if (size
% align
!= 0)
1450 size
= CEIL (size
, align
) * align
;
1451 reg
= gen_rtx_REG (mode
, INCOMING_REGNO (regno
));
1452 emit_move_insn (reg
, adjust_address (result
, mode
, size
));
1454 push_to_sequence (call_fusage
);
1455 emit_insn (gen_rtx_USE (VOIDmode
, reg
));
1456 call_fusage
= get_insns ();
1458 size
+= GET_MODE_SIZE (mode
);
1461 /* Put the USE insns before the return. */
1462 emit_insn (call_fusage
);
1464 /* Return whatever values was restored by jumping directly to the end
1466 expand_naked_return ();
1469 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1471 static enum type_class
1472 type_to_class (tree type
)
1474 switch (TREE_CODE (type
))
1476 case VOID_TYPE
: return void_type_class
;
1477 case INTEGER_TYPE
: return integer_type_class
;
1478 case CHAR_TYPE
: return char_type_class
;
1479 case ENUMERAL_TYPE
: return enumeral_type_class
;
1480 case BOOLEAN_TYPE
: return boolean_type_class
;
1481 case POINTER_TYPE
: return pointer_type_class
;
1482 case REFERENCE_TYPE
: return reference_type_class
;
1483 case OFFSET_TYPE
: return offset_type_class
;
1484 case REAL_TYPE
: return real_type_class
;
1485 case COMPLEX_TYPE
: return complex_type_class
;
1486 case FUNCTION_TYPE
: return function_type_class
;
1487 case METHOD_TYPE
: return method_type_class
;
1488 case RECORD_TYPE
: return record_type_class
;
1490 case QUAL_UNION_TYPE
: return union_type_class
;
1491 case ARRAY_TYPE
: return (TYPE_STRING_FLAG (type
)
1492 ? string_type_class
: array_type_class
);
1493 case LANG_TYPE
: return lang_type_class
;
1494 default: return no_type_class
;
1498 /* Expand a call to __builtin_classify_type with arguments found in
1502 expand_builtin_classify_type (tree arglist
)
1505 return GEN_INT (type_to_class (TREE_TYPE (TREE_VALUE (arglist
))));
1506 return GEN_INT (no_type_class
);
1509 /* This helper macro, meant to be used in mathfn_built_in below,
1510 determines which among a set of three builtin math functions is
1511 appropriate for a given type mode. The `F' and `L' cases are
1512 automatically generated from the `double' case. */
1513 #define CASE_MATHFN(BUILT_IN_MATHFN) \
1514 case BUILT_IN_MATHFN: case BUILT_IN_MATHFN##F: case BUILT_IN_MATHFN##L: \
1515 fcode = BUILT_IN_MATHFN; fcodef = BUILT_IN_MATHFN##F ; \
1516 fcodel = BUILT_IN_MATHFN##L ; break;
1518 /* Return mathematic function equivalent to FN but operating directly
1519 on TYPE, if available. If we can't do the conversion, return zero. */
1521 mathfn_built_in (tree type
, enum built_in_function fn
)
1523 enum built_in_function fcode
, fcodef
, fcodel
;
1527 CASE_MATHFN (BUILT_IN_ACOS
)
1528 CASE_MATHFN (BUILT_IN_ACOSH
)
1529 CASE_MATHFN (BUILT_IN_ASIN
)
1530 CASE_MATHFN (BUILT_IN_ASINH
)
1531 CASE_MATHFN (BUILT_IN_ATAN
)
1532 CASE_MATHFN (BUILT_IN_ATAN2
)
1533 CASE_MATHFN (BUILT_IN_ATANH
)
1534 CASE_MATHFN (BUILT_IN_CBRT
)
1535 CASE_MATHFN (BUILT_IN_CEIL
)
1536 CASE_MATHFN (BUILT_IN_COPYSIGN
)
1537 CASE_MATHFN (BUILT_IN_COS
)
1538 CASE_MATHFN (BUILT_IN_COSH
)
1539 CASE_MATHFN (BUILT_IN_DREM
)
1540 CASE_MATHFN (BUILT_IN_ERF
)
1541 CASE_MATHFN (BUILT_IN_ERFC
)
1542 CASE_MATHFN (BUILT_IN_EXP
)
1543 CASE_MATHFN (BUILT_IN_EXP10
)
1544 CASE_MATHFN (BUILT_IN_EXP2
)
1545 CASE_MATHFN (BUILT_IN_EXPM1
)
1546 CASE_MATHFN (BUILT_IN_FABS
)
1547 CASE_MATHFN (BUILT_IN_FDIM
)
1548 CASE_MATHFN (BUILT_IN_FLOOR
)
1549 CASE_MATHFN (BUILT_IN_FMA
)
1550 CASE_MATHFN (BUILT_IN_FMAX
)
1551 CASE_MATHFN (BUILT_IN_FMIN
)
1552 CASE_MATHFN (BUILT_IN_FMOD
)
1553 CASE_MATHFN (BUILT_IN_FREXP
)
1554 CASE_MATHFN (BUILT_IN_GAMMA
)
1555 CASE_MATHFN (BUILT_IN_HUGE_VAL
)
1556 CASE_MATHFN (BUILT_IN_HYPOT
)
1557 CASE_MATHFN (BUILT_IN_ILOGB
)
1558 CASE_MATHFN (BUILT_IN_INF
)
1559 CASE_MATHFN (BUILT_IN_J0
)
1560 CASE_MATHFN (BUILT_IN_J1
)
1561 CASE_MATHFN (BUILT_IN_JN
)
1562 CASE_MATHFN (BUILT_IN_LCEIL
)
1563 CASE_MATHFN (BUILT_IN_LDEXP
)
1564 CASE_MATHFN (BUILT_IN_LFLOOR
)
1565 CASE_MATHFN (BUILT_IN_LGAMMA
)
1566 CASE_MATHFN (BUILT_IN_LLCEIL
)
1567 CASE_MATHFN (BUILT_IN_LLFLOOR
)
1568 CASE_MATHFN (BUILT_IN_LLRINT
)
1569 CASE_MATHFN (BUILT_IN_LLROUND
)
1570 CASE_MATHFN (BUILT_IN_LOG
)
1571 CASE_MATHFN (BUILT_IN_LOG10
)
1572 CASE_MATHFN (BUILT_IN_LOG1P
)
1573 CASE_MATHFN (BUILT_IN_LOG2
)
1574 CASE_MATHFN (BUILT_IN_LOGB
)
1575 CASE_MATHFN (BUILT_IN_LRINT
)
1576 CASE_MATHFN (BUILT_IN_LROUND
)
1577 CASE_MATHFN (BUILT_IN_MODF
)
1578 CASE_MATHFN (BUILT_IN_NAN
)
1579 CASE_MATHFN (BUILT_IN_NANS
)
1580 CASE_MATHFN (BUILT_IN_NEARBYINT
)
1581 CASE_MATHFN (BUILT_IN_NEXTAFTER
)
1582 CASE_MATHFN (BUILT_IN_NEXTTOWARD
)
1583 CASE_MATHFN (BUILT_IN_POW
)
1584 CASE_MATHFN (BUILT_IN_POWI
)
1585 CASE_MATHFN (BUILT_IN_POW10
)
1586 CASE_MATHFN (BUILT_IN_REMAINDER
)
1587 CASE_MATHFN (BUILT_IN_REMQUO
)
1588 CASE_MATHFN (BUILT_IN_RINT
)
1589 CASE_MATHFN (BUILT_IN_ROUND
)
1590 CASE_MATHFN (BUILT_IN_SCALB
)
1591 CASE_MATHFN (BUILT_IN_SCALBLN
)
1592 CASE_MATHFN (BUILT_IN_SCALBN
)
1593 CASE_MATHFN (BUILT_IN_SIGNIFICAND
)
1594 CASE_MATHFN (BUILT_IN_SIN
)
1595 CASE_MATHFN (BUILT_IN_SINCOS
)
1596 CASE_MATHFN (BUILT_IN_SINH
)
1597 CASE_MATHFN (BUILT_IN_SQRT
)
1598 CASE_MATHFN (BUILT_IN_TAN
)
1599 CASE_MATHFN (BUILT_IN_TANH
)
1600 CASE_MATHFN (BUILT_IN_TGAMMA
)
1601 CASE_MATHFN (BUILT_IN_TRUNC
)
1602 CASE_MATHFN (BUILT_IN_Y0
)
1603 CASE_MATHFN (BUILT_IN_Y1
)
1604 CASE_MATHFN (BUILT_IN_YN
)
1610 if (TYPE_MAIN_VARIANT (type
) == double_type_node
)
1611 return implicit_built_in_decls
[fcode
];
1612 else if (TYPE_MAIN_VARIANT (type
) == float_type_node
)
1613 return implicit_built_in_decls
[fcodef
];
1614 else if (TYPE_MAIN_VARIANT (type
) == long_double_type_node
)
1615 return implicit_built_in_decls
[fcodel
];
1620 /* If errno must be maintained, expand the RTL to check if the result,
1621 TARGET, of a built-in function call, EXP, is NaN, and if so set
1625 expand_errno_check (tree exp
, rtx target
)
1627 rtx lab
= gen_label_rtx ();
1629 /* Test the result; if it is NaN, set errno=EDOM because
1630 the argument was not in the domain. */
1631 emit_cmp_and_jump_insns (target
, target
, EQ
, 0, GET_MODE (target
),
1635 /* If this built-in doesn't throw an exception, set errno directly. */
1636 if (TREE_NOTHROW (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0)))
1638 #ifdef GEN_ERRNO_RTX
1639 rtx errno_rtx
= GEN_ERRNO_RTX
;
1642 = gen_rtx_MEM (word_mode
, gen_rtx_SYMBOL_REF (Pmode
, "errno"));
1644 emit_move_insn (errno_rtx
, GEN_INT (TARGET_EDOM
));
1650 /* We can't set errno=EDOM directly; let the library call do it.
1651 Pop the arguments right away in case the call gets deleted. */
1653 expand_call (exp
, target
, 0);
1659 /* Expand a call to one of the builtin math functions (sqrt, exp, or log).
1660 Return 0 if a normal call should be emitted rather than expanding the
1661 function in-line. EXP is the expression that is a call to the builtin
1662 function; if convenient, the result should be placed in TARGET.
1663 SUBTARGET may be used as the target for computing one of EXP's operands. */
1666 expand_builtin_mathfn (tree exp
, rtx target
, rtx subtarget
)
1668 optab builtin_optab
;
1669 rtx op0
, insns
, before_call
;
1670 tree fndecl
= get_callee_fndecl (exp
);
1671 tree arglist
= TREE_OPERAND (exp
, 1);
1672 enum machine_mode mode
;
1673 bool errno_set
= false;
1676 if (!validate_arglist (arglist
, REAL_TYPE
, VOID_TYPE
))
1679 arg
= TREE_VALUE (arglist
);
1681 switch (DECL_FUNCTION_CODE (fndecl
))
1684 case BUILT_IN_SQRTF
:
1685 case BUILT_IN_SQRTL
:
1686 errno_set
= ! tree_expr_nonnegative_p (arg
);
1687 builtin_optab
= sqrt_optab
;
1692 errno_set
= true; builtin_optab
= exp_optab
; break;
1693 case BUILT_IN_EXP10
:
1694 case BUILT_IN_EXP10F
:
1695 case BUILT_IN_EXP10L
:
1696 case BUILT_IN_POW10
:
1697 case BUILT_IN_POW10F
:
1698 case BUILT_IN_POW10L
:
1699 errno_set
= true; builtin_optab
= exp10_optab
; break;
1701 case BUILT_IN_EXP2F
:
1702 case BUILT_IN_EXP2L
:
1703 errno_set
= true; builtin_optab
= exp2_optab
; break;
1704 case BUILT_IN_EXPM1
:
1705 case BUILT_IN_EXPM1F
:
1706 case BUILT_IN_EXPM1L
:
1707 errno_set
= true; builtin_optab
= expm1_optab
; break;
1709 case BUILT_IN_LOGBF
:
1710 case BUILT_IN_LOGBL
:
1711 errno_set
= true; builtin_optab
= logb_optab
; break;
1712 case BUILT_IN_ILOGB
:
1713 case BUILT_IN_ILOGBF
:
1714 case BUILT_IN_ILOGBL
:
1715 errno_set
= true; builtin_optab
= ilogb_optab
; break;
1719 errno_set
= true; builtin_optab
= log_optab
; break;
1720 case BUILT_IN_LOG10
:
1721 case BUILT_IN_LOG10F
:
1722 case BUILT_IN_LOG10L
:
1723 errno_set
= true; builtin_optab
= log10_optab
; break;
1725 case BUILT_IN_LOG2F
:
1726 case BUILT_IN_LOG2L
:
1727 errno_set
= true; builtin_optab
= log2_optab
; break;
1728 case BUILT_IN_LOG1P
:
1729 case BUILT_IN_LOG1PF
:
1730 case BUILT_IN_LOG1PL
:
1731 errno_set
= true; builtin_optab
= log1p_optab
; break;
1733 case BUILT_IN_ASINF
:
1734 case BUILT_IN_ASINL
:
1735 builtin_optab
= asin_optab
; break;
1737 case BUILT_IN_ACOSF
:
1738 case BUILT_IN_ACOSL
:
1739 builtin_optab
= acos_optab
; break;
1743 builtin_optab
= tan_optab
; break;
1745 case BUILT_IN_ATANF
:
1746 case BUILT_IN_ATANL
:
1747 builtin_optab
= atan_optab
; break;
1748 case BUILT_IN_FLOOR
:
1749 case BUILT_IN_FLOORF
:
1750 case BUILT_IN_FLOORL
:
1751 builtin_optab
= floor_optab
; break;
1753 case BUILT_IN_CEILF
:
1754 case BUILT_IN_CEILL
:
1755 builtin_optab
= ceil_optab
; break;
1756 case BUILT_IN_TRUNC
:
1757 case BUILT_IN_TRUNCF
:
1758 case BUILT_IN_TRUNCL
:
1759 builtin_optab
= btrunc_optab
; break;
1760 case BUILT_IN_ROUND
:
1761 case BUILT_IN_ROUNDF
:
1762 case BUILT_IN_ROUNDL
:
1763 builtin_optab
= round_optab
; break;
1764 case BUILT_IN_NEARBYINT
:
1765 case BUILT_IN_NEARBYINTF
:
1766 case BUILT_IN_NEARBYINTL
:
1767 builtin_optab
= nearbyint_optab
; break;
1769 case BUILT_IN_RINTF
:
1770 case BUILT_IN_RINTL
:
1771 builtin_optab
= rint_optab
; break;
1772 case BUILT_IN_LRINT
:
1773 case BUILT_IN_LRINTF
:
1774 case BUILT_IN_LRINTL
:
1775 case BUILT_IN_LLRINT
:
1776 case BUILT_IN_LLRINTF
:
1777 case BUILT_IN_LLRINTL
:
1778 builtin_optab
= lrint_optab
; break;
1783 /* Make a suitable register to place result in. */
1784 mode
= TYPE_MODE (TREE_TYPE (exp
));
1786 if (! flag_errno_math
|| ! HONOR_NANS (mode
))
1789 /* Before working hard, check whether the instruction is available. */
1790 if (builtin_optab
->handlers
[(int) mode
].insn_code
!= CODE_FOR_nothing
)
1792 target
= gen_reg_rtx (mode
);
1794 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
1795 need to expand the argument again. This way, we will not perform
1796 side-effects more the once. */
1797 narg
= builtin_save_expr (arg
);
1801 arglist
= build_tree_list (NULL_TREE
, arg
);
1802 exp
= build_function_call_expr (fndecl
, arglist
);
1805 op0
= expand_expr (arg
, subtarget
, VOIDmode
, 0);
1809 /* Compute into TARGET.
1810 Set TARGET to wherever the result comes back. */
1811 target
= expand_unop (mode
, builtin_optab
, op0
, target
, 0);
1816 expand_errno_check (exp
, target
);
1818 /* Output the entire sequence. */
1819 insns
= get_insns ();
1825 /* If we were unable to expand via the builtin, stop the sequence
1826 (without outputting the insns) and call to the library function
1827 with the stabilized argument list. */
1831 before_call
= get_last_insn ();
1833 target
= expand_call (exp
, target
, target
== const0_rtx
);
1835 /* If this is a sqrt operation and we don't care about errno, try to
1836 attach a REG_EQUAL note with a SQRT rtx to the emitted libcall.
1837 This allows the semantics of the libcall to be visible to the RTL
1839 if (builtin_optab
== sqrt_optab
&& !errno_set
)
1841 /* Search backwards through the insns emitted by expand_call looking
1842 for the instruction with the REG_RETVAL note. */
1843 rtx last
= get_last_insn ();
1844 while (last
!= before_call
)
1846 if (find_reg_note (last
, REG_RETVAL
, NULL
))
1848 rtx note
= find_reg_note (last
, REG_EQUAL
, NULL
);
1849 /* Check that the REQ_EQUAL note is an EXPR_LIST with
1850 two elements, i.e. symbol_ref(sqrt) and the operand. */
1852 && GET_CODE (note
) == EXPR_LIST
1853 && GET_CODE (XEXP (note
, 0)) == EXPR_LIST
1854 && XEXP (XEXP (note
, 0), 1) != NULL_RTX
1855 && XEXP (XEXP (XEXP (note
, 0), 1), 1) == NULL_RTX
)
1857 rtx operand
= XEXP (XEXP (XEXP (note
, 0), 1), 0);
1858 /* Check operand is a register with expected mode. */
1861 && GET_MODE (operand
) == mode
)
1863 /* Replace the REG_EQUAL note with a SQRT rtx. */
1864 rtx equiv
= gen_rtx_SQRT (mode
, operand
);
1865 set_unique_reg_note (last
, REG_EQUAL
, equiv
);
1870 last
= PREV_INSN (last
);
1877 /* Expand a call to the builtin binary math functions (pow and atan2).
1878 Return 0 if a normal call should be emitted rather than expanding the
1879 function in-line. EXP is the expression that is a call to the builtin
1880 function; if convenient, the result should be placed in TARGET.
1881 SUBTARGET may be used as the target for computing one of EXP's
1885 expand_builtin_mathfn_2 (tree exp
, rtx target
, rtx subtarget
)
1887 optab builtin_optab
;
1888 rtx op0
, op1
, insns
;
1889 int op1_type
= REAL_TYPE
;
1890 tree fndecl
= get_callee_fndecl (exp
);
1891 tree arglist
= TREE_OPERAND (exp
, 1);
1892 tree arg0
, arg1
, temp
, narg
;
1893 enum machine_mode mode
;
1894 bool errno_set
= true;
1897 if ((DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_LDEXP
)
1898 || (DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_LDEXPF
)
1899 || (DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_LDEXPL
))
1900 op1_type
= INTEGER_TYPE
;
1902 if (!validate_arglist (arglist
, REAL_TYPE
, op1_type
, VOID_TYPE
))
1905 arg0
= TREE_VALUE (arglist
);
1906 arg1
= TREE_VALUE (TREE_CHAIN (arglist
));
1908 switch (DECL_FUNCTION_CODE (fndecl
))
1913 builtin_optab
= pow_optab
; break;
1914 case BUILT_IN_ATAN2
:
1915 case BUILT_IN_ATAN2F
:
1916 case BUILT_IN_ATAN2L
:
1917 builtin_optab
= atan2_optab
; break;
1918 case BUILT_IN_LDEXP
:
1919 case BUILT_IN_LDEXPF
:
1920 case BUILT_IN_LDEXPL
:
1921 builtin_optab
= ldexp_optab
; break;
1923 case BUILT_IN_FMODF
:
1924 case BUILT_IN_FMODL
:
1925 builtin_optab
= fmod_optab
; break;
1927 case BUILT_IN_DREMF
:
1928 case BUILT_IN_DREML
:
1929 builtin_optab
= drem_optab
; break;
1934 /* Make a suitable register to place result in. */
1935 mode
= TYPE_MODE (TREE_TYPE (exp
));
1937 /* Before working hard, check whether the instruction is available. */
1938 if (builtin_optab
->handlers
[(int) mode
].insn_code
== CODE_FOR_nothing
)
1941 target
= gen_reg_rtx (mode
);
1943 if (! flag_errno_math
|| ! HONOR_NANS (mode
))
1946 /* Always stabilize the argument list. */
1947 narg
= builtin_save_expr (arg1
);
1951 temp
= build_tree_list (NULL_TREE
, narg
);
1955 temp
= TREE_CHAIN (arglist
);
1957 narg
= builtin_save_expr (arg0
);
1961 arglist
= tree_cons (NULL_TREE
, narg
, temp
);
1965 arglist
= tree_cons (NULL_TREE
, arg0
, temp
);
1968 exp
= build_function_call_expr (fndecl
, arglist
);
1970 op0
= expand_expr (arg0
, subtarget
, VOIDmode
, 0);
1971 op1
= expand_expr (arg1
, 0, VOIDmode
, 0);
1975 /* Compute into TARGET.
1976 Set TARGET to wherever the result comes back. */
1977 target
= expand_binop (mode
, builtin_optab
, op0
, op1
,
1978 target
, 0, OPTAB_DIRECT
);
1980 /* If we were unable to expand via the builtin, stop the sequence
1981 (without outputting the insns) and call to the library function
1982 with the stabilized argument list. */
1986 return expand_call (exp
, target
, target
== const0_rtx
);
1990 expand_errno_check (exp
, target
);
1992 /* Output the entire sequence. */
1993 insns
= get_insns ();
2000 /* Expand a call to the builtin sin and cos math functions.
2001 Return 0 if a normal call should be emitted rather than expanding the
2002 function in-line. EXP is the expression that is a call to the builtin
2003 function; if convenient, the result should be placed in TARGET.
2004 SUBTARGET may be used as the target for computing one of EXP's
2008 expand_builtin_mathfn_3 (tree exp
, rtx target
, rtx subtarget
)
2010 optab builtin_optab
;
2012 tree fndecl
= get_callee_fndecl (exp
);
2013 tree arglist
= TREE_OPERAND (exp
, 1);
2014 enum machine_mode mode
;
2015 bool errno_set
= false;
2018 if (!validate_arglist (arglist
, REAL_TYPE
, VOID_TYPE
))
2021 arg
= TREE_VALUE (arglist
);
2023 switch (DECL_FUNCTION_CODE (fndecl
))
2031 builtin_optab
= sincos_optab
; break;
2036 /* Make a suitable register to place result in. */
2037 mode
= TYPE_MODE (TREE_TYPE (exp
));
2039 if (! flag_errno_math
|| ! HONOR_NANS (mode
))
2042 /* Check if sincos insn is available, otherwise fallback
2043 to sin or cos insn. */
2044 if (builtin_optab
->handlers
[(int) mode
].insn_code
== CODE_FOR_nothing
) {
2045 switch (DECL_FUNCTION_CODE (fndecl
))
2050 builtin_optab
= sin_optab
; break;
2054 builtin_optab
= cos_optab
; break;
2060 /* Before working hard, check whether the instruction is available. */
2061 if (builtin_optab
->handlers
[(int) mode
].insn_code
!= CODE_FOR_nothing
)
2063 target
= gen_reg_rtx (mode
);
2065 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2066 need to expand the argument again. This way, we will not perform
2067 side-effects more the once. */
2068 narg
= save_expr (arg
);
2072 arglist
= build_tree_list (NULL_TREE
, arg
);
2073 exp
= build_function_call_expr (fndecl
, arglist
);
2076 op0
= expand_expr (arg
, subtarget
, VOIDmode
, 0);
2080 /* Compute into TARGET.
2081 Set TARGET to wherever the result comes back. */
2082 if (builtin_optab
== sincos_optab
)
2086 switch (DECL_FUNCTION_CODE (fndecl
))
2091 result
= expand_twoval_unop (builtin_optab
, op0
, 0, target
, 0);
2096 result
= expand_twoval_unop (builtin_optab
, op0
, target
, 0, 0);
2101 gcc_assert (result
);
2105 target
= expand_unop (mode
, builtin_optab
, op0
, target
, 0);
2111 expand_errno_check (exp
, target
);
2113 /* Output the entire sequence. */
2114 insns
= get_insns ();
2120 /* If we were unable to expand via the builtin, stop the sequence
2121 (without outputting the insns) and call to the library function
2122 with the stabilized argument list. */
2126 target
= expand_call (exp
, target
, target
== const0_rtx
);
2131 /* Expand a call to one of the builtin rounding functions (lfloor).
2132 If expanding via optab fails, lower expression to (int)(floor(x)).
2133 EXP is the expression that is a call to the builtin function;
2134 if convenient, the result should be placed in TARGET. SUBTARGET may
2135 be used as the target for computing one of EXP's operands. */
2138 expand_builtin_int_roundingfn (tree exp
, rtx target
, rtx subtarget
)
2140 optab builtin_optab
;
2141 rtx op0
, insns
, tmp
;
2142 tree fndecl
= get_callee_fndecl (exp
);
2143 tree arglist
= TREE_OPERAND (exp
, 1);
2144 enum built_in_function fallback_fn
;
2145 tree fallback_fndecl
;
2146 enum machine_mode mode
;
2149 if (!validate_arglist (arglist
, REAL_TYPE
, VOID_TYPE
))
2152 arg
= TREE_VALUE (arglist
);
2154 switch (DECL_FUNCTION_CODE (fndecl
))
2156 case BUILT_IN_LCEIL
:
2157 case BUILT_IN_LCEILF
:
2158 case BUILT_IN_LCEILL
:
2159 case BUILT_IN_LLCEIL
:
2160 case BUILT_IN_LLCEILF
:
2161 case BUILT_IN_LLCEILL
:
2162 builtin_optab
= lceil_optab
;
2163 fallback_fn
= BUILT_IN_CEIL
;
2166 case BUILT_IN_LFLOOR
:
2167 case BUILT_IN_LFLOORF
:
2168 case BUILT_IN_LFLOORL
:
2169 case BUILT_IN_LLFLOOR
:
2170 case BUILT_IN_LLFLOORF
:
2171 case BUILT_IN_LLFLOORL
:
2172 builtin_optab
= lfloor_optab
;
2173 fallback_fn
= BUILT_IN_FLOOR
;
2180 /* Make a suitable register to place result in. */
2181 mode
= TYPE_MODE (TREE_TYPE (exp
));
2183 /* Before working hard, check whether the instruction is available. */
2184 if (builtin_optab
->handlers
[(int) mode
].insn_code
!= CODE_FOR_nothing
)
2186 target
= gen_reg_rtx (mode
);
2188 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2189 need to expand the argument again. This way, we will not perform
2190 side-effects more the once. */
2191 narg
= builtin_save_expr (arg
);
2195 arglist
= build_tree_list (NULL_TREE
, arg
);
2196 exp
= build_function_call_expr (fndecl
, arglist
);
2199 op0
= expand_expr (arg
, subtarget
, VOIDmode
, 0);
2203 /* Compute into TARGET.
2204 Set TARGET to wherever the result comes back. */
2205 target
= expand_unop (mode
, builtin_optab
, op0
, target
, 0);
2209 /* Output the entire sequence. */
2210 insns
= get_insns ();
2216 /* If we were unable to expand via the builtin, stop the sequence
2217 (without outputting the insns). */
2221 /* Fall back to floating point rounding optab. */
2222 fallback_fndecl
= mathfn_built_in (TREE_TYPE (arg
), fallback_fn
);
2223 /* We shouldn't get here on targets without TARGET_C99_FUNCTIONS.
2224 ??? Perhaps convert (int)floorf(x) into (int)floor((double)x). */
2225 gcc_assert (fallback_fndecl
!= NULL_TREE
);
2226 exp
= build_function_call_expr (fallback_fndecl
, arglist
);
2228 tmp
= expand_builtin_mathfn (exp
, NULL_RTX
, NULL_RTX
);
2230 /* Truncate the result of floating point optab to integer
2231 via expand_fix (). */
2232 target
= gen_reg_rtx (mode
);
2233 expand_fix (target
, tmp
, 0);
2238 /* To evaluate powi(x,n), the floating point value x raised to the
2239 constant integer exponent n, we use a hybrid algorithm that
2240 combines the "window method" with look-up tables. For an
2241 introduction to exponentiation algorithms and "addition chains",
2242 see section 4.6.3, "Evaluation of Powers" of Donald E. Knuth,
2243 "Seminumerical Algorithms", Vol. 2, "The Art of Computer Programming",
2244 3rd Edition, 1998, and Daniel M. Gordon, "A Survey of Fast Exponentiation
2245 Methods", Journal of Algorithms, Vol. 27, pp. 129-146, 1998. */
2247 /* Provide a default value for POWI_MAX_MULTS, the maximum number of
2248 multiplications to inline before calling the system library's pow
2249 function. powi(x,n) requires at worst 2*bits(n)-2 multiplications,
2250 so this default never requires calling pow, powf or powl. */
2252 #ifndef POWI_MAX_MULTS
2253 #define POWI_MAX_MULTS (2*HOST_BITS_PER_WIDE_INT-2)
2256 /* The size of the "optimal power tree" lookup table. All
2257 exponents less than this value are simply looked up in the
2258 powi_table below. This threshold is also used to size the
2259 cache of pseudo registers that hold intermediate results. */
2260 #define POWI_TABLE_SIZE 256
2262 /* The size, in bits of the window, used in the "window method"
2263 exponentiation algorithm. This is equivalent to a radix of
2264 (1<<POWI_WINDOW_SIZE) in the corresponding "m-ary method". */
2265 #define POWI_WINDOW_SIZE 3
2267 /* The following table is an efficient representation of an
2268 "optimal power tree". For each value, i, the corresponding
2269 value, j, in the table states than an optimal evaluation
2270 sequence for calculating pow(x,i) can be found by evaluating
2271 pow(x,j)*pow(x,i-j). An optimal power tree for the first
2272 100 integers is given in Knuth's "Seminumerical algorithms". */
2274 static const unsigned char powi_table
[POWI_TABLE_SIZE
] =
2276 0, 1, 1, 2, 2, 3, 3, 4, /* 0 - 7 */
2277 4, 6, 5, 6, 6, 10, 7, 9, /* 8 - 15 */
2278 8, 16, 9, 16, 10, 12, 11, 13, /* 16 - 23 */
2279 12, 17, 13, 18, 14, 24, 15, 26, /* 24 - 31 */
2280 16, 17, 17, 19, 18, 33, 19, 26, /* 32 - 39 */
2281 20, 25, 21, 40, 22, 27, 23, 44, /* 40 - 47 */
2282 24, 32, 25, 34, 26, 29, 27, 44, /* 48 - 55 */
2283 28, 31, 29, 34, 30, 60, 31, 36, /* 56 - 63 */
2284 32, 64, 33, 34, 34, 46, 35, 37, /* 64 - 71 */
2285 36, 65, 37, 50, 38, 48, 39, 69, /* 72 - 79 */
2286 40, 49, 41, 43, 42, 51, 43, 58, /* 80 - 87 */
2287 44, 64, 45, 47, 46, 59, 47, 76, /* 88 - 95 */
2288 48, 65, 49, 66, 50, 67, 51, 66, /* 96 - 103 */
2289 52, 70, 53, 74, 54, 104, 55, 74, /* 104 - 111 */
2290 56, 64, 57, 69, 58, 78, 59, 68, /* 112 - 119 */
2291 60, 61, 61, 80, 62, 75, 63, 68, /* 120 - 127 */
2292 64, 65, 65, 128, 66, 129, 67, 90, /* 128 - 135 */
2293 68, 73, 69, 131, 70, 94, 71, 88, /* 136 - 143 */
2294 72, 128, 73, 98, 74, 132, 75, 121, /* 144 - 151 */
2295 76, 102, 77, 124, 78, 132, 79, 106, /* 152 - 159 */
2296 80, 97, 81, 160, 82, 99, 83, 134, /* 160 - 167 */
2297 84, 86, 85, 95, 86, 160, 87, 100, /* 168 - 175 */
2298 88, 113, 89, 98, 90, 107, 91, 122, /* 176 - 183 */
2299 92, 111, 93, 102, 94, 126, 95, 150, /* 184 - 191 */
2300 96, 128, 97, 130, 98, 133, 99, 195, /* 192 - 199 */
2301 100, 128, 101, 123, 102, 164, 103, 138, /* 200 - 207 */
2302 104, 145, 105, 146, 106, 109, 107, 149, /* 208 - 215 */
2303 108, 200, 109, 146, 110, 170, 111, 157, /* 216 - 223 */
2304 112, 128, 113, 130, 114, 182, 115, 132, /* 224 - 231 */
2305 116, 200, 117, 132, 118, 158, 119, 206, /* 232 - 239 */
2306 120, 240, 121, 162, 122, 147, 123, 152, /* 240 - 247 */
2307 124, 166, 125, 214, 126, 138, 127, 153, /* 248 - 255 */
2311 /* Return the number of multiplications required to calculate
2312 powi(x,n) where n is less than POWI_TABLE_SIZE. This is a
2313 subroutine of powi_cost. CACHE is an array indicating
2314 which exponents have already been calculated. */
2317 powi_lookup_cost (unsigned HOST_WIDE_INT n
, bool *cache
)
2319 /* If we've already calculated this exponent, then this evaluation
2320 doesn't require any additional multiplications. */
2325 return powi_lookup_cost (n
- powi_table
[n
], cache
)
2326 + powi_lookup_cost (powi_table
[n
], cache
) + 1;
2329 /* Return the number of multiplications required to calculate
2330 powi(x,n) for an arbitrary x, given the exponent N. This
2331 function needs to be kept in sync with expand_powi below. */
2334 powi_cost (HOST_WIDE_INT n
)
2336 bool cache
[POWI_TABLE_SIZE
];
2337 unsigned HOST_WIDE_INT digit
;
2338 unsigned HOST_WIDE_INT val
;
2344 /* Ignore the reciprocal when calculating the cost. */
2345 val
= (n
< 0) ? -n
: n
;
2347 /* Initialize the exponent cache. */
2348 memset (cache
, 0, POWI_TABLE_SIZE
* sizeof (bool));
2353 while (val
>= POWI_TABLE_SIZE
)
2357 digit
= val
& ((1 << POWI_WINDOW_SIZE
) - 1);
2358 result
+= powi_lookup_cost (digit
, cache
)
2359 + POWI_WINDOW_SIZE
+ 1;
2360 val
>>= POWI_WINDOW_SIZE
;
2369 return result
+ powi_lookup_cost (val
, cache
);
2372 /* Recursive subroutine of expand_powi. This function takes the array,
2373 CACHE, of already calculated exponents and an exponent N and returns
2374 an RTX that corresponds to CACHE[1]**N, as calculated in mode MODE. */
2377 expand_powi_1 (enum machine_mode mode
, unsigned HOST_WIDE_INT n
, rtx
*cache
)
2379 unsigned HOST_WIDE_INT digit
;
2383 if (n
< POWI_TABLE_SIZE
)
2388 target
= gen_reg_rtx (mode
);
2391 op0
= expand_powi_1 (mode
, n
- powi_table
[n
], cache
);
2392 op1
= expand_powi_1 (mode
, powi_table
[n
], cache
);
2396 target
= gen_reg_rtx (mode
);
2397 digit
= n
& ((1 << POWI_WINDOW_SIZE
) - 1);
2398 op0
= expand_powi_1 (mode
, n
- digit
, cache
);
2399 op1
= expand_powi_1 (mode
, digit
, cache
);
2403 target
= gen_reg_rtx (mode
);
2404 op0
= expand_powi_1 (mode
, n
>> 1, cache
);
2408 result
= expand_mult (mode
, op0
, op1
, target
, 0);
2409 if (result
!= target
)
2410 emit_move_insn (target
, result
);
2414 /* Expand the RTL to evaluate powi(x,n) in mode MODE. X is the
2415 floating point operand in mode MODE, and N is the exponent. This
2416 function needs to be kept in sync with powi_cost above. */
2419 expand_powi (rtx x
, enum machine_mode mode
, HOST_WIDE_INT n
)
2421 unsigned HOST_WIDE_INT val
;
2422 rtx cache
[POWI_TABLE_SIZE
];
2426 return CONST1_RTX (mode
);
2428 val
= (n
< 0) ? -n
: n
;
2430 memset (cache
, 0, sizeof (cache
));
2433 result
= expand_powi_1 (mode
, (n
< 0) ? -n
: n
, cache
);
2435 /* If the original exponent was negative, reciprocate the result. */
2437 result
= expand_binop (mode
, sdiv_optab
, CONST1_RTX (mode
),
2438 result
, NULL_RTX
, 0, OPTAB_LIB_WIDEN
);
2443 /* Expand a call to the pow built-in mathematical function. Return 0 if
2444 a normal call should be emitted rather than expanding the function
2445 in-line. EXP is the expression that is a call to the builtin
2446 function; if convenient, the result should be placed in TARGET. */
2449 expand_builtin_pow (tree exp
, rtx target
, rtx subtarget
)
2451 tree arglist
= TREE_OPERAND (exp
, 1);
2454 if (! validate_arglist (arglist
, REAL_TYPE
, REAL_TYPE
, VOID_TYPE
))
2457 arg0
= TREE_VALUE (arglist
);
2458 arg1
= TREE_VALUE (TREE_CHAIN (arglist
));
2460 if (TREE_CODE (arg1
) == REAL_CST
2461 && ! TREE_CONSTANT_OVERFLOW (arg1
))
2463 REAL_VALUE_TYPE cint
;
2467 c
= TREE_REAL_CST (arg1
);
2468 n
= real_to_integer (&c
);
2469 real_from_integer (&cint
, VOIDmode
, n
, n
< 0 ? -1 : 0, 0);
2470 if (real_identical (&c
, &cint
))
2472 /* If the exponent is -1, 0, 1 or 2, then expand_powi is exact.
2473 Otherwise, check the number of multiplications required.
2474 Note that pow never sets errno for an integer exponent. */
2475 if ((n
>= -1 && n
<= 2)
2476 || (flag_unsafe_math_optimizations
2478 && powi_cost (n
) <= POWI_MAX_MULTS
))
2480 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2481 rtx op
= expand_expr (arg0
, subtarget
, VOIDmode
, 0);
2482 op
= force_reg (mode
, op
);
2483 return expand_powi (op
, mode
, n
);
2488 if (! flag_unsafe_math_optimizations
)
2490 return expand_builtin_mathfn_2 (exp
, target
, subtarget
);
2493 /* Expand a call to the powi built-in mathematical function. Return 0 if
2494 a normal call should be emitted rather than expanding the function
2495 in-line. EXP is the expression that is a call to the builtin
2496 function; if convenient, the result should be placed in TARGET. */
2499 expand_builtin_powi (tree exp
, rtx target
, rtx subtarget
)
2501 tree arglist
= TREE_OPERAND (exp
, 1);
2504 enum machine_mode mode
;
2505 enum machine_mode mode2
;
2507 if (! validate_arglist (arglist
, REAL_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
2510 arg0
= TREE_VALUE (arglist
);
2511 arg1
= TREE_VALUE (TREE_CHAIN (arglist
));
2512 mode
= TYPE_MODE (TREE_TYPE (exp
));
2514 /* Handle constant power. */
2516 if (TREE_CODE (arg1
) == INTEGER_CST
2517 && ! TREE_CONSTANT_OVERFLOW (arg1
))
2519 HOST_WIDE_INT n
= TREE_INT_CST_LOW (arg1
);
2521 /* If the exponent is -1, 0, 1 or 2, then expand_powi is exact.
2522 Otherwise, check the number of multiplications required. */
2523 if ((TREE_INT_CST_HIGH (arg1
) == 0
2524 || TREE_INT_CST_HIGH (arg1
) == -1)
2525 && ((n
>= -1 && n
<= 2)
2527 && powi_cost (n
) <= POWI_MAX_MULTS
)))
2529 op0
= expand_expr (arg0
, subtarget
, VOIDmode
, 0);
2530 op0
= force_reg (mode
, op0
);
2531 return expand_powi (op0
, mode
, n
);
2535 /* Emit a libcall to libgcc. */
2537 /* Mode of the 2nd argument must match that of an int. */
2538 mode2
= mode_for_size (INT_TYPE_SIZE
, MODE_INT
, 0);
2540 if (target
== NULL_RTX
)
2541 target
= gen_reg_rtx (mode
);
2543 op0
= expand_expr (arg0
, subtarget
, mode
, 0);
2544 if (GET_MODE (op0
) != mode
)
2545 op0
= convert_to_mode (mode
, op0
, 0);
2546 op1
= expand_expr (arg1
, 0, mode2
, 0);
2547 if (GET_MODE (op1
) != mode2
)
2548 op1
= convert_to_mode (mode2
, op1
, 0);
2550 target
= emit_library_call_value (powi_optab
->handlers
[(int) mode
].libfunc
,
2551 target
, LCT_CONST_MAKE_BLOCK
, mode
, 2,
2552 op0
, mode
, op1
, mode2
);
2557 /* Expand expression EXP which is a call to the strlen builtin. Return 0
2558 if we failed the caller should emit a normal call, otherwise
2559 try to get the result in TARGET, if convenient. */
2562 expand_builtin_strlen (tree arglist
, rtx target
,
2563 enum machine_mode target_mode
)
2565 if (!validate_arglist (arglist
, POINTER_TYPE
, VOID_TYPE
))
2570 tree len
, src
= TREE_VALUE (arglist
);
2571 rtx result
, src_reg
, char_rtx
, before_strlen
;
2572 enum machine_mode insn_mode
= target_mode
, char_mode
;
2573 enum insn_code icode
= CODE_FOR_nothing
;
2576 /* If the length can be computed at compile-time, return it. */
2577 len
= c_strlen (src
, 0);
2579 return expand_expr (len
, target
, target_mode
, EXPAND_NORMAL
);
2581 /* If the length can be computed at compile-time and is constant
2582 integer, but there are side-effects in src, evaluate
2583 src for side-effects, then return len.
2584 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
2585 can be optimized into: i++; x = 3; */
2586 len
= c_strlen (src
, 1);
2587 if (len
&& TREE_CODE (len
) == INTEGER_CST
)
2589 expand_expr (src
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
2590 return expand_expr (len
, target
, target_mode
, EXPAND_NORMAL
);
2593 align
= get_pointer_alignment (src
, BIGGEST_ALIGNMENT
) / BITS_PER_UNIT
;
2595 /* If SRC is not a pointer type, don't do this operation inline. */
2599 /* Bail out if we can't compute strlen in the right mode. */
2600 while (insn_mode
!= VOIDmode
)
2602 icode
= strlen_optab
->handlers
[(int) insn_mode
].insn_code
;
2603 if (icode
!= CODE_FOR_nothing
)
2606 insn_mode
= GET_MODE_WIDER_MODE (insn_mode
);
2608 if (insn_mode
== VOIDmode
)
2611 /* Make a place to write the result of the instruction. */
2615 && GET_MODE (result
) == insn_mode
2616 && REGNO (result
) >= FIRST_PSEUDO_REGISTER
))
2617 result
= gen_reg_rtx (insn_mode
);
2619 /* Make a place to hold the source address. We will not expand
2620 the actual source until we are sure that the expansion will
2621 not fail -- there are trees that cannot be expanded twice. */
2622 src_reg
= gen_reg_rtx (Pmode
);
2624 /* Mark the beginning of the strlen sequence so we can emit the
2625 source operand later. */
2626 before_strlen
= get_last_insn ();
2628 char_rtx
= const0_rtx
;
2629 char_mode
= insn_data
[(int) icode
].operand
[2].mode
;
2630 if (! (*insn_data
[(int) icode
].operand
[2].predicate
) (char_rtx
,
2632 char_rtx
= copy_to_mode_reg (char_mode
, char_rtx
);
2634 pat
= GEN_FCN (icode
) (result
, gen_rtx_MEM (BLKmode
, src_reg
),
2635 char_rtx
, GEN_INT (align
));
2640 /* Now that we are assured of success, expand the source. */
2642 pat
= expand_expr (src
, src_reg
, ptr_mode
, EXPAND_NORMAL
);
2644 emit_move_insn (src_reg
, pat
);
2649 emit_insn_after (pat
, before_strlen
);
2651 emit_insn_before (pat
, get_insns ());
2653 /* Return the value in the proper mode for this function. */
2654 if (GET_MODE (result
) == target_mode
)
2656 else if (target
!= 0)
2657 convert_move (target
, result
, 0);
2659 target
= convert_to_mode (target_mode
, result
, 0);
2665 /* Expand a call to the strstr builtin. Return 0 if we failed the
2666 caller should emit a normal call, otherwise try to get the result
2667 in TARGET, if convenient (and in mode MODE if that's convenient). */
2670 expand_builtin_strstr (tree arglist
, tree type
, rtx target
, enum machine_mode mode
)
2672 if (validate_arglist (arglist
, POINTER_TYPE
, POINTER_TYPE
, VOID_TYPE
))
2674 tree result
= fold_builtin_strstr (arglist
, type
);
2676 return expand_expr (result
, target
, mode
, EXPAND_NORMAL
);
2681 /* Expand a call to the strchr builtin. Return 0 if we failed the
2682 caller should emit a normal call, otherwise try to get the result
2683 in TARGET, if convenient (and in mode MODE if that's convenient). */
2686 expand_builtin_strchr (tree arglist
, tree type
, rtx target
, enum machine_mode mode
)
2688 if (validate_arglist (arglist
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
2690 tree result
= fold_builtin_strchr (arglist
, type
);
2692 return expand_expr (result
, target
, mode
, EXPAND_NORMAL
);
2694 /* FIXME: Should use strchrM optab so that ports can optimize this. */
2699 /* Expand a call to the strrchr builtin. Return 0 if we failed the
2700 caller should emit a normal call, otherwise try to get the result
2701 in TARGET, if convenient (and in mode MODE if that's convenient). */
2704 expand_builtin_strrchr (tree arglist
, tree type
, rtx target
, enum machine_mode mode
)
2706 if (validate_arglist (arglist
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
2708 tree result
= fold_builtin_strrchr (arglist
, type
);
2710 return expand_expr (result
, target
, mode
, EXPAND_NORMAL
);
2715 /* Expand a call to the strpbrk builtin. Return 0 if we failed the
2716 caller should emit a normal call, otherwise try to get the result
2717 in TARGET, if convenient (and in mode MODE if that's convenient). */
2720 expand_builtin_strpbrk (tree arglist
, tree type
, rtx target
, enum machine_mode mode
)
2722 if (validate_arglist (arglist
, POINTER_TYPE
, POINTER_TYPE
, VOID_TYPE
))
2724 tree result
= fold_builtin_strpbrk (arglist
, type
);
2726 return expand_expr (result
, target
, mode
, EXPAND_NORMAL
);
2731 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
2732 bytes from constant string DATA + OFFSET and return it as target
2736 builtin_memcpy_read_str (void *data
, HOST_WIDE_INT offset
,
2737 enum machine_mode mode
)
2739 const char *str
= (const char *) data
;
2741 gcc_assert (offset
>= 0
2742 && ((unsigned HOST_WIDE_INT
) offset
+ GET_MODE_SIZE (mode
)
2743 <= strlen (str
) + 1));
2745 return c_readstr (str
+ offset
, mode
);
2748 /* Expand a call to the memcpy builtin, with arguments in ARGLIST.
2749 Return 0 if we failed, the caller should emit a normal call,
2750 otherwise try to get the result in TARGET, if convenient (and in
2751 mode MODE if that's convenient). */
2753 expand_builtin_memcpy (tree exp
, rtx target
, enum machine_mode mode
)
2755 tree fndecl
= get_callee_fndecl (exp
);
2756 tree arglist
= TREE_OPERAND (exp
, 1);
2757 if (!validate_arglist (arglist
,
2758 POINTER_TYPE
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
2762 tree dest
= TREE_VALUE (arglist
);
2763 tree src
= TREE_VALUE (TREE_CHAIN (arglist
));
2764 tree len
= TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist
)));
2765 const char *src_str
;
2766 unsigned int src_align
= get_pointer_alignment (src
, BIGGEST_ALIGNMENT
);
2767 unsigned int dest_align
2768 = get_pointer_alignment (dest
, BIGGEST_ALIGNMENT
);
2769 rtx dest_mem
, src_mem
, dest_addr
, len_rtx
;
2770 tree result
= fold_builtin_memcpy (fndecl
, arglist
);
2773 return expand_expr (result
, target
, mode
, EXPAND_NORMAL
);
2775 /* If DEST is not a pointer type, call the normal function. */
2776 if (dest_align
== 0)
2779 /* If either SRC is not a pointer type, don't do this
2780 operation in-line. */
2784 dest_mem
= get_memory_rtx (dest
);
2785 set_mem_align (dest_mem
, dest_align
);
2786 len_rtx
= expand_expr (len
, NULL_RTX
, VOIDmode
, 0);
2787 src_str
= c_getstr (src
);
2789 /* If SRC is a string constant and block move would be done
2790 by pieces, we can avoid loading the string from memory
2791 and only stored the computed constants. */
2793 && GET_CODE (len_rtx
) == CONST_INT
2794 && (unsigned HOST_WIDE_INT
) INTVAL (len_rtx
) <= strlen (src_str
) + 1
2795 && can_store_by_pieces (INTVAL (len_rtx
), builtin_memcpy_read_str
,
2796 (void *) src_str
, dest_align
))
2798 dest_mem
= store_by_pieces (dest_mem
, INTVAL (len_rtx
),
2799 builtin_memcpy_read_str
,
2800 (void *) src_str
, dest_align
, 0);
2801 dest_mem
= force_operand (XEXP (dest_mem
, 0), NULL_RTX
);
2802 dest_mem
= convert_memory_address (ptr_mode
, dest_mem
);
2806 src_mem
= get_memory_rtx (src
);
2807 set_mem_align (src_mem
, src_align
);
2809 /* Copy word part most expediently. */
2810 dest_addr
= emit_block_move (dest_mem
, src_mem
, len_rtx
,
2811 CALL_EXPR_TAILCALL (exp
)
2812 ? BLOCK_OP_TAILCALL
: BLOCK_OP_NORMAL
);
2816 dest_addr
= force_operand (XEXP (dest_mem
, 0), NULL_RTX
);
2817 dest_addr
= convert_memory_address (ptr_mode
, dest_addr
);
2823 /* Expand a call to the mempcpy builtin, with arguments in ARGLIST.
2824 Return 0 if we failed the caller should emit a normal call,
2825 otherwise try to get the result in TARGET, if convenient (and in
2826 mode MODE if that's convenient). If ENDP is 0 return the
2827 destination pointer, if ENDP is 1 return the end pointer ala
2828 mempcpy, and if ENDP is 2 return the end pointer minus one ala
2832 expand_builtin_mempcpy (tree arglist
, tree type
, rtx target
, enum machine_mode mode
,
2835 if (!validate_arglist (arglist
,
2836 POINTER_TYPE
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
2838 /* If return value is ignored, transform mempcpy into memcpy. */
2839 else if (target
== const0_rtx
)
2841 tree fn
= implicit_built_in_decls
[BUILT_IN_MEMCPY
];
2846 return expand_expr (build_function_call_expr (fn
, arglist
),
2847 target
, mode
, EXPAND_NORMAL
);
2851 tree dest
= TREE_VALUE (arglist
);
2852 tree src
= TREE_VALUE (TREE_CHAIN (arglist
));
2853 tree len
= TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist
)));
2854 const char *src_str
;
2855 unsigned int src_align
= get_pointer_alignment (src
, BIGGEST_ALIGNMENT
);
2856 unsigned int dest_align
2857 = get_pointer_alignment (dest
, BIGGEST_ALIGNMENT
);
2858 rtx dest_mem
, src_mem
, len_rtx
;
2859 tree result
= fold_builtin_mempcpy (arglist
, type
, endp
);
2862 return expand_expr (result
, target
, mode
, EXPAND_NORMAL
);
2864 /* If either SRC or DEST is not a pointer type, don't do this
2865 operation in-line. */
2866 if (dest_align
== 0 || src_align
== 0)
2869 /* If LEN is not constant, call the normal function. */
2870 if (! host_integerp (len
, 1))
2873 len_rtx
= expand_expr (len
, NULL_RTX
, VOIDmode
, 0);
2874 src_str
= c_getstr (src
);
2876 /* If SRC is a string constant and block move would be done
2877 by pieces, we can avoid loading the string from memory
2878 and only stored the computed constants. */
2880 && GET_CODE (len_rtx
) == CONST_INT
2881 && (unsigned HOST_WIDE_INT
) INTVAL (len_rtx
) <= strlen (src_str
) + 1
2882 && can_store_by_pieces (INTVAL (len_rtx
), builtin_memcpy_read_str
,
2883 (void *) src_str
, dest_align
))
2885 dest_mem
= get_memory_rtx (dest
);
2886 set_mem_align (dest_mem
, dest_align
);
2887 dest_mem
= store_by_pieces (dest_mem
, INTVAL (len_rtx
),
2888 builtin_memcpy_read_str
,
2889 (void *) src_str
, dest_align
, endp
);
2890 dest_mem
= force_operand (XEXP (dest_mem
, 0), NULL_RTX
);
2891 dest_mem
= convert_memory_address (ptr_mode
, dest_mem
);
2895 if (GET_CODE (len_rtx
) == CONST_INT
2896 && can_move_by_pieces (INTVAL (len_rtx
),
2897 MIN (dest_align
, src_align
)))
2899 dest_mem
= get_memory_rtx (dest
);
2900 set_mem_align (dest_mem
, dest_align
);
2901 src_mem
= get_memory_rtx (src
);
2902 set_mem_align (src_mem
, src_align
);
2903 dest_mem
= move_by_pieces (dest_mem
, src_mem
, INTVAL (len_rtx
),
2904 MIN (dest_align
, src_align
), endp
);
2905 dest_mem
= force_operand (XEXP (dest_mem
, 0), NULL_RTX
);
2906 dest_mem
= convert_memory_address (ptr_mode
, dest_mem
);
2914 /* Expand expression EXP, which is a call to the memmove builtin. Return 0
2915 if we failed the caller should emit a normal call. */
2918 expand_builtin_memmove (tree arglist
, tree type
, rtx target
,
2919 enum machine_mode mode
, tree orig_exp
)
2921 if (!validate_arglist (arglist
,
2922 POINTER_TYPE
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
2926 tree dest
= TREE_VALUE (arglist
);
2927 tree src
= TREE_VALUE (TREE_CHAIN (arglist
));
2928 tree len
= TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist
)));
2930 unsigned int src_align
= get_pointer_alignment (src
, BIGGEST_ALIGNMENT
);
2931 unsigned int dest_align
2932 = get_pointer_alignment (dest
, BIGGEST_ALIGNMENT
);
2933 tree result
= fold_builtin_memmove (arglist
, type
);
2936 return expand_expr (result
, target
, mode
, EXPAND_NORMAL
);
2938 /* If DEST is not a pointer type, call the normal function. */
2939 if (dest_align
== 0)
2942 /* If either SRC is not a pointer type, don't do this
2943 operation in-line. */
2947 /* If src is categorized for a readonly section we can use
2949 if (readonly_data_expr (src
))
2951 tree fn
= implicit_built_in_decls
[BUILT_IN_MEMCPY
];
2954 fn
= build_function_call_expr (fn
, arglist
);
2955 if (TREE_CODE (fn
) == CALL_EXPR
)
2956 CALL_EXPR_TAILCALL (fn
) = CALL_EXPR_TAILCALL (orig_exp
);
2957 return expand_expr (fn
, target
, mode
, EXPAND_NORMAL
);
2960 /* If length is 1 and we can expand memcpy call inline,
2961 it is ok to use memcpy as well. */
2962 if (integer_onep (len
))
2964 rtx ret
= expand_builtin_mempcpy (arglist
, type
, target
, mode
,
2970 /* Otherwise, call the normal function. */
2975 /* Expand expression EXP, which is a call to the bcopy builtin. Return 0
2976 if we failed the caller should emit a normal call. */
2979 expand_builtin_bcopy (tree exp
)
2981 tree arglist
= TREE_OPERAND (exp
, 1);
2982 tree type
= TREE_TYPE (exp
);
2983 tree src
, dest
, size
, newarglist
;
2985 if (!validate_arglist (arglist
,
2986 POINTER_TYPE
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
2989 src
= TREE_VALUE (arglist
);
2990 dest
= TREE_VALUE (TREE_CHAIN (arglist
));
2991 size
= TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist
)));
2993 /* New argument list transforming bcopy(ptr x, ptr y, int z) to
2994 memmove(ptr y, ptr x, size_t z). This is done this way
2995 so that if it isn't expanded inline, we fallback to
2996 calling bcopy instead of memmove. */
2998 newarglist
= build_tree_list (NULL_TREE
, fold_convert (sizetype
, size
));
2999 newarglist
= tree_cons (NULL_TREE
, src
, newarglist
);
3000 newarglist
= tree_cons (NULL_TREE
, dest
, newarglist
);
3002 return expand_builtin_memmove (newarglist
, type
, const0_rtx
, VOIDmode
, exp
);
3006 # define HAVE_movstr 0
3007 # define CODE_FOR_movstr CODE_FOR_nothing
3010 /* Expand into a movstr instruction, if one is available. Return 0 if
3011 we failed, the caller should emit a normal call, otherwise try to
3012 get the result in TARGET, if convenient. If ENDP is 0 return the
3013 destination pointer, if ENDP is 1 return the end pointer ala
3014 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3018 expand_movstr (tree dest
, tree src
, rtx target
, int endp
)
3024 const struct insn_data
* data
;
3029 dest_mem
= get_memory_rtx (dest
);
3030 src_mem
= get_memory_rtx (src
);
3033 target
= force_reg (Pmode
, XEXP (dest_mem
, 0));
3034 dest_mem
= replace_equiv_address (dest_mem
, target
);
3035 end
= gen_reg_rtx (Pmode
);
3039 if (target
== 0 || target
== const0_rtx
)
3041 end
= gen_reg_rtx (Pmode
);
3049 data
= insn_data
+ CODE_FOR_movstr
;
3051 if (data
->operand
[0].mode
!= VOIDmode
)
3052 end
= gen_lowpart (data
->operand
[0].mode
, end
);
3054 insn
= data
->genfun (end
, dest_mem
, src_mem
);
3060 /* movstr is supposed to set end to the address of the NUL
3061 terminator. If the caller requested a mempcpy-like return value,
3063 if (endp
== 1 && target
!= const0_rtx
)
3065 rtx tem
= plus_constant (gen_lowpart (GET_MODE (target
), end
), 1);
3066 emit_move_insn (target
, force_operand (tem
, NULL_RTX
));
3072 /* Expand expression EXP, which is a call to the strcpy builtin. Return 0
3073 if we failed the caller should emit a normal call, otherwise try to get
3074 the result in TARGET, if convenient (and in mode MODE if that's
3078 expand_builtin_strcpy (tree exp
, rtx target
, enum machine_mode mode
)
3080 tree fndecl
= get_callee_fndecl (exp
);
3081 tree arglist
= TREE_OPERAND (exp
, 1);
3082 if (validate_arglist (arglist
, POINTER_TYPE
, POINTER_TYPE
, VOID_TYPE
))
3084 tree result
= fold_builtin_strcpy (fndecl
, arglist
, 0);
3086 return expand_expr (result
, target
, mode
, EXPAND_NORMAL
);
3088 return expand_movstr (TREE_VALUE (arglist
),
3089 TREE_VALUE (TREE_CHAIN (arglist
)),
3090 target
, /*endp=*/0);
3095 /* Expand a call to the stpcpy builtin, with arguments in ARGLIST.
3096 Return 0 if we failed the caller should emit a normal call,
3097 otherwise try to get the result in TARGET, if convenient (and in
3098 mode MODE if that's convenient). */
3101 expand_builtin_stpcpy (tree exp
, rtx target
, enum machine_mode mode
)
3103 tree arglist
= TREE_OPERAND (exp
, 1);
3104 /* If return value is ignored, transform stpcpy into strcpy. */
3105 if (target
== const0_rtx
)
3107 tree fn
= implicit_built_in_decls
[BUILT_IN_STRCPY
];
3111 return expand_expr (build_function_call_expr (fn
, arglist
),
3112 target
, mode
, EXPAND_NORMAL
);
3115 if (!validate_arglist (arglist
, POINTER_TYPE
, POINTER_TYPE
, VOID_TYPE
))
3119 tree dst
, src
, len
, lenp1
;
3123 /* Ensure we get an actual string whose length can be evaluated at
3124 compile-time, not an expression containing a string. This is
3125 because the latter will potentially produce pessimized code
3126 when used to produce the return value. */
3127 src
= TREE_VALUE (TREE_CHAIN (arglist
));
3128 if (! c_getstr (src
) || ! (len
= c_strlen (src
, 0)))
3129 return expand_movstr (TREE_VALUE (arglist
),
3130 TREE_VALUE (TREE_CHAIN (arglist
)),
3131 target
, /*endp=*/2);
3133 dst
= TREE_VALUE (arglist
);
3134 lenp1
= size_binop (PLUS_EXPR
, len
, ssize_int (1));
3135 narglist
= build_tree_list (NULL_TREE
, lenp1
);
3136 narglist
= tree_cons (NULL_TREE
, src
, narglist
);
3137 narglist
= tree_cons (NULL_TREE
, dst
, narglist
);
3138 ret
= expand_builtin_mempcpy (narglist
, TREE_TYPE (exp
),
3139 target
, mode
, /*endp=*/2);
3144 if (TREE_CODE (len
) == INTEGER_CST
)
3146 rtx len_rtx
= expand_expr (len
, NULL_RTX
, VOIDmode
, 0);
3148 if (GET_CODE (len_rtx
) == CONST_INT
)
3150 ret
= expand_builtin_strcpy (exp
, target
, mode
);
3156 if (mode
!= VOIDmode
)
3157 target
= gen_reg_rtx (mode
);
3159 target
= gen_reg_rtx (GET_MODE (ret
));
3161 if (GET_MODE (target
) != GET_MODE (ret
))
3162 ret
= gen_lowpart (GET_MODE (target
), ret
);
3164 ret
= plus_constant (ret
, INTVAL (len_rtx
));
3165 ret
= emit_move_insn (target
, force_operand (ret
, NULL_RTX
));
3173 return expand_movstr (TREE_VALUE (arglist
),
3174 TREE_VALUE (TREE_CHAIN (arglist
)),
3175 target
, /*endp=*/2);
3179 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3180 bytes from constant string DATA + OFFSET and return it as target
3184 builtin_strncpy_read_str (void *data
, HOST_WIDE_INT offset
,
3185 enum machine_mode mode
)
3187 const char *str
= (const char *) data
;
3189 if ((unsigned HOST_WIDE_INT
) offset
> strlen (str
))
3192 return c_readstr (str
+ offset
, mode
);
3195 /* Expand expression EXP, which is a call to the strncpy builtin. Return 0
3196 if we failed the caller should emit a normal call. */
3199 expand_builtin_strncpy (tree exp
, rtx target
, enum machine_mode mode
)
3201 tree fndecl
= get_callee_fndecl (exp
);
3202 tree arglist
= TREE_OPERAND (exp
, 1);
3203 if (validate_arglist (arglist
,
3204 POINTER_TYPE
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
3206 tree slen
= c_strlen (TREE_VALUE (TREE_CHAIN (arglist
)), 1);
3207 tree len
= TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist
)));
3208 tree result
= fold_builtin_strncpy (fndecl
, arglist
, slen
);
3211 return expand_expr (result
, target
, mode
, EXPAND_NORMAL
);
3213 /* We must be passed a constant len and src parameter. */
3214 if (!host_integerp (len
, 1) || !slen
|| !host_integerp (slen
, 1))
3217 slen
= size_binop (PLUS_EXPR
, slen
, ssize_int (1));
3219 /* We're required to pad with trailing zeros if the requested
3220 len is greater than strlen(s2)+1. In that case try to
3221 use store_by_pieces, if it fails, punt. */
3222 if (tree_int_cst_lt (slen
, len
))
3224 tree dest
= TREE_VALUE (arglist
);
3225 unsigned int dest_align
3226 = get_pointer_alignment (dest
, BIGGEST_ALIGNMENT
);
3227 const char *p
= c_getstr (TREE_VALUE (TREE_CHAIN (arglist
)));
3230 if (!p
|| dest_align
== 0 || !host_integerp (len
, 1)
3231 || !can_store_by_pieces (tree_low_cst (len
, 1),
3232 builtin_strncpy_read_str
,
3233 (void *) p
, dest_align
))
3236 dest_mem
= get_memory_rtx (dest
);
3237 store_by_pieces (dest_mem
, tree_low_cst (len
, 1),
3238 builtin_strncpy_read_str
,
3239 (void *) p
, dest_align
, 0);
3240 dest_mem
= force_operand (XEXP (dest_mem
, 0), NULL_RTX
);
3241 dest_mem
= convert_memory_address (ptr_mode
, dest_mem
);
3248 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3249 bytes from constant string DATA + OFFSET and return it as target
3253 builtin_memset_read_str (void *data
, HOST_WIDE_INT offset ATTRIBUTE_UNUSED
,
3254 enum machine_mode mode
)
3256 const char *c
= (const char *) data
;
3257 char *p
= alloca (GET_MODE_SIZE (mode
));
3259 memset (p
, *c
, GET_MODE_SIZE (mode
));
3261 return c_readstr (p
, mode
);
3264 /* Callback routine for store_by_pieces. Return the RTL of a register
3265 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
3266 char value given in the RTL register data. For example, if mode is
3267 4 bytes wide, return the RTL for 0x01010101*data. */
3270 builtin_memset_gen_str (void *data
, HOST_WIDE_INT offset ATTRIBUTE_UNUSED
,
3271 enum machine_mode mode
)
3277 size
= GET_MODE_SIZE (mode
);
3282 memset (p
, 1, size
);
3283 coeff
= c_readstr (p
, mode
);
3285 target
= convert_to_mode (mode
, (rtx
) data
, 1);
3286 target
= expand_mult (mode
, target
, coeff
, NULL_RTX
, 1);
3287 return force_reg (mode
, target
);
3290 /* Expand expression EXP, which is a call to the memset builtin. Return 0
3291 if we failed the caller should emit a normal call, otherwise try to get
3292 the result in TARGET, if convenient (and in mode MODE if that's
3296 expand_builtin_memset (tree arglist
, rtx target
, enum machine_mode mode
,
3299 if (!validate_arglist (arglist
,
3300 POINTER_TYPE
, INTEGER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
3304 tree dest
= TREE_VALUE (arglist
);
3305 tree val
= TREE_VALUE (TREE_CHAIN (arglist
));
3306 tree len
= TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist
)));
3309 unsigned int dest_align
3310 = get_pointer_alignment (dest
, BIGGEST_ALIGNMENT
);
3311 rtx dest_mem
, dest_addr
, len_rtx
;
3313 /* If DEST is not a pointer type, don't do this
3314 operation in-line. */
3315 if (dest_align
== 0)
3318 /* If the LEN parameter is zero, return DEST. */
3319 if (integer_zerop (len
))
3321 /* Evaluate and ignore VAL in case it has side-effects. */
3322 expand_expr (val
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
3323 return expand_expr (dest
, target
, mode
, EXPAND_NORMAL
);
3326 if (TREE_CODE (val
) != INTEGER_CST
)
3330 if (!host_integerp (len
, 1))
3333 if (optimize_size
&& tree_low_cst (len
, 1) > 1)
3336 /* Assume that we can memset by pieces if we can store the
3337 * the coefficients by pieces (in the required modes).
3338 * We can't pass builtin_memset_gen_str as that emits RTL. */
3340 if (!can_store_by_pieces (tree_low_cst (len
, 1),
3341 builtin_memset_read_str
,
3345 val
= fold (build1 (CONVERT_EXPR
, unsigned_char_type_node
, val
));
3346 val_rtx
= expand_expr (val
, NULL_RTX
, VOIDmode
, 0);
3347 val_rtx
= force_reg (TYPE_MODE (unsigned_char_type_node
),
3349 dest_mem
= get_memory_rtx (dest
);
3350 store_by_pieces (dest_mem
, tree_low_cst (len
, 1),
3351 builtin_memset_gen_str
,
3352 val_rtx
, dest_align
, 0);
3353 dest_mem
= force_operand (XEXP (dest_mem
, 0), NULL_RTX
);
3354 dest_mem
= convert_memory_address (ptr_mode
, dest_mem
);
3358 if (target_char_cast (val
, &c
))
3363 if (!host_integerp (len
, 1))
3365 if (!can_store_by_pieces (tree_low_cst (len
, 1),
3366 builtin_memset_read_str
, &c
,
3370 dest_mem
= get_memory_rtx (dest
);
3371 store_by_pieces (dest_mem
, tree_low_cst (len
, 1),
3372 builtin_memset_read_str
,
3374 dest_mem
= force_operand (XEXP (dest_mem
, 0), NULL_RTX
);
3375 dest_mem
= convert_memory_address (ptr_mode
, dest_mem
);
3379 len_rtx
= expand_expr (len
, NULL_RTX
, VOIDmode
, 0);
3381 dest_mem
= get_memory_rtx (dest
);
3382 set_mem_align (dest_mem
, dest_align
);
3383 dest_addr
= clear_storage (dest_mem
, len_rtx
,
3384 CALL_EXPR_TAILCALL (orig_exp
)
3385 ? BLOCK_OP_TAILCALL
: BLOCK_OP_NORMAL
);
3389 dest_addr
= force_operand (XEXP (dest_mem
, 0), NULL_RTX
);
3390 dest_addr
= convert_memory_address (ptr_mode
, dest_addr
);
3397 /* Expand expression EXP, which is a call to the bzero builtin. Return 0
3398 if we failed the caller should emit a normal call. */
3401 expand_builtin_bzero (tree exp
)
3403 tree arglist
= TREE_OPERAND (exp
, 1);
3404 tree dest
, size
, newarglist
;
3406 if (!validate_arglist (arglist
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
3409 dest
= TREE_VALUE (arglist
);
3410 size
= TREE_VALUE (TREE_CHAIN (arglist
));
3412 /* New argument list transforming bzero(ptr x, int y) to
3413 memset(ptr x, int 0, size_t y). This is done this way
3414 so that if it isn't expanded inline, we fallback to
3415 calling bzero instead of memset. */
3417 newarglist
= build_tree_list (NULL_TREE
, fold_convert (sizetype
, size
));
3418 newarglist
= tree_cons (NULL_TREE
, integer_zero_node
, newarglist
);
3419 newarglist
= tree_cons (NULL_TREE
, dest
, newarglist
);
3421 return expand_builtin_memset (newarglist
, const0_rtx
, VOIDmode
, exp
);
3424 /* Expand expression EXP, which is a call to the memcmp built-in function.
3425 ARGLIST is the argument list for this call. Return 0 if we failed and the
3426 caller should emit a normal call, otherwise try to get the result in
3427 TARGET, if convenient (and in mode MODE, if that's convenient). */
3430 expand_builtin_memcmp (tree exp ATTRIBUTE_UNUSED
, tree arglist
, rtx target
,
3431 enum machine_mode mode
)
3433 if (!validate_arglist (arglist
,
3434 POINTER_TYPE
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
3438 tree result
= fold_builtin_memcmp (arglist
);
3440 return expand_expr (result
, target
, mode
, EXPAND_NORMAL
);
3443 #if defined HAVE_cmpmemsi || defined HAVE_cmpstrsi
3445 tree arg1
= TREE_VALUE (arglist
);
3446 tree arg2
= TREE_VALUE (TREE_CHAIN (arglist
));
3447 tree len
= TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist
)));
3448 rtx arg1_rtx
, arg2_rtx
, arg3_rtx
;
3453 = get_pointer_alignment (arg1
, BIGGEST_ALIGNMENT
) / BITS_PER_UNIT
;
3455 = get_pointer_alignment (arg2
, BIGGEST_ALIGNMENT
) / BITS_PER_UNIT
;
3456 enum machine_mode insn_mode
;
3458 #ifdef HAVE_cmpmemsi
3460 insn_mode
= insn_data
[(int) CODE_FOR_cmpmemsi
].operand
[0].mode
;
3463 #ifdef HAVE_cmpstrsi
3465 insn_mode
= insn_data
[(int) CODE_FOR_cmpstrsi
].operand
[0].mode
;
3470 /* If we don't have POINTER_TYPE, call the function. */
3471 if (arg1_align
== 0 || arg2_align
== 0)
3474 /* Make a place to write the result of the instruction. */
3477 && REG_P (result
) && GET_MODE (result
) == insn_mode
3478 && REGNO (result
) >= FIRST_PSEUDO_REGISTER
))
3479 result
= gen_reg_rtx (insn_mode
);
3481 arg1_rtx
= get_memory_rtx (arg1
);
3482 arg2_rtx
= get_memory_rtx (arg2
);
3483 arg3_rtx
= expand_expr (len
, NULL_RTX
, VOIDmode
, 0);
3485 /* Set MEM_SIZE as appropriate. */
3486 if (GET_CODE (arg3_rtx
) == CONST_INT
)
3488 set_mem_size (arg1_rtx
, arg3_rtx
);
3489 set_mem_size (arg2_rtx
, arg3_rtx
);
3492 #ifdef HAVE_cmpmemsi
3494 insn
= gen_cmpmemsi (result
, arg1_rtx
, arg2_rtx
, arg3_rtx
,
3495 GEN_INT (MIN (arg1_align
, arg2_align
)));
3498 #ifdef HAVE_cmpstrsi
3500 insn
= gen_cmpstrsi (result
, arg1_rtx
, arg2_rtx
, arg3_rtx
,
3501 GEN_INT (MIN (arg1_align
, arg2_align
)));
3509 emit_library_call_value (memcmp_libfunc
, result
, LCT_PURE_MAKE_BLOCK
,
3510 TYPE_MODE (integer_type_node
), 3,
3511 XEXP (arg1_rtx
, 0), Pmode
,
3512 XEXP (arg2_rtx
, 0), Pmode
,
3513 convert_to_mode (TYPE_MODE (sizetype
), arg3_rtx
,
3514 TYPE_UNSIGNED (sizetype
)),
3515 TYPE_MODE (sizetype
));
3517 /* Return the value in the proper mode for this function. */
3518 mode
= TYPE_MODE (TREE_TYPE (exp
));
3519 if (GET_MODE (result
) == mode
)
3521 else if (target
!= 0)
3523 convert_move (target
, result
, 0);
3527 return convert_to_mode (mode
, result
, 0);
3534 /* Expand expression EXP, which is a call to the strcmp builtin. Return 0
3535 if we failed the caller should emit a normal call, otherwise try to get
3536 the result in TARGET, if convenient. */
3539 expand_builtin_strcmp (tree exp
, rtx target
, enum machine_mode mode
)
3541 tree arglist
= TREE_OPERAND (exp
, 1);
3543 if (!validate_arglist (arglist
, POINTER_TYPE
, POINTER_TYPE
, VOID_TYPE
))
3547 tree result
= fold_builtin_strcmp (arglist
);
3549 return expand_expr (result
, target
, mode
, EXPAND_NORMAL
);
3552 #ifdef HAVE_cmpstrsi
3555 tree arg1
= TREE_VALUE (arglist
);
3556 tree arg2
= TREE_VALUE (TREE_CHAIN (arglist
));
3557 tree len
, len1
, len2
;
3558 rtx arg1_rtx
, arg2_rtx
, arg3_rtx
;
3563 = get_pointer_alignment (arg1
, BIGGEST_ALIGNMENT
) / BITS_PER_UNIT
;
3565 = get_pointer_alignment (arg2
, BIGGEST_ALIGNMENT
) / BITS_PER_UNIT
;
3566 enum machine_mode insn_mode
3567 = insn_data
[(int) CODE_FOR_cmpstrsi
].operand
[0].mode
;
3569 len1
= c_strlen (arg1
, 1);
3570 len2
= c_strlen (arg2
, 1);
3573 len1
= size_binop (PLUS_EXPR
, ssize_int (1), len1
);
3575 len2
= size_binop (PLUS_EXPR
, ssize_int (1), len2
);
3577 /* If we don't have a constant length for the first, use the length
3578 of the second, if we know it. We don't require a constant for
3579 this case; some cost analysis could be done if both are available
3580 but neither is constant. For now, assume they're equally cheap,
3581 unless one has side effects. If both strings have constant lengths,
3588 else if (TREE_SIDE_EFFECTS (len1
))
3590 else if (TREE_SIDE_EFFECTS (len2
))
3592 else if (TREE_CODE (len1
) != INTEGER_CST
)
3594 else if (TREE_CODE (len2
) != INTEGER_CST
)
3596 else if (tree_int_cst_lt (len1
, len2
))
3601 /* If both arguments have side effects, we cannot optimize. */
3602 if (!len
|| TREE_SIDE_EFFECTS (len
))
3605 /* If we don't have POINTER_TYPE, call the function. */
3606 if (arg1_align
== 0 || arg2_align
== 0)
3609 /* Make a place to write the result of the instruction. */
3612 && REG_P (result
) && GET_MODE (result
) == insn_mode
3613 && REGNO (result
) >= FIRST_PSEUDO_REGISTER
))
3614 result
= gen_reg_rtx (insn_mode
);
3616 /* Stabilize the arguments in case gen_cmpstrsi fails. */
3617 arg1
= builtin_save_expr (arg1
);
3618 arg2
= builtin_save_expr (arg2
);
3620 arg1_rtx
= get_memory_rtx (arg1
);
3621 arg2_rtx
= get_memory_rtx (arg2
);
3622 arg3_rtx
= expand_expr (len
, NULL_RTX
, VOIDmode
, 0);
3623 insn
= gen_cmpstrsi (result
, arg1_rtx
, arg2_rtx
, arg3_rtx
,
3624 GEN_INT (MIN (arg1_align
, arg2_align
)));
3629 /* Return the value in the proper mode for this function. */
3630 mode
= TYPE_MODE (TREE_TYPE (exp
));
3631 if (GET_MODE (result
) == mode
)
3634 return convert_to_mode (mode
, result
, 0);
3635 convert_move (target
, result
, 0);
3639 /* Expand the library call ourselves using a stabilized argument
3640 list to avoid re-evaluating the function's arguments twice. */
3641 arglist
= build_tree_list (NULL_TREE
, arg2
);
3642 arglist
= tree_cons (NULL_TREE
, arg1
, arglist
);
3643 fndecl
= get_callee_fndecl (exp
);
3644 fn
= build_function_call_expr (fndecl
, arglist
);
3645 if (TREE_CODE (fn
) == CALL_EXPR
)
3646 CALL_EXPR_TAILCALL (fn
) = CALL_EXPR_TAILCALL (exp
);
3647 return expand_call (fn
, target
, target
== const0_rtx
);
3653 /* Expand expression EXP, which is a call to the strncmp builtin. Return 0
3654 if we failed the caller should emit a normal call, otherwise try to get
3655 the result in TARGET, if convenient. */
3658 expand_builtin_strncmp (tree exp
, rtx target
, enum machine_mode mode
)
3660 tree arglist
= TREE_OPERAND (exp
, 1);
3662 if (!validate_arglist (arglist
,
3663 POINTER_TYPE
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
3667 tree result
= fold_builtin_strncmp (arglist
);
3669 return expand_expr (result
, target
, mode
, EXPAND_NORMAL
);
3672 /* If c_strlen can determine an expression for one of the string
3673 lengths, and it doesn't have side effects, then emit cmpstrsi
3674 using length MIN(strlen(string)+1, arg3). */
3675 #ifdef HAVE_cmpstrsi
3678 tree arg1
= TREE_VALUE (arglist
);
3679 tree arg2
= TREE_VALUE (TREE_CHAIN (arglist
));
3680 tree arg3
= TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist
)));
3681 tree len
, len1
, len2
;
3682 rtx arg1_rtx
, arg2_rtx
, arg3_rtx
;
3687 = get_pointer_alignment (arg1
, BIGGEST_ALIGNMENT
) / BITS_PER_UNIT
;
3689 = get_pointer_alignment (arg2
, BIGGEST_ALIGNMENT
) / BITS_PER_UNIT
;
3690 enum machine_mode insn_mode
3691 = insn_data
[(int) CODE_FOR_cmpstrsi
].operand
[0].mode
;
3693 len1
= c_strlen (arg1
, 1);
3694 len2
= c_strlen (arg2
, 1);
3697 len1
= size_binop (PLUS_EXPR
, ssize_int (1), len1
);
3699 len2
= size_binop (PLUS_EXPR
, ssize_int (1), len2
);
3701 /* If we don't have a constant length for the first, use the length
3702 of the second, if we know it. We don't require a constant for
3703 this case; some cost analysis could be done if both are available
3704 but neither is constant. For now, assume they're equally cheap,
3705 unless one has side effects. If both strings have constant lengths,
3712 else if (TREE_SIDE_EFFECTS (len1
))
3714 else if (TREE_SIDE_EFFECTS (len2
))
3716 else if (TREE_CODE (len1
) != INTEGER_CST
)
3718 else if (TREE_CODE (len2
) != INTEGER_CST
)
3720 else if (tree_int_cst_lt (len1
, len2
))
3725 /* If both arguments have side effects, we cannot optimize. */
3726 if (!len
|| TREE_SIDE_EFFECTS (len
))
3729 /* The actual new length parameter is MIN(len,arg3). */
3730 len
= fold (build2 (MIN_EXPR
, TREE_TYPE (len
), len
,
3731 fold_convert (TREE_TYPE (len
), arg3
)));
3733 /* If we don't have POINTER_TYPE, call the function. */
3734 if (arg1_align
== 0 || arg2_align
== 0)
3737 /* Make a place to write the result of the instruction. */
3740 && REG_P (result
) && GET_MODE (result
) == insn_mode
3741 && REGNO (result
) >= FIRST_PSEUDO_REGISTER
))
3742 result
= gen_reg_rtx (insn_mode
);
3744 /* Stabilize the arguments in case gen_cmpstrsi fails. */
3745 arg1
= builtin_save_expr (arg1
);
3746 arg2
= builtin_save_expr (arg2
);
3747 len
= builtin_save_expr (len
);
3749 arg1_rtx
= get_memory_rtx (arg1
);
3750 arg2_rtx
= get_memory_rtx (arg2
);
3751 arg3_rtx
= expand_expr (len
, NULL_RTX
, VOIDmode
, 0);
3752 insn
= gen_cmpstrsi (result
, arg1_rtx
, arg2_rtx
, arg3_rtx
,
3753 GEN_INT (MIN (arg1_align
, arg2_align
)));
3758 /* Return the value in the proper mode for this function. */
3759 mode
= TYPE_MODE (TREE_TYPE (exp
));
3760 if (GET_MODE (result
) == mode
)
3763 return convert_to_mode (mode
, result
, 0);
3764 convert_move (target
, result
, 0);
3768 /* Expand the library call ourselves using a stabilized argument
3769 list to avoid re-evaluating the function's arguments twice. */
3770 arglist
= build_tree_list (NULL_TREE
, len
);
3771 arglist
= tree_cons (NULL_TREE
, arg2
, arglist
);
3772 arglist
= tree_cons (NULL_TREE
, arg1
, arglist
);
3773 fndecl
= get_callee_fndecl (exp
);
3774 fn
= build_function_call_expr (fndecl
, arglist
);
3775 if (TREE_CODE (fn
) == CALL_EXPR
)
3776 CALL_EXPR_TAILCALL (fn
) = CALL_EXPR_TAILCALL (exp
);
3777 return expand_call (fn
, target
, target
== const0_rtx
);
3783 /* Expand expression EXP, which is a call to the strcat builtin.
3784 Return 0 if we failed the caller should emit a normal call,
3785 otherwise try to get the result in TARGET, if convenient. */
3788 expand_builtin_strcat (tree arglist
, tree type
, rtx target
, enum machine_mode mode
)
3790 if (!validate_arglist (arglist
, POINTER_TYPE
, POINTER_TYPE
, VOID_TYPE
))
3794 tree dst
= TREE_VALUE (arglist
),
3795 src
= TREE_VALUE (TREE_CHAIN (arglist
));
3796 const char *p
= c_getstr (src
);
3800 /* If the string length is zero, return the dst parameter. */
3802 return expand_expr (dst
, target
, mode
, EXPAND_NORMAL
);
3803 else if (!optimize_size
)
3805 /* Otherwise if !optimize_size, see if we can store by
3806 pieces into (dst + strlen(dst)). */
3807 tree newdst
, arglist
,
3808 strlen_fn
= implicit_built_in_decls
[BUILT_IN_STRLEN
];
3810 /* This is the length argument. */
3811 arglist
= build_tree_list (NULL_TREE
,
3812 fold (size_binop (PLUS_EXPR
,
3815 /* Prepend src argument. */
3816 arglist
= tree_cons (NULL_TREE
, src
, arglist
);
3818 /* We're going to use dst more than once. */
3819 dst
= builtin_save_expr (dst
);
3821 /* Create strlen (dst). */
3823 fold (build_function_call_expr (strlen_fn
,
3824 build_tree_list (NULL_TREE
,
3826 /* Create (dst + (cast) strlen (dst)). */
3827 newdst
= fold_convert (TREE_TYPE (dst
), newdst
);
3828 newdst
= fold (build2 (PLUS_EXPR
, TREE_TYPE (dst
), dst
, newdst
));
3830 /* Prepend the new dst argument. */
3831 arglist
= tree_cons (NULL_TREE
, newdst
, arglist
);
3833 /* We don't want to get turned into a memcpy if the
3834 target is const0_rtx, i.e. when the return value
3835 isn't used. That would produce pessimized code so
3836 pass in a target of zero, it should never actually be
3837 used. If this was successful return the original
3838 dst, not the result of mempcpy. */
3839 if (expand_builtin_mempcpy (arglist
, type
, /*target=*/0, mode
, /*endp=*/0))
3840 return expand_expr (dst
, target
, mode
, EXPAND_NORMAL
);
3850 /* Expand expression EXP, which is a call to the strncat builtin.
3851 Return 0 if we failed the caller should emit a normal call,
3852 otherwise try to get the result in TARGET, if convenient. */
3855 expand_builtin_strncat (tree arglist
, rtx target
, enum machine_mode mode
)
3857 if (validate_arglist (arglist
,
3858 POINTER_TYPE
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
3860 tree result
= fold_builtin_strncat (arglist
);
3862 return expand_expr (result
, target
, mode
, EXPAND_NORMAL
);
3867 /* Expand expression EXP, which is a call to the strspn builtin.
3868 Return 0 if we failed the caller should emit a normal call,
3869 otherwise try to get the result in TARGET, if convenient. */
3872 expand_builtin_strspn (tree arglist
, rtx target
, enum machine_mode mode
)
3874 if (validate_arglist (arglist
, POINTER_TYPE
, POINTER_TYPE
, VOID_TYPE
))
3876 tree result
= fold_builtin_strspn (arglist
);
3878 return expand_expr (result
, target
, mode
, EXPAND_NORMAL
);
3883 /* Expand expression EXP, which is a call to the strcspn builtin.
3884 Return 0 if we failed the caller should emit a normal call,
3885 otherwise try to get the result in TARGET, if convenient. */
3888 expand_builtin_strcspn (tree arglist
, rtx target
, enum machine_mode mode
)
3890 if (validate_arglist (arglist
, POINTER_TYPE
, POINTER_TYPE
, VOID_TYPE
))
3892 tree result
= fold_builtin_strcspn (arglist
);
3894 return expand_expr (result
, target
, mode
, EXPAND_NORMAL
);
3899 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
3900 if that's convenient. */
3903 expand_builtin_saveregs (void)
3907 /* Don't do __builtin_saveregs more than once in a function.
3908 Save the result of the first call and reuse it. */
3909 if (saveregs_value
!= 0)
3910 return saveregs_value
;
3912 /* When this function is called, it means that registers must be
3913 saved on entry to this function. So we migrate the call to the
3914 first insn of this function. */
3918 /* Do whatever the machine needs done in this case. */
3919 val
= targetm
.calls
.expand_builtin_saveregs ();
3924 saveregs_value
= val
;
3926 /* Put the insns after the NOTE that starts the function. If this
3927 is inside a start_sequence, make the outer-level insn chain current, so
3928 the code is placed at the start of the function. */
3929 push_topmost_sequence ();
3930 emit_insn_after (seq
, entry_of_function ());
3931 pop_topmost_sequence ();
3936 /* __builtin_args_info (N) returns word N of the arg space info
3937 for the current function. The number and meanings of words
3938 is controlled by the definition of CUMULATIVE_ARGS. */
3941 expand_builtin_args_info (tree arglist
)
3943 int nwords
= sizeof (CUMULATIVE_ARGS
) / sizeof (int);
3944 int *word_ptr
= (int *) ¤t_function_args_info
;
3946 gcc_assert (sizeof (CUMULATIVE_ARGS
) % sizeof (int) == 0);
3950 if (!host_integerp (TREE_VALUE (arglist
), 0))
3951 error ("argument of %<__builtin_args_info%> must be constant");
3954 HOST_WIDE_INT wordnum
= tree_low_cst (TREE_VALUE (arglist
), 0);
3956 if (wordnum
< 0 || wordnum
>= nwords
)
3957 error ("argument of %<__builtin_args_info%> out of range");
3959 return GEN_INT (word_ptr
[wordnum
]);
3963 error ("missing argument in %<__builtin_args_info%>");
3968 /* Expand a call to __builtin_next_arg. */
3971 expand_builtin_next_arg (void)
3973 /* Checking arguments is already done in fold_builtin_next_arg
3974 that must be called before this function. */
3975 return expand_binop (Pmode
, add_optab
,
3976 current_function_internal_arg_pointer
,
3977 current_function_arg_offset_rtx
,
3978 NULL_RTX
, 0, OPTAB_LIB_WIDEN
);
3981 /* Make it easier for the backends by protecting the valist argument
3982 from multiple evaluations. */
3985 stabilize_va_list (tree valist
, int needs_lvalue
)
3987 if (TREE_CODE (va_list_type_node
) == ARRAY_TYPE
)
3989 if (TREE_SIDE_EFFECTS (valist
))
3990 valist
= save_expr (valist
);
3992 /* For this case, the backends will be expecting a pointer to
3993 TREE_TYPE (va_list_type_node), but it's possible we've
3994 actually been given an array (an actual va_list_type_node).
3996 if (TREE_CODE (TREE_TYPE (valist
)) == ARRAY_TYPE
)
3998 tree p1
= build_pointer_type (TREE_TYPE (va_list_type_node
));
3999 valist
= build_fold_addr_expr_with_type (valist
, p1
);
4008 if (! TREE_SIDE_EFFECTS (valist
))
4011 pt
= build_pointer_type (va_list_type_node
);
4012 valist
= fold (build1 (ADDR_EXPR
, pt
, valist
));
4013 TREE_SIDE_EFFECTS (valist
) = 1;
4016 if (TREE_SIDE_EFFECTS (valist
))
4017 valist
= save_expr (valist
);
4018 valist
= build_fold_indirect_ref (valist
);
4024 /* The "standard" definition of va_list is void*. */
4027 std_build_builtin_va_list (void)
4029 return ptr_type_node
;
4032 /* The "standard" implementation of va_start: just assign `nextarg' to
4036 std_expand_builtin_va_start (tree valist
, rtx nextarg
)
4040 t
= build2 (MODIFY_EXPR
, TREE_TYPE (valist
), valist
,
4041 make_tree (ptr_type_node
, nextarg
));
4042 TREE_SIDE_EFFECTS (t
) = 1;
4044 expand_expr (t
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
4047 /* Expand ARGLIST, from a call to __builtin_va_start. */
4050 expand_builtin_va_start (tree arglist
)
4055 chain
= TREE_CHAIN (arglist
);
4059 error ("too few arguments to function %<va_start%>");
4063 if (fold_builtin_next_arg (chain
))
4066 nextarg
= expand_builtin_next_arg ();
4067 valist
= stabilize_va_list (TREE_VALUE (arglist
), 1);
4069 #ifdef EXPAND_BUILTIN_VA_START
4070 EXPAND_BUILTIN_VA_START (valist
, nextarg
);
4072 std_expand_builtin_va_start (valist
, nextarg
);
4078 /* The "standard" implementation of va_arg: read the value from the
4079 current (padded) address and increment by the (padded) size. */
4082 std_gimplify_va_arg_expr (tree valist
, tree type
, tree
*pre_p
, tree
*post_p
)
4084 tree addr
, t
, type_size
, rounded_size
, valist_tmp
;
4085 unsigned HOST_WIDE_INT align
, boundary
;
4088 #ifdef ARGS_GROW_DOWNWARD
4089 /* All of the alignment and movement below is for args-grow-up machines.
4090 As of 2004, there are only 3 ARGS_GROW_DOWNWARD targets, and they all
4091 implement their own specialized gimplify_va_arg_expr routines. */
4095 indirect
= pass_by_reference (NULL
, TYPE_MODE (type
), type
, false);
4097 type
= build_pointer_type (type
);
4099 align
= PARM_BOUNDARY
/ BITS_PER_UNIT
;
4100 boundary
= FUNCTION_ARG_BOUNDARY (TYPE_MODE (type
), type
) / BITS_PER_UNIT
;
4102 /* Hoist the valist value into a temporary for the moment. */
4103 valist_tmp
= get_initialized_tmp_var (valist
, pre_p
, NULL
);
4105 /* va_list pointer is aligned to PARM_BOUNDARY. If argument actually
4106 requires greater alignment, we must perform dynamic alignment. */
4107 if (boundary
> align
)
4109 t
= fold_convert (TREE_TYPE (valist
), size_int (boundary
- 1));
4110 t
= build2 (MODIFY_EXPR
, TREE_TYPE (valist
), valist_tmp
,
4111 build2 (PLUS_EXPR
, TREE_TYPE (valist
), valist_tmp
, t
));
4112 gimplify_and_add (t
, pre_p
);
4114 t
= fold_convert (TREE_TYPE (valist
), size_int (-boundary
));
4115 t
= build2 (MODIFY_EXPR
, TREE_TYPE (valist
), valist_tmp
,
4116 build2 (BIT_AND_EXPR
, TREE_TYPE (valist
), valist_tmp
, t
));
4117 gimplify_and_add (t
, pre_p
);
4122 /* If the actual alignment is less than the alignment of the type,
4123 adjust the type accordingly so that we don't assume strict alignment
4124 when deferencing the pointer. */
4125 boundary
*= BITS_PER_UNIT
;
4126 if (boundary
< TYPE_ALIGN (type
))
4128 type
= build_variant_type_copy (type
);
4129 TYPE_ALIGN (type
) = boundary
;
4132 /* Compute the rounded size of the type. */
4133 type_size
= size_in_bytes (type
);
4134 rounded_size
= round_up (type_size
, align
);
4136 /* Reduce rounded_size so it's sharable with the postqueue. */
4137 gimplify_expr (&rounded_size
, pre_p
, post_p
, is_gimple_val
, fb_rvalue
);
4141 if (PAD_VARARGS_DOWN
&& !integer_zerop (rounded_size
))
4143 /* Small args are padded downward. */
4144 t
= fold (build2 (GT_EXPR
, sizetype
, rounded_size
, size_int (align
)));
4145 t
= fold (build3 (COND_EXPR
, sizetype
, t
, size_zero_node
,
4146 size_binop (MINUS_EXPR
, rounded_size
, type_size
)));
4147 t
= fold_convert (TREE_TYPE (addr
), t
);
4148 addr
= fold (build2 (PLUS_EXPR
, TREE_TYPE (addr
), addr
, t
));
4151 /* Compute new value for AP. */
4152 t
= fold_convert (TREE_TYPE (valist
), rounded_size
);
4153 t
= build2 (PLUS_EXPR
, TREE_TYPE (valist
), valist_tmp
, t
);
4154 t
= build2 (MODIFY_EXPR
, TREE_TYPE (valist
), valist
, t
);
4155 gimplify_and_add (t
, pre_p
);
4157 addr
= fold_convert (build_pointer_type (type
), addr
);
4160 addr
= build_va_arg_indirect_ref (addr
);
4162 return build_va_arg_indirect_ref (addr
);
4165 /* Build an indirect-ref expression over the given TREE, which represents a
4166 piece of a va_arg() expansion. */
4168 build_va_arg_indirect_ref (tree addr
)
4170 addr
= build_fold_indirect_ref (addr
);
4172 if (flag_mudflap
) /* Don't instrument va_arg INDIRECT_REF. */
4178 /* Return a dummy expression of type TYPE in order to keep going after an
4182 dummy_object (tree type
)
4184 tree t
= convert (build_pointer_type (type
), null_pointer_node
);
4185 return build1 (INDIRECT_REF
, type
, t
);
4188 /* Gimplify __builtin_va_arg, aka VA_ARG_EXPR, which is not really a
4189 builtin function, but a very special sort of operator. */
4191 enum gimplify_status
4192 gimplify_va_arg_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
)
4194 tree promoted_type
, want_va_type
, have_va_type
;
4195 tree valist
= TREE_OPERAND (*expr_p
, 0);
4196 tree type
= TREE_TYPE (*expr_p
);
4199 /* Verify that valist is of the proper type. */
4200 want_va_type
= va_list_type_node
;
4201 have_va_type
= TREE_TYPE (valist
);
4203 if (have_va_type
== error_mark_node
)
4206 if (TREE_CODE (want_va_type
) == ARRAY_TYPE
)
4208 /* If va_list is an array type, the argument may have decayed
4209 to a pointer type, e.g. by being passed to another function.
4210 In that case, unwrap both types so that we can compare the
4211 underlying records. */
4212 if (TREE_CODE (have_va_type
) == ARRAY_TYPE
4213 || POINTER_TYPE_P (have_va_type
))
4215 want_va_type
= TREE_TYPE (want_va_type
);
4216 have_va_type
= TREE_TYPE (have_va_type
);
4220 if (TYPE_MAIN_VARIANT (want_va_type
) != TYPE_MAIN_VARIANT (have_va_type
))
4222 error ("first argument to %<va_arg%> not of type %<va_list%>");
4226 /* Generate a diagnostic for requesting data of a type that cannot
4227 be passed through `...' due to type promotion at the call site. */
4228 else if ((promoted_type
= lang_hooks
.types
.type_promotes_to (type
))
4231 static bool gave_help
;
4233 /* Unfortunately, this is merely undefined, rather than a constraint
4234 violation, so we cannot make this an error. If this call is never
4235 executed, the program is still strictly conforming. */
4236 warning (0, "%qT is promoted to %qT when passed through %<...%>",
4237 type
, promoted_type
);
4241 warning (0, "(so you should pass %qT not %qT to %<va_arg%>)",
4242 promoted_type
, type
);
4245 /* We can, however, treat "undefined" any way we please.
4246 Call abort to encourage the user to fix the program. */
4247 inform ("if this code is reached, the program will abort");
4248 t
= build_function_call_expr (implicit_built_in_decls
[BUILT_IN_TRAP
],
4250 append_to_statement_list (t
, pre_p
);
4252 /* This is dead code, but go ahead and finish so that the
4253 mode of the result comes out right. */
4254 *expr_p
= dummy_object (type
);
4259 /* Make it easier for the backends by protecting the valist argument
4260 from multiple evaluations. */
4261 if (TREE_CODE (va_list_type_node
) == ARRAY_TYPE
)
4263 /* For this case, the backends will be expecting a pointer to
4264 TREE_TYPE (va_list_type_node), but it's possible we've
4265 actually been given an array (an actual va_list_type_node).
4267 if (TREE_CODE (TREE_TYPE (valist
)) == ARRAY_TYPE
)
4269 tree p1
= build_pointer_type (TREE_TYPE (va_list_type_node
));
4270 valist
= build_fold_addr_expr_with_type (valist
, p1
);
4272 gimplify_expr (&valist
, pre_p
, post_p
, is_gimple_val
, fb_rvalue
);
4275 gimplify_expr (&valist
, pre_p
, post_p
, is_gimple_min_lval
, fb_lvalue
);
4277 if (!targetm
.gimplify_va_arg_expr
)
4278 /* FIXME:Once most targets are converted we should merely
4279 assert this is non-null. */
4282 *expr_p
= targetm
.gimplify_va_arg_expr (valist
, type
, pre_p
, post_p
);
4287 /* Expand ARGLIST, from a call to __builtin_va_end. */
4290 expand_builtin_va_end (tree arglist
)
4292 tree valist
= TREE_VALUE (arglist
);
4294 /* Evaluate for side effects, if needed. I hate macros that don't
4296 if (TREE_SIDE_EFFECTS (valist
))
4297 expand_expr (valist
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
4302 /* Expand ARGLIST, from a call to __builtin_va_copy. We do this as a
4303 builtin rather than just as an assignment in stdarg.h because of the
4304 nastiness of array-type va_list types. */
4307 expand_builtin_va_copy (tree arglist
)
4311 dst
= TREE_VALUE (arglist
);
4312 src
= TREE_VALUE (TREE_CHAIN (arglist
));
4314 dst
= stabilize_va_list (dst
, 1);
4315 src
= stabilize_va_list (src
, 0);
4317 if (TREE_CODE (va_list_type_node
) != ARRAY_TYPE
)
4319 t
= build2 (MODIFY_EXPR
, va_list_type_node
, dst
, src
);
4320 TREE_SIDE_EFFECTS (t
) = 1;
4321 expand_expr (t
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
4325 rtx dstb
, srcb
, size
;
4327 /* Evaluate to pointers. */
4328 dstb
= expand_expr (dst
, NULL_RTX
, Pmode
, EXPAND_NORMAL
);
4329 srcb
= expand_expr (src
, NULL_RTX
, Pmode
, EXPAND_NORMAL
);
4330 size
= expand_expr (TYPE_SIZE_UNIT (va_list_type_node
), NULL_RTX
,
4331 VOIDmode
, EXPAND_NORMAL
);
4333 dstb
= convert_memory_address (Pmode
, dstb
);
4334 srcb
= convert_memory_address (Pmode
, srcb
);
4336 /* "Dereference" to BLKmode memories. */
4337 dstb
= gen_rtx_MEM (BLKmode
, dstb
);
4338 set_mem_alias_set (dstb
, get_alias_set (TREE_TYPE (TREE_TYPE (dst
))));
4339 set_mem_align (dstb
, TYPE_ALIGN (va_list_type_node
));
4340 srcb
= gen_rtx_MEM (BLKmode
, srcb
);
4341 set_mem_alias_set (srcb
, get_alias_set (TREE_TYPE (TREE_TYPE (src
))));
4342 set_mem_align (srcb
, TYPE_ALIGN (va_list_type_node
));
4345 emit_block_move (dstb
, srcb
, size
, BLOCK_OP_NORMAL
);
4351 /* Expand a call to one of the builtin functions __builtin_frame_address or
4352 __builtin_return_address. */
4355 expand_builtin_frame_address (tree fndecl
, tree arglist
)
4357 /* The argument must be a nonnegative integer constant.
4358 It counts the number of frames to scan up the stack.
4359 The value is the return address saved in that frame. */
4361 /* Warning about missing arg was already issued. */
4363 else if (! host_integerp (TREE_VALUE (arglist
), 1))
4365 if (DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_FRAME_ADDRESS
)
4366 error ("invalid argument to %<__builtin_frame_address%>");
4368 error ("invalid argument to %<__builtin_return_address%>");
4374 = expand_builtin_return_addr (DECL_FUNCTION_CODE (fndecl
),
4375 tree_low_cst (TREE_VALUE (arglist
), 1));
4377 /* Some ports cannot access arbitrary stack frames. */
4380 if (DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_FRAME_ADDRESS
)
4381 warning (0, "unsupported argument to %<__builtin_frame_address%>");
4383 warning (0, "unsupported argument to %<__builtin_return_address%>");
4387 /* For __builtin_frame_address, return what we've got. */
4388 if (DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_FRAME_ADDRESS
)
4392 && ! CONSTANT_P (tem
))
4393 tem
= copy_to_mode_reg (Pmode
, tem
);
4398 /* Expand a call to the alloca builtin, with arguments ARGLIST. Return 0 if
4399 we failed and the caller should emit a normal call, otherwise try to get
4400 the result in TARGET, if convenient. */
4403 expand_builtin_alloca (tree arglist
, rtx target
)
4408 /* In -fmudflap-instrumented code, alloca() and __builtin_alloca()
4409 should always expand to function calls. These can be intercepted
4414 if (!validate_arglist (arglist
, INTEGER_TYPE
, VOID_TYPE
))
4417 /* Compute the argument. */
4418 op0
= expand_expr (TREE_VALUE (arglist
), NULL_RTX
, VOIDmode
, 0);
4420 /* Allocate the desired space. */
4421 result
= allocate_dynamic_stack_space (op0
, target
, BITS_PER_UNIT
);
4422 result
= convert_memory_address (ptr_mode
, result
);
4427 /* Expand a call to a unary builtin. The arguments are in ARGLIST.
4428 Return 0 if a normal call should be emitted rather than expanding the
4429 function in-line. If convenient, the result should be placed in TARGET.
4430 SUBTARGET may be used as the target for computing one of EXP's operands. */
4433 expand_builtin_unop (enum machine_mode target_mode
, tree arglist
, rtx target
,
4434 rtx subtarget
, optab op_optab
)
4437 if (!validate_arglist (arglist
, INTEGER_TYPE
, VOID_TYPE
))
4440 /* Compute the argument. */
4441 op0
= expand_expr (TREE_VALUE (arglist
), subtarget
, VOIDmode
, 0);
4442 /* Compute op, into TARGET if possible.
4443 Set TARGET to wherever the result comes back. */
4444 target
= expand_unop (TYPE_MODE (TREE_TYPE (TREE_VALUE (arglist
))),
4445 op_optab
, op0
, target
, 1);
4446 gcc_assert (target
);
4448 return convert_to_mode (target_mode
, target
, 0);
4451 /* If the string passed to fputs is a constant and is one character
4452 long, we attempt to transform this call into __builtin_fputc(). */
4455 expand_builtin_fputs (tree arglist
, rtx target
, bool unlocked
)
4457 /* Verify the arguments in the original call. */
4458 if (validate_arglist (arglist
, POINTER_TYPE
, POINTER_TYPE
, VOID_TYPE
))
4460 tree result
= fold_builtin_fputs (arglist
, (target
== const0_rtx
),
4461 unlocked
, NULL_TREE
);
4463 return expand_expr (result
, target
, VOIDmode
, EXPAND_NORMAL
);
4468 /* Expand a call to __builtin_expect. We return our argument and emit a
4469 NOTE_INSN_EXPECTED_VALUE note. This is the expansion of __builtin_expect in
4470 a non-jump context. */
4473 expand_builtin_expect (tree arglist
, rtx target
)
4478 if (arglist
== NULL_TREE
4479 || TREE_CHAIN (arglist
) == NULL_TREE
)
4481 exp
= TREE_VALUE (arglist
);
4482 c
= TREE_VALUE (TREE_CHAIN (arglist
));
4484 if (TREE_CODE (c
) != INTEGER_CST
)
4486 error ("second argument to %<__builtin_expect%> must be a constant");
4487 c
= integer_zero_node
;
4490 target
= expand_expr (exp
, target
, VOIDmode
, EXPAND_NORMAL
);
4492 /* Don't bother with expected value notes for integral constants. */
4493 if (flag_guess_branch_prob
&& GET_CODE (target
) != CONST_INT
)
4495 /* We do need to force this into a register so that we can be
4496 moderately sure to be able to correctly interpret the branch
4498 target
= force_reg (GET_MODE (target
), target
);
4500 rtx_c
= expand_expr (c
, NULL_RTX
, GET_MODE (target
), EXPAND_NORMAL
);
4502 note
= emit_note (NOTE_INSN_EXPECTED_VALUE
);
4503 NOTE_EXPECTED_VALUE (note
) = gen_rtx_EQ (VOIDmode
, target
, rtx_c
);
4509 /* Like expand_builtin_expect, except do this in a jump context. This is
4510 called from do_jump if the conditional is a __builtin_expect. Return either
4511 a list of insns to emit the jump or NULL if we cannot optimize
4512 __builtin_expect. We need to optimize this at jump time so that machines
4513 like the PowerPC don't turn the test into a SCC operation, and then jump
4514 based on the test being 0/1. */
4517 expand_builtin_expect_jump (tree exp
, rtx if_false_label
, rtx if_true_label
)
4519 tree arglist
= TREE_OPERAND (exp
, 1);
4520 tree arg0
= TREE_VALUE (arglist
);
4521 tree arg1
= TREE_VALUE (TREE_CHAIN (arglist
));
4524 /* Only handle __builtin_expect (test, 0) and
4525 __builtin_expect (test, 1). */
4526 if (TREE_CODE (TREE_TYPE (arg1
)) == INTEGER_TYPE
4527 && (integer_zerop (arg1
) || integer_onep (arg1
)))
4529 rtx insn
, drop_through_label
, temp
;
4531 /* Expand the jump insns. */
4533 do_jump (arg0
, if_false_label
, if_true_label
);
4536 drop_through_label
= get_last_insn ();
4537 if (drop_through_label
&& NOTE_P (drop_through_label
))
4538 drop_through_label
= prev_nonnote_insn (drop_through_label
);
4539 if (drop_through_label
&& !LABEL_P (drop_through_label
))
4540 drop_through_label
= NULL_RTX
;
4543 if (! if_true_label
)
4544 if_true_label
= drop_through_label
;
4545 if (! if_false_label
)
4546 if_false_label
= drop_through_label
;
4548 /* Go through and add the expect's to each of the conditional jumps. */
4550 while (insn
!= NULL_RTX
)
4552 rtx next
= NEXT_INSN (insn
);
4554 if (JUMP_P (insn
) && any_condjump_p (insn
))
4556 rtx ifelse
= SET_SRC (pc_set (insn
));
4557 rtx then_dest
= XEXP (ifelse
, 1);
4558 rtx else_dest
= XEXP (ifelse
, 2);
4561 /* First check if we recognize any of the labels. */
4562 if (GET_CODE (then_dest
) == LABEL_REF
4563 && XEXP (then_dest
, 0) == if_true_label
)
4565 else if (GET_CODE (then_dest
) == LABEL_REF
4566 && XEXP (then_dest
, 0) == if_false_label
)
4568 else if (GET_CODE (else_dest
) == LABEL_REF
4569 && XEXP (else_dest
, 0) == if_false_label
)
4571 else if (GET_CODE (else_dest
) == LABEL_REF
4572 && XEXP (else_dest
, 0) == if_true_label
)
4574 /* Otherwise check where we drop through. */
4575 else if (else_dest
== pc_rtx
)
4577 if (next
&& NOTE_P (next
))
4578 next
= next_nonnote_insn (next
);
4580 if (next
&& JUMP_P (next
)
4581 && any_uncondjump_p (next
))
4582 temp
= XEXP (SET_SRC (pc_set (next
)), 0);
4586 /* TEMP is either a CODE_LABEL, NULL_RTX or something
4587 else that can't possibly match either target label. */
4588 if (temp
== if_false_label
)
4590 else if (temp
== if_true_label
)
4593 else if (then_dest
== pc_rtx
)
4595 if (next
&& NOTE_P (next
))
4596 next
= next_nonnote_insn (next
);
4598 if (next
&& JUMP_P (next
)
4599 && any_uncondjump_p (next
))
4600 temp
= XEXP (SET_SRC (pc_set (next
)), 0);
4604 if (temp
== if_false_label
)
4606 else if (temp
== if_true_label
)
4612 /* If the test is expected to fail, reverse the
4614 if (integer_zerop (arg1
))
4616 predict_insn_def (insn
, PRED_BUILTIN_EXPECT
, taken
);
4628 expand_builtin_trap (void)
4632 emit_insn (gen_trap ());
4635 emit_library_call (abort_libfunc
, LCT_NORETURN
, VOIDmode
, 0);
4639 /* Expand a call to fabs, fabsf or fabsl with arguments ARGLIST.
4640 Return 0 if a normal call should be emitted rather than expanding
4641 the function inline. If convenient, the result should be placed
4642 in TARGET. SUBTARGET may be used as the target for computing
4646 expand_builtin_fabs (tree arglist
, rtx target
, rtx subtarget
)
4648 enum machine_mode mode
;
4652 if (!validate_arglist (arglist
, REAL_TYPE
, VOID_TYPE
))
4655 arg
= TREE_VALUE (arglist
);
4656 mode
= TYPE_MODE (TREE_TYPE (arg
));
4657 op0
= expand_expr (arg
, subtarget
, VOIDmode
, 0);
4658 return expand_abs (mode
, op0
, target
, 0, safe_from_p (target
, arg
, 1));
4661 /* Expand a call to copysign, copysignf, or copysignl with arguments ARGLIST.
4662 Return NULL is a normal call should be emitted rather than expanding the
4663 function inline. If convenient, the result should be placed in TARGET.
4664 SUBTARGET may be used as the target for computing the operand. */
4667 expand_builtin_copysign (tree arglist
, rtx target
, rtx subtarget
)
4672 if (!validate_arglist (arglist
, REAL_TYPE
, REAL_TYPE
, VOID_TYPE
))
4675 arg
= TREE_VALUE (arglist
);
4676 op0
= expand_expr (arg
, subtarget
, VOIDmode
, 0);
4678 arg
= TREE_VALUE (TREE_CHAIN (arglist
));
4679 op1
= expand_expr (arg
, NULL
, VOIDmode
, 0);
4681 return expand_copysign (op0
, op1
, target
);
4684 /* Create a new constant string literal and return a char* pointer to it.
4685 The STRING_CST value is the LEN characters at STR. */
4687 build_string_literal (int len
, const char *str
)
4689 tree t
, elem
, index
, type
;
4691 t
= build_string (len
, str
);
4692 elem
= build_type_variant (char_type_node
, 1, 0);
4693 index
= build_index_type (build_int_cst (NULL_TREE
, len
- 1));
4694 type
= build_array_type (elem
, index
);
4695 TREE_TYPE (t
) = type
;
4696 TREE_CONSTANT (t
) = 1;
4697 TREE_INVARIANT (t
) = 1;
4698 TREE_READONLY (t
) = 1;
4699 TREE_STATIC (t
) = 1;
4701 type
= build_pointer_type (type
);
4702 t
= build1 (ADDR_EXPR
, type
, t
);
4704 type
= build_pointer_type (elem
);
4705 t
= build1 (NOP_EXPR
, type
, t
);
4709 /* Expand EXP, a call to printf or printf_unlocked.
4710 Return 0 if a normal call should be emitted rather than transforming
4711 the function inline. If convenient, the result should be placed in
4712 TARGET with mode MODE. UNLOCKED indicates this is a printf_unlocked
4715 expand_builtin_printf (tree exp
, rtx target
, enum machine_mode mode
,
4718 tree arglist
= TREE_OPERAND (exp
, 1);
4719 tree fn_putchar
= unlocked
4720 ? implicit_built_in_decls
[BUILT_IN_PUTCHAR_UNLOCKED
]
4721 : implicit_built_in_decls
[BUILT_IN_PUTCHAR
];
4722 tree fn_puts
= unlocked
? implicit_built_in_decls
[BUILT_IN_PUTS_UNLOCKED
]
4723 : implicit_built_in_decls
[BUILT_IN_PUTS
];
4724 const char *fmt_str
;
4727 /* If the return value is used, don't do the transformation. */
4728 if (target
!= const0_rtx
)
4731 /* Verify the required arguments in the original call. */
4734 fmt
= TREE_VALUE (arglist
);
4735 if (! POINTER_TYPE_P (TREE_TYPE (fmt
)))
4737 arglist
= TREE_CHAIN (arglist
);
4739 /* Check whether the format is a literal string constant. */
4740 fmt_str
= c_getstr (fmt
);
4741 if (fmt_str
== NULL
)
4744 /* If the format specifier was "%s\n", call __builtin_puts(arg). */
4745 if (strcmp (fmt_str
, "%s\n") == 0)
4748 || ! POINTER_TYPE_P (TREE_TYPE (TREE_VALUE (arglist
)))
4749 || TREE_CHAIN (arglist
))
4753 /* If the format specifier was "%c", call __builtin_putchar(arg). */
4754 else if (strcmp (fmt_str
, "%c") == 0)
4757 || TREE_CODE (TREE_TYPE (TREE_VALUE (arglist
))) != INTEGER_TYPE
4758 || TREE_CHAIN (arglist
))
4764 /* We can't handle anything else with % args or %% ... yet. */
4765 if (strchr (fmt_str
, '%'))
4771 /* If the format specifier was "", printf does nothing. */
4772 if (fmt_str
[0] == '\0')
4774 /* If the format specifier has length of 1, call putchar. */
4775 if (fmt_str
[1] == '\0')
4777 /* Given printf("c"), (where c is any one character,)
4778 convert "c"[0] to an int and pass that to the replacement
4780 arg
= build_int_cst (NULL_TREE
, fmt_str
[0]);
4781 arglist
= build_tree_list (NULL_TREE
, arg
);
4786 /* If the format specifier was "string\n", call puts("string"). */
4787 size_t len
= strlen (fmt_str
);
4788 if (fmt_str
[len
- 1] == '\n')
4790 /* Create a NUL-terminated string that's one char shorter
4791 than the original, stripping off the trailing '\n'. */
4792 char *newstr
= alloca (len
);
4793 memcpy (newstr
, fmt_str
, len
- 1);
4794 newstr
[len
- 1] = 0;
4796 arg
= build_string_literal (len
, newstr
);
4797 arglist
= build_tree_list (NULL_TREE
, arg
);
4801 /* We'd like to arrange to call fputs(string,stdout) here,
4802 but we need stdout and don't have a way to get it yet. */
4809 fn
= build_function_call_expr (fn
, arglist
);
4810 if (TREE_CODE (fn
) == CALL_EXPR
)
4811 CALL_EXPR_TAILCALL (fn
) = CALL_EXPR_TAILCALL (exp
);
4812 return expand_expr (fn
, target
, mode
, EXPAND_NORMAL
);
4815 /* Expand EXP, a call to fprintf or fprintf_unlocked.
4816 Return 0 if a normal call should be emitted rather than transforming
4817 the function inline. If convenient, the result should be placed in
4818 TARGET with mode MODE. UNLOCKED indicates this is a fprintf_unlocked
4821 expand_builtin_fprintf (tree exp
, rtx target
, enum machine_mode mode
,
4824 tree arglist
= TREE_OPERAND (exp
, 1);
4825 tree fn_fputc
= unlocked
? implicit_built_in_decls
[BUILT_IN_FPUTC_UNLOCKED
]
4826 : implicit_built_in_decls
[BUILT_IN_FPUTC
];
4827 tree fn_fputs
= unlocked
? implicit_built_in_decls
[BUILT_IN_FPUTS_UNLOCKED
]
4828 : implicit_built_in_decls
[BUILT_IN_FPUTS
];
4829 const char *fmt_str
;
4830 tree fn
, fmt
, fp
, arg
;
4832 /* If the return value is used, don't do the transformation. */
4833 if (target
!= const0_rtx
)
4836 /* Verify the required arguments in the original call. */
4839 fp
= TREE_VALUE (arglist
);
4840 if (! POINTER_TYPE_P (TREE_TYPE (fp
)))
4842 arglist
= TREE_CHAIN (arglist
);
4845 fmt
= TREE_VALUE (arglist
);
4846 if (! POINTER_TYPE_P (TREE_TYPE (fmt
)))
4848 arglist
= TREE_CHAIN (arglist
);
4850 /* Check whether the format is a literal string constant. */
4851 fmt_str
= c_getstr (fmt
);
4852 if (fmt_str
== NULL
)
4855 /* If the format specifier was "%s", call __builtin_fputs(arg,fp). */
4856 if (strcmp (fmt_str
, "%s") == 0)
4859 || ! POINTER_TYPE_P (TREE_TYPE (TREE_VALUE (arglist
)))
4860 || TREE_CHAIN (arglist
))
4862 arg
= TREE_VALUE (arglist
);
4863 arglist
= build_tree_list (NULL_TREE
, fp
);
4864 arglist
= tree_cons (NULL_TREE
, arg
, arglist
);
4867 /* If the format specifier was "%c", call __builtin_fputc(arg,fp). */
4868 else if (strcmp (fmt_str
, "%c") == 0)
4871 || TREE_CODE (TREE_TYPE (TREE_VALUE (arglist
))) != INTEGER_TYPE
4872 || TREE_CHAIN (arglist
))
4874 arg
= TREE_VALUE (arglist
);
4875 arglist
= build_tree_list (NULL_TREE
, fp
);
4876 arglist
= tree_cons (NULL_TREE
, arg
, arglist
);
4881 /* We can't handle anything else with % args or %% ... yet. */
4882 if (strchr (fmt_str
, '%'))
4888 /* If the format specifier was "", fprintf does nothing. */
4889 if (fmt_str
[0] == '\0')
4891 /* Evaluate and ignore FILE* argument for side-effects. */
4892 expand_expr (fp
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
4896 /* When "string" doesn't contain %, replace all cases of
4897 fprintf(stream,string) with fputs(string,stream). The fputs
4898 builtin will take care of special cases like length == 1. */
4899 arglist
= build_tree_list (NULL_TREE
, fp
);
4900 arglist
= tree_cons (NULL_TREE
, fmt
, arglist
);
4906 fn
= build_function_call_expr (fn
, arglist
);
4907 if (TREE_CODE (fn
) == CALL_EXPR
)
4908 CALL_EXPR_TAILCALL (fn
) = CALL_EXPR_TAILCALL (exp
);
4909 return expand_expr (fn
, target
, mode
, EXPAND_NORMAL
);
4912 /* Expand a call to sprintf with argument list ARGLIST. Return 0 if
4913 a normal call should be emitted rather than expanding the function
4914 inline. If convenient, the result should be placed in TARGET with
4918 expand_builtin_sprintf (tree arglist
, rtx target
, enum machine_mode mode
)
4920 tree orig_arglist
, dest
, fmt
;
4921 const char *fmt_str
;
4923 orig_arglist
= arglist
;
4925 /* Verify the required arguments in the original call. */
4928 dest
= TREE_VALUE (arglist
);
4929 if (! POINTER_TYPE_P (TREE_TYPE (dest
)))
4931 arglist
= TREE_CHAIN (arglist
);
4934 fmt
= TREE_VALUE (arglist
);
4935 if (! POINTER_TYPE_P (TREE_TYPE (fmt
)))
4937 arglist
= TREE_CHAIN (arglist
);
4939 /* Check whether the format is a literal string constant. */
4940 fmt_str
= c_getstr (fmt
);
4941 if (fmt_str
== NULL
)
4944 /* If the format doesn't contain % args or %%, use strcpy. */
4945 if (strchr (fmt_str
, '%') == 0)
4947 tree fn
= implicit_built_in_decls
[BUILT_IN_STRCPY
];
4950 if (arglist
|| ! fn
)
4952 expand_expr (build_function_call_expr (fn
, orig_arglist
),
4953 const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
4954 if (target
== const0_rtx
)
4956 exp
= build_int_cst (NULL_TREE
, strlen (fmt_str
));
4957 return expand_expr (exp
, target
, mode
, EXPAND_NORMAL
);
4959 /* If the format is "%s", use strcpy if the result isn't used. */
4960 else if (strcmp (fmt_str
, "%s") == 0)
4963 fn
= implicit_built_in_decls
[BUILT_IN_STRCPY
];
4968 if (! arglist
|| TREE_CHAIN (arglist
))
4970 arg
= TREE_VALUE (arglist
);
4971 if (! POINTER_TYPE_P (TREE_TYPE (arg
)))
4974 if (target
!= const0_rtx
)
4976 len
= c_strlen (arg
, 1);
4977 if (! len
|| TREE_CODE (len
) != INTEGER_CST
)
4983 arglist
= build_tree_list (NULL_TREE
, arg
);
4984 arglist
= tree_cons (NULL_TREE
, dest
, arglist
);
4985 expand_expr (build_function_call_expr (fn
, arglist
),
4986 const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
4988 if (target
== const0_rtx
)
4990 return expand_expr (len
, target
, mode
, EXPAND_NORMAL
);
4996 /* Expand a call to either the entry or exit function profiler. */
4999 expand_builtin_profile_func (bool exitp
)
5003 this = DECL_RTL (current_function_decl
);
5004 gcc_assert (MEM_P (this));
5005 this = XEXP (this, 0);
5008 which
= profile_function_exit_libfunc
;
5010 which
= profile_function_entry_libfunc
;
5012 emit_library_call (which
, LCT_NORMAL
, VOIDmode
, 2, this, Pmode
,
5013 expand_builtin_return_addr (BUILT_IN_RETURN_ADDRESS
,
5020 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
5023 round_trampoline_addr (rtx tramp
)
5025 rtx temp
, addend
, mask
;
5027 /* If we don't need too much alignment, we'll have been guaranteed
5028 proper alignment by get_trampoline_type. */
5029 if (TRAMPOLINE_ALIGNMENT
<= STACK_BOUNDARY
)
5032 /* Round address up to desired boundary. */
5033 temp
= gen_reg_rtx (Pmode
);
5034 addend
= GEN_INT (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
- 1);
5035 mask
= GEN_INT (-TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
5037 temp
= expand_simple_binop (Pmode
, PLUS
, tramp
, addend
,
5038 temp
, 0, OPTAB_LIB_WIDEN
);
5039 tramp
= expand_simple_binop (Pmode
, AND
, temp
, mask
,
5040 temp
, 0, OPTAB_LIB_WIDEN
);
5046 expand_builtin_init_trampoline (tree arglist
)
5048 tree t_tramp
, t_func
, t_chain
;
5049 rtx r_tramp
, r_func
, r_chain
;
5050 #ifdef TRAMPOLINE_TEMPLATE
5054 if (!validate_arglist (arglist
, POINTER_TYPE
, POINTER_TYPE
,
5055 POINTER_TYPE
, VOID_TYPE
))
5058 t_tramp
= TREE_VALUE (arglist
);
5059 arglist
= TREE_CHAIN (arglist
);
5060 t_func
= TREE_VALUE (arglist
);
5061 arglist
= TREE_CHAIN (arglist
);
5062 t_chain
= TREE_VALUE (arglist
);
5064 r_tramp
= expand_expr (t_tramp
, NULL_RTX
, VOIDmode
, 0);
5065 r_func
= expand_expr (t_func
, NULL_RTX
, VOIDmode
, 0);
5066 r_chain
= expand_expr (t_chain
, NULL_RTX
, VOIDmode
, 0);
5068 /* Generate insns to initialize the trampoline. */
5069 r_tramp
= round_trampoline_addr (r_tramp
);
5070 #ifdef TRAMPOLINE_TEMPLATE
5071 blktramp
= gen_rtx_MEM (BLKmode
, r_tramp
);
5072 set_mem_align (blktramp
, TRAMPOLINE_ALIGNMENT
);
5073 emit_block_move (blktramp
, assemble_trampoline_template (),
5074 GEN_INT (TRAMPOLINE_SIZE
), BLOCK_OP_NORMAL
);
5076 trampolines_created
= 1;
5077 INITIALIZE_TRAMPOLINE (r_tramp
, r_func
, r_chain
);
5083 expand_builtin_adjust_trampoline (tree arglist
)
5087 if (!validate_arglist (arglist
, POINTER_TYPE
, VOID_TYPE
))
5090 tramp
= expand_expr (TREE_VALUE (arglist
), NULL_RTX
, VOIDmode
, 0);
5091 tramp
= round_trampoline_addr (tramp
);
5092 #ifdef TRAMPOLINE_ADJUST_ADDRESS
5093 TRAMPOLINE_ADJUST_ADDRESS (tramp
);
5099 /* Expand a call to the built-in signbit, signbitf or signbitl function.
5100 Return NULL_RTX if a normal call should be emitted rather than expanding
5101 the function in-line. EXP is the expression that is a call to the builtin
5102 function; if convenient, the result should be placed in TARGET. */
5105 expand_builtin_signbit (tree exp
, rtx target
)
5107 const struct real_format
*fmt
;
5108 enum machine_mode fmode
, imode
, rmode
;
5109 HOST_WIDE_INT hi
, lo
;
5114 arglist
= TREE_OPERAND (exp
, 1);
5115 if (!validate_arglist (arglist
, REAL_TYPE
, VOID_TYPE
))
5118 arg
= TREE_VALUE (arglist
);
5119 fmode
= TYPE_MODE (TREE_TYPE (arg
));
5120 rmode
= TYPE_MODE (TREE_TYPE (exp
));
5121 fmt
= REAL_MODE_FORMAT (fmode
);
5123 /* For floating point formats without a sign bit, implement signbit
5125 bitpos
= fmt
->signbit_ro
;
5128 /* But we can't do this if the format supports signed zero. */
5129 if (fmt
->has_signed_zero
&& HONOR_SIGNED_ZEROS (fmode
))
5132 arg
= fold (build2 (LT_EXPR
, TREE_TYPE (exp
), arg
,
5133 build_real (TREE_TYPE (arg
), dconst0
)));
5134 return expand_expr (arg
, target
, VOIDmode
, EXPAND_NORMAL
);
5137 temp
= expand_expr (arg
, NULL_RTX
, VOIDmode
, 0);
5138 if (GET_MODE_SIZE (fmode
) <= UNITS_PER_WORD
)
5140 imode
= int_mode_for_mode (fmode
);
5141 if (imode
== BLKmode
)
5143 temp
= gen_lowpart (imode
, temp
);
5148 /* Handle targets with different FP word orders. */
5149 if (FLOAT_WORDS_BIG_ENDIAN
)
5150 word
= (GET_MODE_BITSIZE (fmode
) - bitpos
) / BITS_PER_WORD
;
5152 word
= bitpos
/ BITS_PER_WORD
;
5153 temp
= operand_subword_force (temp
, word
, fmode
);
5154 bitpos
= bitpos
% BITS_PER_WORD
;
5157 /* Force the intermediate word_mode (or narrower) result into a
5158 register. This avoids attempting to create paradoxical SUBREGs
5159 of floating point modes below. */
5160 temp
= force_reg (imode
, temp
);
5162 /* If the bitpos is within the "result mode" lowpart, the operation
5163 can be implement with a single bitwise AND. Otherwise, we need
5164 a right shift and an AND. */
5166 if (bitpos
< GET_MODE_BITSIZE (rmode
))
5168 if (bitpos
< HOST_BITS_PER_WIDE_INT
)
5171 lo
= (HOST_WIDE_INT
) 1 << bitpos
;
5175 hi
= (HOST_WIDE_INT
) 1 << (bitpos
- HOST_BITS_PER_WIDE_INT
);
5180 temp
= gen_lowpart (rmode
, temp
);
5181 temp
= expand_binop (rmode
, and_optab
, temp
,
5182 immed_double_const (lo
, hi
, rmode
),
5183 NULL_RTX
, 1, OPTAB_LIB_WIDEN
);
5187 /* Perform a logical right shift to place the signbit in the least
5188 significant bit, then truncate the result to the desired mode
5189 and mask just this bit. */
5190 temp
= expand_shift (RSHIFT_EXPR
, imode
, temp
,
5191 build_int_cst (NULL_TREE
, bitpos
), NULL_RTX
, 1);
5192 temp
= gen_lowpart (rmode
, temp
);
5193 temp
= expand_binop (rmode
, and_optab
, temp
, const1_rtx
,
5194 NULL_RTX
, 1, OPTAB_LIB_WIDEN
);
5200 /* Expand fork or exec calls. TARGET is the desired target of the
5201 call. ARGLIST is the list of arguments of the call. FN is the
5202 identificator of the actual function. IGNORE is nonzero if the
5203 value is to be ignored. */
5206 expand_builtin_fork_or_exec (tree fn
, tree arglist
, rtx target
, int ignore
)
5211 /* If we are not profiling, just call the function. */
5212 if (!profile_arc_flag
)
5215 /* Otherwise call the wrapper. This should be equivalent for the rest of
5216 compiler, so the code does not diverge, and the wrapper may run the
5217 code necessary for keeping the profiling sane. */
5219 switch (DECL_FUNCTION_CODE (fn
))
5222 id
= get_identifier ("__gcov_fork");
5225 case BUILT_IN_EXECL
:
5226 id
= get_identifier ("__gcov_execl");
5229 case BUILT_IN_EXECV
:
5230 id
= get_identifier ("__gcov_execv");
5233 case BUILT_IN_EXECLP
:
5234 id
= get_identifier ("__gcov_execlp");
5237 case BUILT_IN_EXECLE
:
5238 id
= get_identifier ("__gcov_execle");
5241 case BUILT_IN_EXECVP
:
5242 id
= get_identifier ("__gcov_execvp");
5245 case BUILT_IN_EXECVE
:
5246 id
= get_identifier ("__gcov_execve");
5253 decl
= build_decl (FUNCTION_DECL
, id
, TREE_TYPE (fn
));
5254 DECL_EXTERNAL (decl
) = 1;
5255 TREE_PUBLIC (decl
) = 1;
5256 DECL_ARTIFICIAL (decl
) = 1;
5257 TREE_NOTHROW (decl
) = 1;
5258 call
= build_function_call_expr (decl
, arglist
);
5260 return expand_call (call
, target
, ignore
);
5264 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
5265 ARGLIST is the operands list to the function. CODE is the rtx code
5266 that corresponds to the arithmetic or logical operation from the name;
5267 an exception here is that NOT actually means NAND. TARGET is an optional
5268 place for us to store the results; AFTER is true if this is the
5269 fetch_and_xxx form. IGNORE is true if we don't actually care about
5270 the result of the operation at all. */
5273 expand_builtin_sync_operation (tree arglist
, enum rtx_code code
, bool after
,
5274 rtx target
, bool ignore
)
5276 enum machine_mode mode
;
5279 /* Expand the operands. */
5280 addr
= expand_expr (TREE_VALUE (arglist
), NULL
, Pmode
, EXPAND_SUM
);
5281 mode
= TYPE_MODE (TREE_TYPE (TREE_TYPE (TREE_VALUE (arglist
))));
5283 arglist
= TREE_CHAIN (arglist
);
5284 val
= expand_expr (TREE_VALUE (arglist
), NULL
, mode
, EXPAND_NORMAL
);
5286 /* Note that we explicitly do not want any alias information for this
5287 memory, so that we kill all other live memories. Otherwise we don't
5288 satisfy the full barrier semantics of the intrinsic. */
5289 mem
= validize_mem (gen_rtx_MEM (mode
, addr
));
5290 MEM_VOLATILE_P (mem
) = 1;
5293 return expand_sync_operation (mem
, val
, code
);
5295 return expand_sync_fetch_operation (mem
, val
, code
, after
, target
);
5298 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
5299 intrinsics. ARGLIST is the operands list to the function. IS_BOOL is
5300 true if this is the boolean form. TARGET is a place for us to store the
5301 results; this is NOT optional if IS_BOOL is true. */
5304 expand_builtin_compare_and_swap (tree arglist
, bool is_bool
, rtx target
)
5306 enum machine_mode mode
;
5307 rtx addr
, old_val
, new_val
, mem
;
5309 /* Expand the operands. */
5310 addr
= expand_expr (TREE_VALUE (arglist
), NULL
, Pmode
, EXPAND_SUM
);
5311 mode
= TYPE_MODE (TREE_TYPE (TREE_TYPE (TREE_VALUE (arglist
))));
5313 arglist
= TREE_CHAIN (arglist
);
5314 old_val
= expand_expr (TREE_VALUE (arglist
), NULL
, mode
, EXPAND_NORMAL
);
5316 arglist
= TREE_CHAIN (arglist
);
5317 new_val
= expand_expr (TREE_VALUE (arglist
), NULL
, mode
, EXPAND_NORMAL
);
5319 /* Note that we explicitly do not want any alias information for this
5320 memory, so that we kill all other live memories. Otherwise we don't
5321 satisfy the full barrier semantics of the intrinsic. */
5322 mem
= validize_mem (gen_rtx_MEM (mode
, addr
));
5323 MEM_VOLATILE_P (mem
) = 1;
5326 return expand_bool_compare_and_swap (mem
, old_val
, new_val
, target
);
5328 return expand_val_compare_and_swap (mem
, old_val
, new_val
, target
);
5331 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
5332 general form is actually an atomic exchange, and some targets only
5333 support a reduced form with the second argument being a constant 1.
5334 ARGLIST is the operands list to the function; TARGET is an optional
5335 place for us to store the results. */
5338 expand_builtin_lock_test_and_set (tree arglist
, rtx target
)
5340 enum machine_mode mode
;
5343 /* Expand the operands. */
5344 addr
= expand_expr (TREE_VALUE (arglist
), NULL
, Pmode
, EXPAND_NORMAL
);
5345 mode
= TYPE_MODE (TREE_TYPE (TREE_TYPE (TREE_VALUE (arglist
))));
5347 arglist
= TREE_CHAIN (arglist
);
5348 val
= expand_expr (TREE_VALUE (arglist
), NULL
, mode
, EXPAND_NORMAL
);
5350 /* Note that we explicitly do not want any alias information for this
5351 memory, so that we kill all other live memories. Otherwise we don't
5352 satisfy the barrier semantics of the intrinsic. */
5353 mem
= validize_mem (gen_rtx_MEM (mode
, addr
));
5354 MEM_VOLATILE_P (mem
) = 1;
5356 return expand_sync_lock_test_and_set (mem
, val
, target
);
5359 /* Expand the __sync_synchronize intrinsic. */
5362 expand_builtin_synchronize (void)
5366 #ifdef HAVE_memory_barrier
5367 if (HAVE_memory_barrier
)
5369 emit_insn (gen_memory_barrier ());
5374 /* If no explicit memory barrier instruction is available, create an empty
5375 asm stmt that will prevent compiler movement across the barrier. */
5376 body
= gen_rtx_ASM_INPUT (VOIDmode
, "");
5377 MEM_VOLATILE_P (body
) = 1;
5381 /* Expand the __sync_lock_release intrinsic. ARGLIST is the operands list
5385 expand_builtin_lock_release (tree arglist
)
5387 enum machine_mode mode
;
5388 enum insn_code icode
;
5389 rtx addr
, val
, mem
, insn
;
5391 /* Expand the operands. */
5392 addr
= expand_expr (TREE_VALUE (arglist
), NULL
, Pmode
, EXPAND_NORMAL
);
5393 mode
= TYPE_MODE (TREE_TYPE (TREE_TYPE (TREE_VALUE (arglist
))));
5396 /* Note that we explicitly do not want any alias information for this
5397 memory, so that we kill all other live memories. Otherwise we don't
5398 satisfy the barrier semantics of the intrinsic. */
5399 mem
= validize_mem (gen_rtx_MEM (mode
, addr
));
5400 MEM_VOLATILE_P (mem
) = 1;
5402 /* If there is an explicit operation in the md file, use it. */
5403 icode
= sync_lock_release
[mode
];
5404 if (icode
!= CODE_FOR_nothing
)
5406 if (!insn_data
[icode
].operand
[1].predicate (val
, mode
))
5407 val
= force_reg (mode
, val
);
5409 insn
= GEN_FCN (icode
) (mem
, val
);
5417 /* Otherwise we can implement this operation by emitting a barrier
5418 followed by a store of zero. */
5419 expand_builtin_synchronize ();
5420 emit_move_insn (mem
, val
);
5423 /* Expand an expression EXP that calls a built-in function,
5424 with result going to TARGET if that's convenient
5425 (and in mode MODE if that's convenient).
5426 SUBTARGET may be used as the target for computing one of EXP's operands.
5427 IGNORE is nonzero if the value is to be ignored. */
5430 expand_builtin (tree exp
, rtx target
, rtx subtarget
, enum machine_mode mode
,
5433 tree fndecl
= get_callee_fndecl (exp
);
5434 tree arglist
= TREE_OPERAND (exp
, 1);
5435 enum built_in_function fcode
= DECL_FUNCTION_CODE (fndecl
);
5436 enum machine_mode target_mode
= TYPE_MODE (TREE_TYPE (exp
));
5438 if (DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_MD
)
5439 return targetm
.expand_builtin (exp
, target
, subtarget
, mode
, ignore
);
5441 /* When not optimizing, generate calls to library functions for a certain
5444 && !called_as_built_in (fndecl
)
5445 && DECL_ASSEMBLER_NAME_SET_P (fndecl
)
5446 && fcode
!= BUILT_IN_ALLOCA
)
5447 return expand_call (exp
, target
, ignore
);
5449 /* The built-in function expanders test for target == const0_rtx
5450 to determine whether the function's result will be ignored. */
5452 target
= const0_rtx
;
5454 /* If the result of a pure or const built-in function is ignored, and
5455 none of its arguments are volatile, we can avoid expanding the
5456 built-in call and just evaluate the arguments for side-effects. */
5457 if (target
== const0_rtx
5458 && (DECL_IS_PURE (fndecl
) || TREE_READONLY (fndecl
)))
5460 bool volatilep
= false;
5463 for (arg
= arglist
; arg
; arg
= TREE_CHAIN (arg
))
5464 if (TREE_THIS_VOLATILE (TREE_VALUE (arg
)))
5472 for (arg
= arglist
; arg
; arg
= TREE_CHAIN (arg
))
5473 expand_expr (TREE_VALUE (arg
), const0_rtx
,
5474 VOIDmode
, EXPAND_NORMAL
);
5482 case BUILT_IN_FABSF
:
5483 case BUILT_IN_FABSL
:
5484 target
= expand_builtin_fabs (arglist
, target
, subtarget
);
5489 case BUILT_IN_COPYSIGN
:
5490 case BUILT_IN_COPYSIGNF
:
5491 case BUILT_IN_COPYSIGNL
:
5492 target
= expand_builtin_copysign (arglist
, target
, subtarget
);
5497 /* Just do a normal library call if we were unable to fold
5500 case BUILT_IN_CABSF
:
5501 case BUILT_IN_CABSL
:
5507 case BUILT_IN_EXP10
:
5508 case BUILT_IN_EXP10F
:
5509 case BUILT_IN_EXP10L
:
5510 case BUILT_IN_POW10
:
5511 case BUILT_IN_POW10F
:
5512 case BUILT_IN_POW10L
:
5514 case BUILT_IN_EXP2F
:
5515 case BUILT_IN_EXP2L
:
5516 case BUILT_IN_EXPM1
:
5517 case BUILT_IN_EXPM1F
:
5518 case BUILT_IN_EXPM1L
:
5520 case BUILT_IN_LOGBF
:
5521 case BUILT_IN_LOGBL
:
5522 case BUILT_IN_ILOGB
:
5523 case BUILT_IN_ILOGBF
:
5524 case BUILT_IN_ILOGBL
:
5528 case BUILT_IN_LOG10
:
5529 case BUILT_IN_LOG10F
:
5530 case BUILT_IN_LOG10L
:
5532 case BUILT_IN_LOG2F
:
5533 case BUILT_IN_LOG2L
:
5534 case BUILT_IN_LOG1P
:
5535 case BUILT_IN_LOG1PF
:
5536 case BUILT_IN_LOG1PL
:
5541 case BUILT_IN_ASINF
:
5542 case BUILT_IN_ASINL
:
5544 case BUILT_IN_ACOSF
:
5545 case BUILT_IN_ACOSL
:
5547 case BUILT_IN_ATANF
:
5548 case BUILT_IN_ATANL
:
5549 /* Treat these like sqrt only if unsafe math optimizations are allowed,
5550 because of possible accuracy problems. */
5551 if (! flag_unsafe_math_optimizations
)
5554 case BUILT_IN_SQRTF
:
5555 case BUILT_IN_SQRTL
:
5556 case BUILT_IN_FLOOR
:
5557 case BUILT_IN_FLOORF
:
5558 case BUILT_IN_FLOORL
:
5560 case BUILT_IN_CEILF
:
5561 case BUILT_IN_CEILL
:
5562 case BUILT_IN_TRUNC
:
5563 case BUILT_IN_TRUNCF
:
5564 case BUILT_IN_TRUNCL
:
5565 case BUILT_IN_ROUND
:
5566 case BUILT_IN_ROUNDF
:
5567 case BUILT_IN_ROUNDL
:
5568 case BUILT_IN_NEARBYINT
:
5569 case BUILT_IN_NEARBYINTF
:
5570 case BUILT_IN_NEARBYINTL
:
5572 case BUILT_IN_RINTF
:
5573 case BUILT_IN_RINTL
:
5574 case BUILT_IN_LRINT
:
5575 case BUILT_IN_LRINTF
:
5576 case BUILT_IN_LRINTL
:
5577 case BUILT_IN_LLRINT
:
5578 case BUILT_IN_LLRINTF
:
5579 case BUILT_IN_LLRINTL
:
5580 target
= expand_builtin_mathfn (exp
, target
, subtarget
);
5585 case BUILT_IN_LCEIL
:
5586 case BUILT_IN_LCEILF
:
5587 case BUILT_IN_LCEILL
:
5588 case BUILT_IN_LLCEIL
:
5589 case BUILT_IN_LLCEILF
:
5590 case BUILT_IN_LLCEILL
:
5591 case BUILT_IN_LFLOOR
:
5592 case BUILT_IN_LFLOORF
:
5593 case BUILT_IN_LFLOORL
:
5594 case BUILT_IN_LLFLOOR
:
5595 case BUILT_IN_LLFLOORF
:
5596 case BUILT_IN_LLFLOORL
:
5597 target
= expand_builtin_int_roundingfn (exp
, target
, subtarget
);
5605 target
= expand_builtin_pow (exp
, target
, subtarget
);
5611 case BUILT_IN_POWIF
:
5612 case BUILT_IN_POWIL
:
5613 target
= expand_builtin_powi (exp
, target
, subtarget
);
5618 case BUILT_IN_ATAN2
:
5619 case BUILT_IN_ATAN2F
:
5620 case BUILT_IN_ATAN2L
:
5621 case BUILT_IN_LDEXP
:
5622 case BUILT_IN_LDEXPF
:
5623 case BUILT_IN_LDEXPL
:
5625 case BUILT_IN_FMODF
:
5626 case BUILT_IN_FMODL
:
5628 case BUILT_IN_DREMF
:
5629 case BUILT_IN_DREML
:
5630 if (! flag_unsafe_math_optimizations
)
5632 target
= expand_builtin_mathfn_2 (exp
, target
, subtarget
);
5643 if (! flag_unsafe_math_optimizations
)
5645 target
= expand_builtin_mathfn_3 (exp
, target
, subtarget
);
5650 case BUILT_IN_APPLY_ARGS
:
5651 return expand_builtin_apply_args ();
5653 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
5654 FUNCTION with a copy of the parameters described by
5655 ARGUMENTS, and ARGSIZE. It returns a block of memory
5656 allocated on the stack into which is stored all the registers
5657 that might possibly be used for returning the result of a
5658 function. ARGUMENTS is the value returned by
5659 __builtin_apply_args. ARGSIZE is the number of bytes of
5660 arguments that must be copied. ??? How should this value be
5661 computed? We'll also need a safe worst case value for varargs
5663 case BUILT_IN_APPLY
:
5664 if (!validate_arglist (arglist
, POINTER_TYPE
,
5665 POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
)
5666 && !validate_arglist (arglist
, REFERENCE_TYPE
,
5667 POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
5675 for (t
= arglist
, i
= 0; t
; t
= TREE_CHAIN (t
), i
++)
5676 ops
[i
] = expand_expr (TREE_VALUE (t
), NULL_RTX
, VOIDmode
, 0);
5678 return expand_builtin_apply (ops
[0], ops
[1], ops
[2]);
5681 /* __builtin_return (RESULT) causes the function to return the
5682 value described by RESULT. RESULT is address of the block of
5683 memory returned by __builtin_apply. */
5684 case BUILT_IN_RETURN
:
5685 if (validate_arglist (arglist
, POINTER_TYPE
, VOID_TYPE
))
5686 expand_builtin_return (expand_expr (TREE_VALUE (arglist
),
5687 NULL_RTX
, VOIDmode
, 0));
5690 case BUILT_IN_SAVEREGS
:
5691 return expand_builtin_saveregs ();
5693 case BUILT_IN_ARGS_INFO
:
5694 return expand_builtin_args_info (arglist
);
5696 /* Return the address of the first anonymous stack arg. */
5697 case BUILT_IN_NEXT_ARG
:
5698 if (fold_builtin_next_arg (arglist
))
5700 return expand_builtin_next_arg ();
5702 case BUILT_IN_CLASSIFY_TYPE
:
5703 return expand_builtin_classify_type (arglist
);
5705 case BUILT_IN_CONSTANT_P
:
5708 case BUILT_IN_FRAME_ADDRESS
:
5709 case BUILT_IN_RETURN_ADDRESS
:
5710 return expand_builtin_frame_address (fndecl
, arglist
);
5712 /* Returns the address of the area where the structure is returned.
5714 case BUILT_IN_AGGREGATE_INCOMING_ADDRESS
:
5716 || ! AGGREGATE_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
)))
5717 || !MEM_P (DECL_RTL (DECL_RESULT (current_function_decl
))))
5720 return XEXP (DECL_RTL (DECL_RESULT (current_function_decl
)), 0);
5722 case BUILT_IN_ALLOCA
:
5723 target
= expand_builtin_alloca (arglist
, target
);
5728 case BUILT_IN_STACK_SAVE
:
5729 return expand_stack_save ();
5731 case BUILT_IN_STACK_RESTORE
:
5732 expand_stack_restore (TREE_VALUE (arglist
));
5737 case BUILT_IN_FFSLL
:
5738 case BUILT_IN_FFSIMAX
:
5739 target
= expand_builtin_unop (target_mode
, arglist
, target
,
5740 subtarget
, ffs_optab
);
5747 case BUILT_IN_CLZLL
:
5748 case BUILT_IN_CLZIMAX
:
5749 target
= expand_builtin_unop (target_mode
, arglist
, target
,
5750 subtarget
, clz_optab
);
5757 case BUILT_IN_CTZLL
:
5758 case BUILT_IN_CTZIMAX
:
5759 target
= expand_builtin_unop (target_mode
, arglist
, target
,
5760 subtarget
, ctz_optab
);
5765 case BUILT_IN_POPCOUNT
:
5766 case BUILT_IN_POPCOUNTL
:
5767 case BUILT_IN_POPCOUNTLL
:
5768 case BUILT_IN_POPCOUNTIMAX
:
5769 target
= expand_builtin_unop (target_mode
, arglist
, target
,
5770 subtarget
, popcount_optab
);
5775 case BUILT_IN_PARITY
:
5776 case BUILT_IN_PARITYL
:
5777 case BUILT_IN_PARITYLL
:
5778 case BUILT_IN_PARITYIMAX
:
5779 target
= expand_builtin_unop (target_mode
, arglist
, target
,
5780 subtarget
, parity_optab
);
5785 case BUILT_IN_STRLEN
:
5786 target
= expand_builtin_strlen (arglist
, target
, target_mode
);
5791 case BUILT_IN_STRCPY
:
5792 target
= expand_builtin_strcpy (exp
, target
, mode
);
5797 case BUILT_IN_STRNCPY
:
5798 target
= expand_builtin_strncpy (exp
, target
, mode
);
5803 case BUILT_IN_STPCPY
:
5804 target
= expand_builtin_stpcpy (exp
, target
, mode
);
5809 case BUILT_IN_STRCAT
:
5810 target
= expand_builtin_strcat (arglist
, TREE_TYPE (exp
), target
, mode
);
5815 case BUILT_IN_STRNCAT
:
5816 target
= expand_builtin_strncat (arglist
, target
, mode
);
5821 case BUILT_IN_STRSPN
:
5822 target
= expand_builtin_strspn (arglist
, target
, mode
);
5827 case BUILT_IN_STRCSPN
:
5828 target
= expand_builtin_strcspn (arglist
, target
, mode
);
5833 case BUILT_IN_STRSTR
:
5834 target
= expand_builtin_strstr (arglist
, TREE_TYPE (exp
), target
, mode
);
5839 case BUILT_IN_STRPBRK
:
5840 target
= expand_builtin_strpbrk (arglist
, TREE_TYPE (exp
), target
, mode
);
5845 case BUILT_IN_INDEX
:
5846 case BUILT_IN_STRCHR
:
5847 target
= expand_builtin_strchr (arglist
, TREE_TYPE (exp
), target
, mode
);
5852 case BUILT_IN_RINDEX
:
5853 case BUILT_IN_STRRCHR
:
5854 target
= expand_builtin_strrchr (arglist
, TREE_TYPE (exp
), target
, mode
);
5859 case BUILT_IN_MEMCPY
:
5860 target
= expand_builtin_memcpy (exp
, target
, mode
);
5865 case BUILT_IN_MEMPCPY
:
5866 target
= expand_builtin_mempcpy (arglist
, TREE_TYPE (exp
), target
, mode
, /*endp=*/ 1);
5871 case BUILT_IN_MEMMOVE
:
5872 target
= expand_builtin_memmove (arglist
, TREE_TYPE (exp
), target
,
5878 case BUILT_IN_BCOPY
:
5879 target
= expand_builtin_bcopy (exp
);
5884 case BUILT_IN_MEMSET
:
5885 target
= expand_builtin_memset (arglist
, target
, mode
, exp
);
5890 case BUILT_IN_BZERO
:
5891 target
= expand_builtin_bzero (exp
);
5896 case BUILT_IN_STRCMP
:
5897 target
= expand_builtin_strcmp (exp
, target
, mode
);
5902 case BUILT_IN_STRNCMP
:
5903 target
= expand_builtin_strncmp (exp
, target
, mode
);
5909 case BUILT_IN_MEMCMP
:
5910 target
= expand_builtin_memcmp (exp
, arglist
, target
, mode
);
5915 case BUILT_IN_SETJMP
:
5916 target
= expand_builtin_setjmp (arglist
, target
);
5921 /* __builtin_longjmp is passed a pointer to an array of five words.
5922 It's similar to the C library longjmp function but works with
5923 __builtin_setjmp above. */
5924 case BUILT_IN_LONGJMP
:
5925 if (!validate_arglist (arglist
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
5929 rtx buf_addr
= expand_expr (TREE_VALUE (arglist
), subtarget
,
5931 rtx value
= expand_expr (TREE_VALUE (TREE_CHAIN (arglist
)),
5932 NULL_RTX
, VOIDmode
, 0);
5934 if (value
!= const1_rtx
)
5936 error ("%<__builtin_longjmp%> second argument must be 1");
5940 expand_builtin_longjmp (buf_addr
, value
);
5944 case BUILT_IN_NONLOCAL_GOTO
:
5945 target
= expand_builtin_nonlocal_goto (arglist
);
5950 /* This updates the setjmp buffer that is its argument with the value
5951 of the current stack pointer. */
5952 case BUILT_IN_UPDATE_SETJMP_BUF
:
5953 if (validate_arglist (arglist
, POINTER_TYPE
, VOID_TYPE
))
5956 = expand_expr (TREE_VALUE (arglist
), NULL_RTX
, VOIDmode
, 0);
5958 expand_builtin_update_setjmp_buf (buf_addr
);
5964 expand_builtin_trap ();
5967 case BUILT_IN_PRINTF
:
5968 target
= expand_builtin_printf (exp
, target
, mode
, false);
5973 case BUILT_IN_PRINTF_UNLOCKED
:
5974 target
= expand_builtin_printf (exp
, target
, mode
, true);
5979 case BUILT_IN_FPUTS
:
5980 target
= expand_builtin_fputs (arglist
, target
, false);
5984 case BUILT_IN_FPUTS_UNLOCKED
:
5985 target
= expand_builtin_fputs (arglist
, target
, true);
5990 case BUILT_IN_FPRINTF
:
5991 target
= expand_builtin_fprintf (exp
, target
, mode
, false);
5996 case BUILT_IN_FPRINTF_UNLOCKED
:
5997 target
= expand_builtin_fprintf (exp
, target
, mode
, true);
6002 case BUILT_IN_SPRINTF
:
6003 target
= expand_builtin_sprintf (arglist
, target
, mode
);
6008 case BUILT_IN_SIGNBIT
:
6009 case BUILT_IN_SIGNBITF
:
6010 case BUILT_IN_SIGNBITL
:
6011 target
= expand_builtin_signbit (exp
, target
);
6016 /* Various hooks for the DWARF 2 __throw routine. */
6017 case BUILT_IN_UNWIND_INIT
:
6018 expand_builtin_unwind_init ();
6020 case BUILT_IN_DWARF_CFA
:
6021 return virtual_cfa_rtx
;
6022 #ifdef DWARF2_UNWIND_INFO
6023 case BUILT_IN_DWARF_SP_COLUMN
:
6024 return expand_builtin_dwarf_sp_column ();
6025 case BUILT_IN_INIT_DWARF_REG_SIZES
:
6026 expand_builtin_init_dwarf_reg_sizes (TREE_VALUE (arglist
));
6029 case BUILT_IN_FROB_RETURN_ADDR
:
6030 return expand_builtin_frob_return_addr (TREE_VALUE (arglist
));
6031 case BUILT_IN_EXTRACT_RETURN_ADDR
:
6032 return expand_builtin_extract_return_addr (TREE_VALUE (arglist
));
6033 case BUILT_IN_EH_RETURN
:
6034 expand_builtin_eh_return (TREE_VALUE (arglist
),
6035 TREE_VALUE (TREE_CHAIN (arglist
)));
6037 #ifdef EH_RETURN_DATA_REGNO
6038 case BUILT_IN_EH_RETURN_DATA_REGNO
:
6039 return expand_builtin_eh_return_data_regno (arglist
);
6041 case BUILT_IN_EXTEND_POINTER
:
6042 return expand_builtin_extend_pointer (TREE_VALUE (arglist
));
6044 case BUILT_IN_VA_START
:
6045 case BUILT_IN_STDARG_START
:
6046 return expand_builtin_va_start (arglist
);
6047 case BUILT_IN_VA_END
:
6048 return expand_builtin_va_end (arglist
);
6049 case BUILT_IN_VA_COPY
:
6050 return expand_builtin_va_copy (arglist
);
6051 case BUILT_IN_EXPECT
:
6052 return expand_builtin_expect (arglist
, target
);
6053 case BUILT_IN_PREFETCH
:
6054 expand_builtin_prefetch (arglist
);
6057 case BUILT_IN_PROFILE_FUNC_ENTER
:
6058 return expand_builtin_profile_func (false);
6059 case BUILT_IN_PROFILE_FUNC_EXIT
:
6060 return expand_builtin_profile_func (true);
6062 case BUILT_IN_INIT_TRAMPOLINE
:
6063 return expand_builtin_init_trampoline (arglist
);
6064 case BUILT_IN_ADJUST_TRAMPOLINE
:
6065 return expand_builtin_adjust_trampoline (arglist
);
6068 case BUILT_IN_EXECL
:
6069 case BUILT_IN_EXECV
:
6070 case BUILT_IN_EXECLP
:
6071 case BUILT_IN_EXECLE
:
6072 case BUILT_IN_EXECVP
:
6073 case BUILT_IN_EXECVE
:
6074 target
= expand_builtin_fork_or_exec (fndecl
, arglist
, target
, ignore
);
6079 case BUILT_IN_FETCH_AND_ADD_1
:
6080 case BUILT_IN_FETCH_AND_ADD_2
:
6081 case BUILT_IN_FETCH_AND_ADD_4
:
6082 case BUILT_IN_FETCH_AND_ADD_8
:
6083 target
= expand_builtin_sync_operation (arglist
, PLUS
,
6084 false, target
, ignore
);
6089 case BUILT_IN_FETCH_AND_SUB_1
:
6090 case BUILT_IN_FETCH_AND_SUB_2
:
6091 case BUILT_IN_FETCH_AND_SUB_4
:
6092 case BUILT_IN_FETCH_AND_SUB_8
:
6093 target
= expand_builtin_sync_operation (arglist
, MINUS
,
6094 false, target
, ignore
);
6099 case BUILT_IN_FETCH_AND_OR_1
:
6100 case BUILT_IN_FETCH_AND_OR_2
:
6101 case BUILT_IN_FETCH_AND_OR_4
:
6102 case BUILT_IN_FETCH_AND_OR_8
:
6103 target
= expand_builtin_sync_operation (arglist
, IOR
,
6104 false, target
, ignore
);
6109 case BUILT_IN_FETCH_AND_AND_1
:
6110 case BUILT_IN_FETCH_AND_AND_2
:
6111 case BUILT_IN_FETCH_AND_AND_4
:
6112 case BUILT_IN_FETCH_AND_AND_8
:
6113 target
= expand_builtin_sync_operation (arglist
, AND
,
6114 false, target
, ignore
);
6119 case BUILT_IN_FETCH_AND_XOR_1
:
6120 case BUILT_IN_FETCH_AND_XOR_2
:
6121 case BUILT_IN_FETCH_AND_XOR_4
:
6122 case BUILT_IN_FETCH_AND_XOR_8
:
6123 target
= expand_builtin_sync_operation (arglist
, XOR
,
6124 false, target
, ignore
);
6129 case BUILT_IN_FETCH_AND_NAND_1
:
6130 case BUILT_IN_FETCH_AND_NAND_2
:
6131 case BUILT_IN_FETCH_AND_NAND_4
:
6132 case BUILT_IN_FETCH_AND_NAND_8
:
6133 target
= expand_builtin_sync_operation (arglist
, NOT
,
6134 false, target
, ignore
);
6139 case BUILT_IN_ADD_AND_FETCH_1
:
6140 case BUILT_IN_ADD_AND_FETCH_2
:
6141 case BUILT_IN_ADD_AND_FETCH_4
:
6142 case BUILT_IN_ADD_AND_FETCH_8
:
6143 target
= expand_builtin_sync_operation (arglist
, PLUS
,
6144 true, target
, ignore
);
6149 case BUILT_IN_SUB_AND_FETCH_1
:
6150 case BUILT_IN_SUB_AND_FETCH_2
:
6151 case BUILT_IN_SUB_AND_FETCH_4
:
6152 case BUILT_IN_SUB_AND_FETCH_8
:
6153 target
= expand_builtin_sync_operation (arglist
, MINUS
,
6154 true, target
, ignore
);
6159 case BUILT_IN_OR_AND_FETCH_1
:
6160 case BUILT_IN_OR_AND_FETCH_2
:
6161 case BUILT_IN_OR_AND_FETCH_4
:
6162 case BUILT_IN_OR_AND_FETCH_8
:
6163 target
= expand_builtin_sync_operation (arglist
, IOR
,
6164 true, target
, ignore
);
6169 case BUILT_IN_AND_AND_FETCH_1
:
6170 case BUILT_IN_AND_AND_FETCH_2
:
6171 case BUILT_IN_AND_AND_FETCH_4
:
6172 case BUILT_IN_AND_AND_FETCH_8
:
6173 target
= expand_builtin_sync_operation (arglist
, AND
,
6174 true, target
, ignore
);
6179 case BUILT_IN_XOR_AND_FETCH_1
:
6180 case BUILT_IN_XOR_AND_FETCH_2
:
6181 case BUILT_IN_XOR_AND_FETCH_4
:
6182 case BUILT_IN_XOR_AND_FETCH_8
:
6183 target
= expand_builtin_sync_operation (arglist
, XOR
,
6184 true, target
, ignore
);
6189 case BUILT_IN_NAND_AND_FETCH_1
:
6190 case BUILT_IN_NAND_AND_FETCH_2
:
6191 case BUILT_IN_NAND_AND_FETCH_4
:
6192 case BUILT_IN_NAND_AND_FETCH_8
:
6193 target
= expand_builtin_sync_operation (arglist
, NOT
,
6194 true, target
, ignore
);
6199 case BUILT_IN_BOOL_COMPARE_AND_SWAP_1
:
6200 case BUILT_IN_BOOL_COMPARE_AND_SWAP_2
:
6201 case BUILT_IN_BOOL_COMPARE_AND_SWAP_4
:
6202 case BUILT_IN_BOOL_COMPARE_AND_SWAP_8
:
6203 if (mode
== VOIDmode
)
6204 mode
= TYPE_MODE (boolean_type_node
);
6205 if (!target
|| !register_operand (target
, mode
))
6206 target
= gen_reg_rtx (mode
);
6207 target
= expand_builtin_compare_and_swap (arglist
, true, target
);
6212 case BUILT_IN_VAL_COMPARE_AND_SWAP_1
:
6213 case BUILT_IN_VAL_COMPARE_AND_SWAP_2
:
6214 case BUILT_IN_VAL_COMPARE_AND_SWAP_4
:
6215 case BUILT_IN_VAL_COMPARE_AND_SWAP_8
:
6216 target
= expand_builtin_compare_and_swap (arglist
, false, target
);
6221 case BUILT_IN_LOCK_TEST_AND_SET_1
:
6222 case BUILT_IN_LOCK_TEST_AND_SET_2
:
6223 case BUILT_IN_LOCK_TEST_AND_SET_4
:
6224 case BUILT_IN_LOCK_TEST_AND_SET_8
:
6225 target
= expand_builtin_lock_test_and_set (arglist
, target
);
6230 case BUILT_IN_LOCK_RELEASE_1
:
6231 case BUILT_IN_LOCK_RELEASE_2
:
6232 case BUILT_IN_LOCK_RELEASE_4
:
6233 case BUILT_IN_LOCK_RELEASE_8
:
6234 expand_builtin_lock_release (arglist
);
6237 case BUILT_IN_SYNCHRONIZE
:
6238 expand_builtin_synchronize ();
6241 default: /* just do library call, if unknown builtin */
6245 /* The switch statement above can drop through to cause the function
6246 to be called normally. */
6247 return expand_call (exp
, target
, ignore
);
6250 /* Determine whether a tree node represents a call to a built-in
6251 function. If the tree T is a call to a built-in function with
6252 the right number of arguments of the appropriate types, return
6253 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
6254 Otherwise the return value is END_BUILTINS. */
6256 enum built_in_function
6257 builtin_mathfn_code (tree t
)
6259 tree fndecl
, arglist
, parmlist
;
6260 tree argtype
, parmtype
;
6262 if (TREE_CODE (t
) != CALL_EXPR
6263 || TREE_CODE (TREE_OPERAND (t
, 0)) != ADDR_EXPR
)
6264 return END_BUILTINS
;
6266 fndecl
= get_callee_fndecl (t
);
6267 if (fndecl
== NULL_TREE
6268 || TREE_CODE (fndecl
) != FUNCTION_DECL
6269 || ! DECL_BUILT_IN (fndecl
)
6270 || DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_MD
)
6271 return END_BUILTINS
;
6273 arglist
= TREE_OPERAND (t
, 1);
6274 parmlist
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
6275 for (; parmlist
; parmlist
= TREE_CHAIN (parmlist
))
6277 /* If a function doesn't take a variable number of arguments,
6278 the last element in the list will have type `void'. */
6279 parmtype
= TREE_VALUE (parmlist
);
6280 if (VOID_TYPE_P (parmtype
))
6283 return END_BUILTINS
;
6284 return DECL_FUNCTION_CODE (fndecl
);
6288 return END_BUILTINS
;
6290 argtype
= TREE_TYPE (TREE_VALUE (arglist
));
6292 if (SCALAR_FLOAT_TYPE_P (parmtype
))
6294 if (! SCALAR_FLOAT_TYPE_P (argtype
))
6295 return END_BUILTINS
;
6297 else if (COMPLEX_FLOAT_TYPE_P (parmtype
))
6299 if (! COMPLEX_FLOAT_TYPE_P (argtype
))
6300 return END_BUILTINS
;
6302 else if (POINTER_TYPE_P (parmtype
))
6304 if (! POINTER_TYPE_P (argtype
))
6305 return END_BUILTINS
;
6307 else if (INTEGRAL_TYPE_P (parmtype
))
6309 if (! INTEGRAL_TYPE_P (argtype
))
6310 return END_BUILTINS
;
6313 return END_BUILTINS
;
6315 arglist
= TREE_CHAIN (arglist
);
6318 /* Variable-length argument list. */
6319 return DECL_FUNCTION_CODE (fndecl
);
6322 /* Fold a call to __builtin_constant_p, if we know it will evaluate to a
6323 constant. ARGLIST is the argument list of the call. */
6326 fold_builtin_constant_p (tree arglist
)
6331 arglist
= TREE_VALUE (arglist
);
6333 /* We return 1 for a numeric type that's known to be a constant
6334 value at compile-time or for an aggregate type that's a
6335 literal constant. */
6336 STRIP_NOPS (arglist
);
6338 /* If we know this is a constant, emit the constant of one. */
6339 if (CONSTANT_CLASS_P (arglist
)
6340 || (TREE_CODE (arglist
) == CONSTRUCTOR
6341 && TREE_CONSTANT (arglist
)))
6342 return integer_one_node
;
6343 if (TREE_CODE (arglist
) == ADDR_EXPR
)
6345 tree op
= TREE_OPERAND (arglist
, 0);
6346 if (TREE_CODE (op
) == STRING_CST
6347 || (TREE_CODE (op
) == ARRAY_REF
6348 && integer_zerop (TREE_OPERAND (op
, 1))
6349 && TREE_CODE (TREE_OPERAND (op
, 0)) == STRING_CST
))
6350 return integer_one_node
;
6353 /* If this expression has side effects, show we don't know it to be a
6354 constant. Likewise if it's a pointer or aggregate type since in
6355 those case we only want literals, since those are only optimized
6356 when generating RTL, not later.
6357 And finally, if we are compiling an initializer, not code, we
6358 need to return a definite result now; there's not going to be any
6359 more optimization done. */
6360 if (TREE_SIDE_EFFECTS (arglist
)
6361 || AGGREGATE_TYPE_P (TREE_TYPE (arglist
))
6362 || POINTER_TYPE_P (TREE_TYPE (arglist
))
6364 return integer_zero_node
;
6369 /* Fold a call to __builtin_expect, if we expect that a comparison against
6370 the argument will fold to a constant. In practice, this means a true
6371 constant or the address of a non-weak symbol. ARGLIST is the argument
6372 list of the call. */
6375 fold_builtin_expect (tree arglist
)
6382 arg
= TREE_VALUE (arglist
);
6384 /* If the argument isn't invariant, then there's nothing we can do. */
6385 if (!TREE_INVARIANT (arg
))
6388 /* If we're looking at an address of a weak decl, then do not fold. */
6391 if (TREE_CODE (inner
) == ADDR_EXPR
)
6395 inner
= TREE_OPERAND (inner
, 0);
6397 while (TREE_CODE (inner
) == COMPONENT_REF
6398 || TREE_CODE (inner
) == ARRAY_REF
);
6399 if (DECL_P (inner
) && DECL_WEAK (inner
))
6403 /* Otherwise, ARG already has the proper type for the return value. */
6407 /* Fold a call to __builtin_classify_type. */
6410 fold_builtin_classify_type (tree arglist
)
6413 return build_int_cst (NULL_TREE
, no_type_class
);
6415 return build_int_cst (NULL_TREE
,
6416 type_to_class (TREE_TYPE (TREE_VALUE (arglist
))));
6419 /* Fold a call to __builtin_strlen. */
6422 fold_builtin_strlen (tree arglist
)
6424 if (!validate_arglist (arglist
, POINTER_TYPE
, VOID_TYPE
))
6428 tree len
= c_strlen (TREE_VALUE (arglist
), 0);
6432 /* Convert from the internal "sizetype" type to "size_t". */
6434 len
= fold_convert (size_type_node
, len
);
6442 /* Fold a call to __builtin_inf or __builtin_huge_val. */
6445 fold_builtin_inf (tree type
, int warn
)
6447 REAL_VALUE_TYPE real
;
6449 /* __builtin_inff is intended to be usable to define INFINITY on all
6450 targets. If an infinity is not available, INFINITY expands "to a
6451 positive constant of type float that overflows at translation
6452 time", footnote "In this case, using INFINITY will violate the
6453 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
6454 Thus we pedwarn to ensure this constraint violation is
6456 if (!MODE_HAS_INFINITIES (TYPE_MODE (type
)) && warn
)
6457 pedwarn ("target format does not support infinity");
6460 return build_real (type
, real
);
6463 /* Fold a call to __builtin_nan or __builtin_nans. */
6466 fold_builtin_nan (tree arglist
, tree type
, int quiet
)
6468 REAL_VALUE_TYPE real
;
6471 if (!validate_arglist (arglist
, POINTER_TYPE
, VOID_TYPE
))
6473 str
= c_getstr (TREE_VALUE (arglist
));
6477 if (!real_nan (&real
, str
, quiet
, TYPE_MODE (type
)))
6480 return build_real (type
, real
);
6483 /* Return true if the floating point expression T has an integer value.
6484 We also allow +Inf, -Inf and NaN to be considered integer values. */
6487 integer_valued_real_p (tree t
)
6489 switch (TREE_CODE (t
))
6496 case NON_LVALUE_EXPR
:
6497 return integer_valued_real_p (TREE_OPERAND (t
, 0));
6502 return integer_valued_real_p (TREE_OPERAND (t
, 1));
6509 return integer_valued_real_p (TREE_OPERAND (t
, 0))
6510 && integer_valued_real_p (TREE_OPERAND (t
, 1));
6513 return integer_valued_real_p (TREE_OPERAND (t
, 1))
6514 && integer_valued_real_p (TREE_OPERAND (t
, 2));
6517 if (! TREE_CONSTANT_OVERFLOW (t
))
6519 REAL_VALUE_TYPE c
, cint
;
6521 c
= TREE_REAL_CST (t
);
6522 real_trunc (&cint
, TYPE_MODE (TREE_TYPE (t
)), &c
);
6523 return real_identical (&c
, &cint
);
6528 tree type
= TREE_TYPE (TREE_OPERAND (t
, 0));
6529 if (TREE_CODE (type
) == INTEGER_TYPE
)
6531 if (TREE_CODE (type
) == REAL_TYPE
)
6532 return integer_valued_real_p (TREE_OPERAND (t
, 0));
6537 switch (builtin_mathfn_code (t
))
6540 case BUILT_IN_CEILF
:
6541 case BUILT_IN_CEILL
:
6542 case BUILT_IN_FLOOR
:
6543 case BUILT_IN_FLOORF
:
6544 case BUILT_IN_FLOORL
:
6545 case BUILT_IN_NEARBYINT
:
6546 case BUILT_IN_NEARBYINTF
:
6547 case BUILT_IN_NEARBYINTL
:
6549 case BUILT_IN_RINTF
:
6550 case BUILT_IN_RINTL
:
6551 case BUILT_IN_ROUND
:
6552 case BUILT_IN_ROUNDF
:
6553 case BUILT_IN_ROUNDL
:
6554 case BUILT_IN_TRUNC
:
6555 case BUILT_IN_TRUNCF
:
6556 case BUILT_IN_TRUNCL
:
6570 /* EXP is assumed to be builtin call where truncation can be propagated
6571 across (for instance floor((double)f) == (double)floorf (f).
6572 Do the transformation. */
6575 fold_trunc_transparent_mathfn (tree fndecl
, tree arglist
)
6577 enum built_in_function fcode
= DECL_FUNCTION_CODE (fndecl
);
6580 if (! validate_arglist (arglist
, REAL_TYPE
, VOID_TYPE
))
6583 arg
= TREE_VALUE (arglist
);
6584 /* Integer rounding functions are idempotent. */
6585 if (fcode
== builtin_mathfn_code (arg
))
6588 /* If argument is already integer valued, and we don't need to worry
6589 about setting errno, there's no need to perform rounding. */
6590 if (! flag_errno_math
&& integer_valued_real_p (arg
))
6595 tree arg0
= strip_float_extensions (arg
);
6596 tree ftype
= TREE_TYPE (TREE_TYPE (fndecl
));
6597 tree newtype
= TREE_TYPE (arg0
);
6600 if (TYPE_PRECISION (newtype
) < TYPE_PRECISION (ftype
)
6601 && (decl
= mathfn_built_in (newtype
, fcode
)))
6604 build_tree_list (NULL_TREE
, fold_convert (newtype
, arg0
));
6605 return fold_convert (ftype
,
6606 build_function_call_expr (decl
, arglist
));
6612 /* EXP is assumed to be builtin call which can narrow the FP type of
6613 the argument, for instance lround((double)f) -> lroundf (f). */
6616 fold_fixed_mathfn (tree fndecl
, tree arglist
)
6618 enum built_in_function fcode
= DECL_FUNCTION_CODE (fndecl
);
6621 if (! validate_arglist (arglist
, REAL_TYPE
, VOID_TYPE
))
6624 arg
= TREE_VALUE (arglist
);
6626 /* If argument is already integer valued, and we don't need to worry
6627 about setting errno, there's no need to perform rounding. */
6628 if (! flag_errno_math
&& integer_valued_real_p (arg
))
6629 return fold (build1 (FIX_TRUNC_EXPR
, TREE_TYPE (TREE_TYPE (fndecl
)), arg
));
6633 tree ftype
= TREE_TYPE (arg
);
6634 tree arg0
= strip_float_extensions (arg
);
6635 tree newtype
= TREE_TYPE (arg0
);
6638 if (TYPE_PRECISION (newtype
) < TYPE_PRECISION (ftype
)
6639 && (decl
= mathfn_built_in (newtype
, fcode
)))
6642 build_tree_list (NULL_TREE
, fold_convert (newtype
, arg0
));
6643 return build_function_call_expr (decl
, arglist
);
6649 /* Fold function call to builtin cabs, cabsf or cabsl. ARGLIST
6650 is the argument list and TYPE is the return type. Return
6651 NULL_TREE if no if no simplification can be made. */
6654 fold_builtin_cabs (tree arglist
, tree type
)
6658 if (!arglist
|| TREE_CHAIN (arglist
))
6661 arg
= TREE_VALUE (arglist
);
6662 if (TREE_CODE (TREE_TYPE (arg
)) != COMPLEX_TYPE
6663 || TREE_CODE (TREE_TYPE (TREE_TYPE (arg
))) != REAL_TYPE
)
6666 /* Evaluate cabs of a constant at compile-time. */
6667 if (flag_unsafe_math_optimizations
6668 && TREE_CODE (arg
) == COMPLEX_CST
6669 && TREE_CODE (TREE_REALPART (arg
)) == REAL_CST
6670 && TREE_CODE (TREE_IMAGPART (arg
)) == REAL_CST
6671 && ! TREE_CONSTANT_OVERFLOW (TREE_REALPART (arg
))
6672 && ! TREE_CONSTANT_OVERFLOW (TREE_IMAGPART (arg
)))
6674 REAL_VALUE_TYPE r
, i
;
6676 r
= TREE_REAL_CST (TREE_REALPART (arg
));
6677 i
= TREE_REAL_CST (TREE_IMAGPART (arg
));
6679 real_arithmetic (&r
, MULT_EXPR
, &r
, &r
);
6680 real_arithmetic (&i
, MULT_EXPR
, &i
, &i
);
6681 real_arithmetic (&r
, PLUS_EXPR
, &r
, &i
);
6682 if (real_sqrt (&r
, TYPE_MODE (type
), &r
)
6683 || ! flag_trapping_math
)
6684 return build_real (type
, r
);
6687 /* If either part is zero, cabs is fabs of the other. */
6688 if (TREE_CODE (arg
) == COMPLEX_EXPR
6689 && real_zerop (TREE_OPERAND (arg
, 0)))
6690 return fold (build1 (ABS_EXPR
, type
, TREE_OPERAND (arg
, 1)));
6691 if (TREE_CODE (arg
) == COMPLEX_EXPR
6692 && real_zerop (TREE_OPERAND (arg
, 1)))
6693 return fold (build1 (ABS_EXPR
, type
, TREE_OPERAND (arg
, 0)));
6695 /* Don't do this when optimizing for size. */
6696 if (flag_unsafe_math_optimizations
6697 && optimize
&& !optimize_size
)
6699 tree sqrtfn
= mathfn_built_in (type
, BUILT_IN_SQRT
);
6701 if (sqrtfn
!= NULL_TREE
)
6703 tree rpart
, ipart
, result
, arglist
;
6705 arg
= builtin_save_expr (arg
);
6707 rpart
= fold (build1 (REALPART_EXPR
, type
, arg
));
6708 ipart
= fold (build1 (IMAGPART_EXPR
, type
, arg
));
6710 rpart
= builtin_save_expr (rpart
);
6711 ipart
= builtin_save_expr (ipart
);
6713 result
= fold (build2 (PLUS_EXPR
, type
,
6714 fold (build2 (MULT_EXPR
, type
,
6716 fold (build2 (MULT_EXPR
, type
,
6719 arglist
= build_tree_list (NULL_TREE
, result
);
6720 return build_function_call_expr (sqrtfn
, arglist
);
6727 /* Fold a builtin function call to sqrt, sqrtf, or sqrtl. Return
6728 NULL_TREE if no simplification can be made. */
6731 fold_builtin_sqrt (tree arglist
, tree type
)
6734 enum built_in_function fcode
;
6735 tree arg
= TREE_VALUE (arglist
);
6737 if (!validate_arglist (arglist
, REAL_TYPE
, VOID_TYPE
))
6740 /* Optimize sqrt of constant value. */
6741 if (TREE_CODE (arg
) == REAL_CST
6742 && ! TREE_CONSTANT_OVERFLOW (arg
))
6744 REAL_VALUE_TYPE r
, x
;
6746 x
= TREE_REAL_CST (arg
);
6747 if (real_sqrt (&r
, TYPE_MODE (type
), &x
)
6748 || (!flag_trapping_math
&& !flag_errno_math
))
6749 return build_real (type
, r
);
6752 /* Optimize sqrt(expN(x)) = expN(x*0.5). */
6753 fcode
= builtin_mathfn_code (arg
);
6754 if (flag_unsafe_math_optimizations
&& BUILTIN_EXPONENT_P (fcode
))
6756 tree expfn
= TREE_OPERAND (TREE_OPERAND (arg
, 0), 0);
6757 arg
= fold (build2 (MULT_EXPR
, type
,
6758 TREE_VALUE (TREE_OPERAND (arg
, 1)),
6759 build_real (type
, dconsthalf
)));
6760 arglist
= build_tree_list (NULL_TREE
, arg
);
6761 return build_function_call_expr (expfn
, arglist
);
6764 /* Optimize sqrt(Nroot(x)) -> pow(x,1/(2*N)). */
6765 if (flag_unsafe_math_optimizations
&& BUILTIN_ROOT_P (fcode
))
6767 tree powfn
= mathfn_built_in (type
, BUILT_IN_POW
);
6771 tree arg0
= TREE_VALUE (TREE_OPERAND (arg
, 1));
6773 /* The inner root was either sqrt or cbrt. */
6774 REAL_VALUE_TYPE dconstroot
=
6775 BUILTIN_SQRT_P (fcode
) ? dconsthalf
: dconstthird
;
6777 /* Adjust for the outer root. */
6778 SET_REAL_EXP (&dconstroot
, REAL_EXP (&dconstroot
) - 1);
6779 dconstroot
= real_value_truncate (TYPE_MODE (type
), dconstroot
);
6780 tree_root
= build_real (type
, dconstroot
);
6781 arglist
= tree_cons (NULL_TREE
, arg0
,
6782 build_tree_list (NULL_TREE
, tree_root
));
6783 return build_function_call_expr (powfn
, arglist
);
6787 /* Optimize sqrt(pow(x,y)) = pow(|x|,y*0.5). */
6788 if (flag_unsafe_math_optimizations
6789 && (fcode
== BUILT_IN_POW
6790 || fcode
== BUILT_IN_POWF
6791 || fcode
== BUILT_IN_POWL
))
6793 tree powfn
= TREE_OPERAND (TREE_OPERAND (arg
, 0), 0);
6794 tree arg0
= TREE_VALUE (TREE_OPERAND (arg
, 1));
6795 tree arg1
= TREE_VALUE (TREE_CHAIN (TREE_OPERAND (arg
, 1)));
6797 if (!tree_expr_nonnegative_p (arg0
))
6798 arg0
= build1 (ABS_EXPR
, type
, arg0
);
6799 narg1
= fold (build2 (MULT_EXPR
, type
, arg1
,
6800 build_real (type
, dconsthalf
)));
6801 arglist
= tree_cons (NULL_TREE
, arg0
,
6802 build_tree_list (NULL_TREE
, narg1
));
6803 return build_function_call_expr (powfn
, arglist
);
6809 /* Fold a builtin function call to cbrt, cbrtf, or cbrtl. Return
6810 NULL_TREE if no simplification can be made. */
6812 fold_builtin_cbrt (tree arglist
, tree type
)
6814 tree arg
= TREE_VALUE (arglist
);
6815 const enum built_in_function fcode
= builtin_mathfn_code (arg
);
6817 if (!validate_arglist (arglist
, REAL_TYPE
, VOID_TYPE
))
6820 /* Optimize cbrt of constant value. */
6821 if (real_zerop (arg
) || real_onep (arg
) || real_minus_onep (arg
))
6824 if (flag_unsafe_math_optimizations
)
6826 /* Optimize cbrt(expN(x)) -> expN(x/3). */
6827 if (BUILTIN_EXPONENT_P (fcode
))
6829 tree expfn
= TREE_OPERAND (TREE_OPERAND (arg
, 0), 0);
6830 const REAL_VALUE_TYPE third_trunc
=
6831 real_value_truncate (TYPE_MODE (type
), dconstthird
);
6832 arg
= fold (build2 (MULT_EXPR
, type
,
6833 TREE_VALUE (TREE_OPERAND (arg
, 1)),
6834 build_real (type
, third_trunc
)));
6835 arglist
= build_tree_list (NULL_TREE
, arg
);
6836 return build_function_call_expr (expfn
, arglist
);
6839 /* Optimize cbrt(sqrt(x)) -> pow(x,1/6). */
6840 if (BUILTIN_SQRT_P (fcode
))
6842 tree powfn
= mathfn_built_in (type
, BUILT_IN_POW
);
6846 tree arg0
= TREE_VALUE (TREE_OPERAND (arg
, 1));
6848 REAL_VALUE_TYPE dconstroot
= dconstthird
;
6850 SET_REAL_EXP (&dconstroot
, REAL_EXP (&dconstroot
) - 1);
6851 dconstroot
= real_value_truncate (TYPE_MODE (type
), dconstroot
);
6852 tree_root
= build_real (type
, dconstroot
);
6853 arglist
= tree_cons (NULL_TREE
, arg0
,
6854 build_tree_list (NULL_TREE
, tree_root
));
6855 return build_function_call_expr (powfn
, arglist
);
6859 /* Optimize cbrt(cbrt(x)) -> pow(x,1/9) iff x is nonnegative. */
6860 if (BUILTIN_CBRT_P (fcode
))
6862 tree arg0
= TREE_VALUE (TREE_OPERAND (arg
, 1));
6863 if (tree_expr_nonnegative_p (arg0
))
6865 tree powfn
= mathfn_built_in (type
, BUILT_IN_POW
);
6870 REAL_VALUE_TYPE dconstroot
;
6872 real_arithmetic (&dconstroot
, MULT_EXPR
, &dconstthird
, &dconstthird
);
6873 dconstroot
= real_value_truncate (TYPE_MODE (type
), dconstroot
);
6874 tree_root
= build_real (type
, dconstroot
);
6875 arglist
= tree_cons (NULL_TREE
, arg0
,
6876 build_tree_list (NULL_TREE
, tree_root
));
6877 return build_function_call_expr (powfn
, arglist
);
6882 /* Optimize cbrt(pow(x,y)) -> pow(x,y/3) iff x is nonnegative. */
6883 if (fcode
== BUILT_IN_POW
|| fcode
== BUILT_IN_POWF
6884 || fcode
== BUILT_IN_POWL
)
6886 tree arg00
= TREE_VALUE (TREE_OPERAND (arg
, 1));
6887 tree arg01
= TREE_VALUE (TREE_CHAIN (TREE_OPERAND (arg
, 1)));
6888 if (tree_expr_nonnegative_p (arg00
))
6890 tree powfn
= TREE_OPERAND (TREE_OPERAND (arg
, 0), 0);
6891 const REAL_VALUE_TYPE dconstroot
6892 = real_value_truncate (TYPE_MODE (type
), dconstthird
);
6893 tree narg01
= fold (build2 (MULT_EXPR
, type
, arg01
,
6894 build_real (type
, dconstroot
)));
6895 arglist
= tree_cons (NULL_TREE
, arg00
,
6896 build_tree_list (NULL_TREE
, narg01
));
6897 return build_function_call_expr (powfn
, arglist
);
6904 /* Fold function call to builtin sin, sinf, or sinl. Return
6905 NULL_TREE if no simplification can be made. */
6907 fold_builtin_sin (tree arglist
)
6909 tree arg
= TREE_VALUE (arglist
);
6911 if (!validate_arglist (arglist
, REAL_TYPE
, VOID_TYPE
))
6914 /* Optimize sin (0.0) = 0.0. */
6915 if (real_zerop (arg
))
6921 /* Fold function call to builtin cos, cosf, or cosl. Return
6922 NULL_TREE if no simplification can be made. */
6924 fold_builtin_cos (tree arglist
, tree type
, tree fndecl
)
6926 tree arg
= TREE_VALUE (arglist
);
6928 if (!validate_arglist (arglist
, REAL_TYPE
, VOID_TYPE
))
6931 /* Optimize cos (0.0) = 1.0. */
6932 if (real_zerop (arg
))
6933 return build_real (type
, dconst1
);
6935 /* Optimize cos(-x) into cos (x). */
6936 if (TREE_CODE (arg
) == NEGATE_EXPR
)
6938 tree args
= build_tree_list (NULL_TREE
,
6939 TREE_OPERAND (arg
, 0));
6940 return build_function_call_expr (fndecl
, args
);
6946 /* Fold function call to builtin tan, tanf, or tanl. Return
6947 NULL_TREE if no simplification can be made. */
6949 fold_builtin_tan (tree arglist
)
6951 enum built_in_function fcode
;
6952 tree arg
= TREE_VALUE (arglist
);
6954 if (!validate_arglist (arglist
, REAL_TYPE
, VOID_TYPE
))
6957 /* Optimize tan(0.0) = 0.0. */
6958 if (real_zerop (arg
))
6961 /* Optimize tan(atan(x)) = x. */
6962 fcode
= builtin_mathfn_code (arg
);
6963 if (flag_unsafe_math_optimizations
6964 && (fcode
== BUILT_IN_ATAN
6965 || fcode
== BUILT_IN_ATANF
6966 || fcode
== BUILT_IN_ATANL
))
6967 return TREE_VALUE (TREE_OPERAND (arg
, 1));
6972 /* Fold function call to builtin atan, atanf, or atanl. Return
6973 NULL_TREE if no simplification can be made. */
6976 fold_builtin_atan (tree arglist
, tree type
)
6979 tree arg
= TREE_VALUE (arglist
);
6981 if (!validate_arglist (arglist
, REAL_TYPE
, VOID_TYPE
))
6984 /* Optimize atan(0.0) = 0.0. */
6985 if (real_zerop (arg
))
6988 /* Optimize atan(1.0) = pi/4. */
6989 if (real_onep (arg
))
6991 REAL_VALUE_TYPE cst
;
6993 real_convert (&cst
, TYPE_MODE (type
), &dconstpi
);
6994 SET_REAL_EXP (&cst
, REAL_EXP (&cst
) - 2);
6995 return build_real (type
, cst
);
7001 /* Fold function call to builtin trunc, truncf or truncl. Return
7002 NULL_TREE if no simplification can be made. */
7005 fold_builtin_trunc (tree fndecl
, tree arglist
)
7009 if (! validate_arglist (arglist
, REAL_TYPE
, VOID_TYPE
))
7012 /* Optimize trunc of constant value. */
7013 arg
= TREE_VALUE (arglist
);
7014 if (TREE_CODE (arg
) == REAL_CST
&& ! TREE_CONSTANT_OVERFLOW (arg
))
7016 REAL_VALUE_TYPE r
, x
;
7017 tree type
= TREE_TYPE (TREE_TYPE (fndecl
));
7019 x
= TREE_REAL_CST (arg
);
7020 real_trunc (&r
, TYPE_MODE (type
), &x
);
7021 return build_real (type
, r
);
7024 return fold_trunc_transparent_mathfn (fndecl
, arglist
);
7027 /* Fold function call to builtin floor, floorf or floorl. Return
7028 NULL_TREE if no simplification can be made. */
7031 fold_builtin_floor (tree fndecl
, tree arglist
)
7035 if (! validate_arglist (arglist
, REAL_TYPE
, VOID_TYPE
))
7038 /* Optimize floor of constant value. */
7039 arg
= TREE_VALUE (arglist
);
7040 if (TREE_CODE (arg
) == REAL_CST
&& ! TREE_CONSTANT_OVERFLOW (arg
))
7044 x
= TREE_REAL_CST (arg
);
7045 if (! REAL_VALUE_ISNAN (x
) || ! flag_errno_math
)
7047 tree type
= TREE_TYPE (TREE_TYPE (fndecl
));
7050 real_floor (&r
, TYPE_MODE (type
), &x
);
7051 return build_real (type
, r
);
7055 return fold_trunc_transparent_mathfn (fndecl
, arglist
);
7058 /* Fold function call to builtin ceil, ceilf or ceill. Return
7059 NULL_TREE if no simplification can be made. */
7062 fold_builtin_ceil (tree fndecl
, tree arglist
)
7066 if (! validate_arglist (arglist
, REAL_TYPE
, VOID_TYPE
))
7069 /* Optimize ceil of constant value. */
7070 arg
= TREE_VALUE (arglist
);
7071 if (TREE_CODE (arg
) == REAL_CST
&& ! TREE_CONSTANT_OVERFLOW (arg
))
7075 x
= TREE_REAL_CST (arg
);
7076 if (! REAL_VALUE_ISNAN (x
) || ! flag_errno_math
)
7078 tree type
= TREE_TYPE (TREE_TYPE (fndecl
));
7081 real_ceil (&r
, TYPE_MODE (type
), &x
);
7082 return build_real (type
, r
);
7086 return fold_trunc_transparent_mathfn (fndecl
, arglist
);
7089 /* Fold function call to builtin round, roundf or roundl. Return
7090 NULL_TREE if no simplification can be made. */
7093 fold_builtin_round (tree fndecl
, tree arglist
)
7097 if (! validate_arglist (arglist
, REAL_TYPE
, VOID_TYPE
))
7100 /* Optimize round of constant value. */
7101 arg
= TREE_VALUE (arglist
);
7102 if (TREE_CODE (arg
) == REAL_CST
&& ! TREE_CONSTANT_OVERFLOW (arg
))
7106 x
= TREE_REAL_CST (arg
);
7107 if (! REAL_VALUE_ISNAN (x
) || ! flag_errno_math
)
7109 tree type
= TREE_TYPE (TREE_TYPE (fndecl
));
7112 real_round (&r
, TYPE_MODE (type
), &x
);
7113 return build_real (type
, r
);
7117 return fold_trunc_transparent_mathfn (fndecl
, arglist
);
7120 /* Fold function call to builtin lround, lroundf or lroundl (or the
7121 corresponding long long versions) and other rounding functions.
7122 Return NULL_TREE if no simplification can be made. */
7125 fold_builtin_int_roundingfn (tree fndecl
, tree arglist
)
7129 if (! validate_arglist (arglist
, REAL_TYPE
, VOID_TYPE
))
7132 /* Optimize lround of constant value. */
7133 arg
= TREE_VALUE (arglist
);
7134 if (TREE_CODE (arg
) == REAL_CST
&& ! TREE_CONSTANT_OVERFLOW (arg
))
7136 const REAL_VALUE_TYPE x
= TREE_REAL_CST (arg
);
7138 if (! REAL_VALUE_ISNAN (x
) && ! REAL_VALUE_ISINF (x
))
7140 tree itype
= TREE_TYPE (TREE_TYPE (fndecl
));
7141 tree ftype
= TREE_TYPE (arg
), result
;
7142 HOST_WIDE_INT hi
, lo
;
7145 switch (DECL_FUNCTION_CODE (fndecl
))
7147 case BUILT_IN_LFLOOR
:
7148 case BUILT_IN_LFLOORF
:
7149 case BUILT_IN_LFLOORL
:
7150 case BUILT_IN_LLFLOOR
:
7151 case BUILT_IN_LLFLOORF
:
7152 case BUILT_IN_LLFLOORL
:
7153 real_floor (&r
, TYPE_MODE (ftype
), &x
);
7156 case BUILT_IN_LCEIL
:
7157 case BUILT_IN_LCEILF
:
7158 case BUILT_IN_LCEILL
:
7159 case BUILT_IN_LLCEIL
:
7160 case BUILT_IN_LLCEILF
:
7161 case BUILT_IN_LLCEILL
:
7162 real_ceil (&r
, TYPE_MODE (ftype
), &x
);
7165 case BUILT_IN_LROUND
:
7166 case BUILT_IN_LROUNDF
:
7167 case BUILT_IN_LROUNDL
:
7168 case BUILT_IN_LLROUND
:
7169 case BUILT_IN_LLROUNDF
:
7170 case BUILT_IN_LLROUNDL
:
7171 real_round (&r
, TYPE_MODE (ftype
), &x
);
7178 REAL_VALUE_TO_INT (&lo
, &hi
, r
);
7179 result
= build_int_cst_wide (NULL_TREE
, lo
, hi
);
7180 if (int_fits_type_p (result
, itype
))
7181 return fold_convert (itype
, result
);
7185 return fold_fixed_mathfn (fndecl
, arglist
);
7188 /* Fold function call to builtin ffs, clz, ctz, popcount and parity
7189 and their long and long long variants (i.e. ffsl and ffsll).
7190 Return NULL_TREE if no simplification can be made. */
7193 fold_builtin_bitop (tree fndecl
, tree arglist
)
7197 if (! validate_arglist (arglist
, INTEGER_TYPE
, VOID_TYPE
))
7200 /* Optimize for constant argument. */
7201 arg
= TREE_VALUE (arglist
);
7202 if (TREE_CODE (arg
) == INTEGER_CST
&& ! TREE_CONSTANT_OVERFLOW (arg
))
7204 HOST_WIDE_INT hi
, width
, result
;
7205 unsigned HOST_WIDE_INT lo
;
7208 type
= TREE_TYPE (arg
);
7209 width
= TYPE_PRECISION (type
);
7210 lo
= TREE_INT_CST_LOW (arg
);
7212 /* Clear all the bits that are beyond the type's precision. */
7213 if (width
> HOST_BITS_PER_WIDE_INT
)
7215 hi
= TREE_INT_CST_HIGH (arg
);
7216 if (width
< 2 * HOST_BITS_PER_WIDE_INT
)
7217 hi
&= ~((HOST_WIDE_INT
) (-1) >> (width
- HOST_BITS_PER_WIDE_INT
));
7222 if (width
< HOST_BITS_PER_WIDE_INT
)
7223 lo
&= ~((unsigned HOST_WIDE_INT
) (-1) << width
);
7226 switch (DECL_FUNCTION_CODE (fndecl
))
7230 case BUILT_IN_FFSLL
:
7232 result
= exact_log2 (lo
& -lo
) + 1;
7234 result
= HOST_BITS_PER_WIDE_INT
+ exact_log2 (hi
& -hi
) + 1;
7241 case BUILT_IN_CLZLL
:
7243 result
= width
- floor_log2 (hi
) - 1 - HOST_BITS_PER_WIDE_INT
;
7245 result
= width
- floor_log2 (lo
) - 1;
7246 else if (! CLZ_DEFINED_VALUE_AT_ZERO (TYPE_MODE (type
), result
))
7252 case BUILT_IN_CTZLL
:
7254 result
= exact_log2 (lo
& -lo
);
7256 result
= HOST_BITS_PER_WIDE_INT
+ exact_log2 (hi
& -hi
);
7257 else if (! CTZ_DEFINED_VALUE_AT_ZERO (TYPE_MODE (type
), result
))
7261 case BUILT_IN_POPCOUNT
:
7262 case BUILT_IN_POPCOUNTL
:
7263 case BUILT_IN_POPCOUNTLL
:
7266 result
++, lo
&= lo
- 1;
7268 result
++, hi
&= hi
- 1;
7271 case BUILT_IN_PARITY
:
7272 case BUILT_IN_PARITYL
:
7273 case BUILT_IN_PARITYLL
:
7276 result
++, lo
&= lo
- 1;
7278 result
++, hi
&= hi
- 1;
7286 return build_int_cst (TREE_TYPE (TREE_TYPE (fndecl
)), result
);
7292 /* Return true if EXPR is the real constant contained in VALUE. */
7295 real_dconstp (tree expr
, const REAL_VALUE_TYPE
*value
)
7299 return ((TREE_CODE (expr
) == REAL_CST
7300 && ! TREE_CONSTANT_OVERFLOW (expr
)
7301 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), *value
))
7302 || (TREE_CODE (expr
) == COMPLEX_CST
7303 && real_dconstp (TREE_REALPART (expr
), value
)
7304 && real_zerop (TREE_IMAGPART (expr
))));
7307 /* A subroutine of fold_builtin to fold the various logarithmic
7308 functions. EXP is the CALL_EXPR of a call to a builtin logN
7309 function. VALUE is the base of the logN function. */
7312 fold_builtin_logarithm (tree fndecl
, tree arglist
,
7313 const REAL_VALUE_TYPE
*value
)
7315 if (validate_arglist (arglist
, REAL_TYPE
, VOID_TYPE
))
7317 tree type
= TREE_TYPE (TREE_TYPE (fndecl
));
7318 tree arg
= TREE_VALUE (arglist
);
7319 const enum built_in_function fcode
= builtin_mathfn_code (arg
);
7321 /* Optimize logN(1.0) = 0.0. */
7322 if (real_onep (arg
))
7323 return build_real (type
, dconst0
);
7325 /* Optimize logN(N) = 1.0. If N can't be truncated to MODE
7326 exactly, then only do this if flag_unsafe_math_optimizations. */
7327 if (exact_real_truncate (TYPE_MODE (type
), value
)
7328 || flag_unsafe_math_optimizations
)
7330 const REAL_VALUE_TYPE value_truncate
=
7331 real_value_truncate (TYPE_MODE (type
), *value
);
7332 if (real_dconstp (arg
, &value_truncate
))
7333 return build_real (type
, dconst1
);
7336 /* Special case, optimize logN(expN(x)) = x. */
7337 if (flag_unsafe_math_optimizations
7338 && ((value
== &dconste
7339 && (fcode
== BUILT_IN_EXP
7340 || fcode
== BUILT_IN_EXPF
7341 || fcode
== BUILT_IN_EXPL
))
7342 || (value
== &dconst2
7343 && (fcode
== BUILT_IN_EXP2
7344 || fcode
== BUILT_IN_EXP2F
7345 || fcode
== BUILT_IN_EXP2L
))
7346 || (value
== &dconst10
&& (BUILTIN_EXP10_P (fcode
)))))
7347 return fold_convert (type
, TREE_VALUE (TREE_OPERAND (arg
, 1)));
7349 /* Optimize logN(func()) for various exponential functions. We
7350 want to determine the value "x" and the power "exponent" in
7351 order to transform logN(x**exponent) into exponent*logN(x). */
7352 if (flag_unsafe_math_optimizations
)
7354 tree exponent
= 0, x
= 0;
7361 /* Prepare to do logN(exp(exponent) -> exponent*logN(e). */
7362 x
= build_real (type
,
7363 real_value_truncate (TYPE_MODE (type
), dconste
));
7364 exponent
= TREE_VALUE (TREE_OPERAND (arg
, 1));
7367 case BUILT_IN_EXP2F
:
7368 case BUILT_IN_EXP2L
:
7369 /* Prepare to do logN(exp2(exponent) -> exponent*logN(2). */
7370 x
= build_real (type
, dconst2
);
7371 exponent
= TREE_VALUE (TREE_OPERAND (arg
, 1));
7373 case BUILT_IN_EXP10
:
7374 case BUILT_IN_EXP10F
:
7375 case BUILT_IN_EXP10L
:
7376 case BUILT_IN_POW10
:
7377 case BUILT_IN_POW10F
:
7378 case BUILT_IN_POW10L
:
7379 /* Prepare to do logN(exp10(exponent) -> exponent*logN(10). */
7380 x
= build_real (type
, dconst10
);
7381 exponent
= TREE_VALUE (TREE_OPERAND (arg
, 1));
7384 case BUILT_IN_SQRTF
:
7385 case BUILT_IN_SQRTL
:
7386 /* Prepare to do logN(sqrt(x) -> 0.5*logN(x). */
7387 x
= TREE_VALUE (TREE_OPERAND (arg
, 1));
7388 exponent
= build_real (type
, dconsthalf
);
7391 case BUILT_IN_CBRTF
:
7392 case BUILT_IN_CBRTL
:
7393 /* Prepare to do logN(cbrt(x) -> (1/3)*logN(x). */
7394 x
= TREE_VALUE (TREE_OPERAND (arg
, 1));
7395 exponent
= build_real (type
, real_value_truncate (TYPE_MODE (type
),
7401 /* Prepare to do logN(pow(x,exponent) -> exponent*logN(x). */
7402 x
= TREE_VALUE (TREE_OPERAND (arg
, 1));
7403 exponent
= TREE_VALUE (TREE_CHAIN (TREE_OPERAND (arg
, 1)));
7409 /* Now perform the optimization. */
7413 arglist
= build_tree_list (NULL_TREE
, x
);
7414 logfn
= build_function_call_expr (fndecl
, arglist
);
7415 return fold (build2 (MULT_EXPR
, type
, exponent
, logfn
));
7423 /* Fold a builtin function call to pow, powf, or powl. Return
7424 NULL_TREE if no simplification can be made. */
7426 fold_builtin_pow (tree fndecl
, tree arglist
, tree type
)
7428 tree arg0
= TREE_VALUE (arglist
);
7429 tree arg1
= TREE_VALUE (TREE_CHAIN (arglist
));
7431 if (!validate_arglist (arglist
, REAL_TYPE
, REAL_TYPE
, VOID_TYPE
))
7434 /* Optimize pow(1.0,y) = 1.0. */
7435 if (real_onep (arg0
))
7436 return omit_one_operand (type
, build_real (type
, dconst1
), arg1
);
7438 if (TREE_CODE (arg1
) == REAL_CST
7439 && ! TREE_CONSTANT_OVERFLOW (arg1
))
7441 REAL_VALUE_TYPE cint
;
7445 c
= TREE_REAL_CST (arg1
);
7447 /* Optimize pow(x,0.0) = 1.0. */
7448 if (REAL_VALUES_EQUAL (c
, dconst0
))
7449 return omit_one_operand (type
, build_real (type
, dconst1
),
7452 /* Optimize pow(x,1.0) = x. */
7453 if (REAL_VALUES_EQUAL (c
, dconst1
))
7456 /* Optimize pow(x,-1.0) = 1.0/x. */
7457 if (REAL_VALUES_EQUAL (c
, dconstm1
))
7458 return fold (build2 (RDIV_EXPR
, type
,
7459 build_real (type
, dconst1
), arg0
));
7461 /* Optimize pow(x,0.5) = sqrt(x). */
7462 if (flag_unsafe_math_optimizations
7463 && REAL_VALUES_EQUAL (c
, dconsthalf
))
7465 tree sqrtfn
= mathfn_built_in (type
, BUILT_IN_SQRT
);
7467 if (sqrtfn
!= NULL_TREE
)
7469 tree arglist
= build_tree_list (NULL_TREE
, arg0
);
7470 return build_function_call_expr (sqrtfn
, arglist
);
7474 /* Check for an integer exponent. */
7475 n
= real_to_integer (&c
);
7476 real_from_integer (&cint
, VOIDmode
, n
, n
< 0 ? -1 : 0, 0);
7477 if (real_identical (&c
, &cint
))
7479 /* Attempt to evaluate pow at compile-time. */
7480 if (TREE_CODE (arg0
) == REAL_CST
7481 && ! TREE_CONSTANT_OVERFLOW (arg0
))
7486 x
= TREE_REAL_CST (arg0
);
7487 inexact
= real_powi (&x
, TYPE_MODE (type
), &x
, n
);
7488 if (flag_unsafe_math_optimizations
|| !inexact
)
7489 return build_real (type
, x
);
7492 /* Strip sign ops from even integer powers. */
7493 if ((n
& 1) == 0 && flag_unsafe_math_optimizations
)
7495 tree narg0
= fold_strip_sign_ops (arg0
);
7498 arglist
= build_tree_list (NULL_TREE
, arg1
);
7499 arglist
= tree_cons (NULL_TREE
, narg0
, arglist
);
7500 return build_function_call_expr (fndecl
, arglist
);
7506 if (flag_unsafe_math_optimizations
)
7508 const enum built_in_function fcode
= builtin_mathfn_code (arg0
);
7510 /* Optimize pow(expN(x),y) = expN(x*y). */
7511 if (BUILTIN_EXPONENT_P (fcode
))
7513 tree expfn
= TREE_OPERAND (TREE_OPERAND (arg0
, 0), 0);
7514 tree arg
= TREE_VALUE (TREE_OPERAND (arg0
, 1));
7515 arg
= fold (build2 (MULT_EXPR
, type
, arg
, arg1
));
7516 arglist
= build_tree_list (NULL_TREE
, arg
);
7517 return build_function_call_expr (expfn
, arglist
);
7520 /* Optimize pow(sqrt(x),y) = pow(x,y*0.5). */
7521 if (BUILTIN_SQRT_P (fcode
))
7523 tree narg0
= TREE_VALUE (TREE_OPERAND (arg0
, 1));
7524 tree narg1
= fold (build2 (MULT_EXPR
, type
, arg1
,
7525 build_real (type
, dconsthalf
)));
7527 arglist
= tree_cons (NULL_TREE
, narg0
,
7528 build_tree_list (NULL_TREE
, narg1
));
7529 return build_function_call_expr (fndecl
, arglist
);
7532 /* Optimize pow(cbrt(x),y) = pow(x,y/3) iff x is nonnegative. */
7533 if (BUILTIN_CBRT_P (fcode
))
7535 tree arg
= TREE_VALUE (TREE_OPERAND (arg0
, 1));
7536 if (tree_expr_nonnegative_p (arg
))
7538 const REAL_VALUE_TYPE dconstroot
7539 = real_value_truncate (TYPE_MODE (type
), dconstthird
);
7540 tree narg1
= fold (build2 (MULT_EXPR
, type
, arg1
,
7541 build_real (type
, dconstroot
)));
7542 arglist
= tree_cons (NULL_TREE
, arg
,
7543 build_tree_list (NULL_TREE
, narg1
));
7544 return build_function_call_expr (fndecl
, arglist
);
7548 /* Optimize pow(pow(x,y),z) = pow(x,y*z). */
7549 if (fcode
== BUILT_IN_POW
|| fcode
== BUILT_IN_POWF
7550 || fcode
== BUILT_IN_POWL
)
7552 tree arg00
= TREE_VALUE (TREE_OPERAND (arg0
, 1));
7553 tree arg01
= TREE_VALUE (TREE_CHAIN (TREE_OPERAND (arg0
, 1)));
7554 tree narg1
= fold (build2 (MULT_EXPR
, type
, arg01
, arg1
));
7555 arglist
= tree_cons (NULL_TREE
, arg00
,
7556 build_tree_list (NULL_TREE
, narg1
));
7557 return build_function_call_expr (fndecl
, arglist
);
7564 /* Fold a builtin function call to powi, powif, or powil. Return
7565 NULL_TREE if no simplification can be made. */
7567 fold_builtin_powi (tree fndecl ATTRIBUTE_UNUSED
, tree arglist
, tree type
)
7569 tree arg0
= TREE_VALUE (arglist
);
7570 tree arg1
= TREE_VALUE (TREE_CHAIN (arglist
));
7572 if (!validate_arglist (arglist
, REAL_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
7575 /* Optimize pow(1.0,y) = 1.0. */
7576 if (real_onep (arg0
))
7577 return omit_one_operand (type
, build_real (type
, dconst1
), arg1
);
7579 if (host_integerp (arg1
, 0))
7581 HOST_WIDE_INT c
= TREE_INT_CST_LOW (arg1
);
7583 /* Evaluate powi at compile-time. */
7584 if (TREE_CODE (arg0
) == REAL_CST
7585 && ! TREE_CONSTANT_OVERFLOW (arg0
))
7588 x
= TREE_REAL_CST (arg0
);
7589 real_powi (&x
, TYPE_MODE (type
), &x
, c
);
7590 return build_real (type
, x
);
7593 /* Optimize pow(x,0) = 1.0. */
7595 return omit_one_operand (type
, build_real (type
, dconst1
),
7598 /* Optimize pow(x,1) = x. */
7602 /* Optimize pow(x,-1) = 1.0/x. */
7604 return fold (build2 (RDIV_EXPR
, type
,
7605 build_real (type
, dconst1
), arg0
));
7611 /* A subroutine of fold_builtin to fold the various exponent
7612 functions. EXP is the CALL_EXPR of a call to a builtin function.
7613 VALUE is the value which will be raised to a power. */
7616 fold_builtin_exponent (tree fndecl
, tree arglist
,
7617 const REAL_VALUE_TYPE
*value
)
7619 if (validate_arglist (arglist
, REAL_TYPE
, VOID_TYPE
))
7621 tree type
= TREE_TYPE (TREE_TYPE (fndecl
));
7622 tree arg
= TREE_VALUE (arglist
);
7624 /* Optimize exp*(0.0) = 1.0. */
7625 if (real_zerop (arg
))
7626 return build_real (type
, dconst1
);
7628 /* Optimize expN(1.0) = N. */
7629 if (real_onep (arg
))
7631 REAL_VALUE_TYPE cst
;
7633 real_convert (&cst
, TYPE_MODE (type
), value
);
7634 return build_real (type
, cst
);
7637 /* Attempt to evaluate expN(integer) at compile-time. */
7638 if (flag_unsafe_math_optimizations
7639 && TREE_CODE (arg
) == REAL_CST
7640 && ! TREE_CONSTANT_OVERFLOW (arg
))
7642 REAL_VALUE_TYPE cint
;
7646 c
= TREE_REAL_CST (arg
);
7647 n
= real_to_integer (&c
);
7648 real_from_integer (&cint
, VOIDmode
, n
,
7650 if (real_identical (&c
, &cint
))
7654 real_powi (&x
, TYPE_MODE (type
), value
, n
);
7655 return build_real (type
, x
);
7659 /* Optimize expN(logN(x)) = x. */
7660 if (flag_unsafe_math_optimizations
)
7662 const enum built_in_function fcode
= builtin_mathfn_code (arg
);
7664 if ((value
== &dconste
7665 && (fcode
== BUILT_IN_LOG
7666 || fcode
== BUILT_IN_LOGF
7667 || fcode
== BUILT_IN_LOGL
))
7668 || (value
== &dconst2
7669 && (fcode
== BUILT_IN_LOG2
7670 || fcode
== BUILT_IN_LOG2F
7671 || fcode
== BUILT_IN_LOG2L
))
7672 || (value
== &dconst10
7673 && (fcode
== BUILT_IN_LOG10
7674 || fcode
== BUILT_IN_LOG10F
7675 || fcode
== BUILT_IN_LOG10L
)))
7676 return fold_convert (type
, TREE_VALUE (TREE_OPERAND (arg
, 1)));
7683 /* Fold function call to builtin memcpy. Return
7684 NULL_TREE if no simplification can be made. */
7687 fold_builtin_memcpy (tree fndecl
, tree arglist
)
7689 tree dest
, src
, len
;
7691 if (!validate_arglist (arglist
,
7692 POINTER_TYPE
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
7695 dest
= TREE_VALUE (arglist
);
7696 src
= TREE_VALUE (TREE_CHAIN (arglist
));
7697 len
= TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist
)));
7699 /* If the LEN parameter is zero, return DEST. */
7700 if (integer_zerop (len
))
7701 return omit_one_operand (TREE_TYPE (TREE_TYPE (fndecl
)), dest
, src
);
7703 /* If SRC and DEST are the same (and not volatile), return DEST. */
7704 if (operand_equal_p (src
, dest
, 0))
7705 return omit_one_operand (TREE_TYPE (TREE_TYPE (fndecl
)), dest
, len
);
7710 /* Fold function call to builtin mempcpy. Return
7711 NULL_TREE if no simplification can be made. */
7714 fold_builtin_mempcpy (tree arglist
, tree type
, int endp
)
7716 if (validate_arglist (arglist
,
7717 POINTER_TYPE
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
7719 tree dest
= TREE_VALUE (arglist
);
7720 tree src
= TREE_VALUE (TREE_CHAIN (arglist
));
7721 tree len
= TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist
)));
7723 /* If the LEN parameter is zero, return DEST. */
7724 if (integer_zerop (len
))
7725 return omit_one_operand (type
, dest
, src
);
7727 /* If SRC and DEST are the same (and not volatile), return DEST+LEN. */
7728 if (operand_equal_p (src
, dest
, 0))
7731 return omit_one_operand (type
, dest
, len
);
7734 len
= fold (build2 (MINUS_EXPR
, TREE_TYPE (len
), len
,
7737 len
= fold_convert (TREE_TYPE (dest
), len
);
7738 len
= fold (build2 (PLUS_EXPR
, TREE_TYPE (dest
), dest
, len
));
7739 return fold_convert (type
, len
);
7745 /* Fold function call to builtin memmove. Return
7746 NULL_TREE if no simplification can be made. */
7749 fold_builtin_memmove (tree arglist
, tree type
)
7751 tree dest
, src
, len
;
7753 if (!validate_arglist (arglist
,
7754 POINTER_TYPE
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
7757 dest
= TREE_VALUE (arglist
);
7758 src
= TREE_VALUE (TREE_CHAIN (arglist
));
7759 len
= TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist
)));
7761 /* If the LEN parameter is zero, return DEST. */
7762 if (integer_zerop (len
))
7763 return omit_one_operand (type
, dest
, src
);
7765 /* If SRC and DEST are the same (and not volatile), return DEST. */
7766 if (operand_equal_p (src
, dest
, 0))
7767 return omit_one_operand (type
, dest
, len
);
7772 /* Fold function call to builtin strcpy. If LEN is not NULL, it represents
7773 the length of the string to be copied. Return NULL_TREE if no
7774 simplification can be made. */
7777 fold_builtin_strcpy (tree fndecl
, tree arglist
, tree len
)
7781 if (!validate_arglist (arglist
,
7782 POINTER_TYPE
, POINTER_TYPE
, VOID_TYPE
))
7785 dest
= TREE_VALUE (arglist
);
7786 src
= TREE_VALUE (TREE_CHAIN (arglist
));
7788 /* If SRC and DEST are the same (and not volatile), return DEST. */
7789 if (operand_equal_p (src
, dest
, 0))
7790 return fold_convert (TREE_TYPE (TREE_TYPE (fndecl
)), dest
);
7795 fn
= implicit_built_in_decls
[BUILT_IN_MEMCPY
];
7801 len
= c_strlen (src
, 1);
7802 if (! len
|| TREE_SIDE_EFFECTS (len
))
7806 len
= size_binop (PLUS_EXPR
, len
, ssize_int (1));
7807 arglist
= build_tree_list (NULL_TREE
, len
);
7808 arglist
= tree_cons (NULL_TREE
, src
, arglist
);
7809 arglist
= tree_cons (NULL_TREE
, dest
, arglist
);
7810 return fold_convert (TREE_TYPE (TREE_TYPE (fndecl
)),
7811 build_function_call_expr (fn
, arglist
));
7814 /* Fold function call to builtin strncpy. If SLEN is not NULL, it represents
7815 the length of the source string. Return NULL_TREE if no simplification
7819 fold_builtin_strncpy (tree fndecl
, tree arglist
, tree slen
)
7821 tree dest
, src
, len
, fn
;
7823 if (!validate_arglist (arglist
,
7824 POINTER_TYPE
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
7827 dest
= TREE_VALUE (arglist
);
7828 src
= TREE_VALUE (TREE_CHAIN (arglist
));
7829 len
= TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist
)));
7831 /* If the LEN parameter is zero, return DEST. */
7832 if (integer_zerop (len
))
7833 return omit_one_operand (TREE_TYPE (TREE_TYPE (fndecl
)), dest
, src
);
7835 /* We can't compare slen with len as constants below if len is not a
7837 if (len
== 0 || TREE_CODE (len
) != INTEGER_CST
)
7841 slen
= c_strlen (src
, 1);
7843 /* Now, we must be passed a constant src ptr parameter. */
7844 if (slen
== 0 || TREE_CODE (slen
) != INTEGER_CST
)
7847 slen
= size_binop (PLUS_EXPR
, slen
, ssize_int (1));
7849 /* We do not support simplification of this case, though we do
7850 support it when expanding trees into RTL. */
7851 /* FIXME: generate a call to __builtin_memset. */
7852 if (tree_int_cst_lt (slen
, len
))
7855 /* OK transform into builtin memcpy. */
7856 fn
= implicit_built_in_decls
[BUILT_IN_MEMCPY
];
7859 return fold_convert (TREE_TYPE (TREE_TYPE (fndecl
)),
7860 build_function_call_expr (fn
, arglist
));
7863 /* Fold function call to builtin memcmp. Return
7864 NULL_TREE if no simplification can be made. */
7867 fold_builtin_memcmp (tree arglist
)
7869 tree arg1
, arg2
, len
;
7870 const char *p1
, *p2
;
7872 if (!validate_arglist (arglist
,
7873 POINTER_TYPE
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
7876 arg1
= TREE_VALUE (arglist
);
7877 arg2
= TREE_VALUE (TREE_CHAIN (arglist
));
7878 len
= TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist
)));
7880 /* If the LEN parameter is zero, return zero. */
7881 if (integer_zerop (len
))
7882 return omit_two_operands (integer_type_node
, integer_zero_node
,
7885 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
7886 if (operand_equal_p (arg1
, arg2
, 0))
7887 return omit_one_operand (integer_type_node
, integer_zero_node
, len
);
7889 p1
= c_getstr (arg1
);
7890 p2
= c_getstr (arg2
);
7892 /* If all arguments are constant, and the value of len is not greater
7893 than the lengths of arg1 and arg2, evaluate at compile-time. */
7894 if (host_integerp (len
, 1) && p1
&& p2
7895 && compare_tree_int (len
, strlen (p1
) + 1) <= 0
7896 && compare_tree_int (len
, strlen (p2
) + 1) <= 0)
7898 const int r
= memcmp (p1
, p2
, tree_low_cst (len
, 1));
7901 return integer_one_node
;
7903 return integer_minus_one_node
;
7905 return integer_zero_node
;
7908 /* If len parameter is one, return an expression corresponding to
7909 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
7910 if (host_integerp (len
, 1) && tree_low_cst (len
, 1) == 1)
7912 tree cst_uchar_node
= build_type_variant (unsigned_char_type_node
, 1, 0);
7913 tree cst_uchar_ptr_node
= build_pointer_type (cst_uchar_node
);
7914 tree ind1
= fold_convert (integer_type_node
,
7915 build1 (INDIRECT_REF
, cst_uchar_node
,
7916 fold_convert (cst_uchar_ptr_node
,
7918 tree ind2
= fold_convert (integer_type_node
,
7919 build1 (INDIRECT_REF
, cst_uchar_node
,
7920 fold_convert (cst_uchar_ptr_node
,
7922 return fold (build2 (MINUS_EXPR
, integer_type_node
, ind1
, ind2
));
7928 /* Fold function call to builtin strcmp. Return
7929 NULL_TREE if no simplification can be made. */
7932 fold_builtin_strcmp (tree arglist
)
7935 const char *p1
, *p2
;
7937 if (!validate_arglist (arglist
, POINTER_TYPE
, POINTER_TYPE
, VOID_TYPE
))
7940 arg1
= TREE_VALUE (arglist
);
7941 arg2
= TREE_VALUE (TREE_CHAIN (arglist
));
7943 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
7944 if (operand_equal_p (arg1
, arg2
, 0))
7945 return integer_zero_node
;
7947 p1
= c_getstr (arg1
);
7948 p2
= c_getstr (arg2
);
7952 const int i
= strcmp (p1
, p2
);
7954 return integer_minus_one_node
;
7956 return integer_one_node
;
7958 return integer_zero_node
;
7961 /* If the second arg is "", return *(const unsigned char*)arg1. */
7962 if (p2
&& *p2
== '\0')
7964 tree cst_uchar_node
= build_type_variant (unsigned_char_type_node
, 1, 0);
7965 tree cst_uchar_ptr_node
= build_pointer_type (cst_uchar_node
);
7966 return fold_convert (integer_type_node
,
7967 build1 (INDIRECT_REF
, cst_uchar_node
,
7968 fold_convert (cst_uchar_ptr_node
,
7972 /* If the first arg is "", return -*(const unsigned char*)arg2. */
7973 if (p1
&& *p1
== '\0')
7975 tree cst_uchar_node
= build_type_variant (unsigned_char_type_node
, 1, 0);
7976 tree cst_uchar_ptr_node
= build_pointer_type (cst_uchar_node
);
7977 tree temp
= fold_convert (integer_type_node
,
7978 build1 (INDIRECT_REF
, cst_uchar_node
,
7979 fold_convert (cst_uchar_ptr_node
,
7981 return fold (build1 (NEGATE_EXPR
, integer_type_node
, temp
));
7987 /* Fold function call to builtin strncmp. Return
7988 NULL_TREE if no simplification can be made. */
7991 fold_builtin_strncmp (tree arglist
)
7993 tree arg1
, arg2
, len
;
7994 const char *p1
, *p2
;
7996 if (!validate_arglist (arglist
,
7997 POINTER_TYPE
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
8000 arg1
= TREE_VALUE (arglist
);
8001 arg2
= TREE_VALUE (TREE_CHAIN (arglist
));
8002 len
= TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist
)));
8004 /* If the LEN parameter is zero, return zero. */
8005 if (integer_zerop (len
))
8006 return omit_two_operands (integer_type_node
, integer_zero_node
,
8009 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8010 if (operand_equal_p (arg1
, arg2
, 0))
8011 return omit_one_operand (integer_type_node
, integer_zero_node
, len
);
8013 p1
= c_getstr (arg1
);
8014 p2
= c_getstr (arg2
);
8016 if (host_integerp (len
, 1) && p1
&& p2
)
8018 const int i
= strncmp (p1
, p2
, tree_low_cst (len
, 1));
8020 return integer_one_node
;
8022 return integer_minus_one_node
;
8024 return integer_zero_node
;
8027 /* If the second arg is "", and the length is greater than zero,
8028 return *(const unsigned char*)arg1. */
8029 if (p2
&& *p2
== '\0'
8030 && TREE_CODE (len
) == INTEGER_CST
8031 && tree_int_cst_sgn (len
) == 1)
8033 tree cst_uchar_node
= build_type_variant (unsigned_char_type_node
, 1, 0);
8034 tree cst_uchar_ptr_node
= build_pointer_type (cst_uchar_node
);
8035 return fold_convert (integer_type_node
,
8036 build1 (INDIRECT_REF
, cst_uchar_node
,
8037 fold_convert (cst_uchar_ptr_node
,
8041 /* If the first arg is "", and the length is greater than zero,
8042 return -*(const unsigned char*)arg2. */
8043 if (p1
&& *p1
== '\0'
8044 && TREE_CODE (len
) == INTEGER_CST
8045 && tree_int_cst_sgn (len
) == 1)
8047 tree cst_uchar_node
= build_type_variant (unsigned_char_type_node
, 1, 0);
8048 tree cst_uchar_ptr_node
= build_pointer_type (cst_uchar_node
);
8049 tree temp
= fold_convert (integer_type_node
,
8050 build1 (INDIRECT_REF
, cst_uchar_node
,
8051 fold_convert (cst_uchar_ptr_node
,
8053 return fold (build1 (NEGATE_EXPR
, integer_type_node
, temp
));
8056 /* If len parameter is one, return an expression corresponding to
8057 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
8058 if (host_integerp (len
, 1) && tree_low_cst (len
, 1) == 1)
8060 tree cst_uchar_node
= build_type_variant (unsigned_char_type_node
, 1, 0);
8061 tree cst_uchar_ptr_node
= build_pointer_type (cst_uchar_node
);
8062 tree ind1
= fold_convert (integer_type_node
,
8063 build1 (INDIRECT_REF
, cst_uchar_node
,
8064 fold_convert (cst_uchar_ptr_node
,
8066 tree ind2
= fold_convert (integer_type_node
,
8067 build1 (INDIRECT_REF
, cst_uchar_node
,
8068 fold_convert (cst_uchar_ptr_node
,
8070 return fold (build2 (MINUS_EXPR
, integer_type_node
, ind1
, ind2
));
8076 /* Fold function call to builtin signbit, signbitf or signbitl. Return
8077 NULL_TREE if no simplification can be made. */
8080 fold_builtin_signbit (tree fndecl
, tree arglist
)
8082 tree type
= TREE_TYPE (TREE_TYPE (fndecl
));
8085 if (!validate_arglist (arglist
, REAL_TYPE
, VOID_TYPE
))
8088 arg
= TREE_VALUE (arglist
);
8090 /* If ARG is a compile-time constant, determine the result. */
8091 if (TREE_CODE (arg
) == REAL_CST
8092 && !TREE_CONSTANT_OVERFLOW (arg
))
8096 c
= TREE_REAL_CST (arg
);
8097 temp
= REAL_VALUE_NEGATIVE (c
) ? integer_one_node
: integer_zero_node
;
8098 return fold_convert (type
, temp
);
8101 /* If ARG is non-negative, the result is always zero. */
8102 if (tree_expr_nonnegative_p (arg
))
8103 return omit_one_operand (type
, integer_zero_node
, arg
);
8105 /* If ARG's format doesn't have signed zeros, return "arg < 0.0". */
8106 if (!HONOR_SIGNED_ZEROS (TYPE_MODE (TREE_TYPE (arg
))))
8107 return fold (build2 (LT_EXPR
, type
, arg
,
8108 build_real (TREE_TYPE (arg
), dconst0
)));
8113 /* Fold function call to builtin copysign, copysignf or copysignl.
8114 Return NULL_TREE if no simplification can be made. */
8117 fold_builtin_copysign (tree fndecl
, tree arglist
, tree type
)
8119 tree arg1
, arg2
, tem
;
8121 if (!validate_arglist (arglist
, REAL_TYPE
, REAL_TYPE
, VOID_TYPE
))
8124 arg1
= TREE_VALUE (arglist
);
8125 arg2
= TREE_VALUE (TREE_CHAIN (arglist
));
8127 /* copysign(X,X) is X. */
8128 if (operand_equal_p (arg1
, arg2
, 0))
8129 return fold_convert (type
, arg1
);
8131 /* If ARG1 and ARG2 are compile-time constants, determine the result. */
8132 if (TREE_CODE (arg1
) == REAL_CST
8133 && TREE_CODE (arg2
) == REAL_CST
8134 && !TREE_CONSTANT_OVERFLOW (arg1
)
8135 && !TREE_CONSTANT_OVERFLOW (arg2
))
8137 REAL_VALUE_TYPE c1
, c2
;
8139 c1
= TREE_REAL_CST (arg1
);
8140 c2
= TREE_REAL_CST (arg2
);
8141 real_copysign (&c1
, &c2
);
8142 return build_real (type
, c1
);
8146 /* copysign(X, Y) is fabs(X) when Y is always non-negative.
8147 Remember to evaluate Y for side-effects. */
8148 if (tree_expr_nonnegative_p (arg2
))
8149 return omit_one_operand (type
,
8150 fold (build1 (ABS_EXPR
, type
, arg1
)),
8153 /* Strip sign changing operations for the first argument. */
8154 tem
= fold_strip_sign_ops (arg1
);
8157 arglist
= tree_cons (NULL_TREE
, tem
, TREE_CHAIN (arglist
));
8158 return build_function_call_expr (fndecl
, arglist
);
8164 /* Fold a call to builtin isascii. */
8167 fold_builtin_isascii (tree arglist
)
8169 if (! validate_arglist (arglist
, INTEGER_TYPE
, VOID_TYPE
))
8173 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
8174 tree arg
= TREE_VALUE (arglist
);
8176 arg
= build2 (BIT_AND_EXPR
, integer_type_node
, arg
,
8177 build_int_cst (NULL_TREE
,
8178 ~ (unsigned HOST_WIDE_INT
) 0x7f));
8179 arg
= fold (build2 (EQ_EXPR
, integer_type_node
,
8180 arg
, integer_zero_node
));
8182 if (in_gimple_form
&& !TREE_CONSTANT (arg
))
8189 /* Fold a call to builtin toascii. */
8192 fold_builtin_toascii (tree arglist
)
8194 if (! validate_arglist (arglist
, INTEGER_TYPE
, VOID_TYPE
))
8198 /* Transform toascii(c) -> (c & 0x7f). */
8199 tree arg
= TREE_VALUE (arglist
);
8201 return fold (build2 (BIT_AND_EXPR
, integer_type_node
, arg
,
8202 build_int_cst (NULL_TREE
, 0x7f)));
8206 /* Fold a call to builtin isdigit. */
8209 fold_builtin_isdigit (tree arglist
)
8211 if (! validate_arglist (arglist
, INTEGER_TYPE
, VOID_TYPE
))
8215 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
8216 /* According to the C standard, isdigit is unaffected by locale.
8217 However, it definitely is affected by the target character set. */
8219 unsigned HOST_WIDE_INT target_digit0
8220 = lang_hooks
.to_target_charset ('0');
8222 if (target_digit0
== 0)
8225 arg
= fold_convert (unsigned_type_node
, TREE_VALUE (arglist
));
8226 arg
= build2 (MINUS_EXPR
, unsigned_type_node
, arg
,
8227 build_int_cst (unsigned_type_node
, target_digit0
));
8228 arg
= build2 (LE_EXPR
, integer_type_node
, arg
,
8229 build_int_cst (unsigned_type_node
, 9));
8231 if (in_gimple_form
&& !TREE_CONSTANT (arg
))
8238 /* Fold a call to fabs, fabsf or fabsl. */
8241 fold_builtin_fabs (tree arglist
, tree type
)
8245 if (!validate_arglist (arglist
, REAL_TYPE
, VOID_TYPE
))
8248 arg
= TREE_VALUE (arglist
);
8249 arg
= fold_convert (type
, arg
);
8250 if (TREE_CODE (arg
) == REAL_CST
)
8251 return fold_abs_const (arg
, type
);
8252 return fold (build1 (ABS_EXPR
, type
, arg
));
8255 /* Fold a call to abs, labs, llabs or imaxabs. */
8258 fold_builtin_abs (tree arglist
, tree type
)
8262 if (!validate_arglist (arglist
, INTEGER_TYPE
, VOID_TYPE
))
8265 arg
= TREE_VALUE (arglist
);
8266 arg
= fold_convert (type
, arg
);
8267 if (TREE_CODE (arg
) == INTEGER_CST
)
8268 return fold_abs_const (arg
, type
);
8269 return fold (build1 (ABS_EXPR
, type
, arg
));
8272 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
8273 EXP is the CALL_EXPR for the call. */
8276 fold_builtin_classify (tree fndecl
, tree arglist
, int builtin_index
)
8278 tree type
= TREE_TYPE (TREE_TYPE (fndecl
));
8282 if (!validate_arglist (arglist
, REAL_TYPE
, VOID_TYPE
))
8284 /* Check that we have exactly one argument. */
8287 error ("too few arguments to function %qs",
8288 IDENTIFIER_POINTER (DECL_NAME (fndecl
)));
8289 return error_mark_node
;
8291 else if (TREE_CHAIN (arglist
) != 0)
8293 error ("too many arguments to function %qs",
8294 IDENTIFIER_POINTER (DECL_NAME (fndecl
)));
8295 return error_mark_node
;
8299 error ("non-floating-point argument to function %qs",
8300 IDENTIFIER_POINTER (DECL_NAME (fndecl
)));
8301 return error_mark_node
;
8305 arg
= TREE_VALUE (arglist
);
8306 switch (builtin_index
)
8308 case BUILT_IN_ISINF
:
8309 if (!MODE_HAS_INFINITIES (TYPE_MODE (TREE_TYPE (arg
))))
8310 return omit_one_operand (type
, integer_zero_node
, arg
);
8312 if (TREE_CODE (arg
) == REAL_CST
)
8314 r
= TREE_REAL_CST (arg
);
8315 if (real_isinf (&r
))
8316 return real_compare (GT_EXPR
, &r
, &dconst0
)
8317 ? integer_one_node
: integer_minus_one_node
;
8319 return integer_zero_node
;
8324 case BUILT_IN_FINITE
:
8325 if (!MODE_HAS_NANS (TYPE_MODE (TREE_TYPE (arg
)))
8326 && !MODE_HAS_INFINITIES (TYPE_MODE (TREE_TYPE (arg
))))
8327 return omit_one_operand (type
, integer_zero_node
, arg
);
8329 if (TREE_CODE (arg
) == REAL_CST
)
8331 r
= TREE_REAL_CST (arg
);
8332 return real_isinf (&r
) || real_isnan (&r
)
8333 ? integer_zero_node
: integer_one_node
;
8338 case BUILT_IN_ISNAN
:
8339 if (!MODE_HAS_NANS (TYPE_MODE (TREE_TYPE (arg
))))
8340 return omit_one_operand (type
, integer_zero_node
, arg
);
8342 if (TREE_CODE (arg
) == REAL_CST
)
8344 r
= TREE_REAL_CST (arg
);
8345 return real_isnan (&r
) ? integer_one_node
: integer_zero_node
;
8348 arg
= builtin_save_expr (arg
);
8349 return fold (build2 (UNORDERED_EXPR
, type
, arg
, arg
));
8356 /* Fold a call to an unordered comparison function such as
8357 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
8358 being called and ARGLIST is the argument list for the call.
8359 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
8360 the opposite of the desired result. UNORDERED_CODE is used
8361 for modes that can hold NaNs and ORDERED_CODE is used for
8365 fold_builtin_unordered_cmp (tree fndecl
, tree arglist
,
8366 enum tree_code unordered_code
,
8367 enum tree_code ordered_code
)
8369 tree type
= TREE_TYPE (TREE_TYPE (fndecl
));
8370 enum tree_code code
;
8373 enum tree_code code0
, code1
;
8374 tree cmp_type
= NULL_TREE
;
8376 if (!validate_arglist (arglist
, REAL_TYPE
, REAL_TYPE
, VOID_TYPE
))
8378 /* Check that we have exactly two arguments. */
8379 if (arglist
== 0 || TREE_CHAIN (arglist
) == 0)
8381 error ("too few arguments to function %qs",
8382 IDENTIFIER_POINTER (DECL_NAME (fndecl
)));
8383 return error_mark_node
;
8385 else if (TREE_CHAIN (TREE_CHAIN (arglist
)) != 0)
8387 error ("too many arguments to function %qs",
8388 IDENTIFIER_POINTER (DECL_NAME (fndecl
)));
8389 return error_mark_node
;
8393 arg0
= TREE_VALUE (arglist
);
8394 arg1
= TREE_VALUE (TREE_CHAIN (arglist
));
8396 type0
= TREE_TYPE (arg0
);
8397 type1
= TREE_TYPE (arg1
);
8399 code0
= TREE_CODE (type0
);
8400 code1
= TREE_CODE (type1
);
8402 if (code0
== REAL_TYPE
&& code1
== REAL_TYPE
)
8403 /* Choose the wider of two real types. */
8404 cmp_type
= TYPE_PRECISION (type0
) >= TYPE_PRECISION (type1
)
8406 else if (code0
== REAL_TYPE
&& code1
== INTEGER_TYPE
)
8408 else if (code0
== INTEGER_TYPE
&& code1
== REAL_TYPE
)
8412 error ("non-floating-point argument to function %qs",
8413 IDENTIFIER_POINTER (DECL_NAME (fndecl
)));
8414 return error_mark_node
;
8417 arg0
= fold_convert (cmp_type
, arg0
);
8418 arg1
= fold_convert (cmp_type
, arg1
);
8420 if (unordered_code
== UNORDERED_EXPR
)
8422 if (!MODE_HAS_NANS (TYPE_MODE (TREE_TYPE (arg0
))))
8423 return omit_two_operands (type
, integer_zero_node
, arg0
, arg1
);
8424 return fold (build2 (UNORDERED_EXPR
, type
, arg0
, arg1
));
8427 code
= MODE_HAS_NANS (TYPE_MODE (TREE_TYPE (arg0
))) ? unordered_code
8429 return fold (build1 (TRUTH_NOT_EXPR
, type
,
8430 fold (build2 (code
, type
, arg0
, arg1
))));
8433 /* Used by constant folding to simplify calls to builtin functions. EXP is
8434 the CALL_EXPR of a call to a builtin function. IGNORE is true if the
8435 result of the function call is ignored. This function returns NULL_TREE
8436 if no simplification was possible. */
8439 fold_builtin_1 (tree fndecl
, tree arglist
, bool ignore
)
8441 tree type
= TREE_TYPE (TREE_TYPE (fndecl
));
8442 enum built_in_function fcode
;
8444 if (DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_MD
)
8445 return targetm
.fold_builtin (fndecl
, arglist
, ignore
);
8447 fcode
= DECL_FUNCTION_CODE (fndecl
);
8450 case BUILT_IN_FPUTS
:
8451 return fold_builtin_fputs (arglist
, ignore
, false, NULL_TREE
);
8453 case BUILT_IN_FPUTS_UNLOCKED
:
8454 return fold_builtin_fputs (arglist
, ignore
, true, NULL_TREE
);
8456 case BUILT_IN_STRSTR
:
8457 return fold_builtin_strstr (arglist
, type
);
8459 case BUILT_IN_STRCAT
:
8460 return fold_builtin_strcat (arglist
);
8462 case BUILT_IN_STRNCAT
:
8463 return fold_builtin_strncat (arglist
);
8465 case BUILT_IN_STRSPN
:
8466 return fold_builtin_strspn (arglist
);
8468 case BUILT_IN_STRCSPN
:
8469 return fold_builtin_strcspn (arglist
);
8471 case BUILT_IN_STRCHR
:
8472 case BUILT_IN_INDEX
:
8473 return fold_builtin_strchr (arglist
, type
);
8475 case BUILT_IN_STRRCHR
:
8476 case BUILT_IN_RINDEX
:
8477 return fold_builtin_strrchr (arglist
, type
);
8479 case BUILT_IN_STRCPY
:
8480 return fold_builtin_strcpy (fndecl
, arglist
, NULL_TREE
);
8482 case BUILT_IN_STRNCPY
:
8483 return fold_builtin_strncpy (fndecl
, arglist
, NULL_TREE
);
8485 case BUILT_IN_STRCMP
:
8486 return fold_builtin_strcmp (arglist
);
8488 case BUILT_IN_STRNCMP
:
8489 return fold_builtin_strncmp (arglist
);
8491 case BUILT_IN_STRPBRK
:
8492 return fold_builtin_strpbrk (arglist
, type
);
8495 case BUILT_IN_MEMCMP
:
8496 return fold_builtin_memcmp (arglist
);
8498 case BUILT_IN_SPRINTF
:
8499 return fold_builtin_sprintf (arglist
, ignore
);
8501 case BUILT_IN_CONSTANT_P
:
8505 val
= fold_builtin_constant_p (arglist
);
8506 /* Gimplification will pull the CALL_EXPR for the builtin out of
8507 an if condition. When not optimizing, we'll not CSE it back.
8508 To avoid link error types of regressions, return false now. */
8509 if (!val
&& !optimize
)
8510 val
= integer_zero_node
;
8515 case BUILT_IN_EXPECT
:
8516 return fold_builtin_expect (arglist
);
8518 case BUILT_IN_CLASSIFY_TYPE
:
8519 return fold_builtin_classify_type (arglist
);
8521 case BUILT_IN_STRLEN
:
8522 return fold_builtin_strlen (arglist
);
8525 case BUILT_IN_FABSF
:
8526 case BUILT_IN_FABSL
:
8527 return fold_builtin_fabs (arglist
, type
);
8531 case BUILT_IN_LLABS
:
8532 case BUILT_IN_IMAXABS
:
8533 return fold_builtin_abs (arglist
, type
);
8536 case BUILT_IN_CONJF
:
8537 case BUILT_IN_CONJL
:
8538 if (validate_arglist (arglist
, COMPLEX_TYPE
, VOID_TYPE
))
8539 return fold (build1 (CONJ_EXPR
, type
, TREE_VALUE (arglist
)));
8542 case BUILT_IN_CREAL
:
8543 case BUILT_IN_CREALF
:
8544 case BUILT_IN_CREALL
:
8545 if (validate_arglist (arglist
, COMPLEX_TYPE
, VOID_TYPE
))
8546 return non_lvalue (fold (build1 (REALPART_EXPR
, type
,
8547 TREE_VALUE (arglist
))));
8550 case BUILT_IN_CIMAG
:
8551 case BUILT_IN_CIMAGF
:
8552 case BUILT_IN_CIMAGL
:
8553 if (validate_arglist (arglist
, COMPLEX_TYPE
, VOID_TYPE
))
8554 return non_lvalue (fold (build1 (IMAGPART_EXPR
, type
,
8555 TREE_VALUE (arglist
))));
8559 case BUILT_IN_CABSF
:
8560 case BUILT_IN_CABSL
:
8561 return fold_builtin_cabs (arglist
, type
);
8564 case BUILT_IN_SQRTF
:
8565 case BUILT_IN_SQRTL
:
8566 return fold_builtin_sqrt (arglist
, type
);
8569 case BUILT_IN_CBRTF
:
8570 case BUILT_IN_CBRTL
:
8571 return fold_builtin_cbrt (arglist
, type
);
8576 return fold_builtin_sin (arglist
);
8581 return fold_builtin_cos (arglist
, type
, fndecl
);
8586 return fold_builtin_exponent (fndecl
, arglist
, &dconste
);
8589 case BUILT_IN_EXP2F
:
8590 case BUILT_IN_EXP2L
:
8591 return fold_builtin_exponent (fndecl
, arglist
, &dconst2
);
8593 case BUILT_IN_EXP10
:
8594 case BUILT_IN_EXP10F
:
8595 case BUILT_IN_EXP10L
:
8596 case BUILT_IN_POW10
:
8597 case BUILT_IN_POW10F
:
8598 case BUILT_IN_POW10L
:
8599 return fold_builtin_exponent (fndecl
, arglist
, &dconst10
);
8604 return fold_builtin_logarithm (fndecl
, arglist
, &dconste
);
8607 case BUILT_IN_LOG2F
:
8608 case BUILT_IN_LOG2L
:
8609 return fold_builtin_logarithm (fndecl
, arglist
, &dconst2
);
8611 case BUILT_IN_LOG10
:
8612 case BUILT_IN_LOG10F
:
8613 case BUILT_IN_LOG10L
:
8614 return fold_builtin_logarithm (fndecl
, arglist
, &dconst10
);
8619 return fold_builtin_tan (arglist
);
8622 case BUILT_IN_ATANF
:
8623 case BUILT_IN_ATANL
:
8624 return fold_builtin_atan (arglist
, type
);
8629 return fold_builtin_pow (fndecl
, arglist
, type
);
8632 case BUILT_IN_POWIF
:
8633 case BUILT_IN_POWIL
:
8634 return fold_builtin_powi (fndecl
, arglist
, type
);
8639 return fold_builtin_inf (type
, true);
8641 case BUILT_IN_HUGE_VAL
:
8642 case BUILT_IN_HUGE_VALF
:
8643 case BUILT_IN_HUGE_VALL
:
8644 return fold_builtin_inf (type
, false);
8649 return fold_builtin_nan (arglist
, type
, true);
8652 case BUILT_IN_NANSF
:
8653 case BUILT_IN_NANSL
:
8654 return fold_builtin_nan (arglist
, type
, false);
8656 case BUILT_IN_FLOOR
:
8657 case BUILT_IN_FLOORF
:
8658 case BUILT_IN_FLOORL
:
8659 return fold_builtin_floor (fndecl
, arglist
);
8662 case BUILT_IN_CEILF
:
8663 case BUILT_IN_CEILL
:
8664 return fold_builtin_ceil (fndecl
, arglist
);
8666 case BUILT_IN_TRUNC
:
8667 case BUILT_IN_TRUNCF
:
8668 case BUILT_IN_TRUNCL
:
8669 return fold_builtin_trunc (fndecl
, arglist
);
8671 case BUILT_IN_ROUND
:
8672 case BUILT_IN_ROUNDF
:
8673 case BUILT_IN_ROUNDL
:
8674 return fold_builtin_round (fndecl
, arglist
);
8676 case BUILT_IN_NEARBYINT
:
8677 case BUILT_IN_NEARBYINTF
:
8678 case BUILT_IN_NEARBYINTL
:
8680 case BUILT_IN_RINTF
:
8681 case BUILT_IN_RINTL
:
8682 return fold_trunc_transparent_mathfn (fndecl
, arglist
);
8684 case BUILT_IN_LCEIL
:
8685 case BUILT_IN_LCEILF
:
8686 case BUILT_IN_LCEILL
:
8687 case BUILT_IN_LLCEIL
:
8688 case BUILT_IN_LLCEILF
:
8689 case BUILT_IN_LLCEILL
:
8690 case BUILT_IN_LFLOOR
:
8691 case BUILT_IN_LFLOORF
:
8692 case BUILT_IN_LFLOORL
:
8693 case BUILT_IN_LLFLOOR
:
8694 case BUILT_IN_LLFLOORF
:
8695 case BUILT_IN_LLFLOORL
:
8696 case BUILT_IN_LROUND
:
8697 case BUILT_IN_LROUNDF
:
8698 case BUILT_IN_LROUNDL
:
8699 case BUILT_IN_LLROUND
:
8700 case BUILT_IN_LLROUNDF
:
8701 case BUILT_IN_LLROUNDL
:
8702 return fold_builtin_int_roundingfn (fndecl
, arglist
);
8704 case BUILT_IN_LRINT
:
8705 case BUILT_IN_LRINTF
:
8706 case BUILT_IN_LRINTL
:
8707 case BUILT_IN_LLRINT
:
8708 case BUILT_IN_LLRINTF
:
8709 case BUILT_IN_LLRINTL
:
8710 return fold_fixed_mathfn (fndecl
, arglist
);
8714 case BUILT_IN_FFSLL
:
8717 case BUILT_IN_CLZLL
:
8720 case BUILT_IN_CTZLL
:
8721 case BUILT_IN_POPCOUNT
:
8722 case BUILT_IN_POPCOUNTL
:
8723 case BUILT_IN_POPCOUNTLL
:
8724 case BUILT_IN_PARITY
:
8725 case BUILT_IN_PARITYL
:
8726 case BUILT_IN_PARITYLL
:
8727 return fold_builtin_bitop (fndecl
, arglist
);
8729 case BUILT_IN_MEMCPY
:
8730 return fold_builtin_memcpy (fndecl
, arglist
);
8732 case BUILT_IN_MEMPCPY
:
8733 return fold_builtin_mempcpy (arglist
, type
, /*endp=*/1);
8735 case BUILT_IN_MEMMOVE
:
8736 return fold_builtin_memmove (arglist
, type
);
8738 case BUILT_IN_SIGNBIT
:
8739 case BUILT_IN_SIGNBITF
:
8740 case BUILT_IN_SIGNBITL
:
8741 return fold_builtin_signbit (fndecl
, arglist
);
8743 case BUILT_IN_ISASCII
:
8744 return fold_builtin_isascii (arglist
);
8746 case BUILT_IN_TOASCII
:
8747 return fold_builtin_toascii (arglist
);
8749 case BUILT_IN_ISDIGIT
:
8750 return fold_builtin_isdigit (arglist
);
8752 case BUILT_IN_COPYSIGN
:
8753 case BUILT_IN_COPYSIGNF
:
8754 case BUILT_IN_COPYSIGNL
:
8755 return fold_builtin_copysign (fndecl
, arglist
, type
);
8757 case BUILT_IN_FINITE
:
8758 case BUILT_IN_FINITEF
:
8759 case BUILT_IN_FINITEL
:
8760 return fold_builtin_classify (fndecl
, arglist
, BUILT_IN_FINITE
);
8762 case BUILT_IN_ISINF
:
8763 case BUILT_IN_ISINFF
:
8764 case BUILT_IN_ISINFL
:
8765 return fold_builtin_classify (fndecl
, arglist
, BUILT_IN_ISINF
);
8767 case BUILT_IN_ISNAN
:
8768 case BUILT_IN_ISNANF
:
8769 case BUILT_IN_ISNANL
:
8770 return fold_builtin_classify (fndecl
, arglist
, BUILT_IN_ISNAN
);
8772 case BUILT_IN_ISGREATER
:
8773 return fold_builtin_unordered_cmp (fndecl
, arglist
, UNLE_EXPR
, LE_EXPR
);
8774 case BUILT_IN_ISGREATEREQUAL
:
8775 return fold_builtin_unordered_cmp (fndecl
, arglist
, UNLT_EXPR
, LT_EXPR
);
8776 case BUILT_IN_ISLESS
:
8777 return fold_builtin_unordered_cmp (fndecl
, arglist
, UNGE_EXPR
, GE_EXPR
);
8778 case BUILT_IN_ISLESSEQUAL
:
8779 return fold_builtin_unordered_cmp (fndecl
, arglist
, UNGT_EXPR
, GT_EXPR
);
8780 case BUILT_IN_ISLESSGREATER
:
8781 return fold_builtin_unordered_cmp (fndecl
, arglist
, UNEQ_EXPR
, EQ_EXPR
);
8782 case BUILT_IN_ISUNORDERED
:
8783 return fold_builtin_unordered_cmp (fndecl
, arglist
, UNORDERED_EXPR
,
8786 /* We do the folding for va_start in the expander. */
8787 case BUILT_IN_VA_START
:
8797 /* A wrapper function for builtin folding that prevents warnings for
8798 "statement without effect" and the like, caused by removing the
8799 call node earlier than the warning is generated. */
8802 fold_builtin (tree fndecl
, tree arglist
, bool ignore
)
8804 tree exp
= fold_builtin_1 (fndecl
, arglist
, ignore
);
8807 /* ??? Don't clobber shared nodes such as integer_zero_node. */
8808 if (CONSTANT_CLASS_P (exp
))
8809 exp
= build1 (NOP_EXPR
, TREE_TYPE (exp
), exp
);
8810 TREE_NO_WARNING (exp
) = 1;
8816 /* Conveniently construct a function call expression. */
8819 build_function_call_expr (tree fn
, tree arglist
)
8823 call_expr
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (fn
)), fn
);
8824 call_expr
= build3 (CALL_EXPR
, TREE_TYPE (TREE_TYPE (fn
)),
8825 call_expr
, arglist
, NULL_TREE
);
8826 return fold (call_expr
);
8829 /* This function validates the types of a function call argument list
8830 represented as a tree chain of parameters against a specified list
8831 of tree_codes. If the last specifier is a 0, that represents an
8832 ellipses, otherwise the last specifier must be a VOID_TYPE. */
8835 validate_arglist (tree arglist
, ...)
8837 enum tree_code code
;
8841 va_start (ap
, arglist
);
8845 code
= va_arg (ap
, enum tree_code
);
8849 /* This signifies an ellipses, any further arguments are all ok. */
8853 /* This signifies an endlink, if no arguments remain, return
8854 true, otherwise return false. */
8858 /* If no parameters remain or the parameter's code does not
8859 match the specified code, return false. Otherwise continue
8860 checking any remaining arguments. */
8863 if (code
== POINTER_TYPE
)
8865 if (! POINTER_TYPE_P (TREE_TYPE (TREE_VALUE (arglist
))))
8868 else if (code
!= TREE_CODE (TREE_TYPE (TREE_VALUE (arglist
))))
8872 arglist
= TREE_CHAIN (arglist
);
8876 /* We need gotos here since we can only have one VA_CLOSE in a
8884 /* Default target-specific builtin expander that does nothing. */
8887 default_expand_builtin (tree exp ATTRIBUTE_UNUSED
,
8888 rtx target ATTRIBUTE_UNUSED
,
8889 rtx subtarget ATTRIBUTE_UNUSED
,
8890 enum machine_mode mode ATTRIBUTE_UNUSED
,
8891 int ignore ATTRIBUTE_UNUSED
)
8896 /* Returns true is EXP represents data that would potentially reside
8897 in a readonly section. */
8900 readonly_data_expr (tree exp
)
8904 if (TREE_CODE (exp
) != ADDR_EXPR
)
8907 exp
= get_base_address (TREE_OPERAND (exp
, 0));
8911 /* Make sure we call decl_readonly_section only for trees it
8912 can handle (since it returns true for everything it doesn't
8914 if (TREE_CODE (exp
) == STRING_CST
8915 || TREE_CODE (exp
) == CONSTRUCTOR
8916 || (TREE_CODE (exp
) == VAR_DECL
&& TREE_STATIC (exp
)))
8917 return decl_readonly_section (exp
, 0);
8922 /* Simplify a call to the strstr builtin.
8924 Return 0 if no simplification was possible, otherwise return the
8925 simplified form of the call as a tree.
8927 The simplified form may be a constant or other expression which
8928 computes the same value, but in a more efficient manner (including
8929 calls to other builtin functions).
8931 The call may contain arguments which need to be evaluated, but
8932 which are not useful to determine the result of the call. In
8933 this case we return a chain of COMPOUND_EXPRs. The LHS of each
8934 COMPOUND_EXPR will be an argument which must be evaluated.
8935 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
8936 COMPOUND_EXPR in the chain will contain the tree for the simplified
8937 form of the builtin function call. */
8940 fold_builtin_strstr (tree arglist
, tree type
)
8942 if (!validate_arglist (arglist
, POINTER_TYPE
, POINTER_TYPE
, VOID_TYPE
))
8946 tree s1
= TREE_VALUE (arglist
), s2
= TREE_VALUE (TREE_CHAIN (arglist
));
8948 const char *p1
, *p2
;
8957 const char *r
= strstr (p1
, p2
);
8961 return build_int_cst (TREE_TYPE (s1
), 0);
8963 /* Return an offset into the constant string argument. */
8964 tem
= fold (build2 (PLUS_EXPR
, TREE_TYPE (s1
),
8965 s1
, build_int_cst (TREE_TYPE (s1
), r
- p1
)));
8966 return fold_convert (type
, tem
);
8975 fn
= implicit_built_in_decls
[BUILT_IN_STRCHR
];
8979 /* New argument list transforming strstr(s1, s2) to
8980 strchr(s1, s2[0]). */
8981 arglist
= build_tree_list (NULL_TREE
,
8982 build_int_cst (NULL_TREE
, p2
[0]));
8983 arglist
= tree_cons (NULL_TREE
, s1
, arglist
);
8984 return build_function_call_expr (fn
, arglist
);
8988 /* Simplify a call to the strchr builtin.
8990 Return 0 if no simplification was possible, otherwise return the
8991 simplified form of the call as a tree.
8993 The simplified form may be a constant or other expression which
8994 computes the same value, but in a more efficient manner (including
8995 calls to other builtin functions).
8997 The call may contain arguments which need to be evaluated, but
8998 which are not useful to determine the result of the call. In
8999 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9000 COMPOUND_EXPR will be an argument which must be evaluated.
9001 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9002 COMPOUND_EXPR in the chain will contain the tree for the simplified
9003 form of the builtin function call. */
9006 fold_builtin_strchr (tree arglist
, tree type
)
9008 if (!validate_arglist (arglist
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
9012 tree s1
= TREE_VALUE (arglist
), s2
= TREE_VALUE (TREE_CHAIN (arglist
));
9015 if (TREE_CODE (s2
) != INTEGER_CST
)
9025 if (target_char_cast (s2
, &c
))
9031 return build_int_cst (TREE_TYPE (s1
), 0);
9033 /* Return an offset into the constant string argument. */
9034 tem
= fold (build2 (PLUS_EXPR
, TREE_TYPE (s1
),
9035 s1
, build_int_cst (TREE_TYPE (s1
), r
- p1
)));
9036 return fold_convert (type
, tem
);
9042 /* Simplify a call to the strrchr builtin.
9044 Return 0 if no simplification was possible, otherwise return the
9045 simplified form of the call as a tree.
9047 The simplified form may be a constant or other expression which
9048 computes the same value, but in a more efficient manner (including
9049 calls to other builtin functions).
9051 The call may contain arguments which need to be evaluated, but
9052 which are not useful to determine the result of the call. In
9053 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9054 COMPOUND_EXPR will be an argument which must be evaluated.
9055 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9056 COMPOUND_EXPR in the chain will contain the tree for the simplified
9057 form of the builtin function call. */
9060 fold_builtin_strrchr (tree arglist
, tree type
)
9062 if (!validate_arglist (arglist
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
9066 tree s1
= TREE_VALUE (arglist
), s2
= TREE_VALUE (TREE_CHAIN (arglist
));
9070 if (TREE_CODE (s2
) != INTEGER_CST
)
9080 if (target_char_cast (s2
, &c
))
9083 r
= strrchr (p1
, c
);
9086 return build_int_cst (TREE_TYPE (s1
), 0);
9088 /* Return an offset into the constant string argument. */
9089 tem
= fold (build2 (PLUS_EXPR
, TREE_TYPE (s1
),
9090 s1
, build_int_cst (TREE_TYPE (s1
), r
- p1
)));
9091 return fold_convert (type
, tem
);
9094 if (! integer_zerop (s2
))
9097 fn
= implicit_built_in_decls
[BUILT_IN_STRCHR
];
9101 /* Transform strrchr(s1, '\0') to strchr(s1, '\0'). */
9102 return build_function_call_expr (fn
, arglist
);
9106 /* Simplify a call to the strpbrk builtin.
9108 Return 0 if no simplification was possible, otherwise return the
9109 simplified form of the call as a tree.
9111 The simplified form may be a constant or other expression which
9112 computes the same value, but in a more efficient manner (including
9113 calls to other builtin functions).
9115 The call may contain arguments which need to be evaluated, but
9116 which are not useful to determine the result of the call. In
9117 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9118 COMPOUND_EXPR will be an argument which must be evaluated.
9119 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9120 COMPOUND_EXPR in the chain will contain the tree for the simplified
9121 form of the builtin function call. */
9124 fold_builtin_strpbrk (tree arglist
, tree type
)
9126 if (!validate_arglist (arglist
, POINTER_TYPE
, POINTER_TYPE
, VOID_TYPE
))
9130 tree s1
= TREE_VALUE (arglist
), s2
= TREE_VALUE (TREE_CHAIN (arglist
));
9132 const char *p1
, *p2
;
9141 const char *r
= strpbrk (p1
, p2
);
9145 return build_int_cst (TREE_TYPE (s1
), 0);
9147 /* Return an offset into the constant string argument. */
9148 tem
= fold (build2 (PLUS_EXPR
, TREE_TYPE (s1
),
9149 s1
, build_int_cst (TREE_TYPE (s1
), r
- p1
)));
9150 return fold_convert (type
, tem
);
9154 /* strpbrk(x, "") == NULL.
9155 Evaluate and ignore s1 in case it had side-effects. */
9156 return omit_one_operand (TREE_TYPE (s1
), integer_zero_node
, s1
);
9159 return 0; /* Really call strpbrk. */
9161 fn
= implicit_built_in_decls
[BUILT_IN_STRCHR
];
9165 /* New argument list transforming strpbrk(s1, s2) to
9166 strchr(s1, s2[0]). */
9167 arglist
= build_tree_list (NULL_TREE
,
9168 build_int_cst (NULL_TREE
, p2
[0]));
9169 arglist
= tree_cons (NULL_TREE
, s1
, arglist
);
9170 return build_function_call_expr (fn
, arglist
);
9174 /* Simplify a call to the strcat builtin.
9176 Return 0 if no simplification was possible, otherwise return the
9177 simplified form of the call as a tree.
9179 The simplified form may be a constant or other expression which
9180 computes the same value, but in a more efficient manner (including
9181 calls to other builtin functions).
9183 The call may contain arguments which need to be evaluated, but
9184 which are not useful to determine the result of the call. In
9185 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9186 COMPOUND_EXPR will be an argument which must be evaluated.
9187 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9188 COMPOUND_EXPR in the chain will contain the tree for the simplified
9189 form of the builtin function call. */
9192 fold_builtin_strcat (tree arglist
)
9194 if (!validate_arglist (arglist
, POINTER_TYPE
, POINTER_TYPE
, VOID_TYPE
))
9198 tree dst
= TREE_VALUE (arglist
),
9199 src
= TREE_VALUE (TREE_CHAIN (arglist
));
9200 const char *p
= c_getstr (src
);
9202 /* If the string length is zero, return the dst parameter. */
9203 if (p
&& *p
== '\0')
9210 /* Simplify a call to the strncat builtin.
9212 Return 0 if no simplification was possible, otherwise return the
9213 simplified form of the call as a tree.
9215 The simplified form may be a constant or other expression which
9216 computes the same value, but in a more efficient manner (including
9217 calls to other builtin functions).
9219 The call may contain arguments which need to be evaluated, but
9220 which are not useful to determine the result of the call. In
9221 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9222 COMPOUND_EXPR will be an argument which must be evaluated.
9223 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9224 COMPOUND_EXPR in the chain will contain the tree for the simplified
9225 form of the builtin function call. */
9228 fold_builtin_strncat (tree arglist
)
9230 if (!validate_arglist (arglist
,
9231 POINTER_TYPE
, POINTER_TYPE
, INTEGER_TYPE
, VOID_TYPE
))
9235 tree dst
= TREE_VALUE (arglist
);
9236 tree src
= TREE_VALUE (TREE_CHAIN (arglist
));
9237 tree len
= TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist
)));
9238 const char *p
= c_getstr (src
);
9240 /* If the requested length is zero, or the src parameter string
9241 length is zero, return the dst parameter. */
9242 if (integer_zerop (len
) || (p
&& *p
== '\0'))
9243 return omit_two_operands (TREE_TYPE (dst
), dst
, src
, len
);
9245 /* If the requested len is greater than or equal to the string
9246 length, call strcat. */
9247 if (TREE_CODE (len
) == INTEGER_CST
&& p
9248 && compare_tree_int (len
, strlen (p
)) >= 0)
9251 = tree_cons (NULL_TREE
, dst
, build_tree_list (NULL_TREE
, src
));
9252 tree fn
= implicit_built_in_decls
[BUILT_IN_STRCAT
];
9254 /* If the replacement _DECL isn't initialized, don't do the
9259 return build_function_call_expr (fn
, newarglist
);
9265 /* Simplify a call to the strspn builtin.
9267 Return 0 if no simplification was possible, otherwise return the
9268 simplified form of the call as a tree.
9270 The simplified form may be a constant or other expression which
9271 computes the same value, but in a more efficient manner (including
9272 calls to other builtin functions).
9274 The call may contain arguments which need to be evaluated, but
9275 which are not useful to determine the result of the call. In
9276 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9277 COMPOUND_EXPR will be an argument which must be evaluated.
9278 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9279 COMPOUND_EXPR in the chain will contain the tree for the simplified
9280 form of the builtin function call. */
9283 fold_builtin_strspn (tree arglist
)
9285 if (!validate_arglist (arglist
, POINTER_TYPE
, POINTER_TYPE
, VOID_TYPE
))
9289 tree s1
= TREE_VALUE (arglist
), s2
= TREE_VALUE (TREE_CHAIN (arglist
));
9290 const char *p1
= c_getstr (s1
), *p2
= c_getstr (s2
);
9292 /* If both arguments are constants, evaluate at compile-time. */
9295 const size_t r
= strspn (p1
, p2
);
9296 return size_int (r
);
9299 /* If either argument is "", return 0. */
9300 if ((p1
&& *p1
== '\0') || (p2
&& *p2
== '\0'))
9301 /* Evaluate and ignore both arguments in case either one has
9303 return omit_two_operands (integer_type_node
, integer_zero_node
,
9309 /* Simplify a call to the strcspn builtin.
9311 Return 0 if no simplification was possible, otherwise return the
9312 simplified form of the call as a tree.
9314 The simplified form may be a constant or other expression which
9315 computes the same value, but in a more efficient manner (including
9316 calls to other builtin functions).
9318 The call may contain arguments which need to be evaluated, but
9319 which are not useful to determine the result of the call. In
9320 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9321 COMPOUND_EXPR will be an argument which must be evaluated.
9322 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9323 COMPOUND_EXPR in the chain will contain the tree for the simplified
9324 form of the builtin function call. */
9327 fold_builtin_strcspn (tree arglist
)
9329 if (!validate_arglist (arglist
, POINTER_TYPE
, POINTER_TYPE
, VOID_TYPE
))
9333 tree s1
= TREE_VALUE (arglist
), s2
= TREE_VALUE (TREE_CHAIN (arglist
));
9334 const char *p1
= c_getstr (s1
), *p2
= c_getstr (s2
);
9336 /* If both arguments are constants, evaluate at compile-time. */
9339 const size_t r
= strcspn (p1
, p2
);
9340 return size_int (r
);
9343 /* If the first argument is "", return 0. */
9344 if (p1
&& *p1
== '\0')
9346 /* Evaluate and ignore argument s2 in case it has
9348 return omit_one_operand (integer_type_node
,
9349 integer_zero_node
, s2
);
9352 /* If the second argument is "", return __builtin_strlen(s1). */
9353 if (p2
&& *p2
== '\0')
9355 tree newarglist
= build_tree_list (NULL_TREE
, s1
),
9356 fn
= implicit_built_in_decls
[BUILT_IN_STRLEN
];
9358 /* If the replacement _DECL isn't initialized, don't do the
9363 return build_function_call_expr (fn
, newarglist
);
9369 /* Fold a call to the fputs builtin. IGNORE is true if the value returned
9370 by the builtin will be ignored. UNLOCKED is true is true if this
9371 actually a call to fputs_unlocked. If LEN in non-NULL, it represents
9372 the known length of the string. Return NULL_TREE if no simplification
9376 fold_builtin_fputs (tree arglist
, bool ignore
, bool unlocked
, tree len
)
9379 tree fn_fputc
= unlocked
? implicit_built_in_decls
[BUILT_IN_FPUTC_UNLOCKED
]
9380 : implicit_built_in_decls
[BUILT_IN_FPUTC
];
9381 tree fn_fwrite
= unlocked
? implicit_built_in_decls
[BUILT_IN_FWRITE_UNLOCKED
]
9382 : implicit_built_in_decls
[BUILT_IN_FWRITE
];
9384 /* If the return value is used, or the replacement _DECL isn't
9385 initialized, don't do the transformation. */
9386 if (!ignore
|| !fn_fputc
|| !fn_fwrite
)
9389 /* Verify the arguments in the original call. */
9390 if (!validate_arglist (arglist
, POINTER_TYPE
, POINTER_TYPE
, VOID_TYPE
))
9394 len
= c_strlen (TREE_VALUE (arglist
), 0);
9396 /* Get the length of the string passed to fputs. If the length
9397 can't be determined, punt. */
9399 || TREE_CODE (len
) != INTEGER_CST
)
9402 switch (compare_tree_int (len
, 1))
9404 case -1: /* length is 0, delete the call entirely . */
9405 return omit_one_operand (integer_type_node
, integer_zero_node
,
9406 TREE_VALUE (TREE_CHAIN (arglist
)));
9408 case 0: /* length is 1, call fputc. */
9410 const char *p
= c_getstr (TREE_VALUE (arglist
));
9414 /* New argument list transforming fputs(string, stream) to
9415 fputc(string[0], stream). */
9416 arglist
= build_tree_list (NULL_TREE
,
9417 TREE_VALUE (TREE_CHAIN (arglist
)));
9418 arglist
= tree_cons (NULL_TREE
,
9419 build_int_cst (NULL_TREE
, p
[0]),
9426 case 1: /* length is greater than 1, call fwrite. */
9430 /* If optimizing for size keep fputs. */
9433 string_arg
= TREE_VALUE (arglist
);
9434 /* New argument list transforming fputs(string, stream) to
9435 fwrite(string, 1, len, stream). */
9436 arglist
= build_tree_list (NULL_TREE
,
9437 TREE_VALUE (TREE_CHAIN (arglist
)));
9438 arglist
= tree_cons (NULL_TREE
, len
, arglist
);
9439 arglist
= tree_cons (NULL_TREE
, size_one_node
, arglist
);
9440 arglist
= tree_cons (NULL_TREE
, string_arg
, arglist
);
9448 /* These optimizations are only performed when the result is ignored,
9449 hence there's no need to cast the result to integer_type_node. */
9450 return build_function_call_expr (fn
, arglist
);
9453 /* Fold the new_arg's arguments (ARGLIST). Returns true if there was an error
9454 produced. False otherwise. This is done so that we don't output the error
9455 or warning twice or three times. */
9457 fold_builtin_next_arg (tree arglist
)
9459 tree fntype
= TREE_TYPE (current_function_decl
);
9461 if (TYPE_ARG_TYPES (fntype
) == 0
9462 || (TREE_VALUE (tree_last (TYPE_ARG_TYPES (fntype
)))
9465 error ("%<va_start%> used in function with fixed args");
9470 /* Evidently an out of date version of <stdarg.h>; can't validate
9471 va_start's second argument, but can still work as intended. */
9472 warning (0, "%<__builtin_next_arg%> called without an argument");
9475 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
9476 when we checked the arguments and if needed issued a warning. */
9477 else if (!TREE_CHAIN (arglist
)
9478 || !integer_zerop (TREE_VALUE (arglist
))
9479 || !integer_zerop (TREE_VALUE (TREE_CHAIN (arglist
)))
9480 || TREE_CHAIN (TREE_CHAIN (arglist
)))
9482 tree last_parm
= tree_last (DECL_ARGUMENTS (current_function_decl
));
9483 tree arg
= TREE_VALUE (arglist
);
9485 if (TREE_CHAIN (arglist
))
9487 error ("%<va_start%> used with too many arguments");
9491 /* Strip off all nops for the sake of the comparison. This
9492 is not quite the same as STRIP_NOPS. It does more.
9493 We must also strip off INDIRECT_EXPR for C++ reference
9495 while (TREE_CODE (arg
) == NOP_EXPR
9496 || TREE_CODE (arg
) == CONVERT_EXPR
9497 || TREE_CODE (arg
) == NON_LVALUE_EXPR
9498 || TREE_CODE (arg
) == INDIRECT_REF
)
9499 arg
= TREE_OPERAND (arg
, 0);
9500 if (arg
!= last_parm
)
9502 /* FIXME: Sometimes with the tree optimizers we can get the
9503 not the last argument even though the user used the last
9504 argument. We just warn and set the arg to be the last
9505 argument so that we will get wrong-code because of
9507 warning (0, "second parameter of %<va_start%> not last named argument");
9509 /* We want to verify the second parameter just once before the tree
9510 optimizers are run and then avoid keeping it in the tree,
9511 as otherwise we could warn even for correct code like:
9512 void foo (int i, ...)
9513 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
9514 TREE_VALUE (arglist
) = integer_zero_node
;
9515 TREE_CHAIN (arglist
) = build_tree_list (NULL
, integer_zero_node
);
9521 /* Simplify a call to the sprintf builtin.
9523 Return 0 if no simplification was possible, otherwise return the
9524 simplified form of the call as a tree. If IGNORED is true, it means that
9525 the caller does not use the returned value of the function. */
9528 fold_builtin_sprintf (tree arglist
, int ignored
)
9530 tree call
, retval
, dest
, fmt
;
9531 const char *fmt_str
= NULL
;
9533 /* Verify the required arguments in the original call. We deal with two
9534 types of sprintf() calls: 'sprintf (str, fmt)' and
9535 'sprintf (dest, "%s", orig)'. */
9536 if (!validate_arglist (arglist
, POINTER_TYPE
, POINTER_TYPE
, VOID_TYPE
)
9537 && !validate_arglist (arglist
, POINTER_TYPE
, POINTER_TYPE
, POINTER_TYPE
,
9541 /* Get the destination string and the format specifier. */
9542 dest
= TREE_VALUE (arglist
);
9543 fmt
= TREE_VALUE (TREE_CHAIN (arglist
));
9545 /* Check whether the format is a literal string constant. */
9546 fmt_str
= c_getstr (fmt
);
9547 if (fmt_str
== NULL
)
9553 /* If the format doesn't contain % args or %%, use strcpy. */
9554 if (strchr (fmt_str
, '%') == NULL
)
9556 tree fn
= implicit_built_in_decls
[BUILT_IN_STRCPY
];
9561 /* Convert sprintf (str, fmt) into strcpy (str, fmt) when
9562 'format' is known to contain no % formats. */
9563 arglist
= build_tree_list (NULL_TREE
, fmt
);
9564 arglist
= tree_cons (NULL_TREE
, dest
, arglist
);
9565 call
= build_function_call_expr (fn
, arglist
);
9567 retval
= build_int_cst (NULL_TREE
, strlen (fmt_str
));
9570 /* If the format is "%s", use strcpy if the result isn't used. */
9571 else if (fmt_str
&& strcmp (fmt_str
, "%s") == 0)
9574 fn
= implicit_built_in_decls
[BUILT_IN_STRCPY
];
9579 /* Convert sprintf (str1, "%s", str2) into strcpy (str1, str2). */
9580 orig
= TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist
)));
9581 arglist
= build_tree_list (NULL_TREE
, orig
);
9582 arglist
= tree_cons (NULL_TREE
, dest
, arglist
);
9585 retval
= c_strlen (orig
, 1);
9586 if (!retval
|| TREE_CODE (retval
) != INTEGER_CST
)
9589 call
= build_function_call_expr (fn
, arglist
);
9595 (TREE_TYPE (TREE_TYPE (implicit_built_in_decls
[BUILT_IN_SPRINTF
])),
9597 return build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), call
, retval
);